Repository navigation
Expand file tree
/
Copy pathqueue.go
More file actions
550 lines (483 loc) · 14.2 KB
/
Copy pathqueue.go
File metadata and controls
550 lines (483 loc) · 14.2 KB
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
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
package main
import (
"bytes"
"context"
"encoding/json"
"fmt"
"log/slog"
"math"
"net/http"
"sync"
"time"
)
type JobHandler func(ctx context.Context, job *Job) error
type Queue struct {
highQueue chan *Job
normalQueue chan *Job
lowQueue chan *Job
handlers map[string]JobHandler
store Store
numWorkers int
stopCh chan struct{}
stopOnce sync.Once
wg sync.WaitGroup
mu sync.Mutex
accepting bool
scheduler *Scheduler
// storeDispatch is set under leader election: Enqueue only persists
// the job, and the leader's Dispatcher claims it from the shared
// store. See UseStoreDispatch.
storeDispatch bool
limiter *concurrencyLimiter
dedupe *deduper
metrics *Metrics
log *slog.Logger
webhookClient *http.Client
}
// SetScheduler wires a Scheduler to hold jobs with a future RunAt until
// they're due. Optional — a Queue with no scheduler simply rejects
// delayed jobs (see Enqueue), so wiring this up is only required if the
// caller intends to use delayed/scheduled jobs at all.
func (q *Queue) SetScheduler(s *Scheduler) {
q.scheduler = s
}
// UseStoreDispatch switches the Queue to shared-store mode for running
// several instances under leader election. Enqueue then only persists
// the job as pending (on any instance, leader or follower), and nothing
// reaches a worker until the elected leader's Dispatcher claims it. Jobs
// left in the local channels at Stop are handed back as pending instead
// of being run, so the next leader picks them up.
func (q *Queue) UseStoreDispatch() {
q.storeDispatch = true
}
// SetConcurrencyLimit caps how many jobs of jobType may run at once
// across all workers, independent of total worker count. A limit <= 0
// removes any existing cap for that type.
func (q *Queue) SetConcurrencyLimit(jobType string, limit int) {
q.limiter.SetLimit(jobType, limit)
}
// Metrics returns the Queue's metrics collector, for mounting its
// ServeHTTP as a /metrics endpoint.
func (q *Queue) Metrics() *Metrics {
return q.metrics
}
// SetLogger overrides the default logger (slog.Default()).
func (q *Queue) SetLogger(l *slog.Logger) {
q.log = l
}
// QueueDepths reports the current number of jobs waiting in each
// priority lane. Used by /stats and by the metrics exporter.
func (q *Queue) QueueDepths() map[string]int {
return map[string]int{
PriorityHigh.String(): len(q.highQueue),
PriorityNormal.String(): len(q.normalQueue),
PriorityLow.String(): len(q.lowQueue),
}
}
const (
highQueueSize = 1000
normalQueueSize = 1000
lowQueueSize = 1000
)
func NewQueue(store Store, numWorkers int) *Queue {
q := &Queue{
highQueue: make(chan *Job, highQueueSize),
normalQueue: make(chan *Job, normalQueueSize),
lowQueue: make(chan *Job, lowQueueSize),
handlers: make(map[string]JobHandler),
store: store,
numWorkers: numWorkers,
stopCh: make(chan struct{}),
accepting: true,
limiter: newConcurrencyLimiter(),
dedupe: newDeduper(),
metrics: NewMetrics(),
log: slog.Default(),
webhookClient: &http.Client{
Timeout: 5 * time.Second,
},
}
q.metrics.SetQueueDepthFunc(q.QueueDepths)
q.metrics.SetScheduledFunc(func() int {
if q.scheduler == nil {
return 0
}
return q.scheduler.Len()
})
return q
}
func (q *Queue) RegisterHandler(jobType string, handler JobHandler) {
q.handlers[jobType] = handler
}
func (q *Queue) Start() {
q.mu.Lock()
defer q.mu.Unlock()
if !q.accepting {
return
}
for i := 0; i < q.numWorkers; i++ {
q.wg.Add(1)
go q.runWorker(i + 1)
}
q.log.Info("workers started", "count", q.numWorkers)
}
// ErrDuplicateJob is returned by Enqueue when a job's DedupeKey matches
// one already accepted within its DedupeWindow.
var ErrDuplicateJob = fmt.Errorf("duplicate job suppressed")
func (q *Queue) Enqueue(job *Job) error {
q.mu.Lock()
accepting := q.accepting
q.mu.Unlock()
if !accepting {
return fmt.Errorf("queue is shutting down")
}
if job == nil {
return fmt.Errorf("job is nil")
}
now := time.Now().UTC()
if !q.dedupe.tryAcquire(job.DedupeKey, job.DedupeWindow, now) {
return fmt.Errorf("%w: dedupe_key %q already accepted within its window", ErrDuplicateJob, job.DedupeKey)
}
job.Status = StatusPending
job.CreatedAt = now
if err := q.store.Save(job); err != nil {
return err
}
if q.storeDispatch {
return nil
}
if !job.IsDue(now) {
if q.scheduler == nil {
return fmt.Errorf("job has a future run_at but no scheduler is configured")
}
q.scheduler.Schedule(job)
return nil
}
if err := q.release(job); err != nil {
job.Status = StatusCancelled
job.Error = "queue full"
job.FinishedAt = timePtr(time.Now().UTC())
_ = q.store.Update(job)
q.dedupe.release(job.DedupeKey)
return err
}
return nil
}
// release hands a job directly to its priority channel, skipping the
// scheduling check in Enqueue. Used for jobs that are immediately due,
// and by the Scheduler once a delayed job's RunAt has arrived.
func (q *Queue) release(job *Job) error {
select {
case q.priorityChannel(job.Priority) <- job:
return nil
default:
return fmt.Errorf("queue is full")
}
}
func (q *Queue) Stop() {
q.stopOnce.Do(func() {
q.mu.Lock()
q.accepting = false
q.mu.Unlock()
close(q.stopCh)
})
q.wg.Wait()
q.drain()
}
// drain processes or cancels any jobs left in the priority channels after
// all workers have exited, so nothing is silently lost on shutdown.
func (q *Queue) drain() {
drained := 0
for {
select {
case job := <-q.highQueue:
q.drainJob(job)
drained++
case job := <-q.normalQueue:
q.drainJob(job)
drained++
case job := <-q.lowQueue:
q.drainJob(job)
drained++
default:
if drained > 0 {
q.log.Info("drained jobs from priority channels on shutdown", "count", drained)
}
return
}
}
}
// drainJob either runs a drained job to completion or marks it as
// cancelled if no handler exists — the goal is to not lose track of it.
// In store-dispatch mode it hands the job back to the store instead, so
// a resigning leader doesn't delay failover running work it hasn't
// started yet.
func (q *Queue) drainJob(job *Job) {
if job == nil {
return
}
if q.storeDispatch {
q.handBack(job)
return
}
handler, exists := q.handlers[job.Type]
if !exists {
job.Status = StatusFailed
job.Error = fmt.Sprintf("no handler for job type: %s", job.Type)
job.FinishedAt = timePtr(time.Now().UTC())
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update drained job with missing handler", "job_id", job.ID, "error", err)
}
q.moveToDeadLetter(job)
q.log.Warn("drained job has no handler, moved to dead letter", "job_id", job.ID, "type", job.Type)
return
}
job.Status = StatusRunning
now := time.Now().UTC()
job.StartedAt = &now
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update drained job status to running", "job_id", job.ID, "error", err)
}
ctx := context.Background()
if job.Timeout > 0 {
var cancel context.CancelFunc
ctx, cancel = context.WithTimeout(ctx, job.Timeout)
defer cancel()
}
if err := handler(ctx, job); err != nil {
job.Status = StatusFailed
job.Error = err.Error()
job.Retries++
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update drained job after handler failure", "job_id", job.ID, "error", err)
}
q.moveToDeadLetter(job)
q.log.Warn("drained job failed during shutdown", "job_id", job.ID, "type", job.Type, "error", err)
return
}
finished := time.Now().UTC()
job.FinishedAt = &finished
job.Status = StatusDone
job.Error = ""
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update drained job status to done", "job_id", job.ID, "error", err)
}
q.log.Info("drained job completed during shutdown", "job_id", job.ID, "type", job.Type)
}
// handBack returns a claimed-but-unstarted job to pending so whichever
// instance leads next can claim it.
func (q *Queue) handBack(job *Job) {
job.Status = StatusPending
job.StartedAt = nil
if err := q.store.Update(job); err != nil {
q.log.Error("failed to hand job back to store", "job_id", job.ID, "error", err)
}
}
// buffered reports how many jobs are sitting in the priority channels
// waiting for a worker.
func (q *Queue) buffered() int {
return len(q.highQueue) + len(q.normalQueue) + len(q.lowQueue)
}
func (q *Queue) runWorker(id int) {
defer q.wg.Done()
q.log.Info("worker ready", "worker_id", id)
for {
job := q.fetchJob()
if job == nil {
q.log.Info("worker shutting down", "worker_id", id)
return
}
q.processJob(job)
}
}
func (q *Queue) fetchJob() *Job {
for {
select {
case job := <-q.highQueue:
return job
default:
}
select {
case job := <-q.normalQueue:
return job
default:
}
select {
case job := <-q.lowQueue:
return job
default:
}
// All lanes empty — sleep briefly to avoid busy-spinning
// while waiting for the scheduler or a new enqueue.
time.Sleep(time.Millisecond)
select {
case <-q.stopCh:
return nil
case job := <-q.highQueue:
return job
case job := <-q.normalQueue:
return job
case job := <-q.lowQueue:
return job
}
}
}
func (q *Queue) priorityChannel(priority JobPriority) chan *Job {
switch priority {
case PriorityHigh:
return q.highQueue
case PriorityNormal:
return q.normalQueue
default:
return q.lowQueue
}
}
func (q *Queue) processJob(job *Job) {
if job == nil {
return
}
savedJob, err := q.store.Get(job.ID)
if err == nil && savedJob.Status == StatusCancelled {
q.log.Info("job was cancelled before processing", "job_id", job.ID)
return
}
release := q.limiter.acquire(job.Type)
defer release()
processingStart := time.Now().UTC()
now := processingStart
job.StartedAt = &now
job.Status = StatusRunning
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update job status to running", "job_id", job.ID, "error", err)
}
handler, exists := q.handlers[job.Type]
if !exists {
job.Status = StatusFailed
job.Error = fmt.Sprintf("no handler for job type: %s", job.Type)
job.FinishedAt = timePtr(time.Now().UTC())
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update job status after missing handler", "job_id", job.ID, "error", err)
}
q.finish(job, processingStart)
return
}
for attempt := 0; attempt <= job.MaxRetries; attempt++ {
if attempt > 0 {
backoff := time.Duration(math.Pow(2, float64(attempt-1))) * time.Second
q.log.Info("job retrying", "job_id", job.ID, "backoff", backoff, "attempt", attempt)
time.Sleep(backoff)
}
attemptCtx := context.Background()
var cancel context.CancelFunc
if job.Timeout > 0 {
attemptCtx, cancel = context.WithTimeout(attemptCtx, job.Timeout)
}
err := handler(attemptCtx, job)
if err == nil {
if cancel != nil {
cancel()
}
finished := time.Now().UTC()
job.FinishedAt = &finished
job.Status = StatusDone
job.Error = ""
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update job status to done", "job_id", job.ID, "error", err)
}
q.log.Info("job done", "job_id", job.ID, "type", job.Type, "attempts", attempt+1)
q.finish(job, processingStart)
return
}
if attemptCtx.Err() == context.DeadlineExceeded {
err = fmt.Errorf("attempt timed out after %s: %w", job.Timeout, attemptCtx.Err())
}
if cancel != nil {
cancel()
}
job.Retries = attempt + 1
job.Error = err.Error()
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update job after attempt failure", "job_id", job.ID, "error", err)
}
q.log.Warn("job attempt failed", "job_id", job.ID, "type", job.Type, "attempt", attempt+1, "error", err)
}
finished := time.Now().UTC()
job.FinishedAt = &finished
job.Status = StatusFailed
if err := q.store.Update(job); err != nil {
q.log.Error("failed to update job status to failed", "job_id", job.ID, "error", err)
}
q.log.Error("job failed permanently", "job_id", job.ID, "type", job.Type, "retries", job.MaxRetries)
q.moveToDeadLetter(job)
q.finish(job, processingStart)
}
// finish runs everything that should happen once a job reaches a
// terminal status, regardless of which one: metrics, the webhook
// notification, and firing whichever chained job matches the outcome.
func (q *Queue) finish(job *Job, processingStart time.Time) {
q.metrics.RecordCompletion(job.Type, job.Status, job.Retries, time.Since(processingStart))
q.notifyWebhook(job)
var next *JobTemplate
if job.Status == StatusDone {
next = job.OnSuccess
} else if job.Status == StatusFailed {
next = job.OnFailure
}
if next == nil {
return
}
chained := next.ToJob()
if err := q.Enqueue(chained); err != nil {
q.log.Error("failed to enqueue chained job", "parent_job_id", job.ID, "error", err)
}
}
// moveToDeadLetter archives a permanently-failed job so it can be
// inspected or replayed later, without cluttering normal job listings.
func (q *Queue) moveToDeadLetter(job *Job) {
entry := &DeadLetter{
JobID: job.ID,
Type: job.Type,
Payload: job.Payload,
Priority: job.Priority,
MaxRetries: job.MaxRetries,
Error: job.Error,
FailedAt: time.Now().UTC(),
OriginallyCreatedAt: job.CreatedAt,
}
if err := q.store.SaveDeadLetter(entry); err != nil {
q.log.Error("failed to save dead letter", "job_id", job.ID, "error", err)
}
}
// notifyWebhook fires a best-effort POST with the job's final status.
// It runs in its own goroutine so a slow or unreachable endpoint can
// never delay worker throughput; delivery failures are logged only.
func (q *Queue) notifyWebhook(job *Job) {
if job.WebhookURL == "" {
return
}
body, err := json.Marshal(map[string]any{
"job_id": job.ID,
"type": job.Type,
"status": job.Status.String(),
"error": job.Error,
"retries": job.Retries,
})
if err != nil {
q.log.Error("failed to marshal webhook payload", "job_id", job.ID, "error", err)
return
}
go func() {
resp, err := q.webhookClient.Post(job.WebhookURL, "application/json", bytes.NewReader(body))
if err != nil {
q.log.Warn("webhook delivery failed", "job_id", job.ID, "url", job.WebhookURL, "error", err)
return
}
defer resp.Body.Close()
if resp.StatusCode >= 300 {
q.log.Warn("webhook endpoint returned non-2xx", "job_id", job.ID, "url", job.WebhookURL, "status", resp.StatusCode)
}
}()
}
func timePtr(t time.Time) *time.Time {
return &t
}