forked from mongodb/amboy
/
adaptive_order_storage.go
163 lines (136 loc) · 3.16 KB
/
adaptive_order_storage.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
package queue
import (
"context"
"math/rand"
"time"
"github.com/mongodb/amboy"
"github.com/mongodb/amboy/dependency"
"github.com/pkg/errors"
)
type adaptiveOrderItems struct {
jobs map[string]amboy.Job
ready []string
waiting []string
stalled []string
completed []string
passed []string
}
func (items *adaptiveOrderItems) add(j amboy.Job) error {
id := j.ID()
if _, ok := items.jobs[id]; ok {
return errors.Errorf("cannot add duplicate job with id '%s'", id)
}
items.jobs[id] = j
if j.Status().Completed {
items.completed = append(items.completed, id)
return nil
}
if j.TimeInfo().WaitUntil.After(time.Now()) {
items.waiting = append(items.waiting, id)
return nil
}
switch j.Dependency().State() {
case dependency.Ready:
items.ready = append(items.ready, id)
case dependency.Blocked:
items.waiting = append(items.waiting, id)
case dependency.Unresolved:
items.stalled = append(items.stalled, id)
case dependency.Passed:
items.passed = append(items.passed, id)
}
return nil
}
func (items *adaptiveOrderItems) remove(id string) {
new := make([]string, 0, cap(items.completed))
for _, jid := range items.completed {
if id != jid {
new = append(new, jid)
continue
}
delete(items.jobs, id)
}
items.completed = new
}
func (items *adaptiveOrderItems) updateWaiting(ctx context.Context) {
new := []string{}
now := time.Now()
for _, id := range items.waiting {
if ctx.Err() != nil {
return
}
job, ok := items.jobs[id]
if !ok {
continue
}
status := job.Status()
ti := job.TimeInfo()
if ti.WaitUntil.After(now) {
new = append(new, id)
continue
}
if status.Completed || status.InProgress {
items.completed = append(items.completed, id)
continue
}
state := job.Dependency().State()
if state == dependency.Ready {
items.ready = append(items.ready, id)
continue
}
if state == dependency.Blocked {
new = append(new, id)
continue
}
if state == dependency.Unresolved {
items.stalled = append(items.stalled, id)
continue
}
}
items.waiting = new
}
func (items *adaptiveOrderItems) updateStalled(ctx context.Context) {
new := []string{}
for _, id := range items.stalled {
if ctx.Err() != nil {
return
}
job, ok := items.jobs[id]
if !ok {
continue
}
status := job.Status()
if status.Completed || status.InProgress {
items.completed = append(items.completed, id)
continue
}
state := job.Dependency().State()
if state == dependency.Ready {
items.ready = append(items.ready, id)
continue
}
if state == dependency.Blocked {
items.waiting = append(items.waiting, id)
continue
}
if state == dependency.Unresolved {
new = append(new, id)
continue
}
}
items.stalled = new
}
func (items *adaptiveOrderItems) refilter(ctx context.Context) {
items.updateWaiting(ctx)
items.updateStalled(ctx)
// shuffle the order of the ready queue.
// in the future this might be good to sort based on the
// number of edges, and randomized otherwise.
if len(items.ready) > 1 {
new := make([]string, len(items.ready))
for i, r := range rand.Perm(len(items.ready)) {
new[i] = items.ready[r]
}
items.ready = new
}
}