/
bucketized.go
124 lines (106 loc) · 3.39 KB
/
bucketized.go
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
// Copyright (c) 2016 Uber Technologies, Inc.
//
// 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 pool
import (
"fmt"
"sort"
"github.com/uber-go/tally"
)
type bucketPool struct {
capacity int
pool ObjectPool
}
type bucketizedObjectPool struct {
sizesAsc []Bucket
buckets []bucketPool
maxBucketCapacity int
opts ObjectPoolOptions
alloc BucketizedAllocator
maxAlloc tally.Counter
}
// NewBucketizedObjectPool creates a bucketized object pool
func NewBucketizedObjectPool(sizes []Bucket, opts ObjectPoolOptions) BucketizedObjectPool {
if opts == nil {
opts = NewObjectPoolOptions()
}
sizesAsc := make([]Bucket, len(sizes))
copy(sizesAsc, sizes)
sort.Sort(BucketByCapacity(sizesAsc))
var maxBucketCapacity int
if len(sizesAsc) != 0 {
maxBucketCapacity = sizesAsc[len(sizesAsc)-1].Capacity
}
iopts := opts.InstrumentOptions()
return &bucketizedObjectPool{
opts: opts,
sizesAsc: sizesAsc,
maxBucketCapacity: maxBucketCapacity,
maxAlloc: iopts.MetricsScope().Counter("alloc-max"),
}
}
func (p *bucketizedObjectPool) Init(alloc BucketizedAllocator) {
buckets := make([]bucketPool, len(p.sizesAsc))
for i := range p.sizesAsc {
size := p.sizesAsc[i].Count
capacity := p.sizesAsc[i].Capacity
opts := p.opts
if perBucketOpts := p.sizesAsc[i].Options; perBucketOpts != nil {
opts = perBucketOpts
}
opts = opts.SetSize(size)
iopts := opts.InstrumentOptions()
if iopts.MetricsScope() != nil {
opts = opts.SetInstrumentOptions(iopts.SetMetricsScope(
iopts.MetricsScope().Tagged(map[string]string{
"bucket-capacity": fmt.Sprintf("%d", capacity),
})))
}
buckets[i].capacity = capacity
buckets[i].pool = NewObjectPool(opts)
buckets[i].pool.Init(func() interface{} {
return alloc(capacity)
})
}
p.buckets = buckets
p.alloc = alloc
}
func (p *bucketizedObjectPool) Get(capacity int) interface{} {
if capacity > p.maxBucketCapacity {
p.maxAlloc.Inc(1)
return p.alloc(capacity)
}
for i := range p.buckets {
if p.buckets[i].capacity >= capacity {
return p.buckets[i].pool.Get()
}
}
return p.alloc(capacity)
}
func (p *bucketizedObjectPool) Put(obj interface{}, capacity int) {
if capacity > p.maxBucketCapacity {
return
}
for i := len(p.buckets) - 1; i >= 0; i-- {
if capacity >= p.buckets[i].capacity {
p.buckets[i].pool.Put(obj)
return
}
}
}