1
0
mirror of https://github.com/v2fly/v2ray-core.git synced 2024-11-20 03:16:24 -05:00
v2fly/common/alloc/buffer.go
2016-01-10 10:50:36 +01:00

133 lines
2.8 KiB
Go

package alloc
import (
"sync"
)
// Buffer is a recyclable allocation of a byte array. Buffer.Release() recycles
// the buffer into an internal buffer pool, in order to recreate a buffer more
// quickly.
type Buffer struct {
head []byte
pool *bufferPool
Value []byte
}
// Release recycles the buffer into an internal buffer pool.
func (b *Buffer) Release() {
b.pool.free(b)
b.head = nil
b.Value = nil
b.pool = nil
}
// Clear clears the content of the buffer, results an empty buffer with
// Len() = 0.
func (b *Buffer) Clear() *Buffer {
b.Value = b.head[:0]
return b
}
// AppendBytes appends one or more bytes to the end of the buffer.
func (b *Buffer) AppendBytes(bytes ...byte) *Buffer {
b.Value = append(b.Value, bytes...)
return b
}
// Append appends a byte array to the end of the buffer.
func (b *Buffer) Append(data []byte) *Buffer {
b.Value = append(b.Value, data...)
return b
}
func (b *Buffer) Bytes() []byte {
return b.Value
}
// Slice cuts the buffer at the given position.
func (b *Buffer) Slice(from, to int) *Buffer {
b.Value = b.Value[from:to]
return b
}
// SliceFrom cuts the buffer at the given position.
func (b *Buffer) SliceFrom(from int) *Buffer {
b.Value = b.Value[from:]
return b
}
// Len returns the length of the buffer content.
func (b *Buffer) Len() int {
return len(b.Value)
}
// IsFull returns true if the buffer has no more room to grow.
func (b *Buffer) IsFull() bool {
return len(b.Value) == cap(b.Value)
}
// Write implements Write method in io.Writer.
func (b *Buffer) Write(data []byte) (int, error) {
b.Append(data)
return len(data), nil
}
type bufferPool struct {
chain chan []byte
allocator *sync.Pool
}
func newBufferPool(bufferSize, poolSize int) *bufferPool {
pool := &bufferPool{
chain: make(chan []byte, poolSize),
allocator: &sync.Pool{
New: func() interface{} { return make([]byte, bufferSize) },
},
}
for i := 0; i < poolSize; i++ {
pool.chain <- make([]byte, bufferSize)
}
return pool
}
func (p *bufferPool) allocate() *Buffer {
var b []byte
select {
case b = <-p.chain:
default:
b = p.allocator.Get().([]byte)
}
return &Buffer{
head: b,
pool: p,
Value: b,
}
}
func (p *bufferPool) free(buffer *Buffer) {
select {
case p.chain <- buffer.head:
default:
p.allocator.Put(buffer.head)
}
}
var smallPool = newBufferPool(1024, 256)
var mediumPool = newBufferPool(8*1024, 512)
var largePool = newBufferPool(64*1024, 128)
// NewSmallBuffer creates a Buffer with 1K bytes of arbitrary content.
func NewSmallBuffer() *Buffer {
return smallPool.allocate()
}
// NewBuffer creates a Buffer with 8K bytes of arbitrary content.
func NewBuffer() *Buffer {
return mediumPool.allocate()
}
// NewLargeBuffer creates a Buffer with 64K bytes of arbitrary content.
func NewLargeBuffer() *Buffer {
return largePool.allocate()
}