\x89\x50\x4E\x47\x0D\x0A\x1A\x0A PNG  \x89\x50\x4E\x47\x0D\x0A\x1A\x0A  13\c@@sdZddlmZddlZddlZddlmZddlmZm Z ddl m Z m Z ddZ d Zd Zd Zd d eddZdS(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(tabsolute_importNi(t_(tnullidtnullrev(terrortutilc C@si}tj|}t}d}x|r|j} | |krKq'n|j| d} | |krv|d9}n| |kr|j| |rt||krdSn|j| xW|| D]I} | tkr| s| |kr|j| | d|j| qqWq'WdS(s[update an existing sample to match the expected size The sample is updated with revs exponentially distant from each head of the 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 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 sampleiiN( t collectionstdequetsettpopleftt setdefaulttaddtlenRtappend( trevstheadstsampletparentfntquicksamplesizetdisttvisittseentfactortcurrtdtp((s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt _updatesample:s(         cC@sZt|jd|}t||kr7t||Std|||jjd||S(s,takes a quick sample of 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)RN(RRR t _limitsampleRtNonet changelogt parentrevs(trepotheadrevsRtsizeR((s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt_takequicksample_s  c C@s\t|jd|}t|jd|}t||||jjt|jd|}i}|jj}xu|jjdt|D]X} |j| gx?|| D]1} | tkrqn|j| gj| qWqWt||||j t ||}t ||krX|t |} |j t jt||| n|S(Ns heads(%ld)s roots(%ld)tstart(RRRRRtminR RR t __getitem__RR tupdatetrandomRtlist( RR RR!Rt revsheadst revsrootstchildrenRtrevtprevtmore((s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt_takefullsamplers$  " !&cC@s1t||kr-ttj||}n|S(s;return a random subset of sample of at most desiredlen item(R RR'R(Rt desiredlen((s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyRsidic% @s$tj}d}|j} | j| j} |dk r[g|D]} | | ^q@} n+g| jD]} | tkrh| ^qh} |jd|d7}t | |}t |}|j K}|j di}|j dig|D]}|^qd6}WdQX|j |j }| jtkrk|tgkr[tgt|fStgtgfS|jtdg}xQ|D]I}|tkrqny|j| |Wqtjk rqqXqWt|t|kr |jd |t|fSt|t| krmtrm|jtd g| D]}|^qH}|t|fS| j|}tfd t|D}|j|t|j| }t}t}|jtd d td}x|r|r|gt|D]\}} |s | ^q }|rS|j |j!d||n|j |j!d||j"|n|sPn|s|j#r|r|jtdn |jdt$}|} n|jdt%}|} t|| kr t |}n||| || }|d7}|j ||jd|t|t|ft |}|j ?}|j dig|D]}|^qd6j WdQXt}|rtfdt|D}|j||j&|qqWt|j!d|j'th}!tj|}"|j(|jd||"fd}#t|!t|}|j)d|#t|!t|||"|! r|tgkr|rtj*tdn|j+tdtht|fS|tgk}$fd|!D}!|!|$|fS(slReturn a tuple (common, anyincoming, remoteheads) used to identify missing nodes from or in remote. isquery 1; heads iRtknowntnodesNssearching for changes sall remote heads known locally sall local heads known remotely c3@s%|]\}}|r|VqdS(N((t.0titn(tyesno(s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pys st searchingtunittqueriess#descendants(%ld) - descendants(%ld)sdescendants(%ld)ssampling from both directions staking initial sample staking quick initial sample s2query %i; still undecided: %i, sample size is: %i c3@s%|]\}}|r|VqdS(N((R3R4R5(R6(s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pys ss heads(%ld)s%d total queries in %.4fs sDfound %d common and %d unknown server heads, %d roundtrips in %.4fs t discoverysrepository is unrelateds!warning: repository is unrelated c@sh|]}|qS(((R3tr(tclnode(s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pys 8s (,RttimerRtnodeR,RR RtdebugRR(tcommandexecutort callcommandtresultttipRtTruetFalsetstatusRR Rt LookupErrorR talltnotetincrementalmissingrevsRt enumeratetaddbasestmissingancestorst makeprogressR&Rtdifference_updatethasbasesR/R"tremoveancestorsfromtbasestcompletetlogtAborttwarn(%tuitlocaltremotetinitialsamplesizetfullsamplesizetabortwhenunrelatedt ancestorsofR#t roundtripstcltclrevR5townheadsR,RtetfheadsR;tfknownt srvheadhashestsrvheadsR>t ownheadhashestcommontcommoninsamplet undecidedtmissingtfulltprogressR4tmissinginsamplet samplefunct targetsizeRBtelapsedtmsgt anyincoming((R<R6s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pytfindcommonheadss     "+    ,     $ "  ! /        2" " !(t__doc__t __future__RRR'ti18nRR>RRtRRRR"R/RRDRRt(((s</usr/lib64/python2.7/site-packages/mercurial/setdiscovery.pyt)s   %  (