forked from 0xPolygon/polygon-edge
/
nodepool.go
121 lines (90 loc) · 2.83 KB
/
nodepool.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
package itrie
import "sync"
const (
nodePoolBatchAlloc = 1024
)
type NodePool struct {
valueNodePool []*ValueNode
shortNodePool []*ShortNode
fullNodePool []*FullNode
valueNodePreAllocMux sync.Mutex
shortNodePreAllocMux sync.Mutex
fullNodePreAllocMux sync.Mutex
}
func NewNodePool() *NodePool {
return &NodePool{
valueNodePool: make([]*ValueNode, 0, nodePoolBatchAlloc),
shortNodePool: make([]*ShortNode, 0, nodePoolBatchAlloc),
fullNodePool: make([]*FullNode, 0, nodePoolBatchAlloc),
}
}
//nolint:dupl
func (np *NodePool) GetValueNode() *ValueNode {
np.valueNodePreAllocMux.Lock()
defer np.valueNodePreAllocMux.Unlock()
if len(np.valueNodePool) > 0 {
node := np.valueNodePool[len(np.valueNodePool)-1]
np.valueNodePool = np.valueNodePool[:len(np.valueNodePool)-1]
return node
}
// pre-allocate 1024 value node
// clear pool and reset size
np.valueNodePool = np.valueNodePool[0:nodePoolBatchAlloc]
nodes := make([]ValueNode, nodePoolBatchAlloc)
bufs := make([][32]byte, nodePoolBatchAlloc)
for i := 0; i < nodePoolBatchAlloc; i++ {
nodes[i].buf = bufs[i][:0]
np.valueNodePool[i] = &nodes[i]
}
// return last one
node := np.valueNodePool[len(np.valueNodePool)-1]
np.valueNodePool = np.valueNodePool[:len(np.valueNodePool)-1]
return node
}
func (np *NodePool) GetShortNode() *ShortNode {
np.shortNodePreAllocMux.Lock()
defer np.shortNodePreAllocMux.Unlock()
if len(np.shortNodePool) > 0 {
node := np.shortNodePool[len(np.shortNodePool)-1]
np.shortNodePool = np.shortNodePool[:len(np.shortNodePool)-1]
return node
}
// pre-allocate 1024 value node
// clear pool and reset size
np.shortNodePool = np.shortNodePool[0:nodePoolBatchAlloc]
nodes := make([]ShortNode, nodePoolBatchAlloc)
hash := make([][32]byte, nodePoolBatchAlloc)
keys := make([][32]byte, nodePoolBatchAlloc)
for i := 0; i < nodePoolBatchAlloc; i++ {
nodes[i].hash = hash[i][:0]
nodes[i].key = keys[i][:0]
np.shortNodePool[i] = &nodes[i]
}
// return last one
node := np.shortNodePool[len(np.shortNodePool)-1]
np.shortNodePool = np.shortNodePool[:len(np.shortNodePool)-1]
return node
}
//nolint:dupl
func (np *NodePool) GetFullNode() *FullNode {
np.fullNodePreAllocMux.Lock()
defer np.fullNodePreAllocMux.Unlock()
if len(np.fullNodePool) > 0 {
node := np.fullNodePool[len(np.fullNodePool)-1]
np.fullNodePool = np.fullNodePool[:len(np.fullNodePool)-1]
return node
}
// pre-allocate 1024 value node
// clear pool and reset size
np.fullNodePool = np.fullNodePool[0:nodePoolBatchAlloc]
nodes := make([]FullNode, nodePoolBatchAlloc)
hash := make([][32]byte, nodePoolBatchAlloc)
for i := 0; i < nodePoolBatchAlloc; i++ {
nodes[i].hash = hash[i][:0]
np.fullNodePool[i] = &nodes[i]
}
// return last one
node := np.fullNodePool[len(np.fullNodePool)-1]
np.fullNodePool = np.fullNodePool[:len(np.fullNodePool)-1]
return node
}