File: //usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyc
�
1�3\c @@ s� d Z d d l m Z d d l Z d d l Z d d l m Z d d l m Z m Z d d l
m Z m Z d d � Z
d � Z d
� Z d � Z d d
e d d � Z d S( s;
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).
i ( t absolute_importNi ( t _( t nullidt nullrev( t errort utilc C@ s i } t j | � } t � } d } x� | r| j � } | | k rK q' n | j | d � }
|
| k rv | d 9} n |
| k r� | j | � | r� t | � | k r� d Sn | j | � xW | | � D]I } | t k r� | s� | | k r� | j | |
d � | j | � q� q� Wq' Wd S( s[ 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 samplei i N( t collectionst dequet sett popleftt
setdefaultt addt lenR t append( t revst headst samplet parentfnt quicksamplesizet distt visitt seent factort currt dt p( ( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt
_updatesample: s(
c C@ sZ t | j d | � � } t | � | k r7 t | | � St d | | | j j d | �| S( s, takes a quick sample of size <size>
It is meant for initial sampling and focuses on querying heads and close
ancestors of heads.
:dag: a dag object
:headrevs: set of head revisions in local DAG to consider
:revs: set of revs to discover
:size: the maximum size of the samples
heads(%ld)R N( R R R t _limitsampleR t Nonet changelogt
parentrevs( t repot headrevsR t sizeR ( ( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt _takequicksample_ s
c C@ sh t | j d | � � } t | j d | � � } t | | | | j j � t | j d | � � } i } | j j } xu | j j d t | � � D]X } | j | g � x? | | � D]1 }
|
t k r� q� n | j |
g � j | � q� Wq� Wt | | | | j � | s
t
� t | | � } t | � | k rd| t | � } | j
t j t | | � | � � n | S( Ns
heads(%ld)s
roots(%ld)t start( R R R R R t minR
R R
t __getitem__t AssertionErrorR R t updatet randomR t list( R R R R! R t revsheadst revsrootst childrenR t revt prevt more( ( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt _takefullsampler s&
" ! &c C@ s1 t | � | k r- t t j | | � � } n | S( s; return a random subset of sample of at most desiredlen item( R R R( R ( R t
desiredlen( ( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyR � s id i� c % @ s$ t j � } d } | j } | j � | j }
| d k r[ g | D] } |
| � ^ q@ } n+ g | j � D] }
|
t k rh |
^ qh } | j d � | d 7} t | | � } t
| � } | j � �K } | j d i � } | j d i g | D] } � | � ^ q� d 6� } Wd QX| j
� | j
� } � | j � t k rk| t g k r[t g t | f St g t g f S| j t d � � g } xQ | D]I } | t k r�q�n y | j |
| � � Wq�t j k
r�q�q�Xq�Wt | � t | � k r
| j d � | t | f St | � t | � k rmt � � rm| j t d
� � g | D] } � | � ^ qH} | t | f S| j | � } t � f d � t | � D� � } | j | � t | j | � � } t � } t } | j t d � d
t d � �} x| r| r|g t | � D] \ } } � | s | ^ q } | rS| j | j! d | | � � n | j | j! d | � � | j" | � n | s�Pn | s�| j# � r�| r�| j t d � � n
| j d � t$ } | } n | j d � t% } | } t | � | k r
t
| � } n | | | | | � } | d 7} | j | � | j d | t | � t | � f � t
| � } | j � �? } | j d i g | D] } � | � ^ q�d 6� j
� � Wd QXt } | r�t � f d � t | � D� � } | j | � | j& | � q�q�Wt | j! d | j' t h � � }! t j � | }" | j( � | j d | |" f � d }# t |! � t | � } | j) d |# t |! � t | � | |" � |! r�| t g k r�| r�t j* t d � � � n | j+ t d � � t h t | f S| t g k }$ � f d � |! D� }! |! |$ | f S( sl Return a tuple (common, anyincoming, remoteheads) used to identify
missing nodes from or in remote.
i s query 1; heads
i R t knownt nodesNs searching for changes
s all remote heads known locally
s all local heads known remotely
c 3@ s% | ] \ } } � | r | Vq d S( N( ( t .0t it n( t yesno( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pys <genexpr>� s t searchingt unitt queriess# descendants(%ld) - descendants(%ld)s descendants(%ld)s sampling from both directions
s taking initial sample
s taking quick initial sample
s2 query %i; still undecided: %i, sample size is: %i
c 3@ s% | ] \ } } � | r | Vq d S( N( ( R4 R5 R6 ( R7 ( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pys <genexpr> s s
heads(%ld)s %d total queries in %.4fs
sD found %d common and %d unknown server heads, %d roundtrips in %.4fs
t discoverys repository is unrelateds! warning: repository is unrelated
c @ s h | ] } � | � � q S( ( ( R4 t r( t clnode( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pys <setcomp>8 s (, R t timerR t nodeR- R R R t debugR R) t commandexecutort callcommandt resultt tipR t Truet Falset statusR R
R t LookupErrorR t allt notet incrementalmissingrevsR t enumeratet addbasest missingancestorst makeprogressR' R t difference_updatet hasbasesR0 R" t removeancestorsfromt basest completet logt Abortt warn(% t uit localt remotet initialsamplesizet fullsamplesizet abortwhenunrelatedt ancestorsofR# t
roundtripst clt clrevR6 t ownheadsR- R t et fheadsR< t fknownt
srvheadhashest srvheadsR? t
ownheadhashest commont commoninsamplet undecidedt missingt fullt progressR5 t missinginsamplet
samplefunct
targetsizeRC t elapsedt msgt anyincoming( ( R= R7 s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt findcommonheads� s� "+
,
$
"
! /
2"
"
!( t __doc__t
__future__R R R( t i18nR R? R R t R R R R" R0 R RE R Ru ( ( ( s< /usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt <module>) s % (