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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
|
package roadrunner
import (
"context"
"runtime"
"sync"
"time"
"github.com/spiral/errors"
"github.com/spiral/roadrunner/v2/util"
)
type Stack struct {
workers []WorkerBase
mutex sync.RWMutex
destroy bool
}
func NewWorkersStack() *Stack {
return &Stack{
workers: make([]WorkerBase, 0, runtime.NumCPU()),
}
}
func (stack *Stack) Reset() {
stack.mutex.Lock()
defer stack.mutex.Unlock()
stack.workers = nil
}
func (stack *Stack) Push(w WorkerBase) {
stack.mutex.Lock()
defer stack.mutex.Unlock()
stack.workers = append(stack.workers, w)
}
func (stack *Stack) IsEmpty() bool {
stack.mutex.Lock()
defer stack.mutex.Unlock()
return len(stack.workers) == 0
}
func (stack *Stack) Pop() (WorkerBase, bool) {
stack.mutex.Lock()
defer stack.mutex.Unlock()
// do not release new stack
if stack.destroy {
return nil, true
}
if len(stack.workers) == 0 {
return nil, false
}
w := stack.workers[len(stack.workers)-1]
stack.workers = stack.workers[:len(stack.workers)-1]
return w, false
}
type WorkerWatcher interface {
// AddToWatch used to add stack to wait its state
AddToWatch(workers []WorkerBase) error
// GetFreeWorker provide first free worker
GetFreeWorker(ctx context.Context) (WorkerBase, error)
// PutWorker enqueues worker back
PushWorker(w WorkerBase)
// AllocateNew used to allocate new worker and put in into the WorkerWatcher
AllocateNew() error
// Destroy destroys the underlying stack
Destroy(ctx context.Context)
// WorkersList return all stack w/o removing it from internal storage
WorkersList() []WorkerBase
// RemoveWorker remove worker from the stack
RemoveWorker(wb WorkerBase) error
}
// workerCreateFunc can be nil, but in that case, dead stack will not be replaced
func newWorkerWatcher(allocator Allocator, numWorkers int64, events util.EventsHandler) WorkerWatcher {
ww := &workerWatcher{
stack: NewWorkersStack(),
allocator: allocator,
initialNumWorkers: numWorkers,
actualNumWorkers: numWorkers,
events: events,
}
return ww
}
type workerWatcher struct {
mutex sync.RWMutex
stack *Stack
allocator Allocator
initialNumWorkers int64
actualNumWorkers int64
events util.EventsHandler
}
func (ww *workerWatcher) AddToWatch(workers []WorkerBase) error {
for i := 0; i < len(workers); i++ {
sw, err := NewSyncWorker(workers[i])
if err != nil {
return err
}
ww.stack.Push(sw)
sw.AddListener(ww.events.Push)
go func(swc WorkerBase) {
ww.wait(swc)
}(sw)
}
return nil
}
func (ww *workerWatcher) GetFreeWorker(ctx context.Context) (WorkerBase, error) {
const op = errors.Op("GetFreeWorker")
// thread safe operation
w, stop := ww.stack.Pop()
if stop {
return nil, errors.E(op, errors.ErrWatcherStopped)
}
// handle worker remove state
// in this state worker is destroyed by supervisor
if w != nil && w.State().Value() == StateRemove {
err := ww.RemoveWorker(w)
if err != nil {
return nil, err
}
// try to get next
return ww.GetFreeWorker(ctx)
}
// no free stack
if w == nil {
for {
select {
default:
w, stop = ww.stack.Pop()
if stop {
return nil, errors.E(op, errors.ErrWatcherStopped)
}
if w == nil {
continue
}
ww.ReduceWorkersCount()
return w, nil
case <-ctx.Done():
return nil, errors.E(op, errors.NoFreeWorkers, errors.Str("no free workers in the stack, timeout exceed"))
}
}
}
ww.ReduceWorkersCount()
return w, nil
}
func (ww *workerWatcher) AllocateNew() error {
ww.stack.mutex.Lock()
const op = errors.Op("allocate new worker")
sw, err := ww.allocator()
if err != nil {
return errors.E(op, errors.WorkerAllocate, err)
}
ww.addToWatch(sw)
ww.stack.mutex.Unlock()
ww.PushWorker(sw)
ww.events.Push(PoolEvent{
Event: EventWorkerConstruct,
Payload: sw,
})
return nil
}
func (ww *workerWatcher) RemoveWorker(wb WorkerBase) error {
ww.stack.mutex.Lock()
const op = errors.Op("remove worker")
defer ww.stack.mutex.Unlock()
pid := wb.Pid()
for i := 0; i < len(ww.stack.workers); i++ {
if ww.stack.workers[i].Pid() == pid {
// found in the stack
// remove worker
ww.stack.workers = append(ww.stack.workers[:i], ww.stack.workers[i+1:]...)
ww.ReduceWorkersCount()
wb.State().Set(StateInvalid)
err := wb.Kill()
if err != nil {
return errors.E(op, err)
}
break
}
}
// worker currently handle request, set state Remove
wb.State().Set(StateRemove)
return nil
}
// O(1) operation
func (ww *workerWatcher) PushWorker(w WorkerBase) {
ww.IncreaseWorkersCount()
ww.stack.Push(w)
}
func (ww *workerWatcher) ReduceWorkersCount() {
ww.mutex.Lock()
ww.actualNumWorkers--
ww.mutex.Unlock()
}
func (ww *workerWatcher) IncreaseWorkersCount() {
ww.mutex.Lock()
ww.actualNumWorkers++
ww.mutex.Unlock()
}
// Destroy all underlying stack (but let them to complete the task)
func (ww *workerWatcher) Destroy(ctx context.Context) {
ww.stack.mutex.Lock()
ww.stack.destroy = true
ww.stack.mutex.Unlock()
tt := time.NewTicker(time.Millisecond * 100)
for {
select {
case <-tt.C:
ww.stack.mutex.Lock()
if len(ww.stack.workers) != int(ww.actualNumWorkers) {
ww.stack.mutex.Unlock()
continue
}
ww.stack.mutex.Unlock()
// unnecessary mutex, but
// just to make sure. All stack at this moment are in the stack
// Pop operation is blocked, push can't be done, since it's not possible to pop
ww.stack.mutex.Lock()
for i := 0; i < len(ww.stack.workers); i++ {
// set state for the stack in the stack (unused at the moment)
ww.stack.workers[i].State().Set(StateDestroyed)
}
ww.stack.mutex.Unlock()
tt.Stop()
// clear
ww.stack.Reset()
return
}
}
}
// Warning, this is O(n) operation, and it will return copy of the actual workers
func (ww *workerWatcher) WorkersList() []WorkerBase {
ww.stack.mutex.Lock()
defer ww.stack.mutex.Unlock()
workersCopy := make([]WorkerBase, 0, 1)
for _, v := range ww.stack.workers {
sw := v.(SyncWorker)
workersCopy = append(workersCopy, sw)
}
return workersCopy
}
func (ww *workerWatcher) wait(w WorkerBase) {
const op = errors.Op("process wait")
err := w.Wait()
if err != nil {
ww.events.Push(WorkerEvent{
Event: EventWorkerError,
Worker: w,
Payload: errors.E(op, err),
})
}
if w.State().Value() == StateDestroyed {
// worker was manually destroyed, no need to replace
return
}
pid := w.Pid()
ww.stack.mutex.Lock()
for i := 0; i < len(ww.stack.workers); i++ {
// worker in the stack, reallocating
if ww.stack.workers[i].Pid() == pid {
ww.stack.workers = append(ww.stack.workers[:i], ww.stack.workers[i+1:]...)
ww.ReduceWorkersCount()
ww.stack.mutex.Unlock()
err = ww.AllocateNew()
if err != nil {
ww.events.Push(PoolEvent{
Event: EventPoolError,
Payload: errors.E(op, err),
})
}
return
}
}
ww.stack.mutex.Unlock()
// worker not in the stack (not returned), forget and allocate new
err = ww.AllocateNew()
if err != nil {
ww.events.Push(PoolEvent{
Event: EventPoolError,
Payload: errors.E(op, err),
})
return
}
}
func (ww *workerWatcher) addToWatch(wb WorkerBase) {
ww.mutex.Lock()
defer ww.mutex.Unlock()
go func() {
ww.wait(wb)
}()
}
|