duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 1 | /* |
xdono | d7a5f9c | 2008-12-15 16:55:25 -0800 | [diff] [blame] | 2 | * Copyright 2000-2008 Sun Microsystems, Inc. All Rights Reserved. |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 | * |
| 5 | * This code is free software; you can redistribute it and/or modify it |
| 6 | * under the terms of the GNU General Public License version 2 only, as |
| 7 | * published by the Free Software Foundation. |
| 8 | * |
| 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| 13 | * accompanied this code). |
| 14 | * |
| 15 | * You should have received a copy of the GNU General Public License version |
| 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 18 | * |
| 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| 21 | * have any questions. |
| 22 | */ |
| 23 | |
| 24 | /* Type-specific source code for unit test |
| 25 | * |
| 26 | * Regenerate the BasicX classes via genBasic.sh whenever this file changes. |
| 27 | * We check in the generated source files so that the test tree can be used |
| 28 | * independently of the rest of the source tree. |
| 29 | */ |
| 30 | |
| 31 | // -- This file was mechanically generated: Do not edit! -- // |
| 32 | |
| 33 | import java.nio.*; |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 34 | import java.lang.reflect.Method; |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 35 | |
| 36 | |
| 37 | public class BasicByte |
| 38 | extends Basic |
| 39 | { |
| 40 | |
| 41 | private static void relGet(ByteBuffer b) { |
| 42 | int n = b.capacity(); |
| 43 | byte v; |
| 44 | for (int i = 0; i < n; i++) |
| 45 | ck(b, (long)b.get(), (long)((byte)ic(i))); |
| 46 | b.rewind(); |
| 47 | } |
| 48 | |
| 49 | private static void relGet(ByteBuffer b, int start) { |
| 50 | int n = b.remaining(); |
| 51 | byte v; |
| 52 | for (int i = start; i < n; i++) |
| 53 | ck(b, (long)b.get(), (long)((byte)ic(i))); |
| 54 | b.rewind(); |
| 55 | } |
| 56 | |
| 57 | private static void absGet(ByteBuffer b) { |
| 58 | int n = b.capacity(); |
| 59 | byte v; |
| 60 | for (int i = 0; i < n; i++) |
| 61 | ck(b, (long)b.get(), (long)((byte)ic(i))); |
| 62 | b.rewind(); |
| 63 | } |
| 64 | |
| 65 | private static void bulkGet(ByteBuffer b) { |
| 66 | int n = b.capacity(); |
| 67 | byte[] a = new byte[n + 7]; |
| 68 | b.get(a, 7, n); |
| 69 | for (int i = 0; i < n; i++) |
| 70 | ck(b, (long)a[i + 7], (long)((byte)ic(i))); |
| 71 | } |
| 72 | |
| 73 | private static void relPut(ByteBuffer b) { |
| 74 | int n = b.capacity(); |
| 75 | b.clear(); |
| 76 | for (int i = 0; i < n; i++) |
| 77 | b.put((byte)ic(i)); |
| 78 | b.flip(); |
| 79 | } |
| 80 | |
| 81 | private static void absPut(ByteBuffer b) { |
| 82 | int n = b.capacity(); |
| 83 | b.clear(); |
| 84 | for (int i = 0; i < n; i++) |
| 85 | b.put(i, (byte)ic(i)); |
| 86 | b.limit(n); |
| 87 | b.position(0); |
| 88 | } |
| 89 | |
| 90 | private static void bulkPutArray(ByteBuffer b) { |
| 91 | int n = b.capacity(); |
| 92 | b.clear(); |
| 93 | byte[] a = new byte[n + 7]; |
| 94 | for (int i = 0; i < n; i++) |
| 95 | a[i + 7] = (byte)ic(i); |
| 96 | b.put(a, 7, n); |
| 97 | b.flip(); |
| 98 | } |
| 99 | |
| 100 | private static void bulkPutBuffer(ByteBuffer b) { |
| 101 | int n = b.capacity(); |
| 102 | b.clear(); |
| 103 | ByteBuffer c = ByteBuffer.allocate(n + 7); |
| 104 | c.position(7); |
| 105 | for (int i = 0; i < n; i++) |
| 106 | c.put((byte)ic(i)); |
| 107 | c.flip(); |
| 108 | c.position(7); |
| 109 | b.put(c); |
| 110 | b.flip(); |
| 111 | } |
| 112 | |
| 113 | //6231529 |
| 114 | private static void callReset(ByteBuffer b) { |
| 115 | b.position(0); |
| 116 | b.mark(); |
| 117 | |
| 118 | b.duplicate().reset(); |
| 119 | b.asReadOnlyBuffer().reset(); |
| 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 | private static void checkSlice(ByteBuffer b, ByteBuffer slice) { |
| 163 | ck(slice, 0, slice.position()); |
| 164 | ck(slice, b.remaining(), slice.limit()); |
| 165 | ck(slice, b.remaining(), slice.capacity()); |
| 166 | if (b.isDirect() != slice.isDirect()) |
| 167 | fail("Lost direction", slice); |
| 168 | if (b.isReadOnly() != slice.isReadOnly()) |
| 169 | fail("Lost read-only", slice); |
| 170 | } |
| 171 | |
| 172 | |
| 173 | |
| 174 | private static void checkBytes(ByteBuffer b, byte[] bs) { |
| 175 | int n = bs.length; |
| 176 | int p = b.position(); |
| 177 | byte v; |
| 178 | if (b.order() == ByteOrder.BIG_ENDIAN) { |
| 179 | for (int i = 0; i < n; i++) |
| 180 | ck(b, b.get(), bs[i]); |
| 181 | } else { |
| 182 | for (int i = n - 1; i >= 0; i--) |
| 183 | ck(b, b.get(), bs[i]); |
| 184 | } |
| 185 | b.position(p); |
| 186 | } |
| 187 | |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 188 | private static void compact(Buffer b) { |
| 189 | try { |
| 190 | Class<?> cl = b.getClass(); |
| 191 | Method m = cl.getDeclaredMethod("compact"); |
| 192 | m.setAccessible(true); |
| 193 | m.invoke(b); |
| 194 | } catch (Exception e) { |
| 195 | fail(e.getMessage(), b); |
| 196 | } |
| 197 | } |
| 198 | |
| 199 | private static void checkInvalidMarkException(final Buffer b) { |
| 200 | tryCatch(b, InvalidMarkException.class, new Runnable() { |
| 201 | public void run() { |
| 202 | b.mark(); |
| 203 | compact(b); |
| 204 | b.reset(); |
| 205 | }}); |
| 206 | } |
| 207 | |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 208 | private static void testViews(int level, ByteBuffer b, boolean direct) { |
| 209 | |
| 210 | ShortBuffer sb = b.asShortBuffer(); |
| 211 | BasicShort.test(level, sb, direct); |
| 212 | checkBytes(b, new byte[] { 0, (byte)ic(0) }); |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 213 | checkInvalidMarkException(sb); |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 214 | |
| 215 | CharBuffer cb = b.asCharBuffer(); |
| 216 | BasicChar.test(level, cb, direct); |
| 217 | checkBytes(b, new byte[] { 0, (byte)ic(0) }); |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 218 | checkInvalidMarkException(cb); |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 219 | |
| 220 | IntBuffer ib = b.asIntBuffer(); |
| 221 | BasicInt.test(level, ib, direct); |
| 222 | checkBytes(b, new byte[] { 0, 0, 0, (byte)ic(0) }); |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 223 | checkInvalidMarkException(ib); |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 224 | |
| 225 | LongBuffer lb = b.asLongBuffer(); |
| 226 | BasicLong.test(level, lb, direct); |
| 227 | checkBytes(b, new byte[] { 0, 0, 0, 0, 0, 0, 0, (byte)ic(0) }); |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 228 | checkInvalidMarkException(lb); |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 229 | |
| 230 | FloatBuffer fb = b.asFloatBuffer(); |
| 231 | BasicFloat.test(level, fb, direct); |
| 232 | checkBytes(b, new byte[] { 0x42, (byte)0xc2, 0, 0 }); |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 233 | checkInvalidMarkException(fb); |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 234 | |
| 235 | DoubleBuffer db = b.asDoubleBuffer(); |
| 236 | BasicDouble.test(level, db, direct); |
| 237 | checkBytes(b, new byte[] { 0x40, 0x58, 0x40, 0, 0, 0, 0, 0 }); |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 238 | checkInvalidMarkException(db); |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 239 | } |
| 240 | |
| 241 | private static void testHet(int level, ByteBuffer b) { |
| 242 | |
| 243 | int p = b.position(); |
| 244 | b.limit(b.capacity()); |
| 245 | show(level, b); |
| 246 | out.print(" put:"); |
| 247 | |
| 248 | b.putChar((char)1); |
| 249 | b.putChar((char)Character.MAX_VALUE); |
| 250 | out.print(" char"); |
| 251 | |
| 252 | b.putShort((short)1); |
| 253 | b.putShort((short)Short.MAX_VALUE); |
| 254 | out.print(" short"); |
| 255 | |
| 256 | b.putInt(1); |
| 257 | b.putInt(Integer.MAX_VALUE); |
| 258 | out.print(" int"); |
| 259 | |
| 260 | b.putLong((long)1); |
| 261 | b.putLong((long)Long.MAX_VALUE); |
| 262 | out.print(" long"); |
| 263 | |
| 264 | b.putFloat((float)1); |
| 265 | b.putFloat((float)Float.MIN_VALUE); |
| 266 | b.putFloat((float)Float.MAX_VALUE); |
| 267 | out.print(" float"); |
| 268 | |
| 269 | b.putDouble((double)1); |
| 270 | b.putDouble((double)Double.MIN_VALUE); |
| 271 | b.putDouble((double)Double.MAX_VALUE); |
| 272 | out.print(" double"); |
| 273 | |
| 274 | out.println(); |
| 275 | b.limit(b.position()); |
| 276 | b.position(p); |
| 277 | show(level, b); |
| 278 | out.print(" get:"); |
| 279 | |
| 280 | ck(b, b.getChar(), 1); |
| 281 | ck(b, b.getChar(), Character.MAX_VALUE); |
| 282 | out.print(" char"); |
| 283 | |
| 284 | ck(b, b.getShort(), 1); |
| 285 | ck(b, b.getShort(), Short.MAX_VALUE); |
| 286 | out.print(" short"); |
| 287 | |
| 288 | ck(b, b.getInt(), 1); |
| 289 | ck(b, b.getInt(), Integer.MAX_VALUE); |
| 290 | out.print(" int"); |
| 291 | |
| 292 | ck(b, b.getLong(), 1); |
| 293 | ck(b, b.getLong(), Long.MAX_VALUE); |
| 294 | out.print(" long"); |
| 295 | |
| 296 | ck(b, (long)b.getFloat(), 1); |
| 297 | ck(b, (long)b.getFloat(), (long)Float.MIN_VALUE); |
| 298 | ck(b, (long)b.getFloat(), (long)Float.MAX_VALUE); |
| 299 | out.print(" float"); |
| 300 | |
| 301 | ck(b, (long)b.getDouble(), 1); |
| 302 | ck(b, (long)b.getDouble(), (long)Double.MIN_VALUE); |
| 303 | ck(b, (long)b.getDouble(), (long)Double.MAX_VALUE); |
| 304 | out.print(" double"); |
| 305 | |
| 306 | out.println(); |
| 307 | |
| 308 | } |
| 309 | |
| 310 | |
| 311 | |
| 312 | private static void tryCatch(Buffer b, Class ex, Runnable thunk) { |
| 313 | boolean caught = false; |
| 314 | try { |
| 315 | thunk.run(); |
| 316 | } catch (Throwable x) { |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 317 | if (ex.isAssignableFrom(x.getClass())) { |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 318 | caught = true; |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 319 | } else { |
| 320 | fail(x.getMessage() + " not expected"); |
| 321 | } |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 322 | } |
| 323 | if (!caught) |
| 324 | fail(ex.getName() + " not thrown", b); |
| 325 | } |
| 326 | |
| 327 | private static void tryCatch(byte [] t, Class ex, Runnable thunk) { |
| 328 | tryCatch(ByteBuffer.wrap(t), ex, thunk); |
| 329 | } |
| 330 | |
| 331 | public static void test(int level, final ByteBuffer b, boolean direct) { |
| 332 | |
| 333 | show(level, b); |
| 334 | |
| 335 | if (direct != b.isDirect()) |
| 336 | fail("Wrong direction", b); |
| 337 | |
| 338 | // Gets and puts |
| 339 | |
| 340 | relPut(b); |
| 341 | relGet(b); |
| 342 | absGet(b); |
| 343 | bulkGet(b); |
| 344 | |
| 345 | absPut(b); |
| 346 | relGet(b); |
| 347 | absGet(b); |
| 348 | bulkGet(b); |
| 349 | |
| 350 | bulkPutArray(b); |
| 351 | relGet(b); |
| 352 | |
| 353 | bulkPutBuffer(b); |
| 354 | relGet(b); |
| 355 | |
| 356 | |
| 357 | |
| 358 | |
| 359 | |
| 360 | |
| 361 | |
| 362 | |
| 363 | |
| 364 | |
| 365 | |
| 366 | |
| 367 | |
| 368 | |
| 369 | |
| 370 | |
| 371 | |
| 372 | |
| 373 | |
| 374 | |
| 375 | |
| 376 | |
| 377 | |
alanb | 4d00396 | 2009-04-15 14:53:34 +0100 | [diff] [blame] | 378 | |
| 379 | |
| 380 | |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 381 | // Compact |
| 382 | |
| 383 | relPut(b); |
| 384 | b.position(13); |
| 385 | b.compact(); |
| 386 | b.flip(); |
| 387 | relGet(b, 13); |
| 388 | |
| 389 | // Exceptions |
| 390 | |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 391 | relPut(b); |
| 392 | b.limit(b.capacity() / 2); |
| 393 | b.position(b.limit()); |
| 394 | |
| 395 | tryCatch(b, BufferUnderflowException.class, new Runnable() { |
| 396 | public void run() { |
| 397 | b.get(); |
| 398 | }}); |
| 399 | |
| 400 | tryCatch(b, BufferOverflowException.class, new Runnable() { |
| 401 | public void run() { |
| 402 | b.put((byte)42); |
| 403 | }}); |
| 404 | |
| 405 | // The index must be non-negative and lesss than the buffer's limit. |
| 406 | tryCatch(b, IndexOutOfBoundsException.class, new Runnable() { |
| 407 | public void run() { |
| 408 | b.get(b.limit()); |
| 409 | }}); |
| 410 | tryCatch(b, IndexOutOfBoundsException.class, new Runnable() { |
| 411 | public void run() { |
| 412 | b.get(-1); |
| 413 | }}); |
| 414 | |
| 415 | tryCatch(b, IndexOutOfBoundsException.class, new Runnable() { |
| 416 | public void run() { |
| 417 | b.put(b.limit(), (byte)42); |
| 418 | }}); |
| 419 | |
alanb | 7d6d567 | 2008-11-25 19:26:54 +0000 | [diff] [blame] | 420 | tryCatch(b, InvalidMarkException.class, new Runnable() { |
| 421 | public void run() { |
| 422 | b.position(0); |
| 423 | b.mark(); |
| 424 | b.compact(); |
| 425 | b.reset(); |
| 426 | }}); |
| 427 | |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 428 | // Values |
| 429 | |
| 430 | b.clear(); |
| 431 | b.put((byte)0); |
| 432 | b.put((byte)-1); |
| 433 | b.put((byte)1); |
| 434 | b.put(Byte.MAX_VALUE); |
| 435 | b.put(Byte.MIN_VALUE); |
| 436 | |
| 437 | |
| 438 | |
| 439 | |
| 440 | |
| 441 | |
| 442 | |
| 443 | |
| 444 | |
| 445 | |
| 446 | |
| 447 | |
| 448 | |
| 449 | |
| 450 | |
| 451 | |
| 452 | |
| 453 | byte v; |
| 454 | b.flip(); |
| 455 | ck(b, b.get(), 0); |
| 456 | ck(b, b.get(), (byte)-1); |
| 457 | ck(b, b.get(), 1); |
| 458 | ck(b, b.get(), Byte.MAX_VALUE); |
| 459 | ck(b, b.get(), Byte.MIN_VALUE); |
| 460 | |
| 461 | |
| 462 | |
| 463 | |
| 464 | |
| 465 | |
| 466 | |
| 467 | |
| 468 | |
| 469 | |
| 470 | |
| 471 | |
| 472 | |
| 473 | |
| 474 | |
| 475 | |
| 476 | |
| 477 | |
| 478 | |
| 479 | |
| 480 | |
| 481 | |
| 482 | // Comparison |
| 483 | b.rewind(); |
| 484 | ByteBuffer b2 = ByteBuffer.allocate(b.capacity()); |
| 485 | b2.put(b); |
| 486 | b2.flip(); |
| 487 | b.position(2); |
| 488 | b2.position(2); |
| 489 | if (!b.equals(b2)) { |
| 490 | for (int i = 2; i < b.limit(); i++) { |
| 491 | byte x = b.get(i); |
| 492 | byte y = b2.get(i); |
| 493 | if (x != y |
| 494 | |
| 495 | |
| 496 | |
| 497 | |
| 498 | |
| 499 | |
| 500 | ) |
| 501 | out.println("[" + i + "] " + x + " != " + y); |
| 502 | } |
| 503 | fail("Identical buffers not equal", b, b2); |
| 504 | } |
| 505 | if (b.compareTo(b2) != 0) |
| 506 | fail("Comparison to identical buffer != 0", b, b2); |
| 507 | |
| 508 | b.limit(b.limit() + 1); |
| 509 | b.position(b.limit() - 1); |
| 510 | b.put((byte)99); |
| 511 | b.rewind(); |
| 512 | b2.rewind(); |
| 513 | if (b.equals(b2)) |
| 514 | fail("Non-identical buffers equal", b, b2); |
| 515 | if (b.compareTo(b2) <= 0) |
| 516 | fail("Comparison to shorter buffer <= 0", b, b2); |
| 517 | b.limit(b.limit() - 1); |
| 518 | |
| 519 | b.put(2, (byte)42); |
| 520 | if (b.equals(b2)) |
| 521 | fail("Non-identical buffers equal", b, b2); |
| 522 | if (b.compareTo(b2) <= 0) |
| 523 | fail("Comparison to lesser buffer <= 0", b, b2); |
| 524 | |
| 525 | // Sub, dup |
| 526 | |
| 527 | relPut(b); |
| 528 | relGet(b.duplicate()); |
| 529 | b.position(13); |
| 530 | relGet(b.duplicate(), 13); |
| 531 | relGet(b.duplicate().slice(), 13); |
| 532 | relGet(b.slice(), 13); |
| 533 | relGet(b.slice().duplicate(), 13); |
| 534 | |
| 535 | // Slice |
| 536 | |
| 537 | b.position(5); |
| 538 | ByteBuffer sb = b.slice(); |
| 539 | checkSlice(b, sb); |
| 540 | b.position(0); |
| 541 | ByteBuffer sb2 = sb.slice(); |
| 542 | checkSlice(sb, sb2); |
| 543 | |
| 544 | if (!sb.equals(sb2)) |
| 545 | fail("Sliced slices do not match", sb, sb2); |
| 546 | if ((sb.hasArray()) && (sb.arrayOffset() != sb2.arrayOffset())) |
| 547 | fail("Array offsets do not match: " |
| 548 | + sb.arrayOffset() + " != " + sb2.arrayOffset(), sb, sb2); |
| 549 | |
| 550 | |
| 551 | |
| 552 | // Views |
| 553 | |
| 554 | b.clear(); |
| 555 | b.order(ByteOrder.BIG_ENDIAN); |
| 556 | testViews(level + 1, b, direct); |
| 557 | |
| 558 | for (int i = 1; i <= 9; i++) { |
| 559 | b.position(i); |
| 560 | show(level + 1, b); |
| 561 | testViews(level + 2, b, direct); |
| 562 | } |
| 563 | |
| 564 | b.position(0); |
| 565 | b.order(ByteOrder.LITTLE_ENDIAN); |
| 566 | testViews(level + 1, b, direct); |
| 567 | |
| 568 | // Heterogeneous accessors |
| 569 | |
| 570 | b.order(ByteOrder.BIG_ENDIAN); |
| 571 | for (int i = 0; i <= 9; i++) { |
| 572 | b.position(i); |
| 573 | testHet(level + 1, b); |
| 574 | } |
| 575 | b.order(ByteOrder.LITTLE_ENDIAN); |
| 576 | b.position(3); |
| 577 | testHet(level + 1, b); |
| 578 | |
| 579 | |
| 580 | |
| 581 | // Read-only views |
| 582 | |
| 583 | b.rewind(); |
| 584 | final ByteBuffer rb = b.asReadOnlyBuffer(); |
| 585 | if (!b.equals(rb)) |
| 586 | fail("Buffer not equal to read-only view", b, rb); |
| 587 | show(level + 1, rb); |
| 588 | |
| 589 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 590 | public void run() { |
| 591 | relPut(rb); |
| 592 | }}); |
| 593 | |
| 594 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 595 | public void run() { |
| 596 | absPut(rb); |
| 597 | }}); |
| 598 | |
| 599 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 600 | public void run() { |
| 601 | bulkPutArray(rb); |
| 602 | }}); |
| 603 | |
| 604 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 605 | public void run() { |
| 606 | bulkPutBuffer(rb); |
| 607 | }}); |
| 608 | |
| 609 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 610 | public void run() { |
| 611 | rb.compact(); |
| 612 | }}); |
| 613 | |
| 614 | |
| 615 | |
| 616 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 617 | public void run() { |
| 618 | rb.putChar((char)1); |
| 619 | }}); |
| 620 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 621 | public void run() { |
| 622 | rb.putChar(0, (char)1); |
| 623 | }}); |
| 624 | |
| 625 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 626 | public void run() { |
| 627 | rb.putShort((short)1); |
| 628 | }}); |
| 629 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 630 | public void run() { |
| 631 | rb.putShort(0, (short)1); |
| 632 | }}); |
| 633 | |
| 634 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 635 | public void run() { |
| 636 | rb.putInt(1); |
| 637 | }}); |
| 638 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 639 | public void run() { |
| 640 | rb.putInt(0, 1); |
| 641 | }}); |
| 642 | |
| 643 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 644 | public void run() { |
| 645 | rb.putLong((long)1); |
| 646 | }}); |
| 647 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 648 | public void run() { |
| 649 | rb.putLong(0, (long)1); |
| 650 | }}); |
| 651 | |
| 652 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 653 | public void run() { |
| 654 | rb.putFloat((float)1); |
| 655 | }}); |
| 656 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 657 | public void run() { |
| 658 | rb.putFloat(0, (float)1); |
| 659 | }}); |
| 660 | |
| 661 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 662 | public void run() { |
| 663 | rb.putDouble((double)1); |
| 664 | }}); |
| 665 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 666 | public void run() { |
| 667 | rb.putDouble(0, (double)1); |
| 668 | }}); |
| 669 | |
| 670 | |
| 671 | |
| 672 | if (rb.getClass().getName().startsWith("java.nio.Heap")) { |
| 673 | |
| 674 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 675 | public void run() { |
| 676 | rb.array(); |
| 677 | }}); |
| 678 | |
| 679 | tryCatch(b, ReadOnlyBufferException.class, new Runnable() { |
| 680 | public void run() { |
| 681 | rb.arrayOffset(); |
| 682 | }}); |
| 683 | |
| 684 | if (rb.hasArray()) |
| 685 | fail("Read-only heap buffer's backing array is accessible", |
| 686 | rb); |
| 687 | |
| 688 | } |
| 689 | |
| 690 | // Bulk puts from read-only buffers |
| 691 | |
| 692 | b.clear(); |
| 693 | rb.rewind(); |
| 694 | b.put(rb); |
| 695 | |
| 696 | |
| 697 | // For byte buffers, test both the direct and non-direct cases |
| 698 | ByteBuffer ob |
| 699 | = (b.isDirect() |
| 700 | ? ByteBuffer.allocate(rb.capacity()) |
| 701 | : ByteBuffer.allocateDirect(rb.capacity())); |
| 702 | rb.rewind(); |
| 703 | ob.put(rb); |
| 704 | |
| 705 | |
| 706 | relPut(b); // Required by testViews |
| 707 | |
| 708 | } |
| 709 | |
| 710 | |
| 711 | |
| 712 | |
| 713 | |
| 714 | |
| 715 | |
| 716 | |
| 717 | |
| 718 | |
| 719 | |
| 720 | |
| 721 | |
| 722 | |
| 723 | |
| 724 | |
| 725 | |
| 726 | |
| 727 | |
| 728 | |
| 729 | |
| 730 | |
| 731 | |
| 732 | |
| 733 | |
| 734 | |
| 735 | |
| 736 | |
| 737 | |
| 738 | |
| 739 | |
| 740 | |
| 741 | |
| 742 | |
| 743 | |
| 744 | |
| 745 | |
| 746 | |
| 747 | |
| 748 | |
| 749 | |
| 750 | |
| 751 | |
| 752 | |
| 753 | |
| 754 | |
| 755 | |
| 756 | |
| 757 | |
| 758 | |
| 759 | |
| 760 | |
| 761 | |
| 762 | |
| 763 | |
| 764 | |
| 765 | |
| 766 | |
| 767 | |
| 768 | |
| 769 | |
| 770 | |
| 771 | |
| 772 | |
| 773 | |
| 774 | |
| 775 | |
| 776 | |
| 777 | |
| 778 | |
| 779 | |
| 780 | |
| 781 | |
| 782 | |
| 783 | |
| 784 | |
| 785 | |
| 786 | |
| 787 | |
| 788 | |
| 789 | |
| 790 | |
| 791 | |
alanb | 4d00396 | 2009-04-15 14:53:34 +0100 | [diff] [blame] | 792 | |
| 793 | |
duke | 6e45e10 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 794 | public static void test(final byte [] ba) { |
| 795 | int offset = 47; |
| 796 | int length = 900; |
| 797 | final ByteBuffer b = ByteBuffer.wrap(ba, offset, length); |
| 798 | show(0, b); |
| 799 | ck(b, b.capacity(), ba.length); |
| 800 | ck(b, b.position(), offset); |
| 801 | ck(b, b.limit(), offset + length); |
| 802 | |
| 803 | // The offset must be non-negative and no larger than <array.length>. |
| 804 | tryCatch(ba, IndexOutOfBoundsException.class, new Runnable() { |
| 805 | public void run() { |
| 806 | ByteBuffer.wrap(ba, -1, ba.length); |
| 807 | }}); |
| 808 | tryCatch(ba, IndexOutOfBoundsException.class, new Runnable() { |
| 809 | public void run() { |
| 810 | ByteBuffer.wrap(ba, ba.length + 1, ba.length); |
| 811 | }}); |
| 812 | tryCatch(ba, IndexOutOfBoundsException.class, new Runnable() { |
| 813 | public void run() { |
| 814 | ByteBuffer.wrap(ba, 0, -1); |
| 815 | }}); |
| 816 | tryCatch(ba, IndexOutOfBoundsException.class, new Runnable() { |
| 817 | public void run() { |
| 818 | ByteBuffer.wrap(ba, 0, ba.length + 1); |
| 819 | }}); |
| 820 | |
| 821 | // A NullPointerException will be thrown if the array is null. |
| 822 | tryCatch(ba, NullPointerException.class, new Runnable() { |
| 823 | public void run() { |
| 824 | ByteBuffer.wrap((byte []) null, 0, 5); |
| 825 | }}); |
| 826 | tryCatch(ba, NullPointerException.class, new Runnable() { |
| 827 | public void run() { |
| 828 | ByteBuffer.wrap((byte []) null); |
| 829 | }}); |
| 830 | } |
| 831 | |
| 832 | private static void testAllocate() { |
| 833 | // An IllegalArgumentException will be thrown for negative capacities. |
| 834 | tryCatch((Buffer) null, IllegalArgumentException.class, new Runnable() { |
| 835 | public void run() { |
| 836 | ByteBuffer.allocate(-1); |
| 837 | }}); |
| 838 | |
| 839 | tryCatch((Buffer) null, IllegalArgumentException.class, new Runnable() { |
| 840 | public void run() { |
| 841 | ByteBuffer.allocateDirect(-1); |
| 842 | }}); |
| 843 | |
| 844 | } |
| 845 | |
| 846 | public static void test() { |
| 847 | testAllocate(); |
| 848 | test(0, ByteBuffer.allocate(7 * 1024), false); |
| 849 | test(0, ByteBuffer.wrap(new byte[7 * 1024], 0, 7 * 1024), false); |
| 850 | test(new byte[1024]); |
| 851 | |
| 852 | ByteBuffer b = ByteBuffer.allocateDirect(7 * 1024); |
| 853 | for (b.position(0); b.position() < b.limit(); ) |
| 854 | ck(b, b.get(), 0); |
| 855 | test(0, b, true); |
| 856 | |
| 857 | |
| 858 | |
| 859 | |
| 860 | |
| 861 | callReset(ByteBuffer.allocate(10)); |
| 862 | |
| 863 | |
| 864 | |
| 865 | |
| 866 | |
| 867 | } |
| 868 | |
| 869 | } |