|
Server : Apache System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64 User : dh_edsupp ( 6597262) PHP Version : 8.2.26 Disable Function : NONE Directory : /lib/python3/dist-packages/mercurial/__pycache__/ |
Upload File : |
o
�]Lb�| � @ s
d Z ddlmZmZ ddlZddlZddlZddlZddlZddl Z ddl
Z
ddl Z ddl Z ddl
Z
ddlZddlZddlZddlZddlZddlZddlZddlZddlmZ ddlmZ ddl m Z m Z m Z m Z ddlmZ ddl!m"Z" dd l#m$Z$m%Z%m&Z&m'Z'm Z m(Z( dd
l)m*Z*m+Z+m,Z,m-Z- e j.r�dd l/m0Z0m1Z1m2Z2m3Z3 e'�4d �Z5e'�4d
�Z6e5j7Z7e5j8Z8e j9Z9e j:Z:e j;Z;e j<Z<e j=Z=e j>Z>e>Z?e j@Z@e(jAZAe(jBZBe(jCZCe jDZEe jFr�ddl#mGZ nddl#mHZ e&jIZIejJZJejKZKejLZLejMZMejNZNejOZOejPZPejQZQejRZRejSZSejTZTejUZUejVZVejWZWe6jXZXejYZYejZZZej[Z[ej\Z\ej]Z]ej^Z^ej_Z_ej`Z`ejaZaejbZbejcZcejdZdejeZeejfZfejgZgejhZhejiZiejjZjejkZkejlZlejmZmejnZne e6dejo�ZoejpZpejqZqejrarejsZsejtZtdd� Zue*jvZve*jwZwe*jxZxze6jyZyW n
ez�y� Y nw e{� Z|dd� Z}e~e$j��d��Z�e��r�e��dde�d� e��dde�d� e��dde�d� e��r�e j��r�e��dd e�d� e��dd e�d� e��dd e�d� d�d d �Z�e j�e+j�e j�d!�Z�g d"�Z�e�D ]
Z�e�e�v �s�J ��q�G d#d$� d$e{�Z�G d%d&� d&e{�Z�ze�Z�W n e��y d�d'd(�Z�Y nw d)Z�G d*d+� d+e{�Z�d�d,d-�Z�G d.d/� d/e{�Z�G d0d1� d1e��Z�h d2�Z�G d3d4� d4e{�Z�G d5d6� d6e{�Z�G d7d8� d8e��Z� 9�d d;d<�Z�G d=d>� d>e��Z� 9 9 9 : 9�dd?d@�Z�dAdB� Z��ddDdE�Z�dFdG� Z�G dHdI� dIe{�Z�G dJdK� dKej��Z�G dLdM� dMe�e��Z�G dNdO� dOe�e��Z�G dPdQ� dQe{�Z�ej�d�dRdS��Z�ej�d�dTdU��Z�G dVdW� dWe{�Z�G dXdY� dYe{�Z�dZd[� Z�G d\d]� d]e{�Z�d^d_� Z��ddbdc�Z�ddde� Z�dfdg� Z�dhdi� Z�e j��r�djdk� Z�dldm� Z�d�dndo�Z�h dp�Z� : : : 9�ddqdr�Z��ddsdt�Z�h du�Z�dvZ�dwdx� Z�e edyd�Z�e jF�r)e�Z�e��s(ej�Z�n ej�Z�e��s2ejZ�dzd{� Z�d|d}� Z�d~d� Z�d�d�� Z�d�dk� a�zddl�Z�da�W n eŐyZ d:a�Y nw G d�d�� d�e{�Z�eƃ Zi Z�d�d�� Z�d�d�� Z�d�d�� Z�d�d�� Zːdd�d��Z�G d�d�� d�e{�Z�G d�d�� d�e{�Zΐdd�d��Z�d�d�� ZАdd�d��Z�d�d�� Z�d�d�� Z�d�d�� Z�G d�d�� d�e{�ZՐd d�d��Z�G d�d�� d�e{�Z�d�d�� Z�d�d�� Z�e�d�d�eId��fd�d�eId��fdd�eId��fd�d�eId��fd�d�eId��fdd�eId��fd�d`eId��fd�d`eId��fdd`eId��fddeId��f�
Z�G d�d�� d�e{�Z�e��d��Z�d�d�� Z�d�d�� Z�d�d�� Z�e j�d�k�r-e�Z�e�Z�e�Z�n e j�Z�e j�Z�e j�Z�e�� d�k�rHej�d�k �rHd�dń Z�nd�dń Z�d�dȄ Z�d�dʄ Z�dd�d̄Z�e�dd�eIdfd�deIdσfd�deIdЃfddeIdуfd�d�eIdӃfd�d�eIdԃfdd�eIdՃfd�d�eId׃fd�d�eIdfdd�eIdكfd�d�eIdۃfd�d�eId܃fdd�eId݃f�
Z�ej�G d�d߄ d�e{��Z�ej�d�d� �Z�de�_�d�d� Z�d�Z�d�d� Z�G d�d� d�e{�Z�d
d�d�Z�d�de,j�e,j�dd�fd�d�Z�e�Z�d�d�d�Z�d�d� Z�d�d�� Z�d�d�� Z�ej�d�d�� �Z�d�d�� Z�dS ( z�Mercurial utility functions and platform specific implementations.
This contains helper routines that are independent of the SCM core and
hide platform-specific details from the core.
� )�absolute_import�print_functionN� )�hex)�attr)�delattr�getattr�open�setattr)�tracing)�encoding�error�i18n�policy�pycompat� urllibcompat)� compression�hashutil�procutil�
stringutil)�Iterator�List�Optional�Tuple�base85�osutil)�windows)�posix� statfilesc C s& t jrdS t�| � | d@ t_adS )z%updates the umask. used by chg serverNi� )r � iswindows�os�umask�platform)�val� r$ �0/usr/lib/python3/dist-packages/mercurial/util.py�setumask� s
r& c C s d}| D ]}||O }q|S �Nr r$ )� container�bits�bitr$ r$ r% �bitsfrom� s
r+ s HGEMITWARNINGS�default� � mercurial�hgext�hgext3rd�ignorez
bad escapezinvalid escape sequencez the imp module is deprecatedc C s: t r| d| 7 } t�t�| �t|d � tj�� dS dS )zxIssue an python native deprecation warning
This is a noop outside of tests, use 'ui.deprecwarn' when possible.
sF
(compatibility will be dropped after Mercurial-%s, update your code.)r N) �_dowarn�warnings�warnr �sysstr�DeprecationWarning�sys�stderr�flush)�msg�version�
stacklevelr$ r$ r% �nouideprecwarn� s ��r= )� md5� sha1� sha512)r@ r? r> c @ s> e Zd ZdZddd�Zdd� Zdd� Zd d
� Zed d � �Z d
S )�digestera� helper to compute digests.
This helper can be used to compute one or more digests given their name.
>>> d = digester([b'md5', b'sha1'])
>>> d.update(b'foo')
>>> [k for k in sorted(d)]
['md5', 'sha1']
>>> d[b'md5']
'acbd18db4cc2f85cedef654fccc4a4d8'
>>> d[b'sha1']
'0beec7b5ea3f0fdbc95d0dd47f3c5bc275da8a33'
>>> digester.preferred([b'md5', b'sha1'])
'sha1'
� c C sP i | _ |D ]}|tvrt�td�| ��t| � | j |< q|r&| �|� d S d S �Ns unknown digest type: %s)�_hashes�DIGESTSr
�Abort�_�update)�self�digests�s�kr$ r$ r% �__init__� s �zdigester.__init__c C s | j �� D ]}|�|� qd S �N)rD �valuesrH )rI �data�hr$ r$ r% rH s �zdigester.updatec C s, |t vr
t�td�t ��t| j| �� �S rC )rE r
rF rG rL r rD �digest)rI �keyr$ r$ r% � __getitem__
s zdigester.__getitem__c C �
t | j�S rN )�iterrD �rI r$ r$ r% �__iter__ �
zdigester.__iter__c C s t D ]
}|| v r | S qdS )z@returns the strongest digest type in both supported and DIGESTS.N)�DIGESTS_BY_STRENGTH)� supportedrL r$ r$ r% � preferred s
�zdigester.preferredN)rB )
�__name__�
__module__� __qualname__�__doc__rM rH rT rX � staticmethodr\ r$ r$ r$ r% rA � s
rA c @ �* e Zd ZdZdd� Zd
dd�Zdd� Zd S ) �
digestcheckerz�file handle wrapper that additionally checks content against a given
size and digests.
d = digestchecker(fh, size, {'md5': '...'})
When multiple digests are given, all of them are validated.
c C s0 || _ || _d| _t|�| _t| j�� �| _d S r' )�_fh�_size�_got�dict�_digestsrA �keys� _digester)rI �fh�sizerJ r$ r$ r% rM % s
zdigestchecker.__init__���c C s. | j �|�}| j�|� | jt|�7 _|S rN )rd �readrj rH rf �len)rI �length�contentr$ r$ r% rn , s zdigestchecker.readc C sj | j | jkrt�td�| j | jf ��| j�� D ]\}}|| j| kr2t�td�||| j| f ��qd S )Ns" size mismatch: expected %d, got %ds %s mismatch: expected %s, got %s)re rf r
rF rG rh �itemsrj �rI rL �vr$ r$ r% �validate2 s
������zdigestchecker.validateN�rm )r] r^ r_ r` rM rn ru r$ r$ r$ r% rc s
rc c C s, |d urt | �||| � S t | �|d � S rN )�
memoryview)� sliceable�offsetrp r$ r$ r% �bufferE s rz i c s| e Zd ZdZ� fdd�Zdd� Zedd� �Zedd � �Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� Zefdd�Z� ZS )�bufferedinputpipeaW a manually buffered input pipe
Python will not let us use buffered IO and lazy reading with 'polling' at
the same time. We cannot probe the buffer state and select will not detect
that data are ready to read if they are already buffered.
This class let us work around that by implementing its own buffering
(allowing efficient readline) while offering a way to know if the buffer is
empty from the output (allowing collaboration of the buffer with polling).
This class lives in the 'util' module because it makes use of the 'os'
module from the python stdlib.
c s t |t�rt} tt| ��| �S rN )�
isinstance�fileobjectproxy�observedbufferedinputpipe�superr{ �__new__)�clsrk �� __class__r$ r% r� ] s
zbufferedinputpipe.__new__c C s || _ g | _d| _d| _d S )NFr )�_input�_buffer�_eof�_lenbuf)rI �inputr$ r$ r% rM e �
zbufferedinputpipe.__init__c C rU )z�True is any data is currently buffered
This will be used externally a pre-step for polling IO. If there is
already data then no polling should be set in place.)�boolr� rW r$ r$ r% � hasbufferk s
zbufferedinputpipe.hasbufferc C s | j jS rN )r� �closedrW r$ r$ r% r� s s zbufferedinputpipe.closedc C �
| j �� S rN )r� �filenorW r$ r$ r% r� w rY zbufferedinputpipe.filenoc C r� rN )r� �closerW r$ r$ r% r� z rY zbufferedinputpipe.closec C s2 | j s| j|k r| �� | j s| j|k s| �|�S rN )r� r� � _fillbuffer� _frombuffer�rI rl r$ r$ r% rn } s �
zbufferedinputpipe.readc C s2 | j s| jdkr| �t|t�� | �t| j|��S r' )r� r� r� �max�
_chunksizer� �minr� r$ r$ r% �unbufferedread� s z bufferedinputpipe.unbufferedreadc O s� t | j�dkrd�| j�g| _t | jd �| _d}| jr$| jd �d�}| jsA|dk rA| �� | jr:| jd �d�}| jsA|dk s+|d }|dk rM| j}nt | j�dkr`|| jt | jd � 7 }| �|�S )Nr rB r rm �
)ro r� �joinr� �findr� r� r� )rI �args�kwargs�lfirl r$ r$ r% �readline� s" �
zbufferedinputpipe.readlinec C s| |dks| j s dS | j d }t| j �dkrd�| j �}|d|� }|t|�d� }|r6|g| _ t|�| _|S g | _ d| _|S )zYreturn at most 'size' data from the buffer
The data are removed from the buffer.r rB r N)r� ro r� r� )rI rl �bufrP r$ r$ r% r� � s
�z bufferedinputpipe._frombufferc C sB t �| j�� |�}|sd| _|S | jt|�7 _| j�|� |S )zread data to the bufferT) r rn r� r� r� r� ro r� �append)rI rl rP r$ r$ r% r� � s � z bufferedinputpipe._fillbuffer)r] r^ r_ r` r� rM �propertyr� r� r� r� rn r� r� r� r� r� �
__classcell__r$ r$ r� r% r{ N s
r{ c sj |dkrdS |d u r d}t � d� fdd��� }z
tj||tjd�W S ty4 t�|�jdkr3Y dS � w )Nr rB r� c s � S rN r$ r$ ��fpr$ r% �<lambda>� � zmmapread.<locals>.<lambda>)�access)r �mmap� ACCESS_READ�
ValueErrorr �fstat�st_size)r� rl �fdr$ r� r% �mmapread� s �r� c @ s� e Zd ZdZdZdd� Zdd� Zdd� ZeZd d
� Z d d � Z
d
d� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Z d1d2� Z d3d4� Z d5d6� Z d7S )8r} z�A proxy around file objects that tells a watcher when events occur.
This type is intended to only be used for testing purposes. Think hard
before using it in important code.
��_orig� _observerc C � t �| d|� t �| d|� d S �Nr� r� ��object� __setattr__)rI rk �observerr$ r$ r% rM � � zfileobjectproxy.__init__c C s. h d�}||v rt �| |�S tt �| d�|�S )N> rn �seek�tellr� r9 �read1�write�detachr� �isatty�readall�readable�readintor� �seekable�truncate�writabler� � readlines�
writelinesr� �r� �__getattribute__r )rI �name�oursr$ r$ r% r� � s z fileobjectproxy.__getattribute__c C � t t�| d��S �Nr� �r� r� r� rW r$ r$ r% � __nonzero__ � zfileobjectproxy.__nonzero__c C � t t�| d�|�S r� �r r� r� �rI r� r$ r$ r% � __delattr__ � zfileobjectproxy.__delattr__c C � t t�| d�||�S r� �r
r� r� �rI r� �valuer$ r$ r% r� � zfileobjectproxy.__setattr__c C s t �| d��� S r� )r� r� rX rW r$ r$ r% rX r� zfileobjectproxy.__iter__c O �V t �| d�}t||�|i |��}t �| d�}t||d �}|r)||g|�R i |�� |S r� r� �rI r� r� r� �orig�resr� �fnr$ r$ r% �
_observedcall � z fileobjectproxy._observedcallc O � t �| d�dg|�R i |��S )Nr� r� �r� r� �rI r� r� r$ r$ r% r� �
���zfileobjectproxy.closec O r� )Nr� r� r� r� r$ r$ r% r� % r� zfileobjectproxy.filenoc O r� )Nr� r9 r� r� r$ r$ r% r9 * r� zfileobjectproxy.flushc O r� )Nr� r� r� r� r$ r$ r% r� / r� zfileobjectproxy.isattyc O r� )Nr� r� r� r� r$ r$ r% r� 4 r� zfileobjectproxy.readablec O r� )Nr� r� r� r� r$ r$ r% r� 9 r� zfileobjectproxy.readlinec O r� )Nr� r� r� r� r$ r$ r% r� > r� zfileobjectproxy.readlinesc O r� )Nr� r� r� r� r$ r$ r% r� C r� zfileobjectproxy.seekc O r� )Nr� r� r� r� r$ r$ r% r� H r� zfileobjectproxy.seekablec O r� )Nr� r� r� r� r$ r$ r% r� M r� zfileobjectproxy.tellc O r� )Nr� r� r� r� r$ r$ r% r� R r� zfileobjectproxy.truncatec O r� )Nr� r� r� r� r$ r$ r% r� W r� zfileobjectproxy.writablec O r� )Nr� r� r� r� r$ r$ r% r� \ r� zfileobjectproxy.writelinesc O r� )Nr� rn r� r� r$ r$ r% rn a r� zfileobjectproxy.readc O r� )Nr� r� r� r� r$ r$ r% r� f r� zfileobjectproxy.readallc O r� )Nr� r� r� r� r$ r$ r% r� k r� zfileobjectproxy.readintoc O r� )Nr� r� r� r� r$ r$ r% r� p r� zfileobjectproxy.writec O r� )Nr� r� r� r� r$ r$ r% r� u r� zfileobjectproxy.detachc O r� )Nr� r� r� r� r$ r$ r% r� z r� zfileobjectproxy.read1N) r] r^ r_ r` � __slots__rM r� r� �__bool__r� r� rX r� r� r� r9 r� r� r� r� r� r� r� r� r� r� rn r� r� r� r� r� r$ r$ r$ r% r} � s< & r} c s8 e Zd ZdZ� fdd�Z� fdd�Z� fdd�Z� ZS )r~ a� A variation of bufferedinputpipe that is aware of fileobjectproxy.
``bufferedinputpipe`` makes low-level calls to ``os.read()`` that
bypass ``fileobjectproxy``. Because of this, we need to make
``bufferedinputpipe`` aware of these operations.
This variation of ``bufferedinputpipe`` can notify observers about
``os.read()`` events. It also re-publishes other events, such as
``read()`` and ``readline()``.
c s0 t t| ��� }t| jjdd �}|r||t� |S )N�osread)r r~ r� r r� r� r� )rI r� r� r� r$ r% r� � s
z%observedbufferedinputpipe._fillbufferc s2 t t| ��|�}t| jjdd �}|r|||� |S )N� bufferedread)r r~ rn r r� r� )rI rl r� r� r� r$ r% rn � s
z observedbufferedinputpipe.readc s6 t t| �j|i |��}t| jjdd �}|r||� |S )N�bufferedreadline)r r~ r� r r� r� )rI r� r� r� r� r� r$ r% r� � s
z"observedbufferedinputpipe.readline)r] r^ r_ r` r� rn r� r� r$ r$ r� r% r~ � s
r~ > �recv�send�sendto�sendall�makefile�recvfrom� recv_into�
gettimeout�
setsockopt�
settimeout� setblocking�
recvfrom_intoc @ s� e Zd ZdZdZdd� Zdd� Zdd� Zd d
� Zd d � Z e Z
d
d� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'S )(� socketproxyz�A proxy around a socket that tells a watcher when events occur.
This is like ``fileobjectproxy`` except for sockets.
This type is intended to only be used for testing purposes. Think hard
before using it in important code.
r� c C r� r� r� )rI �sockr� r$ r$ r% rM � r� zsocketproxy.__init__c C s& |t v r
t�| |�S tt�| d�|�S r� )�PROXIED_SOCKET_METHODSr� r� r r� r$ r$ r% r� � s z socketproxy.__getattribute__c C r� r� r� r� r$ r$ r% r� � r� zsocketproxy.__delattr__c C r� r� r� r� r$ r$ r% r� � r� zsocketproxy.__setattr__c C r� r� r� rW r$ r$ r% r� � r� zsocketproxy.__nonzero__c O r� r� r� r� r$ r$ r% r� � r� zsocketproxy._observedcallc O sL t �| d�dg|�R i |��}t �| d�}t|j||j|j|j|j|jd�S )Nr� r� r� ��reads�writes�logdata� logdataapis) r� r� �makeloggingfileobjectrk r� r� r� r� r� )rI r� r� r� r� r$ r$ r% r� � s"
��� �zsocketproxy.makefilec O r� )Nr� r� r� r� r$ r$ r% r� � r� zsocketproxy.recvc O r� )Nr� r� r� r� r$ r$ r% r� r� zsocketproxy.recvfromc O r� )Nr� r� r� r� r$ r$ r% r� r� zsocketproxy.recvfrom_intoc O r� )Nr� � recv_infor� r� r$ r$ r% r� r� zsocketproxy.recv_intoc O r� )Nr� r� r� r� r$ r$ r% r� r� zsocketproxy.sendc O r� )Nr� r� r� r� r$ r$ r% r� r� zsocketproxy.sendallc O r� )Nr� r� r� r� r$ r$ r% r� r� zsocketproxy.sendtoc O r� )Nr� r� r� r� r$ r$ r% r� r� zsocketproxy.setblockingc O r� )Nr� r� r� r� r$ r$ r% r� % r� zsocketproxy.settimeoutc O r� )Nr� r� r� r� r$ r$ r% r� * r� zsocketproxy.gettimeoutc O r� )Nr� r� r� r� r$ r$ r% r� / r� zsocketproxy.setsockoptN)r] r^ r_ r` r� rM r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r% r� � s, r� c @ s e Zd Zdd� Zdd� ZdS )�baseproxyobserverc C s || _ || _|| _|| _d S rN )rk r� r� r� )rI rk r� r� r� r$ r$ r% rM 6 r� zbaseproxyobserver.__init__c C s� | j s| jr| j�d� | j�� d S d|vr;| jr&| j�dt�|� � n| j�d| jt�|�f � | j�� d S | jrD| j�d� |�d�}|D ]}| j�d| jt�|�f � qK| j�� d S )Nr� s : %s
s %s> %s
s :
T) r� r� rk r� r9 r � escapestrr� �
splitlines)rI rP �lines�liner$ r$ r% �
_writedata< s*
�
�z baseproxyobserver._writedataN)r] r^ r_ rM r r$ r$ r$ r% r� 5 s r� c s` e Zd ZdZ d� fdd� Zddd�Zdd d
�Zd d � Zd
d� Zdd� Z dd� Z
dd� Z � Z S )�fileobjectobserverzLogs file object activity.TFc s& t t| ��||||� || _|| _d S rN )r r rM r� r� )rI rk r� r� r� r� r� r� r$ r% rM ] s
zfileobjectobserver.__init__rm c C sZ | j sd S |d u r d}|dkr|dkrd S | jr&| j�d| j|t|�f � | �|� d S )NrB rm s %s> read(%d) -> %d�r� r� rk r� r� ro r �rI r� rl r$ r$ r% rn d s zfileobjectobserver.readc C �8 | j sd S | jr| j�d| jt|�f � | �|� d S )Ns %s> readline() -> %dr )rI r� �limitr$ r$ r% r� w s
zfileobjectobserver.readlinec C sd | j sd S | jr| j�d| jt|�|f � |d ur |d|� nd}t|t�r+|�� }| � |� d S )Ns %s> readinto(%d) -> %rr rB )
r� r� rk r� r� ro r| rw �tobytesr )rI r� �destrP r$ r$ r% r� � s �
zfileobjectobserver.readintoc C sN | j sd S |d u r|rt|�}| jr | j�d| jt|�|f � | �|� d S )Ns %s> write(%d) -> %r)r� ro r� rk r� r� r )rI r� rP r$ r$ r% r� � s zfileobjectobserver.writec C �$ | j sd S | j�d| j|f � d S )Ns %s> flush() -> %r
)r� rk r� r� �rI r� r$ r$ r% r9 � � zfileobjectobserver.flushc C s: | j sd S | jr| j�d| j|t|�f � | �|� d S )Ns %s> bufferedread(%d) -> %dr r r$ r$ r% r� � s �z fileobjectobserver.bufferedreadc C r )Ns %s> bufferedreadline() -> %dr r
r$ r$ r% r� � s �z#fileobjectobserver.bufferedreadline�TTFTrv )
r] r^ r_ r` rM rn r� r� r� r9 r� r� r� r$ r$ r� r% r Z s �
r TFc C s t | |||||d�}t||�S )z.Turn a file object into a logging file object.r� )r r} )�loghrk r� r� r� r� r� r� r$ r$ r% r� � s �
r� c s� e Zd ZdZ d � fdd� Zd!dd�Zd"d
d �Zd"d d
�Zd"dd�Zd#dd�Z d"dd�Z
d"dd�Z d$dd�Z dd� Z
dd� Zd d � Zd d � Z� ZS )%�socketobserverzLogs socket activity.TFc s, t t| ��||||� || _|| _|| _d S rN )r r rM r� r� �states)rI rk r� r� r� r r� r� r� r$ r% rM � s
zsocketobserver.__init__Nc C s& | j sd S | j�d| j||f � d S )Ns %s> makefile(%r, %r)
�r rk r� r� )rI r� �mode�bufsizer$ r$ r% r� � s zsocketobserver.makefiler c C s< | j sd S | jr| j�d| j||t|�f � | �|� d S )Ns %s> recv(%d, %d) -> %dr �rI r� rl �flagsr$ r$ r% r� � s �zsocketobserver.recvc C sD | j sd S | jr| j�d| j||t|d �f � | �|d � d S )Ns %s> recvfrom(%d, %d) -> %dr r r r$ r$ r% r� � s ��zsocketobserver.recvfromc C sH | j sd S | jr| j�d| j|||d f � | �|d|d � � d S )Ns %s> recvfrom_into(%d, %d) -> %dr �r� r� rk r� r� r �rI r� r� rl r r$ r$ r% r� � s ��z socketobserver.recvfrom_intoc C s@ | j sd S | jr| j�d| j|||f � | �|d|� � d S )Ns %s> recv_into(%d, %d) -> %dr r r r$ r$ r% r� s �zsocketobserver.recv_intoc C s: | j sd S | j�d| jt|�|t|�f � | �|� d S )Ns %s> send(%d, %d) -> %d)r� rk r� r� ro r �rI r� rP r r$ r$ r% r� s �zsocketobserver.sendc C s: | j sd S | jr| j�d| jt|�|f � | �|� d S )Ns %s> sendall(%d, %d)�r� r� rk r� r� ro r r r$ r$ r% r� s �zsocketobserver.sendallc C sL | j sd S |r
|}nd}| jr | j�d| jt|�|||f � | �|� d S )Nr s %s> sendto(%d, %d, %r) -> %dr )rI r� rP �flagsoraddress�addressr r$ r$ r% r� ( s ��zsocketobserver.sendtoc C �$ | j sd S | j�d| j|f � d S )Ns %s> setblocking(%r)
r )rI r� �flagr$ r$ r% r� 9 r zsocketobserver.setblockingc C r )Ns %s> settimeout(%r)
r )rI r� r� r$ r$ r% r� ? r zsocketobserver.settimeoutc C r )Ns %s> gettimeout() -> %f
r r
r$ r$ r% r� E r zsocketobserver.gettimeoutc C s* | j sd S | j�d| j||||f � d S )Ns! %s> setsockopt(%r, %r, %r) -> %r
r )rI r� �level�optnamer� r$ r$ r% r� K s ��zsocketobserver.setsockopt�TTTFT�NN�r )r r rN )r] r^ r_ r` rM r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r� r% r � s( �
r c C s t | ||||||d�}t||�S )z$Turn a socket into a logging socket.)r� r� r r� r� )r r� ) r rk r� r� r� r r� r� r� r$ r$ r% �makeloggingsocketU s �
r% c C s* z
ddl m} | jW S ty Y dS w )z(Return version information if available.r �� __version__s unknown)r- r' r; � ImportErrorr& r$ r$ r% r; m s �r; � c C s | st � } t�d| �}|sd| }}n|�d�r |�� \}}n|�d�d}}|dus-J �g }|�d�D ]}z |�t|�� W q4 tyI Y nw t |�dk r[|�d� t |�dk sP|dkrg|d |d fS |dkrv|d |d |d fS |d kr�|d |d |d |fS t
� d
| ��) az Parses a Mercurial version string into an N-tuple.
The version string to be parsed is specified with the ``v`` argument.
If it isn't defined, the current Mercurial version string will be parsed.
``n`` can be 2, 3, or 4. Here is how some version strings map to
returned values:
>>> v = b'3.6.1+190-df9b73d2d444'
>>> versiontuple(v, 2)
(3, 6)
>>> versiontuple(v, 3)
(3, 6, 1)
>>> versiontuple(v, 4)
(3, 6, 1, '190-df9b73d2d444')
>>> versiontuple(b'3.6.1+190-df9b73d2d444+20151118')
(3, 6, 1, '190-df9b73d2d444+20151118')
>>> v = b'3.6'
>>> versiontuple(v, 2)
(3, 6)
>>> versiontuple(v, 3)
(3, 6, None)
>>> versiontuple(v, 4)
(3, 6, None, None)
>>> v = b'3.9-rc'
>>> versiontuple(v, 2)
(3, 9)
>>> versiontuple(v, 3)
(3, 9, None)
>>> versiontuple(v, 4)
(3, 9, None, 'rc')
>>> v = b'3.9-rc+2-02a8fea4289b'
>>> versiontuple(v, 2)
(3, 9)
>>> versiontuple(v, 3)
(3, 9, None)
>>> versiontuple(v, 4)
(3, 9, None, 'rc+2-02a8fea4289b')
>>> versiontuple(b'4.6rc0')
(4, 6, None, 'rc0')
>>> versiontuple(b'4.6rc0+12-425d55e54f98')
(4, 6, None, 'rc0+12-425d55e54f98')
>>> versiontuple(b'.1.2.3')
(None, None, None, '.1.2.3')
>>> versiontuple(b'12.34..5')
(12, 34, None, '..5')
>>> versiontuple(b'1.2.3.4.5.6')
(1, 2, 3, '.4.5.6')
s (\d+(?:\.\d+){,2})[+-]?(.*)rB � r N� .� r r) s invalid version part request: %d) r; �remod�match�group�groups�splitr� �intr� ro r
�ProgrammingError)rt �n�m�vparts�extra�vints�ir$ r$ r% � versiontuplew s4 7
�
�r: c sV �j jdkrg ���fdd�}|S i � �j jdkr"� �fdd�}|S � �fdd�}|S )z"cache the result of function callsr c s t ��dkr ��� � � �d S r' )ro r� r$ )�func� listcacher$ r% �f� s zcachefunc.<locals>.fr c s | � vr
�| �� | < � | S rN r$ ��arg��cacher; r$ r% r= � � c s | � vr
�| � � | < � | S rN r$ �r� r@ r$ r% r= � rB )�__code__� co_argcount�r; r= r$ )rA r; r< r% � cachefunc� s �rG c @ s e Zd ZdZdd� Zdd� ZdS )�cowz^helper class to make copy-on-write easier
Call preparewrite before doing any writes.
c C s( t | dd�r| jd8 _| �| �S | S )z;call this before writes, return self or a copied new object�_copiedr r )r rI r� rW r$ r$ r% � preparewrite� s
zcow.preparewritec C s t | dd�d | _| S )zalways do a cheap copyrI r r )r rI rW r$ r$ r% �copy� s zcow.copyN)r] r^ r_ r` rJ rK r$ r$ r$ r% rH � s rH c s6 e Zd ZdZ� fdd�Zejrdd� Zdd� Z� Z S )�sortdicta[ a simple sorted dictionary
>>> d1 = sortdict([(b'a', 0), (b'b', 1)])
>>> d2 = d1.copy()
>>> d2
sortdict([('a', 0), ('b', 1)])
>>> d2.update([(b'a', 2)])
>>> list(d2.keys()) # should still be in last-set order
['b', 'a']
>>> d1.insert(1, b'a.5', 0.5)
>>> d1
sortdict([('a', 0), ('a.5', 0.5), ('b', 1)])
c s$ || v r| |= t t| ��||� d S rN )r rL � __setitem__)rI rS r� r� r$ r% rM s zsortdict.__setitem__c K sD t |t�r
t�|�}|D ]\}}|| |< q |D ]}|| | |< qd S rN )r| rg r � iteritems)rI �srcr= rL rt r$ r$ r% rH s
�zsortdict.updatec C sH t t| �� ��D ]\}\}}||kr|| |< ||kr!| |= || |< qd S rN )� enumerate�listrr )rI �positionrS r� r9 rL rt r$ r$ r% �insert s ��zsortdict.insert)
r] r^ r_ r` rM r �ispypyrH rS r� r$ r$ r� r% rL s rL c @ � e Zd ZdZdS )�cowdicta� copy-on-write dict
Be sure to call d = d.preparewrite() before writing to d.
>>> a = cowdict()
>>> a is a.preparewrite()
True
>>> b = a.copy()
>>> b is a
True
>>> c = b.copy()
>>> c is a
True
>>> a = a.preparewrite()
>>> b is a
False
>>> a is a.preparewrite()
True
>>> c = c.preparewrite()
>>> b is c
False
>>> b is b.preparewrite()
True
N�r] r^ r_ r` r$ r$ r$ r% rV ( � rV c @ rU )� cowsortdictzZcopy-on-write sortdict
Be sure to call d = d.preparewrite() before writing to d.
NrW r$ r$ r$ r% rY C rX rY c @ sB e Zd ZdZejZejdd� �Zejdd� �Z dd� Z
dd � Z d
S ) �
transactionalzBBase class for making a transactional type into a context manager.c C � dS )z$Successfully closes the transaction.Nr$ rW r$ r$ r% r� O r� ztransactional.closec C r[ )zoMarks the end of the transaction.
If the transaction has not been closed, it will be aborted.
Nr$ rW r$ r$ r% �releaseS r� ztransactional.releasec C � | S rN r$ rW r$ r$ r% � __enter__Z � ztransactional.__enter__c C s8 z|d u r| � � W | �� d S W | �� d S | �� w rN )r� r\ )rI �exc_type�exc_val�exc_tbr$ r$ r% �__exit__] s
�ztransactional.__exit__N) r] r^ r_ r` �abc�ABCMeta�
__metaclass__�abstractmethodr� r\ r^ rc r$ r$ r$ r% rZ J s
rZ c c sX � | sdV dS z z dV | � � W n
tjy | � � � w W | �� dS | �� w )z�A context manager that closes the transaction on InterventionRequired
If no transaction was provided, this simply runs the body and returns
N)r� r
�InterventionRequiredr\ )�trr$ r$ r% �acceptinterventione s � ��rj c c s � | V d S rN r$ )� enter_resultr$ r$ r% �nullcontextmanagerx s �
rl c @ s$ e Zd ZdZdZdd� Zdd� ZdS )�
_lrucachenodez�A node in a doubly linked list.
Holds a reference to nodes on either side as well as a key-value
pair for the dictionary entry.
)�next�prevrS r� �costc C s" | | _ | | _t| _d | _d| _d S r' )rn ro �_notsetrS r� rp rW r$ r$ r% rM � s
z_lrucachenode.__init__c C s t | _d| _d| _dS )zMark the node as emptied.Nr )rq rS r� rp rW r$ r$ r% � markempty� s
z_lrucachenode.markemptyN)r] r^ r_ r` r� rM rr r$ r$ r$ r% rm } s
rm c @ s� e Zd ZdZd&dd�Zdd� Zdd� Zd d
� Zd d � Zd&d
d�Z dd� Z
dd� Z e fdd�Z
d'dd�Ze fdd�Zdd� Zd(d d �Zd d � Zd d!� Zd"d#� Zd$d%� ZdS ))� lrucachedicta Dict that caches most recent accesses and sets.
The dict consists of an actual backing dict - indexed by original
key - and a doubly linked circular list defining the order of entries in
the cache.
The head node is the newest entry in the cache. If the cache is full,
we recycle head.prev and make it the new head. Cache accesses result in
the node being moved to before the existing head and being marked as the
new head node.
Items in the cache can be inserted with an optional "cost" value. This is
simply an integer that is specified by the caller. The cache can be queried
for the total cost of all items presently in the cache.
The cache can also define a maximum cost. If a cache insertion would
cause the total cost of the cache to go beyond the maximum cost limit,
nodes will be evicted to make room for the new code. This can be used
to e.g. set a max memory limit and associate an estimated bytes size
cost to each item in the cache. By default, no maximum cost is enforced.
r c C s* i | _ t� | _d| _|| _d| _|| _d S )Nr r )�_cacherm �_headre �capacity� totalcost�maxcost)rI r� rx r$ r$ r% rM � s
zlrucachedict.__init__c C rU rN )ro rt rW r$ r$ r% �__len__� rY zlrucachedict.__len__c C s
|| j v S rN )rt �rI rL r$ r$ r% � __contains__� rY zlrucachedict.__contains__c c s. � | j }tt| j��D ] }|jV |j}q d S rN )ru �rangero rt rS rn )rI r4 r9 r$ r$ r% rX � s ��zlrucachedict.__iter__c C s | j | }| �|� |jS rN )rt � _movetoheadr� )rI rL �noder$ r$ r% rT � s
zlrucachedict.__getitem__c C s� | j �|�}|dur-| j|j8 _||_||_| j|7 _| �|� | jr+| �� dS | j| j k r8| �
� }n| j j }|j
turN| j|j8 _| j |j
= ||_
||_||_| j|7 _|| j |< || _ | jro| �� dS dS )z8Insert a new item in the cache with optional cost value.N)rt �getrw rp r� r} rx �_enforcecostlimitre rv � _addcapacityru ro rS rq )rI rL rt rp r~ r$ r$ r% rS � s2
�zlrucachedict.insertc C s | � ||� d S rN )rS rs r$ r$ r% rM � r� zlrucachedict.__setitem__c C s | � |� d S rN )�poprz r$ r$ r% � __delitem__� � zlrucachedict.__delitem__c C sr z| j �|�}W n ty |tu r� | Y S w |d us J �|j}| j|j8 _|�� | �|� |j | _
|S rN ) rt r� �KeyErrorrq r� rw rp rr r} rn ru )rI rL r, r~ r� r$ r$ r% r� � s �
zlrucachedict.popNc C s$ z| � |�W S ty | Y S w rN )rT r� )rI rL r, r$ r$ r% r
s
�zlrucachedict.getc C s@ z| j | }|dus J �|jW S ty |tu r� | Y S w )z�Get the specified item without moving it to the head
Unlike get(), this doesn't mutate the internal state. But be aware
that it doesn't mean peek() is thread safe.
N)rt r� r� rq )rI rL r, r~ r$ r$ r% �peek s
�zlrucachedict.peekc C sF | j }|jtur | j|j8 _|�� |j}|jtus| j�� d S rN ) ru rS rq rw rp rr rn rt �clear)rI r4 r$ r$ r% r� s
�zlrucachedict.clearc C s� |p| j }|p | j}t||d�}| jj}|jtu r+|| jur+|j}|jtu r+|| jus tt| j ��D ]}|j
|j|j |j d� |j}q2|S )a8 Create a new cache as a copy of the current one.
By default, the new cache has the same capacity as the existing one.
But, the cache capacity can be changed as part of performing the
copy.
Items in the copy have an insertion/access order matching this
instance.
)rx )rp )
rv rx rs ru ro rS rq r| ro rt rS r� rp )rI rv rx �resultr4 r9 r$ r$ r% rK ( s
�zlrucachedict.copyc C s| | j sdS | jj}|dusJ �|jtu r |j}|jtu s|dus"J �|j|j}}| j |j= | j|j8 _|�� ||fS )zuRemove the oldest item from the cache.
Returns the (key, value) describing the removed cache entry.
N) rt ru ro rS rq r� rw rp rr )rI r4 rS r� r$ r$ r% � popoldestG s
�
zlrucachedict.popoldestc C sF | j }|j|j_|j|j_|j|_|jj|_||j_||j_|| _ dS )aq Mark a node as the newest, making it the new head.
When a node is accessed, it becomes the freshest entry in the LRU
list, which is denoted by self._head.
Visually, let's make ``N`` the new head node (* denotes head):
previous/oldest <-> head <-> next/next newest
----<->--- A* ---<->-----
| |
E <-> D <-> N <-> C <-> B
To:
----<->--- N* ---<->-----
| |
E <-> D <-> C <-> B <-> A
This requires the following moves:
C.next = D (node.prev.next = node.next)
D.prev = C (node.next.prev = node.prev)
E.next = N (head.prev.next = node)
N.prev = E (node.prev = head.prev)
N.next = A (node.next = head)
A.prev = N (head.prev = node)
N)ru rn ro )rI r~ �headr$ r$ r% r} c s
zlrucachedict._movetoheadc C s: | j }t� }||j_|j|_||_||_| jd7 _|S )zhAdd a node to the circular linked list.
The new node is inserted before the head node.
r )ru rm ro rn re )rI r� r~ r$ r$ r% r� � s zlrucachedict._addcapacityc C s� t | �dks | j| jkrd S t| jd �}| jj}|jtu r&|j}|jtu s t | �dkrR| j|krV| j|j= | j|j 8 _|�
� |j}t | �dkrT| j|ks1d S d S d S d S )Nr g �?) ro rw rx r2 ru ro rS rq rt rp rr )rI �
targetcostr4 r$ r$ r% r� � s
�
&�z lrucachedict._enforcecostlimitr$ rN r' )r] r^ r_ r` rM ry r{ rX rT rS rM r� rq r� r r� r� rK r� r} r� r� r$ r$ r$ r% rs � s&
'
/ rs c s@ i � t �� ��jjdkr� ��fdd�}|S � ��fdd�}|S )z+cache most recent results of function callsr c sH | � vrt � �dkr� ��� = �| �� | < n��| � ��| � � | S �N� �ro �popleft�remover� r> �rA r; �orderr$ r% r= � �
zlrucachefunc.<locals>.fc sH | � vrt � �dkr� ��� = �| � � | < n��| � ��| � � | S r� r� rC r� r$ r% r= � r� )� collections�dequerD rE rF r$ r� r% � lrucachefunc� s �
r� c @ s& e Zd Zdd� Zddd�Zdd� ZdS ) �
propertycachec C s || _ |j| _d S rN )r; r] r� )rI r; r$ r$ r% rM � s zpropertycache.__init__Nc C s | � |�}| �||� |S rN )r; �
cachevalue)rI �obj�typer� r$ r$ r% �__get__� s
zpropertycache.__get__c C s ||j | j< d S rN )�__dict__r� )rI r� r� r$ r$ r% r� � s zpropertycache.cachevaluerN )r] r^ r_ rM r� r� r$ r$ r$ r% r� � s
r� c C s$ t �|�}|| jv r| j|= dS dS )z2clear a cached property value, if one has been setN)r r5 r� )r� �propr$ r$ r% �clearcachedproperty� s
�r� � � c c s� � dd� }g }d}| D ]5}|� |� |t|�7 }||kr@||k r6|d> }d||�> }||kr0|}||kr6|}d�|�V d}g }q |rKd�|�V dS dS )zrreturn no less than min bytes per chunk while data remains,
doubling min after each chunk until it reaches maxc S s, | sdS d}| r| dL } |d7 }| s|d S )Nr r r$ )�xr9 r$ r$ r% �log2� s �z increasingchunks.<locals>.log2r r rB N)r� ro r� )�sourcer� r� r� r� �blen�chunk�nminr$ r$ r% �increasingchunks� s, �
��r� c C r[ )NTr$ �r� r$ r$ r% �always r_ r� c C r[ �NFr$ r� r$ r$ r% �never r_ r� c � � fdd�}|S )a
disable garbage collector
Python's garbage collector triggers a GC each time a certain number of
container objects (the number being defined by gc.get_threshold()) are
allocated even when marked not to be tracked by the collector. Tracking has
no effect on when GCs are triggered, only on what objects the GC looks
into. As a workaround, disable GC while building complex (huge)
containers.
This garbage collector issue have been fixed in 2.7. But it still affect
CPython's performance.
c s@ t �� }t �� z� | i |��W |rt �� S S |r t �� w w rN )�gc� isenabled�disable�enable)r� r� � gcenabled�r; r$ r% �wrapper- s
�
�znogc.<locals>.wrapperr$ �r; r� r$ r� r% �nogc s r� c C r] rN r$ �r� r$ r$ r% r� ; r� r� c C s� |st |�S tj�|�r.tj�| �d tj�|�d kr%tj�| t |��S d�t| �|f�}t|�|�d�}}|� � |� � |r`|r`|d |d kr`|�
� |�
� |r`|r`|d |d ksL|� � t j �dgt
|� | �prdS )aa return the relative path from one place to another.
root should use os.sep to separate directories
n1 should use os.sep to separate directories
n2 should use "/" to separate directories
returns an os.sep-separated path.
If n1 is a relative path, it's assumed it's
relative to root.
n2 should always be relative to root.
r � /rm � ..r+ )� localpathr �path�isabs�
splitdriver� �pconvert� splitpathr1 �reverser� r �ossepro )�root�n1�n2�a�br$ r$ r% �pathto> s � r� c s � �fdd�}|S )z5wrap a function with code to check for calling errorsc sB z�| i |��W S t y tt�t�� d ��� kr tj�� w )Nr* )� TypeErrorro � traceback�
extract_tbr7 �exc_infor
�SignatureError)r� r� ��depthr; r$ r% �check] s �z checksignature.<locals>.checkr$ )r; r� r� r$ r� r% �checksignatureZ s r� >
� hfs� jfs� ufs� xfs� zfs� NTFS� apfs� ext2� ext3� ext4� btrfs� tmpfs� reiserfsc
C s |r|rJ �d}t j�|�r|r|ot�|�}t|� |rB|rBz
tt j�|��} W n ty4 d} Y nw | t vrB|dur@|� d}|ryzt
| |� |durUd}
t � |
��W dS t
tfyx } z| jtjkrn|durn|� W Y d} ~ nd} ~ ww t j�| �r�t �t �| �|� |dur�d}
t � |
��dS z]t�| |� |r�t�| |� n't�| |� |r�|jr�t�|�} | �|�r�|jtj d d@ }
t �||
|
f� |dur�t|dd��}|� |� W d � W dS 1 s�w Y W dS W dS tj �y } zt � t � |���d}~ww ) af copy a file, preserving mode and optionally other stat info like
atime/mtime
checkambig argument is used with filestat, and is useful only if
destination file is guarded by any lock (e.g. repo.lock or
repo.wlock).
copystat and checkambig should be exclusive.
nb_bytes: if set only copy the first `nb_bytes` of the source file.
NFz7the `nb_bytes` argument is incompatible with `hardlink`z"cannot use `nb_bytes` on a symlinkr ��zr+)r )!r r� �lexists�filestat�frompath�unlink� getfstype�dirname�OSError�_hardlinkfswhitelist�oslinkr
r3 �IOError�errno�EEXIST�islink�symlink�readlink�shutil�copyfile�copystat�copymode�stat�isambig�ST_MTIME�utimer r� �ErrorrF r � forcebytestr)rO r �hardlinkr� �
checkambig�nb_bytes�no_hardlink_cb�check_fs_hardlink�oldstat�fstyper5 �exc�newstat�advancedr= �instr$ r$ r% r� z sn �
��
�
� &����r� c
s\ d}� �fdd�}t j�| �rS� du r#t �| �jt �t j�|��jk� |� t �|� t| �D ] \}}t j�| |�}t j�||�} t || � ��\� }
||
7 }q/� |fS � du rkt �t j�| ��jt �t j�|��jk� |� � r�zt
| |� W n( t t fy� } z| j
t
jkr�d� t�| |� W Y d} ~ n d} ~ ww t�| |� |d7 }�r���� � |fS )z2Copy a directory tree using hardlinks if possible.r c s" �r� rt d�nt d��_d S d S )Ns linkings copying)rG �topicr$ �r� �progressr$ r% �settopic� s �zcopyfiles.<locals>.settopicNFr )r r� �isdirr� �st_devr� �mkdir�listdirr� � copyfilesr� r� r� r� r� r� rK � increment) rO �dstr� r �numr r� �kind�srcname�dstnamer4 r� r$ r r% r
� sD �
��� �� r
> � aux� con� nul� prn� com1� com2� com3� com4� com5� com6� com7� com8� com9� lpt1� lpt2� lpt3� lpt4� lpt5� lpt6� lpt7� lpt8� lpt9s :*?"<>|c C s� | � d�r td�S d| v rtd�S | �dd��d�D ]Z}|s qt|�D ]#}|tv r3td�| S t|�dkrFtd�t�|� S q#|�d �d
}|r^|� � t
v r^td�| S |d d � }|d
v rt|dvrttd�| S qd S )aU Check that the base-relative path is a valid filename on Windows.
Returns None if the path is ok, or a UI string describing the problem.
>>> checkwinfilename(b"just/a/normal/path")
>>> checkwinfilename(b"foo/bar/con.xml")
"filename contains 'con', which is reserved on Windows"
>>> checkwinfilename(b"foo/con.xml/bar")
"filename contains 'con', which is reserved on Windows"
>>> checkwinfilename(b"foo/bar/xml.con")
>>> checkwinfilename(b"foo/bar/AUX/bla.txt")
"filename contains 'AUX', which is reserved on Windows"
>>> checkwinfilename(b"foo/bar/bla:.txt")
"filename contains ':', which is reserved on Windows"
>>> checkwinfilename(b"foo/bar/b\07la.txt")
"filename contains '\\x07', which is invalid on Windows"
>>> checkwinfilename(b"foo/bar/bla ")
"filename ends with ' ', which is not allowed on Windows"
>>> checkwinfilename(b"../bar")
>>> checkwinfilename(b"foo\\")
"filename ends with '\\', which is invalid on Windows"
>>> checkwinfilename(b"foo\\/bar")
"directory name ends with '\\', which is invalid on Windows"
� \s3 filename ends with '\', which is invalid on Windowss \/s9 directory name ends with '\', which is invalid on Windowsr� s4 filename contains '%s', which is reserved on Windows� s3 filename contains '%s', which is invalid on Windowsr+ r rm Ns . r� s8 filename ends with '%s', which is not allowed on Windows) �endswithrG �replacer1 �_filenamebytestr�_winreservedchars�ordr r �lower�_winreservednames)r� r4 �c�base�tr$ r$ r% �checkwinfilename sL
��
� � ���� �����r3 � perf_counterc
C s� zt �| |�W S ty } z
|jtjkr� W Y d}~n
d}~w ty( Y nw t jt jB t jB t t dd�B }t �
||�}t � || � t � |� dS )z�Create a lock file atomically if possible
This may leave a stale lock file if symlink isn't supported and signal
interrupt is enabled.
N�O_BINARYr )
r r� r� r� r� �AttributeError�O_CREAT�O_WRONLY�O_EXCLr r r� r� )�info�pathname�whyr �ldr$ r$ r% �makelock] s �� � r> c
C s� zt | �W S ty! } z|jtjtjfvr� W Y d }~n
d }~w ty) Y nw t| d�� }|�� W d � S 1 s>w Y d S �N� rb)r� r� r� �EINVAL�ENOSYSr6 � posixfilern )r; r< r� r$ r$ r% �readlockq s
�� � $�rD c C s0 zt �| �� �W S ty t �| j� Y S w )z1stat file object that may not have fileno method.)r r� r� r6 r� r� r� r$ r$ r% r� ~ s
�r� c C s� t �| �}t j�| �\}}|�� }||kr |�� }||kr dS t j�||�}zt �|�}||kr3W dS W dS ty? Y dS w )z�
Return true if the given path is on a case-sensitive filesystem
Requires a path (like /foo/.hg) ending with a foldable final
directory component.
TF)r �lstatr� r1 �upperr. r� r� )r� �s1�dr� �b2�p2�s2r$ r$ r% �fscasesensitive� s
�rL c C r] rN r$ r� r$ r$ r% r� � r� c @ s* e Zd Zdd� Zd dd�Zedd� �ZdS )
�_rec C st d}d}z t t�||��aW d S ty daY d S ty9 t�|�}t�|�}t t�||��atjaY d S w )Ns \[([^\[]+)\]s [ui]F) r� �re2r. �_re2r( r� r r5 �
_re2_input)rI �
check_pattern� check_inputr$ r$ r% � _checkre2� s
�z
_re._checkre2r c C s� t du r| �� t r:|tjtjB @ dkr:|tj@ r d| }|tj@ r'd| }zt�t|��W S tjy9 Y nw t�||�S )z�Compile a regular expression, using re2 if possible
For best performance, use only re2-compatible regexp features. The
only flags from the re module that are re2-compatible are
IGNORECASE and MULTILINE.Nr s (?i)s (?m)) rO rS r- �
IGNORECASE� MULTILINErN �compilerP r
)rI �patr r$ r$ r% rV � s
� z _re.compilec C s t du r| �� t r
tjS tjS )z�Return the version of escape corresponding to self.compile.
This is imperfect because whether re2 or re is used for a particular
function depends on the flags, etc, but it's the best we can do.
N)rO rS rN �escaper- rW r$ r$ r% rX � s
z
_re.escapeNr$ )r] r^ r_ rS rV r� rX r$ r$ r$ r% rM � s
rM c C s� dd� }t j}t jr|t j }|�dd� t�d||f �}tj�|�}g }|� | �D ]<\}}|r7|�
|� q+|t vrA||�t |< t | } | � |�}
|
sY||� t |< } | � |�}
|�
|
p^|� tj�
||�}q+d�
|�S )a4 Get name in the case stored in the filesystem
The name should be relative to root, and be normcase-ed for efficiency.
Note that this function is unnecessary, and should not be
called, for case-sensitive filesystems (simply because it's expensive).
The root should be normcase-ed, too.
c S s dd� t �| �D �S )Nc S s i | ]}t |�|�qS r$ )�normcase)�.0r4 r$ r$ r% �
<dictcomp>� s z9fspath.<locals>._makefspathcacheentry.<locals>.<dictcomp>)r r )�dirr$ r$ r% �_makefspathcacheentry� r� z%fspath.<locals>._makefspathcacheentryr' s \\s ([^%s]+)|([%s]+)rB )r r� �osaltsepr* r- rV r r� �normpath�findallr� � _fspathcacher r� ) r� r� r] �seps�patternr\ r� �part�sep�contents�foundr$ r$ r% �fspath� s,
rh c C s\ d\}}}z�zUt jdtj�| � dtj�| �d�\}}t�|� d|dd� }t||� t|�}t |�dkW W |dur@|�� ||fD ]}z |durPt�
|� W qD t yZ Y qDw S t y� Y W |durl|�� ||fD ]}z |dur|t�
|� W qp t y� Y qpw d S w |dur�|�� ||fD ]}z |dur�t�
|� W q� t y� Y q�w w )
z5check whether hardlink count reporting works properly)NNN� .%s-s 1~��prefix�suffixr\ s %s2~N���r F) r �mkstempr r� �basenamer� r� r� rC �nlinksr� r� )�testfile�f1�f2r� r� r= r$ r$ r% �
checknlink s`
�
� �� �
� ���
� ��rt c C s" t | �tj�ptjo| �tj��S )z)Check path ends with os.sep or os.altsep.)r� r) r r� r^ �r� r$ r$ r% � endswithsep6 s
�rv c C s | � tj�S )z�Split path by os.sep.
Note that this function does not use os.altsep because this is
an alternative of simple "xxx.split(os.sep)".
It is recommended to use os.path.normpath() before using this
function if need.)r1 r r� ru r$ r$ r% r� @ s r� c C s t j�| �\}}tjd| d|d�\}}t �|� t| |||� |r$|S zIzt| d�}W n% tyQ } z| j t j
krC|W Y d} ~ W S t | dd�sL| | _ � d} ~ ww t|d�}
t
|�D ]} |
�| � q[|�� |
�� W |S zt �|� W � ty� Y � w )a Create a temporary file with the same contents from name
The permission bits are copied from the original file.
If the temporary file is going to be truncated immediately, you
can use emptyok=True as an optimization.
Returns the name of the temporary file.
ri � ~rj r@ N�filename� wb)r r� r1 r rn r� r� rC r� r� �ENOENTr rx �
filechunkiterr� r� r� ) r� �emptyok�
createmode�enforcewritablerH r� r� �temp�ifpr �ofpr� r$ r$ r% �
mktempcopyJ s>
��
� ��r� c @ sV e Zd ZdZdd� Zedd� �Zedd� �Zej Z dd � Z
d
d � Z d d
� Z dd� Z
dS )r� z�help to exactly detect change of a file
'stat' attribute is result of 'os.stat()' if specified 'path'
exists. Otherwise, it is None. This can avoid preparative
'exists()' examination on client side of this class.
c C s
|| _ d S rN )r� )rI r� r$ r$ r% rM } rY zfilestat.__init__c
C sR z
t �|�}W | |�S ty( } z|jtjkr� d }W Y d }~| |�S d }~ww rN )r r� r� r� rz )r� r� r� �errr$ r$ r% r� � s � ��zfilestat.frompathc C s t �|�� �}| |�S rN )r r� r� )r� r� r� r$ r$ r% �fromfp� s zfilestat.fromfpc C s� z!| j j|j jko | j t j |j t j ko | j t j |j t j kW S ty* Y nw z | j d u o5|j d u W S ty@ Y dS w r� )r� r� �ST_CTIMEr� r6 �rI �oldr$ r$ r% �__eq__� s �� � �zfilestat.__eq__c C s0 z
| j t j |j t j kW S ty Y dS w )a Examine whether new (= self) stat is ambiguous against old one
"S[N]" below means stat of a file at N-th change:
- S[n-1].ctime < S[n].ctime: can detect change of a file
- S[n-1].ctime == S[n].ctime
- S[n-1].ctime < S[n].mtime: means natural advancing (*1)
- S[n-1].ctime == S[n].mtime: is ambiguous (*2)
- S[n-1].ctime > S[n].mtime: never occurs naturally (don't care)
- S[n-1].ctime > S[n].ctime: never occurs naturally (don't care)
Case (*2) above means that a file was changed twice or more at
same time in sec (= S[n-1].ctime), and comparison of timestamp
is ambiguous.
Base idea to avoid such ambiguity is "advance mtime 1 sec, if
timestamp is ambiguous".
But advancing mtime only in case (*2) doesn't work as
expected, because naturally advanced S[n].mtime in case (*1)
might be equal to manually advanced S[n-1 or earlier].mtime.
Therefore, all "S[n-1].ctime == S[n].ctime" cases should be
treated as ambiguous regardless of mtime, to avoid overlooking
by confliction between such mtime.
Advancing mtime "if isambig(oldstat)" ensures "S[n-1].mtime !=
S[n].mtime", even if size of a file isn't changed.
F)r� r� r6 r� r$ r$ r% r� � s
�zfilestat.isambigc
C s` |j t j d d@ }z t�|||f� W dS ty/ } z|jtjkr*W Y d}~dS � d}~ww )aL Change file stat of specified path to avoid ambiguity
'old' should be previous filestat of 'path'.
This skips avoiding ambiguity, if a process doesn't have
appropriate privileges for 'path'. This returns False in this
case.
Otherwise, this returns True, as "ambiguity is avoided".
r r� NFT)r� r� r r� r� r� �EPERM)rI r� r� r r r$ r$ r% �
avoidambig� s � ��zfilestat.avoidambigc C s
| |k S rN r$ )rI �otherr$ r$ r% �__ne__� rY zfilestat.__ne__N)r] r^ r_ r` rM � classmethodr� r� r� �__hash__r� r� r� r� r$ r$ r$ r% r� u s
# r� c @ sB e Zd ZdZddd�Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dS )�atomictempfilea writable file object that atomically updates a file
All writes will go to a temporary copy of the original file. Call
close() when you are done writing, and atomictempfile will rename
the temporary copy to the original name, making the changes
visible. If the object is destroyed without being closed, all your
writes are discarded.
checkambig argument of constructor is used with filestat, and is
useful only if target file is guarded by any lock (e.g. repo.lock
or repo.wlock).
� w+bNFc C sj || _ t|d|v |d|v d�| _t| j|�| _|| _| jj| _| jj| _| jj| _| jj | _ | jj
| _
d S )N� w)r| r} r~ ) �_atomictempfile__namer� � _tempnamerC �_fp� _checkambigrn r� r� r� r� )rI r� r r} r� r$ r$ r% rM � s �
zatomictempfile.__init__c C s� | j jsI| j �� t| j�}| jot�|�}|rA|jrAt | j
|� t�|�}|� |�r?|jtj d d@ }t
�|||f� d S d S t | j
|� d S d S )Nr r� )r� r� r� r� r� r� r� r� r� �renamer� r� r� r r� )rI rx r� r� r r$ r$ r% r�
s
��zatomictempfile.closec C s> | j js zt�| j� W n ty Y nw | j �� d S d S rN )r� r� r r� r� r� r� rW r$ r$ r% �discard
s ��zatomictempfile.discardc C s t | d�r | �� d S d S )Nr� )� safehasattrr� rW r$ r$ r% �__del__
s
�zatomictempfile.__del__c C r] rN r$ rW r$ r$ r% r^
r_ zatomictempfile.__enter__c C s |d ur
| � � d S | �� d S rN )r� r� )rI �exctype�excvaluer� r$ r$ r% rc
s zatomictempfile.__exit__)r� NF)
r] r^ r_ r` rM r� r� r� r^ rc r$ r$ r$ r% r� � s
r� c C sJ |rt | � nt| � |r#z ttj�| �� W dS ty" Y dS w dS )z.unlink and remove the directory if it is emptyN)� tryunlinkr� �
removedirsr r� r� r� )r= �
ignoremissing�rmdirr$ r$ r% �
unlinkpath%
s
��r� c
C sD zt | � W dS ty! } z|jtjkr� W Y d}~dS d}~ww )z1Attempt to remove a file, ignoring ENOENT errors.N)r� r� r� rz )r= �er$ r$ r% r� 4
s ���r� c
C s� zt | |� W nb tyi } zV|jtjkr W Y d}~dS |jtjks$| s%� tj�t| ��}|| kr2� t |||� zt | |� W n ty^ } z|jtjkrYW Y d}~W Y d}~dS � d}~ww W Y d}~nd}~ww |durvt�
| |� dS dS )z�recursive directory creation with parent mode inheritance
Newly created directories are marked as "not to be indexed by
the content indexing service", if ``notindexed`` is specified
for "write" mode access.
N) �makedirr� r� r� rz r r� r� �abspath�makedirs�chmod)r� r �
notindexedr� �parentr$ r$ r% r� >
s2 �� ����r� c C s6 t | d�� }|�� W d � S 1 sw Y d S r? )r rn )r� r� r$ r$ r% �readfile\
s $�r� c C �: t | d��}|�|� W d � d S 1 sw Y d S )Nry �r r� �r� �textr� r$ r$ r% � writefileb
� "�r� c C r� )Ns abr� r� r$ r$ r% �
appendfileh
r� r� c @ s" e Zd ZdZdd� Zddd�ZdS )� chunkbufferzoAllow arbitrary sized chunks of data to be efficiently read from an
iterator over chunks of arbitrary size.c C s& dd� }||�| _ t�� | _d| _dS )z?in_iter is the iterator that's iterating over the input chunks.c s sZ � | D ]'}t |�dkr'd}|t |�k r&|d }|||� V |}|t |�k sq|V qd S )N� r � �ro )�chunksr� �pos�endr$ r$ r% �splitbigu
s � ���z&chunkbuffer.__init__.<locals>.splitbigr N)rV r� r� �_queue� _chunkoffset)rI �in_iterr� r$ r$ r% rM r
s
zchunkbuffer.__init__Nc
C s |du r
d� | j�S |}g }| j}|dkr�|s3d}| jD ]}|�|� |t|�8 }|dkr/ nq |s3nX|d }t|�}| j}|dkrT||krT||8 }|�� |�|� q|| } || krq|| 8 }|�� |�||d� � d| _n|�|||| � � | j|7 _|| 8 }|dksd� |�S )z�Read L bytes of data from the iterator of chunks of data.
Returns less than L bytes if the iterator runs dry.
If size parameter is omitted, read everythingNrB r r� )r� rV r� r� ro r� r� )
rI �l�leftr� �queue�targetr� �chunklry �chunkremainingr$ r$ r% rn �
sF
�
�
/zchunkbuffer.readrN )r] r^ r_ r` rM rn r$ r$ r$ r% r� n
s r� � c c sj � |dksJ �|du s|dksJ � |du r|}nt ||�}|o$| �|�}|s)dS |r1|t|�8 }|V q)aY Create a generator that produces the data in the file size
(default 131072) bytes at a time, up to optional limit (default is
to read all data). Chunks may be less than size bytes if the
chunk is the last chunk in the file, or the file is a socket or
some other type of file that sometimes reads less data than is
requested.r N)r� rn ro )r= rl r �nbytesrK r$ r$ r% r{ �
s �
�r{ c @ rb ) � cappedreadera� A file object proxy that allows reading up to N bytes.
Given a source file object, instances of this type allow reading up to
N bytes from that source file object. Attempts to read past the allowed
limit are treated as EOF.
It is assumed that I/O is not performed on the original file object
in addition to I/O that is performed by this instance. If there is,
state tracking will get out of sync and unexpected results will ensue.
c C s || _ || _dS )z,Allow reading up to <limit> bytes from <fh>.N)rd �_left)rI rk r r$ r$ r% rM �
s
zcappedreader.__init__rm c C sP | j sdS |dk r | j }| j�t|| j ��}| j t|�8 _ | j dks&J �|S )NrB r )r� rd rn r� ro )rI r4 rP r$ r$ r% rn �
s zcappedreader.readc C s2 | � t|��}|d u r
d S ||dt|��< t|�S r' )rn ro )rI r� r� r$ r$ r% r� �
s
zcappedreader.readintoNrv )r] r^ r_ r` rM rn r� r$ r$ r$ r% r� �
s
r� c r� )z@return a function that renders a readable count of some quantityc sD � D ]\}}}t | �|| kr|| t|� S q� d d | S )Nrm r* )�abs�float)�count�
multiplier�divisor�format�� unittabler$ r% �go s
�zunitcountfn.<locals>.gor$ )r� r� r$ r� r% � unitcountfn�
s r� c C s< || dk r
t �td���| dk rt �td���| d |fS )a� Check that linerange <fromline>:<toline> makes sense and return a
0-based range.
>>> processlinerange(10, 20)
(9, 20)
>>> processlinerange(2, 1)
Traceback (most recent call last):
...
ParseError: line range must be positive
>>> processlinerange(0, 5)
Traceback (most recent call last):
...
ParseError: fromline must be strictly positive
r s line range must be positiver s" fromline must be strictly positive)r
�
ParseErrorrG )�fromline�toliner$ r$ r% �processlinerange
s
r� �d � @s %.0f GB�
s %.1f GBs %.2f GBr� s %.0f MBs %.1f MBs %.2f MBs %.0f KBs %.1f KBs %.2f KBs
%.0f bytesc @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �transformingwriterz3Writable file wrapper to transform data by functionc C s || _ || _d S rN )r� �_encode)rI r� �encoder$ r$ r% rM 2 s
ztransformingwriter.__init__c C � | j �� d S rN )r� r� rW r$ r$ r% r� 6 r� ztransformingwriter.closec C r� rN )r� r9 rW r$ r$ r% r9 9 r� ztransformingwriter.flushc C s | j �| �|��S rN )r� r� r� )rI rP r$ r$ r% r� < r� ztransformingwriter.writeN)r] r^ r_ r` rM r� r9 r� r$ r$ r$ r% r� / s r� s \r*\nc C � t �d| �S )Nr� ��_eolre�sub�rK r$ r$ r% �tolfF � r� c C r� )N�
r� r� r$ r$ r% �tocrlfK r� r� c C s
t | t�S rN )r� r� r� r$ r$ r% � _crlfwriterP rY r� r� s CPython)r, r c C s: d}t | �tu rt�t�| �� �j�}|r| S t| j d�S )NTrB )
r� �filer� �S_ISREGr r� r� �st_moderV r� )r� �fastpathr$ r$ r% �iterfilez s r� c C r] rN r$ r� r$ r$ r% r� � r_ c c s$ � | D ] }|� � D ]}|V q qd S rN )r )�iteratorr� r r$ r$ r% � iterlines� s � ��r� c C s t j�t j�| ��S rN )r r� �
expanduser�
expandvarsru r$ r$ r% �
expandpath� s r� c sx � pdd� � d� ��� �}|r(|d| 7 }t| �dkr"| dd� }n| }|�|< t�d| |f �}|�� �fdd�|�S )a� Return the result of interpolating items in the mapping into string s.
prefix is a single character string, or a two character string with
a backslash as the first character if the prefix needs to be escaped in
a regular expression.
fn is an optional function that will be applied to the replacement text
just before replacement.
escape_prefix is an optional flag that allows using doubled prefix for
its escaping.
c S r] rN r$ r� r$ r$ r% r� � r� z interpolate.<locals>.<lambda>� |r Ns %s(%s)c s � �| � � dd � �S )Nr )r/ r� �r� �mappingr$ r% r� � s )r� ri ro r- rV r� )rk r� rK r� �
escape_prefix�patterns� prefix_char�rr$ r� r% � interpolate� s
r� g @�@s %.0f ss %.1f ss %.2f ss %.3f sg����MbP?s %.1f mss %.2f mss %.3f msg���ư>s %.1f uss %.2f uss %.3f usg��&� .>s %.1f nss %.2f nss %.3f nsc @ sP e Zd ZdZeje�dd� �d�Zejdd�Zejdd�Z dd� Z
e � e
�Z
d S )
� timedcmstatszFStats information produced by the timedcm context manager on entering.c C s t � S rN )�timerr$ r$ r$ r% r� � s ztimedcmstats.<lambda>)r, r r c C s | j rt| j �S dS )Ns <unknown>)�elapsed� timecountrW r$ r$ r% � __bytes__� r� ztimedcmstats.__bytes__N)r] r^ r_ r` r �ib�Factory�startr� r r� r � strmethod�__str__r$ r$ r$ r% r� � s r� c g s� � t jd7 _tt jd�}z>tj| g|�R � � |V W d � n1 s&w Y W t� |j |_t jd8 _dS W t� |j |_t jd8 _dS t� |j |_t jd8 _w )z�A context manager that produces timing information for a given context.
On entering a timedcmstats instance is produced.
This context manager is reentrant.
r )r N)�timedcm�_nestedr� r �logr� r� r� )� whencefmt�
whenceargs� timing_statsr$ r$ r% r � s �
���r c r� )z�Report the execution time of a function call to stderr.
During development, use as a decorator when you need to measure
the cost of a function, e.g. as follows:
@util.timed
def foo(a, b, c):
pass
c sn t t�� j���}� | i |��}W d � n1 sw Y tj}|�dd|j d t�� j�|f � |S )Ns %s%s: %s
� r* )r r �bytestrr] r r8 r� r )r� r� �
time_statsr� r8 r� r$ r% r� � s �
���ztimed.<locals>.wrapperr$ r� r$ r� r% �timed� s r ))� mr� )� kr� )� gr� )s kbr� )s mbr� )s gbr� )� br c C st | � � �� }z#tD ]\}}|�|�r$tt|dt|� � �| � W S q t|�W S ty9 t� t
d�| ��w )z�Convert a space specifier to a byte count.
>>> sizetoint(b'30')
30
>>> sizetoint(b'2.2kb')
2252
>>> sizetoint(b'6M')
6291456
Ns couldn't parse size: %s) �stripr. �
_sizeunitsr) r2 r� ro r� r
r� rG )rK r2 rL �ur$ r$ r% � sizetoint s
$�
�r c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �hooksz�A collection of hook functions that can be used to extend a
function's behavior. Hooks are called in lexicographic order,
based on the names of their sources.c C s
g | _ d S rN )�_hooksrW r$ r$ r% rM - rY zhooks.__init__c C s | j �||f� d S rN )r r� )rI r� �hookr$ r$ r% �add0 r� z hooks.addc G s8 | j jdd� d� g }| j D ] \}}|�||� � q|S )Nc S s | d S r' r$ r� r$ r$ r% r� 4 s z hooks.__call__.<locals>.<lambda>)rS )r �sortr� )rI r� �resultsr� r r$ r$ r% �__call__3 s
zhooks.__call__N)r] r^ r_ r` rM r r r$ r$ r$ r% r ( s
r � %-*s in %s
� %s:%dc # s� � � fdd�t �� d| d � D �| d� }|r=tdd� |D ��}|D ]\}}|du r4|||fV q%||||f V q%dS dS )a� Yields lines for a nicely formatted stacktrace.
Skips the 'skip' last entries, then return the last 'depth' entries.
Each file+linenumber is formatted according to fileline.
Each line is formatted according to line.
If line is None, it yields:
length of longest filepath+line number,
filepath+linenumber,
function
Not be used in production code but very convenient while developing.
c s0 g | ]\}}}}� t �|�|f t �|�f�qS r$ )r �sysbytes)rZ r� �lnr; �_text��fileliner$ r% �
<listcomp>G s
��z"getstackframes.<locals>.<listcomp>Nr c s s � | ] }t |d �V qdS �r Nr� )rZ �entryr$ r$ r% � <genexpr>L s � z!getstackframes.<locals>.<genexpr>)r� �
extract_stackr� )�skipr r r� �entries�fnmax�fnlnr; r$ r r% �getstackframes; s �
�� �r) s
stacktracerB c C sR |r|� � |�d|| �� f � t|d |d�D ] }|�|| � q|� � dS )aW Writes a message to f (stderr) with a nicely formatted stacktrace.
Skips the 'skip' entries closest to the call, then show 'depth' entries.
By default it will flush stdout first.
It can be used everywhere and intentionally does not require an ui object.
Not be used in production code but very convenient while developing.
s %s%s at:
r )r� N)r9 r� �rstripr) )r: r% r= �otherfr� rk r r$ r$ r% �debugstacktraceT s r, c C sh |du rt � }d| |f }||vr||vr|S t�d�D ]}d| ||f }||vr1||vr1| S q dS )a�
Generate a name that it is safe to rename f to in the given context.
f: filename to rename
tag: a string tag that will be included in the new name
ctx: a context, in which the new name must not exist
others: a set of other filenames that the new name must not be in
Returns a file name of the form oldname~tag[~number] which does not exist
in the provided context and is not in the set of other names.
Ns %s~%sr s %s~%s~%s)�set� itertoolsr� )r= �tag�ctx�othersr� r4 r$ r$ r% �safenamen s ��r2 c C s4 | � |�}t|�|k rt�td�t|�|f ��|S )z=read n bytes from stream.read and abort if less was availables5 stream ended unexpectedly (got %d bytes, expected %d))rn ro r
rF rG )�streamr4 rK r$ r$ r% � readexactly� s
��r4 c C sp | dk r t �d| ��| d@ }| dL } g }| r+|�t�d|B �� | d@ }| dL } | s|�t�|�� d�|�S )ai Encode an unsigned integer value to a varint.
A varint is a variable length integer of 1 or more bytes. Each byte
except the last has the most significant bit set. The lower 7 bits of
each byte store the 2's complement representation, least significant group
first.
>>> uvarintencode(0)
'\x00'
>>> uvarintencode(1)
'\x01'
>>> uvarintencode(127)
'\x7f'
>>> uvarintencode(1337)
'\xb9\n'
>>> uvarintencode(65536)
'\x80\x80\x04'
>>> uvarintencode(-1)
Traceback (most recent call last):
...
ProgrammingError: negative value for uvarint: -1
r s negative value for uvarint: %d� � � rB )r
r3 r� r �bytechrr� )r� r) �bytesr$ r$ r% �
uvarintencode� s �
r: c C s> d}d} t t| d��}||d@ |> O }|d@ s|S |d7 }q)a� Decode an unsigned variable length integer from a stream.
The passed argument is anything that has a ``.read(N)`` method.
>>> try:
... from StringIO import StringIO as BytesIO
... except ImportError:
... from io import BytesIO
>>> uvarintdecodestream(BytesIO(b'\x00'))
0
>>> uvarintdecodestream(BytesIO(b'\x01'))
1
>>> uvarintdecodestream(BytesIO(b'\x7f'))
127
>>> uvarintdecodestream(BytesIO(b'\xb9\n'))
1337
>>> uvarintdecodestream(BytesIO(b'\x80\x80\x04'))
65536
>>> uvarintdecodestream(BytesIO(b'\x80'))
Traceback (most recent call last):
...
Abort: stream ended unexpectedly (got 0 bytes, expected 1)
r Tr r5 r7 r6 )r- r4 )rk r� �shift�byter$ r$ r% �uvarintdecodestream� s �r= c
c sv � t �t jd �} | dkr6z!z t �t jd� W n
t jy Y nw d V W t �t j| � d S t �t j| � w d V d S )N�Cr- )�locale� setlocale�LC_CTYPEr� )�oldlocr$ r$ r% �
with_lc_ctype� s ��"
rC c s� t j�d�r8ddlm� m� ddlm} m}m }m
} G � �fdd�d| �}|� }||�|_ |j �
||�� |jS zt�tjd �}t�tjd �}|| W S tyW Y d S ty` Y d S w )
z�Provide an estimate for the available system memory in Bytes.
If no estimate can be provided on the platform, returns None.
s winr )�c_long� c_ulonglong)� Structure�byref�sizeof�windllc
sF e Zd Zd� fd� fd�fd�fd�fd�fd�fd�fd �fg Zd
S ) z'_estimatememory.<locals>.MEMORYSTATUSEX�dwLength� dwMemoryLoad� ullTotalPhys� ullAvailPhys�ullTotalPageFile�ullAvailPageFile�ullTotalVirtual�ullAvailVirtual�ullExtendedVirtualN)r] r^ r_ �_fields_r$ ��DWORD� DWORDLONGr$ r% �MEMORYSTATUSEX
s �rW � SC_PAGE_SIZE�
SC_PHYS_PAGESN)r � sysplatform�
startswith�ctypesrD rE �ctypes.wintypesrF rG rH rI rJ �kernel32�GlobalMemoryStatusExrM r �sysconf�
sysconf_namesr� r� )rF rG rH rI rW r� �pagesize�pagesr$ rT r% �_estimatememory� s"
�rd )r r! rN r r" )Nr) )r� r� )FFFNNTr# )FNF)FTr� )r� N)r r r r ( r` �
__future__r r rd r� �
contextlibr� r� �hashlibr. r? r� r r" �
pyplatform�rer- r� r� r7 �timer� r3 r~ r �
thirdpartyr r r r r r
�hgdemandimportr r- r r
r r r �utilsr r r r �
TYPE_CHECKING�typingr r r r � importmodr r � b85decode� b85encode� cookielib�httplib�pickler� � socketserver�bytesio�stringio� xmlrpclib�
httpserver�urlerr�urlreqr r+ r r r rG r� �bindunixsocket� cachestat� checkexec� checklinkr� � expandglobs�getfsmountpointr� � get_password� groupmembers� groupname�isexec�isownerr r� � lookupregr� rp r_ rY � normcasespec�normcasefallback�
openhardlinksr� �parsepatchoutputr� �pollrC r� r� r� �
samedevice�samefile�samestat�setflagsr1 r �
statisexec�
statislinkr! r� �usernamer& � compengines�
SERVERROLE�
CLIENTROLE�recvfdsr6 r� rq r+ r� �environr r2 �filterwarningsr6 �ispy3r= �md5�sha1�sha512rE rZ rL rA rc rz � NameErrorr� r{ r� r} r~ r� r� r� r r� r r% r; r: rG rH � OrderedDictrL rg rV rY rZ �contextmanagerrj rl rm rs r� r� r� r� r� r� r� rT r� r� r� r� r
r/ r, r3 r� �checkosfilename�clockr> rD r� rL rP rN rO r( rM ra rh rt rv r� r� r� r� r� r� r� r� r� r� r� r{ r� r� r� � bytecountr� rV r� r� r� r� � oslinesep� tonativeeol�
fromnativeeol�nativeeolwriter�identity�python_implementation� version_infor� r� r� r� r� rK r� r r r r r r r) r8 �stdoutr, r r2 r4 r: r= rC rd r$ r$ r$ r% �<module> sd
�
���
�0%�
n 3*{%e � �
W ' . !
� P- >�
�7-"
+j F
S' �
�
�
%-