forked from mediocregopher/radix
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pipeliner.go
248 lines (201 loc) · 4.87 KB
/
pipeliner.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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
package radix
import (
"strings"
"sync"
"time"
)
var blockingCmds = map[string]bool{
"WAIT": true,
// taken from https://github.com/joomcode/redispipe#limitations
"BLPOP": true,
"BRPOP": true,
"BRPOPLPUSH": true,
"BZPOPMIN": true,
"BZPOPMAX": true,
"XREAD": true,
"XREADGROUP": true,
"SAVE": true,
}
type pipeliner struct {
c Client
limit int
window time.Duration
// reqsBufCh contains buffers for collecting commands and acts as a semaphore
// to limit the number of concurrent flushes.
reqsBufCh chan []CmdAction
reqCh chan *pipelinerCmd
reqWG sync.WaitGroup
l sync.RWMutex
closed bool
}
var _ Client = (*pipeliner)(nil)
func newPipeliner(c Client, concurrency, limit int, window time.Duration) *pipeliner {
if concurrency < 1 {
concurrency = 1
}
p := &pipeliner{
c: c,
limit: limit,
window: window,
reqsBufCh: make(chan []CmdAction, concurrency),
reqCh: make(chan *pipelinerCmd, 32), // https://xkcd.com/221/
}
p.reqWG.Add(1)
go func() {
defer p.reqWG.Done()
p.reqLoop()
}()
for i := 0; i < cap(p.reqsBufCh); i++ {
if p.limit > 0 {
p.reqsBufCh <- make([]CmdAction, 0, limit)
} else {
p.reqsBufCh <- nil
}
}
return p
}
// CanDo checks if the given Action can be executed / passed to p.Do.
//
// If CanDo returns false, the Action must not be given to Do.
func (p *pipeliner) CanDo(a Action) bool {
// there is currently no way to get the command for CmdAction implementations
// from outside the radix package so we can not multiplex those commands. User
// defined pipelines are not pipelined to let the user better control them.
if cmdA, ok := a.(*cmdAction); ok {
return !blockingCmds[strings.ToUpper(cmdA.cmd)]
}
return false
}
// Do executes the given Action as part of the pipeline.
//
// If a is not a CmdAction, Do panics.
func (p *pipeliner) Do(a Action) error {
req := getPipelinerCmd(a.(CmdAction)) // get this outside the lock to avoid
p.l.RLock()
if p.closed {
p.l.RUnlock()
return errClientClosed
}
p.reqCh <- req
p.l.RUnlock()
err := <-req.resCh
poolPipelinerCmd(req)
return err
}
// Close closes the pipeliner and makes sure that all background goroutines
// are stopped before returning.
//
// Close does *not* close the underlying Client.
func (p *pipeliner) Close() error {
p.l.Lock()
defer p.l.Unlock()
if p.closed {
return nil
}
close(p.reqCh)
p.reqWG.Wait()
for i := 0; i < cap(p.reqsBufCh); i++ {
<-p.reqsBufCh
}
p.c, p.closed = nil, true
return nil
}
func (p *pipeliner) reqLoop() {
t := getTimer(time.Hour)
defer putTimer(t)
t.Stop()
reqs := <-p.reqsBufCh
defer func() {
p.reqsBufCh <- reqs
}()
for {
select {
case req, ok := <-p.reqCh:
if !ok {
reqs = p.flush(reqs)
return
}
reqs = append(reqs, req)
if p.limit > 0 && len(reqs) == p.limit {
// if we reached the pipeline limit, execute now to avoid unnecessary waiting
t.Stop()
reqs = p.flush(reqs)
} else if len(reqs) == 1 {
t.Reset(p.window)
}
case <-t.C:
reqs = p.flush(reqs)
}
}
}
func (p *pipeliner) flush(reqs []CmdAction) []CmdAction {
if len(reqs) == 0 {
return reqs
}
go func() {
defer func() {
p.reqsBufCh <- reqs[:0]
}()
pipe := pipelinerPipeline{
pipeline: pipeline(reqs),
}
if err := p.c.Do(pipe); err != nil {
for _, req := range reqs {
if req == nil {
continue
}
req.(*pipelinerCmd).resCh <- err
}
}
}()
return <-p.reqsBufCh
}
type pipelinerCmd struct {
CmdAction
resCh chan error
}
var pipelinerCmdPool sync.Pool
func getPipelinerCmd(cmd CmdAction) *pipelinerCmd {
req, _ := pipelinerCmdPool.Get().(*pipelinerCmd)
if req != nil {
req.CmdAction = cmd
return req
}
return &pipelinerCmd{
CmdAction: cmd,
// using a buffer of 1 is faster than no buffer in most cases
resCh: make(chan error, 1),
}
}
func poolPipelinerCmd(req *pipelinerCmd) {
req.CmdAction = nil
pipelinerCmdPool.Put(req)
}
type pipelinerPipeline struct {
pipeline
}
func (p pipelinerPipeline) Run(c Conn) error {
if err := c.Encode(p); err != nil {
return err
}
errConn := ioErrConn{Conn: c}
for i, req := range p.pipeline {
err := errConn.Decode(req)
// the order here is important: if we tried to send the error to
// before returning we could end up sending the error twice, which
// could lead to data races when the *pipelinerCmd gets reused.
// to avoid this we must return without sending a value, in case
// we got a non-recoverable error.
if errConn.lastIOErr != nil {
return errConn.lastIOErr
}
req.(*pipelinerCmd).resCh <- err
// since the *pipelinerCmd can be pooled and reused right after
// we send the response, even before this goroutine returns from
// the send operation, we must not access it again. to make sure
// that we don't regress anywhere we set it to nil, so that the
// runtime will trigger a panic if we try to access cmd again.
p.pipeline[i] = nil
}
return nil
}