blob: 106ccd72bd1a4dd0ac58374445029212fd941d3e [file] [log] [blame]
Antoine Pitrou64a467d2010-12-12 20:34:49 +00001:mod:`multiprocessing` --- Process-based parallelism
2====================================================
Benjamin Petersone711caf2008-06-11 16:44:04 +00003
4.. module:: multiprocessing
Antoine Pitrou64a467d2010-12-12 20:34:49 +00005 :synopsis: Process-based parallelism.
Benjamin Petersone711caf2008-06-11 16:44:04 +00006
Benjamin Petersone711caf2008-06-11 16:44:04 +00007
8Introduction
Georg Brandl49702152008-09-29 06:43:45 +00009------------
Benjamin Petersone711caf2008-06-11 16:44:04 +000010
Benjamin Peterson5289b2b2008-06-28 00:40:54 +000011:mod:`multiprocessing` is a package that supports spawning processes using an
12API similar to the :mod:`threading` module. The :mod:`multiprocessing` package
13offers both local and remote concurrency, effectively side-stepping the
14:term:`Global Interpreter Lock` by using subprocesses instead of threads. Due
15to this, the :mod:`multiprocessing` module allows the programmer to fully
16leverage multiple processors on a given machine. It runs on both Unix and
17Windows.
Benjamin Petersone711caf2008-06-11 16:44:04 +000018
Raymond Hettingerfd151912010-11-04 03:02:56 +000019.. note::
Benjamin Petersone5384b02008-10-04 22:00:42 +000020
21 Some of this package's functionality requires a functioning shared semaphore
Georg Brandl48310cd2009-01-03 21:18:54 +000022 implementation on the host operating system. Without one, the
23 :mod:`multiprocessing.synchronize` module will be disabled, and attempts to
24 import it will result in an :exc:`ImportError`. See
Benjamin Petersone5384b02008-10-04 22:00:42 +000025 :issue:`3770` for additional information.
Benjamin Petersone711caf2008-06-11 16:44:04 +000026
Jesse Noller45239682008-11-28 18:46:19 +000027.. note::
28
Ezio Melotti2ee88352011-04-29 07:10:24 +030029 Functionality within this package requires that the ``__main__`` module be
Jesse Noller45239682008-11-28 18:46:19 +000030 importable by the children. This is covered in :ref:`multiprocessing-programming`
31 however it is worth pointing out here. This means that some examples, such
32 as the :class:`multiprocessing.Pool` examples will not work in the
33 interactive interpreter. For example::
34
35 >>> from multiprocessing import Pool
36 >>> p = Pool(5)
37 >>> def f(x):
Georg Brandla1c6a1c2009-01-03 21:26:05 +000038 ... return x*x
Georg Brandl48310cd2009-01-03 21:18:54 +000039 ...
Jesse Noller45239682008-11-28 18:46:19 +000040 >>> p.map(f, [1,2,3])
41 Process PoolWorker-1:
42 Process PoolWorker-2:
R. David Murray8e8099c2009-04-28 18:02:00 +000043 Process PoolWorker-3:
44 Traceback (most recent call last):
Jesse Noller45239682008-11-28 18:46:19 +000045 Traceback (most recent call last):
46 Traceback (most recent call last):
47 AttributeError: 'module' object has no attribute 'f'
48 AttributeError: 'module' object has no attribute 'f'
49 AttributeError: 'module' object has no attribute 'f'
50
R. David Murray8e8099c2009-04-28 18:02:00 +000051 (If you try this it will actually output three full tracebacks
52 interleaved in a semi-random fashion, and then you may have to
53 stop the master process somehow.)
54
Jesse Noller45239682008-11-28 18:46:19 +000055
Benjamin Petersone711caf2008-06-11 16:44:04 +000056The :class:`Process` class
57~~~~~~~~~~~~~~~~~~~~~~~~~~
58
59In :mod:`multiprocessing`, processes are spawned by creating a :class:`Process`
Benjamin Peterson5289b2b2008-06-28 00:40:54 +000060object and then calling its :meth:`~Process.start` method. :class:`Process`
Benjamin Petersone711caf2008-06-11 16:44:04 +000061follows the API of :class:`threading.Thread`. A trivial example of a
62multiprocess program is ::
63
Georg Brandlb3959bd2010-04-08 06:33:16 +000064 from multiprocessing import Process
Benjamin Petersone711caf2008-06-11 16:44:04 +000065
66 def f(name):
Georg Brandl49702152008-09-29 06:43:45 +000067 print('hello', name)
Benjamin Petersone711caf2008-06-11 16:44:04 +000068
Georg Brandlb3959bd2010-04-08 06:33:16 +000069 if __name__ == '__main__':
70 p = Process(target=f, args=('bob',))
71 p.start()
72 p.join()
Benjamin Petersone711caf2008-06-11 16:44:04 +000073
Jesse Noller45239682008-11-28 18:46:19 +000074To show the individual process IDs involved, here is an expanded example::
75
76 from multiprocessing import Process
77 import os
78
79 def info(title):
Ezio Melotti985e24d2009-09-13 07:54:02 +000080 print(title)
81 print('module name:', __name__)
82 print('parent process:', os.getppid())
83 print('process id:', os.getpid())
Georg Brandl48310cd2009-01-03 21:18:54 +000084
Jesse Noller45239682008-11-28 18:46:19 +000085 def f(name):
86 info('function f')
Ezio Melotti985e24d2009-09-13 07:54:02 +000087 print('hello', name)
Georg Brandl48310cd2009-01-03 21:18:54 +000088
Jesse Noller45239682008-11-28 18:46:19 +000089 if __name__ == '__main__':
90 info('main line')
91 p = Process(target=f, args=('bob',))
92 p.start()
93 p.join()
Benjamin Petersone711caf2008-06-11 16:44:04 +000094
95For an explanation of why (on Windows) the ``if __name__ == '__main__'`` part is
96necessary, see :ref:`multiprocessing-programming`.
97
98
99
100Exchanging objects between processes
101~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102
103:mod:`multiprocessing` supports two types of communication channel between
104processes:
105
106**Queues**
107
Benjamin Peterson257060a2008-06-28 01:42:41 +0000108 The :class:`Queue` class is a near clone of :class:`queue.Queue`. For
Benjamin Petersone711caf2008-06-11 16:44:04 +0000109 example::
110
111 from multiprocessing import Process, Queue
112
113 def f(q):
114 q.put([42, None, 'hello'])
115
Georg Brandl1f01deb2009-01-03 22:47:39 +0000116 if __name__ == '__main__':
117 q = Queue()
118 p = Process(target=f, args=(q,))
119 p.start()
120 print(q.get()) # prints "[42, None, 'hello']"
121 p.join()
Benjamin Petersone711caf2008-06-11 16:44:04 +0000122
Ask Solem518eaa82010-11-09 21:46:03 +0000123 Queues are thread and process safe, but note that they must never
124 be instantiated as a side effect of importing a module: this can lead
125 to a deadlock! (see :ref:`threaded-imports`)
Benjamin Petersone711caf2008-06-11 16:44:04 +0000126
127**Pipes**
128
129 The :func:`Pipe` function returns a pair of connection objects connected by a
130 pipe which by default is duplex (two-way). For example::
131
132 from multiprocessing import Process, Pipe
133
134 def f(conn):
135 conn.send([42, None, 'hello'])
136 conn.close()
137
138 if __name__ == '__main__':
139 parent_conn, child_conn = Pipe()
140 p = Process(target=f, args=(child_conn,))
141 p.start()
Georg Brandl49702152008-09-29 06:43:45 +0000142 print(parent_conn.recv()) # prints "[42, None, 'hello']"
Benjamin Petersone711caf2008-06-11 16:44:04 +0000143 p.join()
144
145 The two connection objects returned by :func:`Pipe` represent the two ends of
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000146 the pipe. Each connection object has :meth:`~Connection.send` and
147 :meth:`~Connection.recv` methods (among others). Note that data in a pipe
148 may become corrupted if two processes (or threads) try to read from or write
149 to the *same* end of the pipe at the same time. Of course there is no risk
150 of corruption from processes using different ends of the pipe at the same
151 time.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000152
153
154Synchronization between processes
155~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
156
157:mod:`multiprocessing` contains equivalents of all the synchronization
158primitives from :mod:`threading`. For instance one can use a lock to ensure
159that only one process prints to standard output at a time::
160
161 from multiprocessing import Process, Lock
162
163 def f(l, i):
164 l.acquire()
Georg Brandl49702152008-09-29 06:43:45 +0000165 print('hello world', i)
Benjamin Petersone711caf2008-06-11 16:44:04 +0000166 l.release()
167
168 if __name__ == '__main__':
169 lock = Lock()
170
171 for num in range(10):
172 Process(target=f, args=(lock, num)).start()
173
174Without using the lock output from the different processes is liable to get all
175mixed up.
176
177
178Sharing state between processes
179~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
180
181As mentioned above, when doing concurrent programming it is usually best to
182avoid using shared state as far as possible. This is particularly true when
183using multiple processes.
184
185However, if you really do need to use some shared data then
186:mod:`multiprocessing` provides a couple of ways of doing so.
187
188**Shared memory**
189
190 Data can be stored in a shared memory map using :class:`Value` or
191 :class:`Array`. For example, the following code ::
192
193 from multiprocessing import Process, Value, Array
194
195 def f(n, a):
196 n.value = 3.1415927
197 for i in range(len(a)):
198 a[i] = -a[i]
199
200 if __name__ == '__main__':
201 num = Value('d', 0.0)
202 arr = Array('i', range(10))
203
204 p = Process(target=f, args=(num, arr))
205 p.start()
206 p.join()
207
Georg Brandl49702152008-09-29 06:43:45 +0000208 print(num.value)
209 print(arr[:])
Benjamin Petersone711caf2008-06-11 16:44:04 +0000210
211 will print ::
212
213 3.1415927
214 [0, -1, -2, -3, -4, -5, -6, -7, -8, -9]
215
216 The ``'d'`` and ``'i'`` arguments used when creating ``num`` and ``arr`` are
217 typecodes of the kind used by the :mod:`array` module: ``'d'`` indicates a
Georg Brandl2ee470f2008-07-16 12:55:28 +0000218 double precision float and ``'i'`` indicates a signed integer. These shared
Georg Brandlf285bcc2010-10-19 21:07:16 +0000219 objects will be process and thread-safe.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000220
221 For more flexibility in using shared memory one can use the
222 :mod:`multiprocessing.sharedctypes` module which supports the creation of
223 arbitrary ctypes objects allocated from shared memory.
224
225**Server process**
226
227 A manager object returned by :func:`Manager` controls a server process which
Georg Brandl2ee470f2008-07-16 12:55:28 +0000228 holds Python objects and allows other processes to manipulate them using
Benjamin Petersone711caf2008-06-11 16:44:04 +0000229 proxies.
230
231 A manager returned by :func:`Manager` will support types :class:`list`,
232 :class:`dict`, :class:`Namespace`, :class:`Lock`, :class:`RLock`,
233 :class:`Semaphore`, :class:`BoundedSemaphore`, :class:`Condition`,
234 :class:`Event`, :class:`Queue`, :class:`Value` and :class:`Array`. For
235 example, ::
236
237 from multiprocessing import Process, Manager
238
239 def f(d, l):
240 d[1] = '1'
241 d['2'] = 2
242 d[0.25] = None
243 l.reverse()
244
245 if __name__ == '__main__':
246 manager = Manager()
247
248 d = manager.dict()
249 l = manager.list(range(10))
250
251 p = Process(target=f, args=(d, l))
252 p.start()
253 p.join()
254
Georg Brandl49702152008-09-29 06:43:45 +0000255 print(d)
256 print(l)
Benjamin Petersone711caf2008-06-11 16:44:04 +0000257
258 will print ::
259
260 {0.25: None, 1: '1', '2': 2}
261 [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
262
263 Server process managers are more flexible than using shared memory objects
264 because they can be made to support arbitrary object types. Also, a single
265 manager can be shared by processes on different computers over a network.
266 They are, however, slower than using shared memory.
267
268
269Using a pool of workers
270~~~~~~~~~~~~~~~~~~~~~~~
271
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000272The :class:`~multiprocessing.pool.Pool` class represents a pool of worker
Benjamin Petersone711caf2008-06-11 16:44:04 +0000273processes. It has methods which allows tasks to be offloaded to the worker
274processes in a few different ways.
275
276For example::
277
278 from multiprocessing import Pool
279
280 def f(x):
281 return x*x
282
283 if __name__ == '__main__':
Ezio Melotti985e24d2009-09-13 07:54:02 +0000284 pool = Pool(processes=4) # start 4 worker processes
Jesse Noller45239682008-11-28 18:46:19 +0000285 result = pool.apply_async(f, [10]) # evaluate "f(10)" asynchronously
Ezio Melotti985e24d2009-09-13 07:54:02 +0000286 print(result.get(timeout=1)) # prints "100" unless your computer is *very* slow
287 print(pool.map(f, range(10))) # prints "[0, 1, 4,..., 81]"
Benjamin Petersone711caf2008-06-11 16:44:04 +0000288
289
290Reference
291---------
292
293The :mod:`multiprocessing` package mostly replicates the API of the
294:mod:`threading` module.
295
296
297:class:`Process` and exceptions
298~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
299
Antoine Pitrou0bd4deb2011-02-25 22:07:43 +0000300.. class:: Process([group[, target[, name[, args[, kwargs]]]]], *, daemon=None)
Benjamin Petersone711caf2008-06-11 16:44:04 +0000301
302 Process objects represent activity that is run in a separate process. The
303 :class:`Process` class has equivalents of all the methods of
304 :class:`threading.Thread`.
305
306 The constructor should always be called with keyword arguments. *group*
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000307 should always be ``None``; it exists solely for compatibility with
Benjamin Petersona786b022008-08-25 21:05:21 +0000308 :class:`threading.Thread`. *target* is the callable object to be invoked by
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000309 the :meth:`run()` method. It defaults to ``None``, meaning nothing is
Benjamin Petersone711caf2008-06-11 16:44:04 +0000310 called. *name* is the process name. By default, a unique name is constructed
311 of the form 'Process-N\ :sub:`1`:N\ :sub:`2`:...:N\ :sub:`k`' where N\
312 :sub:`1`,N\ :sub:`2`,...,N\ :sub:`k` is a sequence of integers whose length
313 is determined by the *generation* of the process. *args* is the argument
314 tuple for the target invocation. *kwargs* is a dictionary of keyword
Antoine Pitrou0bd4deb2011-02-25 22:07:43 +0000315 arguments for the target invocation. If provided, the keyword-only *daemon* argument
316 sets the process :attr:`daemon` flag to ``True`` or ``False``. If ``None``
317 (the default), this flag will be inherited from the creating process.
318
319 By default, no arguments are passed to *target*.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000320
321 If a subclass overrides the constructor, it must make sure it invokes the
322 base class constructor (:meth:`Process.__init__`) before doing anything else
323 to the process.
324
Antoine Pitrou0bd4deb2011-02-25 22:07:43 +0000325 .. versionchanged:: 3.3
326 Added the *daemon* argument.
327
Benjamin Petersone711caf2008-06-11 16:44:04 +0000328 .. method:: run()
329
330 Method representing the process's activity.
331
332 You may override this method in a subclass. The standard :meth:`run`
333 method invokes the callable object passed to the object's constructor as
334 the target argument, if any, with sequential and keyword arguments taken
335 from the *args* and *kwargs* arguments, respectively.
336
337 .. method:: start()
338
339 Start the process's activity.
340
341 This must be called at most once per process object. It arranges for the
342 object's :meth:`run` method to be invoked in a separate process.
343
344 .. method:: join([timeout])
345
Charles-François Nataliacd9f7c2011-07-25 18:35:49 +0200346 If the optional argument *timeout* is ``None`` (the default), the method
347 blocks until the process whose :meth:`join` method is called terminates.
348 If *timeout* is a positive number, it blocks at most *timeout* seconds.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000349
350 A process can be joined many times.
351
352 A process cannot join itself because this would cause a deadlock. It is
353 an error to attempt to join a process before it has been started.
354
Benjamin Petersona786b022008-08-25 21:05:21 +0000355 .. attribute:: name
Benjamin Petersone711caf2008-06-11 16:44:04 +0000356
Benjamin Petersona786b022008-08-25 21:05:21 +0000357 The process's name.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000358
359 The name is a string used for identification purposes only. It has no
360 semantics. Multiple processes may be given the same name. The initial
361 name is set by the constructor.
362
Jesse Noller45239682008-11-28 18:46:19 +0000363 .. method:: is_alive
Benjamin Petersone711caf2008-06-11 16:44:04 +0000364
365 Return whether the process is alive.
366
367 Roughly, a process object is alive from the moment the :meth:`start`
368 method returns until the child process terminates.
369
Benjamin Petersona786b022008-08-25 21:05:21 +0000370 .. attribute:: daemon
Benjamin Petersone711caf2008-06-11 16:44:04 +0000371
Benjamin Petersonda10d3b2009-01-01 00:23:30 +0000372 The process's daemon flag, a Boolean value. This must be set before
Benjamin Petersona786b022008-08-25 21:05:21 +0000373 :meth:`start` is called.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000374
375 The initial value is inherited from the creating process.
376
377 When a process exits, it attempts to terminate all of its daemonic child
378 processes.
379
380 Note that a daemonic process is not allowed to create child processes.
381 Otherwise a daemonic process would leave its children orphaned if it gets
Alexandre Vassalotti260484d2009-07-17 11:43:26 +0000382 terminated when its parent process exits. Additionally, these are **not**
383 Unix daemons or services, they are normal processes that will be
Georg Brandl6faee4e2010-09-21 14:48:28 +0000384 terminated (and not joined) if non-daemonic processes have exited.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000385
Benjamin Petersona786b022008-08-25 21:05:21 +0000386 In addition to the :class:`Threading.Thread` API, :class:`Process` objects
387 also support the following attributes and methods:
Benjamin Petersone711caf2008-06-11 16:44:04 +0000388
Benjamin Petersona786b022008-08-25 21:05:21 +0000389 .. attribute:: pid
Benjamin Petersone711caf2008-06-11 16:44:04 +0000390
391 Return the process ID. Before the process is spawned, this will be
392 ``None``.
393
Benjamin Petersona786b022008-08-25 21:05:21 +0000394 .. attribute:: exitcode
Benjamin Petersone711caf2008-06-11 16:44:04 +0000395
Benjamin Petersona786b022008-08-25 21:05:21 +0000396 The child's exit code. This will be ``None`` if the process has not yet
397 terminated. A negative value *-N* indicates that the child was terminated
398 by signal *N*.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000399
Benjamin Petersona786b022008-08-25 21:05:21 +0000400 .. attribute:: authkey
Benjamin Petersone711caf2008-06-11 16:44:04 +0000401
Benjamin Petersona786b022008-08-25 21:05:21 +0000402 The process's authentication key (a byte string).
Benjamin Petersone711caf2008-06-11 16:44:04 +0000403
404 When :mod:`multiprocessing` is initialized the main process is assigned a
405 random string using :func:`os.random`.
406
407 When a :class:`Process` object is created, it will inherit the
Benjamin Petersona786b022008-08-25 21:05:21 +0000408 authentication key of its parent process, although this may be changed by
409 setting :attr:`authkey` to another byte string.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000410
411 See :ref:`multiprocessing-auth-keys`.
412
Antoine Pitrou176f07d2011-06-06 19:35:31 +0200413 .. attribute:: sentinel
414
415 A numeric handle of a system object which will become "ready" when
416 the process ends.
417
418 On Windows, this is an OS handle usable with the ``WaitForSingleObject``
419 and ``WaitForMultipleObjects`` family of API calls. On Unix, this is
420 a file descriptor usable with primitives from the :mod:`select` module.
421
422 You can use this value if you want to wait on several events at once.
423 Otherwise calling :meth:`join()` is simpler.
424
425 .. versionadded:: 3.3
426
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000427 .. method:: terminate()
Benjamin Petersone711caf2008-06-11 16:44:04 +0000428
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000429 Terminate the process. On Unix this is done using the ``SIGTERM`` signal;
Georg Brandl60203b42010-10-06 10:11:56 +0000430 on Windows :c:func:`TerminateProcess` is used. Note that exit handlers and
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000431 finally clauses, etc., will not be executed.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000432
433 Note that descendant processes of the process will *not* be terminated --
434 they will simply become orphaned.
435
436 .. warning::
437
438 If this method is used when the associated process is using a pipe or
439 queue then the pipe or queue is liable to become corrupted and may
440 become unusable by other process. Similarly, if the process has
441 acquired a lock or semaphore etc. then terminating it is liable to
442 cause other processes to deadlock.
443
Ask Solemff7ffdd2010-11-09 21:52:33 +0000444 Note that the :meth:`start`, :meth:`join`, :meth:`is_alive`,
445 :meth:`terminate` and :attr:`exit_code` methods should only be called by
446 the process that created the process object.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000447
R. David Murray8e8099c2009-04-28 18:02:00 +0000448 Example usage of some of the methods of :class:`Process`:
449
450 .. doctest::
Benjamin Petersone711caf2008-06-11 16:44:04 +0000451
Benjamin Peterson206e3072008-10-19 14:07:49 +0000452 >>> import multiprocessing, time, signal
453 >>> p = multiprocessing.Process(target=time.sleep, args=(1000,))
Georg Brandl49702152008-09-29 06:43:45 +0000454 >>> print(p, p.is_alive())
Benjamin Petersone711caf2008-06-11 16:44:04 +0000455 <Process(Process-1, initial)> False
456 >>> p.start()
Georg Brandl49702152008-09-29 06:43:45 +0000457 >>> print(p, p.is_alive())
Benjamin Petersone711caf2008-06-11 16:44:04 +0000458 <Process(Process-1, started)> True
459 >>> p.terminate()
R. David Murray8e8099c2009-04-28 18:02:00 +0000460 >>> time.sleep(0.1)
Georg Brandl49702152008-09-29 06:43:45 +0000461 >>> print(p, p.is_alive())
Benjamin Petersone711caf2008-06-11 16:44:04 +0000462 <Process(Process-1, stopped[SIGTERM])> False
Benjamin Petersona786b022008-08-25 21:05:21 +0000463 >>> p.exitcode == -signal.SIGTERM
Benjamin Petersone711caf2008-06-11 16:44:04 +0000464 True
465
466
467.. exception:: BufferTooShort
468
469 Exception raised by :meth:`Connection.recv_bytes_into()` when the supplied
470 buffer object is too small for the message read.
471
472 If ``e`` is an instance of :exc:`BufferTooShort` then ``e.args[0]`` will give
473 the message as a byte string.
474
475
476Pipes and Queues
477~~~~~~~~~~~~~~~~
478
479When using multiple processes, one generally uses message passing for
480communication between processes and avoids having to use any synchronization
481primitives like locks.
482
483For passing messages one can use :func:`Pipe` (for a connection between two
484processes) or a queue (which allows multiple producers and consumers).
485
486The :class:`Queue` and :class:`JoinableQueue` types are multi-producer,
Benjamin Peterson257060a2008-06-28 01:42:41 +0000487multi-consumer FIFO queues modelled on the :class:`queue.Queue` class in the
Benjamin Petersone711caf2008-06-11 16:44:04 +0000488standard library. They differ in that :class:`Queue` lacks the
Benjamin Peterson257060a2008-06-28 01:42:41 +0000489:meth:`~queue.Queue.task_done` and :meth:`~queue.Queue.join` methods introduced
490into Python 2.5's :class:`queue.Queue` class.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000491
492If you use :class:`JoinableQueue` then you **must** call
493:meth:`JoinableQueue.task_done` for each task removed from the queue or else the
Eli Benderskyd08effe2011-12-31 07:20:26 +0200494semaphore used to count the number of unfinished tasks may eventually overflow,
Benjamin Petersone711caf2008-06-11 16:44:04 +0000495raising an exception.
496
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000497Note that one can also create a shared queue by using a manager object -- see
498:ref:`multiprocessing-managers`.
499
Benjamin Petersone711caf2008-06-11 16:44:04 +0000500.. note::
501
Benjamin Peterson257060a2008-06-28 01:42:41 +0000502 :mod:`multiprocessing` uses the usual :exc:`queue.Empty` and
503 :exc:`queue.Full` exceptions to signal a timeout. They are not available in
Benjamin Petersone711caf2008-06-11 16:44:04 +0000504 the :mod:`multiprocessing` namespace so you need to import them from
Benjamin Peterson257060a2008-06-28 01:42:41 +0000505 :mod:`queue`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000506
507
508.. warning::
509
510 If a process is killed using :meth:`Process.terminate` or :func:`os.kill`
511 while it is trying to use a :class:`Queue`, then the data in the queue is
Eli Benderskyd08effe2011-12-31 07:20:26 +0200512 likely to become corrupted. This may cause any other process to get an
Benjamin Petersone711caf2008-06-11 16:44:04 +0000513 exception when it tries to use the queue later on.
514
515.. warning::
516
517 As mentioned above, if a child process has put items on a queue (and it has
518 not used :meth:`JoinableQueue.cancel_join_thread`), then that process will
519 not terminate until all buffered items have been flushed to the pipe.
520
521 This means that if you try joining that process you may get a deadlock unless
522 you are sure that all items which have been put on the queue have been
523 consumed. Similarly, if the child process is non-daemonic then the parent
Georg Brandl2ee470f2008-07-16 12:55:28 +0000524 process may hang on exit when it tries to join all its non-daemonic children.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000525
526 Note that a queue created using a manager does not have this issue. See
527 :ref:`multiprocessing-programming`.
528
Benjamin Petersone711caf2008-06-11 16:44:04 +0000529For an example of the usage of queues for interprocess communication see
530:ref:`multiprocessing-examples`.
531
532
533.. function:: Pipe([duplex])
534
535 Returns a pair ``(conn1, conn2)`` of :class:`Connection` objects representing
536 the ends of a pipe.
537
538 If *duplex* is ``True`` (the default) then the pipe is bidirectional. If
539 *duplex* is ``False`` then the pipe is unidirectional: ``conn1`` can only be
540 used for receiving messages and ``conn2`` can only be used for sending
541 messages.
542
543
544.. class:: Queue([maxsize])
545
546 Returns a process shared queue implemented using a pipe and a few
547 locks/semaphores. When a process first puts an item on the queue a feeder
548 thread is started which transfers objects from a buffer into the pipe.
549
Benjamin Peterson257060a2008-06-28 01:42:41 +0000550 The usual :exc:`queue.Empty` and :exc:`queue.Full` exceptions from the
Benjamin Petersone711caf2008-06-11 16:44:04 +0000551 standard library's :mod:`Queue` module are raised to signal timeouts.
552
Benjamin Peterson257060a2008-06-28 01:42:41 +0000553 :class:`Queue` implements all the methods of :class:`queue.Queue` except for
554 :meth:`~queue.Queue.task_done` and :meth:`~queue.Queue.join`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000555
556 .. method:: qsize()
557
558 Return the approximate size of the queue. Because of
559 multithreading/multiprocessing semantics, this number is not reliable.
560
561 Note that this may raise :exc:`NotImplementedError` on Unix platforms like
Georg Brandlc575c902008-09-13 17:46:05 +0000562 Mac OS X where ``sem_getvalue()`` is not implemented.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000563
564 .. method:: empty()
565
566 Return ``True`` if the queue is empty, ``False`` otherwise. Because of
567 multithreading/multiprocessing semantics, this is not reliable.
568
569 .. method:: full()
570
571 Return ``True`` if the queue is full, ``False`` otherwise. Because of
572 multithreading/multiprocessing semantics, this is not reliable.
573
Senthil Kumarane969a212011-09-06 00:21:30 +0800574 .. method:: put(obj[, block[, timeout]])
Benjamin Petersone711caf2008-06-11 16:44:04 +0000575
Senthil Kumarane969a212011-09-06 00:21:30 +0800576 Put obj into the queue. If the optional argument *block* is ``True``
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000577 (the default) and *timeout* is ``None`` (the default), block if necessary until
Benjamin Petersone711caf2008-06-11 16:44:04 +0000578 a free slot is available. If *timeout* is a positive number, it blocks at
Benjamin Peterson257060a2008-06-28 01:42:41 +0000579 most *timeout* seconds and raises the :exc:`queue.Full` exception if no
Benjamin Petersone711caf2008-06-11 16:44:04 +0000580 free slot was available within that time. Otherwise (*block* is
581 ``False``), put an item on the queue if a free slot is immediately
Benjamin Peterson257060a2008-06-28 01:42:41 +0000582 available, else raise the :exc:`queue.Full` exception (*timeout* is
Benjamin Petersone711caf2008-06-11 16:44:04 +0000583 ignored in that case).
584
Senthil Kumarane969a212011-09-06 00:21:30 +0800585 .. method:: put_nowait(obj)
Benjamin Petersone711caf2008-06-11 16:44:04 +0000586
Senthil Kumarane969a212011-09-06 00:21:30 +0800587 Equivalent to ``put(obj, False)``.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000588
589 .. method:: get([block[, timeout]])
590
591 Remove and return an item from the queue. If optional args *block* is
592 ``True`` (the default) and *timeout* is ``None`` (the default), block if
593 necessary until an item is available. If *timeout* is a positive number,
Benjamin Peterson257060a2008-06-28 01:42:41 +0000594 it blocks at most *timeout* seconds and raises the :exc:`queue.Empty`
Benjamin Petersone711caf2008-06-11 16:44:04 +0000595 exception if no item was available within that time. Otherwise (block is
596 ``False``), return an item if one is immediately available, else raise the
Benjamin Peterson257060a2008-06-28 01:42:41 +0000597 :exc:`queue.Empty` exception (*timeout* is ignored in that case).
Benjamin Petersone711caf2008-06-11 16:44:04 +0000598
599 .. method:: get_nowait()
600 get_no_wait()
601
602 Equivalent to ``get(False)``.
603
604 :class:`multiprocessing.Queue` has a few additional methods not found in
Georg Brandl2ee470f2008-07-16 12:55:28 +0000605 :class:`queue.Queue`. These methods are usually unnecessary for most
606 code:
Benjamin Petersone711caf2008-06-11 16:44:04 +0000607
608 .. method:: close()
609
610 Indicate that no more data will be put on this queue by the current
611 process. The background thread will quit once it has flushed all buffered
612 data to the pipe. This is called automatically when the queue is garbage
613 collected.
614
615 .. method:: join_thread()
616
617 Join the background thread. This can only be used after :meth:`close` has
618 been called. It blocks until the background thread exits, ensuring that
619 all data in the buffer has been flushed to the pipe.
620
621 By default if a process is not the creator of the queue then on exit it
622 will attempt to join the queue's background thread. The process can call
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000623 :meth:`cancel_join_thread` to make :meth:`join_thread` do nothing.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000624
625 .. method:: cancel_join_thread()
626
627 Prevent :meth:`join_thread` from blocking. In particular, this prevents
628 the background thread from being joined automatically when the process
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000629 exits -- see :meth:`join_thread`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000630
631
632.. class:: JoinableQueue([maxsize])
633
634 :class:`JoinableQueue`, a :class:`Queue` subclass, is a queue which
635 additionally has :meth:`task_done` and :meth:`join` methods.
636
637 .. method:: task_done()
638
639 Indicate that a formerly enqueued task is complete. Used by queue consumer
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000640 threads. For each :meth:`~Queue.get` used to fetch a task, a subsequent
641 call to :meth:`task_done` tells the queue that the processing on the task
642 is complete.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000643
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000644 If a :meth:`~Queue.join` is currently blocking, it will resume when all
645 items have been processed (meaning that a :meth:`task_done` call was
646 received for every item that had been :meth:`~Queue.put` into the queue).
Benjamin Petersone711caf2008-06-11 16:44:04 +0000647
648 Raises a :exc:`ValueError` if called more times than there were items
649 placed in the queue.
650
651
652 .. method:: join()
653
654 Block until all items in the queue have been gotten and processed.
655
656 The count of unfinished tasks goes up whenever an item is added to the
657 queue. The count goes down whenever a consumer thread calls
658 :meth:`task_done` to indicate that the item was retrieved and all work on
659 it is complete. When the count of unfinished tasks drops to zero,
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000660 :meth:`~Queue.join` unblocks.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000661
662
663Miscellaneous
664~~~~~~~~~~~~~
665
666.. function:: active_children()
667
668 Return list of all live children of the current process.
669
670 Calling this has the side affect of "joining" any processes which have
671 already finished.
672
673.. function:: cpu_count()
674
675 Return the number of CPUs in the system. May raise
676 :exc:`NotImplementedError`.
677
678.. function:: current_process()
679
680 Return the :class:`Process` object corresponding to the current process.
681
682 An analogue of :func:`threading.current_thread`.
683
684.. function:: freeze_support()
685
686 Add support for when a program which uses :mod:`multiprocessing` has been
687 frozen to produce a Windows executable. (Has been tested with **py2exe**,
688 **PyInstaller** and **cx_Freeze**.)
689
690 One needs to call this function straight after the ``if __name__ ==
691 '__main__'`` line of the main module. For example::
692
693 from multiprocessing import Process, freeze_support
694
695 def f():
Georg Brandl49702152008-09-29 06:43:45 +0000696 print('hello world!')
Benjamin Petersone711caf2008-06-11 16:44:04 +0000697
698 if __name__ == '__main__':
699 freeze_support()
700 Process(target=f).start()
701
R. David Murray8e8099c2009-04-28 18:02:00 +0000702 If the ``freeze_support()`` line is omitted then trying to run the frozen
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000703 executable will raise :exc:`RuntimeError`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000704
705 If the module is being run normally by the Python interpreter then
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000706 :func:`freeze_support` has no effect.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000707
708.. function:: set_executable()
709
Ezio Melotti0639d5a2009-12-19 23:26:38 +0000710 Sets the path of the Python interpreter to use when starting a child process.
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000711 (By default :data:`sys.executable` is used). Embedders will probably need to
712 do some thing like ::
Benjamin Petersone711caf2008-06-11 16:44:04 +0000713
Eli Benderskyd08effe2011-12-31 07:20:26 +0200714 set_executable(os.path.join(sys.exec_prefix, 'pythonw.exe'))
Benjamin Petersone711caf2008-06-11 16:44:04 +0000715
R. David Murray8e8099c2009-04-28 18:02:00 +0000716 before they can create child processes. (Windows only)
Benjamin Petersone711caf2008-06-11 16:44:04 +0000717
718
719.. note::
720
721 :mod:`multiprocessing` contains no analogues of
722 :func:`threading.active_count`, :func:`threading.enumerate`,
723 :func:`threading.settrace`, :func:`threading.setprofile`,
724 :class:`threading.Timer`, or :class:`threading.local`.
725
726
727Connection Objects
728~~~~~~~~~~~~~~~~~~
729
730Connection objects allow the sending and receiving of picklable objects or
731strings. They can be thought of as message oriented connected sockets.
732
Eli Benderskyd08effe2011-12-31 07:20:26 +0200733Connection objects are usually created using :func:`Pipe` -- see also
Benjamin Petersone711caf2008-06-11 16:44:04 +0000734:ref:`multiprocessing-listeners-clients`.
735
736.. class:: Connection
737
738 .. method:: send(obj)
739
740 Send an object to the other end of the connection which should be read
741 using :meth:`recv`.
742
Benjamin Peterson965ce872009-04-05 21:24:58 +0000743 The object must be picklable. Very large pickles (approximately 32 MB+,
744 though it depends on the OS) may raise a ValueError exception.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000745
746 .. method:: recv()
747
748 Return an object sent from the other end of the connection using
Sandro Tosib52e7a92012-01-07 17:56:58 +0100749 :meth:`send`. Blocks until there its something to receive. Raises
750 :exc:`EOFError` if there is nothing left to receive
Benjamin Petersone711caf2008-06-11 16:44:04 +0000751 and the other end was closed.
752
753 .. method:: fileno()
754
Eli Benderskyd08effe2011-12-31 07:20:26 +0200755 Return the file descriptor or handle used by the connection.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000756
757 .. method:: close()
758
759 Close the connection.
760
761 This is called automatically when the connection is garbage collected.
762
763 .. method:: poll([timeout])
764
765 Return whether there is any data available to be read.
766
767 If *timeout* is not specified then it will return immediately. If
768 *timeout* is a number then this specifies the maximum time in seconds to
769 block. If *timeout* is ``None`` then an infinite timeout is used.
770
771 .. method:: send_bytes(buffer[, offset[, size]])
772
773 Send byte data from an object supporting the buffer interface as a
774 complete message.
775
776 If *offset* is given then data is read from that position in *buffer*. If
Benjamin Peterson965ce872009-04-05 21:24:58 +0000777 *size* is given then that many bytes will be read from buffer. Very large
778 buffers (approximately 32 MB+, though it depends on the OS) may raise a
Eli Benderskyd08effe2011-12-31 07:20:26 +0200779 :exc:`ValueError` exception
Benjamin Petersone711caf2008-06-11 16:44:04 +0000780
781 .. method:: recv_bytes([maxlength])
782
783 Return a complete message of byte data sent from the other end of the
Sandro Tosib52e7a92012-01-07 17:56:58 +0100784 connection as a string. Blocks until there is something to receive.
785 Raises :exc:`EOFError` if there is nothing left
Benjamin Petersone711caf2008-06-11 16:44:04 +0000786 to receive and the other end has closed.
787
788 If *maxlength* is specified and the message is longer than *maxlength*
Antoine Pitrou62ab10a2011-10-12 20:10:51 +0200789 then :exc:`OSError` is raised and the connection will no longer be
Benjamin Petersone711caf2008-06-11 16:44:04 +0000790 readable.
791
Antoine Pitrou62ab10a2011-10-12 20:10:51 +0200792 .. versionchanged:: 3.3
793 This function used to raise a :exc:`IOError`, which is now an
794 alias of :exc:`OSError`.
795
796
Benjamin Petersone711caf2008-06-11 16:44:04 +0000797 .. method:: recv_bytes_into(buffer[, offset])
798
799 Read into *buffer* a complete message of byte data sent from the other end
Sandro Tosib52e7a92012-01-07 17:56:58 +0100800 of the connection and return the number of bytes in the message. Blocks
801 until there is something to receive. Raises
Benjamin Petersone711caf2008-06-11 16:44:04 +0000802 :exc:`EOFError` if there is nothing left to receive and the other end was
803 closed.
804
805 *buffer* must be an object satisfying the writable buffer interface. If
806 *offset* is given then the message will be written into the buffer from
R. David Murray8e8099c2009-04-28 18:02:00 +0000807 that position. Offset must be a non-negative integer less than the
808 length of *buffer* (in bytes).
Benjamin Petersone711caf2008-06-11 16:44:04 +0000809
810 If the buffer is too short then a :exc:`BufferTooShort` exception is
811 raised and the complete message is available as ``e.args[0]`` where ``e``
812 is the exception instance.
813
814
815For example:
816
R. David Murray8e8099c2009-04-28 18:02:00 +0000817.. doctest::
818
Benjamin Petersone711caf2008-06-11 16:44:04 +0000819 >>> from multiprocessing import Pipe
820 >>> a, b = Pipe()
821 >>> a.send([1, 'hello', None])
822 >>> b.recv()
823 [1, 'hello', None]
Georg Brandl30176892010-10-29 05:22:17 +0000824 >>> b.send_bytes(b'thank you')
Benjamin Petersone711caf2008-06-11 16:44:04 +0000825 >>> a.recv_bytes()
Georg Brandl30176892010-10-29 05:22:17 +0000826 b'thank you'
Benjamin Petersone711caf2008-06-11 16:44:04 +0000827 >>> import array
828 >>> arr1 = array.array('i', range(5))
829 >>> arr2 = array.array('i', [0] * 10)
830 >>> a.send_bytes(arr1)
831 >>> count = b.recv_bytes_into(arr2)
832 >>> assert count == len(arr1) * arr1.itemsize
833 >>> arr2
834 array('i', [0, 1, 2, 3, 4, 0, 0, 0, 0, 0])
835
836
837.. warning::
838
839 The :meth:`Connection.recv` method automatically unpickles the data it
840 receives, which can be a security risk unless you can trust the process
841 which sent the message.
842
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000843 Therefore, unless the connection object was produced using :func:`Pipe` you
844 should only use the :meth:`~Connection.recv` and :meth:`~Connection.send`
845 methods after performing some sort of authentication. See
846 :ref:`multiprocessing-auth-keys`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000847
848.. warning::
849
850 If a process is killed while it is trying to read or write to a pipe then
851 the data in the pipe is likely to become corrupted, because it may become
852 impossible to be sure where the message boundaries lie.
853
854
855Synchronization primitives
856~~~~~~~~~~~~~~~~~~~~~~~~~~
857
858Generally synchronization primitives are not as necessary in a multiprocess
Georg Brandl2ee470f2008-07-16 12:55:28 +0000859program as they are in a multithreaded program. See the documentation for
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000860:mod:`threading` module.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000861
862Note that one can also create synchronization primitives by using a manager
863object -- see :ref:`multiprocessing-managers`.
864
865.. class:: BoundedSemaphore([value])
866
867 A bounded semaphore object: a clone of :class:`threading.BoundedSemaphore`.
868
Georg Brandl592296e2010-05-21 21:48:27 +0000869 (On Mac OS X, this is indistinguishable from :class:`Semaphore` because
Benjamin Petersone711caf2008-06-11 16:44:04 +0000870 ``sem_getvalue()`` is not implemented on that platform).
871
872.. class:: Condition([lock])
873
Benjamin Peterson5289b2b2008-06-28 00:40:54 +0000874 A condition variable: a clone of :class:`threading.Condition`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000875
876 If *lock* is specified then it should be a :class:`Lock` or :class:`RLock`
877 object from :mod:`multiprocessing`.
878
879.. class:: Event()
880
881 A clone of :class:`threading.Event`.
Benjamin Peterson965ce872009-04-05 21:24:58 +0000882 This method returns the state of the internal semaphore on exit, so it
883 will always return ``True`` except if a timeout is given and the operation
884 times out.
885
Raymond Hettinger35a88362009-04-09 00:08:24 +0000886 .. versionchanged:: 3.1
Benjamin Peterson965ce872009-04-05 21:24:58 +0000887 Previously, the method always returned ``None``.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000888
889.. class:: Lock()
890
891 A non-recursive lock object: a clone of :class:`threading.Lock`.
892
893.. class:: RLock()
894
895 A recursive lock object: a clone of :class:`threading.RLock`.
896
897.. class:: Semaphore([value])
898
Ross Lagerwall8fea2e62011-03-14 10:40:15 +0200899 A semaphore object: a clone of :class:`threading.Semaphore`.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000900
901.. note::
902
Georg Brandl592296e2010-05-21 21:48:27 +0000903 On Mac OS X, ``sem_timedwait`` is unsupported, so calling ``acquire()`` with
904 a timeout will emulate that function's behavior using a sleeping loop.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000905
906.. note::
907
908 If the SIGINT signal generated by Ctrl-C arrives while the main thread is
909 blocked by a call to :meth:`BoundedSemaphore.acquire`, :meth:`Lock.acquire`,
910 :meth:`RLock.acquire`, :meth:`Semaphore.acquire`, :meth:`Condition.acquire`
911 or :meth:`Condition.wait` then the call will be immediately interrupted and
912 :exc:`KeyboardInterrupt` will be raised.
913
914 This differs from the behaviour of :mod:`threading` where SIGINT will be
915 ignored while the equivalent blocking calls are in progress.
916
917
918Shared :mod:`ctypes` Objects
919~~~~~~~~~~~~~~~~~~~~~~~~~~~~
920
921It is possible to create shared objects using shared memory which can be
922inherited by child processes.
923
Jesse Nollerb0516a62009-01-18 03:11:38 +0000924.. function:: Value(typecode_or_type, *args[, lock])
Benjamin Petersone711caf2008-06-11 16:44:04 +0000925
926 Return a :mod:`ctypes` object allocated from shared memory. By default the
927 return value is actually a synchronized wrapper for the object.
928
929 *typecode_or_type* determines the type of the returned object: it is either a
930 ctypes type or a one character typecode of the kind used by the :mod:`array`
931 module. *\*args* is passed on to the constructor for the type.
932
933 If *lock* is ``True`` (the default) then a new lock object is created to
934 synchronize access to the value. If *lock* is a :class:`Lock` or
935 :class:`RLock` object then that will be used to synchronize access to the
936 value. If *lock* is ``False`` then access to the returned object will not be
937 automatically protected by a lock, so it will not necessarily be
938 "process-safe".
939
940 Note that *lock* is a keyword-only argument.
941
942.. function:: Array(typecode_or_type, size_or_initializer, *, lock=True)
943
944 Return a ctypes array allocated from shared memory. By default the return
945 value is actually a synchronized wrapper for the array.
946
947 *typecode_or_type* determines the type of the elements of the returned array:
948 it is either a ctypes type or a one character typecode of the kind used by
949 the :mod:`array` module. If *size_or_initializer* is an integer, then it
950 determines the length of the array, and the array will be initially zeroed.
951 Otherwise, *size_or_initializer* is a sequence which is used to initialize
952 the array and whose length determines the length of the array.
953
954 If *lock* is ``True`` (the default) then a new lock object is created to
955 synchronize access to the value. If *lock* is a :class:`Lock` or
956 :class:`RLock` object then that will be used to synchronize access to the
957 value. If *lock* is ``False`` then access to the returned object will not be
958 automatically protected by a lock, so it will not necessarily be
959 "process-safe".
960
961 Note that *lock* is a keyword only argument.
962
Amaury Forgeot d'Arcb0c29162008-11-22 22:18:04 +0000963 Note that an array of :data:`ctypes.c_char` has *value* and *raw*
Benjamin Petersone711caf2008-06-11 16:44:04 +0000964 attributes which allow one to use it to store and retrieve strings.
965
966
967The :mod:`multiprocessing.sharedctypes` module
968>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
969
970.. module:: multiprocessing.sharedctypes
971 :synopsis: Allocate ctypes objects from shared memory.
972
973The :mod:`multiprocessing.sharedctypes` module provides functions for allocating
974:mod:`ctypes` objects from shared memory which can be inherited by child
975processes.
976
977.. note::
978
Georg Brandl2ee470f2008-07-16 12:55:28 +0000979 Although it is possible to store a pointer in shared memory remember that
980 this will refer to a location in the address space of a specific process.
Benjamin Petersone711caf2008-06-11 16:44:04 +0000981 However, the pointer is quite likely to be invalid in the context of a second
982 process and trying to dereference the pointer from the second process may
983 cause a crash.
984
985.. function:: RawArray(typecode_or_type, size_or_initializer)
986
987 Return a ctypes array allocated from shared memory.
988
989 *typecode_or_type* determines the type of the elements of the returned array:
990 it is either a ctypes type or a one character typecode of the kind used by
991 the :mod:`array` module. If *size_or_initializer* is an integer then it
992 determines the length of the array, and the array will be initially zeroed.
993 Otherwise *size_or_initializer* is a sequence which is used to initialize the
994 array and whose length determines the length of the array.
995
996 Note that setting and getting an element is potentially non-atomic -- use
997 :func:`Array` instead to make sure that access is automatically synchronized
998 using a lock.
999
1000.. function:: RawValue(typecode_or_type, *args)
1001
1002 Return a ctypes object allocated from shared memory.
1003
1004 *typecode_or_type* determines the type of the returned object: it is either a
1005 ctypes type or a one character typecode of the kind used by the :mod:`array`
Jesse Nollerb0516a62009-01-18 03:11:38 +00001006 module. *\*args* is passed on to the constructor for the type.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001007
1008 Note that setting and getting the value is potentially non-atomic -- use
1009 :func:`Value` instead to make sure that access is automatically synchronized
1010 using a lock.
1011
Amaury Forgeot d'Arcb0c29162008-11-22 22:18:04 +00001012 Note that an array of :data:`ctypes.c_char` has ``value`` and ``raw``
Benjamin Petersone711caf2008-06-11 16:44:04 +00001013 attributes which allow one to use it to store and retrieve strings -- see
1014 documentation for :mod:`ctypes`.
1015
Jesse Nollerb0516a62009-01-18 03:11:38 +00001016.. function:: Array(typecode_or_type, size_or_initializer, *args[, lock])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001017
1018 The same as :func:`RawArray` except that depending on the value of *lock* a
1019 process-safe synchronization wrapper may be returned instead of a raw ctypes
1020 array.
1021
1022 If *lock* is ``True`` (the default) then a new lock object is created to
1023 synchronize access to the value. If *lock* is a :class:`Lock` or
1024 :class:`RLock` object then that will be used to synchronize access to the
1025 value. If *lock* is ``False`` then access to the returned object will not be
1026 automatically protected by a lock, so it will not necessarily be
1027 "process-safe".
1028
1029 Note that *lock* is a keyword-only argument.
1030
1031.. function:: Value(typecode_or_type, *args[, lock])
1032
1033 The same as :func:`RawValue` except that depending on the value of *lock* a
1034 process-safe synchronization wrapper may be returned instead of a raw ctypes
1035 object.
1036
1037 If *lock* is ``True`` (the default) then a new lock object is created to
1038 synchronize access to the value. If *lock* is a :class:`Lock` or
1039 :class:`RLock` object then that will be used to synchronize access to the
1040 value. If *lock* is ``False`` then access to the returned object will not be
1041 automatically protected by a lock, so it will not necessarily be
1042 "process-safe".
1043
1044 Note that *lock* is a keyword-only argument.
1045
1046.. function:: copy(obj)
1047
1048 Return a ctypes object allocated from shared memory which is a copy of the
1049 ctypes object *obj*.
1050
1051.. function:: synchronized(obj[, lock])
1052
1053 Return a process-safe wrapper object for a ctypes object which uses *lock* to
1054 synchronize access. If *lock* is ``None`` (the default) then a
1055 :class:`multiprocessing.RLock` object is created automatically.
1056
1057 A synchronized wrapper will have two methods in addition to those of the
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001058 object it wraps: :meth:`get_obj` returns the wrapped object and
1059 :meth:`get_lock` returns the lock object used for synchronization.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001060
1061 Note that accessing the ctypes object through the wrapper can be a lot slower
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001062 than accessing the raw ctypes object.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001063
1064
1065The table below compares the syntax for creating shared ctypes objects from
1066shared memory with the normal ctypes syntax. (In the table ``MyStruct`` is some
1067subclass of :class:`ctypes.Structure`.)
1068
1069==================== ========================== ===========================
1070ctypes sharedctypes using type sharedctypes using typecode
1071==================== ========================== ===========================
1072c_double(2.4) RawValue(c_double, 2.4) RawValue('d', 2.4)
1073MyStruct(4, 6) RawValue(MyStruct, 4, 6)
1074(c_short * 7)() RawArray(c_short, 7) RawArray('h', 7)
1075(c_int * 3)(9, 2, 8) RawArray(c_int, (9, 2, 8)) RawArray('i', (9, 2, 8))
1076==================== ========================== ===========================
1077
1078
1079Below is an example where a number of ctypes objects are modified by a child
1080process::
1081
1082 from multiprocessing import Process, Lock
1083 from multiprocessing.sharedctypes import Value, Array
1084 from ctypes import Structure, c_double
1085
1086 class Point(Structure):
1087 _fields_ = [('x', c_double), ('y', c_double)]
1088
1089 def modify(n, x, s, A):
1090 n.value **= 2
1091 x.value **= 2
1092 s.value = s.value.upper()
1093 for a in A:
1094 a.x **= 2
1095 a.y **= 2
1096
1097 if __name__ == '__main__':
1098 lock = Lock()
1099
1100 n = Value('i', 7)
R. David Murray8e8099c2009-04-28 18:02:00 +00001101 x = Value(c_double, 1.0/3.0, lock=False)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001102 s = Array('c', 'hello world', lock=lock)
1103 A = Array(Point, [(1.875,-6.25), (-5.75,2.0), (2.375,9.5)], lock=lock)
1104
1105 p = Process(target=modify, args=(n, x, s, A))
1106 p.start()
1107 p.join()
1108
Georg Brandl49702152008-09-29 06:43:45 +00001109 print(n.value)
1110 print(x.value)
1111 print(s.value)
1112 print([(a.x, a.y) for a in A])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001113
1114
Georg Brandl49702152008-09-29 06:43:45 +00001115.. highlight:: none
Benjamin Petersone711caf2008-06-11 16:44:04 +00001116
1117The results printed are ::
1118
1119 49
1120 0.1111111111111111
1121 HELLO WORLD
1122 [(3.515625, 39.0625), (33.0625, 4.0), (5.640625, 90.25)]
1123
Georg Brandl49702152008-09-29 06:43:45 +00001124.. highlight:: python
Benjamin Petersone711caf2008-06-11 16:44:04 +00001125
1126
1127.. _multiprocessing-managers:
1128
1129Managers
1130~~~~~~~~
1131
1132Managers provide a way to create data which can be shared between different
1133processes. A manager object controls a server process which manages *shared
1134objects*. Other processes can access the shared objects by using proxies.
1135
1136.. function:: multiprocessing.Manager()
1137
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001138 Returns a started :class:`~multiprocessing.managers.SyncManager` object which
1139 can be used for sharing objects between processes. The returned manager
1140 object corresponds to a spawned child process and has methods which will
1141 create shared objects and return corresponding proxies.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001142
1143.. module:: multiprocessing.managers
1144 :synopsis: Share data between process with shared objects.
1145
1146Manager processes will be shutdown as soon as they are garbage collected or
1147their parent process exits. The manager classes are defined in the
1148:mod:`multiprocessing.managers` module:
1149
1150.. class:: BaseManager([address[, authkey]])
1151
1152 Create a BaseManager object.
1153
Benjamin Peterson21896a32010-03-21 22:03:03 +00001154 Once created one should call :meth:`start` or ``get_server().serve_forever()`` to ensure
Benjamin Petersone711caf2008-06-11 16:44:04 +00001155 that the manager object refers to a started manager process.
1156
1157 *address* is the address on which the manager process listens for new
1158 connections. If *address* is ``None`` then an arbitrary one is chosen.
1159
1160 *authkey* is the authentication key which will be used to check the validity
1161 of incoming connections to the server process. If *authkey* is ``None`` then
Benjamin Petersona786b022008-08-25 21:05:21 +00001162 ``current_process().authkey``. Otherwise *authkey* is used and it
Benjamin Petersone711caf2008-06-11 16:44:04 +00001163 must be a string.
1164
Benjamin Petersonf47ed4a2009-04-11 20:45:40 +00001165 .. method:: start([initializer[, initargs]])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001166
Benjamin Petersonf47ed4a2009-04-11 20:45:40 +00001167 Start a subprocess to start the manager. If *initializer* is not ``None``
1168 then the subprocess will call ``initializer(*initargs)`` when it starts.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001169
Jesse Noller45239682008-11-28 18:46:19 +00001170 .. method:: get_server()
Georg Brandl48310cd2009-01-03 21:18:54 +00001171
Jesse Noller45239682008-11-28 18:46:19 +00001172 Returns a :class:`Server` object which represents the actual server under
Georg Brandl48310cd2009-01-03 21:18:54 +00001173 the control of the Manager. The :class:`Server` object supports the
R. David Murray8e8099c2009-04-28 18:02:00 +00001174 :meth:`serve_forever` method::
Georg Brandl48310cd2009-01-03 21:18:54 +00001175
Georg Brandl1f01deb2009-01-03 22:47:39 +00001176 >>> from multiprocessing.managers import BaseManager
R. David Murray8e8099c2009-04-28 18:02:00 +00001177 >>> manager = BaseManager(address=('', 50000), authkey='abc')
1178 >>> server = manager.get_server()
1179 >>> server.serve_forever()
Georg Brandl48310cd2009-01-03 21:18:54 +00001180
R. David Murray8e8099c2009-04-28 18:02:00 +00001181 :class:`Server` additionally has an :attr:`address` attribute.
Jesse Noller45239682008-11-28 18:46:19 +00001182
1183 .. method:: connect()
Georg Brandl48310cd2009-01-03 21:18:54 +00001184
R. David Murray8e8099c2009-04-28 18:02:00 +00001185 Connect a local manager object to a remote manager process::
Georg Brandl48310cd2009-01-03 21:18:54 +00001186
Jesse Noller45239682008-11-28 18:46:19 +00001187 >>> from multiprocessing.managers import BaseManager
R. David Murray8e8099c2009-04-28 18:02:00 +00001188 >>> m = BaseManager(address=('127.0.0.1', 5000), authkey='abc')
Jesse Noller45239682008-11-28 18:46:19 +00001189 >>> m.connect()
1190
Benjamin Petersone711caf2008-06-11 16:44:04 +00001191 .. method:: shutdown()
1192
1193 Stop the process used by the manager. This is only available if
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001194 :meth:`start` has been used to start the server process.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001195
1196 This can be called multiple times.
1197
1198 .. method:: register(typeid[, callable[, proxytype[, exposed[, method_to_typeid[, create_method]]]]])
1199
1200 A classmethod which can be used for registering a type or callable with
1201 the manager class.
1202
1203 *typeid* is a "type identifier" which is used to identify a particular
1204 type of shared object. This must be a string.
1205
1206 *callable* is a callable used for creating objects for this type
1207 identifier. If a manager instance will be created using the
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001208 :meth:`from_address` classmethod or if the *create_method* argument is
Benjamin Petersone711caf2008-06-11 16:44:04 +00001209 ``False`` then this can be left as ``None``.
1210
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001211 *proxytype* is a subclass of :class:`BaseProxy` which is used to create
1212 proxies for shared objects with this *typeid*. If ``None`` then a proxy
1213 class is created automatically.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001214
1215 *exposed* is used to specify a sequence of method names which proxies for
1216 this typeid should be allowed to access using
1217 :meth:`BaseProxy._callMethod`. (If *exposed* is ``None`` then
1218 :attr:`proxytype._exposed_` is used instead if it exists.) In the case
1219 where no exposed list is specified, all "public methods" of the shared
1220 object will be accessible. (Here a "public method" means any attribute
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001221 which has a :meth:`__call__` method and whose name does not begin with
Benjamin Petersone711caf2008-06-11 16:44:04 +00001222 ``'_'``.)
1223
1224 *method_to_typeid* is a mapping used to specify the return type of those
1225 exposed methods which should return a proxy. It maps method names to
1226 typeid strings. (If *method_to_typeid* is ``None`` then
1227 :attr:`proxytype._method_to_typeid_` is used instead if it exists.) If a
1228 method's name is not a key of this mapping or if the mapping is ``None``
1229 then the object returned by the method will be copied by value.
1230
1231 *create_method* determines whether a method should be created with name
1232 *typeid* which can be used to tell the server process to create a new
1233 shared object and return a proxy for it. By default it is ``True``.
1234
1235 :class:`BaseManager` instances also have one read-only property:
1236
1237 .. attribute:: address
1238
1239 The address used by the manager.
1240
1241
1242.. class:: SyncManager
1243
1244 A subclass of :class:`BaseManager` which can be used for the synchronization
1245 of processes. Objects of this type are returned by
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001246 :func:`multiprocessing.Manager`.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001247
1248 It also supports creation of shared lists and dictionaries.
1249
1250 .. method:: BoundedSemaphore([value])
1251
1252 Create a shared :class:`threading.BoundedSemaphore` object and return a
1253 proxy for it.
1254
1255 .. method:: Condition([lock])
1256
1257 Create a shared :class:`threading.Condition` object and return a proxy for
1258 it.
1259
1260 If *lock* is supplied then it should be a proxy for a
1261 :class:`threading.Lock` or :class:`threading.RLock` object.
1262
1263 .. method:: Event()
1264
1265 Create a shared :class:`threading.Event` object and return a proxy for it.
1266
1267 .. method:: Lock()
1268
1269 Create a shared :class:`threading.Lock` object and return a proxy for it.
1270
1271 .. method:: Namespace()
1272
1273 Create a shared :class:`Namespace` object and return a proxy for it.
1274
1275 .. method:: Queue([maxsize])
1276
Benjamin Peterson257060a2008-06-28 01:42:41 +00001277 Create a shared :class:`queue.Queue` object and return a proxy for it.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001278
1279 .. method:: RLock()
1280
1281 Create a shared :class:`threading.RLock` object and return a proxy for it.
1282
1283 .. method:: Semaphore([value])
1284
1285 Create a shared :class:`threading.Semaphore` object and return a proxy for
1286 it.
1287
1288 .. method:: Array(typecode, sequence)
1289
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001290 Create an array and return a proxy for it.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001291
1292 .. method:: Value(typecode, value)
1293
1294 Create an object with a writable ``value`` attribute and return a proxy
1295 for it.
1296
1297 .. method:: dict()
1298 dict(mapping)
1299 dict(sequence)
1300
1301 Create a shared ``dict`` object and return a proxy for it.
1302
1303 .. method:: list()
1304 list(sequence)
1305
1306 Create a shared ``list`` object and return a proxy for it.
1307
Georg Brandl3ed41142010-10-15 16:19:43 +00001308 .. note::
1309
1310 Modifications to mutable values or items in dict and list proxies will not
1311 be propagated through the manager, because the proxy has no way of knowing
1312 when its values or items are modified. To modify such an item, you can
1313 re-assign the modified object to the container proxy::
1314
1315 # create a list proxy and append a mutable object (a dictionary)
1316 lproxy = manager.list()
1317 lproxy.append({})
1318 # now mutate the dictionary
1319 d = lproxy[0]
1320 d['a'] = 1
1321 d['b'] = 2
1322 # at this point, the changes to d are not yet synced, but by
1323 # reassigning the dictionary, the proxy is notified of the change
1324 lproxy[0] = d
1325
Benjamin Petersone711caf2008-06-11 16:44:04 +00001326
1327Namespace objects
1328>>>>>>>>>>>>>>>>>
1329
1330A namespace object has no public methods, but does have writable attributes.
1331Its representation shows the values of its attributes.
1332
1333However, when using a proxy for a namespace object, an attribute beginning with
R. David Murray8e8099c2009-04-28 18:02:00 +00001334``'_'`` will be an attribute of the proxy and not an attribute of the referent:
1335
1336.. doctest::
Benjamin Petersone711caf2008-06-11 16:44:04 +00001337
1338 >>> manager = multiprocessing.Manager()
1339 >>> Global = manager.Namespace()
1340 >>> Global.x = 10
1341 >>> Global.y = 'hello'
1342 >>> Global._z = 12.3 # this is an attribute of the proxy
Georg Brandl49702152008-09-29 06:43:45 +00001343 >>> print(Global)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001344 Namespace(x=10, y='hello')
1345
1346
1347Customized managers
1348>>>>>>>>>>>>>>>>>>>
1349
1350To create one's own manager, one creates a subclass of :class:`BaseManager` and
Eli Benderskyd08effe2011-12-31 07:20:26 +02001351uses the :meth:`~BaseManager.register` classmethod to register new types or
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001352callables with the manager class. For example::
Benjamin Petersone711caf2008-06-11 16:44:04 +00001353
1354 from multiprocessing.managers import BaseManager
1355
Éric Araujo28053fb2010-11-22 03:09:19 +00001356 class MathsClass:
Benjamin Petersone711caf2008-06-11 16:44:04 +00001357 def add(self, x, y):
1358 return x + y
1359 def mul(self, x, y):
1360 return x * y
1361
1362 class MyManager(BaseManager):
1363 pass
1364
1365 MyManager.register('Maths', MathsClass)
1366
1367 if __name__ == '__main__':
1368 manager = MyManager()
1369 manager.start()
1370 maths = manager.Maths()
Georg Brandl49702152008-09-29 06:43:45 +00001371 print(maths.add(4, 3)) # prints 7
1372 print(maths.mul(7, 8)) # prints 56
Benjamin Petersone711caf2008-06-11 16:44:04 +00001373
1374
1375Using a remote manager
1376>>>>>>>>>>>>>>>>>>>>>>
1377
1378It is possible to run a manager server on one machine and have clients use it
1379from other machines (assuming that the firewalls involved allow it).
1380
1381Running the following commands creates a server for a single shared queue which
1382remote clients can access::
1383
1384 >>> from multiprocessing.managers import BaseManager
Benjamin Peterson257060a2008-06-28 01:42:41 +00001385 >>> import queue
1386 >>> queue = queue.Queue()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001387 >>> class QueueManager(BaseManager): pass
Jesse Noller45239682008-11-28 18:46:19 +00001388 >>> QueueManager.register('get_queue', callable=lambda:queue)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001389 >>> m = QueueManager(address=('', 50000), authkey='abracadabra')
Jesse Noller45239682008-11-28 18:46:19 +00001390 >>> s = m.get_server()
R. David Murray8e8099c2009-04-28 18:02:00 +00001391 >>> s.serve_forever()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001392
1393One client can access the server as follows::
1394
1395 >>> from multiprocessing.managers import BaseManager
1396 >>> class QueueManager(BaseManager): pass
Jesse Noller45239682008-11-28 18:46:19 +00001397 >>> QueueManager.register('get_queue')
1398 >>> m = QueueManager(address=('foo.bar.org', 50000), authkey='abracadabra')
1399 >>> m.connect()
1400 >>> queue = m.get_queue()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001401 >>> queue.put('hello')
1402
1403Another client can also use it::
1404
1405 >>> from multiprocessing.managers import BaseManager
1406 >>> class QueueManager(BaseManager): pass
R. David Murray8e8099c2009-04-28 18:02:00 +00001407 >>> QueueManager.register('get_queue')
1408 >>> m = QueueManager(address=('foo.bar.org', 50000), authkey='abracadabra')
1409 >>> m.connect()
1410 >>> queue = m.get_queue()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001411 >>> queue.get()
1412 'hello'
1413
Georg Brandl48310cd2009-01-03 21:18:54 +00001414Local processes can also access that queue, using the code from above on the
Jesse Noller45239682008-11-28 18:46:19 +00001415client to access it remotely::
1416
1417 >>> from multiprocessing import Process, Queue
1418 >>> from multiprocessing.managers import BaseManager
1419 >>> class Worker(Process):
1420 ... def __init__(self, q):
1421 ... self.q = q
1422 ... super(Worker, self).__init__()
1423 ... def run(self):
1424 ... self.q.put('local hello')
Georg Brandl48310cd2009-01-03 21:18:54 +00001425 ...
Jesse Noller45239682008-11-28 18:46:19 +00001426 >>> queue = Queue()
1427 >>> w = Worker(queue)
1428 >>> w.start()
1429 >>> class QueueManager(BaseManager): pass
Georg Brandl48310cd2009-01-03 21:18:54 +00001430 ...
Jesse Noller45239682008-11-28 18:46:19 +00001431 >>> QueueManager.register('get_queue', callable=lambda: queue)
1432 >>> m = QueueManager(address=('', 50000), authkey='abracadabra')
1433 >>> s = m.get_server()
1434 >>> s.serve_forever()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001435
1436Proxy Objects
1437~~~~~~~~~~~~~
1438
1439A proxy is an object which *refers* to a shared object which lives (presumably)
1440in a different process. The shared object is said to be the *referent* of the
1441proxy. Multiple proxy objects may have the same referent.
1442
1443A proxy object has methods which invoke corresponding methods of its referent
1444(although not every method of the referent will necessarily be available through
1445the proxy). A proxy can usually be used in most of the same ways that its
R. David Murray8e8099c2009-04-28 18:02:00 +00001446referent can:
1447
1448.. doctest::
Benjamin Petersone711caf2008-06-11 16:44:04 +00001449
1450 >>> from multiprocessing import Manager
1451 >>> manager = Manager()
1452 >>> l = manager.list([i*i for i in range(10)])
Georg Brandl49702152008-09-29 06:43:45 +00001453 >>> print(l)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001454 [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
Georg Brandl49702152008-09-29 06:43:45 +00001455 >>> print(repr(l))
R. David Murray8e8099c2009-04-28 18:02:00 +00001456 <ListProxy object, typeid 'list' at 0x...>
Benjamin Petersone711caf2008-06-11 16:44:04 +00001457 >>> l[4]
1458 16
1459 >>> l[2:5]
1460 [4, 9, 16]
1461
1462Notice that applying :func:`str` to a proxy will return the representation of
1463the referent, whereas applying :func:`repr` will return the representation of
1464the proxy.
1465
1466An important feature of proxy objects is that they are picklable so they can be
1467passed between processes. Note, however, that if a proxy is sent to the
1468corresponding manager's process then unpickling it will produce the referent
R. David Murray8e8099c2009-04-28 18:02:00 +00001469itself. This means, for example, that one shared object can contain a second:
1470
1471.. doctest::
Benjamin Petersone711caf2008-06-11 16:44:04 +00001472
1473 >>> a = manager.list()
1474 >>> b = manager.list()
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001475 >>> a.append(b) # referent of a now contains referent of b
Georg Brandl49702152008-09-29 06:43:45 +00001476 >>> print(a, b)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001477 [[]] []
1478 >>> b.append('hello')
Georg Brandl49702152008-09-29 06:43:45 +00001479 >>> print(a, b)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001480 [['hello']] ['hello']
1481
1482.. note::
1483
1484 The proxy types in :mod:`multiprocessing` do nothing to support comparisons
R. David Murray8e8099c2009-04-28 18:02:00 +00001485 by value. So, for instance, we have:
Benjamin Petersone711caf2008-06-11 16:44:04 +00001486
R. David Murray8e8099c2009-04-28 18:02:00 +00001487 .. doctest::
Benjamin Petersone711caf2008-06-11 16:44:04 +00001488
R. David Murray8e8099c2009-04-28 18:02:00 +00001489 >>> manager.list([1,2,3]) == [1,2,3]
1490 False
1491
1492 One should just use a copy of the referent instead when making comparisons.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001493
1494.. class:: BaseProxy
1495
1496 Proxy objects are instances of subclasses of :class:`BaseProxy`.
1497
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001498 .. method:: _callmethod(methodname[, args[, kwds]])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001499
1500 Call and return the result of a method of the proxy's referent.
1501
1502 If ``proxy`` is a proxy whose referent is ``obj`` then the expression ::
1503
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001504 proxy._callmethod(methodname, args, kwds)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001505
1506 will evaluate the expression ::
1507
1508 getattr(obj, methodname)(*args, **kwds)
1509
1510 in the manager's process.
1511
1512 The returned value will be a copy of the result of the call or a proxy to
1513 a new shared object -- see documentation for the *method_to_typeid*
1514 argument of :meth:`BaseManager.register`.
1515
Ezio Melottie130a522011-10-19 10:58:56 +03001516 If an exception is raised by the call, then is re-raised by
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001517 :meth:`_callmethod`. If some other exception is raised in the manager's
Benjamin Petersone711caf2008-06-11 16:44:04 +00001518 process then this is converted into a :exc:`RemoteError` exception and is
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001519 raised by :meth:`_callmethod`.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001520
1521 Note in particular that an exception will be raised if *methodname* has
1522 not been *exposed*
1523
R. David Murray8e8099c2009-04-28 18:02:00 +00001524 An example of the usage of :meth:`_callmethod`:
1525
1526 .. doctest::
Benjamin Petersone711caf2008-06-11 16:44:04 +00001527
1528 >>> l = manager.list(range(10))
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001529 >>> l._callmethod('__len__')
Benjamin Petersone711caf2008-06-11 16:44:04 +00001530 10
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001531 >>> l._callmethod('__getslice__', (2, 7)) # equiv to `l[2:7]`
Benjamin Petersone711caf2008-06-11 16:44:04 +00001532 [2, 3, 4, 5, 6]
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001533 >>> l._callmethod('__getitem__', (20,)) # equiv to `l[20]`
Benjamin Petersone711caf2008-06-11 16:44:04 +00001534 Traceback (most recent call last):
1535 ...
1536 IndexError: list index out of range
1537
Benjamin Peterson6ebe78f2008-12-21 00:06:59 +00001538 .. method:: _getvalue()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001539
1540 Return a copy of the referent.
1541
1542 If the referent is unpicklable then this will raise an exception.
1543
1544 .. method:: __repr__
1545
1546 Return a representation of the proxy object.
1547
1548 .. method:: __str__
1549
1550 Return the representation of the referent.
1551
1552
1553Cleanup
1554>>>>>>>
1555
1556A proxy object uses a weakref callback so that when it gets garbage collected it
1557deregisters itself from the manager which owns its referent.
1558
1559A shared object gets deleted from the manager process when there are no longer
1560any proxies referring to it.
1561
1562
1563Process Pools
1564~~~~~~~~~~~~~
1565
1566.. module:: multiprocessing.pool
1567 :synopsis: Create pools of processes.
1568
1569One can create a pool of processes which will carry out tasks submitted to it
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001570with the :class:`Pool` class.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001571
Jesse Noller1f0b6582010-01-27 03:36:01 +00001572.. class:: multiprocessing.Pool([processes[, initializer[, initargs[, maxtasksperchild]]]])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001573
1574 A process pool object which controls a pool of worker processes to which jobs
1575 can be submitted. It supports asynchronous results with timeouts and
1576 callbacks and has a parallel map implementation.
1577
1578 *processes* is the number of worker processes to use. If *processes* is
1579 ``None`` then the number returned by :func:`cpu_count` is used. If
1580 *initializer* is not ``None`` then each worker process will call
1581 ``initializer(*initargs)`` when it starts.
1582
Georg Brandl17ef0d52010-10-17 06:21:59 +00001583 .. versionadded:: 3.2
1584 *maxtasksperchild* is the number of tasks a worker process can complete
1585 before it will exit and be replaced with a fresh worker process, to enable
1586 unused resources to be freed. The default *maxtasksperchild* is None, which
1587 means worker processes will live as long as the pool.
Jesse Noller1f0b6582010-01-27 03:36:01 +00001588
1589 .. note::
1590
Georg Brandl17ef0d52010-10-17 06:21:59 +00001591 Worker processes within a :class:`Pool` typically live for the complete
1592 duration of the Pool's work queue. A frequent pattern found in other
1593 systems (such as Apache, mod_wsgi, etc) to free resources held by
1594 workers is to allow a worker within a pool to complete only a set
1595 amount of work before being exiting, being cleaned up and a new
1596 process spawned to replace the old one. The *maxtasksperchild*
1597 argument to the :class:`Pool` exposes this ability to the end user.
Jesse Noller1f0b6582010-01-27 03:36:01 +00001598
Benjamin Petersone711caf2008-06-11 16:44:04 +00001599 .. method:: apply(func[, args[, kwds]])
1600
Benjamin Peterson37d2fe02008-10-24 22:28:58 +00001601 Call *func* with arguments *args* and keyword arguments *kwds*. It blocks
Eli Benderskyd08effe2011-12-31 07:20:26 +02001602 until the result is ready. Given this blocks, :meth:`apply_async` is
1603 better suited for performing work in parallel. Additionally, *func*
1604 is only executed in one of the workers of the pool.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001605
Ask Solem1d3b8932010-11-09 21:36:56 +00001606 .. method:: apply_async(func[, args[, kwds[, callback[, error_callback]]]])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001607
1608 A variant of the :meth:`apply` method which returns a result object.
1609
1610 If *callback* is specified then it should be a callable which accepts a
1611 single argument. When the result becomes ready *callback* is applied to
Ask Solem1d3b8932010-11-09 21:36:56 +00001612 it, that is unless the call failed, in which case the *error_callback*
1613 is applied instead
1614
1615 If *error_callback* is specified then it should be a callable which
1616 accepts a single argument. If the target function fails, then
1617 the *error_callback* is called with the exception instance.
1618
1619 Callbacks should complete immediately since otherwise the thread which
1620 handles the results will get blocked.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001621
1622 .. method:: map(func, iterable[, chunksize])
1623
Georg Brandl22b34312009-07-26 14:54:51 +00001624 A parallel equivalent of the :func:`map` built-in function (it supports only
Eli Benderskyd08effe2011-12-31 07:20:26 +02001625 one *iterable* argument though). It blocks until the result is ready.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001626
1627 This method chops the iterable into a number of chunks which it submits to
1628 the process pool as separate tasks. The (approximate) size of these
1629 chunks can be specified by setting *chunksize* to a positive integer.
1630
Sandro Tosidb79e952011-08-08 16:38:13 +02001631 .. method:: map_async(func, iterable[, chunksize[, callback[, error_callback]]])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001632
Georg Brandl502d9a52009-07-26 15:02:41 +00001633 A variant of the :meth:`.map` method which returns a result object.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001634
1635 If *callback* is specified then it should be a callable which accepts a
1636 single argument. When the result becomes ready *callback* is applied to
Ask Solem1d3b8932010-11-09 21:36:56 +00001637 it, that is unless the call failed, in which case the *error_callback*
1638 is applied instead
1639
1640 If *error_callback* is specified then it should be a callable which
1641 accepts a single argument. If the target function fails, then
1642 the *error_callback* is called with the exception instance.
1643
1644 Callbacks should complete immediately since otherwise the thread which
1645 handles the results will get blocked.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001646
1647 .. method:: imap(func, iterable[, chunksize])
1648
Georg Brandl92905032008-11-22 08:51:39 +00001649 A lazier version of :meth:`map`.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001650
1651 The *chunksize* argument is the same as the one used by the :meth:`.map`
1652 method. For very long iterables using a large value for *chunksize* can
Ezio Melottie130a522011-10-19 10:58:56 +03001653 make the job complete **much** faster than using the default value of
Benjamin Petersone711caf2008-06-11 16:44:04 +00001654 ``1``.
1655
Georg Brandl502d9a52009-07-26 15:02:41 +00001656 Also if *chunksize* is ``1`` then the :meth:`!next` method of the iterator
Benjamin Petersone711caf2008-06-11 16:44:04 +00001657 returned by the :meth:`imap` method has an optional *timeout* parameter:
1658 ``next(timeout)`` will raise :exc:`multiprocessing.TimeoutError` if the
1659 result cannot be returned within *timeout* seconds.
1660
1661 .. method:: imap_unordered(func, iterable[, chunksize])
1662
1663 The same as :meth:`imap` except that the ordering of the results from the
1664 returned iterator should be considered arbitrary. (Only when there is
1665 only one worker process is the order guaranteed to be "correct".)
1666
Antoine Pitroude911b22011-12-21 11:03:24 +01001667 .. method:: starmap(func, iterable[, chunksize])
1668
1669 Like :meth:`map` except that the elements of the `iterable` are expected
1670 to be iterables that are unpacked as arguments.
1671
1672 Hence an `iterable` of `[(1,2), (3, 4)]` results in `[func(1,2),
1673 func(3,4)]`.
1674
1675 .. versionadded:: 3.3
1676
1677 .. method:: starmap_async(func, iterable[, chunksize[, callback[, error_back]]])
1678
1679 A combination of :meth:`starmap` and :meth:`map_async` that iterates over
1680 `iterable` of iterables and calls `func` with the iterables unpacked.
1681 Returns a result object.
1682
1683 .. versionadded:: 3.3
1684
Benjamin Petersone711caf2008-06-11 16:44:04 +00001685 .. method:: close()
1686
1687 Prevents any more tasks from being submitted to the pool. Once all the
1688 tasks have been completed the worker processes will exit.
1689
1690 .. method:: terminate()
1691
1692 Stops the worker processes immediately without completing outstanding
1693 work. When the pool object is garbage collected :meth:`terminate` will be
1694 called immediately.
1695
1696 .. method:: join()
1697
1698 Wait for the worker processes to exit. One must call :meth:`close` or
1699 :meth:`terminate` before using :meth:`join`.
1700
1701
1702.. class:: AsyncResult
1703
1704 The class of the result returned by :meth:`Pool.apply_async` and
1705 :meth:`Pool.map_async`.
1706
Georg Brandle3d70ae2008-11-22 08:54:21 +00001707 .. method:: get([timeout])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001708
1709 Return the result when it arrives. If *timeout* is not ``None`` and the
1710 result does not arrive within *timeout* seconds then
1711 :exc:`multiprocessing.TimeoutError` is raised. If the remote call raised
1712 an exception then that exception will be reraised by :meth:`get`.
1713
1714 .. method:: wait([timeout])
1715
1716 Wait until the result is available or until *timeout* seconds pass.
1717
1718 .. method:: ready()
1719
1720 Return whether the call has completed.
1721
1722 .. method:: successful()
1723
1724 Return whether the call completed without raising an exception. Will
1725 raise :exc:`AssertionError` if the result is not ready.
1726
1727The following example demonstrates the use of a pool::
1728
1729 from multiprocessing import Pool
1730
1731 def f(x):
1732 return x*x
1733
1734 if __name__ == '__main__':
1735 pool = Pool(processes=4) # start 4 worker processes
1736
Georg Brandle3d70ae2008-11-22 08:54:21 +00001737 result = pool.apply_async(f, (10,)) # evaluate "f(10)" asynchronously
Georg Brandl49702152008-09-29 06:43:45 +00001738 print(result.get(timeout=1)) # prints "100" unless your computer is *very* slow
Benjamin Petersone711caf2008-06-11 16:44:04 +00001739
Georg Brandl49702152008-09-29 06:43:45 +00001740 print(pool.map(f, range(10))) # prints "[0, 1, 4,..., 81]"
Benjamin Petersone711caf2008-06-11 16:44:04 +00001741
1742 it = pool.imap(f, range(10))
Georg Brandl49702152008-09-29 06:43:45 +00001743 print(next(it)) # prints "0"
1744 print(next(it)) # prints "1"
1745 print(it.next(timeout=1)) # prints "4" unless your computer is *very* slow
Benjamin Petersone711caf2008-06-11 16:44:04 +00001746
1747 import time
Georg Brandle3d70ae2008-11-22 08:54:21 +00001748 result = pool.apply_async(time.sleep, (10,))
Georg Brandl49702152008-09-29 06:43:45 +00001749 print(result.get(timeout=1)) # raises TimeoutError
Benjamin Petersone711caf2008-06-11 16:44:04 +00001750
1751
1752.. _multiprocessing-listeners-clients:
1753
1754Listeners and Clients
1755~~~~~~~~~~~~~~~~~~~~~
1756
1757.. module:: multiprocessing.connection
1758 :synopsis: API for dealing with sockets.
1759
1760Usually message passing between processes is done using queues or by using
1761:class:`Connection` objects returned by :func:`Pipe`.
1762
1763However, the :mod:`multiprocessing.connection` module allows some extra
1764flexibility. It basically gives a high level message oriented API for dealing
1765with sockets or Windows named pipes, and also has support for *digest
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001766authentication* using the :mod:`hmac` module.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001767
1768
1769.. function:: deliver_challenge(connection, authkey)
1770
1771 Send a randomly generated message to the other end of the connection and wait
1772 for a reply.
1773
1774 If the reply matches the digest of the message using *authkey* as the key
1775 then a welcome message is sent to the other end of the connection. Otherwise
1776 :exc:`AuthenticationError` is raised.
1777
1778.. function:: answerChallenge(connection, authkey)
1779
1780 Receive a message, calculate the digest of the message using *authkey* as the
1781 key, and then send the digest back.
1782
1783 If a welcome message is not received, then :exc:`AuthenticationError` is
1784 raised.
1785
1786.. function:: Client(address[, family[, authenticate[, authkey]]])
1787
1788 Attempt to set up a connection to the listener which is using address
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001789 *address*, returning a :class:`~multiprocessing.Connection`.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001790
1791 The type of the connection is determined by *family* argument, but this can
1792 generally be omitted since it can usually be inferred from the format of
1793 *address*. (See :ref:`multiprocessing-address-formats`)
1794
Alexandre Vassalottic57a84f2009-07-17 12:07:01 +00001795 If *authenticate* is ``True`` or *authkey* is a string then digest
Benjamin Petersone711caf2008-06-11 16:44:04 +00001796 authentication is used. The key used for authentication will be either
Benjamin Petersona786b022008-08-25 21:05:21 +00001797 *authkey* or ``current_process().authkey)`` if *authkey* is ``None``.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001798 If authentication fails then :exc:`AuthenticationError` is raised. See
1799 :ref:`multiprocessing-auth-keys`.
1800
1801.. class:: Listener([address[, family[, backlog[, authenticate[, authkey]]]]])
1802
1803 A wrapper for a bound socket or Windows named pipe which is 'listening' for
1804 connections.
1805
1806 *address* is the address to be used by the bound socket or named pipe of the
1807 listener object.
1808
Benjamin Petersond23f8222009-04-05 19:13:16 +00001809 .. note::
1810
1811 If an address of '0.0.0.0' is used, the address will not be a connectable
1812 end point on Windows. If you require a connectable end-point,
1813 you should use '127.0.0.1'.
1814
Benjamin Petersone711caf2008-06-11 16:44:04 +00001815 *family* is the type of socket (or named pipe) to use. This can be one of
1816 the strings ``'AF_INET'`` (for a TCP socket), ``'AF_UNIX'`` (for a Unix
1817 domain socket) or ``'AF_PIPE'`` (for a Windows named pipe). Of these only
1818 the first is guaranteed to be available. If *family* is ``None`` then the
1819 family is inferred from the format of *address*. If *address* is also
1820 ``None`` then a default is chosen. This default is the family which is
1821 assumed to be the fastest available. See
1822 :ref:`multiprocessing-address-formats`. Note that if *family* is
1823 ``'AF_UNIX'`` and address is ``None`` then the socket will be created in a
1824 private temporary directory created using :func:`tempfile.mkstemp`.
1825
1826 If the listener object uses a socket then *backlog* (1 by default) is passed
1827 to the :meth:`listen` method of the socket once it has been bound.
1828
1829 If *authenticate* is ``True`` (``False`` by default) or *authkey* is not
1830 ``None`` then digest authentication is used.
1831
1832 If *authkey* is a string then it will be used as the authentication key;
1833 otherwise it must be *None*.
1834
1835 If *authkey* is ``None`` and *authenticate* is ``True`` then
Benjamin Petersona786b022008-08-25 21:05:21 +00001836 ``current_process().authkey`` is used as the authentication key. If
Alexandre Vassalottic57a84f2009-07-17 12:07:01 +00001837 *authkey* is ``None`` and *authenticate* is ``False`` then no
Benjamin Petersone711caf2008-06-11 16:44:04 +00001838 authentication is done. If authentication fails then
1839 :exc:`AuthenticationError` is raised. See :ref:`multiprocessing-auth-keys`.
1840
1841 .. method:: accept()
1842
1843 Accept a connection on the bound socket or named pipe of the listener
1844 object and return a :class:`Connection` object. If authentication is
1845 attempted and fails, then :exc:`AuthenticationError` is raised.
1846
1847 .. method:: close()
1848
1849 Close the bound socket or named pipe of the listener object. This is
1850 called automatically when the listener is garbage collected. However it
1851 is advisable to call it explicitly.
1852
1853 Listener objects have the following read-only properties:
1854
1855 .. attribute:: address
1856
1857 The address which is being used by the Listener object.
1858
1859 .. attribute:: last_accepted
1860
1861 The address from which the last accepted connection came. If this is
1862 unavailable then it is ``None``.
1863
1864
1865The module defines two exceptions:
1866
1867.. exception:: AuthenticationError
1868
1869 Exception raised when there is an authentication error.
1870
Benjamin Petersone711caf2008-06-11 16:44:04 +00001871
1872**Examples**
1873
1874The following server code creates a listener which uses ``'secret password'`` as
1875an authentication key. It then waits for a connection and sends some data to
1876the client::
1877
1878 from multiprocessing.connection import Listener
1879 from array import array
1880
1881 address = ('localhost', 6000) # family is deduced to be 'AF_INET'
Senthil Kumaran79941b52010-10-10 06:13:49 +00001882 listener = Listener(address, authkey=b'secret password')
Benjamin Petersone711caf2008-06-11 16:44:04 +00001883
1884 conn = listener.accept()
Georg Brandl49702152008-09-29 06:43:45 +00001885 print('connection accepted from', listener.last_accepted)
Benjamin Petersone711caf2008-06-11 16:44:04 +00001886
1887 conn.send([2.25, None, 'junk', float])
1888
Senthil Kumaran79941b52010-10-10 06:13:49 +00001889 conn.send_bytes(b'hello')
Benjamin Petersone711caf2008-06-11 16:44:04 +00001890
1891 conn.send_bytes(array('i', [42, 1729]))
1892
1893 conn.close()
1894 listener.close()
1895
1896The following code connects to the server and receives some data from the
1897server::
1898
1899 from multiprocessing.connection import Client
1900 from array import array
1901
1902 address = ('localhost', 6000)
Senthil Kumaran79941b52010-10-10 06:13:49 +00001903 conn = Client(address, authkey=b'secret password')
Benjamin Petersone711caf2008-06-11 16:44:04 +00001904
Georg Brandl49702152008-09-29 06:43:45 +00001905 print(conn.recv()) # => [2.25, None, 'junk', float]
Benjamin Petersone711caf2008-06-11 16:44:04 +00001906
Georg Brandl49702152008-09-29 06:43:45 +00001907 print(conn.recv_bytes()) # => 'hello'
Benjamin Petersone711caf2008-06-11 16:44:04 +00001908
1909 arr = array('i', [0, 0, 0, 0, 0])
Georg Brandl49702152008-09-29 06:43:45 +00001910 print(conn.recv_bytes_into(arr)) # => 8
1911 print(arr) # => array('i', [42, 1729, 0, 0, 0])
Benjamin Petersone711caf2008-06-11 16:44:04 +00001912
1913 conn.close()
1914
1915
1916.. _multiprocessing-address-formats:
1917
1918Address Formats
1919>>>>>>>>>>>>>>>
1920
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001921* An ``'AF_INET'`` address is a tuple of the form ``(hostname, port)`` where
Benjamin Petersone711caf2008-06-11 16:44:04 +00001922 *hostname* is a string and *port* is an integer.
1923
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001924* An ``'AF_UNIX'`` address is a string representing a filename on the
Benjamin Petersone711caf2008-06-11 16:44:04 +00001925 filesystem.
1926
1927* An ``'AF_PIPE'`` address is a string of the form
Benjamin Petersonda10d3b2009-01-01 00:23:30 +00001928 :samp:`r'\\\\.\\pipe\\{PipeName}'`. To use :func:`Client` to connect to a named
Georg Brandl1f01deb2009-01-03 22:47:39 +00001929 pipe on a remote computer called *ServerName* one should use an address of the
Benjamin Peterson28d88b42009-01-09 03:03:23 +00001930 form :samp:`r'\\\\{ServerName}\\pipe\\{PipeName}'` instead.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001931
1932Note that any string beginning with two backslashes is assumed by default to be
1933an ``'AF_PIPE'`` address rather than an ``'AF_UNIX'`` address.
1934
1935
1936.. _multiprocessing-auth-keys:
1937
1938Authentication keys
1939~~~~~~~~~~~~~~~~~~~
1940
1941When one uses :meth:`Connection.recv`, the data received is automatically
1942unpickled. Unfortunately unpickling data from an untrusted source is a security
1943risk. Therefore :class:`Listener` and :func:`Client` use the :mod:`hmac` module
1944to provide digest authentication.
1945
1946An authentication key is a string which can be thought of as a password: once a
1947connection is established both ends will demand proof that the other knows the
1948authentication key. (Demonstrating that both ends are using the same key does
1949**not** involve sending the key over the connection.)
1950
1951If authentication is requested but do authentication key is specified then the
Benjamin Petersona786b022008-08-25 21:05:21 +00001952return value of ``current_process().authkey`` is used (see
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00001953:class:`~multiprocessing.Process`). This value will automatically inherited by
1954any :class:`~multiprocessing.Process` object that the current process creates.
1955This means that (by default) all processes of a multi-process program will share
1956a single authentication key which can be used when setting up connections
Benjamin Petersond23f8222009-04-05 19:13:16 +00001957between themselves.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001958
1959Suitable authentication keys can also be generated by using :func:`os.urandom`.
1960
1961
1962Logging
1963~~~~~~~
1964
1965Some support for logging is available. Note, however, that the :mod:`logging`
1966package does not use process shared locks so it is possible (depending on the
1967handler type) for messages from different processes to get mixed up.
1968
1969.. currentmodule:: multiprocessing
1970.. function:: get_logger()
1971
1972 Returns the logger used by :mod:`multiprocessing`. If necessary, a new one
1973 will be created.
1974
Jesse Noller41faa542009-01-25 03:45:53 +00001975 When first created the logger has level :data:`logging.NOTSET` and no
1976 default handler. Messages sent to this logger will not by default propagate
1977 to the root logger.
Benjamin Petersone711caf2008-06-11 16:44:04 +00001978
1979 Note that on Windows child processes will only inherit the level of the
1980 parent process's logger -- any other customization of the logger will not be
1981 inherited.
1982
Jesse Noller41faa542009-01-25 03:45:53 +00001983.. currentmodule:: multiprocessing
1984.. function:: log_to_stderr()
1985
1986 This function performs a call to :func:`get_logger` but in addition to
1987 returning the logger created by get_logger, it adds a handler which sends
1988 output to :data:`sys.stderr` using format
1989 ``'[%(levelname)s/%(processName)s] %(message)s'``.
1990
Benjamin Petersone711caf2008-06-11 16:44:04 +00001991Below is an example session with logging turned on::
1992
Benjamin Peterson206e3072008-10-19 14:07:49 +00001993 >>> import multiprocessing, logging
Jesse Noller41faa542009-01-25 03:45:53 +00001994 >>> logger = multiprocessing.log_to_stderr()
Benjamin Petersone711caf2008-06-11 16:44:04 +00001995 >>> logger.setLevel(logging.INFO)
1996 >>> logger.warning('doomed')
1997 [WARNING/MainProcess] doomed
Benjamin Peterson206e3072008-10-19 14:07:49 +00001998 >>> m = multiprocessing.Manager()
R. David Murray8e8099c2009-04-28 18:02:00 +00001999 [INFO/SyncManager-...] child process calling self.run()
2000 [INFO/SyncManager-...] created temp directory /.../pymp-...
2001 [INFO/SyncManager-...] manager serving at '/.../listener-...'
Benjamin Petersone711caf2008-06-11 16:44:04 +00002002 >>> del m
2003 [INFO/MainProcess] sending shutdown message to manager
R. David Murray8e8099c2009-04-28 18:02:00 +00002004 [INFO/SyncManager-...] manager exiting with exitcode 0
Benjamin Petersone711caf2008-06-11 16:44:04 +00002005
Jesse Noller41faa542009-01-25 03:45:53 +00002006In addition to having these two logging functions, the multiprocessing also
2007exposes two additional logging level attributes. These are :const:`SUBWARNING`
2008and :const:`SUBDEBUG`. The table below illustrates where theses fit in the
2009normal level hierarchy.
2010
2011+----------------+----------------+
2012| Level | Numeric value |
2013+================+================+
2014| ``SUBWARNING`` | 25 |
2015+----------------+----------------+
2016| ``SUBDEBUG`` | 5 |
2017+----------------+----------------+
2018
2019For a full table of logging levels, see the :mod:`logging` module.
2020
2021These additional logging levels are used primarily for certain debug messages
2022within the multiprocessing module. Below is the same example as above, except
2023with :const:`SUBDEBUG` enabled::
2024
2025 >>> import multiprocessing, logging
2026 >>> logger = multiprocessing.log_to_stderr()
2027 >>> logger.setLevel(multiprocessing.SUBDEBUG)
2028 >>> logger.warning('doomed')
2029 [WARNING/MainProcess] doomed
2030 >>> m = multiprocessing.Manager()
R. David Murray8e8099c2009-04-28 18:02:00 +00002031 [INFO/SyncManager-...] child process calling self.run()
2032 [INFO/SyncManager-...] created temp directory /.../pymp-...
2033 [INFO/SyncManager-...] manager serving at '/.../pymp-djGBXN/listener-...'
Jesse Noller41faa542009-01-25 03:45:53 +00002034 >>> del m
2035 [SUBDEBUG/MainProcess] finalizer calling ...
2036 [INFO/MainProcess] sending shutdown message to manager
R. David Murray8e8099c2009-04-28 18:02:00 +00002037 [DEBUG/SyncManager-...] manager received shutdown message
2038 [SUBDEBUG/SyncManager-...] calling <Finalize object, callback=unlink, ...
2039 [SUBDEBUG/SyncManager-...] finalizer calling <built-in function unlink> ...
2040 [SUBDEBUG/SyncManager-...] calling <Finalize object, dead>
2041 [SUBDEBUG/SyncManager-...] finalizer calling <function rmtree at 0x5aa730> ...
2042 [INFO/SyncManager-...] manager exiting with exitcode 0
Benjamin Petersone711caf2008-06-11 16:44:04 +00002043
2044The :mod:`multiprocessing.dummy` module
2045~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2046
2047.. module:: multiprocessing.dummy
2048 :synopsis: Dumb wrapper around threading.
2049
2050:mod:`multiprocessing.dummy` replicates the API of :mod:`multiprocessing` but is
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00002051no more than a wrapper around the :mod:`threading` module.
Benjamin Petersone711caf2008-06-11 16:44:04 +00002052
2053
2054.. _multiprocessing-programming:
2055
2056Programming guidelines
2057----------------------
2058
2059There are certain guidelines and idioms which should be adhered to when using
2060:mod:`multiprocessing`.
2061
2062
2063All platforms
2064~~~~~~~~~~~~~
2065
2066Avoid shared state
2067
2068 As far as possible one should try to avoid shifting large amounts of data
2069 between processes.
2070
2071 It is probably best to stick to using queues or pipes for communication
2072 between processes rather than using the lower level synchronization
2073 primitives from the :mod:`threading` module.
2074
2075Picklability
2076
2077 Ensure that the arguments to the methods of proxies are picklable.
2078
2079Thread safety of proxies
2080
2081 Do not use a proxy object from more than one thread unless you protect it
2082 with a lock.
2083
2084 (There is never a problem with different processes using the *same* proxy.)
2085
2086Joining zombie processes
2087
2088 On Unix when a process finishes but has not been joined it becomes a zombie.
2089 There should never be very many because each time a new process starts (or
2090 :func:`active_children` is called) all completed processes which have not
2091 yet been joined will be joined. Also calling a finished process's
2092 :meth:`Process.is_alive` will join the process. Even so it is probably good
2093 practice to explicitly join all the processes that you start.
2094
2095Better to inherit than pickle/unpickle
2096
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00002097 On Windows many types from :mod:`multiprocessing` need to be picklable so
Benjamin Petersone711caf2008-06-11 16:44:04 +00002098 that child processes can use them. However, one should generally avoid
2099 sending shared objects to other processes using pipes or queues. Instead
Eli Benderskyd08effe2011-12-31 07:20:26 +02002100 you should arrange the program so that a process which needs access to a
Benjamin Petersone711caf2008-06-11 16:44:04 +00002101 shared resource created elsewhere can inherit it from an ancestor process.
2102
2103Avoid terminating processes
2104
2105 Using the :meth:`Process.terminate` method to stop a process is liable to
2106 cause any shared resources (such as locks, semaphores, pipes and queues)
2107 currently being used by the process to become broken or unavailable to other
2108 processes.
2109
2110 Therefore it is probably best to only consider using
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00002111 :meth:`Process.terminate` on processes which never use any shared resources.
Benjamin Petersone711caf2008-06-11 16:44:04 +00002112
2113Joining processes that use queues
2114
2115 Bear in mind that a process that has put items in a queue will wait before
2116 terminating until all the buffered items are fed by the "feeder" thread to
2117 the underlying pipe. (The child process can call the
Benjamin Petersonae5360b2008-09-08 23:05:23 +00002118 :meth:`Queue.cancel_join_thread` method of the queue to avoid this behaviour.)
Benjamin Petersone711caf2008-06-11 16:44:04 +00002119
2120 This means that whenever you use a queue you need to make sure that all
2121 items which have been put on the queue will eventually be removed before the
2122 process is joined. Otherwise you cannot be sure that processes which have
2123 put items on the queue will terminate. Remember also that non-daemonic
2124 processes will be automatically be joined.
2125
2126 An example which will deadlock is the following::
2127
2128 from multiprocessing import Process, Queue
2129
2130 def f(q):
2131 q.put('X' * 1000000)
2132
2133 if __name__ == '__main__':
2134 queue = Queue()
2135 p = Process(target=f, args=(queue,))
2136 p.start()
2137 p.join() # this deadlocks
2138 obj = queue.get()
2139
2140 A fix here would be to swap the last two lines round (or simply remove the
2141 ``p.join()`` line).
2142
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00002143Explicitly pass resources to child processes
Benjamin Petersone711caf2008-06-11 16:44:04 +00002144
2145 On Unix a child process can make use of a shared resource created in a
2146 parent process using a global resource. However, it is better to pass the
2147 object as an argument to the constructor for the child process.
2148
2149 Apart from making the code (potentially) compatible with Windows this also
2150 ensures that as long as the child process is still alive the object will not
2151 be garbage collected in the parent process. This might be important if some
2152 resource is freed when the object is garbage collected in the parent
2153 process.
2154
2155 So for instance ::
2156
2157 from multiprocessing import Process, Lock
2158
2159 def f():
2160 ... do something using "lock" ...
2161
2162 if __name__ == '__main__':
2163 lock = Lock()
2164 for i in range(10):
2165 Process(target=f).start()
2166
2167 should be rewritten as ::
2168
2169 from multiprocessing import Process, Lock
2170
2171 def f(l):
2172 ... do something using "l" ...
2173
2174 if __name__ == '__main__':
2175 lock = Lock()
2176 for i in range(10):
2177 Process(target=f, args=(lock,)).start()
2178
Eli Benderskyd08effe2011-12-31 07:20:26 +02002179Beware of replacing :data:`sys.stdin` with a "file like object"
Alexandre Vassalottic57a84f2009-07-17 12:07:01 +00002180
2181 :mod:`multiprocessing` originally unconditionally called::
2182
2183 os.close(sys.stdin.fileno())
2184
2185 in the :meth:`multiprocessing.Process._bootstrap` method --- this resulted
2186 in issues with processes-in-processes. This has been changed to::
2187
2188 sys.stdin.close()
2189 sys.stdin = open(os.devnull)
2190
2191 Which solves the fundamental issue of processes colliding with each other
2192 resulting in a bad file descriptor error, but introduces a potential danger
2193 to applications which replace :func:`sys.stdin` with a "file-like object"
2194 with output buffering. This danger is that if multiple processes call
2195 :func:`close()` on this file-like object, it could result in the same
2196 data being flushed to the object multiple times, resulting in corruption.
2197
2198 If you write a file-like object and implement your own caching, you can
2199 make it fork-safe by storing the pid whenever you append to the cache,
2200 and discarding the cache when the pid changes. For example::
2201
2202 @property
2203 def cache(self):
2204 pid = os.getpid()
2205 if pid != self._pid:
2206 self._pid = pid
2207 self._cache = []
2208 return self._cache
2209
2210 For more information, see :issue:`5155`, :issue:`5313` and :issue:`5331`
Benjamin Petersone711caf2008-06-11 16:44:04 +00002211
2212Windows
2213~~~~~~~
2214
2215Since Windows lacks :func:`os.fork` it has a few extra restrictions:
2216
2217More picklability
2218
2219 Ensure that all arguments to :meth:`Process.__init__` are picklable. This
2220 means, in particular, that bound or unbound methods cannot be used directly
2221 as the ``target`` argument on Windows --- just define a function and use
2222 that instead.
2223
2224 Also, if you subclass :class:`Process` then make sure that instances will be
2225 picklable when the :meth:`Process.start` method is called.
2226
2227Global variables
2228
2229 Bear in mind that if code run in a child process tries to access a global
2230 variable, then the value it sees (if any) may not be the same as the value
2231 in the parent process at the time that :meth:`Process.start` was called.
2232
2233 However, global variables which are just module level constants cause no
2234 problems.
2235
2236Safe importing of main module
2237
2238 Make sure that the main module can be safely imported by a new Python
2239 interpreter without causing unintended side effects (such a starting a new
2240 process).
2241
2242 For example, under Windows running the following module would fail with a
2243 :exc:`RuntimeError`::
2244
2245 from multiprocessing import Process
2246
2247 def foo():
Georg Brandl49702152008-09-29 06:43:45 +00002248 print('hello')
Benjamin Petersone711caf2008-06-11 16:44:04 +00002249
2250 p = Process(target=foo)
2251 p.start()
2252
2253 Instead one should protect the "entry point" of the program by using ``if
2254 __name__ == '__main__':`` as follows::
2255
2256 from multiprocessing import Process, freeze_support
2257
2258 def foo():
Georg Brandl49702152008-09-29 06:43:45 +00002259 print('hello')
Benjamin Petersone711caf2008-06-11 16:44:04 +00002260
2261 if __name__ == '__main__':
2262 freeze_support()
2263 p = Process(target=foo)
2264 p.start()
2265
Benjamin Peterson5289b2b2008-06-28 00:40:54 +00002266 (The ``freeze_support()`` line can be omitted if the program will be run
Benjamin Petersone711caf2008-06-11 16:44:04 +00002267 normally instead of frozen.)
2268
2269 This allows the newly spawned Python interpreter to safely import the module
2270 and then run the module's ``foo()`` function.
2271
2272 Similar restrictions apply if a pool or manager is created in the main
2273 module.
2274
2275
2276.. _multiprocessing-examples:
2277
2278Examples
2279--------
2280
2281Demonstration of how to create and use customized managers and proxies:
2282
2283.. literalinclude:: ../includes/mp_newtype.py
2284
2285
2286Using :class:`Pool`:
2287
2288.. literalinclude:: ../includes/mp_pool.py
2289
2290
2291Synchronization types like locks, conditions and queues:
2292
2293.. literalinclude:: ../includes/mp_synchronize.py
2294
2295
Georg Brandl0b37b332010-09-03 22:49:27 +00002296An example showing how to use queues to feed tasks to a collection of worker
Eli Benderskyd08effe2011-12-31 07:20:26 +02002297processes and collect the results:
Benjamin Petersone711caf2008-06-11 16:44:04 +00002298
2299.. literalinclude:: ../includes/mp_workers.py
2300
2301
2302An example of how a pool of worker processes can each run a
Georg Brandl47d48bb2010-07-10 11:51:06 +00002303:class:`~http.server.SimpleHTTPRequestHandler` instance while sharing a single
2304listening socket.
Benjamin Petersone711caf2008-06-11 16:44:04 +00002305
2306.. literalinclude:: ../includes/mp_webserver.py
2307
2308
2309Some simple benchmarks comparing :mod:`multiprocessing` with :mod:`threading`:
2310
2311.. literalinclude:: ../includes/mp_benchmarks.py
2312