-
Notifications
You must be signed in to change notification settings - Fork 34
/
base.lua
422 lines (387 loc) · 13.7 KB
/
base.lua
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
-------------------------------------------------------------------------------
-- Forward declarations to make everything happy
-------------------------------------------------------------------------------
local Qless = {
ns = 'ql:'
}
-- Queue forward delcaration
local QlessQueue = {
ns = Qless.ns .. 'q:'
}
QlessQueue.__index = QlessQueue
-- Worker forward declaration
local QlessWorker = {
ns = Qless.ns .. 'w:'
}
QlessWorker.__index = QlessWorker
-- Job forward declaration
local QlessJob = {
ns = Qless.ns .. 'j:'
}
QlessJob.__index = QlessJob
-- RecurringJob forward declaration
local QlessRecurringJob = {}
QlessRecurringJob.__index = QlessRecurringJob
-- Config forward declaration
Qless.config = {}
-- Extend a table. This comes up quite frequently
function table.extend(self, other)
for i, v in ipairs(other) do
table.insert(self, v)
end
end
-- This is essentially the same as redis' publish, but it prefixes the channel
-- with the Qless namespace
function Qless.publish(channel, message)
redis.call('publish', Qless.ns .. channel, message)
end
-- Return a job object given its job id
function Qless.job(jid)
assert(jid, 'Job(): no jid provided')
local job = {}
setmetatable(job, QlessJob)
job.jid = jid
return job
end
-- Return a recurring job object
function Qless.recurring(jid)
assert(jid, 'Recurring(): no jid provided')
local job = {}
setmetatable(job, QlessRecurringJob)
job.jid = jid
return job
end
-- Failed([group, [start, [limit]]])
-- ------------------------------------
-- If no group is provided, this returns a JSON blob of the counts of the
-- various groups of failures known. If a group is provided, it will report up
-- to `limit` from `start` of the jobs affected by that issue.
--
-- # If no group, then...
-- {
-- 'group1': 1,
-- 'group2': 5,
-- ...
-- }
--
-- # If a group is provided, then...
-- {
-- 'total': 20,
-- 'jobs': [
-- {
-- # All the normal keys for a job
-- 'jid': ...,
-- 'data': ...
-- # The message for this particular instance
-- 'message': ...,
-- 'group': ...,
-- }, ...
-- ]
-- }
--
function Qless.failed(group, start, limit)
start = assert(tonumber(start or 0),
'Failed(): Arg "start" is not a number: ' .. (start or 'nil'))
limit = assert(tonumber(limit or 25),
'Failed(): Arg "limit" is not a number: ' .. (limit or 'nil'))
if group then
-- If a group was provided, then we should do paginated lookup
return {
total = redis.call('llen', 'ql:f:' .. group),
jobs = redis.call('lrange', 'ql:f:' .. group, start, start + limit - 1)
}
else
-- Otherwise, we should just list all the known failure groups we have
local response = {}
local groups = redis.call('smembers', 'ql:failures')
for index, group in ipairs(groups) do
response[group] = redis.call('llen', 'ql:f:' .. group)
end
return response
end
end
-- Jobs(now, 'complete', [offset, [count]])
-- Jobs(now, (
-- 'stalled' | 'running' | 'scheduled' | 'depends', 'recurring'
-- ), queue, [offset, [count]])
-------------------------------------------------------------------------------
-- Return all the job ids currently considered to be in the provided state
-- in a particular queue. The response is a list of job ids:
--
-- [
-- jid1,
-- jid2,
-- ...
-- ]
function Qless.jobs(now, state, ...)
assert(state, 'Jobs(): Arg "state" missing')
if state == 'complete' then
local offset = assert(tonumber(arg[1] or 0),
'Jobs(): Arg "offset" not a number: ' .. tostring(arg[1]))
local count = assert(tonumber(arg[2] or 25),
'Jobs(): Arg "count" not a number: ' .. tostring(arg[2]))
return redis.call('zrevrange', 'ql:completed', offset,
offset + count - 1)
else
local name = assert(arg[1], 'Jobs(): Arg "queue" missing')
local offset = assert(tonumber(arg[2] or 0),
'Jobs(): Arg "offset" not a number: ' .. tostring(arg[2]))
local count = assert(tonumber(arg[3] or 25),
'Jobs(): Arg "count" not a number: ' .. tostring(arg[3]))
local queue = Qless.queue(name)
if state == 'running' then
return queue.locks.peek(now, offset, count)
elseif state == 'stalled' then
return queue.locks.expired(now, offset, count)
elseif state == 'scheduled' then
queue:check_scheduled(now, queue.scheduled.length())
return queue.scheduled.peek(now, offset, count)
elseif state == 'depends' then
return queue.depends.peek(now, offset, count)
elseif state == 'recurring' then
return queue.recurring.peek('+inf', offset, count)
else
error('Jobs(): Unknown type "' .. state .. '"')
end
end
end
-- Track()
-- Track(now, ('track' | 'untrack'), jid)
-- ------------------------------------------
-- If no arguments are provided, it returns details of all currently-tracked
-- jobs. If the first argument is 'track', then it will start tracking the job
-- associated with that id, and 'untrack' stops tracking it. In this context,
-- tracking is nothing more than saving the job to a list of jobs that are
-- considered special.
--
-- {
-- 'jobs': [
-- {
-- 'jid': ...,
-- # All the other details you'd get from 'get'
-- }, {
-- ...
-- }
-- ], 'expired': [
-- # These are all the jids that are completed and whose data expired
-- 'deadbeef',
-- ...,
-- ...,
-- ]
-- }
--
function Qless.track(now, command, jid)
if command ~= nil then
assert(jid, 'Track(): Arg "jid" missing')
-- Verify that job exists
assert(Qless.job(jid):exists(), 'Track(): Job does not exist')
if string.lower(command) == 'track' then
Qless.publish('track', jid)
return redis.call('zadd', 'ql:tracked', now, jid)
elseif string.lower(command) == 'untrack' then
Qless.publish('untrack', jid)
return redis.call('zrem', 'ql:tracked', jid)
else
error('Track(): Unknown action "' .. command .. '"')
end
else
local response = {
jobs = {},
expired = {}
}
local jids = redis.call('zrange', 'ql:tracked', 0, -1)
for index, jid in ipairs(jids) do
local data = Qless.job(jid):data()
if data then
table.insert(response.jobs, data)
else
table.insert(response.expired, jid)
end
end
return response
end
end
-- tag(now, ('add' | 'remove'), jid, tag, [tag, ...])
-- tag(now, 'get', tag, [offset, [count]])
-- tag(now, 'top', [offset, [count]])
-- -----------------------------------------------------------------------------
-- Accepts a jid, 'add' or 'remove', and then a list of tags
-- to either add or remove from the job. Alternatively, 'get',
-- a tag to get jobs associated with that tag, and offset and
-- count
--
-- If 'add' or 'remove', the response is a list of the jobs
-- current tags, or False if the job doesn't exist. If 'get',
-- the response is of the form:
--
-- {
-- total: ...,
-- jobs: [
-- jid,
-- ...
-- ]
-- }
--
-- If 'top' is supplied, it returns the most commonly-used tags
-- in a paginated fashion.
function Qless.tag(now, command, ...)
assert(command,
'Tag(): Arg "command" must be "add", "remove", "get" or "top"')
if command == 'add' then
local jid = assert(arg[1], 'Tag(): Arg "jid" missing')
local tags = redis.call('hget', QlessJob.ns .. jid, 'tags')
-- If the job has been canceled / deleted, then return false
if tags then
-- Decode the json blob, convert to dictionary
tags = cjson.decode(tags)
local _tags = {}
for i,v in ipairs(tags) do _tags[v] = true end
-- Otherwise, add the job to the sorted set with that tags
for i=2,#arg do
local tag = arg[i]
if _tags[tag] == nil or _tags[tag] == false then
_tags[tag] = true
table.insert(tags, tag)
end
redis.call('zadd', 'ql:t:' .. tag, now, jid)
redis.call('zincrby', 'ql:tags', 1, tag)
end
redis.call('hset', QlessJob.ns .. jid, 'tags', cjson.encode(tags))
return tags
else
error('Tag(): Job ' .. jid .. ' does not exist')
end
elseif command == 'remove' then
local jid = assert(arg[1], 'Tag(): Arg "jid" missing')
local tags = redis.call('hget', QlessJob.ns .. jid, 'tags')
-- If the job has been canceled / deleted, then return false
if tags then
-- Decode the json blob, convert to dictionary
tags = cjson.decode(tags)
local _tags = {}
for i,v in ipairs(tags) do _tags[v] = true end
-- Otherwise, add the job to the sorted set with that tags
for i=2,#arg do
local tag = arg[i]
_tags[tag] = nil
redis.call('zrem', 'ql:t:' .. tag, jid)
redis.call('zincrby', 'ql:tags', -1, tag)
end
local results = {}
for i,tag in ipairs(tags) do if _tags[tag] then table.insert(results, tag) end end
redis.call('hset', QlessJob.ns .. jid, 'tags', cjson.encode(results))
return results
else
error('Tag(): Job ' .. jid .. ' does not exist')
end
elseif command == 'get' then
local tag = assert(arg[1], 'Tag(): Arg "tag" missing')
local offset = assert(tonumber(arg[2] or 0),
'Tag(): Arg "offset" not a number: ' .. tostring(arg[2]))
local count = assert(tonumber(arg[3] or 25),
'Tag(): Arg "count" not a number: ' .. tostring(arg[3]))
return {
total = redis.call('zcard', 'ql:t:' .. tag),
jobs = redis.call('zrange', 'ql:t:' .. tag, offset, offset + count - 1)
}
elseif command == 'top' then
local offset = assert(tonumber(arg[1] or 0) , 'Tag(): Arg "offset" not a number: ' .. tostring(arg[1]))
local count = assert(tonumber(arg[2] or 25), 'Tag(): Arg "count" not a number: ' .. tostring(arg[2]))
return redis.call('zrevrangebyscore', 'ql:tags', '+inf', 2, 'limit', offset, count)
else
error('Tag(): First argument must be "add", "remove" or "get"')
end
end
-- Cancel(...)
-- --------------
-- Cancel a job from taking place. It will be deleted from the system, and any
-- attempts to renew a heartbeat will fail, and any attempts to complete it
-- will fail. If you try to get the data on the object, you will get nothing.
function Qless.cancel(...)
-- Dependents is a mapping of a job to its dependent jids
local dependents = {}
for _, jid in ipairs(arg) do
dependents[jid] = redis.call(
'smembers', QlessJob.ns .. jid .. '-dependents') or {}
end
-- Now, we'll loop through every jid we intend to cancel, and we'll go
-- make sure that this operation will be ok
for i, jid in ipairs(arg) do
for j, dep in ipairs(dependents[jid]) do
if dependents[dep] == nil or dependents[dep] == false then
error('Cancel(): ' .. jid .. ' is a dependency of ' .. dep ..
' but is not mentioned to be canceled')
end
end
end
-- If we've made it this far, then we are good to go. We can now just
-- remove any trace of all these jobs, as they form a dependent clique
for _, jid in ipairs(arg) do
-- Find any stage it's associated with and remove its from that stage
local state, queue, failure, worker = unpack(redis.call(
'hmget', QlessJob.ns .. jid, 'state', 'queue', 'failure', 'worker'))
if state ~= 'complete' then
-- Send a message out on the appropriate channels
local encoded = cjson.encode({
jid = jid,
worker = worker,
event = 'canceled',
queue = queue
})
Qless.publish('log', encoded)
-- Remove this job from whatever worker has it, if any
if worker and (worker ~= '') then
redis.call('zrem', 'ql:w:' .. worker .. ':jobs', jid)
-- If necessary, send a message to the appropriate worker, too
Qless.publish('w:' .. worker, encoded)
end
-- Remove it from that queue
if queue then
local queue = Qless.queue(queue)
queue.work.remove(jid)
queue.locks.remove(jid)
queue.scheduled.remove(jid)
queue.depends.remove(jid)
end
-- We should probably go through all our dependencies and remove
-- ourselves from the list of dependents
for i, j in ipairs(redis.call(
'smembers', QlessJob.ns .. jid .. '-dependencies')) do
redis.call('srem', QlessJob.ns .. j .. '-dependents', jid)
end
-- Delete any notion of dependencies it has
redis.call('del', QlessJob.ns .. jid .. '-dependencies')
-- If we're in the failed state, remove all of our data
if state == 'failed' then
failure = cjson.decode(failure)
-- We need to make this remove it from the failed queues
redis.call('lrem', 'ql:f:' .. failure.group, 0, jid)
if redis.call('llen', 'ql:f:' .. failure.group) == 0 then
redis.call('srem', 'ql:failures', failure.group)
end
-- Remove one count from the failed count of the particular
-- queue
local bin = failure.when - (failure.when % 86400)
local failed = redis.call(
'hget', 'ql:s:stats:' .. bin .. ':' .. queue, 'failed')
redis.call('hset',
'ql:s:stats:' .. bin .. ':' .. queue, 'failed', failed - 1)
end
-- Remove it as a job that's tagged with this particular tag
local tags = cjson.decode(
redis.call('hget', QlessJob.ns .. jid, 'tags') or '{}')
for i, tag in ipairs(tags) do
redis.call('zrem', 'ql:t:' .. tag, jid)
redis.call('zincrby', 'ql:tags', -1, tag)
end
-- If the job was being tracked, we should notify
if redis.call('zscore', 'ql:tracked', jid) ~= false then
Qless.publish('canceled', jid)
end
-- Just go ahead and delete our data
redis.call('del', QlessJob.ns .. jid)
redis.call('del', QlessJob.ns .. jid .. '-history')
end
end
return arg
end