Commit fd3fcf0b authored by Raymond Hettinger's avatar Raymond Hettinger

SF Patch #1455676: Simplify using Queues with daemon consumer threads

Adds join() and task_done() methods to track when all enqueued tasks have
been gotten and fully processed by daemon consumer threads.
parent 98bcb708
\section{\module{Queue} --- \section{\module{Queue} ---
A synchronized queue class} A synchronized queue class}
...@@ -94,3 +95,51 @@ immediately available, else raise the \exception{Empty} exception ...@@ -94,3 +95,51 @@ immediately available, else raise the \exception{Empty} exception
\begin{methoddesc}{get_nowait}{} \begin{methoddesc}{get_nowait}{}
Equivalent to \code{get(False)}. Equivalent to \code{get(False)}.
\end{methoddesc} \end{methoddesc}
Two methods are offered to support tracking whether enqueued tasks have
been fully processed by daemon consumer threads.
\begin{methoddesc}{task_done}{}
Indicate that a formerly enqueued task is complete. Used by queue consumer
threads. For each \method{get()} used to fetch a task, a subsequent call to
\method{task_done()} tells the queue that the processing on the task is complete.
If a \method{join()} is currently blocking, it will resume when all items
have been processed (meaning that a \method{task_done()} call was received
for every item that had been \method{put()} into the queue).
Raises a \exception{ValueError} if called more times than there were items
placed in the queue.
\versionadded{2.5}
\end{methoddesc}
\begin{methoddesc}{join}{}
Blocks until all items in the queue have been gotten and processed.
The count of unfinished tasks goes up whenever an item is added to the
queue. The count goes down whenever a consumer thread calls \method{task_done()}
to indicate that the item was retrieved and all work on it is complete.
When the count of unfinished tasks drops to zero, join() unblocks.
\versionadded{2.5}
\end{methoddesc}
Example of how to wait for enqueued tasks to be completed:
\begin{verbatim}
def worker():
while True:
item = q.get()
do_work(item)
q.task_done()
q = Queue()
for i in range(num_worker_threads):
t = Thread(target=worker)
t.setDaemon(True)
t.start()
for item in source():
q.put(item)
q.join() # block until all tasks are done
\end{verbatim}
...@@ -35,6 +35,50 @@ class Queue: ...@@ -35,6 +35,50 @@ class Queue:
# Notify not_full whenever an item is removed from the queue; # Notify not_full whenever an item is removed from the queue;
# a thread waiting to put is notified then. # a thread waiting to put is notified then.
self.not_full = threading.Condition(self.mutex) self.not_full = threading.Condition(self.mutex)
# Notify all_tasks_done whenever the number of unfinished tasks
# drops to zero; thread waiting to join() is notified to resume
self.all_tasks_done = threading.Condition(self.mutex)
self.unfinished_tasks = 0
def task_done(self):
"""Indicate that a formerly enqueued task is complete.
Used by Queue consumer threads. For each get() used to fetch a task,
a subsequent call to task_done() tells the queue that the processing
on the task is complete.
If a join() is currently blocking, it will resume when all items
have been processed (meaning that a task_done() call was received
for every item that had been put() into the queue).
Raises a ValueError if called more times than there were items
placed in the queue.
"""
self.all_tasks_done.acquire()
try:
self.unfinished_tasks = unfinished = self.unfinished_tasks - 1
if unfinished <= 0:
if unfinished < 0:
raise ValueError('task_done() called too many times')
self.all_tasks_done.notifyAll()
finally:
self.all_tasks_done.release()
def join(self):
"""Blocks until all items in the Queue have been gotten and processed.
The count of unfinished tasks goes up whenever an item is added to the
queue. The count goes down whenever a consumer thread calls task_done()
to indicate the item was retrieved and all work on it is complete.
When the count of unfinished tasks drops to zero, join() unblocks.
"""
self.all_tasks_done.acquire()
try:
while self.unfinished_tasks:
self.all_tasks_done.wait()
finally:
self.all_tasks_done.release()
def qsize(self): def qsize(self):
"""Return the approximate size of the queue (not reliable!).""" """Return the approximate size of the queue (not reliable!)."""
...@@ -86,6 +130,7 @@ class Queue: ...@@ -86,6 +130,7 @@ class Queue:
raise Full raise Full
self.not_full.wait(remaining) self.not_full.wait(remaining)
self._put(item) self._put(item)
self.unfinished_tasks += 1
self.not_empty.notify() self.not_empty.notify()
finally: finally:
self.not_full.release() self.not_full.release()
......
...@@ -221,7 +221,37 @@ def SimpleQueueTest(q): ...@@ -221,7 +221,37 @@ def SimpleQueueTest(q):
_doBlockingTest(q.get, (), q.put, ('empty',)) _doBlockingTest(q.get, (), q.put, ('empty',))
_doBlockingTest(q.get, (True, 10), q.put, ('empty',)) _doBlockingTest(q.get, (True, 10), q.put, ('empty',))
cum = 0
cumlock = threading.Lock()
def worker(q):
global cum
while True:
x = q.get()
cumlock.acquire()
try:
cum += x
finally:
cumlock.release()
q.task_done()
def QueueJoinTest(q):
global cum
cum = 0
for i in (0,1):
t = threading.Thread(target=worker, args=(q,))
t.setDaemon(True)
t.start()
for i in xrange(100):
q.put(i)
q.join()
verify(cum==sum(range(100)), "q.join() did not block until all tasks were done")
def test(): def test():
q = Queue.Queue()
QueueJoinTest(q)
QueueJoinTest(q)
q = Queue.Queue(QUEUE_SIZE) q = Queue.Queue(QUEUE_SIZE)
# Do it a couple of times on the same queue # Do it a couple of times on the same queue
SimpleQueueTest(q) SimpleQueueTest(q)
......
...@@ -483,6 +483,10 @@ Extension Modules ...@@ -483,6 +483,10 @@ Extension Modules
Library Library
------- -------
- Queue.Queue objects now support .task_done() and .join() methods
to make it easier to monitor when daemon threads have completed
processing all enqueued tasks. Patch #1455676.
- popen2.Popen objects now preserve the command in a .cmd attribute. - popen2.Popen objects now preserve the command in a .cmd attribute.
- Added the ctypes ffi package. - Added the ctypes ffi package.
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment