blob: 3280a2533d7dc2337c8b69a91c03500f95480edf [file] [log] [blame]
Benjamin Petersone711caf2008-06-11 16:44:04 +00001#
2# Module implementing queues
3#
4# multiprocessing/queues.py
5#
R. David Murray3fc969a2010-12-14 01:38:16 +00006# Copyright (c) 2006-2008, R Oudkerk
7# All rights reserved.
8#
9# Redistribution and use in source and binary forms, with or without
10# modification, are permitted provided that the following conditions
11# are met:
12#
13# 1. Redistributions of source code must retain the above copyright
14# notice, this list of conditions and the following disclaimer.
15# 2. Redistributions in binary form must reproduce the above copyright
16# notice, this list of conditions and the following disclaimer in the
17# documentation and/or other materials provided with the distribution.
18# 3. Neither the name of author nor the names of any contributors may be
19# used to endorse or promote products derived from this software
20# without specific prior written permission.
21#
22# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND
23# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
26# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32# SUCH DAMAGE.
Benjamin Petersone711caf2008-06-11 16:44:04 +000033#
34
Jesse Noller14f3ae22009-03-31 03:37:07 +000035__all__ = ['Queue', 'SimpleQueue', 'JoinableQueue']
Benjamin Petersone711caf2008-06-11 16:44:04 +000036
37import sys
38import os
39import threading
40import collections
41import time
42import atexit
43import weakref
44
45from queue import Empty, Full
46import _multiprocessing
47from multiprocessing import Pipe
48from multiprocessing.synchronize import Lock, BoundedSemaphore, Semaphore, Condition
49from multiprocessing.util import debug, info, Finalize, register_after_fork
50from multiprocessing.forking import assert_spawning
51
52#
53# Queue type using a pipe, buffer and thread
54#
55
56class Queue(object):
57
58 def __init__(self, maxsize=0):
59 if maxsize <= 0:
60 maxsize = _multiprocessing.SemLock.SEM_VALUE_MAX
61 self._maxsize = maxsize
62 self._reader, self._writer = Pipe(duplex=False)
63 self._rlock = Lock()
64 self._opid = os.getpid()
65 if sys.platform == 'win32':
66 self._wlock = None
67 else:
68 self._wlock = Lock()
69 self._sem = BoundedSemaphore(maxsize)
70
71 self._after_fork()
72
73 if sys.platform != 'win32':
74 register_after_fork(self, Queue._after_fork)
75
76 def __getstate__(self):
77 assert_spawning(self)
78 return (self._maxsize, self._reader, self._writer,
79 self._rlock, self._wlock, self._sem, self._opid)
80
81 def __setstate__(self, state):
82 (self._maxsize, self._reader, self._writer,
83 self._rlock, self._wlock, self._sem, self._opid) = state
84 self._after_fork()
85
86 def _after_fork(self):
87 debug('Queue._after_fork()')
88 self._notempty = threading.Condition(threading.Lock())
89 self._buffer = collections.deque()
90 self._thread = None
91 self._jointhread = None
92 self._joincancelled = False
93 self._closed = False
94 self._close = None
95 self._send = self._writer.send
96 self._recv = self._reader.recv
97 self._poll = self._reader.poll
98
99 def put(self, obj, block=True, timeout=None):
100 assert not self._closed
101 if not self._sem.acquire(block, timeout):
102 raise Full
103
104 self._notempty.acquire()
105 try:
106 if self._thread is None:
107 self._start_thread()
108 self._buffer.append(obj)
109 self._notempty.notify()
110 finally:
111 self._notempty.release()
112
113 def get(self, block=True, timeout=None):
114 if block and timeout is None:
115 self._rlock.acquire()
116 try:
117 res = self._recv()
118 self._sem.release()
119 return res
120 finally:
121 self._rlock.release()
122
123 else:
124 if block:
125 deadline = time.time() + timeout
126 if not self._rlock.acquire(block, timeout):
127 raise Empty
128 try:
129 if not self._poll(block and (deadline-time.time()) or 0.0):
130 raise Empty
131 res = self._recv()
132 self._sem.release()
133 return res
134 finally:
135 self._rlock.release()
136
137 def qsize(self):
Benjamin Peterson87c8d872009-06-11 22:54:11 +0000138 # Raises NotImplementedError on Mac OSX because of broken sem_getvalue()
Benjamin Petersone711caf2008-06-11 16:44:04 +0000139 return self._maxsize - self._sem._semlock._get_value()
140
141 def empty(self):
142 return not self._poll()
143
144 def full(self):
145 return self._sem._semlock._is_zero()
146
147 def get_nowait(self):
148 return self.get(False)
149
150 def put_nowait(self, obj):
151 return self.put(obj, False)
152
153 def close(self):
154 self._closed = True
155 self._reader.close()
156 if self._close:
157 self._close()
158
159 def join_thread(self):
160 debug('Queue.join_thread()')
161 assert self._closed
162 if self._jointhread:
163 self._jointhread()
164
165 def cancel_join_thread(self):
166 debug('Queue.cancel_join_thread()')
167 self._joincancelled = True
168 try:
169 self._jointhread.cancel()
170 except AttributeError:
171 pass
172
173 def _start_thread(self):
174 debug('Queue._start_thread()')
175
176 # Start thread which transfers data from buffer to pipe
177 self._buffer.clear()
178 self._thread = threading.Thread(
179 target=Queue._feed,
180 args=(self._buffer, self._notempty, self._send,
181 self._wlock, self._writer.close),
182 name='QueueFeederThread'
183 )
Benjamin Peterson72753702008-08-18 18:09:21 +0000184 self._thread.daemon = True
Benjamin Petersone711caf2008-06-11 16:44:04 +0000185
186 debug('doing self._thread.start()')
187 self._thread.start()
188 debug('... done self._thread.start()')
189
190 # On process exit we will wait for data to be flushed to pipe.
191 #
192 # However, if this process created the queue then all
193 # processes which use the queue will be descendants of this
194 # process. Therefore waiting for the queue to be flushed
195 # is pointless once all the child processes have been joined.
196 created_by_this_process = (self._opid == os.getpid())
197 if not self._joincancelled and not created_by_this_process:
198 self._jointhread = Finalize(
199 self._thread, Queue._finalize_join,
200 [weakref.ref(self._thread)],
201 exitpriority=-5
202 )
203
204 # Send sentinel to the thread queue object when garbage collected
205 self._close = Finalize(
206 self, Queue._finalize_close,
207 [self._buffer, self._notempty],
208 exitpriority=10
209 )
210
211 @staticmethod
212 def _finalize_join(twr):
213 debug('joining queue thread')
214 thread = twr()
215 if thread is not None:
216 thread.join()
217 debug('... queue thread joined')
218 else:
219 debug('... queue thread already dead')
220
221 @staticmethod
222 def _finalize_close(buffer, notempty):
223 debug('telling queue thread to quit')
224 notempty.acquire()
225 try:
226 buffer.append(_sentinel)
227 notempty.notify()
228 finally:
229 notempty.release()
230
231 @staticmethod
232 def _feed(buffer, notempty, send, writelock, close):
233 debug('starting thread to feed data to pipe')
234 from .util import is_exiting
235
236 nacquire = notempty.acquire
237 nrelease = notempty.release
238 nwait = notempty.wait
239 bpopleft = buffer.popleft
240 sentinel = _sentinel
241 if sys.platform != 'win32':
242 wacquire = writelock.acquire
243 wrelease = writelock.release
244 else:
245 wacquire = None
246
247 try:
248 while 1:
249 nacquire()
250 try:
251 if not buffer:
252 nwait()
253 finally:
254 nrelease()
255 try:
256 while 1:
257 obj = bpopleft()
258 if obj is sentinel:
259 debug('feeder thread got sentinel -- exiting')
260 close()
261 return
262
263 if wacquire is None:
264 send(obj)
265 else:
266 wacquire()
267 try:
268 send(obj)
269 finally:
270 wrelease()
271 except IndexError:
272 pass
273 except Exception as e:
274 # Since this runs in a daemon thread the resources it uses
275 # may be become unusable while the process is cleaning up.
276 # We ignore errors which happen after the process has
277 # started to cleanup.
278 try:
279 if is_exiting():
280 info('error in queue thread: %s', e)
281 else:
282 import traceback
283 traceback.print_exc()
284 except Exception:
285 pass
286
287_sentinel = object()
288
289#
290# A queue type which also supports join() and task_done() methods
291#
292# Note that if you do not call task_done() for each finished task then
293# eventually the counter's semaphore may overflow causing Bad Things
294# to happen.
295#
296
297class JoinableQueue(Queue):
298
299 def __init__(self, maxsize=0):
300 Queue.__init__(self, maxsize)
301 self._unfinished_tasks = Semaphore(0)
302 self._cond = Condition()
303
304 def __getstate__(self):
305 return Queue.__getstate__(self) + (self._cond, self._unfinished_tasks)
306
307 def __setstate__(self, state):
308 Queue.__setstate__(self, state[:-2])
309 self._cond, self._unfinished_tasks = state[-2:]
310
Benjamin Peterson8719ad52009-09-11 22:24:02 +0000311 def put(self, obj, block=True, timeout=None):
312 assert not self._closed
313 if not self._sem.acquire(block, timeout):
314 raise Full
315
316 self._notempty.acquire()
317 self._cond.acquire()
318 try:
319 if self._thread is None:
320 self._start_thread()
321 self._buffer.append(obj)
322 self._unfinished_tasks.release()
323 self._notempty.notify()
324 finally:
325 self._cond.release()
326 self._notempty.release()
Benjamin Petersone711caf2008-06-11 16:44:04 +0000327
328 def task_done(self):
329 self._cond.acquire()
330 try:
331 if not self._unfinished_tasks.acquire(False):
332 raise ValueError('task_done() called too many times')
333 if self._unfinished_tasks._semlock._is_zero():
334 self._cond.notify_all()
335 finally:
336 self._cond.release()
337
338 def join(self):
339 self._cond.acquire()
340 try:
341 if not self._unfinished_tasks._semlock._is_zero():
342 self._cond.wait()
343 finally:
344 self._cond.release()
345
346#
347# Simplified Queue type -- really just a locked pipe
348#
349
350class SimpleQueue(object):
351
352 def __init__(self):
353 self._reader, self._writer = Pipe(duplex=False)
354 self._rlock = Lock()
355 if sys.platform == 'win32':
356 self._wlock = None
357 else:
358 self._wlock = Lock()
359 self._make_methods()
360
361 def empty(self):
362 return not self._reader.poll()
363
364 def __getstate__(self):
365 assert_spawning(self)
366 return (self._reader, self._writer, self._rlock, self._wlock)
367
368 def __setstate__(self, state):
369 (self._reader, self._writer, self._rlock, self._wlock) = state
370 self._make_methods()
371
372 def _make_methods(self):
373 recv = self._reader.recv
374 racquire, rrelease = self._rlock.acquire, self._rlock.release
375 def get():
376 racquire()
377 try:
378 return recv()
379 finally:
380 rrelease()
381 self.get = get
382
383 if self._wlock is None:
384 # writes to a message oriented win32 pipe are atomic
385 self.put = self._writer.send
386 else:
387 send = self._writer.send
388 wacquire, wrelease = self._wlock.acquire, self._wlock.release
389 def put(obj):
390 wacquire()
391 try:
392 return send(obj)
393 finally:
394 wrelease()
395 self.put = put