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