^cpdZddlZddlZddlmZddlmZddlmZddl m Z m Z m Z m Z mZmZmZmZdd lmZdd lmZmZmZdd lmZdZGd d Zd#dZd#dZd$dZd#dZdZdZ ej!ddGddZ"dZ#dZ$dZ%dZ&dZ'dZ(d#dZ)Gd d!Z*d"Z+dS)%z4Helper class to compute deltas stored inside revlogsNnullrev)_)getattr)COMP_MODE_DEFAULTCOMP_MODE_INLINECOMP_MODE_PLAINKIND_CHANGELOG KIND_FILELOGKIND_MANIFESTLOGREVIDX_ISCENSOREDREVIDX_RAWTEXT_CHANGING_FLAGS)attr)errormdiffutil)flagutilc8eZdZdZd dZdZdZdZd Zd Z d S) _testrevlogz)minimalist fake revlog to use in doctests?rcf||_||_||_t||_d|_dS)z.data is an list of revision payload boundariesN)_data_srdensitythreshold _srmingapsizeset _snapshotindex)selfdatadensitymingapsnapshots >/usr/lib/python3/dist-packages/mercurial/revlogutils/deltas.py__init__z_testrevlog.__init__/s1 #* #X cL|tkrdS|dkrdS|j|dz S)Nrrrrr!revs r&startz_testrevlog.start7s/ '>>1 !881z#'""r(c6|tkrdS|j|SNrr*r+s r&endz_testrevlog.end>s '>>1z#r(cX||||z SNr0r-r+s r&lengthz_testrevlog.lengthCs!xx}}tzz#..r(c*t|jSr2)lenr)r!s r&__len__z_testrevlog.__len__Fs4:r(c.|tkrdS||jvS)NT)rrr+s r& issnapshotz_testrevlog.issnapshotIs '>>4dn$$r(N)rrr) __name__ __module__ __qualname____doc__r'r-r0r4r7r9rr(r&rr,sy33### ///%%%%%r(rc#K|t|j}tjdd}|fd}||jjD]}t ||D]}|VdS)aslice revs to reduce the amount of unrelated data to be read from disk. ``revs`` is sliced into groups that should be read in one time. Assume that revs are sorted. The initial chunk is sliced until the overall density (payload/chunks-span ratio) is above `revlog._srdensitythreshold`. No gap smaller than `revlog._srmingapsize` is skipped. If `targetsize` is set, no chunk larger than `targetsize` will be yield. For consistency with other slicing choice, this limit won't go lower than `revlog._srmingapsize`. If individual revisions chunk are larger than this limit, they will still be raised individually. >>> data = [ ... 5, #00 (5) ... 10, #01 (5) ... 12, #02 (2) ... 12, #03 (empty) ... 27, #04 (15) ... 31, #05 (4) ... 31, #06 (empty) ... 42, #07 (11) ... 47, #08 (5) ... 47, #09 (empty) ... 48, #10 (1) ... 51, #11 (3) ... 74, #12 (23) ... 85, #13 (11) ... 86, #14 (1) ... 91, #15 (5) ... ] >>> revlog = _testrevlog(data, snapshot=range(16)) >>> list(slicechunk(revlog, list(range(16)))) [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]] >>> list(slicechunk(revlog, [0, 15])) [[0], [15]] >>> list(slicechunk(revlog, [0, 11, 15])) [[0], [11], [15]] >>> list(slicechunk(revlog, [0, 11, 13, 15])) [[0], [11, 13, 15]] >>> list(slicechunk(revlog, [1, 2, 3, 5, 8, 10, 11, 14])) [[1, 2], [5, 8, 10, 11], [14]] Slicing with a maximum chunk size >>> list(slicechunk(revlog, [0, 11, 13, 15], targetsize=15)) [[0], [11], [13], [15]] >>> list(slicechunk(revlog, [0, 11, 13, 15], targetsize=20)) [[0], [11], [13, 15]] Slicing involving nullrev >>> list(slicechunk(revlog, [-1, 0, 11, 13, 15], targetsize=20)) [[-1, 0], [11], [13, 15]] >>> list(slicechunk(revlog, [-1, 13, 15], targetsize=5)) [[-1], [13], [15]] Nslicechunktodensityc(t|||Sr2)_slicechunktodensity)xyzrevlogs r&zslicechunk..s)=faA)N)Nr()maxrrr r_slicechunktosize)rErevs targetsizedensityslicingchunksubchunks` r& slicechunkrNOsxV%9:: V\+@$GGNNNNN f(&*>*&%DD  HNNNN r(c#K|d|ksJ||d}||d}||z }|||kr|VdSd}d}t|}t||D]x\} } || |z } || } | |kr| r| dz}n4t ||||} | r| V| }|| }| dz}| snyt |}||z |kr|}||z dkrn|||dz }||z } | |kr>||z dkrn4|||z dzz}|||dz }||z } | |k>t ||||} | r| V|}|||}||z |kt |||} | r| VdSdS)aJ slice revs to match the target size This is intended to be used on chunk that density slicing selected by that are still too large compared to the read garantee of revlog. This might happens when "minimal gap size" interrupted the slicing or when chain are built in a way that create large blocks next to each other. >>> data = [ ... 3, #0 (3) ... 5, #1 (2) ... 6, #2 (1) ... 8, #3 (2) ... 8, #4 (empty) ... 11, #5 (3) ... 12, #6 (1) ... 13, #7 (1) ... 14, #8 (1) ... ] == All snapshots cases == >>> revlog = _testrevlog(data, snapshot=range(9)) Cases where chunk is already small enough >>> list(_slicechunktosize(revlog, [0], 3)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], 3)) [[6, 7]] >>> list(_slicechunktosize(revlog, [0], None)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], None)) [[6, 7]] cases where we need actual slicing >>> list(_slicechunktosize(revlog, [0, 1], 3)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 3)) [[1], [3]] >>> list(_slicechunktosize(revlog, [1, 2, 3], 3)) [[1, 2], [3]] >>> list(_slicechunktosize(revlog, [3, 5], 3)) [[3], [5]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 3)) [[3], [5]] >>> list(_slicechunktosize(revlog, [5, 6, 7, 8], 3)) [[5], [6, 7, 8]] >>> list(_slicechunktosize(revlog, [0, 1, 2, 3, 4, 5, 6, 7, 8], 3)) [[0], [1, 2], [3], [5], [6, 7, 8]] Case with too large individual chunk (must return valid chunk) >>> list(_slicechunktosize(revlog, [0, 1], 2)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 1)) [[1], [3]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 2)) [[3], [5]] == No Snapshot cases == >>> revlog = _testrevlog(data) Cases where chunk is already small enough >>> list(_slicechunktosize(revlog, [0], 3)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], 3)) [[6, 7]] >>> list(_slicechunktosize(revlog, [0], None)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], None)) [[6, 7]] cases where we need actual slicing >>> list(_slicechunktosize(revlog, [0, 1], 3)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 3)) [[1], [3]] >>> list(_slicechunktosize(revlog, [1, 2, 3], 3)) [[1], [2, 3]] >>> list(_slicechunktosize(revlog, [3, 5], 3)) [[3], [5]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 3)) [[3], [4, 5]] >>> list(_slicechunktosize(revlog, [5, 6, 7, 8], 3)) [[5], [6, 7, 8]] >>> list(_slicechunktosize(revlog, [0, 1, 2, 3, 4, 5, 6, 7, 8], 3)) [[0], [1, 2], [3], [5], [6, 7, 8]] Case with too large individual chunk (must return valid chunk) >>> list(_slicechunktosize(revlog, [0, 1], 2)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 1)) [[1], [3]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 2)) [[3], [5]] == mixed case == >>> revlog = _testrevlog(data, snapshot=[0, 1, 2]) >>> list(_slicechunktosize(revlog, list(range(9)), 5)) [[0, 1], [2], [3, 4, 5], [6, 7, 8]] Nrrr)r-r0 enumeratenextr9 _trimchunkr6)rErIrJ startdataenddatafullspan startrevidx endrevidxiterrevsidxrspanr%rLnbitem localenddatas r&rHrHsvF  j T!W%%Ijjb""G"HX33 KIHNNN  Qzz!}}y($$Q'' :  ( aIIvt[)DDE  K QIaI  E YYF Y * , , K 1 $ $ zz$y1}"566 i'Z;&!++ )k1a7 7I!::d9q=&9::L)+D Z 64i@@  KKK LLk!233 ! Y * , ,$ vt[ 1 1E  r(rc#PK|j}|jt|dkr|VdSt||}||kr|VdS|}t fd|D}|r|t |z }nd}||kr|VdSg} d} t |D]K\} } || } | }|dkr"| "| | z }||kr| || f| |z} L| g}| rZ||krT| \}}||||z}|dkr|t |z }nd}| r||kT|d}|D]}t||||}|r|V|}t|||}|r|VdSdS)aslice revs to reduce the amount of unrelated data to be read from disk. ``revs`` is sliced into groups that should be read in one time. Assume that revs are sorted. The initial chunk is sliced until the overall density (payload/chunks-span ratio) is above `targetdensity`. No gap smaller than `mingapsize` is skipped. >>> revlog = _testrevlog([ ... 5, #00 (5) ... 10, #01 (5) ... 12, #02 (2) ... 12, #03 (empty) ... 27, #04 (15) ... 31, #05 (4) ... 31, #06 (empty) ... 42, #07 (11) ... 47, #08 (5) ... 47, #09 (empty) ... 48, #10 (1) ... 51, #11 (3) ... 74, #12 (23) ... 85, #13 (11) ... 86, #14 (1) ... 91, #15 (5) ... ]) >>> list(_slicechunktodensity(revlog, list(range(16)))) [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]] >>> list(_slicechunktodensity(revlog, [0, 15])) [[0], [15]] >>> list(_slicechunktodensity(revlog, [0, 11, 15])) [[0], [11], [15]] >>> list(_slicechunktodensity(revlog, [0, 11, 13, 15])) [[0], [11, 13, 15]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14])) [[1, 2], [5, 8, 10, 11], [14]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14], ... mingapsize=20)) [[1, 2, 3, 5, 8, 10, 11], [14]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14], ... targetdensity=0.95)) [[1, 2], [5], [8, 10, 11], [14]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14], ... targetdensity=0.95, mingapsize=12)) [[1, 2], [5, 8, 10, 11], [14]] rNc3.K|]}|VdSr2r).0r[r4s r& z'_slicechunktodensity..ss+//Qvvayy//////r(g?r) r-r4r6 segmentspansumfloatrQappendsortpoprS)rErI targetdensity mingapsizer-deltachainspanreaddata chainpayloadr#gapsprevendir,revstartrevlengapsizeselectedgapidxprevidxrZrLr4s @r&rArA4sQb LE ]F 4yyA~~  ..N "" H////$/////L~!6!66-  DGD//$$35:: Q;;   (G## WaL)))V#IIKKKH  7]**((** G a<<"U8__4GGG  7]** MMOOOG64#66  KKK vtW - -E  r(c|j}|t|}||dz t|krM|dkrG||krA|||dz dkr)|dz}|dkr||kr|||dz dk)|||S)areturns revs[startidx:endidx] without empty trailing revs Doctest Setup >>> revlog = _testrevlog([ ... 5, #0 ... 10, #1 ... 12, #2 ... 12, #3 (empty) ... 17, #4 ... 21, #5 ... 21, #6 (empty) ... ]) Contiguous cases: >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 0) [0, 1, 2, 3, 4, 5] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 0, 5) [0, 1, 2, 3, 4] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 0, 4) [0, 1, 2] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 2, 4) [2] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 3) [3, 4, 5] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 3, 5) [3, 4] Discontiguous cases: >>> _trimchunk(revlog, [1, 3, 5, 6], 0) [1, 3, 5] >>> _trimchunk(revlog, [1, 3, 5, 6], 0, 2) [1] >>> _trimchunk(revlog, [1, 3, 5, 6], 1, 3) [3, 5] >>> _trimchunk(revlog, [1, 3, 5, 6], 1) [3, 5] Nrr)r4r6)rErIstartidxendidxr4s r&rSrSsL]F ~T FQJ#f++%% QJJ6H,,VaZ8H1I1IQ1N1N aKF QJJ6H,,VaZ8H1I1IQ1N1N   r(c||sdS||d}|||dz S)aGet the byte span of a segment of revisions revs is a sorted array of revision numbers >>> revlog = _testrevlog([ ... 5, #0 ... 10, #1 ... 12, #2 ... 12, #3 (empty) ... 17, #4 ... ]) >>> segmentspan(revlog, [0, 1, 2, 3, 4]) 17 >>> segmentspan(revlog, [0, 4]) 17 >>> segmentspan(revlog, [3, 4]) 5 >>> segmentspan(revlog, [1, 2, 3,]) 7 >>> segmentspan(revlog, [1, 3]) 7 rrPr3)rErIr0s r&rcrcsA0 q **T"X  C d1g&& &&r(c&tjd}|d|tj||t ||z kr ||d} n,|||} tj| |} tj || |} | r| | ||||tzr$tj td|zn #tj$r|tzsYnwxYw| S)zlllN_df)p1p2snode %s is not censored)structcalcsizerreplacediffheaderrawsizer6revisionpatchrprocessflagsraw checkhashrr StorageErrorrCensoredNodeError) fhrEbaserevdeltar~rflags expectednodehlenfulltextbasetext validatehashs r&_textfromdeltarsF ?7 # #D UdU|u.wUd!2<??7?33;x// /%HH  C   X|r  B B B $ $ $,-- <    "((     OsAC11D DT)slotsfrozenceZdZejZejZejZejZejZ ejZ ejZ ejZ dS) _deltainfoN) r:r;r<ribdistancedeltalenr"base chainbasechainlencompresseddeltalen snapshotdepthrr(r&rr%swtwyyHtwyyH 4799D 4799D ItwyyH DGIIMMMr(rc |jddksJ|jdt|j|jdz d|jdf|j|j|j|j|jS)zturn into a "u" (no-compression) into no-compression without header This is useful for revlog format that has better compression method. rurr() r"rrrrrrrr)rs r&drop_u_compressionr1ss :a=D %*Q-    ejm         r(c|dS|j}|dz}|j}|s|j}t||}|js ||jkrdS||jkrdS|t z|jkrdS|jr|j|j krdS|j ||j z |jkrdS|j r%| |j |jkrdSdS)zReturns True if the given delta is good. Good means that it is within the disk span, disk size, and chain length bounds that we know to be performant.NFT) textlen_maxdeltachainspanrrG _sparserevlogrLIMIT_DELTA2TEXTr _maxchainlenrrr4r)rE deltainforevinfor defaultmaxmaxdists r&isgooddeltainforCsuoG1J'G %$':&&G  Gi.@$@$@u ###u !!I$@@@u v2Y5GGGu +  / /93E E Eu  MM). ) )I,> > >u 4r(ic#Kt|r|jsdVdS|j}|j}|j}d}|t z} t h} t||||} | |} | ng} | D]}|j r[|t ksP|| vsL||sA| |||}|j r|t ks|| vs ||A|t krq|| vrv| || ||kr|r"| ||tzkr| |tzr||\}}|jr ||jkr| |kr|r|j|j}||t f}||vr||rl||}| |}t)||z d}||z}||z }||kr||}||kr| || rt-| V}dVdS)zProvides group of revision to be tested as delta base This top level function focus on emitting groups with unique and worthwhile content. See _raw_candidate_groups for details about the group order. NTr)r6_storedeltachainsr4 deltaparentrrr_refinedgroupssend _generaldeltaaddrLIMIT_BASE2TEXTrr _chaininforupperboundcompr9rrGrftuple)rErr~r cachedelta deltalengthrsparsegood deltas_limittested candidates temptativegroupr,r chainsizemaxcomp basenotsnaprrevsizerawsizedistancelowestrealisticdeltalen snapshotlimit revlengths r&_candidategroupsrs KKF4 -K$K  !F D--LYFB ;;JE&__T**   ; ; C& 'w#--;;s3C3C- 3!k#&& & 'w#--;;s3C3C- g~~f}} JJsOOOfmmC0000 &..--O1KLL||C  #@@  #)"3"3C"8"8 Hi" x63F'F'Fi'' !&/; /!2w/ k))f.?.?.D.D)$*$8$8$=$=M%nnS11G&)'G*;Q&?&?O.=.H+%,}$>> !' c 2 2I #::: LL      &u%%DKE&L JJJJJr(ctj|jdr|j||dS|j}|j}||D]1}||r$||||2dS)z#find snapshot from start_rev to tips findsnapshotsN)r safehasattrr findsnapshotsrr9rIrf)rEcache start_revrr9r,s r&_findsnapshotsrs  &6774 ""5)44444( & ;;y)) 4 4Cz# 4kk#&&'..s333 4 4r(c#6Kd}|r!|jr|jr|dfV}|dVdStjt}t |||||D] }|V}|n |jsdVdS||||fvr||rd}||kr.|}||}|tkrn |fV}||k.|st|||dzd}||kr8|}ttd||D} | V}||k8dVdS)Nrrc3K|]}|VdSr2r)racs r&rbz!_refinedgroups..%s"#?#?!A#?#?#?#?#?#?r() r_lazydeltabase collections defaultdictlist _rawgroupsrr9rrrrsorted) rEr~rrr snapshotsrpreviousrchildrens r&rrs Df*v/D!m%%%  JJJ F'--I RYGG    E     DR00V5F5Ft5L5L0$H%%d++Dw==D $ 8 69dQh 7 7 7hHV#?#?y#?#?#???@@H!>>Dh JJJJJr(c#Kj}|oj}t}|dz }fd|rjd||fD} js>t| dkr+| | dfV| dfVnt| dkr| V|rY| rV|t jt}t jt} fd| D} | D]I} t| D]7\} } |sn| |  |8Jt| ddz}t||t}| D]} || d}||D] }||vr|}n |t!| }|} t| D]F\} }||kr || krn3 |sn| |  |Gdt%| d D]\} }t}|D]}|||fd |D}t)t%|Vt)t%|Vt|t)|t*V|s|fVdSdS) zProvides group of revision to be tested as delta base This lower level function focus on emitting delta theorically interresting without looking it any practical details. The group order aims at providing fast or small candidates first. rc:|dSr/) _deltachain)r,rEs r&rFz_rawgroups..9sV//44Q7r(c(g|]}|tk |Srr)raps r& z_rawgroups..=s777!w,,1,,,r(rrNc&g|] }|Srr)rar deltachains r&rz_rawgroups..Ts!;;;aJJqMM;;;r(T)reversec g|] }|k| Srr)rar[floors r&rz_rawgroups..s===!5199A999r()rrr6_deltabothparentsrgrrrrrQr9rminrupdaterIrGkeysritemsrr)rEr~rrrgdeltarcurrprevparents parents_snapscandidate_chainschainrZs snapfloorall_revsotherr[ max_depthsnapssiblingsrrs` @@r&rr,s !F  ,,F v;;D !8D7777J 77r2h777' CLLA,=,= LLNNN1:-   1:-     \\A  MMM S('S(  #/55I $/44 ;;;;7;;;% * *E#E** * *Q((++Ec"&&q)))) a())A- vy)44455% # #E OOE " " " "T9--  A  !  M..0011IJu%%E#E** * *Qy==s??E((++Ec"&&q)))) !4!4!6!6EEE  JCuuH . . ! ---- >===x===x(()) ) ) )u && & & &JJEEIg&''''' g r(c6eZdZd dZdZdZdZdZd dZdS) deltacomputerNFc0||_||_||_dSr2)rE _write_debug _debug_search)r!rE write_debug debug_searchs r&r'zdeltacomputer.__init__s ')r(c |j}|d|dS|j}|j}|d}|d}t|||||j|j|j|jx}|d<|S)zBuilds a fulltext version of a revision revinfo: revisioninfo instance that contains all needed info fh: file handle to either the .i or the .d revlog file, depending on whether it is inlined or not rNr)btextrErrr~rrnode) r!rrrrErrrrs r& buildtextzdeltacomputer.buildtexts  8 8O' Q-1 ,     J J M L   58r(c8|j}|||}||r;tj||t |}||z}n,|||}tj||}|S)Nr|) rEr iscensoredrrrr6rawdatatextdiff) r!rrrrEtheaderrptexts r&_builddeltadiffzdeltacomputer._builddeltadiffs NN7B ' '   T " " -,V^^D-A-A3q66JJFQJEENN4RN00EN5!,,E r(c B|j}|jduo|j}||}|jr|}n|}d}|jr|t krd}n|jr||rw||j ||j } } || | fvr=||r(t| |d}d} |j r|j \} } | }|t krm||krg|j|dkrI|j|}|t kr$||kr|j|dkI|jjr||kr |j d} | ||||} |r)d}|t| z}|||j|rt| |jz}|j|z }|rd}||z}||||kr|rd}||dS|||kr|rd}||dS|| \}}t|t|z}|t|dz }||z||z }||\}}|dz }||z }t1||||f|||||S)Nrrs2DBG-DELTAS-SEARCH: uncompressed-delta-size=%d s/DBG-DELTAS-SEARCH: projected-lower-size=%d s2DBG-DELTAS-SEARCH: DISCARDED (snapshot limit) s-DBG-DELTAS-SEARCH: DISCARDED (prev size) )rErrrrrrr9r,r~rr6rrr4r _lazydeltarrrcompressr0r-rr)r!rrrrErr deltabaserr~rr cachebase cachediff currentbasemsgrrr r"roffsetdistrrs r&_builddeltainfozdeltacomputer._builddeltainfos(4K9K $$T**   "II!I   FI$8$8MM  ! Ff&7&7 &B&B FZZ ++VZZ -C-CBR((V->->y-I-I( #F$6$6y$A$A!$D E E    .#*#5 Iy#Kw&&4''K&&{33q88"k55kBB w&&4''K&&{33q88{% .+*=*=*1- =((w;;E  #HC 3u:: C   c " " "  , ,&)%jjF4I&I ##O}'>$$A h&   TN        r(c |||}|j|}t|dt|dzx}x}}|x} } d} d} t |||| | | || S)Nrr)rrErr6r) r!rrrrawtextr"rrrrrrrs r&_fullsnapshotinfozdeltacomputer._fullsnapshotinfos.."--{##G,,/247||c$q'll/JJJX $$ I            r(c  "|t|j}|js||||S|t }|jt zr||||S|jtj }|jduo|j }d}d}d} |j } |j } |j } |j} d}| | | | }}|jR|tkr| |d}nd}|tkr| |d}nd}|rd}||z}||t#|j|j||| }t%|}|>|dz }|rd"||j"| |vs| |vrd}nB"t)"fd|Drd }n""t)"fd |Drd }nd }d }||t||fz}||g}|?|r(d}||j|jfz}|||||D])}|rd}||z}||d}|| krd}nB|| krd}n9|j|rd}||j|z}|d}||z}||d}||j|z}||d}||j|z}||||vr|rd}||||kr|rd}||4|dz }|rtj }||||}|r2tj }d}|||z z}|||ut9|j||r:|r!d}||jz}|||||r!d}||jz}|||rd}||+|rt;|d}|||j}nt%|}|>|d} ||||}n |jrd} nd } |jtj }||z |||| ||d!}|j |j|d"<nd|d"<d#}|jjd} |jjd}!| t@krd$}n/| tBkr d%}|!r|d&|!zz }n| tDkr d'}|!r|d&|!zz }||d(<d)}||d(|d*|d+|d,|d-|d"|d.|d/|d0f z}|||S)1ayFind an acceptable delta against a candidate revision revinfo: information about the revision (instance of _revisioninfo) fh: file handle to either the .i or the .d revlog file, depending on whether it is inlined or not Returns the first acceptable candidate revision, as ordered by _candidategroups If no suitable deltabase is found, we return delta info for a full snapshot. `excluded_bases` is an optional set of revision that cannot be used as a delta base. Use this to recompute delta suitable in censor or strip context. NrsunknownrPs!DBG-DELTAS-SEARCH: SEARCH rev=%d rsparentsc3$K|] }|kV dSr2rrarrs r&rbz.deltacomputer.finddeltainfo..'-N-N1a$h-N-N-N-N-N-Nr(s refine-downc3$K|] }|kV dSr2rrs r&rbz.deltacomputer.finddeltainfo..r r(s refine-ups search-downs2DBG-DELTAS-SEARCH: ROUND #%d - %d candidates - %s s3DBG-DELTAS-SEARCH: CONTENDER: rev=%d - length=%d s'DBG-DELTAS-SEARCH: CANDIDATE: rev=%d sp1sp2s snapshot-%dsDBG-DELTAS-SEARCH: type=%s sDBG-DELTAS-SEARCH: size=%d sDBG-DELTAS-SEARCH: base=%d s DBG-DELTAS-SEARCH: EXCLUDED s DBG-DELTAS-SEARCH: TOO-HIGH s,DBG-DELTAS-SEARCH: delta-search-time=%f s/DBG-DELTAS-SEARCH: DELTA: length=%d (GOOD) s.DBG-DELTAS-SEARCH: DELTA: length=%d (BAD) s DBG-DELTAS-SEARCH: NO-DELTA c|jSr2)r)rBs r&rFz-deltacomputer.finddeltainfo..sqzr()keysfullssnapshotsdelta)durationrsearch_round_countdelta_try_counttype p1-chain-len p2-chain-lenzsnapshot-depthsUNKNOWNs CHANGELOG:s MANIFESTLOG:s%s:sFILELOG:z target-revlogsDBG-DELTAS: %-12s rev=%d: search-rounds=%d try-count=%d - delta-type=%-6s snap-depth=%d - p1-chain-length=%d p2-chain-length=%d - duration=%f rr%r&r'r(r)r$)#r6rErrrrrrrtimerrrr~rr,rrrrRrallrrfr9rr4rrrrrtargetr rr )#r!rrexcluded_bases target_revr-r dbg_try_countdbg_try_roundsdbg_typerr~rrErp1rp2r p1_chain_len p2_chain_lenrgroups candidaterevs round_typenominateddeltas candidaterevcandidate_type delta_startcandidatedelta delta_endr0dbg target_revlog target_type target_keyrs# @r& finddeltainfozdeltacomputer.finddeltainfo2s"  T[))J C))"gzBB B  ! UUN =8 8 C))"gzBB B   (JLLE(4K9K  ' Z Z ::b>>6::b>>S   (g~~%0055a8 ! g~~%0055a8 !  #7C : C   c " " "! K#sJ  V ' a N '($>D&&" *=*=!+JJ%#-N-N-N-N -N-N-N*N*N%!/JJ%#-N-N-N-N -N-N-N*N*N%!-JJ!/JLM(:(:JGG!!#&&& O$+OINI,>??C%%c*** &&y111 -; +; + +EC<'C%%c***%)N#r))).%++).// ==)7&$+*C*C(++&1A~-))#...=C4;--l;;;C%%c***=C4;22<@@@C%%c***>11#/B))#...:--#/B))#..." /"&*,,K!%!5!5g|R!P!P+ $ IJC9{22C%%c***!-&t{NGLL /'3"UC>#::C --c222'..~>>>>%/P~66))#...!+>C%%c*** K5I5IJJJ $ & IN ; ; $V }'@  H..r7JGGII  $ "HHH   (*,,C%K&&4#0 , ,C' +$)*$%&M+,Q/K+A.Jn,, -  000 / 9!Vj%88M ,, + 9!Vj%88M#0C    O$J()%&F $%N#N#J  C   c " " "r()NF)NN) r:r;r<r'rrrrrCrr(r&rrs**** 8   H H H T   &iiiiiir(rc|j\}}t}|s |st}nF|s&|dd}|dkrt}n,||krt}n|dkrd}t}t |}||fS)zreturn (COMPRESSION_MODE, deltainfo) used by revlog v2+ format to dispatch between PLAIN and DEFAULT compression. rrrr()r"r r r r)default_compression_headerrhdcompression_moder s r&delta_compressionrJs >DAq' 2Q 2*  2 acF ::.   , , ,0  d *&y11 Y &&r(r2)rr),r=rrrri18nrpycompatr constantsr r r r r rrr thirdpartyrrrrrrrrNrHrArSrcrrrrrrrrrrrrJrr(r&rPs;:                       % % % % % % % %FGGGGTXXXXv{{{{|3!3!3!3!l'''<>d4   ! $FFFXZZZz 4 4 4...bvvvvrvvvvvvvvr '''''r(