��c@sdZddlZddlZddlZddlZddlmZejZej Z
dZeZ
dZdZdZeje�Zeje�ZdZd �Zd
�Zd�Zdefd
��YZdefd��YZed�Zd�ZdZd�Zd�Zd�Z d�Z!d�Z"d�Z#d�Z$dd�Z%d�Z&dd�Z(d�Z)iZ*d�Z+d�Z,d �Z-e+d!�d"��Z.e+d#�d$��Z/e+d%�d&��Z0e+d'�d(��Z1e+d)�d*��Z2e+d+�d,��Z3ddd-�Z4dS(.s�Obsolete markers handling
An obsolete marker maps an old changeset to a list of new
changesets. If the list of new changesets is empty, the old changeset
is said to be "killed". Otherwise, the old changeset is being
"replaced" by the new changesets.
Obsolete markers can be used to record and distribute changeset graph
transformations performed by history rewriting operations, and help
building new tools to reconciliate conflicting rewriting actions. To
facilitate conflicts resolution, markers include various annotations
besides old and news changeset identifiers, such as creation date or
author name.
The old obsoleted changeset is called "precursor" and possible replacements are
called "successors". Markers that used changeset X as a precursors are called
"successor markers of X" because they hold information about the successors of
X. Markers that use changeset Y as a successors are call "precursor markers of
Y" because they hold information about the precursors of Y.
Examples:
- When changeset A is replacement by a changeset A', one marker is stored:
(A, (A'))
- When changesets A and B are folded into a new changeset C two markers are
stored:
(A, (C,)) and (B, (C,))
- When changeset A is simply "pruned" from the graph, a marker in create:
(A, ())
- When changeset A is split into B and C, a single marker are used:
(A, (C, C))
We use a single marker to distinct the "split" case from the "divergence"
case. If two independents operation rewrite the same changeset A in to A' and
A'' when have an error case: divergent rewriting. We can detect it because
two markers will be created independently:
(A, (B,)) and (A, (C,))
Format
------
Markers are stored in an append-only file stored in
'.hg/store/obsstore'.
The file starts with a version header:
- 1 unsigned byte: version number, starting at zero.
The header is followed by the markers. Each marker is made of:
- 1 unsigned byte: number of new changesets "R", could be zero.
- 1 unsigned 32-bits integer: metadata size "M" in bytes.
- 1 byte: a bit field. It is reserved for flags used in obsolete
markers common operations, to avoid repeated decoding of metadata
entries.
- 20 bytes: obsoleted changeset identifier.
- N*20 bytes: new changesets identifiers.
- M bytes: metadata as a sequence of nul-terminated strings. Each
string contains a key and a value, separated by a color ':', without
additional encoding. Keys cannot contain '' or ':' and values
cannot contain ''.
i�N(t_iis>BIB20st20siccs`d}td|||d!�d}|d7}|tkrVtjtd�|��nt|�}x�t|kr[|||t!}|t7}tt|�\}}}}d} |r�|}
||||
!}tt ||�} ||
7}n||||!}t|�|kr=tjtd�|t|�f��n||7}|| ||fVqeWdS(s(Read and enumerate markers from raw datais>Bis+parsing obsolete marker: unknown version %rsIparsing obsolete marker: metadata is too short, %d bytes expected, got %dN((
t_unpackt
_fmversiontutiltAbortRtlent_fmfsizet_fmfixedt
_fnodesizet_fmnode(tdatatofftdiskversiontltcurtnbsuctmdsizetflagstpretsucststmetadata((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_readmarkers�s.
cCs�x\|j�D]N\}}d|ks1d|kr@td��nd|kr
td��q
q
Wdjgt|�D]}d|||f^qr�S(smReturn encoded metadata string to string mapping.
Assume no ':' in key and no '' in both key and value.t:ts*':' and '' are forbidden in metadata key's$':' are forbidden in metadata value's%s:%s(t iteritemst
ValueErrortjointsorted(tmetatkeytvaluetk((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
encodemeta�scCsLi}x?|jd�D].}|r|jd�\}}|||<qqW|S(s8Return string to string dictionary from encoded version.RR(tsplit(RtdRRR ((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
decodemeta�stmarkercBs;eZdZd�Zd�Zd�Zd�Zd�ZRS(sWrap obsolete marker raw datacCs||_||_d|_dS(N(t_repot_datatNonet_decodedmeta(tselftrepoR((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt__init__�s cCs|jdS(s#Precursor changeset node identifieri(R((R+((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytprecnode�scCs|jdS(s-List of successor changesets node identifiersi(R((R+((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt succnodes�scCs/|jdkr(t|jd�|_n|jS(sDecoded metadata dictionaryiN(R*R)R%R((R+((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR�scCs7|j�djd�}t|d�t|d�fS(s#Creation date as (unixtime, offset)tdatet ii(RR#tfloattint(R+tparts((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR0�s(t__name__t
__module__t__doc__R-R.R/RR0(((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR&�s tobsstorecBsVeZdZd�Zd�Zd�Zd dd
d�Zd�Zd�Z d�Z
RS(s�Store obsolete markers
Markers can be accessed with two mappings:
- precursors[x] -> set(markers on precursors edges of x)
- successors[x] -> set(markers on successors edges of x)
cCs\i|_g|_i|_i|_||_|jd�}|rX|jt|��ndS(NR8(tcachest_allt
precursorst
successorstsopenerttryreadt_loadR(R+R=R((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR-�s cCs
t|j�S(N(titerR:(R+((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt__iter__�scCs
t|j�S(N(tboolR:(R+((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt__nonzero__�sicCs�|dkri}nd|kr8dtj�|d<nt|�dkrYt|��nx/|D]'}t|�dkr`t|��q`q`Wt|�t|�t|�t|�f}|j ||g�dS(s�obsolete: add a new obsolete marker
* ensuring it is hashable
* check mandatory metadata
* encode metadata
R0s%d %diN(
R)RtmakedateRRtstrttupleR3R"tadd(R+ttransactiontprectsuccstflagRtsuccR&((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytcreate�s
*cCs�tstjd��ng|D]}||jkr|^q}|r�jdd�}z]|jdt�|j�}|jd|�x*t ||dk�D]}|j
|�q�WWd|j�X|j|�|j
j�nt|�S(spAdd new markers to the store
Take care of filtering duplicate.
Return the number of new marker.s,obsolete feature is not enabled on this repoR8tabiN(t_enabledRRR:R=tseekt _SEEK_ENDttellRGt_encodemarkerstwritetcloseR?R9tclearR(R+RHtmarkerstmtnewtftoffsettbytes((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyRGs(
cCs t|�}|j||�dS(N(RRG(R+RHRRW((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytmergemarkers&scCs�x}|D]u}|jj|�|d \}}|jj|t��j|�x-|D]%}|jj|t��j|�qSWqWtj|jkr�t j
td���ndS(Nis;bad obsolescence marker detected: invalid successors nullid(R:tappendR<t
setdefaulttsetRGR;tnodetnullidRRR(R+RWtmarkRRtsuc((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR?*s
'(N(R5R6R7R-RARCR)RMRGR]R?(((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR8�s ccs7|rtdt�Vnx|D]}t|�VqWdS(Ns>B(t_packRt_encodeonemarker(RWt addheaderR&((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyRS5s
cCsb|\}}}}t|�}tt|}|t|�||g}|j|�t||�|S(N(RRR
textendRe(R&RRRRRtformatR((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyRf>s
i�c
Cs�|js
iSi}g}td}xl|jD]a}t|�}t|�|tkrqg}d}|j|�n|j|�|t|�7}q-WxVtt|��D]B\}}djtdt �g|�} t
j| �|d|<q�W|S(sList markers over pushkeyiits>Bsdump%i(R8t_maxpayloadRfRR^t enumeratetreversedRReRtbase85t b85encode(
R,tkeysR4t
currentlenR&tnextdatatcurrentparttidxtpartR((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytlistmarkersLs"
cCs�|jd�s-|jjtd�|�dS|rQ|jjtd�|�dStj|�}|j�}zF|jd�}z%|jj ||�|j
�dSWd|j�XWd|j�XdS(sPush markers over pushkeytdumpsunknown key: %risunexpected old valuespushkey: obsolete markersiN(t
startswithtuitwarnRRnt b85decodetlockRHR8R]RUtrelease(R,RtoldRYRR|ttr((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
pushmarker`s
c Cs�tr�|jr�d|jd�kr�g}|jd�}xCt|dt�D]/}||}|j|jd|d|��qLWg|D]}|s�|^q�r�td�}|jj |�q�ndS(sputility function to push bookmark to a remote
Exist mostly to allow overridding for experimentation purposetobsoletet
namespacestreverseRjs&failed to push some obsolete markers!
N(
ROR8tlistkeysRtTrueR^tpushkeyRRyRz(R,tremotetrsltst
remotedataRRtrtmsg((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytsyncpushus
#cCs�d}tr�|jjd�|jd�}d|kr�|�}xRt|dt�D]>}|jd�rStj ||�}|j
j||�qSqSW|j�q�n|S(sMutility function to pull bookmark to a remote
The `gettransaction` is function that return the pull transaction, creating
one if necessary. We return the transaction to inform the calling code that
a new transaction have been created (when applicable).
Exists mostly to allow overridding for experimentation purposes!fetching remote obsolete markers
R�tdump0R�RwN(
R)RORytdebugR�RR�RxRnR{R8R]tinvalidatevolatilesets(R,R�tgettransactionRt remoteobsRR((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytsyncpull�s ccs&x|jD]}t||�Vq
WdS(s*all obsolete markers known in a repositoryN(R8R&(R,t
markerdata((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
allmarkers�sccsAx:|jjjj|j�d�D]}t|j|�Vq"WdS(s6obsolete marker marking this changeset as a successorsN((R'R8R;tgetRaR&(tctxR((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytprecursormarkers�s(ccsAx:|jjjj|j�d�D]}t|j|�Vq"WdS(s.obsolete marker making this changeset obsoleteN((R'R8R<R�RaR&(R�R((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytsuccessormarkers�s(ccs�t|�}t|�}x�|r�|j�}|Vxo|jj|d�D]X}|d|@rbqHnx;|dD]/}||krm|j|�|j|�qmqmWqHWqWdS(s�Yield node for every successor of <nodes>.
Some successors may be unknown locally.
This is a linear yield unsuited to detecting split changesets.iiN((R`tpopR<R�RG(R8tnodestignoreflagst remainingtseentcurrentRcRd((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
allsuccessors�s
cs|j�}t|jd|��}|jr�jj�d}x�t|�|kr�|�}td�|D��}g|D]}|j�r}|j�^q}}|jt |j|���fd�|D�}t|jd|��}qBWntd�|D��S(sSreturn all nodes in the "foreground" of other node
The foreground of a revision is anything reachable using parent -> children
or precursor -> sucessor relation. It is very similars to "descendant" but
augmented with obsolescence information.
Beware that possible obsolescence cycle may result if complexe situation.
s%ln::i�css|]}|j�VqdS(N(Ra(t.0tc((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�sc3s!|]}|�kr|VqdS(N((R�tn(tnm(s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�scss|]}|j�VqdS(N(Ra(R�R�((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�s(
t
unfilteredR`R8t changelogtnodemapRtmutableRatupdateR�(R,R�t
foregroundtplenRJR�R�tknown((R�s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyR��s +cCs�|jj}|g}t|�}|dkr6i}nxC|r{|d}||krk|j|j��q9||kr�||kr�|fg||<qxg||<q9x�t||�D]b}xX|dD]I}||kr�||kr�||<q|j|�|j|�Pq�q�Wq�Pq�Wg} x�t||�D]�}gg}
x�|dD]~}g}xi|
D]a}xX||D]L}
t |�}x*|
D]"}||kr�|j|�q�q�W|j|�qoWq^W|}
qKW| j
|
�q1Wg}g}td�| D�dd�dt�}xR|D]J\}}x;|D]}|j|�r)Pq)q)W|j|�|j|�qW|j
�|||<q9W||S(s�Return all set of successors of initial nodes
Successors set of changeset A are a group of revision that succeed A. It
succeed A as a consistent whole, each revision being only partial
replacement. Successors set contains non-obsolete changeset only.
In most cases a changeset A have zero (changeset pruned) or a single
successors set that contains a single successor (changeset A replaced by
A')
When changeset is split, it results successors set containing more than
a single element. Divergent rewriting will result in multiple successors
sets.
They are returned as a list of tuples containing all valid successors sets.
Final successors unknown locally are considered plain prune (obsoleted
without successors).
The optional `cache` parameter is a dictionary that may contains
precomputed successors sets. It is meant to reuse the computation of
previous call to `successorssets` when multiple calls are made at the same
time. The cache dictionary is updated in place. The caller is responsible
for its live spawn. Code that makes multiple calls to `successorssets`
*must* use this cache mechanism or suffer terrible performances.i�icss'|]}|rt|�|fVqdS(N(R`(R�R((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�sRcSst|d�S(Ni(R(tx((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt<lambda>�sR�N(R8R<R`R)tremoveR�RR^RGtlistRhR�tissubsetR�(R,tinitialnodetcachetsuccmarkerst toproceedt
stackedsetR�RcRdt succssetstmarksst
productresulttprefixtsuffixtnewssRuR�tfinalt candidatet
setversiontlistversiontseenset((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytsuccessorssets�sd
!
ccsD|jjj}x.|D]&}||�}|dk r|VqqWdS(sgyield revision numbers of known nodes passed in parameters
Unknown revisions are silently ignored.N(R�R�R�R)(R,R�ttorevR�trev((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
_knownrevs�s
cs�fd�}|S(sADecorator to register a function as computing the cache for a setcs �tkst�|t�<|S(N(t
cachefuncstAssertionError(tfunc(tname(s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt decorator�s
((R�R�((R�s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytcachefor�scCsV|j�}|jsdS||jjkrHt||�|jj|<n|jj|S(syReturn the set of revision that belong to the <name> set
Such access may compute the set and cache it for future use((R�R8R9R�(R,R�((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytgetrevs�s cCs&d|jkr"|jjj�ndS(s�Remove all obsolescence related cache from a repo
This remove all cache in obsstore is the obsstore already exist on the
repo.
(We could be smarter here given the exact event that trigger the cache
clearing)R8N(t
_filecacheR8R9RV(R,((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pytclearobscaches�s R�cCsvt�}|jjj}|jj}xK|jjD]=}||�}|dk r1|||�r1|j |�q1q1W|S(sthe set of obsolete revisionsN(
R`R�R�R�t_phasecachetphaseR8R<R)RG(R,tobstgetrevtgetphaseRaR�((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_computeobsoleteset�s tunstablecsHt|d���st�S|j}t�fd�|j��D��S(s7the set of non obsolete revisions with obsolete parentsR�c3s!|]}|�kr|VqdS(N((R�R�(R�(s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�s(R�R`R�tdescendants(R,tcl((R�s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_computeunstableset�s
t suspendedcs>|jjt|d���t�fd�t|d�D��S(s9the set of obsolete parents with non obsolete descendantsR�c3s!|]}|�kr|VqdS(N((R�R�(R�(s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�sR�(R�t ancestorsR�R`(R,((R�s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_computesuspendedset�stextinctcCst|d�t|d�S(s<the set of obsolete parents without non obsolete descendantsR�R�(R�(R,((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_computeextinctset�stbumpedcsh|jj��fd�|jd�D�}t|j|dt�}d}t|j|t||���S(s3the set of revs trying to obsolete public revisionsc3s|]}�|�VqdS(N((R�R�(ttonode(s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>�sspublic()R�s%ld - obsolete() - public()(R�RatrevsR�R8t bumpedfixR`R�(R,tpublicnodesR<tquery((R�s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_computebumpedset�s t divergentc
Cst�}|j}i}x�jd�D]�}|jj|j�d�}t|�}x�|r�j�d}||kr�t|||�ng||D]}|r�|^q�} t| �dkr�|j|j ��Pn|j
|jj|d��qXWq(W|S(sMthe set of rev that compete to be the final successors of some revision.
s(not public()) - obsolete()ii(((R`R8R;R�RaR�R�RRGR�R�(
R,R�R8tnewermapR�Rct toprocessRIR�tnewer((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt_computedivergentset�s #$c Cs/|dkri}nd|kr8dtj�|d<nd|krZ|jj�|d<n|jd�}z�x�|D]�\}}|j�s�tjd|��n|j�}t d�|D��}||kr�jd|��n|j
j|||||�|jj
�qsW|j�Wd|j�XdS( s�Add obsolete markers between changesets in a repo
<relations> must be an iterable of (<old>, (<new>, ...)) tuple.
`old` and `news` are changectx.
Trying to obsolete a public changeset will raise an exception.
Current user and date are used except if specified otherwise in the
metadata attribute.
This function operates within a transaction of its own, but does
not take any lock on the repo.
R0s%i %itusersadd-obsolescence-markers'cannot obsolete immutable changeset: %scss|]}|j�VqdS(N(Ra(R�R((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pys <genexpr>,ss#changeset %s cannot obsolete itselfN(R)RRDRytusernameRHR�RRaRFR8RMtfilteredrevcacheRVRUR}( R,t relationsRKRRRIRtnprectnsucs((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt
createmarkerss(
(5R7tstructRRnRati18nRtpackRetunpackRRQtFalseRORRR
tcalcsizeRR R�RR"R%tobjectR&R8RSRfRkRvR�R�R�R�R�R�R�R�R)R�R�R�R�R�R�R�R�R�R�R�R�R�(((s6/sys/lib/python2.7/site-packages/mercurial/obsolete.pyt<module>TsV$ ! [ �
|