forked from gocraft/work
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathenqueue_test.go
521 lines (430 loc) · 16.2 KB
/
enqueue_test.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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
package work
import (
"fmt"
"sync"
"testing"
"time"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
func TestEnqueue(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
job, err := enqueuer.Enqueue("wat", Q{"a": 1, "b": "cool"})
assert.Nil(t, err)
assert.Equal(t, "wat", job.Name)
assert.True(t, len(job.ID) > 10) // Something is in it
assert.True(t, job.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, job.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", job.ArgString("b"))
assert.EqualValues(t, 1, job.ArgInt64("a"))
assert.NoError(t, job.ArgError())
// Make sure "wat" is in the known jobs
assert.EqualValues(t, []string{"wat"}, knownJobs(pool, redisKeyKnownJobs(ns)))
// Make sure the cache is set
expiresAt := enqueuer.knownJobs["wat"]
assert.True(t, expiresAt > (time.Now().Unix()+290))
// Make sure the length of the queue is 1
assert.EqualValues(t, 1, listSize(pool, redisKeyJobs(ns, "wat")))
// Get the job
j := jobOnQueue(pool, redisKeyJobs(ns, "wat"))
assert.Equal(t, "wat", j.Name)
assert.True(t, len(j.ID) > 10) // Something is in it
assert.True(t, j.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, j.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", j.ArgString("b"))
assert.EqualValues(t, 1, j.ArgInt64("a"))
assert.NoError(t, j.ArgError())
// Now enqueue another job, make sure that we can enqueue multiple
_, err = enqueuer.Enqueue("wat", Q{"a": 1, "b": "cool"})
_, err = enqueuer.Enqueue("wat", Q{"a": 1, "b": "cool"})
assert.Nil(t, err)
assert.EqualValues(t, 2, listSize(pool, redisKeyJobs(ns, "wat")))
}
func TestEnqueueIn(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
// Set to expired value to make sure we update the set of known jobs
enqueuer.knownJobs["wat"] = 4
job, err := enqueuer.EnqueueIn("wat", 300, Q{"a": 1, "b": "cool"})
assert.Nil(t, err)
if assert.NotNil(t, job) {
assert.Equal(t, "wat", job.Name)
assert.True(t, len(job.ID) > 10) // Something is in it
assert.True(t, job.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, job.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", job.ArgString("b"))
assert.EqualValues(t, 1, job.ArgInt64("a"))
assert.NoError(t, job.ArgError())
assert.EqualValues(t, job.EnqueuedAt+300, job.RunAt)
}
// Make sure "wat" is in the known jobs
assert.EqualValues(t, []string{"wat"}, knownJobs(pool, redisKeyKnownJobs(ns)))
// Make sure the cache is set
expiresAt := enqueuer.knownJobs["wat"]
assert.True(t, expiresAt > (time.Now().Unix()+290))
// Make sure the length of the scheduled job queue is 1
assert.EqualValues(t, 1, zsetSize(pool, redisKeyScheduled(ns)))
// Get the job
score, j := jobOnZset(pool, redisKeyScheduled(ns))
assert.True(t, score > time.Now().Unix()+290)
assert.True(t, score <= time.Now().Unix()+300)
assert.Equal(t, "wat", j.Name)
assert.True(t, len(j.ID) > 10) // Something is in it
assert.True(t, j.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, j.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", j.ArgString("b"))
assert.EqualValues(t, 1, j.ArgInt64("a"))
assert.NoError(t, j.ArgError())
}
func TestEnqueueUnique(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
var mutex = &sync.Mutex{}
job, err := enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "cool"})
assert.NoError(t, err)
if assert.NotNil(t, job) {
assert.Equal(t, "wat", job.Name)
assert.True(t, len(job.ID) > 10) // Something is in it
assert.True(t, job.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, job.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", job.ArgString("b"))
assert.EqualValues(t, 1, job.ArgInt64("a"))
assert.NoError(t, job.ArgError())
}
job, err = enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "cool"})
assert.NoError(t, err)
assert.Nil(t, job)
job, err = enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "coolio"})
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUnique("wat", nil)
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUnique("wat", nil)
assert.NoError(t, err)
assert.Nil(t, job)
job, err = enqueuer.EnqueueUnique("taw", nil)
assert.NoError(t, err)
assert.NotNil(t, job)
// Process the queues. Ensure the right number of jobs were processed
var wats, taws int64
wp := NewWorkerPool(TestContext{}, 3, ns, pool)
wp.JobWithOptions("wat", JobOptions{Priority: 1, MaxFails: 1}, func(job *Job) error {
mutex.Lock()
wats++
mutex.Unlock()
return nil
})
wp.JobWithOptions("taw", JobOptions{Priority: 1, MaxFails: 1}, func(job *Job) error {
mutex.Lock()
taws++
mutex.Unlock()
return fmt.Errorf("ohno")
})
wp.Start()
wp.Drain()
wp.Stop()
assert.EqualValues(t, 3, wats)
assert.EqualValues(t, 1, taws)
// Enqueue again. Ensure we can.
job, err = enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "cool"})
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "coolio"})
assert.NoError(t, err)
assert.NotNil(t, job)
// Even though taw resulted in an error, we should still be able to re-queue it.
// This could result in multiple taws enqueued at the same time in a production system.
job, err = enqueuer.EnqueueUnique("taw", nil)
assert.NoError(t, err)
assert.NotNil(t, job)
}
// Tests that unique jobs are removed only after job is done or put in dead queue.
func TestOrderEnqueueUnique(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
job, err := enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "cool"})
require.NotNil(t, job)
require.NoError(t, err)
failCount := 0
doneCh := make(chan struct{})
// Process the queues.
backoffCalc := func(job *Job) int64 {
return 1 // 1 second
}
wp := NewWorkerPool(TestContext{}, 3, ns, pool)
wp.JobWithOptions("wat", JobOptions{Priority: 1, MaxFails: 2, Backoff: backoffCalc}, func(job *Job) error {
failCount++
switch failCount {
case 1:
// We skip this step, because the job goes into retry queue only after this function returns,
// but we want to test adding a unique job when there is one in retry queue. So we do it at step 2.
case 2:
// Try to add the same job, but the original job is in retry queue.
job, err := enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "cool"})
require.Nil(t, job)
require.NoError(t, err)
close(doneCh)
}
return fmt.Errorf("oops")
})
wp.Start()
select {
case <-time.After(5 * time.Second):
require.FailNow(t, "timed out")
case <-doneCh:
wp.Drain()
wp.Stop()
}
// Now the current job is in dead queue, so we can enqueue new one.
job, err = enqueuer.EnqueueUnique("wat", Q{"a": 1, "b": "cool"})
require.NotNil(t, job)
require.NoError(t, err)
}
func TestEnqueueUniqueIn(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
// Enqueue two unique jobs -- ensure one job sticks.
job, err := enqueuer.EnqueueUniqueIn("wat", 300, Q{"a": 1, "b": "cool"})
assert.NoError(t, err)
if assert.NotNil(t, job) {
assert.Equal(t, "wat", job.Name)
assert.True(t, len(job.ID) > 10) // Something is in it
assert.True(t, job.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, job.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", job.ArgString("b"))
assert.EqualValues(t, 1, job.ArgInt64("a"))
assert.NoError(t, job.ArgError())
assert.EqualValues(t, job.EnqueuedAt+300, job.RunAt)
}
job, err = enqueuer.EnqueueUniqueIn("wat", 10, Q{"a": 1, "b": "cool"})
assert.NoError(t, err)
assert.Nil(t, job)
// Get the job
score, j := jobOnZset(pool, redisKeyScheduled(ns))
assert.True(t, score > time.Now().Unix()+290) // We don't want to overwrite the time
assert.True(t, score <= time.Now().Unix()+300)
assert.Equal(t, "wat", j.Name)
assert.True(t, len(j.ID) > 10) // Something is in it
assert.True(t, j.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, j.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", j.ArgString("b"))
assert.EqualValues(t, 1, j.ArgInt64("a"))
assert.NoError(t, j.ArgError())
assert.True(t, j.Unique)
// Now try to enqueue more stuff and ensure it
job, err = enqueuer.EnqueueUniqueIn("wat", 300, Q{"a": 1, "b": "coolio"})
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUniqueIn("wat", 300, nil)
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUniqueIn("wat", 300, nil)
assert.NoError(t, err)
assert.Nil(t, job)
job, err = enqueuer.EnqueueUniqueIn("taw", 300, nil)
assert.NoError(t, err)
assert.NotNil(t, job)
}
func TestEnqueueUniqueByKey(t *testing.T) {
var arg3 string
var arg4 string
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
var mutex = &sync.Mutex{}
job, err := enqueuer.EnqueueUniqueByKey("wat", Q{"a": 3, "b": "foo"}, Q{"key": "123"})
assert.NoError(t, err)
if assert.NotNil(t, job) {
assert.Equal(t, "wat", job.Name)
assert.True(t, len(job.ID) > 10) // Something is in it
assert.True(t, job.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, job.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "foo", job.ArgString("b"))
assert.EqualValues(t, 3, job.ArgInt64("a"))
assert.NoError(t, job.ArgError())
}
job, err = enqueuer.EnqueueUniqueByKey("wat", Q{"a": 3, "b": "bar"}, Q{"key": "123"})
assert.NoError(t, err)
assert.Nil(t, job)
job, err = enqueuer.EnqueueUniqueByKey("wat", Q{"a": 4, "b": "baz"}, Q{"key": "124"})
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUniqueByKey("taw", nil, Q{"key": "125"})
assert.NoError(t, err)
assert.NotNil(t, job)
// Process the queues. Ensure the right number of jobs were processed
var wats, taws int64
wp := NewWorkerPool(TestContext{}, 3, ns, pool)
wp.JobWithOptions("wat", JobOptions{Priority: 1, MaxFails: 1}, func(job *Job) error {
mutex.Lock()
argA := job.Args["a"].(float64)
argB := job.Args["b"].(string)
if argA == 3 {
arg3 = argB
}
if argA == 4 {
arg4 = argB
}
wats++
mutex.Unlock()
return nil
})
wp.JobWithOptions("taw", JobOptions{Priority: 1, MaxFails: 1}, func(job *Job) error {
mutex.Lock()
taws++
mutex.Unlock()
return fmt.Errorf("ohno")
})
wp.Start()
wp.Drain()
wp.Stop()
assert.EqualValues(t, 2, wats)
assert.EqualValues(t, 1, taws)
// Check that arguments got updated to new value
assert.EqualValues(t, "bar", arg3)
assert.EqualValues(t, "baz", arg4)
// Enqueue again. Ensure we can.
job, err = enqueuer.EnqueueUniqueByKey("wat", Q{"a": 1, "b": "cool"}, Q{"key": "123"})
assert.NoError(t, err)
assert.NotNil(t, job)
job, err = enqueuer.EnqueueUniqueByKey("wat", Q{"a": 1, "b": "coolio"}, Q{"key": "124"})
assert.NoError(t, err)
assert.NotNil(t, job)
// Even though taw resulted in an error, we should still be able to re-queue it.
// This could result in multiple taws enqueued at the same time in a production system.
job, err = enqueuer.EnqueueUniqueByKey("taw", nil, Q{"key": "123"})
assert.NoError(t, err)
assert.NotNil(t, job)
}
// Tests that unique by key jobs are removed only after job is done or put in dead queue.
func TestOrderEnqueueUniqueByKey(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
job, err := enqueuer.EnqueueUniqueByKey("wat", Q{"a": 1, "b": "cool"}, Q{"key": "123"})
require.NotNil(t, job)
require.NoError(t, err)
failCount := 0
doneCh := make(chan struct{})
// Process the queues.
backoffCalc := func(job *Job) int64 {
return 1 // 1 second
}
wp := NewWorkerPool(TestContext{}, 3, ns, pool)
wp.JobWithOptions("wat", JobOptions{Priority: 1, MaxFails: 2, Backoff: backoffCalc}, func(job *Job) error {
failCount++
switch failCount {
case 1:
// We skip this step, because the job goes into retry queue only after this function returns,
// but we want to test adding a unique job when there is one in retry queue. So we do it at step 2.
case 2:
// Try to add the same job, but the original job is in retry queue.
job, err := enqueuer.EnqueueUniqueByKey("wat", Q{"a": 2, "b": "nice"}, Q{"key": "123"})
require.Nil(t, job)
require.NoError(t, err)
close(doneCh)
}
return fmt.Errorf("oops")
})
wp.Start()
select {
case <-time.After(5 * time.Second):
require.FailNow(t, "timed out")
case <-doneCh:
wp.Drain()
wp.Stop()
}
// Now the current job is in dead queue, so we can enqueue new one.
job, err = enqueuer.EnqueueUniqueByKey("wat", Q{"a": 3, "b": "awesome"}, Q{"key": "123"})
require.NotNil(t, job)
require.NoError(t, err)
}
func TestEnqueueUniqueInByKey(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
// Enqueue two unique jobs -- ensure one job sticks.
job, err := enqueuer.EnqueueUniqueInByKey("wat", 300, Q{"a": 1, "b": "cool"}, Q{"key": "123"})
assert.NoError(t, err)
if assert.NotNil(t, job) {
assert.Equal(t, "wat", job.Name)
assert.True(t, len(job.ID) > 10) // Something is in it
assert.True(t, job.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, job.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", job.ArgString("b"))
assert.EqualValues(t, 1, job.ArgInt64("a"))
assert.NoError(t, job.ArgError())
assert.EqualValues(t, job.EnqueuedAt+300, job.RunAt)
}
assert.True(t, exists(pool, job.UniqueKey), "unique keys exists")
job, err = enqueuer.EnqueueUniqueInByKey("wat", 10, Q{"a": 1, "b": "cool"}, Q{"key": "123"})
assert.NoError(t, err)
assert.Nil(t, job)
// Get the job
score, j := jobOnZset(pool, redisKeyScheduled(ns))
assert.True(t, score > time.Now().Unix()+290) // We don't want to overwrite the time
assert.True(t, score <= time.Now().Unix()+300)
assert.Equal(t, "wat", j.Name)
assert.True(t, len(j.ID) > 10) // Something is in it
assert.True(t, j.EnqueuedAt > (time.Now().Unix()-10)) // Within 10 seconds
assert.True(t, j.EnqueuedAt < (time.Now().Unix()+10)) // Within 10 seconds
assert.Equal(t, "cool", j.ArgString("b"))
assert.EqualValues(t, 1, j.ArgInt64("a"))
assert.NoError(t, j.ArgError())
assert.True(t, j.Unique)
}
func TestRunEnqueueUniqueInByKey(t *testing.T) {
pool := newTestPool(":6379")
ns := "work"
cleanKeyspace(ns, pool)
enqueuer := NewEnqueuer(ns, pool)
// Enqueue two unique jobs -- ensure one job sticks.
job, err := enqueuer.EnqueueUniqueInByKey("wat", 1, Q{"a": 1, "b": "cool"}, Q{"key": "123"})
assert.NoError(t, err)
assert.NotNil(t, job)
doneCh := make(chan struct{})
var argA float64
var argB string
wp := NewWorkerPool(TestContext{}, 3, ns, pool)
wp.JobWithOptions("wat", JobOptions{Priority: 1, MaxFails: 1}, func(job *Job) error {
argA = job.Args["a"].(float64)
argB = job.Args["b"].(string)
close(doneCh)
return nil
})
wp.Start()
select {
case <-time.After(5 * time.Second):
require.FailNow(t, "timed out")
case <-doneCh:
wp.Drain()
wp.Stop()
}
// Make sure the job has run.
require.EqualValues(t, 1.0, argA)
require.Equal(t, "cool", argB)
// Nothing in retries or dead.
assert.EqualValues(t, 0, zsetSize(pool, redisKeyRetry(ns)), "retry queue must be empty")
assert.EqualValues(t, 0, zsetSize(pool, redisKeyDead(ns)), "dead queue must be empty")
// Nothing in the queues or in-progress queues.
assert.EqualValues(t, 0, listSize(pool, redisKeyScheduled(ns)), "scheduled queue must be empty")
assert.EqualValues(t, 0, listSize(pool, redisKeyJobs(ns, "wat")), "jobs queue must be empty")
assert.EqualValues(t, 0, listSize(pool, redisKeyJobsInProgress(ns, wp.workerPoolID, "wat")), "inprocess queue must be empty")
// No unique keys.
assert.False(t, exists(pool, job.UniqueKey), "unique keys must be empty")
}