-
Notifications
You must be signed in to change notification settings - Fork 454
/
mutable_series_iterators_pool.go
104 lines (93 loc) · 3.15 KB
/
mutable_series_iterators_pool.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
// 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 encoding
import (
"sort"
"github.com/m3db/m3/src/x/pool"
)
type seriesIteratorsPool struct {
sizesAsc []pool.Bucket
buckets []seriesIteratorArrayPoolBucket
maxBucketCapacity int
}
type seriesIteratorArrayPoolBucket struct {
capacity int
values chan MutableSeriesIterators
}
// NewMutableSeriesIteratorsPool creates a new pool
func NewMutableSeriesIteratorsPool(sizes []pool.Bucket) MutableSeriesIteratorsPool {
sizesAsc := make([]pool.Bucket, len(sizes))
copy(sizesAsc, sizes)
sort.Sort(pool.BucketByCapacity(sizesAsc))
var maxBucketCapacity int
if len(sizesAsc) != 0 {
maxBucketCapacity = sizesAsc[len(sizesAsc)-1].Capacity
}
return &seriesIteratorsPool{sizesAsc: sizesAsc, maxBucketCapacity: maxBucketCapacity}
}
func (p *seriesIteratorsPool) alloc(capacity int) MutableSeriesIterators {
iters := make([]SeriesIterator, 0, capacity)
return NewSeriesIterators(iters, p)
}
func (p *seriesIteratorsPool) Init() {
buckets := make([]seriesIteratorArrayPoolBucket, len(p.sizesAsc))
for i := range p.sizesAsc {
buckets[i].capacity = p.sizesAsc[i].Capacity
buckets[i].values = make(chan MutableSeriesIterators, p.sizesAsc[i].Count)
for j := 0; j < p.sizesAsc[i].Count; j++ {
buckets[i].values <- p.alloc(p.sizesAsc[i].Capacity)
}
}
p.buckets = buckets
}
func (p *seriesIteratorsPool) Get(capacity int) MutableSeriesIterators {
if capacity > p.maxBucketCapacity {
return p.alloc(capacity)
}
for i := range p.buckets {
if p.buckets[i].capacity >= capacity {
select {
case b := <-p.buckets[i].values:
return b
default:
// NB(r): use the bucket's capacity so can potentially
// be returned to pool when it's finished with.
return p.alloc(p.buckets[i].capacity)
}
}
}
return p.alloc(capacity)
}
func (p *seriesIteratorsPool) Put(iters MutableSeriesIterators) {
capacity := iters.Cap()
if capacity > p.maxBucketCapacity {
return
}
for i := range p.buckets {
if p.buckets[i].capacity >= capacity {
select {
case p.buckets[i].values <- iters:
return
default:
return
}
}
}
}