blob: 2daa698882d0e4bd7520a66525bef3aa92f148fc (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
package bufpool
import (
"log"
"sync"
)
var thePool bufPool
// Get retrieves a buffer of the appropriate length from the buffer pool or
// allocates a new one. Get may choose to ignore the pool and treat it as empty.
// Callers should not assume any relation between values passed to Put and the
// values returned by Get.
//
// If no suitable buffer exists in the pool, Get creates one.
func Get(length int) *Buffer {
return thePool.Get(length)
}
// Put returns a buffer to the buffer pool.
func Put(buf *Buffer) {
thePool.Put(buf)
}
type bufPool struct {
pools [steps]sync.Pool
}
func (p *bufPool) Get(length int) *Buffer {
if length > maxPoolSize {
return NewBuffer(make([]byte, length))
}
idx := index(length)
if bufIface := p.pools[idx].Get(); bufIface != nil {
buf := bufIface.(*Buffer)
unlock(buf)
if length > buf.Cap() {
log.Println(idx, buf.Len(), buf.Cap(), buf.String())
}
buf.buf = buf.buf[:length]
return buf
}
b := make([]byte, length, indexSize(idx))
return NewBuffer(b)
}
func (p *bufPool) Put(buf *Buffer) {
length := buf.Cap()
if length > maxPoolSize || length < minSize {
return // drop it
}
idx := prevIndex(length)
lock(buf)
p.pools[idx].Put(buf)
}
func lock(buf *Buffer) {
buf.buf = buf.buf[:cap(buf.buf)]
buf.off = cap(buf.buf) + 1
}
func unlock(buf *Buffer) {
buf.off = 0
}
|
