1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396
|
/*
* Copyright (c) 2010, 2016, 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
* @summary Stochastic test of charset-based streams
* @key randomness
*/
import java.io.*;
import java.util.*;
import java.nio.*;
import java.nio.channels.*;
import java.nio.charset.*;
public class BashStreams {
static final PrintStream log = System.err;
static class CharacterGenerator {
private final Random rand;
private final int max;
private final int limit;
private int count = 0;
CharacterGenerator(long seed, String csn, int limit) {
rand = new Random(seed);
this.max = Character.MAX_CODE_POINT + 1;
this.limit = limit;
}
private char[] saved = new char[10];
private int savedCount = 0;
void push(char c) {
saved[savedCount++] = c;
count--;
}
int count() {
return count;
}
boolean hasNext() {
return count < limit;
}
char next() {
if (count >= limit)
throw new RuntimeException("EOF");
if (savedCount > 0) {
savedCount--;
count++;
return saved[savedCount];
}
int c;
for (;;) {
c = rand.nextInt(max);
if ((Character.isBmpCodePoint(c)
&& (Character.isSurrogate((char) c)
|| (c == 0xfffe) || (c == 0xffff))))
continue;
if (Character.isSupplementaryCodePoint(c)
&& (count == limit - 1))
continue;
break;
}
count++;
if (Character.isSupplementaryCodePoint(c)) {
count++;
push(Character.lowSurrogate(c));
return Character.highSurrogate(c);
}
return (char)c;
}
}
static void mismatch(String csn, int count, char c, char d) {
throw new RuntimeException(csn + ": Mismatch at count "
+ count
+ ": " + Integer.toHexString(c)
+ " != "
+ Integer.toHexString(d));
}
static void mismatchedEOF(String csn, int count, int cgCount) {
throw new RuntimeException(csn + ": Mismatched EOFs: "
+ count
+ " != "
+ cgCount);
}
static class Sink // One abomination...
extends OutputStream
implements WritableByteChannel
{
private final String csn;
private final CharacterGenerator cg;
private int count = 0;
Sink(String csn, long seed) {
this.csn = csn;
this.cg = new CharacterGenerator(seed, csn, Integer.MAX_VALUE);
}
public void write(int b) throws IOException {
write (new byte[] { (byte)b }, 0, 1);
}
private int check(byte[] ba, int off, int len) throws IOException {
String s = new String(ba, off, len, csn);
int n = s.length();
for (int i = 0; i < n; i++) {
char c = s.charAt(i);
char d = cg.next();
if (c != d) {
if (c == '?') {
if (Character.isHighSurrogate(d))
cg.next();
continue;
}
mismatch(csn, count + i, c, d);
}
}
count += n;
return len;
}
public void write(byte[] ba, int off, int len) throws IOException {
check(ba, off, len);
}
public int write(ByteBuffer bb) throws IOException {
int n = check(bb.array(),
bb.arrayOffset() + bb.position(),
bb.remaining());
bb.position(bb.position() + n);
return n;
}
public void close() {
count = -1;
}
public boolean isOpen() {
return count >= 0;
}
}
static void testWrite(String csn, int limit, long seed, Writer w)
throws IOException
{
Random rand = new Random(seed);
CharacterGenerator cg = new CharacterGenerator(seed, csn,
Integer.MAX_VALUE);
int count = 0;
char[] ca = new char[16384];
int n = 0;
while (count < limit) {
n = rand.nextInt(ca.length);
for (int i = 0; i < n; i++)
ca[i] = cg.next();
w.write(ca, 0, n);
count += n;
}
if (Character.isHighSurrogate(ca[n - 1]))
w.write(cg.next());
w.close();
}
static void testStreamWrite(String csn, int limit, long seed)
throws IOException
{
log.println(" write stream");
testWrite(csn, limit, seed,
new OutputStreamWriter(new Sink(csn, seed), csn));
}
static void testChannelWrite(String csn, int limit, long seed)
throws IOException
{
log.println(" write channel");
testWrite(csn, limit, seed,
Channels.newWriter(new Sink(csn, seed),
Charset.forName(csn)
.newEncoder()
.onMalformedInput(CodingErrorAction.REPLACE)
.onUnmappableCharacter(CodingErrorAction.REPLACE),
8192));
}
static class Source // ... and another
extends InputStream
implements ReadableByteChannel
{
private final String csn;
private final CharsetEncoder enc;
private final CharacterGenerator cg;
private int count = 0;
Source(String csn, long seed, int limit) {
this.csn = csn.startsWith("\1") ? csn.substring(1) : csn;
this.enc = Charset.forName(this.csn).newEncoder()
.onMalformedInput(CodingErrorAction.REPLACE)
.onUnmappableCharacter(CodingErrorAction.REPLACE);
this.cg = new CharacterGenerator(seed, csn, limit);
}
public int read() throws IOException {
byte[] b = new byte[1];
read(b);
return b[0];
}
private CharBuffer cb = CharBuffer.allocate(8192);
private ByteBuffer bb = null;
public int read(byte[] ba, int off, int len) throws IOException {
if (!cg.hasNext())
return -1;
int end = off + len;
int i = off;
while (i < end) {
if ((bb == null) || !bb.hasRemaining()) {
cb.clear();
while (cb.hasRemaining()) {
if (!cg.hasNext())
break;
char c = cg.next();
if (Character.isHighSurrogate(c)
&& cb.remaining() == 1) {
cg.push(c);
break;
}
cb.put(c);
}
cb.flip();
if (!cb.hasRemaining())
break;
bb = enc.encode(cb);
}
int d = Math.min(bb.remaining(), end - i);
bb.get(ba, i, d);
i += d;
}
return i - off;
}
public int read(ByteBuffer bb) throws IOException {
int n = read(bb.array(),
bb.arrayOffset() + bb.position(),
bb.remaining());
if (n >= 0)
bb.position(bb.position() + n);
return n;
}
public void close() {
count = -1;
}
public boolean isOpen() {
return count != -1;
}
}
static void testRead(String csn, int limit, long seed, int max,
Reader rd)
throws IOException
{
Random rand = new Random(seed);
CharacterGenerator cg = new CharacterGenerator(seed, csn, limit);
int count = 0;
char[] ca = new char[16384];
int n = 0;
while (count < limit) {
int rn = rand.nextInt(ca.length);
n = rd.read(ca, 0, rn);
if (n < 0)
break;
for (int i = 0; i < n; i++) {
char c = ca[i];
if (!cg.hasNext())
mismatchedEOF(csn, count + i, cg.count());
char d = cg.next();
if (c == '?') {
if (Character.isHighSurrogate(d)) {
cg.next();
continue;
}
if (d > max)
continue;
}
if (c != d)
mismatch(csn, count + i, c, d);
}
count += n;
}
if (cg.hasNext())
mismatchedEOF(csn, count, cg.count());
rd.close();
}
static void testStreamRead(String csn, int limit, long seed, int max)
throws IOException
{
log.println(" read stream");
testRead(csn, limit, seed, max,
new InputStreamReader(new Source(csn, seed, limit), csn));
}
static void testChannelRead(String csn, int limit, long seed, int max)
throws IOException
{
log.println(" read channel");
testRead(csn, limit, seed, max,
Channels.newReader(new Source(csn, seed, limit), csn));
}
static final int LIMIT = 1 << 21;
static void test(String csn, int limit, long seed, int max)
throws Exception
{
log.println();
log.println(csn);
testStreamWrite(csn, limit, seed);
testChannelWrite(csn, limit, seed);
testStreamRead(csn, limit, seed, max);
testChannelRead(csn, limit, seed, max);
}
public static void main(String[] args) throws Exception {
if (System.getProperty("os.arch").equals("ia64")) {
// This test requires 54 minutes on an Itanium-1 processor
return;
}
int ai = 0, an = args.length;
int limit;
if (ai < an)
limit = 1 << Integer.parseInt(args[ai++]);
else
limit = LIMIT;
log.println("limit = " + limit);
long seed;
if (ai < an)
seed = Long.parseLong(args[ai++]);
else
seed = System.currentTimeMillis();
log.println("seed = " + seed);
test("UTF-8", limit, seed, Integer.MAX_VALUE);
test("US-ASCII", limit, seed, 0x7f);
test("ISO-8859-1", limit, seed, 0xff);
}
}
|