-
Notifications
You must be signed in to change notification settings - Fork 252
/
queue-test.c++
1244 lines (983 loc) · 38.2 KB
/
queue-test.c++
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
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
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
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) 2017-2022 Cloudflare, Inc.
// Licensed under the Apache 2.0 license found in the LICENSE file or at:
// https://opensource.org/licenses/Apache-2.0
#include "queue.h"
#include <workerd/jsg/jsg.h>
#include <workerd/jsg/jsg-test.h>
namespace workerd::api {
namespace {
jsg::V8System v8System;
struct QueueContext: public jsg::Object {
JSG_RESOURCE_TYPE(QueueContext) {}
};
JSG_DECLARE_ISOLATE_TYPE(QueueIsolate, QueueContext);
struct Preamble {
QueueIsolate isolate;
QueueIsolate::Lock lock;
v8::HandleScope scope;
v8::Local<v8::Context> context;
v8::Context::Scope contextScope;
Preamble()
: isolate(v8System),
lock(isolate),
scope(lock.v8Isolate),
context(lock.newContext<QueueContext>().getHandle(lock.v8Isolate)),
contextScope(context) {}
jsg::Lock& getJs() { return jsg::Lock::from(lock.v8Isolate); }
};
using ReadContinuation = jsg::Promise<ReadResult>(ReadResult&&);
using CloseContinuation = jsg::Promise<void>(ReadResult&&);
using ReadErrorContinuation = jsg::Promise<ReadResult>(jsg::Value&&);
kj::UnwindDetector unwindDetector;
template <typename Signature>
struct MustCall;
// Used to create a jsg::Promise continuation function that must be called
// at least once during the test. If the function is not called, an error
// will be thrown causing the test to fail.
// TODO(cleanup): Consider adding this to jsg-test.h
template <typename Signature>
struct MustNotCall;
// Used to create a jsg::Promise continuation function that must not be called
// during the test. If the function is called, an error will be thrown causing
// the test to fail.
// TODO(cleanup): Consider adding this to jsg-test.h
template <typename Ret, typename...Args>
struct MustCall<Ret(Args...)> {
using Func = jsg::Function<Ret(Args...)>;
Func fn;
uint expected;
kj::SourceLocation location;
uint called = false;
MustCall(Func fn, uint expected = 1, kj::SourceLocation location = kj::SourceLocation())
: fn(kj::mv(fn)),
expected(expected),
location(location) {}
~MustCall() {
if (!unwindDetector.isUnwinding()) {
KJ_ASSERT(called == expected,
kj::str("MustCall function was not called ", expected,
" times. [actual: ", called , "]"), location);
}
}
Ret operator()(jsg::Lock& js, Args&&... args) {
called++;
return fn(js, kj::fwd<Args...>(args...));
}
};
template <typename Ret, typename...Args>
struct MustNotCall<Ret(Args...)> {
MustNotCall(kj::SourceLocation location = kj::SourceLocation()) : location(location) {}
kj::SourceLocation location;
Ret operator()(jsg::Lock&, Args...args) {
KJ_FAIL_REQUIRE("MustNotCall function was called!", location);
}
};
auto read(jsg::Lock& js, auto& consumer) {
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer.read(js, ValueQueue::ReadRequest { .resolver = kj::mv(prp.resolver) });
return kj::mv(prp.promise);
}
auto byobRead(jsg::Lock& js, auto& consumer, int size) {
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer.read(js, ByteQueue::ReadRequest {
.resolver = kj::mv(prp.resolver),
.pullInto {
.store = jsg::BackingStore::alloc(js, size),
.type = ByteQueue::ReadRequest::Type::BYOB,
},
});
return kj::mv(prp.promise);
};
auto getEntry(jsg::Lock& js, auto size) {
return kj::refcounted<ValueQueue::Entry>(js.v8Ref(v8::True(js.v8Isolate).As<v8::Value>()), size);
}
#pragma region ValueQueue Tests
KJ_TEST("ValueQueue basics work") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
// At this point, there are no consumers, data does not get enqueued.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
queue.push(js, getEntry(js, 1));
// Because there are no consumers, there is no change to backpressure.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
// Closing the queue causes the desiredSize to be zero.
queue.close(js);
try {
queue.push(js, getEntry(js, 1));
KJ_FAIL_ASSERT("The queue push after close should have failed.");
} catch (kj::Exception& ex) {
KJ_ASSERT(ex.getDescription().endsWith("The queue is closed or errored."));
}
KJ_ASSERT(queue.desiredSize() == 0);
KJ_ASSERT(queue.size() == 0);
}
KJ_TEST("ValueQueue erroring works") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
queue.error(js, js.v8Ref(v8::Exception::Error(jsg::v8StrIntern(js.v8Isolate, "boom"_kj))));
KJ_ASSERT(queue.desiredSize() == 0);
try {
queue.push(js, getEntry(js, 1));
KJ_FAIL_ASSERT("The queue push after close should have failed.");
} catch (kj::Exception& ex) {
KJ_ASSERT(ex.getDescription().endsWith("The queue is closed or errored."));
}
}
KJ_TEST("ValueQueue with single consumer") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
ValueQueue::Consumer consumer(queue);
KJ_ASSERT(queue.desiredSize() == 2);
queue.push(js, getEntry(js, 2));
// The item was pushed into the consumer.
KJ_ASSERT(consumer.size() == 2);
// The queue size and desiredSize were updated accordingly.
KJ_ASSERT(queue.size() == 2);
KJ_ASSERT(queue.desiredSize() == 0);
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer.read(js, ValueQueue::ReadRequest { .resolver = kj::mv(prp.resolver) });
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsTrue());
KJ_ASSERT(consumer.size() == 0);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
});
prp.promise.then(js, readContinuation);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ValueQueue with multiple consumers") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
ValueQueue::Consumer consumer1(queue);
ValueQueue::Consumer consumer2(queue);
KJ_ASSERT(queue.desiredSize() == 2);
queue.push(js, getEntry(js, 2));
// The item was pushed into the consumer.
KJ_ASSERT(consumer1.size() == 2);
KJ_ASSERT(consumer2.size() == 2);
// The queue size and desiredSize were updated accordingly.
KJ_ASSERT(queue.size() == 2);
KJ_ASSERT(queue.desiredSize() == 0);
MustCall<ReadContinuation> read1Continuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsTrue());
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 2);
// Backpressure was not relieved since the other consumer has yet to read.
KJ_ASSERT(queue.size() == 2);
KJ_ASSERT(queue.desiredSize() == 0);
return read(js, consumer2);
});
MustCall<ReadContinuation> read2Continuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsTrue());
KJ_ASSERT(consumer2.size() == 0);
// Backpressure was relieved since both consumers have now read.
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
});
MustCall<ReadContinuation> close1Continuation([&](jsg::Lock& js, auto&& result) {
KJ_ASSERT(result.done);
return read(js, consumer2);
});
MustCall<CloseContinuation> close2Continuation([&](jsg::Lock& js, auto&& result) {
KJ_ASSERT(result.done);
return js.resolvedPromise();
});
read(js, consumer1).then(js, read1Continuation)
.then(js, read2Continuation);
js.v8Isolate->PerformMicrotaskCheckpoint();
// Closing the queue causes both consumers to be closed...
queue.close(js);
// After close, the consumers will still be usable, but the queue itself
// has shutdown and no longer reports backpressure.
KJ_ASSERT(queue.desiredSize() == 0);
KJ_ASSERT(queue.size() == 0);
read(js, consumer1).then(js, close1Continuation)
.then(js, close2Continuation);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ValueQueue consumer with multiple-reads") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
ValueQueue::Consumer consumer(queue);
// The first read will produce a value.
MustCall<ReadContinuation> read1Continuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsTrue());
return js.resolvedPromise(kj::mv(result));
});
read(js, consumer).then(js, read1Continuation);
// The second and third reads will both be done = true
MustCall<CloseContinuation> closeContinuation([&](jsg::Lock& js, auto&& result) {
KJ_ASSERT(result.done);
return js.resolvedPromise();
}, 2);
read(js, consumer).then(js, closeContinuation);
read(js, consumer).then(js, closeContinuation);
queue.push(js, getEntry(js, 2));
// Because there is a consumer reading when the push happens, no backpressure
// is applied...
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
queue.close(js);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ValueQueue errors consumer with multiple-reads") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
ValueQueue::Consumer consumer(queue);
MustCall<ReadErrorContinuation> errorContinuation([&](jsg::Lock& js, auto&& value) {
KJ_ASSERT(value.getHandle(js)->IsNativeError());
return js.rejectedPromise<ReadResult>(kj::mv(value));
}, 3);
MustNotCall<ReadContinuation> readContinuation;
read(js, consumer).then(js, readContinuation, errorContinuation);
read(js, consumer).then(js, readContinuation, errorContinuation);
read(js, consumer).then(js, readContinuation, errorContinuation);
queue.error(js, js.v8Ref(v8::Exception::Error(jsg::v8Str(js.v8Isolate, "boom"_kj))));
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ValueQueue with multiple consumers with pending reads") {
Preamble preamble;
auto& js = preamble.getJs();
ValueQueue queue(2);
ValueQueue::Consumer consumer1(queue);
ValueQueue::Consumer consumer2(queue);
KJ_ASSERT(queue.desiredSize() == 2);
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsTrue());
// Both reads were fulfilled immediately without buffering.
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 0);
// Backpressure is not signalled since both consumer reads have been
// fulfilled.
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
}, 2);
read(js, consumer1).then(js, readContinuation);
read(js, consumer2).then(js, readContinuation);
queue.push(js, getEntry(js, 2));
js.v8Isolate->PerformMicrotaskCheckpoint();
}
#pragma endregion ValueQueue Tests
#pragma region ByteQueue Tests
KJ_TEST("ByteQueue basics work") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
// At this point, there are no consumers, data does not get enqueued.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
auto entry = kj::refcounted<ByteQueue::Entry>(jsg::BackingStore::alloc(js, 4));
queue.push(js, kj::mv(entry));
// Because there are no consumers, there is no change to backpressure.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
// Closing the queue causes the desiredSize to be zero.
queue.close(js);
try {
auto entry = kj::refcounted<ByteQueue::Entry>(jsg::BackingStore::alloc(js, 4));
queue.push(js, kj::mv(entry));
KJ_FAIL_ASSERT("The queue push after close should have failed.");
} catch (kj::Exception& ex) {
KJ_ASSERT(ex.getDescription().endsWith("The queue is closed or errored."));
}
KJ_ASSERT(queue.desiredSize() == 0);
KJ_ASSERT(queue.size() == 0);
}
KJ_TEST("ByteQueue erroring works") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
queue.error(js, js.v8Ref(v8::Exception::Error(jsg::v8StrIntern(js.v8Isolate, "boom"_kj))));
KJ_ASSERT(queue.desiredSize() == 0);
try {
auto entry = kj::refcounted<ByteQueue::Entry>(jsg::BackingStore::alloc(js, 4));
queue.push(js, kj::mv(entry));
KJ_FAIL_ASSERT("The queue push after close should have failed.");
} catch (kj::Exception& ex) {
KJ_ASSERT(ex.getDescription().endsWith("The queue is closed or errored."));
}
}
KJ_TEST("ByteQueue with single consumer") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer(queue);
KJ_ASSERT(queue.desiredSize() == 2);
auto store = jsg::BackingStore::alloc(js, 4);
memset(store.asArrayPtr().begin(), 'a', store.size());
auto entry = kj::refcounted<ByteQueue::Entry>(kj::mv(store));
queue.push(js, kj::mv(entry));
// The item was pushed into the consumer.
KJ_ASSERT(consumer.size() == 4);
// The queue size and desiredSize were updated accordingly.
KJ_ASSERT(queue.size() == 4);
KJ_ASSERT(queue.desiredSize() == -2);
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer.read(js, ByteQueue::ReadRequest {
.resolver = kj::mv(prp.resolver),
.pullInto {
.store = jsg::BackingStore::alloc(js, 4),
},
});
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
KJ_ASSERT(source.size() == 4);
KJ_ASSERT(source.asArrayPtr()[0] == 'a');
KJ_ASSERT(source.asArrayPtr()[1] == 'a');
KJ_ASSERT(source.asArrayPtr()[2] == 'a');
KJ_ASSERT(source.asArrayPtr()[3] == 'a');
KJ_ASSERT(consumer.size() == 0);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
});
prp.promise.then(js, readContinuation);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with single byob consumer") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer(queue);
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer.read(js, ByteQueue::ReadRequest {
.resolver = kj::mv(prp.resolver),
.pullInto {
.store = jsg::BackingStore::alloc(js, 4),
.type = ByteQueue::ReadRequest::Type::BYOB,
},
});
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
KJ_ASSERT(ptr[2] == 'b');
KJ_ASSERT(consumer.size() == 0);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
});
prp.promise.then(js, readContinuation);
auto pendingByob = KJ_ASSERT_NONNULL(queue.nextPendingByobReadRequest());
KJ_ASSERT(!pendingByob->isInvalidated());
auto& req = pendingByob->getRequest();
auto ptr = req.pullInto.store.asArrayPtr().begin();
memset(ptr, 'b', 3);
pendingByob->respond(js, 3);
KJ_ASSERT(pendingByob->isInvalidated());
// No backpressure is signaled.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(consumer.size() == 0);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with byob consumer and default consumer") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer1(queue);
ByteQueue::Consumer consumer2(queue);
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer1.read(js, ByteQueue::ReadRequest {
.resolver = kj::mv(prp.resolver),
.pullInto {
.store = jsg::BackingStore::alloc(js, 4),
.type = ByteQueue::ReadRequest::Type::BYOB,
},
});
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
KJ_ASSERT(ptr[2] == 'b');
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 3);
KJ_ASSERT(queue.size() == 3);
KJ_ASSERT(queue.desiredSize() == -1);
return js.resolvedPromise(kj::mv(result));
});
prp.promise.then(js, readContinuation);
auto pendingByob = KJ_ASSERT_NONNULL(queue.nextPendingByobReadRequest());
KJ_ASSERT(!pendingByob->isInvalidated());
auto& req = pendingByob->getRequest();
auto ptr = req.pullInto.store.asArrayPtr().begin();
memset(ptr, 'b', 3);
pendingByob->respond(js, 3);
KJ_ASSERT(pendingByob->isInvalidated());
// Backpressure is signaled because the other consumer hasn't been read from.
KJ_ASSERT(queue.desiredSize() == -1);
KJ_ASSERT(queue.size() == 3);
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 3);
js.v8Isolate->PerformMicrotaskCheckpoint();
MustCall<ReadContinuation> read2Continuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
// The second consumer receives exactly the same data.
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
KJ_ASSERT(ptr[2] == 'b');
// The backpressure in the queue has been resolved.
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
});
auto prp2 = js.newPromiseAndResolver<ReadResult>();
consumer2.read(js, ByteQueue::ReadRequest {
.resolver = kj::mv(prp2.resolver),
.pullInto {
.store = jsg::BackingStore::alloc(js, 4),
.type = ByteQueue::ReadRequest::Type::DEFAULT,
},
});
prp2.promise.then(js, read2Continuation);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with multiple byob consumers") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer1(queue);
ByteQueue::Consumer consumer2(queue);
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
KJ_ASSERT(ptr[2] == 'b');
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 0);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
}, 2);
// Both reads will receive the data despite there being only a single
// byob read responded to.
byobRead(js, consumer1, 4).then(js, readContinuation);
byobRead(js, consumer2, 4).then(js, readContinuation);
auto pendingByob = KJ_ASSERT_NONNULL(queue.nextPendingByobReadRequest());
auto nextPending = KJ_ASSERT_NONNULL(queue.nextPendingByobReadRequest());
KJ_ASSERT(!pendingByob->isInvalidated());
auto& req = pendingByob->getRequest();
auto ptr = req.pullInto.store.asArrayPtr().begin();
memset(ptr, 'b', 3);
pendingByob->respond(js, 3);
KJ_ASSERT(pendingByob->isInvalidated());
// No backpressure is signaled because both reads were fulfilled.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 0);
// The next pendingByobReadRequest was invalidated.
KJ_ASSERT(nextPending->isInvalidated());
KJ_ASSERT(queue.nextPendingByobReadRequest() == nullptr);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with multiple byob consumers") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer1(queue);
ByteQueue::Consumer consumer2(queue);
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
KJ_ASSERT(ptr[2] == 'b');
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 0);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(queue.desiredSize() == 2);
return js.resolvedPromise(kj::mv(result));
}, 2);
// Both reads will receive the data despite there being only a single
// byob read responded to.
byobRead(js, consumer1, 4).then(js, readContinuation);
byobRead(js, consumer2, 4).then(js, readContinuation);
auto pendingByob = KJ_ASSERT_NONNULL(queue.nextPendingByobReadRequest());
auto nextPending = KJ_ASSERT_NONNULL(queue.nextPendingByobReadRequest());
KJ_ASSERT(!pendingByob->isInvalidated());
auto& req = pendingByob->getRequest();
auto ptr = req.pullInto.store.asArrayPtr().begin();
memset(ptr, 'b', 3);
pendingByob->respond(js, 3);
KJ_ASSERT(pendingByob->isInvalidated());
// No backpressure is signaled because both reads were fulfilled.
KJ_ASSERT(queue.desiredSize() == 2);
KJ_ASSERT(queue.size() == 0);
KJ_ASSERT(consumer1.size() == 0);
KJ_ASSERT(consumer2.size() == 0);
// The next pendingByobReadRequest was invalidated.
KJ_ASSERT(nextPending->isInvalidated());
KJ_ASSERT(queue.nextPendingByobReadRequest() == nullptr);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with multiple byob consumers (multi-reads)") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer1(queue);
ByteQueue::Consumer consumer2(queue);
MustCall<ReadContinuation> readConsumer1([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'a');
KJ_ASSERT(ptr[1] == 'a');
KJ_ASSERT(ptr[2] == 'a');
return js.resolvedPromise(kj::mv(result));
});
MustCall<ReadContinuation> readConsumer2([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'a');
KJ_ASSERT(ptr[1] == 'a');
KJ_ASSERT(ptr[2] == 'a');
return byobRead(js, consumer2, 4);
});
MustCall<ReadContinuation> secondReadBothConsumers([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 2);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
return js.resolvedPromise(kj::mv(result));
}, 2);
// All reads will be fulfilled correctly even tho there are only two byob
// reads processed.
byobRead(js, consumer1, 4).then(js, readConsumer1);
byobRead(js, consumer1, 4).then(js, secondReadBothConsumers);
byobRead(js, consumer2, 4).then(js, readConsumer2)
.then(js, secondReadBothConsumers);
// Although there are four distinct reads happening,
// there should only be two actual BYOB requests
// processed by the queue, which will fulfill all four
// reads.
MustCall<void(ByteQueue::ByobReadRequest&)> respond([&](jsg::Lock&, auto& pending) {
static uint counter = 0;
auto& req = pending.getRequest();
auto ptr = req.pullInto.store.asArrayPtr().begin();
auto num = 3 - counter;
memset(ptr, 'a' + counter++, num);
pending.respond(js, num);
KJ_ASSERT(pending.isInvalidated());
}, 2);
kj::Maybe<kj::Own<ByteQueue::ByobReadRequest>> pendingByob;
while ((pendingByob = queue.nextPendingByobReadRequest()) != nullptr) {
auto& pending = KJ_ASSERT_NONNULL(pendingByob);
if (pending->isInvalidated()) {
continue;
}
respond(js, *pending);
}
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with multiple byob consumers (multi-reads, 2)") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer1(queue);
ByteQueue::Consumer consumer2(queue);
MustCall<ReadContinuation> readConsumer1([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'a');
KJ_ASSERT(ptr[1] == 'a');
KJ_ASSERT(ptr[2] == 'a');
return js.resolvedPromise(kj::mv(result));
});
MustCall<ReadContinuation> readConsumer2([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 3);
KJ_ASSERT(ptr[0] == 'a');
KJ_ASSERT(ptr[1] == 'a');
KJ_ASSERT(ptr[2] == 'a');
return byobRead(js, consumer2, 4);
});
MustCall<ReadContinuation> secondReadBothConsumers([&](jsg::Lock& js, auto&& result) -> auto {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
KJ_ASSERT(value.getHandle(js)->IsArrayBufferView());
jsg::BufferSource source(js, value.getHandle(js));
auto ptr = source.asArrayPtr();
KJ_ASSERT(source.size() == 2);
KJ_ASSERT(ptr[0] == 'b');
KJ_ASSERT(ptr[1] == 'b');
return js.resolvedPromise(kj::mv(result));
}, 2);
// All reads will be fulfilled correctly even tho there are only two BYOB reads
// responded to.
byobRead(js, consumer2, 4).then(js, readConsumer2)
.then(js, secondReadBothConsumers);
byobRead(js, consumer1, 4).then(js, readConsumer1);
byobRead(js, consumer1, 4).then(js, secondReadBothConsumers);
// Although there are four distinct reads happening,
// there should only be two actual BYOB requests
// processed by the queue, which will fulfill all four
// reads.
MustCall<void(ByteQueue::ByobReadRequest&)> respond([&](jsg::Lock&, auto& pending) {
static uint counter = 0;
auto& req = pending.getRequest();
auto ptr = req.pullInto.store.asArrayPtr().begin();
auto num = 3 - counter;
memset(ptr, 'a' + counter++, num);
pending.respond(js, num);
KJ_ASSERT(pending.isInvalidated());
}, 2);
kj::Maybe<kj::Own<ByteQueue::ByobReadRequest>> pendingByob;
while ((pendingByob = queue.nextPendingByobReadRequest()) != nullptr) {
auto& pending = KJ_ASSERT_NONNULL(pendingByob);
if (pending->isInvalidated()) {
continue;
}
respond(js, *pending);
}
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with default consumer with atLeast") {
Preamble preamble;
auto& js = preamble.getJs();
ByteQueue queue(2);
ByteQueue::Consumer consumer(queue);
const auto read = [&](jsg::Lock& js, uint atLeast) {
auto prp = js.newPromiseAndResolver<ReadResult>();
consumer.read(js, ByteQueue::ReadRequest {
.resolver = kj::mv(prp.resolver),
.pullInto = {
.store = jsg::BackingStore::alloc(js, 5),
.atLeast = atLeast,
},
});
return kj::mv(prp.promise);
};
const auto push = [&](auto store) {
try {
queue.push(js, kj::refcounted<ByteQueue::Entry>(kj::mv(store)));
} catch (kj::Exception& ex) {
KJ_DBG(ex.getDescription());
}
};
MustCall<ReadContinuation> readContinuation([&](jsg::Lock& js, auto&& result) {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
auto view = value.getHandle(js);
KJ_ASSERT(view->IsArrayBufferView());
jsg::BufferSource source(js, view);
auto ptr = source.asArrayPtr();
KJ_ASSERT(ptr[0] == 1);
KJ_ASSERT(ptr[1] == 2);
KJ_ASSERT(ptr[2] == 3);
KJ_ASSERT(ptr[3] == 4);
KJ_ASSERT(ptr[4] == 5);
KJ_ASSERT(source.size(), 5);
KJ_ASSERT(consumer.size(), 1);
return read(js, 1);
});
MustCall<ReadContinuation> read2Continuation([&](jsg::Lock& js, auto&& result) {
KJ_ASSERT(!result.done);
auto& value = KJ_ASSERT_NONNULL(result.value);
auto view = value.getHandle(js);
KJ_ASSERT(view->IsArrayBufferView());
jsg::BufferSource source(js, view);
KJ_ASSERT(source.asArrayPtr()[0], 6);
KJ_ASSERT(source.size() == 1);
return js.resolvedPromise(kj::mv(result));
});
read(js, 5).then(js, readContinuation)
.then(js, read2Continuation);
auto store1 = jsg::BackingStore::alloc(js, 2);
store1.asArrayPtr()[0] = 1;
store1.asArrayPtr()[1] = 2;
push(kj::mv(store1));
KJ_ASSERT(queue.desiredSize() == 0);
auto store2 = jsg::BackingStore::alloc(js, 2);
store2.asArrayPtr()[0] = 3;
store2.asArrayPtr()[1] = 4;
push(kj::mv(store2));
// Backpressure should be accumulating because the read has not yet fullilled.
KJ_ASSERT(queue.desiredSize() == -2);
auto store3 = jsg::BackingStore::alloc(js, 2);
store3.asArrayPtr()[0] = 5;
store3.asArrayPtr()[1] = 6;
push(kj::mv(store3));
// Some backpressure should be released because pushing the final minimum
// amount into the queue should have caused the read to be fulfilled.
KJ_ASSERT(queue.desiredSize() == 1);
// There should be one unread byte left in the queue at this point.
// It will be read once the microtask queue is drained.
KJ_ASSERT(queue.size() == 1);
js.v8Isolate->PerformMicrotaskCheckpoint();
}
KJ_TEST("ByteQueue with multiple default consumers with atLeast (same rate)") {
Preamble preamble;