Antoine Pitrou | 64a467d | 2010-12-12 20:34:49 +0000 | [diff] [blame] | 1 | :mod:`threading` --- Thread-based parallelism |
| 2 | ============================================= |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 3 | |
| 4 | .. module:: threading |
Antoine Pitrou | 64a467d | 2010-12-12 20:34:49 +0000 | [diff] [blame] | 5 | :synopsis: Thread-based parallelism. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 6 | |
Raymond Hettinger | 1048094 | 2011-01-10 03:26:08 +0000 | [diff] [blame] | 7 | **Source code:** :source:`Lib/threading.py` |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 8 | |
Raymond Hettinger | 4f707fd | 2011-01-10 19:54:11 +0000 | [diff] [blame] | 9 | -------------- |
| 10 | |
Georg Brandl | 2067bfd | 2008-05-25 13:05:15 +0000 | [diff] [blame] | 11 | This module constructs higher-level threading interfaces on top of the lower |
| 12 | level :mod:`_thread` module. See also the :mod:`queue` module. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 13 | |
| 14 | The :mod:`dummy_threading` module is provided for situations where |
Georg Brandl | 2067bfd | 2008-05-25 13:05:15 +0000 | [diff] [blame] | 15 | :mod:`threading` cannot be used because :mod:`_thread` is missing. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 16 | |
Benjamin Peterson | 8bdd545 | 2008-08-18 22:38:41 +0000 | [diff] [blame] | 17 | .. note:: |
| 18 | |
Benjamin Peterson | b3085c9 | 2008-09-01 23:09:31 +0000 | [diff] [blame] | 19 | While they are not listed below, the ``camelCase`` names used for some |
| 20 | methods and functions in this module in the Python 2.x series are still |
| 21 | supported by this module. |
Benjamin Peterson | 8bdd545 | 2008-08-18 22:38:41 +0000 | [diff] [blame] | 22 | |
Antoine Pitrou | 0034281 | 2011-01-06 16:31:28 +0000 | [diff] [blame] | 23 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 24 | This module defines the following functions: |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 25 | |
| 26 | |
Benjamin Peterson | 672b803 | 2008-06-11 19:14:14 +0000 | [diff] [blame] | 27 | .. function:: active_count() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 28 | |
| 29 | Return the number of :class:`Thread` objects currently alive. The returned |
Benjamin Peterson | 4ac9ce4 | 2009-10-04 14:49:41 +0000 | [diff] [blame] | 30 | count is equal to the length of the list returned by :func:`.enumerate`. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 31 | |
| 32 | |
Benjamin Peterson | 672b803 | 2008-06-11 19:14:14 +0000 | [diff] [blame] | 33 | .. function:: current_thread() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 34 | |
| 35 | Return the current :class:`Thread` object, corresponding to the caller's thread |
| 36 | of control. If the caller's thread of control was not created through the |
| 37 | :mod:`threading` module, a dummy thread object with limited functionality is |
| 38 | returned. |
| 39 | |
| 40 | |
Victor Stinner | 2a12974 | 2011-05-30 23:02:52 +0200 | [diff] [blame] | 41 | .. function:: get_ident() |
| 42 | |
| 43 | Return the 'thread identifier' of the current thread. This is a nonzero |
| 44 | integer. Its value has no direct meaning; it is intended as a magic cookie |
| 45 | to be used e.g. to index a dictionary of thread-specific data. Thread |
| 46 | identifiers may be recycled when a thread exits and another thread is |
| 47 | created. |
| 48 | |
| 49 | .. versionadded:: 3.3 |
| 50 | |
| 51 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 52 | .. function:: enumerate() |
| 53 | |
Benjamin Peterson | 672b803 | 2008-06-11 19:14:14 +0000 | [diff] [blame] | 54 | Return a list of all :class:`Thread` objects currently alive. The list |
| 55 | includes daemonic threads, dummy thread objects created by |
| 56 | :func:`current_thread`, and the main thread. It excludes terminated threads |
| 57 | and threads that have not yet been started. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 58 | |
| 59 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 60 | .. function:: settrace(func) |
| 61 | |
| 62 | .. index:: single: trace function |
| 63 | |
| 64 | Set a trace function for all threads started from the :mod:`threading` module. |
| 65 | The *func* will be passed to :func:`sys.settrace` for each thread, before its |
| 66 | :meth:`run` method is called. |
| 67 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 68 | |
| 69 | .. function:: setprofile(func) |
| 70 | |
| 71 | .. index:: single: profile function |
| 72 | |
| 73 | Set a profile function for all threads started from the :mod:`threading` module. |
| 74 | The *func* will be passed to :func:`sys.setprofile` for each thread, before its |
| 75 | :meth:`run` method is called. |
| 76 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 77 | |
| 78 | .. function:: stack_size([size]) |
| 79 | |
| 80 | Return the thread stack size used when creating new threads. The optional |
| 81 | *size* argument specifies the stack size to be used for subsequently created |
| 82 | threads, and must be 0 (use platform or configured default) or a positive |
| 83 | integer value of at least 32,768 (32kB). If changing the thread stack size is |
Georg Brandl | 9a13b43 | 2012-04-05 09:53:04 +0200 | [diff] [blame] | 84 | unsupported, a :exc:`RuntimeError` is raised. If the specified stack size is |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 85 | invalid, a :exc:`ValueError` is raised and the stack size is unmodified. 32kB |
| 86 | is currently the minimum supported stack size value to guarantee sufficient |
| 87 | stack space for the interpreter itself. Note that some platforms may have |
| 88 | particular restrictions on values for the stack size, such as requiring a |
| 89 | minimum stack size > 32kB or requiring allocation in multiples of the system |
| 90 | memory page size - platform documentation should be referred to for more |
| 91 | information (4kB pages are common; using multiples of 4096 for the stack size is |
| 92 | the suggested approach in the absence of more specific information). |
| 93 | Availability: Windows, systems with POSIX threads. |
| 94 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 95 | |
Antoine Pitrou | 7c3e577 | 2010-04-14 15:44:10 +0000 | [diff] [blame] | 96 | This module also defines the following constant: |
| 97 | |
| 98 | .. data:: TIMEOUT_MAX |
| 99 | |
| 100 | The maximum value allowed for the *timeout* parameter of blocking functions |
| 101 | (:meth:`Lock.acquire`, :meth:`RLock.acquire`, :meth:`Condition.wait`, etc.). |
Georg Brandl | 6faee4e | 2010-09-21 14:48:28 +0000 | [diff] [blame] | 102 | Specifying a timeout greater than this value will raise an |
Antoine Pitrou | 7c3e577 | 2010-04-14 15:44:10 +0000 | [diff] [blame] | 103 | :exc:`OverflowError`. |
| 104 | |
Antoine Pitrou | adbc009 | 2010-04-19 14:05:51 +0000 | [diff] [blame] | 105 | .. versionadded:: 3.2 |
Antoine Pitrou | 7c3e577 | 2010-04-14 15:44:10 +0000 | [diff] [blame] | 106 | |
Georg Brandl | 67b21b7 | 2010-08-17 15:07:14 +0000 | [diff] [blame] | 107 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 108 | This module defines a number of classes, which are detailed in the sections |
| 109 | below. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 110 | |
| 111 | The design of this module is loosely based on Java's threading model. However, |
| 112 | where Java makes locks and condition variables basic behavior of every object, |
| 113 | they are separate objects in Python. Python's :class:`Thread` class supports a |
| 114 | subset of the behavior of Java's Thread class; currently, there are no |
| 115 | priorities, no thread groups, and threads cannot be destroyed, stopped, |
| 116 | suspended, resumed, or interrupted. The static methods of Java's Thread class, |
| 117 | when implemented, are mapped to module-level functions. |
| 118 | |
| 119 | All of the methods described below are executed atomically. |
| 120 | |
| 121 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 122 | Thread-Local Data |
| 123 | ----------------- |
| 124 | |
| 125 | Thread-local data is data whose values are thread specific. To manage |
| 126 | thread-local data, just create an instance of :class:`local` (or a |
| 127 | subclass) and store attributes on it:: |
| 128 | |
| 129 | mydata = threading.local() |
| 130 | mydata.x = 1 |
| 131 | |
| 132 | The instance's values will be different for separate threads. |
| 133 | |
| 134 | |
| 135 | .. class:: local() |
| 136 | |
| 137 | A class that represents thread-local data. |
| 138 | |
| 139 | For more details and extensive examples, see the documentation string of the |
| 140 | :mod:`_threading_local` module. |
| 141 | |
| 142 | |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 143 | .. _thread-objects: |
| 144 | |
| 145 | Thread Objects |
| 146 | -------------- |
| 147 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 148 | The :class:`Thread` class represents an activity that is run in a separate |
| 149 | thread of control. There are two ways to specify the activity: by passing a |
| 150 | callable object to the constructor, or by overriding the :meth:`~Thread.run` |
| 151 | method in a subclass. No other methods (except for the constructor) should be |
| 152 | overridden in a subclass. In other words, *only* override the |
| 153 | :meth:`~Thread.__init__` and :meth:`~Thread.run` methods of this class. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 154 | |
| 155 | Once a thread object is created, its activity must be started by calling the |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 156 | thread's :meth:`~Thread.start` method. This invokes the :meth:`~Thread.run` |
| 157 | method in a separate thread of control. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 158 | |
| 159 | Once the thread's activity is started, the thread is considered 'alive'. It |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 160 | stops being alive when its :meth:`~Thread.run` method terminates -- either |
| 161 | normally, or by raising an unhandled exception. The :meth:`~Thread.is_alive` |
| 162 | method tests whether the thread is alive. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 163 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 164 | Other threads can call a thread's :meth:`~Thread.join` method. This blocks |
| 165 | the calling thread until the thread whose :meth:`~Thread.join` method is |
| 166 | called is terminated. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 167 | |
| 168 | A thread has a name. The name can be passed to the constructor, and read or |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 169 | changed through the :attr:`~Thread.name` attribute. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 170 | |
| 171 | A thread can be flagged as a "daemon thread". The significance of this flag is |
| 172 | that the entire Python program exits when only daemon threads are left. The |
| 173 | initial value is inherited from the creating thread. The flag can be set |
Antoine Pitrou | 61d85ba | 2012-04-10 22:51:26 +0200 | [diff] [blame] | 174 | through the :attr:`~Thread.daemon` property or the *daemon* constructor |
| 175 | argument. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 176 | |
| 177 | There is a "main thread" object; this corresponds to the initial thread of |
| 178 | control in the Python program. It is not a daemon thread. |
| 179 | |
| 180 | There is the possibility that "dummy thread objects" are created. These are |
| 181 | thread objects corresponding to "alien threads", which are threads of control |
| 182 | started outside the threading module, such as directly from C code. Dummy |
| 183 | thread objects have limited functionality; they are always considered alive and |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 184 | daemonic, and cannot be :meth:`~Thread.join`\ ed. They are never deleted, |
| 185 | since it is impossible to detect the termination of alien threads. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 186 | |
| 187 | |
Ezio Melotti | 8b61611 | 2012-09-08 20:49:18 +0300 | [diff] [blame] | 188 | .. class:: Thread(group=None, target=None, name=None, args=(), kwargs={}, *, \ |
| 189 | daemon=None) |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 190 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 191 | This constructor should always be called with keyword arguments. Arguments |
| 192 | are: |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 193 | |
| 194 | *group* should be ``None``; reserved for future extension when a |
| 195 | :class:`ThreadGroup` class is implemented. |
| 196 | |
| 197 | *target* is the callable object to be invoked by the :meth:`run` method. |
| 198 | Defaults to ``None``, meaning nothing is called. |
| 199 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 200 | *name* is the thread name. By default, a unique name is constructed of the |
| 201 | form "Thread-*N*" where *N* is a small decimal number. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 202 | |
| 203 | *args* is the argument tuple for the target invocation. Defaults to ``()``. |
| 204 | |
| 205 | *kwargs* is a dictionary of keyword arguments for the target invocation. |
| 206 | Defaults to ``{}``. |
| 207 | |
Antoine Pitrou | 0bd4deb | 2011-02-25 22:07:43 +0000 | [diff] [blame] | 208 | If not ``None``, *daemon* explicitly sets whether the thread is daemonic. |
| 209 | If ``None`` (the default), the daemonic property is inherited from the |
| 210 | current thread. |
| 211 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 212 | If the subclass overrides the constructor, it must make sure to invoke the |
| 213 | base class constructor (``Thread.__init__()``) before doing anything else to |
| 214 | the thread. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 215 | |
Antoine Pitrou | 0bd4deb | 2011-02-25 22:07:43 +0000 | [diff] [blame] | 216 | .. versionchanged:: 3.3 |
| 217 | Added the *daemon* argument. |
| 218 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 219 | .. method:: start() |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 220 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 221 | Start the thread's activity. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 222 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 223 | It must be called at most once per thread object. It arranges for the |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 224 | object's :meth:`~Thread.run` method to be invoked in a separate thread |
| 225 | of control. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 226 | |
Brian Curtin | bd0c897 | 2011-01-31 19:35:02 +0000 | [diff] [blame] | 227 | This method will raise a :exc:`RuntimeError` if called more than once |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 228 | on the same thread object. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 229 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 230 | .. method:: run() |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 231 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 232 | Method representing the thread's activity. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 233 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 234 | You may override this method in a subclass. The standard :meth:`run` |
| 235 | method invokes the callable object passed to the object's constructor as |
| 236 | the *target* argument, if any, with sequential and keyword arguments taken |
| 237 | from the *args* and *kwargs* arguments, respectively. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 238 | |
Georg Brandl | 7f01a13 | 2009-09-16 15:58:14 +0000 | [diff] [blame] | 239 | .. method:: join(timeout=None) |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 240 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 241 | Wait until the thread terminates. This blocks the calling thread until |
| 242 | the thread whose :meth:`~Thread.join` method is called terminates -- either |
| 243 | normally or through an unhandled exception --, or until the optional |
| 244 | timeout occurs. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 245 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 246 | When the *timeout* argument is present and not ``None``, it should be a |
| 247 | floating point number specifying a timeout for the operation in seconds |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 248 | (or fractions thereof). As :meth:`~Thread.join` always returns ``None``, |
| 249 | you must call :meth:`~Thread.is_alive` after :meth:`~Thread.join` to |
| 250 | decide whether a timeout happened -- if the thread is still alive, the |
| 251 | :meth:`~Thread.join` call timed out. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 252 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 253 | When the *timeout* argument is not present or ``None``, the operation will |
| 254 | block until the thread terminates. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 255 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 256 | A thread can be :meth:`~Thread.join`\ ed many times. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 257 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 258 | :meth:`~Thread.join` raises a :exc:`RuntimeError` if an attempt is made |
| 259 | to join the current thread as that would cause a deadlock. It is also |
| 260 | an error to :meth:`~Thread.join` a thread before it has been started |
| 261 | and attempts to do so raise the same exception. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 262 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 263 | .. attribute:: name |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 264 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 265 | A string used for identification purposes only. It has no semantics. |
| 266 | Multiple threads may be given the same name. The initial name is set by |
| 267 | the constructor. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 268 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 269 | .. method:: getName() |
| 270 | setName() |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 271 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 272 | Old getter/setter API for :attr:`~Thread.name`; use it directly as a |
| 273 | property instead. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 274 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 275 | .. attribute:: ident |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 276 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 277 | The 'thread identifier' of this thread or ``None`` if the thread has not |
| 278 | been started. This is a nonzero integer. See the |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 279 | :func:`_thread.get_ident()` function. Thread identifiers may be recycled |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 280 | when a thread exits and another thread is created. The identifier is |
| 281 | available even after the thread has exited. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 282 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 283 | .. method:: is_alive() |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 284 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 285 | Return whether the thread is alive. |
Georg Brandl | 770b0be | 2009-01-02 20:10:05 +0000 | [diff] [blame] | 286 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 287 | This method returns ``True`` just before the :meth:`~Thread.run` method |
| 288 | starts until just after the :meth:`~Thread.run` method terminates. The |
| 289 | module function :func:`.enumerate` returns a list of all alive threads. |
Georg Brandl | 770b0be | 2009-01-02 20:10:05 +0000 | [diff] [blame] | 290 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 291 | .. attribute:: daemon |
Georg Brandl | 770b0be | 2009-01-02 20:10:05 +0000 | [diff] [blame] | 292 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 293 | A boolean value indicating whether this thread is a daemon thread (True) |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 294 | or not (False). This must be set before :meth:`~Thread.start` is called, |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 295 | otherwise :exc:`RuntimeError` is raised. Its initial value is inherited |
| 296 | from the creating thread; the main thread is not a daemon thread and |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 297 | therefore all threads created in the main thread default to |
| 298 | :attr:`~Thread.daemon` = ``False``. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 299 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 300 | The entire Python program exits when no alive non-daemon threads are left. |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 301 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 302 | .. method:: isDaemon() |
| 303 | setDaemon() |
Georg Brandl | a971c65 | 2008-11-07 09:39:56 +0000 | [diff] [blame] | 304 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 305 | Old getter/setter API for :attr:`~Thread.daemon`; use it directly as a |
| 306 | property instead. |
Georg Brandl | 770b0be | 2009-01-02 20:10:05 +0000 | [diff] [blame] | 307 | |
| 308 | |
Antoine Pitrou | d6d17c5 | 2011-02-28 22:04:51 +0000 | [diff] [blame] | 309 | .. impl-detail:: |
| 310 | |
| 311 | Due to the :term:`Global Interpreter Lock`, in CPython only one thread |
| 312 | can execute Python code at once (even though certain performance-oriented |
| 313 | libraries might overcome this limitation). |
| 314 | If you want your application to make better of use of the computational |
| 315 | resources of multi-core machines, you are advised to use |
| 316 | :mod:`multiprocessing` or :class:`concurrent.futures.ProcessPoolExecutor`. |
| 317 | However, threading is still an appropriate model if you want to run |
| 318 | multiple I/O-bound tasks simultaneously. |
| 319 | |
| 320 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 321 | .. _lock-objects: |
| 322 | |
| 323 | Lock Objects |
| 324 | ------------ |
| 325 | |
| 326 | A primitive lock is a synchronization primitive that is not owned by a |
| 327 | particular thread when locked. In Python, it is currently the lowest level |
Georg Brandl | 2067bfd | 2008-05-25 13:05:15 +0000 | [diff] [blame] | 328 | synchronization primitive available, implemented directly by the :mod:`_thread` |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 329 | extension module. |
| 330 | |
| 331 | A primitive lock is in one of two states, "locked" or "unlocked". It is created |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 332 | in the unlocked state. It has two basic methods, :meth:`~Lock.acquire` and |
| 333 | :meth:`~Lock.release`. When the state is unlocked, :meth:`~Lock.acquire` |
| 334 | changes the state to locked and returns immediately. When the state is locked, |
| 335 | :meth:`~Lock.acquire` blocks until a call to :meth:`~Lock.release` in another |
| 336 | thread changes it to unlocked, then the :meth:`~Lock.acquire` call resets it |
| 337 | to locked and returns. The :meth:`~Lock.release` method should only be |
| 338 | called in the locked state; it changes the state to unlocked and returns |
| 339 | immediately. If an attempt is made to release an unlocked lock, a |
| 340 | :exc:`RuntimeError` will be raised. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 341 | |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 342 | Locks also support the :ref:`context manager protocol <with-locks>`. |
| 343 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 344 | When more than one thread is blocked in :meth:`~Lock.acquire` waiting for the |
| 345 | state to turn to unlocked, only one thread proceeds when a :meth:`~Lock.release` |
| 346 | call resets the state to unlocked; which one of the waiting threads proceeds |
| 347 | is not defined, and may vary across implementations. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 348 | |
| 349 | All methods are executed atomically. |
| 350 | |
| 351 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 352 | .. class:: Lock() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 353 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 354 | The class implementing primitive lock objects. Once a thread has acquired a |
| 355 | lock, subsequent attempts to acquire it block, until it is released; any |
| 356 | thread may release it. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 357 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 358 | .. versionchanged:: 3.3 |
| 359 | Changed from a factory function to a class. |
Antoine Pitrou | 810023d | 2010-12-15 22:59:16 +0000 | [diff] [blame] | 360 | |
Georg Brandl | 67b21b7 | 2010-08-17 15:07:14 +0000 | [diff] [blame] | 361 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 362 | .. method:: acquire(blocking=True, timeout=-1) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 363 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 364 | Acquire a lock, blocking or non-blocking. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 365 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 366 | When invoked with the *blocking* argument set to ``True`` (the default), |
| 367 | block until the lock is unlocked, then set it to locked and return ``True``. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 368 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 369 | When invoked with the *blocking* argument set to ``False``, do not block. |
| 370 | If a call with *blocking* set to ``True`` would block, return ``False`` |
| 371 | immediately; otherwise, set the lock to locked and return ``True``. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 372 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 373 | When invoked with the floating-point *timeout* argument set to a positive |
| 374 | value, block for at most the number of seconds specified by *timeout* |
| 375 | and as long as the lock cannot be acquired. A negative *timeout* argument |
| 376 | specifies an unbounded wait. It is forbidden to specify a *timeout* |
| 377 | when *blocking* is false. |
| 378 | |
| 379 | The return value is ``True`` if the lock is acquired successfully, |
| 380 | ``False`` if not (for example if the *timeout* expired). |
| 381 | |
| 382 | .. versionchanged:: 3.2 |
| 383 | The *timeout* parameter is new. |
| 384 | |
| 385 | .. versionchanged:: 3.2 |
| 386 | Lock acquires can now be interrupted by signals on POSIX. |
| 387 | |
| 388 | |
| 389 | .. method:: release() |
| 390 | |
| 391 | Release a lock. This can be called from any thread, not only the thread |
| 392 | which has acquired the lock. |
| 393 | |
| 394 | When the lock is locked, reset it to unlocked, and return. If any other threads |
| 395 | are blocked waiting for the lock to become unlocked, allow exactly one of them |
| 396 | to proceed. |
| 397 | |
| 398 | When invoked on an unlocked lock, a :exc:`RuntimeError` is raised. |
| 399 | |
| 400 | There is no return value. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 401 | |
| 402 | |
| 403 | .. _rlock-objects: |
| 404 | |
| 405 | RLock Objects |
| 406 | ------------- |
| 407 | |
| 408 | A reentrant lock is a synchronization primitive that may be acquired multiple |
| 409 | times by the same thread. Internally, it uses the concepts of "owning thread" |
| 410 | and "recursion level" in addition to the locked/unlocked state used by primitive |
| 411 | locks. In the locked state, some thread owns the lock; in the unlocked state, |
| 412 | no thread owns it. |
| 413 | |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 414 | To lock the lock, a thread calls its :meth:`~RLock.acquire` method; this |
| 415 | returns once the thread owns the lock. To unlock the lock, a thread calls |
| 416 | its :meth:`~Lock.release` method. :meth:`~Lock.acquire`/:meth:`~Lock.release` |
| 417 | call pairs may be nested; only the final :meth:`~Lock.release` (the |
| 418 | :meth:`~Lock.release` of the outermost pair) resets the lock to unlocked and |
| 419 | allows another thread blocked in :meth:`~Lock.acquire` to proceed. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 420 | |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 421 | Reentrant locks also support the :ref:`context manager protocol <with-locks>`. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 422 | |
| 423 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 424 | .. class:: RLock() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 425 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 426 | This class implements reentrant lock objects. A reentrant lock must be |
| 427 | released by the thread that acquired it. Once a thread has acquired a |
| 428 | reentrant lock, the same thread may acquire it again without blocking; the |
| 429 | thread must release it once for each time it has acquired it. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 430 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 431 | Note that ``RLock`` is actually a factory function which returns an instance |
| 432 | of the most efficient version of the concrete RLock class that is supported |
| 433 | by the platform. |
Antoine Pitrou | adbc009 | 2010-04-19 14:05:51 +0000 | [diff] [blame] | 434 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 435 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 436 | .. method:: acquire(blocking=True, timeout=-1) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 437 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 438 | Acquire a lock, blocking or non-blocking. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 439 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 440 | When invoked without arguments: if this thread already owns the lock, increment |
| 441 | the recursion level by one, and return immediately. Otherwise, if another |
| 442 | thread owns the lock, block until the lock is unlocked. Once the lock is |
| 443 | unlocked (not owned by any thread), then grab ownership, set the recursion level |
| 444 | to one, and return. If more than one thread is blocked waiting until the lock |
| 445 | is unlocked, only one at a time will be able to grab ownership of the lock. |
| 446 | There is no return value in this case. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 447 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 448 | When invoked with the *blocking* argument set to true, do the same thing as when |
| 449 | called without arguments, and return true. |
| 450 | |
| 451 | When invoked with the *blocking* argument set to false, do not block. If a call |
| 452 | without an argument would block, return false immediately; otherwise, do the |
| 453 | same thing as when called without arguments, and return true. |
| 454 | |
| 455 | When invoked with the floating-point *timeout* argument set to a positive |
| 456 | value, block for at most the number of seconds specified by *timeout* |
| 457 | and as long as the lock cannot be acquired. Return true if the lock has |
| 458 | been acquired, false if the timeout has elapsed. |
| 459 | |
| 460 | .. versionchanged:: 3.2 |
| 461 | The *timeout* parameter is new. |
| 462 | |
| 463 | |
| 464 | .. method:: release() |
| 465 | |
| 466 | Release a lock, decrementing the recursion level. If after the decrement it is |
| 467 | zero, reset the lock to unlocked (not owned by any thread), and if any other |
| 468 | threads are blocked waiting for the lock to become unlocked, allow exactly one |
| 469 | of them to proceed. If after the decrement the recursion level is still |
| 470 | nonzero, the lock remains locked and owned by the calling thread. |
| 471 | |
| 472 | Only call this method when the calling thread owns the lock. A |
| 473 | :exc:`RuntimeError` is raised if this method is called when the lock is |
| 474 | unlocked. |
| 475 | |
| 476 | There is no return value. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 477 | |
| 478 | |
| 479 | .. _condition-objects: |
| 480 | |
| 481 | Condition Objects |
| 482 | ----------------- |
| 483 | |
| 484 | A condition variable is always associated with some kind of lock; this can be |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 485 | passed in or one will be created by default. Passing one in is useful when |
| 486 | several condition variables must share the same lock. The lock is part of |
| 487 | the condition object: you don't have to track it separately. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 488 | |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 489 | A condition variable obeys the :ref:`context manager protocol <with-locks>`: |
| 490 | using the ``with`` statement acquires the associated lock for the duration of |
| 491 | the enclosed block. The :meth:`~Condition.acquire` and |
| 492 | :meth:`~Condition.release` methods also call the corresponding methods of |
| 493 | the associated lock. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 494 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 495 | Other methods must be called with the associated lock held. The |
| 496 | :meth:`~Condition.wait` method releases the lock, and then blocks until |
| 497 | another thread awakens it by calling :meth:`~Condition.notify` or |
| 498 | :meth:`~Condition.notify_all`. Once awakened, :meth:`~Condition.wait` |
| 499 | re-acquires the lock and returns. It is also possible to specify a timeout. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 500 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 501 | The :meth:`~Condition.notify` method wakes up one of the threads waiting for |
| 502 | the condition variable, if any are waiting. The :meth:`~Condition.notify_all` |
| 503 | method wakes up all threads waiting for the condition variable. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 504 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 505 | Note: the :meth:`~Condition.notify` and :meth:`~Condition.notify_all` methods |
| 506 | don't release the lock; this means that the thread or threads awakened will |
| 507 | not return from their :meth:`~Condition.wait` call immediately, but only when |
| 508 | the thread that called :meth:`~Condition.notify` or :meth:`~Condition.notify_all` |
| 509 | finally relinquishes ownership of the lock. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 510 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 511 | The typical programming style using condition variables uses the lock to |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 512 | synchronize access to some shared state; threads that are interested in a |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 513 | particular change of state call :meth:`~Condition.wait` repeatedly until they |
| 514 | see the desired state, while threads that modify the state call |
| 515 | :meth:`~Condition.notify` or :meth:`~Condition.notify_all` when they change |
| 516 | the state in such a way that it could possibly be a desired state for one |
| 517 | of the waiters. For example, the following code is a generic |
| 518 | producer-consumer situation with unlimited buffer capacity:: |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 519 | |
| 520 | # Consume one item |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 521 | with cv: |
| 522 | while not an_item_is_available(): |
| 523 | cv.wait() |
| 524 | get_an_available_item() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 525 | |
| 526 | # Produce one item |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 527 | with cv: |
| 528 | make_an_item_available() |
Antoine Pitrou | f6cd9b2 | 2012-04-11 19:37:56 +0200 | [diff] [blame] | 529 | cv.notify() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 530 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 531 | The ``while`` loop checking for the application's condition is necessary |
| 532 | because :meth:`~Condition.wait` can return after an arbitrary long time, |
Antoine Pitrou | f6cd9b2 | 2012-04-11 19:37:56 +0200 | [diff] [blame] | 533 | and the condition which prompted the :meth:`~Condition.notify` call may |
| 534 | no longer hold true. This is inherent to multi-threaded programming. The |
| 535 | :meth:`~Condition.wait_for` method can be used to automate the condition |
| 536 | checking, and eases the computation of timeouts:: |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 537 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 538 | # Consume an item |
| 539 | with cv: |
| 540 | cv.wait_for(an_item_is_available) |
| 541 | get_an_available_item() |
Kristján Valur Jónsson | 6331520 | 2010-11-18 12:46:39 +0000 | [diff] [blame] | 542 | |
Antoine Pitrou | 126aef7 | 2012-04-10 22:24:05 +0200 | [diff] [blame] | 543 | To choose between :meth:`~Condition.notify` and :meth:`~Condition.notify_all`, |
| 544 | consider whether one state change can be interesting for only one or several |
| 545 | waiting threads. E.g. in a typical producer-consumer situation, adding one |
| 546 | item to the buffer only needs to wake up one consumer thread. |
| 547 | |
| 548 | |
Georg Brandl | 7f01a13 | 2009-09-16 15:58:14 +0000 | [diff] [blame] | 549 | .. class:: Condition(lock=None) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 550 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 551 | This class implements condition variable objects. A condition variable |
| 552 | allows one or more threads to wait until they are notified by another thread. |
| 553 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 554 | If the *lock* argument is given and not ``None``, it must be a :class:`Lock` |
| 555 | or :class:`RLock` object, and it is used as the underlying lock. Otherwise, |
| 556 | a new :class:`RLock` object is created and used as the underlying lock. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 557 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 558 | .. versionchanged:: 3.3 |
| 559 | changed from a factory function to a class. |
| 560 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 561 | .. method:: acquire(*args) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 562 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 563 | Acquire the underlying lock. This method calls the corresponding method on |
| 564 | the underlying lock; the return value is whatever that method returns. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 565 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 566 | .. method:: release() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 567 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 568 | Release the underlying lock. This method calls the corresponding method on |
| 569 | the underlying lock; there is no return value. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 570 | |
Georg Brandl | 7f01a13 | 2009-09-16 15:58:14 +0000 | [diff] [blame] | 571 | .. method:: wait(timeout=None) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 572 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 573 | Wait until notified or until a timeout occurs. If the calling thread has |
| 574 | not acquired the lock when this method is called, a :exc:`RuntimeError` is |
| 575 | raised. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 576 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 577 | This method releases the underlying lock, and then blocks until it is |
| 578 | awakened by a :meth:`notify` or :meth:`notify_all` call for the same |
| 579 | condition variable in another thread, or until the optional timeout |
| 580 | occurs. Once awakened or timed out, it re-acquires the lock and returns. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 581 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 582 | When the *timeout* argument is present and not ``None``, it should be a |
| 583 | floating point number specifying a timeout for the operation in seconds |
| 584 | (or fractions thereof). |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 585 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 586 | When the underlying lock is an :class:`RLock`, it is not released using |
| 587 | its :meth:`release` method, since this may not actually unlock the lock |
| 588 | when it was acquired multiple times recursively. Instead, an internal |
| 589 | interface of the :class:`RLock` class is used, which really unlocks it |
| 590 | even when it has been recursively acquired several times. Another internal |
| 591 | interface is then used to restore the recursion level when the lock is |
| 592 | reacquired. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 593 | |
Georg Brandl | b9a4391 | 2010-10-28 09:03:20 +0000 | [diff] [blame] | 594 | The return value is ``True`` unless a given *timeout* expired, in which |
| 595 | case it is ``False``. |
| 596 | |
| 597 | .. versionchanged:: 3.2 |
| 598 | Previously, the method always returned ``None``. |
| 599 | |
Kristján Valur Jónsson | 6331520 | 2010-11-18 12:46:39 +0000 | [diff] [blame] | 600 | .. method:: wait_for(predicate, timeout=None) |
| 601 | |
| 602 | Wait until a condition evaluates to True. *predicate* should be a |
| 603 | callable which result will be interpreted as a boolean value. |
| 604 | A *timeout* may be provided giving the maximum time to wait. |
| 605 | |
| 606 | This utility method may call :meth:`wait` repeatedly until the predicate |
| 607 | is satisfied, or until a timeout occurs. The return value is |
| 608 | the last return value of the predicate and will evaluate to |
| 609 | ``False`` if the method timed out. |
| 610 | |
| 611 | Ignoring the timeout feature, calling this method is roughly equivalent to |
| 612 | writing:: |
| 613 | |
| 614 | while not predicate(): |
| 615 | cv.wait() |
| 616 | |
| 617 | Therefore, the same rules apply as with :meth:`wait`: The lock must be |
| 618 | held when called and is re-aquired on return. The predicate is evaluated |
| 619 | with the lock held. |
| 620 | |
Kristján Valur Jónsson | 6331520 | 2010-11-18 12:46:39 +0000 | [diff] [blame] | 621 | .. versionadded:: 3.2 |
| 622 | |
Eli Bendersky | d44af82 | 2011-11-12 20:44:25 +0200 | [diff] [blame] | 623 | .. method:: notify(n=1) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 624 | |
Eli Bendersky | d44af82 | 2011-11-12 20:44:25 +0200 | [diff] [blame] | 625 | By default, wake up one thread waiting on this condition, if any. If the |
| 626 | calling thread has not acquired the lock when this method is called, a |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 627 | :exc:`RuntimeError` is raised. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 628 | |
Eli Bendersky | d44af82 | 2011-11-12 20:44:25 +0200 | [diff] [blame] | 629 | This method wakes up at most *n* of the threads waiting for the condition |
| 630 | variable; it is a no-op if no threads are waiting. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 631 | |
Eli Bendersky | d44af82 | 2011-11-12 20:44:25 +0200 | [diff] [blame] | 632 | The current implementation wakes up exactly *n* threads, if at least *n* |
| 633 | threads are waiting. However, it's not safe to rely on this behavior. |
| 634 | A future, optimized implementation may occasionally wake up more than |
| 635 | *n* threads. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 636 | |
Eli Bendersky | d44af82 | 2011-11-12 20:44:25 +0200 | [diff] [blame] | 637 | Note: an awakened thread does not actually return from its :meth:`wait` |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 638 | call until it can reacquire the lock. Since :meth:`notify` does not |
| 639 | release the lock, its caller should. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 640 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 641 | .. method:: notify_all() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 642 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 643 | Wake up all threads waiting on this condition. This method acts like |
| 644 | :meth:`notify`, but wakes up all waiting threads instead of one. If the |
| 645 | calling thread has not acquired the lock when this method is called, a |
| 646 | :exc:`RuntimeError` is raised. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 647 | |
| 648 | |
| 649 | .. _semaphore-objects: |
| 650 | |
| 651 | Semaphore Objects |
| 652 | ----------------- |
| 653 | |
| 654 | This is one of the oldest synchronization primitives in the history of computer |
| 655 | science, invented by the early Dutch computer scientist Edsger W. Dijkstra (he |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 656 | used the names ``P()`` and ``V()`` instead of :meth:`~Semaphore.acquire` and |
| 657 | :meth:`~Semaphore.release`). |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 658 | |
| 659 | A semaphore manages an internal counter which is decremented by each |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 660 | :meth:`~Semaphore.acquire` call and incremented by each :meth:`~Semaphore.release` |
| 661 | call. The counter can never go below zero; when :meth:`~Semaphore.acquire` |
| 662 | finds that it is zero, it blocks, waiting until some other thread calls |
| 663 | :meth:`~Semaphore.release`. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 664 | |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 665 | Semaphores also support the :ref:`context manager protocol <with-locks>`. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 666 | |
| 667 | |
Georg Brandl | 7f01a13 | 2009-09-16 15:58:14 +0000 | [diff] [blame] | 668 | .. class:: Semaphore(value=1) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 669 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 670 | This class implements semaphore objects. A semaphore manages a counter |
| 671 | representing the number of :meth:`release` calls minus the number of |
| 672 | :meth:`acquire` calls, plus an initial value. The :meth:`acquire` method |
| 673 | blocks if necessary until it can return without making the counter negative. |
| 674 | If not given, *value* defaults to 1. |
| 675 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 676 | The optional argument gives the initial *value* for the internal counter; it |
| 677 | defaults to ``1``. If the *value* given is less than 0, :exc:`ValueError` is |
| 678 | raised. |
| 679 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 680 | .. versionchanged:: 3.3 |
| 681 | changed from a factory function to a class. |
| 682 | |
Antoine Pitrou | 0454af9 | 2010-04-17 23:51:58 +0000 | [diff] [blame] | 683 | .. method:: acquire(blocking=True, timeout=None) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 684 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 685 | Acquire a semaphore. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 686 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 687 | When invoked without arguments: if the internal counter is larger than |
| 688 | zero on entry, decrement it by one and return immediately. If it is zero |
| 689 | on entry, block, waiting until some other thread has called |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 690 | :meth:`~Semaphore.release` to make it larger than zero. This is done |
| 691 | with proper interlocking so that if multiple :meth:`acquire` calls are |
| 692 | blocked, :meth:`~Semaphore.release` will wake exactly one of them up. |
| 693 | The implementation may pick one at random, so the order in which |
| 694 | blocked threads are awakened should not be relied on. Returns |
| 695 | true (or blocks indefinitely). |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 696 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 697 | When invoked with *blocking* set to false, do not block. If a call |
Antoine Pitrou | 0454af9 | 2010-04-17 23:51:58 +0000 | [diff] [blame] | 698 | without an argument would block, return false immediately; otherwise, |
| 699 | do the same thing as when called without arguments, and return true. |
| 700 | |
| 701 | When invoked with a *timeout* other than None, it will block for at |
| 702 | most *timeout* seconds. If acquire does not complete successfully in |
| 703 | that interval, return false. Return true otherwise. |
| 704 | |
| 705 | .. versionchanged:: 3.2 |
| 706 | The *timeout* parameter is new. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 707 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 708 | .. method:: release() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 709 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 710 | Release a semaphore, incrementing the internal counter by one. When it |
| 711 | was zero on entry and another thread is waiting for it to become larger |
| 712 | than zero again, wake up that thread. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 713 | |
| 714 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 715 | .. class:: BoundedSemaphore(value=1) |
| 716 | |
| 717 | Class implementing bounded semaphore objects. A bounded semaphore checks to |
| 718 | make sure its current value doesn't exceed its initial value. If it does, |
| 719 | :exc:`ValueError` is raised. In most situations semaphores are used to guard |
| 720 | resources with limited capacity. If the semaphore is released too many times |
| 721 | it's a sign of a bug. If not given, *value* defaults to 1. |
| 722 | |
| 723 | .. versionchanged:: 3.3 |
| 724 | changed from a factory function to a class. |
| 725 | |
| 726 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 727 | .. _semaphore-examples: |
| 728 | |
| 729 | :class:`Semaphore` Example |
| 730 | ^^^^^^^^^^^^^^^^^^^^^^^^^^ |
| 731 | |
| 732 | Semaphores are often used to guard resources with limited capacity, for example, |
Georg Brandl | a572476 | 2011-01-06 19:28:18 +0000 | [diff] [blame] | 733 | a database server. In any situation where the size of the resource is fixed, |
| 734 | you should use a bounded semaphore. Before spawning any worker threads, your |
| 735 | main thread would initialize the semaphore:: |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 736 | |
| 737 | maxconnections = 5 |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 738 | # ... |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 739 | pool_sema = BoundedSemaphore(value=maxconnections) |
| 740 | |
| 741 | Once spawned, worker threads call the semaphore's acquire and release methods |
| 742 | when they need to connect to the server:: |
| 743 | |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 744 | with pool_sema: |
| 745 | conn = connectdb() |
| 746 | try: |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 747 | # ... use connection ... |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 748 | finally: |
| 749 | conn.close() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 750 | |
| 751 | The use of a bounded semaphore reduces the chance that a programming error which |
| 752 | causes the semaphore to be released more than it's acquired will go undetected. |
| 753 | |
| 754 | |
| 755 | .. _event-objects: |
| 756 | |
| 757 | Event Objects |
| 758 | ------------- |
| 759 | |
| 760 | This is one of the simplest mechanisms for communication between threads: one |
| 761 | thread signals an event and other threads wait for it. |
| 762 | |
| 763 | An event object manages an internal flag that can be set to true with the |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 764 | :meth:`~Event.set` method and reset to false with the :meth:`~Event.clear` |
| 765 | method. The :meth:`~Event.wait` method blocks until the flag is true. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 766 | |
| 767 | |
| 768 | .. class:: Event() |
| 769 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 770 | Class implementing event objects. An event manages a flag that can be set to |
| 771 | true with the :meth:`~Event.set` method and reset to false with the |
| 772 | :meth:`clear` method. The :meth:`wait` method blocks until the flag is true. |
| 773 | The flag is initially false. |
| 774 | |
| 775 | .. versionchanged:: 3.3 |
| 776 | changed from a factory function to a class. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 777 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 778 | .. method:: is_set() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 779 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 780 | Return true if and only if the internal flag is true. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 781 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 782 | .. method:: set() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 783 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 784 | Set the internal flag to true. All threads waiting for it to become true |
| 785 | are awakened. Threads that call :meth:`wait` once the flag is true will |
| 786 | not block at all. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 787 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 788 | .. method:: clear() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 789 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 790 | Reset the internal flag to false. Subsequently, threads calling |
Georg Brandl | 502d9a5 | 2009-07-26 15:02:41 +0000 | [diff] [blame] | 791 | :meth:`wait` will block until :meth:`.set` is called to set the internal |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 792 | flag to true again. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 793 | |
Georg Brandl | 7f01a13 | 2009-09-16 15:58:14 +0000 | [diff] [blame] | 794 | .. method:: wait(timeout=None) |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 795 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 796 | Block until the internal flag is true. If the internal flag is true on |
| 797 | entry, return immediately. Otherwise, block until another thread calls |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 798 | :meth:`.set` to set the flag to true, or until the optional timeout occurs. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 799 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 800 | When the timeout argument is present and not ``None``, it should be a |
| 801 | floating point number specifying a timeout for the operation in seconds |
| 802 | (or fractions thereof). |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 803 | |
Charles-François Natali | ded0348 | 2012-01-07 18:24:56 +0100 | [diff] [blame] | 804 | This method returns true if and only if the internal flag has been set to |
| 805 | true, either before the wait call or after the wait starts, so it will |
| 806 | always return ``True`` except if a timeout is given and the operation |
| 807 | times out. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 808 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 809 | .. versionchanged:: 3.1 |
| 810 | Previously, the method always returned ``None``. |
Benjamin Peterson | d23f822 | 2009-04-05 19:13:16 +0000 | [diff] [blame] | 811 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 812 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 813 | .. _timer-objects: |
| 814 | |
| 815 | Timer Objects |
| 816 | ------------- |
| 817 | |
| 818 | This class represents an action that should be run only after a certain amount |
| 819 | of time has passed --- a timer. :class:`Timer` is a subclass of :class:`Thread` |
| 820 | and as such also functions as an example of creating custom threads. |
| 821 | |
| 822 | Timers are started, as with threads, by calling their :meth:`start` method. The |
| 823 | timer can be stopped (before its action has begun) by calling the :meth:`cancel` |
| 824 | method. The interval the timer will wait before executing its action may not be |
| 825 | exactly the same as the interval specified by the user. |
| 826 | |
| 827 | For example:: |
| 828 | |
| 829 | def hello(): |
Collin Winter | c79461b | 2007-09-01 23:34:30 +0000 | [diff] [blame] | 830 | print("hello, world") |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 831 | |
| 832 | t = Timer(30.0, hello) |
| 833 | t.start() # after 30 seconds, "hello, world" will be printed |
| 834 | |
| 835 | |
| 836 | .. class:: Timer(interval, function, args=[], kwargs={}) |
| 837 | |
| 838 | Create a timer that will run *function* with arguments *args* and keyword |
| 839 | arguments *kwargs*, after *interval* seconds have passed. |
| 840 | |
R David Murray | ef4d286 | 2012-10-06 14:35:35 -0400 | [diff] [blame^] | 841 | .. versionchanged:: 3.3 |
| 842 | changed from a factory function to a class. |
| 843 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 844 | .. method:: cancel() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 845 | |
Georg Brandl | 7a72b3a | 2009-07-26 14:48:09 +0000 | [diff] [blame] | 846 | Stop the timer, and cancel the execution of the timer's action. This will |
| 847 | only work if the timer is still in its waiting stage. |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 848 | |
| 849 | |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 850 | Barrier Objects |
| 851 | --------------- |
| 852 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 853 | .. versionadded:: 3.2 |
| 854 | |
| 855 | This class provides a simple synchronization primitive for use by a fixed number |
| 856 | of threads that need to wait for each other. Each of the threads tries to pass |
Antoine Pitrou | 2c9f104 | 2012-04-10 22:35:53 +0200 | [diff] [blame] | 857 | the barrier by calling the :meth:`~Barrier.wait` method and will block until |
| 858 | all of the threads have made the call. At this points, the threads are released |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 859 | simultanously. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 860 | |
| 861 | The barrier can be reused any number of times for the same number of threads. |
| 862 | |
| 863 | As an example, here is a simple way to synchronize a client and server thread:: |
| 864 | |
| 865 | b = Barrier(2, timeout=5) |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 866 | |
| 867 | def server(): |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 868 | start_server() |
| 869 | b.wait() |
| 870 | while True: |
| 871 | connection = accept_connection() |
| 872 | process_server_connection(connection) |
| 873 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 874 | def client(): |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 875 | b.wait() |
| 876 | while True: |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 877 | connection = make_connection() |
| 878 | process_client_connection(connection) |
| 879 | |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 880 | |
| 881 | .. class:: Barrier(parties, action=None, timeout=None) |
| 882 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 883 | Create a barrier object for *parties* number of threads. An *action*, when |
| 884 | provided, is a callable to be called by one of the threads when they are |
| 885 | released. *timeout* is the default timeout value if none is specified for |
| 886 | the :meth:`wait` method. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 887 | |
| 888 | .. method:: wait(timeout=None) |
| 889 | |
| 890 | Pass the barrier. When all the threads party to the barrier have called |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 891 | this function, they are all released simultaneously. If a *timeout* is |
Ezio Melotti | e130a52 | 2011-10-19 10:58:56 +0300 | [diff] [blame] | 892 | provided, it is used in preference to any that was supplied to the class |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 893 | constructor. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 894 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 895 | The return value is an integer in the range 0 to *parties* -- 1, different |
Raymond Hettinger | 5cee47f | 2011-01-11 19:59:46 +0000 | [diff] [blame] | 896 | for each thread. This can be used to select a thread to do some special |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 897 | housekeeping, e.g.:: |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 898 | |
| 899 | i = barrier.wait() |
| 900 | if i == 0: |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 901 | # Only one thread needs to print this |
| 902 | print("passed the barrier") |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 903 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 904 | If an *action* was provided to the constructor, one of the threads will |
| 905 | have called it prior to being released. Should this call raise an error, |
| 906 | the barrier is put into the broken state. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 907 | |
| 908 | If the call times out, the barrier is put into the broken state. |
| 909 | |
| 910 | This method may raise a :class:`BrokenBarrierError` exception if the |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 911 | barrier is broken or reset while a thread is waiting. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 912 | |
| 913 | .. method:: reset() |
| 914 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 915 | Return the barrier to the default, empty state. Any threads waiting on it |
| 916 | will receive the :class:`BrokenBarrierError` exception. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 917 | |
| 918 | Note that using this function may can require some external |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 919 | synchronization if there are other threads whose state is unknown. If a |
| 920 | barrier is broken it may be better to just leave it and create a new one. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 921 | |
| 922 | .. method:: abort() |
| 923 | |
| 924 | Put the barrier into a broken state. This causes any active or future |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 925 | calls to :meth:`wait` to fail with the :class:`BrokenBarrierError`. Use |
| 926 | this for example if one of the needs to abort, to avoid deadlocking the |
| 927 | application. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 928 | |
| 929 | It may be preferable to simply create the barrier with a sensible |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 930 | *timeout* value to automatically guard against one of the threads going |
| 931 | awry. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 932 | |
| 933 | .. attribute:: parties |
| 934 | |
| 935 | The number of threads required to pass the barrier. |
| 936 | |
| 937 | .. attribute:: n_waiting |
| 938 | |
| 939 | The number of threads currently waiting in the barrier. |
| 940 | |
| 941 | .. attribute:: broken |
| 942 | |
| 943 | A boolean that is ``True`` if the barrier is in the broken state. |
| 944 | |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 945 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 946 | .. exception:: BrokenBarrierError |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 947 | |
Georg Brandl | 5bc1686 | 2010-10-28 13:07:50 +0000 | [diff] [blame] | 948 | This exception, a subclass of :exc:`RuntimeError`, is raised when the |
| 949 | :class:`Barrier` object is reset or broken. |
Kristján Valur Jónsson | 3be0003 | 2010-10-28 09:43:10 +0000 | [diff] [blame] | 950 | |
| 951 | |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 952 | .. _with-locks: |
| 953 | |
| 954 | Using locks, conditions, and semaphores in the :keyword:`with` statement |
| 955 | ------------------------------------------------------------------------ |
| 956 | |
| 957 | All of the objects provided by this module that have :meth:`acquire` and |
| 958 | :meth:`release` methods can be used as context managers for a :keyword:`with` |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 959 | statement. The :meth:`acquire` method will be called when the block is |
| 960 | entered, and :meth:`release` will be called when the block is exited. Hence, |
| 961 | the following snippet:: |
| 962 | |
| 963 | with some_lock: |
| 964 | # do something... |
| 965 | |
| 966 | is equivalent to:: |
| 967 | |
| 968 | some_lock.acquire() |
| 969 | try: |
| 970 | # do something... |
| 971 | finally: |
| 972 | some_lock.release() |
Georg Brandl | 116aa62 | 2007-08-15 14:28:22 +0000 | [diff] [blame] | 973 | |
| 974 | Currently, :class:`Lock`, :class:`RLock`, :class:`Condition`, |
| 975 | :class:`Semaphore`, and :class:`BoundedSemaphore` objects may be used as |
Antoine Pitrou | b96a354 | 2012-04-10 22:47:55 +0200 | [diff] [blame] | 976 | :keyword:`with` statement context managers. |