2016-06-25 15:35:18 -04:00
|
|
|
package kcp
|
|
|
|
|
2016-06-30 08:51:49 -04:00
|
|
|
import (
|
|
|
|
"io"
|
|
|
|
"sync"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/v2ray/v2ray-core/common/alloc"
|
|
|
|
)
|
|
|
|
|
2016-06-25 15:35:18 -04:00
|
|
|
type ReceivingWindow struct {
|
|
|
|
start uint32
|
|
|
|
size uint32
|
2016-06-29 04:34:34 -04:00
|
|
|
list []*DataSegment
|
2016-06-25 15:35:18 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
func NewReceivingWindow(size uint32) *ReceivingWindow {
|
|
|
|
return &ReceivingWindow{
|
|
|
|
start: 0,
|
|
|
|
size: size,
|
2016-06-29 04:34:34 -04:00
|
|
|
list: make([]*DataSegment, size),
|
2016-06-25 15:35:18 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWindow) Size() uint32 {
|
|
|
|
return this.size
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWindow) Position(idx uint32) uint32 {
|
|
|
|
return (idx + this.start) % this.size
|
|
|
|
}
|
|
|
|
|
2016-06-29 04:34:34 -04:00
|
|
|
func (this *ReceivingWindow) Set(idx uint32, value *DataSegment) bool {
|
2016-06-25 15:35:18 -04:00
|
|
|
pos := this.Position(idx)
|
|
|
|
if this.list[pos] != nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
this.list[pos] = value
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2016-06-29 04:34:34 -04:00
|
|
|
func (this *ReceivingWindow) Remove(idx uint32) *DataSegment {
|
2016-06-25 15:35:18 -04:00
|
|
|
pos := this.Position(idx)
|
|
|
|
e := this.list[pos]
|
|
|
|
this.list[pos] = nil
|
|
|
|
return e
|
|
|
|
}
|
|
|
|
|
2016-06-29 04:34:34 -04:00
|
|
|
func (this *ReceivingWindow) RemoveFirst() *DataSegment {
|
2016-06-25 15:35:18 -04:00
|
|
|
return this.Remove(0)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWindow) Advance() {
|
|
|
|
this.start++
|
|
|
|
if this.start == this.size {
|
|
|
|
this.start = 0
|
|
|
|
}
|
|
|
|
}
|
2016-06-27 16:34:46 -04:00
|
|
|
|
2016-06-30 08:51:49 -04:00
|
|
|
type ReceivingQueue struct {
|
|
|
|
closed bool
|
|
|
|
cache *alloc.Buffer
|
|
|
|
queue chan *alloc.Buffer
|
|
|
|
timeout time.Time
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewReceivingQueue() *ReceivingQueue {
|
|
|
|
return &ReceivingQueue{
|
2016-07-02 05:19:32 -04:00
|
|
|
queue: make(chan *alloc.Buffer, effectiveConfig.GetReceivingQueueSize()),
|
2016-06-30 08:51:49 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingQueue) Read(buf []byte) (int, error) {
|
|
|
|
if this.cache.Len() > 0 {
|
|
|
|
nBytes, err := this.cache.Read(buf)
|
|
|
|
if this.cache.IsEmpty() {
|
|
|
|
this.cache.Release()
|
|
|
|
this.cache = nil
|
|
|
|
}
|
|
|
|
return nBytes, err
|
|
|
|
}
|
|
|
|
|
|
|
|
var totalBytes int
|
|
|
|
|
|
|
|
L:
|
|
|
|
for totalBytes < len(buf) {
|
|
|
|
timeToSleep := time.Millisecond
|
|
|
|
select {
|
|
|
|
case payload, open := <-this.queue:
|
|
|
|
if !open {
|
|
|
|
return totalBytes, io.EOF
|
|
|
|
}
|
|
|
|
nBytes, err := payload.Read(buf)
|
|
|
|
totalBytes += nBytes
|
|
|
|
if err != nil {
|
|
|
|
return totalBytes, err
|
|
|
|
}
|
|
|
|
if !payload.IsEmpty() {
|
|
|
|
this.cache = payload
|
|
|
|
}
|
|
|
|
buf = buf[nBytes:]
|
|
|
|
case <-time.After(timeToSleep):
|
|
|
|
if totalBytes > 0 {
|
|
|
|
break L
|
|
|
|
}
|
|
|
|
if !this.timeout.IsZero() && this.timeout.Before(time.Now()) {
|
|
|
|
return totalBytes, errTimeout
|
|
|
|
}
|
|
|
|
timeToSleep += 500 * time.Millisecond
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return totalBytes, nil
|
|
|
|
}
|
|
|
|
|
2016-07-02 15:26:50 -04:00
|
|
|
func (this *ReceivingQueue) Put(payload *alloc.Buffer) bool {
|
2016-06-30 10:58:38 -04:00
|
|
|
if this.closed {
|
|
|
|
payload.Release()
|
2016-07-02 15:26:50 -04:00
|
|
|
return false
|
2016-06-30 10:58:38 -04:00
|
|
|
}
|
|
|
|
|
2016-07-02 15:26:50 -04:00
|
|
|
select {
|
|
|
|
case this.queue <- payload:
|
|
|
|
return true
|
|
|
|
default:
|
|
|
|
return false
|
|
|
|
}
|
2016-06-30 08:51:49 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingQueue) SetReadDeadline(t time.Time) error {
|
|
|
|
this.timeout = t
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingQueue) Close() {
|
|
|
|
if this.closed {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
this.closed = true
|
|
|
|
close(this.queue)
|
|
|
|
}
|
|
|
|
|
2016-07-02 05:33:34 -04:00
|
|
|
type AckList struct {
|
2016-07-02 15:26:50 -04:00
|
|
|
writer SegmentWriter
|
2016-06-27 16:34:46 -04:00
|
|
|
timestamps []uint32
|
|
|
|
numbers []uint32
|
2016-06-30 16:19:30 -04:00
|
|
|
nextFlush []uint32
|
|
|
|
}
|
|
|
|
|
2016-07-02 15:26:50 -04:00
|
|
|
func NewACKList(writer SegmentWriter) *AckList {
|
2016-07-02 05:33:34 -04:00
|
|
|
return &AckList{
|
2016-07-02 15:26:50 -04:00
|
|
|
writer: writer,
|
2016-06-30 16:19:30 -04:00
|
|
|
timestamps: make([]uint32, 0, 32),
|
|
|
|
numbers: make([]uint32, 0, 32),
|
|
|
|
nextFlush: make([]uint32, 0, 32),
|
|
|
|
}
|
2016-06-27 16:34:46 -04:00
|
|
|
}
|
|
|
|
|
2016-07-02 05:33:34 -04:00
|
|
|
func (this *AckList) Add(number uint32, timestamp uint32) {
|
2016-06-27 16:34:46 -04:00
|
|
|
this.timestamps = append(this.timestamps, timestamp)
|
|
|
|
this.numbers = append(this.numbers, number)
|
2016-06-30 16:19:30 -04:00
|
|
|
this.nextFlush = append(this.nextFlush, 0)
|
2016-06-27 16:34:46 -04:00
|
|
|
}
|
|
|
|
|
2016-07-02 05:33:34 -04:00
|
|
|
func (this *AckList) Clear(una uint32) {
|
2016-06-27 16:34:46 -04:00
|
|
|
count := 0
|
|
|
|
for i := 0; i < len(this.numbers); i++ {
|
|
|
|
if this.numbers[i] >= una {
|
|
|
|
if i != count {
|
|
|
|
this.numbers[count] = this.numbers[i]
|
|
|
|
this.timestamps[count] = this.timestamps[i]
|
2016-06-30 16:19:30 -04:00
|
|
|
this.nextFlush[count] = this.nextFlush[i]
|
2016-06-27 16:34:46 -04:00
|
|
|
}
|
|
|
|
count++
|
|
|
|
}
|
|
|
|
}
|
2016-06-29 17:41:04 -04:00
|
|
|
if count < len(this.numbers) {
|
|
|
|
this.numbers = this.numbers[:count]
|
|
|
|
this.timestamps = this.timestamps[:count]
|
2016-06-30 16:19:30 -04:00
|
|
|
this.nextFlush = this.nextFlush[:count]
|
2016-06-29 17:41:04 -04:00
|
|
|
}
|
2016-06-27 16:34:46 -04:00
|
|
|
}
|
|
|
|
|
2016-07-02 15:26:50 -04:00
|
|
|
func (this *AckList) Flush(current uint32) {
|
2016-07-02 16:17:41 -04:00
|
|
|
seg := new(AckSegment)
|
2016-06-30 16:19:30 -04:00
|
|
|
for i := 0; i < len(this.numbers); i++ {
|
|
|
|
if this.nextFlush[i] <= current {
|
|
|
|
seg.Count++
|
|
|
|
seg.NumberList = append(seg.NumberList, this.numbers[i])
|
|
|
|
seg.TimestampList = append(seg.TimestampList, this.timestamps[i])
|
2016-06-30 16:19:57 -04:00
|
|
|
this.nextFlush[i] = current + 100
|
2016-06-30 16:19:30 -04:00
|
|
|
if seg.Count == 128 {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
2016-06-27 16:34:46 -04:00
|
|
|
}
|
2016-06-30 16:19:30 -04:00
|
|
|
if seg.Count > 0 {
|
2016-07-02 15:26:50 -04:00
|
|
|
this.writer.Write(seg)
|
2016-06-30 16:19:30 -04:00
|
|
|
}
|
2016-07-02 15:26:50 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
type ReceivingWorker struct {
|
|
|
|
sync.Mutex
|
|
|
|
kcp *KCP
|
|
|
|
queue *ReceivingQueue
|
|
|
|
window *ReceivingWindow
|
|
|
|
acklist *AckList
|
|
|
|
updated bool
|
|
|
|
nextNumber uint32
|
|
|
|
windowSize uint32
|
|
|
|
}
|
|
|
|
|
|
|
|
func NewReceivingWorker(kcp *KCP) *ReceivingWorker {
|
|
|
|
windowSize := effectiveConfig.GetReceivingWindowSize()
|
|
|
|
worker := &ReceivingWorker{
|
|
|
|
kcp: kcp,
|
|
|
|
queue: NewReceivingQueue(),
|
|
|
|
window: NewReceivingWindow(windowSize),
|
|
|
|
windowSize: windowSize,
|
|
|
|
}
|
|
|
|
worker.acklist = NewACKList(worker)
|
|
|
|
return worker
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) ProcessSendingNext(number uint32) {
|
|
|
|
this.Lock()
|
|
|
|
defer this.Unlock()
|
|
|
|
|
|
|
|
this.acklist.Clear(number)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) ProcessSegment(seg *DataSegment) {
|
|
|
|
number := seg.Number
|
|
|
|
if _itimediff(number, this.nextNumber+this.windowSize) >= 0 || _itimediff(number, this.nextNumber) < 0 {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
this.ProcessSendingNext(seg.SendingNext)
|
|
|
|
|
|
|
|
this.Lock()
|
|
|
|
this.acklist.Add(number, seg.Timestamp)
|
|
|
|
|
|
|
|
idx := number - this.nextNumber
|
|
|
|
|
|
|
|
if !this.window.Set(idx, seg) {
|
|
|
|
seg.Release()
|
|
|
|
}
|
|
|
|
this.Unlock()
|
|
|
|
|
|
|
|
this.DumpWindow()
|
|
|
|
}
|
|
|
|
|
|
|
|
// @Private
|
|
|
|
func (this *ReceivingWorker) DumpWindow() {
|
|
|
|
this.Lock()
|
|
|
|
defer this.Unlock()
|
|
|
|
|
|
|
|
for {
|
|
|
|
seg := this.window.RemoveFirst()
|
|
|
|
if seg == nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
if !this.queue.Put(seg.Data) {
|
|
|
|
this.window.Set(0, seg)
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
seg.Data = nil
|
|
|
|
this.window.Advance()
|
|
|
|
this.nextNumber++
|
|
|
|
this.updated = true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) Read(b []byte) (int, error) {
|
|
|
|
return this.queue.Read(b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) SetReadDeadline(t time.Time) {
|
|
|
|
this.Lock()
|
|
|
|
defer this.Unlock()
|
|
|
|
|
|
|
|
this.queue.SetReadDeadline(t)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) Flush() {
|
|
|
|
this.Lock()
|
|
|
|
defer this.Unlock()
|
|
|
|
|
|
|
|
this.acklist.Flush(this.kcp.current)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) Write(seg ISegment) {
|
2016-07-02 16:17:41 -04:00
|
|
|
ackSeg := seg.(*AckSegment)
|
2016-07-02 15:26:50 -04:00
|
|
|
ackSeg.Conv = this.kcp.conv
|
|
|
|
ackSeg.ReceivingNext = this.nextNumber
|
|
|
|
ackSeg.ReceivingWindow = this.nextNumber + this.windowSize
|
|
|
|
if this.kcp.state == StateReadyToClose {
|
|
|
|
ackSeg.Opt = SegmentOptionClose
|
|
|
|
}
|
|
|
|
this.kcp.output.Write(ackSeg)
|
|
|
|
this.updated = false
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) CloseRead() {
|
|
|
|
this.Lock()
|
|
|
|
defer this.Unlock()
|
|
|
|
|
|
|
|
this.queue.Close()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (this *ReceivingWorker) PingNecessary() bool {
|
|
|
|
return this.updated
|
2016-06-27 16:34:46 -04:00
|
|
|
}
|