1 # -*- encoding: binary -*-
5 # Implements a worker thread pool model. This is suited for platforms
6 # like Ruby 1.9, where the cost of dynamically spawning a new thread
7 # for every new client connection is higher than with the ThreadSpawn
10 # This model should provide a high level of compatibility with all
11 # Ruby implementations, and most libraries and applications.
12 # Applications running under this model should be thread-safe
13 # but not necessarily reentrant.
15 # Applications using this model are required to be thread-safe.
16 # Threads are never spawned dynamically under this model. If you're
17 # connecting to external services and need to perform DNS lookups,
18 # consider using the "resolv-replace" library which replaces parts of
19 # the core Socket package with concurrent DNS lookup capabilities.
21 # This model probably less suited for many slow clients than the
22 # others and thus a lower +worker_connections+ setting is recommended.
28 def worker_loop(worker)
29 init_worker_process(worker)
30 pool = (1..worker_connections).map do
31 Thread.new { LISTENERS.size == 1 ? sync_worker : async_worker }
35 # if any worker dies, something is serious wrong, bail
38 thr.join(1) and G.quit!
47 c = Rainbows.sync_accept(s) and process_client(c)
55 # TODO: check if select() or accept() is a problem on large
56 # SMP systems under Ruby 1.9. Hundreds of native threads
57 # all working off the same socket could be a thundering herd
58 # problem. On the other hand, a thundering herd may not
59 # even incur as much overhead as an extra Mutex#synchronize
60 ret = IO.select(LISTENERS, nil, nil, 1) and ret.first.each do |s|
61 s = Rainbows.accept(s) and process_client(s)
69 def join_threads(threads)
71 threads.delete_if do |thr|
73 thr.alive? ? thr.join(0.01) : true
74 end until threads.empty?