mirror of
https://github.com/mperham/sidekiq.git
synced 2022-11-09 13:52:34 -05:00
328 lines
7.3 KiB
Ruby
328 lines
7.3 KiB
Ruby
require 'sidekiq'
|
|
|
|
module Sidekiq
|
|
class Stats
|
|
def processed
|
|
count = Sidekiq.redis do |conn|
|
|
conn.get("stat:processed")
|
|
end
|
|
count.nil? ? 0 : count.to_i
|
|
end
|
|
|
|
def failed
|
|
count = Sidekiq.redis do |conn|
|
|
conn.get("stat:failed")
|
|
end
|
|
count.nil? ? 0 : count.to_i
|
|
end
|
|
|
|
def queues
|
|
Sidekiq.redis do |conn|
|
|
queues = conn.smembers('queues')
|
|
|
|
array_of_arrays = queues.inject({}) do |memo, queue|
|
|
memo[queue] = conn.llen("queue:#{queue}")
|
|
memo
|
|
end.sort_by { |_, size| size }
|
|
|
|
Hash[array_of_arrays.reverse]
|
|
end
|
|
end
|
|
|
|
def enqueued
|
|
queues.values.inject(&:+) || 0
|
|
end
|
|
|
|
class History
|
|
def initialize(days_previous, start_date = nil)
|
|
@days_previous = days_previous
|
|
@start_date = start_date || Time.now.utc.to_date
|
|
end
|
|
|
|
def processed
|
|
date_stat_hash("processed")
|
|
end
|
|
|
|
def failed
|
|
date_stat_hash("failed")
|
|
end
|
|
|
|
def self.cleanup
|
|
days_of_stats_to_keep = 180
|
|
today = Time.now.utc.to_date
|
|
delete_before_date = Time.now.utc.to_date - days_of_stats_to_keep
|
|
|
|
Sidekiq.redis do |conn|
|
|
processed_keys = conn.keys("stat:processed:*")
|
|
earliest = "stat:processed:#{delete_before_date.to_s}"
|
|
pkeys = processed_keys.select { |key| key < earliest }
|
|
conn.del(pkeys) if pkeys.size > 0
|
|
|
|
failed_keys = conn.keys("stat:failed:*")
|
|
earliest = "stat:failed:#{delete_before_date.to_s}"
|
|
fkeys = failed_keys.select { |key| key < earliest }
|
|
conn.del(fkeys) if fkeys.size > 0
|
|
end
|
|
end
|
|
|
|
private
|
|
|
|
def date_stat_hash(stat)
|
|
i = 0
|
|
stat_hash = {}
|
|
|
|
Sidekiq.redis do |conn|
|
|
while i < @days_previous
|
|
date = @start_date - i
|
|
value = conn.get("stat:#{stat}:#{date}")
|
|
|
|
stat_hash[date.to_s] = value ? value.to_i : 0
|
|
|
|
i += 1
|
|
end
|
|
end
|
|
|
|
stat_hash
|
|
end
|
|
end
|
|
end
|
|
|
|
##
|
|
# Encapsulates a queue within Sidekiq.
|
|
# Allows enumeration of all jobs within the queue
|
|
# and deletion of jobs.
|
|
#
|
|
# queue = Sidekiq::Queue.new("mailer")
|
|
# queue.each do |job|
|
|
# job.klass # => 'MyWorker'
|
|
# job.args # => [1, 2, 3]
|
|
# job.delete if job.jid == 'abcdef1234567890'
|
|
# end
|
|
#
|
|
class Queue
|
|
include Enumerable
|
|
|
|
attr_reader :name
|
|
|
|
def initialize(name="default")
|
|
@name = name
|
|
@rname = "queue:#{name}"
|
|
end
|
|
|
|
def size
|
|
Sidekiq.redis { |con| con.llen(@rname) }
|
|
end
|
|
|
|
def each(&block)
|
|
page = 0
|
|
page_size = 50
|
|
|
|
loop do
|
|
entries = Sidekiq.redis do |conn|
|
|
conn.lrange @rname, page * page_size, (page * page_size) + page_size - 1
|
|
end
|
|
break if entries.empty?
|
|
page += 1
|
|
entries.each do |entry|
|
|
block.call Job.new(entry, @name)
|
|
end
|
|
end
|
|
end
|
|
|
|
def clear
|
|
Sidekiq.redis do |conn|
|
|
conn.multi do
|
|
conn.del("queue:#{name}")
|
|
conn.srem("queues", name)
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|
|
##
|
|
# Encapsulates a pending job within a Sidekiq queue or
|
|
# sorted set.
|
|
#
|
|
# The job should be considered immutable but may be
|
|
# removed from the queue via Job#delete.
|
|
#
|
|
class Job
|
|
attr_reader :item
|
|
|
|
def initialize(item, queue_name=nil)
|
|
@value = item
|
|
@item = Sidekiq.load_json(item)
|
|
@queue = queue_name || @item['queue']
|
|
end
|
|
|
|
def klass
|
|
@item['class']
|
|
end
|
|
|
|
def args
|
|
@item['args']
|
|
end
|
|
|
|
def jid
|
|
@item['jid']
|
|
end
|
|
|
|
def queue
|
|
@queue
|
|
end
|
|
|
|
##
|
|
# Remove this job from the queue.
|
|
def delete
|
|
count = Sidekiq.redis do |conn|
|
|
conn.lrem("queue:#{@queue}", 0, @value)
|
|
end
|
|
count != 0
|
|
end
|
|
|
|
def [](name)
|
|
@item.send(:[], name)
|
|
end
|
|
end
|
|
|
|
class SortedEntry < Job
|
|
attr_reader :score
|
|
|
|
def initialize(parent, score, item)
|
|
super(item)
|
|
@score = score
|
|
@parent = parent
|
|
end
|
|
|
|
def at
|
|
Time.at(score)
|
|
end
|
|
|
|
def delete
|
|
@parent.delete(score, jid)
|
|
end
|
|
|
|
def retry
|
|
raise "Retry not available on jobs not in the Retry queue." unless item["failed_at"]
|
|
Sidekiq.redis do |conn|
|
|
results = conn.zrangebyscore('retry', score, score)
|
|
conn.zremrangebyscore('retry', score, score)
|
|
results.map do |message|
|
|
msg = Sidekiq.load_json(message)
|
|
msg['retry_count'] = msg['retry_count'] - 1
|
|
conn.rpush("queue:#{msg['queue']}", Sidekiq.dump_json(msg))
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|
|
class SortedSet
|
|
include Enumerable
|
|
|
|
def initialize(name)
|
|
@zset = name
|
|
end
|
|
|
|
def size
|
|
Sidekiq.redis {|c| c.zcard(@zset) }
|
|
end
|
|
|
|
def each(&block)
|
|
# page thru the sorted set backwards so deleting entries doesn't screw up indexing
|
|
page = -1
|
|
page_size = 50
|
|
|
|
loop do
|
|
elements = Sidekiq.redis do |conn|
|
|
conn.zrange @zset, page * page_size, (page * page_size) + (page_size - 1), :with_scores => true
|
|
end
|
|
break if elements.empty?
|
|
page -= 1
|
|
elements.each do |element, score|
|
|
block.call SortedEntry.new(self, score, element)
|
|
end
|
|
end
|
|
end
|
|
|
|
def fetch(score, jid = nil)
|
|
elements = Sidekiq.redis do |conn|
|
|
conn.zrangebyscore(@zset, score, score)
|
|
end
|
|
|
|
elements.inject([]) do |result, element|
|
|
entry = SortedEntry.new(self, score, element)
|
|
if jid
|
|
result << entry if entry.jid == jid
|
|
else
|
|
result << entry
|
|
end
|
|
result
|
|
end
|
|
end
|
|
|
|
def delete(score, jid = nil)
|
|
if jid
|
|
elements = Sidekiq.redis do |conn|
|
|
conn.zrangebyscore(@zset, score, score)
|
|
end
|
|
|
|
elements_with_jid = elements.map do |element|
|
|
message = Sidekiq.load_json(element)
|
|
|
|
if message["jid"] == jid
|
|
Sidekiq.redis { |conn| conn.zrem(@zset, element) }
|
|
end
|
|
end
|
|
elements_with_jid.count != 0
|
|
else
|
|
count = Sidekiq.redis do |conn|
|
|
conn.zremrangebyscore(@zset, score, score)
|
|
end
|
|
count != 0
|
|
end
|
|
end
|
|
|
|
def clear
|
|
Sidekiq.redis do |conn|
|
|
conn.del(@zset)
|
|
end
|
|
end
|
|
end
|
|
|
|
##
|
|
# Allows enumeration of scheduled jobs within Sidekiq.
|
|
# Based on this, you can search/filter for jobs. Here's an
|
|
# example where I'm selecting all jobs of a certain type
|
|
# and deleting them from the retry queue.
|
|
#
|
|
# r = Sidekiq::ScheduledSet.new
|
|
# r.select do |retri|
|
|
# retri.klass == 'Sidekiq::Extensions::DelayedClass' &&
|
|
# retri.args[0] == 'User' &&
|
|
# retri.args[1] == 'setup_new_subscriber'
|
|
# end.map(&:delete)
|
|
class ScheduledSet < SortedSet
|
|
def initialize
|
|
super 'schedule'
|
|
end
|
|
end
|
|
|
|
##
|
|
# Allows enumeration of retries within Sidekiq.
|
|
# Based on this, you can search/filter for jobs. Here's an
|
|
# example where I'm selecting all jobs of a certain type
|
|
# and deleting them from the retry queue.
|
|
#
|
|
# r = Sidekiq::RetrySet.new
|
|
# r.select do |retri|
|
|
# retri.klass == 'Sidekiq::Extensions::DelayedClass' &&
|
|
# retri.args[0] == 'User' &&
|
|
# retri.args[1] == 'setup_new_subscriber'
|
|
# end.map(&:delete)
|
|
class RetrySet < SortedSet
|
|
def initialize
|
|
super 'retry'
|
|
end
|
|
end
|
|
|
|
end
|