relay.go 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211
  1. package tuic
  2. import (
  3. "errors"
  4. "net"
  5. "sync"
  6. "sync/atomic"
  7. "time"
  8. )
  9. // A QUIC flow the sidecar has not touched for this long is forgotten; QUIC's
  10. // own max_idle_time (15s by default) closes the session well before that.
  11. const relayFlowIdle = 2 * time.Minute
  12. const (
  13. relaySocketBuffer = 4 << 20
  14. maxRelayFlows = 4096
  15. )
  16. // udpRelay owns an inbound's public UDP port and counts the bytes it forwards to
  17. // the sidecar on loopback: tuic-server has no stats API and /proc/io stays at 0.
  18. type udpRelay struct {
  19. public *net.UDPConn
  20. upstream *net.UDPAddr
  21. idle time.Duration
  22. maxFlows int
  23. up atomic.Int64
  24. down atomic.Int64
  25. mu sync.Mutex
  26. flows map[string]*relayFlow
  27. done chan struct{}
  28. closeOnce sync.Once
  29. wg sync.WaitGroup
  30. }
  31. type relayFlow struct {
  32. conn *net.UDPConn
  33. client *net.UDPAddr
  34. lastSeen atomic.Int64
  35. }
  36. func startUDPRelay(bind string, upstream *net.UDPAddr, idle time.Duration) (*udpRelay, error) {
  37. addr, err := net.ResolveUDPAddr("udp", bind)
  38. if err != nil {
  39. return nil, err
  40. }
  41. public, err := net.ListenUDP("udp", addr)
  42. if err != nil {
  43. return nil, err
  44. }
  45. _ = public.SetReadBuffer(relaySocketBuffer)
  46. _ = public.SetWriteBuffer(relaySocketBuffer)
  47. r := &udpRelay{
  48. public: public,
  49. upstream: upstream,
  50. idle: idle,
  51. maxFlows: maxRelayFlows,
  52. flows: make(map[string]*relayFlow),
  53. done: make(chan struct{}),
  54. }
  55. r.wg.Add(2)
  56. go r.serve()
  57. go r.sweep()
  58. return r, nil
  59. }
  60. func freeLoopbackUDPPort() (int, error) {
  61. c, err := net.ListenUDP("udp", &net.UDPAddr{IP: net.IPv4(127, 0, 0, 1)})
  62. if err != nil {
  63. return 0, err
  64. }
  65. defer c.Close()
  66. return c.LocalAddr().(*net.UDPAddr).Port, nil
  67. }
  68. func (r *udpRelay) LocalAddr() net.Addr {
  69. return r.public.LocalAddr()
  70. }
  71. // CollectTraffic returns the client-to-sidecar and sidecar-to-client bytes
  72. // relayed since the previous call.
  73. func (r *udpRelay) CollectTraffic() (up, down int64) {
  74. return r.up.Swap(0), r.down.Swap(0)
  75. }
  76. func (r *udpRelay) Close() {
  77. if r == nil {
  78. return
  79. }
  80. r.closeOnce.Do(func() {
  81. close(r.done)
  82. _ = r.public.Close()
  83. r.mu.Lock()
  84. for key, f := range r.flows {
  85. _ = f.conn.Close()
  86. delete(r.flows, key)
  87. }
  88. r.mu.Unlock()
  89. r.wg.Wait()
  90. })
  91. }
  92. func (r *udpRelay) serve() {
  93. defer r.wg.Done()
  94. buf := make([]byte, 65535)
  95. for {
  96. n, client, err := r.public.ReadFromUDP(buf)
  97. if err != nil {
  98. if errors.Is(err, net.ErrClosed) {
  99. return
  100. }
  101. continue
  102. }
  103. flow, err := r.flowFor(client)
  104. if err != nil {
  105. continue
  106. }
  107. if _, err := flow.conn.Write(buf[:n]); err == nil {
  108. r.up.Add(int64(n))
  109. }
  110. }
  111. }
  112. func (r *udpRelay) flowFor(client *net.UDPAddr) (*relayFlow, error) {
  113. key := client.String()
  114. now := time.Now().UnixMilli()
  115. r.mu.Lock()
  116. defer r.mu.Unlock()
  117. select {
  118. case <-r.done:
  119. return nil, net.ErrClosed
  120. default:
  121. }
  122. if f, ok := r.flows[key]; ok {
  123. f.lastSeen.Store(now)
  124. return f, nil
  125. }
  126. if len(r.flows) >= r.maxFlows {
  127. r.evictLeastRecentLocked()
  128. }
  129. conn, err := net.DialUDP("udp", nil, r.upstream)
  130. if err != nil {
  131. return nil, err
  132. }
  133. _ = conn.SetReadBuffer(relaySocketBuffer)
  134. _ = conn.SetWriteBuffer(relaySocketBuffer)
  135. f := &relayFlow{conn: conn, client: client}
  136. f.lastSeen.Store(now)
  137. r.flows[key] = f
  138. r.wg.Add(1)
  139. go r.pump(f)
  140. return f, nil
  141. }
  142. // Refusing a newcomer at the cap let 4096 junk datagrams lock every new client
  143. // out until the sweep; the flow last seen longest ago is the junk one.
  144. func (r *udpRelay) evictLeastRecentLocked() {
  145. var oldestKey string
  146. oldest := int64(-1)
  147. for key, f := range r.flows {
  148. if seen := f.lastSeen.Load(); oldest < 0 || seen < oldest {
  149. oldest, oldestKey = seen, key
  150. }
  151. }
  152. if f, ok := r.flows[oldestKey]; ok {
  153. _ = f.conn.Close()
  154. delete(r.flows, oldestKey)
  155. }
  156. }
  157. func (r *udpRelay) pump(f *relayFlow) {
  158. defer r.wg.Done()
  159. buf := make([]byte, 65535)
  160. for {
  161. n, err := f.conn.Read(buf)
  162. if err != nil {
  163. if errors.Is(err, net.ErrClosed) {
  164. return
  165. }
  166. // ICMP unreachable while the sidecar restarts: drop it, keep the flow.
  167. time.Sleep(20 * time.Millisecond)
  168. continue
  169. }
  170. if _, err := r.public.WriteToUDP(buf[:n], f.client); err == nil {
  171. r.down.Add(int64(n))
  172. }
  173. f.lastSeen.Store(time.Now().UnixMilli())
  174. }
  175. }
  176. func (r *udpRelay) sweep() {
  177. defer r.wg.Done()
  178. ticker := time.NewTicker(r.idle / 2)
  179. defer ticker.Stop()
  180. for {
  181. select {
  182. case <-r.done:
  183. return
  184. case <-ticker.C:
  185. cutoff := time.Now().Add(-r.idle).UnixMilli()
  186. r.mu.Lock()
  187. for key, f := range r.flows {
  188. if f.lastSeen.Load() < cutoff {
  189. _ = f.conn.Close()
  190. delete(r.flows, key)
  191. }
  192. }
  193. r.mu.Unlock()
  194. }
  195. }
  196. }