Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Replace the RequireInsertCount decoding algorithm #2379

Merged
merged 3 commits into from Feb 6, 2019
Merged

Replace the RequireInsertCount decoding algorithm #2379

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e9629e9
Replace the RequireInsertCount decoding algorithm
afrind Jan 28, 2019
c7f153f
Martin's feedback
afrind Jan 29, 2019
a7c337e
* Indicate that the algorithm is an example
afrind Feb 5, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
5 changes: 4 additions & 1 deletion draft-ietf-quic-qpack.md
View file
Open in desktop
Expand Up @@ -866,12 +866,15 @@ decoder's dynamic table:
ReqInsertCount = 0
else:
MaxValue = TotalNumberOfInserts + MaxEntries

# MaxWrapped is the largest possible value of
# ReqInsertCount that is 0 mod 2*MaxEntries
MaxWrapped = floor(MaxValue / FullRange) * FullRange
ReqInsertCount = MaxWrapped + EncodedInsertCount - 1

# If ReqInsertCount exceeds MaxValue, the Encoder's value
# must have wrapped one fewer time
if ReqInsertCount > MaxValue:
# The Encoder's value wrapped one fewer time
if ReqInsertCount < FullRange:
Error
ReqInsertCount -= FullRange
Expand Down