forked from quic-go/quic-go
All ACK ranges are now saved in the AckRanges slices. This eliminates a bunch of special cases for ACKs that don't report any packets missing.
44 lines
1.2 KiB
Go
44 lines
1.2 KiB
Go
package ackhandler
|
|
|
|
import (
|
|
"github.com/lucas-clemente/quic-go/internal/protocol"
|
|
"github.com/lucas-clemente/quic-go/internal/wire"
|
|
)
|
|
|
|
// This stopWaitingManager is not supposed to satisfy the StopWaitingManager interface, which is a remnant of the legacy AckHandler, and should be remove once we drop support for QUIC 33
|
|
type stopWaitingManager struct {
|
|
largestLeastUnackedSent protocol.PacketNumber
|
|
nextLeastUnacked protocol.PacketNumber
|
|
|
|
lastStopWaitingFrame *wire.StopWaitingFrame
|
|
}
|
|
|
|
func (s *stopWaitingManager) GetStopWaitingFrame(force bool) *wire.StopWaitingFrame {
|
|
if s.nextLeastUnacked <= s.largestLeastUnackedSent {
|
|
if force {
|
|
return s.lastStopWaitingFrame
|
|
}
|
|
return nil
|
|
}
|
|
|
|
s.largestLeastUnackedSent = s.nextLeastUnacked
|
|
swf := &wire.StopWaitingFrame{
|
|
LeastUnacked: s.nextLeastUnacked,
|
|
}
|
|
s.lastStopWaitingFrame = swf
|
|
return swf
|
|
}
|
|
|
|
func (s *stopWaitingManager) ReceivedAck(ack *wire.AckFrame) {
|
|
largestAcked := ack.LargestAcked()
|
|
if largestAcked >= s.nextLeastUnacked {
|
|
s.nextLeastUnacked = largestAcked + 1
|
|
}
|
|
}
|
|
|
|
func (s *stopWaitingManager) QueuedRetransmissionForPacketNumber(p protocol.PacketNumber) {
|
|
if p >= s.nextLeastUnacked {
|
|
s.nextLeastUnacked = p + 1
|
|
}
|
|
}
|