mirror of
https://github.com/xtaci/kcp-go.git
synced 2026-10-20 08:16:39 +00:00
293 lines
7.1 KiB
Go
293 lines
7.1 KiB
Go
// The MIT License (MIT)
|
|
//
|
|
// Copyright (c) 2015 xtaci
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included in all
|
|
// copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
// SOFTWARE.
|
|
|
|
package kcp
|
|
|
|
import (
|
|
"container/heap"
|
|
"io"
|
|
"log/slog"
|
|
"sync"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/xtaci/lossyconn"
|
|
)
|
|
|
|
const repeat = 16
|
|
|
|
func TestLossyConn1(t *testing.T) {
|
|
t.Log("testing loss rate 10%, rtt 200ms")
|
|
t.Log("testing link with nodelay parameters:1 10 2 1")
|
|
client, err := lossyconn.NewLossyConn(0.1, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
|
|
server, err := lossyconn.NewLossyConn(0.1, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
testlink(t, client, server, 1, 10, 2, 1)
|
|
}
|
|
|
|
func TestLossyConn2(t *testing.T) {
|
|
t.Log("testing loss rate 20%, rtt 200ms")
|
|
t.Log("testing link with nodelay parameters:1 10 2 1")
|
|
client, err := lossyconn.NewLossyConn(0.2, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
|
|
server, err := lossyconn.NewLossyConn(0.2, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
testlink(t, client, server, 1, 10, 2, 1)
|
|
}
|
|
|
|
func TestLossyConn3(t *testing.T) {
|
|
t.Log("testing loss rate 30%, rtt 200ms")
|
|
t.Log("testing link with nodelay parameters:1 10 2 1")
|
|
client, err := lossyconn.NewLossyConn(0.3, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
|
|
server, err := lossyconn.NewLossyConn(0.3, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
testlink(t, client, server, 1, 10, 2, 1)
|
|
}
|
|
|
|
func TestLossyConn4(t *testing.T) {
|
|
t.Log("testing loss rate 10%, rtt 200ms")
|
|
t.Log("testing link with nodelay parameters:1 10 2 0")
|
|
client, err := lossyconn.NewLossyConn(0.1, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
|
|
server, err := lossyconn.NewLossyConn(0.1, 100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
return
|
|
}
|
|
testlink(t, client, server, 1, 10, 2, 0)
|
|
}
|
|
|
|
func testlink(t *testing.T, client *lossyconn.LossyConn, server *lossyconn.LossyConn, nodelay, interval, resend, nc int) {
|
|
t.Log("testing with nodelay parameters:", nodelay, interval, resend, nc)
|
|
sess, _ := NewConn2(server.LocalAddr(), nil, 0, 0, client)
|
|
listener, _ := ServeConn(nil, 0, 0, server)
|
|
echoServer := func(l *Listener) {
|
|
for {
|
|
conn, err := l.AcceptKCP()
|
|
if err != nil {
|
|
return
|
|
}
|
|
go func() {
|
|
conn.SetNoDelay(nodelay, interval, resend, nc)
|
|
buf := make([]byte, 65536)
|
|
for {
|
|
n, err := conn.Read(buf)
|
|
if err != nil {
|
|
return
|
|
}
|
|
conn.Write(buf[:n])
|
|
}
|
|
}()
|
|
}
|
|
}
|
|
|
|
echoTester := func(s *UDPSession) {
|
|
s.SetNoDelay(nodelay, interval, resend, nc)
|
|
buf := make([]byte, 64)
|
|
var rtt time.Duration
|
|
for range repeat {
|
|
start := time.Now()
|
|
s.Write(buf)
|
|
io.ReadFull(s, buf)
|
|
rtt += time.Since(start)
|
|
}
|
|
|
|
t.Log("client:", client)
|
|
t.Log("server:", server)
|
|
t.Log("avg rtt:", rtt/repeat)
|
|
t.Logf("total time: %v for %v round trip:", rtt, repeat)
|
|
}
|
|
|
|
go echoServer(listener)
|
|
echoTester(sess)
|
|
}
|
|
|
|
func BenchmarkFlush(b *testing.B) {
|
|
kcp := NewKCP(1, func(buf []byte, size int) {})
|
|
kcp.snd_buf = NewRingBuffer[segment](1024)
|
|
for range kcp.snd_buf.MaxLen() {
|
|
kcp.snd_buf.Push(segment{xmit: 1, resendts: currentMs() + 10000})
|
|
}
|
|
|
|
b.ReportAllocs()
|
|
var mu sync.Mutex
|
|
for b.Loop() {
|
|
mu.Lock()
|
|
kcp.flush(IKCP_FLUSH_FULL)
|
|
mu.Unlock()
|
|
}
|
|
}
|
|
|
|
// TestSegmentHeap tests the segmentHeap data structure
|
|
func TestSegmentHeap(t *testing.T) {
|
|
h := newSegmentHeap()
|
|
segments := []segment{
|
|
{sn: 1},
|
|
{sn: 2},
|
|
{sn: 3},
|
|
}
|
|
|
|
for _, seg := range segments {
|
|
heap.Push(h, seg)
|
|
t.Logf("pushed segment with seq %d", seg.sn)
|
|
}
|
|
|
|
if h.Len() != len(segments) {
|
|
t.Errorf("expected length %d, got %d", len(segments), h.Len())
|
|
}
|
|
|
|
for i := range segments {
|
|
seg := heap.Pop(h).(segment)
|
|
if seg.sn != segments[i].sn {
|
|
t.Errorf("expected seq %d, got %d", segments[i].sn, seg.sn)
|
|
}
|
|
}
|
|
}
|
|
|
|
// BenchmarkDebugLog test DebugLog cost time with build tags debug on/off
|
|
// trace log on:
|
|
//
|
|
// go test -benchmem -run=^$ -bench ^BenchmarkDebugLog$ -tags debug
|
|
//
|
|
// trace log off:
|
|
func TestSetMtuBoundary(t *testing.T) {
|
|
kcp := NewKCP(0, func(buf []byte, size int) {})
|
|
|
|
tests := []struct {
|
|
name string
|
|
mtu int
|
|
want int // 0 = success, -1 = failure
|
|
}{
|
|
{"negative", -1, -1},
|
|
{"zero", 0, -1},
|
|
{"below overhead", IKCP_OVERHEAD - 1, -1},
|
|
{"equal overhead", IKCP_OVERHEAD, -1},
|
|
{"one above overhead (minimum valid)", IKCP_OVERHEAD + 1, 0},
|
|
{"typical MTU", 1400, 0},
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
got := kcp.SetMtu(tt.mtu)
|
|
if got != tt.want {
|
|
t.Errorf("SetMtu(%d) = %d, want %d", tt.mtu, got, tt.want)
|
|
}
|
|
})
|
|
}
|
|
|
|
// verify mss is correctly derived after a valid SetMtu
|
|
kcp.SetMtu(1400)
|
|
if kcp.mss != 1400-IKCP_OVERHEAD {
|
|
t.Errorf("mss = %d, want %d", kcp.mss, 1400-IKCP_OVERHEAD)
|
|
}
|
|
|
|
// minimum valid MTU yields mss = 1
|
|
kcp.SetMtu(IKCP_OVERHEAD + 1)
|
|
if kcp.mss != 1 {
|
|
t.Errorf("mss = %d, want 1 for minimum valid MTU", kcp.mss)
|
|
}
|
|
}
|
|
|
|
// go test -benchmem -run=^$ -bench ^BenchmarkDebugLog$
|
|
func BenchmarkDebugLog(b *testing.B) {
|
|
kcp := &KCP{
|
|
conv: 123,
|
|
snd_wnd: 456,
|
|
}
|
|
kcp.log = slog.Debug
|
|
|
|
for b.Loop() {
|
|
// In release mode, this line of code will be completely 'erased' by the compiler,
|
|
// as if it doesn't exist at all, and even the parameter's interface conversion will not occur.
|
|
kcp.debugLog(IKCP_LOG_OUT_WASK, "conv", kcp.conv, "wnd", kcp.snd_wnd)
|
|
}
|
|
}
|
|
|
|
func TestSetMtuRetainsBufferForQueuedOldMssSegment(t *testing.T) {
|
|
tests := []struct {
|
|
name string
|
|
queue bool
|
|
}{
|
|
{name: "in-flight"},
|
|
{name: "pending", queue: true},
|
|
}
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
var packets [][]byte
|
|
kcp := NewKCP(1, func(buf []byte, size int) {
|
|
if size > 0 {
|
|
packets = append(packets, append([]byte(nil), buf[:size]...))
|
|
}
|
|
})
|
|
oldData := make([]byte, 1000)
|
|
segment := segment{cmd: IKCP_CMD_PUSH, xmit: 1, resendts: 0, data: oldData}
|
|
if tt.queue {
|
|
kcp.snd_queue.Push(segment)
|
|
kcp.cwnd = 1
|
|
} else {
|
|
segment.sn = 0
|
|
kcp.snd_buf.Push(segment)
|
|
kcp.snd_nxt = 1
|
|
}
|
|
|
|
if got := kcp.SetMtu(25); got != 0 {
|
|
t.Fatalf("SetMtu(25) = %d, want 0", got)
|
|
}
|
|
kcp.flush(IKCP_FLUSH_FULL)
|
|
|
|
if len(packets) != 1 {
|
|
t.Fatalf("got %d output packets, want 1", len(packets))
|
|
}
|
|
if got, want := len(packets[0]), IKCP_OVERHEAD+len(oldData); got != want {
|
|
t.Fatalf("output packet size = %d, want %d", got, want)
|
|
}
|
|
})
|
|
}
|
|
}
|