mirror of
https://github.com/v2fly/v2ray-core.git
synced 2024-12-23 02:26:49 -05:00
244 lines
6.3 KiB
Go
244 lines
6.3 KiB
Go
package wire
|
|
|
|
import (
|
|
"bytes"
|
|
"errors"
|
|
"sort"
|
|
"time"
|
|
|
|
"github.com/lucas-clemente/quic-go/internal/protocol"
|
|
"github.com/lucas-clemente/quic-go/internal/utils"
|
|
)
|
|
|
|
// TODO: use the value sent in the transport parameters
|
|
const ackDelayExponent = 3
|
|
|
|
// An AckFrame is an ACK frame
|
|
type AckFrame struct {
|
|
AckRanges []AckRange // has to be ordered. The highest ACK range goes first, the lowest ACK range goes last
|
|
DelayTime time.Duration
|
|
}
|
|
|
|
func parseAckFrame(r *bytes.Reader, version protocol.VersionNumber) (*AckFrame, error) {
|
|
return parseAckOrAckEcnFrame(r, false, version)
|
|
}
|
|
|
|
func parseAckEcnFrame(r *bytes.Reader, version protocol.VersionNumber) (*AckFrame, error) {
|
|
return parseAckOrAckEcnFrame(r, true, version)
|
|
}
|
|
|
|
// parseAckFrame reads an ACK frame
|
|
func parseAckOrAckEcnFrame(r *bytes.Reader, ecn bool, version protocol.VersionNumber) (*AckFrame, error) {
|
|
if !version.UsesIETFFrameFormat() {
|
|
return parseAckFrameLegacy(r, version)
|
|
}
|
|
|
|
if _, err := r.ReadByte(); err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
frame := &AckFrame{}
|
|
|
|
la, err := utils.ReadVarInt(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
largestAcked := protocol.PacketNumber(la)
|
|
delay, err := utils.ReadVarInt(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
frame.DelayTime = time.Duration(delay*1<<ackDelayExponent) * time.Microsecond
|
|
|
|
if ecn {
|
|
for i := 0; i < 3; i++ {
|
|
if _, err := utils.ReadVarInt(r); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
}
|
|
|
|
numBlocks, err := utils.ReadVarInt(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// read the first ACK range
|
|
ab, err := utils.ReadVarInt(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
ackBlock := protocol.PacketNumber(ab)
|
|
if ackBlock > largestAcked {
|
|
return nil, errors.New("invalid first ACK range")
|
|
}
|
|
smallest := largestAcked - ackBlock
|
|
|
|
// read all the other ACK ranges
|
|
frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked})
|
|
for i := uint64(0); i < numBlocks; i++ {
|
|
g, err := utils.ReadVarInt(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
gap := protocol.PacketNumber(g)
|
|
if smallest < gap+2 {
|
|
return nil, errInvalidAckRanges
|
|
}
|
|
largest := smallest - gap - 2
|
|
|
|
ab, err := utils.ReadVarInt(r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
ackBlock := protocol.PacketNumber(ab)
|
|
|
|
if ackBlock > largest {
|
|
return nil, errInvalidAckRanges
|
|
}
|
|
smallest = largest - ackBlock
|
|
frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest})
|
|
}
|
|
|
|
if !frame.validateAckRanges() {
|
|
return nil, errInvalidAckRanges
|
|
}
|
|
return frame, nil
|
|
}
|
|
|
|
// Write writes an ACK frame.
|
|
func (f *AckFrame) Write(b *bytes.Buffer, version protocol.VersionNumber) error {
|
|
if !version.UsesIETFFrameFormat() {
|
|
return f.writeLegacy(b, version)
|
|
}
|
|
|
|
b.WriteByte(0x0d)
|
|
utils.WriteVarInt(b, uint64(f.LargestAcked()))
|
|
utils.WriteVarInt(b, encodeAckDelay(f.DelayTime))
|
|
|
|
numRanges := f.numEncodableAckRanges()
|
|
utils.WriteVarInt(b, uint64(numRanges-1))
|
|
|
|
// write the first range
|
|
_, firstRange := f.encodeAckRange(0)
|
|
utils.WriteVarInt(b, firstRange)
|
|
|
|
// write all the other range
|
|
for i := 1; i < numRanges; i++ {
|
|
gap, len := f.encodeAckRange(i)
|
|
utils.WriteVarInt(b, gap)
|
|
utils.WriteVarInt(b, len)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// Length of a written frame
|
|
func (f *AckFrame) Length(version protocol.VersionNumber) protocol.ByteCount {
|
|
if !version.UsesIETFFrameFormat() {
|
|
return f.lengthLegacy(version)
|
|
}
|
|
|
|
largestAcked := f.AckRanges[0].Largest
|
|
numRanges := f.numEncodableAckRanges()
|
|
|
|
length := 1 + utils.VarIntLen(uint64(largestAcked)) + utils.VarIntLen(encodeAckDelay(f.DelayTime))
|
|
|
|
length += utils.VarIntLen(uint64(numRanges - 1))
|
|
lowestInFirstRange := f.AckRanges[0].Smallest
|
|
length += utils.VarIntLen(uint64(largestAcked - lowestInFirstRange))
|
|
|
|
for i := 1; i < numRanges; i++ {
|
|
gap, len := f.encodeAckRange(i)
|
|
length += utils.VarIntLen(gap)
|
|
length += utils.VarIntLen(len)
|
|
}
|
|
return length
|
|
}
|
|
|
|
// gets the number of ACK ranges that can be encoded
|
|
// such that the resulting frame is smaller than the maximum ACK frame size
|
|
func (f *AckFrame) numEncodableAckRanges() int {
|
|
length := 1 + utils.VarIntLen(uint64(f.LargestAcked())) + utils.VarIntLen(encodeAckDelay(f.DelayTime))
|
|
length += 2 // assume that the number of ranges will consume 2 bytes
|
|
for i := 1; i < len(f.AckRanges); i++ {
|
|
gap, len := f.encodeAckRange(i)
|
|
rangeLen := utils.VarIntLen(gap) + utils.VarIntLen(len)
|
|
if length+rangeLen > protocol.MaxAckFrameSize {
|
|
// Writing range i would exceed the MaxAckFrameSize.
|
|
// So encode one range less than that.
|
|
return i - 1
|
|
}
|
|
length += rangeLen
|
|
}
|
|
return len(f.AckRanges)
|
|
}
|
|
|
|
func (f *AckFrame) encodeAckRange(i int) (uint64 /* gap */, uint64 /* length */) {
|
|
if i == 0 {
|
|
return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest)
|
|
}
|
|
return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2),
|
|
uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest)
|
|
}
|
|
|
|
// HasMissingRanges returns if this frame reports any missing packets
|
|
func (f *AckFrame) HasMissingRanges() bool {
|
|
return len(f.AckRanges) > 1
|
|
}
|
|
|
|
func (f *AckFrame) validateAckRanges() bool {
|
|
if len(f.AckRanges) == 0 {
|
|
return false
|
|
}
|
|
|
|
// check the validity of every single ACK range
|
|
for _, ackRange := range f.AckRanges {
|
|
if ackRange.Smallest > ackRange.Largest {
|
|
return false
|
|
}
|
|
}
|
|
|
|
// check the consistency for ACK with multiple NACK ranges
|
|
for i, ackRange := range f.AckRanges {
|
|
if i == 0 {
|
|
continue
|
|
}
|
|
lastAckRange := f.AckRanges[i-1]
|
|
if lastAckRange.Smallest <= ackRange.Smallest {
|
|
return false
|
|
}
|
|
if lastAckRange.Smallest <= ackRange.Largest+1 {
|
|
return false
|
|
}
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
// LargestAcked is the largest acked packet number
|
|
func (f *AckFrame) LargestAcked() protocol.PacketNumber {
|
|
return f.AckRanges[0].Largest
|
|
}
|
|
|
|
// LowestAcked is the lowest acked packet number
|
|
func (f *AckFrame) LowestAcked() protocol.PacketNumber {
|
|
return f.AckRanges[len(f.AckRanges)-1].Smallest
|
|
}
|
|
|
|
// AcksPacket determines if this ACK frame acks a certain packet number
|
|
func (f *AckFrame) AcksPacket(p protocol.PacketNumber) bool {
|
|
if p < f.LowestAcked() || p > f.LargestAcked() {
|
|
return false
|
|
}
|
|
|
|
i := sort.Search(len(f.AckRanges), func(i int) bool {
|
|
return p >= f.AckRanges[i].Smallest
|
|
})
|
|
// i will always be < len(f.AckRanges), since we checked above that p is not bigger than the largest acked
|
|
return p <= f.AckRanges[i].Largest
|
|
}
|
|
|
|
func encodeAckDelay(delay time.Duration) uint64 {
|
|
return uint64(delay.Nanoseconds() / (1000 * (1 << ackDelayExponent)))
|
|
}
|