o
$i @ s6 d Z ddlZddlZddlZddlZddlmZ ddl
m Z ddl m
ZmZ zddlmZ W n ey= ddlmZ Y nw g dZejZejZejZej Z z ej Z dZ e d W n e ye d
Z Y nw ej!Z"zej#Z$W n e yy dZ$Y nw ej%Z%[da&da'd d Z(d
d Z)dd Z*dd Z+eZ,dd Z#G dd dZ-e-Z.G dd dZ/G dd dZ0G dd d e0Z1G d d d Z2G d d d Z3G d!d" d"e4Z5ed#j6Z7d$d% Z8e# a9i Z:i Z;e Z a?d&d' Z@G d(d) d)ZAz
dd*lmBaCmDZE W n# ey dd+lFmGZH dd,lmIZI eId-d.ZDd/d- ZEd0d1 aCY nw tCZJd2d3 ZKG d4d5 d5eAZLG d6d7 d7eAZMG d8d9 d9eAZNd:d; ZOdd? ZQd@dA ZRdBdC ZSdDdE ZTg ZUd
aVdFdG ZWddHlmXZX eM aYdIdJ ZZdKdL Z[zddMlm\Z] W n ey ddNl^m]Z] Y nw dOdP Z_e`edQrejae_dR dS dS )Sz;Thread module emulating a subset of Java's threading model. N) monotonic)WeakSet)islicecount)deque) get_ident active_count Conditioncurrent_thread enumerate main_thread TIMEOUT_MAXEventLockRLock SemaphoreBoundedSemaphoreThreadBarrierBrokenBarrierErrorTimer ThreadError
setprofilesettracelocal
stack_size
excepthookExceptHookArgsgettrace
getprofileT
get_native_idFc C | a dS )zSet a profile function for all threads started from the threading module.
The func will be passed to sys.setprofile() for each thread, before its
run() method is called.
N
_profile_hookfunc r& 0/opt/alt/python310/lib64/python3.10/threading.pyr : r c C t S )z;Get the profiler function as set by threading.setprofile().r" r& r& r& r' r D r c C r! )zSet a trace function for all threads started from the threading module.
The func will be passed to sys.settrace() for each thread, before its run()
method is called.
N _trace_hookr$ r& r& r' r H r( r c C r) )z6Get the trace function as set by threading.settrace().r+ r& r& r& r' r R r* r c O s$ t du r t| i |S t | i |S )a2 Factory function that returns a new reentrant lock.
A reentrant lock must be released by the thread that acquired it. Once a
thread has acquired a reentrant lock, the same thread may acquire it again
without blocking; the thread must release it once for each time it has
acquired it.
N)_CRLock_PyRLock)argskwargsr& r& r' r Z s r c @ s^ e Zd ZdZdd Zdd Zdd Zdd
d ZeZd d
Z dd Z
dd Z dd Z dd Z
dS )_RLocka, This class implements reentrant lock objects.
A reentrant lock must be released by the thread that acquired it. Once a
thread has acquired a reentrant lock, the same thread may acquire it
again without blocking; the thread must release it once for each time it
has acquired it.
c C s t | _d | _d| _d S Nr )_allocate_lock_block_owner_countselfr& r& r' __init__q s
z_RLock.__init__c C s\ | j }zt| j}W n ty Y nw d| j r dnd| jj| jj|| j t
t | f S )Nz)<%s %s.%s object owner=%r count=%d at %s>lockedZunlocked) r5 _activenameKeyErrorr4 r: __class__
__module__ __qualname__r6 hexid)r8 ownerr& r& r' __repr__v s
z_RLock.__repr__c C s | j d | _d| _d S r2 )r4 _at_fork_reinitr5 r6 r7 r& r& r' rE s
z_RLock._at_fork_reinitTc C sD t }| j|kr| jd7 _dS | j||}|r || _d| _|S )a Acquire a lock, blocking or non-blocking.
When invoked without arguments: if this thread already owns the lock,
increment the recursion level by one, and return immediately. Otherwise,
if another thread owns the lock, block until the lock is unlocked. Once
the lock is unlocked (not owned by any thread), then grab ownership, set
the recursion level to one, and return. If more than one thread is
blocked waiting until the lock is unlocked, only one at a time will be
able to grab ownership of the lock. There is no return value in this
case.
When invoked with the blocking argument set to true, do the same thing
as when called without arguments, and return true.
When invoked with the blocking argument set to false, do not block. If a
call without an argument would block, return false immediately;
otherwise, do the same thing as when called without arguments, and
return true.
When invoked with the floating-point timeout argument set to a positive
value, block for at most the number of seconds specified by timeout
and as long as the lock cannot be acquired. Return true if the lock has
been acquired, false if the timeout has elapsed.
)r r5 r6 r4 acquire)r8 blockingtimeoutmercr& r& r' rH s
z_RLock.acquirec C s@ | j t kr
td| jd | _}|s d| _ | j dS dS )am Release a lock, decrementing the recursion level.
If after the decrement it is zero, reset the lock to unlocked (not owned
by any thread), and if any other threads are blocked waiting for the
lock to become unlocked, allow exactly one of them to proceed. If after
the decrement the recursion level is still nonzero, the lock remains
locked and owned by the calling thread.
Only call this method when the calling thread owns the lock. A
RuntimeError is raised if this method is called when the lock is
unlocked.
There is no return value.
cannot release un-acquired lockrG N)r5 r RuntimeErrorr6 r4 release)r8 r r& r& r' rO s z_RLock.releasec C | d S NrO r8 tvtbr& r& r' __exit__ z_RLock.__exit__c C s | j |\| _| _d S rQ )r4 rH r6 r5 )r8 stater& r& r' _acquire_restore s
z_RLock._acquire_restorec C s< | j dkr td| j }d| _ | j}d | _| j ||fS )Nr rM )r6 rN r5 r4 rO )r8 r rC r& r& r'
_release_save s
z_RLock._release_savec C s | j t kS rQ )r5 r r7 r& r& r' _is_owned rX z_RLock._is_ownedNTrF )__name__r? r@ __doc__r9 rD rE rH __enter__rO rW rZ r[ r\ r& r& r& r' r1 g s
$
r1 c @ s e Zd ZdZd ddZdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z d ddZ d ddZ
d ddZdd Zd d ZdS ) r aj Class that implements a condition variable.
A condition variable allows one or more threads to wait until they are
notified by another thread.
If the lock argument is given and not None, it must be a Lock or RLock
object, and it is used as the underlying lock. Otherwise, a new RLock object
is created and used as the underlying lock.
Nc C s |d u rt }|| _|j| _|j| _z|j| _W n ty! Y nw z|j| _W n ty1 Y nw z|j| _W n tyA Y nw t | _ d S rQ )
r _lockrH rO r[ AttributeErrorrZ r\ _deque_waitersr8 lockr& r& r' r9 s* zCondition.__init__c C s | j | j d S rQ )ra rE rd clearr7 r& r& r' rE s
zCondition._at_fork_reinitc C s
| j S rQ )ra r` r7 r& r& r' r`
zCondition.__enter__c G s | j j| S rQ )ra rW )r8 r/ r& r& r' rW rX zCondition.__exit__c C s d| j t| jf S )Nz)ra lenrd r7 r& r& r' rD s zCondition.__repr__c C | j d S rQ )ra rO r7 r& r& r' r[ zCondition._release_savec C rj rQ )ra rH )r8 xr& r& r' rZ rk zCondition._acquire_restorec C s | j dr
| j dS dS )NFT)ra rH rO r7 r& r& r' r\ s
zCondition._is_ownedc C s | stdt }| | j| | }d}z7|du r'| d}n|dkr2|d|}n|d}|W | | |sRz| j| W S t yQ Y S w S | | |slz| j| W w t yk Y w w w )ak Wait until notified or until a timeout occurs.
If the calling thread has not acquired the lock when this method is
called, a RuntimeError is raised.
This method releases the underlying lock, and then blocks until it is
awakened by a notify() or notify_all() call for the same condition
variable in another thread, or until the optional timeout occurs. Once
awakened or timed out, it re-acquires the lock and returns.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof).
When the underlying lock is an RLock, it is not released using its
release() method, since this may not actually unlock the lock when it
was acquired multiple times recursively. Instead, an internal interface
of the RLock class is used, which really unlocks it even when it has
been recursively acquired several times. Another internal interface is
then used to restore the recursion level when the lock is reacquired.
z cannot wait on un-acquired lockFNTr )
r\ rN r3 rH rd appendr[ rZ remove
ValueError)r8 rJ waiterZ saved_stateZgotitr& r& r' wait s>
zCondition.waitc C s^ d}|}| }|s-|dur#|du rt | }n |t }|dkr# |S | | | }|r |S )zWait until a condition evaluates to True.
predicate should be a callable which result will be interpreted as a
boolean value. A timeout may be provided giving the maximum time to
wait.
Nr )_timerq )r8 Z predicaterJ endtimeZwaittimeresultr& r& r' wait_forP s
zCondition.wait_forrG c C s | std| j}|rB|dkrD|d }z| W n ty$ Y nw |d8 }z|| W n ty9 Y nw |rF|dksdS dS dS dS )aK Wake up one or more threads waiting on this condition, if any.
If the calling thread has not acquired the lock when this method is
called, a RuntimeError is raised.
This method wakes up at most n of the threads waiting for the condition
variable; it is a no-op if no threads are waiting.
z!cannot notify on un-acquired lockr rG N)r\ rN rd rO rn ro )r8 nwaitersrp r& r& r' notifyg s"
zCondition.notifyc C s | t| j dS )zWake up all threads waiting on this condition.
If the calling thread has not acquired the lock when this method
is called, a RuntimeError is raised.
N)rx ri rd r7 r& r& r'
notify_all s zCondition.notify_allc C s$ ddl }|jdtdd | dS )zvWake up all threads waiting on this condition.
This method is deprecated, use notify_all() instead.
r Nz3notifyAll() is deprecated, use notify_all() instead
stacklevel)warningswarnDeprecationWarningry r8 r} r& r& r' notifyAll s
zCondition.notifyAllrQ rG )r^ r? r@ r_ r9 rE r` rW rD r[ rZ r\ rq ru rx ry r r& r& r& r' r s
0
r c @ s: e Zd ZdZd
ddZdddZeZd
d d
Zd d ZdS )r aG This class implements semaphore objects.
Semaphores manage a counter representing the number of release() calls minus
the number of acquire() calls, plus an initial value. The acquire() method
blocks if necessary until it can return without making the counter
negative. If not given, value defaults to 1.
rG c C s& |dk rt dtt | _|| _d S )Nr z$semaphore initial value must be >= 0)ro r r _cond_valuer8 valuer& r& r' r9 s
zSemaphore.__init__TNc C s |s
|dur
t dd}d}| jM | jdkr=|sn4|dur2|du r(t | }n
|t }|dkr2n$| j| | jdks| jd8 _d}W d |S W d |S W d |S 1 saw Y |S )a Acquire a semaphore, decrementing the internal counter by one.
When invoked without arguments: if the internal counter is larger than
zero on entry, decrement it by one and return immediately. If it is zero
on entry, block, waiting until some other thread has called release() to
make it larger than zero. This is done with proper interlocking so that
if multiple acquire() calls are blocked, release() will wake exactly one
of them up. The implementation may pick one at random, so the order in
which blocked threads are awakened should not be relied on. There is no
return value in this case.
When invoked with blocking set to true, do the same thing as when called
without arguments, and return true.
When invoked with blocking set to false, do not block. If a call without
an argument would block, return false immediately; otherwise, do the
same thing as when called without arguments, and return true.
When invoked with a timeout other than None, it will block for at
most timeout seconds. If acquire does not complete successfully in
that interval, return false. Return true otherwise.
Nz.can't specify timeout for non-blocking acquireFr rG T)ro r r rr rq )r8 rI rJ rL rs r& r& r' rH s8
zSemaphore.acquirec C sb |dk rt d| j | j|7 _t|D ]}| j qW d dS 1 s*w Y dS )zRelease a semaphore, incrementing the internal counter by one or more.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
rG n must be one or moreN)ro r r rangerx r8 rv ir& r& r' rO s "zSemaphore.releasec C rP rQ rR rS r& r& r' rW rX zSemaphore.__exit__r )TN) r^ r? r@ r_ r9 rH r` rO rW r& r& r& r' r s
-
r c @ s$ e Zd ZdZdddZdddZdS ) r a Implements a bounded semaphore.
A bounded semaphore checks to make sure its current value doesn't exceed its
initial value. If it does, ValueError is raised. In most situations
semaphores are used to guard resources with limited capacity.
If the semaphore is released too many times it's a sign of a bug. If not
given, value defaults to 1.
Like regular semaphores, bounded semaphores manage a counter representing
the number of release() calls minus the number of acquire() calls, plus an
initial value. The acquire() method blocks if necessary until it can return
without making the counter negative. If not given, value defaults to 1.
rG c C s t | | || _d S rQ )r r9 _initial_valuer r& r& r' r9
zBoundedSemaphore.__init__c C sz |dk rt d| j( | j| | jkrt d| j|7 _t|D ]}| j q#W d dS 1 s6w Y dS )a> Release a semaphore, incrementing the internal counter by one or more.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
If the number of releases exceeds the number of acquires,
raise a ValueError.
rG r z!Semaphore released too many timesN)ro r r r r rx r r& r& r' rO s
"zBoundedSemaphore.releaseNr )r^ r? r@ r_ r9 rO r& r& r& r' r s
r c @ sJ e Zd ZdZdd Zdd Zdd Zdd Zd
d Zd d
Z dddZ
dS )r zClass implementing event objects.
Events manage a flag that can be set to true with the set() method and reset
to false with the clear() method. The wait() method blocks until the flag is
true. The flag is initially false.
c C s t t | _d| _d S )NF)r r r _flagr7 r& r& r' r9 ! r zEvent.__init__c C rj rQ )r rE r7 r& r& r' rE % zEvent._at_fork_reinitc C | j S )z5Return true if and only if the internal flag is true.)r r7 r& r& r' is_set) s z Event.is_setc C s ddl }|jdtdd | S )zyReturn true if and only if the internal flag is true.
This method is deprecated, use is_set() instead.
r Nz+isSet() is deprecated, use is_set() insteadrz r{ )r} r~ r r r r& r& r' isSet- s
z Event.isSetc C s< | j d| _| j W d dS 1 sw Y dS )zSet the internal flag to true.
All threads waiting for it to become true are awakened. Threads
that call wait() once the flag is true will not block at all.
TN)r r ry r7 r& r& r' set8 s "z Event.setc C s2 | j d| _W d dS 1 sw Y dS )zReset the internal flag to false.
Subsequently, threads calling wait() will block until set() is called to
set the internal flag to true again.
FN)r r r7 r& r& r' rg C s "z Event.clearNc C sD | j | j}|s| j |}|W d S 1 sw Y dS )aH Block until the internal flag is true.
If the internal flag is true on entry, return immediately. Otherwise,
block until another thread calls set() to set the flag to true, or until
the optional timeout occurs.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof).
This method returns the internal flag on exit, so it will always return
True except if a timeout is given and the operation times out.
N)r r rq )r8 rJ Zsignaledr& r& r' rq M s $z
Event.waitrQ ) r^ r? r@ r_ r9 rE r r r rg rq r& r& r& r' r s
r c @ s e Zd ZdZdddZd ddZdd Zd d
Zd d Zd
d Z dd Z
dd Z dd Z e
dd Ze
dd Ze
dd ZdS ) r zImplements a Barrier.
Useful for synchronizing a fixed number of threads at known synchronization
points. Threads block on 'wait()' and are simultaneously awoken once they
have all made that call.
Nc C s. t t | _|| _|| _|| _d| _d| _dS )aW Create a barrier, initialised to 'parties' threads.
'action' is a callable which, when supplied, will be called by one of
the threads after they have all entered the barrier and just prior to
releasing them all. If a 'timeout' is provided, it is used as the
default for all subsequent 'wait()' calls.
r N)r r r _action_timeout_parties_stater6 )r8 partiesactionrJ r& r& r' r9 w s
zBarrier.__init__c
C s |du r| j }| jB | | j}| jd7 _z&|d | jkr&| n| | |W | jd8 _| W d S | jd8 _| w 1 sOw Y dS )aN Wait for the barrier.
When the specified number of threads have started waiting, they are all
simultaneously awoken. If an 'action' was provided for the barrier, one
of the threads will have executed that callback prior to returning.
Returns an individual index number from 0 to 'parties-1'.
NrG )r r _enterr6 r _release_wait_exit)r8 rJ indexr& r& r' rq s"
z Barrier.waitc C s> | j dv r| j | j dv s| j dk rt| j dks J d S )NrF rG r )r r rq r r7 r& r& r' r s
zBarrier._enterc C s6 z| j r| d| _| j W d S | )NrG )r r r ry _breakr7 r& r& r' r s zBarrier._releasec sB j fdd|s t jdk rt jdks J d S )Nc s
j dkS r2 r r& r7 r& r' s
z Barrier._wait..r rG )r ru r r r r8 rJ r& r7 r' r s
z
Barrier._waitc C s0 | j dkr| jdv rd| _| j d S d S d S )Nr r )r6 r r ry r7 r& r& r' r s
z
Barrier._exitc C sj | j ( | jdkr| jdkrd| _n | jdkrd| _nd| _| j W d dS 1 s.w Y dS )zReset the barrier to the initial state.
Any threads currently waiting will get the BrokenBarrier exception
raised.
r rF N)r r6 r ry r7 r& r& r' reset s
"z
Barrier.resetc C s4 | j
| W d dS 1 sw Y dS )zPlace the barrier into a 'broken' state.
Useful in case of error. Any currently waiting threads and threads
attempting to 'wait()' will have BrokenBarrierError raised.
N)r r r7 r& r& r' abort s
"z
Barrier.abortc C s d| _ | j d S )Nr )r r ry r7 r& r& r' r s zBarrier._breakc C r )z:Return the number of threads required to trip the barrier.)r r7 r& r& r' r s zBarrier.partiesc C s | j dkr| jS dS )z>Return the number of threads currently waiting at the barrier.r )r r6 r7 r& r& r' n_waiting s
zBarrier.n_waitingc C s
| j dkS )z0Return True if the barrier is in a broken state.r r r7 r& r& r' broken s
zBarrier.brokenNNrQ )r^ r? r@ r_ r9 rq r r r r r r r propertyr r r r& r& r& r' r n s"
r c @ s e Zd ZdS )r N)r^ r? r@ r& r& r& r' r s r rG c C s
| t S rQ )_counter)Z
name_templater& r& r' _newname rh r c C s dd t D } t | dS )a!
Drop any shutdown locks that don't correspond to running threads anymore.
Calling this from time to time avoids an ever-growing _shutdown_locks
set when Thread objects are not joined explicitly. See bpo-37788.
This must be called with _shutdown_locks_lock acquired.
c S s g | ]}| s|qS r& )r: ).0rf r& r& r'
* s z,_maintain_shutdown_locks..N)_shutdown_locksdifference_update)Z to_remover& r& r' _maintain_shutdown_locks s
r c @ s e Zd ZdZdZ d8ddddZdd Zd
d Zd d
Zdd Z dd Z
dd Z e r0dd Z
dd Zdd Zdd Zd d Zd9d d Zd:d"d#Zed$d% Zejd&d% Zed'd( Ze reed)d* Zd+d, Zed-d. Zejd/d. Zd0d1 Zd2d3 Z d4d5 Z d6d7 Z dS );r a A class that represents a thread of control.
This class can be safely subclassed in a limited fashion. There are two ways
to specify the activity: by passing a callable object to the constructor, or
by overriding the run() method in a subclass.
FNr& )daemonc C s |du sJ d|du ri }|rt |}n td}|dur4z
|j}|d| d7 }W n ty3 Y nw || _|| _|| _|| _|durH|| _nt j
| _d| _ t rUd| _
d| _t | _d| _d| _tj| _t | _t| dS )aK This constructor should always be called with keyword arguments. Arguments are:
*group* should be None; reserved for future extension when a ThreadGroup
class is implemented.
*target* is the callable object to be invoked by the run()
method. Defaults to None, meaning nothing is called.
*name* is the thread name. By default, a unique name is constructed of
the form "Thread-N" where N is a small decimal number.
*args* is the argument tuple for the target invocation. Defaults to ().
*kwargs* is a dictionary of keyword arguments for the target
invocation. Defaults to {}.
If a subclass overrides the constructor, it must make sure to invoke
the base class constructor (Thread.__init__()) before doing anything
else to the thread.
Nz#group argument must be None for nowz Thread-%dz ()FT)strr r^ rb _target_name_args_kwargs _daemonicr
r _ident_HAVE_THREAD_NATIVE_ID
_native_id _tstate_lockr _started _is_stopped _initialized_sysstderr_stderr_make_invoke_excepthook_invoke_excepthook _danglingadd)r8 grouptargetr< r/ r0 r Z target_namer& r& r' r9 ; s<
zThread.__init__c C sD | j |r| jd ur| j | j d S d S d| _d | _d S NT)r rE r rH r )r8 is_aliver& r& r' _reset_internal_locksu s
z Thread._reset_internal_locksc C sl | j sJ dd}| j rd}| | jrd}| jr |d7 }| jd ur,|d| j 7 }d| jj| j |f S )Nz Thread.__init__() was not calledinitialZstartedZstoppedz daemonz %sz <%s(%s, %s)>)
r r r r r r r r> r^ r )r8 Zstatusr& r& r' rD s
zThread.__repr__c C s | j std| j rtdt | t| < W d n1 s!w Y zt| jd W n tyK t t| = W d 1 sEw Y w | j dS )a- Start the thread's activity.
It must be called at most once per thread object. It arranges for the
object's run() method to be invoked in a separate thread of control.
This method will raise a RuntimeError if called more than once on the
same thread object.
z thread.__init__() not calledz threads can only be started onceNr& )
r rN r r _active_limbo_lock_limbo_start_new_thread
_bootstrap Exceptionrq r7 r& r& r' start s$
z Thread.startc C sR z!| j dur| j | ji | j W | ` | `| `dS W | ` | `| `dS | ` | `| `w )aX Method representing the thread's activity.
You may override this method in a subclass. The standard run() method
invokes the callable object passed to the object's constructor as the
target argument, if any, with sequential and keyword arguments taken
from the args and kwargs arguments, respectively.
N)r r r r7 r& r& r' run s
z
Thread.runc C s, z| W d S | jrtd u rY d S rQ )_bootstrap_innerr r r7 r& r& r' r s
zThread._bootstrapc C t | _d S rQ )r r r7 r& r& r'
_set_ident rX zThread._set_identc C r rQ )r r r7 r& r& r' _set_native_id rX zThread._set_native_idc C sX t | _| j | js*t t t| j W d dS 1 s#w Y dS dS )z
Set a lock object which will be released by the interpreter when
the underlying thread state (see pystate.h) gets deleted.
N)
_set_sentinelr rH r _shutdown_locks_lockr r r r7 r& r& r' _set_tstate_lock s
"zThread._set_tstate_lockc C s4 zt| | tr| | j t | t| j< t | = W d n1 s)w Y t
r5t t
t
r.invoke_excepthook)r r rN exc_infor )r r& r r' r s r c @ s* e Zd ZdZd ddZdd Zdd ZdS )
r zCall a function after a specified number of seconds:
t = Timer(30.0, f, args=None, kwargs=None)
t.start()
t.cancel() # stop the timer's action if it's still waiting
Nc C sF t | || _|| _|d ur|ng | _|d ur|ni | _t | _d S rQ )r r9 intervalfunctionr/ r0 r finished)r8 r r r/ r0 r& r& r' r9 S s
zTimer.__init__c C s | j dS )z)Stop the timer if it hasn't finished yet.N)r
r r7 r& r& r' cancel[ r z Timer.cancelc C s: | j | j | j s| j| ji | j | j d S rQ )r
rq r r r r/ r0 r r7 r& r& r' r _ s
z Timer.runr )r^ r? r@ r_ r9 r r r& r& r& r' r J s
r c @ s e Zd Zdd ZdS ) _MainThreadc C sj t j| ddd | | j | tr| t | t | j
< W d d S 1 s.w Y d S )NZ
MainThreadFr< r ) r r9 r r r r r r r r; r r7 r& r& r' r9 j s
"z_MainThread.__init__N)r^ r? r@ r9 r& r& r& r' r h s r c @ s. e Zd Zdd Zdd Zdd Zd
dd ZdS ) _DummyThreadc C sf t j| tddd | j | tr| t | t | j
< W d d S 1 s,w Y d S )NzDummy-%dTr
) r r9 r r r r r r r r; r r7 r& r& r' r9 s
"z_DummyThread.__init__c C s d S rQ r& r7 r& r& r' r s z_DummyThread._stopc C s | j s| j s
J dS r )r r r r7 r& r& r' r s z_DummyThread.is_aliveNc C s J d)NFzcannot join a dummy threadr& r r& r& r' r r z_DummyThread.joinrQ )r^ r? r@ r9 r r r r& r& r& r' r } s
r c C s& zt t W S ty t Y S w )zReturn the current Thread object, corresponding to the caller's thread of control.
If the caller's thread of control was not created through the threading
module, a dummy thread object with limited functionality is returned.
)r; r r= r r& r& r& r' r
s
r
c C ddl } | jdtdd t S )zReturn the current Thread object, corresponding to the caller's thread of control.
This function is deprecated, use current_thread() instead.
r Nz;currentThread() is deprecated, use current_thread() insteadrz r{ )r} r~ r r
r} r& r& r'
currentThread r r c C s8 t tttt W d S 1 sw Y dS )zReturn the number of Thread objects currently alive.
The returned count is equal to the length of the list returned by
enumerate().
N)r ri r; r r& r& r& r' r s $r c C r )zxReturn the number of Thread objects currently alive.
This function is deprecated, use active_count() instead.
r Nz7activeCount() is deprecated, use active_count() insteadrz r{ )r} r~ r r r r& r& r' activeCount r r c C s t t t t S rQ )listr; valuesr r& r& r& r'
_enumerate s r c C s@ t tt tt W d S 1 sw Y dS )zReturn a list of all Thread objects currently alive.
The list includes daemonic threads, dummy thread objects created by
current_thread(), and the main thread. It excludes terminated threads and
threads that have not yet been started.
N)r r r; r r r& r& r& r' r s $r c O s2 t rtdtj| g|R i |}t| dS )a CPython internal: register *func* to be called before joining threads.
The registered *func* is called with its arguments just before all
non-daemon threads are joined in `_shutdown()`. It provides a similar
purpose to `atexit.register()`, but its functions are called prior to
threading shutdown instead of interpreter shutdown.
For similarity to atexit, the registered functions are called in reverse.
z$can't register atexit after shutdownN)_SHUTTING_DOWNrN functoolspartial_threading_atexitsrm )r% argr0 Zcallr& r& r' _register_atexit s
r )r c C s t jrdS dat j} | dusJ | sJ | t ttD ]}| q" t t
t }t W d n1 s>w Y |sGdS |D ]
}|
| qIq))zS
Wait until the Python thread state of all non-daemon threads get deleted.
NT) _main_threadr r r r: rO r reversedr r r r rg rH )ZtlockZ atexit_callZlocksrf r& r& r' _shutdown s*
r c C r) )zReturn the main thread object.
In normal conditions, the main thread is the thread from which the
Python interpreter was started.
)r r& r& r& r' r s r )_local)r c C s t ai } ztt }W n ty t }Y nw |at at a
tJ t t }| t
|D ] }||u rF|d t }||_|| |< q0|d | q0t t t | ttdkseJ W d dS 1 spw Y dS )zL
Cleanup threading module state that should not exist after a fork.
TFrG N)r r r; r r= r r r3 r r r r updater r r r r rg ri )Z
new_activeZcurrentZthreadsr r r& r& r' _after_fork. s4
"r! register_at_fork)Zafter_in_child)br_ os_ossysr _threadr timer rr Z _weakrefsetr itertoolsr Z_islicer r6 _collectionsr rc ImportError collections__all__start_new_threadr
allocate_lockr3 r r r r rm rb errorr r r- r
r# r, r r r r r r1 r. r r r r r rN r __next__r r r r; r r r r r r r r r r r tracebackr r r __excepthook__r r r r r
r r r r r r r r r r r r r r Z_threading_localr! hasattrr" r& r& r& r' s
v ;S)X
6 ,5
/ 5