forked from mozilla/neqo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
send_stream.rs
1042 lines (895 loc) · 33.8 KB
/
send_stream.rs
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
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
// Buffering data to send until it is acked.
use std::cell::RefCell;
use std::cmp::{max, min};
use std::collections::{hash_map::IterMut, BTreeMap, HashMap, VecDeque};
use std::convert::{TryFrom, TryInto};
use std::mem;
use std::rc::Rc;
use smallvec::SmallVec;
use neqo_common::{matches, qdebug, qerror, qinfo, qtrace};
use crate::events::ConnectionEvents;
use crate::flow_mgr::FlowMgr;
use crate::frame::{Frame, TxMode};
use crate::recovery::RecoveryToken;
use crate::stream_id::StreamId;
use crate::{AppError, Error, Res};
#[derive(Debug, PartialEq, Clone, Copy)]
enum RangeState {
Sent,
Acked,
}
/// Track ranges in the stream as sent or acked. Acked implies sent. Not in a
/// range implies needing-to-be-sent, either initially or as a retransmission.
#[derive(Debug, Default, PartialEq)]
struct RangeTracker {
// offset, (len, RangeState). Use u64 for len because ranges can exceed 32bits.
used: BTreeMap<u64, (u64, RangeState)>,
}
impl RangeTracker {
fn highest_offset(&self) -> u64 {
self.used
.range(..)
.next_back()
.map_or(0, |(k, (v, _))| *k + *v)
}
fn acked_from_zero(&self) -> u64 {
self.used
.get(&0)
.filter(|(_, state)| *state == RangeState::Acked)
.map_or(0, |(v, _)| *v)
}
/// Find the first unmarked range. If all are contiguous, this will return
/// (highest_offset(), None).
fn first_unmarked_range(&self) -> (u64, Option<u64>) {
let mut prev_end = 0;
for (cur_off, (cur_len, _)) in &self.used {
if prev_end == *cur_off {
prev_end = cur_off + cur_len;
} else {
return (prev_end, Some(cur_off - prev_end));
}
}
(prev_end, None)
}
/// Turn one range into a list of subranges that align with existing
/// ranges.
/// Check impermissible overlaps in subregions: Sent cannot overwrite Acked.
//
// e.g. given N is new and ABC are existing:
// NNNNNNNNNNNNNNNN
// AAAAA BBBCCCCC ...then we want 5 chunks:
// 1122222333444555
//
// but also if we have this:
// NNNNNNNNNNNNNNNN
// AAAAAAAAAA BBBB ...then break existing A and B ranges up:
//
// 1111111122222233
// aaAAAAAAAA BBbb
//
// Doing all this work up front should make handling each chunk much
// easier.
fn chunk_range_on_edges(
&mut self,
new_off: u64,
new_len: u64,
new_state: RangeState,
) -> Vec<(u64, u64, RangeState)> {
let mut tmp_off = new_off;
let mut tmp_len = new_len;
let mut v = Vec::new();
// cut previous overlapping range if needed
let prev = self.used.range_mut(..tmp_off).next_back();
if let Some((prev_off, (prev_len, prev_state))) = prev {
let prev_state = *prev_state;
let overlap = (*prev_off + *prev_len).saturating_sub(new_off);
*prev_len -= overlap;
if overlap > 0 {
self.used.insert(new_off, (overlap, prev_state));
}
}
let mut last_existing_remaining = None;
for (off, (len, state)) in self.used.range(tmp_off..tmp_off + tmp_len) {
// Create chunk for "overhang" before an existing range
if tmp_off < *off {
let sub_len = off - tmp_off;
v.push((tmp_off, sub_len, new_state));
tmp_off += sub_len;
tmp_len -= sub_len;
}
// Create chunk to match existing range
let sub_len = min(*len, tmp_len);
let remaining_len = len - sub_len;
if new_state == RangeState::Sent && *state == RangeState::Acked {
qinfo!(
"Attempted to downgrade overlapping range Acked range {}-{} with Sent {}-{}",
off,
len,
new_off,
new_len
);
} else {
v.push((tmp_off, sub_len, new_state));
}
tmp_off += sub_len;
tmp_len -= sub_len;
if remaining_len > 0 {
last_existing_remaining = Some((*off, sub_len, remaining_len, *state));
}
}
// Maybe break last existing range in two so that a final chunk will
// have the same length as an existing range entry
if let Some((off, sub_len, remaining_len, state)) = last_existing_remaining {
*self.used.get_mut(&off).expect("must be there") = (sub_len, state);
self.used.insert(off + sub_len, (remaining_len, state));
}
// Create final chunk if anything remains of the new range
if tmp_len > 0 {
v.push((tmp_off, tmp_len, new_state))
}
v
}
/// Merge contiguous Acked ranges into the first entry (0). This range may
/// be dropped from the send buffer.
fn coalesce_acked_from_zero(&mut self) {
let acked_range_from_zero = self
.used
.get_mut(&0)
.filter(|(_, state)| *state == RangeState::Acked)
.map(|(len, _)| *len);
if let Some(len_from_zero) = acked_range_from_zero {
let mut to_remove = SmallVec::<[_; 8]>::new();
let mut new_len_from_zero = len_from_zero;
// See if there's another Acked range entry contiguous to this one
while let Some((next_len, _)) = self
.used
.get(&new_len_from_zero)
.filter(|(_, state)| *state == RangeState::Acked)
{
to_remove.push(new_len_from_zero);
new_len_from_zero += *next_len;
}
if len_from_zero != new_len_from_zero {
self.used.get_mut(&0).expect("must be there").0 = new_len_from_zero;
}
for val in to_remove {
self.used.remove(&val);
}
}
}
fn mark_range(&mut self, off: u64, len: usize, state: RangeState) {
if len == 0 {
qinfo!("mark 0-length range at {}", off);
return;
}
let subranges = self.chunk_range_on_edges(off, len as u64, state);
for (sub_off, sub_len, sub_state) in subranges {
self.used.insert(sub_off, (sub_len, sub_state));
}
self.coalesce_acked_from_zero()
}
fn unmark_range(&mut self, off: u64, len: usize) {
if len == 0 {
qinfo!("unmark 0-length range at {}", off);
return;
}
let len = len as u64;
let end_off = off + len;
let mut to_remove = SmallVec::<[_; 8]>::new();
let mut to_add = None;
// Walk backwards through possibly affected existing ranges
for (cur_off, (cur_len, cur_state)) in self.used.range_mut(..off + len).rev() {
// Maybe fixup range preceding the removed range
if *cur_off < off {
// Check for overlap
if *cur_off + *cur_len > off {
if *cur_state == RangeState::Acked {
qinfo!(
"Attempted to unmark Acked range {}-{} with unmark_range {}-{}",
cur_off,
cur_len,
off,
len
);
} else {
*cur_len = off - cur_off;
}
}
break;
}
if *cur_state == RangeState::Acked {
qinfo!(
"Attempted to unmark Acked range {}-{} with unmark_range {}-{}",
cur_off,
cur_len,
off,
len
);
continue;
}
// Add a new range for old subrange extending beyond
// to-be-unmarked range
let cur_end_off = cur_off + *cur_len;
if cur_end_off > end_off {
let new_cur_off = off + len;
let new_cur_len = cur_end_off - end_off;
assert_eq!(to_add, None);
to_add = Some((new_cur_off, new_cur_len, *cur_state));
}
to_remove.push(*cur_off);
}
for remove_off in to_remove {
self.used.remove(&remove_off);
}
if let Some((new_cur_off, new_cur_len, cur_state)) = to_add {
self.used.insert(new_cur_off, (new_cur_len, cur_state));
}
}
}
/// Buffer to contain queued bytes and track their state.
#[derive(Debug, Default, PartialEq)]
pub struct TxBuffer {
retired: u64, // contig acked bytes, no longer in buffer
send_buf: VecDeque<u8>, // buffer of not-acked bytes
ranges: RangeTracker, // ranges in buffer that have been sent or acked
}
impl TxBuffer {
const BUFFER_SIZE: usize = 0xFFFF; // 64 KiB
pub fn new() -> Self {
Self {
send_buf: VecDeque::with_capacity(TxBuffer::BUFFER_SIZE),
..Self::default()
}
}
/// Attempt to add some or all of the passed-in buffer to the TxBuffer.
pub fn send(&mut self, buf: &[u8]) -> usize {
let can_buffer = min(TxBuffer::BUFFER_SIZE - self.buffered(), buf.len());
if can_buffer > 0 {
self.send_buf.extend(&buf[..can_buffer]);
assert!(self.send_buf.len() <= TxBuffer::BUFFER_SIZE);
}
can_buffer
}
pub fn next_bytes(&self, mode: TxMode) -> Option<(u64, &[u8])> {
match mode {
TxMode::Normal => {
let (start, maybe_len) = self.ranges.first_unmarked_range();
if start == self.retired + u64::try_from(self.buffered()).unwrap() {
return None;
}
let buff_off = usize::try_from(start - self.retired).unwrap();
match maybe_len {
Some(len) => {
let len = min(len, self.send_buf.as_slices().0.len().try_into().unwrap());
Some((
start,
&self.send_buf.as_slices().0
[buff_off..buff_off + usize::try_from(len).unwrap()],
))
}
None => Some((start, &self.send_buf.as_slices().0[buff_off..])),
}
}
TxMode::Pto => {
if self.buffered() == 0 {
None
} else {
Some((self.retired, &self.send_buf.as_slices().0))
}
}
}
}
pub fn mark_as_sent(&mut self, offset: u64, len: usize) {
self.ranges.mark_range(offset, len, RangeState::Sent)
}
pub fn mark_as_acked(&mut self, offset: u64, len: usize) {
self.ranges.mark_range(offset, len, RangeState::Acked);
// We can drop contig acked range from the buffer
let new_retirable = self.ranges.acked_from_zero() - self.retired;
let keep_len =
self.buffered() - usize::try_from(new_retirable).expect("should fit in usize");
// Truncate front
self.send_buf.rotate_left(self.buffered() - keep_len);
self.send_buf.truncate(keep_len);
self.retired += new_retirable;
}
pub fn mark_as_lost(&mut self, offset: u64, len: usize) {
debug_assert!(self.ranges.highest_offset() >= offset + len as u64);
self.ranges.unmark_range(offset, len)
}
fn data_limit(&self) -> u64 {
self.buffered() as u64 + self.retired
}
fn buffered(&self) -> usize {
self.send_buf.len()
}
fn avail(&self) -> usize {
TxBuffer::BUFFER_SIZE - self.buffered()
}
pub fn highest_sent(&self) -> u64 {
self.ranges.highest_offset()
}
}
/// QUIC sending stream states, based on -transport 3.1.
#[derive(Debug, PartialEq)]
enum SendStreamState {
Ready,
Send {
send_buf: TxBuffer,
},
DataSent {
send_buf: TxBuffer,
final_size: u64,
fin_sent: bool,
},
DataRecvd {
final_size: u64,
},
ResetSent,
ResetRecvd,
}
impl SendStreamState {
fn tx_buf(&self) -> Option<&TxBuffer> {
match self {
SendStreamState::Send { send_buf } | SendStreamState::DataSent { send_buf, .. } => {
Some(send_buf)
}
SendStreamState::Ready
| SendStreamState::DataRecvd { .. }
| SendStreamState::ResetSent
| SendStreamState::ResetRecvd => None,
}
}
fn tx_buf_mut(&mut self) -> Option<&mut TxBuffer> {
match self {
SendStreamState::Send { send_buf } | SendStreamState::DataSent { send_buf, .. } => {
Some(send_buf)
}
SendStreamState::Ready
| SendStreamState::DataRecvd { .. }
| SendStreamState::ResetSent
| SendStreamState::ResetRecvd => None,
}
}
fn tx_avail(&self) -> u64 {
match self {
// In Ready, TxBuffer not yet allocated but size is known
SendStreamState::Ready => TxBuffer::BUFFER_SIZE.try_into().unwrap(),
SendStreamState::Send { send_buf } | SendStreamState::DataSent { send_buf, .. } => {
send_buf.avail().try_into().unwrap()
}
SendStreamState::DataRecvd { .. }
| SendStreamState::ResetSent
| SendStreamState::ResetRecvd => 0,
}
}
fn final_size(&self) -> Option<u64> {
match self {
SendStreamState::DataSent { final_size, .. }
| SendStreamState::DataRecvd { final_size } => Some(*final_size),
SendStreamState::Ready
| SendStreamState::Send { .. }
| SendStreamState::ResetSent
| SendStreamState::ResetRecvd => None,
}
}
fn name(&self) -> &str {
match self {
SendStreamState::Ready => "Ready",
SendStreamState::Send { .. } => "Send",
SendStreamState::DataSent { .. } => "DataSent",
SendStreamState::DataRecvd { .. } => "DataRecvd",
SendStreamState::ResetSent => "ResetSent",
SendStreamState::ResetRecvd => "ResetRecvd",
}
}
fn transition(&mut self, new_state: Self) {
qtrace!("SendStream state {} -> {}", self.name(), new_state.name());
*self = new_state;
}
}
/// Implement a QUIC send stream.
#[derive(Debug)]
pub struct SendStream {
stream_id: StreamId,
max_stream_data: u64,
state: SendStreamState,
flow_mgr: Rc<RefCell<FlowMgr>>,
conn_events: ConnectionEvents,
}
impl SendStream {
pub fn new(
stream_id: StreamId,
max_stream_data: u64,
flow_mgr: Rc<RefCell<FlowMgr>>,
conn_events: ConnectionEvents,
) -> Self {
let ss = Self {
stream_id,
max_stream_data,
state: SendStreamState::Ready,
flow_mgr,
conn_events,
};
if ss.avail() > 0 {
ss.conn_events.send_stream_writable(stream_id);
}
ss
}
/// Return the next range to be sent, if any.
pub fn next_bytes(&mut self, mode: TxMode) -> Option<(u64, &[u8])> {
match self.state {
SendStreamState::Send { ref send_buf } => send_buf.next_bytes(mode),
SendStreamState::DataSent {
ref send_buf,
fin_sent,
final_size,
} => {
let bytes = send_buf.next_bytes(mode);
if bytes.is_some() {
// Must be a resend
bytes
} else if fin_sent {
None
} else {
// Send empty stream frame with fin set
Some((final_size, &[]))
}
}
SendStreamState::Ready
| SendStreamState::DataRecvd { .. }
| SendStreamState::ResetSent
| SendStreamState::ResetRecvd => None,
}
}
pub fn mark_as_sent(&mut self, offset: u64, len: usize, fin: bool) {
if let Some(buf) = self.state.tx_buf_mut() {
buf.mark_as_sent(offset, len);
if offset + len as u64 == self.max_stream_data {
self.flow_mgr
.borrow_mut()
.stream_data_blocked(self.stream_id, self.max_stream_data);
}
if self.flow_mgr.borrow().conn_credit_avail() == 0 {
self.flow_mgr.borrow_mut().data_blocked();
}
};
if fin {
if let SendStreamState::DataSent { fin_sent, .. } = &mut self.state {
*fin_sent = true;
}
}
}
pub fn mark_as_acked(&mut self, offset: u64, len: usize, fin: bool) {
match self.state {
SendStreamState::Send { ref mut send_buf } => {
send_buf.mark_as_acked(offset, len);
if self.avail() > 0 {
self.conn_events.send_stream_writable(self.stream_id)
}
}
SendStreamState::DataSent {
ref mut send_buf,
final_size,
..
} => {
send_buf.mark_as_acked(offset, len);
if fin && send_buf.buffered() == 0 {
self.conn_events.send_stream_complete(self.stream_id);
self.state
.transition(SendStreamState::DataRecvd { final_size });
}
}
_ => qtrace!("mark_as_acked called from state {}", self.state.name()),
}
}
pub fn mark_as_lost(&mut self, offset: u64, len: usize, fin: bool) {
if let Some(buf) = self.state.tx_buf_mut() {
buf.mark_as_lost(offset, len);
}
if fin {
if let SendStreamState::DataSent { fin_sent, .. } = &mut self.state {
*fin_sent = false;
}
}
}
pub fn final_size(&self) -> Option<u64> {
self.state.final_size()
}
/// Stream credit available
pub fn credit_avail(&self) -> u64 {
if self.state == SendStreamState::Ready {
self.max_stream_data
} else {
self.state
.tx_buf()
.map_or(0, |tx| self.max_stream_data - tx.data_limit())
}
}
/// Bytes sendable on stream. Constrained by stream credit available,
/// connection credit available, and space in the tx buffer.
pub fn avail(&self) -> u64 {
min(
min(self.state.tx_avail(), self.credit_avail()),
self.flow_mgr.borrow().conn_credit_avail(),
)
}
pub fn max_stream_data(&self) -> u64 {
self.max_stream_data
}
pub fn set_max_stream_data(&mut self, value: u64) {
let stream_was_blocked = self.avail() == 0;
self.max_stream_data = max(self.max_stream_data, value);
if stream_was_blocked && self.avail() > 0 {
self.conn_events.send_stream_writable(self.stream_id)
}
}
pub fn reset_acked(&mut self) {
match self.state {
SendStreamState::Ready
| SendStreamState::Send { .. }
| SendStreamState::DataSent { .. }
| SendStreamState::DataRecvd { .. } => {
qtrace!("Reset acked while in {} state?", self.state.name())
}
SendStreamState::ResetSent => self.state.transition(SendStreamState::ResetRecvd),
SendStreamState::ResetRecvd => qtrace!("already in ResetRecvd state"),
};
}
pub fn is_terminal(&self) -> bool {
matches!(self.state, SendStreamState::DataRecvd { .. } | SendStreamState::ResetRecvd)
}
pub fn send(&mut self, buf: &[u8]) -> Res<usize> {
if buf.is_empty() {
qerror!("zero-length send on stream {}", self.stream_id.as_u64());
return Err(Error::InvalidInput);
}
if let SendStreamState::Ready = self.state {
self.state.transition(SendStreamState::Send {
send_buf: TxBuffer::new(),
});
}
if !matches!(self.state, SendStreamState::Send{..}) {
return Err(Error::FinalSizeError);
}
let can_send_bytes = min(self.avail(), buf.len() as u64);
if can_send_bytes == 0 {
return Ok(0);
}
let buf = &buf[..can_send_bytes.try_into()?];
let sent = match &mut self.state {
SendStreamState::Ready => unreachable!(),
SendStreamState::Send { send_buf } => send_buf.send(buf),
_ => return Err(Error::FinalSizeError),
};
self.flow_mgr
.borrow_mut()
.conn_increase_credit_used(sent as u64);
Ok(sent)
}
pub fn close(&mut self) {
match &mut self.state {
SendStreamState::Ready => {
self.state.transition(SendStreamState::DataSent {
send_buf: TxBuffer::new(),
final_size: 0,
fin_sent: false,
});
}
SendStreamState::Send { send_buf } => {
let final_size = send_buf.retired + send_buf.buffered() as u64;
let owned_buf = mem::replace(send_buf, TxBuffer::new());
self.state.transition(SendStreamState::DataSent {
send_buf: owned_buf,
final_size,
fin_sent: false,
});
}
SendStreamState::DataSent { .. } => qtrace!("already in DataSent state"),
SendStreamState::DataRecvd { .. } => qtrace!("already in DataRecvd state"),
SendStreamState::ResetSent => qtrace!("already in ResetSent state"),
SendStreamState::ResetRecvd => qtrace!("already in ResetRecvd state"),
}
}
pub fn reset(&mut self, err: AppError) {
match &self.state {
SendStreamState::Ready => {
self.flow_mgr
.borrow_mut()
.stream_reset(self.stream_id, err, 0);
self.state.transition(SendStreamState::ResetSent);
}
SendStreamState::Send { send_buf } => {
self.flow_mgr.borrow_mut().stream_reset(
self.stream_id,
err,
send_buf.highest_sent(),
);
self.state.transition(SendStreamState::ResetSent);
}
SendStreamState::DataSent { final_size, .. } => {
self.flow_mgr
.borrow_mut()
.stream_reset(self.stream_id, err, *final_size);
self.state.transition(SendStreamState::ResetSent);
}
SendStreamState::DataRecvd { .. } => qtrace!("already in DataRecvd state"),
SendStreamState::ResetSent => qtrace!("already in ResetSent state"),
SendStreamState::ResetRecvd => qtrace!("already in ResetRecvd state"),
};
}
}
#[derive(Debug, Default)]
pub(crate) struct SendStreams(HashMap<StreamId, SendStream>);
impl SendStreams {
pub fn get(&self, id: StreamId) -> Res<&SendStream> {
self.0.get(&id).ok_or_else(|| Error::InvalidStreamId)
}
pub fn get_mut(&mut self, id: StreamId) -> Res<&mut SendStream> {
self.0.get_mut(&id).ok_or_else(|| Error::InvalidStreamId)
}
pub fn insert(&mut self, id: StreamId, stream: SendStream) {
self.0.insert(id, stream);
}
pub fn acked(&mut self, token: &StreamRecoveryToken) {
if let Some(ss) = self.0.get_mut(&token.id) {
ss.mark_as_acked(token.offset, token.length, token.fin);
}
}
pub fn reset_acked(&mut self, id: StreamId) {
if let Some(ss) = self.0.get_mut(&id) {
ss.reset_acked()
}
}
pub fn lost(&mut self, token: &StreamRecoveryToken) {
if let Some(ss) = self.0.get_mut(&token.id) {
ss.mark_as_lost(token.offset, token.length, token.fin);
}
}
pub fn clear(&mut self) {
self.0.clear()
}
pub fn clear_terminal(&mut self) {
self.0.retain(|_, stream| !stream.is_terminal())
}
pub(crate) fn get_frame(
&mut self,
epoch: u16,
mode: TxMode,
remaining: usize,
) -> Option<(Frame, Option<RecoveryToken>)> {
if epoch != 3 && epoch != 1 {
return None;
}
for (stream_id, stream) in self {
let complete = stream.final_size().is_some();
if let Some((offset, data)) = stream.next_bytes(mode) {
if let Some((frame, length)) =
Frame::new_stream(stream_id.as_u64(), offset, data, complete, remaining)
{
qdebug!(
"Stream {} sending bytes {}-{}, epoch {}, mode {:?}",
stream_id.as_u64(),
offset,
offset + length as u64,
epoch,
mode,
);
let fin = complete && length == data.len();
debug_assert!(!fin || matches!(frame, Frame::Stream{fin: true, .. }));
stream.mark_as_sent(offset, length, fin);
return Some((
frame,
Some(RecoveryToken::Stream(StreamRecoveryToken {
id: *stream_id,
offset,
length,
fin,
})),
));
}
}
}
None
}
}
impl<'a> IntoIterator for &'a mut SendStreams {
type Item = (&'a StreamId, &'a mut SendStream);
type IntoIter = IterMut<'a, StreamId, SendStream>;
fn into_iter(self) -> IterMut<'a, StreamId, SendStream> {
self.0.iter_mut()
}
}
#[derive(Debug, Clone)]
pub struct StreamRecoveryToken {
pub(crate) id: StreamId,
offset: u64,
length: usize,
fin: bool,
}
#[cfg(test)]
mod tests {
use super::*;
use neqo_common::matches;
use crate::events::ConnectionEvent;
#[test]
fn test_mark_range() {
let mut rt = RangeTracker::default();
// ranges can go from nothing->Sent if queued for retrans and then
// acks arrive
rt.mark_range(5, 5, RangeState::Acked);
assert_eq!(rt.highest_offset(), 10);
assert_eq!(rt.acked_from_zero(), 0);
rt.mark_range(10, 4, RangeState::Acked);
assert_eq!(rt.highest_offset(), 14);
assert_eq!(rt.acked_from_zero(), 0);
rt.mark_range(0, 5, RangeState::Sent);
assert_eq!(rt.highest_offset(), 14);
assert_eq!(rt.acked_from_zero(), 0);
rt.mark_range(0, 5, RangeState::Acked);
assert_eq!(rt.highest_offset(), 14);
assert_eq!(rt.acked_from_zero(), 14);
rt.mark_range(12, 20, RangeState::Acked);
assert_eq!(rt.highest_offset(), 32);
assert_eq!(rt.acked_from_zero(), 32);
// ack the lot
rt.mark_range(0, 400, RangeState::Acked);
assert_eq!(rt.highest_offset(), 400);
assert_eq!(rt.acked_from_zero(), 400);
// acked trumps sent
rt.mark_range(0, 200, RangeState::Sent);
assert_eq!(rt.highest_offset(), 400);
assert_eq!(rt.acked_from_zero(), 400);
}
#[test]
fn truncate_front() {
let mut v = VecDeque::new();
v.push_back(5);
v.push_back(6);
v.push_back(7);
v.push_front(4usize);
v.rotate_left(1);
v.truncate(3);
assert_eq!(*v.front().unwrap(), 5);
assert_eq!(*v.back().unwrap(), 7);
}
#[test]
fn test_unmark_range() {
let mut rt = RangeTracker::default();
rt.mark_range(5, 5, RangeState::Acked);
rt.mark_range(10, 5, RangeState::Sent);
// Should unmark sent but not acked range
rt.unmark_range(7, 6);
let res = rt.first_unmarked_range();
assert_eq!(res, (0, Some(5)));
assert_eq!(
rt.used.iter().nth(0).unwrap(),
(&5, &(5, RangeState::Acked))
);
assert_eq!(
rt.used.iter().nth(1).unwrap(),
(&13, &(2, RangeState::Sent))
);
assert!(rt.used.iter().nth(2).is_none());
rt.mark_range(0, 5, RangeState::Sent);
let res = rt.first_unmarked_range();
assert_eq!(res, (10, Some(3)));
rt.mark_range(10, 3, RangeState::Sent);
let res = rt.first_unmarked_range();
assert_eq!(res, (15, None));
}
#[test]
fn test_stream_tx() {
let flow_mgr = Rc::new(RefCell::new(FlowMgr::default()));
flow_mgr.borrow_mut().conn_increase_max_credit(4096);
let conn_events = ConnectionEvents::default();
let mut s = SendStream::new(4.into(), 1024, flow_mgr.clone(), conn_events.clone());
let res = s.send(&[4; 100]).unwrap();
assert_eq!(res, 100);
s.mark_as_sent(0, 50, false);
assert_eq!(s.state.tx_buf().unwrap().data_limit(), 100);
// Should hit stream flow control limit before filling up send buffer
let res = s.send(&[4; TxBuffer::BUFFER_SIZE]).unwrap();
assert_eq!(res, 1024 - 100);
// should do nothing, max stream data already 1024
s.set_max_stream_data(1024);
let res = s.send(&[4; TxBuffer::BUFFER_SIZE]).unwrap();
assert_eq!(res, 0);
// should now hit the conn flow control (4096)
s.set_max_stream_data(1_048_576);
let res = s.send(&[4; TxBuffer::BUFFER_SIZE]).unwrap();
assert_eq!(res, 3072);
// should now hit the tx buffer size
flow_mgr
.borrow_mut()
.conn_increase_max_credit(TxBuffer::BUFFER_SIZE as u64);
let res = s.send(&[4; TxBuffer::BUFFER_SIZE + 100]).unwrap();
assert_eq!(res, TxBuffer::BUFFER_SIZE - 4096);
// TODO(agrover@mozilla.com): test ooo acks somehow
s.mark_as_acked(0, 40, false);
}
#[test]
fn test_tx_buffer_acks() {
let mut tx = TxBuffer::new();
assert_eq!(tx.send(&[4; 100]), 100);
let res = tx.next_bytes(TxMode::Normal).unwrap();
assert_eq!(res.0, 0);
assert_eq!(res.1.len(), 100);
tx.mark_as_sent(0, 100);
let res = tx.next_bytes(TxMode::Normal);
assert_eq!(res, None);
tx.mark_as_acked(0, 100);
let res = tx.next_bytes(TxMode::Normal);
assert_eq!(res, None);
}
#[test]
fn send_stream_writable_event_gen() {
let flow_mgr = Rc::new(RefCell::new(FlowMgr::default()));
flow_mgr.borrow_mut().conn_increase_max_credit(2);
let conn_events = ConnectionEvents::default();
let mut s = SendStream::new(4.into(), 0, flow_mgr.clone(), conn_events.clone());
// Stream is initially blocked (conn:2, stream:0)
// and will not accept data.
assert_eq!(s.send(b"hi").unwrap(), 0);
// increasing to (conn:2, stream:2) will allow 2 bytes, and also
// generate a SendStreamWritable event.
s.set_max_stream_data(2);
let evts = conn_events.events().collect::<Vec<_>>();
assert_eq!(evts.len(), 1);
assert!(matches!(evts[0], ConnectionEvent::SendStreamWritable{..}));
assert_eq!(s.send(b"hello").unwrap(), 2);
// increasing to (conn:2, stream:4) will not generate an event or allow
// sending anything.
s.set_max_stream_data(4);
let evts = conn_events.events().collect::<Vec<_>>();
assert_eq!(evts.len(), 0);
assert_eq!(s.send(b"hello").unwrap(), 0);
// Increasing conn max (conn:4, stream:4) will unblock but not emit
// event b/c that happens in Connection::emit_frame() (tested in
// connection.rs)
assert_eq!(flow_mgr.borrow_mut().conn_increase_max_credit(4), true);
let evts = conn_events.events().collect::<Vec<_>>();
assert_eq!(evts.len(), 0);
assert_eq!(s.avail(), 2);
assert_eq!(s.send(b"hello").unwrap(), 2);
// No event because still blocked by conn