| Antoine Pitrou | 64a467d | 2010-12-12 20:34:49 +0000 | [diff] [blame] | 1 | :mod:`multiprocessing` --- Process-based parallelism | 
|  | 2 | ==================================================== | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 3 |  | 
|  | 4 | .. module:: multiprocessing | 
| Antoine Pitrou | 64a467d | 2010-12-12 20:34:49 +0000 | [diff] [blame] | 5 | :synopsis: Process-based parallelism. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 6 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 7 |  | 
|  | 8 | Introduction | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 9 | ------------ | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 10 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 11 | :mod:`multiprocessing` is a package that supports spawning processes using an | 
|  | 12 | API similar to the :mod:`threading` module.  The :mod:`multiprocessing` package | 
|  | 13 | offers both local and remote concurrency, effectively side-stepping the | 
|  | 14 | :term:`Global Interpreter Lock` by using subprocesses instead of threads.  Due | 
|  | 15 | to this, the :mod:`multiprocessing` module allows the programmer to fully | 
|  | 16 | leverage multiple processors on a given machine.  It runs on both Unix and | 
|  | 17 | Windows. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 18 |  | 
| Raymond Hettinger | fd15191 | 2010-11-04 03:02:56 +0000 | [diff] [blame] | 19 | .. note:: | 
| Benjamin Peterson | e5384b0 | 2008-10-04 22:00:42 +0000 | [diff] [blame] | 20 |  | 
|  | 21 | Some of this package's functionality requires a functioning shared semaphore | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 22 | 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 Peterson | e5384b0 | 2008-10-04 22:00:42 +0000 | [diff] [blame] | 25 | :issue:`3770` for additional information. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 26 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 27 | .. note:: | 
|  | 28 |  | 
| Ezio Melotti | 2ee8835 | 2011-04-29 07:10:24 +0300 | [diff] [blame] | 29 | Functionality within this package requires that the ``__main__`` module be | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 30 | 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 | 
| R David Murray | ace5162 | 2012-10-06 22:26:52 -0400 | [diff] [blame] | 32 | as the :class:`multiprocessing.pool.Pool` examples will not work in the | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 33 | interactive interpreter. For example:: | 
|  | 34 |  | 
|  | 35 | >>> from multiprocessing import Pool | 
|  | 36 | >>> p = Pool(5) | 
|  | 37 | >>> def f(x): | 
| Georg Brandl | a1c6a1c | 2009-01-03 21:26:05 +0000 | [diff] [blame] | 38 | ...     return x*x | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 39 | ... | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 40 | >>> p.map(f, [1,2,3]) | 
|  | 41 | Process PoolWorker-1: | 
|  | 42 | Process PoolWorker-2: | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 43 | Process PoolWorker-3: | 
|  | 44 | Traceback (most recent call last): | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 45 | 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 Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 51 | (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 Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 55 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 56 | The :class:`Process` class | 
|  | 57 | ~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 58 |  | 
|  | 59 | In :mod:`multiprocessing`, processes are spawned by creating a :class:`Process` | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 60 | object and then calling its :meth:`~Process.start` method.  :class:`Process` | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 61 | follows the API of :class:`threading.Thread`.  A trivial example of a | 
|  | 62 | multiprocess program is :: | 
|  | 63 |  | 
| Georg Brandl | b3959bd | 2010-04-08 06:33:16 +0000 | [diff] [blame] | 64 | from multiprocessing import Process | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 65 |  | 
|  | 66 | def f(name): | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 67 | print('hello', name) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 68 |  | 
| Georg Brandl | b3959bd | 2010-04-08 06:33:16 +0000 | [diff] [blame] | 69 | if __name__ == '__main__': | 
|  | 70 | p = Process(target=f, args=('bob',)) | 
|  | 71 | p.start() | 
|  | 72 | p.join() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 73 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 74 | To 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 Melotti | 985e24d | 2009-09-13 07:54:02 +0000 | [diff] [blame] | 80 | print(title) | 
|  | 81 | print('module name:', __name__) | 
| Georg Brandl | 29feb1f | 2012-07-01 09:47:54 +0200 | [diff] [blame] | 82 | if hasattr(os, 'getppid'):  # only available on Unix | 
|  | 83 | print('parent process:', os.getppid()) | 
| Ezio Melotti | 985e24d | 2009-09-13 07:54:02 +0000 | [diff] [blame] | 84 | print('process id:', os.getpid()) | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 85 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 86 | def f(name): | 
|  | 87 | info('function f') | 
| Ezio Melotti | 985e24d | 2009-09-13 07:54:02 +0000 | [diff] [blame] | 88 | print('hello', name) | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 89 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 90 | if __name__ == '__main__': | 
|  | 91 | info('main line') | 
|  | 92 | p = Process(target=f, args=('bob',)) | 
|  | 93 | p.start() | 
|  | 94 | p.join() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 95 |  | 
|  | 96 | For an explanation of why (on Windows) the ``if __name__ == '__main__'`` part is | 
|  | 97 | necessary, see :ref:`multiprocessing-programming`. | 
|  | 98 |  | 
|  | 99 |  | 
|  | 100 |  | 
|  | 101 | Exchanging objects between processes | 
|  | 102 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 103 |  | 
|  | 104 | :mod:`multiprocessing` supports two types of communication channel between | 
|  | 105 | processes: | 
|  | 106 |  | 
|  | 107 | **Queues** | 
|  | 108 |  | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 109 | The :class:`Queue` class is a near clone of :class:`queue.Queue`.  For | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 110 | example:: | 
|  | 111 |  | 
|  | 112 | from multiprocessing import Process, Queue | 
|  | 113 |  | 
|  | 114 | def f(q): | 
|  | 115 | q.put([42, None, 'hello']) | 
|  | 116 |  | 
| Georg Brandl | 1f01deb | 2009-01-03 22:47:39 +0000 | [diff] [blame] | 117 | if __name__ == '__main__': | 
|  | 118 | q = Queue() | 
|  | 119 | p = Process(target=f, args=(q,)) | 
|  | 120 | p.start() | 
|  | 121 | print(q.get())    # prints "[42, None, 'hello']" | 
|  | 122 | p.join() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 123 |  | 
| Antoine Pitrou | fc6accc | 2012-05-18 13:57:04 +0200 | [diff] [blame] | 124 | Queues are thread and process safe. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 125 |  | 
|  | 126 | **Pipes** | 
|  | 127 |  | 
|  | 128 | The :func:`Pipe` function returns a pair of connection objects connected by a | 
|  | 129 | pipe which by default is duplex (two-way).  For example:: | 
|  | 130 |  | 
|  | 131 | from multiprocessing import Process, Pipe | 
|  | 132 |  | 
|  | 133 | def f(conn): | 
|  | 134 | conn.send([42, None, 'hello']) | 
|  | 135 | conn.close() | 
|  | 136 |  | 
|  | 137 | if __name__ == '__main__': | 
|  | 138 | parent_conn, child_conn = Pipe() | 
|  | 139 | p = Process(target=f, args=(child_conn,)) | 
|  | 140 | p.start() | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 141 | print(parent_conn.recv())   # prints "[42, None, 'hello']" | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 142 | p.join() | 
|  | 143 |  | 
|  | 144 | The two connection objects returned by :func:`Pipe` represent the two ends of | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 145 | the pipe.  Each connection object has :meth:`~Connection.send` and | 
|  | 146 | :meth:`~Connection.recv` methods (among others).  Note that data in a pipe | 
|  | 147 | may become corrupted if two processes (or threads) try to read from or write | 
|  | 148 | to the *same* end of the pipe at the same time.  Of course there is no risk | 
|  | 149 | of corruption from processes using different ends of the pipe at the same | 
|  | 150 | time. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 151 |  | 
|  | 152 |  | 
|  | 153 | Synchronization between processes | 
|  | 154 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 155 |  | 
|  | 156 | :mod:`multiprocessing` contains equivalents of all the synchronization | 
|  | 157 | primitives from :mod:`threading`.  For instance one can use a lock to ensure | 
|  | 158 | that only one process prints to standard output at a time:: | 
|  | 159 |  | 
|  | 160 | from multiprocessing import Process, Lock | 
|  | 161 |  | 
|  | 162 | def f(l, i): | 
|  | 163 | l.acquire() | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 164 | print('hello world', i) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 165 | l.release() | 
|  | 166 |  | 
|  | 167 | if __name__ == '__main__': | 
|  | 168 | lock = Lock() | 
|  | 169 |  | 
|  | 170 | for num in range(10): | 
|  | 171 | Process(target=f, args=(lock, num)).start() | 
|  | 172 |  | 
|  | 173 | Without using the lock output from the different processes is liable to get all | 
|  | 174 | mixed up. | 
|  | 175 |  | 
|  | 176 |  | 
|  | 177 | Sharing state between processes | 
|  | 178 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 179 |  | 
|  | 180 | As mentioned above, when doing concurrent programming it is usually best to | 
|  | 181 | avoid using shared state as far as possible.  This is particularly true when | 
|  | 182 | using multiple processes. | 
|  | 183 |  | 
|  | 184 | However, if you really do need to use some shared data then | 
|  | 185 | :mod:`multiprocessing` provides a couple of ways of doing so. | 
|  | 186 |  | 
|  | 187 | **Shared memory** | 
|  | 188 |  | 
|  | 189 | Data can be stored in a shared memory map using :class:`Value` or | 
|  | 190 | :class:`Array`.  For example, the following code :: | 
|  | 191 |  | 
|  | 192 | from multiprocessing import Process, Value, Array | 
|  | 193 |  | 
|  | 194 | def f(n, a): | 
|  | 195 | n.value = 3.1415927 | 
|  | 196 | for i in range(len(a)): | 
|  | 197 | a[i] = -a[i] | 
|  | 198 |  | 
|  | 199 | if __name__ == '__main__': | 
|  | 200 | num = Value('d', 0.0) | 
|  | 201 | arr = Array('i', range(10)) | 
|  | 202 |  | 
|  | 203 | p = Process(target=f, args=(num, arr)) | 
|  | 204 | p.start() | 
|  | 205 | p.join() | 
|  | 206 |  | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 207 | print(num.value) | 
|  | 208 | print(arr[:]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 209 |  | 
|  | 210 | will print :: | 
|  | 211 |  | 
|  | 212 | 3.1415927 | 
|  | 213 | [0, -1, -2, -3, -4, -5, -6, -7, -8, -9] | 
|  | 214 |  | 
|  | 215 | The ``'d'`` and ``'i'`` arguments used when creating ``num`` and ``arr`` are | 
|  | 216 | typecodes of the kind used by the :mod:`array` module: ``'d'`` indicates a | 
| Georg Brandl | 2ee470f | 2008-07-16 12:55:28 +0000 | [diff] [blame] | 217 | double precision float and ``'i'`` indicates a signed integer.  These shared | 
| Georg Brandl | f285bcc | 2010-10-19 21:07:16 +0000 | [diff] [blame] | 218 | objects will be process and thread-safe. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 219 |  | 
|  | 220 | For more flexibility in using shared memory one can use the | 
|  | 221 | :mod:`multiprocessing.sharedctypes` module which supports the creation of | 
|  | 222 | arbitrary ctypes objects allocated from shared memory. | 
|  | 223 |  | 
|  | 224 | **Server process** | 
|  | 225 |  | 
|  | 226 | A manager object returned by :func:`Manager` controls a server process which | 
| Georg Brandl | 2ee470f | 2008-07-16 12:55:28 +0000 | [diff] [blame] | 227 | holds Python objects and allows other processes to manipulate them using | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 228 | proxies. | 
|  | 229 |  | 
| Richard Oudkerk | 3730a17 | 2012-06-15 18:26:07 +0100 | [diff] [blame] | 230 | A manager returned by :func:`Manager` will support types | 
|  | 231 | :class:`list`, :class:`dict`, :class:`Namespace`, :class:`Lock`, | 
|  | 232 | :class:`RLock`, :class:`Semaphore`, :class:`BoundedSemaphore`, | 
|  | 233 | :class:`Condition`, :class:`Event`, :class:`Barrier`, | 
|  | 234 | :class:`Queue`, :class:`Value` and :class:`Array`.  For example, :: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 235 |  | 
|  | 236 | from multiprocessing import Process, Manager | 
|  | 237 |  | 
|  | 238 | def f(d, l): | 
|  | 239 | d[1] = '1' | 
|  | 240 | d['2'] = 2 | 
|  | 241 | d[0.25] = None | 
|  | 242 | l.reverse() | 
|  | 243 |  | 
|  | 244 | if __name__ == '__main__': | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 245 | with Manager() as manager: | 
|  | 246 | d = manager.dict() | 
|  | 247 | l = manager.list(range(10)) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 248 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 249 | p = Process(target=f, args=(d, l)) | 
|  | 250 | p.start() | 
|  | 251 | p.join() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 252 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 253 | print(d) | 
|  | 254 | print(l) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 255 |  | 
|  | 256 | will print :: | 
|  | 257 |  | 
|  | 258 | {0.25: None, 1: '1', '2': 2} | 
|  | 259 | [9, 8, 7, 6, 5, 4, 3, 2, 1, 0] | 
|  | 260 |  | 
|  | 261 | Server process managers are more flexible than using shared memory objects | 
|  | 262 | because they can be made to support arbitrary object types.  Also, a single | 
|  | 263 | manager can be shared by processes on different computers over a network. | 
|  | 264 | They are, however, slower than using shared memory. | 
|  | 265 |  | 
|  | 266 |  | 
|  | 267 | Using a pool of workers | 
|  | 268 | ~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 269 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 270 | The :class:`~multiprocessing.pool.Pool` class represents a pool of worker | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 271 | processes.  It has methods which allows tasks to be offloaded to the worker | 
|  | 272 | processes in a few different ways. | 
|  | 273 |  | 
|  | 274 | For example:: | 
|  | 275 |  | 
|  | 276 | from multiprocessing import Pool | 
|  | 277 |  | 
|  | 278 | def f(x): | 
|  | 279 | return x*x | 
|  | 280 |  | 
|  | 281 | if __name__ == '__main__': | 
| Andrew Svetlov | 23089ab | 2012-11-20 16:12:38 +0200 | [diff] [blame] | 282 | with Pool(processes=4) as pool:        # start 4 worker processes | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 283 | result = pool.apply_async(f, [10]) # evaluate "f(10)" asynchronously | 
|  | 284 | print(result.get(timeout=1))       # prints "100" unless your computer is *very* slow | 
|  | 285 | print(pool.map(f, range(10)))      # prints "[0, 1, 4,..., 81]" | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 286 |  | 
| Richard Oudkerk | b3c4b98 | 2013-07-02 12:32:00 +0100 | [diff] [blame] | 287 | Note that the methods of a pool should only ever be used by the | 
|  | 288 | process which created it. | 
|  | 289 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 290 |  | 
|  | 291 | Reference | 
|  | 292 | --------- | 
|  | 293 |  | 
|  | 294 | The :mod:`multiprocessing` package mostly replicates the API of the | 
|  | 295 | :mod:`threading` module. | 
|  | 296 |  | 
|  | 297 |  | 
|  | 298 | :class:`Process` and exceptions | 
|  | 299 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 300 |  | 
| Ezio Melotti | 8429b67 | 2012-09-14 06:35:09 +0300 | [diff] [blame] | 301 | .. class:: Process(group=None, target=None, name=None, args=(), kwargs={}, \ | 
|  | 302 | *, daemon=None) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 303 |  | 
|  | 304 | Process objects represent activity that is run in a separate process. The | 
|  | 305 | :class:`Process` class has equivalents of all the methods of | 
|  | 306 | :class:`threading.Thread`. | 
|  | 307 |  | 
|  | 308 | The constructor should always be called with keyword arguments. *group* | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 309 | should always be ``None``; it exists solely for compatibility with | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 310 | :class:`threading.Thread`.  *target* is the callable object to be invoked by | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 311 | the :meth:`run()` method.  It defaults to ``None``, meaning nothing is | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 312 | called. *name* is the process name (see :attr:`name` for more details). | 
|  | 313 | *args* is the argument tuple for the target invocation.  *kwargs* is a | 
|  | 314 | dictionary of keyword arguments for the target invocation.  If provided, | 
|  | 315 | the keyword-only *daemon* argument sets the process :attr:`daemon` flag | 
|  | 316 | to ``True`` or ``False``.  If ``None`` (the default), this flag will be | 
|  | 317 | inherited from the creating process. | 
| Antoine Pitrou | 0bd4deb | 2011-02-25 22:07:43 +0000 | [diff] [blame] | 318 |  | 
|  | 319 | By default, no arguments are passed to *target*. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 320 |  | 
|  | 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 Pitrou | 0bd4deb | 2011-02-25 22:07:43 +0000 | [diff] [blame] | 325 | .. versionchanged:: 3.3 | 
|  | 326 | Added the *daemon* argument. | 
|  | 327 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 328 | .. 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 Natali | acd9f7c | 2011-07-25 18:35:49 +0200 | [diff] [blame] | 346 | 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 Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 349 |  | 
|  | 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 Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 355 | .. attribute:: name | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 356 |  | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 357 | The process's name.  The name is a string used for identification purposes | 
|  | 358 | only.  It has no semantics.  Multiple processes may be given the same | 
|  | 359 | name. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 360 |  | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 361 | The initial name is set by the constructor.  If no explicit name is | 
|  | 362 | provided to the constructor, a name of the form | 
|  | 363 | 'Process-N\ :sub:`1`:N\ :sub:`2`:...:N\ :sub:`k`' is constructed, where | 
|  | 364 | each N\ :sub:`k` is the N-th child of its parent. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 365 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 366 | .. method:: is_alive | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 367 |  | 
|  | 368 | Return whether the process is alive. | 
|  | 369 |  | 
|  | 370 | Roughly, a process object is alive from the moment the :meth:`start` | 
|  | 371 | method returns until the child process terminates. | 
|  | 372 |  | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 373 | .. attribute:: daemon | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 374 |  | 
| Benjamin Peterson | da10d3b | 2009-01-01 00:23:30 +0000 | [diff] [blame] | 375 | The process's daemon flag, a Boolean value.  This must be set before | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 376 | :meth:`start` is called. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 377 |  | 
|  | 378 | The initial value is inherited from the creating process. | 
|  | 379 |  | 
|  | 380 | When a process exits, it attempts to terminate all of its daemonic child | 
|  | 381 | processes. | 
|  | 382 |  | 
|  | 383 | Note that a daemonic process is not allowed to create child processes. | 
|  | 384 | Otherwise a daemonic process would leave its children orphaned if it gets | 
| Alexandre Vassalotti | 260484d | 2009-07-17 11:43:26 +0000 | [diff] [blame] | 385 | terminated when its parent process exits. Additionally, these are **not** | 
|  | 386 | Unix daemons or services, they are normal processes that will be | 
| Georg Brandl | 6faee4e | 2010-09-21 14:48:28 +0000 | [diff] [blame] | 387 | terminated (and not joined) if non-daemonic processes have exited. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 388 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 389 | In addition to the  :class:`threading.Thread` API, :class:`Process` objects | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 390 | also support the following attributes and methods: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 391 |  | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 392 | .. attribute:: pid | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 393 |  | 
|  | 394 | Return the process ID.  Before the process is spawned, this will be | 
|  | 395 | ``None``. | 
|  | 396 |  | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 397 | .. attribute:: exitcode | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 398 |  | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 399 | The child's exit code.  This will be ``None`` if the process has not yet | 
|  | 400 | terminated.  A negative value *-N* indicates that the child was terminated | 
|  | 401 | by signal *N*. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 402 |  | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 403 | .. attribute:: authkey | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 404 |  | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 405 | The process's authentication key (a byte string). | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 406 |  | 
|  | 407 | When :mod:`multiprocessing` is initialized the main process is assigned a | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 408 | random string using :func:`os.urandom`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 409 |  | 
|  | 410 | When a :class:`Process` object is created, it will inherit the | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 411 | authentication key of its parent process, although this may be changed by | 
|  | 412 | setting :attr:`authkey` to another byte string. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 413 |  | 
|  | 414 | See :ref:`multiprocessing-auth-keys`. | 
|  | 415 |  | 
| Antoine Pitrou | 176f07d | 2011-06-06 19:35:31 +0200 | [diff] [blame] | 416 | .. attribute:: sentinel | 
|  | 417 |  | 
|  | 418 | A numeric handle of a system object which will become "ready" when | 
|  | 419 | the process ends. | 
|  | 420 |  | 
| Antoine Pitrou | bdb1cf1 | 2012-03-05 19:28:37 +0100 | [diff] [blame] | 421 | You can use this value if you want to wait on several events at | 
|  | 422 | once using :func:`multiprocessing.connection.wait`.  Otherwise | 
|  | 423 | calling :meth:`join()` is simpler. | 
|  | 424 |  | 
| Antoine Pitrou | 176f07d | 2011-06-06 19:35:31 +0200 | [diff] [blame] | 425 | On Windows, this is an OS handle usable with the ``WaitForSingleObject`` | 
|  | 426 | and ``WaitForMultipleObjects`` family of API calls.  On Unix, this is | 
|  | 427 | a file descriptor usable with primitives from the :mod:`select` module. | 
|  | 428 |  | 
| Antoine Pitrou | 176f07d | 2011-06-06 19:35:31 +0200 | [diff] [blame] | 429 | .. versionadded:: 3.3 | 
|  | 430 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 431 | .. method:: terminate() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 432 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 433 | Terminate the process.  On Unix this is done using the ``SIGTERM`` signal; | 
| Georg Brandl | 60203b4 | 2010-10-06 10:11:56 +0000 | [diff] [blame] | 434 | on Windows :c:func:`TerminateProcess` is used.  Note that exit handlers and | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 435 | finally clauses, etc., will not be executed. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 436 |  | 
|  | 437 | Note that descendant processes of the process will *not* be terminated -- | 
|  | 438 | they will simply become orphaned. | 
|  | 439 |  | 
|  | 440 | .. warning:: | 
|  | 441 |  | 
|  | 442 | If this method is used when the associated process is using a pipe or | 
|  | 443 | queue then the pipe or queue is liable to become corrupted and may | 
|  | 444 | become unusable by other process.  Similarly, if the process has | 
|  | 445 | acquired a lock or semaphore etc. then terminating it is liable to | 
|  | 446 | cause other processes to deadlock. | 
|  | 447 |  | 
| Ask Solem | ff7ffdd | 2010-11-09 21:52:33 +0000 | [diff] [blame] | 448 | Note that the :meth:`start`, :meth:`join`, :meth:`is_alive`, | 
| Richard Oudkerk | 64c25b4 | 2013-06-24 15:42:00 +0100 | [diff] [blame] | 449 | :meth:`terminate` and :attr:`exitcode` methods should only be called by | 
| Ask Solem | ff7ffdd | 2010-11-09 21:52:33 +0000 | [diff] [blame] | 450 | the process that created the process object. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 451 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 452 | Example usage of some of the methods of :class:`Process`: | 
|  | 453 |  | 
|  | 454 | .. doctest:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 455 |  | 
| Benjamin Peterson | 206e307 | 2008-10-19 14:07:49 +0000 | [diff] [blame] | 456 | >>> import multiprocessing, time, signal | 
|  | 457 | >>> p = multiprocessing.Process(target=time.sleep, args=(1000,)) | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 458 | >>> print(p, p.is_alive()) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 459 | <Process(Process-1, initial)> False | 
|  | 460 | >>> p.start() | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 461 | >>> print(p, p.is_alive()) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 462 | <Process(Process-1, started)> True | 
|  | 463 | >>> p.terminate() | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 464 | >>> time.sleep(0.1) | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 465 | >>> print(p, p.is_alive()) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 466 | <Process(Process-1, stopped[SIGTERM])> False | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 467 | >>> p.exitcode == -signal.SIGTERM | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 468 | True | 
|  | 469 |  | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 470 | .. exception:: ProcessError | 
|  | 471 |  | 
|  | 472 | The base class of all :mod:`multiprocessing` exceptions. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 473 |  | 
|  | 474 | .. exception:: BufferTooShort | 
|  | 475 |  | 
|  | 476 | Exception raised by :meth:`Connection.recv_bytes_into()` when the supplied | 
|  | 477 | buffer object is too small for the message read. | 
|  | 478 |  | 
|  | 479 | If ``e`` is an instance of :exc:`BufferTooShort` then ``e.args[0]`` will give | 
|  | 480 | the message as a byte string. | 
|  | 481 |  | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 482 | .. exception:: AuthenticationError | 
|  | 483 |  | 
|  | 484 | Raised when there is an authentication error. | 
|  | 485 |  | 
|  | 486 | .. exception:: TimeoutError | 
|  | 487 |  | 
|  | 488 | Raised by methods with a timeout when the timeout expires. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 489 |  | 
|  | 490 | Pipes and Queues | 
|  | 491 | ~~~~~~~~~~~~~~~~ | 
|  | 492 |  | 
|  | 493 | When using multiple processes, one generally uses message passing for | 
|  | 494 | communication between processes and avoids having to use any synchronization | 
|  | 495 | primitives like locks. | 
|  | 496 |  | 
|  | 497 | For passing messages one can use :func:`Pipe` (for a connection between two | 
|  | 498 | processes) or a queue (which allows multiple producers and consumers). | 
|  | 499 |  | 
| Sandro Tosi | cd77815 | 2012-02-15 23:27:00 +0100 | [diff] [blame] | 500 | The :class:`Queue`, :class:`SimpleQueue` and :class:`JoinableQueue` types are multi-producer, | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 501 | multi-consumer FIFO queues modelled on the :class:`queue.Queue` class in the | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 502 | standard library.  They differ in that :class:`Queue` lacks the | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 503 | :meth:`~queue.Queue.task_done` and :meth:`~queue.Queue.join` methods introduced | 
|  | 504 | into Python 2.5's :class:`queue.Queue` class. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 505 |  | 
|  | 506 | If you use :class:`JoinableQueue` then you **must** call | 
|  | 507 | :meth:`JoinableQueue.task_done` for each task removed from the queue or else the | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 508 | semaphore used to count the number of unfinished tasks may eventually overflow, | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 509 | raising an exception. | 
|  | 510 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 511 | Note that one can also create a shared queue by using a manager object -- see | 
|  | 512 | :ref:`multiprocessing-managers`. | 
|  | 513 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 514 | .. note:: | 
|  | 515 |  | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 516 | :mod:`multiprocessing` uses the usual :exc:`queue.Empty` and | 
|  | 517 | :exc:`queue.Full` exceptions to signal a timeout.  They are not available in | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 518 | the :mod:`multiprocessing` namespace so you need to import them from | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 519 | :mod:`queue`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 520 |  | 
| Richard Oudkerk | 95fe1a7 | 2013-06-24 14:48:07 +0100 | [diff] [blame] | 521 | .. note:: | 
|  | 522 |  | 
|  | 523 | When an object is put on a queue, the object is pickled and a | 
|  | 524 | background thread later flushes the pickled data to an underlying | 
|  | 525 | pipe.  This has some consequences which are a little surprising, | 
| Richard Oudkerk | 7b69da7 | 2013-06-24 18:12:57 +0100 | [diff] [blame] | 526 | but should not cause any practical difficulties -- if they really | 
|  | 527 | bother you then you can instead use a queue created with a | 
|  | 528 | :ref:`manager <multiprocessing-managers>`. | 
| Richard Oudkerk | 95fe1a7 | 2013-06-24 14:48:07 +0100 | [diff] [blame] | 529 |  | 
|  | 530 | (1) After putting an object on an empty queue there may be an | 
| Richard Oudkerk | 2b310dd | 2013-06-24 20:38:46 +0100 | [diff] [blame] | 531 | infinitesimal delay before the queue's :meth:`~Queue.empty` | 
| Richard Oudkerk | 95fe1a7 | 2013-06-24 14:48:07 +0100 | [diff] [blame] | 532 | method returns :const:`False` and :meth:`~Queue.get_nowait` can | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 533 | return without raising :exc:`queue.Empty`. | 
| Richard Oudkerk | 95fe1a7 | 2013-06-24 14:48:07 +0100 | [diff] [blame] | 534 |  | 
|  | 535 | (2) If multiple processes are enqueuing objects, it is possible for | 
|  | 536 | the objects to be received at the other end out-of-order. | 
|  | 537 | However, objects enqueued by the same process will always be in | 
|  | 538 | the expected order with respect to each other. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 539 |  | 
|  | 540 | .. warning:: | 
|  | 541 |  | 
|  | 542 | If a process is killed using :meth:`Process.terminate` or :func:`os.kill` | 
|  | 543 | while it is trying to use a :class:`Queue`, then the data in the queue is | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 544 | likely to become corrupted.  This may cause any other process to get an | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 545 | exception when it tries to use the queue later on. | 
|  | 546 |  | 
|  | 547 | .. warning:: | 
|  | 548 |  | 
|  | 549 | As mentioned above, if a child process has put items on a queue (and it has | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 550 | not used :meth:`JoinableQueue.cancel_join_thread | 
|  | 551 | <multiprocessing.Queue.cancel_join_thread>`), then that process will | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 552 | not terminate until all buffered items have been flushed to the pipe. | 
|  | 553 |  | 
|  | 554 | This means that if you try joining that process you may get a deadlock unless | 
|  | 555 | you are sure that all items which have been put on the queue have been | 
|  | 556 | consumed.  Similarly, if the child process is non-daemonic then the parent | 
| Georg Brandl | 2ee470f | 2008-07-16 12:55:28 +0000 | [diff] [blame] | 557 | process may hang on exit when it tries to join all its non-daemonic children. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 558 |  | 
|  | 559 | Note that a queue created using a manager does not have this issue.  See | 
|  | 560 | :ref:`multiprocessing-programming`. | 
|  | 561 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 562 | For an example of the usage of queues for interprocess communication see | 
|  | 563 | :ref:`multiprocessing-examples`. | 
|  | 564 |  | 
|  | 565 |  | 
|  | 566 | .. function:: Pipe([duplex]) | 
|  | 567 |  | 
|  | 568 | Returns a pair ``(conn1, conn2)`` of :class:`Connection` objects representing | 
|  | 569 | the ends of a pipe. | 
|  | 570 |  | 
|  | 571 | If *duplex* is ``True`` (the default) then the pipe is bidirectional.  If | 
|  | 572 | *duplex* is ``False`` then the pipe is unidirectional: ``conn1`` can only be | 
|  | 573 | used for receiving messages and ``conn2`` can only be used for sending | 
|  | 574 | messages. | 
|  | 575 |  | 
|  | 576 |  | 
|  | 577 | .. class:: Queue([maxsize]) | 
|  | 578 |  | 
|  | 579 | Returns a process shared queue implemented using a pipe and a few | 
|  | 580 | locks/semaphores.  When a process first puts an item on the queue a feeder | 
|  | 581 | thread is started which transfers objects from a buffer into the pipe. | 
|  | 582 |  | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 583 | The usual :exc:`queue.Empty` and :exc:`queue.Full` exceptions from the | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 584 | standard library's :mod:`queue` module are raised to signal timeouts. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 585 |  | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 586 | :class:`Queue` implements all the methods of :class:`queue.Queue` except for | 
|  | 587 | :meth:`~queue.Queue.task_done` and :meth:`~queue.Queue.join`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 588 |  | 
|  | 589 | .. method:: qsize() | 
|  | 590 |  | 
|  | 591 | Return the approximate size of the queue.  Because of | 
|  | 592 | multithreading/multiprocessing semantics, this number is not reliable. | 
|  | 593 |  | 
|  | 594 | Note that this may raise :exc:`NotImplementedError` on Unix platforms like | 
| Georg Brandl | c575c90 | 2008-09-13 17:46:05 +0000 | [diff] [blame] | 595 | Mac OS X where ``sem_getvalue()`` is not implemented. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 596 |  | 
|  | 597 | .. method:: empty() | 
|  | 598 |  | 
|  | 599 | Return ``True`` if the queue is empty, ``False`` otherwise.  Because of | 
|  | 600 | multithreading/multiprocessing semantics, this is not reliable. | 
|  | 601 |  | 
|  | 602 | .. method:: full() | 
|  | 603 |  | 
|  | 604 | Return ``True`` if the queue is full, ``False`` otherwise.  Because of | 
|  | 605 | multithreading/multiprocessing semantics, this is not reliable. | 
|  | 606 |  | 
| Senthil Kumaran | e969a21 | 2011-09-06 00:21:30 +0800 | [diff] [blame] | 607 | .. method:: put(obj[, block[, timeout]]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 608 |  | 
| Senthil Kumaran | e969a21 | 2011-09-06 00:21:30 +0800 | [diff] [blame] | 609 | Put obj into the queue.  If the optional argument *block* is ``True`` | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 610 | (the default) and *timeout* is ``None`` (the default), block if necessary until | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 611 | a free slot is available.  If *timeout* is a positive number, it blocks at | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 612 | most *timeout* seconds and raises the :exc:`queue.Full` exception if no | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 613 | free slot was available within that time.  Otherwise (*block* is | 
|  | 614 | ``False``), put an item on the queue if a free slot is immediately | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 615 | available, else raise the :exc:`queue.Full` exception (*timeout* is | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 616 | ignored in that case). | 
|  | 617 |  | 
| Senthil Kumaran | e969a21 | 2011-09-06 00:21:30 +0800 | [diff] [blame] | 618 | .. method:: put_nowait(obj) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 619 |  | 
| Senthil Kumaran | e969a21 | 2011-09-06 00:21:30 +0800 | [diff] [blame] | 620 | Equivalent to ``put(obj, False)``. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 621 |  | 
|  | 622 | .. method:: get([block[, timeout]]) | 
|  | 623 |  | 
|  | 624 | Remove and return an item from the queue.  If optional args *block* is | 
|  | 625 | ``True`` (the default) and *timeout* is ``None`` (the default), block if | 
|  | 626 | necessary until an item is available.  If *timeout* is a positive number, | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 627 | it blocks at most *timeout* seconds and raises the :exc:`queue.Empty` | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 628 | exception if no item was available within that time.  Otherwise (block is | 
|  | 629 | ``False``), return an item if one is immediately available, else raise the | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 630 | :exc:`queue.Empty` exception (*timeout* is ignored in that case). | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 631 |  | 
|  | 632 | .. method:: get_nowait() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 633 |  | 
|  | 634 | Equivalent to ``get(False)``. | 
|  | 635 |  | 
|  | 636 | :class:`multiprocessing.Queue` has a few additional methods not found in | 
| Georg Brandl | 2ee470f | 2008-07-16 12:55:28 +0000 | [diff] [blame] | 637 | :class:`queue.Queue`.  These methods are usually unnecessary for most | 
|  | 638 | code: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 639 |  | 
|  | 640 | .. method:: close() | 
|  | 641 |  | 
|  | 642 | Indicate that no more data will be put on this queue by the current | 
|  | 643 | process.  The background thread will quit once it has flushed all buffered | 
|  | 644 | data to the pipe.  This is called automatically when the queue is garbage | 
|  | 645 | collected. | 
|  | 646 |  | 
|  | 647 | .. method:: join_thread() | 
|  | 648 |  | 
|  | 649 | Join the background thread.  This can only be used after :meth:`close` has | 
|  | 650 | been called.  It blocks until the background thread exits, ensuring that | 
|  | 651 | all data in the buffer has been flushed to the pipe. | 
|  | 652 |  | 
|  | 653 | By default if a process is not the creator of the queue then on exit it | 
|  | 654 | will attempt to join the queue's background thread.  The process can call | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 655 | :meth:`cancel_join_thread` to make :meth:`join_thread` do nothing. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 656 |  | 
|  | 657 | .. method:: cancel_join_thread() | 
|  | 658 |  | 
|  | 659 | Prevent :meth:`join_thread` from blocking.  In particular, this prevents | 
|  | 660 | the background thread from being joined automatically when the process | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 661 | exits -- see :meth:`join_thread`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 662 |  | 
| Richard Oudkerk | d7d3f37 | 2013-07-02 12:59:55 +0100 | [diff] [blame] | 663 | A better name for this method might be | 
|  | 664 | ``allow_exit_without_flush()``.  It is likely to cause enqueued | 
|  | 665 | data to lost, and you almost certainly will not need to use it. | 
|  | 666 | It is really only there if you need the current process to exit | 
|  | 667 | immediately without waiting to flush enqueued data to the | 
|  | 668 | underlying pipe, and you don't care about lost data. | 
|  | 669 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 670 |  | 
| Sandro Tosi | cd77815 | 2012-02-15 23:27:00 +0100 | [diff] [blame] | 671 | .. class:: SimpleQueue() | 
| Sandro Tosi | 5cb522c | 2012-02-15 23:14:21 +0100 | [diff] [blame] | 672 |  | 
|  | 673 | It is a simplified :class:`Queue` type, very close to a locked :class:`Pipe`. | 
|  | 674 |  | 
|  | 675 | .. method:: empty() | 
|  | 676 |  | 
|  | 677 | Return ``True`` if the queue is empty, ``False`` otherwise. | 
|  | 678 |  | 
|  | 679 | .. method:: get() | 
|  | 680 |  | 
|  | 681 | Remove and return an item from the queue. | 
|  | 682 |  | 
|  | 683 | .. method:: put(item) | 
|  | 684 |  | 
|  | 685 | Put *item* into the queue. | 
|  | 686 |  | 
|  | 687 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 688 | .. class:: JoinableQueue([maxsize]) | 
|  | 689 |  | 
|  | 690 | :class:`JoinableQueue`, a :class:`Queue` subclass, is a queue which | 
|  | 691 | additionally has :meth:`task_done` and :meth:`join` methods. | 
|  | 692 |  | 
|  | 693 | .. method:: task_done() | 
|  | 694 |  | 
| Eli Bendersky | 78da3bc | 2012-07-13 10:10:05 +0300 | [diff] [blame] | 695 | Indicate that a formerly enqueued task is complete. Used by queue | 
|  | 696 | consumers.  For each :meth:`~Queue.get` used to fetch a task, a subsequent | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 697 | call to :meth:`task_done` tells the queue that the processing on the task | 
|  | 698 | is complete. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 699 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 700 | If a :meth:`~queue.Queue.join` is currently blocking, it will resume when all | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 701 | items have been processed (meaning that a :meth:`task_done` call was | 
|  | 702 | received for every item that had been :meth:`~Queue.put` into the queue). | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 703 |  | 
|  | 704 | Raises a :exc:`ValueError` if called more times than there were items | 
|  | 705 | placed in the queue. | 
|  | 706 |  | 
|  | 707 |  | 
|  | 708 | .. method:: join() | 
|  | 709 |  | 
|  | 710 | Block until all items in the queue have been gotten and processed. | 
|  | 711 |  | 
|  | 712 | The count of unfinished tasks goes up whenever an item is added to the | 
| Eli Bendersky | 78da3bc | 2012-07-13 10:10:05 +0300 | [diff] [blame] | 713 | queue.  The count goes down whenever a consumer calls | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 714 | :meth:`task_done` to indicate that the item was retrieved and all work on | 
|  | 715 | it is complete.  When the count of unfinished tasks drops to zero, | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 716 | :meth:`~queue.Queue.join` unblocks. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 717 |  | 
|  | 718 |  | 
|  | 719 | Miscellaneous | 
|  | 720 | ~~~~~~~~~~~~~ | 
|  | 721 |  | 
|  | 722 | .. function:: active_children() | 
|  | 723 |  | 
|  | 724 | Return list of all live children of the current process. | 
|  | 725 |  | 
|  | 726 | Calling this has the side affect of "joining" any processes which have | 
|  | 727 | already finished. | 
|  | 728 |  | 
|  | 729 | .. function:: cpu_count() | 
|  | 730 |  | 
|  | 731 | Return the number of CPUs in the system.  May raise | 
|  | 732 | :exc:`NotImplementedError`. | 
|  | 733 |  | 
|  | 734 | .. function:: current_process() | 
|  | 735 |  | 
|  | 736 | Return the :class:`Process` object corresponding to the current process. | 
|  | 737 |  | 
|  | 738 | An analogue of :func:`threading.current_thread`. | 
|  | 739 |  | 
|  | 740 | .. function:: freeze_support() | 
|  | 741 |  | 
|  | 742 | Add support for when a program which uses :mod:`multiprocessing` has been | 
|  | 743 | frozen to produce a Windows executable.  (Has been tested with **py2exe**, | 
|  | 744 | **PyInstaller** and **cx_Freeze**.) | 
|  | 745 |  | 
|  | 746 | One needs to call this function straight after the ``if __name__ == | 
|  | 747 | '__main__'`` line of the main module.  For example:: | 
|  | 748 |  | 
|  | 749 | from multiprocessing import Process, freeze_support | 
|  | 750 |  | 
|  | 751 | def f(): | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 752 | print('hello world!') | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 753 |  | 
|  | 754 | if __name__ == '__main__': | 
|  | 755 | freeze_support() | 
|  | 756 | Process(target=f).start() | 
|  | 757 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 758 | If the ``freeze_support()`` line is omitted then trying to run the frozen | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 759 | executable will raise :exc:`RuntimeError`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 760 |  | 
|  | 761 | If the module is being run normally by the Python interpreter then | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 762 | :func:`freeze_support` has no effect. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 763 |  | 
|  | 764 | .. function:: set_executable() | 
|  | 765 |  | 
| Ezio Melotti | 0639d5a | 2009-12-19 23:26:38 +0000 | [diff] [blame] | 766 | Sets the path of the Python interpreter to use when starting a child process. | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 767 | (By default :data:`sys.executable` is used).  Embedders will probably need to | 
|  | 768 | do some thing like :: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 769 |  | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 770 | set_executable(os.path.join(sys.exec_prefix, 'pythonw.exe')) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 771 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 772 | before they can create child processes.  (Windows only) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 773 |  | 
|  | 774 |  | 
|  | 775 | .. note:: | 
|  | 776 |  | 
|  | 777 | :mod:`multiprocessing` contains no analogues of | 
|  | 778 | :func:`threading.active_count`, :func:`threading.enumerate`, | 
|  | 779 | :func:`threading.settrace`, :func:`threading.setprofile`, | 
|  | 780 | :class:`threading.Timer`, or :class:`threading.local`. | 
|  | 781 |  | 
|  | 782 |  | 
|  | 783 | Connection Objects | 
|  | 784 | ~~~~~~~~~~~~~~~~~~ | 
|  | 785 |  | 
|  | 786 | Connection objects allow the sending and receiving of picklable objects or | 
|  | 787 | strings.  They can be thought of as message oriented connected sockets. | 
|  | 788 |  | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 789 | Connection objects are usually created using :func:`Pipe` -- see also | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 790 | :ref:`multiprocessing-listeners-clients`. | 
|  | 791 |  | 
|  | 792 | .. class:: Connection | 
|  | 793 |  | 
|  | 794 | .. method:: send(obj) | 
|  | 795 |  | 
|  | 796 | Send an object to the other end of the connection which should be read | 
|  | 797 | using :meth:`recv`. | 
|  | 798 |  | 
| Benjamin Peterson | 965ce87 | 2009-04-05 21:24:58 +0000 | [diff] [blame] | 799 | The object must be picklable.  Very large pickles (approximately 32 MB+, | 
|  | 800 | though it depends on the OS) may raise a ValueError exception. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 801 |  | 
|  | 802 | .. method:: recv() | 
|  | 803 |  | 
|  | 804 | Return an object sent from the other end of the connection using | 
| Sandro Tosi | b52e7a9 | 2012-01-07 17:56:58 +0100 | [diff] [blame] | 805 | :meth:`send`.  Blocks until there its something to receive.  Raises | 
|  | 806 | :exc:`EOFError` if there is nothing left to receive | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 807 | and the other end was closed. | 
|  | 808 |  | 
|  | 809 | .. method:: fileno() | 
|  | 810 |  | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 811 | Return the file descriptor or handle used by the connection. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 812 |  | 
|  | 813 | .. method:: close() | 
|  | 814 |  | 
|  | 815 | Close the connection. | 
|  | 816 |  | 
|  | 817 | This is called automatically when the connection is garbage collected. | 
|  | 818 |  | 
|  | 819 | .. method:: poll([timeout]) | 
|  | 820 |  | 
|  | 821 | Return whether there is any data available to be read. | 
|  | 822 |  | 
|  | 823 | If *timeout* is not specified then it will return immediately.  If | 
|  | 824 | *timeout* is a number then this specifies the maximum time in seconds to | 
|  | 825 | block.  If *timeout* is ``None`` then an infinite timeout is used. | 
|  | 826 |  | 
| Antoine Pitrou | bdb1cf1 | 2012-03-05 19:28:37 +0100 | [diff] [blame] | 827 | Note that multiple connection objects may be polled at once by | 
|  | 828 | using :func:`multiprocessing.connection.wait`. | 
|  | 829 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 830 | .. method:: send_bytes(buffer[, offset[, size]]) | 
|  | 831 |  | 
| Ezio Melotti | c228e96 | 2013-05-04 18:06:34 +0300 | [diff] [blame] | 832 | Send byte data from a :term:`bytes-like object` as a complete message. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 833 |  | 
|  | 834 | If *offset* is given then data is read from that position in *buffer*.  If | 
| Benjamin Peterson | 965ce87 | 2009-04-05 21:24:58 +0000 | [diff] [blame] | 835 | *size* is given then that many bytes will be read from buffer.  Very large | 
|  | 836 | buffers (approximately 32 MB+, though it depends on the OS) may raise a | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 837 | :exc:`ValueError` exception | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 838 |  | 
|  | 839 | .. method:: recv_bytes([maxlength]) | 
|  | 840 |  | 
|  | 841 | Return a complete message of byte data sent from the other end of the | 
| Sandro Tosi | b52e7a9 | 2012-01-07 17:56:58 +0100 | [diff] [blame] | 842 | connection as a string.  Blocks until there is something to receive. | 
|  | 843 | Raises :exc:`EOFError` if there is nothing left | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 844 | to receive and the other end has closed. | 
|  | 845 |  | 
|  | 846 | If *maxlength* is specified and the message is longer than *maxlength* | 
| Antoine Pitrou | 62ab10a0 | 2011-10-12 20:10:51 +0200 | [diff] [blame] | 847 | then :exc:`OSError` is raised and the connection will no longer be | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 848 | readable. | 
|  | 849 |  | 
| Antoine Pitrou | 62ab10a0 | 2011-10-12 20:10:51 +0200 | [diff] [blame] | 850 | .. versionchanged:: 3.3 | 
|  | 851 | This function used to raise a :exc:`IOError`, which is now an | 
|  | 852 | alias of :exc:`OSError`. | 
|  | 853 |  | 
|  | 854 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 855 | .. method:: recv_bytes_into(buffer[, offset]) | 
|  | 856 |  | 
|  | 857 | Read into *buffer* a complete message of byte data sent from the other end | 
| Sandro Tosi | b52e7a9 | 2012-01-07 17:56:58 +0100 | [diff] [blame] | 858 | of the connection and return the number of bytes in the message.  Blocks | 
|  | 859 | until there is something to receive.  Raises | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 860 | :exc:`EOFError` if there is nothing left to receive and the other end was | 
|  | 861 | closed. | 
|  | 862 |  | 
| Ezio Melotti | c228e96 | 2013-05-04 18:06:34 +0300 | [diff] [blame] | 863 | *buffer* must be a writable :term:`bytes-like object`.  If | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 864 | *offset* is given then the message will be written into the buffer from | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 865 | that position.  Offset must be a non-negative integer less than the | 
|  | 866 | length of *buffer* (in bytes). | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 867 |  | 
|  | 868 | If the buffer is too short then a :exc:`BufferTooShort` exception is | 
|  | 869 | raised and the complete message is available as ``e.args[0]`` where ``e`` | 
|  | 870 | is the exception instance. | 
|  | 871 |  | 
| Antoine Pitrou | 5438ed1 | 2012-04-24 22:56:57 +0200 | [diff] [blame] | 872 | .. versionchanged:: 3.3 | 
|  | 873 | Connection objects themselves can now be transferred between processes | 
|  | 874 | using :meth:`Connection.send` and :meth:`Connection.recv`. | 
|  | 875 |  | 
| Richard Oudkerk | d69cfe8 | 2012-06-18 17:47:52 +0100 | [diff] [blame] | 876 | .. versionadded:: 3.3 | 
|  | 877 | Connection objects now support the context manager protocol -- see | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 878 | :ref:`typecontextmanager`.  :meth:`~contextmanager.__enter__` returns the | 
|  | 879 | connection object, and :meth:`~contextmanager.__exit__` calls :meth:`close`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 880 |  | 
|  | 881 | For example: | 
|  | 882 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 883 | .. doctest:: | 
|  | 884 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 885 | >>> from multiprocessing import Pipe | 
|  | 886 | >>> a, b = Pipe() | 
|  | 887 | >>> a.send([1, 'hello', None]) | 
|  | 888 | >>> b.recv() | 
|  | 889 | [1, 'hello', None] | 
| Georg Brandl | 3017689 | 2010-10-29 05:22:17 +0000 | [diff] [blame] | 890 | >>> b.send_bytes(b'thank you') | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 891 | >>> a.recv_bytes() | 
| Georg Brandl | 3017689 | 2010-10-29 05:22:17 +0000 | [diff] [blame] | 892 | b'thank you' | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 893 | >>> import array | 
|  | 894 | >>> arr1 = array.array('i', range(5)) | 
|  | 895 | >>> arr2 = array.array('i', [0] * 10) | 
|  | 896 | >>> a.send_bytes(arr1) | 
|  | 897 | >>> count = b.recv_bytes_into(arr2) | 
|  | 898 | >>> assert count == len(arr1) * arr1.itemsize | 
|  | 899 | >>> arr2 | 
|  | 900 | array('i', [0, 1, 2, 3, 4, 0, 0, 0, 0, 0]) | 
|  | 901 |  | 
|  | 902 |  | 
|  | 903 | .. warning:: | 
|  | 904 |  | 
|  | 905 | The :meth:`Connection.recv` method automatically unpickles the data it | 
|  | 906 | receives, which can be a security risk unless you can trust the process | 
|  | 907 | which sent the message. | 
|  | 908 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 909 | Therefore, unless the connection object was produced using :func:`Pipe` you | 
|  | 910 | should only use the :meth:`~Connection.recv` and :meth:`~Connection.send` | 
|  | 911 | methods after performing some sort of authentication.  See | 
|  | 912 | :ref:`multiprocessing-auth-keys`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 913 |  | 
|  | 914 | .. warning:: | 
|  | 915 |  | 
|  | 916 | If a process is killed while it is trying to read or write to a pipe then | 
|  | 917 | the data in the pipe is likely to become corrupted, because it may become | 
|  | 918 | impossible to be sure where the message boundaries lie. | 
|  | 919 |  | 
|  | 920 |  | 
|  | 921 | Synchronization primitives | 
|  | 922 | ~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 923 |  | 
|  | 924 | Generally synchronization primitives are not as necessary in a multiprocess | 
| Georg Brandl | 2ee470f | 2008-07-16 12:55:28 +0000 | [diff] [blame] | 925 | program as they are in a multithreaded program.  See the documentation for | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 926 | :mod:`threading` module. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 927 |  | 
|  | 928 | Note that one can also create synchronization primitives by using a manager | 
|  | 929 | object -- see :ref:`multiprocessing-managers`. | 
|  | 930 |  | 
| Richard Oudkerk | 3730a17 | 2012-06-15 18:26:07 +0100 | [diff] [blame] | 931 | .. class:: Barrier(parties[, action[, timeout]]) | 
|  | 932 |  | 
|  | 933 | A barrier object: a clone of :class:`threading.Barrier`. | 
|  | 934 |  | 
|  | 935 | .. versionadded:: 3.3 | 
|  | 936 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 937 | .. class:: BoundedSemaphore([value]) | 
|  | 938 |  | 
|  | 939 | A bounded semaphore object: a clone of :class:`threading.BoundedSemaphore`. | 
|  | 940 |  | 
| Georg Brandl | 592296e | 2010-05-21 21:48:27 +0000 | [diff] [blame] | 941 | (On Mac OS X, this is indistinguishable from :class:`Semaphore` because | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 942 | ``sem_getvalue()`` is not implemented on that platform). | 
|  | 943 |  | 
|  | 944 | .. class:: Condition([lock]) | 
|  | 945 |  | 
| R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame] | 946 | A condition variable: an alias for :class:`threading.Condition`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 947 |  | 
|  | 948 | If *lock* is specified then it should be a :class:`Lock` or :class:`RLock` | 
|  | 949 | object from :mod:`multiprocessing`. | 
|  | 950 |  | 
| Charles-François Natali | c8ce715 | 2012-04-17 18:45:57 +0200 | [diff] [blame] | 951 | .. versionchanged:: 3.3 | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 952 | The :meth:`~threading.Condition.wait_for` method was added. | 
| Charles-François Natali | c8ce715 | 2012-04-17 18:45:57 +0200 | [diff] [blame] | 953 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 954 | .. class:: Event() | 
|  | 955 |  | 
|  | 956 | A clone of :class:`threading.Event`. | 
|  | 957 |  | 
|  | 958 | .. class:: Lock() | 
|  | 959 |  | 
|  | 960 | A non-recursive lock object: a clone of :class:`threading.Lock`. | 
|  | 961 |  | 
|  | 962 | .. class:: RLock() | 
|  | 963 |  | 
|  | 964 | A recursive lock object: a clone of :class:`threading.RLock`. | 
|  | 965 |  | 
|  | 966 | .. class:: Semaphore([value]) | 
|  | 967 |  | 
| Ross Lagerwall | 8fea2e6 | 2011-03-14 10:40:15 +0200 | [diff] [blame] | 968 | A semaphore object: a clone of :class:`threading.Semaphore`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 969 |  | 
|  | 970 | .. note:: | 
|  | 971 |  | 
| Richard Oudkerk | 59d5404 | 2012-05-10 16:11:12 +0100 | [diff] [blame] | 972 | The :meth:`acquire` and :meth:`wait` methods of each of these types | 
|  | 973 | treat negative timeouts as zero timeouts.  This differs from | 
|  | 974 | :mod:`threading` where, since version 3.2, the equivalent | 
|  | 975 | :meth:`acquire` methods treat negative timeouts as infinite | 
|  | 976 | timeouts. | 
|  | 977 |  | 
| Georg Brandl | 592296e | 2010-05-21 21:48:27 +0000 | [diff] [blame] | 978 | On Mac OS X, ``sem_timedwait`` is unsupported, so calling ``acquire()`` with | 
|  | 979 | a timeout will emulate that function's behavior using a sleeping loop. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 980 |  | 
|  | 981 | .. note:: | 
|  | 982 |  | 
|  | 983 | If the SIGINT signal generated by Ctrl-C arrives while the main thread is | 
|  | 984 | blocked by a call to :meth:`BoundedSemaphore.acquire`, :meth:`Lock.acquire`, | 
|  | 985 | :meth:`RLock.acquire`, :meth:`Semaphore.acquire`, :meth:`Condition.acquire` | 
|  | 986 | or :meth:`Condition.wait` then the call will be immediately interrupted and | 
|  | 987 | :exc:`KeyboardInterrupt` will be raised. | 
|  | 988 |  | 
|  | 989 | This differs from the behaviour of :mod:`threading` where SIGINT will be | 
|  | 990 | ignored while the equivalent blocking calls are in progress. | 
|  | 991 |  | 
|  | 992 |  | 
|  | 993 | Shared :mod:`ctypes` Objects | 
|  | 994 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 995 |  | 
|  | 996 | It is possible to create shared objects using shared memory which can be | 
|  | 997 | inherited by child processes. | 
|  | 998 |  | 
| Richard Oudkerk | 87ea780 | 2012-05-29 12:01:47 +0100 | [diff] [blame] | 999 | .. function:: Value(typecode_or_type, *args, lock=True) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1000 |  | 
|  | 1001 | Return a :mod:`ctypes` object allocated from shared memory.  By default the | 
| Eli Bendersky | 78da3bc | 2012-07-13 10:10:05 +0300 | [diff] [blame] | 1002 | return value is actually a synchronized wrapper for the object.  The object | 
|  | 1003 | itself can be accessed via the *value* attribute of a :class:`Value`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1004 |  | 
|  | 1005 | *typecode_or_type* determines the type of the returned object: it is either a | 
|  | 1006 | ctypes type or a one character typecode of the kind used by the :mod:`array` | 
|  | 1007 | module.  *\*args* is passed on to the constructor for the type. | 
|  | 1008 |  | 
| Richard Oudkerk | edcf8da | 2013-11-17 17:00:38 +0000 | [diff] [blame] | 1009 | If *lock* is ``True`` (the default) then a new recursive lock | 
|  | 1010 | object is created to synchronize access to the value.  If *lock* is | 
|  | 1011 | a :class:`Lock` or :class:`RLock` object then that will be used to | 
|  | 1012 | synchronize access to the value.  If *lock* is ``False`` then | 
|  | 1013 | access to the returned object will not be automatically protected | 
|  | 1014 | by a lock, so it will not necessarily be "process-safe". | 
|  | 1015 |  | 
|  | 1016 | Operations like ``+=`` which involve a read and write are not | 
|  | 1017 | atomic.  So if, for instance, you want to atomically increment a | 
|  | 1018 | shared value it is insufficient to just do :: | 
|  | 1019 |  | 
|  | 1020 | counter.value += 1 | 
|  | 1021 |  | 
|  | 1022 | Assuming the associated lock is recursive (which it is by default) | 
|  | 1023 | you can instead do :: | 
|  | 1024 |  | 
|  | 1025 | with counter.get_lock(): | 
|  | 1026 | counter.value += 1 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1027 |  | 
|  | 1028 | Note that *lock* is a keyword-only argument. | 
|  | 1029 |  | 
|  | 1030 | .. function:: Array(typecode_or_type, size_or_initializer, *, lock=True) | 
|  | 1031 |  | 
|  | 1032 | Return a ctypes array allocated from shared memory.  By default the return | 
|  | 1033 | value is actually a synchronized wrapper for the array. | 
|  | 1034 |  | 
|  | 1035 | *typecode_or_type* determines the type of the elements of the returned array: | 
|  | 1036 | it is either a ctypes type or a one character typecode of the kind used by | 
|  | 1037 | the :mod:`array` module.  If *size_or_initializer* is an integer, then it | 
|  | 1038 | determines the length of the array, and the array will be initially zeroed. | 
|  | 1039 | Otherwise, *size_or_initializer* is a sequence which is used to initialize | 
|  | 1040 | the array and whose length determines the length of the array. | 
|  | 1041 |  | 
|  | 1042 | If *lock* is ``True`` (the default) then a new lock object is created to | 
|  | 1043 | synchronize access to the value.  If *lock* is a :class:`Lock` or | 
|  | 1044 | :class:`RLock` object then that will be used to synchronize access to the | 
|  | 1045 | value.  If *lock* is ``False`` then access to the returned object will not be | 
|  | 1046 | automatically protected by a lock, so it will not necessarily be | 
|  | 1047 | "process-safe". | 
|  | 1048 |  | 
|  | 1049 | Note that *lock* is a keyword only argument. | 
|  | 1050 |  | 
| Amaury Forgeot d'Arc | b0c2916 | 2008-11-22 22:18:04 +0000 | [diff] [blame] | 1051 | Note that an array of :data:`ctypes.c_char` has *value* and *raw* | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1052 | attributes which allow one to use it to store and retrieve strings. | 
|  | 1053 |  | 
|  | 1054 |  | 
|  | 1055 | The :mod:`multiprocessing.sharedctypes` module | 
|  | 1056 | >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> | 
|  | 1057 |  | 
|  | 1058 | .. module:: multiprocessing.sharedctypes | 
|  | 1059 | :synopsis: Allocate ctypes objects from shared memory. | 
|  | 1060 |  | 
|  | 1061 | The :mod:`multiprocessing.sharedctypes` module provides functions for allocating | 
|  | 1062 | :mod:`ctypes` objects from shared memory which can be inherited by child | 
|  | 1063 | processes. | 
|  | 1064 |  | 
|  | 1065 | .. note:: | 
|  | 1066 |  | 
| Georg Brandl | 2ee470f | 2008-07-16 12:55:28 +0000 | [diff] [blame] | 1067 | Although it is possible to store a pointer in shared memory remember that | 
|  | 1068 | this will refer to a location in the address space of a specific process. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1069 | However, the pointer is quite likely to be invalid in the context of a second | 
|  | 1070 | process and trying to dereference the pointer from the second process may | 
|  | 1071 | cause a crash. | 
|  | 1072 |  | 
|  | 1073 | .. function:: RawArray(typecode_or_type, size_or_initializer) | 
|  | 1074 |  | 
|  | 1075 | Return a ctypes array allocated from shared memory. | 
|  | 1076 |  | 
|  | 1077 | *typecode_or_type* determines the type of the elements of the returned array: | 
|  | 1078 | it is either a ctypes type or a one character typecode of the kind used by | 
|  | 1079 | the :mod:`array` module.  If *size_or_initializer* is an integer then it | 
|  | 1080 | determines the length of the array, and the array will be initially zeroed. | 
|  | 1081 | Otherwise *size_or_initializer* is a sequence which is used to initialize the | 
|  | 1082 | array and whose length determines the length of the array. | 
|  | 1083 |  | 
|  | 1084 | Note that setting and getting an element is potentially non-atomic -- use | 
|  | 1085 | :func:`Array` instead to make sure that access is automatically synchronized | 
|  | 1086 | using a lock. | 
|  | 1087 |  | 
|  | 1088 | .. function:: RawValue(typecode_or_type, *args) | 
|  | 1089 |  | 
|  | 1090 | Return a ctypes object allocated from shared memory. | 
|  | 1091 |  | 
|  | 1092 | *typecode_or_type* determines the type of the returned object: it is either a | 
|  | 1093 | ctypes type or a one character typecode of the kind used by the :mod:`array` | 
| Jesse Noller | b0516a6 | 2009-01-18 03:11:38 +0000 | [diff] [blame] | 1094 | module.  *\*args* is passed on to the constructor for the type. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1095 |  | 
|  | 1096 | Note that setting and getting the value is potentially non-atomic -- use | 
|  | 1097 | :func:`Value` instead to make sure that access is automatically synchronized | 
|  | 1098 | using a lock. | 
|  | 1099 |  | 
| Amaury Forgeot d'Arc | b0c2916 | 2008-11-22 22:18:04 +0000 | [diff] [blame] | 1100 | Note that an array of :data:`ctypes.c_char` has ``value`` and ``raw`` | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1101 | attributes which allow one to use it to store and retrieve strings -- see | 
|  | 1102 | documentation for :mod:`ctypes`. | 
|  | 1103 |  | 
| Richard Oudkerk | 87ea780 | 2012-05-29 12:01:47 +0100 | [diff] [blame] | 1104 | .. function:: Array(typecode_or_type, size_or_initializer, *, lock=True) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1105 |  | 
|  | 1106 | The same as :func:`RawArray` except that depending on the value of *lock* a | 
|  | 1107 | process-safe synchronization wrapper may be returned instead of a raw ctypes | 
|  | 1108 | array. | 
|  | 1109 |  | 
|  | 1110 | If *lock* is ``True`` (the default) then a new lock object is created to | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1111 | synchronize access to the value.  If *lock* is a | 
|  | 1112 | :class:`~multiprocessing.Lock` or :class:`~multiprocessing.RLock` object | 
|  | 1113 | then that will be used to synchronize access to the | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1114 | value.  If *lock* is ``False`` then access to the returned object will not be | 
|  | 1115 | automatically protected by a lock, so it will not necessarily be | 
|  | 1116 | "process-safe". | 
|  | 1117 |  | 
|  | 1118 | Note that *lock* is a keyword-only argument. | 
|  | 1119 |  | 
| Richard Oudkerk | 87ea780 | 2012-05-29 12:01:47 +0100 | [diff] [blame] | 1120 | .. function:: Value(typecode_or_type, *args, lock=True) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1121 |  | 
|  | 1122 | The same as :func:`RawValue` except that depending on the value of *lock* a | 
|  | 1123 | process-safe synchronization wrapper may be returned instead of a raw ctypes | 
|  | 1124 | object. | 
|  | 1125 |  | 
|  | 1126 | If *lock* is ``True`` (the default) then a new lock object is created to | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1127 | synchronize access to the value.  If *lock* is a :class:`~multiprocessing.Lock` or | 
|  | 1128 | :class:`~multiprocessing.RLock` object then that will be used to synchronize access to the | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1129 | value.  If *lock* is ``False`` then access to the returned object will not be | 
|  | 1130 | automatically protected by a lock, so it will not necessarily be | 
|  | 1131 | "process-safe". | 
|  | 1132 |  | 
|  | 1133 | Note that *lock* is a keyword-only argument. | 
|  | 1134 |  | 
|  | 1135 | .. function:: copy(obj) | 
|  | 1136 |  | 
|  | 1137 | Return a ctypes object allocated from shared memory which is a copy of the | 
|  | 1138 | ctypes object *obj*. | 
|  | 1139 |  | 
|  | 1140 | .. function:: synchronized(obj[, lock]) | 
|  | 1141 |  | 
|  | 1142 | Return a process-safe wrapper object for a ctypes object which uses *lock* to | 
|  | 1143 | synchronize access.  If *lock* is ``None`` (the default) then a | 
|  | 1144 | :class:`multiprocessing.RLock` object is created automatically. | 
|  | 1145 |  | 
|  | 1146 | A synchronized wrapper will have two methods in addition to those of the | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1147 | object it wraps: :meth:`get_obj` returns the wrapped object and | 
|  | 1148 | :meth:`get_lock` returns the lock object used for synchronization. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1149 |  | 
|  | 1150 | Note that accessing the ctypes object through the wrapper can be a lot slower | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1151 | than accessing the raw ctypes object. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1152 |  | 
|  | 1153 |  | 
|  | 1154 | The table below compares the syntax for creating shared ctypes objects from | 
|  | 1155 | shared memory with the normal ctypes syntax.  (In the table ``MyStruct`` is some | 
|  | 1156 | subclass of :class:`ctypes.Structure`.) | 
|  | 1157 |  | 
|  | 1158 | ==================== ========================== =========================== | 
|  | 1159 | ctypes               sharedctypes using type    sharedctypes using typecode | 
|  | 1160 | ==================== ========================== =========================== | 
|  | 1161 | c_double(2.4)        RawValue(c_double, 2.4)    RawValue('d', 2.4) | 
|  | 1162 | MyStruct(4, 6)       RawValue(MyStruct, 4, 6) | 
|  | 1163 | (c_short * 7)()      RawArray(c_short, 7)       RawArray('h', 7) | 
|  | 1164 | (c_int * 3)(9, 2, 8) RawArray(c_int, (9, 2, 8)) RawArray('i', (9, 2, 8)) | 
|  | 1165 | ==================== ========================== =========================== | 
|  | 1166 |  | 
|  | 1167 |  | 
|  | 1168 | Below is an example where a number of ctypes objects are modified by a child | 
|  | 1169 | process:: | 
|  | 1170 |  | 
|  | 1171 | from multiprocessing import Process, Lock | 
|  | 1172 | from multiprocessing.sharedctypes import Value, Array | 
|  | 1173 | from ctypes import Structure, c_double | 
|  | 1174 |  | 
|  | 1175 | class Point(Structure): | 
|  | 1176 | _fields_ = [('x', c_double), ('y', c_double)] | 
|  | 1177 |  | 
|  | 1178 | def modify(n, x, s, A): | 
|  | 1179 | n.value **= 2 | 
|  | 1180 | x.value **= 2 | 
|  | 1181 | s.value = s.value.upper() | 
|  | 1182 | for a in A: | 
|  | 1183 | a.x **= 2 | 
|  | 1184 | a.y **= 2 | 
|  | 1185 |  | 
|  | 1186 | if __name__ == '__main__': | 
|  | 1187 | lock = Lock() | 
|  | 1188 |  | 
|  | 1189 | n = Value('i', 7) | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1190 | x = Value(c_double, 1.0/3.0, lock=False) | 
| Richard Oudkerk | b517596 | 2012-09-10 13:00:33 +0100 | [diff] [blame] | 1191 | s = Array('c', b'hello world', lock=lock) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1192 | A = Array(Point, [(1.875,-6.25), (-5.75,2.0), (2.375,9.5)], lock=lock) | 
|  | 1193 |  | 
|  | 1194 | p = Process(target=modify, args=(n, x, s, A)) | 
|  | 1195 | p.start() | 
|  | 1196 | p.join() | 
|  | 1197 |  | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1198 | print(n.value) | 
|  | 1199 | print(x.value) | 
|  | 1200 | print(s.value) | 
|  | 1201 | print([(a.x, a.y) for a in A]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1202 |  | 
|  | 1203 |  | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1204 | .. highlight:: none | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1205 |  | 
|  | 1206 | The results printed are :: | 
|  | 1207 |  | 
|  | 1208 | 49 | 
|  | 1209 | 0.1111111111111111 | 
|  | 1210 | HELLO WORLD | 
|  | 1211 | [(3.515625, 39.0625), (33.0625, 4.0), (5.640625, 90.25)] | 
|  | 1212 |  | 
| Ezio Melotti | f86b28e | 2012-04-13 20:50:48 -0600 | [diff] [blame] | 1213 | .. highlight:: python3 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1214 |  | 
|  | 1215 |  | 
|  | 1216 | .. _multiprocessing-managers: | 
|  | 1217 |  | 
|  | 1218 | Managers | 
|  | 1219 | ~~~~~~~~ | 
|  | 1220 |  | 
|  | 1221 | Managers provide a way to create data which can be shared between different | 
| Eli Bendersky | 78da3bc | 2012-07-13 10:10:05 +0300 | [diff] [blame] | 1222 | processes, including sharing over a network between processes running on | 
|  | 1223 | different machines. A manager object controls a server process which manages | 
|  | 1224 | *shared objects*.  Other processes can access the shared objects by using | 
|  | 1225 | proxies. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1226 |  | 
|  | 1227 | .. function:: multiprocessing.Manager() | 
|  | 1228 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1229 | Returns a started :class:`~multiprocessing.managers.SyncManager` object which | 
|  | 1230 | can be used for sharing objects between processes.  The returned manager | 
|  | 1231 | object corresponds to a spawned child process and has methods which will | 
|  | 1232 | create shared objects and return corresponding proxies. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1233 |  | 
|  | 1234 | .. module:: multiprocessing.managers | 
|  | 1235 | :synopsis: Share data between process with shared objects. | 
|  | 1236 |  | 
|  | 1237 | Manager processes will be shutdown as soon as they are garbage collected or | 
|  | 1238 | their parent process exits.  The manager classes are defined in the | 
|  | 1239 | :mod:`multiprocessing.managers` module: | 
|  | 1240 |  | 
|  | 1241 | .. class:: BaseManager([address[, authkey]]) | 
|  | 1242 |  | 
|  | 1243 | Create a BaseManager object. | 
|  | 1244 |  | 
| Benjamin Peterson | 21896a3 | 2010-03-21 22:03:03 +0000 | [diff] [blame] | 1245 | Once created one should call :meth:`start` or ``get_server().serve_forever()`` to ensure | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1246 | that the manager object refers to a started manager process. | 
|  | 1247 |  | 
|  | 1248 | *address* is the address on which the manager process listens for new | 
|  | 1249 | connections.  If *address* is ``None`` then an arbitrary one is chosen. | 
|  | 1250 |  | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1251 | *authkey* is the authentication key which will be used to check the | 
|  | 1252 | validity of incoming connections to the server process.  If | 
|  | 1253 | *authkey* is ``None`` then ``current_process().authkey`` is used. | 
|  | 1254 | Otherwise *authkey* is used and it must be a byte string. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1255 |  | 
| Benjamin Peterson | f47ed4a | 2009-04-11 20:45:40 +0000 | [diff] [blame] | 1256 | .. method:: start([initializer[, initargs]]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1257 |  | 
| Benjamin Peterson | f47ed4a | 2009-04-11 20:45:40 +0000 | [diff] [blame] | 1258 | Start a subprocess to start the manager.  If *initializer* is not ``None`` | 
|  | 1259 | then the subprocess will call ``initializer(*initargs)`` when it starts. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1260 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1261 | .. method:: get_server() | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1262 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1263 | Returns a :class:`Server` object which represents the actual server under | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1264 | the control of the Manager. The :class:`Server` object supports the | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1265 | :meth:`serve_forever` method:: | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1266 |  | 
| Georg Brandl | 1f01deb | 2009-01-03 22:47:39 +0000 | [diff] [blame] | 1267 | >>> from multiprocessing.managers import BaseManager | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1268 | >>> manager = BaseManager(address=('', 50000), authkey=b'abc') | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1269 | >>> server = manager.get_server() | 
|  | 1270 | >>> server.serve_forever() | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1271 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1272 | :class:`Server` additionally has an :attr:`address` attribute. | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1273 |  | 
|  | 1274 | .. method:: connect() | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1275 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1276 | Connect a local manager object to a remote manager process:: | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1277 |  | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1278 | >>> from multiprocessing.managers import BaseManager | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1279 | >>> m = BaseManager(address=('127.0.0.1', 5000), authkey=b'abc') | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1280 | >>> m.connect() | 
|  | 1281 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1282 | .. method:: shutdown() | 
|  | 1283 |  | 
|  | 1284 | Stop the process used by the manager.  This is only available if | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1285 | :meth:`start` has been used to start the server process. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1286 |  | 
|  | 1287 | This can be called multiple times. | 
|  | 1288 |  | 
|  | 1289 | .. method:: register(typeid[, callable[, proxytype[, exposed[, method_to_typeid[, create_method]]]]]) | 
|  | 1290 |  | 
|  | 1291 | A classmethod which can be used for registering a type or callable with | 
|  | 1292 | the manager class. | 
|  | 1293 |  | 
|  | 1294 | *typeid* is a "type identifier" which is used to identify a particular | 
|  | 1295 | type of shared object.  This must be a string. | 
|  | 1296 |  | 
|  | 1297 | *callable* is a callable used for creating objects for this type | 
| Richard Oudkerk | f0604fd | 2012-06-11 17:56:08 +0100 | [diff] [blame] | 1298 | identifier.  If a manager instance will be connected to the | 
|  | 1299 | server using the :meth:`connect` method, or if the | 
|  | 1300 | *create_method* argument is ``False`` then this can be left as | 
|  | 1301 | ``None``. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1302 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1303 | *proxytype* is a subclass of :class:`BaseProxy` which is used to create | 
|  | 1304 | proxies for shared objects with this *typeid*.  If ``None`` then a proxy | 
|  | 1305 | class is created automatically. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1306 |  | 
|  | 1307 | *exposed* is used to specify a sequence of method names which proxies for | 
|  | 1308 | this typeid should be allowed to access using | 
|  | 1309 | :meth:`BaseProxy._callMethod`.  (If *exposed* is ``None`` then | 
|  | 1310 | :attr:`proxytype._exposed_` is used instead if it exists.)  In the case | 
|  | 1311 | where no exposed list is specified, all "public methods" of the shared | 
|  | 1312 | object will be accessible.  (Here a "public method" means any attribute | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1313 | which has a :meth:`~object.__call__` method and whose name does not begin | 
|  | 1314 | with ``'_'``.) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1315 |  | 
|  | 1316 | *method_to_typeid* is a mapping used to specify the return type of those | 
|  | 1317 | exposed methods which should return a proxy.  It maps method names to | 
|  | 1318 | typeid strings.  (If *method_to_typeid* is ``None`` then | 
|  | 1319 | :attr:`proxytype._method_to_typeid_` is used instead if it exists.)  If a | 
|  | 1320 | method's name is not a key of this mapping or if the mapping is ``None`` | 
|  | 1321 | then the object returned by the method will be copied by value. | 
|  | 1322 |  | 
|  | 1323 | *create_method* determines whether a method should be created with name | 
|  | 1324 | *typeid* which can be used to tell the server process to create a new | 
|  | 1325 | shared object and return a proxy for it.  By default it is ``True``. | 
|  | 1326 |  | 
|  | 1327 | :class:`BaseManager` instances also have one read-only property: | 
|  | 1328 |  | 
|  | 1329 | .. attribute:: address | 
|  | 1330 |  | 
|  | 1331 | The address used by the manager. | 
|  | 1332 |  | 
| Richard Oudkerk | ac38571 | 2012-06-18 21:29:30 +0100 | [diff] [blame] | 1333 | .. versionchanged:: 3.3 | 
|  | 1334 | Manager objects support the context manager protocol -- see | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1335 | :ref:`typecontextmanager`.  :meth:`~contextmanager.__enter__` starts the | 
|  | 1336 | server process (if it has not already started) and then returns the | 
|  | 1337 | manager object.  :meth:`~contextmanager.__exit__` calls :meth:`shutdown`. | 
| Richard Oudkerk | ac38571 | 2012-06-18 21:29:30 +0100 | [diff] [blame] | 1338 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1339 | In previous versions :meth:`~contextmanager.__enter__` did not start the | 
| Richard Oudkerk | ac38571 | 2012-06-18 21:29:30 +0100 | [diff] [blame] | 1340 | manager's server process if it was not already started. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1341 |  | 
|  | 1342 | .. class:: SyncManager | 
|  | 1343 |  | 
|  | 1344 | A subclass of :class:`BaseManager` which can be used for the synchronization | 
|  | 1345 | of processes.  Objects of this type are returned by | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1346 | :func:`multiprocessing.Manager`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1347 |  | 
|  | 1348 | It also supports creation of shared lists and dictionaries. | 
|  | 1349 |  | 
| Richard Oudkerk | 3730a17 | 2012-06-15 18:26:07 +0100 | [diff] [blame] | 1350 | .. method:: Barrier(parties[, action[, timeout]]) | 
|  | 1351 |  | 
|  | 1352 | Create a shared :class:`threading.Barrier` object and return a | 
|  | 1353 | proxy for it. | 
|  | 1354 |  | 
|  | 1355 | .. versionadded:: 3.3 | 
|  | 1356 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1357 | .. method:: BoundedSemaphore([value]) | 
|  | 1358 |  | 
|  | 1359 | Create a shared :class:`threading.BoundedSemaphore` object and return a | 
|  | 1360 | proxy for it. | 
|  | 1361 |  | 
|  | 1362 | .. method:: Condition([lock]) | 
|  | 1363 |  | 
|  | 1364 | Create a shared :class:`threading.Condition` object and return a proxy for | 
|  | 1365 | it. | 
|  | 1366 |  | 
|  | 1367 | If *lock* is supplied then it should be a proxy for a | 
|  | 1368 | :class:`threading.Lock` or :class:`threading.RLock` object. | 
|  | 1369 |  | 
| Charles-François Natali | c8ce715 | 2012-04-17 18:45:57 +0200 | [diff] [blame] | 1370 | .. versionchanged:: 3.3 | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1371 | The :meth:`~threading.Condition.wait_for` method was added. | 
| Charles-François Natali | c8ce715 | 2012-04-17 18:45:57 +0200 | [diff] [blame] | 1372 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1373 | .. method:: Event() | 
|  | 1374 |  | 
|  | 1375 | Create a shared :class:`threading.Event` object and return a proxy for it. | 
|  | 1376 |  | 
|  | 1377 | .. method:: Lock() | 
|  | 1378 |  | 
|  | 1379 | Create a shared :class:`threading.Lock` object and return a proxy for it. | 
|  | 1380 |  | 
|  | 1381 | .. method:: Namespace() | 
|  | 1382 |  | 
|  | 1383 | Create a shared :class:`Namespace` object and return a proxy for it. | 
|  | 1384 |  | 
|  | 1385 | .. method:: Queue([maxsize]) | 
|  | 1386 |  | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 1387 | Create a shared :class:`queue.Queue` object and return a proxy for it. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1388 |  | 
|  | 1389 | .. method:: RLock() | 
|  | 1390 |  | 
|  | 1391 | Create a shared :class:`threading.RLock` object and return a proxy for it. | 
|  | 1392 |  | 
|  | 1393 | .. method:: Semaphore([value]) | 
|  | 1394 |  | 
|  | 1395 | Create a shared :class:`threading.Semaphore` object and return a proxy for | 
|  | 1396 | it. | 
|  | 1397 |  | 
|  | 1398 | .. method:: Array(typecode, sequence) | 
|  | 1399 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1400 | Create an array and return a proxy for it. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1401 |  | 
|  | 1402 | .. method:: Value(typecode, value) | 
|  | 1403 |  | 
|  | 1404 | Create an object with a writable ``value`` attribute and return a proxy | 
|  | 1405 | for it. | 
|  | 1406 |  | 
|  | 1407 | .. method:: dict() | 
|  | 1408 | dict(mapping) | 
|  | 1409 | dict(sequence) | 
|  | 1410 |  | 
|  | 1411 | Create a shared ``dict`` object and return a proxy for it. | 
|  | 1412 |  | 
|  | 1413 | .. method:: list() | 
|  | 1414 | list(sequence) | 
|  | 1415 |  | 
|  | 1416 | Create a shared ``list`` object and return a proxy for it. | 
|  | 1417 |  | 
| Georg Brandl | 3ed4114 | 2010-10-15 16:19:43 +0000 | [diff] [blame] | 1418 | .. note:: | 
|  | 1419 |  | 
|  | 1420 | Modifications to mutable values or items in dict and list proxies will not | 
|  | 1421 | be propagated through the manager, because the proxy has no way of knowing | 
|  | 1422 | when its values or items are modified.  To modify such an item, you can | 
|  | 1423 | re-assign the modified object to the container proxy:: | 
|  | 1424 |  | 
|  | 1425 | # create a list proxy and append a mutable object (a dictionary) | 
|  | 1426 | lproxy = manager.list() | 
|  | 1427 | lproxy.append({}) | 
|  | 1428 | # now mutate the dictionary | 
|  | 1429 | d = lproxy[0] | 
|  | 1430 | d['a'] = 1 | 
|  | 1431 | d['b'] = 2 | 
|  | 1432 | # at this point, the changes to d are not yet synced, but by | 
|  | 1433 | # reassigning the dictionary, the proxy is notified of the change | 
|  | 1434 | lproxy[0] = d | 
|  | 1435 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1436 |  | 
|  | 1437 | Namespace objects | 
|  | 1438 | >>>>>>>>>>>>>>>>> | 
|  | 1439 |  | 
|  | 1440 | A namespace object has no public methods, but does have writable attributes. | 
|  | 1441 | Its representation shows the values of its attributes. | 
|  | 1442 |  | 
|  | 1443 | However, when using a proxy for a namespace object, an attribute beginning with | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1444 | ``'_'`` will be an attribute of the proxy and not an attribute of the referent: | 
|  | 1445 |  | 
|  | 1446 | .. doctest:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1447 |  | 
|  | 1448 | >>> manager = multiprocessing.Manager() | 
|  | 1449 | >>> Global = manager.Namespace() | 
|  | 1450 | >>> Global.x = 10 | 
|  | 1451 | >>> Global.y = 'hello' | 
|  | 1452 | >>> Global._z = 12.3    # this is an attribute of the proxy | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1453 | >>> print(Global) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1454 | Namespace(x=10, y='hello') | 
|  | 1455 |  | 
|  | 1456 |  | 
|  | 1457 | Customized managers | 
|  | 1458 | >>>>>>>>>>>>>>>>>>> | 
|  | 1459 |  | 
|  | 1460 | To create one's own manager, one creates a subclass of :class:`BaseManager` and | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 1461 | uses the :meth:`~BaseManager.register` classmethod to register new types or | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1462 | callables with the manager class.  For example:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1463 |  | 
|  | 1464 | from multiprocessing.managers import BaseManager | 
|  | 1465 |  | 
| Éric Araujo | 28053fb | 2010-11-22 03:09:19 +0000 | [diff] [blame] | 1466 | class MathsClass: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1467 | def add(self, x, y): | 
|  | 1468 | return x + y | 
|  | 1469 | def mul(self, x, y): | 
|  | 1470 | return x * y | 
|  | 1471 |  | 
|  | 1472 | class MyManager(BaseManager): | 
|  | 1473 | pass | 
|  | 1474 |  | 
|  | 1475 | MyManager.register('Maths', MathsClass) | 
|  | 1476 |  | 
|  | 1477 | if __name__ == '__main__': | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 1478 | with MyManager() as manager: | 
|  | 1479 | maths = manager.Maths() | 
|  | 1480 | print(maths.add(4, 3))         # prints 7 | 
|  | 1481 | print(maths.mul(7, 8))         # prints 56 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1482 |  | 
|  | 1483 |  | 
|  | 1484 | Using a remote manager | 
|  | 1485 | >>>>>>>>>>>>>>>>>>>>>> | 
|  | 1486 |  | 
|  | 1487 | It is possible to run a manager server on one machine and have clients use it | 
|  | 1488 | from other machines (assuming that the firewalls involved allow it). | 
|  | 1489 |  | 
|  | 1490 | Running the following commands creates a server for a single shared queue which | 
|  | 1491 | remote clients can access:: | 
|  | 1492 |  | 
|  | 1493 | >>> from multiprocessing.managers import BaseManager | 
| Benjamin Peterson | 257060a | 2008-06-28 01:42:41 +0000 | [diff] [blame] | 1494 | >>> import queue | 
|  | 1495 | >>> queue = queue.Queue() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1496 | >>> class QueueManager(BaseManager): pass | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1497 | >>> QueueManager.register('get_queue', callable=lambda:queue) | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1498 | >>> m = QueueManager(address=('', 50000), authkey=b'abracadabra') | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1499 | >>> s = m.get_server() | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1500 | >>> s.serve_forever() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1501 |  | 
|  | 1502 | One client can access the server as follows:: | 
|  | 1503 |  | 
|  | 1504 | >>> from multiprocessing.managers import BaseManager | 
|  | 1505 | >>> class QueueManager(BaseManager): pass | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1506 | >>> QueueManager.register('get_queue') | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1507 | >>> m = QueueManager(address=('foo.bar.org', 50000), authkey=b'abracadabra') | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1508 | >>> m.connect() | 
|  | 1509 | >>> queue = m.get_queue() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1510 | >>> queue.put('hello') | 
|  | 1511 |  | 
|  | 1512 | Another client can also use it:: | 
|  | 1513 |  | 
|  | 1514 | >>> from multiprocessing.managers import BaseManager | 
|  | 1515 | >>> class QueueManager(BaseManager): pass | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1516 | >>> QueueManager.register('get_queue') | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1517 | >>> m = QueueManager(address=('foo.bar.org', 50000), authkey=b'abracadabra') | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1518 | >>> m.connect() | 
|  | 1519 | >>> queue = m.get_queue() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1520 | >>> queue.get() | 
|  | 1521 | 'hello' | 
|  | 1522 |  | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1523 | Local processes can also access that queue, using the code from above on the | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1524 | client to access it remotely:: | 
|  | 1525 |  | 
|  | 1526 | >>> from multiprocessing import Process, Queue | 
|  | 1527 | >>> from multiprocessing.managers import BaseManager | 
|  | 1528 | >>> class Worker(Process): | 
|  | 1529 | ...     def __init__(self, q): | 
|  | 1530 | ...         self.q = q | 
|  | 1531 | ...         super(Worker, self).__init__() | 
|  | 1532 | ...     def run(self): | 
|  | 1533 | ...         self.q.put('local hello') | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1534 | ... | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1535 | >>> queue = Queue() | 
|  | 1536 | >>> w = Worker(queue) | 
|  | 1537 | >>> w.start() | 
|  | 1538 | >>> class QueueManager(BaseManager): pass | 
| Georg Brandl | 48310cd | 2009-01-03 21:18:54 +0000 | [diff] [blame] | 1539 | ... | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1540 | >>> QueueManager.register('get_queue', callable=lambda: queue) | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1541 | >>> m = QueueManager(address=('', 50000), authkey=b'abracadabra') | 
| Jesse Noller | 4523968 | 2008-11-28 18:46:19 +0000 | [diff] [blame] | 1542 | >>> s = m.get_server() | 
|  | 1543 | >>> s.serve_forever() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1544 |  | 
|  | 1545 | Proxy Objects | 
|  | 1546 | ~~~~~~~~~~~~~ | 
|  | 1547 |  | 
|  | 1548 | A proxy is an object which *refers* to a shared object which lives (presumably) | 
|  | 1549 | in a different process.  The shared object is said to be the *referent* of the | 
|  | 1550 | proxy.  Multiple proxy objects may have the same referent. | 
|  | 1551 |  | 
|  | 1552 | A proxy object has methods which invoke corresponding methods of its referent | 
|  | 1553 | (although not every method of the referent will necessarily be available through | 
|  | 1554 | the proxy).  A proxy can usually be used in most of the same ways that its | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1555 | referent can: | 
|  | 1556 |  | 
|  | 1557 | .. doctest:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1558 |  | 
|  | 1559 | >>> from multiprocessing import Manager | 
|  | 1560 | >>> manager = Manager() | 
|  | 1561 | >>> l = manager.list([i*i for i in range(10)]) | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1562 | >>> print(l) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1563 | [0, 1, 4, 9, 16, 25, 36, 49, 64, 81] | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1564 | >>> print(repr(l)) | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1565 | <ListProxy object, typeid 'list' at 0x...> | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1566 | >>> l[4] | 
|  | 1567 | 16 | 
|  | 1568 | >>> l[2:5] | 
|  | 1569 | [4, 9, 16] | 
|  | 1570 |  | 
|  | 1571 | Notice that applying :func:`str` to a proxy will return the representation of | 
|  | 1572 | the referent, whereas applying :func:`repr` will return the representation of | 
|  | 1573 | the proxy. | 
|  | 1574 |  | 
|  | 1575 | An important feature of proxy objects is that they are picklable so they can be | 
|  | 1576 | passed between processes.  Note, however, that if a proxy is sent to the | 
|  | 1577 | corresponding manager's process then unpickling it will produce the referent | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1578 | itself.  This means, for example, that one shared object can contain a second: | 
|  | 1579 |  | 
|  | 1580 | .. doctest:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1581 |  | 
|  | 1582 | >>> a = manager.list() | 
|  | 1583 | >>> b = manager.list() | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1584 | >>> a.append(b)         # referent of a now contains referent of b | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1585 | >>> print(a, b) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1586 | [[]] [] | 
|  | 1587 | >>> b.append('hello') | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 1588 | >>> print(a, b) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1589 | [['hello']] ['hello'] | 
|  | 1590 |  | 
|  | 1591 | .. note:: | 
|  | 1592 |  | 
|  | 1593 | The proxy types in :mod:`multiprocessing` do nothing to support comparisons | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1594 | by value.  So, for instance, we have: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1595 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1596 | .. doctest:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1597 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1598 | >>> manager.list([1,2,3]) == [1,2,3] | 
|  | 1599 | False | 
|  | 1600 |  | 
|  | 1601 | One should just use a copy of the referent instead when making comparisons. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1602 |  | 
|  | 1603 | .. class:: BaseProxy | 
|  | 1604 |  | 
|  | 1605 | Proxy objects are instances of subclasses of :class:`BaseProxy`. | 
|  | 1606 |  | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1607 | .. method:: _callmethod(methodname[, args[, kwds]]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1608 |  | 
|  | 1609 | Call and return the result of a method of the proxy's referent. | 
|  | 1610 |  | 
|  | 1611 | If ``proxy`` is a proxy whose referent is ``obj`` then the expression :: | 
|  | 1612 |  | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1613 | proxy._callmethod(methodname, args, kwds) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1614 |  | 
|  | 1615 | will evaluate the expression :: | 
|  | 1616 |  | 
|  | 1617 | getattr(obj, methodname)(*args, **kwds) | 
|  | 1618 |  | 
|  | 1619 | in the manager's process. | 
|  | 1620 |  | 
|  | 1621 | The returned value will be a copy of the result of the call or a proxy to | 
|  | 1622 | a new shared object -- see documentation for the *method_to_typeid* | 
|  | 1623 | argument of :meth:`BaseManager.register`. | 
|  | 1624 |  | 
| Ezio Melotti | e130a52 | 2011-10-19 10:58:56 +0300 | [diff] [blame] | 1625 | If an exception is raised by the call, then is re-raised by | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1626 | :meth:`_callmethod`.  If some other exception is raised in the manager's | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1627 | process then this is converted into a :exc:`RemoteError` exception and is | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1628 | raised by :meth:`_callmethod`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1629 |  | 
|  | 1630 | Note in particular that an exception will be raised if *methodname* has | 
|  | 1631 | not been *exposed* | 
|  | 1632 |  | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 1633 | An example of the usage of :meth:`_callmethod`: | 
|  | 1634 |  | 
|  | 1635 | .. doctest:: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1636 |  | 
|  | 1637 | >>> l = manager.list(range(10)) | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1638 | >>> l._callmethod('__len__') | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1639 | 10 | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1640 | >>> l._callmethod('__getslice__', (2, 7))   # equiv to `l[2:7]` | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1641 | [2, 3, 4, 5, 6] | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1642 | >>> l._callmethod('__getitem__', (20,))     # equiv to `l[20]` | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1643 | Traceback (most recent call last): | 
|  | 1644 | ... | 
|  | 1645 | IndexError: list index out of range | 
|  | 1646 |  | 
| Benjamin Peterson | 6ebe78f | 2008-12-21 00:06:59 +0000 | [diff] [blame] | 1647 | .. method:: _getvalue() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1648 |  | 
|  | 1649 | Return a copy of the referent. | 
|  | 1650 |  | 
|  | 1651 | If the referent is unpicklable then this will raise an exception. | 
|  | 1652 |  | 
|  | 1653 | .. method:: __repr__ | 
|  | 1654 |  | 
|  | 1655 | Return a representation of the proxy object. | 
|  | 1656 |  | 
|  | 1657 | .. method:: __str__ | 
|  | 1658 |  | 
|  | 1659 | Return the representation of the referent. | 
|  | 1660 |  | 
|  | 1661 |  | 
|  | 1662 | Cleanup | 
|  | 1663 | >>>>>>> | 
|  | 1664 |  | 
|  | 1665 | A proxy object uses a weakref callback so that when it gets garbage collected it | 
|  | 1666 | deregisters itself from the manager which owns its referent. | 
|  | 1667 |  | 
|  | 1668 | A shared object gets deleted from the manager process when there are no longer | 
|  | 1669 | any proxies referring to it. | 
|  | 1670 |  | 
|  | 1671 |  | 
|  | 1672 | Process Pools | 
|  | 1673 | ~~~~~~~~~~~~~ | 
|  | 1674 |  | 
|  | 1675 | .. module:: multiprocessing.pool | 
|  | 1676 | :synopsis: Create pools of processes. | 
|  | 1677 |  | 
|  | 1678 | One can create a pool of processes which will carry out tasks submitted to it | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1679 | with the :class:`Pool` class. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1680 |  | 
| R David Murray | ace5162 | 2012-10-06 22:26:52 -0400 | [diff] [blame] | 1681 | .. class:: Pool([processes[, initializer[, initargs[, maxtasksperchild]]]]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1682 |  | 
|  | 1683 | A process pool object which controls a pool of worker processes to which jobs | 
|  | 1684 | can be submitted.  It supports asynchronous results with timeouts and | 
|  | 1685 | callbacks and has a parallel map implementation. | 
|  | 1686 |  | 
|  | 1687 | *processes* is the number of worker processes to use.  If *processes* is | 
|  | 1688 | ``None`` then the number returned by :func:`cpu_count` is used.  If | 
|  | 1689 | *initializer* is not ``None`` then each worker process will call | 
|  | 1690 | ``initializer(*initargs)`` when it starts. | 
|  | 1691 |  | 
| Richard Oudkerk | b3c4b98 | 2013-07-02 12:32:00 +0100 | [diff] [blame] | 1692 | Note that the methods of the pool object should only be called by | 
|  | 1693 | the process which created the pool. | 
|  | 1694 |  | 
| Georg Brandl | 17ef0d5 | 2010-10-17 06:21:59 +0000 | [diff] [blame] | 1695 | .. versionadded:: 3.2 | 
|  | 1696 | *maxtasksperchild* is the number of tasks a worker process can complete | 
|  | 1697 | before it will exit and be replaced with a fresh worker process, to enable | 
|  | 1698 | unused resources to be freed. The default *maxtasksperchild* is None, which | 
|  | 1699 | means worker processes will live as long as the pool. | 
| Jesse Noller | 1f0b658 | 2010-01-27 03:36:01 +0000 | [diff] [blame] | 1700 |  | 
|  | 1701 | .. note:: | 
|  | 1702 |  | 
| Georg Brandl | 17ef0d5 | 2010-10-17 06:21:59 +0000 | [diff] [blame] | 1703 | Worker processes within a :class:`Pool` typically live for the complete | 
|  | 1704 | duration of the Pool's work queue. A frequent pattern found in other | 
|  | 1705 | systems (such as Apache, mod_wsgi, etc) to free resources held by | 
|  | 1706 | workers is to allow a worker within a pool to complete only a set | 
|  | 1707 | amount of work before being exiting, being cleaned up and a new | 
|  | 1708 | process spawned to replace the old one. The *maxtasksperchild* | 
|  | 1709 | argument to the :class:`Pool` exposes this ability to the end user. | 
| Jesse Noller | 1f0b658 | 2010-01-27 03:36:01 +0000 | [diff] [blame] | 1710 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1711 | .. method:: apply(func[, args[, kwds]]) | 
|  | 1712 |  | 
| Benjamin Peterson | 37d2fe0 | 2008-10-24 22:28:58 +0000 | [diff] [blame] | 1713 | Call *func* with arguments *args* and keyword arguments *kwds*.  It blocks | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 1714 | until the result is ready. Given this blocks, :meth:`apply_async` is | 
|  | 1715 | better suited for performing work in parallel. Additionally, *func* | 
|  | 1716 | is only executed in one of the workers of the pool. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1717 |  | 
| Ask Solem | 1d3b893 | 2010-11-09 21:36:56 +0000 | [diff] [blame] | 1718 | .. method:: apply_async(func[, args[, kwds[, callback[, error_callback]]]]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1719 |  | 
|  | 1720 | A variant of the :meth:`apply` method which returns a result object. | 
|  | 1721 |  | 
|  | 1722 | If *callback* is specified then it should be a callable which accepts a | 
|  | 1723 | single argument.  When the result becomes ready *callback* is applied to | 
| Ask Solem | 1d3b893 | 2010-11-09 21:36:56 +0000 | [diff] [blame] | 1724 | it, that is unless the call failed, in which case the *error_callback* | 
|  | 1725 | is applied instead | 
|  | 1726 |  | 
|  | 1727 | If *error_callback* is specified then it should be a callable which | 
|  | 1728 | accepts a single argument.  If the target function fails, then | 
|  | 1729 | the *error_callback* is called with the exception instance. | 
|  | 1730 |  | 
|  | 1731 | Callbacks should complete immediately since otherwise the thread which | 
|  | 1732 | handles the results will get blocked. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1733 |  | 
|  | 1734 | .. method:: map(func, iterable[, chunksize]) | 
|  | 1735 |  | 
| Georg Brandl | 22b3431 | 2009-07-26 14:54:51 +0000 | [diff] [blame] | 1736 | A parallel equivalent of the :func:`map` built-in function (it supports only | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 1737 | one *iterable* argument though).  It blocks until the result is ready. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1738 |  | 
|  | 1739 | This method chops the iterable into a number of chunks which it submits to | 
|  | 1740 | the process pool as separate tasks.  The (approximate) size of these | 
|  | 1741 | chunks can be specified by setting *chunksize* to a positive integer. | 
|  | 1742 |  | 
| Sandro Tosi | db79e95 | 2011-08-08 16:38:13 +0200 | [diff] [blame] | 1743 | .. method:: map_async(func, iterable[, chunksize[, callback[, error_callback]]]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1744 |  | 
| Georg Brandl | 502d9a5 | 2009-07-26 15:02:41 +0000 | [diff] [blame] | 1745 | A variant of the :meth:`.map` method which returns a result object. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1746 |  | 
|  | 1747 | If *callback* is specified then it should be a callable which accepts a | 
|  | 1748 | single argument.  When the result becomes ready *callback* is applied to | 
| Ask Solem | 1d3b893 | 2010-11-09 21:36:56 +0000 | [diff] [blame] | 1749 | it, that is unless the call failed, in which case the *error_callback* | 
|  | 1750 | is applied instead | 
|  | 1751 |  | 
|  | 1752 | If *error_callback* is specified then it should be a callable which | 
|  | 1753 | accepts a single argument.  If the target function fails, then | 
|  | 1754 | the *error_callback* is called with the exception instance. | 
|  | 1755 |  | 
|  | 1756 | Callbacks should complete immediately since otherwise the thread which | 
|  | 1757 | handles the results will get blocked. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1758 |  | 
|  | 1759 | .. method:: imap(func, iterable[, chunksize]) | 
|  | 1760 |  | 
| Georg Brandl | 9290503 | 2008-11-22 08:51:39 +0000 | [diff] [blame] | 1761 | A lazier version of :meth:`map`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1762 |  | 
|  | 1763 | The *chunksize* argument is the same as the one used by the :meth:`.map` | 
|  | 1764 | method.  For very long iterables using a large value for *chunksize* can | 
| Ezio Melotti | e130a52 | 2011-10-19 10:58:56 +0300 | [diff] [blame] | 1765 | make the job complete **much** faster than using the default value of | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1766 | ``1``. | 
|  | 1767 |  | 
| Georg Brandl | 502d9a5 | 2009-07-26 15:02:41 +0000 | [diff] [blame] | 1768 | Also if *chunksize* is ``1`` then the :meth:`!next` method of the iterator | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1769 | returned by the :meth:`imap` method has an optional *timeout* parameter: | 
|  | 1770 | ``next(timeout)`` will raise :exc:`multiprocessing.TimeoutError` if the | 
|  | 1771 | result cannot be returned within *timeout* seconds. | 
|  | 1772 |  | 
|  | 1773 | .. method:: imap_unordered(func, iterable[, chunksize]) | 
|  | 1774 |  | 
|  | 1775 | The same as :meth:`imap` except that the ordering of the results from the | 
|  | 1776 | returned iterator should be considered arbitrary.  (Only when there is | 
|  | 1777 | only one worker process is the order guaranteed to be "correct".) | 
|  | 1778 |  | 
| Antoine Pitrou | de911b2 | 2011-12-21 11:03:24 +0100 | [diff] [blame] | 1779 | .. method:: starmap(func, iterable[, chunksize]) | 
|  | 1780 |  | 
|  | 1781 | Like :meth:`map` except that the elements of the `iterable` are expected | 
|  | 1782 | to be iterables that are unpacked as arguments. | 
|  | 1783 |  | 
|  | 1784 | Hence an `iterable` of `[(1,2), (3, 4)]` results in `[func(1,2), | 
|  | 1785 | func(3,4)]`. | 
|  | 1786 |  | 
|  | 1787 | .. versionadded:: 3.3 | 
|  | 1788 |  | 
|  | 1789 | .. method:: starmap_async(func, iterable[, chunksize[, callback[, error_back]]]) | 
|  | 1790 |  | 
|  | 1791 | A combination of :meth:`starmap` and :meth:`map_async` that iterates over | 
|  | 1792 | `iterable` of iterables and calls `func` with the iterables unpacked. | 
|  | 1793 | Returns a result object. | 
|  | 1794 |  | 
|  | 1795 | .. versionadded:: 3.3 | 
|  | 1796 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1797 | .. method:: close() | 
|  | 1798 |  | 
|  | 1799 | Prevents any more tasks from being submitted to the pool.  Once all the | 
|  | 1800 | tasks have been completed the worker processes will exit. | 
|  | 1801 |  | 
|  | 1802 | .. method:: terminate() | 
|  | 1803 |  | 
|  | 1804 | Stops the worker processes immediately without completing outstanding | 
|  | 1805 | work.  When the pool object is garbage collected :meth:`terminate` will be | 
|  | 1806 | called immediately. | 
|  | 1807 |  | 
|  | 1808 | .. method:: join() | 
|  | 1809 |  | 
|  | 1810 | Wait for the worker processes to exit.  One must call :meth:`close` or | 
|  | 1811 | :meth:`terminate` before using :meth:`join`. | 
|  | 1812 |  | 
| Richard Oudkerk | d69cfe8 | 2012-06-18 17:47:52 +0100 | [diff] [blame] | 1813 | .. versionadded:: 3.3 | 
|  | 1814 | Pool objects now support the context manager protocol -- see | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1815 | :ref:`typecontextmanager`.  :meth:`~contextmanager.__enter__` returns the | 
| Georg Brandl | 325a1c2 | 2013-10-27 09:16:01 +0100 | [diff] [blame] | 1816 | pool object, and :meth:`~contextmanager.__exit__` calls :meth:`terminate`. | 
| Richard Oudkerk | d69cfe8 | 2012-06-18 17:47:52 +0100 | [diff] [blame] | 1817 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1818 |  | 
|  | 1819 | .. class:: AsyncResult | 
|  | 1820 |  | 
|  | 1821 | The class of the result returned by :meth:`Pool.apply_async` and | 
|  | 1822 | :meth:`Pool.map_async`. | 
|  | 1823 |  | 
| Georg Brandl | e3d70ae | 2008-11-22 08:54:21 +0000 | [diff] [blame] | 1824 | .. method:: get([timeout]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1825 |  | 
|  | 1826 | Return the result when it arrives.  If *timeout* is not ``None`` and the | 
|  | 1827 | result does not arrive within *timeout* seconds then | 
|  | 1828 | :exc:`multiprocessing.TimeoutError` is raised.  If the remote call raised | 
|  | 1829 | an exception then that exception will be reraised by :meth:`get`. | 
|  | 1830 |  | 
|  | 1831 | .. method:: wait([timeout]) | 
|  | 1832 |  | 
|  | 1833 | Wait until the result is available or until *timeout* seconds pass. | 
|  | 1834 |  | 
|  | 1835 | .. method:: ready() | 
|  | 1836 |  | 
|  | 1837 | Return whether the call has completed. | 
|  | 1838 |  | 
|  | 1839 | .. method:: successful() | 
|  | 1840 |  | 
|  | 1841 | Return whether the call completed without raising an exception.  Will | 
|  | 1842 | raise :exc:`AssertionError` if the result is not ready. | 
|  | 1843 |  | 
|  | 1844 | The following example demonstrates the use of a pool:: | 
|  | 1845 |  | 
|  | 1846 | from multiprocessing import Pool | 
|  | 1847 |  | 
|  | 1848 | def f(x): | 
|  | 1849 | return x*x | 
|  | 1850 |  | 
|  | 1851 | if __name__ == '__main__': | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 1852 | with Pool(processes=4) as pool:         # start 4 worker processes | 
|  | 1853 | result = pool.apply_async(f, (10,)) # evaluate "f(10)" asynchronously | 
|  | 1854 | print(result.get(timeout=1))        # prints "100" unless your computer is *very* slow | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1855 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 1856 | print(pool.map(f, range(10)))       # prints "[0, 1, 4,..., 81]" | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1857 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 1858 | it = pool.imap(f, range(10)) | 
|  | 1859 | print(next(it))                     # prints "0" | 
|  | 1860 | print(next(it))                     # prints "1" | 
|  | 1861 | print(it.next(timeout=1))           # prints "4" unless your computer is *very* slow | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1862 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 1863 | import time | 
|  | 1864 | result = pool.apply_async(time.sleep, (10,)) | 
|  | 1865 | print(result.get(timeout=1))        # raises TimeoutError | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1866 |  | 
|  | 1867 |  | 
|  | 1868 | .. _multiprocessing-listeners-clients: | 
|  | 1869 |  | 
|  | 1870 | Listeners and Clients | 
|  | 1871 | ~~~~~~~~~~~~~~~~~~~~~ | 
|  | 1872 |  | 
|  | 1873 | .. module:: multiprocessing.connection | 
|  | 1874 | :synopsis: API for dealing with sockets. | 
|  | 1875 |  | 
|  | 1876 | Usually message passing between processes is done using queues or by using | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1877 | :class:`~multiprocessing.Connection` objects returned by | 
|  | 1878 | :func:`~multiprocessing.Pipe`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1879 |  | 
|  | 1880 | However, the :mod:`multiprocessing.connection` module allows some extra | 
|  | 1881 | flexibility.  It basically gives a high level message oriented API for dealing | 
| Antoine Pitrou | bdb1cf1 | 2012-03-05 19:28:37 +0100 | [diff] [blame] | 1882 | with sockets or Windows named pipes.  It also has support for *digest | 
|  | 1883 | authentication* using the :mod:`hmac` module, and for polling | 
|  | 1884 | multiple connections at the same time. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1885 |  | 
|  | 1886 |  | 
|  | 1887 | .. function:: deliver_challenge(connection, authkey) | 
|  | 1888 |  | 
|  | 1889 | Send a randomly generated message to the other end of the connection and wait | 
|  | 1890 | for a reply. | 
|  | 1891 |  | 
|  | 1892 | If the reply matches the digest of the message using *authkey* as the key | 
|  | 1893 | then a welcome message is sent to the other end of the connection.  Otherwise | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 1894 | :exc:`~multiprocessing.AuthenticationError` is raised. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1895 |  | 
| Ezio Melotti | c09959a | 2013-04-10 17:59:20 +0300 | [diff] [blame] | 1896 | .. function:: answer_challenge(connection, authkey) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1897 |  | 
|  | 1898 | Receive a message, calculate the digest of the message using *authkey* as the | 
|  | 1899 | key, and then send the digest back. | 
|  | 1900 |  | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 1901 | If a welcome message is not received, then | 
|  | 1902 | :exc:`~multiprocessing.AuthenticationError` is raised. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1903 |  | 
|  | 1904 | .. function:: Client(address[, family[, authenticate[, authkey]]]) | 
|  | 1905 |  | 
|  | 1906 | Attempt to set up a connection to the listener which is using address | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 1907 | *address*, returning a :class:`~multiprocessing.Connection`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1908 |  | 
|  | 1909 | The type of the connection is determined by *family* argument, but this can | 
|  | 1910 | generally be omitted since it can usually be inferred from the format of | 
|  | 1911 | *address*. (See :ref:`multiprocessing-address-formats`) | 
|  | 1912 |  | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1913 | If *authenticate* is ``True`` or *authkey* is a byte string then digest | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1914 | authentication is used.  The key used for authentication will be either | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1915 | *authkey* or ``current_process().authkey`` if *authkey* is ``None``. | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 1916 | If authentication fails then | 
|  | 1917 | :exc:`~multiprocessing.AuthenticationError` is raised.  See | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1918 | :ref:`multiprocessing-auth-keys`. | 
|  | 1919 |  | 
|  | 1920 | .. class:: Listener([address[, family[, backlog[, authenticate[, authkey]]]]]) | 
|  | 1921 |  | 
|  | 1922 | A wrapper for a bound socket or Windows named pipe which is 'listening' for | 
|  | 1923 | connections. | 
|  | 1924 |  | 
|  | 1925 | *address* is the address to be used by the bound socket or named pipe of the | 
|  | 1926 | listener object. | 
|  | 1927 |  | 
| Benjamin Peterson | d23f822 | 2009-04-05 19:13:16 +0000 | [diff] [blame] | 1928 | .. note:: | 
|  | 1929 |  | 
|  | 1930 | If an address of '0.0.0.0' is used, the address will not be a connectable | 
|  | 1931 | end point on Windows. If you require a connectable end-point, | 
|  | 1932 | you should use '127.0.0.1'. | 
|  | 1933 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1934 | *family* is the type of socket (or named pipe) to use.  This can be one of | 
|  | 1935 | the strings ``'AF_INET'`` (for a TCP socket), ``'AF_UNIX'`` (for a Unix | 
|  | 1936 | domain socket) or ``'AF_PIPE'`` (for a Windows named pipe).  Of these only | 
|  | 1937 | the first is guaranteed to be available.  If *family* is ``None`` then the | 
|  | 1938 | family is inferred from the format of *address*.  If *address* is also | 
|  | 1939 | ``None`` then a default is chosen.  This default is the family which is | 
|  | 1940 | assumed to be the fastest available.  See | 
|  | 1941 | :ref:`multiprocessing-address-formats`.  Note that if *family* is | 
|  | 1942 | ``'AF_UNIX'`` and address is ``None`` then the socket will be created in a | 
|  | 1943 | private temporary directory created using :func:`tempfile.mkstemp`. | 
|  | 1944 |  | 
|  | 1945 | If the listener object uses a socket then *backlog* (1 by default) is passed | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1946 | to the :meth:`~socket.socket.listen` method of the socket once it has been | 
|  | 1947 | bound. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1948 |  | 
|  | 1949 | If *authenticate* is ``True`` (``False`` by default) or *authkey* is not | 
|  | 1950 | ``None`` then digest authentication is used. | 
|  | 1951 |  | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 1952 | If *authkey* is a byte string then it will be used as the | 
|  | 1953 | authentication key; otherwise it must be *None*. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1954 |  | 
|  | 1955 | If *authkey* is ``None`` and *authenticate* is ``True`` then | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 1956 | ``current_process().authkey`` is used as the authentication key.  If | 
| Alexandre Vassalotti | c57a84f | 2009-07-17 12:07:01 +0000 | [diff] [blame] | 1957 | *authkey* is ``None`` and *authenticate* is ``False`` then no | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1958 | authentication is done.  If authentication fails then | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 1959 | :exc:`~multiprocessing.AuthenticationError` is raised. | 
|  | 1960 | See :ref:`multiprocessing-auth-keys`. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1961 |  | 
|  | 1962 | .. method:: accept() | 
|  | 1963 |  | 
|  | 1964 | Accept a connection on the bound socket or named pipe of the listener | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1965 | object and return a :class:`~multiprocessing.Connection` object.  If | 
|  | 1966 | authentication is attempted and fails, then | 
| Eli Bendersky | b674dcf | 2012-07-13 09:45:31 +0300 | [diff] [blame] | 1967 | :exc:`~multiprocessing.AuthenticationError` is raised. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 1968 |  | 
|  | 1969 | .. method:: close() | 
|  | 1970 |  | 
|  | 1971 | Close the bound socket or named pipe of the listener object.  This is | 
|  | 1972 | called automatically when the listener is garbage collected.  However it | 
|  | 1973 | is advisable to call it explicitly. | 
|  | 1974 |  | 
|  | 1975 | Listener objects have the following read-only properties: | 
|  | 1976 |  | 
|  | 1977 | .. attribute:: address | 
|  | 1978 |  | 
|  | 1979 | The address which is being used by the Listener object. | 
|  | 1980 |  | 
|  | 1981 | .. attribute:: last_accepted | 
|  | 1982 |  | 
|  | 1983 | The address from which the last accepted connection came.  If this is | 
|  | 1984 | unavailable then it is ``None``. | 
|  | 1985 |  | 
| Richard Oudkerk | d69cfe8 | 2012-06-18 17:47:52 +0100 | [diff] [blame] | 1986 | .. versionadded:: 3.3 | 
|  | 1987 | Listener objects now support the context manager protocol -- see | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 1988 | :ref:`typecontextmanager`.  :meth:`~contextmanager.__enter__` returns the | 
| Georg Brandl | 325a1c2 | 2013-10-27 09:16:01 +0100 | [diff] [blame] | 1989 | listener object, and :meth:`~contextmanager.__exit__` calls :meth:`close`. | 
| Richard Oudkerk | d69cfe8 | 2012-06-18 17:47:52 +0100 | [diff] [blame] | 1990 |  | 
| Antoine Pitrou | bdb1cf1 | 2012-03-05 19:28:37 +0100 | [diff] [blame] | 1991 | .. function:: wait(object_list, timeout=None) | 
|  | 1992 |  | 
|  | 1993 | Wait till an object in *object_list* is ready.  Returns the list of | 
|  | 1994 | those objects in *object_list* which are ready.  If *timeout* is a | 
|  | 1995 | float then the call blocks for at most that many seconds.  If | 
|  | 1996 | *timeout* is ``None`` then it will block for an unlimited period. | 
| Richard Oudkerk | 59d5404 | 2012-05-10 16:11:12 +0100 | [diff] [blame] | 1997 | A negative timeout is equivalent to a zero timeout. | 
| Antoine Pitrou | bdb1cf1 | 2012-03-05 19:28:37 +0100 | [diff] [blame] | 1998 |  | 
|  | 1999 | For both Unix and Windows, an object can appear in *object_list* if | 
|  | 2000 | it is | 
|  | 2001 |  | 
|  | 2002 | * a readable :class:`~multiprocessing.Connection` object; | 
|  | 2003 | * a connected and readable :class:`socket.socket` object; or | 
|  | 2004 | * the :attr:`~multiprocessing.Process.sentinel` attribute of a | 
|  | 2005 | :class:`~multiprocessing.Process` object. | 
|  | 2006 |  | 
|  | 2007 | A connection or socket object is ready when there is data available | 
|  | 2008 | to be read from it, or the other end has been closed. | 
|  | 2009 |  | 
|  | 2010 | **Unix**: ``wait(object_list, timeout)`` almost equivalent | 
|  | 2011 | ``select.select(object_list, [], [], timeout)``.  The difference is | 
|  | 2012 | that, if :func:`select.select` is interrupted by a signal, it can | 
|  | 2013 | raise :exc:`OSError` with an error number of ``EINTR``, whereas | 
|  | 2014 | :func:`wait` will not. | 
|  | 2015 |  | 
|  | 2016 | **Windows**: An item in *object_list* must either be an integer | 
|  | 2017 | handle which is waitable (according to the definition used by the | 
|  | 2018 | documentation of the Win32 function ``WaitForMultipleObjects()``) | 
|  | 2019 | or it can be an object with a :meth:`fileno` method which returns a | 
|  | 2020 | socket handle or pipe handle.  (Note that pipe handles and socket | 
|  | 2021 | handles are **not** waitable handles.) | 
|  | 2022 |  | 
|  | 2023 | .. versionadded:: 3.3 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2024 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2025 |  | 
|  | 2026 | **Examples** | 
|  | 2027 |  | 
|  | 2028 | The following server code creates a listener which uses ``'secret password'`` as | 
|  | 2029 | an authentication key.  It then waits for a connection and sends some data to | 
|  | 2030 | the client:: | 
|  | 2031 |  | 
|  | 2032 | from multiprocessing.connection import Listener | 
|  | 2033 | from array import array | 
|  | 2034 |  | 
|  | 2035 | address = ('localhost', 6000)     # family is deduced to be 'AF_INET' | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2036 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2037 | with Listener(address, authkey=b'secret password') as listener: | 
|  | 2038 | with listener.accept() as conn: | 
|  | 2039 | print('connection accepted from', listener.last_accepted) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2040 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2041 | conn.send([2.25, None, 'junk', float]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2042 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2043 | conn.send_bytes(b'hello') | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2044 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2045 | conn.send_bytes(array('i', [42, 1729])) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2046 |  | 
|  | 2047 | The following code connects to the server and receives some data from the | 
|  | 2048 | server:: | 
|  | 2049 |  | 
|  | 2050 | from multiprocessing.connection import Client | 
|  | 2051 | from array import array | 
|  | 2052 |  | 
|  | 2053 | address = ('localhost', 6000) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2054 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2055 | with Client(address, authkey=b'secret password') as conn: | 
|  | 2056 | print(conn.recv())                  # => [2.25, None, 'junk', float] | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2057 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2058 | print(conn.recv_bytes())            # => 'hello' | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2059 |  | 
| Richard Oudkerk | 633c4d9 | 2012-06-18 21:29:36 +0100 | [diff] [blame] | 2060 | arr = array('i', [0, 0, 0, 0, 0]) | 
|  | 2061 | print(conn.recv_bytes_into(arr))    # => 8 | 
|  | 2062 | print(arr)                          # => array('i', [42, 1729, 0, 0, 0]) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2063 |  | 
| Antoine Pitrou | bdb1cf1 | 2012-03-05 19:28:37 +0100 | [diff] [blame] | 2064 | The following code uses :func:`~multiprocessing.connection.wait` to | 
|  | 2065 | wait for messages from multiple processes at once:: | 
|  | 2066 |  | 
|  | 2067 | import time, random | 
|  | 2068 | from multiprocessing import Process, Pipe, current_process | 
|  | 2069 | from multiprocessing.connection import wait | 
|  | 2070 |  | 
|  | 2071 | def foo(w): | 
|  | 2072 | for i in range(10): | 
|  | 2073 | w.send((i, current_process().name)) | 
|  | 2074 | w.close() | 
|  | 2075 |  | 
|  | 2076 | if __name__ == '__main__': | 
|  | 2077 | readers = [] | 
|  | 2078 |  | 
|  | 2079 | for i in range(4): | 
|  | 2080 | r, w = Pipe(duplex=False) | 
|  | 2081 | readers.append(r) | 
|  | 2082 | p = Process(target=foo, args=(w,)) | 
|  | 2083 | p.start() | 
|  | 2084 | # We close the writable end of the pipe now to be sure that | 
|  | 2085 | # p is the only process which owns a handle for it.  This | 
|  | 2086 | # ensures that when p closes its handle for the writable end, | 
|  | 2087 | # wait() will promptly report the readable end as being ready. | 
|  | 2088 | w.close() | 
|  | 2089 |  | 
|  | 2090 | while readers: | 
|  | 2091 | for r in wait(readers): | 
|  | 2092 | try: | 
|  | 2093 | msg = r.recv() | 
|  | 2094 | except EOFError: | 
|  | 2095 | readers.remove(r) | 
|  | 2096 | else: | 
|  | 2097 | print(msg) | 
|  | 2098 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2099 |  | 
|  | 2100 | .. _multiprocessing-address-formats: | 
|  | 2101 |  | 
|  | 2102 | Address Formats | 
|  | 2103 | >>>>>>>>>>>>>>> | 
|  | 2104 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2105 | * An ``'AF_INET'`` address is a tuple of the form ``(hostname, port)`` where | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2106 | *hostname* is a string and *port* is an integer. | 
|  | 2107 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2108 | * An ``'AF_UNIX'`` address is a string representing a filename on the | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2109 | filesystem. | 
|  | 2110 |  | 
|  | 2111 | * An ``'AF_PIPE'`` address is a string of the form | 
| Benjamin Peterson | da10d3b | 2009-01-01 00:23:30 +0000 | [diff] [blame] | 2112 | :samp:`r'\\\\.\\pipe\\{PipeName}'`.  To use :func:`Client` to connect to a named | 
| Georg Brandl | 1f01deb | 2009-01-03 22:47:39 +0000 | [diff] [blame] | 2113 | pipe on a remote computer called *ServerName* one should use an address of the | 
| Benjamin Peterson | 28d88b4 | 2009-01-09 03:03:23 +0000 | [diff] [blame] | 2114 | form :samp:`r'\\\\{ServerName}\\pipe\\{PipeName}'` instead. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2115 |  | 
|  | 2116 | Note that any string beginning with two backslashes is assumed by default to be | 
|  | 2117 | an ``'AF_PIPE'`` address rather than an ``'AF_UNIX'`` address. | 
|  | 2118 |  | 
|  | 2119 |  | 
|  | 2120 | .. _multiprocessing-auth-keys: | 
|  | 2121 |  | 
|  | 2122 | Authentication keys | 
|  | 2123 | ~~~~~~~~~~~~~~~~~~~ | 
|  | 2124 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2125 | When one uses :meth:`Connection.recv <multiprocessing.Connection.recv>`, the | 
|  | 2126 | data received is automatically | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2127 | unpickled.  Unfortunately unpickling data from an untrusted source is a security | 
|  | 2128 | risk.  Therefore :class:`Listener` and :func:`Client` use the :mod:`hmac` module | 
|  | 2129 | to provide digest authentication. | 
|  | 2130 |  | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 2131 | An authentication key is a byte string which can be thought of as a | 
|  | 2132 | password: once a connection is established both ends will demand proof | 
|  | 2133 | that the other knows the authentication key.  (Demonstrating that both | 
|  | 2134 | ends are using the same key does **not** involve sending the key over | 
|  | 2135 | the connection.) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2136 |  | 
| Richard Oudkerk | 264e9ac | 2012-08-17 14:39:18 +0100 | [diff] [blame] | 2137 | If authentication is requested but no authentication key is specified then the | 
| Benjamin Peterson | a786b02 | 2008-08-25 21:05:21 +0000 | [diff] [blame] | 2138 | return value of ``current_process().authkey`` is used (see | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2139 | :class:`~multiprocessing.Process`).  This value will automatically inherited by | 
|  | 2140 | any :class:`~multiprocessing.Process` object that the current process creates. | 
|  | 2141 | This means that (by default) all processes of a multi-process program will share | 
|  | 2142 | a single authentication key which can be used when setting up connections | 
| Benjamin Peterson | d23f822 | 2009-04-05 19:13:16 +0000 | [diff] [blame] | 2143 | between themselves. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2144 |  | 
|  | 2145 | Suitable authentication keys can also be generated by using :func:`os.urandom`. | 
|  | 2146 |  | 
|  | 2147 |  | 
|  | 2148 | Logging | 
|  | 2149 | ~~~~~~~ | 
|  | 2150 |  | 
|  | 2151 | Some support for logging is available.  Note, however, that the :mod:`logging` | 
|  | 2152 | package does not use process shared locks so it is possible (depending on the | 
|  | 2153 | handler type) for messages from different processes to get mixed up. | 
|  | 2154 |  | 
|  | 2155 | .. currentmodule:: multiprocessing | 
|  | 2156 | .. function:: get_logger() | 
|  | 2157 |  | 
|  | 2158 | Returns the logger used by :mod:`multiprocessing`.  If necessary, a new one | 
|  | 2159 | will be created. | 
|  | 2160 |  | 
| Jesse Noller | 41faa54 | 2009-01-25 03:45:53 +0000 | [diff] [blame] | 2161 | When first created the logger has level :data:`logging.NOTSET` and no | 
|  | 2162 | default handler. Messages sent to this logger will not by default propagate | 
|  | 2163 | to the root logger. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2164 |  | 
|  | 2165 | Note that on Windows child processes will only inherit the level of the | 
|  | 2166 | parent process's logger -- any other customization of the logger will not be | 
|  | 2167 | inherited. | 
|  | 2168 |  | 
| Jesse Noller | 41faa54 | 2009-01-25 03:45:53 +0000 | [diff] [blame] | 2169 | .. currentmodule:: multiprocessing | 
|  | 2170 | .. function:: log_to_stderr() | 
|  | 2171 |  | 
|  | 2172 | This function performs a call to :func:`get_logger` but in addition to | 
|  | 2173 | returning the logger created by get_logger, it adds a handler which sends | 
|  | 2174 | output to :data:`sys.stderr` using format | 
|  | 2175 | ``'[%(levelname)s/%(processName)s] %(message)s'``. | 
|  | 2176 |  | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2177 | Below is an example session with logging turned on:: | 
|  | 2178 |  | 
| Benjamin Peterson | 206e307 | 2008-10-19 14:07:49 +0000 | [diff] [blame] | 2179 | >>> import multiprocessing, logging | 
| Jesse Noller | 41faa54 | 2009-01-25 03:45:53 +0000 | [diff] [blame] | 2180 | >>> logger = multiprocessing.log_to_stderr() | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2181 | >>> logger.setLevel(logging.INFO) | 
|  | 2182 | >>> logger.warning('doomed') | 
|  | 2183 | [WARNING/MainProcess] doomed | 
| Benjamin Peterson | 206e307 | 2008-10-19 14:07:49 +0000 | [diff] [blame] | 2184 | >>> m = multiprocessing.Manager() | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 2185 | [INFO/SyncManager-...] child process calling self.run() | 
|  | 2186 | [INFO/SyncManager-...] created temp directory /.../pymp-... | 
|  | 2187 | [INFO/SyncManager-...] manager serving at '/.../listener-...' | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2188 | >>> del m | 
|  | 2189 | [INFO/MainProcess] sending shutdown message to manager | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 2190 | [INFO/SyncManager-...] manager exiting with exitcode 0 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2191 |  | 
| Jesse Noller | 41faa54 | 2009-01-25 03:45:53 +0000 | [diff] [blame] | 2192 | In addition to having these two logging functions, the multiprocessing also | 
|  | 2193 | exposes two additional logging level attributes. These are  :const:`SUBWARNING` | 
|  | 2194 | and :const:`SUBDEBUG`. The table below illustrates where theses fit in the | 
|  | 2195 | normal level hierarchy. | 
|  | 2196 |  | 
|  | 2197 | +----------------+----------------+ | 
|  | 2198 | | Level          | Numeric value  | | 
|  | 2199 | +================+================+ | 
|  | 2200 | | ``SUBWARNING`` | 25             | | 
|  | 2201 | +----------------+----------------+ | 
|  | 2202 | | ``SUBDEBUG``   | 5              | | 
|  | 2203 | +----------------+----------------+ | 
|  | 2204 |  | 
|  | 2205 | For a full table of logging levels, see the :mod:`logging` module. | 
|  | 2206 |  | 
|  | 2207 | These additional logging levels are used primarily for certain debug messages | 
|  | 2208 | within the multiprocessing module. Below is the same example as above, except | 
|  | 2209 | with :const:`SUBDEBUG` enabled:: | 
|  | 2210 |  | 
|  | 2211 | >>> import multiprocessing, logging | 
|  | 2212 | >>> logger = multiprocessing.log_to_stderr() | 
|  | 2213 | >>> logger.setLevel(multiprocessing.SUBDEBUG) | 
|  | 2214 | >>> logger.warning('doomed') | 
|  | 2215 | [WARNING/MainProcess] doomed | 
|  | 2216 | >>> m = multiprocessing.Manager() | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 2217 | [INFO/SyncManager-...] child process calling self.run() | 
|  | 2218 | [INFO/SyncManager-...] created temp directory /.../pymp-... | 
|  | 2219 | [INFO/SyncManager-...] manager serving at '/.../pymp-djGBXN/listener-...' | 
| Jesse Noller | 41faa54 | 2009-01-25 03:45:53 +0000 | [diff] [blame] | 2220 | >>> del m | 
|  | 2221 | [SUBDEBUG/MainProcess] finalizer calling ... | 
|  | 2222 | [INFO/MainProcess] sending shutdown message to manager | 
| R. David Murray | 8e8099c | 2009-04-28 18:02:00 +0000 | [diff] [blame] | 2223 | [DEBUG/SyncManager-...] manager received shutdown message | 
|  | 2224 | [SUBDEBUG/SyncManager-...] calling <Finalize object, callback=unlink, ... | 
|  | 2225 | [SUBDEBUG/SyncManager-...] finalizer calling <built-in function unlink> ... | 
|  | 2226 | [SUBDEBUG/SyncManager-...] calling <Finalize object, dead> | 
|  | 2227 | [SUBDEBUG/SyncManager-...] finalizer calling <function rmtree at 0x5aa730> ... | 
|  | 2228 | [INFO/SyncManager-...] manager exiting with exitcode 0 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2229 |  | 
|  | 2230 | The :mod:`multiprocessing.dummy` module | 
|  | 2231 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | 
|  | 2232 |  | 
|  | 2233 | .. module:: multiprocessing.dummy | 
|  | 2234 | :synopsis: Dumb wrapper around threading. | 
|  | 2235 |  | 
|  | 2236 | :mod:`multiprocessing.dummy` replicates the API of :mod:`multiprocessing` but is | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2237 | no more than a wrapper around the :mod:`threading` module. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2238 |  | 
|  | 2239 |  | 
|  | 2240 | .. _multiprocessing-programming: | 
|  | 2241 |  | 
|  | 2242 | Programming guidelines | 
|  | 2243 | ---------------------- | 
|  | 2244 |  | 
|  | 2245 | There are certain guidelines and idioms which should be adhered to when using | 
|  | 2246 | :mod:`multiprocessing`. | 
|  | 2247 |  | 
|  | 2248 |  | 
|  | 2249 | All platforms | 
|  | 2250 | ~~~~~~~~~~~~~ | 
|  | 2251 |  | 
|  | 2252 | Avoid shared state | 
|  | 2253 |  | 
|  | 2254 | As far as possible one should try to avoid shifting large amounts of data | 
|  | 2255 | between processes. | 
|  | 2256 |  | 
|  | 2257 | It is probably best to stick to using queues or pipes for communication | 
|  | 2258 | between processes rather than using the lower level synchronization | 
| Eli Bendersky | 78da3bc | 2012-07-13 10:10:05 +0300 | [diff] [blame] | 2259 | primitives. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2260 |  | 
|  | 2261 | Picklability | 
|  | 2262 |  | 
|  | 2263 | Ensure that the arguments to the methods of proxies are picklable. | 
|  | 2264 |  | 
|  | 2265 | Thread safety of proxies | 
|  | 2266 |  | 
|  | 2267 | Do not use a proxy object from more than one thread unless you protect it | 
|  | 2268 | with a lock. | 
|  | 2269 |  | 
|  | 2270 | (There is never a problem with different processes using the *same* proxy.) | 
|  | 2271 |  | 
|  | 2272 | Joining zombie processes | 
|  | 2273 |  | 
|  | 2274 | On Unix when a process finishes but has not been joined it becomes a zombie. | 
|  | 2275 | There should never be very many because each time a new process starts (or | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2276 | :func:`~multiprocessing.active_children` is called) all completed processes | 
|  | 2277 | which have not yet been joined will be joined.  Also calling a finished | 
|  | 2278 | process's :meth:`Process.is_alive <multiprocessing.Process.is_alive>` will | 
|  | 2279 | join the process.  Even so it is probably good | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2280 | practice to explicitly join all the processes that you start. | 
|  | 2281 |  | 
|  | 2282 | Better to inherit than pickle/unpickle | 
|  | 2283 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2284 | On Windows many types from :mod:`multiprocessing` need to be picklable so | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2285 | that child processes can use them.  However, one should generally avoid | 
|  | 2286 | sending shared objects to other processes using pipes or queues.  Instead | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 2287 | you should arrange the program so that a process which needs access to a | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2288 | shared resource created elsewhere can inherit it from an ancestor process. | 
|  | 2289 |  | 
|  | 2290 | Avoid terminating processes | 
|  | 2291 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2292 | Using the :meth:`Process.terminate <multiprocessing.Process.terminate>` | 
|  | 2293 | method to stop a process is liable to | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2294 | cause any shared resources (such as locks, semaphores, pipes and queues) | 
|  | 2295 | currently being used by the process to become broken or unavailable to other | 
|  | 2296 | processes. | 
|  | 2297 |  | 
|  | 2298 | Therefore it is probably best to only consider using | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2299 | :meth:`Process.terminate <multiprocessing.Process.terminate>` on processes | 
|  | 2300 | which never use any shared resources. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2301 |  | 
|  | 2302 | Joining processes that use queues | 
|  | 2303 |  | 
|  | 2304 | Bear in mind that a process that has put items in a queue will wait before | 
|  | 2305 | terminating until all the buffered items are fed by the "feeder" thread to | 
|  | 2306 | the underlying pipe.  (The child process can call the | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2307 | :meth:`Queue.cancel_join_thread <multiprocessing.Queue.cancel_join_thread>` | 
|  | 2308 | method of the queue to avoid this behaviour.) | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2309 |  | 
|  | 2310 | This means that whenever you use a queue you need to make sure that all | 
|  | 2311 | items which have been put on the queue will eventually be removed before the | 
|  | 2312 | process is joined.  Otherwise you cannot be sure that processes which have | 
|  | 2313 | put items on the queue will terminate.  Remember also that non-daemonic | 
|  | 2314 | processes will be automatically be joined. | 
|  | 2315 |  | 
|  | 2316 | An example which will deadlock is the following:: | 
|  | 2317 |  | 
|  | 2318 | from multiprocessing import Process, Queue | 
|  | 2319 |  | 
|  | 2320 | def f(q): | 
|  | 2321 | q.put('X' * 1000000) | 
|  | 2322 |  | 
|  | 2323 | if __name__ == '__main__': | 
|  | 2324 | queue = Queue() | 
|  | 2325 | p = Process(target=f, args=(queue,)) | 
|  | 2326 | p.start() | 
|  | 2327 | p.join()                    # this deadlocks | 
|  | 2328 | obj = queue.get() | 
|  | 2329 |  | 
|  | 2330 | A fix here would be to swap the last two lines round (or simply remove the | 
|  | 2331 | ``p.join()`` line). | 
|  | 2332 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2333 | Explicitly pass resources to child processes | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2334 |  | 
|  | 2335 | On Unix a child process can make use of a shared resource created in a | 
|  | 2336 | parent process using a global resource.  However, it is better to pass the | 
|  | 2337 | object as an argument to the constructor for the child process. | 
|  | 2338 |  | 
|  | 2339 | Apart from making the code (potentially) compatible with Windows this also | 
|  | 2340 | ensures that as long as the child process is still alive the object will not | 
|  | 2341 | be garbage collected in the parent process.  This might be important if some | 
|  | 2342 | resource is freed when the object is garbage collected in the parent | 
|  | 2343 | process. | 
|  | 2344 |  | 
|  | 2345 | So for instance :: | 
|  | 2346 |  | 
|  | 2347 | from multiprocessing import Process, Lock | 
|  | 2348 |  | 
|  | 2349 | def f(): | 
|  | 2350 | ... do something using "lock" ... | 
|  | 2351 |  | 
|  | 2352 | if __name__ == '__main__': | 
|  | 2353 | lock = Lock() | 
|  | 2354 | for i in range(10): | 
|  | 2355 | Process(target=f).start() | 
|  | 2356 |  | 
|  | 2357 | should be rewritten as :: | 
|  | 2358 |  | 
|  | 2359 | from multiprocessing import Process, Lock | 
|  | 2360 |  | 
|  | 2361 | def f(l): | 
|  | 2362 | ... do something using "l" ... | 
|  | 2363 |  | 
|  | 2364 | if __name__ == '__main__': | 
|  | 2365 | lock = Lock() | 
|  | 2366 | for i in range(10): | 
|  | 2367 | Process(target=f, args=(lock,)).start() | 
|  | 2368 |  | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 2369 | Beware of replacing :data:`sys.stdin` with a "file like object" | 
| Alexandre Vassalotti | c57a84f | 2009-07-17 12:07:01 +0000 | [diff] [blame] | 2370 |  | 
|  | 2371 | :mod:`multiprocessing` originally unconditionally called:: | 
|  | 2372 |  | 
|  | 2373 | os.close(sys.stdin.fileno()) | 
|  | 2374 |  | 
|  | 2375 | in the :meth:`multiprocessing.Process._bootstrap` method --- this resulted | 
|  | 2376 | in issues with processes-in-processes. This has been changed to:: | 
|  | 2377 |  | 
|  | 2378 | sys.stdin.close() | 
|  | 2379 | sys.stdin = open(os.devnull) | 
|  | 2380 |  | 
|  | 2381 | Which solves the fundamental issue of processes colliding with each other | 
|  | 2382 | resulting in a bad file descriptor error, but introduces a potential danger | 
|  | 2383 | to applications which replace :func:`sys.stdin` with a "file-like object" | 
|  | 2384 | with output buffering.  This danger is that if multiple processes call | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2385 | :meth:`~io.IOBase.close()` on this file-like object, it could result in the same | 
| Alexandre Vassalotti | c57a84f | 2009-07-17 12:07:01 +0000 | [diff] [blame] | 2386 | data being flushed to the object multiple times, resulting in corruption. | 
|  | 2387 |  | 
|  | 2388 | If you write a file-like object and implement your own caching, you can | 
|  | 2389 | make it fork-safe by storing the pid whenever you append to the cache, | 
|  | 2390 | and discarding the cache when the pid changes. For example:: | 
|  | 2391 |  | 
|  | 2392 | @property | 
|  | 2393 | def cache(self): | 
|  | 2394 | pid = os.getpid() | 
|  | 2395 | if pid != self._pid: | 
|  | 2396 | self._pid = pid | 
|  | 2397 | self._cache = [] | 
|  | 2398 | return self._cache | 
|  | 2399 |  | 
|  | 2400 | For more information, see :issue:`5155`, :issue:`5313` and :issue:`5331` | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2401 |  | 
|  | 2402 | Windows | 
|  | 2403 | ~~~~~~~ | 
|  | 2404 |  | 
|  | 2405 | Since Windows lacks :func:`os.fork` it has a few extra restrictions: | 
|  | 2406 |  | 
|  | 2407 | More picklability | 
|  | 2408 |  | 
|  | 2409 | Ensure that all arguments to :meth:`Process.__init__` are picklable.  This | 
|  | 2410 | means, in particular, that bound or unbound methods cannot be used directly | 
|  | 2411 | as the ``target`` argument on Windows --- just define a function and use | 
|  | 2412 | that instead. | 
|  | 2413 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2414 | Also, if you subclass :class:`~multiprocessing.Process` then make sure that | 
|  | 2415 | instances will be picklable when the :meth:`Process.start | 
|  | 2416 | <multiprocessing.Process.start>` method is called. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2417 |  | 
|  | 2418 | Global variables | 
|  | 2419 |  | 
|  | 2420 | Bear in mind that if code run in a child process tries to access a global | 
|  | 2421 | variable, then the value it sees (if any) may not be the same as the value | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2422 | in the parent process at the time that :meth:`Process.start | 
|  | 2423 | <multiprocessing.Process.start>` was called. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2424 |  | 
|  | 2425 | However, global variables which are just module level constants cause no | 
|  | 2426 | problems. | 
|  | 2427 |  | 
|  | 2428 | Safe importing of main module | 
|  | 2429 |  | 
|  | 2430 | Make sure that the main module can be safely imported by a new Python | 
|  | 2431 | interpreter without causing unintended side effects (such a starting a new | 
|  | 2432 | process). | 
|  | 2433 |  | 
|  | 2434 | For example, under Windows running the following module would fail with a | 
|  | 2435 | :exc:`RuntimeError`:: | 
|  | 2436 |  | 
|  | 2437 | from multiprocessing import Process | 
|  | 2438 |  | 
|  | 2439 | def foo(): | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 2440 | print('hello') | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2441 |  | 
|  | 2442 | p = Process(target=foo) | 
|  | 2443 | p.start() | 
|  | 2444 |  | 
|  | 2445 | Instead one should protect the "entry point" of the program by using ``if | 
|  | 2446 | __name__ == '__main__':`` as follows:: | 
|  | 2447 |  | 
|  | 2448 | from multiprocessing import Process, freeze_support | 
|  | 2449 |  | 
|  | 2450 | def foo(): | 
| Georg Brandl | 4970215 | 2008-09-29 06:43:45 +0000 | [diff] [blame] | 2451 | print('hello') | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2452 |  | 
|  | 2453 | if __name__ == '__main__': | 
|  | 2454 | freeze_support() | 
|  | 2455 | p = Process(target=foo) | 
|  | 2456 | p.start() | 
|  | 2457 |  | 
| Benjamin Peterson | 5289b2b | 2008-06-28 00:40:54 +0000 | [diff] [blame] | 2458 | (The ``freeze_support()`` line can be omitted if the program will be run | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2459 | normally instead of frozen.) | 
|  | 2460 |  | 
|  | 2461 | This allows the newly spawned Python interpreter to safely import the module | 
|  | 2462 | and then run the module's ``foo()`` function. | 
|  | 2463 |  | 
|  | 2464 | Similar restrictions apply if a pool or manager is created in the main | 
|  | 2465 | module. | 
|  | 2466 |  | 
|  | 2467 |  | 
|  | 2468 | .. _multiprocessing-examples: | 
|  | 2469 |  | 
|  | 2470 | Examples | 
|  | 2471 | -------- | 
|  | 2472 |  | 
|  | 2473 | Demonstration of how to create and use customized managers and proxies: | 
|  | 2474 |  | 
|  | 2475 | .. literalinclude:: ../includes/mp_newtype.py | 
| Ezio Melotti | f86b28e | 2012-04-13 20:50:48 -0600 | [diff] [blame] | 2476 | :language: python3 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2477 |  | 
|  | 2478 |  | 
| Serhiy Storchaka | 9e0ae53 | 2013-08-24 00:23:38 +0300 | [diff] [blame] | 2479 | Using :class:`~multiprocessing.pool.Pool`: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2480 |  | 
|  | 2481 | .. literalinclude:: ../includes/mp_pool.py | 
| Ezio Melotti | f86b28e | 2012-04-13 20:50:48 -0600 | [diff] [blame] | 2482 | :language: python3 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2483 |  | 
|  | 2484 |  | 
|  | 2485 | Synchronization types like locks, conditions and queues: | 
|  | 2486 |  | 
|  | 2487 | .. literalinclude:: ../includes/mp_synchronize.py | 
| Ezio Melotti | f86b28e | 2012-04-13 20:50:48 -0600 | [diff] [blame] | 2488 | :language: python3 | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2489 |  | 
|  | 2490 |  | 
| Georg Brandl | 0b37b33 | 2010-09-03 22:49:27 +0000 | [diff] [blame] | 2491 | An example showing how to use queues to feed tasks to a collection of worker | 
| Eli Bendersky | d08effe | 2011-12-31 07:20:26 +0200 | [diff] [blame] | 2492 | processes and collect the results: | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2493 |  | 
|  | 2494 | .. literalinclude:: ../includes/mp_workers.py | 
|  | 2495 |  | 
|  | 2496 |  | 
|  | 2497 | An example of how a pool of worker processes can each run a | 
| Georg Brandl | 47d48bb | 2010-07-10 11:51:06 +0000 | [diff] [blame] | 2498 | :class:`~http.server.SimpleHTTPRequestHandler` instance while sharing a single | 
|  | 2499 | listening socket. | 
| Benjamin Peterson | e711caf | 2008-06-11 16:44:04 +0000 | [diff] [blame] | 2500 |  | 
|  | 2501 | .. literalinclude:: ../includes/mp_webserver.py | 
|  | 2502 |  | 
|  | 2503 |  | 
|  | 2504 | Some simple benchmarks comparing :mod:`multiprocessing` with :mod:`threading`: | 
|  | 2505 |  | 
|  | 2506 | .. literalinclude:: ../includes/mp_benchmarks.py | 
|  | 2507 |  |