blob: 12cf2e8ae5f6f0931f6c857bf4428a7e9d6d4c4c [file] [log] [blame]
Georg Brandl116aa622007-08-15 14:28:22 +00001
2:mod:`threading` --- Higher-level threading interface
3=====================================================
4
5.. module:: threading
6 :synopsis: Higher-level threading interface.
7
8
Georg Brandl2067bfd2008-05-25 13:05:15 +00009This module constructs higher-level threading interfaces on top of the lower
10level :mod:`_thread` module. See also the :mod:`queue` module.
Georg Brandl116aa622007-08-15 14:28:22 +000011
12The :mod:`dummy_threading` module is provided for situations where
Georg Brandl2067bfd2008-05-25 13:05:15 +000013:mod:`threading` cannot be used because :mod:`_thread` is missing.
Georg Brandl116aa622007-08-15 14:28:22 +000014
Benjamin Peterson8bdd5452008-08-18 22:38:41 +000015.. note::
16
Benjamin Petersonb3085c92008-09-01 23:09:31 +000017 While they are not listed below, the ``camelCase`` names used for some
18 methods and functions in this module in the Python 2.x series are still
19 supported by this module.
Benjamin Peterson8bdd5452008-08-18 22:38:41 +000020
Georg Brandl116aa622007-08-15 14:28:22 +000021This module defines the following functions and objects:
22
23
Benjamin Peterson672b8032008-06-11 19:14:14 +000024.. function:: active_count()
Georg Brandl116aa622007-08-15 14:28:22 +000025
26 Return the number of :class:`Thread` objects currently alive. The returned
27 count is equal to the length of the list returned by :func:`enumerate`.
28
29
30.. function:: Condition()
31 :noindex:
32
33 A factory function that returns a new condition variable object. A condition
34 variable allows one or more threads to wait until they are notified by another
35 thread.
36
37
Benjamin Peterson672b8032008-06-11 19:14:14 +000038.. function:: current_thread()
Georg Brandl116aa622007-08-15 14:28:22 +000039
40 Return the current :class:`Thread` object, corresponding to the caller's thread
41 of control. If the caller's thread of control was not created through the
42 :mod:`threading` module, a dummy thread object with limited functionality is
43 returned.
44
45
46.. function:: enumerate()
47
Benjamin Peterson672b8032008-06-11 19:14:14 +000048 Return a list of all :class:`Thread` objects currently alive. The list
49 includes daemonic threads, dummy thread objects created by
50 :func:`current_thread`, and the main thread. It excludes terminated threads
51 and threads that have not yet been started.
Georg Brandl116aa622007-08-15 14:28:22 +000052
53
54.. function:: Event()
55 :noindex:
56
57 A factory function that returns a new event object. An event manages a flag
58 that can be set to true with the :meth:`set` method and reset to false with the
59 :meth:`clear` method. The :meth:`wait` method blocks until the flag is true.
60
61
62.. class:: local
63
64 A class that represents thread-local data. Thread-local data are data whose
65 values are thread specific. To manage thread-local data, just create an
66 instance of :class:`local` (or a subclass) and store attributes on it::
67
68 mydata = threading.local()
69 mydata.x = 1
70
71 The instance's values will be different for separate threads.
72
73 For more details and extensive examples, see the documentation string of the
74 :mod:`_threading_local` module.
75
Georg Brandl116aa622007-08-15 14:28:22 +000076
77.. function:: Lock()
78
79 A factory function that returns a new primitive lock object. Once a thread has
80 acquired it, subsequent attempts to acquire it block, until it is released; any
81 thread may release it.
82
83
84.. function:: RLock()
85
86 A factory function that returns a new reentrant lock object. A reentrant lock
87 must be released by the thread that acquired it. Once a thread has acquired a
88 reentrant lock, the same thread may acquire it again without blocking; the
89 thread must release it once for each time it has acquired it.
90
91
92.. function:: Semaphore([value])
93 :noindex:
94
95 A factory function that returns a new semaphore object. A semaphore manages a
96 counter representing the number of :meth:`release` calls minus the number of
97 :meth:`acquire` calls, plus an initial value. The :meth:`acquire` method blocks
98 if necessary until it can return without making the counter negative. If not
99 given, *value* defaults to 1.
100
101
102.. function:: BoundedSemaphore([value])
103
104 A factory function that returns a new bounded semaphore object. A bounded
105 semaphore checks to make sure its current value doesn't exceed its initial
106 value. If it does, :exc:`ValueError` is raised. In most situations semaphores
107 are used to guard resources with limited capacity. If the semaphore is released
108 too many times it's a sign of a bug. If not given, *value* defaults to 1.
109
110
111.. class:: Thread
112
113 A class that represents a thread of control. This class can be safely
114 subclassed in a limited fashion.
115
116
117.. class:: Timer
118
119 A thread that executes a function after a specified interval has passed.
120
121
122.. function:: settrace(func)
123
124 .. index:: single: trace function
125
126 Set a trace function for all threads started from the :mod:`threading` module.
127 The *func* will be passed to :func:`sys.settrace` for each thread, before its
128 :meth:`run` method is called.
129
Georg Brandl116aa622007-08-15 14:28:22 +0000130
131.. function:: setprofile(func)
132
133 .. index:: single: profile function
134
135 Set a profile function for all threads started from the :mod:`threading` module.
136 The *func* will be passed to :func:`sys.setprofile` for each thread, before its
137 :meth:`run` method is called.
138
Georg Brandl116aa622007-08-15 14:28:22 +0000139
140.. function:: stack_size([size])
141
142 Return the thread stack size used when creating new threads. The optional
143 *size* argument specifies the stack size to be used for subsequently created
144 threads, and must be 0 (use platform or configured default) or a positive
145 integer value of at least 32,768 (32kB). If changing the thread stack size is
146 unsupported, a :exc:`ThreadError` is raised. If the specified stack size is
147 invalid, a :exc:`ValueError` is raised and the stack size is unmodified. 32kB
148 is currently the minimum supported stack size value to guarantee sufficient
149 stack space for the interpreter itself. Note that some platforms may have
150 particular restrictions on values for the stack size, such as requiring a
151 minimum stack size > 32kB or requiring allocation in multiples of the system
152 memory page size - platform documentation should be referred to for more
153 information (4kB pages are common; using multiples of 4096 for the stack size is
154 the suggested approach in the absence of more specific information).
155 Availability: Windows, systems with POSIX threads.
156
Georg Brandl116aa622007-08-15 14:28:22 +0000157
158Detailed interfaces for the objects are documented below.
159
160The design of this module is loosely based on Java's threading model. However,
161where Java makes locks and condition variables basic behavior of every object,
162they are separate objects in Python. Python's :class:`Thread` class supports a
163subset of the behavior of Java's Thread class; currently, there are no
164priorities, no thread groups, and threads cannot be destroyed, stopped,
165suspended, resumed, or interrupted. The static methods of Java's Thread class,
166when implemented, are mapped to module-level functions.
167
168All of the methods described below are executed atomically.
169
170
Georg Brandla971c652008-11-07 09:39:56 +0000171.. _thread-objects:
172
173Thread Objects
174--------------
175
176This class represents an activity that is run in a separate thread of control.
177There are two ways to specify the activity: by passing a callable object to the
178constructor, or by overriding the :meth:`run` method in a subclass. No other
179methods (except for the constructor) should be overridden in a subclass. In
180other words, *only* override the :meth:`__init__` and :meth:`run` methods of
181this class.
182
183Once a thread object is created, its activity must be started by calling the
184thread's :meth:`start` method. This invokes the :meth:`run` method in a
185separate thread of control.
186
187Once the thread's activity is started, the thread is considered 'alive'. It
188stops being alive when its :meth:`run` method terminates -- either normally, or
189by raising an unhandled exception. The :meth:`is_alive` method tests whether the
190thread is alive.
191
192Other threads can call a thread's :meth:`join` method. This blocks the calling
193thread until the thread whose :meth:`join` method is called is terminated.
194
195A thread has a name. The name can be passed to the constructor, and read or
196changed through the :attr:`name` attribute.
197
198A thread can be flagged as a "daemon thread". The significance of this flag is
199that the entire Python program exits when only daemon threads are left. The
200initial value is inherited from the creating thread. The flag can be set
Benjamin Peterson5c6d7872009-02-06 02:40:07 +0000201through the :attr:`daemon` property.
Georg Brandla971c652008-11-07 09:39:56 +0000202
203There is a "main thread" object; this corresponds to the initial thread of
204control in the Python program. It is not a daemon thread.
205
206There is the possibility that "dummy thread objects" are created. These are
207thread objects corresponding to "alien threads", which are threads of control
208started outside the threading module, such as directly from C code. Dummy
209thread objects have limited functionality; they are always considered alive and
210daemonic, and cannot be :meth:`join`\ ed. They are never deleted, since it is
211impossible to detect the termination of alien threads.
212
213
214.. class:: Thread(group=None, target=None, name=None, args=(), kwargs={})
215
216 This constructor should always be called with keyword arguments. Arguments are:
217
218 *group* should be ``None``; reserved for future extension when a
219 :class:`ThreadGroup` class is implemented.
220
221 *target* is the callable object to be invoked by the :meth:`run` method.
222 Defaults to ``None``, meaning nothing is called.
223
224 *name* is the thread name. By default, a unique name is constructed of the form
225 "Thread-*N*" where *N* is a small decimal number.
226
227 *args* is the argument tuple for the target invocation. Defaults to ``()``.
228
229 *kwargs* is a dictionary of keyword arguments for the target invocation.
230 Defaults to ``{}``.
231
232 If the subclass overrides the constructor, it must make sure to invoke the base
233 class constructor (``Thread.__init__()``) before doing anything else to the
234 thread.
235
236
237.. method:: Thread.start()
238
239 Start the thread's activity.
240
241 It must be called at most once per thread object. It arranges for the object's
242 :meth:`run` method to be invoked in a separate thread of control.
243
244 This method will raise a :exc:`RuntimeException` if called more than once on the
245 same thread object.
246
247
248.. method:: Thread.run()
249
250 Method representing the thread's activity.
251
252 You may override this method in a subclass. The standard :meth:`run` method
253 invokes the callable object passed to the object's constructor as the *target*
254 argument, if any, with sequential and keyword arguments taken from the *args*
255 and *kwargs* arguments, respectively.
256
257
258.. method:: Thread.join([timeout])
259
260 Wait until the thread terminates. This blocks the calling thread until the
261 thread whose :meth:`join` method is called terminates -- either normally or
262 through an unhandled exception -- or until the optional timeout occurs.
263
264 When the *timeout* argument is present and not ``None``, it should be a floating
265 point number specifying a timeout for the operation in seconds (or fractions
266 thereof). As :meth:`join` always returns ``None``, you must call :meth:`is_alive`
267 after :meth:`join` to decide whether a timeout happened -- if the thread is
268 still alive, the :meth:`join` call timed out.
269
270 When the *timeout* argument is not present or ``None``, the operation will block
271 until the thread terminates.
272
273 A thread can be :meth:`join`\ ed many times.
274
275 :meth:`join` raises a :exc:`RuntimeError` if an attempt is made to join
276 the current thread as that would cause a deadlock. It is also an error to
277 :meth:`join` a thread before it has been started and attempts to do so
278 raises the same exception.
279
280
Georg Brandla971c652008-11-07 09:39:56 +0000281.. attribute:: Thread.name
282
283 A string used for identification purposes only. It has no semantics.
284 Multiple threads may be given the same name. The initial name is set by the
285 constructor.
286
287
Georg Brandl770b0be2009-01-02 20:10:05 +0000288.. method:: Thread.getName()
289 Thread.setName()
290
291 Old getter/setter API for :attr:`~Thread.name`; use it directly as a property
292 instead.
293
294
Georg Brandla971c652008-11-07 09:39:56 +0000295.. attribute:: Thread.ident
296
297 The 'thread identifier' of this thread or ``None`` if the thread has not been
298 started. This is a nonzero integer. See the :func:`thread.get_ident()`
299 function. Thread identifiers may be recycled when a thread exits and another
300 thread is created. The identifier is available even after the thread has
301 exited.
302
303
304.. method:: Thread.is_alive()
305
306 Return whether the thread is alive.
307
308 Roughly, a thread is alive from the moment the :meth:`start` method returns
309 until its :meth:`run` method terminates. The module function :func:`enumerate`
310 returns a list of all alive threads.
311
312
Georg Brandla971c652008-11-07 09:39:56 +0000313.. attribute:: Thread.daemon
314
Benjamin Peterson5c6d7872009-02-06 02:40:07 +0000315 A boolean value indicating whether this thread is a daemon thread (True) or
316 not (False). This must be set before :meth:`start` is called, otherwise
317 :exc:`RuntimeError` is raised. Its initial value is inherited from the
318 creating thread; the main thread is not a daemon thread and therefore all
319 threads created in the main thread default to :attr:`daemon` = ``False``.
Georg Brandla971c652008-11-07 09:39:56 +0000320
321 The entire Python program exits when no alive non-daemon threads are left.
322
323
Georg Brandl770b0be2009-01-02 20:10:05 +0000324.. method:: Thread.isDaemon()
325 Thread.setDaemon()
326
327 Old getter/setter API for :attr:`~Thread.daemon`; use it directly as a
328 property instead.
329
330
Georg Brandl116aa622007-08-15 14:28:22 +0000331.. _lock-objects:
332
333Lock Objects
334------------
335
336A primitive lock is a synchronization primitive that is not owned by a
337particular thread when locked. In Python, it is currently the lowest level
Georg Brandl2067bfd2008-05-25 13:05:15 +0000338synchronization primitive available, implemented directly by the :mod:`_thread`
Georg Brandl116aa622007-08-15 14:28:22 +0000339extension module.
340
341A primitive lock is in one of two states, "locked" or "unlocked". It is created
342in the unlocked state. It has two basic methods, :meth:`acquire` and
343:meth:`release`. When the state is unlocked, :meth:`acquire` changes the state
344to locked and returns immediately. When the state is locked, :meth:`acquire`
345blocks until a call to :meth:`release` in another thread changes it to unlocked,
346then the :meth:`acquire` call resets it to locked and returns. The
347:meth:`release` method should only be called in the locked state; it changes the
348state to unlocked and returns immediately. If an attempt is made to release an
349unlocked lock, a :exc:`RuntimeError` will be raised.
350
351When more than one thread is blocked in :meth:`acquire` waiting for the state to
352turn to unlocked, only one thread proceeds when a :meth:`release` call resets
353the state to unlocked; which one of the waiting threads proceeds is not defined,
354and may vary across implementations.
355
356All methods are executed atomically.
357
358
359.. method:: Lock.acquire([blocking=1])
360
361 Acquire a lock, blocking or non-blocking.
362
363 When invoked without arguments, block until the lock is unlocked, then set it to
364 locked, and return true.
365
366 When invoked with the *blocking* argument set to true, do the same thing as when
367 called without arguments, and return true.
368
369 When invoked with the *blocking* argument set to false, do not block. If a call
370 without an argument would block, return false immediately; otherwise, do the
371 same thing as when called without arguments, and return true.
372
373
374.. method:: Lock.release()
375
376 Release a lock.
377
378 When the lock is locked, reset it to unlocked, and return. If any other threads
379 are blocked waiting for the lock to become unlocked, allow exactly one of them
380 to proceed.
381
382 Do not call this method when the lock is unlocked.
383
384 There is no return value.
385
386
387.. _rlock-objects:
388
389RLock Objects
390-------------
391
392A reentrant lock is a synchronization primitive that may be acquired multiple
393times by the same thread. Internally, it uses the concepts of "owning thread"
394and "recursion level" in addition to the locked/unlocked state used by primitive
395locks. In the locked state, some thread owns the lock; in the unlocked state,
396no thread owns it.
397
398To lock the lock, a thread calls its :meth:`acquire` method; this returns once
399the thread owns the lock. To unlock the lock, a thread calls its
400:meth:`release` method. :meth:`acquire`/:meth:`release` call pairs may be
401nested; only the final :meth:`release` (the :meth:`release` of the outermost
402pair) resets the lock to unlocked and allows another thread blocked in
403:meth:`acquire` to proceed.
404
405
406.. method:: RLock.acquire([blocking=1])
407
408 Acquire a lock, blocking or non-blocking.
409
410 When invoked without arguments: if this thread already owns the lock, increment
411 the recursion level by one, and return immediately. Otherwise, if another
412 thread owns the lock, block until the lock is unlocked. Once the lock is
413 unlocked (not owned by any thread), then grab ownership, set the recursion level
414 to one, and return. If more than one thread is blocked waiting until the lock
415 is unlocked, only one at a time will be able to grab ownership of the lock.
416 There is no return value in this case.
417
418 When invoked with the *blocking* argument set to true, do the same thing as when
419 called without arguments, and return true.
420
421 When invoked with the *blocking* argument set to false, do not block. If a call
422 without an argument would block, return false immediately; otherwise, do the
423 same thing as when called without arguments, and return true.
424
425
426.. method:: RLock.release()
427
428 Release a lock, decrementing the recursion level. If after the decrement it is
429 zero, reset the lock to unlocked (not owned by any thread), and if any other
430 threads are blocked waiting for the lock to become unlocked, allow exactly one
431 of them to proceed. If after the decrement the recursion level is still
432 nonzero, the lock remains locked and owned by the calling thread.
433
434 Only call this method when the calling thread owns the lock. A
435 :exc:`RuntimeError` is raised if this method is called when the lock is
436 unlocked.
437
438 There is no return value.
439
440
441.. _condition-objects:
442
443Condition Objects
444-----------------
445
446A condition variable is always associated with some kind of lock; this can be
447passed in or one will be created by default. (Passing one in is useful when
448several condition variables must share the same lock.)
449
450A condition variable has :meth:`acquire` and :meth:`release` methods that call
451the corresponding methods of the associated lock. It also has a :meth:`wait`
Georg Brandlf9926402008-06-13 06:32:25 +0000452method, and :meth:`notify` and :meth:`notify_all` methods. These three must only
Georg Brandl116aa622007-08-15 14:28:22 +0000453be called when the calling thread has acquired the lock, otherwise a
454:exc:`RuntimeError` is raised.
455
456The :meth:`wait` method releases the lock, and then blocks until it is awakened
Georg Brandlf9926402008-06-13 06:32:25 +0000457by a :meth:`notify` or :meth:`notify_all` call for the same condition variable in
Georg Brandl116aa622007-08-15 14:28:22 +0000458another thread. Once awakened, it re-acquires the lock and returns. It is also
459possible to specify a timeout.
460
461The :meth:`notify` method wakes up one of the threads waiting for the condition
Georg Brandlf9926402008-06-13 06:32:25 +0000462variable, if any are waiting. The :meth:`notify_all` method wakes up all threads
Georg Brandl116aa622007-08-15 14:28:22 +0000463waiting for the condition variable.
464
Georg Brandlf9926402008-06-13 06:32:25 +0000465Note: the :meth:`notify` and :meth:`notify_all` methods don't release the lock;
Georg Brandl116aa622007-08-15 14:28:22 +0000466this means that the thread or threads awakened will not return from their
467:meth:`wait` call immediately, but only when the thread that called
Georg Brandlf9926402008-06-13 06:32:25 +0000468:meth:`notify` or :meth:`notify_all` finally relinquishes ownership of the lock.
Georg Brandl116aa622007-08-15 14:28:22 +0000469
470Tip: the typical programming style using condition variables uses the lock to
471synchronize access to some shared state; threads that are interested in a
472particular change of state call :meth:`wait` repeatedly until they see the
473desired state, while threads that modify the state call :meth:`notify` or
Georg Brandlf9926402008-06-13 06:32:25 +0000474:meth:`notify_all` when they change the state in such a way that it could
Georg Brandl116aa622007-08-15 14:28:22 +0000475possibly be a desired state for one of the waiters. For example, the following
476code is a generic producer-consumer situation with unlimited buffer capacity::
477
478 # Consume one item
479 cv.acquire()
480 while not an_item_is_available():
481 cv.wait()
482 get_an_available_item()
483 cv.release()
484
485 # Produce one item
486 cv.acquire()
487 make_an_item_available()
488 cv.notify()
489 cv.release()
490
Georg Brandlf9926402008-06-13 06:32:25 +0000491To choose between :meth:`notify` and :meth:`notify_all`, consider whether one
Georg Brandl116aa622007-08-15 14:28:22 +0000492state change can be interesting for only one or several waiting threads. E.g.
493in a typical producer-consumer situation, adding one item to the buffer only
494needs to wake up one consumer thread.
495
496
497.. class:: Condition([lock])
498
499 If the *lock* argument is given and not ``None``, it must be a :class:`Lock` or
500 :class:`RLock` object, and it is used as the underlying lock. Otherwise, a new
501 :class:`RLock` object is created and used as the underlying lock.
502
503
504.. method:: Condition.acquire(*args)
505
506 Acquire the underlying lock. This method calls the corresponding method on the
507 underlying lock; the return value is whatever that method returns.
508
509
510.. method:: Condition.release()
511
512 Release the underlying lock. This method calls the corresponding method on the
513 underlying lock; there is no return value.
514
515
516.. method:: Condition.wait([timeout])
517
518 Wait until notified or until a timeout occurs. If the calling thread has not
519 acquired the lock when this method is called, a :exc:`RuntimeError` is raised.
520
521 This method releases the underlying lock, and then blocks until it is awakened
Georg Brandlf9926402008-06-13 06:32:25 +0000522 by a :meth:`notify` or :meth:`notify_all` call for the same condition variable in
Georg Brandl116aa622007-08-15 14:28:22 +0000523 another thread, or until the optional timeout occurs. Once awakened or timed
524 out, it re-acquires the lock and returns.
525
526 When the *timeout* argument is present and not ``None``, it should be a floating
527 point number specifying a timeout for the operation in seconds (or fractions
528 thereof).
529
530 When the underlying lock is an :class:`RLock`, it is not released using its
531 :meth:`release` method, since this may not actually unlock the lock when it was
532 acquired multiple times recursively. Instead, an internal interface of the
533 :class:`RLock` class is used, which really unlocks it even when it has been
534 recursively acquired several times. Another internal interface is then used to
535 restore the recursion level when the lock is reacquired.
536
537
538.. method:: Condition.notify()
539
540 Wake up a thread waiting on this condition, if any. Wait until notified or until
541 a timeout occurs. If the calling thread has not acquired the lock when this
542 method is called, a :exc:`RuntimeError` is raised.
543
544 This method wakes up one of the threads waiting for the condition variable, if
545 any are waiting; it is a no-op if no threads are waiting.
546
547 The current implementation wakes up exactly one thread, if any are waiting.
548 However, it's not safe to rely on this behavior. A future, optimized
549 implementation may occasionally wake up more than one thread.
550
551 Note: the awakened thread does not actually return from its :meth:`wait` call
552 until it can reacquire the lock. Since :meth:`notify` does not release the
553 lock, its caller should.
554
555
Benjamin Peterson672b8032008-06-11 19:14:14 +0000556.. method:: Condition.notify_all()
Georg Brandl116aa622007-08-15 14:28:22 +0000557
558 Wake up all threads waiting on this condition. This method acts like
559 :meth:`notify`, but wakes up all waiting threads instead of one. If the calling
560 thread has not acquired the lock when this method is called, a
561 :exc:`RuntimeError` is raised.
562
563
564.. _semaphore-objects:
565
566Semaphore Objects
567-----------------
568
569This is one of the oldest synchronization primitives in the history of computer
570science, invented by the early Dutch computer scientist Edsger W. Dijkstra (he
571used :meth:`P` and :meth:`V` instead of :meth:`acquire` and :meth:`release`).
572
573A semaphore manages an internal counter which is decremented by each
574:meth:`acquire` call and incremented by each :meth:`release` call. The counter
575can never go below zero; when :meth:`acquire` finds that it is zero, it blocks,
576waiting until some other thread calls :meth:`release`.
577
578
579.. class:: Semaphore([value])
580
581 The optional argument gives the initial *value* for the internal counter; it
582 defaults to ``1``. If the *value* given is less than 0, :exc:`ValueError` is
583 raised.
584
585
586.. method:: Semaphore.acquire([blocking])
587
588 Acquire a semaphore.
589
590 When invoked without arguments: if the internal counter is larger than zero on
591 entry, decrement it by one and return immediately. If it is zero on entry,
592 block, waiting until some other thread has called :meth:`release` to make it
593 larger than zero. This is done with proper interlocking so that if multiple
594 :meth:`acquire` calls are blocked, :meth:`release` will wake exactly one of them
595 up. The implementation may pick one at random, so the order in which blocked
596 threads are awakened should not be relied on. There is no return value in this
597 case.
598
599 When invoked with *blocking* set to true, do the same thing as when called
600 without arguments, and return true.
601
602 When invoked with *blocking* set to false, do not block. If a call without an
603 argument would block, return false immediately; otherwise, do the same thing as
604 when called without arguments, and return true.
605
606
607.. method:: Semaphore.release()
608
609 Release a semaphore, incrementing the internal counter by one. When it was zero
610 on entry and another thread is waiting for it to become larger than zero again,
611 wake up that thread.
612
613
614.. _semaphore-examples:
615
616:class:`Semaphore` Example
617^^^^^^^^^^^^^^^^^^^^^^^^^^
618
619Semaphores are often used to guard resources with limited capacity, for example,
620a database server. In any situation where the size of the resource size is
621fixed, you should use a bounded semaphore. Before spawning any worker threads,
622your main thread would initialize the semaphore::
623
624 maxconnections = 5
625 ...
626 pool_sema = BoundedSemaphore(value=maxconnections)
627
628Once spawned, worker threads call the semaphore's acquire and release methods
629when they need to connect to the server::
630
631 pool_sema.acquire()
632 conn = connectdb()
633 ... use connection ...
634 conn.close()
635 pool_sema.release()
636
637The use of a bounded semaphore reduces the chance that a programming error which
638causes the semaphore to be released more than it's acquired will go undetected.
639
640
641.. _event-objects:
642
643Event Objects
644-------------
645
646This is one of the simplest mechanisms for communication between threads: one
647thread signals an event and other threads wait for it.
648
649An event object manages an internal flag that can be set to true with the
650:meth:`set` method and reset to false with the :meth:`clear` method. The
651:meth:`wait` method blocks until the flag is true.
652
653
654.. class:: Event()
655
656 The internal flag is initially false.
657
658
Georg Brandlf9926402008-06-13 06:32:25 +0000659.. method:: Event.is_set()
Georg Brandl116aa622007-08-15 14:28:22 +0000660
661 Return true if and only if the internal flag is true.
662
663
664.. method:: Event.set()
665
666 Set the internal flag to true. All threads waiting for it to become true are
667 awakened. Threads that call :meth:`wait` once the flag is true will not block at
668 all.
669
670
671.. method:: Event.clear()
672
673 Reset the internal flag to false. Subsequently, threads calling :meth:`wait`
674 will block until :meth:`set` is called to set the internal flag to true again.
675
676
677.. method:: Event.wait([timeout])
678
Benjamin Petersond23f8222009-04-05 19:13:16 +0000679 Block until the internal flag is true. If the internal flag is true on entry,
680 return immediately. Otherwise, block until another thread calls :meth:`set`
681 to set the flag to true, or until the optional timeout occurs.
Georg Brandl116aa622007-08-15 14:28:22 +0000682
683 When the timeout argument is present and not ``None``, it should be a floating
684 point number specifying a timeout for the operation in seconds (or fractions
685 thereof).
686
Benjamin Petersond23f8222009-04-05 19:13:16 +0000687 This method returns the internal flag on exit, so it will always return
688 ``True`` except if a timeout is given and the operation times out.
689
690 .. versionchanged:: 2.7
691 Previously, the method always returned ``None``.
692
Georg Brandl116aa622007-08-15 14:28:22 +0000693
Georg Brandl116aa622007-08-15 14:28:22 +0000694.. _timer-objects:
695
696Timer Objects
697-------------
698
699This class represents an action that should be run only after a certain amount
700of time has passed --- a timer. :class:`Timer` is a subclass of :class:`Thread`
701and as such also functions as an example of creating custom threads.
702
703Timers are started, as with threads, by calling their :meth:`start` method. The
704timer can be stopped (before its action has begun) by calling the :meth:`cancel`
705method. The interval the timer will wait before executing its action may not be
706exactly the same as the interval specified by the user.
707
708For example::
709
710 def hello():
Collin Winterc79461b2007-09-01 23:34:30 +0000711 print("hello, world")
Georg Brandl116aa622007-08-15 14:28:22 +0000712
713 t = Timer(30.0, hello)
714 t.start() # after 30 seconds, "hello, world" will be printed
715
716
717.. class:: Timer(interval, function, args=[], kwargs={})
718
719 Create a timer that will run *function* with arguments *args* and keyword
720 arguments *kwargs*, after *interval* seconds have passed.
721
722
723.. method:: Timer.cancel()
724
725 Stop the timer, and cancel the execution of the timer's action. This will only
726 work if the timer is still in its waiting stage.
727
728
729.. _with-locks:
730
731Using locks, conditions, and semaphores in the :keyword:`with` statement
732------------------------------------------------------------------------
733
734All of the objects provided by this module that have :meth:`acquire` and
735:meth:`release` methods can be used as context managers for a :keyword:`with`
736statement. The :meth:`acquire` method will be called when the block is entered,
737and :meth:`release` will be called when the block is exited.
738
739Currently, :class:`Lock`, :class:`RLock`, :class:`Condition`,
740:class:`Semaphore`, and :class:`BoundedSemaphore` objects may be used as
741:keyword:`with` statement context managers. For example::
742
Georg Brandl116aa622007-08-15 14:28:22 +0000743 import threading
744
745 some_rlock = threading.RLock()
746
747 with some_rlock:
Collin Winterc79461b2007-09-01 23:34:30 +0000748 print("some_rlock is locked while this executes")
Georg Brandl116aa622007-08-15 14:28:22 +0000749
Christian Heimesdd15f6c2008-03-16 00:07:10 +0000750
751.. _threaded-imports:
752
753Importing in threaded code
754--------------------------
755
756While the import machinery is thread safe, there are two key
757restrictions on threaded imports due to inherent limitations in the way
758that thread safety is provided:
759
760* Firstly, other than in the main module, an import should not have the
761 side effect of spawning a new thread and then waiting for that thread in
762 any way. Failing to abide by this restriction can lead to a deadlock if
763 the spawned thread directly or indirectly attempts to import a module.
764* Secondly, all import attempts must be completed before the interpreter
765 starts shutting itself down. This can be most easily achieved by only
766 performing imports from non-daemon threads created through the threading
767 module. Daemon threads and threads created directly with the thread
768 module will require some other form of synchronization to ensure they do
769 not attempt imports after system shutdown has commenced. Failure to
770 abide by this restriction will lead to intermittent exceptions and
771 crashes during interpreter shutdown (as the late imports attempt to
772 access machinery which is no longer in a valid state).