Your IP : 216.73.216.86
PK w}�\�)d�~ ~ ) __pycache__/__init__.cpython-36.opt-1.pycnu �[��� 3
\& � @ s d S )N� r r r �+/usr/lib64/python3.6/concurrent/__init__.py�<module> s PK w}�\�)d�~ ~ ) __pycache__/__init__.cpython-36.opt-2.pycnu �[��� 3
\& � @ s d S )N� r r r �+/usr/lib64/python3.6/concurrent/__init__.py�<module> s PK w}�\�)d�~ ~ # __pycache__/__init__.cpython-36.pycnu �[��� 3
\& � @ s d S )N� r r r �+/usr/lib64/python3.6/concurrent/__init__.py�<module> s PK w}�\�ߊނ � 1 futures/__pycache__/__init__.cpython-36.opt-1.pycnu �[��� 3
\ � @ sP d Z dZddlmZmZmZmZmZmZm Z m
Z
m Z ddl m
Z
ddlmZ dS )z?Execute computations asynchronously using threads or processes.z"Brian Quinlan (brian@sweetapp.com)� ) �FIRST_COMPLETED�FIRST_EXCEPTION�
ALL_COMPLETED�CancelledError� TimeoutError�Future�Executor�wait� as_completed)�ProcessPoolExecutor)�ThreadPoolExecutorN)�__doc__�
__author__Zconcurrent.futures._baser r r r r r r r r
Zconcurrent.futures.processr Zconcurrent.futures.threadr � r r �3/usr/lib64/python3.6/concurrent/futures/__init__.py�<module> s , PK w}�\�K`�2 2 1 futures/__pycache__/__init__.cpython-36.opt-2.pycnu �[��� 3
\ � @ sL d Z ddlmZmZmZmZmZmZmZm Z m
Z
ddl m Z ddl
mZ dS )z"Brian Quinlan (brian@sweetapp.com)� ) �FIRST_COMPLETED�FIRST_EXCEPTION�
ALL_COMPLETED�CancelledError� TimeoutError�Future�Executor�wait� as_completed)�ProcessPoolExecutor)�ThreadPoolExecutorN)�
__author__Zconcurrent.futures._baser r r r r r r r r
Zconcurrent.futures.processr Zconcurrent.futures.threadr � r r �3/usr/lib64/python3.6/concurrent/futures/__init__.py�<module> s , PK w}�\�ߊނ � + futures/__pycache__/__init__.cpython-36.pycnu �[��� 3
\ � @ sP d Z dZddlmZmZmZmZmZmZm Z m
Z
m Z ddl m
Z
ddlmZ dS )z?Execute computations asynchronously using threads or processes.z"Brian Quinlan (brian@sweetapp.com)� ) �FIRST_COMPLETED�FIRST_EXCEPTION�
ALL_COMPLETED�CancelledError� TimeoutError�Future�Executor�wait� as_completed)�ProcessPoolExecutor)�ThreadPoolExecutorN)�__doc__�
__author__Zconcurrent.futures._baser r r r r r r r r
Zconcurrent.futures.processr Zconcurrent.futures.threadr � r r �3/usr/lib64/python3.6/concurrent/futures/__init__.py�<module> s , PK w}�\GꂚP �P . futures/__pycache__/_base.cpython-36.opt-1.pycnu �[��� 3
\�R �
@ sP d Z ddlZddlZddlZddlZdZdZdZdZdZ dZ
d Z d
Z d Z
e e
e e e
gZe d e
d
e de de
diZejd�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd � d e�ZG d d � d e�ZG d d � d e�Zd!d"� Z d#d$� Z d/d%d&�Z ej d'd(�Z defd)d*�Z!G d+d,� d,e�Z"G d-d.� d.e�Z#dS )0z"Brian Quinlan (brian@sweetapp.com)� N�FIRST_COMPLETED�FIRST_EXCEPTION�
ALL_COMPLETED�
_AS_COMPLETED�PENDING�RUNNING� CANCELLED�CANCELLED_AND_NOTIFIED�FINISHED�pending�running� cancelled�finishedzconcurrent.futuresc @ s e Zd ZdZdS )�Errorz-Base class for all future-related exceptions.N)�__name__�
__module__� __qualname__�__doc__� r r �0/usr/lib64/python3.6/concurrent/futures/_base.pyr , s r c @ s e Zd ZdZdS )�CancelledErrorzThe Future was cancelled.N)r r r r r r r r r 0 s r c @ s e Zd ZdZdS )� TimeoutErrorz*The operation exceeded the given deadline.N)r r r r r r r r r 4 s r c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �_Waiterz;Provides the event that wait() and as_completed() block on.c C s t j� | _g | _d S )N)� threadingZEvent�event�finished_futures)�selfr r r �__init__: s
z_Waiter.__init__c C s | j j|� d S )N)r �append)r �futurer r r �
add_result> s z_Waiter.add_resultc C s | j j|� d S )N)r r )r r r r r �
add_exceptionA s z_Waiter.add_exceptionc C s | j j|� d S )N)r r )r r r r r �
add_cancelledD s z_Waiter.add_cancelledN)r r r r r r r! r" r r r r r 8 s
r c sD e Zd ZdZ� fdd�Z� fdd�Z� fdd�Z� fdd �Z� ZS )
�_AsCompletedWaiterzUsed by as_completed().c s t t| �j� tj� | _d S )N)�superr# r r �Lock�lock)r )� __class__r r r J s z_AsCompletedWaiter.__init__c
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r& r$ r# r r �set)r r )r' r r r N s z _AsCompletedWaiter.add_resultc
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r& r$ r# r! r r( )r r )r' r r r! S s z _AsCompletedWaiter.add_exceptionc
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r& r$ r# r" r r( )r r )r' r r r" X s z _AsCompletedWaiter.add_cancelled) r r r r r r r! r" �
__classcell__r r )r' r r# G s
r# c s8 e Zd ZdZ� fdd�Z� fdd�Z� fdd�Z� ZS )�_FirstCompletedWaiterz*Used by wait(return_when=FIRST_COMPLETED).c s t � j|� | jj� d S )N)r$ r r r( )r r )r' r r r ` s z _FirstCompletedWaiter.add_resultc s t � j|� | jj� d S )N)r$ r! r r( )r r )r' r r r! d s z#_FirstCompletedWaiter.add_exceptionc s t � j|� | jj� d S )N)r$ r" r r( )r r )r' r r r" h s z#_FirstCompletedWaiter.add_cancelled)r r r r r r! r" r) r r )r' r r* ] s r* c sL e Zd ZdZ� fdd�Zdd� Z� fdd�Z� fdd �Z� fd
d �Z� Z S ) �_AllCompletedWaiterz<Used by wait(return_when=FIRST_EXCEPTION and ALL_COMPLETED).c s$ || _ || _tj� | _t� j� d S )N)�num_pending_calls�stop_on_exceptionr r% r& r$ r )r r, r- )r' r r r o s
z _AllCompletedWaiter.__init__c
C s4 | j �$ | jd8 _| js&| jj� W d Q R X d S )N� )r& r, r r( )r r r r �_decrement_pending_callsu s z,_AllCompletedWaiter._decrement_pending_callsc s t � j|� | j� d S )N)r$ r r/ )r r )r' r r r { s z _AllCompletedWaiter.add_resultc s* t � j|� | jr | jj� n| j� d S )N)r$ r! r- r r( r/ )r r )r' r r r! s z!_AllCompletedWaiter.add_exceptionc s t � j|� | j� d S )N)r$ r" r/ )r r )r' r r r" � s z!_AllCompletedWaiter.add_cancelled)
r r r r r r/ r r! r" r) r r )r' r r+ l s r+ c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �_AcquireFutureszDA context manager that does an ordered acquire of Future conditions.c C s t |td�| _d S )N)�key)�sorted�id�futures)r r4 r r r r � s z_AcquireFutures.__init__c C s x| j D ]}|jj� qW d S )N)r4 �
_condition�acquire)r r r r r � __enter__� s z_AcquireFutures.__enter__c G s x| j D ]}|jj� qW d S )N)r4 r5 �release)r �argsr r r r �__exit__� s z_AcquireFutures.__exit__N)r r r r r r7 r: r r r r r0 � s r0 c C s� |t krt� }nZ|tkr t� }nJtdd� | D ��}|tkrHt|dd�}n"|tkr^t|dd�}n td| ��x| D ]}|j j
|� qpW |S )Nc s s | ]}|j ttgkV qd S )N)�_stater r
)�.0�fr r r � <genexpr>� s z._create_and_install_waiters.<locals>.<genexpr>T)r- Fz Invalid return condition: %r) r r# r r* �sumr r+ r �
ValueError�_waitersr )�fs� return_when�waiterZ
pending_countr= r r r �_create_and_install_waiters� s
rE c c sX xR| rR| d }x|D ]}|j |� qW |j� |jj |� W dQ R X ~| j� V qW dS )a~
Iterate on the list *fs*, yielding finished futures one by one in
reverse order.
Before yielding a future, *waiter* is removed from its waiters
and the future is removed from each set in the collection of sets
*ref_collect*.
The aim of this function is to avoid keeping stale references after
the future is yielded and before the iterator resumes.
r. N���)�remover5 rA �pop)rB rD � ref_collectr= Z futures_setr r r �_yield_finished_futures� s
rJ c c sJ |dk r|t j� }t| �} t| �}t| ��* tdd� | D ��}| | }t| t�}W dQ R X t|�}z�t||| fd�E dH x�|�r|dkr�d}n(|t j� }|dk r�t dt|�|f ��|j
j |� |j � |j
}g |_
|j
j� W dQ R X |j� t||| |fd�E dH q~W W dx,| D ]$}|j� |jj|� W dQ R X �q W X dS )an An iterator over the given futures that yields each as it completes.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
iterate over.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
Returns:
An iterator that yields the given Futures as they complete (finished or
cancelled). If any given Futures are duplicated, they will be returned
once.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Nc s s | ]}|j ttgkr|V qd S )N)r; r r
)r< r= r r r r> � s z as_completed.<locals>.<genexpr>)rI r z %d (of %d) futures unfinished)�time� monotonicr( �lenr0 rE r �listrJ r r �waitr& r �clear�reverser5 rA rG ) rB �timeout�end_timeZ
total_futuresr r rD Z wait_timeoutr= r r r � as_completed� s@
rT �DoneAndNotDoneFuturesz
done not_donec C s� t | ��� tdd� | D ��}t| �| }|tkr>|r>t||�S |tkrf|rftdd� |D ��rft||�S t|�t| �kr�t||�S t| |�}W dQ R X |jj |� x*| D ]"}|j
� |j j |� W dQ R X q�W |j
|j� t|t| �| �S )a Wait for the futures in the given sequence to complete.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
wait upon.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
return_when: Indicates when this function should return. The options
are:
FIRST_COMPLETED - Return when any future finishes or is
cancelled.
FIRST_EXCEPTION - Return when any future finishes by raising an
exception. If no future raises an exception
then it is equivalent to ALL_COMPLETED.
ALL_COMPLETED - Return when all futures finish or are cancelled.
Returns:
A named 2-tuple of sets. The first set, named 'done', contains the
futures that completed (is finished or cancelled) before the wait
completed. The second set, named 'not_done', contains uncompleted
futures.
c s s | ]}|j ttgkr|V qd S )N)r; r r
)r< r= r r r r> s zwait.<locals>.<genexpr>c s s( | ] }|j � r|j� d k r|V qd S )N)r
� exception)r< r= r r r r> $ s N)r0 r( r rU r �anyrM rE r rO r5 rA rG �updater )rB rR rC �doneZnot_donerD r= r r r rO s"
rO c @ s� e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z d dd�Z
d dd�Zdd� Zdd � Zd d � ZdS )!�Futurez5Represents the result of an asynchronous computation.c C s, t j� | _t| _d| _d| _g | _g | _dS )z8Initializes the future. Should not be called by clients.N) r Z Conditionr5 r r; �_result�
_exceptionrA �_done_callbacks)r r r r r 8 s
zFuture.__init__c C sB x<| j D ]2}y || � W q tk
r8 tjd| � Y qX qW d S )Nz!exception calling callback for %r)r] � Exception�LOGGERrV )r �callbackr r r �_invoke_callbacksA s
zFuture._invoke_callbacksc C s� | j �v | jtkr`| jr<d| jjt| �t| j | jjjf S d| jjt| �t| j | jjjf S d| jjt| �t| j f S Q R X d S )Nz <%s at %#x state=%s raised %s>z <%s at %#x state=%s returned %s>z<%s at %#x state=%s>) r5 r; r
r\ r' r r3 �_STATE_TO_DESCRIPTION_MAPr[ )r r r r �__repr__H s"
zFuture.__repr__c
C sR | j �: | jttgkrdS | jttgkr,dS t| _| j j� W dQ R X | j� dS )z�Cancel the future if possible.
Returns True if the future was cancelled, False otherwise. A future
cannot be cancelled if it is running or has already completed.
FTN)r5 r; r r
r r �
notify_allra )r r r r �cancel\ s z
Future.cancelc
C s | j � | jttgkS Q R X dS )z(Return True if the future was cancelled.N)r5 r; r r )r r r r r
o s zFuture.cancelledc C s | j � | jtkS Q R X dS )z1Return True if the future is currently executing.N)r5 r; r )r r r r r t s zFuture.runningc C s" | j � | jtttgkS Q R X dS )z>Return True of the future was cancelled or finished executing.N)r5 r; r r r
)r r r r rY y s z Future.donec C s | j r| j �n| jS d S )N)r\ r[ )r r r r Z __get_result~ s zFuture.__get_resultc C s> | j �& | jtttgkr(| jj|� dS W dQ R X || � dS )a% Attaches a callable that will be called when the future finishes.
Args:
fn: A callable that will be called with this future as its only
argument when the future completes or is cancelled. The callable
will always be called by a thread in the same process in which
it was added. If the future has already completed or been
cancelled then the callable will be called immediately. These
callables are called in the order that they were added.
N)r5 r; r r r
r] r )r �fnr r r �add_done_callback� s
zFuture.add_done_callbackNc
C sx | j �h | jttgkr t� �n| jtkr0| j� S | j j|� | jttgkrRt� �n| jtkrd| j� S t� �W dQ R X dS )aB Return the result of the call that the future represents.
Args:
timeout: The number of seconds to wait for the result if the future
isn't done. If None, then there is no limit on the wait time.
Returns:
The result of the call that the future represents.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
Exception: If the call raised then that exception will be raised.
N) r5 r; r r r r
�_Future__get_resultrO r )r rR r r r �result� s
z
Future.resultc
C st | j �d | jttgkr t� �n| jtkr.| jS | j j|� | jttgkrPt� �n| jtkr`| jS t� �W dQ R X dS )aU Return the exception raised by the call that the future represents.
Args:
timeout: The number of seconds to wait for the exception if the
future isn't done. If None, then there is no limit on the wait
time.
Returns:
The exception raised by the call that the future represents or None
if the call completed without raising.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
N) r5 r; r r r r
r\ rO r )r rR r r r rV � s
zFuture.exceptionc C st | j �d | jtkr6t| _x| jD ]}|j| � q W dS | jtkrJt| _dS tj dt
| �| j� t d��W dQ R X dS )a� Mark the future as running or process any cancel notifications.
Should only be used by Executor implementations and unit tests.
If the future has been cancelled (cancel() was called and returned
True) then any threads waiting on the future completing (though calls
to as_completed() or wait()) are notified and False is returned.
If the future was not cancelled then it is put in the running state
(future calls to running() will return True) and True is returned.
This method should be called by Executor implementations before
executing the work associated with this future. If this method returns
False then the work should not be executed.
Returns:
False if the Future was cancelled, True otherwise.
Raises:
RuntimeError: if this method was already called or if set_result()
or set_exception() was called.
FTz!Future %s in unexpected state: %szFuture in unexpected stateN) r5 r; r r rA r" r r r_ Zcriticalr3 � RuntimeError)r rD r r r � set_running_or_notify_cancel� s
z#Future.set_running_or_notify_cancelc
C sN | j �6 || _t| _x| jD ]}|j| � q W | j j� W dQ R X | j� dS )z�Sets the return value of work associated with the future.
Should only be used by Executor implementations and unit tests.
N)r5 r[ r
r; rA r rd ra )r ri rD r r r �
set_result� s zFuture.set_resultc
C sN | j �6 || _t| _x| jD ]}|j| � q W | j j� W dQ R X | j� dS )z�Sets the result of the future as being the given exception.
Should only be used by Executor implementations and unit tests.
N)r5 r\ r
r; rA r! rd ra )r rV rD r r r �
set_exception s zFuture.set_exception)N)N)r r r r r ra rc re r
r rY rh rg ri rV rk rl rm r r r r rZ 5 s
"(
rZ c @ sB e Zd ZdZdd� Zddd�dd�Zdd
d �Zd d
� Zdd� ZdS )�ExecutorzCThis is an abstract base class for concrete asynchronous executors.c O s
t � �dS )a Submits a callable to be executed with the given arguments.
Schedules the callable to be executed as fn(*args, **kwargs) and returns
a Future instance representing the execution of the callable.
Returns:
A Future representing the given call.
N)�NotImplementedError)r rf r9 �kwargsr r r �submit s zExecutor.submitNr. )rR � chunksizec sB �dk r�t j� � ��fdd�t|� D ��� ��fdd�}|� S )a} Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: The size of the chunks the iterable will be broken into
before being passed to a child process. This argument is only
used by ProcessPoolExecutor; it is ignored by
ThreadPoolExecutor.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
Nc s g | ]}�j � f|�� �qS r )rq )r< r9 )rf r r r �
<listcomp>? s z Executor.map.<locals>.<listcomp>c 3 sd zF�j � x8�rB�d kr(�j� j� V q �j� j� tj� �V q W W d x�D ] } | j� qNW X d S )N)rQ rH ri rK rL re )r )rS rB rR r r �result_iteratorC s
z%Executor.map.<locals>.result_iterator)rK rL �zip)r rf rR rr � iterablesrt r )rS rf rB r rR r �map& s
z Executor.mapTc C s dS )a� Clean-up the resources associated with the Executor.
It is safe to call this method several times. Otherwise, no other
methods can be called after this one.
Args:
wait: If True then shutdown will not return until all running
futures have finished executing and the resources used by the
executor have been reclaimed.
Nr )r rO r r r �shutdownR s zExecutor.shutdownc C s | S )Nr )r r r r r7 _ s zExecutor.__enter__c C s | j dd� dS )NT)rO F)rx )r �exc_typeZexc_valZexc_tbr r r r: b s zExecutor.__exit__)T) r r r r rq rw rx r7 r: r r r r rn s ,
rn )N)$�
__author__� collectionsZloggingr rK r r r r r r r r r
Z_FUTURE_STATESrb Z getLoggerr_ r^ r r r �objectr r# r* r+ r0 rE rJ rT �
namedtuplerU rO rZ rn r r r r �<module> sR
>1 dPK w}�\�I}��2 �2 . futures/__pycache__/_base.cpython-36.opt-2.pycnu �[��� 3
\�R �
@ sP d Z ddlZddlZddlZddlZdZdZdZdZdZ dZ
d Z d
Z d Z
e e
e e e
gZe d e
d
e de de
diZejd�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd � d e�ZG d d � d e�ZG d d � d e�Zd!d"� Z d#d$� Z d/d%d&�Z ej d'd(�Z defd)d*�Z!G d+d,� d,e�Z"G d-d.� d.e�Z#dS )0z"Brian Quinlan (brian@sweetapp.com)� N�FIRST_COMPLETED�FIRST_EXCEPTION�
ALL_COMPLETED�
_AS_COMPLETED�PENDING�RUNNING� CANCELLED�CANCELLED_AND_NOTIFIED�FINISHED�pending�running� cancelled�finishedzconcurrent.futuresc @ s e Zd ZdS )�ErrorN)�__name__�
__module__� __qualname__� r r �0/usr/lib64/python3.6/concurrent/futures/_base.pyr , s r c @ s e Zd ZdS )�CancelledErrorN)r r r r r r r r 0 s r c @ s e Zd ZdS )� TimeoutErrorN)r r r r r r r r 4 s r c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�_Waiterc C s t j� | _g | _d S )N)� threadingZEvent�event�finished_futures)�selfr r r �__init__: s
z_Waiter.__init__c C s | j j|� d S )N)r �append)r �futurer r r �
add_result> s z_Waiter.add_resultc C s | j j|� d S )N)r r )r r r r r �
add_exceptionA s z_Waiter.add_exceptionc C s | j j|� d S )N)r r )r r r r r �
add_cancelledD s z_Waiter.add_cancelledN)r r r r r r r! r r r r r 8 s r c s@ e Zd Z� fdd�Z� fdd�Z� fdd�Z� fdd�Z� ZS ) �_AsCompletedWaiterc s t t| �j� tj� | _d S )N)�superr" r r �Lock�lock)r )� __class__r r r J s z_AsCompletedWaiter.__init__c
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r% r# r" r r �set)r r )r& r r r N s z _AsCompletedWaiter.add_resultc
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r% r# r" r r r' )r r )r& r r r S s z _AsCompletedWaiter.add_exceptionc
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r% r# r" r! r r' )r r )r& r r r! X s z _AsCompletedWaiter.add_cancelled)r r r r r r r! �
__classcell__r r )r& r r" G s r" c s4 e Zd Z� fdd�Z� fdd�Z� fdd�Z� ZS )�_FirstCompletedWaiterc s t � j|� | jj� d S )N)r# r r r' )r r )r& r r r ` s z _FirstCompletedWaiter.add_resultc s t � j|� | jj� d S )N)r# r r r' )r r )r& r r r d s z#_FirstCompletedWaiter.add_exceptionc s t � j|� | jj� d S )N)r# r! r r' )r r )r& r r r! h s z#_FirstCompletedWaiter.add_cancelled)r r r r r r! r( r r )r& r r) ] s r) c sH e Zd Z� fdd�Zdd� Z� fdd�Z� fdd�Z� fd d
�Z� ZS ) �_AllCompletedWaiterc s$ || _ || _tj� | _t� j� d S )N)�num_pending_calls�stop_on_exceptionr r$ r% r# r )r r+ r, )r& r r r o s
z _AllCompletedWaiter.__init__c
C s4 | j �$ | jd8 _| js&| jj� W d Q R X d S )N� )r% r+ r r' )r r r r �_decrement_pending_callsu s z,_AllCompletedWaiter._decrement_pending_callsc s t � j|� | j� d S )N)r# r r. )r r )r& r r r { s z _AllCompletedWaiter.add_resultc s* t � j|� | jr | jj� n| j� d S )N)r# r r, r r' r. )r r )r& r r r s z!_AllCompletedWaiter.add_exceptionc s t � j|� | j� d S )N)r# r! r. )r r )r& r r r! � s z!_AllCompletedWaiter.add_cancelled) r r r r r. r r r! r( r r )r& r r* l s
r* c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )�_AcquireFuturesc C s t |td�| _d S )N)�key)�sorted�id�futures)r r3 r r r r � s z_AcquireFutures.__init__c C s x| j D ]}|jj� qW d S )N)r3 �
_condition�acquire)r r r r r � __enter__� s z_AcquireFutures.__enter__c G s x| j D ]}|jj� qW d S )N)r3 r4 �release)r �argsr r r r �__exit__� s z_AcquireFutures.__exit__N)r r r r r6 r9 r r r r r/ � s r/ c C s� |t krt� }nZ|tkr t� }nJtdd� | D ��}|tkrHt|dd�}n"|tkr^t|dd�}n td| ��x| D ]}|j j
|� qpW |S )Nc s s | ]}|j ttgkV qd S )N)�_stater r
)�.0�fr r r � <genexpr>� s z._create_and_install_waiters.<locals>.<genexpr>T)r, Fz Invalid return condition: %r) r r" r r) �sumr r* r �
ValueError�_waitersr )�fs� return_when�waiterZ
pending_countr< r r r �_create_and_install_waiters� s
rD c c sX xR| rR| d }x|D ]}|j |� qW |j� |jj |� W d Q R X ~| j� V qW d S )Nr- ���)�remover4 r@ �pop)rA rC � ref_collectr< Z futures_setr r r �_yield_finished_futures� s
rI c c sJ |d k r|t j� }t| �} t| �}t| ��* tdd� | D ��}| | }t| t�}W d Q R X t|�}z�t||| fd�E d H x�|�r|d kr�d }n(|t j� }|dk r�t dt|�|f ��|j
j |� |j � |j
}g |_
|j
j� W d Q R X |j� t||| |fd�E d H q~W W d x,| D ]$}|j� |jj|� W d Q R X �q W X d S )Nc s s | ]}|j ttgkr|V qd S )N)r: r r
)r; r< r r r r= � s z as_completed.<locals>.<genexpr>)rH r z %d (of %d) futures unfinished)�time� monotonicr' �lenr/ rD r �listrI r r �waitr% r �clear�reverser4 r@ rF ) rA �timeout�end_timeZ
total_futuresr r rC Z wait_timeoutr< r r r � as_completed� s@
rS �DoneAndNotDoneFuturesz
done not_donec C s� t | ��� tdd� | D ��}t| �| }|tkr>|r>t||�S |tkrf|rftdd� |D ��rft||�S t|�t| �kr�t||�S t| |�}W d Q R X |jj |� x*| D ]"}|j
� |j j |� W d Q R X q�W |j
|j� t|t| �| �S )Nc s s | ]}|j ttgkr|V qd S )N)r: r r
)r; r< r r r r= s zwait.<locals>.<genexpr>c s s( | ] }|j � r|j� d k r|V qd S )N)r
� exception)r; r< r r r r= $ s )r/ r' r rT r �anyrL rD r rN r4 r@ rF �updater )rA rQ rB �doneZnot_donerC r< r r r rN s"
rN c @ s� e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z d dd�Z d dd�Z
dd� Zdd� Zd d � ZdS ) �Futurec C s, t j� | _t| _d | _d | _g | _g | _d S )N) r Z Conditionr4 r r: �_result�
_exceptionr@ �_done_callbacks)r r r r r 8 s
zFuture.__init__c C sB x<| j D ]2}y || � W q tk
r8 tjd| � Y qX qW d S )Nz!exception calling callback for %r)r\ � Exception�LOGGERrU )r �callbackr r r �_invoke_callbacksA s
zFuture._invoke_callbacksc C s� | j �v | jtkr`| jr<d| jjt| �t| j | jjjf S d| jjt| �t| j | jjjf S d| jjt| �t| j f S Q R X d S )Nz <%s at %#x state=%s raised %s>z <%s at %#x state=%s returned %s>z<%s at %#x state=%s>) r4 r: r
r[ r& r r2 �_STATE_TO_DESCRIPTION_MAPrZ )r r r r �__repr__H s"
zFuture.__repr__c
C sR | j �: | jttgkrdS | jttgkr,dS t| _| j j� W d Q R X | j� dS )NFT)r4 r: r r
r r �
notify_allr` )r r r r �cancel\ s z
Future.cancelc
C s | j � | jttgkS Q R X d S )N)r4 r: r r )r r r r r
o s zFuture.cancelledc C s | j � | jtkS Q R X d S )N)r4 r: r )r r r r r t s zFuture.runningc C s" | j � | jtttgkS Q R X d S )N)r4 r: r r r
)r r r r rX y s z Future.donec C s | j r| j �n| jS d S )N)r[ rZ )r r r r Z __get_result~ s zFuture.__get_resultc C s> | j �& | jtttgkr(| jj|� d S W d Q R X || � d S )N)r4 r: r r r
r\ r )r �fnr r r �add_done_callback� s
zFuture.add_done_callbackNc
C sx | j �h | jttgkr t� �n| jtkr0| j� S | j j|� | jttgkrRt� �n| jtkrd| j� S t� �W d Q R X d S )N) r4 r: r r r r
�_Future__get_resultrN r )r rQ r r r �result� s
z
Future.resultc
C st | j �d | jttgkr t� �n| jtkr.| jS | j j|� | jttgkrPt� �n| jtkr`| jS t� �W d Q R X d S )N) r4 r: r r r r
r[ rN r )r rQ r r r rU � s
zFuture.exceptionc C st | j �d | jtkr6t| _x| jD ]}|j| � q W dS | jtkrJt| _dS tj dt
| �| j� t d��W d Q R X d S )NFTz!Future %s in unexpected state: %szFuture in unexpected state) r4 r: r r r@ r! r r r^ Zcriticalr2 � RuntimeError)r rC r r r � set_running_or_notify_cancel� s
z#Future.set_running_or_notify_cancelc
C sN | j �6 || _t| _x| jD ]}|j| � q W | j j� W d Q R X | j� d S )N)r4 rZ r
r: r@ r rc r` )r rh rC r r r �
set_result� s zFuture.set_resultc
C sN | j �6 || _t| _x| jD ]}|j| � q W | j j� W d Q R X | j� d S )N)r4 r[ r
r: r@ r rc r` )r rU rC r r r �
set_exception s zFuture.set_exception)N)N)r r r r r` rb rd r
r rX rg rf rh rU rj rk rl r r r r rY 5 s
"(
rY c @ s> e Zd Zdd� Zddd�dd�Zdd d
�Zd d � Zd
d� ZdS )�Executorc O s
t � �d S )N)�NotImplementedError)r re r8 �kwargsr r r �submit s zExecutor.submitNr- )rQ � chunksizec sB �d k r�t j� � ��fdd�t|� D ��� ��fdd�}|� S )Nc s g | ]}�j � f|�� �qS r )rp )r; r8 )re r r r �
<listcomp>? s z Executor.map.<locals>.<listcomp>c 3 sd zF�j � x8�rB�d kr(�j� j� V q �j� j� tj� �V q W W d x�D ] } | j� qNW X d S )N)rP rG rh rJ rK rd )r )rR rA rQ r r �result_iteratorC s
z%Executor.map.<locals>.result_iterator)rJ rK �zip)r re rQ rq � iterablesrs r )rR re rA r rQ r �map& s
z Executor.mapTc C s d S )Nr )r rN r r r �shutdownR s zExecutor.shutdownc C s | S )Nr )r r r r r6 _ s zExecutor.__enter__c C s | j dd� dS )NT)rN F)rw )r �exc_typeZexc_valZexc_tbr r r r9 b s zExecutor.__exit__)T)r r r rp rv rw r6 r9 r r r r rm s
,
rm )N)$�
__author__� collectionsZloggingr rJ r r r r r r r r r
Z_FUTURE_STATESra Z getLoggerr^ r] r r r �objectr r" r) r* r/ rD rI rS �
namedtuplerT rN rY rm r r r r �<module> sR
>1 dPK w}�\GꂚP �P ( futures/__pycache__/_base.cpython-36.pycnu �[��� 3
\�R �
@ sP d Z ddlZddlZddlZddlZdZdZdZdZdZ dZ
d Z d
Z d Z
e e
e e e
gZe d e
d
e de de
diZejd�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd � d e�ZG d d � d e�ZG d d � d e�Zd!d"� Z d#d$� Z d/d%d&�Z ej d'd(�Z defd)d*�Z!G d+d,� d,e�Z"G d-d.� d.e�Z#dS )0z"Brian Quinlan (brian@sweetapp.com)� N�FIRST_COMPLETED�FIRST_EXCEPTION�
ALL_COMPLETED�
_AS_COMPLETED�PENDING�RUNNING� CANCELLED�CANCELLED_AND_NOTIFIED�FINISHED�pending�running� cancelled�finishedzconcurrent.futuresc @ s e Zd ZdZdS )�Errorz-Base class for all future-related exceptions.N)�__name__�
__module__� __qualname__�__doc__� r r �0/usr/lib64/python3.6/concurrent/futures/_base.pyr , s r c @ s e Zd ZdZdS )�CancelledErrorzThe Future was cancelled.N)r r r r r r r r r 0 s r c @ s e Zd ZdZdS )� TimeoutErrorz*The operation exceeded the given deadline.N)r r r r r r r r r 4 s r c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �_Waiterz;Provides the event that wait() and as_completed() block on.c C s t j� | _g | _d S )N)� threadingZEvent�event�finished_futures)�selfr r r �__init__: s
z_Waiter.__init__c C s | j j|� d S )N)r �append)r �futurer r r �
add_result> s z_Waiter.add_resultc C s | j j|� d S )N)r r )r r r r r �
add_exceptionA s z_Waiter.add_exceptionc C s | j j|� d S )N)r r )r r r r r �
add_cancelledD s z_Waiter.add_cancelledN)r r r r r r r! r" r r r r r 8 s
r c sD e Zd ZdZ� fdd�Z� fdd�Z� fdd�Z� fdd �Z� ZS )
�_AsCompletedWaiterzUsed by as_completed().c s t t| �j� tj� | _d S )N)�superr# r r �Lock�lock)r )� __class__r r r J s z_AsCompletedWaiter.__init__c
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r& r$ r# r r �set)r r )r' r r r N s z _AsCompletedWaiter.add_resultc
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r& r$ r# r! r r( )r r )r' r r r! S s z _AsCompletedWaiter.add_exceptionc
s0 | j � tt| �j|� | jj� W d Q R X d S )N)r& r$ r# r" r r( )r r )r' r r r" X s z _AsCompletedWaiter.add_cancelled) r r r r r r r! r" �
__classcell__r r )r' r r# G s
r# c s8 e Zd ZdZ� fdd�Z� fdd�Z� fdd�Z� ZS )�_FirstCompletedWaiterz*Used by wait(return_when=FIRST_COMPLETED).c s t � j|� | jj� d S )N)r$ r r r( )r r )r' r r r ` s z _FirstCompletedWaiter.add_resultc s t � j|� | jj� d S )N)r$ r! r r( )r r )r' r r r! d s z#_FirstCompletedWaiter.add_exceptionc s t � j|� | jj� d S )N)r$ r" r r( )r r )r' r r r" h s z#_FirstCompletedWaiter.add_cancelled)r r r r r r! r" r) r r )r' r r* ] s r* c sL e Zd ZdZ� fdd�Zdd� Z� fdd�Z� fdd �Z� fd
d �Z� Z S ) �_AllCompletedWaiterz<Used by wait(return_when=FIRST_EXCEPTION and ALL_COMPLETED).c s$ || _ || _tj� | _t� j� d S )N)�num_pending_calls�stop_on_exceptionr r% r& r$ r )r r, r- )r' r r r o s
z _AllCompletedWaiter.__init__c
C s4 | j �$ | jd8 _| js&| jj� W d Q R X d S )N� )r& r, r r( )r r r r �_decrement_pending_callsu s z,_AllCompletedWaiter._decrement_pending_callsc s t � j|� | j� d S )N)r$ r r/ )r r )r' r r r { s z _AllCompletedWaiter.add_resultc s* t � j|� | jr | jj� n| j� d S )N)r$ r! r- r r( r/ )r r )r' r r r! s z!_AllCompletedWaiter.add_exceptionc s t � j|� | j� d S )N)r$ r" r/ )r r )r' r r r" � s z!_AllCompletedWaiter.add_cancelled)
r r r r r r/ r r! r" r) r r )r' r r+ l s r+ c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �_AcquireFutureszDA context manager that does an ordered acquire of Future conditions.c C s t |td�| _d S )N)�key)�sorted�id�futures)r r4 r r r r � s z_AcquireFutures.__init__c C s x| j D ]}|jj� qW d S )N)r4 �
_condition�acquire)r r r r r � __enter__� s z_AcquireFutures.__enter__c G s x| j D ]}|jj� qW d S )N)r4 r5 �release)r �argsr r r r �__exit__� s z_AcquireFutures.__exit__N)r r r r r r7 r: r r r r r0 � s r0 c C s� |t krt� }nZ|tkr t� }nJtdd� | D ��}|tkrHt|dd�}n"|tkr^t|dd�}n td| ��x| D ]}|j j
|� qpW |S )Nc s s | ]}|j ttgkV qd S )N)�_stater r
)�.0�fr r r � <genexpr>� s z._create_and_install_waiters.<locals>.<genexpr>T)r- Fz Invalid return condition: %r) r r# r r* �sumr r+ r �
ValueError�_waitersr )�fs� return_when�waiterZ
pending_countr= r r r �_create_and_install_waiters� s
rE c c sX xR| rR| d }x|D ]}|j |� qW |j� |jj |� W dQ R X ~| j� V qW dS )a~
Iterate on the list *fs*, yielding finished futures one by one in
reverse order.
Before yielding a future, *waiter* is removed from its waiters
and the future is removed from each set in the collection of sets
*ref_collect*.
The aim of this function is to avoid keeping stale references after
the future is yielded and before the iterator resumes.
r. N���)�remover5 rA �pop)rB rD � ref_collectr= Z futures_setr r r �_yield_finished_futures� s
rJ c c sJ |dk r|t j� }t| �} t| �}t| ��* tdd� | D ��}| | }t| t�}W dQ R X t|�}z�t||| fd�E dH x�|�r|dkr�d}n(|t j� }|dk r�t dt|�|f ��|j
j |� |j � |j
}g |_
|j
j� W dQ R X |j� t||| |fd�E dH q~W W dx,| D ]$}|j� |jj|� W dQ R X �q W X dS )an An iterator over the given futures that yields each as it completes.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
iterate over.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
Returns:
An iterator that yields the given Futures as they complete (finished or
cancelled). If any given Futures are duplicated, they will be returned
once.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Nc s s | ]}|j ttgkr|V qd S )N)r; r r
)r< r= r r r r> � s z as_completed.<locals>.<genexpr>)rI r z %d (of %d) futures unfinished)�time� monotonicr( �lenr0 rE r �listrJ r r �waitr& r �clear�reverser5 rA rG ) rB �timeout�end_timeZ
total_futuresr r rD Z wait_timeoutr= r r r � as_completed� s@
rT �DoneAndNotDoneFuturesz
done not_donec C s� t | ��� tdd� | D ��}t| �| }|tkr>|r>t||�S |tkrf|rftdd� |D ��rft||�S t|�t| �kr�t||�S t| |�}W dQ R X |jj |� x*| D ]"}|j
� |j j |� W dQ R X q�W |j
|j� t|t| �| �S )a Wait for the futures in the given sequence to complete.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
wait upon.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
return_when: Indicates when this function should return. The options
are:
FIRST_COMPLETED - Return when any future finishes or is
cancelled.
FIRST_EXCEPTION - Return when any future finishes by raising an
exception. If no future raises an exception
then it is equivalent to ALL_COMPLETED.
ALL_COMPLETED - Return when all futures finish or are cancelled.
Returns:
A named 2-tuple of sets. The first set, named 'done', contains the
futures that completed (is finished or cancelled) before the wait
completed. The second set, named 'not_done', contains uncompleted
futures.
c s s | ]}|j ttgkr|V qd S )N)r; r r
)r< r= r r r r> s zwait.<locals>.<genexpr>c s s( | ] }|j � r|j� d k r|V qd S )N)r
� exception)r< r= r r r r> $ s N)r0 r( r rU r �anyrM rE r rO r5 rA rG �updater )rB rR rC �doneZnot_donerD r= r r r rO s"
rO c @ s� e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z d dd�Z
d dd�Zdd� Zdd � Zd d � ZdS )!�Futurez5Represents the result of an asynchronous computation.c C s, t j� | _t| _d| _d| _g | _g | _dS )z8Initializes the future. Should not be called by clients.N) r Z Conditionr5 r r; �_result�
_exceptionrA �_done_callbacks)r r r r r 8 s
zFuture.__init__c C sB x<| j D ]2}y || � W q tk
r8 tjd| � Y qX qW d S )Nz!exception calling callback for %r)r] � Exception�LOGGERrV )r �callbackr r r �_invoke_callbacksA s
zFuture._invoke_callbacksc C s� | j �v | jtkr`| jr<d| jjt| �t| j | jjjf S d| jjt| �t| j | jjjf S d| jjt| �t| j f S Q R X d S )Nz <%s at %#x state=%s raised %s>z <%s at %#x state=%s returned %s>z<%s at %#x state=%s>) r5 r; r
r\ r' r r3 �_STATE_TO_DESCRIPTION_MAPr[ )r r r r �__repr__H s"
zFuture.__repr__c
C sR | j �: | jttgkrdS | jttgkr,dS t| _| j j� W dQ R X | j� dS )z�Cancel the future if possible.
Returns True if the future was cancelled, False otherwise. A future
cannot be cancelled if it is running or has already completed.
FTN)r5 r; r r
r r �
notify_allra )r r r r �cancel\ s z
Future.cancelc
C s | j � | jttgkS Q R X dS )z(Return True if the future was cancelled.N)r5 r; r r )r r r r r
o s zFuture.cancelledc C s | j � | jtkS Q R X dS )z1Return True if the future is currently executing.N)r5 r; r )r r r r r t s zFuture.runningc C s" | j � | jtttgkS Q R X dS )z>Return True of the future was cancelled or finished executing.N)r5 r; r r r
)r r r r rY y s z Future.donec C s | j r| j �n| jS d S )N)r\ r[ )r r r r Z __get_result~ s zFuture.__get_resultc C s> | j �& | jtttgkr(| jj|� dS W dQ R X || � dS )a% Attaches a callable that will be called when the future finishes.
Args:
fn: A callable that will be called with this future as its only
argument when the future completes or is cancelled. The callable
will always be called by a thread in the same process in which
it was added. If the future has already completed or been
cancelled then the callable will be called immediately. These
callables are called in the order that they were added.
N)r5 r; r r r
r] r )r �fnr r r �add_done_callback� s
zFuture.add_done_callbackNc
C sx | j �h | jttgkr t� �n| jtkr0| j� S | j j|� | jttgkrRt� �n| jtkrd| j� S t� �W dQ R X dS )aB Return the result of the call that the future represents.
Args:
timeout: The number of seconds to wait for the result if the future
isn't done. If None, then there is no limit on the wait time.
Returns:
The result of the call that the future represents.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
Exception: If the call raised then that exception will be raised.
N) r5 r; r r r r
�_Future__get_resultrO r )r rR r r r �result� s
z
Future.resultc
C st | j �d | jttgkr t� �n| jtkr.| jS | j j|� | jttgkrPt� �n| jtkr`| jS t� �W dQ R X dS )aU Return the exception raised by the call that the future represents.
Args:
timeout: The number of seconds to wait for the exception if the
future isn't done. If None, then there is no limit on the wait
time.
Returns:
The exception raised by the call that the future represents or None
if the call completed without raising.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
N) r5 r; r r r r
r\ rO r )r rR r r r rV � s
zFuture.exceptionc C st | j �d | jtkr6t| _x| jD ]}|j| � q W dS | jtkrJt| _dS tj dt
| �| j� t d��W dQ R X dS )a� Mark the future as running or process any cancel notifications.
Should only be used by Executor implementations and unit tests.
If the future has been cancelled (cancel() was called and returned
True) then any threads waiting on the future completing (though calls
to as_completed() or wait()) are notified and False is returned.
If the future was not cancelled then it is put in the running state
(future calls to running() will return True) and True is returned.
This method should be called by Executor implementations before
executing the work associated with this future. If this method returns
False then the work should not be executed.
Returns:
False if the Future was cancelled, True otherwise.
Raises:
RuntimeError: if this method was already called or if set_result()
or set_exception() was called.
FTz!Future %s in unexpected state: %szFuture in unexpected stateN) r5 r; r r rA r" r r r_ Zcriticalr3 � RuntimeError)r rD r r r � set_running_or_notify_cancel� s
z#Future.set_running_or_notify_cancelc
C sN | j �6 || _t| _x| jD ]}|j| � q W | j j� W dQ R X | j� dS )z�Sets the return value of work associated with the future.
Should only be used by Executor implementations and unit tests.
N)r5 r[ r
r; rA r rd ra )r ri rD r r r �
set_result� s zFuture.set_resultc
C sN | j �6 || _t| _x| jD ]}|j| � q W | j j� W dQ R X | j� dS )z�Sets the result of the future as being the given exception.
Should only be used by Executor implementations and unit tests.
N)r5 r\ r
r; rA r! rd ra )r rV rD r r r �
set_exception s zFuture.set_exception)N)N)r r r r r ra rc re r
r rY rh rg ri rV rk rl rm r r r r rZ 5 s
"(
rZ c @ sB e Zd ZdZdd� Zddd�dd�Zdd
d �Zd d
� Zdd� ZdS )�ExecutorzCThis is an abstract base class for concrete asynchronous executors.c O s
t � �dS )a Submits a callable to be executed with the given arguments.
Schedules the callable to be executed as fn(*args, **kwargs) and returns
a Future instance representing the execution of the callable.
Returns:
A Future representing the given call.
N)�NotImplementedError)r rf r9 �kwargsr r r �submit s zExecutor.submitNr. )rR � chunksizec sB �dk r�t j� � ��fdd�t|� D ��� ��fdd�}|� S )a} Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: The size of the chunks the iterable will be broken into
before being passed to a child process. This argument is only
used by ProcessPoolExecutor; it is ignored by
ThreadPoolExecutor.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
Nc s g | ]}�j � f|�� �qS r )rq )r< r9 )rf r r r �
<listcomp>? s z Executor.map.<locals>.<listcomp>c 3 sd zF�j � x8�rB�d kr(�j� j� V q �j� j� tj� �V q W W d x�D ] } | j� qNW X d S )N)rQ rH ri rK rL re )r )rS rB rR r r �result_iteratorC s
z%Executor.map.<locals>.result_iterator)rK rL �zip)r rf rR rr � iterablesrt r )rS rf rB r rR r �map& s
z Executor.mapTc C s dS )a� Clean-up the resources associated with the Executor.
It is safe to call this method several times. Otherwise, no other
methods can be called after this one.
Args:
wait: If True then shutdown will not return until all running
futures have finished executing and the resources used by the
executor have been reclaimed.
Nr )r rO r r r �shutdownR s zExecutor.shutdownc C s | S )Nr )r r r r r7 _ s zExecutor.__enter__c C s | j dd� dS )NT)rO F)rx )r �exc_typeZexc_valZexc_tbr r r r: b s zExecutor.__exit__)T) r r r r rq rw rx r7 r: r r r r rn s ,
rn )N)$�
__author__� collectionsZloggingr rK r r r r r r r r r
Z_FUTURE_STATESrb Z getLoggerr_ r^ r r r �objectr r# r* r+ r0 rE rJ rT �
namedtuplerU rO rZ rn r r r r �<module> sR
>1 dPK w}�\ >۱= �= 0 futures/__pycache__/process.cpython-36.opt-1.pycnu �[��� 3
\ P � @ sb d Z dZddlZddlZddlmZ ddlZddlmZ ddlZddlm Z ddl
m Z ddl Z ddl
Z
ddlmZ ddlZddlZe
j� Zd ad
d � Zd ZG d
d� de�ZG dd� d�Zdd� ZG dd� de�Z G dd� de�Z G dd� de�Z dd� Z dd � Z d d � Z!d d � Z"d!d"� Z#d a$da%d#d$� Z&d%d&� Z'G d'd(� d(e(�Z)G d)d*� d*ej*�Z+ej,e� dS )+a* Implements ProcessPoolExecutor.
The follow diagram and text describe the data-flow through the system:
|======================= In-process =====================|== Out-of-process ==|
+----------+ +----------+ +--------+ +-----------+ +---------+
| | => | Work Ids | => | | => | Call Q | => | |
| | +----------+ | | +-----------+ | |
| | | ... | | | | ... | | |
| | | 6 | | | | 5, call() | | |
| | | 7 | | | | ... | | |
| Process | | ... | | Local | +-----------+ | Process |
| Pool | +----------+ | Worker | | #1..n |
| Executor | | Thread | | |
| | +----------- + | | +-----------+ | |
| | <=> | Work Items | <=> | | <= | Result Q | <= | |
| | +------------+ | | +-----------+ | |
| | | 6: call() | | | | ... | | |
| | | future | | | | 4, result | | |
| | | ... | | | | 3, except | | |
+----------+ +------------+ +--------+ +-----------+ +---------+
Executor.submit() called:
- creates a uniquely numbered _WorkItem and adds it to the "Work Items" dict
- adds the id of the _WorkItem to the "Work Ids" queue
Local worker thread:
- reads work ids from the "Work Ids" queue and looks up the corresponding
WorkItem from the "Work Items" dict: if the work item has been cancelled then
it is simply removed from the dict, otherwise it is repackaged as a
_CallItem and put in the "Call Q". New _CallItems are put in the "Call Q"
until "Call Q" is full. NOTE: the size of the "Call Q" is kept small because
calls placed in the "Call Q" can no longer be cancelled with Future.cancel().
- reads _ResultItems from "Result Q", updates the future stored in the
"Work Items" dict and deletes the dict entry
Process #1..n:
- reads _CallItems from "Call Q", executes the calls, and puts the resulting
_ResultItems in "Result Q"
z"Brian Quinlan (brian@sweetapp.com)� N)�_base)�Full)� SimpleQueue)�wait)�partialFc C sJ da ttj� �} x| D ]\}}|jd � qW x| D ]\}}|j� q2W d S )NT)� _shutdown�list�_threads_queues�items�put�join)r
�t�q� r �2/usr/lib64/python3.6/concurrent/futures/process.py� _python_exitO s r � c @ s e Zd Zdd� Zdd� ZdS )�_RemoteTracebackc C s
|| _ d S )N)�tb)�selfr r r r �__init__a s z_RemoteTraceback.__init__c C s | j S )N)r )r r r r �__str__c s z_RemoteTraceback.__str__N)�__name__�
__module__� __qualname__r r r r r r r ` s r c @ s e Zd Zdd� Zdd� ZdS )�_ExceptionWithTracebackc C s0 t jt|�||�}dj|�}|| _d| | _d S )N� z
"""
%s""")� traceback�format_exception�typer �excr )r r r r r r r g s
z _ExceptionWithTraceback.__init__c C s t | j| jffS )N)� _rebuild_excr r )r r r r �
__reduce__l s z"_ExceptionWithTraceback.__reduce__N)r r r r r" r r r r r f s r c C s t |�| _| S )N)r � __cause__)r r r r r r! o s
r! c @ s e Zd Zdd� ZdS )� _WorkItemc C s || _ || _|| _|| _d S )N)�future�fn�args�kwargs)r r% r& r' r( r r r r t s z_WorkItem.__init__N)r r r r r r r r r$ s s r$ c @ s e Zd Zddd�ZdS )� _ResultItemNc C s || _ || _|| _d S )N)�work_id� exception�result)r r* r+ r, r r r r { s z_ResultItem.__init__)NN)r r r r r r r r r) z s r) c @ s e Zd Zdd� ZdS )� _CallItemc C s || _ || _|| _|| _d S )N)r* r& r' r( )r r* r& r' r( r r r r � s z_CallItem.__init__N)r r r r r r r r r- � s r- c g s0 t |� }x"ttj|| ��}|s"dS |V q
W dS )z, Iterates over zip()ed iterables in chunks. N)�zip�tuple� itertools�islice)� chunksize� iterables�it�chunkr r r � _get_chunks� s r6 c s � fdd�|D �S )z� Processes a chunk of an iterable passed to map.
Runs the function passed to map() on a chunk of the
iterable passed to map.
This function is run in a separate process.
c s g | ] }� |� �qS r r )�.0r' )r& r r �
<listcomp>� s z"_process_chunk.<locals>.<listcomp>r )r& r5 r )r& r �_process_chunk� s r9 c C s� x�| j dd�}|dkr(|jtj� � dS y|j|j|j�}W nB tk
r~ } z&t||j �}|jt
|j |d�� W Y dd}~X qX |jt
|j |d�� qW dS )a� Evaluates calls from call_queue and places the results in result_queue.
This worker is run in a separate process.
Args:
call_queue: A multiprocessing.Queue of _CallItems that will be read and
evaluated by the worker.
result_queue: A multiprocessing.Queue of _ResultItems that will written
to by the worker.
shutdown: A multiprocessing.Event that will be set as a signal to the
worker that it should exit when call_queue is empty.
T)�blockN)r+ )r, ) �getr �os�getpidr& r' r( �
BaseExceptionr �
__traceback__r) r* )�
call_queue� result_queueZ call_item�r�er r r r �_process_worker� s
&
rD c C sx xr|j � rdS y|jdd�}W n tjk
r4 dS X | | }|jj� rh|jt||j|j |j
�dd� q| |= qqW dS )aM Fills call_queue with _WorkItems from pending_work_items.
This function never blocks.
Args:
pending_work_items: A dict mapping work ids to _WorkItems e.g.
{5: <_WorkItem...>, 6: <_WorkItem...>, ...}
work_ids: A queue.Queue of work ids e.g. Queue([5, 6, ...]). Work ids
are consumed and the corresponding _WorkItems from
pending_work_items are transformed into _CallItems and put in
call_queue.
call_queue: A multiprocessing.Queue that will be filled with _CallItems
derived from _WorkItems.
NF)r: T) Zfullr; �queueZEmptyr% Z set_running_or_notify_cancelr r- r& r' r( )�pending_work_itemsZwork_idsr@ r* � work_itemr r r �_add_call_item_to_queue� s
rH c s� d��fdd�}� �fdd�}|j }�xlt||� � dd� �j� D �} t|g| �}
||
krf|j� } nr| � ��dk r�d�_d�_d�x&|j� D ]\} }
|
jj t
d �� ~
q�W |j � x�j� D ] }|j � q�W |� dS t
| t��r�j| �}|j� ��sR|� dS nJ| dk �rR|j| jd�}
|
dk �rR| j�rB|
jj | j� n|
jj| j� ~
| � �|� �r�y|�sr|� dS W n tk
�r� Y nX d�q(W dS )
a� Manages the communication between this process and the worker processes.
This function is run in a local thread.
Args:
executor_reference: A weakref.ref to the ProcessPoolExecutor that owns
this thread. Used to determine if the ProcessPoolExecutor has been
garbage collected and that this function can exit.
process: A list of the multiprocessing.Process instances used as
workers.
pending_work_items: A dict mapping work ids to _WorkItems e.g.
{5: <_WorkItem...>, 6: <_WorkItem...>, ...}
work_ids_queue: A queue.Queue of work ids e.g. Queue([5, 6, ...]).
call_queue: A multiprocessing.Queue that will be filled with _CallItems
derived from _WorkItems for processing by the process workers.
result_queue: A multiprocessing.Queue of _ResultItems generated by the
process workers.
Nc s t p� d kp� jS )N)r �_shutdown_threadr )�executorr r �
shutting_down� s z/_queue_management_worker.<locals>.shutting_downc sZ t dd� �j� D ��} x td| �D ]}� jd � q"W � j� x�j� D ] }|j� qFW d S )Nc s s | ]}|j � V qd S )N)Zis_alive)r7 �pr r r � <genexpr>� s zD_queue_management_worker.<locals>.shutdown_worker.<locals>.<genexpr>r )�sum�values�rangeZ
put_nowait�closer )Znb_children_alive�irL )r@ � processesr r �shutdown_worker� s z1_queue_management_worker.<locals>.shutdown_workerc S s g | ]
}|j �qS r )�sentinel)r7 rL r r r r8 s z,_queue_management_worker.<locals>.<listcomp>Tz^A process in the process pool was terminated abruptly while the future was running or pending.)Z_readerrH rO r Zrecv�_brokenrI r
r% Z
set_exception�BrokenProcessPool�clearZ terminate�
isinstance�int�popr r* r+ Z
set_resultr, r )Zexecutor_referencerS rF Zwork_ids_queuer@ rA rK rT �readerZ sentinelsZreadyZ result_itemr* rG rL r )r@ rJ rS r �_queue_management_worker� sb
r] c C sh t rtrtt��da ytjd�} W n ttfk
r: d S X | dkrHd S | dkrTd S d| att��d S )NT�SC_SEM_NSEMS_MAXr � z@system provides too few semaphores (%d available, 256 necessary)���)�_system_limits_checked�_system_limited�NotImplementedErrorr< �sysconf�AttributeError�
ValueError)Z nsems_maxr r r �_check_system_limitsQ s rg c c s. x(| D ] }|j � x|r$|j� V qW qW dS )z�
Specialized implementation of itertools.chain.from_iterable.
Each item in *iterable* should be a list. This function is
careful not to keep references to yielded objects.
N)�reverser[ )�iterable�elementr r r � _chain_from_iterable_of_listsh s
rk c @ s e Zd ZdZdS )rW zy
Raised when a process in a ProcessPoolExecutor terminated abruptly
while a future was in the running state.
N)r r r �__doc__r r r r rW t s rW c sh e Zd Zddd�Zdd� Zdd� Zdd � Zejjj e_ dd
d �� fd d
�
Z
ddd�Z ejj j e _ � Z S )�ProcessPoolExecutorNc C s� t � |dkr tj� pd| _n|dkr.td��|| _tj| jt �| _d| j_ t
� | _ t j� | _
d| _i | _d| _tj� | _d| _d| _i | _dS )a/ Initializes a new ProcessPoolExecutor instance.
Args:
max_workers: The maximum number of processes that can be used to
execute the given calls. If None or not given then as many
worker processes will be created as the machine has processors.
Nr r z"max_workers must be greater than 0TF)rg r< � cpu_count� _max_workersrf �multiprocessingZQueue�EXTRA_QUEUED_CALLS� _call_queueZ
_ignore_epiper �
_result_queuerE � _work_ids�_queue_management_thread�
_processesrI � threadingZLock�_shutdown_lockrV � _queue_count�_pending_work_items)r Z max_workersr r r r | s$
z ProcessPoolExecutor.__init__c C sp | j fdd�}| jd krl| j� tjttj| |�| j| j | j
| j | j fd�| _d| j_ | jj
� | j t| j< d S )Nc S s |j d � d S )N)r )�_r r r r �
weakref_cb� s zFProcessPoolExecutor._start_queue_management_thread.<locals>.weakref_cb)�targetr' T)rs ru �_adjust_process_countrw ZThreadr] �weakref�refrv rz rt rr Zdaemon�startr )r r| r r r � _start_queue_management_thread� s
z2ProcessPoolExecutor._start_queue_management_threadc C sJ xDt t| j�| j�D ].}tjt| j| jfd�}|j � || j|j
< qW d S )N)r} r' ) rP �lenrv ro rp ZProcessrD rr rs r� �pid)r r{ rL r r r r~ � s z)ProcessPoolExecutor._adjust_process_countc O s� | j �t | jrtd��| jr$td��tj� }t||||�}|| j| j < | j
j | j � | j d7 _ | j j d � | j
� |S Q R X d S )NzKA child process terminated abruptly, the process pool is not usable anymorez*cannot schedule new futures after shutdownr )rx rV rW rI � RuntimeErrorr ZFuturer$ rz ry rt r rs r� )r r& r' r( �f�wr r r �submit� s zProcessPoolExecutor.submitr )�timeoutr2 c s: |dk rt d��t� jtt|�t|d|i�|d�}t|�S )aj Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: If greater than one, the iterables will be chopped into
chunks of size chunksize and submitted to the process pool.
If set to one, the items in the list will be sent one at a time.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
r zchunksize must be >= 1.r2 )r� )rf �super�mapr r9 r6 rk )r r& r� r2 r3 Zresults)� __class__r r r� � s zProcessPoolExecutor.mapTc C sT | j � d| _W d Q R X | jr8| jjd � |r8| jj� d | _d | _d | _d | _d S )NT)rx rI ru rs r r rr rv )r r r r r �shutdown� s
z ProcessPoolExecutor.shutdown)N)T)
r r r r r� r~ r� r �Executorrl r� r� �
__classcell__r r )r� r rm { s
(
rm )-rl �
__author__�atexitr< Zconcurrent.futuresr rE r rp r Zmultiprocessing.connectionr rw r � functoolsr r0 r �WeakKeyDictionaryr r r rq � Exceptionr r r! �objectr$ r) r- r6 r9 rD rH r] ra rb rg rk r� rW r� rm �registerr r r r �<module>, sJ
%s PK w}�\�����% �% 0 futures/__pycache__/process.cpython-36.opt-2.pycnu �[��� 3
\ P � @ s^ d Z ddlZddlZddlmZ ddlZddlmZ ddlZddlmZ ddl m
Z
ddl Z ddl Z ddl
mZ ddlZddlZe j� Zdad d
� Zd ZG d d
� d
e�ZG dd� d�Zdd� ZG dd� de�ZG dd� de�Z G dd� de�Z dd� Z dd� Z d d � Z d d � Z!d d!� Z"da#da$d"d#� Z%d$d%� Z&G d&d'� d'e'�Z(G d(d)� d)ej)�Z*ej+e� dS )*z"Brian Quinlan (brian@sweetapp.com)� N)�_base)�Full)� SimpleQueue)�wait)�partialFc C sJ da ttj� �} x| D ]\}}|jd � qW x| D ]\}}|j� q2W d S )NT)� _shutdown�list�_threads_queues�items�put�join)r
�t�q� r �2/usr/lib64/python3.6/concurrent/futures/process.py� _python_exitO s r � c @ s e Zd Zdd� Zdd� ZdS )�_RemoteTracebackc C s
|| _ d S )N)�tb)�selfr r r r �__init__a s z_RemoteTraceback.__init__c C s | j S )N)r )r r r r �__str__c s z_RemoteTraceback.__str__N)�__name__�
__module__� __qualname__r r r r r r r ` s r c @ s e Zd Zdd� Zdd� ZdS )�_ExceptionWithTracebackc C s0 t jt|�||�}dj|�}|| _d| | _d S )N� z
"""
%s""")� traceback�format_exception�typer �excr )r r r r r r r g s
z _ExceptionWithTraceback.__init__c C s t | j| jffS )N)� _rebuild_excr r )r r r r �
__reduce__l s z"_ExceptionWithTraceback.__reduce__N)r r r r r" r r r r r f s r c C s t |�| _| S )N)r � __cause__)r r r r r r! o s
r! c @ s e Zd Zdd� ZdS )� _WorkItemc C s || _ || _|| _|| _d S )N)�future�fn�args�kwargs)r r% r& r' r( r r r r t s z_WorkItem.__init__N)r r r r r r r r r$ s s r$ c @ s e Zd Zddd�ZdS )� _ResultItemNc C s || _ || _|| _d S )N)�work_id� exception�result)r r* r+ r, r r r r { s z_ResultItem.__init__)NN)r r r r r r r r r) z s r) c @ s e Zd Zdd� ZdS )� _CallItemc C s || _ || _|| _|| _d S )N)r* r& r' r( )r r* r& r' r( r r r r � s z_CallItem.__init__N)r r r r r r r r r- � s r- c g s0 t |� }x"ttj|| ��}|s"d S |V q
W d S )N)�zip�tuple� itertools�islice)� chunksize� iterables�it�chunkr r r � _get_chunks� s r6 c s � fdd�|D �S )Nc s g | ] }� |� �qS r r )�.0r' )r& r r �
<listcomp>� s z"_process_chunk.<locals>.<listcomp>r )r& r5 r )r& r �_process_chunk� s r9 c C s� x�| j dd�}|d kr(|jtj� � d S y|j|j|j�}W nB tk
r~ } z&t||j �}|jt
|j |d�� W Y d d }~X qX |jt
|j |d�� qW d S )NT)�block)r+ )r, ) �getr �os�getpidr& r' r( �
BaseExceptionr �
__traceback__r) r* )�
call_queue� result_queueZ call_item�r�er r r r �_process_worker� s
&
rD c C sx xr|j � rd S y|jdd�}W n tjk
r4 d S X | | }|jj� rh|jt||j|j |j
�dd� q| |= qqW d S )NF)r: T) Zfullr; �queueZEmptyr% Z set_running_or_notify_cancelr r- r& r' r( )�pending_work_itemsZwork_idsr@ r* � work_itemr r r �_add_call_item_to_queue� s
rH c s� d ��fdd�}� �fdd�}|j }�xlt||� � dd� �j� D �} t|g| �}
||
krf|j� } nr| � ��d k r�d�_d�_d �x&|j� D ]\} }
|
jj t
d�� ~
q�W |j � x�j� D ] }|j � q�W |� d S t
| t��r�j| �}|j� ��sR|� d S nJ| d k �rR|j| jd �}
|
d k �rR| j�rB|
jj | j� n|
jj| j� ~
| � �|� �r�y|�sr|� d S W n tk
�r� Y nX d �q(W d S ) Nc s t p� d kp� jS )N)r �_shutdown_threadr )�executorr r �
shutting_down� s z/_queue_management_worker.<locals>.shutting_downc sZ t dd� �j� D ��} x td| �D ]}� jd � q"W � j� x�j� D ] }|j� qFW d S )Nc s s | ]}|j � V qd S )N)Zis_alive)r7 �pr r r � <genexpr>� s zD_queue_management_worker.<locals>.shutdown_worker.<locals>.<genexpr>r )�sum�values�rangeZ
put_nowait�closer )Znb_children_alive�irL )r@ � processesr r �shutdown_worker� s z1_queue_management_worker.<locals>.shutdown_workerc S s g | ]
}|j �qS r )�sentinel)r7 rL r r r r8 s z,_queue_management_worker.<locals>.<listcomp>Tz^A process in the process pool was terminated abruptly while the future was running or pending.)Z_readerrH rO r Zrecv�_brokenrI r
r% Z
set_exception�BrokenProcessPool�clearZ terminate�
isinstance�int�popr r* r+ Z
set_resultr, r )Zexecutor_referencerS rF Zwork_ids_queuer@ rA rK rT �readerZ sentinelsZreadyZ result_itemr* rG rL r )r@ rJ rS r �_queue_management_worker� sb
r] c C sh t rtrtt��da ytjd�} W n ttfk
r: d S X | dkrHd S | dkrTd S d| att��d S )NT�SC_SEM_NSEMS_MAXr � z@system provides too few semaphores (%d available, 256 necessary)���)�_system_limits_checked�_system_limited�NotImplementedErrorr< �sysconf�AttributeError�
ValueError)Z nsems_maxr r r �_check_system_limitsQ s rg c c s. x(| D ] }|j � x|r$|j� V qW qW d S )N)�reverser[ )�iterable�elementr r r � _chain_from_iterable_of_listsh s
rk c @ s e Zd ZdS )rW N)r r r r r r r rW t s rW c sh e Zd Zddd�Zdd� Zdd� Zdd � Zejjj e_ dd
d �� fd d
�
Z
ddd�Z ejj j e _ � Z S )�ProcessPoolExecutorNc C s� t � |d kr tj� pd| _n|dkr.td��|| _tj| jt �| _d| j_ t
� | _ t j� | _
d | _i | _d| _tj� | _d| _d| _i | _d S )Nr r z"max_workers must be greater than 0TF)rg r< � cpu_count� _max_workersrf �multiprocessingZQueue�EXTRA_QUEUED_CALLS� _call_queueZ
_ignore_epiper �
_result_queuerE � _work_ids�_queue_management_thread�
_processesrI � threadingZLock�_shutdown_lockrV � _queue_count�_pending_work_items)r Z max_workersr r r r | s$
z ProcessPoolExecutor.__init__c C sp | j fdd�}| jd krl| j� tjttj| |�| j| j | j
| j | j fd�| _d| j_ | jj
� | j t| j< d S )Nc S s |j d � d S )N)r )�_r r r r �
weakref_cb� s zFProcessPoolExecutor._start_queue_management_thread.<locals>.weakref_cb)�targetr' T)rr rt �_adjust_process_countrv ZThreadr] �weakref�refru ry rs rq Zdaemon�startr )r r{ r r r � _start_queue_management_thread� s
z2ProcessPoolExecutor._start_queue_management_threadc C sJ xDt t| j�| j�D ].}tjt| j| jfd�}|j � || j|j
< qW d S )N)r| r' ) rP �lenru rn ro ZProcessrD rq rr r� �pid)r rz rL r r r r} � s z)ProcessPoolExecutor._adjust_process_countc O s� | j �t | jrtd��| jr$td��tj� }t||||�}|| j| j < | j
j | j � | j d7 _ | j j d � | j
� |S Q R X d S )NzKA child process terminated abruptly, the process pool is not usable anymorez*cannot schedule new futures after shutdownr )rw rV rW rI � RuntimeErrorr ZFuturer$ ry rx rs r rr r� )r r& r' r( �f�wr r r �submit� s zProcessPoolExecutor.submitr )�timeoutr2 c s: |dk rt d��t� jtt|�t|d|i�|d�}t|�S )Nr zchunksize must be >= 1.r2 )r� )rf �super�mapr r9 r6 rk )r r& r� r2 r3 Zresults)� __class__r r r� � s zProcessPoolExecutor.mapTc C sT | j � d| _W d Q R X | jr8| jjd � |r8| jj� d | _d | _d | _d | _d S )NT)rw rI rt rr r r rq ru )r r r r r �shutdown� s
z ProcessPoolExecutor.shutdown)N)T)
r r r r r� r} r� r �Executor�__doc__r� r� �
__classcell__r r )r� r rl { s
(
rl ),�
__author__�atexitr< Zconcurrent.futuresr rE r ro r Zmultiprocessing.connectionr rv r~ � functoolsr r0 r �WeakKeyDictionaryr r r rp � Exceptionr r r! �objectr$ r) r- r6 r9 rD rH r] ra rb rg rk r� rW r� rl �registerr r r r �<module>. sH
%s PK w}�\����= �= * futures/__pycache__/process.cpython-36.pycnu �[��� 3
\ P � @ sb d Z dZddlZddlZddlmZ ddlZddlmZ ddlZddlm Z ddl
m Z ddl Z ddl
Z
ddlmZ ddlZddlZe
j� Zd ad
d � Zd ZG d
d� de�ZG dd� d�Zdd� ZG dd� de�Z G dd� de�Z G dd� de�Z dd� Z dd � Z d d � Z!d d � Z"d!d"� Z#d a$da%d#d$� Z&d%d&� Z'G d'd(� d(e(�Z)G d)d*� d*ej*�Z+ej,e� dS )+a* Implements ProcessPoolExecutor.
The follow diagram and text describe the data-flow through the system:
|======================= In-process =====================|== Out-of-process ==|
+----------+ +----------+ +--------+ +-----------+ +---------+
| | => | Work Ids | => | | => | Call Q | => | |
| | +----------+ | | +-----------+ | |
| | | ... | | | | ... | | |
| | | 6 | | | | 5, call() | | |
| | | 7 | | | | ... | | |
| Process | | ... | | Local | +-----------+ | Process |
| Pool | +----------+ | Worker | | #1..n |
| Executor | | Thread | | |
| | +----------- + | | +-----------+ | |
| | <=> | Work Items | <=> | | <= | Result Q | <= | |
| | +------------+ | | +-----------+ | |
| | | 6: call() | | | | ... | | |
| | | future | | | | 4, result | | |
| | | ... | | | | 3, except | | |
+----------+ +------------+ +--------+ +-----------+ +---------+
Executor.submit() called:
- creates a uniquely numbered _WorkItem and adds it to the "Work Items" dict
- adds the id of the _WorkItem to the "Work Ids" queue
Local worker thread:
- reads work ids from the "Work Ids" queue and looks up the corresponding
WorkItem from the "Work Items" dict: if the work item has been cancelled then
it is simply removed from the dict, otherwise it is repackaged as a
_CallItem and put in the "Call Q". New _CallItems are put in the "Call Q"
until "Call Q" is full. NOTE: the size of the "Call Q" is kept small because
calls placed in the "Call Q" can no longer be cancelled with Future.cancel().
- reads _ResultItems from "Result Q", updates the future stored in the
"Work Items" dict and deletes the dict entry
Process #1..n:
- reads _CallItems from "Call Q", executes the calls, and puts the resulting
_ResultItems in "Result Q"
z"Brian Quinlan (brian@sweetapp.com)� N)�_base)�Full)� SimpleQueue)�wait)�partialFc C sJ da ttj� �} x| D ]\}}|jd � qW x| D ]\}}|j� q2W d S )NT)� _shutdown�list�_threads_queues�items�put�join)r
�t�q� r �2/usr/lib64/python3.6/concurrent/futures/process.py� _python_exitO s r � c @ s e Zd Zdd� Zdd� ZdS )�_RemoteTracebackc C s
|| _ d S )N)�tb)�selfr r r r �__init__a s z_RemoteTraceback.__init__c C s | j S )N)r )r r r r �__str__c s z_RemoteTraceback.__str__N)�__name__�
__module__� __qualname__r r r r r r r ` s r c @ s e Zd Zdd� Zdd� ZdS )�_ExceptionWithTracebackc C s0 t jt|�||�}dj|�}|| _d| | _d S )N� z
"""
%s""")� traceback�format_exception�typer �excr )r r r r r r r g s
z _ExceptionWithTraceback.__init__c C s t | j| jffS )N)� _rebuild_excr r )r r r r �
__reduce__l s z"_ExceptionWithTraceback.__reduce__N)r r r r r" r r r r r f s r c C s t |�| _| S )N)r � __cause__)r r r r r r! o s
r! c @ s e Zd Zdd� ZdS )� _WorkItemc C s || _ || _|| _|| _d S )N)�future�fn�args�kwargs)r r% r& r' r( r r r r t s z_WorkItem.__init__N)r r r r r r r r r$ s s r$ c @ s e Zd Zddd�ZdS )� _ResultItemNc C s || _ || _|| _d S )N)�work_id� exception�result)r r* r+ r, r r r r { s z_ResultItem.__init__)NN)r r r r r r r r r) z s r) c @ s e Zd Zdd� ZdS )� _CallItemc C s || _ || _|| _|| _d S )N)r* r& r' r( )r r* r& r' r( r r r r � s z_CallItem.__init__N)r r r r r r r r r- � s r- c g s0 t |� }x"ttj|| ��}|s"dS |V q
W dS )z, Iterates over zip()ed iterables in chunks. N)�zip�tuple� itertools�islice)� chunksize� iterables�it�chunkr r r � _get_chunks� s r6 c s � fdd�|D �S )z� Processes a chunk of an iterable passed to map.
Runs the function passed to map() on a chunk of the
iterable passed to map.
This function is run in a separate process.
c s g | ] }� |� �qS r r )�.0r' )r& r r �
<listcomp>� s z"_process_chunk.<locals>.<listcomp>r )r& r5 r )r& r �_process_chunk� s r9 c C s� x�| j dd�}|dkr(|jtj� � dS y|j|j|j�}W nB tk
r~ } z&t||j �}|jt
|j |d�� W Y dd}~X qX |jt
|j |d�� qW dS )a� Evaluates calls from call_queue and places the results in result_queue.
This worker is run in a separate process.
Args:
call_queue: A multiprocessing.Queue of _CallItems that will be read and
evaluated by the worker.
result_queue: A multiprocessing.Queue of _ResultItems that will written
to by the worker.
shutdown: A multiprocessing.Event that will be set as a signal to the
worker that it should exit when call_queue is empty.
T)�blockN)r+ )r, ) �getr �os�getpidr& r' r( �
BaseExceptionr �
__traceback__r) r* )�
call_queue� result_queueZ call_item�r�er r r r �_process_worker� s
&
rD c C sx xr|j � rdS y|jdd�}W n tjk
r4 dS X | | }|jj� rh|jt||j|j |j
�dd� q| |= qqW dS )aM Fills call_queue with _WorkItems from pending_work_items.
This function never blocks.
Args:
pending_work_items: A dict mapping work ids to _WorkItems e.g.
{5: <_WorkItem...>, 6: <_WorkItem...>, ...}
work_ids: A queue.Queue of work ids e.g. Queue([5, 6, ...]). Work ids
are consumed and the corresponding _WorkItems from
pending_work_items are transformed into _CallItems and put in
call_queue.
call_queue: A multiprocessing.Queue that will be filled with _CallItems
derived from _WorkItems.
NF)r: T) Zfullr; �queueZEmptyr% Z set_running_or_notify_cancelr r- r& r' r( )�pending_work_itemsZwork_idsr@ r* � work_itemr r r �_add_call_item_to_queue� s
rH c s� d��fdd�}� �fdd�}|j }�x~t||� � dd� �j� D �} | sNt�t|g| �}
||
krn|j� } nr| � ��dk r�d�_d�_d�x&|j� D ]\} }
|
j j
t d �� ~
q�W |j � x�j� D ] }|j
� q�W |� dS t| t��r|� s�t��j| �}|j� ��sd|� dS nJ| dk �rd|j| jd�}
|
dk �rd| j�rT|
j j
| j� n|
j j| j� ~
| � �|� �r�y|�s�|� dS W n tk
�r� Y nX d�q(W dS )
a� Manages the communication between this process and the worker processes.
This function is run in a local thread.
Args:
executor_reference: A weakref.ref to the ProcessPoolExecutor that owns
this thread. Used to determine if the ProcessPoolExecutor has been
garbage collected and that this function can exit.
process: A list of the multiprocessing.Process instances used as
workers.
pending_work_items: A dict mapping work ids to _WorkItems e.g.
{5: <_WorkItem...>, 6: <_WorkItem...>, ...}
work_ids_queue: A queue.Queue of work ids e.g. Queue([5, 6, ...]).
call_queue: A multiprocessing.Queue that will be filled with _CallItems
derived from _WorkItems for processing by the process workers.
result_queue: A multiprocessing.Queue of _ResultItems generated by the
process workers.
Nc s t p� d kp� jS )N)r �_shutdown_threadr )�executorr r �
shutting_down� s z/_queue_management_worker.<locals>.shutting_downc sZ t dd� �j� D ��} x td| �D ]}� jd � q"W � j� x�j� D ] }|j� qFW d S )Nc s s | ]}|j � V qd S )N)Zis_alive)r7 �pr r r � <genexpr>� s zD_queue_management_worker.<locals>.shutdown_worker.<locals>.<genexpr>r )�sum�values�rangeZ
put_nowait�closer )Znb_children_alive�irL )r@ � processesr r �shutdown_worker� s z1_queue_management_worker.<locals>.shutdown_workerc S s g | ]
}|j �qS r )�sentinel)r7 rL r r r r8 s z,_queue_management_worker.<locals>.<listcomp>Tz^A process in the process pool was terminated abruptly while the future was running or pending.)Z_readerrH rO �AssertionErrorr Zrecv�_brokenrI r
r% Z
set_exception�BrokenProcessPool�clearZ terminate�
isinstance�int�popr r* r+ Z
set_resultr, r )Zexecutor_referencerS rF Zwork_ids_queuer@ rA rK rT �readerZ sentinelsZreadyZ result_itemr* rG rL r )r@ rJ rS r �_queue_management_worker� sf
r^ c C sh t rtrtt��da ytjd�} W n ttfk
r: d S X | dkrHd S | dkrTd S d| att��d S )NT�SC_SEM_NSEMS_MAXr � z@system provides too few semaphores (%d available, 256 necessary)���)�_system_limits_checked�_system_limited�NotImplementedErrorr< �sysconf�AttributeError�
ValueError)Z nsems_maxr r r �_check_system_limitsQ s rh c c s. x(| D ] }|j � x|r$|j� V qW qW dS )z�
Specialized implementation of itertools.chain.from_iterable.
Each item in *iterable* should be a list. This function is
careful not to keep references to yielded objects.
N)�reverser\ )�iterable�elementr r r � _chain_from_iterable_of_listsh s
rl c @ s e Zd ZdZdS )rX zy
Raised when a process in a ProcessPoolExecutor terminated abruptly
while a future was in the running state.
N)r r r �__doc__r r r r rX t s rX c sh e Zd Zddd�Zdd� Zdd� Zdd � Zejjj e_ dd
d �� fd d
�
Z
ddd�Z ejj j e _ � Z S )�ProcessPoolExecutorNc C s� t � |dkr tj� pd| _n|dkr.td��|| _tj| jt �| _d| j_ t
� | _ t j� | _
d| _i | _d| _tj� | _d| _d| _i | _dS )a/ Initializes a new ProcessPoolExecutor instance.
Args:
max_workers: The maximum number of processes that can be used to
execute the given calls. If None or not given then as many
worker processes will be created as the machine has processors.
Nr r z"max_workers must be greater than 0TF)rh r< � cpu_count� _max_workersrg �multiprocessingZQueue�EXTRA_QUEUED_CALLS� _call_queueZ
_ignore_epiper �
_result_queuerE � _work_ids�_queue_management_thread�
_processesrI � threadingZLock�_shutdown_lockrW � _queue_count�_pending_work_items)r Z max_workersr r r r | s$
z ProcessPoolExecutor.__init__c C sp | j fdd�}| jd krl| j� tjttj| |�| j| j | j
| j | j fd�| _d| j_ | jj
� | j t| j< d S )Nc S s |j d � d S )N)r )�_r r r r �
weakref_cb� s zFProcessPoolExecutor._start_queue_management_thread.<locals>.weakref_cb)�targetr' T)rt rv �_adjust_process_countrx ZThreadr^ �weakref�refrw r{ ru rs Zdaemon�startr )r r} r r r � _start_queue_management_thread� s
z2ProcessPoolExecutor._start_queue_management_threadc C sJ xDt t| j�| j�D ].}tjt| j| jfd�}|j � || j|j
< qW d S )N)r~ r' ) rP �lenrw rp rq ZProcessrD rs rt r� �pid)r r| rL r r r r � s z)ProcessPoolExecutor._adjust_process_countc O s� | j �t | jrtd��| jr$td��tj� }t||||�}|| j| j < | j
j | j � | j d7 _ | j j d � | j
� |S Q R X d S )NzKA child process terminated abruptly, the process pool is not usable anymorez*cannot schedule new futures after shutdownr )ry rW rX rI � RuntimeErrorr ZFuturer$ r{ rz ru r rt r� )r r& r' r( �f�wr r r �submit� s zProcessPoolExecutor.submitr )�timeoutr2 c s: |dk rt d��t� jtt|�t|d|i�|d�}t|�S )aj Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: If greater than one, the iterables will be chopped into
chunks of size chunksize and submitted to the process pool.
If set to one, the items in the list will be sent one at a time.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
r zchunksize must be >= 1.r2 )r� )rg �super�mapr r9 r6 rl )r r& r� r2 r3 Zresults)� __class__r r r� � s zProcessPoolExecutor.mapTc C sT | j � d| _W d Q R X | jr8| jjd � |r8| jj� d | _d | _d | _d | _d S )NT)ry rI rv rt r r rs rw )r r r r r �shutdown� s
z ProcessPoolExecutor.shutdown)N)T)
r r r r r� r r� r �Executorrm r� r� �
__classcell__r r )r� r rn { s
(
rn )-rm �
__author__�atexitr< Zconcurrent.futuresr rE r rq r Zmultiprocessing.connectionr rx r� � functoolsr r0 r �WeakKeyDictionaryr r r rr � Exceptionr r r! �objectr$ r) r- r6 r9 rD rH r^ rb rc rh rl r� rX r� rn �registerr r r r �<module>, sJ
%s PK w}�\!^rJ J / futures/__pycache__/thread.cpython-36.opt-1.pycnu �[��� 3
\� � @ s� d Z dZddlZddlmZ ddlZddlZddlZddlZddl Z ej
� Z da dd� Z
eje
� G dd � d e�Zd
d � ZG d d
� d
ej�ZdS )z Implements ThreadPoolExecutor.z"Brian Quinlan (brian@sweetapp.com)� N)�_baseFc C sJ da ttj� �} x| D ]\}}|jd � qW x| D ]\}}|j� q2W d S )NT)� _shutdown�list�_threads_queues�items�put�join)r �t�q� r �1/usr/lib64/python3.6/concurrent/futures/thread.py� _python_exit! s r
c @ s e Zd Zdd� Zdd� ZdS )� _WorkItemc C s || _ || _|| _|| _d S )N)�future�fn�args�kwargs)�selfr r r r r r r �__init__- s z_WorkItem.__init__c C sf | j j� sd S y| j| j| j�}W n2 tk
rT } z| j j|� d } W Y d d }~X nX | j j|� d S )N)r Z set_running_or_notify_cancelr r r �
BaseExceptionZ
set_exceptionZ
set_result)r �result�excr r r �run3 s
z
_WorkItem.runN)�__name__�
__module__� __qualname__r r r r r r r , s r c C s| yRxL|j dd�}|d k r$|j� ~q| � }ts<|d ks<|jrJ|jd � d S ~qW W n$ tk
rv tjjddd� Y nX d S )NT)�blockzException in worker)�exc_info)�getr r r r r ZLOGGERZcritical)Zexecutor_referenceZ
work_queueZ work_itemZexecutorr r r �_worker@ s
r c @ sR e Zd Zej� jZd dd�Zdd� Ze j
jj e_ dd� Z d
d
d �Z
e j
j
j e
_ dS )�ThreadPoolExecutorN� c C sf |dkrt j� pdd }|dkr(td��|| _tj� | _t� | _d| _ t
j � | _ |p^d| j
� | _dS )a Initializes a new ThreadPoolExecutor instance.
Args:
max_workers: The maximum number of threads that can be used to
execute the given calls.
thread_name_prefix: An optional name prefix to give our threads.
N� � r z"max_workers must be greater than 0FzThreadPoolExecutor-%d)�os� cpu_count�
ValueError� _max_workers�queueZQueue� _work_queue�set�_threadsr � threadingZLock�_shutdown_lock�_counter�_thread_name_prefix)r Z max_workersZthread_name_prefixr r r r [ s
zThreadPoolExecutor.__init__c O sN | j �> | jrtd��tj� }t||||�}| jj|� | j� |S Q R X d S )Nz*cannot schedule new futures after shutdown) r- r � RuntimeErrorr ZFuturer r) r �_adjust_thread_count)r r r r �f�wr r r �submitr s zThreadPoolExecutor.submitc C sz | j fdd�}t| j�}|| jk rvd| jp,| |f }tj|ttj | |�| j fd�}d|_
|j � | jj |� | j t
|< d S )Nc S s |j d � d S )N)r )�_r
r r r �
weakref_cb� s z;ThreadPoolExecutor._adjust_thread_count.<locals>.weakref_cbz%s_%d)�name�targetr T)r) �lenr+ r' r/ r, ZThreadr �weakref�refZdaemon�start�addr )r r6 Z num_threadsZ thread_namer r r r r1 s
z'ThreadPoolExecutor._adjust_thread_countTc C sD | j � d| _| jjd � W d Q R X |r@x| jD ] }|j� q0W d S )NT)r- r r) r r+ r )r �waitr r r r �shutdown� s zThreadPoolExecutor.shutdown)Nr! )T)r r r � itertools�count�__next__r. r r4 r �Executor�__doc__r1 r? r r r r r V s
r )rD �
__author__�atexitZconcurrent.futuresr r@ r( r, r: r$ �WeakKeyDictionaryr r r
�register�objectr r rC r r r r r �<module> s
PK w}�\ �! / futures/__pycache__/thread.cpython-36.opt-2.pycnu �[��� 3
\� � @ s� d Z ddlZddlmZ ddlZddlZddlZddlZddlZej � Z
da dd� Z ej
e � G dd� de�Zd d
� ZG d d � d ej�ZdS )
z"Brian Quinlan (brian@sweetapp.com)� N)�_baseFc C sJ da ttj� �} x| D ]\}}|jd � qW x| D ]\}}|j� q2W d S )NT)� _shutdown�list�_threads_queues�items�put�join)r �t�q� r �1/usr/lib64/python3.6/concurrent/futures/thread.py� _python_exit! s r
c @ s e Zd Zdd� Zdd� ZdS )� _WorkItemc C s || _ || _|| _|| _d S )N)�future�fn�args�kwargs)�selfr r r r r r r �__init__- s z_WorkItem.__init__c C sf | j j� sd S y| j| j| j�}W n2 tk
rT } z| j j|� d } W Y d d }~X nX | j j|� d S )N)r Z set_running_or_notify_cancelr r r �
BaseExceptionZ
set_exceptionZ
set_result)r �result�excr r r �run3 s
z
_WorkItem.runN)�__name__�
__module__� __qualname__r r r r r r r , s r c C s| yRxL|j dd�}|d k r$|j� ~q| � }ts<|d ks<|jrJ|jd � d S ~qW W n$ tk
rv tjjddd� Y nX d S )NT)�blockzException in worker)�exc_info)�getr r r r r ZLOGGERZcritical)Zexecutor_referenceZ
work_queueZ work_itemZexecutorr r r �_worker@ s
r c @ sR e Zd Zej� jZd dd�Zdd� Ze j
jj e_ dd� Z d
d
d �Z
e j
j
j e
_ dS )�ThreadPoolExecutorN� c C sf |d krt j� pdd }|dkr(td��|| _tj� | _t� | _d| _ t
j � | _ |p^d| j
� | _d S )N� � r z"max_workers must be greater than 0FzThreadPoolExecutor-%d)�os� cpu_count�
ValueError� _max_workers�queueZQueue� _work_queue�set�_threadsr � threadingZLock�_shutdown_lock�_counter�_thread_name_prefix)r Z max_workersZthread_name_prefixr r r r [ s
zThreadPoolExecutor.__init__c O sN | j �> | jrtd��tj� }t||||�}| jj|� | j� |S Q R X d S )Nz*cannot schedule new futures after shutdown) r- r � RuntimeErrorr ZFuturer r) r �_adjust_thread_count)r r r r �f�wr r r �submitr s zThreadPoolExecutor.submitc C sz | j fdd�}t| j�}|| jk rvd| jp,| |f }tj|ttj | |�| j fd�}d|_
|j � | jj |� | j t
|< d S )Nc S s |j d � d S )N)r )�_r
r r r �
weakref_cb� s z;ThreadPoolExecutor._adjust_thread_count.<locals>.weakref_cbz%s_%d)�name�targetr T)r) �lenr+ r' r/ r, ZThreadr �weakref�refZdaemon�start�addr )r r6 Z num_threadsZ thread_namer r r r r1 s
z'ThreadPoolExecutor._adjust_thread_countTc C sD | j � d| _| jjd � W d Q R X |r@x| jD ] }|j� q0W d S )NT)r- r r) r r+ r )r �waitr r r r �shutdown� s zThreadPoolExecutor.shutdown)Nr! )T)r r r � itertools�count�__next__r. r r4 r �Executor�__doc__r1 r? r r r r r V s
r )�
__author__�atexitZconcurrent.futuresr r@ r( r, r: r$ �WeakKeyDictionaryr r r
�register�objectr r rC r r r r r �<module> s
PK w}�\!^rJ J ) futures/__pycache__/thread.cpython-36.pycnu �[��� 3
\� � @ s� d Z dZddlZddlmZ ddlZddlZddlZddlZddl Z ej
� Z da dd� Z
eje
� G dd � d e�Zd
d � ZG d d
� d
ej�ZdS )z Implements ThreadPoolExecutor.z"Brian Quinlan (brian@sweetapp.com)� N)�_baseFc C sJ da ttj� �} x| D ]\}}|jd � qW x| D ]\}}|j� q2W d S )NT)� _shutdown�list�_threads_queues�items�put�join)r �t�q� r �1/usr/lib64/python3.6/concurrent/futures/thread.py� _python_exit! s r
c @ s e Zd Zdd� Zdd� ZdS )� _WorkItemc C s || _ || _|| _|| _d S )N)�future�fn�args�kwargs)�selfr r r r r r r �__init__- s z_WorkItem.__init__c C sf | j j� sd S y| j| j| j�}W n2 tk
rT } z| j j|� d } W Y d d }~X nX | j j|� d S )N)r Z set_running_or_notify_cancelr r r �
BaseExceptionZ
set_exceptionZ
set_result)r �result�excr r r �run3 s
z
_WorkItem.runN)�__name__�
__module__� __qualname__r r r r r r r , s r c C s| yRxL|j dd�}|d k r$|j� ~q| � }ts<|d ks<|jrJ|jd � d S ~qW W n$ tk
rv tjjddd� Y nX d S )NT)�blockzException in worker)�exc_info)�getr r r r r ZLOGGERZcritical)Zexecutor_referenceZ
work_queueZ work_itemZexecutorr r r �_worker@ s
r c @ sR e Zd Zej� jZd dd�Zdd� Ze j
jj e_ dd� Z d
d
d �Z
e j
j
j e
_ dS )�ThreadPoolExecutorN� c C sf |dkrt j� pdd }|dkr(td��|| _tj� | _t� | _d| _ t
j � | _ |p^d| j
� | _dS )a Initializes a new ThreadPoolExecutor instance.
Args:
max_workers: The maximum number of threads that can be used to
execute the given calls.
thread_name_prefix: An optional name prefix to give our threads.
N� � r z"max_workers must be greater than 0FzThreadPoolExecutor-%d)�os� cpu_count�
ValueError� _max_workers�queueZQueue� _work_queue�set�_threadsr � threadingZLock�_shutdown_lock�_counter�_thread_name_prefix)r Z max_workersZthread_name_prefixr r r r [ s
zThreadPoolExecutor.__init__c O sN | j �> | jrtd��tj� }t||||�}| jj|� | j� |S Q R X d S )Nz*cannot schedule new futures after shutdown) r- r � RuntimeErrorr ZFuturer r) r �_adjust_thread_count)r r r r �f�wr r r �submitr s zThreadPoolExecutor.submitc C sz | j fdd�}t| j�}|| jk rvd| jp,| |f }tj|ttj | |�| j fd�}d|_
|j � | jj |� | j t
|< d S )Nc S s |j d � d S )N)r )�_r
r r r �
weakref_cb� s z;ThreadPoolExecutor._adjust_thread_count.<locals>.weakref_cbz%s_%d)�name�targetr T)r) �lenr+ r' r/ r, ZThreadr �weakref�refZdaemon�start�addr )r r6 Z num_threadsZ thread_namer r r r r1 s
z'ThreadPoolExecutor._adjust_thread_countTc C sD | j � d| _| jjd � W d Q R X |r@x| jD ] }|j� q0W d S )NT)r- r r) r r+ r )r �waitr r r r �shutdown� s zThreadPoolExecutor.shutdown)Nr! )T)r r r � itertools�count�__next__r. r r4 r �Executor�__doc__r1 r? r r r r r V s
r )rD �
__author__�atexitZconcurrent.futuresr r@ r( r, r: r$ �WeakKeyDictionaryr r r
�register�objectr r rC r r r r r �<module> s
PK w}�\�G�� futures/__init__.pynu �[��� # Copyright 2009 Brian Quinlan. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Execute computations asynchronously using threads or processes."""
__author__ = 'Brian Quinlan (brian@sweetapp.com)'
from concurrent.futures._base import (FIRST_COMPLETED,
FIRST_EXCEPTION,
ALL_COMPLETED,
CancelledError,
TimeoutError,
Future,
Executor,
wait,
as_completed)
from concurrent.futures.process import ProcessPoolExecutor
from concurrent.futures.thread import ThreadPoolExecutor
PK w}�\��l��R �R futures/_base.pynu �[��� # Copyright 2009 Brian Quinlan. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
__author__ = 'Brian Quinlan (brian@sweetapp.com)'
import collections
import logging
import threading
import time
FIRST_COMPLETED = 'FIRST_COMPLETED'
FIRST_EXCEPTION = 'FIRST_EXCEPTION'
ALL_COMPLETED = 'ALL_COMPLETED'
_AS_COMPLETED = '_AS_COMPLETED'
# Possible future states (for internal use by the futures package).
PENDING = 'PENDING'
RUNNING = 'RUNNING'
# The future was cancelled by the user...
CANCELLED = 'CANCELLED'
# ...and _Waiter.add_cancelled() was called by a worker.
CANCELLED_AND_NOTIFIED = 'CANCELLED_AND_NOTIFIED'
FINISHED = 'FINISHED'
_FUTURE_STATES = [
PENDING,
RUNNING,
CANCELLED,
CANCELLED_AND_NOTIFIED,
FINISHED
]
_STATE_TO_DESCRIPTION_MAP = {
PENDING: "pending",
RUNNING: "running",
CANCELLED: "cancelled",
CANCELLED_AND_NOTIFIED: "cancelled",
FINISHED: "finished"
}
# Logger for internal use by the futures package.
LOGGER = logging.getLogger("concurrent.futures")
class Error(Exception):
"""Base class for all future-related exceptions."""
pass
class CancelledError(Error):
"""The Future was cancelled."""
pass
class TimeoutError(Error):
"""The operation exceeded the given deadline."""
pass
class _Waiter(object):
"""Provides the event that wait() and as_completed() block on."""
def __init__(self):
self.event = threading.Event()
self.finished_futures = []
def add_result(self, future):
self.finished_futures.append(future)
def add_exception(self, future):
self.finished_futures.append(future)
def add_cancelled(self, future):
self.finished_futures.append(future)
class _AsCompletedWaiter(_Waiter):
"""Used by as_completed()."""
def __init__(self):
super(_AsCompletedWaiter, self).__init__()
self.lock = threading.Lock()
def add_result(self, future):
with self.lock:
super(_AsCompletedWaiter, self).add_result(future)
self.event.set()
def add_exception(self, future):
with self.lock:
super(_AsCompletedWaiter, self).add_exception(future)
self.event.set()
def add_cancelled(self, future):
with self.lock:
super(_AsCompletedWaiter, self).add_cancelled(future)
self.event.set()
class _FirstCompletedWaiter(_Waiter):
"""Used by wait(return_when=FIRST_COMPLETED)."""
def add_result(self, future):
super().add_result(future)
self.event.set()
def add_exception(self, future):
super().add_exception(future)
self.event.set()
def add_cancelled(self, future):
super().add_cancelled(future)
self.event.set()
class _AllCompletedWaiter(_Waiter):
"""Used by wait(return_when=FIRST_EXCEPTION and ALL_COMPLETED)."""
def __init__(self, num_pending_calls, stop_on_exception):
self.num_pending_calls = num_pending_calls
self.stop_on_exception = stop_on_exception
self.lock = threading.Lock()
super().__init__()
def _decrement_pending_calls(self):
with self.lock:
self.num_pending_calls -= 1
if not self.num_pending_calls:
self.event.set()
def add_result(self, future):
super().add_result(future)
self._decrement_pending_calls()
def add_exception(self, future):
super().add_exception(future)
if self.stop_on_exception:
self.event.set()
else:
self._decrement_pending_calls()
def add_cancelled(self, future):
super().add_cancelled(future)
self._decrement_pending_calls()
class _AcquireFutures(object):
"""A context manager that does an ordered acquire of Future conditions."""
def __init__(self, futures):
self.futures = sorted(futures, key=id)
def __enter__(self):
for future in self.futures:
future._condition.acquire()
def __exit__(self, *args):
for future in self.futures:
future._condition.release()
def _create_and_install_waiters(fs, return_when):
if return_when == _AS_COMPLETED:
waiter = _AsCompletedWaiter()
elif return_when == FIRST_COMPLETED:
waiter = _FirstCompletedWaiter()
else:
pending_count = sum(
f._state not in [CANCELLED_AND_NOTIFIED, FINISHED] for f in fs)
if return_when == FIRST_EXCEPTION:
waiter = _AllCompletedWaiter(pending_count, stop_on_exception=True)
elif return_when == ALL_COMPLETED:
waiter = _AllCompletedWaiter(pending_count, stop_on_exception=False)
else:
raise ValueError("Invalid return condition: %r" % return_when)
for f in fs:
f._waiters.append(waiter)
return waiter
def _yield_finished_futures(fs, waiter, ref_collect):
"""
Iterate on the list *fs*, yielding finished futures one by one in
reverse order.
Before yielding a future, *waiter* is removed from its waiters
and the future is removed from each set in the collection of sets
*ref_collect*.
The aim of this function is to avoid keeping stale references after
the future is yielded and before the iterator resumes.
"""
while fs:
f = fs[-1]
for futures_set in ref_collect:
futures_set.remove(f)
with f._condition:
f._waiters.remove(waiter)
del f
# Careful not to keep a reference to the popped value
yield fs.pop()
def as_completed(fs, timeout=None):
"""An iterator over the given futures that yields each as it completes.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
iterate over.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
Returns:
An iterator that yields the given Futures as they complete (finished or
cancelled). If any given Futures are duplicated, they will be returned
once.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
"""
if timeout is not None:
end_time = timeout + time.monotonic()
fs = set(fs)
total_futures = len(fs)
with _AcquireFutures(fs):
finished = set(
f for f in fs
if f._state in [CANCELLED_AND_NOTIFIED, FINISHED])
pending = fs - finished
waiter = _create_and_install_waiters(fs, _AS_COMPLETED)
finished = list(finished)
try:
yield from _yield_finished_futures(finished, waiter,
ref_collect=(fs,))
while pending:
if timeout is None:
wait_timeout = None
else:
wait_timeout = end_time - time.monotonic()
if wait_timeout < 0:
raise TimeoutError(
'%d (of %d) futures unfinished' % (
len(pending), total_futures))
waiter.event.wait(wait_timeout)
with waiter.lock:
finished = waiter.finished_futures
waiter.finished_futures = []
waiter.event.clear()
# reverse to keep finishing order
finished.reverse()
yield from _yield_finished_futures(finished, waiter,
ref_collect=(fs, pending))
finally:
# Remove waiter from unfinished futures
for f in fs:
with f._condition:
f._waiters.remove(waiter)
DoneAndNotDoneFutures = collections.namedtuple(
'DoneAndNotDoneFutures', 'done not_done')
def wait(fs, timeout=None, return_when=ALL_COMPLETED):
"""Wait for the futures in the given sequence to complete.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
wait upon.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
return_when: Indicates when this function should return. The options
are:
FIRST_COMPLETED - Return when any future finishes or is
cancelled.
FIRST_EXCEPTION - Return when any future finishes by raising an
exception. If no future raises an exception
then it is equivalent to ALL_COMPLETED.
ALL_COMPLETED - Return when all futures finish or are cancelled.
Returns:
A named 2-tuple of sets. The first set, named 'done', contains the
futures that completed (is finished or cancelled) before the wait
completed. The second set, named 'not_done', contains uncompleted
futures.
"""
with _AcquireFutures(fs):
done = set(f for f in fs
if f._state in [CANCELLED_AND_NOTIFIED, FINISHED])
not_done = set(fs) - done
if (return_when == FIRST_COMPLETED) and done:
return DoneAndNotDoneFutures(done, not_done)
elif (return_when == FIRST_EXCEPTION) and done:
if any(f for f in done
if not f.cancelled() and f.exception() is not None):
return DoneAndNotDoneFutures(done, not_done)
if len(done) == len(fs):
return DoneAndNotDoneFutures(done, not_done)
waiter = _create_and_install_waiters(fs, return_when)
waiter.event.wait(timeout)
for f in fs:
with f._condition:
f._waiters.remove(waiter)
done.update(waiter.finished_futures)
return DoneAndNotDoneFutures(done, set(fs) - done)
class Future(object):
"""Represents the result of an asynchronous computation."""
def __init__(self):
"""Initializes the future. Should not be called by clients."""
self._condition = threading.Condition()
self._state = PENDING
self._result = None
self._exception = None
self._waiters = []
self._done_callbacks = []
def _invoke_callbacks(self):
for callback in self._done_callbacks:
try:
callback(self)
except Exception:
LOGGER.exception('exception calling callback for %r', self)
def __repr__(self):
with self._condition:
if self._state == FINISHED:
if self._exception:
return '<%s at %#x state=%s raised %s>' % (
self.__class__.__name__,
id(self),
_STATE_TO_DESCRIPTION_MAP[self._state],
self._exception.__class__.__name__)
else:
return '<%s at %#x state=%s returned %s>' % (
self.__class__.__name__,
id(self),
_STATE_TO_DESCRIPTION_MAP[self._state],
self._result.__class__.__name__)
return '<%s at %#x state=%s>' % (
self.__class__.__name__,
id(self),
_STATE_TO_DESCRIPTION_MAP[self._state])
def cancel(self):
"""Cancel the future if possible.
Returns True if the future was cancelled, False otherwise. A future
cannot be cancelled if it is running or has already completed.
"""
with self._condition:
if self._state in [RUNNING, FINISHED]:
return False
if self._state in [CANCELLED, CANCELLED_AND_NOTIFIED]:
return True
self._state = CANCELLED
self._condition.notify_all()
self._invoke_callbacks()
return True
def cancelled(self):
"""Return True if the future was cancelled."""
with self._condition:
return self._state in [CANCELLED, CANCELLED_AND_NOTIFIED]
def running(self):
"""Return True if the future is currently executing."""
with self._condition:
return self._state == RUNNING
def done(self):
"""Return True of the future was cancelled or finished executing."""
with self._condition:
return self._state in [CANCELLED, CANCELLED_AND_NOTIFIED, FINISHED]
def __get_result(self):
if self._exception:
raise self._exception
else:
return self._result
def add_done_callback(self, fn):
"""Attaches a callable that will be called when the future finishes.
Args:
fn: A callable that will be called with this future as its only
argument when the future completes or is cancelled. The callable
will always be called by a thread in the same process in which
it was added. If the future has already completed or been
cancelled then the callable will be called immediately. These
callables are called in the order that they were added.
"""
with self._condition:
if self._state not in [CANCELLED, CANCELLED_AND_NOTIFIED, FINISHED]:
self._done_callbacks.append(fn)
return
fn(self)
def result(self, timeout=None):
"""Return the result of the call that the future represents.
Args:
timeout: The number of seconds to wait for the result if the future
isn't done. If None, then there is no limit on the wait time.
Returns:
The result of the call that the future represents.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
Exception: If the call raised then that exception will be raised.
"""
with self._condition:
if self._state in [CANCELLED, CANCELLED_AND_NOTIFIED]:
raise CancelledError()
elif self._state == FINISHED:
return self.__get_result()
self._condition.wait(timeout)
if self._state in [CANCELLED, CANCELLED_AND_NOTIFIED]:
raise CancelledError()
elif self._state == FINISHED:
return self.__get_result()
else:
raise TimeoutError()
def exception(self, timeout=None):
"""Return the exception raised by the call that the future represents.
Args:
timeout: The number of seconds to wait for the exception if the
future isn't done. If None, then there is no limit on the wait
time.
Returns:
The exception raised by the call that the future represents or None
if the call completed without raising.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
"""
with self._condition:
if self._state in [CANCELLED, CANCELLED_AND_NOTIFIED]:
raise CancelledError()
elif self._state == FINISHED:
return self._exception
self._condition.wait(timeout)
if self._state in [CANCELLED, CANCELLED_AND_NOTIFIED]:
raise CancelledError()
elif self._state == FINISHED:
return self._exception
else:
raise TimeoutError()
# The following methods should only be used by Executors and in tests.
def set_running_or_notify_cancel(self):
"""Mark the future as running or process any cancel notifications.
Should only be used by Executor implementations and unit tests.
If the future has been cancelled (cancel() was called and returned
True) then any threads waiting on the future completing (though calls
to as_completed() or wait()) are notified and False is returned.
If the future was not cancelled then it is put in the running state
(future calls to running() will return True) and True is returned.
This method should be called by Executor implementations before
executing the work associated with this future. If this method returns
False then the work should not be executed.
Returns:
False if the Future was cancelled, True otherwise.
Raises:
RuntimeError: if this method was already called or if set_result()
or set_exception() was called.
"""
with self._condition:
if self._state == CANCELLED:
self._state = CANCELLED_AND_NOTIFIED
for waiter in self._waiters:
waiter.add_cancelled(self)
# self._condition.notify_all() is not necessary because
# self.cancel() triggers a notification.
return False
elif self._state == PENDING:
self._state = RUNNING
return True
else:
LOGGER.critical('Future %s in unexpected state: %s',
id(self),
self._state)
raise RuntimeError('Future in unexpected state')
def set_result(self, result):
"""Sets the return value of work associated with the future.
Should only be used by Executor implementations and unit tests.
"""
with self._condition:
self._result = result
self._state = FINISHED
for waiter in self._waiters:
waiter.add_result(self)
self._condition.notify_all()
self._invoke_callbacks()
def set_exception(self, exception):
"""Sets the result of the future as being the given exception.
Should only be used by Executor implementations and unit tests.
"""
with self._condition:
self._exception = exception
self._state = FINISHED
for waiter in self._waiters:
waiter.add_exception(self)
self._condition.notify_all()
self._invoke_callbacks()
class Executor(object):
"""This is an abstract base class for concrete asynchronous executors."""
def submit(self, fn, *args, **kwargs):
"""Submits a callable to be executed with the given arguments.
Schedules the callable to be executed as fn(*args, **kwargs) and returns
a Future instance representing the execution of the callable.
Returns:
A Future representing the given call.
"""
raise NotImplementedError()
def map(self, fn, *iterables, timeout=None, chunksize=1):
"""Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: The size of the chunks the iterable will be broken into
before being passed to a child process. This argument is only
used by ProcessPoolExecutor; it is ignored by
ThreadPoolExecutor.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
"""
if timeout is not None:
end_time = timeout + time.monotonic()
fs = [self.submit(fn, *args) for args in zip(*iterables)]
# Yield must be hidden in closure so that the futures are submitted
# before the first iterator value is required.
def result_iterator():
try:
# reverse to keep finishing order
fs.reverse()
while fs:
# Careful not to keep a reference to the popped future
if timeout is None:
yield fs.pop().result()
else:
yield fs.pop().result(end_time - time.monotonic())
finally:
for future in fs:
future.cancel()
return result_iterator()
def shutdown(self, wait=True):
"""Clean-up the resources associated with the Executor.
It is safe to call this method several times. Otherwise, no other
methods can be called after this one.
Args:
wait: If True then shutdown will not return until all running
futures have finished executing and the resources used by the
executor have been reclaimed.
"""
pass
def __enter__(self):
return self
def __exit__(self, exc_type, exc_val, exc_tb):
self.shutdown(wait=True)
return False
PK w}�\�T�� P P futures/process.pynu �[��� # Copyright 2009 Brian Quinlan. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Implements ProcessPoolExecutor.
The follow diagram and text describe the data-flow through the system:
|======================= In-process =====================|== Out-of-process ==|
+----------+ +----------+ +--------+ +-----------+ +---------+
| | => | Work Ids | => | | => | Call Q | => | |
| | +----------+ | | +-----------+ | |
| | | ... | | | | ... | | |
| | | 6 | | | | 5, call() | | |
| | | 7 | | | | ... | | |
| Process | | ... | | Local | +-----------+ | Process |
| Pool | +----------+ | Worker | | #1..n |
| Executor | | Thread | | |
| | +----------- + | | +-----------+ | |
| | <=> | Work Items | <=> | | <= | Result Q | <= | |
| | +------------+ | | +-----------+ | |
| | | 6: call() | | | | ... | | |
| | | future | | | | 4, result | | |
| | | ... | | | | 3, except | | |
+----------+ +------------+ +--------+ +-----------+ +---------+
Executor.submit() called:
- creates a uniquely numbered _WorkItem and adds it to the "Work Items" dict
- adds the id of the _WorkItem to the "Work Ids" queue
Local worker thread:
- reads work ids from the "Work Ids" queue and looks up the corresponding
WorkItem from the "Work Items" dict: if the work item has been cancelled then
it is simply removed from the dict, otherwise it is repackaged as a
_CallItem and put in the "Call Q". New _CallItems are put in the "Call Q"
until "Call Q" is full. NOTE: the size of the "Call Q" is kept small because
calls placed in the "Call Q" can no longer be cancelled with Future.cancel().
- reads _ResultItems from "Result Q", updates the future stored in the
"Work Items" dict and deletes the dict entry
Process #1..n:
- reads _CallItems from "Call Q", executes the calls, and puts the resulting
_ResultItems in "Result Q"
"""
__author__ = 'Brian Quinlan (brian@sweetapp.com)'
import atexit
import os
from concurrent.futures import _base
import queue
from queue import Full
import multiprocessing
from multiprocessing import SimpleQueue
from multiprocessing.connection import wait
import threading
import weakref
from functools import partial
import itertools
import traceback
# Workers are created as daemon threads and processes. This is done to allow the
# interpreter to exit when there are still idle processes in a
# ProcessPoolExecutor's process pool (i.e. shutdown() was not called). However,
# allowing workers to die with the interpreter has two undesirable properties:
# - The workers would still be running during interpreter shutdown,
# meaning that they would fail in unpredictable ways.
# - The workers could be killed while evaluating a work item, which could
# be bad if the callable being evaluated has external side-effects e.g.
# writing to a file.
#
# To work around this problem, an exit handler is installed which tells the
# workers to exit when their work queues are empty and then waits until the
# threads/processes finish.
_threads_queues = weakref.WeakKeyDictionary()
_shutdown = False
def _python_exit():
global _shutdown
_shutdown = True
items = list(_threads_queues.items())
for t, q in items:
q.put(None)
for t, q in items:
t.join()
# Controls how many more calls than processes will be queued in the call queue.
# A smaller number will mean that processes spend more time idle waiting for
# work while a larger number will make Future.cancel() succeed less frequently
# (Futures in the call queue cannot be cancelled).
EXTRA_QUEUED_CALLS = 1
# Hack to embed stringification of remote traceback in local traceback
class _RemoteTraceback(Exception):
def __init__(self, tb):
self.tb = tb
def __str__(self):
return self.tb
class _ExceptionWithTraceback:
def __init__(self, exc, tb):
tb = traceback.format_exception(type(exc), exc, tb)
tb = ''.join(tb)
self.exc = exc
self.tb = '\n"""\n%s"""' % tb
def __reduce__(self):
return _rebuild_exc, (self.exc, self.tb)
def _rebuild_exc(exc, tb):
exc.__cause__ = _RemoteTraceback(tb)
return exc
class _WorkItem(object):
def __init__(self, future, fn, args, kwargs):
self.future = future
self.fn = fn
self.args = args
self.kwargs = kwargs
class _ResultItem(object):
def __init__(self, work_id, exception=None, result=None):
self.work_id = work_id
self.exception = exception
self.result = result
class _CallItem(object):
def __init__(self, work_id, fn, args, kwargs):
self.work_id = work_id
self.fn = fn
self.args = args
self.kwargs = kwargs
def _get_chunks(*iterables, chunksize):
""" Iterates over zip()ed iterables in chunks. """
it = zip(*iterables)
while True:
chunk = tuple(itertools.islice(it, chunksize))
if not chunk:
return
yield chunk
def _process_chunk(fn, chunk):
""" Processes a chunk of an iterable passed to map.
Runs the function passed to map() on a chunk of the
iterable passed to map.
This function is run in a separate process.
"""
return [fn(*args) for args in chunk]
def _process_worker(call_queue, result_queue):
"""Evaluates calls from call_queue and places the results in result_queue.
This worker is run in a separate process.
Args:
call_queue: A multiprocessing.Queue of _CallItems that will be read and
evaluated by the worker.
result_queue: A multiprocessing.Queue of _ResultItems that will written
to by the worker.
shutdown: A multiprocessing.Event that will be set as a signal to the
worker that it should exit when call_queue is empty.
"""
while True:
call_item = call_queue.get(block=True)
if call_item is None:
# Wake up queue management thread
result_queue.put(os.getpid())
return
try:
r = call_item.fn(*call_item.args, **call_item.kwargs)
except BaseException as e:
exc = _ExceptionWithTraceback(e, e.__traceback__)
result_queue.put(_ResultItem(call_item.work_id, exception=exc))
else:
result_queue.put(_ResultItem(call_item.work_id,
result=r))
def _add_call_item_to_queue(pending_work_items,
work_ids,
call_queue):
"""Fills call_queue with _WorkItems from pending_work_items.
This function never blocks.
Args:
pending_work_items: A dict mapping work ids to _WorkItems e.g.
{5: <_WorkItem...>, 6: <_WorkItem...>, ...}
work_ids: A queue.Queue of work ids e.g. Queue([5, 6, ...]). Work ids
are consumed and the corresponding _WorkItems from
pending_work_items are transformed into _CallItems and put in
call_queue.
call_queue: A multiprocessing.Queue that will be filled with _CallItems
derived from _WorkItems.
"""
while True:
if call_queue.full():
return
try:
work_id = work_ids.get(block=False)
except queue.Empty:
return
else:
work_item = pending_work_items[work_id]
if work_item.future.set_running_or_notify_cancel():
call_queue.put(_CallItem(work_id,
work_item.fn,
work_item.args,
work_item.kwargs),
block=True)
else:
del pending_work_items[work_id]
continue
def _queue_management_worker(executor_reference,
processes,
pending_work_items,
work_ids_queue,
call_queue,
result_queue):
"""Manages the communication between this process and the worker processes.
This function is run in a local thread.
Args:
executor_reference: A weakref.ref to the ProcessPoolExecutor that owns
this thread. Used to determine if the ProcessPoolExecutor has been
garbage collected and that this function can exit.
process: A list of the multiprocessing.Process instances used as
workers.
pending_work_items: A dict mapping work ids to _WorkItems e.g.
{5: <_WorkItem...>, 6: <_WorkItem...>, ...}
work_ids_queue: A queue.Queue of work ids e.g. Queue([5, 6, ...]).
call_queue: A multiprocessing.Queue that will be filled with _CallItems
derived from _WorkItems for processing by the process workers.
result_queue: A multiprocessing.Queue of _ResultItems generated by the
process workers.
"""
executor = None
def shutting_down():
return _shutdown or executor is None or executor._shutdown_thread
def shutdown_worker():
# This is an upper bound
nb_children_alive = sum(p.is_alive() for p in processes.values())
for i in range(0, nb_children_alive):
call_queue.put_nowait(None)
# Release the queue's resources as soon as possible.
call_queue.close()
# If .join() is not called on the created processes then
# some multiprocessing.Queue methods may deadlock on Mac OS X.
for p in processes.values():
p.join()
reader = result_queue._reader
while True:
_add_call_item_to_queue(pending_work_items,
work_ids_queue,
call_queue)
sentinels = [p.sentinel for p in processes.values()]
assert sentinels
ready = wait([reader] + sentinels)
if reader in ready:
result_item = reader.recv()
else:
# Mark the process pool broken so that submits fail right now.
executor = executor_reference()
if executor is not None:
executor._broken = True
executor._shutdown_thread = True
executor = None
# All futures in flight must be marked failed
for work_id, work_item in pending_work_items.items():
work_item.future.set_exception(
BrokenProcessPool(
"A process in the process pool was "
"terminated abruptly while the future was "
"running or pending."
))
# Delete references to object. See issue16284
del work_item
pending_work_items.clear()
# Terminate remaining workers forcibly: the queues or their
# locks may be in a dirty state and block forever.
for p in processes.values():
p.terminate()
shutdown_worker()
return
if isinstance(result_item, int):
# Clean shutdown of a worker using its PID
# (avoids marking the executor broken)
assert shutting_down()
p = processes.pop(result_item)
p.join()
if not processes:
shutdown_worker()
return
elif result_item is not None:
work_item = pending_work_items.pop(result_item.work_id, None)
# work_item can be None if another process terminated (see above)
if work_item is not None:
if result_item.exception:
work_item.future.set_exception(result_item.exception)
else:
work_item.future.set_result(result_item.result)
# Delete references to object. See issue16284
del work_item
# Check whether we should start shutting down.
executor = executor_reference()
# No more work items can be added if:
# - The interpreter is shutting down OR
# - The executor that owns this worker has been collected OR
# - The executor that owns this worker has been shutdown.
if shutting_down():
try:
# Since no new work items can be added, it is safe to shutdown
# this thread if there are no pending work items.
if not pending_work_items:
shutdown_worker()
return
except Full:
# This is not a problem: we will eventually be woken up (in
# result_queue.get()) and be able to send a sentinel again.
pass
executor = None
_system_limits_checked = False
_system_limited = None
def _check_system_limits():
global _system_limits_checked, _system_limited
if _system_limits_checked:
if _system_limited:
raise NotImplementedError(_system_limited)
_system_limits_checked = True
try:
nsems_max = os.sysconf("SC_SEM_NSEMS_MAX")
except (AttributeError, ValueError):
# sysconf not available or setting not available
return
if nsems_max == -1:
# indetermined limit, assume that limit is determined
# by available memory only
return
if nsems_max >= 256:
# minimum number of semaphores available
# according to POSIX
return
_system_limited = "system provides too few semaphores (%d available, 256 necessary)" % nsems_max
raise NotImplementedError(_system_limited)
def _chain_from_iterable_of_lists(iterable):
"""
Specialized implementation of itertools.chain.from_iterable.
Each item in *iterable* should be a list. This function is
careful not to keep references to yielded objects.
"""
for element in iterable:
element.reverse()
while element:
yield element.pop()
class BrokenProcessPool(RuntimeError):
"""
Raised when a process in a ProcessPoolExecutor terminated abruptly
while a future was in the running state.
"""
class ProcessPoolExecutor(_base.Executor):
def __init__(self, max_workers=None):
"""Initializes a new ProcessPoolExecutor instance.
Args:
max_workers: The maximum number of processes that can be used to
execute the given calls. If None or not given then as many
worker processes will be created as the machine has processors.
"""
_check_system_limits()
if max_workers is None:
self._max_workers = os.cpu_count() or 1
else:
if max_workers <= 0:
raise ValueError("max_workers must be greater than 0")
self._max_workers = max_workers
# Make the call queue slightly larger than the number of processes to
# prevent the worker processes from idling. But don't make it too big
# because futures in the call queue cannot be cancelled.
self._call_queue = multiprocessing.Queue(self._max_workers +
EXTRA_QUEUED_CALLS)
# Killed worker processes can produce spurious "broken pipe"
# tracebacks in the queue's own worker thread. But we detect killed
# processes anyway, so silence the tracebacks.
self._call_queue._ignore_epipe = True
self._result_queue = SimpleQueue()
self._work_ids = queue.Queue()
self._queue_management_thread = None
# Map of pids to processes
self._processes = {}
# Shutdown is a two-step process.
self._shutdown_thread = False
self._shutdown_lock = threading.Lock()
self._broken = False
self._queue_count = 0
self._pending_work_items = {}
def _start_queue_management_thread(self):
# When the executor gets lost, the weakref callback will wake up
# the queue management thread.
def weakref_cb(_, q=self._result_queue):
q.put(None)
if self._queue_management_thread is None:
# Start the processes so that their sentinels are known.
self._adjust_process_count()
self._queue_management_thread = threading.Thread(
target=_queue_management_worker,
args=(weakref.ref(self, weakref_cb),
self._processes,
self._pending_work_items,
self._work_ids,
self._call_queue,
self._result_queue))
self._queue_management_thread.daemon = True
self._queue_management_thread.start()
_threads_queues[self._queue_management_thread] = self._result_queue
def _adjust_process_count(self):
for _ in range(len(self._processes), self._max_workers):
p = multiprocessing.Process(
target=_process_worker,
args=(self._call_queue,
self._result_queue))
p.start()
self._processes[p.pid] = p
def submit(self, fn, *args, **kwargs):
with self._shutdown_lock:
if self._broken:
raise BrokenProcessPool('A child process terminated '
'abruptly, the process pool is not usable anymore')
if self._shutdown_thread:
raise RuntimeError('cannot schedule new futures after shutdown')
f = _base.Future()
w = _WorkItem(f, fn, args, kwargs)
self._pending_work_items[self._queue_count] = w
self._work_ids.put(self._queue_count)
self._queue_count += 1
# Wake up queue management thread
self._result_queue.put(None)
self._start_queue_management_thread()
return f
submit.__doc__ = _base.Executor.submit.__doc__
def map(self, fn, *iterables, timeout=None, chunksize=1):
"""Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: If greater than one, the iterables will be chopped into
chunks of size chunksize and submitted to the process pool.
If set to one, the items in the list will be sent one at a time.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
"""
if chunksize < 1:
raise ValueError("chunksize must be >= 1.")
results = super().map(partial(_process_chunk, fn),
_get_chunks(*iterables, chunksize=chunksize),
timeout=timeout)
return _chain_from_iterable_of_lists(results)
def shutdown(self, wait=True):
with self._shutdown_lock:
self._shutdown_thread = True
if self._queue_management_thread:
# Wake up queue management thread
self._result_queue.put(None)
if wait:
self._queue_management_thread.join()
# To reduce the risk of opening too many files, remove references to
# objects that use file descriptors.
self._queue_management_thread = None
self._call_queue = None
self._result_queue = None
self._processes = None
shutdown.__doc__ = _base.Executor.shutdown.__doc__
atexit.register(_python_exit)
PK w}�\���� � futures/thread.pynu �[��� # Copyright 2009 Brian Quinlan. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Implements ThreadPoolExecutor."""
__author__ = 'Brian Quinlan (brian@sweetapp.com)'
import atexit
from concurrent.futures import _base
import itertools
import queue
import threading
import weakref
import os
# Workers are created as daemon threads. This is done to allow the interpreter
# to exit when there are still idle threads in a ThreadPoolExecutor's thread
# pool (i.e. shutdown() was not called). However, allowing workers to die with
# the interpreter has two undesirable properties:
# - The workers would still be running during interpreter shutdown,
# meaning that they would fail in unpredictable ways.
# - The workers could be killed while evaluating a work item, which could
# be bad if the callable being evaluated has external side-effects e.g.
# writing to a file.
#
# To work around this problem, an exit handler is installed which tells the
# workers to exit when their work queues are empty and then waits until the
# threads finish.
_threads_queues = weakref.WeakKeyDictionary()
_shutdown = False
def _python_exit():
global _shutdown
_shutdown = True
items = list(_threads_queues.items())
for t, q in items:
q.put(None)
for t, q in items:
t.join()
atexit.register(_python_exit)
class _WorkItem(object):
def __init__(self, future, fn, args, kwargs):
self.future = future
self.fn = fn
self.args = args
self.kwargs = kwargs
def run(self):
if not self.future.set_running_or_notify_cancel():
return
try:
result = self.fn(*self.args, **self.kwargs)
except BaseException as exc:
self.future.set_exception(exc)
# Break a reference cycle with the exception 'exc'
self = None
else:
self.future.set_result(result)
def _worker(executor_reference, work_queue):
try:
while True:
work_item = work_queue.get(block=True)
if work_item is not None:
work_item.run()
# Delete references to object. See issue16284
del work_item
continue
executor = executor_reference()
# Exit if:
# - The interpreter is shutting down OR
# - The executor that owns the worker has been collected OR
# - The executor that owns the worker has been shutdown.
if _shutdown or executor is None or executor._shutdown:
# Notice other workers
work_queue.put(None)
return
del executor
except BaseException:
_base.LOGGER.critical('Exception in worker', exc_info=True)
class ThreadPoolExecutor(_base.Executor):
# Used to assign unique thread names when thread_name_prefix is not supplied.
_counter = itertools.count().__next__
def __init__(self, max_workers=None, thread_name_prefix=''):
"""Initializes a new ThreadPoolExecutor instance.
Args:
max_workers: The maximum number of threads that can be used to
execute the given calls.
thread_name_prefix: An optional name prefix to give our threads.
"""
if max_workers is None:
# Use this number because ThreadPoolExecutor is often
# used to overlap I/O instead of CPU work.
max_workers = (os.cpu_count() or 1) * 5
if max_workers <= 0:
raise ValueError("max_workers must be greater than 0")
self._max_workers = max_workers
self._work_queue = queue.Queue()
self._threads = set()
self._shutdown = False
self._shutdown_lock = threading.Lock()
self._thread_name_prefix = (thread_name_prefix or
("ThreadPoolExecutor-%d" % self._counter()))
def submit(self, fn, *args, **kwargs):
with self._shutdown_lock:
if self._shutdown:
raise RuntimeError('cannot schedule new futures after shutdown')
f = _base.Future()
w = _WorkItem(f, fn, args, kwargs)
self._work_queue.put(w)
self._adjust_thread_count()
return f
submit.__doc__ = _base.Executor.submit.__doc__
def _adjust_thread_count(self):
# When the executor gets lost, the weakref callback will wake up
# the worker threads.
def weakref_cb(_, q=self._work_queue):
q.put(None)
# TODO(bquinlan): Should avoid creating new threads if there are more
# idle threads than items in the work queue.
num_threads = len(self._threads)
if num_threads < self._max_workers:
thread_name = '%s_%d' % (self._thread_name_prefix or self,
num_threads)
t = threading.Thread(name=thread_name, target=_worker,
args=(weakref.ref(self, weakref_cb),
self._work_queue))
t.daemon = True
t.start()
self._threads.add(t)
_threads_queues[t] = self._work_queue
def shutdown(self, wait=True):
with self._shutdown_lock:
self._shutdown = True
self._work_queue.put(None)
if wait:
for t in self._threads:
t.join()
shutdown.__doc__ = _base.Executor.shutdown.__doc__
PK w}�\���I& & __init__.pynu �[��� # This directory is a Python package.
PK w}�\�)d�~ ~ ) __pycache__/__init__.cpython-36.opt-1.pycnu �[��� PK w}�\�)d�~ ~ ) � __pycache__/__init__.cpython-36.opt-2.pycnu �[��� PK w}�\�)d�~ ~ # � __pycache__/__init__.cpython-36.pycnu �[��� PK w}�\�ߊނ � 1 futures/__pycache__/__init__.cpython-36.opt-1.pycnu �[��� PK w}�\�K`�2 2 1 b futures/__pycache__/__init__.cpython-36.opt-2.pycnu �[��� PK w}�\�ߊނ � + � futures/__pycache__/__init__.cpython-36.pycnu �[��� PK w}�\GꂚP �P . �
futures/__pycache__/_base.cpython-36.opt-1.pycnu �[��� PK w}�\�I}��2 �2 . �[ futures/__pycache__/_base.cpython-36.opt-2.pycnu �[��� PK w}�\GꂚP �P ( Ԏ futures/__pycache__/_base.cpython-36.pycnu �[��� PK w}�\ >۱= �= 0 �� futures/__pycache__/process.cpython-36.opt-1.pycnu �[��� PK w}�\�����% �% 0 � futures/__pycache__/process.cpython-36.opt-2.pycnu �[��� PK w}�\����= �= * �C futures/__pycache__/process.cpython-36.pycnu �[��� PK w}�\!^rJ J / *� futures/__pycache__/thread.cpython-36.opt-1.pycnu �[��� PK w}�\ �! / ӑ futures/__pycache__/thread.cpython-36.opt-2.pycnu �[��� PK w}�\!^rJ J ) E� futures/__pycache__/thread.cpython-36.pycnu �[��� PK w}�\�G�� � futures/__init__.pynu �[��� PK w}�\��l��R �R K� futures/_base.pynu �[��� PK w}�\�T�� P P ~ futures/process.pynu �[��� PK w}�\���� � �V futures/thread.pynu �[��� PK w}�\���I& & �l __init__.pynu �[��� PK � �l