-
Notifications
You must be signed in to change notification settings - Fork 32
/
Copy pathjob.go
245 lines (208 loc) · 5.08 KB
/
job.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
package goflow
import (
"fmt"
"log"
"sync"
"time"
"github.com/philippgille/gokv"
)
// A Job is a workflow consisting of independent and dependent tasks
// organized into a graph.
type Job struct {
Name string
Tasks map[string]*Task
Schedule string
Dag dag
Active bool
state state
tasks []string
sync.RWMutex
}
// Jobs and tasks are stateful.
type state string
const (
none state = "notstarted"
running state = "running"
upForRetry state = "upforretry"
skipped state = "skipped"
failed state = "failed"
successful state = "successful"
)
func (j *Job) loadState() state {
if !j.allDone() {
j.storeState(running)
}
if j.allSuccessful() {
j.storeState(successful)
}
if j.allDone() && j.anyFailed() {
j.storeState(failed)
}
return j.state
}
func (j *Job) loadTaskState(task string) state {
j.RLock()
result := none
for _, t := range j.Tasks {
if t.Name == task {
result = t.state
break
}
}
j.RUnlock()
return result
}
func (j *Job) storeState(value state) {
j.Lock()
j.state = value
j.Unlock()
}
func (j *Job) storeTaskState(task string, value state) {
j.Lock()
for _, t := range j.Tasks {
if t.Name == task {
t.state = value
}
}
j.Unlock()
}
type writeOp struct {
key string
val state
}
// Initialize a job.
func (j *Job) initialize() *Job {
j.Dag = make(dag)
j.Tasks = make(map[string]*Task)
j.tasks = make([]string, 0)
j.storeState(none)
return j
}
// Add a task to a job.
func (j *Job) Add(t *Task) *Job {
if j.Dag == nil {
j.initialize()
}
if !(t.TriggerRule == allDone || t.TriggerRule == allSuccessful) {
t.TriggerRule = allSuccessful
}
t.remaining = t.Retries
j.Tasks[t.Name] = t
j.tasks = append(j.tasks, t.Name)
j.Dag.addNode(t.Name)
j.storeTaskState(t.Name, none)
return j
}
// Task getter
func (j *Job) Task(name string) *Task {
return j.Tasks[name]
}
// SetDownstream sets a dependency relationship between two tasks in the job.
// The dependent task is downstream of the independent task and
// waits for the independent task to finish before starting
// execution.
func (j *Job) SetDownstream(ind, dep *Task) *Job {
j.Dag.setDownstream(ind.Name, dep.Name)
return j
}
func (j *Job) run(store gokv.Store, e *execution) error {
if !j.Dag.validate() {
return fmt.Errorf("Invalid Dag for job %s", j.Name)
}
log.Printf("jobID=%v, jobname=%v, msg=starting", e.ID, j.Name)
writes := make(chan writeOp)
for {
for _, task := range j.Tasks {
// Start the independent tasks
v := j.loadTaskState(task.Name)
if v == none && !j.Dag.isDownstream(task.Name) {
j.storeTaskState(task.Name, running)
log.Printf("jobID=%v, job=%v, task=%v, msg=starting", e.ID, j.Name, task.Name)
go task.run(writes)
}
// Start the tasks that need to be re-tried
if v == upForRetry {
task.RetryDelay.wait(task.Name, task.Retries-task.remaining)
task.remaining = task.remaining - 1
j.storeTaskState(task.Name, running)
log.Printf("jobID=%v, job=%v, task=%v, msg=starting", e.ID, j.Name, task.Name)
go task.run(writes)
}
// If dependencies are done, start the dependent tasks
if v == none && j.Dag.isDownstream(task.Name) {
upstreamDone := true
upstreamSuccessful := true
for _, us := range j.Dag.dependencies(task.Name) {
w := j.loadTaskState(us)
if w == none || w == running || w == upForRetry {
upstreamDone = false
}
if w != successful {
upstreamSuccessful = false
}
}
if upstreamDone && task.TriggerRule == allDone {
j.storeTaskState(task.Name, running)
log.Printf("jobID=%v, job=%v, task=%v, msg=starting", e.ID, j.Name, task.Name)
go task.run(writes)
}
if upstreamSuccessful && task.TriggerRule == allSuccessful {
j.storeTaskState(task.Name, running)
log.Printf("jobID=%v, job=%v, task=%v, msg=starting", e.ID, j.Name, task.Name)
go task.run(writes)
}
if upstreamDone && !upstreamSuccessful && task.TriggerRule == allSuccessful {
j.storeTaskState(task.Name, skipped)
log.Printf("jobID=%v, job=%v, task=%v, msg=skipping", e.ID, j.Name, task.Name)
go task.skip(writes)
}
}
}
// Receive updates on task state
write := <-writes
j.storeTaskState(write.key, write.val)
log.Printf("jobID=%v, job=%v, task=%v, msg=%v", e.ID, j.Name, write.key, write.val)
// Sync to store
e.State = j.loadState()
e.ModifiedTimestamp = time.Now().UTC().Format(time.RFC3339Nano)
syncStateToStore(store, e, write.key, write.val)
if j.allDone() {
break
}
}
log.Printf("jobID=%v, job=%v, msg=%v", e.ID, j.Name, j.loadState())
return nil
}
func (j *Job) allDone() bool {
j.RLock()
out := true
for _, t := range j.Tasks {
if t.state == none || t.state == running || t.state == upForRetry {
out = false
}
}
j.RUnlock()
return out
}
func (j *Job) allSuccessful() bool {
j.RLock()
out := true
for _, t := range j.Tasks {
if t.state != successful {
out = false
}
}
j.RUnlock()
return out
}
func (j *Job) anyFailed() bool {
j.RLock()
out := false
for _, t := range j.Tasks {
if t.state == failed {
out = true
}
}
j.RUnlock()
return out
}