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

calculate highest in-order ACKed packet from an ACK frame

Browse Source
This commit is contained in:
Marten Seemann
2016-04-20 19:37:20 +07:00
parent 184890cb4a
commit cfb74dbf06
2 changed files with 37 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
frames/ack_frame.go
View File

@@ -18,8 +18,8 @@ type NackRange struct {
type AckFrame struct {
Entropy byte
LargestObserved protocol.PacketNumber
DelayTime uint16 // Todo: properly interpret this value as described in the specification
NackRanges []NackRange
DelayTime uint16 // Todo: properly interpret this value as described in the specification
NackRanges []NackRange // has to be ordered. The NACK range with the highest FirstPacketNumber goes first, the NACK range with the lowest FirstPacketNumber goes last
}
// Write writes an ACK frame.
@@ -73,6 +73,14 @@ func (f *AckFrame) HasNACK() bool {
return false
}
// GetHighestInOrderPacket gets the highest in order packet number that is confirmed by this ACK
func (f *AckFrame) GetHighestInOrderPacket() protocol.PacketNumber {
if f.HasNACK() {
return (f.NackRanges[len(f.NackRanges)-1].FirstPacketNumber - 1)
}
return f.LargestObserved
}
// ParseAckFrame reads an ACK frame
func ParseAckFrame(r *bytes.Reader) (*AckFrame, error) {
frame := &AckFrame{}