+M]rFdZddlZddlZddlZddlZddlZddlZddlZddlZddl m Z m Z m Z m Z mZmZddlmZddlmZddlmZmZmZmZmZmZmZmZmZmZmZm Z m!Z!m"Z"m#Z#m$Z$m%Z%m&Z&m'Z'm(Z(m)Z)m*Z*m+Z+m,Z,ddl-m.Z.m/Z/m0Z0m1Z1m2Z2m3Z3m4Z4dd l5m6Z6dd l7m8Z8m9Z9m:Z:m;Z;mZ>m?Z?dd l@mAZAm?ZBdd l=mCZDmEZFmGZGmHZImJZJmKZKmLZLmMZNdd lOmPZPmQZQe$e%e'eeee)e*e+e&e(e3e/e2e0e.e1e4ed}d6Z?d}d7Z@dxd8ZAd9ZBd:ZCd}d;ZDd<ZEd=ZFd>ZGd?ZHd@ZIdydAZJdBZKdCZLdDZMdEZNd~dFZOdGZPdxdHZQdxdIZRd}dJZSdKZTdLZUdMZVdNZWdxdOZXdxdPZYddQZZdxdRZ[dSZ\dxdTZ]dUZ^ddVZ_e`dWZaddXZbdYZcej6dZZdej6d[Zed\Zfddegddfd]Zh dd^Zid_Zjd`Zk ddaZldbZmdcZn dddZodeZpdfZqdgZrdhZsdiZtdjZudddevjddfdkZxdlZydmZzdnZ{doZ|hdpZ}dezddfdqZ~drZddsZdtZ dduZdvZy)rAak the underlying revision storage object A revlog consists of two parts, an index and the revision data. The index is a file with a fixed record size containing information on each revision, including its nodeid (hash), the nodeids of its parents, the position and offset of its data within the data file, and the revision it's based on. Finally, each entry contains a linkrev entry that can serve as a pointer to external data. The revision data itself is a linear collection of data chunks. Each chunk represents a revision and is usually represented as a delta against the previous chunk. To bound lookup time, runs of deltas are limited to about 2 times the length of the original version data. This makes retrieval of a version proportional to its size, or O(1) relative to the number of revisions. Both pieces of the revlog are written to in an append-only fashion, which means we never need to rewrite a file to insert or remove data, and can use some simple techniques to avoid the need for locking while reading. If checkambig, indexfile is opened with checkambig=True at writing, to avoid file stat ambiguity. If mmaplargeindex is True, and an mmapindexthreshold is set, the index will be mmapped rather than read if it is larger than the configured threshold. If censorable is True, the revlog can have censored revisions. If `upperboundcomp` is not None, this is the expected maximal gain from compression for the data content. `concurrencychecker` is an optional function that receives 3 arguments: a file handle, a filename, and an expected position. It should check whether the current position in the file handle is valid, and log/warn/fail (by raising). See mercurial/revlogutils/contants.py for details about the content of an index entry. cntj|d}|dz}|dz}t|}|d|S)Nrinline)runpackr) header_bytesheader _format_flags_format_versionfeaturess rHis_inline_indexzrevlog.is_inline_index%sF$$\215(  6/&7"x "=11rKNFc(||_||_d|_d|_d|_d|_d|_||_| |_| |_ ||_ | rtj||_|dtvsJt|dk(sJ||_||_||_||_d|_t)j*d|_d|_d|_d|_d|_d|_d|_d|_d|_d|_i|_ d |_!i|_"d |_#d|_$d|_%d|_&d |_'d |_(d|_)tUtVjX|_-d|_.d|_/|ja| |_1| |_2y) aJ create a revlog object opener is a function that abstracts the file opening operation and can be used to implement COW semantics or the like. `target`: a (KIND, ID) tuple that identify the content stored in this revlog. It help the rest of the code to understand what the revlog is about without having to resort to heuristic and index filename analysis. Note: that this must be reliably be set by normal code, but that test, debug, or performance measurement code might not set this to accurate value. Nrd)rrKTFszlibg?i)3upperboundcompradix _docket_file _indexfile _datafile _sidedatafile _nodemap_filepostfix _trypending _try_splitopener nodemaputilget_nodemap_filer lentarget _checkambig_mmaplargeindex _censorable_revisioncacher4 lrucachedict_chainbasecache _chunkcache_chunkcachesize _maxchainlen_deltabothparents_candidate_group_chunk_size _debug_deltart_docket_nodemap_docket_pcache _compengine_compengineopts_maxdeltachainspan_withsparseread _sparserevlog hassidedata_srdensitythreshold _srmingapsize _compute_rankdictr8flagprocessors_flagprocessors_writinghandles _adding_group _loadindex_concurrencycheckercanonical_parent_order)selfrrrr checkambigmmaplargeindex censorablerpersistentnodemapconcurrencychecker trypending try_splitrs rH__init__zrevlog.__init__/s:-  !! %# !,!=!=d!CD ayI%%%6{a &-%"#005#$ !%+,(!  # "!"$$" #' # # $H$;$;< $! #5 '=#rKc(d}|jj}d|vr1|jtk(rt}|j dd|_nOd|vrt}nDd|vrttz}d|vr/|tz}n%d|jjvrt}nt}d |vr |d |_ d |vr |d |_d |vr |d |_|j d }|r||_t#|j d d|_d|_|j$r t#|j dd|_d|vr |d|_d|vr |d|_d|vr|d|j,d<d|vr|d|j,d<d|vr |d|_|j0r d|vr|d}t#|j dd|_t#|j dd}|j2xs||_d|vr |d|_d|vr |d|_|j drt:|j<t><|j dijAD]&\}}tCjD|||j<(|jdkr+tGjHtKd|jz|j|jdz zr+tGjHtKd|jz|j d d}|||fS)!aprocess options (from above/config) to setup associated default revlog mode These values might be affected when actually reading on disk information. The relevant values are returned for use in _loadindex(). * newversionflags: version header to use if we need to create a new revlog * mmapindexthreshold: minimal index size for start to use mmap * force_nodemap: force the usage of a "development" version of the nodemap code Ns changelogv2schangelogv2.compute-rankTsrevlogv2srevlogv1 generaldeltasrevlogv0schunkcachesizes maxchainlensdeltabothparentss.delta-parent-search.candidate-group-chunk-sizes lazydeltaFs lazydeltabases debug-deltas compengines zlib.levels zstd.levelsmaxdeltachainspansmmapindexthresholds sparse-revlogswith-sparse-readssparse-read-density-thresholdssparse-read-min-gap-sizesenableellipsissflagprocessorsrs0revlog chunk cache size %r is not greater than 0rs.revlog chunk cache size %r is not a power of 2sdevel-force-nodemap)&roptions revlog_kindrr getrrrrrrr"rrrrbool _lazydelta_lazydeltabaserrrrrrrrrellipsisprocessorrr%itemsr8insertflagprocessorr. RevlogErrorr ) rmmapindexthresholdopts new_headerdps_cgdswithsparsereadflag processor force_nodemaps rH _init_optszrevlog._init_optss0 "{{"" T !d&6&6.&H$J!%*Et!LD  D !J D !$44J$&// DKK// /!J/J  $#'(9#:D T ! $^ 4D  $ &%)*=%>D "88MN /7D ,txx d;<# ??"&txx0@%'H"ID  T ! $^ 4D  D #M2D  D 26}2ED  / D 26}2ED  / 4 '&*+?&@D #   $9T$A!%&;!< !$((+;U"CDdhh':EBC#11C^ +t 3'+,L'MD $ &$ .!%&A!BD  88% &4ED  1 $xx(92>DDFOD)  ( (y$:N:N O G   1 $##EF&&'  ! !T%9%9A%= >##CD&&' !7? -}<.get_stream"sa]]_J% 1Du} ggdm+#'#5#5b#EEE %_ F %_s.A-=A!AA! A-A!!A*&A-c3Kj5}dtD]}jj|}|dk(rPjDj }|j z}|tz}jj|}||z}|j|||d dddy#1swYyxYww)Nrdfr) _datafprangert entry_binaryrrrr pack_header_getsegmentforrevs)fp_drevidxrnrs rHrz&revlog.get_streams..get_stream2s\\^tJ$Qx"jj55c:!8 (<%)%7%7F"d&:&::F"&66F%)ZZ%;%;F%CF"(3,C! "55c345HKK ($^^sC B"C7 C C C c3Kj5}ddkr|jntj|Ed{dddy7 #1swYyxYwwrr)rrrs rHget_index_streamz,revlog.get_streams..get_index_streamIsY]]_J!U* ggj11#'#5#5b #KKK %_ L %_.A(8A A A A(AA%!A(c3Kj5}ddkr|jntj|Ed{dddy7 #1swYyxYwwr)rrr4r)rrrs rHget_data_streamz+revlog.get_streams..get_data_streamQsY\\^rJ E) ggi00#'#5#5b #JJJ $^ K $^r )rrt entry_sizeend_inlinenextrr)r max_linkrev force_inlinertlinkrevr inline_streamrr  index_stream data_streamrrrs` @@@rH get_streamszrevlog.get_streamssE I !eAEl1oG$AA!e 6I))) HHQUO  << F'LM  -i1GH  L 'LM  -i1GH   L K,-L  )+K  i8, ; rKc |j\}}}|jd|j|jfz}n|jr8|jj d|jzrd|jz}nM|j r2|jj |jr |j}nd|jz}|||_||_ nd|_ |j||}t|dkDr#tj|ddd}d|_ n|}|dz|_|d z|_t#j$|j }|;t'd } | |j |j(fz} t+j,| |j|zrKt'd } |jd z } | | |j |j(fz} t+j,| t.|j } | d |j|_| d|j|_| d|_| ds ||_|} nV||_ |jrt9j:|||_n't9j<|||j|_|j|jj?|_d} |jj@} | dkDrg|j|j6|| } t| | kr;t'd} | |j(t| | fz} t+j,| d|_d|_d|_!|j?|jjE|_#|jjI|_%nA|jd|jz|_#n d|j|jfz|_#tL|_'|jNjP|_(|j2sd|_)d|_*|jBxr |xrtVdu}d}tX4|jBd}n%|jjZj%d}t\|_/|j t`k(rtbjd|_/nY|j tfk(r th|_/n:|j tjk(r tl|_/n|r tV|_/n |r tn|_/ |j_ |j0}|\}}|j0 xr&|jBduxrtqjr|d}|rotujv|}|X|d}t|d|jxkDr8|d|jxd|jzk(r||_>|j~|||_Btj|j|j0r |j6n |jF|j||_Etj|j|jJ|j|_Ftqjd|_Hi|_Iy#ttf$r,t+j,t'd|j(zwxYw)Ns%s.i.%ss%s.i.as%s.iTrrFrrs!unknown version (%d) in revlog %ss-unknown flags (%#04x) in version %d revlog %srrssidedatasdocket) use_pendingrK)rs.too few index data for %s: got %d, expected %ds%s.ds%s.d.%ss rust.indexupdate_nodemap_datasindex %s is corrupted)Jrrrrrexistsr_split_index_filerr _initemptyrrrrrrr#rr display_idr.rrr _generaldeltarr docketutildefault_docket parse_docketindex_filepath index_endr data_filepathrsidedata_filepathrr nodeconstantsnullidr_storedeltachainsrrrrv _parse_indexrr;parse_index_v0rrzr r|rr4 safehasattrrpersisted_datatip_revtip_noderr ValueError IndexErrorrtr:r _segmentfile_segmentfile_sidedatar_chaininfocache_decompressors)rr7rrr entry_point entry_datarsupported_flagsmsg display_flagr index_datar devel_nodemapuse_rust_indexdrt chunkcache use_nodemap nodemap_datas rHrzrevlog._loadindexbs8<8I5 & << #$ DLL'AAK   $++"4"4Y5K"L#djj0K __!3!3D4J4J!K00K!DJJ.K  !DL +D "DO 5GHJ:"%,,Z^>'',,##&66HI#11R7  d&:&:DOOLL'',,*4+?+?@H.8I.t/A/ABDL!:/!:4;M;M!ND ' 4D I&"-' $/!??#-#<# !:: rKc\ |j|}|S#t$r tjj |}|j |j }||j|<Y|S#t$r5tjtdtj|zwxYwwxYw)Nsunknown compression type %s) r7KeyErrorr4 compenginesforrevlogheaderrevlogcompressorrr.rr binasciihexlify)rt compressorengines rH_get_decompressorzrevlog._get_decompressors ,,Q/J  ))99!<#44T5I5IJ )3##A&   ''458H8H8KK   s B+A A))>B''B+crtj|j}|j|jSro)r4rLrrNr)rrSs rH _compressorzrevlog._compressors/!!$"2"23&&t';';<>{55rKc#K|jr|jdy|j|j5}|dddy#1swYyxYww)z%file object suitable to read sidedatarN)rrr)rrs rH_sidedatareadfpzrevlog._sidedatareadfpNsF   &&q) )T//0B100s:AA  A AAc2t|jdz SNrrrtrEs rHtiprevz revlog.tiprevWs4::""rKc@|j|jSro)rVrsrEs rHtipz revlog.tipZsyy''rKc4d|cxkxrt|kScSrH)rrrs rH __contains__zrevlog.__contains__]sC##d)####rKc,t|jSrorrrEs rH__len__zrevlog.__len__`s4::rKc<ttt|Sro)iterrrrEs rH__iter__zrevlog.__iter__csE#d)$%%rKcDtjt|||S)z8iterate over all rev in this revlog (from start to stop)startstop)r>iterrevsr)rrrs rHrevsz revlog.revsfs##CIUFFrKcF |j|y#t$rYywxYw)NTF)rrKrrVs rHhasnodezrevlog.hasnodejs'  HHTN  s   cf|j|tzs|j|tzryy)z;whether two revisions (baserev, rev) can be delta-ed or notFT)rer*)rbaserevrs rHcandeltazrevlog.candeltaqs- JJw "? ? JJsO; ;rKcz|j/|tj|ytj||yyro)rrupdate_persistent_nodemapsetup_persistent_nodemapr transactions rH update_cacheszrevlog.update_caches~s7    )"55d;44[$G *rKcd|_|jj|jj |j j i|_d|_|jj|j xr0|jduxr tj|jd}|r>$' '     J**1114--===+++##D$//1Z=I I Js BB%c>t|j|ddz S)Nrr)intrtrws rHrz revlog.starts4::c?1%+,,rKc|j|d}|dk7r|Sd|kr-|j|}|ddk7r |d|dzS|dz}d|kr-y)Nr rrt)rr sd_cut_offes rHsidedata_cut_offzrevlog.sidedata_cut_offskZZ_Q' ? 3h 3Atqytad{" 1HC 3h rKc,|j|ddzS)Nrrrrws rHrez revlog.flagsszz#q!F**rKc&|j|dSrqrrws rHlengthz revlog.lengthzz#q!!rKc@|jsy|j|dS)Nrr)rrtrws rHsidedata_lengthzrevlog.sidedata_lengths!zz#q!!rKcl|j|d}|dk\r|S|j|}t|S)z?return the length of the uncompressed text for a given revisionrr)rtrawdatar)rrlrQs rHrawsizezrevlog.rawsizes7 JJsOA  6H LL 1v rKc|j|}|tjtz zdk(r|j |St |j |S)z=length of non-raw text (processed by a "read" flag processor)r)rer8REVIDX_KNOWN_FLAGSr%rrrS)rrres rHrz revlog.sizesL 3 H///A Ba G<<$ $4==%&&rKc|j|t}|jtk7s |tk(ry|t k(ry|S)aReturn the rank of a revision if already known, or None otherwise. The rank of a revision is the size of the sub-graph it defines as a head. Equivalently, the rank of a revision `r` is the size of the set `ancestors(r)`, `r` included. This method returns the rank retrieved from the revlog in constant time. It makes no attempt at computing unknown values for versions of the revlog which do not persist the rank. Nr)rtrrr rr)rrranks rH fast_rankzrevlog.fast_ranks=zz#z*   ; .$,2F '> rKc|jj|}||S|j}|}||d}||k7r|}||d}||k7r||j|<|S)N)rrrt)rrbasertiterrevs rH chainbasezrevlog.chainbasesy##'',  K W~a goG>!$Dgo%)S! rKc&|j|dS)Nrrrws rHrzrevlog.linkrevrrKc |j|}|j r|dt k(r |d|dfS|d|dfS#t$r|tk(rtjwxYw)N)rtr3r r.rrr)rrentrys rH parentrevszrevlog.parentrevssw JJsOE  & &58w+>8U1X% %8U1X% % g~+++  s =$A!cv |j|dS#t$r|tk(rtjwxYw)Nr)rtr3r r.rrws rHrVz revlog.nodes? ::c?1% % g~+++  s$8cH|j||j|zSro)rrrws rHr z revlog.endszz#S!111rKc|j}||j|}|jr(|d|jk(r||dd||ddfS||dd||ddfS)Nrrr)rtrrr*)rrVir@s rHparentszrevlog.parentss{ JJ dhhtn   & &1Q44;;+>QqT71:q1wqz) )QqT71:q1wqz) )rKc*|j|dSrH) _chaininforws rHchainlenzrevlog.chainlen(ss#A&&rKc,|j}||vr||S|j}|j}|}||}d}d}||dk7rB|dz }||dz }|r|d}n|dz}||vr||} || dz }|| dz }n||}||dk7rB||dz }||f} | ||<| S)Nrrr)r6rtr!) rrchaininfocachert generaldeltarrclencompresseddeltalenrQrs rHrzrevlog._chaininfo+s-- . !#& & ))  'N1o AID !A$ & A$1 .("7+! "ad*"gA1o !A$ &  % &srKc |jj|||jS#t$rYnwxYwg}|j}|j}|}||}||dk7r6||k7r1|j ||r|d}n|dz}||}||dk7r||k7r1||k(rd}n|j |d}|j ||fS)aWObtain the delta chain for a revision. ``stoprev`` specifies a revision to stop at. If not specified, we stop at the base of the chain. Returns a 2-tuple of (chain, stopped) where ``chain`` is a list of revs in ascending order and ``stopped`` is a bool indicating whether ``stoprev`` was hit. rrTF)rt deltachainr!AttributeErrorappendreverse) rrstoprevchainrtrrrstoppeds rH _deltachainzrevlog._deltachainJs ::((gt7I7IJ J    ))  'N1o'W"4 LL !A$1 gA 1o'W"4 g G LL !G g~s &) 55ct|}|j}|D] }|| t3|jjrtj }|j}nt j}|j}|||||S)zGenerate the ancestors of 'revs' in reverse revision order. Does not generate revs lower than stoprev. See the documentation for ancestor.lazyancestors for more details.)r inclusive) listrV rustancestorrtrust_ext_compat LazyAncestorsr, lazyancestors_uncheckedparentrevs)rrrrcheckrevrrargs rH ancestorszrevlog.ancestorsssvDz99A QK  # (B(B(66M**C$22M++CS$9MMrKcXtj||j|jSro)r-descendantrevsrrrrs rH descendantszrevlog.descendantss##D$))T__EErKc | |jg}||j}|Dcgc]}|j|}}|Dcgc]}|j|}}Gdd}||j| j t  j |t}tj fd|D}|rU|j}||vr|j ||j|D]}| vs|j||rUt|}|j |D cgc]} |j| c} fScc}wcc}wcc} w)aReturn a tuple of the ancestors of common and the ancestors of heads that are not ancestors of common. In revset terminology, we return the tuple: ::common, (::heads) - (::common) The list is sorted by revision number, meaning it is topologically sorted. 'heads' and 'common' are both lists of node IDs. If heads is not supplied, uses all of the revlog's heads. If common is not supplied, uses nullid.c*eZdZdZdZdZdZdZy))revlog.findcommonmissing..lazysetc0t|_||_yro)set addedvalues lazyvalues)rrs rHrz2revlog.findcommonmissing..lazyset.__init__s#&5 ",rKc>||jvxs||jvSrorrrvalues rHrxz6revlog.findcommonmissing..lazyset.__contains__s! 0 00LET__4LLrKc3nK|j}|D]}||jD] }||vs| ywror)raddedrs rHr}z2revlog.findcommonmissing..lazyset.__iter__s:((AGA:)s+55c:|jj|yro)rrRrs rHrRz-revlog.findcommonmissing..lazyset.adds  $$U+rKc:|jj|yro)rupdate)rvaluess rHrz0revlog.findcommonmissing..lazyset.updates  ''/rKN)r^r_r`rrxr}rRrrDrKrHlazysetrs - M  , 0rKrc3,K|] }|vs| ywrorD).0rhass rH z+revlog.findcommonmissing..s!CUasl!Us )r*headsrrrRrrr collectionsdequepopleftrrrsortrV) rcommonrrrmissingvisitrpmissrs @rHfindcommonmissingzrevlog.findcommonmissingsE >kk]F =JJLE'-.v!$((1+v.&+,e!e, 0 0,dnnV,-  6%!!!CU!CC AG| A+A| Q, w- 9TYYt_999Y/,V:sE!E&E+c|tg}t6|jjr tj |j|St j |j|S)aOReturn an object that can be used to incrementally compute the revision numbers of the ancestors of arbitrary sets that are not ancestors of common. This is an ancestor.incrementalmissingancestors object. 'common' is a list of revision numbers. If common is not supplied, uses nullrev. )rrrtrMissingAncestorsr,incrementalmissingancestorsr)rrs rHincrementalmissingrevszrevlog.incrementalmissingrevssP >YF  # (B(B00VD D33DOOVLLrKc~|tg}||j}|j|}|j|S)axReturn the revision numbers of the ancestors of heads that are not ancestors of common. More specifically, return a list of revision numbers corresponding to nodes N such that every N satisfies the following constraints: 1. N is an ancestor of some node in 'heads' 2. N is not an ancestor of any node in 'common' The list is sorted by revision number, meaning it is topologically sorted. 'heads' and 'common' are both lists of revision numbers. If heads is not supplied, uses all of the revlog's heads. If common is not supplied, uses nullid.r)rheadrevsrmissingancestors)rrrincs rHfindmissingrevszrevlog.findmissingrevssD >YF =MMOE)))8##E**rKcZ| |jg}||j}|Dcgc]}|j|}}|Dcgc]}|j|}}|j|}|j |Dcgc]}|j |c}Scc}wcc}wcc}w)a.Return the ancestors of heads that are not ancestors of common. More specifically, return a list of nodes N such that every N satisfies the following constraints: 1. N is an ancestor of some node in 'heads' 2. N is not an ancestor of any node in 'common' The list is sorted by revision number, meaning it is topologically sorted. 'heads' and 'common' are both lists of node IDs. If heads is not supplied, uses all of the revlog's heads. If common is not supplied, uses nullid.r )r*rrrr rV)rrrrr rs rH findmissingzrevlog.findmissings >kk]F =JJLE'-.v!$((1+v.&+,e!e,)))8&)&:&:5&AB&A ! &ABB /,CsBB#B(cvgggf}|8t|}|s|St|Dcgc]}|j|c}}n|jg}t}|tk(rF|D|Dcgc]}|j |c}|jgt|j fS|t|dz }d}i}ngt|}|s|St}tj|d}t|} t| Dcgc]}|j|c}}| r| j}||jk(r"|j|}||k\ri||vrP|j|| j|j|D cgc]} | |jk7s| c} n||vr|j|| r|s|S|tkDrA|D cgc] } | |vs|  }} |r)t|D cgc]} |j| c} }n|St}|jg}t|} | j!}g} |j#t|d|dzD]}|j |}d}|tk(rd}n|| vr@d}||vrut%|j|} | d| vs| d| vrM|j'|n;t%|j|} | d| vs| d| vr| j|d}|s|||vs| j)|| ||vrd||<|d||<|j|D]} |j| d|j+Dcgc] \}}|s | }}}t|}| sJ|sJ|sJ| ||fScc}wcc}wcc}wcc} wcc} wcc} wcc}}w)aReturn a topological path from 'roots' to 'heads'. Return a tuple (nodes, outroots, outheads) where 'nodes' is a topologically sorted list of all nodes N that satisfy both of these constraints: 1. N is a descendant of some node in 'roots' 2. N is an ancestor of some node in 'heads' Every node is considered to be both a descendant and an ancestor of itself, so every reachable node in 'roots' and 'heads' will be included in 'nodes'. 'outroots' is the list of reachable nodes in 'roots', i.e., the subset of 'roots' that is returned in 'nodes'. Likewise, 'outheads' is the subset of 'heads' that is also in 'nodes'. 'roots' and 'heads' are both lists of node IDs. If 'roots' is unspecified, uses nullid as the only root. If 'heads' is unspecified, uses list of all of the revlog's heads.NrFrrT)rrrr*rrVrrrrfromkeysmaxpoprRrrcopyrtupleremoverr)rrootsrnonodesr lowestrevr highestrevr nodestotagrrootr orderedout isdescendantheadrs rH nodesbetweenzrevlog.nodesbetween s*r2,  KE%8%QTXXa[%89I[[MEI  u}(,,t!1t, TZZ\"  =TQJIEKEIMM%/EUJ:>:adhhqk:>?JNN$ #HHQK > )" a("))(, QL11 ;KQLe ! +, 7" +0E%$493D%E #$FTXXd^$F GI#N$  %j   " Y!2aHA ! A LG## k!# :dll1o.A! +11D Q$,,q/*aDK'QqT[-@OOA&#'L)"3i!!!$)U  $E!H& $E!H!\\!_ !T*-MIP). > *$ >U z u uE5))I9-0?"M"F%Gv?s;N"N;N!N&N& N+N+*N0) N54N5c2| |jjSt6|jj r tj|j|St j||jS#t$r|jcYSwxYwro)rtr r _headrevs rustdagoprr-rrs rHr zrevlog.headrevss < (zz**,,  TZZ%?%?%%djj$7 7~~dD$=$=>> " (~~'' (sA::BBc8|jj|Sro)rtcomputephasesmapsets)rrs rH computephaseszrevlog.computephasesszz..u55rKct|}|stgSdg|dzz}|j}|D]}d||<||}dx||d<||d<t|Dcgc] \}}|s | c}}Scc}}w)Nrrrr)rrrt enumerate)rcountisheadrtrrvals rHr#zrevlog._headrevssD 9  " AF1IaA*+ +F1Q4L6!A$<!*& 19 1faS 1999s  A,$A,c|G|Et|s |jgS|jDcgc]}|j|c}S|t}n|j |}|xsgDchc]}|j |}}t j|j|j||}|Dcgc]}|j|c}Scc}wcc}wcc}w)areturn the list of all nodes that have no children if start is specified, only heads that are descendants of start will be returned if stop is specified, it will consider all the revs from stop as if they had no children )startrevstoprevs) rr*r rVrrr-headrevssubsetrr)rrrrrr/rrs rHrz revlog.headss =T\t9 }$*.--/:/QDIIaL/: : =EHHUOE)-4ADHHQK4## IIt +//$3 #$//;5 0sC,C7Ccng}|j|}|j|dzD]}|j|Dcgc]}|tk7s |}}|r.|D](}||k(s |j |j |*[|tk(se|j |j ||Scc}w)z!find the children of a given noder)r)rrrrrrV)rrVrZrrprprevss rHchildrenzrevlog.childrens  HHTNQ'A"&//!"4F"4Bg R"4EFBQw1. g1&(Gs B2B2c|j||j|}}|j||}tj|j|S)z@calculate all the heads of the common ancestors of nodes a and b)r_commonancestorsheadsr1maplistrVrabancss rHcommonancestorsheadszrevlog.commonancestorsheadssDxx{DHHQK1))!Q/ 400rKc |jj|}|S#ttf$r$t j|j g|}Y|SwxYw)z7calculate all the heads of the common ancestors of revs)rtr<r OverflowErrorr,r)rrr;s rHr6zrevlog._commonancestorsheadss[ I24::22D9D  . I00H4HD  Is/AAcj|j||j|}}|j||S)zgreturn True if node a is an ancestor of node b A revision is considered an ancestor of itself.)r isancestorrevrr9r:s rH isancestorzrevlog.isancestors0xx{DHHQK1!!!Q''rKcn|tk(ry||k(ry||kDryt|j||g|gdS)zreturn True if revision a is an ancestor of revision b A revision is considered an ancestor of itself. The implementation of this is trivial but the use of reachableroots is not.TF) includepath)rrreachablerootsrAs rHr@zrevlog.isancestorrevsE < !V UD''A3'GHHrKc |jj||||S#t$r&tj|j ||||cYSwxYw)zlreturn (heads(::( and ::))) If includepath is True, return (::).)rtreachableroots2rr-_reachablerootspurer)rminrootrrrDs rHrEzrevlog.reachablerootssZ ::--{  ,,%   s ,AAcF|j||j|}} |jj||}|rtt|j|S|jS#ttf$r$t j|j ||}Y_wxYw)z5calculate the "best" common ancestor of nodes a and b) rrtrrr>r,rrmaprVr*r8s rHr,zrevlog.ancestor sxx{DHHQK1 =::''1-D s499d+, ,{{  . =%%dooq!rrOError)ridrVrs rH_matchz revlog._match-s9 b# 99R= r7d((00 0   b'Cs{b   Qw$i#oQw#T*  99S> !$$  M*    r7a$,,444 4 2w NNE$5$56   5s7B1AC 1CC CCD###E E c|jjj|}d} |jj |}|r|j |r|rd}n|S|rt jy |r*t j||jtd||jvr|j|St!|dkr\t!|dzdz} t!|dzdkDr |dt"vryt%|d|}|jDcgc]}|d j|s|d }}|D cgc]1} t'| j|s|j | s0| 3}} |jj(j|r|j+|j,t!|dkDrQt!|d k(r|s|d|j|<|dSt j||jtd|rt jyy#t j$rt|ddsd}Yttf$rYwxYwcc}wcc} w#t.j0$rYywxYw) NFT filteredrevssambiguous identifier(rrrrr)r)wdirhex startswithrt partialmatchrr.rrr rr2AmbiguousPrefixLookupErrorr r rr hexdigitsrrnullhexrr*rOrO) rrP maybewdir ambiguouspartialrprefixrnlrs rH _partialmatchzrevlog._partialmatchOsb&&..99"=   jj--b1G4<<0 $I"N+++" 22DOOQ'>%?   <<# # r7b=B1 q A r7Q;?rFi/#RV%)JJJJq!A$//&2IadJJ!!!SV%6%6r%:t||AAr%%--88<IIdkk*r7Q;2w!|I+-a5 R(!!u ::DOOQ/F-G///9 #   !46  +   0K >>  sS4H'H'I+9I+I!/I!<I&I&.I&'"I II+JJc|j|}||S|j|}|r|Stj||jt d)z{locate a node based on: - revision number or str(revision number) - nodeid or subset of hex nodeid sno match found)rQr`r.rr r )rrPrs rHlookupz revlog.lookupsR KKO =H   r " HDOOQ7H5IJJrKcxfd}dt}fd}tdds/ tjj |}|||Sjjk(r.t|t|dzD]}|d|}||s|cSt|t|dzD]}|d|}||s|||cSy#t j $rFjjk7r*t jjtdYt$rYwxYw)z7Find the shortest unambiguous prefix that matches node.c j|}|*tjj t dy#tj$rYytj$rYywxYw)NFTr)r`r.rXrrr r )r^ matchednoderVrs rHisvalidz revlog.shortest..isvalidsk "008 "''dooq}MM33 ((  sAA+A+*A+cLtdtj|DS)Nc3&K|] }|dk( yw)fNrD)rrZs rHrz5revlog.shortest..maybewdir..sG*FQqDy*Fs)allr1 iterbytestr)r^s rHr[z"revlog.shortest..maybewdirsG(*>*>v*FGG GrKcbt|t|dzD]}|d|}|r|cSy)zDisambiguate against wdirid.rN)rr)hexnode minlengthrr^r[s rH disambiguatez%revlog.shortest..disambiguates6 3whashrevisionsha1)rrVrGp1p2s rHcmpz revlog.cmps0 d#B++D"b9TAArKcv|j}||}t|ddz }||k(r ||dz}n||}t|ddz |dz}|jr>||dz|jjzz }||dz|jjzz }||z } ||jj || |fS)aObtain a segment of raw data corresponding to a range of revisions. Accepts the start and end revisions and an optional already-open file handle to be used for reading. If the file handle is read, its seek position will not be preserved. Requests for data may be satisfied by a cache. Returns a 2-tuple of (offset, data) for the requested range of revisions. Offset is the integer offset from the beginning of the revlog and data is a str or buffer of the raw byte data. Callers will need to call ``self.start(rev)`` and ``self.length(rev)`` to determine where each revision's data begins and ends. rrr)rtrrr r4 read_chunk) rr.endrevrrtistartrr iendrs rHrzrevlog._getsegmentforrevss$ xF1IO$ v &)#C=Dd1gm$tAw.C << hldjj&;&;; ;E FQJ$**"7"77 7Cud''225&"EEErKc |j|d}|j|||d}|tk(r|S|tk(r|j |S|t k(r|j |Sd}||z}tj|)a<Obtain a single decompressed chunk for a revision. Accepts an integer revision and an optional already-open file handle to be used for reading. If used, the seek position of the file will not be preserved. Returns a str holding uncompressed data for the requested revision. rrunknown compression mode %d) rtrrrr[rrYr.r)rrrcompression_moderrr;s rH_chunkz revlog._chunks ::c?2.&&sCB&7:  .K !2 2%%d+ + !1 1??4( (0C # #C##C( (rKc j|sgS|j}|j}|j}|jj}t j }g} | j} |js|f} ntj|||} | D]} | d} | dddD]}||dk7sn |j| |\}}|j}|j}| D]}||}|r ||dz|zz }||}|j|d}||||z |}|t k(r | |Q|t"k(r| ||i|t$k(r| ||d}||z}t'j(|| S#t$r,| Dcgc]}|j||ncc}wc}cYcSwxYw) aObtain decompressed chunks for the specified revisions. Accepts an iterable of numeric revisions that are assumed to be in ascending order. Also accepts an optional already-open file handle to be used for reading. If used, the seek position of the file will not be preserved. This function is similar to calling ``self._chunk()`` multiple times, but is faster. Returns a list with decompressed data for each requested revision. ) targetsizerNrrrr|r})rrrrtr r4rrr deltautil slicechunkrr>rrYr[rrrr.r)rrrrrrrsiosizerrladd slicedchunks revschunkfirstrevlastrevoffsetrrrdecomp def_decomp chunkstart chunklength comp_moderZr;s rH_chunkszrevlog._chunkssI && xx## 7L$//dzL&I |H$TrT?'?a'+ F#66xR6P  __F++J "3Z 37f"44J$Sk  JJsOB/ 4f!4kB/G"22O"33A'8C9$C++C00!!#&F5! F 3Qx 3; 7? 1Xkk"o"  $ABwB kk"o" 1Xkk"o"  $ABwB kk"o" 2:t$$rKc|j|stjdt|j |ddz S)z/number of snapshot in the chain before this onesrevision %d not a snapshotrr)rr.ProgrammingErrorrrrws rH snapshotdepthzrevlog.snapshotdepth~s@s#(()FG G4##C(+,q00rKc|tk7r.|j||k(rt|j|St j |j ||j |S)zreturn or calculate a delta between two revisions The delta calculated is in binary form and is intended to be written to revlog data directly. So this function needs raw revision data. )rrbytesrr/textdiffr)rrev1rev2s rHrevdiffzrevlog.revdiffsT 7?t//5=T*+ +~~dll40$,,t2DEErKc&|j||S)zreturn an uncompressed revision of a given node or revision number. _df - an existing file handle to read from. (internal-only)  _revisiondatar nodeorrev_dfs rHrSzrevlog.revisions !!)S11rKclt|tr|}n|j|}|j|S)za map of extra data related to the changeset but not part of the hash This function currently return a dictionary. However, more advanced mapping object will likely be used in the future for a more efficient/lazy code. )rMrr _sidedata)rrrrs rHr=zrevlog.sidedatas0 i %C((9%C~~c""rKct|tr|}|j|}n|}d}||jk(ry|j |||\}}}|r|r|S||j |}|j |}|r |tk(r|S|rtj|||} |} ntj|||} | \} } | r|j| |||s |||f|_ | S)NrK)r)r) rMrrVr*_rawtextrrer$r8processflagsrawprocessflagsread checkhashr) rrrrawrrVrawtext validatedre validatehashrGrs rHrzrevlog._revisiondatas i %C99S>DDC 4;; #'--cs-"CWi 9N ;((4.C 3 "66N #33D'5ILD))$?A!" D,  NN43N /#'g"6D  rKcd}d}|jr3|jd|k(r||jddfS|jd}||j|}|j||\}}|r|jd}d|_d}|j|d} d| krd| z}|j |||} |t | d}| dd} t j|| } ~|| d fS) zjreturn the possibly unvalidated rawtext for a revision returns (rev, rawtext, validated) NrrTr)rr)rrF)rrrrtrrr/patches) rrVrr cachedrevbasetextrrrrbinsrs rHrzrevlog._rawtexts    ""1%-T003T::++A.I ;((4.C))#y)Aw **1-H# **S/!$ <WJ||Ecj|A  T!W~H8D--$/ We$$rKc|j|}|d}|d}|jr||jjd|zzz }|dk(riS|jj||zkrH|j }|jj}|}|}t ||||fz} tj| |jj||} |j|d} | tk(r| } nR| tk(r|j| } n7| tk(r|j| } nd} | | z} tj| t!j"| }|S)z0Return the sidedata for a given revision number.rrrr r})rtrr r sidedata_endrFILE_TOO_SHORT_MSGr.rr5rwrrr[rrY sidedatautildeserialize_sidedata)rr index_entrysidedata_offset sidedata_sizefilenamer rrm comp_segmentcompsegmentr;r=s rHrzrevlog._sidedatasQjjo %a.#A << tzz44C@ @O A I << $ $'F F))H,,++C$F"F"h%DDA##A& &11<< ] zz#r" ? ""G & &((6G % %ool3G0C 4KC##C( (44W=rKc*|j||dS)zreturn an uncompressed raw data of a given node or revision number. _df - an existing file handle to read from. (internal-only) T)rrrs rHrzrevlog.rawdata"s !!)Sd!;;rKc0tj|||S)zyCompute a node hash. Available as a function so that subclasses can replace the hash as needed. )r>rr)rrGrsrts rHhashz revlog.hash)s ++D"b99rKc$ |||j|\}}||j|||k7r|jr|jd|k(rd|_|}|tjt |}t jtd|jtj|fzy#t j$rD|jr6tj|r!t j|j||wxYw)zCheck node hash integrity. Available as a function so that subclasses can extend hash mismatch behaviors as needed. Nrsintegrity check failed on %s:%s)rrrr3rrr.rr r r1bytestrrr>iscensoredtextCensoredNodeError)rrGrVrsrtr revornodes rHrzrevlog.checkhash1s  zbjd+Btyyr2..&&4+>+>q+AT+I*.D' $ / 5 5c$i @I''89(8(8(CDE/"   K$>$>t$D--dootTJJ  s B5B88ADctjj|j}t |dkDr+|ddz}tjj |g|ddS|jdzS)zthe path where to expect the index of an ongoing splitting operation The file will only exist if a splitting operation is in progress, but it is always expected at the same location.rrs-sNs.i.s)rdpathsplitrrjoin)rpartsr s rHrzrevlog._split_index_filePsb  djj) u:>8e#D77<<1uQRy1 1::' 'rKc t|dz }|j||j|z}|jr |tkry|j |j }|+tjtd|j z|r|j|j d|j|jdd}|jId}|jd}|j|jd|_ d|j _|r|j |j$|j&t)j*|fd}fd } |j-|j.dd |j.z} nd |j.dz} |j1| ||j3| | |j5d } | j7d |j95} |D](} | j;|j=| | | d*| jddd|r|_|j?5}|xj@tBzc_ d|_|D]x}|jDjG|}|dk(rE|jH9|j@|jJz}|jDjM|}||z}|j;|z|jH|jO|jH_(dddtSjT||tWjV|j&|j|jX|_|r-|j[}|| df|_ | |j _d} | | jyy#1swYxYw#1swYxYw#| | jwwxYw)aCheck if the revlog is too big for inline and convert if so. This should be called after revisions are added to the revlog. If the revlog has grown too large to be an inline revlog, it will convert it to use multiple index and data files. rNs%s not found in the transactionT) for_offsetrFcPjd}||_yy)NT)r)renamer)tr maybe_selfnew_index_file_pathold_index_file_pathr weak_selfs rHfinalize_callbackz4revlog._enforceinlinesize..finalize_callbacks9 ''# '[ ),?J)*rKc(}||_yyro)r)rrrrs rHabort_callbackz1revlog._enforceinlinesize..abort_callbacks&[ ),?J)*rKs000-revlog-split-%d-%ss000-revlog-split-%drbr).rrrr _maxinline findoffsetrr.rr addbackuprRrrflushcloser4writing_handlerrweakrefref registertmpr addfinalizeaddabortrtruncaterwriter_revlog__index_new_fprrrtrrrrtellr&rrr:r_revlog__index_write_fp)rr side_writers total_sizetroffsetexisting_handlesrrr callback_idnew_dfhread_ifhrrrrifhrrrrs @@@@rH_enforceinlinesizezrevlog._enforceinlinesize`snTQZZ'$++f*== ||zJ6 ==1  ##45G   LLTL : t~~q!     +# %%a(B HHJ HHJ$(D /3D   , "&// "&"8"8 [[F D)I @ @ NN. /{{1~)7$++E 4t{{1~E NN;(9 : KK ^ 4,,u%* HAMM$"9"9!Q8"9"LQ"OP ! "5$$&"""'7&77"$ A //2AAv$,,"6!%!3!3d6J6J!J!%!7!7!?"QJHHQK <<+-/WWYDLL*'  0 0T : 0 A A $$!D   ++-(+Wd';$3:!!0 " #Q!'&B" #s>8O%>O !O%'C O1BO% OO%O"O%%O:cy)z0called when trying to add a node already stored.NrD)rrrVs rH_nodeduplicatecallbackzrevlog._nodeduplicatecallbacksrKc#K|jj5|jj5dddddddy#1swYxYw#1swYyxYww)zCContext manager that keeps data and sidedata files open for readingN)r4readingr5rEs rHrzrevlog.readingsK   & & (++3356) (55) (s2A&AAA A&A AA#A&c#K|jr&d}||jz}tj||jdydx}x}} t |}d}|r|j |dz }d}|js |jd}|j!|jdtjn4|j|jjtj|j!|j"||j$|J |j'|j$d}|j|jj(tj|j!|j$|jj(||j*j,z}|j/}|jr |j!|j0||zn|j!|j0||||f|_|jr|n||j2_||j6_d|j|j9|d|_d|j2_d|j6_||j;||j;||j;yy#t$r|jd}YwxYw#t$r!|j'|j$d}YwxYw#d|_d|j2_d|j6_||j;||j;||j;wwxYww)Ns)try to write in a `trypending` revlog: %srrrarbr^)rr r.rrrr rrrrcrdredata_endrfrrRrrrrrtr rrr4rr5 _write_docketr) rrr;rdfhsdfhrdsizeisizes rH_writingzrevlog._writings   >C 4?? "C((- -    + # #C ##6 I HHQUOE||2"ll51<</HHQ 4HHT\\%:%:BKKH OODNNE:%%1?*?K#{{4+=+=E{J!:!:BKKH OO**DLL,E,E DJJ111++-<<OODOOUU]COODOOU;(+S$'7$:>,,3C!!0<@**9<<+&&{3'+$37!!0<@**9?IIK#JJL?IIK#O-2"ll512-K#{{4+=+=E{JK*(,$37!!0<@**9?IIK#JJL?IIK#skA M? 1L?A2K 1,LAK-/Ct|dk(r0|j6r|j8rt:}nt<}|d|d|f}t?j@|||||||}| jC|| }tD}|jF1|jFjH}t3jJ||}|\}}tD}| r|jLrtN}tQjR| } |jFjT}!|jW| \}"}#|"d k7rU|#ddd k7rMt|#t| kr6|"rJ|#dd|jFjHk(r tX}|#} n tD}|#} nd } d}!tZ}$|j\r||ft^t^fk(rd}$n|t^k7r|t^k(rd|ja|z}$n|t^k(r|t^k7rd|ja|z}$ntb8|jjdr"tbjg|j||}$nKti||f\}%}&d|ja|&z}$|$tkd |jm|&g|%gDz }$t?jn|||jp|||jr|||||!t| ||$ }'|jju|'|jjw|}(|dk(rE|jF9|jx|jzz})|jj}|)})|)|(z}(|j||(|j||| |!|d}| r|| j|| }t|tk(r |||f|_D|j|j|<|S)ainternal function to add revisions to the log see addrevision for argument descriptions. note: "addrevision" takes non-raw text, "_addrevision" takes raw text. if "deltacomputer" is not provided or None, a defaultdeltacomputer will be used. invariants: - rawtext is optional (can be None); if not set, cachedelta must be set. if both are set, they must correspond to each other. s %s: attempt to add null revisions %s: attempt to add wdir revisionN1adding revision outside `revlog._writing` contextrr write_debugrrrrKc3 K|]}dyw)rNrD)rr s rHrz&revlog._addrevision..s sP+Oa+Os )re data_offsetdata_compressed_lengthdata_uncompressed_lengthdata_compression_modedata_delta_baselink_rev parent_rev_1 parent_rev_2node_idrsidedata_compressed_lengthsidedata_compression_moder)Gr*r.rr r r)rrrrrr_get_data_offsetrrrtr rrr/ patchedsizerArr_reportrrr!rrrr2 revisioninfo finddeltainforrrXdelta_compressionrrrserialize_sidedatarrrrrrrr$rrsortedsumrrdeltalenrrrrrr _writeentryrr buildtexttyperrrr)*rrVrrrrsrtrer alwayscacherr=r;fhbtextcurrprevrrrrp1rp2rtextlenrdelta_base_reuserevinfo deltainfor~ default_comprr&serialized_sidedatarh comp_sidedatarpminpmaxrrrs* rHr zrevlog._addrevision s6 4;; ##56H  D&&-- -t))999##56H     'FC((- - <<%%a(B%%a(B 4yax&&t,  # #!11NCd||((&4$**:O:O3O*O (($1F1F*F((dnnfE88B<"S ?'' D*Q-0*Q-G'lG  K  )11 %33+M  !c*o&:!!d&9&9#7 #6 $Q-A8HIJ**        "//< + << #<<BBL++L)DA*+ ' i$4! (((7 %"."A"A("K "ll77O#}}-@A A}T !!A&%/ &-@)AA u!!A&||>>?1B-*7'0@-*7'"%  O   Szgw//C7N4>>#..C7N4>>#..(TZZ-G-G$>>$**c3?D!'c !3JD$t~~d33DCP4+?+?+OPPPD   #,#5#5%,"2%NN+'*+>'?&? " ! ''- 19-''$*>*>>FZZ++F3FUNE    NN     ( 7?#--gr:G =E !#'w"7D %.%8%8T" rKch|j|j|S|jjS)aReturns the current offset in the (in-transaction) data file. Versions < 2 of the revlog can get this 0(1), revlog v2 needs a docket file to store that information: since sidedata can be rewritten to the end of the data file within a transaction, you can have cases where, for example, rev `n` does not have sidedata while rev `n - 1` does, leading to `n - 1`'s sidedata being written after `n`'s data. TODO cache this in a docket file before getting out of experimental.)rr r)rr8s rHr'zrevlog._get_data_offset s, << 88D> !<<(( (rKc|jd}tj||j\} } } |j!| j dt j n4| j |jjt j| ra|j!| j dt j n4| j |jjt j| r4| j |jjt jt|dz } |js|j|j||jr|j|j||j|j | t|z|dr| j#|d| j#|d|r| j#|| j#|n|| |j$j&zz }|j|j || j#|| j#|d| j#|d|rJ|j)||j|jd} |jd}|jd}| J|J|J| j+|j_|j+|j_ |j+|j_ t-j.||y)Nrrrr)rr.rrrcrdrer&rfrrrrrRrrrrrtr rrrr)rrrrrrrr=rr;rrrr7wh1wh2wh3s rHr1zrevlog._writeentry st    'FC((- ---S$ <<  HHQ $ HHT\\++R[[ 9 ||#BKK(.. <  IIdll// =4y1}|| OODNNF 3!! 2 2OD OODOOTCJ-> ?Aw $q'" IId1g  8$ IIe  dTZZ222 2F OODOOV 4 IIe  IId1g  IId1g  <  # #K 0 << #&&q)C&&q)C&&q)C? "?? "?? "?%(XXZDLL "$'HHJDLL !(+ DLL %,,[$?rKc V|jrtjd|%|jr|jrt }nt }d|_d} |j|5d} |jr |j} tj|| |} |D]} | \} }}}}}}}||}|xst}|jj| }| |j|||r |||d} ^||fD]G}|jj!|rtj"||j$t'd|jj!|s*tj"||j(t'd|j+|}|t,k7r|j/|rt1j2d}|j5|}t7||z }|d|t9j:||k7r/tj<|j(|j?||s|jA||r |tBz}|jE| d||||||||f|| | }|r |||d}  dddd|_| S#1swYxYw#d|_wxYw) a\ add a delta group given a set of deltas, add them to the revision log. the first delta is against its parent, which should be in our log, the rest are against the previous delta. If ``addrevisioncb`` is defined, it will be called with arguments of this revlog and the node that was added. scannot nest addgroup() callsNT)r debug_infoFsunknown parentsunknown delta bases>lll)r4rr=)#rr.rr!rrrrrr)rrr$rtrrhas_noderrr r rr iscensoredstructcalcsizerrr/replacediffheaderCensoredBaseErrorrV_peek_iscensoredr)r )rr6 linkmapperrr4 addrevisioncbduplicaterevisioncbrKdelta_base_reuse_policyemptyrrrrrVrsrtri deltabasergrer=rrrrhlenoldlennewlens rHaddgroupzrevlog.addgroup s,   (()HI I # *!!d&9&9*>'*='!X '{+" $$"-"5"5K ) 7 7 +)! #D  ! %h/D!9%9E**,,T2C33KE./c: %  "X#zz2215"'"3"3 !4::q1B/C#&  ::..y9#//%t:O8P#hhy1G')doog.F &w7!%g!6!$Ud!2 $<5+B+B"F,#("9"9 $71C#!T%:%:7E%J!22++# %)@A$/&3!), C%%dC0!EW#,n"'D yq,+n"'D s,J$B5JE&JJJJ J(cL|jsy|j|tzS)z%Check if a file revision is censored.F)rrer)rws rHrMzrevlog.iscensoredm s"zz#!222rKc^|jsytj|||jS)z6Quickly check if a delta produces a censored revision.F)rr>deltaiscensoredr)rrrgs rHrRzrevlog._peek_iscensoredt s'**5'4<<HHrKctj|t|dz |j|j|j S)zfind the minimum rev that must be stripped to strip the linkrev Returns a tuple containing the minimum rev and a set of all revs that have linkrevs that will be broken by this strip. r)r>resolvestripinforr rr)rminlinks rH getstrippointzrevlog.getstrippoint{ s< ++  IM MMO LL OO   rKcpt|dk(ry|j|\}}|t|k(ry|j|}|js6|j |j |||j jz}n|||j jzz}|jr-|j|}|j |j||j |j||jP||j_ ||j_ |j_|jj|dd|_t#j$d|_|j(j+|j,j+|j |d=y)a7truncate the revlog on the first revision with a linkrev >= minlink This function is called when we're stripping revision minlink and its descendants from the repository. We have to remove all revisions with linkrev >= minlink, because the equivalent changelog revisions will be renumbered after the strip. So we truncate the revlog on the first of these revisions, and trust that the caller has saved the revisions that shouldn't be removed and that it'll re-add them after this truncation. rNT) strippingrr)rrcrrrRrrtr rrrrr&rrrrr4rr6r4rr5)rrbrrr rr rs rHstripz revlog.strip sa t9> ##G,Q #d)  ::c?|| OODNNH 5 ---CcDJJ$9$99:C   005L OOD.. =- << #&)DLL "$,DLL !(4DLL % LL  {d  ;##005 %%' ""..0 JJs2v rKcd}t|r'td|jt|dz } |j5}|j dt j |j}ddd|z } |j|j}|j dt j |j}|j|jj}td||z}|||zz }|jr=d}|D] } |td|j| z }"d}|t||zz |z }||fS#1swYxYw#t$rd}YwxYw#t$rd}Y||fSwxYw)zCheck size of index and data files return a (dd, di) tuple. - dd: extra bytes for the "data" file - di: extra bytes for the "index" file A healthy revlog will return (0, 0). rrN)rrr rrciorerrrrrrtr rr) rexpectedrgactualddsrdi databytesrs rH checksizezrevlog.checksize sf t91dhhs4y1}56H 1q"++& ("B  DOO,A FF1bkk "VVXF GGI %%AAv{#A1q5!B|| AQ A!77Ic$i!m+i7Bx1 ! B "! BBx s<E&1E7 E&CE7E#E&& E43E47 FFc|jg}|j)|js|j|j|S|j|j|j |j jd|j jr|j|j|j |j jd|j jr|j|j|j |j jd|S)NF) include_empty) rrrrrextendrold_index_filepathsrold_data_filepathsrrold_sidedata_filepaths)rress rHfilesz revlog.files s    $<< 4>>*  JJt(( ) JJt||77e7L M||$$ 4>>* JJt||66U6K L||(( 4--. JJt||:::O P rKcj|dvrtjd|z||jsd}|js#|tj k7rtj }tj|||t|j|j|j|j|j|||||S)N)snodesstorageslinearNs"unhandled value for nodesorder: %sry) deltaparentfn candeltafn rawsizefn revdifffnflagsfn deltamode revisiondataassumehaveparentrevisionssidedata_helpersrK)r.rr!r+r5CG_DELTAMODE_PREVCG_DELTAMODE_FULLr> emitrevisionsr[rrrrre)rnodes nodesorderrrrrrKs rHrzrevlog.emitrevisions s D D((5 B   d&8&8#J&&Z999"44I((    **}}llllJJ%&?-!  rKalwayssamerevsneverfulladd>rrrrc||jvrttd|zt|rttdt |ddrttdt |ddrttd|j }|j }|j} ||jk(rd|_d|_n;||jk(rd|_d|_n||jk(rd|_d|_|xs| |_|j||||||||_||_| |_y#||_||_| |_wxYw) a]Copy this revlog to another, possibly with format changes. The destination revlog will contain the same revisions and nodes. However, it may not be bit-for-bit identical due to e.g. delta encoding differences. The ``deltareuse`` argument control how deltas from the existing revlog are preserved in the destination revlog. The argument can have the following values: DELTAREUSEALWAYS Deltas will always be reused (if possible), even if the destination revlog would not select the same revisions for the delta. This is the fastest mode of operation. DELTAREUSESAMEREVS Deltas will be reused if the destination revlog would pick the same revisions for the delta. This mode strikes a balance between speed and optimization. DELTAREUSENEVER Deltas will never be reused. This is the slowest mode of execution. This mode can be used to recompute deltas (e.g. if the diff/delta algorithm changes). DELTAREUSEFULLADD Revision will be re-added as if their were new content. This is slower than DELTAREUSEALWAYS but allow more mechanism to kicks in. eg: large file detection and handling. Delta computation can be slow, so the choice of delta reuse policy can significantly affect run time. The default policy (``DELTAREUSESAMEREVS``) strikes a balance between two extremes. Deltas will be reused if they are appropriate. But if the delta could choose a better revision, it will do so. This means if you are converting a non-generaldelta revlog to a generaldelta revlog, deltas will be recomputed if the delta's parent isn't a parent of the revision. In addition to the delta policy, the ``forcedeltabothparents`` argument controls whether to force compute deltas against both parents for merges. By default, the current default is used. See `revlogutil.sidedata.get_sidedata_helpers` for the doc on `sidedata_helpers`. s value for deltareuse invalid: %ssdestination revlog is not emptyrSNs$source revlog has filtered revisionss)destination revlog has filtered revisionsTF) DELTAREUSEALLr2r rr rrrDELTAREUSEALWAYSDELTAREUSESAMEREVSDELTAREUSENEVER_clone) rr destrevlogrT deltareuseforcedeltabothparentsr oldlazydeltaoldlazydeltabaseoldamds rHclonez revlog.clone$ sfj T// /56C  z?QABC C 4 .QFGH H :~t 4QKLM M",, %44-- 2T222,0 )(, %t666,1 )(, %t333,1 )(- %+@+JFJ ( KK%  %1J !(8J %+1J (%1J !(8J %+1J (s ,A:D<<Ecd}|jr |j}tj||}|j} |D]} | | } | ddz} | d} | | dd}| | dd}| d}d}d}||j k(rj|j | }|j| }|*tj|||| \}}| |d|d zz} |j||| ||||| || n|jr6|j| }|tk7r|t|j| f}d}|s"|j | }|j| }||j| }|*tj|||| \}}| |d|d zz} |j!|5|j#|||| ||| ||| ddd|s||| |y#1swYxYw) zBperform the core duty of `revlog.clone` after parameter processingNrrrrrrrr)rrVrerr=r )rr)rrrtDELTAREUSEFULLADDrr=rrun_sidedata_helpersr rrrrrrr )rrrrTrrrrrrtrrrerrsrtrVrrrGr= new_flagsdps rHrz revlog._clone sR   **K!// #  C#JE!Hv%EAhGuQx#BuQx#B8DJGT333))#.==-#/,8,M,M.#-)Xy"IaLIaL=$@@E&&)"/%' (())#.BW}&(% C0@*A%B !"005G#}}S1H##}}S1H#/,8,M,M.#-)Xy"IaLIaL=$@@E((,++"&3!), -dC.Op-,s &GG% c|jtk(r+tjt d|jz|jt k(rt j||||yt j||||y)Ns%cannot censor with version %d revlogs) rrr.rr rr< v1_censor v2_censor)rr censornode tombstones rHcensorrevisionzrevlog.censorrevision sr   8 +##:;&&'  ! !X -   dB I >   dB I >rKc #K|j\}}|rttd|z|rttd|z|j}||dk7r*ttd|j||dfzt |d<t |d<|D]}|j |} |jd d }|r||j|z}t|||||j|}t|j|} || k7rttd | |fz| y#tj$r4|d r,ttd| |dj|Yt $rX} ttdt#|t%j&| fz| |dj|Yd} ~ Dd -!IIlA6 C0I y%>\\#&d+,8' CDBxO!}F** 1+,' 56T+&**40 -#/0T{J$;$;A$>?@ k"&&t,,  -s?B:G,=BEG,AG)G, G)A G$G,$G))G,ci}|rRjjfg|d<js*|djjjf|rg|d<|rt |d<|r+t tjt|d<|r%t fdjD|d<|S)Nsexclusivefiless sharedfilessrevisionscounts trackedsizec3hK|])}jj|j+ywro)rstatr)rrrs rHrz%revlog.storageinfo..o s*#;G4   &..* J$-"+"" '$ " &&2*'>'RN*F>:@M +0C4^*@?6 :04 1 ( I   D>@ K15fB FD),BH%@1 F2 #*X)%V$L<:> ( (l \? ? ? B(  "L n> 0+xM^ )?@L  $||3I  0d&P&"'--' R!$O"BM %"a2FY/v ?g-V >R"rK)qrrOrrrhrdrNrrrVrrrrrr i18nr r1r revlogutils.constantsr r rrrrrrrrrrrrrrrrrrr r!r"r#revlogutils.flagutilr$r%r&r'r(r)r* thirdpartyr+r,r-r.r/r0r2r3r4 interfacesr5 interfaceutilr6rr7r"r8r9rr:r;r<r=rutilsr>r? importmodr@ importrustrr$rrYrrrIrMrOrrWr.HAS_FAST_PERSISTENT_NODEMAP implementerirevisiondeltarlr[iverifyproblemrlrvrzr|rrrrrYrArDrKrHrsT  4         &  9 % v  , F  g & V  x ( //  )48H8H8H 9 :445d % %6 %:445t!!6!    4G89 "/ ; & R3"R3"rK