Current File : /opt/alt/python34/lib64/python3.4/asyncio/__pycache__//locks.cpython-34.pyo
�
j f9 � @ s� d Z d d d d d g Z d d l Z d d l m Z d d
l m Z d d l m Z d d l m Z Gd
d � d � Z Gd d � d � Z
Gd d � d e
� Z Gd d � d � Z Gd d � d e
� Z
Gd d � d e
� Z Gd d � d e � Z d S)zSynchronization primitives.�Lock�Event� Condition� Semaphore�BoundedSemaphore� N� )�compat)�events)�futures)� coroutinec @ s: e Z d Z d Z d d � Z d d � Z d d � Z d S) �_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>
c C s
| | _ d S)N)�_lock)�self�lock� r �2/opt/alt/python34/lib64/python3.4/asyncio/locks.py�__init__ s z_ContextManager.__init__c C s d S)Nr )r r r r � __enter__ s z_ContextManager.__enter__c G s" z | j j � Wd d | _ Xd S)N)r
�release)r �argsr r r �__exit__$ s z_ContextManager.__exit__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
s
r c @ sv e Z d Z d d � Z d d � Z e d d � � Z e j rr d d � Z e d d
� � Z
e d d � � Z n d
S)�_ContextManagerMixinc C s t d � � d S)Nz9"yield from" should be used as context manager expression)� RuntimeError)r r r r r , s z _ContextManagerMixin.__enter__c G s d S)Nr )r r r r r r 0 s z _ContextManagerMixin.__exit__c c s | j � Dd Ht | � S)N)�acquirer )r r r r �__iter__5 s z _ContextManagerMixin.__iter__c c s | j � Dd Ht | � S)N)r r )r r r r � __await__H s z _ContextManagerMixin.__await__c c s | j � Dd Hd S)N)r )r r r r �
__aenter__M s z _ContextManagerMixin.__aenter__c C s | j � d S)N)r )r �exc_type�exc�tbr r r � __aexit__T s z _ContextManagerMixin.__aexit__N) r r r r r r r r ZPY35r r r$ r r r r r + s r c sd e Z d Z d Z d d d d � Z � f d d � Z d d � Z e d
d � � Z d d
� Z � 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 'yield from'.
Locks also support the context management protocol. '(yield from lock)'
should be used as 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
...
�loopNc C sC t j � | _ d | _ | d k r0 | | _ n t j � | _ d S)NF)� collections�deque�_waiters�_locked�_loopr �get_event_loop)r r% r r r r � s
z
Lock.__init__c se t � j � } | j r d n d } | j rK d j | t | j � � } n d j | d d � | � S)N�locked�unlockedz
{},waiters:{}z <{} [{}]>r ���)�super�__repr__r) r( �format�len)r �res�extra)� __class__r r r0 � s
z
Lock.__repr__c C s | j S)z Return True if lock is acquired.)r) )r r r r r, � s z Lock.lockedc c sx | j r! | j r! d | _ d St j d | j � } | j j | � z | Dd Hd | _ d SWd | j j | � Xd S)z�Acquire a lock.
This method blocks until the lock is unlocked, then sets it to
locked and returns True.
Tr% N)r( r) r
�Futurer* �append�remove)r �futr r r r � s z Lock.acquirec C sV | j rF d | _ x= | j D]# } | j � s | j d � Pq q Wn t d � � d S)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.
FTzLock is not acquired.N)r) r( �done�
set_resultr )r r9 r r r r � s
z Lock.release)
r r r r r r0 r, r r r r r )r5 r r Y s 4 c sp e Z d Z d Z d d d d � Z � f d d � Z d d � Z d
d � Z d d
� Z e d d � � Z
� 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.
r% Nc C sC t j � | _ d | _ | d k r0 | | _ n t j � | _ d S)NF)r& r' r( �_valuer* r r+ )r r% r r r r � s
zEvent.__init__c se t � j � } | j r d n d } | j rK d j | t | j � � } n d j | d d � | � S)N�setZunsetz
{},waiters:{}z <{} [{}]>r r. )r/ r0 r< r( r1 r2 )r r3 r4 )r5 r r r0 � s
zEvent.__repr__c C s | j S)z5Return True if and only if the internal flag is true.)r< )r r r r �is_set� s z Event.is_setc C sI | j sE d | _ x0 | j D]" } | j � s | j d � q q Wn d S)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)r< r( r: r; )r r9 r r r r= � s
z Event.setc C s
d | _ d S)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)r< )r r r r �clear� s z Event.clearc c s[ | j r
d St j d | j � } | j j | � z | Dd Hd SWd | j j | � Xd S)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.
Tr% N)r< r
r6 r* r( r7 r8 )r r9 r r r �wait� s z
Event.wait) r r r r r r0 r> r= r? r r@ r r )r5 r r � s c s| e Z d Z d Z d d d d d �Z � f d d � Z e d d � � Z e d
d � � Z d d
d � Z d d � Z
� 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.
Nr% c C s� | d k r | | _ n t j � | _ | d k rH t d | j � } n! | j | j k ri t d � � n | | _ | j | _ | j | _ | j | _ t j
� | _ d S)Nr% z"loop argument must agree with lock) r* r r+ r �
ValueErrorr
r, r r r& r' r( )r r r% r r r r s zCondition.__init__c sh t � j � } | j � r! d n d } | j rN d j | t | j � � } n d j | d d � | � S)Nr, r- z
{},waiters:{}z <{} [{}]>r r. )r/ r0 r, r( r1 r2 )r r3 r4 )r5 r r r0 + s
zCondition.__repr__c c s� | j � s t d � � n | j � zN t j d | j � } | j j | � z | Dd Hd SWd | j j | � XWd | j � Dd HXd S)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 lockr% NT)
r, r r r
r6 r* r( r7 r8 r )r r9 r r r r@ 2 s
zCondition.waitc c s2 | � } x" | s- | j � Dd H| � } q W| 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)r@ )r Z predicate�resultr r r �wait_forN s
zCondition.wait_forr c C so | j � s t d � � n d } xG | j D]< } | | k rA Pn | j � s+ | d 7} | j d � q+ q+ Wd S)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, r r( r: r; )r �n�idxr9 r r r �notify\ s
zCondition.notifyc C s | j t | 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)rF r2 r( )r r r r �
notify_allt s zCondition.notify_all) r r r r r r0 r r@ rC rF rG r r )r5 r r s c ss e Z d Z d Z d d d d d �Z � f d d � Z d d
� Z d d � Z e d
d � � Z d d � Z
� 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.
r r% Nc C s^ | d k r t d � � n | | _ t j � | _ | d k rK | | _ n t j � | _ d S)Nr z$Semaphore initial value must be >= 0)rA r< r& r' r( r* r r+ )r �valuer% r r r r � s zSemaphore.__init__c st t � j � } | j � r! d n d j | j � } | j rZ d j | t | j � � } n d j | d d � | � S)Nr, zunlocked,value:{}z
{},waiters:{}z <{} [{}]>r r. )r/ r0 r, r1 r< r( r2 )r r3 r4 )r5 r r r0 � s zSemaphore.__repr__c C s@ x9 | j r; | j j � } | j � s | j d � d Sq Wd S)N)r( �popleftr: r; )r Zwaiterr r r �
_wake_up_next� s
zSemaphore._wake_up_nextc C s
| j d k S)z:Returns True if semaphore can not be acquired immediately.r )r< )r r r r r, � s zSemaphore.lockedc c s� x� | j d k r� t j d | j � } | j j | � y
| Dd HWq | j � | j d k r} | j � r} | j � n � Yq Xq W| j d 8_ d S)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 r% Nr T) r< r
r6 r* r( r7 ZcancelZ cancelledrJ )r r9 r r r r � s
zSemaphore.acquirec C s | j d 7_ | j � d S)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.
r N)r< rJ )r r r r r � s zSemaphore.release) r r r r r r0 rJ r, r r r r r )r5 r r } s
c sC e Z d Z d Z d d d � f d d �Z � f d d � Z � S) r z�A bounded semaphore implementation.
This raises ValueError in release() if it would increase the value
above the initial value.
r r% Nc s# | | _ t � j | d | �d S)Nr% )� _bound_valuer/ r )r rH r% )r5 r r r � s zBoundedSemaphore.__init__c s2 | j | j k r! t d � � n t � j � d S)Nz(BoundedSemaphore released too many times)r< rK rA r/ r )r )r5 r r r � s zBoundedSemaphore.release)r r r r r r r r )r5 r r � s )r �__all__r& � r r r
Z
coroutinesr r r r r r r r r r r r �<module> s .sBoM