8ɯmddlZddlmZddlmZmZddlmZmZm Z m Z m Z ddl m Z dZdZGdd Zd5d Zd Zd Zd6d Zd6dZdZdZdZdZdZdZdZdZdZdZdZ ejBdejBdejBdejBdgZ"dZ#dZ$dZ%dZ&d Z'd7d!Z(Gd"d#e)Z*d8d$Z+d%Z,d&Z-d'Z.d(Z/d)Z0d*Z1d+Z2ed,ed-ed.ed/ed0d1Z3d2Z4d3Z5d4Z6y)9N)_)hexshort)diffutilencodingerrorphasesutil)dateutilcFeZdZdZdZdZdZdZdZdZ dZ d Z d Z y ) markerzWrap obsolete marker raw datac.||_||_d|_yN)_repo_data _decodedmeta)selfrepodatas 5usr/lib/python3.12/site-packages/mercurial/obsutil.py__init__zmarker.__init__>s   c,t|jSr)hashrrs r__hash__zmarker.__hash__DsDJJrcdt|t|k7ry|j|jk(SNF)typerrothers r__eq__z marker.__eq__Gs( ;$t* $zzU[[((rc |jdS)z%Predecessor changeset node identifierrrrs rprednodezmarker.prednodeLzz!}rc |jdS)z-List of successor changesets node identifiersrr&rs r succnodeszmarker.succnodesPr(rc |jdS)z2Parents of the predecessors (None if not recorded)r&rs r parentnodeszmarker.parentnodesTr(rc2t|jdS)zDecoded metadata dictionary)dictrrs rmetadatazmarker.metadataXsDJJqM""rc |jdS)z#Creation date as (unixtime, offset)r&rs rdatez marker.date\r(rc |jdS)zThe flags field of the markerr r&rs rflagsz marker.flags`r(rN) __name__ __module__ __qualname____doc__rrr$r'r*r-r1r4r6rrrr;s2'!  ) #rrc#K| |j}n*|r t||}n|jj|}|D]}t||yw)zreturns markers known in a repository If is specified, only markers "relevant" to those nodes are are returnedN)obsstoreexclusivemarkersrelevantmarkersr)rnodes exclusive rawmarkers markerdatas r getmarkersrDesP  }]] %dE2 ]]2259  T:&&!sAAct|dS)Nc"|dd|dxsdfzS)Nr;r;)ms rzsortedmarkers..ws3B1R5;B.)@r)key)sorted)markerss r sortedmarkersrMus '@ AArc#K|jj}|g}t|}|rb|j}|j |d}|D]7}|d}||vr |j |||vr|'|j |9|rayyw)zyield the list of next predecessors pointing on visible changectx nodes This function respect the repoview filtering, filtered revision will be considered missing. r;rN)r= predecessorssetpopgetaddappend) rnodeid precursorsstackseencurrent currentpreccsprec precnodeids rclosestpredecessorsr]zs++J HE u:D ))+"w3 !DaJT! HHZ T!   Z(" s BB  B c#Kt|}t|}|jj}|r[|j}|||dD]7}|d|zr |d}||vs|j ||j |9|rZyyw)zYield node for every precursors of . Some precursors may be unknown locally. This is a linear yield unsuited to detecting folded changesets. It includes initial nodes too.r;r rN)rPrOrRrQrS) r=r@ ignoreflags remainingrXr[rYmarksucs rallpredecessorsrcsE I y>D  $ $D --/ "%DAw$q'C$  c"& sA!B $&B  B c#"Kt|}t|}|rs|j}||jj|dD]<}|d|zr |dD])}||vs|j ||j |+>|rryyw)zYield node for every successor of . Some successors may be unknown locally. This is a linear yield unsuited to detecting split changesets. It includes initial nodes too.r;r rN)rPrQ successorsrRrS)r=r@r_r`rXrYrarbs r allsuccessorsrfsE I y>D --/ ''++GR8DAw$Awd?HHSMMM#& 9 sA!B$(B Bc8|Dchc] }|ds | c}Scc}w)z"return a set with no prune markersrr;rLrHs r _filterprunesris  'w!!A$Aw '' 's c |j}|jjj}|jj }|jj }|jj}t}t|}|Dcgc] }t|j|dr|"} }| jt| } | r| j} t|j| d} |j| dD]} | dr | j| |j| dD]} | dr | j| | D]} | |vr| ds| d| k(r|j| | d}|| vr0||}|r||vr?t|j|}|j!|sk| j|| j|| r|Scc}w)aset of markers relevant to "nodes" but no other locally-known nodes This function compute the set of markers "exclusive" to a locally-known node. This means we walk the markers starting from until we reach a locally-known precursors outside of . Element of with locally-known successors outside of are ignored (since their precursors markers are also relevant to these successors). For example: # (A0 rewritten as A1) # # A0 <-1- A1 # Marker "1" is exclusive to A1 or # (A0 rewritten as AX; AX rewritten as A1; AX is unknown locally) # # <-1- A0 <-2- AX <-3- A1 # Marker "2,3" are exclusive to A1 or # (A0 has unknown precursors, A0 rewritten as A1 and A2 (divergence)) # # <-2- A1 # Marker "2" is exclusive to A0,A1 # / # <-1- A0 # # <-3- A2 # Marker "3" is exclusive to A0,A2 # # in addition: # # Markers "2,3" are exclusive to A1,A2 # Markers "1,2,3" are exclusive to A0,A1,A2 See test/test-obsolete-bundle-strip.t for more examples. An example usage is strip. When stripping a changeset, we also want to strip the markers exclusive to this changeset. Otherwise we would have "dangling"" obsolescence markers from its precursors: Obsolescence markers marking a node as obsolete without any successors available locally. As for relevant markers, the prune markers for children will be followed. Of course, they will only be followed if the pruned children is locally-known. Since the prune markers are relevant to the pruned node. However, while prune markers are considered relevant to the parent of the pruned changesets, prune markers for locally-known changeset (with no successors) are considered exclusive to the pruned nodes. This allows to strip the prune markers (with the rest of the exclusive chain) alongside the pruned changesets. r;rr) unfiltered changelogindexhas_noder=rOrechildrenrPrirRsortrQlistrTrSissubset)rr@unfirnprecursorsmarkerssuccessormarkerschildrenmarkers exclmarkersnrW seennodesrYrLrar[known precmarkerss rr>r>sl ?? D~~##,,H 22}}//mm,,O%K JE P1]3C3G3G23N%OQE P JJLE I ))+(,,Wb9:$(("5D7t$6$''4D7t$5D{" Aw$q'W,%7Dy TNEU* ((8(<( children or precursor -> successor relation. It is very similar to "descendant" but augmented with obsolescence information. Beware that possible obsolescence cycle may result if complex situation. s%ln::rGc34K|]}|s |ywrr;).0rxrns r zforeground..Zs51!Qs ) rkrPr=rlrmrnlennodemutableupdaterf) rr@ foregroundplencsuccsrrzrns @rrrDs ?? DTXXh./J }}>>''00*o%z?D'12z!QVVXzE2)3CAqyy{qvvxGC LLt}}g> ?55ETXXh67J *o%) )jAFFHj )) 3C *s8D7D<+D<Esef1r3 @s^branch$s ^.*-source$s ^.*_source$s^source$c@|dtfdtD S)zvCheck that the key of a meta item (extrakey, extravalue) does not match at least one of the blacklist pattern rc3@K|]}|jywr)match)r~patternmetakeys rrz%metanotblacklisted..sGg7==)s)any METABLACKLIST)metaitemrs @rmetanotblacklistedrs"qkGGGG GGrcg}|jD]I}|jds|jdr&|jdrd}|j|K|S)z/Drop all information but the username and patchs# User#s@@s@@ ) splitlines startswithrT)hunk cleanhunklines r _prepare_hunkrsVI! ??9 %T__T-Bu%   T " " rc8t|d}||St|S)zreturn a cleaned up linesN)nextr)iterdiffliness r _getdifflinesrs# 4 E }  rctj|jjddi}|jj |j }|j|}|jj |j }|j|}d\}}d||fvr#t|}t|}||k7ryd||fvr#y)z|return True if both ctx introduce the "same diff" This is a first and basic implementation, with many shortcoming. sgitT)opts)rrNF) r diffalloptsruirrkrevdiffr) leftctxrightctxdiffoptsleftunfileftdiff rightunfi rightdiffleftrights r_cmpdiffrs ##GLLN$5$5~FH}}'')'++-8H}}(}+H))+HLLN;IH-IKD% tUm #X&i( 5= tUm # rcd}|D]h}|j|jk7r |tz}|j|jk7r |tz}|j |j k7r |t z}|j |j k7r |tz}|j|jk7r |tz}|jj}ttt|}|jj}ttt|}||k7r |tz}t!||r`|t"z}k|S)zeFrom an obs-marker relation, compute what changed between the predecessor and the successor. r) description DESCCHANGEDuser USERCHANGEDr4 DATECHANGEDbranch BRANCHCHANGEDparents PARENTCHANGEDextraitemsrqfilterr METACHANGEDr DIFFCHANGED)sourcereeffects changectx changeextractxmeta sourceextrasrcmetas r geteffectflagrs@G  "f&8&8&: : { "G >> v{{} , { "G >> v{{} , { "G     0 } $G    &.."2 2 } $G oo'--/ v0+>?lln**, v0+>? g  { "G * { "GC F Nrcn|du|duk(rd}tj||jjjj }|j j}|jjj}tj}| |j}|d}|d} t} t} |D]o} | d} || }| || vs|| k\r| j|||||k(r:t|| xsgj!|s_| j|q| S)zreturn the set of pre-existing revisions obsoleted by a transaction Either the transaction or changes item of the transaction (for hooks) must be provided, but not both. Ns.exactly one of tr and changes must be provideds obsmarkerss origrepolenr)r ProgrammingErrorrkrlrmget_rev _phasecachephaser=rerRr publicchangesrPrSrr)rtrretorevr succsmarkersr addedmarkers origrepolenseenrevs obsoletedrarrs r getobsoletedrs' d 4( =$$Q'' OO  ' ' - - 5 5E    " "E==++//L ]]F**=)L.)KuHIAwDk ;#/SK-?  S s v %  |D!'R ( 1 1, ? MM#  rcReZdZdZfdZdZejdZdZ xZ S)_succszAsmall class to represent a successors with some metadata about itcJtt| |i|t|_yr)superrrrPrL)rargskwargs __class__s rrz_succs.__init__ s  fd$d5f5u rcZt|}|jj|_|Sr)rrLcopy)rnews rrz _succs.copy s$Tlll'')  rct|Sr)rPrs r_setz _succs._sets4yrcL|jj|jSr)rrrr"s rcanmergez_succs.canmergesyy!!%**--r) r7r8r9r:rrr propertycacherr __classcell__)rs@rrrs/K  .rrc|jj}|g}t|}|i}|r!|d}||vxs|xr ||k7xr||v}||vr!|j|j n|r||vrt |fg||<ng||<nt ||D]A} | dD]4} | |vs| |vrg|| <|j| |j| n@nng} t ||D]} t } | jj| | g} | dD]}} g}| D]o}|| D]e}|j}|jj|j|D]}||vs|j||j|gq|s||} | j| g}g}td| Dtd}|D]c}|D]:}|j|s|jj|jA|j||j|e|j!|||<|r!||S)a Return set of all latest successors of initial nodes The successors set of a changeset A are the group of revisions that succeed A. It succeeds A as a consistent whole, each revision being only a partial replacement. By default, the successors set contains non-obsolete changesets only, walking the obsolescence graph until reaching a leaf. If 'closest' is set to True, closest successors-sets are return (the obsolescence walk stops on known changesets). This function returns the full list of successor sets which is why it returns a list of tuples and not just a single tuple. Each tuple is a valid successors set. Note that (A,) may be a valid successors set for changeset A (see below). In most cases, a changeset A will have a single element (e.g. the changeset A is replaced by A') in its successors set. Though, it is also common for a changeset A to have no elements in its successor set (e.g. the changeset has been pruned). Therefore, the returned list of successors sets will be [(A',)] or [], respectively. When a changeset A is split into A' and B', however, it will result in a successors set containing more than a single element, i.e. [(A',B')]. Divergent changesets will result in multiple successors sets, i.e. [(A',), (A'')]. If a changeset A is not obsolete, then it will conceptually have no successors set. To distinguish this from a pruned changeset, the successor set will contain itself only, i.e. [(A,)]. Finally, final successors unknown locally are considered to be pruned (pruned: obsoleted without any successors). (Final: successors not affected by markers). The 'closest' mode respect the repoview filtering. For example, without filter it will stop at the first locally known changeset, with 'visible' filter it will stop on visible changesets). The optional `cache` parameter is a dictionary that may contains precomputed successors sets. It is meant to reuse the computation of a 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 life span. Code that makes multiple calls to `successorssets` *should* use this cache mechanism or risk a performance hit. Since results are different depending of the 'closest' most, the same cache cannot be reused for both mode. rGrc3&K|] }|s| ywrr;)r~ss rrz!successorssets..s/ 1QQ sT)rJreverse)r=rerPremoverQrrMrTrSrLrrextendrKrrr)r initialnodeclosestcache succmarkers toproceed stackedsetrYcase2conditionrarb succssetsbasemarkss productresultprefixsuffixnewsspartrXfinal candidatescand seensuccss rsuccessorssetsrsb--**K IYJ }8 $B-"4  B;. B7d?  e    immo . $"('"4!5g"$gB&k'&:;7C%'*,)+E#J &,,S1&NN3/!#!?D!8DLL$$T*"VF#Aw(* &,F*/*(.  % 4 4V^^ D,2D(,5'8(- T(: -3 !. 4 4U ;+5'-)%2F '$$V,)@,#/ /S$ 'D%) ==3%--44T\\B!&*  T* D)' !&g_ `  rc6|jsyt||jd}|gk(r tg}|jj }g}|D]}|r|j |d}|j|jdD]@}|dr d}t}|jj||j |B|r|j tg}|D] }|j ||jd"|S)zncompute the raw data needed for computing obsfate Returns a list of dict, one dict per successors set NT)rFr;r)s successorssmarkers) obsoleterrrr=rerTrRrLrS) rctxssetssuccsmapfullsuccessorsetsssetfoundanyravaluess rsuccessorsandmarkersr s <<> 4T :E { }}''H   $ $T *H SXXZ4Aw#H!8DLL$$T*%,,T2 5 !((2-0F! d EF" Mrcht|dk(ryt|dkDry|d}t|dk(ryy)a}Compute a changeset obsolescence fate based on its successorssets. Successors can be the tipmost ones or the immediate ones. This function return values are not meant to be shown directly to users, it is meant to be used by internal functions only. Returns one fate from the following values: - pruned - diverged - superseded - superseded_split rprunedrdiverged supersededsuperseded_splitr)rres r _getobsfater3sB >a ^ q $A& z?a  &rc:|sd}|St|dk(rd}|Sd}|S)zhReturn the verb summarizing the successorset and potentially using information from the markers rrs rewrittenssplitr) successorsetrLverbs r obsfateverbrNs:  K \ a  K Krc2|Dcgc]}|d c}Scc}w)z/returns the list of dates for a list of markersr3r;rhs r markersdatesr[s! "'QAaD' "" "s c|Dcgc]}t|d}}|Dchc]+}|jdrtj|d-}}t |Scc}wcc}w)z9Returns a sorted list of markers users without duplicatesr/suser)r0rRrtolocalrK)rLrH markersmetametauserss r markersusersr`sq'./w!4!:wK/  D 88G  g'   %=0 s A0A"c|Dcgc]}t|d}}|Dchc]%}|jds|jd'}}t|Scc}wcc}w)z>Returns a sorted list of markers operations without duplicatesr/s operation)r0rRrK)rLrHrr operationss rmarkersoperationsr"lse'./w!4!:wK/+6+64$((<:P; *  0sAAAch|j}|j}| xr| }g}|jt||t |} | r#|jddj | z|r;|D cgc] } ||| } } |jddj | zt |} |s&|jd} t| dk(r| | vrd} |s|r%| r#|jddj | zt|}|r|rt|}t|}||k(r+tj|d }|jd |znBtj|d }tj|d }|jd ||fzd j |Scc} w) zoBuild a obsfate string for a single successorset using all obsfate related function defined in obsutil s using %s, s as %sT) acceptemptyrNs by %ss%Y-%m-%d %H:%M %1%2s (at %s)s (between %s and %s)r)quietverboserTrr"joinrusernamerrminmaxr datestr)rrrerL formatctxr&r'normalrr!succ fmtsuccessorsr currentuserdatesmin_datemax_date fmtmin_date fmtmax_dates robsfateprinterr7vs HHEjjG[ &YF D KK J01#7+J L5::j#99:;EF:44:.: F I = 99:  !E kkdk3 u:?{e3E6u I 5 112  !E u:u: x "**85KLK KK k1 2"**85KLK"**85KLK KK/; 2LL M 88D>=Gs4F/shidden revision '%s' is pruneds!hidden revision '%s' has divergeds)hidden revision '%s' was rewritten as: %ss%hidden revision '%s' was split as: %ss1hidden revision '%s' was split as: %s and %d more)rrrrsuperseded_split_severalct||j}t|}|dk(r td|zS|dk(r td|zS|dk(rt |dd}td||fzS|dk(rg}|dD]}|j t |t |dkrdj|}td||fzSdj|dd} t |dz } || | f} td | zSy) zDreturn a human-friendly string on why a obsolete changeset is hiddenrrrrrr r$Nr8)rrrfilteredmsgtablerrTrr() rchangeidrrefatesingle_successorrnode_idfmtsuccsfirstsuccessorsremainingnumberrs r_getfilteredreasonrBs"chhj1J z "D y *X55   ,x77   Aq!12 .(rEFFECTFLAGFIELDrrrrrrrcompilerrrrrrrrqrrr rrrrr"r7r:rBrKr]r;rrresr @   ''T ' B ):#0',( wt*T       BJJ{BJJ~BJJ~BJJ{  H 8)X@.T.*eP-`'6 # 2l2378ABCD!"<" H<.,r