mirror of
https://github.com/hibiken/asynq.git
synced 2024-12-27 00:02:19 +08:00
Return QueueNotFoundError from ArchiveAll* methods
This commit is contained in:
parent
30a3d9641a
commit
dd66acef1b
@ -563,20 +563,30 @@ func (r *RDB) removeAndRunAll(zset, qkey string) (int64, error) {
|
|||||||
|
|
||||||
// ArchiveAllRetryTasks archives all retry tasks from the given queue and
|
// ArchiveAllRetryTasks archives all retry tasks from the given queue and
|
||||||
// returns the number of tasks that were moved.
|
// returns the number of tasks that were moved.
|
||||||
|
// If a queue with the given name doesn't exist, it returns QueueNotFoundError.
|
||||||
func (r *RDB) ArchiveAllRetryTasks(qname string) (int64, error) {
|
func (r *RDB) ArchiveAllRetryTasks(qname string) (int64, error) {
|
||||||
|
var op errors.Op = "rdb.ArchiveAllRetryTasks"
|
||||||
n, err := r.archiveAll(base.RetryKey(qname), base.ArchivedKey(qname), qname)
|
n, err := r.archiveAll(base.RetryKey(qname), base.ArchivedKey(qname), qname)
|
||||||
|
if errors.IsQueueNotFound(err) {
|
||||||
|
return 0, errors.E(op, errors.NotFound, err)
|
||||||
|
}
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return 0, errors.E(errors.Op("rdb.ArchiveAllRetryTasks"), errors.Internal, err)
|
return 0, errors.E(op, errors.Internal, err)
|
||||||
}
|
}
|
||||||
return n, nil
|
return n, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// ArchiveAllScheduledTasks archives all scheduled tasks from the given queue and
|
// ArchiveAllScheduledTasks archives all scheduled tasks from the given queue and
|
||||||
// returns the number of tasks that were moved.
|
// returns the number of tasks that were moved.
|
||||||
|
// If a queue with the given name doesn't exist, it returns QueueNotFoundError.
|
||||||
func (r *RDB) ArchiveAllScheduledTasks(qname string) (int64, error) {
|
func (r *RDB) ArchiveAllScheduledTasks(qname string) (int64, error) {
|
||||||
|
var op errors.Op = "rdb.ArchiveAllScheduledTasks"
|
||||||
n, err := r.archiveAll(base.ScheduledKey(qname), base.ArchivedKey(qname), qname)
|
n, err := r.archiveAll(base.ScheduledKey(qname), base.ArchivedKey(qname), qname)
|
||||||
|
if errors.IsQueueNotFound(err) {
|
||||||
|
return 0, errors.E(op, errors.NotFound, err)
|
||||||
|
}
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return 0, errors.E(errors.Op("rdb.ArchiveAllScheduledTasks"), errors.Internal, err)
|
return 0, errors.E(op, errors.Internal, err)
|
||||||
}
|
}
|
||||||
return n, nil
|
return n, nil
|
||||||
}
|
}
|
||||||
@ -587,14 +597,21 @@ func (r *RDB) ArchiveAllScheduledTasks(qname string) (int64, error) {
|
|||||||
// Input:
|
// Input:
|
||||||
// KEYS[1] -> asynq:{<qname>}:pending
|
// KEYS[1] -> asynq:{<qname>}:pending
|
||||||
// KEYS[2] -> asynq:{<qname>}:archived
|
// KEYS[2] -> asynq:{<qname>}:archived
|
||||||
|
// KEYS[3] -> all queues key
|
||||||
|
// --
|
||||||
// ARGV[1] -> current timestamp
|
// ARGV[1] -> current timestamp
|
||||||
// ARGV[2] -> cutoff timestamp (e.g., 90 days ago)
|
// ARGV[2] -> cutoff timestamp (e.g., 90 days ago)
|
||||||
// ARGV[3] -> max number of tasks in archive (e.g., 100)
|
// ARGV[3] -> max number of tasks in archive (e.g., 100)
|
||||||
// ARGV[4] -> task key prefix (asynq:{<qname>}:t:)
|
// ARGV[4] -> task key prefix (asynq:{<qname>}:t:)
|
||||||
|
// ARGV[5] -> queue name
|
||||||
//
|
//
|
||||||
// Output:
|
// Output:
|
||||||
// integer: Number of tasks archiveda
|
// integer: Number of tasks archived
|
||||||
|
// Returns -1 if queue doesn't exist
|
||||||
var archiveAllPendingCmd = redis.NewScript(`
|
var archiveAllPendingCmd = redis.NewScript(`
|
||||||
|
if redis.call("SISMEMBER", KEYS[3], ARGV[5]) == 0 then
|
||||||
|
return -1
|
||||||
|
end
|
||||||
local ids = redis.call("LRANGE", KEYS[1], 0, -1)
|
local ids = redis.call("LRANGE", KEYS[1], 0, -1)
|
||||||
for _, id in ipairs(ids) do
|
for _, id in ipairs(ids) do
|
||||||
redis.call("ZADD", KEYS[2], ARGV[1], id)
|
redis.call("ZADD", KEYS[2], ARGV[1], id)
|
||||||
@ -607,15 +624,21 @@ return table.getn(ids)`)
|
|||||||
|
|
||||||
// ArchiveAllPendingTasks archives all pending tasks from the given queue and
|
// ArchiveAllPendingTasks archives all pending tasks from the given queue and
|
||||||
// returns the number of tasks moved.
|
// returns the number of tasks moved.
|
||||||
|
// If a queue with the given name doesn't exist, it returns QueueNotFoundError.
|
||||||
func (r *RDB) ArchiveAllPendingTasks(qname string) (int64, error) {
|
func (r *RDB) ArchiveAllPendingTasks(qname string) (int64, error) {
|
||||||
var op errors.Op = "rdb.ArchiveAllPendingTasks"
|
var op errors.Op = "rdb.ArchiveAllPendingTasks"
|
||||||
keys := []string{base.PendingKey(qname), base.ArchivedKey(qname)}
|
keys := []string{
|
||||||
|
base.PendingKey(qname),
|
||||||
|
base.ArchivedKey(qname),
|
||||||
|
base.AllQueues,
|
||||||
|
}
|
||||||
now := time.Now()
|
now := time.Now()
|
||||||
argv := []interface{}{
|
argv := []interface{}{
|
||||||
now.Unix(),
|
now.Unix(),
|
||||||
now.AddDate(0, 0, -archivedExpirationInDays).Unix(),
|
now.AddDate(0, 0, -archivedExpirationInDays).Unix(),
|
||||||
maxArchiveSize,
|
maxArchiveSize,
|
||||||
base.TaskKeyPrefix(qname),
|
base.TaskKeyPrefix(qname),
|
||||||
|
qname,
|
||||||
}
|
}
|
||||||
res, err := archiveAllPendingCmd.Run(r.client, keys, argv...).Result()
|
res, err := archiveAllPendingCmd.Run(r.client, keys, argv...).Result()
|
||||||
if err != nil {
|
if err != nil {
|
||||||
@ -625,6 +648,9 @@ func (r *RDB) ArchiveAllPendingTasks(qname string) (int64, error) {
|
|||||||
if !ok {
|
if !ok {
|
||||||
return 0, errors.E(op, errors.Internal, fmt.Sprintf("unexpected return value from script %v", res))
|
return 0, errors.E(op, errors.Internal, fmt.Sprintf("unexpected return value from script %v", res))
|
||||||
}
|
}
|
||||||
|
if n == -1 {
|
||||||
|
return 0, errors.E(op, errors.NotFound, &errors.QueueNotFoundError{Queue: qname})
|
||||||
|
}
|
||||||
return n, nil
|
return n, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -733,14 +759,21 @@ func (r *RDB) ArchiveTask(qname string, id uuid.UUID) error {
|
|||||||
// Input:
|
// Input:
|
||||||
// KEYS[1] -> ZSET to move task from (e.g., asynq:{<qname>}:retry)
|
// KEYS[1] -> ZSET to move task from (e.g., asynq:{<qname>}:retry)
|
||||||
// KEYS[2] -> asynq:{<qname>}:archived
|
// KEYS[2] -> asynq:{<qname>}:archived
|
||||||
|
// KEYS[3] -> all queues key
|
||||||
|
// --
|
||||||
// ARGV[1] -> current timestamp
|
// ARGV[1] -> current timestamp
|
||||||
// ARGV[2] -> cutoff timestamp (e.g., 90 days ago)
|
// ARGV[2] -> cutoff timestamp (e.g., 90 days ago)
|
||||||
// ARGV[3] -> max number of tasks in archive (e.g., 100)
|
// ARGV[3] -> max number of tasks in archive (e.g., 100)
|
||||||
// ARGV[4] -> task key prefix (asynq:{<qname>}:t:)
|
// ARGV[4] -> task key prefix (asynq:{<qname>}:t:)
|
||||||
|
// ARGV[5] -> queue name
|
||||||
//
|
//
|
||||||
// Output:
|
// Output:
|
||||||
// integer: number of tasks archived
|
// integer: number of tasks archived
|
||||||
|
// Returns -1 if queue doesn't exist
|
||||||
var archiveAllCmd = redis.NewScript(`
|
var archiveAllCmd = redis.NewScript(`
|
||||||
|
if redis.call("SISMEMBER", KEYS[3], ARGV[5]) == 0 then
|
||||||
|
return -1
|
||||||
|
end
|
||||||
local ids = redis.call("ZRANGE", KEYS[1], 0, -1)
|
local ids = redis.call("ZRANGE", KEYS[1], 0, -1)
|
||||||
for _, id in ipairs(ids) do
|
for _, id in ipairs(ids) do
|
||||||
redis.call("ZADD", KEYS[2], ARGV[1], id)
|
redis.call("ZADD", KEYS[2], ARGV[1], id)
|
||||||
@ -752,14 +785,20 @@ redis.call("DEL", KEYS[1])
|
|||||||
return table.getn(ids)`)
|
return table.getn(ids)`)
|
||||||
|
|
||||||
func (r *RDB) archiveAll(src, dst, qname string) (int64, error) {
|
func (r *RDB) archiveAll(src, dst, qname string) (int64, error) {
|
||||||
|
keys := []string{
|
||||||
|
src,
|
||||||
|
dst,
|
||||||
|
base.AllQueues,
|
||||||
|
}
|
||||||
now := time.Now()
|
now := time.Now()
|
||||||
argv := []interface{}{
|
argv := []interface{}{
|
||||||
now.Unix(),
|
now.Unix(),
|
||||||
now.AddDate(0, 0, -archivedExpirationInDays).Unix(),
|
now.AddDate(0, 0, -archivedExpirationInDays).Unix(),
|
||||||
maxArchiveSize,
|
maxArchiveSize,
|
||||||
base.TaskKeyPrefix(qname),
|
base.TaskKeyPrefix(qname),
|
||||||
|
qname,
|
||||||
}
|
}
|
||||||
res, err := archiveAllCmd.Run(r.client, []string{src, dst}, argv...).Result()
|
res, err := archiveAllCmd.Run(r.client, keys, argv...).Result()
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return 0, err
|
return 0, err
|
||||||
}
|
}
|
||||||
@ -767,6 +806,9 @@ func (r *RDB) archiveAll(src, dst, qname string) (int64, error) {
|
|||||||
if !ok {
|
if !ok {
|
||||||
return 0, fmt.Errorf("unexpected return value from script: %v", res)
|
return 0, fmt.Errorf("unexpected return value from script: %v", res)
|
||||||
}
|
}
|
||||||
|
if n == -1 {
|
||||||
|
return 0, &errors.QueueNotFoundError{Queue: qname}
|
||||||
|
}
|
||||||
return n, nil
|
return n, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -2577,6 +2577,35 @@ func TestArchiveAllScheduledTasks(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestArchiveAllTasksError(t *testing.T) {
|
||||||
|
r := setup(t)
|
||||||
|
defer r.Close()
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
desc string
|
||||||
|
qname string
|
||||||
|
match func(err error) bool
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
desc: "It returns QueueNotFoundError if queue doesn't exist",
|
||||||
|
qname: "nonexistent",
|
||||||
|
match: errors.IsQueueNotFound,
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tc := range tests {
|
||||||
|
if _, got := r.ArchiveAllPendingTasks(tc.qname); !tc.match(got) {
|
||||||
|
t.Errorf("%s: ArchiveAllPendingTasks returned %v", tc.desc, got)
|
||||||
|
}
|
||||||
|
if _, got := r.ArchiveAllScheduledTasks(tc.qname); !tc.match(got) {
|
||||||
|
t.Errorf("%s: ArchiveAllScheduledTasks returned %v", tc.desc, got)
|
||||||
|
}
|
||||||
|
if _, got := r.ArchiveAllRetryTasks(tc.qname); !tc.match(got) {
|
||||||
|
t.Errorf("%s: ArchiveAllRetryTasks returned %v", tc.desc, got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
func TestDeleteArchivedTask(t *testing.T) {
|
func TestDeleteArchivedTask(t *testing.T) {
|
||||||
r := setup(t)
|
r := setup(t)
|
||||||
defer r.Close()
|
defer r.Close()
|
||||||
|
Loading…
Reference in New Issue
Block a user