-
Notifications
You must be signed in to change notification settings - Fork 22
/
pools.go
137 lines (116 loc) · 2.99 KB
/
pools.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
125
126
127
128
129
130
131
132
133
134
135
136
137
/*
* Copyright 2022 ByteDance Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package encoder
import (
`sync`
`github.com/cloudwego/frugal/internal/rt`
)
var (
programPool sync.Pool
compilerPool sync.Pool
basicBlockPool sync.Pool
graphBuilderPool sync.Pool
runtimeStatePool sync.Pool
optimizerStatePool sync.Pool
)
func newProgram() Program {
if v := programPool.Get(); v != nil {
return v.(Program)[:0]
} else {
return make(Program, 0, 16)
}
}
func freeProgram(p Program) {
programPool.Put(p)
}
func newCompiler() Compiler {
if v := compilerPool.Get(); v != nil {
return v.(Compiler)
} else {
return make(Compiler)
}
}
func freeCompiler(p Compiler) {
compilerPool.Put(p)
}
func resetCompiler(p Compiler) Compiler {
rt.MapClear(p)
return p
}
func newBasicBlock() *BasicBlock {
if v := basicBlockPool.Get(); v != nil {
return v.(*BasicBlock)
} else {
return new(BasicBlock)
}
}
func freeBasicBlock(p *BasicBlock) {
basicBlockPool.Put(p)
}
func newGraphBuilder() *GraphBuilder {
if v := graphBuilderPool.Get(); v == nil {
return allocGraphBuilder()
} else {
return resetGraphBuilder(v.(*GraphBuilder))
}
}
func freeGraphBuilder(p *GraphBuilder) {
graphBuilderPool.Put(p)
}
func allocGraphBuilder() *GraphBuilder {
return &GraphBuilder {
Pin : make(map[int]bool),
Graph : make(map[int]*BasicBlock),
}
}
func resetGraphBuilder(p *GraphBuilder) *GraphBuilder {
rt.MapClear(p.Pin)
rt.MapClear(p.Graph)
return p
}
func newRuntimeState() *RuntimeState {
if v := runtimeStatePool.Get(); v != nil {
return v.(*RuntimeState)
} else {
return new(RuntimeState)
}
}
func freeRuntimeState(p *RuntimeState) {
runtimeStatePool.Put(p)
}
func newOptimizerState() *_OptimizerState {
if v := optimizerStatePool.Get(); v == nil {
return allocOptimizerState()
} else {
return resetOptimizerState(v.(*_OptimizerState))
}
}
func freeOptimizerState(p *_OptimizerState) {
optimizerStatePool.Put(p)
}
func allocOptimizerState() *_OptimizerState {
return &_OptimizerState {
buf : make([]*BasicBlock, 0, 16),
refs : make(map[int]int),
mask : make(map[*BasicBlock]bool),
}
}
func resetOptimizerState(p *_OptimizerState) *_OptimizerState {
p.buf = p.buf[:0]
rt.MapClear(p.refs)
rt.MapClear(p.mask)
return p
}