HEX

File: //usr/lib/python3/dist-packages/mercurial/__pycache__/worker.cpython-310.pyc
o

�]Lb�=�@sDddlmZddlZddlZddlZddlZddlZddlZz	ddlZej	Wne
y6ddlmZYnwddl
mZddlmZmZmZmZmZdd�Zd	d
�Zejrcdd�ZGd
d�de�Zndd�Zdd�ZejsqejrwdZejZndZdZd!dd�Z	d"dd�Z dd�Z!dd�Z"dd�Z#ejr�e#Z$ne!Z$e"Z%dd �Z&dS)#�)�absolute_importN�)�
selectors2)�_)�encoding�error�pycompat�scmutil�utilc	Cstztt�d��}|dkr|WSWnttfyYnwzttjd�}|dkr+|WSWdSttfy9YdSw)z-try to count the number of CPUs on the system�SC_NPROCESSORS_ONLNrsNUMBER_OF_PROCESSORSr)�int�os�sysconf�AttributeError�
ValueErrorr�environ�KeyError)�n�r�2/usr/lib/python3/dist-packages/mercurial/worker.py�	countcpus"s$�����rcCsZ|�dd�}|r$z
t|�}|dkr|WSWnty#t�td���wttt�d�d�S)N�workersnumcpusrs!number of cpus must be an integer�� )	�configrrr�Abortr�min�maxr)�ui�srrrr�_numworkers8s��r cCst��t��kS�N)�	threading�current_thread�main_threadrrrr�ismainthreadFsr%c@s&eZdZdd�Zdd�Zd	dd�ZdS)
�_blockingreadercCs
||_dSr!)�_wrapped)�self�wrappedrrr�__init__J�
z_blockingreader.__init__cCs
|j��Sr!)r'�readline�r(rrrr,Qr+z_blockingreader.readline���cCsl|dkr	|j��St|�}t|�}d}||kr,|j�||d��}|s$n||7}||ks~||d�=t|�S�Nr)r'�readall�	bytearray�
memoryview�readinto�bytes)r(�size�buf�view�pos�retrrr�readUs
�
z_blockingreader.readN)r.)�__name__�
__module__�__qualname__r*r,r:rrrrr&Isr&cCstt��tj�Sr!)�
isinstancer"r#�_MainThreadrrrrr%jscCs|Sr!r)r)rrrr&osg{�G�z�?gꌠ9Y>)FFTcCs8|strdS||}t|�}|t|||}|dkS)zetry to determine whether the benefit of multiple processes can
    outweigh the cost of starting themFg333333�?)�_DISALLOW_THREAD_UNSAFEr �
_STARTUP_COST)r�	costperop�nops�
threadsafe�linear�workers�benefitrrr�
worthwhile~srHcCsX|�dd�}|rtturt�sd}|r%t||t|�|d�r%t|||||�S|||f�S)a0run a function, possibly in parallel in multiple worker
    processes.

    returns a progress iterator

    costperarg - cost of a single task

    func - function to run. It is expected to return a progress iterator.

    staticargs - arguments to pass to every invocation of the function

    args - arguments to split into chunks, to pass to individual
    workers

    hasretval - when True, func and the current function return an progress
    iterator then a dict (encoded as an iterator that yield many (False, ..)
    then a (True, dict)). The dicts are joined in some arbitrary order, so
    overlapping keys are a bad idea.

    threadsafe - whether work items are thread safe and can be executed using
    a thread-based worker. Should be disabled for CPU heavy tasks that don't
    release the GIL.
    rsenabledF)rD)�
configbool�_platformworker�_posixworkerr%rH�len)r�
costperarg�func�
staticargs�args�	hasretvalrD�enabledrrr�worker�srSc#s��t|�}t�tj��t�tjtj�t�dg����fdd��d��fdd�	����fdd�}t�tj|��|��t�	�}g�i}t
|t|t|���D]��t�
�\������f�d	}	zlz)t��}
|
dkr�t�tj��t�tj�������
�fd
d�}t�||�}	Wnt�	�|kr��t��d}t|t�}
|j|
d�YWt�	�|kr�zz|��WnYWt�|	d
@�n6t�|	d
@�wn-t�	�|kr�zz|��Wn
YWt�|	d
@�wWt�|	d
@�wt�|	d
@�ww��|
�qNt���	�D]\��t����	�t��dd�tj��q����	�fdd�}zmt��}|dk�r��	��D]X\}}zt j!�"t#|j$��}|�rR|d�rR|�%|d�n|VW�q4t&�yq�	�'|j$�|j$��|d8}Y�q4t(�y�}z|j)t)j*k�r�WYd}~�q4�d}~ww|dk�s0Wn
��|��|�}|�r�|dk�r�t�+t�	�|�t,�-|��|�r�d|fVdSdS)Nrcs`t�tj���D]$}z	t�|tj�Wq	ty-}z
|jtjkr#�WYd}~q	d}~wwdSr!)�signal�SIGCHLDr
�kill�SIGTERM�OSError�errno�ESRCH)�p�err)�oldchldhandler�pidsrr�killworkers�s����z!_posixworker.<locals>.killworkersTcs����D]W}d}}	zt�||rdntj�\}}Wn*tyD}z|jtjkr.WYd}~q
|jtjkr?��|�WYd}~n�d}~ww|sHq��|�t	|�}|r[�ds[|�d<qdSr/)
�copyr
�waitpid�WNOHANGrXrY�EINTR�ECHILD�discard�_exitstatus)�blocking�pidr[�st�e)r^�problemrr�waitforworkers�s.
��

��z$_posixworker.<locals>.waitforworkerscs �dd��dr��dSdS)NF)rgrr)�signum�frame)r_rkrlrr�sigchldhandler�s

�z$_posixworker.<locals>.sigchldhandlerr.cs`�dd�D]\}}t�|�t�|�qt������f�D]}t��tj�|��q!dS)Nr.r)r
�close�writer
�pickle�dumps)�r�w�result)rN�pargs�pipes�rfdrO�wfdrr�
workerfunc�s

z _posixworker.<locals>.workerfunc)�force��rbcs2t�tj����t�tj������dSr/)rT�SIGINTrUrpr)r]�
oldhandlerrk�selectorrlrr�cleanups
z_posixworker.<locals>.cleanupr�T).r rT�	getsignalr�SIG_IGN�setrU�flushr
�getpid�	partitionrrL�pipe�append�forkr	�	callcatch�sys�exc_info�
issubclass�KeyboardInterrupt�	traceback�_exit�add�	selectors�DefaultSelectorrp�register�fdopen�
EVENT_READ�selectr
rr�loadr&�fileobj�update�EOFError�
unregister�IOErrorrYrcrVr�WorkerError)rrNrOrPrQrFro�	parentpid�retvalr9rhr{�exctyper|r��	openpipes�key�events�resrj�statusr)
rNr_r]r�rwr^rxrkryr�rOrlrzrrK�s��
	��� �� �

�
��
��

�rKcCs.t�|�r
t�|�St�|�rt�|�SdS)z�convert a posix exit status into the same form returned by
    os.spawnv

    returns None if the process was stopped instead of exitingN)r
�	WIFEXITED�WEXITSTATUS�WIFSIGNALED�WTERMSIG)�coderrr�_posixexitstatusAs



�r�c	#s��Gdd�dtj�}g���fdd�}t��}tj��}tj��}	i}
t||d�D]}|	�|�q*t|�D]}||	|||�}
��	|
�|
�
�q6zKt��dkr�|��sm|�
�}|rf|drf|
�|d�n|V|��rT�d�d�d	d
��D�}|D]}
|
jdur�|
j���|
�q}t��dksPWn
ttfy�|��w|��s�|�
�}|r�|dr�|
�|d�n|V|��r�|r�d|
fVdSdS)Nc@s$eZdZdd�Zdd�Zdd�ZdS)z_windowsworker.<locals>.Workerc_sHtjj|g|�Ri|��||_||_||_||_d|_d|_d|_	dS)NFT)
r"�Threadr*�
_taskqueue�_resultqueue�_func�_staticargs�_interrupted�daemon�	exception)r(�	taskqueue�resultqueuerNrOrP�kwargsrrrr*Ns
z'_windowsworker.<locals>.Worker.__init__cSs
d|_dS)NT)r�r-rrr�	interruptZr+z(_windowsworker.<locals>.Worker.interruptc
Ss�z?|j��s=z!|j��}|j|j|f�D]}|j�|�|jr%WWdSqWn
tj	j
y4YWdSw|j��rWdSWdStyO}z||_�d}~wwr!)
r��empty�
get_nowaitr�r�r��putr�r�queue�Empty�	Exceptionr�)r(rPr�rjrrr�run]s&


������z"_windowsworker.<locals>.Worker.runN)r;r<r=r*r�r�rrrr�WorkerMsr�cs^t��d}�D]}|��q�D]}|t��}|�|�|��r,��td��dSqdS)Nrs:failed to kill worker threads while handling an exception
)�timer��join�is_alive�warnr)�
cleanupend�t�
remainingtime��threadsrrr�trykillworkersss

����z&_windowsworker.<locals>.trykillworkers�rrg�������?cSsg|]}|��s|�qSr)r�)�.0�_trrr�
<listcomp>�sz"_windowsworker.<locals>.<listcomp>T)r"r�r rr��Queuer�r��ranger��startrLr��getr�r�r��remover�r�)rrNrOrPrQr�r�rFr�r�r�rw�_ir�r��finishedthreadsrr�r�_windowsworkerLsV�$



�
��
���r�ccs$�t|�D]
}||d|�VqdS)a�partition a list into N slices of roughly equal size

    The current strategy takes every Nth element from the input. If
    we ever write workers that need to preserve grouping in input
    we should consider allowing callers to specify a partition strategy.

    olivia is not a fan of this partitioning strategy when files are involved.
    In his words:

        Single-threaded Mercurial makes a point of creating and visiting
        files in a fixed order (alphabetical). When creating files in order,
        a typical filesystem is likely to allocate them on nearby regions on
        disk. Thus, when revisiting in the same order, locality is maximized
        and various forms of OS and disk-level caching and read-ahead get a
        chance to work.

        This effect can be quite significant on spinning disks. I discovered it
        circa Mercurial v0.4 when revlogs were named by hashes of filenames.
        Tarring a repo and copying it to another disk effectively randomized
        the revlog ordering on disk by sorting the revlogs by hash and suddenly
        performance of my kernel checkout benchmark dropped by ~10x because the
        "working set" of sectors visited no longer fit in the drive's cache and
        the workload switched from streaming to random I/O.

        What we should really be doing is have workers read filenames from a
        ordered queue. This preserves locality and also keeps any worker from
        getting more than one file out of balance.
    N)r�)�lst�nslices�irrrr��s��r�r�)FT)'�
__future__rrYr
rTr�r"r�r��BaseSelector�ImportError�
thirdpartyr�i18nr�rrrr	r
rr �ispy3r%�objectr&�isposix�	iswindowsrAr@rHrSrKr�r�rJrfr�rrrr�<module>sN
�	!

�%c