-
Notifications
You must be signed in to change notification settings - Fork 3
/
pool_worker.go
288 lines (226 loc) · 5.19 KB
/
pool_worker.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
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
package running
import (
"context"
"fmt"
"sync"
)
const (
_WorkStatusTodo = 0
_WorkStatusDoing = 1
_WorkStatusDone = 2
)
type _Worker struct {
Works *_WorkList
Nodes map[string]Node
StateBuilder func() State
Version string
}
func (worker _Worker) Work(ctx context.Context) <-chan Output {
output := Output{}
outputCh := make(chan Output, 1)
var state State
var ctxParam CtxParams
skipNodes := make(map[string]struct{})
raw := ctx.Value(CtxKey)
if raw != nil {
if params, ok := raw.(CtxParams); ok {
ctxParam = params
state = params.State
for _, node := range params.SkipNodes {
skipNodes[node] = struct{}{}
}
}
}
if state == nil {
state = worker.StateBuilder()
}
// get node ready to run from a chan of works, block until all node done
for nodeName := range worker.Works.TODO() {
go func(nodeName string) {
if worker.Nodes[nodeName] == nil {
worker.Works.Done(nodeName)
return
}
if err := ctx.Err(); err != nil && ctxParam.SkipOnCtxErr {
output.Err = err
worker.Works.Terminate(nodeName)
return
}
if _, ok := skipNodes[nodeName]; ok {
worker.Works.Done(nodeName)
return
}
if !worker.MatchNode(ctxParam, nodeName) {
worker.Works.Done(nodeName)
return
}
defer func() {
if err := recover(); err != nil {
output.Err = fmt.Errorf("%w, node name: %s, panic info: %v", ErrWorkerPanic, nodeName, err)
worker.Works.Terminate(nodeName)
} else {
worker.Works.Done(nodeName)
}
}()
if statefulNode, ok := worker.Nodes[nodeName].(Stateful); ok {
statefulNode.Bind(state)
}
worker.Nodes[nodeName].Run(ctx)
worker.Nodes[nodeName].Reset()
}(nodeName)
}
output.State = state
outputCh <- output
return outputCh
}
func (worker _Worker) MatchNode(params CtxParams, nodeName string) bool {
matchAllLabels := params.MatchAllLabels
matchOneOfLabels := params.MatchOneOfLabels
labels := worker.Works.Items[nodeName].Labels
if labels != nil {
if len(matchAllLabels) > 0 {
for _, label := range matchAllLabels {
if _, matched := labels[label]; !matched {
return false
}
}
}
if len(matchOneOfLabels) > 0 {
oneMatched := false
for _, label := range matchOneOfLabels {
if _, matched := labels[label]; matched {
oneMatched = true
break
}
}
if !oneMatched {
return false
}
}
}
return true
}
type _WorkList struct {
todo, done chan string
completed chan struct{}
terminate chan string
Items map[string]*_WorkItem
sync.RWMutex
}
type _WorkItem struct {
Name string
Labels map[string]struct{}
Status int
Prev int
Next []*_WorkItem
}
func newWorkList(graph *_DAG) *_WorkList {
list := &_WorkList{
Items: make(map[string]*_WorkItem),
}
for name, vertex := range graph.Vertexes {
list.Items[name] = &_WorkItem{
Name: name,
Labels: vertex.RefRoot.Labels,
Status: _WorkStatusTodo,
Prev: vertex.Prev,
Next: make([]*_WorkItem, 0),
}
}
for name, vertex := range graph.Vertexes {
for _, next := range vertex.Next {
list.Items[name].Next = append(list.Items[name].Next, list.Items[next.RefRoot.NodeName])
}
}
return list
}
func (list *_WorkList) TODO() <-chan string {
list.Lock()
list.todo = make(chan string, len(list.Items))
list.done = make(chan string, len(list.Items))
list.completed = make(chan struct{}, 1)
list.terminate = make(chan string, len(list.Items))
list.Unlock()
// find node ready to run
list.feed()
go func() {
list.RLock()
defer list.RUnlock()
for {
select {
case name := <-list.done:
if list.Items[name] == nil {
break
}
// mark node done
list.Items[name].Status = _WorkStatusDone
for _, nextItem := range list.Items[name].Next {
nextItem.Prev--
}
// find node ready to run
list.feed()
case name := <-list.terminate:
if list.Items[name] == nil {
break
}
// mark node done
list.Items[name].Status = _WorkStatusDone
// no more nodes need to do
for _, item := range list.Items {
if item.Status == _WorkStatusTodo {
item.Status = _WorkStatusDone
}
}
// can't return here, wait all node done
list.feed()
case <-list.completed: // all node done, exit
return
}
}
}()
return list.todo
}
func (list *_WorkList) Terminate(name string) {
list.terminate <- name
}
func (list *_WorkList) Done(name string) {
list.done <- name
}
// notify goroutine to exits,
// close chan, end the block.
func (list *_WorkList) clean() {
list.completed <- struct{}{}
for _, item := range list.Items {
item.Status = _WorkStatusTodo
item.Prev = 0
}
for _, item := range list.Items {
for _, nextItem := range item.Next {
nextItem.Prev++
}
}
close(list.todo)
}
func (list *_WorkList) feed() {
var hasMoreTodo, hasDoing bool
// send node ready to run
for _, item := range list.Items {
if item.Status == _WorkStatusTodo && item.Prev <= 0 {
hasMoreTodo = true
item.Status = _WorkStatusDoing
list.todo <- item.Name
}
}
// node not found
if !hasMoreTodo {
for _, item := range list.Items {
if item.Status == _WorkStatusDoing {
hasDoing = true
}
}
// if no nodes are running as well, work is over
if !hasDoing {
list.clean()
}
}
}