1
0
Fork 0
mirror of https://github.com/mperham/sidekiq.git synced 2022-11-09 13:52:34 -05:00
mperham--sidekiq/lib/sidekiq/fetch.rb
2012-04-18 17:06:46 -07:00

63 lines
1.8 KiB
Ruby

require 'sidekiq'
require 'celluloid'
module Sidekiq
##
# The Fetcher blocks on Redis, waiting for a message to process
# from the queues. It gets the message and hands it to the Manager
# to assign to a ready Processor.
class Fetcher
include Celluloid
include Sidekiq::Util
TIMEOUT = 1
def initialize(mgr, queues)
@mgr = mgr
@queues = queues.map { |q| "queue:#{q}" }
@unique_queues = @queues.uniq
end
# Fetching is straightforward: the Manager makes a fetch
# request for each idle processor when Sidekiq starts and
# then issues a new fetch request every time a Processor
# finishes a message.
#
# Because we have to shut down cleanly, we can't block
# forever and we can't loop forever. Instead we reschedule
# a new fetch if the current fetch turned up nothing.
def fetch
watchdog('Fetcher#fetch died') do
begin
queue = nil
msg = nil
Sidekiq.redis { |conn| queue, msg = conn.blpop(*queues_cmd) }
if msg
@mgr.assign!(msg, queue.gsub(/.*queue:/, ''))
else
after(0) { fetch }
end
rescue => ex
logger.error("Error while fetching messages: #{ex}")
logger.error(ex.backtrace.join("\n"))
sleep(TIMEOUT)
after(0) { fetch }
end
end
end
private
# Creating the Redis#blpop command takes into account any
# configured queue weights. By default Redis#blpop returns
# data from the first queue that has pending elements. We
# recreate the queue command each time we invoke Redis#blpop
# to honor weights and avoid queue starvation.
def queues_cmd
queues = @queues.sample(@unique_queues.size).uniq
queues.concat(@unique_queues - queues)
queues << TIMEOUT
end
end
end