֦i3J ` d Z dZddlZddlZddlmZ ddlmZ G d d Z G d d
eej Z G d d ej Z
G d
deej Z G d deej Z G d de Z
G d dej Z G d dej Zy)zSynchronization primitives.)LockEvent Condition SemaphoreBoundedSemaphoreBarrier N )
exceptions)mixinsc e Zd Zd Zd Zy)_ContextManagerMixinc @ K | j d { y 7 wN)acquireselfs &/usr/lib64/python3.12/asyncio/locks.py
__aenter__z _ContextManagerMixin.__aenter__
s lln s c , K | j y wr )release)r exc_typeexctbs r __aexit__z _ContextManagerMixin.__aexit__ s s N)__name__
__module__ __qualname__r r r r
r
s r r
c @ e Zd ZdZd Z fdZd Zd Zd Zd Z xZ
S )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 'await'.
Locks also support the asynchronous context management protocol.
'async with lock' statement should be used.
Usage:
lock = Lock()
...
await lock.acquire()
try:
...
finally:
lock.release()
Context manager usage:
lock = Lock()
...
async with lock:
...
Lock objects can be tested for locking state:
if not lock.locked():
await lock.acquire()
else:
# lock is acquired
...
c d | _ d| _ y NF)_waiters_lockedr s r __init__z
Lock.__init__M s
r c t | }| j rdnd}| j r| dt | j }d|dd d| dS Nlockedunlocked
, waiters:)super__repr__r$ r# lenr resextra __class__s r r0 z
Lock.__repr__Q sY g LLj == gZDMM(:';z Lock.acquire..c s 9=aAKKM=s T) r$ r# all collectionsdeque _get_loop
create_futureappendremover
CancelledError_wake_up_firstr futs r r z Lock.acquire\ s $--"794==99 DL == ' - - /DMnn ,,.
S!
*
$$S)
$$S)(( <<##% sB BD# C $C
%C )C/ D#
C C,,C/ /1D D#c ` | j rd| _ | j yt d )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$ rG RuntimeErrorr s r r z Lock.release| s* << DL ! 67 7r c | j sy t t | j }|j s|j d yy# t $ r Y yw xY w)z*Wake up the first waiter if it isn't done.NT)r# nextiter
StopIterationdone
set_resultrH s r rG zLock._wake_up_first sT }} tDMM*+C xxz NN4
s A A A ) r r r __doc__r% r0 r( r r rG
__classcell__r5 s @r r r s( 3j * @8"
!r r c @ e Zd ZdZd Z fdZd Zd Zd Zd Z xZ
S )r a# 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.
c D t j | _ d| _ y r" )r@ rA r# _valuer s r r% zEvent.__init__ s #))+
r c t | }| j rdnd}| j r| dt | j }d|dd d| dS ) Nsetunsetr* r+ r r, r- r. )r/ r0 rW r# r1 r2 s r r0 zEvent.__repr__ sY g ' == gZDMM(:';= 0)
ValueErrorr# rW )r values r r% zSemaphore.__init__Y s# 19 CD D
r c t | }| j rdnd| j }| j r| dt | j }d|dd d| dS ) Nr( zunlocked, value:r* r+ r r, r- r. )r/ r0 r( rW r# r1 r2 s r r0 zSemaphore.__repr___ sg g KKM1A$++ /O == gZDMM(:'; K | ] }|j y wr r9 r; s r r> z#Semaphore.locked..i s A,?aAKKM!,?s r )rW anyr# r s r r( zSemaphore.lockedf s4 {{a C ADMM,?R,?A A Cr c K | j s| xj dz c_ y| j t j | _ | j j
}| j j | | d{ | j j | | j dkD r| j y7 @# | j j | w xY w# t j $ r7 |j s%| xj dz
c_ | j w xY ww)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.
r TNr )
r( rW r# r@ rA rB rC rD rE r
rF r:
_wake_up_nextrH s r r zSemaphore.acquirek s {{} KK1 K == ' - - /DMnn ,,.
S!
*
$$S) ;;?
$$S)(( ==? q ""$ sC BD> C CC C1 .!D>C C..C1 1A
D;;D>c N | xj dz
c_ | j y)zRelease 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.
r N)rW r~ r s r r zSemaphore.release s
q r c | j sy| j D ]: }|j r| xj dz c_ |j d y y)z)Wake up the first waiter that isn't done.Nr T)r# rP rW rQ rH s r r~ zSemaphore._wake_up_next s@ }} ==C88: q t$ !r rt ) r r r rR r% r0 r( r r r~ rS rT s @r r r J s( *C
"H r r c . e Zd ZdZd fd Z fdZ xZS )r zA bounded semaphore implementation.
This raises ValueError in release() if it would increase the value
above the initial value.
c 2 || _ t | | y r ) _bound_valuer/ r% )r rx r5 s r r% zBoundedSemaphore.__init__ s !
r c j | j | j k\ r t d t | y )Nz(BoundedSemaphore released too many times)rW r rw r/ r )r r5 s r r zBoundedSemaphore.release s+ ;;$++ + GH H
r rt )r r r rR r% r rS rT s @r r r s r r c e Zd ZdZdZdZdZy)
_BarrierStatefillingdraining resettingbrokenN)r r r FILLINGDRAINING RESETTINGBROKENr r r r r s GHI
Fr r c e Zd ZdZd Z fdZd Zd Zd Zd Z d Z
d Z d
Z d Z
d Zed
Zed Zed Z xZS )r a Asyncio equivalent to threading.Barrier
Implements a Barrier primitive.
Useful for synchronizing a fixed number of tasks at known synchronization
points. Tasks block on 'wait()' and are simultaneously awoken once they
have all made their call.
c |dk r t d t | _ || _ t j
| _ d| _ y)z1Create a barrier, initialised to 'parties' tasks.r zparties must be >= 1r N)rw r _cond_partiesr r _state_count)r partiess r r% zBarrier.__init__ s9 Q; 34 4 [
#++ r c t | }| j j }| j s |d| j
d| j z
}d|dd d| dS )Nr* /r+ r r, r- r. )r/ r0 r rx r n_waitingr r2 s r r0 zBarrier.__repr__ sd g ;;$$%{{ z$..!14<<.A AE3q9+Rwb))r c > K | j d { S 7 wr rj r s r r zBarrier.__aenter__ s YY[ s c K y wr r )r argss r r zBarrier.__aexit__ s s c 0 K | j 4 d{ | j d{ | j }| xj dz
c_ |dz | j k( r| j d{ n| j d{ || xj dz c_ | j
cddd d{ S 7 7 7 Y7 B7
# | xj dz c_ | j
w xY w# 1 d{ 7 sw Y yxY ww)zWait for the barrier.
When the specified number of tasks have started waiting, they are all
simultaneously awoken.
Returns an unique and individual index number from 0 to 'parties-1'.
Nr )r _blockr r _release_wait_exit)r indexs r rb z Barrier.wait s :::++-
q 19
- --/)) **,&& q
:: *& q
::s DC
DDCDAC7C8CCC%D; DCDDCCD'C>>DDD
DDc K j j fd d { j t j u rt j d y 7 6w)Nc \ j t j t j fvS r )r r r r r s r z Barrier._block.. s$ DKK &&
(?(?( r zBarrier aborted)r rm r r r r
BrokenBarrierErrorr s `r r zBarrier._block sZ jj!!
;;-.. . //0AB B /
s "A A 7A c j K t j | _ | j j y wr )r r r r rs r s r r zBarrier._release s%
$,,
s 13c K j j fd d { j t j t j
fv rt
j d y 7 Fw)Nc < j t j uS r )r r r r s r r z Barrier._wait.. s $++]=R=R*Rr zAbort or reset of barrier)r rm r r r r r
r r s `r r z
Barrier._wait s] jj!!"RSSS ;;=// 1H1HI I //0KL L J Ts "A.A,AA.c | j dk( r\| j t j t j fv rt j
| _ | j j y y )Nr )r r r r r r r rs r s r r z
Barrier._exit sO ;;! {{} 6 6
8N8N OO + 3 3 JJ ! ! # r c h K | j 4 d{ | j dkD r2| j t j ur+t j | _ nt j
| _ | j j
ddd d{ y7 7 # 1 d{ 7 sw Y yxY ww)zReset the barrier to the initial state.
Any tasks currently waiting will get the BrokenBarrier exception
raised.
Nr )r r r r r r rs r s r resetz
Barrier.reset" sk :::{{Q;;m&=&=="/"9"9DK + 3 3 JJ ! ! # ::::::sE B2BB2A1B B2BB2B2 B/#B& $B/+B2c K | j 4 d{ t j | _ | j j ddd d{ y7 D7 # 1 d{ 7 sw Y yxY ww)zPlace the barrier into a 'broken' state.
Useful in case of error. Any currently waiting tasks and tasks
attempting to 'wait()' will have BrokenBarrierError raised.
N)r r r r rs r s r abortz
Barrier.abort1 sA :::'..DK JJ ! ! # ::::::sD A1AA10A A1AA1A1 A."A% #A.*A1c | j S )z8Return the number of tasks required to trip the barrier.)r r s r r zBarrier.parties; s }} r c T | j t j u r | j S y)zr s ! * C! !7!7 C!L:&F " " :&zm($f&<&< m(`W$f&<&< Wty $DII M3f$$ M3r