mirror of
https://github.com/xtaci/kcp-go.git
synced 2026-10-20 08:16:39 +00:00
xtaci
2693fa8e71
Optimizations: - ringbuffer: optimize Len(), IsEmpty(), Discard(), Clear() methods with branchless arithmetic and simplified logic - fec: fix memory leak in shardHeap.Pop() by setting element to nil before truncating slice, preventing GC from holding stale references - timedsched: fix memory leak in timedFuncHeap.Pop() with same nil-before-truncate pattern; optimize prepend() using slice swap instead of append - autotune: add sortCache field to Autotuner to reuse slice allocation in FindPeriod(), avoiding repeated allocations during period detection - snmp: replace fmt.Sprint with strconv.FormatUint for better performance in Copy() and Reset() methods - entropy: remove defer overhead in rngAES.Read() and rngChacha8.Read() hot paths for reduced function call cost - bufferpool: pre-allocate ErrBufferPoolSizeExceeded error; reset slice length on Put() to allow proper reuse - sess: remove defer overhead in 6 setter methods (SetWriteDelay, SetWindowSize, SetStreamMode, SetACKNoDelay, SetDUP, SetNoDelay) These changes reduce memory allocations, fix potential memory leaks in heap-based data structures, and eliminate defer overhead in frequently called methods.
66 lines
2.1 KiB
Go
66 lines
2.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 (
|
|
"errors"
|
|
"sync"
|
|
)
|
|
|
|
// pre-allocated error to avoid repeated allocations
|
|
var errBufferSizeMismatch = errors.New("buffer size mismatch")
|
|
|
|
// A system-wide packet buffer shared among sending, receiving and FEC
|
|
// to mitigate high-frequency memory allocation of packets.
|
|
var defaultBufferPool = newBufferPool(mtuLimit)
|
|
|
|
type bufferPool struct {
|
|
xmitBuf sync.Pool
|
|
}
|
|
|
|
// newBufferPool creates a new buffer pool with buffers of the given size.
|
|
func newBufferPool(size int) *bufferPool {
|
|
return &bufferPool{
|
|
xmitBuf: sync.Pool{
|
|
New: func() any {
|
|
return make([]byte, size)
|
|
},
|
|
},
|
|
}
|
|
}
|
|
|
|
// Get retrieves a buffer from the pool.
|
|
func (bp *bufferPool) Get() []byte {
|
|
return bp.xmitBuf.Get().([]byte)
|
|
}
|
|
|
|
// Put returns a buffer to the pool.
|
|
func (bp *bufferPool) Put(buf []byte) error {
|
|
// Only put back buffers of the correct size.
|
|
if cap(buf) != mtuLimit {
|
|
return errBufferSizeMismatch
|
|
}
|
|
bp.xmitBuf.Put(buf[:cap(buf)]) // reset slice length to full capacity
|
|
return nil
|
|
}
|