Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

3


 \�<�@s�dZd
ddddgZ
ddlZdd	lmZ
dd
lmZ
ddlmZ
ddlmZ
Gd
d�d�Z	Gdd�d�Z
Gdd
�d
e
�ZGdd�d�ZGdd�de
�Z
Gdd�de
�ZGdd�de�ZdS)zSynchronization primitives.�Lock�Event�	Condition�	Semaphore�BoundedSemaphore�N�
)
�compat)
�events)
�futures)
�	coroutinec@s(eZ
dZd
Zdd�Zdd�Zdd�ZdS)	�_ContextManagera
Context manager.

    This enables the following idiom for acquiring and releasing a
    lock around a block:

        with (yield from lock):
            <block>

    while failing loudly when accidentally using:

        with lock:
            <block>
    cCs
|
|_dS)
N)
�_lock)�self�lock�r�%/usr/lib64/python3.6/asyncio/locks.py�__init__s
z_ContextManager.__init__c


CsdS)
Nr)
rrrr�	__enter__sz_ContextManager.__enter__c
Gsz|jj
�
Wdd|_XdS)
N)r
�release)r�argsrrr�__exit__$s

z_ContextManager.__exit__N)�__name__�
__module__�__qualname__�__doc__rrrrrrrr
s
rc@sNeZ
dZd
d�Zdd�Zedd��
ZejrJdd�Z	ed	d
��
Z
edd��
Zd
S)�_ContextManagerMixinc

Cstd
�
�
dS)Nz9"yield from" should be used as context manager expression)
�RuntimeError)
rrrrr,s

z_ContextManagerMixin.__enter__c

GsdS)
Nr)rrrrrr0sz_ContextManagerMixin.__exit__c

cs|j�EdH
t
|�
S)
N)�acquirer)
rrrr�__iter__5s
z_ContextManagerMixin.__iter__c

cs|j�EdH
t
|�
S)
N)rr)
rrrr�	__await__Hs
z_ContextManagerMixin.__await__c

cs|j�EdH
dS)
N)
r)
rrrr�
__aenter__Msz_ContextManagerMixin.__aenter__c
Cs|j�
dS)
N)
r)r�exc_type�exc�tbrrr�	__aexit__Tsz_ContextManagerMixin.__aexit__N)rrrrrrrrZPY35rr r$rrrrr+s
rcsReZ
dZd
Zdd�
dd�Z�f
dd�Zdd	�Zed
d��
Zdd
�Z	dd�Z
�ZS)r
a�Primitive lock objects.

    A primitive lock is a synchronization primitive that is not owned
    by a particular coroutine when locked.  A primitive lock is in one
    of two states, 'locked' or 'unlocked'.

    It is created in the unlocked state.  It has two basic methods,
    acquire() and release().  When the state is unlocked, acquire()
    changes the state to locked and returns immediately.  When the
    state is locked, acquire() blocks until a call to release() in
    another coroutine changes it to unlocked, then the acquire() call
    resets it to locked and returns.  The release() method should only
    be called in the locked state; it changes the state to unlocked
    and returns immediately.  If an attempt is made to release an
    unlocked lock, a RuntimeError will be raised.

    When more than one coroutine is blocked in acquire() waiting for
    the state to turn to unlocked, only one coroutine proceeds when a
    release() call resets the state to unlocked; first coroutine which
    is blocked in acquire() is being processed.

    acquire() is a coroutine and should be called with 'yield from'.

    Locks also support the context management protocol.  '(yield from lock)'
    should be used as the context manager expression.

    Usage:

        lock = Lock()
        ...
        yield from lock
        try:
            ...
        finally:
            lock.release()

    Context manager usage:

        lock = Lock()
        ...
        with (yield from lock):
             ...

    Lock objects can be tested for locking state:

        if not lock.locked():
           yield from lock
        else:
           # lock is acquired
           ...

    N)
�loopc

Cs.tj
�|_d
|_|
dk	r |
|_n
tj�|_dS)NF)�collections�deque�_waiters�_locked�_loopr	�get_event_loop)rr%rrrr�s





z
Lock.__init__c
sDt�j
�}
|jrd
nd}|jr0dj|t|j�
�}dj|
dd�|�S)N�locked�unlockedz
{},waiters:{}z	<{} [{}]>r���)�super�__repr__r)r(�format�len)r�res�extra)
�	__class__rrr0�s






z
Lock.__repr__c


Cs|jS)
z Return True if lock is acquired.)
r))
rrrrr,�szLock.lockedc
cs�|jr&t
d
d�|jD�
�
r&d|_dS|jj�}
|jj|
�

y"z|
EdH
Wd|jj|
�

XWn&tjk
r�


|js~|j	�
�YnXd|_dS)z�Acquire a lock.

        This method blocks until the lock is unlocked, then sets it to
        locked and returns True.
        c
ss|]}
|
j�V
qdS)
N)
�	cancelled)�.0�
wrrr�	<genexpr>�szLock.acquire.<locals>.<genexpr>TN)
r)�allr(r*�
create_future�append�remover
�CancelledError�_wake_up_first)r�futrrrr�s










zLock.acquirec

Cs"|jrd
|_|j
�
ntd�
�
dS)aG
Release a lock.

        When the lock is locked, reset it to unlocked, and return.
        If any other coroutines are blocked waiting for the lock to become
        unlocked, allow exactly one of them to proceed.

        When invoked on an unlocked lock, a RuntimeError is raised.

        There is no return value.
        FzLock is not acquired.N)r)r?r)
rrrrr�s


zLock.releasec
Cs>ytt
|j�
�
}
Wntk
r&


d
SX|
j�s:|
jd�

d
S)z*Wake up the first waiter if it isn't done.NT)�next�iterr(�
StopIteration�done�
set_result)rr@rrrr?�s



zLock._wake_up_first)rrrrrr0r,rrrr?�
__classcell__rr)
r5rr
Ys4csReZ
dZd
Zdd�
dd�Z�f
dd�Zdd	�Zd
d�Zdd
�Ze	dd��
Z
�ZS)ra#
Asynchronous equivalent to threading.Event.

    Class implementing event objects. An event manages 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.
    N)
r%c

Cs.tj
�|_d
|_|
dk	r |
|_n
tj�|_dS)NF)r&r'r(�_valuer*r	r+)rr%rrrr�s





zEvent.__init__c
sDt�j
�}
|jrd
nd}|jr0dj|t|j�
�}dj|
dd�|�S)N�setZunsetz
{},waiters:{}z	<{} [{}]>rr.)r/r0rGr(r1r2)rr3r4)
r5rrr0�s






zEvent.__repr__c


Cs|jS)
z5Return True if and only if the internal flag is true.)
rG)
rrrr�is_set�szEvent.is_setc
Cs2|js.d
|_x |j
D]}
|
j�s|
jd
�

qWdS)z�Set the internal flag to true. All coroutines waiting for it to
        become true are awakened. Coroutine that call wait() once the flag is
        true will not block at all.
        TN)rGr(rDrE)rr@rrrrH�s



z	Event.setc

Cs
d
|_dS)z�Reset the internal flag to false. Subsequently, coroutines calling
        wait() will block until set() is called to set the internal flag
        to true again.FN)
rG)
rrrr�clear
szEvent.clearc
csB|jr
d
S|j
j�}
|jj|
�

z|
EdH
d
S|jj|
�

XdS)z�Block until the internal flag is true.

        If the internal flag is true on entry, return True
        immediately.  Otherwise, block until another coroutine calls
        set() to set the flag to true, then return True.
        TN)rGr*r;r(r<r=)rr@rrr�wait

s






z
Event.wait)rrrrrr0rIrHrJrrKrFrr)
r5rr�scsZeZ
dZd
Zddd�
dd�Z�f
dd�Zedd	��
Zed
d��
Zdd
d�
Z	dd�Z
�ZS)ra
Asynchronous equivalent to threading.Condition.

    This class implements condition variable objects. A condition variable
    allows one or more coroutines to wait until they are notified by another
    coroutine.

    A new Lock object is created and used as the underlying lock.
    N)
r%c
Csp|dk	r||_n
t
j�|_|
dkr0t|jd
�
}
n|
j|jk	rDtd�
�
|
|_|
j|_|
j|_|
j|_t	j
�|_dS)N)
r%z"loop argument must agree with lock)r*r	r+r
�
ValueErrorr
r,rrr&r'r()rrr%rrrr+
s







zCondition.__init__c
sFt�j
�}
|j�rd
nd}|jr2dj|t|j�
�}dj|
dd�|�S)Nr,r-z
{},waiters:{}z	<{} [{}]>rr.)r/r0r,r(r1r2)rr3r4)
r5rrr0>
s






zCondition.__repr__c
cs�|j�st
d
�
�
|j�
z8|jj�}
|jj|
�

z|
EdH
dS|jj|
�

XWdd}x4y|j�EdH
PWqXt	j
k
r�


d}YqXXqXW|r�t	j
�
XdS)a�
Wait until notified.

        If the calling coroutine 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 coroutine.  Once
        awakened, it re-acquires the lock and returns True.
        zcannot wait on un-acquired lockNTF)r,rrr*r;r(r<r=rr
r>)rr@r6rrrrKE
s&















zCondition.waitccs(|
�}x|s"|j�Ed
H
|
�}qW|S)z�Wait until a predicate becomes true.

        The predicate should be a callable which result will be
        interpreted as a boolean value.  The final predicate value is
        the return value.
        N)
rK)rZ	predicate�resultrrr�wait_fork
s





zCondition.wait_forrcCsL|j�st
d
�
�
d}x2|jD](}||
kr*P|j�s|d7}|jd�

qWdS)aBy default, wake up one coroutine waiting on this condition, if any.
        If the calling coroutine has not acquired the lock when this method
        is called, a RuntimeError is raised.

        This method wakes up at most n of the coroutines waiting for the
        condition variable; it is a no-op if no coroutines are waiting.

        Note: an awakened coroutine does not actually return from its
        wait() call until it can reacquire the lock. Since notify() does
        not release the lock, its caller should.
        z!cannot notify on un-acquired lockrrFN)r,rr(rDrE)r�
n�idxr@rrr�notifyy
s





zCondition.notifyc

Cs|jt
|j�
�

d
S)a
Wake up all threads waiting on this condition. This method acts
        like notify(), but wakes up all waiting threads instead of one. If the
        calling thread has not acquired the lock when this method is called,
        a RuntimeError is raised.
        N)rQr2r()
rrrr�
notify_all�
szCondition.notify_all)
N)
r)rrrrrr0rrKrNrQrRrFrr)
r5rr!
s&
csTeZ
dZd
Zddd�
dd�Z�f
dd�Zd	d
�Zdd�Zed
d��
Z	dd�Z
�ZS)raA Semaphore implementation.

    A semaphore manages an internal counter which is decremented by each
    acquire() call and incremented by each release() call. The counter
    can never go below zero; when acquire() finds that it is zero, it blocks,
    waiting until some other thread calls release().

    Semaphores also support the context management protocol.

    The optional argument gives the initial value for the internal
    counter; it defaults to 1. If the value given is less than 0,
    ValueError is raised.
    rN)
r%c
Cs>|
d
krtd�
�
|
|_
tj�|_|dk	r0||_n
tj�|_dS)Nrz$Semaphore initial value must be >= 0)rLrGr&r'r(r*r	r+)r�valuer%rrrr�
s






zSemaphore.__init__c
sNt�j
�}
|j�rd
n
dj|j�
}|jr:dj|t|j�
�}dj|
dd�|�S)Nr,zunlocked,value:{}z
{},waiters:{}z	<{} [{}]>rr.)r/r0r,r1rGr(r2)rr3r4)
r5rrr0�
s






zSemaphore.__repr__c
Cs0x*|jr*|jj
�}
|
j�s|
jd�

dSqWdS)
N)r(�popleftrDrE)rZwaiterrrr�
_wake_up_next�
s







zSemaphore._wake_up_nextc

Cs
|jd
kS)z:Returns True if semaphore can not be acquired immediately.r)
rG)
rrrrr,�
szSemaphore.lockedc
	cszxf|jd
k
rf|j
j�}
|jj|
�

y|
EdH
Wq


|
j�
|jd
kr\|
j�r\|j�
�YqXqW|jd8_dS)a5
Acquire a semaphore.

        If the internal counter is larger than zero on entry,
        decrement it by one and return True immediately.  If it is
        zero on entry, block, waiting until some other coroutine has
        called release() to make it larger than 0, and then return
        True.
        rNrT)rGr*r;r(r<Zcancelr6rU)rr@rrrr�
s











zSemaphore.acquirec

Cs|jd
7_|j
�
dS)z�Release a semaphore, incrementing the internal counter by one.
        When it was zero on entry and another coroutine is waiting for it to
        become larger than zero again, wake up that coroutine.
        rN)rGrU)
rrrrr�
s
zSemaphore.release)
r)rrrrrr0rUr,rrrrFrr)
r5rr�
s

cs4eZ
dZd
Zd	dd�
�f
dd�Z�f
dd�Z�ZS)
rz�A bounded semaphore implementation.

    This raises ValueError in release() if it would increase the value
    above the initial value.
    rN)
r%c
s|
|_t
�j|
|d
�
dS)N)
r%)�_bound_valuer/r)rrSr%)
r5rrr�
s

zBoundedSemaphore.__init__c

s"|j|j
krtd
�
�
t�j�
dS)Nz(BoundedSemaphore released too many times)rGrVrLr/r)
r)
r5rrr�
s


zBoundedSemaphore.release)
r)rrrrrrrFrr)
r5rr�
s)r�__all__r&�rr	r
Z
coroutinesrrrr
rrrrrrrr�<module>
s


.ByM