python (3.11.7)
e d Z ddlZddlZddlZddlZddlmZ ddl
m Z ddl m
ZmZ ddlmZ n# e$ r ddlmZ Y nw xY wg dZej Zej Zej Zej Z ej Z dZ e d n
# e $ r d
Z Y nw xY wej! Z" ej# Z$n
# e $ r dZ$Y nw xY wej% Z%[da&da'd Z(d Z)d
Z*d Z+eZ,d Z# G d d Z-e-Z. G d d Z/ G d d Z0 G d de0 Z1 G d d Z2 G d d Z3 G d d e4 Z5 ed j6 Z7d Z8 e# a9i Z:i Z; e Z< e a= e> a?d Z@ G d! d" ZA dd#lmBaCmDZE n)# e$ r! dd$lFmGZH dd%lmIZI eId&d' ZDd( ZEd) aCY nw xY wt ZJd* ZK G d+ d,eA ZL G d- d.eA ZM G d/ d0eA ZNd1 ZOd2 ZPd3 ZQd4 ZRd5 ZSd6 ZTg ZUd
aVd7 ZWdd8lmXZX eM aYd9 ZZd: Z[ dd;lm\Z] n# e$ r dd<l^m]Z] Y nw xY wd= Z_ e`ed> r eja e_? dS dS )@z;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
| 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_hookfuncs =/BuggyBox/python/3.11.7/bootstrap/lib/python3.11/threading.pyr r : s
MMM c t S )z;Get the profiler function as set by threading.setprofile().r# r( r' r r D s r( c
| a dS )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% s r' r r H s
KKKr( c t S )z6Get the trace function as set by threading.settrace().r, r* r( r' r r R s r( c @ t 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.
)_CRLock_PyRLock)argskwargss r' r r Z s/ (((( D #F # ##r( c T e Zd ZdZd Zd Zd ZddZeZd Z d Z
d
Z d Z d Z
d
ZdS )_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 H t | _ d | _ d| _ d S Nr )_allocate_lock_block_owner_countselfs r' __init__z_RLock.__init__q s! $&& r( c
| j } t | j }n# t $ r Y nw xY wd| j rdnd| j j | j j || j t t | fz S )Nz)<%s %s.%s object owner=%r count=%d at %s>lockedunlocked) r: _activenameKeyErrorr9 r@ __class__
__module__ __qualname__r; hexid)r= owners r' __repr__z_RLock.__repr__v s EN'EE D : **,, <HH* N % N ' K 4MM
>
s
))c T | j d | _ d| _ d S r7 )r9 _at_fork_reinitr: r; r< s r' rM z_RLock._at_fork_reinit s( ##%%% r( Tc t }| j |k r| xj dz
c_ 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 r: r; r9 acquire)r= blockingtimeoutmercs r' rQ z_RLock.acquire sa 4 [[ ;" KK1 KK1
[
7
3
3
DKDK r( c | j t k rt d | j dz
x| _ }|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 lockrP N)r: r RuntimeErrorr; r9 release)r= r s r' rY z_RLock.release si ;)++ % % @AA A "kAo- e " DK K ! ! ! ! ! " "r( c . | d S NrY r= tvtbs r' __exit__z_RLock.__exit__ r( c V | j |\ | _ | _ d S r[ )r9 rQ r; r: )r= states r' _acquire_restorez_RLock._acquire_restore s( #( T[[[r( c | j dk rt d | j }d| _ | j }d | _ | j ||fS )Nr rW )r; rX r: r9 rY )r= r rJ s r'
_release_savez_RLock._release_save sX ;! @AA A u~ r( c 0 | j t k S r[ )r: r r< s r' _is_ownedz_RLock._is_owned s {ikk))r( c B | j t k rdS | j S r7 )r: r r; r< s r' _recursion_countz_RLock._recursion_count s ;)++ % %1{r( NTrN )__name__rF rG __doc__r> rK rM rQ __enter__rY ra re rg ri rk r* r( r' r5 r5 g s
" " " "H I" " ".
) ) ) * * *
r( r5 c h e Zd ZdZddZd Zd Zd Zd Zd Z d Z
d
Z dd Z dd Z
ddZd Zd 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 > |t }|| _ |j | _ |j | _ |j | _ n# t
$ r Y nw xY w |j | _ n# t
$ r Y nw xY w |j | _ n# t
$ r Y nw xY wt | _ d S r[ )
r _lockrQ rY rg AttributeErrorre ri _deque_waitersr= locks r' r> zCondition.__init__ s <77D
| | !%!3D D $($9D ! ! D !^DNN D
s3 >
A
A A
A)(A)- A: :
BBc j | j | j d S r[ )rr rM ru clearr< s r' rM zCondition._at_fork_reinit s0
""$$$
r( c 4 | j S r[ )rr ro r< s r' ro zCondition.__enter__ s z##%%%r( c | j j | S r[ )rr ra )r= r2 s r' ra zCondition.__exit__ s "tz"D))r( c > d| j t | j fz S )Nz<Condition(%s, %d)>)rr lenru r< s r' rK zCondition.__repr__ s $
C
4F4F'GGGr( c 8 | j d S r[ )rr rY r< s r' rg zCondition._release_save
r( c 8 | j d S r[ )rr rQ )r= xs r' re zCondition._acquire_restore r r( c p | j d r| j dS dS )NFT)rr rQ rY r< s r' ri zCondition._is_owned s: : e $ $ J 54r( c | st d t }| | j | | }d} || d}n2|dk r| d| }n| d }|| | |s, | j | S # t $ r Y S w xY wS # | | |s, | j | w # t $ r Y w w xY ww xY 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 )
ri rX r8 rQ ru appendrg re remove
ValueError)r= rS waiter saved_stategotits r' waitzCondition.wait' s . ~~ B @AA A !!
V$$$((** Q;; "NN4 9 9EE "NN5 1 1E ! !+ . . .
M((0000! D
! !+ . . .
M((0000! D
sC 7A D C66
DDE D;:E ;
EE EE c d}|} | }|sO|,|t |z }n|t z
}|dk rn!| | | }|O|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 )_timer )r= predicaterS endtimewaittimeresults r' wait_forzCondition.wait_forW s !#? #gg 0GG & 0H 1}} IIh Y[[F !
r( rP c : | st d | j }|rj|dk rf|d } | |dz }n# t $ r Y nw xY w | | n# t
$ r Y nw xY w|r |dk bdS 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 rP N)ri rX ru rY r r )r= nwaitersr s r' notifyzCondition.notifyn s ~~ D BCC C- !a%% QZF
Q
v&&&&
!a%%%% %% s# A
A#"A#'A= =
B
B
c T | 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)r r} ru r< s r'
notify_allzCondition.notify_all s&
C
&&'''''r( c p ddl }| dt d | 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)warningswarnDeprecationWarningr r= r s r' notifyAllzCondition.notifyAll sF
K(Q 8 8 8 r( r[ rP )rm rF rG rn r> rM ro ra rK rg re ri r r r r r r* r( r' r
r
s ! ! ! !0 & & &* * *H H H . . . .` . <( ( ( r( r
c : e Zd ZdZd
dZd Zd dZeZd
dZd Z dS ) 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.
rP c ~ |dk rt d t t | _ || _ d S )Nr z$semaphore initial value must be >= 0)r r
r _cond_valuer= values r' r> zSemaphore.__init__ s8 199 CDD D tvv&&
r( c h | j }d|j d|j dt | dd| j d S )N<. at #x: value=>)rE rF rG rI r r= clss r' rK zSemaphore.__repr__ sY n)CN ) )S%5 ) )2d88I ) ) +) ) ) *r( TNc X |s|t d d}d}| j 5 | j dk rV|sne|,|t |z }n|t z
}|dk rn7| j | | j dk V| xj dz c_ d}ddd n # 1 swxY w 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 rP T)r r r r r )r= rR rS rU r s r' rQ zSemaphore.acquire s 0 OG / MNN N
Z +"" & "'''G"3")EGG"3"a<< !
((( +"" q s A4B B#&B#c |dk rt d | j 5 | xj |z
c_ t | D ]}| j ddd dS # 1 swxY 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.
rP n must be one or moreN)r r r ranger r= r is r' rY zSemaphore.release s
q55 455 5
Z $ $ KK1 KK1XX
$
$
!!####
$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $s <A''A+.A+c . | d S r[ r\ r] s r' ra zSemaphore.__exit__ rb r( r )TN)
rm rF rG rn r> rK rQ ro rY ra r* r( r' r r s * * *
+ + + +Z I $ $ $ $ r( r c ( e Zd ZdZddZd ZddZdS )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.
rP c J t | | || _ d S r[ )r r> _initial_valuer s r' r> zBoundedSemaphore.__init__
s& 4''' #r( c x | j }d|j d|j dt | dd| j d| j d S )Nr r r r r /r )rE rF rG rI r r r s r' rK zBoundedSemaphore.__repr__ sj n?CN ? ?S%5 ? ?2d88I ? ? +? ?(,(;? ? ? @r( c , |dk rt d | j 5 | j |z | j k rt d | xj |z
c_ t | D ]}| j ddd dS # 1 swxY w 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.
rP r z!Semaphore released too many timesN)r r r r r r r s r' rY zBoundedSemaphore.release s
q55 455 5
Z $ ${Q!444 !DEEE KK1 KK1XX
$
$
!!####
$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $s A B B
B
Nr )rm rF rG rn r> rK rY r* r( r' r r sX $ $ $ $@ @ @
$ $ $ $ $ $r( r c D e Zd ZdZd Zd Zd Zd Zd Zd Z d Z
d d
Z d S ) 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 T t t | _ d| _ d S )NF)r
r r _flagr< s r' r> zEvent.__init__2 s tvv&&
r( c t | j }| j rdnd}d|j d|j dt | dd| d S ) Nsetunsetr r r r z: r )rE r rF rG rI )r= r statuss r' rK zEvent.__repr__6 sP n *1'R3>RRC$4RR"T((RRRRRRRr( c 8 | j d S r[ )r rM r< s r' rM zEvent._at_fork_reinit; s
""$$$$$r( c | j S )z5Return true if and only if the internal flag is true.)r r< s r' is_setz Event.is_set? s
zr( c l ddl }| dt d | 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() insteadr r )r r r r r s r' isSetz Event.isSetC s>
C(Q 8 8 8{{}} r( c | j 5 d| _ | j ddd dS # 1 swxY w 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 r r< s r' r z Event.setN s Z $ $ DJ J ! ! # # # $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $s !6::c T | j 5 d| _ ddd dS # 1 swxY w 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 r< s r' ry z Event.clearY sw Z DJ s !!Nc | j 5 | j }|s| j | }|cddd S # 1 swxY w 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 r )r= rS signaleds r' r z
Event.waitc s Z zH
4 :??733 s
%:>>r[ ) rm rF rG rn r> rK rM r r r ry r r* r( r' r r ' s S S S
% % % $ $ $ r( r c e Zd ZdZddZd ZddZd Zd Zd Z d Z
d
Z d Z d Z
ed
Zed Zed 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 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_stater; )r= partiesactionrS s r' r> zBarrier.__init__ s> tvv&&
r( c | j }| j r$d|j d|j dt | ddS d|j d|j dt | dd| j d| j d S ) Nr r r r z : broken>z
: waiters=r r )rE brokenrF rG rI n_waitingr r s r' rK zBarrier.__repr__ s n ; UTs~TT(8TTbhhTTTT T=CN = =S%5 = =2d88I = = N= =-1\= = = >r( c || j }| j 5 | | j }| xj dz
c_ |dz | j k r| n| | || xj dz c_ | cddd S # | xj dz c_ | w xY w# 1 swxY w 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'.
NrP )r r _enterr; r _release_wait_exit)r= rS indexs r' r z Barrier.wait s ?mG
Z KKMMMKE KK1 KK
19
--MMOOOO JJw''' q
q
s( ,C9B(7$C(&CCCCc | j dv r"| j | j dv "| j dk rt d S )NrN rP r )r r r r r< s r' r zBarrier._enter sJ kW$$ JOO kW$$ ;??$ $ ?r( c | j r| d| _ | j d S # | xY w)NrP )r r r r _breakr< s r' r zBarrier._release sX |
DK J ! ! # # # # # KKMMM s ;? Ac j fd| s t j dk rt d S )Nc j dk S r7 r r< s r' <lambda>z Barrier._wait.<locals>.<lambda> s DK1,< r( r )r r r r r r= rS s ` r' r z
Barrier._wait sR z""#<#<#<#<gFF % KKMMM$ $ ;??$ $ ?r( c v | j dk r+| j dv r$d| _ | j d S d S d S )Nr r )r; r r r r< s r' r z
Barrier._exit sK ;! {g%%
%%''''' %%r( c | j 5 | j dk r&| j dk rd| _ n| j dk rd| _ nd| _ | j ddd dS # 1 swxY w Y dS )zReset the barrier to the initial state.
Any threads currently waiting will get the BrokenBarrier exception
raised.
r rN N)r r; r r r< s r' resetz
Barrier.reset s Z $ ${Q;!##"$DKK[B&& #%DK J ! ! # # # $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $s AA''A+.A+c n | j 5 | ddd dS # 1 swxY w 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 r< s r' abortz
Barrier.abort s} Z KKMMM *..c F d| _ | j d S )Nr )r r r r< s r' r zBarrier._break s%
r( c | j S )z:Return the number of threads required to trip the barrier.)r r< s r' r zBarrier.parties s } r( c * | j dk r| j S dS )z>Return the number of threads currently waiting at the barrier.r )r r; r< s r' r zBarrier.n_waiting s
;! ; qr( c | j dk S )z0Return True if the barrier is in a broken state.r r r< s r' r zBarrier.broken s {b r( NNr[ )rm rF rG rn r> rK r r r r r r r r propertyr r r r* r( r' r r s > > > <
( ( ($ $ $( X X ! ! X! ! !r( r c e Zd ZdS )r N)rm rF rG r* r( r' r r % s Dr( r rP c $ | t z S r[ )_counter)
name_templates r' _newnamer + s 8:: %%r( c \ d 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 : g | ]}| |S r* )r@ ).0rw s r'
<listcomp>z,_maintain_shutdown_locks.<locals>.<listcomp>G s% GGG$ GGGGr( N)_shutdown_locksdifference_update) to_removes r' _maintain_shutdown_locksr = s2 HG/GGGI%%i00000r( c 8 e Zd ZdZdZ d!dddZd Zd Zd Zd
Z d Z
d Z e rd
Z
d Zd Zd Zd Zd"dZd#dZed Zej d Zed Ze r ed Zd Zed Zej d Zd Zd Z d Z d 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
|i }|rt | }n3t d }|" |j }|d| dz
}n# t $ r Y nw xY w|| _ || _ || _ || _ ||| _ nt j
| _ d| _ t rd| _
d| _ t | _ d| _ d| _ t& j | _ t- | _ t0 | dS )aU 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 a list or tuple of arguments 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 Thread-%dz ()FT)strr rm rs _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)r= grouptargetrC r2 r3 r target_names r' r> zThread.__init__X s 0 >F t99DDK((D!"(/K / / / //DD% D
#DNN + - - 4DN ! # "DO
{ "9";";
ds :
AAc | j |r=| j 4| j | j d S d S d| _ d | _ d S NT)r rM r rQ r )r= is_alives r' _reset_internal_locksz Thread._reset_internal_locks s{
%%''' % ,!11333!))+++++ -, $D $D r( c d}| j rd}| | j rd}| j r|dz
}| j
|d| j z z
}d| j j d| j d|d S )
Ninitialstartedstoppedz daemonz %sr (z, z)>) r r r r r r rE rm r )r= r s r' rK zThread.__repr__ s = ! ! F
F > i F ; " edk) )F!% !8!8!8$***fffMMr( c | j st d | j rt d t 5 | t
| < ddd n # 1 swxY w Y t
| j d n6# t $ r) t 5 t
| = ddd n # 1 swxY w Y w xY 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 rX r r _active_limbo_lock_limbo_start_new_thread
_bootstrap Exceptionr r< s r' startz Thread.start s^ ? =>> > = ! ! C ABB B
F4L dor 2 2 2 2 #
!
!4L
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
sB A A!$A!)A? ?B2 B% B2%B) )B2,B) -B2c f | j | j | j i | j | ` | `| `dS # | ` | `| `w xY 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
r< s r' runz
Thread.run sV 7|' dj9DL999 dj$,,, dj$, 6 6 6 6s ( 0c ^ | d S # | j r
t Y d S xY wr[ )_bootstrap_innerr r r< s r' r* zThread._bootstrap s@ ! ! # # # # # ~
$, s ,,c , t | _ d S r[ )r r r< s r'
_set_identzThread._set_ident s kk r( c , t | _ d S r[ )r! r r< s r' _set_native_idzThread._set_native_id s +ooDOOOr( c
t | _ | j | j sOt 5 t t | j ddd dS # 1 swxY 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 rQ r _shutdown_locks_lockr r r r< s r' _set_tstate_lockzThread._set_tstate_lock s
*OO !!###{ 7%
7
7(*** ##D$5666
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7 7 7s .A66A:=A:c j | | t r| | j t 5 | t | j < t | = d d d n # 1 swxY w Y t rt j t t rt j t | n # | | Y nxY w| d S # | w xY wr[ )r2 r8 r
r4 r r r' rB r r( r- r r r$ r r. r _deleter< s r' r0 zThread._bootstrap_inner sQ OO ! ! # # #%
&##%%% M #
!
!'+ $4L
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
+
k***
/
...
.
.''----- LLNNNNNDLLNNNNsI A#D %B = D B
D B
AD C* )D *DD D2c | j }| d| _ d | _ | j s0t 5 t d d d d S # 1 swxY w Y d S d S r )r r r r7 r rv s r' _stopz Thread._stop s " { +%
+
+(***
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ + +s AA Ac n t 5 t t = ddd dS # 1 swxY w Y dS )zARemove current thread from the dict of currently running threads.N)r' rB r r< s r' r: zThread._delete6 sx
% % $ % % % % % % % % % % % % % % % % % %r c 8 | j st d | j st d | t u rt d || dS | t
|d dS )a Wait until the thread terminates.
This blocks the calling thread until the thread whose join() method is
called terminates -- either normally or through an unhandled exception
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). As join() always returns None, you must call
is_alive() after join() to decide whether a timeout happened -- if the
thread is still alive, the join() call timed out.
When the timeout argument is not present or None, the operation will
block until the thread terminates.
A thread can be join()ed many times.
join() raises a RuntimeError if an attempt is made to join the current
thread as that would cause a deadlock. It is also an error to join() a
thread before it has been started and attempts to do so raises the same
exception.
Thread.__init__() not calledz'cannot join thread before it is startedzcannot join current threadNr )rS )r rX r r r _wait_for_tstate_lockmaxr s r' joinz Thread.join? s 0 ? =>> >}##%% J HII I >## # # ;<< < ? & & ( ( ( ( (
& &s7A & ? ? ? ? ?r( TrN c " | j }|d S | || r*| | d S d S # | r(| | xY wr[ )r rQ rY r< r@ )r= blockrS rw s r' r@ z Thread._wait_for_tstate_locke s <
F ||E7++
{{}}
s >A ?Bc | j S )zA string used for identification purposes only.
It has no semantics. Multiple threads may be given the same name. The
initial name is set by the constructor.
)r r< s r' rC z Thread.name s zr( c . t | | _ d S r[ )r r )r= rC s r' rC z Thread.name s YY
r( c | j S )a4 Thread identifier of this thread or None if it has not been started.
This is a nonzero integer. See the get_ident() function. Thread
identifiers may be recycled when a thread exits and another thread is
created. The identifier is available even after the thread has exited.
)r r< s r' identz Thread.ident s {r( c | j S )zNative integral thread ID of this thread, or None if it has not been started.
This is a non-negative integer. See the get_native_id() function.
This represents the Thread ID as reported by the kernel.
)r r< s r' native_idzThread.native_id s ? "r( c | j s| j sdS | d | j S )zReturn whether the thread is alive.
This method returns True just before the run() method starts until just
after the run() method terminates. See also the module function
enumerate().
F)r r r r@ r< s r' r zThread.is_alive sI 4=#7#7#9#9 5 ""5)))###r( c | j S )a A boolean value indicating whether this thread is a daemon thread.
This must be set before start() is called, otherwise RuntimeError is
raised. Its initial value is inherited from the creating thread; the
main thread is not a daemon thread and therefore all threads created in
the main thread default to daemon = False.
The entire Python program exits when only daemon threads are left.
)r r< s r' r z
Thread.daemon s ~ r( c | j st d | j rt d || _ d S )Nr? z)cannot set daemon status of active thread)r rX r r r )r= daemonics r' r z
Thread.daemon sM ? =>> > = ! ! L JKK K!r( c R ddl }| dt d | j S )zwReturn whether this thread is a daemon.
This method is deprecated, use the daemon attribute instead.
r Nz:isDaemon() is deprecated, get the daemon attribute insteadr r r r r r r s r' isDaemonzThread.isDaemon s8
R(Q 8 8 8{r( c V ddl }| dt d || _ dS )ztSet whether this thread is a daemon.
This method is deprecated, use the .daemon property instead.
r Nz;setDaemon() is deprecated, set the daemon attribute insteadr r rP )r= rN r s r' setDaemonzThread.setDaemon s;
S(Q 8 8 8 r( c R ddl }| dt d | j S )zReturn a string used for identification purposes only.
This method is deprecated, use the name attribute instead.
r Nz7getName() is deprecated, get the name attribute insteadr r r r r rC r s r' getNamezThread.getName s8
O(Q 8 8 8yr( c V ddl }| dt d || _ dS )zrSet the name string for this thread.
This method is deprecated, use the name attribute instead.
r Nz7setName() is deprecated, set the name attribute insteadr r rU )r= rC r s r' setNamezThread.setName s;
O(Q 8 8 8 r( )NNNr* Nr[ rl ) rm rF rG rn r r> r rK r, r. r* r2 r
r4 r8 r0 r< r: rB r@ r rC setterrH rJ r r rQ rS rV rX r* r( r' r r M s% L59!%8 158 8 8 8 8 t% % %" N N N 47 7 7" (" " " . . . . 7 7 7 .+ + +6% % %$@ $@ $@ $@L 6 X
[ [ X
# # #
# $ $ $ X ]" " ]" r( r ) _excepthook_ExceptHookArgs)print_exception)
namedtupler z'exc_type exc_value exc_traceback threadc t | S r[ )r[ )r2 s r' r r s
%%r( c z | j t k rdS t t j
t j }n| j | j j }|dS ndS | j
| j j }nt }t d| d|d t | j | j
| j | | dS )z9
Handle uncaught Thread.run() exception.
NzException in thread :Tfileflush)rb )
exc_type
SystemExitr r threadr rC r print_print_exception exc_value
exc_tracebackrc )r2 r rC s r' r r s =J & & F 7[FF
[
$[(F~
F ; ";#DD ;;D
,T,,, ' ' ' ' 8J $ & & & & r( c t t j t d t d t j t t fd} | S )Nz threading.excepthook is Nonezsys.excepthook is Nonec J t }|}t g
| } || ne# t $ rX}d|_ ~j j }n| j } d|d j j }n } |
Y d }~nd }~ww xY wd }d S # d }w xY w)NTz"Exception in threading.excepthook:ra )r r r+ __suppress_context__r r ) rf hookr2 excr sys_excepthook local_print local_sysold_excepthookold_sys_excepthook sys_exc_infos r' invoke_excepthookz2_make_invoke_excepthook.<locals>.invoke_excepthook< s D|%!";LLNN";F";<<D DJJJJ , , ,'+C $$)9)E") K< #4
1
1
1
1 $)=)I!*!5!3 NLLNN + + + + + + +# ,( DDD4DKKKKs, 15 B
BAB
B BB B")r r rX exc_inforg )rv rq rr rs rt ru s @@@@@r' r r , s
N 9:::!3444=LKI @ r( c & e Zd ZdZddZd Zd 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 t | || _ || _ ||ng | _ ||ni | _ t
| _ d S r[ )r r> intervalfunctionr2 r3 r finished)r= rz r{ r2 r3 s r' r> zTimer.__init__j sQ
,DD" & 2ff
r( c 8 | j dS )z)Stop the timer if it hasn't finished yet.N)r| r r< s r' cancelz Timer.cancelr s
r( c | j | j | j s | j | j i | j | j d S r[ )r| r rz r r{ r2 r3 r r< s r' r. z Timer.runv se
4=)))}##%% 5 DM49 4 4 4 4
r( r )rm rF rG rn r> r~ r. r* r( r' r r a sP r( r c e Zd Zd ZdS ) _MainThreadc V t | dd | | j | t r| t 5 | t | j
< d d d d S # 1 swxY w Y d S )N
MainThreadFrC r ) r r> r8 r r r2 r
r4 r' rB r r< s r' r> z_MainThread.__init__ s <>>>
! " ! ! !
( (#'GDK ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (s B B"%B"N)rm rF rG r> r* r( r' r r s# ( ( ( ( (r( r c ( e Zd Zd Zd Zd ZddZdS ) _DummyThreadc H t | t d d | j | t r| t 5 | t | j
< d d d d S # 1 swxY w Y d S )NzDummy-%dTr ) r r> r r r r2 r
r4 r' rB r r< s r' r> z_DummyThread.__init__ s 8J#7#7EEE
! " ! ! !
( (#'GDK ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (s :BB Bc d S r[ r* r< s r' r< z_DummyThread._stop s r( c dS r r* r< s r' r z_DummyThread.is_alive s tr( Nc d S r[ r* r s r' rB z_DummyThread.join s r( r[ )rm rF rG r> r< r rB r* r( r' r r sU ( ( (
3 3 3 3 3 3r( r c r t t S # t $ r t cY S w xY 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.
)rB r rD r r* r( r' r r sA y{{## ~~ s 66c ` ddl } | dt d 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() insteadr r )r r r r r s r'
currentThreadr s< OOO MMO$ 4 4 4 r( c t 5 t t t t z cddd S # 1 swxY w 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' r} rB r( r* r( r' r r s
* *7||c&kk)* * * * * * * * * * * * * * * * * *s )>AAc ` ddl } | dt d t S )zxReturn the number of Thread objects currently alive.
This function is deprecated, use active_count() instead.
r Nz7activeCount() is deprecated, use active_count() insteadr r )r r r r r s r' activeCountr s: OOO MMK$ 4 4 4 >>r( c t t t t z S r[ )listrB valuesr( r* r( r'
_enumerater s/ ! !D $9$9 99r( c t 5 t t t t z cddd S # 1 swxY w 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 rB r r( r* r( r' r r s
> >GNN$$%%V]]__(=(==> > > > > > > > > > > > > > > > > >s A
A""A&)A&c t rt d t j | 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_DOWNrX functoolspartial_threading_atexitsr )r& argr3 calls r' _register_atexitr sV CABBB T 2C 2 2 26 2 2D d#####r( )r c t j rdS dat t D ] } |
t j t
k r:t j }| t n t 5 t t }t
ddd n # 1 swxY w Y |sdS |D ]*}| | +~)zS
Wait until the Python thread state of all non-daemon threads get deleted.
NT) _main_threadr r reversedr rH r r rY r< r7 r r ry rQ ) atexit_calltlocklocksrw s r' _shutdownr sE N 233
Y[[(( )
! $ $ ))E ! ! # # # $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ E D LLNNN LLNNNN s .C CCc t S )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 t ai } t t }n # t $ r t }Y nw xY w|at at a
t 5 t t }| t |D ]_}||u r0| d t }||_ || |< 6| d | `t" t t | ddd dS # 1 swxY w Y dS )zL
Cleanup threading module state that should not exist after a fork.
TFN)r r' rB r rD r r r8 r7 r r r updater r r r< r( ry )
new_activecurrentthreadsrf rH s r' _after_forkr N s J )++& -- L *++eeO ! ! jll##y!!!
F ,,T222! %
$*
5!! ,,U333
z"""-! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! !s" , AA/C$E E$'E$register_at_fork)after_in_child)brn os_ossysr _threadr timer r _weakrefsetr itertoolsr _islicer r; _collectionsr rt ImportError collections__all__start_new_threadr)
allocate_lockr8 r6 r r! r
r rs errorr r r0 r r$ r- r r r r r r5 r1 r
r r r r rX r __next__r r r' rB r( r r7 r r r r rZ r r[ r tracebackr\ rh r] __excepthook__r r r r r r r r r r r r r r r r r
r r _threading_localr hasattrr r* r( r' <module>r so A A # # # # # # 8 8 8 8 8 8 8 8,,,,,,,, , , ,++++++++, E E E , &%
#)M ! NN?#### # # # "#m mGG GGG!
$ $ ${ { { { { { { {z w w w w w w w wtU U U U U U U Up+$ +$ +$ +$ +$y +$ +$ +$\O O O O O O O O z^! ^! ^! ^! ^! ^! ^! ^!B
6!99 & & & UWW
GII
&~'' #%% 1 1 1 j j j j j j j jZ
+< < < < < < < < < ( ( (======&&&&&& j13 3O& & & (X 0 0 0 j F <
(
(
(
(
(&
(
(
(*3 3 3 3 36 3 3 32
* * * : : : > > > $ $ $" {}} 2 2 2p '''''''' ' ' '&&&&&&&&'2! 2! 2!j 73"## 5C 4444445 5sT / ==! B B
B
B B'&B'6E? ?#F%$F% H H! H!
Browse
Usage
Versions