receiving.go 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276
  1. package kcp
  2. import (
  3. "sync"
  4. "v2ray.com/core/common/buf"
  5. )
  6. type ReceivingWindow struct {
  7. start uint32
  8. size uint32
  9. list []*DataSegment
  10. }
  11. func NewReceivingWindow(size uint32) *ReceivingWindow {
  12. return &ReceivingWindow{
  13. start: 0,
  14. size: size,
  15. list: make([]*DataSegment, size),
  16. }
  17. }
  18. func (v *ReceivingWindow) Size() uint32 {
  19. return v.size
  20. }
  21. func (v *ReceivingWindow) Position(idx uint32) uint32 {
  22. return (idx + v.start) % v.size
  23. }
  24. func (v *ReceivingWindow) Set(idx uint32, value *DataSegment) bool {
  25. pos := v.Position(idx)
  26. if v.list[pos] != nil {
  27. return false
  28. }
  29. v.list[pos] = value
  30. return true
  31. }
  32. func (v *ReceivingWindow) Remove(idx uint32) *DataSegment {
  33. pos := v.Position(idx)
  34. e := v.list[pos]
  35. v.list[pos] = nil
  36. return e
  37. }
  38. func (v *ReceivingWindow) RemoveFirst() *DataSegment {
  39. return v.Remove(0)
  40. }
  41. func (w *ReceivingWindow) HasFirst() bool {
  42. return w.list[w.Position(0)] != nil
  43. }
  44. func (v *ReceivingWindow) Advance() {
  45. v.start++
  46. if v.start == v.size {
  47. v.start = 0
  48. }
  49. }
  50. type AckList struct {
  51. writer SegmentWriter
  52. timestamps []uint32
  53. numbers []uint32
  54. nextFlush []uint32
  55. flushCandidates []uint32
  56. dirty bool
  57. }
  58. func NewAckList(writer SegmentWriter) *AckList {
  59. return &AckList{
  60. writer: writer,
  61. timestamps: make([]uint32, 0, 128),
  62. numbers: make([]uint32, 0, 128),
  63. nextFlush: make([]uint32, 0, 128),
  64. flushCandidates: make([]uint32, 0, 128),
  65. }
  66. }
  67. func (v *AckList) Add(number uint32, timestamp uint32) {
  68. v.timestamps = append(v.timestamps, timestamp)
  69. v.numbers = append(v.numbers, number)
  70. v.nextFlush = append(v.nextFlush, 0)
  71. v.dirty = true
  72. }
  73. func (v *AckList) Clear(una uint32) {
  74. count := 0
  75. for i := 0; i < len(v.numbers); i++ {
  76. if v.numbers[i] < una {
  77. continue
  78. }
  79. if i != count {
  80. v.numbers[count] = v.numbers[i]
  81. v.timestamps[count] = v.timestamps[i]
  82. v.nextFlush[count] = v.nextFlush[i]
  83. }
  84. count++
  85. }
  86. if count < len(v.numbers) {
  87. v.numbers = v.numbers[:count]
  88. v.timestamps = v.timestamps[:count]
  89. v.nextFlush = v.nextFlush[:count]
  90. v.dirty = true
  91. }
  92. }
  93. func (v *AckList) Flush(current uint32, rto uint32) {
  94. v.flushCandidates = v.flushCandidates[:0]
  95. seg := NewAckSegment()
  96. for i := 0; i < len(v.numbers); i++ {
  97. if v.nextFlush[i] > current {
  98. if len(v.flushCandidates) < cap(v.flushCandidates) {
  99. v.flushCandidates = append(v.flushCandidates, v.numbers[i])
  100. }
  101. continue
  102. }
  103. seg.PutNumber(v.numbers[i])
  104. seg.PutTimestamp(v.timestamps[i])
  105. timeout := rto / 2
  106. if timeout < 20 {
  107. timeout = 20
  108. }
  109. v.nextFlush[i] = current + timeout
  110. if seg.IsFull() {
  111. v.writer.Write(seg)
  112. seg.Release()
  113. seg = NewAckSegment()
  114. v.dirty = false
  115. }
  116. }
  117. if v.dirty || !seg.IsEmpty() {
  118. for _, number := range v.flushCandidates {
  119. if seg.IsFull() {
  120. break
  121. }
  122. seg.PutNumber(number)
  123. }
  124. v.writer.Write(seg)
  125. seg.Release()
  126. v.dirty = false
  127. }
  128. }
  129. type ReceivingWorker struct {
  130. sync.RWMutex
  131. conn *Connection
  132. leftOver *buf.Buffer
  133. window *ReceivingWindow
  134. acklist *AckList
  135. nextNumber uint32
  136. windowSize uint32
  137. }
  138. func NewReceivingWorker(kcp *Connection) *ReceivingWorker {
  139. worker := &ReceivingWorker{
  140. conn: kcp,
  141. window: NewReceivingWindow(kcp.Config.GetReceivingBufferSize()),
  142. windowSize: kcp.Config.GetReceivingInFlightSize(),
  143. }
  144. worker.acklist = NewAckList(worker)
  145. return worker
  146. }
  147. func (v *ReceivingWorker) Release() {
  148. v.Lock()
  149. v.leftOver.Release()
  150. v.Unlock()
  151. }
  152. func (v *ReceivingWorker) ProcessSendingNext(number uint32) {
  153. v.Lock()
  154. defer v.Unlock()
  155. v.acklist.Clear(number)
  156. }
  157. func (v *ReceivingWorker) ProcessSegment(seg *DataSegment) {
  158. v.Lock()
  159. defer v.Unlock()
  160. number := seg.Number
  161. idx := number - v.nextNumber
  162. if idx >= v.windowSize {
  163. return
  164. }
  165. v.acklist.Clear(seg.SendingNext)
  166. v.acklist.Add(number, seg.Timestamp)
  167. if !v.window.Set(idx, seg) {
  168. seg.Release()
  169. }
  170. }
  171. func (v *ReceivingWorker) Read(b []byte) int {
  172. v.Lock()
  173. defer v.Unlock()
  174. total := 0
  175. if v.leftOver != nil {
  176. nBytes := copy(b, v.leftOver.Bytes())
  177. if nBytes < v.leftOver.Len() {
  178. v.leftOver.SliceFrom(nBytes)
  179. return nBytes
  180. }
  181. v.leftOver.Release()
  182. v.leftOver = nil
  183. total += nBytes
  184. }
  185. for total < len(b) {
  186. seg := v.window.RemoveFirst()
  187. if seg == nil {
  188. break
  189. }
  190. v.window.Advance()
  191. v.nextNumber++
  192. nBytes := copy(b[total:], seg.Data.Bytes())
  193. total += nBytes
  194. if nBytes < seg.Data.Len() {
  195. seg.Data.SliceFrom(nBytes)
  196. v.leftOver = seg.Data
  197. seg.Data = nil
  198. seg.Release()
  199. break
  200. }
  201. seg.Release()
  202. }
  203. return total
  204. }
  205. func (w *ReceivingWorker) IsDataAvailable() bool {
  206. w.RLock()
  207. defer w.RUnlock()
  208. return w.window.HasFirst()
  209. }
  210. func (w *ReceivingWorker) NextNumber() uint32 {
  211. w.RLock()
  212. defer w.RUnlock()
  213. return w.nextNumber
  214. }
  215. func (v *ReceivingWorker) Flush(current uint32) {
  216. v.Lock()
  217. defer v.Unlock()
  218. v.acklist.Flush(current, v.conn.roundTrip.Timeout())
  219. }
  220. func (v *ReceivingWorker) Write(seg Segment) error {
  221. ackSeg := seg.(*AckSegment)
  222. ackSeg.Conv = v.conn.conv
  223. ackSeg.ReceivingNext = v.nextNumber
  224. ackSeg.ReceivingWindow = v.nextNumber + v.windowSize
  225. if v.conn.state == StateReadyToClose {
  226. ackSeg.Option = SegmentOptionClose
  227. }
  228. return v.conn.output.Write(ackSeg)
  229. }
  230. func (v *ReceivingWorker) CloseRead() {
  231. }
  232. func (v *ReceivingWorker) UpdateNecessary() bool {
  233. v.RLock()
  234. defer v.RUnlock()
  235. return len(v.acklist.numbers) > 0
  236. }