gr1ffon/quic-go
1
0
Fork 0
forked from quic-go/quic-go
Code Pull Requests Activity

replace short fragments by longer fragments in the frame sorter

Browse Source
This commit is contained in:
Marten Seemann
2019-09-03 13:08:24 +07:00
parent d1489e5045
commit 326ec9e16e
2 changed files with 10 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
frame_sorter.go
View File

@@ -37,14 +37,11 @@ func (s *frameSorter) push(data []byte, offset protocol.ByteCount) error {
return nil
}
var wasCut bool
if oldData, ok := s.queue[offset]; ok {
if len(data) <= len(oldData) {
return errDuplicateStreamData
}
data = data[len(oldData):]
offset += protocol.ByteCount(len(oldData))
wasCut = true
s.queue[offset] = data
}
start := offset
@@ -66,6 +63,7 @@ func (s *frameSorter) push(data []byte, offset protocol.ByteCount) error {
return errors.New("StreamFrameSorter BUG: no gap found")
}
var wasCut bool
if start < gap.Value.Start {
add := gap.Value.Start - start
offset += add