| Server IP : 184.154.167.98 / Your IP : 3.139.67.114 Web Server : Apache System : Linux pink.dnsnetservice.com 4.18.0-553.22.1.lve.1.el8.x86_64 #1 SMP Tue Oct 8 15:52:54 UTC 2024 x86_64 User : puertode ( 1767) PHP Version : 8.2.26 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : ON | Sudo : ON | Pkexec : ON Directory : /usr/lib64/python3.8/__pycache__/ |
Upload File : |
U
e5d�� � @ s2 d Z ddlZddlZddlZddlmZ ddl m
Z
ddl m Z
mZ zddlmZ W n ek
rt ddlmZ Y nX ddd d
d d d
ddddddddddddddd d gZejZejZejZejZzej Z d Z e� d � W n e k
r� d Z Y nX ej Z!z
ej"Z#W n e k
�r dZ#Y nX ej$Z$[da%da&d!d� Z'd"d� Z(eZ)d#d� Z"G d$d%� d%�Z*e*Z+G d&d � d �Z,G d'd� d�Z-G d(d� de-�Z.G d)d� d�Z/G d*d� d�Z0G d+d� de1�Z2e� j3Z4e4� dLd-d.�Z5e� a6i Z7i Z8e
� Z9e� a:e;� a<G d/d� d�Z=zdd0lm>a?m@ZA W nH ek
�rV dd1lBmCZD dd2lmEZE eEd d3�Z@d4d � ZAd5d � a?Y nX d6d7� ZFG d8d� de=�ZGG d9d:� d:e=�ZHG d;d<� d<e=�ZId=d
� ZJeJZKd>d� ZLeLZMd?d@� ZNdAd � ZOddBlmPZP eH� aQdCdD� ZRdEd � ZSzddFlmTZU W n" ek
�r ddGlVmUZU Y nX dHdI� ZWeXedJ��r.ejYeWdK� dS )Mz;Thread module emulating a subset of Java's threading model.� N)� monotonic)�WeakSet)�islice�count)�deque� get_ident� active_count� Condition�current_thread� enumerate� main_thread� TIMEOUT_MAX�Event�Lock�RLock� Semaphore�BoundedSemaphore�Thread�Barrier�BrokenBarrierError�Timer� ThreadError�
setprofile�settrace�local�
stack_size�
excepthook�ExceptHookArgsT�
get_native_idFc C s | a dS )z�Set 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_hook��func� r" �!/usr/lib64/python3.8/threading.pyr 9 s c C s | a dS )z�Set 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 C s c O s t dkrt| |�S t | |�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)�args�kwargsr" r" r# r Q s
c @ sV e Zd ZdZdd� Zdd� Zddd �ZeZd
d � Zd d
� 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�_count��selfr" r" r# �__init__h s z_RLock.__init__c C s^ | j }zt| j}W n tk
r( Y nX d| j�� r:dnd| jj| jj|| j t
t | ��f S )Nz)<%s %s.%s object owner=%r count=%d at %s>�lockedZunlocked) r- �_active�name�KeyErrorr, r2 � __class__�
__module__� __qualname__r. �hex�id)r0 �ownerr" r" r# �__repr__m s
�z_RLock.__repr__T���c 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 r- r. r, �acquire)r0 �blocking�timeout�me�rcr" r" r# r? | s
z_RLock.acquirec C s< | j t� krtd��| jd | _}|s8d| _ | j�� 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 lockr> N)r- r � RuntimeErrorr. r, �release)r0 r r" r" r# rF � s z_RLock.releasec C s | � � d S �N�rF �r0 �t�v�tbr" r" r# �__exit__� s z_RLock.__exit__c C s | j �� |\| _| _d S rG )r, r? r. r- )r0 �stater" r" r# �_acquire_restore� s
z_RLock._acquire_restorec C s< | j dkrtd��| j }d| _ | j}d | _| j�� ||fS )Nr rD )r. rE r- r, rF )r0 r r; r" r" r# �
_release_save� s
z_RLock._release_savec C s | j t� kS rG )r- r r/ r" r" r# � _is_owned� s z_RLock._is_ownedN)Tr= )
�__name__r7 r8 �__doc__r1 r< r? � __enter__rF rM rO rP rQ r" r" r" r# r) ^ s
$
r) c @ st e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
ddd�Z d dd�Z d dd�Z
dd� ZeZdS ) 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 krt � }|| _|j| _|j| _z |j| _W n tk
rD Y nX z |j| _W n tk
rf Y nX z |j| _W n tk
r� Y nX t� | _ d S rG )
r �_lockr? rF rP �AttributeErrorrO rQ �_deque�_waiters�r0 �lockr" r" r# r1 � s$ zCondition.__init__c C s
| j �� S rG )rU rT r/ r" r" r# rT � s zCondition.__enter__c G s | j j|� S rG )rU rM )r0 r' r" r" r# rM � s zCondition.__exit__c C s d| j t| j�f S )Nz<Condition(%s, %d)>)rU �lenrX r/ r" r" r# r< � s zCondition.__repr__c C s | j �� d S rG )rU rF r/ r" r" r# rP � s zCondition._release_savec C s | j �� d S rG )rU r? )r0 �xr" r" r# rO s zCondition._acquire_restorec C s" | j �d�r| j �� dS dS d S )Nr FT)rU r? rF r/ r" r" r# rQ s
zCondition._is_ownedc C s� | � � std��t� }|�� | j�|� | �� }d}z>|dkrN|�� d}n |dkrd|�d|�}n
|�d�}|W �S | �|� |s�z| j�|� W n t k
r� Y nX X dS )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 )
rQ rE r+ r? rX �appendrP rO �remove�
ValueError)r0 rA �waiterZ saved_stateZgotitr" r" r# �wait s*
zCondition.waitc C sX d}|}|� }|sT|dk rB|dkr.t � | }n|t � }|dkrBqT| �|� |� }q|S )z�Wait 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 )�_timera )r0 Z predicaterA �endtimeZwaittime�resultr" r" r# �wait_for> s
zCondition.wait_forr> c C sf | � � std��| j}tt||��}|s,dS |D ]0}|�� z|�|� W q0 tk
r^ Y q0X q0dS )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 lockN)rQ rE rX rW �_islicerF r^ r_ )r0 �nZ all_waitersZwaiters_to_notifyr` r" r" r# �notifyU s
zCondition.notifyc C s | � t| j�� dS )z�Wake 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)rh r[ rX r/ r" r" r# �
notify_alll s zCondition.notify_all)N)N)N)r> )rR r7 r8 rS r1 rT rM r< rP rO rQ ra re rh ri Z notifyAllr" r" r" r# r � s
0
c @ s8 e Zd ZdZd
dd�Zddd�ZeZd 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.
r> c C s& |dk rt d��tt� �| _|| _d S )Nr z$semaphore initial value must be >= 0)r_ r r �_cond�_value�r0 �valuer" r" r# r1 � s zSemaphore.__init__TNc C s� |s|dk rt d��d}d}| j�f | jdkrr|s4q�|dk rd|dkrPt� | }n|t� }|dkrdq�| j�|� q$| jd8 _d}W 5 Q R X |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 r> T)r_ rj rk rb ra )r0 r@ rA rC rc r" r" r# r? � s$
zSemaphore.acquirec C s. | j � | jd7 _| j �� W 5 Q R X dS )z�Release a semaphore, incrementing the internal counter by one.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
r> N)rj rk rh r/ r" r" r# rF � s zSemaphore.releasec C s | � � d S rG rH rI r" r" r# rM � s zSemaphore.__exit__)r> )TN) rR r7 r8 rS r1 r? rT rF rM r" r" r" r# r x s
- c @ s" e Zd ZdZddd�Zdd� ZdS ) 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.
r> c C s t �| |� || _d S rG )r r1 �_initial_valuerl r" r" r# r1 � s zBoundedSemaphore.__init__c C sB | j �2 | j| jkr td��| jd7 _| j �� W 5 Q R X dS )a6 Release a semaphore, incrementing the internal counter by one.
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.
z!Semaphore released too many timesr> N)rj rk rn r_ rh r/ r" r" r# rF � s
zBoundedSemaphore.releaseN)r> )rR r7 r8 rS r1 rF r" r" r" r# r � s
c @ sF e Zd ZdZdd� Zdd� Zdd� ZeZdd � Zd
d � Z dd
d�Z
d S )r z�Class 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 rj �_flagr/ r" r" r# r1 � s zEvent.__init__c C s | j �t� � d S rG )rj r1 r r/ r" r" r# �_reset_internal_locks� s zEvent._reset_internal_locksc C s | j S )z5Return true if and only if the internal flag is true.)ro r/ r" r" r# �is_set s z Event.is_setc C s& | j � d| _| j �� W 5 Q R X dS )z�Set 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)rj ro ri r/ r" r" r# �set s z Event.setc C s | j � d| _W 5 Q R X dS )z�Reset the internal flag to false.
Subsequently, threads calling wait() will block until set() is called to
set the internal flag to true again.
FN)rj ro r/ r" r" r# �clear s z Event.clearNc
C s8 | j �( | j}|s | j �|�}|W 5 Q R � S Q R X 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)rj ro ra )r0 rA Zsignaledr" r" r# ra s
z
Event.wait)N) rR r7 r8 rS r1 rp rq ZisSetrr rs ra r" r" r" r# r � s
c @ s� e Zd ZdZddd�Zd dd�Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z e
dd� �Ze
dd� �Ze
dd� �ZdS ) r z�Implements 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 rj �_action�_timeout�_parties�_stater. )r0 �parties�actionrA r" r" r# r1 F s zBarrier.__init__c
C s� |dkr| j }| j�r | �� | j}| jd7 _z6|d | jkrL| �� n
| �|� |W �W 5 Q R � S | jd8 _| �� X W 5 Q R X 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'.
Nr> )ru rj �_enterr. �_exitrv �_release�_wait)r0 rA �indexr" r" r# ra V s
z Barrier.waitc C s6 | j dkr| j�� q | j dk r$t�| j dks2t�d S )N�r= r> r )rw rj ra r �AssertionErrorr/ r" r" r# rz t s
zBarrier._enterc C s> z"| j r| � � d| _| j�� W n | �� � Y nX d S )Nr> )rt rw rj ri �_breakr/ r" r" r# r| s zBarrier._releasec sB � j �� fdd�|�s"� �� t�� jdk r0t�� jdks>t�d S )Nc s
� j dkS r* �rw r" r/ r" r# �<lambda>� � z Barrier._wait.<locals>.<lambda>r r> )rj re r� r rw r� �r0 rA r" r/ r# r} � s
z
Barrier._waitc C s( | j dkr$| jdkr$d| _| j�� d S )Nr r )r. rw rj ri r/ r" r" r# r{ � s
z
Barrier._exitc C sT | j �D | jdkr6| jdkr$d| _q<| jdkr<d| _nd| _| j �� W 5 Q R X dS )z�Reset the barrier to the initial state.
Any threads currently waiting will get the BrokenBarrier exception
raised.
r r= ���N)rj r. rw ri r/ r" r" r# �reset� s
z
Barrier.resetc C s | j � | �� W 5 Q R X dS )z�Place 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)rj r� r/ r" r" r# �abort� s z
Barrier.abortc C s d| _ | j�� d S )Nr� )rw rj ri r/ r" r" r# r� � s zBarrier._breakc C s | j S )z:Return the number of threads required to trip the barrier.)rv r/ r" r" r# rx � s zBarrier.partiesc C s | j dkr| jS dS )z>Return the number of threads currently waiting at the barrier.r )rw r. r/ 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� r/ r" r" r# �broken� s zBarrier.broken)NN)N)rR r7 r8 rS r1 ra rz r| r} r{ r� r� r� �propertyrx r� r� r" r" r" r# r = s
c @ s e Zd ZdS )r N)rR r7 r8 r" r" r" r# r � s � Thread-%dc C s
| t � S rG )�_counter)�templater" r" r# �_newname� s r� c @ s e Zd ZdZdZd:dd�dd�Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z e r\dd� Z
dd� Zdd� Zdd� Zd d � Zd;d d �Zd<d"d#�Zed$d%� �Zejd&d%� �Zed'd(� �Ze r�ed)d*� �Zd+d,� Zd-d.� Zed/d0� �Zejd1d0� �Zd2d3� Z d4d5� Z d6d7� Z d8d9� 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� |dkst d��|dkr i }|| _t|p,t� �| _|| _|| _|dk rN|| _n
t� j | _d| _
t rhd| _ 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 nowFT)r� �_target�strr� �_name�_args�_kwargs� _daemonicr
r� �_ident�_HAVE_THREAD_NATIVE_ID�
_native_id� _tstate_lockr �_started� _is_stopped� _initialized�_sys�stderr�_stderr�_make_invoke_excepthook�_invoke_excepthook� _dangling�add)r0 �group�targetr4 r' r( r� r" r" r# r1 � s(
zThread.__init__c C s( | j �� |r| �� n d| _d | _d S �NT)r� rp �_set_tstate_lockr� r� )r0 �is_aliver" r" r# rp ( s
z Thread._reset_internal_locksc C sl | j std��d}| j�� r d}| �� | jr2d}| jr@|d7 }| jd k rX|d| j 7 }d| jj | j
|f S )Nz Thread.__init__() was not called�initialZstartedZstoppedz daemonz %sz <%s(%s, %s)>) r� r� r� rq r� r� r� r� r6 rR r� )r0 Zstatusr" r" r# r< 4 s
zThread.__repr__c C s� | j std��| j�� r td��t� | t| < W 5 Q R X zt| jd� W n, tk
rt t� t| = W 5 Q R X � Y nX | 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 oncer" N)
r� rE r� rq �_active_limbo_lock�_limbo�_start_new_thread�
_bootstrap� Exceptionra r/ r" r" r# �startB s
z Thread.startc C s. z| j r| j | j| j� W 5 | ` | `| `X dS )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/ r" r" r# �run[ s z
Thread.runc C s4 z | � � W n" | jr(td kr(Y d S � Y nX d S rG )�_bootstrap_innerr� r� r/ r" r" r# r� l s
zThread._bootstrapc C s t � | _d S rG )r r� r/ r" r" r# �
_set_ident� s zThread._set_identc C s t � | _d S rG )r r� r/ r" r" r# �_set_native_id� s zThread._set_native_idc C s8 t � | _| j�� | js4t� t�| j� W 5 Q R X 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� r? r� �_shutdown_locks_lock�_shutdown_locksr� r/ r" r" r# r� � s
zThread._set_tstate_lockc C s� z�| �� | �� tr | �� | j�� t � | t| j < t
| = W 5 Q R X t rVt �
t � trdt �t� z | �� W n | �| � Y nX W 5 t � z tt� = W n Y nX W 5 Q R X X d S rG )r� r3 r r� r� r� r� r� rr r� r� r$ r� r r r r� r� r/ r" r" r# r� � s,
zThread._bootstrap_innerc C sJ | j }|d k r|�� rt�d| _d | _ | jsFt� t�|� W 5 Q R X d S r� )r� r2 r� r� r� r� r� �discardrY r" r" r# �_stop� s z Thread._stopc C s t � tt� = W 5 Q R X dS )zARemove current thread from the dict of currently running threads.N)r� r3 r r/ r" r" r# �_delete� s zThread._deletec C sZ | j std��| j�� s td��| t� kr2td��|dkrD| �� n| jt|d�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 )rA )r� rE r� rq r
�_wait_for_tstate_lock�maxr� r" r" r# �join� s
z Thread.joinTr= c C s: | j }|d kr| js6t�n |�||�r6|�� | �� d S rG )r� r� r� r? rF r� )r0 �blockrA rZ r" r" r# r� � s z Thread._wait_for_tstate_lockc C s | j std��| jS )z�A 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� r� r� r/ r" r" r# r4 s z Thread.namec C s | j std��t|�| _d S )Nr� )r� r� r� r� �r0 r4 r" r" r# r4 s c C s | j std��| jS )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� r� r� r/ r" r" r# �ident s z Thread.identc C s | j std��| jS )z�Native 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� r� r� r/ r" r" r# � native_id$ s zThread.native_idc C s4 | j std��| js | j�� s"dS | �d� | j S )z�Return whether the thread is alive.
This method returns True just before the run() method starts until just
after the run() method terminates. The module function enumerate()
returns a list of all alive threads.
r� F)r� r� r� r� rq r� r/ r" r" r# r� / s
zThread.is_alivec C s ddl }|jdtdd� | �� S )zhReturn whether the thread is alive.
This method is deprecated, use is_alive() instead.
r Nz/isAlive() is deprecated, use is_alive() instead� )�
stacklevel)�warnings�warn�DeprecationWarningr� )r0 r� r" r" r# �isAlive= s �zThread.isAlivec C s | j std��| jS )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� r� r� r/ r" r" r# r� G s z
Thread.daemonc C s* | j std��| j�� r td��|| _d S )Nr� z)cannot set daemon status of active thread)r� rE r� rq r� �r0 Zdaemonicr" r" r# r� V s
c C s | j S rG r� r/ r" r" r# �isDaemon^ s zThread.isDaemonc C s
|| _ d S rG r� r� r" r" r# � setDaemona s zThread.setDaemonc C s | j S rG �r4 r/ r" r" r# �getNamed s zThread.getNamec C s
|| _ d S rG r� r� r" r" r# �setNameg s zThread.setName)NNNr" N)N)Tr= ) rR r7 r8 rS r� r1 rp r< r� r� r� r� r� r� r� r� r� r� r� r� r� r4 �setterr� r� r� r� r� r� r� r� r� r" r" r" r# r � sR �� /
&
)� _excepthook�_ExceptHookArgs)�print_exception)�
namedtuplez'exc_type exc_value exc_traceback threadc C s t | � S rG )r� )r' r" r" r# r w s c C s� | j tkrdS tdk r(tjdk r(tj}n$| jdk rH| jj}|dkrLdS ndS | jdk r`| jj}nt� }td|� d�|dd� t | j | j
| j |d� |� � dS )z9
Handle uncaught Thread.run() exception.
NzException in thread �:T��file�flush)r� )
�exc_type�
SystemExitr� r� �threadr� r4 r �print�_print_exception� exc_value�
exc_tracebackr� )r' r� r4 r" r" r# r z s(
��c sP t �tj ��d krtd���d kr*td��tj�t� t�� ����fdd�} | S )Nz threading.excepthook is Nonezsys.excepthook is Nonec
s� z�z,t }|d kr�}t�� | f��}||� W n� tk
r� } zbd|_~�d k rb�jd k rb�j}n| j}� d|dd� �d k r��j d k r��j }n�}|�� � W 5 d }~X Y nX W 5 d }X d S )NTz"Exception in threading.excepthook:r� )r r r� �__suppress_context__r� r� )r� r' �hook�excr� Zsys_excepthook�Z local_printZ local_sysZold_excepthookZold_sys_excepthookZ sys_exc_infor" r# �invoke_excepthook� s* � z2_make_invoke_excepthook.<locals>.invoke_excepthook)r r� rE �exc_infor� )r� r" r� r# r� � s r� c @ s* e Zd ZdZd dd�Zdd� Zdd� ZdS )
r z�Call 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 k r"|ng | _|d k r4|ni | _t� | _d S rG )r r1 �interval�functionr' r( r �finished)r0 r� r� r' r( r" r" r# r1 � s
zTimer.__init__c C s | j �� dS )z)Stop the timer if it hasn't finished yet.N)r� rr r/ r" r" r# �cancel� s z Timer.cancelc C s6 | j �| j� | j �� s(| j| j| j� | j �� d S rG )r� ra r� rq r� r' r( rr r/ r" r" r# r� � s
z Timer.run)NN)rR r7 r8 rS r1 r� r� r" r" r" r# r � s
c @ s e Zd Zdd� ZdS )� _MainThreadc C sT t j| ddd� | �� | j�� | �� tr6| �� t� | t | j
< W 5 Q R X d S )NZ
MainThreadF�r4 r� ) r r1 r� r� rr r� r� r� r� r3 r� r/ r" r" r# r1 � s
z_MainThread.__init__N)rR r7 r8 r1 r" r" r" r# r� � s r� c @ s. e Zd Zdd� Zdd� Zdd� Zd
dd �ZdS ) � _DummyThreadc C sP t j| td�dd� | j�� | �� tr2| �� t� | t | j
< W 5 Q R X d S )NzDummy-%dTr� ) r r1 r� r� rr r� r� r� r� r3 r� r/ r" r" r# r1 s
z_DummyThread.__init__c C s d S rG r" r/ r" r" r# r�
s z_DummyThread._stopc C s | j s| j�� st�dS r� )r� r� rq r� r/ r" r" r# r� s z_DummyThread.is_aliveNc C s ds t d��d S )NFzcannot join a dummy thread)r� r� r" r" r# r� s z_DummyThread.join)N)rR r7 r8 r1 r� r� r� r" r" r" r# r� s
r� c C s, z t t� W S tk
r& t� Y S X dS )z�Return 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.
N)r3 r r5 r� r" r" r" r# r
s c
C s, t � tt�tt� W 5 Q R � S Q R X dS )z�Return the number of Thread objects currently alive.
The returned count is equal to the length of the list returned by
enumerate().
N)r� r[ r3 r� r" r" r" r# r ( s c C s t t�� �t t�� � S rG )�listr3 �valuesr� r" r" r" r# �
_enumerate4 s r� c
C s4 t �& tt�� �tt�� � W 5 Q R � S Q R X dS )z�Return 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� r3 r� r� r" r" r" r# r 8 s )r c C s~ t jr
dS t j} | dk s t�| �� s(t�| �� t �� t� tt �}t �
� W 5 Q R X |s^qz|D ]}|� � |�� qbq8dS )zS
Wait until the Python thread state of all non-daemon threads get deleted.
N) � _main_threadr� r� r� r2 rF r� r� r� r� rs r? )ZtlockZlocksrZ r" r" r# � _shutdownK s r� c C s t S )z�Return 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 s )�_local)r c C s� t � ai } ztt� }W n tk
r2 t� }Y nX |at � at� a t�� tt
� �}|� t � |D ]>}||kr�|�
d� t� }||_|| |< qb|�
d� |�� qbt�� t�� t� | � tt�dks�t�W 5 Q R X dS )zL
Cleanup threading module state that should not exist after a fork.
TFr> N)r+ r� r3 r r5 r� r� r� rr r� r� �updater� rp r� r� r� rs r[ r� )Z
new_activeZcurrentZthreadsr� r� r" r" r# � _after_fork� s0
r� �register_at_fork)Zafter_in_child)r� )ZrS �os�_os�sysr� �_thread�timer rb Z _weakrefsetr � itertoolsr rf r r. � _collectionsr rW � ImportError� collections�__all__�start_new_threadr� �
allocate_lockr+ r� r r r� r] rV �errorr r r% r
r r$ r r r r) r& r r r r r rE r �__next__r� r� r� r3 r� r� r� rr r� r r� r r� r � tracebackr� r� r� r� r r� r� r
Z
currentThreadr Z activeCountr� r r r� r� r r� r Z_threading_localr� �hasattrr� r" r" r" r# �<module> s� �
q 'P&O
� 5
( 5