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 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
|
/*
* Copyright (c) 2017, 2018, 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.
*/
import java.nio.ByteBuffer;
import java.util.List;
import java.util.Random;
import java.util.concurrent.CompletableFuture;
import java.util.concurrent.CompletionStage;
import java.util.concurrent.Executor;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Flow;
import java.util.concurrent.Flow.Subscription;
import java.util.concurrent.SubmissionPublisher;
import java.util.function.BiConsumer;
import java.net.http.HttpResponse.BodyHandler;
import java.net.http.HttpResponse.BodyHandlers;
import java.net.http.HttpResponse.BodySubscriber;
import java.net.http.HttpResponse.BodySubscribers;
import jdk.test.lib.RandomFactory;
import org.testng.annotations.DataProvider;
import org.testng.annotations.Test;
import static java.lang.Long.MAX_VALUE;
import static java.lang.Long.min;
import static java.lang.System.out;
import static java.util.concurrent.CompletableFuture.delayedExecutor;
import static java.util.concurrent.TimeUnit.MILLISECONDS;
import static org.testng.Assert.*;
/*
* @test
* @bug 8184285
* @summary Direct test for HttpResponse.BodySubscriber.buffering() API
* @key randomness
* @library /test/lib
* @build jdk.test.lib.RandomFactory
* @run testng/othervm -Djdk.internal.httpclient.debug=true BufferingSubscriberTest
*/
public class BufferingSubscriberTest {
// If we compute that a test will take less that 10s
// we judge it acceptable
static final long LOWER_THRESHOLD = 10_000; // 10 sec.
// If we compute that a test will take more than 20 sec
// we judge it problematic: we will try to adjust the
// buffer sizes, and if we can't we will print a warning
static final long UPPER_THRESHOLD = 20_000; // 20 sec.
static final Random random = RandomFactory.getRandom();
static final long start = System.nanoTime();
static final String START = "start";
static final String END = "end ";
static long elapsed() { return (System.nanoTime() - start)/1000_000;}
static void printStamp(String what, String fmt, Object... args) {
long elapsed = elapsed();
long sec = elapsed/1000;
long ms = elapsed % 1000;
String time = sec > 0 ? sec + "sec " : "";
time = time + ms + "ms";
out.println(what + "\t ["+time+"]\t "+ String.format(fmt,args));
}
@DataProvider(name = "negatives")
public Object[][] negatives() {
return new Object[][] { { 0 }, { -1 }, { -1000 } };
}
@Test(dataProvider = "negatives", expectedExceptions = IllegalArgumentException.class)
public void subscriberThrowsIAE(int bufferSize) {
printStamp(START, "subscriberThrowsIAE(%d)", bufferSize);
try {
BodySubscriber<?> bp = BodySubscribers.ofByteArray();
BodySubscribers.buffering(bp, bufferSize);
} finally {
printStamp(END, "subscriberThrowsIAE(%d)", bufferSize);
}
}
@Test(dataProvider = "negatives", expectedExceptions = IllegalArgumentException.class)
public void handlerThrowsIAE(int bufferSize) {
printStamp(START, "handlerThrowsIAE(%d)", bufferSize);
try {
BodyHandler<?> bp = BodyHandlers.ofByteArray();
BodyHandlers.buffering(bp, bufferSize);
} finally {
printStamp(END, "handlerThrowsIAE(%d)", bufferSize);
}
}
// ---
@DataProvider(name = "config")
public Object[][] config() {
return new Object[][] {
// iterations delayMillis numBuffers bufferSize maxBufferSize minBufferSize
{ 1, 0, 1, 1, 2, 1 },
{ 1, 5, 1, 100, 2, 1 },
{ 1, 0, 1, 10, 1000, 1 },
{ 1, 10, 1, 10, 1000, 1 },
{ 1, 0, 1, 1000, 1000, 10 },
{ 1, 0, 10, 1000, 1000, 50 },
{ 1, 0, 1000, 10 , 1000, 50 },
{ 1, 100, 1, 1000 * 4, 1000, 50 },
{ 100, 0, 1000, 1, 2, 1 },
{ 3, 0, 4, 5006, 1000, 50 },
{ 20, 0, 100, 4888, 1000, 100 },
{ 16, 10, 1000, 50 , 1000, 100 },
{ 16, 10, 1000, 50 , 657, 657 },
};
}
@Test(dataProvider = "config")
public void test(int iterations,
int delayMillis,
int numBuffers,
int bufferSize,
int maxBufferSize,
int minbufferSize) {
for (long perRequestAmount : new long[] { 1L, MAX_VALUE })
test(iterations,
delayMillis,
numBuffers,
bufferSize,
maxBufferSize,
minbufferSize,
perRequestAmount);
}
volatile boolean onNextThrew;
BiConsumer<Flow.Subscriber<?>, ? super Throwable> onNextThrowHandler =
(sub, ex) -> {
onNextThrew = true;
System.out.println("onNext threw " + ex);
ex.printStackTrace();
};
public void test(int iterations,
int delayMillis,
int numBuffers,
int bufferSize,
int maxBufferSize,
int minBufferSize,
long requestAmount) {
ExecutorService executor = Executors.newFixedThreadPool(1);
try {
out.printf("Iterations %d\n", iterations);
for (int i=0; i<iterations; i++ ) {
printStamp(START, "Iteration %d", i);
try {
SubmissionPublisher<List<ByteBuffer>> publisher =
new SubmissionPublisher<>(executor,
1, // lock-step with the publisher, for now
onNextThrowHandler);
CompletableFuture<?> cf = sink(publisher,
delayMillis,
numBuffers * bufferSize,
requestAmount,
maxBufferSize,
minBufferSize);
source(publisher, numBuffers, bufferSize);
publisher.close();
cf.join();
} finally {
printStamp(END, "Iteration %d\n", i);
}
}
assertFalse(onNextThrew, "Unexpected onNextThrew, check output");
out.println("OK");
} finally {
executor.shutdown();
}
}
static long accumulatedDataSize(List<ByteBuffer> bufs) {
return bufs.stream().mapToLong(ByteBuffer::remaining).sum();
}
/** Returns a new BB with its contents set to monotonically increasing
* values, staring at the given start index and wrapping every 100. */
static ByteBuffer allocateBuffer(int size, int startIdx) {
ByteBuffer b = ByteBuffer.allocate(size);
for (int i=0; i<size; i++)
b.put((byte)((startIdx + i) % 100));
b.position(0);
return b;
}
static class TestSubscriber implements BodySubscriber<Integer> {
final int delayMillis;
final int bufferSize;
final int expectedTotalSize;
final long requestAmount;
final CompletableFuture<Integer> completion;
final Executor delayedExecutor;
volatile Flow.Subscription subscription;
TestSubscriber(int bufferSize,
int delayMillis,
int expectedTotalSize,
long requestAmount) {
this.bufferSize = bufferSize;
this.completion = new CompletableFuture<>();
this.delayMillis = delayMillis;
this.delayedExecutor = delayedExecutor(delayMillis, MILLISECONDS);
this.expectedTotalSize = expectedTotalSize;
this.requestAmount = requestAmount;
}
/**
* Example of a factory method which would decorate a buffering
* subscriber to create a new subscriber dependent on buffering capability.
* <p>
* The integer type parameter simulates the body just by counting the
* number of bytes in the body.
*/
static BodySubscriber<Integer> createSubscriber(int bufferSize,
int delay,
int expectedTotalSize,
long requestAmount) {
TestSubscriber s = new TestSubscriber(bufferSize,
delay,
expectedTotalSize,
requestAmount);
return BodySubscribers.buffering(s, bufferSize);
}
private void requestMore() {
subscription.request(requestAmount);
}
@Override
public void onSubscribe(Subscription subscription) {
assertNull(this.subscription);
this.subscription = subscription;
if (delayMillis > 0)
delayedExecutor.execute(this::requestMore);
else
requestMore();
}
volatile int wrongSizes;
volatile int totalBytesReceived;
volatile int onNextInvocations;
volatile long lastSeenSize = -1;
volatile boolean noMoreOnNext; // false
volatile int index; // 0
volatile long count;
@Override
public void onNext(List<ByteBuffer> items) {
try {
long sz = accumulatedDataSize(items);
boolean printStamp = delayMillis > 0
&& requestAmount < Long.MAX_VALUE
&& count % 20 == 0;
if (printStamp) {
printStamp("stamp", "count=%d sz=%d accumulated=%d",
count, sz, (totalBytesReceived + sz));
}
count++;
onNextInvocations++;
assertNotEquals(sz, 0L, "Unexpected empty buffers");
items.stream().forEach(b -> assertEquals(b.position(), 0));
assertFalse(noMoreOnNext);
if (sz != bufferSize) {
String msg = sz + ", should be less than bufferSize, " + bufferSize;
assertTrue(sz < bufferSize, msg);
assertTrue(lastSeenSize == -1 || lastSeenSize == bufferSize);
noMoreOnNext = true;
wrongSizes++;
printStamp("onNext",
"Possibly received last buffer: sz=%d, accumulated=%d, total=%d",
sz, totalBytesReceived, totalBytesReceived + sz);
} else {
assertEquals(sz, bufferSize, "Expected to receive exactly bufferSize");
}
lastSeenSize = sz;
// Ensure expected contents
for (ByteBuffer b : items) {
while (b.hasRemaining()) {
assertEquals(b.get(), (byte) (index % 100));
index++;
}
}
totalBytesReceived += sz;
assertEquals(totalBytesReceived, index);
if (delayMillis > 0 && ((expectedTotalSize - totalBytesReceived) > bufferSize))
delayedExecutor.execute(this::requestMore);
else
requestMore();
} catch (Throwable t) {
completion.completeExceptionally(t);
}
}
@Override
public void onError(Throwable throwable) {
completion.completeExceptionally(throwable);
}
@Override
public void onComplete() {
if (wrongSizes > 1) { // allow just the final item to be smaller
String msg = "Wrong sizes. Expected no more than 1. [" + this + "]";
completion.completeExceptionally(new Throwable(msg));
}
if (totalBytesReceived != expectedTotalSize) {
String msg = "Wrong number of bytes. [" + this + "]";
completion.completeExceptionally(new Throwable(msg));
} else {
completion.complete(totalBytesReceived);
}
}
@Override
public CompletionStage<Integer> getBody() {
return completion;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append(super.toString());
sb.append(", bufferSize=").append(bufferSize);
sb.append(", onNextInvocations=").append(onNextInvocations);
sb.append(", totalBytesReceived=").append(totalBytesReceived);
sb.append(", expectedTotalSize=").append(expectedTotalSize);
sb.append(", requestAmount=").append(requestAmount);
sb.append(", lastSeenSize=").append(lastSeenSize);
sb.append(", wrongSizes=").append(wrongSizes);
sb.append(", index=").append(index);
return sb.toString();
}
}
/**
* Publishes data, through the given publisher, using the main thread.
*
* Note: The executor supplied when creating the SubmissionPublisher provides
* the threads for executing the Subscribers.
*
* @param publisher the publisher
* @param numBuffers the number of buffers to send ( before splitting in two )
* @param bufferSize the total size of the data to send ( before splitting in two )
*/
static void source(SubmissionPublisher<List<ByteBuffer>> publisher,
int numBuffers,
int bufferSize) {
printStamp("source","Publishing %d buffers of size %d each", numBuffers, bufferSize);
int index = 0;
for (int i=0; i<numBuffers; i++) {
int chunkSize = random.nextInt(bufferSize);
ByteBuffer buf1 = allocateBuffer(chunkSize, index);
index += chunkSize;
ByteBuffer buf2 = allocateBuffer(bufferSize - chunkSize, index);
index += bufferSize - chunkSize;
publisher.submit(List.of(buf1, buf2));
}
printStamp("source", "complete");
}
/**
* Creates and subscribes Subscribers that receive data from the given
* publisher.
*
* @param publisher the publisher
* @param delayMillis time, in milliseconds, to delay the Subscription
* requesting more bytes ( for simulating slow consumption )
* @param expectedTotalSize the total number of bytes expected to be received
* by the subscribers
* @return a CompletableFuture which completes when the subscription is complete
*/
static CompletableFuture<?> sink(SubmissionPublisher<List<ByteBuffer>> publisher,
int delayMillis,
int expectedTotalSize,
long requestAmount,
int maxBufferSize,
int minBufferSize) {
int bufferSize = chooseBufferSize(maxBufferSize,
minBufferSize,
delayMillis,
expectedTotalSize,
requestAmount);
assert bufferSize > 0;
assert bufferSize >= minBufferSize;
assert bufferSize <= maxBufferSize;
BodySubscriber<Integer> sub = TestSubscriber.createSubscriber(bufferSize,
delayMillis,
expectedTotalSize,
requestAmount);
publisher.subscribe(sub);
printStamp("sink","Subscriber reads data with buffer size: %d", bufferSize);
out.printf("Subscription delay is %d msec\n", delayMillis);
long delay = (((long)delayMillis * expectedTotalSize) / bufferSize) / requestAmount;
out.printf("Minimum total delay is %d sec %d ms\n", delay / 1000, delay % 1000);
out.printf("Request amount is %d items\n", requestAmount);
return sub.getBody().toCompletableFuture();
}
static int chooseBufferSize(int maxBufferSize,
int minBufferSize,
int delaysMillis,
int expectedTotalSize,
long requestAmount) {
assert minBufferSize > 0 && maxBufferSize > 0 && requestAmount > 0;
int bufferSize = maxBufferSize == minBufferSize ? maxBufferSize :
(random.nextInt(maxBufferSize - minBufferSize)
+ minBufferSize);
if (requestAmount == Long.MAX_VALUE) return bufferSize;
long minDelay = (((long)delaysMillis * expectedTotalSize) / maxBufferSize)
/ requestAmount;
long maxDelay = (((long)delaysMillis * expectedTotalSize) / minBufferSize)
/ requestAmount;
// if the maximum delay is < 10s just take a random number between min and max.
if (maxDelay <= LOWER_THRESHOLD) {
return bufferSize;
}
// if minimum delay is greater than 20s then print a warning and use max buffer.
if (minDelay >= UPPER_THRESHOLD) {
System.out.println("Warning: minimum delay is "
+ minDelay/1000 + "sec " + minDelay%1000 + "ms");
System.err.println("Warning: minimum delay is "
+ minDelay/1000 + "sec " + minDelay%1000 + "ms");
return maxBufferSize;
}
// maxDelay could be anything, but minDelay is below the UPPER_THRESHOLD
// try to pick up a buffer size that keeps the delay below the
// UPPER_THRESHOLD
while (minBufferSize < maxBufferSize) {
bufferSize = random.nextInt(maxBufferSize - minBufferSize)
+ minBufferSize;
long delay = (((long)delaysMillis * expectedTotalSize) / bufferSize)
/ requestAmount;
if (delay < UPPER_THRESHOLD) return bufferSize;
minBufferSize++;
}
return minBufferSize;
}
// ---
/* Main entry point for standalone testing of the main functional test. */
public static void main(String... args) {
BufferingSubscriberTest t = new BufferingSubscriberTest();
for (Object[] objs : t.config())
t.test((int)objs[0], (int)objs[1], (int)objs[2], (int)objs[3], (int)objs[4], (int)objs[5]);
}
}
|