forked from kr/beanstalk-client-ruby
-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
connection.rb
377 lines (306 loc) · 8.13 KB
/
connection.rb
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
# beanstalk-client/connection.rb - client library for beanstalk
# Copyright (C) 2007 Philotic Inc.
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
require 'socket'
require 'fcntl'
require 'yaml'
require 'set'
require 'beanstalk-client/bag'
require 'beanstalk-client/errors'
require 'beanstalk-client/job'
module Beanstalk
class RawConnection
attr_reader :addr
def initialize(addr, jptr=self)
@addr = addr
@jptr = jptr
connect
end
def connect
host, port = addr.split(':')
@socket = TCPSocket.new(host, port.to_i)
# Don't leak fds when we exec.
@socket.fcntl(Fcntl::F_SETFD, Fcntl::FD_CLOEXEC)
end
def close
@socket.close
@socket = nil
end
def put(body, pri=65536, delay=0, ttr=120)
@socket.write("put #{pri} #{delay} #{ttr} #{body.size}\r\n#{body}\r\n")
check_resp('INSERTED', 'BURIED')[0].to_i
end
def yput(obj, pri=65536, delay=0, ttr=120)
put(YAML.dump(obj), pri, delay, ttr)
end
def peek()
@socket.write("peek\r\n")
begin
Job.new(@jptr, *read_job('FOUND'))
rescue UnexpectedResponse
nil
end
end
def peek_job(id)
@socket.write("peek #{id}\r\n")
Job.new(@jptr, *read_job('FOUND'))
end
def reserve()
@socket.write("reserve\r\n")
Job.new(@jptr, *read_job('RESERVED'))
end
def delete(id)
@socket.write("delete #{id}\r\n")
check_resp('DELETED')
:ok
end
def release(id, pri, delay)
@socket.write("release #{id} #{pri} #{delay}\r\n")
check_resp('RELEASED')
:ok
end
def bury(id, pri)
@socket.write("bury #{id} #{pri}\r\n")
check_resp('BURIED')
:ok
end
def use(tube)
@socket.write("use #{tube}\r\n")
check_resp('USING')[0]
end
def watch(tube)
@socket.write("watch #{tube}\r\n")
check_resp('WATCHING')[0]
end
def ignore(tube)
@socket.write("ignore #{tube}\r\n")
check_resp('WATCHING')[0]
end
def stats()
@socket.write("stats\r\n")
read_yaml('OK')
end
def job_stats(id)
@socket.write("stats-job #{id}\r\n")
read_yaml('OK')
end
def stats_tube(tube)
@socket.write("stats-tube #{tube}\r\n")
read_yaml('OK')
end
def list_tubes()
@socket.write("list-tubes\r\n")
read_yaml('OK')
end
def list_tube_used()
@socket.write("list-tube-used\r\n")
check_resp('USING')[0]
end
def list_tubes_watched()
@socket.write("list-tubes-watched\r\n")
read_yaml('OK')
end
private
def get_resp()
r = @socket.gets("\r\n")
raise EOFError if r == nil
r[0...-2]
end
def check_resp(*words)
r = get_resp()
rword, *vals = r.split(/\s+/)
if (words.size > 0) and !words.include?(rword)
raise UnexpectedResponse.new(r)
end
vals
end
def read_job(word)
# Give the user a chance to select on multiple fds.
Beanstalk.select.call([@socket]) if Beanstalk.select
id, bytes = check_resp(word).map{|s| s.to_i}
body = read_bytes(bytes)
raise 'bad trailer' if read_bytes(2) != "\r\n"
[id, body]
end
def read_yaml(word)
bytes_s, = check_resp(word)
yaml = read_bytes(bytes_s.to_i)
raise 'bad trailer' if read_bytes(2) != "\r\n"
YAML::load(yaml)
end
def read_bytes(n)
str = @socket.read(n)
raise EOFError, 'End of file reached' if str == nil
raise EOFError, 'End of file reached' if str.size < n
str
end
end
# Same interface as RawConnection.
# With this you can reserve more than one job at a time.
class Connection
attr_reader :addr
def initialize(addr, jptr=self)
@addr = addr
@misc = RawConnection.new(addr, jptr)
@free = Bag.new{RawConnection.new(addr, jptr)}
@used = {}
end
def reserve()
c = @free.take()
j = c.reserve()
@used[j.id] = c
j
ensure
@free.give(c) if c and not j
end
def delete(id)
@used[id].delete(id)
@free.give(@used.delete(id))
end
def release(id, pri, delay)
@used[id].release(id, pri, delay)
@free.give(@used.delete(id))
end
def bury(id, pri)
@used[id].bury(id, pri)
@free.give(@used.delete(id))
end
def method_missing(selector, *args, &block)
@misc.send(selector, *args, &block)
end
end
class CleanupWrapper
def initialize(addr, multi)
@conn = Connection.new(addr, self)
@multi = multi
end
def method_missing(selector, *args, &block)
begin
@conn.send(selector, *args, &block)
rescue EOFError, Errno::ECONNRESET, Errno::EPIPE, UnexpectedResponse => ex
@multi.remove(@conn)
raise ex
end
end
end
class Pool
def initialize(addrs)
@addrs = addrs
connect()
end
def connect()
@connections ||= {}
@addrs.each do |addr|
begin
if !@connections.include?(addr)
puts "connecting to beanstalk at #{addr}"
@connections[addr] = CleanupWrapper.new(addr, self)
end
rescue Exception => ex
puts "#{ex.class}: #{ex}"
#puts begin ex.fixed_backtrace rescue ex.backtrace end
end
end
@connections.size
end
def open_connections()
@connections.values()
end
def last_server
@last_conn.addr
end
def send_to_rand_conn(sel, *args)
wrap(pick_connection, sel, *args)
end
def send_to_all_conns(sel, *args)
make_hash(@connections.map{|a, c| [a, wrap(c, sel, *args)]})
end
def put(body, pri=65536, delay=0, ttr=120)
send_to_rand_conn(:put, body, pri, delay, ttr)
end
def yput(obj, pri=65536, delay=0, ttr=120)
send_to_rand_conn(:yput, obj, pri, delay, ttr)
end
def reserve()
send_to_rand_conn(:reserve)
end
def use(tube)
send_to_all_conns(:use, tube)
end
def watch(tube)
send_to_all_conns(:watch, tube)
end
def ignore(tube)
send_to_all_conns(:ignore, tube)
end
def raw_stats()
send_to_all_conns(:stats)
end
def stats()
sum_hashes(raw_stats.values)
end
def raw_stats_tube(tube)
send_to_all_conns(:stats_tube, tube)
end
def stats_tube(tube)
sum_hashes(raw_stats_tube(tube).values)
end
def list_tubes()
send_to_all_conns(:list_tubes)
end
def list_tube_used()
send_to_all_conns(:list_tube_used)
end
def list_tubes_watched()
send_to_all_conns(:list_tubes_watched)
end
def remove(conn)
@connections.delete(conn.addr)
end
def close
while @connections.size > 0
addr, conn = @connections.pop
conn.close
end
end
def peek()
open_connections.each do |c|
job = c.peek
return job if job
end
nil
end
private
def pick_connection()
open_connections[rand(open_connections.size)] or raise NotConnected
end
def wrap(conn, sel, *args)
(@last_conn = conn).send(sel, *args)
rescue DrainingError
# Don't reconnect -- we're not interested in this server
retry
rescue EOFError, Errno::ECONNRESET, Errno::EPIPE
connect()
retry
end
def make_hash(pairs)
Hash[*pairs.inject([]){|a,b|a+b}]
end
def sum_hashes(hs)
hs.inject({}){|a,b| a.merge(b) {|k,o,n| combine_stats(k, o, n)}}
end
DONT_ADD = Set['name', 'version', 'pid']
def combine_stats(k, a, b)
DONT_ADD.include?(k) ? Set[a] + Set[b] : a + b
end
end
end