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
|
package worker_watcher //nolint:stylecheck
import (
"context"
"sync"
"time"
"github.com/spiral/errors"
"github.com/spiral/roadrunner/v2/pkg/events"
"github.com/spiral/roadrunner/v2/pkg/worker"
"github.com/spiral/roadrunner/v2/pkg/worker_watcher/container/channel"
)
// Vector interface represents vector container
type Vector interface {
// Push used to put worker to the vector
Push(worker.BaseProcess)
// Pop used to get worker from the vector
Pop(ctx context.Context) (worker.BaseProcess, error)
// Remove worker with provided pid
Remove(pid int64)
// Destroy used to stop releasing the workers
Destroy()
// TODO Add Replace method, and remove `Remove` method. Replace will do removal and allocation
// Replace(prevPid int64, newWorker worker.BaseProcess)
}
type workerWatcher struct {
sync.RWMutex
container Vector
// used to control Destroy stage (that all workers are in the container)
numWorkers uint64
workers []worker.BaseProcess
allocator worker.Allocator
events events.Handler
}
// NewSyncWorkerWatcher is a constructor for the Watcher
func NewSyncWorkerWatcher(allocator worker.Allocator, numWorkers uint64, events events.Handler) *workerWatcher {
ww := &workerWatcher{
container: channel.NewVector(numWorkers),
numWorkers: numWorkers,
workers: make([]worker.BaseProcess, 0, numWorkers),
allocator: allocator,
events: events,
}
return ww
}
func (ww *workerWatcher) Watch(workers []worker.BaseProcess) error {
for i := 0; i < len(workers); i++ {
ww.container.Push(workers[i])
// add worker to watch slice
ww.workers = append(ww.workers, workers[i])
go func(swc worker.BaseProcess) {
ww.wait(swc)
}(workers[i])
}
return nil
}
// Take is not a thread safe operation
func (ww *workerWatcher) Take(ctx context.Context) (worker.BaseProcess, error) {
const op = errors.Op("worker_watcher_get_free_worker")
// thread safe operation
w, err := ww.container.Pop(ctx)
if errors.Is(errors.WatcherStopped, err) {
return nil, errors.E(op, errors.WatcherStopped)
}
if err != nil {
return nil, errors.E(op, err)
}
// fast path, worker not nil and in the ReadyState
if w.State().Value() == worker.StateReady {
return w, nil
}
// =========================================================
// SLOW PATH
_ = w.Kill()
// no free workers in the container or worker not in the ReadyState (TTL-ed)
// try to continuously get free one
for {
w, err = ww.container.Pop(ctx)
if errors.Is(errors.WatcherStopped, err) {
return nil, errors.E(op, errors.WatcherStopped)
}
if err != nil {
return nil, errors.E(op, err)
}
switch w.State().Value() {
// return only workers in the Ready state
// check first
case worker.StateReady:
return w, nil
case worker.StateWorking: // how??
ww.container.Push(w) // put it back, let worker finish the work
continue
case
// all the possible wrong states
worker.StateInactive,
worker.StateDestroyed,
worker.StateErrored,
worker.StateStopped,
worker.StateInvalid,
worker.StateKilling,
worker.StateStopping:
// worker doing no work because it in the container
// so we can safely kill it (inconsistent state)
_ = w.Kill()
// try to get new worker
continue
}
}
}
func (ww *workerWatcher) Allocate() error {
ww.Lock()
const op = errors.Op("worker_watcher_allocate_new")
sw, err := ww.allocator()
if err != nil {
return errors.E(op, errors.WorkerAllocate, err)
}
// add worker to Wait
ww.addToWatch(sw)
// add new worker to the workers slice (to get information about workers in parallel)
ww.workers = append(ww.workers, sw)
// unlock Allocate mutex
ww.Unlock()
// push the worker to the container
ww.Release(sw)
return nil
}
// Remove worker
func (ww *workerWatcher) Remove(wb worker.BaseProcess) {
ww.Lock()
defer ww.Unlock()
// set remove state
pid := wb.Pid()
// worker will be removed on the Get operation
for i := 0; i < len(ww.workers); i++ {
if ww.workers[i].Pid() == pid {
ww.workers = append(ww.workers[:i], ww.workers[i+1:]...)
// kill worker
_ = wb.Kill()
return
}
}
}
// Release O(1) operation
func (ww *workerWatcher) Release(w worker.BaseProcess) {
switch w.State().Value() {
case worker.StateReady:
ww.container.Push(w)
default:
_ = w.Kill()
}
}
// Destroy all underlying container (but let them to complete the task)
func (ww *workerWatcher) Destroy(_ context.Context) {
// destroy container, we don't use ww mutex here, since we should be able to push worker
ww.Lock()
// do not release new workers
ww.container.Destroy()
ww.Unlock()
tt := time.NewTicker(time.Millisecond * 100)
defer tt.Stop()
for { //nolint:gosimple
select {
case <-tt.C:
ww.Lock()
// that might be one of the workers is working
if ww.numWorkers != uint64(len(ww.workers)) {
ww.Unlock()
continue
}
ww.Unlock()
// unnecessary mutex, but
// just to make sure. All container at this moment are in the container
// Pop operation is blocked, push can't be done, since it's not possible to pop
ww.Lock()
for i := 0; i < len(ww.workers); i++ {
ww.workers[i].State().Set(worker.StateDestroyed)
// kill the worker
_ = ww.workers[i].Kill()
}
return
}
}
}
// List - this is O(n) operation, and it will return copy of the actual workers
func (ww *workerWatcher) List() []worker.BaseProcess {
ww.RLock()
defer ww.RUnlock()
base := make([]worker.BaseProcess, 0, len(ww.workers))
for i := 0; i < len(ww.workers); i++ {
base = append(base, ww.workers[i])
}
return base
}
func (ww *workerWatcher) wait(w worker.BaseProcess) {
const op = errors.Op("worker_watcher_wait")
err := w.Wait()
if err != nil {
ww.events.Push(events.WorkerEvent{
Event: events.EventWorkerError,
Worker: w,
Payload: errors.E(op, err),
})
}
// remove worker
ww.Remove(w)
if w.State().Value() == worker.StateDestroyed {
// worker was manually destroyed, no need to replace
ww.events.Push(events.PoolEvent{Event: events.EventWorkerDestruct, Payload: w})
return
}
// set state as stopped
w.State().Set(worker.StateStopped)
err = ww.Allocate()
if err != nil {
ww.events.Push(events.PoolEvent{
Event: events.EventPoolError,
Payload: errors.E(op, err),
})
}
}
func (ww *workerWatcher) addToWatch(wb worker.BaseProcess) {
go func() {
ww.wait(wb)
}()
}
|