/*
* 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 4862382 4862408
* @summary Test positional read method of FileChannel
*/
/**
* Testing FileChannel's positional read method.
*/
public class Pread {
genericTest();
testNegativePosition(); // This test for bug 4862382
testUnreadableChannel();// This test for bug 4862408
}
// This test for bug 4862382
blah.deleteOnExit();
try {
throw new RuntimeException("Expected exception not thrown");
} catch(IllegalArgumentException e) {
// Correct result
} finally {
}
}
// This test for bug 4862408
blah.deleteOnExit();
try {
try {
throw new RuntimeException("Expected exception not thrown");
} catch(NonReadableChannelException e) {
// Correct result
}
} finally {
}
}
blah.deleteOnExit();
for (int x=0; x<100; x++) {
long originalPosition = c.position();
int totalRead = 0;
while (totalRead < 4) {
if (read < 0)
throw new Exception("Read failed");
}
long newPosition = c.position();
for (int i=0; i<4; i++) {
}
if (result != expectedResult) {
throw new Exception("Read test failed");
}
// Ensure that file pointer position has not changed
if (originalPosition != newPosition)
throw new Exception("File position modified");
}
c.close();
}
/**
* Creates file blah:
* 0000
* 0001
* 0002
* 0003
* .
* .
* .
* 3999
*
* Blah extends beyond a single page of memory so that the
* ability to index into a file of multiple pages is tested.
*/
for(int i=0; i<4000; i++) {
}
}
}