-
Notifications
You must be signed in to change notification settings - Fork 0
/
workqueue.go
323 lines (276 loc) · 5.13 KB
/
workqueue.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
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
package workqueue
import (
"sync"
"time"
log "github.com/sirupsen/logrus"
"github.com/userpro/go-workqueue/common"
)
// Ch workq任务入口 传入&workq.Item{}
var Ch chan interface{}
var once sync.Once
// workq 任务类型
const (
Order int = 0 // 顺序
Rand int = 1 // 乱序
)
// Item work任务
type Item struct {
Type int
Group string
GroupItem
}
// GroupItem group对应的队列的元素
type GroupItem struct {
Task interface{}
Do func(...interface{}) error // func(task)
Retry func(...interface{}) bool // func(task, err) 第二个参数为Do函数返回到error 返回true表示继续重试
Callback func(...interface{}) // func(task, bool) 第二个参数表示该任务是否成功执行
}
type group struct {
start func() bool
q *common.SyncList // list<GroupItem> => queue
l common.Mutex
}
func (g *group) init() {
g.l.Lock()
if g.q == nil {
g.q = &common.SyncList{}
g.q.New()
}
g.l.Unlock()
}
func (g *group) setStart(s func() bool) {
g.l.Lock()
g.start = s
g.l.Unlock()
}
func (g *group) push(data interface{}) {
g.l.Lock()
g.q.PushBack(data)
g.l.Unlock()
}
// 顺序执行
func (g *group) orderDo() {
if !g.l.TryLock() {
return
}
defer g.l.Unlock()
if g.start != nil && !g.start() {
return
}
if g.q == nil || g.q.Size() <= 0 {
return
}
for g.q.Size() > 0 {
t := g.q.PopFront()
if t == nil {
return
}
e, _ := t.(*GroupItem)
if e.Do == nil {
continue
}
// 执行失败
if err := e.Do(e.Task); err != nil {
if e.Retry != nil && e.Retry(e.Task, err) {
g.q.PushFront(e)
continue
}
if e.Callback != nil {
e.Callback(e.Task, false)
}
return
}
if e.Callback != nil {
e.Callback(e.Task, true)
}
}
}
// 乱序执行
func (g *group) randDo() {
if !g.l.TryLock() {
return
}
defer g.l.Unlock()
if g.start != nil && !g.start() {
return
}
// swap list
runq := g.q
g.q = &common.SyncList{}
g.q.New()
// 失败需要继续重试队列
failq := &common.SyncList{}
failq.New()
var wg sync.WaitGroup
for runq.Size() > 0 {
t := runq.PopFront()
if t == nil {
return
}
wg.Add(1)
e, _ := t.(*GroupItem)
go func(failq *common.SyncList, e *GroupItem) {
defer wg.Done()
if e.Do == nil {
return
}
// 执行失败
if err := e.Do(e.Task); err != nil {
if e.Retry != nil && e.Retry(e.Task, err) {
failq.PushBack(e)
return
}
if e.Callback != nil {
e.Callback(e.Task, false)
}
return
}
if e.Callback != nil {
e.Callback(e.Task, true)
}
}(failq, e)
}
wg.Wait()
// 将失败队列合并回主队列
g.q.PushBackList(failq)
}
type workQ struct {
Duration time.Duration
order map[string]*group
rand map[string]*group
ol, rl common.Mutex
}
func (r *workQ) setGroupStart(g string, f func() bool) {
r.ol.Lock()
v, ok := r.order[g]
if !ok {
r.order[g] = &group{}
v, _ = r.order[g]
v.init()
}
v.setStart(f)
r.ol.Unlock()
r.rl.Lock()
v, ok = r.rand[g]
if !ok {
r.rand[g] = &group{}
v, _ = r.rand[g]
v.init()
}
v.setStart(f)
r.rl.Unlock()
}
func (r *workQ) delGroup(group string) {
r.ol.Lock()
if _, ok := r.order[group]; ok {
delete(r.order, group)
}
r.ol.Unlock()
r.rl.Lock()
if _, ok := r.rand[group]; ok {
delete(r.rand, group)
}
r.rl.Unlock()
}
func (r *workQ) init() {
r.order = make(map[string]*group)
r.rand = make(map[string]*group)
}
func (r *workQ) push(t *Item) {
var g *group
switch t.Type {
case Order:
r.ol.Lock()
tg, ok := r.order[t.Group]
if !ok {
r.order[t.Group] = &group{}
tg = r.order[t.Group]
tg.init()
}
g = tg
r.ol.Unlock()
case Rand:
r.rl.Lock()
tg, ok := r.rand[t.Group]
if !ok {
r.rand[t.Group] = &group{}
tg = r.rand[t.Group]
tg.init()
}
g = tg
r.rl.Unlock()
default:
log.Errorf("Unknown item type: %v.", t)
return
}
g.push(&GroupItem{Task: t.Task, Do: t.Do, Retry: t.Retry, Callback: t.Callback})
}
func (r *workQ) orderDo() {
r.ol.Lock()
defer r.ol.Unlock()
for _, v := range r.order {
v.orderDo()
}
}
func (r *workQ) randDo() {
r.rl.Lock()
defer r.rl.Unlock()
for _, v := range r.rand {
v.randDo()
}
}
/* --- 正文开始 --- */
// 任务队列
var workq workQ
func init() {
Ch = make(chan interface{}, 10)
workq = workQ{}
workq.init()
workq.Duration = time.Second // 默认间隔
}
// SetGroupStart 设置每次开始重试的前置条件
func SetGroupStart(g string, f func() bool) {
workq.setGroupStart(g, f)
}
// DelGroup 删除指定分组
func DelGroup(g string) {
workq.delGroup(g)
}
// SetDuration 设置定时重试间隔
func SetDuration(d time.Duration) {
workq.Duration = d
}
// Start 开启运行
func Start() {
once.Do(
func() {
orderT := time.NewTimer(workq.Duration)
randT := time.NewTimer(workq.Duration)
defer orderT.Stop()
defer randT.Stop()
go func() {
for {
t := <-Ch
it, ok := t.(*Item)
if ok {
workq.push(it)
}
}
}()
go func(t *time.Timer) {
for {
t.Reset(workq.Duration)
<-t.C
workq.orderDo()
}
}(orderT)
go func(t *time.Timer) {
for {
t.Reset(workq.Duration)
<-t.C
go workq.randDo()
}
}(randT)
})
}