U lu fC@sddlZddlZddlZddlmZmZddlmZmZddl m Z m Z m Z m Z mZddl Z e jrrddl mZmZdddd d gZGd d d eZGd ddeZGdddeZGdddeZGdddeZGdd d eZGdd d eZdS)N)genioloop)Future"future_set_result_unless_cancelled)UnionOptionalTypeAny Awaitable)DequeSet ConditionEvent SemaphoreBoundedSemaphoreLockc@s,eZdZdZddddZddddZdS)_TimeoutGarbageCollectorzBase class for objects that periodically clean up timed-out waiters. Avoids memory leak in a common pattern like: while True: yield condition.wait(short_timeout) print('looping....') NreturncCst|_d|_dS)Nr) collectionsdeque_waiters _timeoutsselfr1/tmp/pip-unpacked-wheel-bmg6zs32/tornado/locks.py__init__)s z!_TimeoutGarbageCollector.__init__cCs:|jd7_|jdkr6d|_tdd|jD|_dS)Ndrcss|]}|s|VqdSN)done).0wrrr 2sz<_TimeoutGarbageCollector._garbage_collect..)rrrrrrrr_garbage_collect-s z)_TimeoutGarbageCollector._garbage_collect)__name__ __module__ __qualname____doc__rr%rrrrrs rc@sbeZdZdZedddZdeeee j fe e dddZ dedd d d Zddd dZdS)r aA condition allows one or more coroutines to wait until notified. Like a standard `threading.Condition`, but does not need an underlying lock that is acquired and released. With a `Condition`, coroutines can wait to be notified by other coroutines: .. testcode:: import asyncio from tornado import gen from tornado.locks import Condition condition = Condition() async def waiter(): print("I'll wait right here") await condition.wait() print("I'm done waiting") async def notifier(): print("About to notify") condition.notify() print("Done notifying") async def runner(): # Wait for waiter() and notifier() in parallel await gen.multi([waiter(), notifier()]) asyncio.run(runner()) .. testoutput:: I'll wait right here About to notify Done notifying I'm done waiting `wait` takes an optional ``timeout`` argument, which is either an absolute timestamp:: io_loop = IOLoop.current() # Wait up to 1 second for a notification. await condition.wait(timeout=io_loop.time() + 1) ...or a `datetime.timedelta` for a timeout relative to the current time:: # Wait up to 1 second. await condition.wait(timeout=datetime.timedelta(seconds=1)) The method returns False if there's no notification before the deadline. .. versionchanged:: 5.0 Previously, waiters could be notified synchronously from within `notify`. Now, the notification will always be received on the next iteration of the `.IOLoop`. rcCs.d|jjf}|jr&|dt|j7}|dS)Nz<%sz waiters[%s]>) __class__r&rlen)rresultrrr__repr__qszCondition.__repr__NtimeoutrcsXtj|rTddfdd }tj||fddS)zWait for `.notify`. Returns a `.Future` that resolves ``True`` if the condition is notified, or ``False`` after a timeout. NrcsstddSNF)r!rr%rrwaiterrr on_timeouts z"Condition.wait..on_timeoutcs Sr Zremove_timeout_io_looptimeout_handlerrz Condition.wait..)rrappendrIOLoopcurrent add_timeoutadd_done_callbackrr0r4rr9rr:r3rwaitws   zCondition.waitr)nrcCsLg}|r4|jr4|j}|s|d8}||q|D]}t|dq8dS)zWake ``n`` waiters.rTN)rpopleftr!r=r)rrEwaitersr3rrrnotifys   zCondition.notifycCs|t|jdS)zWake all waiters.N)rHr,rrrrr notify_allszCondition.notify_all)N)r)r&r'r(r)strr.rrfloatdatetime timedeltar boolrDintrHrIrrrrr 5s;  c@szeZdZdZddddZedddZeddd Zddd d Z ddd d Z de e e ejfeddddZdS)raAn event blocks coroutines until its internal flag is set to True. Similar to `threading.Event`. A coroutine can wait for an event to be set. Once it is set, calls to ``yield event.wait()`` will not block unless the event has been cleared: .. testcode:: import asyncio from tornado import gen from tornado.locks import Event event = Event() async def waiter(): print("Waiting for event") await event.wait() print("Not waiting this time") await event.wait() print("Done") async def setter(): print("About to set the event") event.set() async def runner(): await gen.multi([waiter(), setter()]) asyncio.run(runner()) .. testoutput:: Waiting for event About to set the event Not waiting this time Done NrcCsd|_t|_dSr1)_valuesetrrrrrrszEvent.__init__cCsd|jj|rdndfS)Nz<%s %s>rQclear)r+r&is_setrrrrr.szEvent.__repr__cCs|jS)z-Return ``True`` if the internal flag is true.rPrrrrrSsz Event.is_setcCs.|js*d|_|jD]}|s|dqdS)zSet the internal flag to ``True``. All waiters are awakened. Calling `.wait` once the flag is set will not block. TN)rPrr! set_result)rfutrrrrQs  z Event.setcCs d|_dS)zkReset the internal flag to ``False``. Calls to `.wait` will block until `.set` is called. FNrTrrrrrRsz Event.clearr/csjtjrdSjfdd|dkrDSt|}|fdd|SdS)zBlock until the internal flag is true. Returns an awaitable, which raises `tornado.util.TimeoutError` after a timeout. Ncs j|Sr )rremoverVrrrr;r<zEvent.wait..cssSdSr )r!cancel)tfrXrrr;r<)rrPrUraddrArZ with_timeout)rr0Z timeout_futr)rVrrrDs    z Event.wait)N)r&r'r(r)rrJr.rNrSrQrRrrrKrLrMr rDrrrrrs' c@sLeZdZdZeddddZddddZd eeee j dd d d Z dS) _ReleasingContextManagerzReleases a Lock or Semaphore at the end of a "with" statement. with (yield semaphore.acquire()): pass # Now semaphore.release() has been called. N)objrcCs ||_dSr )_obj)rr]rrrr sz!_ReleasingContextManager.__init__rcCsdSr rrrrr __enter__sz"_ReleasingContextManager.__enter__Optional[Type[BaseException]])exc_typeexc_valexc_tbrcCs|jdSr )r^release)rrarbrcrrr__exit__sz!_ReleasingContextManager.__exit__) r&r'r(r)r rr_r BaseExceptiontypes TracebackTypererrrrr\sr\cseZdZdZdeddfdd Zedfdd Zddd d Zde e e e j feed d dZddddZde ee ejddddZddddZde ee ejddddZZS)ra A lock that can be acquired a fixed number of times before blocking. A Semaphore manages 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. Semaphores limit access to a shared resource. To allow access for two workers at a time: .. testsetup:: semaphore from collections import deque from tornado import gen from tornado.ioloop import IOLoop from tornado.concurrent import Future inited = False async def simulator(futures): for f in futures: # simulate the asynchronous passage of time await gen.sleep(0) await gen.sleep(0) f.set_result(None) def use_some_resource(): global inited global futures_q if not inited: inited = True # Ensure reliable doctest output: resolve Futures one at a time. futures_q = deque([Future() for _ in range(3)]) IOLoop.current().add_callback(simulator, list(futures_q)) return futures_q.popleft() .. testcode:: semaphore import asyncio from tornado import gen from tornado.locks import Semaphore sem = Semaphore(2) async def worker(worker_id): await sem.acquire() try: print("Worker %d is working" % worker_id) await use_some_resource() finally: print("Worker %d is done" % worker_id) sem.release() async def runner(): # Join all workers. await gen.multi([worker(i) for i in range(3)]) asyncio.run(runner()) .. testoutput:: semaphore Worker 0 is working Worker 1 is working Worker 0 is done Worker 2 is working Worker 1 is done Worker 2 is done Workers 0 and 1 are allowed to run concurrently, but worker 2 waits until the semaphore has been released once, by worker 0. The semaphore can be used as an async context manager:: async def worker(worker_id): async with sem: print("Worker %d is working" % worker_id) await use_some_resource() # Now the semaphore has been released. print("Worker %d is done" % worker_id) For compatibility with older versions of Python, `.acquire` is a context manager, so ``worker`` could also be written as:: @gen.coroutine def worker(worker_id): with (yield sem.acquire()): print("Worker %d is working" % worker_id) yield use_some_resource() # Now the semaphore has been released. print("Worker %d is done" % worker_id) .. versionchanged:: 4.3 Added ``async with`` support in Python 3.5. rNvaluercs$t|dkrtd||_dS)Nrz$semaphore initial value must be >= 0)superr ValueErrorrPrrjr+rrrs zSemaphore.__init__rcsPt}|jdkrdn d|j}|jrr)rkr.rPformatrr,)rresextrarnrrr.s  zSemaphore.__repr__cCsJ|jd7_|jrF|j}|s|jd8_|t|qFqdS)*Increment the counter and wake one waiter.rN)rPrrFr!rUr\r2rrrrds zSemaphore.releaser/cstjdkr.jd8_tnNj|r|ddfdd }tj || fddS) zDecrement the counter. Returns an awaitable. Block if the counter is zero and wait for a `.release`. The awaitable raises `.TimeoutError` after the deadline. rrNrcs"stdSr )r!Z set_exceptionr TimeoutErrorr%rr2rrr4sz%Semaphore.acquire..on_timeoutcs Sr r5r6r8rrr;r<z#Semaphore.acquire..) rrPrUr\rr=rr>r?r@rArBrrCracquires     zSemaphore.acquirecCs tddS)Nz0Use 'async with' instead of 'with' for Semaphore RuntimeErrorrrrrr_szSemaphore.__enter__r`)typrj tracebackrcCs |dSr r_)rryrjrzrrrreszSemaphore.__exit__cs|IdHdSr rvrrrr __aenter__szSemaphore.__aenter__ryrjtbrcs |dSr rdrryrjrrrr __aexit__szSemaphore.__aexit__)r)N)r&r'r(r)rOrrJr.rdrrrKrLrMr r\rvr_rfrgrhrer}r __classcell__rrrnrrs*d   cs<eZdZdZd eddfdd Zddfdd ZZS) ra:A semaphore that prevents release() being called too many times. If `.release` would increment the semaphore's value past the initial value, it raises `ValueError`. Semaphores are mostly used to guard resources with limited capacity, so a semaphore released too many times is a sign of a bug. rNricstj|d||_dS)Nrj)rkr_initial_valuermrnrrrszBoundedSemaphore.__init__rcs"|j|jkrtdtdS)rtz!Semaphore released too many timesN)rPrrlrkrdrrnrrrds zBoundedSemaphore.release)r)r&r'r(r)rOrrdrrrrnrrsc@seZdZdZddddZedddZdeee e j fe e dd d Zddd d Zddd dZdeeeejddddZddddZdeeeejddddZdS)raA lock for coroutines. A Lock begins unlocked, and `acquire` locks it immediately. While it is locked, a coroutine that yields `acquire` waits until another coroutine calls `release`. Releasing an unlocked lock raises `RuntimeError`. A Lock can be used as an async context manager with the ``async with`` statement: >>> from tornado import locks >>> lock = locks.Lock() >>> >>> async def f(): ... async with lock: ... # Do something holding the lock. ... pass ... ... # Now the lock is released. For compatibility with older versions of Python, the `.acquire` method asynchronously returns a regular context manager: >>> async def f2(): ... with (yield lock.acquire()): ... # Do something holding the lock. ... pass ... ... # Now the lock is released. .. versionchanged:: 4.3 Added ``async with`` support in Python 3.5. NrcCstdd|_dS)Nrr)r_blockrrrrr sz Lock.__init__cCsd|jj|jfS)Nz<%s _block=%s>)r+r&rrrrrr.sz Lock.__repr__r/cCs |j|S)zAttempt to lock. Returns an awaitable. Returns an awaitable, which raises `tornado.util.TimeoutError` after a timeout. )rrv)rr0rrrrvsz Lock.acquirecCs0z|jWntk r*tdYnXdS)zUnlock. The first coroutine in line waiting for `acquire` gets the lock. If not locked, raise a `RuntimeError`. zrelease unlocked lockN)rrdrlrxrrrrrdsz Lock.releasecCs tddS)Nz+Use `async with` instead of `with` for Lockrwrrrrr_(szLock.__enter__r`r~cCs |dSr r{rrrrre+sz Lock.__exit__cs|IdHdSr r|rrrrr}3szLock.__aenter__cs |dSr rrrrrr6szLock.__aexit__)N)r&r'r(r)rrJr.rrrKrLrMr r\rvrdr_rfrgrhrer}rrrrrrs*$   )rrLrgZtornadorrZtornado.concurrentrrtypingrrrr r TYPE_CHECKINGr r __all__objectrr rr\rrrrrrrs"id: