|
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
�]LbH � @ s� d Z ddlmZ ddlZddlZddlmZ ddlmZ ddl m
Z
m Z m Z ddd �Z
dd d �ZG d
d� de�ZeZe jdded�Z
ddd�ZdS )a;
Algorithm works in the following way. You have two repository: local and
remote. They both contains a DAG of changelists.
The goal of the discovery protocol is to find one set of node *common*,
the set of nodes shared by local and remote.
One of the issue with the original protocol was latency, it could
potentially require lots of roundtrips to discover that the local repo was a
subset of remote (which is a very common case, you usually have few changes
compared to upstream, while upstream probably had lots of development).
The new protocol only requires one interface for the remote repo: `known()`,
which given a set of changelists tells you if they are present in the DAG.
The algorithm then works as follow:
- We will be using three sets, `common`, `missing`, `unknown`. Originally
all nodes are in `unknown`.
- Take a sample from `unknown`, call `remote.known(sample)`
- For each node that remote knows, move it and all its ancestors to `common`
- For each node that remote doesn't know, move it and all its descendants
to `missing`
- Iterate until `unknown` is empty
There are a couple optimizations, first is instead of starting with a random
sample of missing, start by sending all heads, in the case where the local
repo is a subset, you computed the answer in one round trip.
Then you can do something similar to the bisecting strategy used when
finding faulty changesets. Instead of random samples, you can try picking
nodes that will maximize the number of nodes that will be
classified with it (since all ancestors or descendants will be marked as well).
� )�absolute_importN� )�_��nullrev)�error�policy�utilc C s� i }t �|�}t� }d}|r_|�� } | |v rq |�| d�}
|
|kr%|d9 }|
|kr8|�| � |r8t|�|kr8dS |�| � || �D ]} | tkrZ| rM| | v rZ|�| |
d � |�| � qA|sdS dS )a[ update an existing sample to match the expected size
The sample is updated with revs exponentially distant from each head of the
<revs> set. (H~1, H~2, H~4, H~8, etc).
If a target size is specified, the sampling will stop once this size is
reached. Otherwise sampling will happen until roots of the <revs> set are
reached.
:revs: set of revs we want to discover (if None, assume the whole dag)
:heads: set of DAG head revs
:sample: a sample to update
:parentfn: a callable to resolve parents for a revision
:quicksamplesize: optional target size of the sampler � N) � collections�deque�set�popleft�
setdefault�add�lenr �append) �revs�heads�sample�parentfn�quicksamplesize�dist�visit�seen�factor�curr�d�p� r �8/usr/lib/python3/dist-packages/mercurial/setdiscovery.py�
_updatesample9 s,
� �r! Tc C sD t | �|kr| S |rtt�| |��S t| �} | �� t| d|� �S )z�return a random subset of sample of at most desiredlen item.
If randomize is False, though, a deterministic subset is returned.
This is meant for integration tests.
N)r r
�randomr �list�sort)r �
desiredlen� randomizer r r � _limitsample_ s r' c @ s~ e Zd ZdZd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z e
dd� �Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd � Zd S ) �partialdiscoveryab an object representing ongoing discovery
Feed with data from the remote repository, this object keep track of the
current set of changeset in various states:
- common: revs also known remotely
- undecided: revs we don't have information on yet
- missing: revs missing remotely
(all tracked revisions are known locally)
Tc C s< || _ || _|j�� | _d | _t� | _d | _|| _ || _
d S �N) �_repo� _targetheads� changelog�incrementalmissingrevs�_common�
_undecidedr
�missing� _childrenmap� _respectsizer& )�self�repo� targetheads� respectsizer& r r r �__init__z s
zpartialdiscovery.__init__c C s, | j �|� | jdur| j �| j� dS dS )z register nodes known as commonN)r. �addbasesr/ �removeancestorsfrom)r3 �commonsr r r �
addcommons� s
�zpartialdiscovery.addcommonsc C s6 | j �d|| j�}|r| j�|� | j�|� dS dS )z register some nodes as missings %ld::%ldN)r* r � undecidedr0 �update�difference_update)r3 �missings�
newmissingr r r � addmissings� s
�z partialdiscovery.addmissingsc C sX t � }t � }|D ]\}}|r|�|� q|�|� q|r!| �|� |r*| �|� dS dS )z*consume an iterable of (rev, known) tuplesN)r
r r; rA )r3 r �commonr0 �rev�knownr r r �addinfo� s
�zpartialdiscovery.addinfoc C �
| j �� S )z6return True is we have any clue about the remote state)r. �hasbases�r3 r r r �hasinfo� s
zpartialdiscovery.hasinfoc C s | j duo| j S )z1True if all the necessary data have been gatheredN)r/ rH r r r �
iscomplete� s zpartialdiscovery.iscompletec C s* | j d ur| j S t| j�| j��| _ | j S r) )r/ r
r. �missingancestorsr+ rH r r r r< � s
zpartialdiscovery.undecidedc C s dt | j�iS )Nr< )r r< rH r r r �stats� s
�zpartialdiscovery.statsc C rF )z!the heads of the known common set)r. �
basesheadsrH r r r � commonheads� s
z partialdiscovery.commonheadsc s | j jjj� � fdd�}|S )Nc s � | �dd� S )N� � r )�r��getrevr r �
getparents� s z3partialdiscovery._parentsgetter.<locals>.getparents)r* r, �index� __getitem__)r3 rT r rR r �_parentsgetter� s z partialdiscovery._parentsgetterc C sz | j d ur | j jS i | _ }| �� }| j}t|�D ] }g ||< ||�D ]}|tkr*q#|�|�}|d ur8|�|� q#q|jS r) )r1 rV rW r< �sortedr �getr )r3 �children�
parentrevsr rC �prev�cr r r �_childrengetter� s
��z partialdiscovery._childrengetterc C sb | j }t|�|kr
t|�S t| j�d|��}t|�|kr$t||| jd�S td||| � � |d� |S )a takes a quick sample of size <size>
It is meant for initial sampling and focuses on querying heads and close
ancestors of heads.
:headrevs: set of head revisions in local DAG to consider
:size: the maximum size of the sample�
heads(%ld)�r& N)r )
r< r r# r
r* r r' r& r! rW )r3 �headrevs�sizer r r r r �takequicksample� s �z partialdiscovery.takequicksamplec C s | j }t|�|kr
t|�S | j}t|�d|��}| �� }|�� }t||||� t|�d|��}| � � } t|||| � |s>J �| j
sMt |t t|�t|���}t
||| jd�}t|�|k r�|t|� }
t|| �} | jru|�t�| |
�� |S | �� |�| d |
� � |S )Nr_ s
roots(%ld)r` )r< r r# r* r
r rW �copyr! r^ r2 �max�minr' r& r= r" r r$ ) r3 ra rb r r4 r r[ � revsheads� revsroots� childrenrevs�more�takefromr r r �takefullsample� s0 �z partialdiscovery.takefullsampleN�T)�__name__�
__module__� __qualname__�__doc__r7 r; rA rE rI rJ �propertyr< rL rN rW r^ rc rl r r r r r( n s
r( � discovery�PartialDiscovery)�member�defaultc ( s� t | �dd��}t�� }d}|j} | j� | j�|dur%�fdd�|D �}
n dd� | �� D �}
| �dd�} | � dd �} | � dd
�}
| r�|j
rOt |
| �}t |�}n|
}| �
d � |d 7 }|�� � }|�d
i �}|�dd� fdd�|D �i�}W d � n1 s~w Y |�� |�� }}|dur�d |d< | �� tkr�|| jgkr�| jgd|fS | jgdg fS n |�� �}|�d
i �}W d � n1 s�w Y |�� }| �td�� g }|D ]}|| jkr�q�z |��|�� W q� tjy� Y q�w | �r-t|�t|�k�r
| �
d� |d|fS t|�t|
�k�r-t|��r-| �td�� � fdd�|
D �}|d|fS |j j}|dd�}|�o<|j
}|dd�}|�pG|j
}| �dd�}| j j �rWt } nt } | ||
||d�} | �rq| �!|� | �"t#||�� | } | j$td �td �d �} | �%� �s| �s�| �&� �r�| �r�| �td �� n| �
d � | j'} |
}!|�r�t(|
| �}
n
| �
d!� | j)} | }!| |
|!�}|d 7 }| �*|� | �+� }"| �
d"||"d# t|�f � t |�}|�� �}|�dd� fd$d�|D �i��� }W d � n 1 �s�w Y d} | �"t#||�� | �%� �r�| �,� }#t�� | }$| �-� | �
d%||$f � d&}%t.|#�t.|� }&| �/d'|%t|#�t|&�||$� |du�rF||d< |#�sh|| jgk�rh|�rZt�0td(���| �1td)�� | jhd|fS || jgk}'� fd*d+�|#D �}#|#|'|fS ),a Return a tuple (common, anyincoming, remoteheads) used to identify
missing nodes from or in remote.
The audit argument is an optional dictionnary that a caller can pass. it
will be updated with extra data about the discovery, this is useful for
debug.
s devels discovery.grow-sample.rater Nc � g | ]}� |��qS r r )�.0�n)�clrevr r �
<listcomp>6 � z#findcommonheads.<locals>.<listcomp>c S s g | ]}|t kr|�qS r r )rx rC r r r r{ 8 s s discovery.exchange-headss discovery.sample-size.initials discovery.sample-sizes query 1; heads
r s headss knowns nodesc rw r r �rx rQ ��clnoder r r{ r| s total-roundtripsTFs searching for changes
s all remote heads known locally
s$ all local changesets known remotely
c rw r r r} r~ r r r{ � r| s discovery.grow-samples discovery.grow-sample.dynamics discovery.randomizer` s searchings queries)�units sampling from both directions
s taking initial sample
s taking quick initial sample
s2 query %i; still undecided: %i, sample size is: %i
r< c rw r r r} r~ r r r{ � r| s %d total queries in %.4fs
sD found %d common and %d unknown server heads, %d roundtrips in %.4fs
s discoverys repository is unrelateds! warning: repository is unrelated
c s h | ]}� |��qS r r r} r~ r r � <setcomp> r| z"findcommonheads.<locals>.<setcomp>)2�float�configr �timerr, �noderC ra �
configbool� configint�limitedargumentsr' r# �debug�commandexecutor� callcommand�result�tiprevr �nullid�statusr r r � LookupErrorr �all�note�uirU �rust_ext_compatr( �pure_partialdiscoveryr; rE �zip� makeprogressrJ rI rl �intrc r= rL rN �completer
�log�Abort�warn)(r� �local�remote�abortwhenunrelated� ancestorsof�audit� samplegrowth�start�
roundtrips�cl�ownheads�initial_head_exchange�initialsamplesize�fullsamplesizer �e�fheads�fknown�
srvheadhashes�yesno�
knownsrvheadsr� �
ownheadhashesr� � grow_sample�dynamic_sample�hard_limit_sampler& �pd�disco�full�progress�
samplefunc�
targetsizerL r� �elapsed�msgr0 � anyincomingr )r rz r �findcommonheads s 4
�� � �
�
�
�
��
��� �
�) �
�
r� )r rm )TNN)rq �
__future__r r r" �i18nr r� r � r r r r! r' �objectr( r� �
importrustr� r r r r �<module> s& #
& (� �