⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.144
Server IP:
157.245.143.252
Server:
Linux www 6.11.0-9-generic #9-Ubuntu SMP PREEMPT_DYNAMIC Mon Oct 14 13:19:59 UTC 2024 x86_64
Server Software:
nginx/1.26.0
PHP Version:
8.3.11
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
lib
/
python3.12
/
asyncio
/
__pycache__
/
View File Name :
locks.cpython-312.pyc
CRh2J ` 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/lib/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:<r []>)super__repr__r$ r# lenr resextra __class__s r r0 z Lock.__repr__Q sY g LLj == gZDMM(:';<E3q9+Rwb))r c | j S )z Return True if lock is acquired.)r$ r s r r( z Lock.lockedX s ||r c J K | j s0| j t d | j D rd| _ y| j t j | _ | j j }| j j | | d{ | j j | d| _ y7 (# | j j | w xY w# t j $ r | j s| j w xY ww)zAcquire a lock. This method blocks until the lock is unlocked, then sets it to locked and returns True. Nc 3 < K | ] }|j y wr cancelled.0ws r <genexpr>z Lock.acquire.<locals>.<genexpr>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(:';<E3q9+Rwb))r c | j S )z5Return True if and only if the internal flag is true.rW r s r is_setz Event.is_set s {{r c | j s;d| _ | j D ]$ }|j r|j d & yy)zSet 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)rW r# rP rQ rH s r rY z Event.set s: {{ DK}}xxzNN4( % r c d| _ y)zReset the internal flag to false. Subsequently, coroutines calling wait() will block until set() is called to set the internal flag to true again.FNr\ r s r clearz Event.clear s r c * K | j ry| j j }| j j | | d{ | j j | y7 !# | j j | w xY ww)zBlock 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)rW rB rC r# rD rE rH s r waitz Event.wait st ;;nn ,,. S! &II MM % MM %s0 AB A3 A1A3 B1A3 3 BB) r r r rR r% r0 r] rY r` rb rS rT s @r r r s& * ) &r r c D e Zd ZdZddZ fdZd Zd Zd dZd Z xZ S ) r a 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. c | t }|| _ |j | _ |j | _ |j | _ t j | _ y r )r _lockr( r r r@ rA r# )r locks r r% zCondition.__init__ sF <6D kk || || #))+ r c t | }| j rdnd}| j r| dt | j }d|dd d| dS r' )r/ r0 r( r# r1 r2 s r r0 zCondition.__repr__ s[ g KKMz == gZDMM(:';<E3q9+Rwb))r c K | j s t d | j | j j }| j j | | d{ | j j | d} | j d{ |rt j y7 P7 # t j $ r d}Y nw xY wM# | j j | w xY w# d} | j d{ 7 n # t j $ r d}Y nw xY w7|rt j w xY ww)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. z cannot wait on un-acquired lockNFT) r( rK r rB rC r# rD rE r r rF )r rI r: s r rb zCondition.wait s@ {{} @A A 0.."002C MM % * $$S) I% ,,.(( /// )!00 % $I% $$S) I% ,,.((!00 % $I% /// s ,E9C? )C .B?/C 4C? EC &C'C +E?C C CECE C<<C? ?E D DD E D63E 5D66E Ec h K | }|s"| j d{ | }|s"|S 7 w)zWait 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. Nrb )r predicateresults r wait_forzCondition.wait_for s9 ))+ [F s 20 22c | j s t d d}| j D ]0 }||k\ r y|j r|dz }|j d 2 y)a By 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 lockr r FN)r( rK r# rP rQ )r nidxrI s r notifyzCondition.notify) sT {{} BC C==Cax88:qu% !r c L | j t | j y)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)rq r1 r# r s r notify_allzCondition.notify_allA s C &'r r r ) r r r rR r% r0 rb rm rq rs rS rT s @r r r s' ,*#0J &0(r r c B e Zd ZdZddZ fdZd Zd Zd Zd Z xZ S ) r a A 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. c @ |dk r t d d | _ || _ y )Nr z$Semaphore initial value must be >= 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(:';<E3q9+Rwb))r c d | j dk( xs t d | j xs dD S )z9Returns True if semaphore cannot be acquired immediately.r c 3 > K | ] }|j y wr r9 r; s r r> z#Semaphore.locked.<locals>.<genexpr>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 > 0r N)rw r _cond_partiesr r _state_count)r partiess r r% zBarrier.__init__ s9 Q; 23 3 [ #++ 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 <lambda>z Barrier._block.<locals>.<lambda> 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.<locals>.<lambda> 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)z<Return the number of tasks currently waiting at the barrier.r )r r r r r s r r zBarrier.n_waiting@ s# ;;-// /;; r c : | j t j u S )z0Return True if the barrier is in a broken state.)r r r r s r r zBarrier.brokenG s {{m 2 222r )r r r rR r% r0 r r rb r r r r r r propertyr r r rS rT s @r r r s} *! .C M$ $ $ 3 3r r )rR __all__r@ enum r r r _LoopBoundMixinr r r r r Enumr r r r r <module>r s ! * C! !7!7 C!L:&F " " :&zm($f&<&< m(`W$f&<&< Wty $DII M3f$$ M3r