2
0
mirror of https://github.com/hibiken/asynq.git synced 2024-11-14 11:31:18 +08:00
asynq/retry.go

35 lines
1.0 KiB
Go
Raw Normal View History

package asynq
import (
"log"
"math"
"math/rand"
"time"
)
func retryTask(rdb *rdb, msg *taskMessage, err error) {
2019-11-29 03:22:42 +08:00
msg.ErrorMsg = err.Error()
if msg.Retried >= msg.Retry {
2019-11-29 03:22:42 +08:00
log.Printf("[WARN] Retry exhausted for task(Type: %q, ID: %v)\n", msg.Type, msg.ID)
if err := rdb.kill(msg); err != nil {
2019-11-29 03:22:42 +08:00
log.Printf("[ERROR] Could not add task %+v to 'dead'\n", err)
}
return
}
retryAt := time.Now().Add(delaySeconds((msg.Retried)))
2019-11-29 03:22:42 +08:00
log.Printf("[INFO] Retrying task(Type: %q, ID: %v) in %v\n", msg.Type, msg.ID, retryAt.Sub(time.Now()))
msg.Retried++
2019-11-27 23:16:16 +08:00
if err := rdb.schedule(retry, retryAt, msg); err != nil {
2019-11-29 03:22:42 +08:00
log.Printf("[ERROR] Could not add msg %+v to 'retry': %v\n", msg, err)
return
}
}
// delaySeconds returns a number seconds to delay before retrying.
// Formula taken from https://github.com/mperham/sidekiq.
func delaySeconds(count int) time.Duration {
r := rand.New(rand.NewSource(time.Now().UnixNano()))
s := int(math.Pow(float64(count), 4)) + 15 + (r.Intn(30) * (count + 1))
return time.Duration(s) * time.Second
}