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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
package bytebufferpool
import (
"math/rand"
"testing"
"time"
)
func TestIndex(t *testing.T) {
testIndex(t, 0, 0)
testIndex(t, 1, 0)
testIndex(t, minSize-1, 0)
testIndex(t, minSize, 0)
testIndex(t, minSize+1, 1)
testIndex(t, 2*minSize-1, 1)
testIndex(t, 2*minSize, 1)
testIndex(t, 2*minSize+1, 2)
testIndex(t, maxSize-1, steps-1)
testIndex(t, maxSize, steps-1)
testIndex(t, maxSize+1, steps-1)
}
func testIndex(t *testing.T, n, expectedIdx int) {
idx := index(n)
if idx != expectedIdx {
t.Fatalf("unexpected idx for n=%d: %d. Expecting %d", n, idx, expectedIdx)
}
}
func TestPoolCalibrate(t *testing.T) {
for i := 0; i < steps*calibrateCallsThreshold; i++ {
n := 1004
if i%15 == 0 {
n = rand.Intn(15234)
}
testGetPut(t, n)
}
}
func TestPoolVariousSizesSerial(t *testing.T) {
testPoolVariousSizes(t)
}
func TestPoolVariousSizesConcurrent(t *testing.T) {
concurrency := 5
ch := make(chan struct{})
for i := 0; i < concurrency; i++ {
go func() {
testPoolVariousSizes(t)
ch <- struct{}{}
}()
}
for i := 0; i < concurrency; i++ {
select {
case <-ch:
case <-time.After(3 * time.Second):
t.Fatalf("timeout")
}
}
}
func testPoolVariousSizes(t *testing.T) {
for i := 0; i < steps+1; i++ {
n := (1 << uint32(i))
testGetPut(t, n)
testGetPut(t, n+1)
testGetPut(t, n-1)
for j := 0; j < 10; j++ {
testGetPut(t, j+n)
}
}
}
func testGetPut(t *testing.T, n int) {
bb := Get()
if len(bb.B) > 0 {
t.Fatalf("non-empty byte buffer returned from acquire")
}
bb.B = allocNBytes(bb.B, n)
Put(bb)
}
func allocNBytes(dst []byte, n int) []byte {
diff := n - cap(dst)
if diff <= 0 {
return dst[:n]
}
return append(dst, make([]byte, diff)...)
}
|
