Sha256: f61e2514e52a59e73c4b2cc4c852a9dea7ff7371a36abf0d09bb49443f79b9db
Contents?: true
Size: 1.63 KB
Versions: 5
Compression:
Stored size: 1.63 KB
Contents
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 for Redis#blpop. 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 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 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
Version data entries
5 entries across 5 versions & 1 rubygems
Version | Path |
---|---|
sidekiq-1.1.2 | lib/sidekiq/fetch.rb |
sidekiq-1.1.1 | lib/sidekiq/fetch.rb |
sidekiq-1.1.0 | lib/sidekiq/fetch.rb |
sidekiq-1.0.0 | lib/sidekiq/fetch.rb |
sidekiq-0.11.2 | lib/sidekiq/fetch.rb |