File manager - Edit - /usr/lib/python3/dist-packages/twisted/internet/__pycache__/defer.cpython-310.pyc
Back
o 5�@g�N � @ sd U d Z ddlZddlZddlmZmZ ddlmZmZm Z ddl m Z ddl m Z ddlmZmZ ddlmZmZ dd lmZmZmZmZmZmZmZm Z m Z m Z m Z m Z m!Z!m"Z"m#Z#m$Z$m%Z%m&Z&m'Z' ddl(Z(dd l)m*Z* dd l+m,Z,m-Z- dd l.m/Z/ dd l0m1Z1 ddl2m3Z3m4Z4m5Z5 ddl6m7Z7m8Z8 ddl9m:Z:m;Z; z ddl<m=Z> dZ?W n e@y� dZ?G dd� d�ZAde#eA fdd�ZBY nw e>ZBe/� ZCe$d�ZDG dd� deE�ZFG d d � d eE�ZGG d d � d eE�ZHG d d!� d!eI�ZJd"e:de:fd#d$�ZKd%eDdd&fd'd(�ZLd�d%e!e%e:eMf dd)fd*d+�ZNd,ed-eDf d.eOd/eOdd&fd0d1�ZPd2ed-eDf d.eOd/eOdd&fd3d4�ZQe7e*d5d6d7d�d8d9�d�d<d=��ZRd>eDdeDfd?d@�ZSd>e:de:fdAdB�ZTdCeUddfdDdE�ZVdeUfdFdG�ZWdHeDd=eXdeDfdIdJ�ZYG dKdL� dLe �ZZeZj[Z[eZj\Z\ed-eOf Z]ed-eOf Z^e"eOd-f Z_e e`eOf Zae"e"e%e]e eZj\ f e_eaf e"e%e^e]e eZj\ f e_eaf f Zbei �ZceaeddM< e$dNddO�Zee$dPddQ�ZfG dRdS� dS�ZgG dTdU� dUeee �ZhdVe%eeheD eeDf eeheD eeDf eheD f deheD fdWdX�Zie5G dYdZ� dZeE��Zje"eeekf Zle"eUeef Zme em Zne�rle' d�d[e ehee d\e d d]eUd^eUdehel f d_d`��Zoe' d�d[e ehee d\e d d]eUd^eUdehen f dad`��Zo d�d[e ehee d\eUd]eUd^eUde%ehel ehen f f dbd`�ZoeoZpG dcdd� ddehen �Zp d�dee em d]eUde eD fdfdg�Zq d�d[e eheD d^eUdehe eD fdhdi�ZrdZsdZtG djdk� dk�ZueeOddf Zvdlevd:eheO dehe fdmdn�Zwe7e*d5dodd�dp�d2ed-evf ded-eheO f fdqdr��ZxG dsdt� dteM�ZydueOde fdvdw�Zze(j{ddx�G dydz� dz��Z|e;d%eOd{e%eeheD eOdf eeheD eOdf f d|e|ddfd}d~��Z}d{e%ed&eOeDf ed&eOeDf f deheD fdd��Z~G d�d�� d�eE�Zd2ed-eeheO eOeDf f ded-eheD f fd�d��Z�e$d�d�d��Z�G d�d�� d�eeee �Z�e$d�d�d��Z�G d�d�� d�e��Z�e$d�d�d��Z�G d�d�� d�e��Z�G d�d�� d�eE�Z�G d�d�� d�eE�Z�G d�d�� d�eeD �Z�G d�d�� d�eE�Z�G d�d�� d�e1j��Z�g d��Z�dS )�zU Support for results that aren't immediately available. Maintainer: Glyph Lefkowitz � N)�ABC�abstractmethod)�AbstractEventLoop�Future� iscoroutine)�Enum)�wraps)�exc_info� version_info)� GeneratorType�MappingProxyType)� TYPE_CHECKING�Any� Awaitable�Callable� Coroutine� Generator�Generic�Iterable�List�Literal�Mapping�NoReturn�Optional�Tuple�Type�TypeVar�Union�cast�overload)�Version)� IDelayedCall� IReactorTime)�Logger)�lockfile)�_PYPY�cmp� comparable)� deprecated�warnAboutFunction)�Failure� _extraneous)� copy_contextTFc @ s2 e Zd Zededef dededefdd��ZdS ) � _NoContext�f.�args�kwargs�returnc O s | |i |��S �N� )r. r/ r0 r3 r3 �8/usr/lib/python3/dist-packages/twisted/internet/defer.py�run< s z_NoContext.runN)�__name__� __module__� __qualname__� staticmethodr �objectr5 r3 r3 r3 r4 r- ; s (r- r1 c C s t S r2 )r- r3 r3 r3 r4 � _copy_context@ � r; �_Tc @ � e Zd ZdZdS )�AlreadyCalledErrorz� This error is raised when one of L{Deferred.callback} or L{Deferred.errback} is called after one of the two had already been called. N�r6 r7 r8 �__doc__r3 r3 r3 r4 r? M � r? c @ r> )�CancelledErrorzJ This error is raised by default when a L{Deferred} is cancelled. Nr@ r3 r3 r3 r4 rC T rB rC c @ r> )� TimeoutErrorzG This error is raised by default when a L{Deferred} times out. Nr@ r3 r3 r3 r4 rD Z rB rD c @ r> )�NotACoroutineErrorzb This error is raised when a coroutine is expected and something else is encountered. Nr@ r3 r3 r3 r4 rE ` rB rE �errc C s t �d| � | S )a- Log and return failure. This method can be used as an errback that passes the failure on to the next errback unmodified. Note that if this is the last errback, and the deferred gets garbage collected after being this errback has been called, the clean up code logs it again. � )�log�failure)rF r3 r3 r4 �logErrorg s rJ �result� Deferred[_T]c C � t � }|�| � |S )a Return a L{Deferred} that has already had C{.callback(result)} called. This is useful when you're writing synchronous code to an asynchronous interface: i.e., some code is calling you expecting a L{Deferred} result, but you don't actually need to do anything asynchronous. Just return C{defer.succeed(theResult)}. See L{fail} for a version of this function that uses a failing L{Deferred} rather than a successful one. @param result: The result to give to the Deferred's 'callback' method. )�Deferred�callback�rK �dr3 r3 r4 �succeedt s rR � Deferred[Any]c C rM )a2 Return a L{Deferred} that has already had C{.errback(result)} called. See L{succeed}'s docstring for rationale. @param result: The same argument that L{Deferred.errback} takes. @raise NoCurrentExceptionError: If C{result} is L{None} but there is no current exception state. )rN �errbackrP r3 r3 r4 �fail� s rU �callable.r/ r0 c O s2 z | |i |��}W t|�S t y t� Y S w )a Create a L{Deferred} from a callable and arguments. Call the given function with the given arguments. Return a L{Deferred} which has been fired with its callback as the result of that invocation or its C{errback} with a L{Failure} for the exception thrown. )� BaseExceptionrU rR )rV r/ r0 rK r3 r3 r4 �execute� s � �rX r. c O s^ z | |i |��}W n t y tttjd�� Y S w t|t�r"|S t|t�r+t|�S t|�S )a� Invoke a function that may or may not return a L{Deferred}. Call the given function with the given arguments. If the returned object is a L{Deferred}, return it. If the returned object is a L{Failure}, wrap it with L{fail} and return it. Otherwise, wrap it in L{succeed} and return it. If an exception is raised, convert it to a L{Failure}, wrap it in L{fail}, and then return it. @param f: The callable to invoke @param args: The arguments to pass to C{f} @param kwargs: The keyword arguments to pass to C{f} @return: The result of the function call, wrapped in a L{Deferred} if necessary. �� captureVars)rW rU r* rN �debug� isinstancerR )r. r/ r0 rK r3 r3 r4 � maybeDeferred� s � r] �Twisted� � z*twisted.internet.defer.Deferred.addTimeout)� replacement�deferred�Deferred[object]c C s | � ttd��� d S )NzCallback timed out)rT r* rD �rb r3 r3 r4 �timeout� s re �argc C � | S r2 r3 �rf r3 r3 r4 �passthru� r< ri c C rg r2 r3 rh r3 r3 r4 � _failthru� r< rj �onc C s t | �t_dS )z� Enable or disable L{Deferred} debugging. When debugging is on, the call stacks from creation and invocation are recorded, and added to any L{AlreadyCalledError}s we raise. N)�boolrN r[ )rk r3 r3 r4 � setDebugging� s rm c C s t jS )z= Determine whether L{Deferred} debugging is enabled. )rN r[ r3 r3 r3 r4 � getDebugging� s rn �valuec C s" t | t�r| �t� t|d��| S )a� A default translation function that translates L{Failure}s that are L{CancelledError}s to L{TimeoutError}s. @param value: Anything @param timeout: The timeout @raise TimeoutError: If C{value} is a L{Failure} that is a L{CancelledError}. @raise Exception: If C{value} is a L{Failure} that is not a L{CancelledError}, it is re-raised. @since: 16.5 rN )r\ r* �traprC rD )ro re r3 r3 r4 �_cancelledToTimedOutError� s rq c @ s e Zd ZdZe� Ze� ZdS )� _Sentinela� @cvar _NO_RESULT: The result used to represent the fact that there is no result. B{Never ever ever use this as an actual result for a Deferred}. You have been warned. @cvar _CONTINUE: A marker left in L{Deferred.callback}s to indicate a Deferred chain. Always accompanied by a Deferred instance in the args tuple pointing at the Deferred which is chained to the Deferred which has this marker. N)r6 r7 r8 rA r: � _NO_RESULT� _CONTINUEr3 r3 r3 r4 rr � s rr � _NONE_KWARGS�_DeferredResultT)� contravariant�_NextDeferredResultT)� covariantc @ sb e Zd ZU dZdZee ed< dZee e ed< dZ ee e ed< de fdd�Z d d d �Z dS ) � DebugInfoz Deferred debug helper. N� failResult�creator�invokerr1 c C st d}| j d ur |d7 }|d�| j ��� �dd�7 }|d7 }| jd ur8|d7 }|d�| j��� �dd�7 }|d7 }|S )NrG z C: Deferred was created: C:� z C:z I: First Invoker was: I:z I:)r| �join�rstrip�replacer} )�self�infor3 r3 r4 �_getDebugTracebacks: s z DebugInfo._getDebugTracebacksc C sH | j dur"tjddd� | �� }|rd}nd}tj|| j |d� dS dS )z� Print tracebacks and die. If the *last* (and I do mean *last*) callback leaves me in an error state, print a traceback (if said errback is a L{Failure}). Nz Unhandled error in Deferred:T)�isErrorz(debug: {debugInfo})rG )� debugInfo)r{ rH �criticalr� rI )r� r� �formatr3 r3 r4 �__del__F s �zDebugInfo.__del__�r1 N)r6 r7 r8 rA r{ r r* �__annotations__r| r �strr} r� r� r3 r3 r3 r4 rz 1 s rz c @ s^ e Zd ZU dZdZdZdZee e d< dZ dZ dZ dZ de d< dRdeed gdf d dfd d �Zed ed efded ded dedededed dfdd�Zded deded dfdd �Zded deded d fd d �Zded deded dfd d!�Z dRd"ed#ed$eeeegef d d%fd&d'�ZdSd*d+�Z d,e e e f d dfd-d.�Z dRd/ee e e!f d dfd0d1�Z"dTd2d3�Z#dTd4d5�Z$dTd6d7�Z%d,ed dfd8d9�Z&d e'fd:d;�Z(dTd<d=�Z)d e*fd>d?�Z+e+Z,dUd@dA�Z-e.dRdBed d%fdCdD��Z/d e0e1de f fdEdF�Z2e/Z3dGe4d dHfdIdJ�Z5e6dKe7d d fdLdM��Z8e6dNe e9dOe1e:f e0dOe1e:f f d dOfdPdQ��Z;dS )VrN a This is a callback which will be put off until later. Why do we want this? Well, in cases where a function in a threaded program would block until it gets a result, for Twisted it should not block. Instead, it should return a L{Deferred}. This can be implemented for protocols that run over the network by writing an asynchronous protocol for L{twisted.internet}. For methods that come from outside packages that are not under our control, we use threads (see for example L{twisted.enterprise.adbapi}). For more information about Deferreds, see doc/core/howto/defer.html or U{http://twistedmatrix.com/documents/current/core/howto/defer.html} When creating a Deferred, you may provide a canceller function, which will be called by d.cancel() to let you do any clean-up necessary if the user decides not to wait for the deferred to complete. @ivar called: A flag which is C{False} until either C{callback} or C{errback} is called and afterwards always C{True}. @ivar paused: A counter of how many unmatched C{pause} calls have been made on this instance. @ivar _suppressAlreadyCalled: A flag used by the cancellation mechanism which is C{True} if the Deferred has no canceller and has been cancelled, C{False} otherwise. If C{True}, it can be expected that C{callback} or C{errback} will eventually be called and the result should be silently discarded. @ivar _runningCallbacks: A flag which is C{True} while this instance is executing its callback chain, used to stop recursive execution of L{_runCallbacks} @ivar _chainedTo: If this L{Deferred} is waiting for the result of another L{Deferred}, this is a reference to the other Deferred. Otherwise, L{None}. Fr N� _debugInfozOptional[Deferred[Any]]� _chainedTo� cancellerrS r1 c C s6 g | _ || _| jrt� | _t�� dd� | j_dS dS )aH Initialize a L{Deferred}. @param canceller: a callable used to stop the pending operation scheduled by this L{Deferred} when L{Deferred.cancel} is invoked. The canceller will be passed the deferred whose cancellation is requested (i.e., C{self}). If a canceller is not given, or does not invoke its argument's C{callback} or C{errback} method, L{Deferred.cancel} will invoke L{Deferred.errback} with a L{CancelledError}. Note that if a canceller is not given, C{callback} or C{errback} may still be invoked exactly once, even though defer.py will have already invoked C{errback}, as described above. This allows clients of code which returns a L{Deferred} to cancel it without requiring the L{Deferred} instantiator to provide any specific implementation support for cancellation. New in 10.1. @type canceller: a 1-argument callable which takes a L{Deferred}. The return result is ignored. N���)� callbacks� _cancellerr[ rz r� � traceback� format_stackr| �r� r� r3 r3 r4 �__init__� s �zDeferred.__init__r3 rO ).z;Union[_NextDeferredResultT, Deferred[_NextDeferredResultT]]rT ).zDUnion[Failure, _NextDeferredResultT, Deferred[_NextDeferredResultT]]� callbackArgs�callbackKeywords� errbackArgs�errbackKeywordsz Deferred[_NextDeferredResultT]c C s� |du rt }|du r d}|du ri }|du rd}|du r i }t|�s$J �t|�s*J �| j�|||f|||ff� | jr?| �� ttt | �S )z� Add a pair of callbacks (success and error) to this L{Deferred}. These will be executed when the 'master' callback is run. @return: C{self}. Nr3 ) rj rV r� �append�called� _runCallbacksr rN rx )r� rO rT r� r� r� r� r3 r3 r4 � addCallbacks� s( ��zDeferred.addCallbacksr/ r0 c O s | j |||d�S )z^ Convenience method for adding just a callback. See L{addCallbacks}. )r� r� �r� �r� rO r/ r0 r3 r3 r4 � addCallback� � zDeferred.addCallbackz7Deferred[Union[_DeferredResultT, _NextDeferredResultT]]c O s | j t|||d�S )z^ Convenience method for adding just an errback. See L{addCallbacks}. )r� r� )r� ri )r� rT r/ r0 r3 r3 r4 � addErrback� s �zDeferred.addErrbackc O s | j ||||||d�S )z� Convenience method for adding a single callable as both a callback and an errback. See L{addCallbacks}. )r� r� r� r� r� r� r3 r3 r4 �addBoth s �zDeferred.addBothre �clock�onTimeoutCancel�Deferred[_DeferredResultT]c sz dg�d ��fdd� }|� �|�� dtdtf���fdd� }��|� d tttf dtttf f� fd d � }��|� �S ) a� Time out this L{Deferred} by scheduling it to be cancelled after C{timeout} seconds. The timeout encompasses all the callbacks and errbacks added to this L{defer.Deferred} before the call to L{addTimeout}, and none added after the call. If this L{Deferred} gets timed out, it errbacks with a L{TimeoutError}, unless a cancelable function was passed to its initialization or unless a different C{onTimeoutCancel} callable is provided. @param timeout: number of seconds to wait before timing out this L{Deferred} @param clock: The object which will be used to schedule the timeout. @param onTimeoutCancel: A callable which is called immediately after this L{Deferred} times out, and not if this L{Deferred} is otherwise cancelled before the timeout. It takes an arbitrary value, which is the value of this L{Deferred} at that exact point in time (probably a L{CancelledError} L{Failure}), and the C{timeout}. The default callable (if C{None} is provided) will translate a L{CancelledError} L{Failure} into a L{TimeoutError}. @return: C{self}. @since: 16.5 Fr1 Nc s d�d< � � � d S )NTr )�cancelr3 )r� �timedOutr3 r4 � timeItOutG s z&Deferred.addTimeout.<locals>.timeItOutro c s �d r � pt }|| ��S | S )Nr )rq )ro �toCall)r� r� re r3 r4 �convertCancelledM s z-Deferred.addTimeout.<locals>.convertCancelledrK c s � � � r� �� | S r2 )�activer� �rK )� delayedCallr3 r4 � cancelTimeoutW s z*Deferred.addTimeout.<locals>.cancelTimeoutr� )� callLaterr: r� r rv r* )r� re r� r� r� r� r� r3 )r� r� r� r� re r4 � addTimeout# s " � � zDeferred.addTimeoutrQ �Deferred[None]c C s | |_ | �|j|j�S )a� Chain another L{Deferred} to this L{Deferred}. This method adds callbacks to this L{Deferred} to call C{d}'s callback or errback, as appropriate. It is merely a shorthand way of performing the following:: d1.addCallbacks(d2.callback, d2.errback) When you chain a deferred C{d2} to another deferred C{d1} with C{d1.chainDeferred(d2)}, you are making C{d2} participate in the callback chain of C{d1}. Thus any event that fires C{d1} will also fire C{d2}. However, the converse is B{not} true; if C{d2} is fired, C{d1} will not be affected. Note that unlike the case where chaining is caused by a L{Deferred} being returned from a callback, it is possible to cause the call stack size limit to be exceeded by chaining many L{Deferred}s together with C{chainDeferred}. @return: C{self}. )r� r� rO rT �r� rQ r3 r3 r4 � chainDeferredb s zDeferred.chainDeferredrK c C s t |t�rJ �| �|� dS )a7 Run all success callbacks that have been added to this L{Deferred}. Each callback will have its result passed as the first argument to the next; this way, the callbacks act as a 'processing chain'. If the success-callback returns a L{Failure} or raises an L{Exception}, processing will continue on the *error* callback chain. If a callback (or errback) returns another L{Deferred}, this L{Deferred} will be chained to it (and further callbacks will not run until that L{Deferred} has a result). An instance of L{Deferred} may only have either L{callback} or L{errback} called on it, and only once. @param result: The object which will be passed to the first callback added to this L{Deferred} (via L{addCallback}), unless C{result} is a L{Failure}, in which case the behavior is the same as calling C{errback(result)}. @raise AlreadyCalledError: If L{callback} or L{errback} has already been called on this L{Deferred}. N)r\ rN �_startRunCallbacks)r� rK r3 r3 r4 rO } s zDeferred.callbackrU c C s6 |du r t | jd�}n t|t �st |�}| �|� dS )a� Run all error callbacks that have been added to this L{Deferred}. Each callback will have its result passed as the first argument to the next; this way, the callbacks act as a 'processing chain'. Also, if the error-callback returns a non-Failure or doesn't raise an L{Exception}, processing will continue on the *success*-callback chain. If the argument that's passed to me is not a L{Failure} instance, it will be embedded in one. If no argument is passed, a L{Failure} instance will be created based on the current traceback stack. Passing a string as `fail' is deprecated, and will be punished with a warning message. An instance of L{Deferred} may only have either L{callback} or L{errback} called on it, and only once. @param fail: The L{Failure} object which will be passed to the first errback added to this L{Deferred} (via L{addErrback}). Alternatively, a L{Exception} instance from which a L{Failure} will be constructed (with no traceback) or L{None} to create a L{Failure} instance from the current exception state (with a traceback). @raise AlreadyCalledError: If L{callback} or L{errback} has already been called on this L{Deferred}. @raise NoCurrentExceptionError: If C{fail} is L{None} but there is no current exception state. NrY )r* r[ r\ r� )r� rU r3 r3 r4 rT � s zDeferred.errbackc C s | j d | _ dS )zP Stop processing on a L{Deferred} until L{unpause}() is called. r` N)�paused�r� r3 r3 r4 �pause� s zDeferred.pausec C s, | j d | _ | j r dS | jr| �� dS dS )zI Process all callbacks made since L{pause}() was called. r` N)r� r� r� r� r3 r3 r4 �unpause� s �zDeferred.unpausec C s\ | j s | j}|r || � nd| _| j s | �tt� �� dS dS t| jt�r,| j� � dS dS )a� Cancel this L{Deferred}. If the L{Deferred} has not yet had its C{errback} or C{callback} method invoked, call the canceller function provided to the constructor. If that function does not invoke C{callback} or C{errback}, or if no canceller function was provided, errback with L{CancelledError}. If this L{Deferred} is waiting on another L{Deferred}, forward the cancellation to the other L{Deferred}. TN) r� r� �_suppressAlreadyCalledrT r* rC r\ rK rN r� r� r3 r3 r4 r� � s � �zDeferred.cancelc C s� | j r$| jr d| _d S | jr"| jd u rt� | _d| j�� }t|��t�| jr:| jd u r0t� | _t�� d d� | j_ d| _ || _ | � � d S )NFr~ ���T) r� r� r[ r� rz r� r? r� r� r} rK r� )r� rK �extrar3 r3 r4 r� � s" zDeferred._startRunCallbacksc C s t j| ftft j| ftffS )zT Build a tuple of callback and errback with L{_Sentinel._CONTINUE}. )rr rt ru r� r3 r3 r4 � _continuation� s �zDeferred._continuationc C s | j rdS | g}|�r |d }|jrdS d}d|_|jr�|j�d�}t|jt�s0|d \}}}n|d \}}}|tu rct t t |d �}|j|_d|_|j durTd|j _ | jd8 _|�|� d}nxz&d|_ z ||jg|�R i |��|_|j|u rt|d� W d|_ nd|_ w W n ty� t| jd�|_Y n?w t|jt �r�t|jd t�} | tu s�t| t �s�|jjr�|�� |j|_|jj�|�� � nd|j_|jj dur�d|jj _ | |_|js |�rt|jt�r�|j�� |j du r�t� |_ |j|j _ n |j du�rd|j _ |�� |s dS dS ) a� Run the chain of callbacks once a result is available. This consists of a simple loop over all of the callbacks, calling each with the current result and making the current result equal to the return value (or raised exception) of that call. If L{_runningCallbacks} is true, this loop won't run at all, since it is already running above us on the call stack. If C{self.paused} is true, the loop also won't run, because that's what it means to be paused. The loop will terminate before processing all of the callbacks if a L{Deferred} without a result is encountered. If a L{Deferred} I{with} a result is encountered, that result is taken and the loop proceeds. @note: The implementation is complicated slightly by the fact that chaining (associating two L{Deferred}s with each other such that one will wait for the result of the other, as happens when a Deferred is returned from a callback on another L{Deferred}) is supported iteratively rather than recursively, to avoid running out of stack frames when processing long chains. Nr� Tr r` Fz|Callback returned the Deferred it was attached to; this breaks the callback chain and will raise an exception in the future.rY rK )�_runningCallbacksr� r� r� �popr\ rK r* rt r rN r: r� r{ r� r) rW r[ �getattrrs r� r� � cleanFailurerz ) r� �chain�current�finished�itemrO r/ r0 �chainee� resultResultr3 r3 r4 r� s� ��� �� � �� �P �zDeferred._runCallbacksc C sj | j j}t| dt�}t| �}| jdur dt| j�d��}n |tu r$d}nd|��}d|� d|d�|� d �S ) zE Return a string representation of this L{Deferred}. rK Nz waiting on Deferred at 0x�xrG z current result: �<z at 0x�>)� __class__r6 r� rs �idr� )r� �cnamerK �myIDr3 r3 r4 �__str__� s zDeferred.__str__c C rg r2 r3 r� r3 r3 r4 �__iter__� r< zDeferred.__iter__ro c C sX | j r| S t| dt�}|tu r| S t|t�r(| jd us J �d | j_||j_|j�t |��)NrK ) r� r� rs r\ r* r� r{ ro � __failure__� StopIteration)r� ro rK r3 r3 r4 �send� s z Deferred.sendc C � | � � S r2 )r� r� r3 r3 r4 � __await__� s zDeferred.__await__�loop�Future[_DeferredResultT]c s\ |� � � d �fdd� }dtddf� fdd � }d tddf� fd d � }��||� � �|� � S )a Adapt this L{Deferred} into a L{Future} which is bound to C{loop}. @note: converting a L{Deferred} to an L{Future} consumes both its result and its errors, so this method implicitly converts C{self} into a L{Deferred} firing with L{None}, regardless of what its result previously would have been. @since: Twisted 17.5.0 @param loop: The L{asyncio} event loop to bind the L{Future} to. @return: A L{Future} which will fire when the L{Deferred} fires. � futureAgainr� r1 Nc s | � � r � �� d S d S r2 )� cancelledr� )r� r� r3 r4 � checkCancel� s �z&Deferred.asFuture.<locals>.checkCancelrI c s � � � s � �| j� d S d S r2 )r� � set_exceptionro )rI ��futurer3 r4 � maybeFail� s �z$Deferred.asFuture.<locals>.maybeFailrK c s � � � s � �| � d S d S r2 )r� � set_resultr� r� r3 r4 � maybeSucceed� s �z'Deferred.asFuture.<locals>.maybeSucceed)r� r� r1 N)� create_futurer* r: r� �add_done_callback)r� r� r� r� r� r3 )r� r� r4 �asFuture� s zDeferred.asFuturer� c s� dt ddf� fdd� }t� �dtt ddf��fdd� }| |�}|� dtdtttt f f� �fd d � }|�|� ��|� |S ) a� Adapt a L{Future} to a L{Deferred}. @note: This creates a L{Deferred} from a L{Future}, I{not} from a C{coroutine}; in other words, you will need to call L{asyncio.ensure_future}, L{asyncio.loop.create_task} or create an L{asyncio.Task} yourself to get from a C{coroutine} to a L{Future} if what you have is an awaitable coroutine and not a L{Future}. (The length of this list of techniques is exactly why we have left it to the caller!) @since: Twisted 17.5.0 @param future: The L{Future} to adapt. @return: A L{Deferred} which will fire when the L{Future} fires. rK r1 Nc s4 z| � � }W n ty t� }Y nw � �|� d S r2 )rK rW r* rO )rK � extracted)�actualr3 r4 �adapt s �z"Deferred.fromFuture.<locals>.adapt�reselfc s � � � | ��� d S r2 )r� rO )r� )r� � futureCancelr3 r4 r� s z#Deferred.fromFuture.<locals>.cancelc s | �u r t � � � S | S r2 )rN r� )r� r� r3 r4 �uncancel s z%Deferred.fromFuture.<locals>.uncancel)r r: rN rv r r� r� )�clsr� r� r� r� r� r3 )r� r� r� r4 � fromFuture� s �� zDeferred.fromFuture�cororL c C s( t |�st|t�st|�d���t|�S )a� Schedule the execution of a coroutine that awaits on L{Deferred}s, wrapping it in a L{Deferred} that will fire on success/failure of the coroutine. Coroutine functions return a coroutine object, similar to how generators work. This function turns that coroutine into a Deferred, meaning that it can be used in regular Twisted code. For example:: import treq from twisted.internet.defer import Deferred from twisted.internet.task import react async def crawl(pages): results = {} for page in pages: results[page] = await treq.content(await treq.get(page)) return results def main(reactor): pages = [ "http://localhost:8080" ] d = Deferred.fromCoroutine(crawl(pages)) d.addCallback(print) return d react(main) @since: Twisted 21.2.0 @param coro: The coroutine object to schedule. @raise ValueError: If C{coro} is not a coroutine or generator. z is not a coroutine)r r\ r rE �_cancellableInlineCallbacks)r� r� r3 r3 r4 � fromCoroutine" s ,zDeferred.fromCoroutiner2 )rQ r� r1 r� r� )r1 r� )<r6 r7 r8 rA r� r� r� r rz r� r� r� r[ r� r r� rj ru �_CallbackOrderedArguments�_CallbackKeywordArgumentsr� r: r� r� r� �floatr" r� r� r rv r* rO rW rT r� r� r� r� �_CallbackChainr� r� r� r� �__repr__r� r+ r� r r r� �__next__r r� � classmethodr r� r r= r� r3 r3 r3 r4 rN [ s� $ �� �)����� � � � � �3���� ����� ����� � ���� � ? ' "1 ����rN r� c C s8 t | t�r| S zt�| �W S ty t| �d���w )a� Schedule the execution of a coroutine that awaits/yields from L{Deferred}s, wrapping it in a L{Deferred} that will fire on success/failure of the coroutine. If a Deferred is passed to this function, it will be returned directly (mimicing the L{asyncio.ensure_future} function). See L{Deferred.fromCoroutine} for examples of coroutines. @param coro: The coroutine object to schedule, or a L{Deferred}. z! is not a coroutine or a Deferred)r\ rN r� rE )r� r3 r3 r4 �ensureDeferredT s �r� c @ sT e Zd ZdZdededdfdd�Zdefdd �Zdefd d �Z d e defd d�Z dS )� FirstErrorz� First error to occur in a L{DeferredList} if C{fireOnOneErrback} is set. @ivar subFailure: The L{Failure} that occurred. @ivar index: The index of the L{Deferred} in the L{DeferredList} where it happened. rI �indexr1 Nc C s t �| ||� || _|| _d S r2 )� Exceptionr� � subFailurer� )r� rI r� r3 r3 r4 r� z s zFirstError.__init__c C s d| j | jjf S )z� The I{repr} of L{FirstError} instances includes the repr of the wrapped failure's exception and the index of the L{FirstError}. zFirstError[#%d, %r])r� r� ro r� r3 r3 r4 r� s zFirstError.__repr__c C s d| j | jf S )z� The I{str} of L{FirstError} instances includes the I{str} of the entire wrapped failure (including its traceback and exception) and the index of the L{FirstError}. zFirstError[#%d, %s])r� r� r� r3 r3 r4 r� � s zFirstError.__str__�otherc C s( t |t�rt| j| jf|j|jf�S dS )a+ Comparison between L{FirstError} and other L{FirstError} instances is defined as the comparison of the index and sub-failure of each instance. L{FirstError} instances don't compare equal to anything that isn't a L{FirstError} instance. @since: 8.2 r� )r\ r� r& r� r� )r� r� r3 r3 r4 �__cmp__� s zFirstError.__cmp__) r6 r7 r8 rA r* �intr� r� r� r� r: r� r3 r3 r3 r4 r� p s r� � deferredList�fireOnOneCallback�fireOnOneErrback� consumeErrorsc C � d S r2 r3 �r� r r r r3 r3 r4 � _DeferredList� � r c C r r2 r3 r r3 r3 r4 r � r c C r r2 r3 r r3 r3 r4 r � s c @ sj e Zd ZdZdZdZ ddeee de de de fdd�Z d ed e d e d e e fd d�Z ddd�ZdS )� DeferredLista) L{DeferredList} is a tool for collecting the results of several Deferreds. This tracks a list of L{Deferred}s for their results, and makes a single callback when they have all completed. By default, the ultimate result is a list of (success, result) tuples, 'success' being a boolean. L{DeferredList} exposes the same API that L{Deferred} does, so callbacks and errbacks can be added to it in the same way. L{DeferredList} is implemented by adding callbacks and errbacks to each L{Deferred} in the list passed to it. This means callbacks and errbacks added to the Deferreds before they are passed to L{DeferredList} will change the result that L{DeferredList} sees (i.e., L{DeferredList} is not special). Callbacks and errbacks can also be added to the Deferreds after they are passed to L{DeferredList} and L{DeferredList} may change the result that they see. See the documentation for the C{__init__} arguments for more information. @ivar _deferredList: The L{list} of L{Deferred}s to track. Fr� r r r c C s� t |�| _dgt| j� | _ t�| � t| j�dkr"|s"| �g � || _|| _|| _ d| _ d}| jD ]}|j | j | j |t f|tfd� |d }q3dS )aj Initialize a DeferredList. @param deferredList: The deferreds to track. @param fireOnOneCallback: (keyword param) a flag indicating that this L{DeferredList} will fire when the first L{Deferred} in C{deferredList} fires with a non-failure result without waiting for any of the other Deferreds. When this flag is set, the DeferredList will fire with a two-tuple: the first element is the result of the Deferred which fired; the second element is the index in C{deferredList} of that Deferred. @param fireOnOneErrback: (keyword param) a flag indicating that this L{DeferredList} will fire when the first L{Deferred} in C{deferredList} fires with a failure result without waiting for any of the other Deferreds. When this flag is set, if a Deferred in the list errbacks, the DeferredList will errback with a L{FirstError} failure wrapping the failure of that Deferred. @param consumeErrors: (keyword param) a flag indicating that failures in any of the included L{Deferred}s should not be propagated to errbacks added to the individual L{Deferred}s after this L{DeferredList} is constructed. After constructing the L{DeferredList}, any errors in the individual L{Deferred}s will be converted to a callback result of L{None}. This is useful to prevent spurious 'Unhandled error in Deferred' messages from being logged. This does not prevent C{fireOnOneErrback} from working. Nr )r� r� r` )�list� _deferredList�len� resultListrN r� rO r r r � finishedCountr� � _cbDeferred�SUCCESS�FAILURE)r� r� r r r r� rb r3 r3 r4 r� � s, !� � �zDeferredList.__init__rK r� � succeededr1 c C s� ||f| j |< | jd7 _| jsJ|tkr | jr | �||f� n*|tkr9| jr9t|t �s.J �| � t t ||��� n| jt | j �krJ| �t t| j �� |tkrS| jrSdS |S )zI (internal) Callback for when one of my deferreds fires. r` N)r r r� r r rO r r r\ r* rT r� r r �_DeferredListResultListTr )r� rK r� r r3 r3 r4 r & s zDeferredList._cbDeferredNc C sB | j s | jD ]}z|�� W q ty t�d� Y qw dS dS )a� Cancel this L{DeferredList}. If the L{DeferredList} hasn't fired yet, cancel every L{Deferred} in the list. If the L{DeferredList} has fired, including the case where the C{fireOnOneCallback}/C{fireOnOneErrback} flag is set and the L{DeferredList} fires because one L{Deferred} in the list fires with a non-failure/failure result, do nothing in the C{cancel} method. z-Exception raised from user supplied cancellerN)r� r r� rW rH rI )r� rb r3 r3 r4 r� @ s ��zDeferredList.cancel�FFFr� )r6 r7 r8 rA r r r rN rv rl r� r� r r r� r3 r3 r3 r4 r � s4 � ��� �F��� �r r c C s6 | D ]}|d us J �|\}}|sJ �qdd� | D �S )NTc S s g | ]}|d �qS )r` r3 )�.0r� r3 r3 r4 � <listcomp>\ s z,_parseDeferredListResult.<locals>.<listcomp>r3 )r r rK �successro r3 r3 r4 �_parseDeferredListResultT s r c C s* t | d|d�}|�t� tttt |�S )a Returns, via a L{Deferred}, a list with the results of the given L{Deferred}s - in effect, a "join" of multiple deferred operations. The returned L{Deferred} will fire when I{all} of the provided L{Deferred}s have fired, or when any one of them has failed. This method can be cancelled by calling the C{cancel} method of the L{Deferred}, all the L{Deferred}s in the list will be cancelled. This differs from L{DeferredList} in that you don't need to parse the result for success/failure. @param consumeErrors: (keyword param) a flag, defaulting to False, indicating that failures in any of the given L{Deferred}s should not be propagated to errbacks added to the individual L{Deferred}s after this L{gatherResults} invocation. Any such errors in the individual L{Deferred}s will be converted to a callback result of L{None}. This is useful to prevent spurious 'Unhandled error in Deferred' messages from being logged. This parameter is available since 11.1.0. T)r r )r r� r r rN r r= )r� r rQ r3 r3 r4 � gatherResults_ s r c @ sB e Zd ZU dZeZeed< dee ddfdd�Z defdd �Z dS ) �waitForDeferred�# See L{deferredGenerator}. rK rQ r1 Nc C s4 t jdtdd� t|t�std|�d���|| _d S )Nz�twisted.internet.defer.waitForDeferred was deprecated in Twisted 15.0.0; please use twisted.internet.defer.inlineCallbacks instead� )� stacklevelz6You must give waitForDeferred a Deferred. You gave it �.)�warnings�warn�DeprecationWarningr\ rN � TypeErrorrQ r� r3 r3 r4 r� � s � � zwaitForDeferred.__init__c C s& t | jt�r | j�� | jtu | jS r2 )r\ rK r* �raiseExceptionrs r� r3 r3 r4 � getResult� s zwaitForDeferred.getResult) r6 r7 r8 rA rs rK r r� rN r: r� r" r3 r3 r3 r4 r � s r �gc s� d}ddg� zt ��}W n ty � �|� � Y S ty+ � �� � Y S w t|t�r7ttd��S t|t �rjt t |�fdt dt ddf� ��fdd � }|j � |� �d r`d �d < � S d�d < d�d< d}q) r NTr` z Yield waitForDeferred(d), not d!�rrK r1 c s0 | |_ �d rd�d< | �d< d S t�� � d S �Nr Fr` )rK �_deferGenerator)r$ rK �rb r# �waitingr3 r4 � gotResult� s z"_deferGenerator.<locals>.gotResultr F)�nextr� rO rW rT r\ rN rU r r r r: rQ r� )r# rb rK r) r3 r' r4 r& � s> � ���� �r& � z&twisted.internet.defer.inlineCallbacksc �* t � �dtdtdtt f� fdd� �}|S )aI L{deferredGenerator} and L{waitForDeferred} help you write L{Deferred}-using code that looks like a regular sequential function. Consider the use of L{inlineCallbacks} instead, which can accomplish the same thing in a more concise manner. There are two important functions involved: L{waitForDeferred}, and L{deferredGenerator}. They are used together, like this:: @deferredGenerator def thingummy(): thing = waitForDeferred(makeSomeRequestResultingInDeferred()) yield thing thing = thing.getResult() print(thing) #the result! hoorj! L{waitForDeferred} returns something that you should immediately yield; when your generator is resumed, calling C{thing.getResult()} will either give you the result of the L{Deferred} if it was a success, or raise an exception if it was a failure. Calling C{getResult} is B{absolutely mandatory}. If you do not call it, I{your program will not work}. L{deferredGenerator} takes one of these waitForDeferred-using generator functions and converts it into a function that returns a L{Deferred}. The result of the L{Deferred} will be the last value that your generator yielded unless the last value is a L{waitForDeferred} instance, in which case the result will be L{None}. If the function raises an unhandled exception, the L{Deferred} will errback instead. Remember that C{return result} won't work; use C{yield result; return} in place of that. Note that not yielding anything from your generator will make the L{Deferred} result in L{None}. Yielding a L{Deferred} from your generator is also an error condition; always yield C{waitForDeferred(d)} instead. The L{Deferred} returned from your deferred generator may also errback if your generator raised an exception. For example:: @deferredGenerator def thingummy(): thing = waitForDeferred(makeSomeRequestResultingInDeferred()) yield thing thing = thing.getResult() if thing == 'I love Twisted': # will become the result of the Deferred yield 'TWISTED IS GREAT!' return else: # will trigger an errback raise Exception('DESTROY ALL LIFE') Put succinctly, these functions connect deferred-using code with this 'fake blocking' style in both directions: L{waitForDeferred} converts from a L{Deferred} to the 'blocking' style, and L{deferredGenerator} converts from the 'blocking' style to a L{Deferred}. r/ r0 r1 c s t � | i |��t� �S r2 )r& rN )r/ r0 �r. r3 r4 �unwindGenerator s z*deferredGenerator.<locals>.unwindGenerator�r r: rN �r. r. r3 r- r4 �deferredGenerator� s < r1 c @ s e Zd Zdeddfdd�ZdS )�_DefGen_Returnro r1 Nc C s || _ d S r2 )ro )r� ro r3 r3 r4 r� ) � z_DefGen_Return.__init__)r6 r7 r8 r: r� r3 r3 r3 r4 r2 ( s r2 �valc C s t | ��)a� Return val from a L{inlineCallbacks} generator. Note: this is currently implemented by raising an exception derived from L{BaseException}. You might want to change any 'except:' clauses to an 'except Exception:' clause so as not to catch this exception. Also: while this function currently will work when called from within arbitrary functions called from within the generator, do not rely upon this behavior. )r2 )r4 r3 r3 r4 � returnValue- s r5 )� auto_attribsc @ s2 e Zd ZU dZee ed< dZeee ed< dS )�_CancellationStatusa, Cancellation status of an L{inlineCallbacks} invocation. @ivar deferred: the L{Deferred} to callback or errback when the generator invocation has finished. @ivar waitingOn: the L{Deferred} being waited upon (which L{_inlineCallbacks} must fill out before returning) rb N� waitingOn) r6 r7 r8 rA rN r: r� r8 r r3 r3 r3 r4 r7 = s r7 �gen�statusc s^ ddg�t � � zt| t�}|r� �tt| �j��} n� ��j| �} W n� ty@ } z�j� t |dd�� W Y d}~dS d}~w t y� } z�t � }|dusPJ �|d }|dusZJ �|j }|duscJ �tdk rq|j }|duspJ �n tr||j }|dus|J �|r�|j }|dus�J �|j dus�J �|j j r�|}|dus�J �|j dus�J �|j j r�|j }|dus�J �|j j s�|jjj} |j} |jdus�J �|jdus�J �t�d|jjj|jjjf t| | � �j� |j� W Y d}~dS d}~w ty� �j�� Y dS w t| t��r.dt d df� ���fd d � } | � | � �d �r"d �d < | �_ dS �d } d�d < d�d< q)a5 Carry out the work of L{inlineCallbacks}. Iterate the generator produced by an C{@}L{inlineCallbacks}-decorated function, C{gen}, C{send()}ing it the results of each value C{yield}ed by that generator, until a L{Deferred} is yielded, at which point a callback is added to that L{Deferred} to call this function again. @param result: The last result seen by this generator. Note that this is never a L{Deferred} - by the time this function is invoked, the L{Deferred} has been called back and this will be a particular result at a point in its callback chain. @param gen: a generator object returned by calling a function or method decorated with C{@}L{inlineCallbacks} @param status: a L{_CancellationStatus} tracking the current status of C{gen} TNr` ro r )� � zvreturnValue() in %r causing %r to exit: returnValue should only be invoked by functions decorated with inlineCallbacksr$ r1 c s0 �d rd�d< | �d< d S � � t| ��� d S r% )r5 �_inlineCallbacks)r$ ��current_contextr9 r: r( r3 r4 r) � s z#_inlineCallbacks.<locals>.gotResultr F) r; r\ r* r5 r �throwExceptionIntoGeneratorr� r� rb rO r� r2 r �tb_nextr r% �tb_frame�f_code� co_filename� tb_linenor � warn_explicit�co_namer ro rW rT rN r: r� r8 ) rK r9 r: � isFailure�e�excInfor� � appCodeTrace� ultimateTrace�filename�linenor) r3 r> r4 r= L s� ! ��� � ��� � � �r= c sV dt t ddf�fdd� � t � �}t|��dtdt t f� �fdd� �td| �� |S ) z� Make an C{@}L{inlineCallbacks} cancellable. @param gen: a generator object returned by calling a function or method decorated with C{@}L{inlineCallbacks} @return: L{Deferred} for the C{@}L{inlineCallbacks} that is cancellable. �itr1 Nc s4 g | j | _ }| �� � | j �|� | �t� � d S r2 )r� r� �extendrT �&_InternalInlineCallbacksCancelledError)rO �tmp)� handleCancelr3 r4 r� � s z+_cancellableInlineCallbacks.<locals>.cancelrK c s4 | � t� t� ��_�j}|dusJ �|�� �jS )aS Propagate the cancellation of an C{@}L{inlineCallbacks} to the L{Deferred} it is waiting on. @param result: An L{_InternalInlineCallbacksCancelledError} from C{cancel()}. @return: A new L{Deferred} that the C{@}L{inlineCallbacks} generator can callback or errback through. N)rp rQ rN rb r8 r� )rK �awaited)r� r: r3 r4 rS s z1_cancellableInlineCallbacks.<locals>.handleCancel)rN r: r7 r* r= )r9 rb r3 )r� rS r: r4 r� � s r� c @ r> )rQ z� A unique exception used only in L{_cancellableInlineCallbacks} to verify that an L{inlineCallbacks} is being cancelled as expected. Nr@ r3 r3 r3 r4 rQ rB rQ c r, )a L{inlineCallbacks} helps you write L{Deferred}-using code that looks like a regular sequential function. For example:: @inlineCallbacks def thingummy(): thing = yield makeSomeRequestResultingInDeferred() print(thing) # the result! hoorj! When you call anything that results in a L{Deferred}, you can simply yield it; your generator will automatically be resumed when the Deferred's result is available. The generator will be sent the result of the L{Deferred} with the 'send' method on generators, or if the result was a failure, 'throw'. Things that are not L{Deferred}s may also be yielded, and your generator will be resumed with the same object sent back. This means C{yield} performs an operation roughly equivalent to L{maybeDeferred}. Your inlineCallbacks-enabled generator will return a L{Deferred} object, which will result in the return value of the generator (or will fail with a failure object if your generator raises an unhandled exception). Note that you can't use C{return result} to return a value; use C{returnValue(result)} instead. Falling off the end of the generator, or simply using C{return} will cause the L{Deferred} to have a result of L{None}. Be aware that L{returnValue} will not accept a L{Deferred} as a parameter. If you believe the thing you'd like to return could be a L{Deferred}, do this:: result = yield result returnValue(result) The L{Deferred} returned from your deferred generator may errback if your generator raised an exception:: @inlineCallbacks def thingummy(): thing = yield makeSomeRequestResultingInDeferred() if thing == 'I love Twisted': # will become the result of the Deferred returnValue('TWISTED IS GREAT!') else: # will trigger an errback raise Exception('DESTROY ALL LIFE') It is possible to use the C{return} statement instead of L{returnValue}:: @inlineCallbacks def loadData(url): response = yield makeRequest(url) return json.loads(response) You can cancel the L{Deferred} returned from your L{inlineCallbacks} generator before it is fired by your generator completing (either by reaching its end, a C{return} statement, or by calling L{returnValue}). A C{CancelledError} will be raised from the C{yield}ed L{Deferred} that has been cancelled if that C{Deferred} does not otherwise suppress it. r/ r0 r1 c sR z � | i |��}W n t y td� f ��w t|t�s%td� |f ��t|�S )NzkinlineCallbacks requires %r to produce a generator; insteadcaught returnValue being used in a non-generatorzBinlineCallbacks requires %r to produce a generator; instead got %r)r2 r r\ r r� )r/ r0 r9 r- r3 r4 r. c s ��� ��z(inlineCallbacks.<locals>.unwindGeneratorr/ r0 r3 r- r4 �inlineCallbacks% s > rU �_ConcurrencyPrimitiveT�_ConcurrencyPrimitive)�boundc @ s� e Zd Zdeddfdd�Zdedefdd�Zd ed ed ef d e d e de e f dd�Z dede e fdd�Z de de de de e fdd�Zedede e fdd��Zeddd��ZdS ) rW r� r1 Nc C s g | _ d S r2 )r( r� r3 r3 r4 r� r3 z _ConcurrencyPrimitive.__init__r$ c C s | � � |S r2 )�release)r� r$ r3 r3 r4 �_releaseAndReturn� s z'_ConcurrencyPrimitive._releaseAndReturn�%self_319AA2A8B18F4B8EA296D75F279EB07Fr. .r/ r0 c s. dt dtt f� ���fdd� }��� �|�S )a� Acquire, run, release. This method takes a callable as its first argument and any number of other positional and keyword arguments. When the lock or semaphore is acquired, the callable will be invoked with those arguments. The callable may return a L{Deferred}; if it does, the lock or semaphore won't be released until that L{Deferred} fires. @return: L{Deferred} of function result. � ignoredResultr1 c s t �g� �R i �����j�S r2 )r] r� rZ )r\ �r/ r. r0 r[ r3 r4 rX � s �z*_ConcurrencyPrimitive.run.<locals>.execute)r: rN rv �acquirer� )r[ r. r/ r0 rX r3 r] r4 r5 � s z_ConcurrencyPrimitive.runc C r� )zD We can be used as an asynchronous context manager. )r^ r� r3 r3 r4 � __aenter__� s z _ConcurrencyPrimitive.__aenter__�exc_type�exc_val�exc_tbc C s | � � td�S )NF)rY rR )r� r` ra rb r3 r3 r4 � __aexit__� s z _ConcurrencyPrimitive.__aexit__c C r r2 r3 r� r3 r3 r4 r^ � � z _ConcurrencyPrimitive.acquirec C r r2 r3 r� r3 r3 r4 rY � rd z _ConcurrencyPrimitive.releaser� )r6 r7 r8 rV r� r= rZ r rv r: rN r5 r_ rl rc r r^ rY r3 r3 r3 r4 rW ~ s( � ��� � �_DeferredLockT� DeferredLockc @ sV e Zd ZdZdZdedee ddfdd�Zdedee fd d �Zdeddfd d �Z dS ) rf z� A lock for event driven systems. @ivar locked: C{True} when this Lock has been acquired, false at all other times. Do not change this value, but it is useful to examine for the equivalent of a "non-blocking" acquisition. Fr� rQ r1 Nc C � | j �|� dS �a� Remove a deferred d from our waiting list, as the deferred has been canceled. Note: We do not need to wrap this in a try/except to catch d not being in self.waiting because this canceller will not be called if d has fired. release() pops a deferred out of self.waiting and calls it, so the canceller will no longer be called. @param d: The deferred that has been canceled. N�r( �remover� r3 r3 r4 �_cancelAcquire� � zDeferredLock._cancelAcquirec C s6 t | jd�}| jr| j�|� |S d| _|�| � |S )aL Attempt to acquire the lock. Returns a L{Deferred} that fires on lock acquisition with the L{DeferredLock} as the value. If the lock is locked, then the Deferred is placed at the end of a waiting list. @return: a L{Deferred} which fires on lock acquisition. @rtype: a L{Deferred} �r� T)rN rk �lockedr( r� rO r� r3 r3 r4 r^ � s � zDeferredLock.acquirec C s> | j sJ d��d| _ | jr d| _ | j�d�}|�| � dS dS )z� Release the lock. If there is a waiting list, then the first L{Deferred} in that waiting list will be called back. Should be called by whomever did the L{acquire}() when the shared resource is free. z!Tried to release an unlocked lockFTr N)rn r( r� rO r� r3 r3 r4 rY � s �zDeferredLock.release) r6 r7 r8 rA rn re rN rk r^ rY r3 r3 r3 r4 rf � s �_DeferredSemaphoreT�DeferredSemaphorec @ sd e Zd ZdZdeddfdd�Zdedee ddfd d �Zdedee fd d �Z deddfd d�Z dS )rp a� A semaphore for event driven systems. If you are looking into this as a means of limiting parallelism, you might find L{twisted.internet.task.Cooperator} more useful. @ivar limit: At most this many users may acquire this semaphore at once. @ivar tokens: The difference between C{limit} and the number of users which have currently acquired this semaphore. �tokensr1 Nc C s* t �| � |dk r td��|| _|| _dS )ze @param tokens: initial value of L{tokens} and L{limit} @type tokens: L{int} r` z&DeferredSemaphore requires tokens >= 1N)rW r� � ValueErrorrq �limit)r� rq r3 r3 r4 r� s zDeferredSemaphore.__init__r� rQ c C rg rh ri r� r3 r3 r4 rk r� z DeferredSemaphore._cancelAcquirec C sN | j dks J d��t| jd�}| j s| j�|� |S | j d | _ |�| � |S )zq Attempt to acquire the token. @return: a L{Deferred} which fires on token acquisition. r z9Internal inconsistency?? tokens should never be negativerm r` )rq rN rk r( r� rO r� r3 r3 r4 r^ $ s � � zDeferredSemaphore.acquirec C sP | j | jk s J d��| j d | _ | jr&| j d | _ | j�d�}|�| � dS dS )z� Release the token. Should be called by whoever did the L{acquire}() when the shared resource is free. z4Someone released me too many times: too many tokens!r` r N)rq rs r( r� rO r� r3 r3 r4 rY 5 s � �zDeferredSemaphore.release) r6 r7 r8 rA r� r� ro rN rk r^ rY r3 r3 r3 r4 rp � s �� �c @ � e Zd ZdS )� QueueOverflowN�r6 r7 r8 r3 r3 r3 r4 ru G � ru c @ rt )�QueueUnderflowNrv r3 r3 r3 r4 rx K rw rx c @ sl e Zd ZdZ ddee dee ddfdd�Zdee ddfd d �Z d e ddfd d �Z dee fdd�Z dS )� DeferredQueuea� An event driven queue. Objects may be added as usual to this queue. When an attempt is made to retrieve an object when the queue is empty, a L{Deferred} is returned which will fire when an object becomes available. @ivar size: The maximum number of objects to allow into the queue at a time. When an attempt to add a new object would exceed this limit, L{QueueOverflow} is raised synchronously. L{None} for no limit. @ivar backlog: The maximum number of L{Deferred} gets to allow at one time. When an attempt is made to get an object which would exceed this limit, L{QueueUnderflow} is raised synchronously. L{None} for no limit. N�size�backlogr1 c C s g | _ g | _|| _|| _d S r2 )r( �pendingrz r{ )r� rz r{ r3 r3 r4 r� ` s zDeferredQueue.__init__rQ c C rg )a� Remove a deferred d from our waiting list, as the deferred has been canceled. Note: We do not need to wrap this in a try/except to catch d not being in self.waiting because this canceller will not be called if d has fired. put() pops a deferred out of self.waiting and calls it, so the canceller will no longer be called. @param d: The deferred that has been canceled. Nri r� r3 r3 r4 � _cancelGeth rl zDeferredQueue._cancelGet�objc C sL | j r| j �d��|� dS | jdu st| j�| jk r#| j�|� dS t� �)zq Add an object to this queue. @raise QueueOverflow: Too many objects are in this queue. r N)r( r� rO rz r r| r� ru )r� r~ r3 r3 r4 �putv s zDeferredQueue.putc C sR | j r t| j �d��S | jdu st| j�| jk r&t| jd�}| j�|� |S t � �)a3 Attempt to retrieve and remove an object from the queue. @return: a L{Deferred} which fires with the next object available in the queue. @raise QueueUnderflow: Too many (more than C{backlog}) L{Deferred}s are already waiting for an object from this queue. r Nrm ) r| rR r� r{ r r( rN r} r� rx r� r3 r3 r4 �get� s zDeferredQueue.get)NN) r6 r7 r8 rA r r� r� rN r: r} r= r r� r3 r3 r3 r4 ry O s ��� � ry c @ r> )�AlreadyTryingToLockErrorz{ Raised when L{DeferredFilesystemLock.deferUntilLocked} is called twice on a single L{DeferredFilesystemLock}. Nr@ r3 r3 r3 r4 r� � rB r� c @ sn e Zd ZU dZdZdZee ed< dZ ee ed< dde dee ddfd d �Z dd ee ded fd d �ZdS )�DeferredFilesystemLockaj A L{FilesystemLock} that allows for a L{Deferred} to be fired when the lock is acquired. @ivar _scheduler: The object in charge of scheduling retries. In this implementation this is parameterized for testing. @ivar _interval: The retry interval for an L{IReactorTime} based scheduler. @ivar _tryLockCall: An L{IDelayedCall} based on C{_interval} that will manage the next retry for acquiring the lock. @ivar _timeoutCall: An L{IDelayedCall} based on C{deferUntilLocked}'s timeout argument. This is in charge of timing out our attempt to acquire the lock. r` N� _tryLockCall� _timeoutCall�name� schedulerr1 c C s6 t j�| |� |du rddlm} tt|�}|| _dS )z� @param name: The name of the lock to acquire @param scheduler: An object which provides L{IReactorTime} Nr )�reactor)r$ �FilesystemLockr� �twisted.internetr� r r" � _scheduler)r� r� r� r� r3 r3 r4 r� � s z DeferredFilesystemLock.__init__re c sf �j dur ttd��S dtttf ddf��fdd� � t� fdd���d � ����fd d � ��� �S ) a� Wait until we acquire this lock. This method is not safe for concurrent use. @param timeout: the number of seconds after which to time out if the lock has not been acquired. @return: a L{Deferred} which will callback when the lock is acquired, or errback with a L{TimeoutError} after timing out or an L{AlreadyTryingToLockError} if the L{deferUntilLocked} has already been called and not successfully locked the file. Nz/deferUntilLocked isn't safe for concurrent use.�reasonr1 c sf �j dusJ ��j �� d�_ �jdur!�j�� r!�j�� d�_��� r,� �d� dS � �| � dS )z� Cancel a L{DeferredFilesystemLock.deferUntilLocked} call. @type reason: L{Failure} @param reason: The reason why the call is cancelled. N)r� r� r� r� �lockrO rT �r� )rQ r� r3 r4 � _cancelLock� s z<DeferredFilesystemLock.deferUntilLocked.<locals>._cancelLockc s � t � �S r2 )rC rd )r� r3 r4 �<lambda>� s z9DeferredFilesystemLock.deferUntilLocked.<locals>.<lambda>c s� �� � r�jd ur�j�� d �_d �_��d � d S �d ur8�jd u r8ttd�j�f ��} �j� �� | ��_�j� �j ���_d S )Nz&Timed out acquiring lock: %s after %fs) r� r� r� r� rO r* rD r� r� r� � _intervalr� �r� �_tryLockrQ r� re r3 r4 r� � s$ ����z9DeferredFilesystemLock.deferUntilLocked.<locals>._tryLockr� )r� rU r� r r* r� rN )r� re r3 r� r4 �deferUntilLocked� s �� z'DeferredFilesystemLock.deferUntilLockedr2 )r6 r7 r8 rA r� r� r r! r� r� r� r" r� r� rN r� r3 r3 r3 r4 r� � s r� )rN r rR rU r r r? rD r r] r� r r1 rU r5 rf rp ry r� r� rC r2 )rb rc r1 N)FFr )F)�rA r� r �abcr r �asyncior r r �enumr � functoolsr �sysr r �typesr r �typingr r r r r r r r r r r r r r r r r r r �attr� incrementalr �twisted.internet.interfacesr! r" �twisted.loggerr# �twisted.pythonr$ �twisted.python.compatr% r& r' �twisted.python.deprecater( r) �twisted.python.failurer* r+ � contextvarsr, �__copy_context�_contextvarsSupport� ImportErrorr- r; rH r= r� r? rC rD r rE rJ rR rW rU r: rX r] re ri rj rl rm rn r� rq rr rs rt �DeferredCallback�DeferredErrbackr� r� r� r� ru r� rv rx rz rN r� r� r� �_DeferredListSingleResultT�_DeferredListResultItemTr r r r r r r r �_DeferableGeneratorr& r1 r2 r5 �sr7 r= r� rQ rU rV rW re rf ro rp ru rx ry r� r� r� �__all__r3 r3 r3 r4 �<module> s� T � ��� � ��� � � ������ * ~��� � + � ���� �� ���� � � ����� � ��� � � �� � �� �@ � �E ����� � ��� �2 � �T� = ;KH f
| ver. 1.4 |
Github
|
.
| PHP 8.2.28 | Generation time: 0.04 |
proxy
|
phpinfo
|
Settings