^cUddlZddlZddlmZddlmZmZmZddlmZ Gdde Z d Z d Z d Zd ZGd dZdZdZd-dZdZejdZejdZGddZdZdZdZdZejdZdZdZdZ dZ!Gdd e Z"d!Z#d"Z$d#Z%d.d$Z&d%Z'd&Z(d'Z)d(Z*d)Z+d*Z,d+Z-d,Z.dS)/N)hex)error requirementsutil)docketceZdZdZdS)NodeMapc0tjd|z)Nsunknown node: %s)r RevlogError)selfxs ?/usr/lib/python3/dist-packages/mercurial/revlogutils/nodemap.py __missing__zNodeMap.__missing__s 3a 7888N)__name__ __module__ __qualname__rrrr r s#99999rr cdS)zrhook point for test This let tests to have things happens between the docket reading and the data readingNrrrrtest_race_hook_1rs  Drctj|jvrdStj|jvrdS|}t d||jt d||jjjdS)zoThe stream clone might needs to remove some file if persisten nodemap was dropped while stream cloning N) rREVLOGV1_REQUIREMENTNODEMAP_REQUIREMENT unfiltereddelete_nodemap changelog manifestlog _rootstore_revlog)repounfis rpost_stream_cleanupr$$st(0AAA'4+<<< ??  D4t~...4t/:BCCCCCrc|jdS|j|j}|sdSd}t|||tjz\}|t krdS|tjz }t|||tjz}|\}}}}} |tjz }t||||z} ||z }|| _ |||| z| _ || _ || _ t|| } |jjd} t! || 5} | r; t#jt#j| |}n'#t($rd}YnwxYw| |}dddn #1swxYwYn#t,$rYdSwxYwt/||krdS| |fS)z'read the nodemap for a revlog from diskNrpersistent-nodemap.mmapr) _nodemap_fileopenertryread S_VERSIONunpacksizeONDISK_VERSIONS_HEADER NodeMapDockettip_revtip_node data_length data_unused_rawdata_filepathoptionsgetrrbuffermmapread ValueErrorreadFileNotFoundErrorlen)revlogpdataoffsetversionheadersuid_sizer0r2r3 tip_node_sizer filenameuse_mmapfddatas rpersisted_datarH1sP #t M ! !&"6 7 7E t F!!%).1H(H"IJJJW.  t inFooeFVhm-C$CDEEGAH>Hg{K hmF 5&8*;!;< = =F hFFNFVm%;;>GF>G GGcjrdSjdSdjz}||rdS||fd||fddS)zInstall whatever is needed transaction side to persist a nodemap on disk (only actually persist the nodemap if this is relevant for this revlog) Nsnm-revlog-persistent-nodemap-%sc(t|dS)NT)pendingpersist_nodemaptrr=s rz*setup_persistent_nodemap..ksFD I I Irc$t|SNrLrNs rrPz*setup_persistent_nodemap..ms?2v+F+Fr)_inliner' hasfinalize addpending addfinalize)rOr= callback_ids ` rsetup_persistent_nodemaprX\s ~ #5v7KKK ~~k""MMIIIINN; F F F FGGGGGrc<eZdZdZdZdZdZdZdZdZ dZ d S) _NoTransactionzCtransaction like object to update the nodemap outside a transactionci|_dSrR _postclosers r__init__z_NoTransaction.__init__ss rc||j|<dSrRr\)rrW callback_funcs r addpostclosez_NoTransaction.addpostclosevs'4 $$$rcdSrRrrargskwargss r registertmpz_NoTransaction.registertmpy rcdSrRrrds r addbackupz_NoTransaction.addbackup|rhrcdSrRrrds raddz_NoTransaction.addrhrcdSrRrrds raddabortz_NoTransaction.addabortrhrcdSrRr)rres r_reportz_NoTransaction._reportrhrN) rrr__doc__r_rbrgrjrlrnrprrrrZrZpsMM555                 rrZc|jrdS|jdSt}t||t |jD]}|j|ddS)zupdate the persistent nodemap right now To be used for updating the nodemap on disk outside of a normal transaction setup (eg, `debugupdatecache`). N)rSr'rZrMsortedr])r=notrks rupdate_persistent_nodemaprvsy ~ #   DD&!!! DO $ $!!4    !!rc|j}tjd|z}|j|j}|j|D]1}||r|j |2dS)z.Delete nodemap data on disk for a given revlogs"(^|/)%s(-[0-9a-f]+\.nd|\.n(\.a)?)$N) radixrecompiler(dirname _indexfilelistdirmatchsvfs tryunlink)rOr"r=prefixpatterndirpathfs rrrs \Fj?&HIIGm##F$566G ] " "7 + +## ==   # I   " " "##rFc P t|ddrtjd|j-|rt ||_nd}tj|t j|jd}|j}t j|jd}|j j d}d} |rq|n|j } |j \} } } | jt| z} | j| z}| | krd} n | |d zkrd} nt#|| || j| d 5}|| j|| |rh|r+|d || }n;|t jt j|| }dddn #1swxYwY| | _|| _| 9t3} t#|| t j|jd r|j} nt7|j} |j jfd }dz}|||| d5}|| |rM|r| }nH|t jt j|t| }dddn #1swxYwYt| | _|| _| | j| _!|j}|r|dz }|"|n|#|| |dd5}|| $dddn #1swxYwY| |_|r|j%| |tM|| r>t|d|j fd}d|jz}|'||dSdS)z-Write nodemap data on disk for a given revlog filteredrevsrz.cannot persist nodemap of a filtered changelogNz?calling persist nodemap on a revlog without the feature enablednodemap_data_incrementalupdate_nodemap_datar& sr+rnodemap_data_allcdSrRr)rOdatafilers rabortckz persist_nodemap..abortcks Ih     rs delete-%ssw+s.awT) atomictemp _realopenerc<D]}|dSrR)r)rOoldfileoldsrealvfss rcleanupz persist_nodemap..cleanup s3 + +!!'**** + +rsrevlog-cleanup-nodemap-%s)(getattrrProgrammingErrorr'get_nodemap_filer safehasattrindex_nodemap_docketr(r5r6copyrr2r<r3r4rlseekwriter:flushr7r8r/rpersistent_datarrntiprevr0noder1rgrj serializer_other_rawdata_filepathrb)rOr=rKforcemsgcan_incremental ondisk_docket feed_datarErG target_docket src_docketdata_changed_count new_length new_unusedrFnew_datarrW file_pathfprrrrrs @@@@rrMrMsv~r** $ <   #  .#3F#;#;F SC(-- -&v|5OPPO*M /DEEI}$(()CDDH D3=4.3355 L 1 1 3 3    ".T: ".1CC  & &DD JO , ,DD(??H FF8]6 7 7 7x// N2 1222NN #%77:#6#6 #';t}R/L/L#M#M N N N N N N N N N N N N N N N)3M %(2M % |% $V];;  FL*< = = 1<0022DD"6<00DM+       #X-  K))) ]]8U + + Ir HHTNNN II#HHHHJJJ#{4=SYY+G+GHHH I I I I I I I I I I I I I I I%(II !"MMOOM#[[)>??M$I U  y!!!! Y y$4 8 8,B ((**+++,,,,,,,,,,,,,,,*FB ((AAA #6= 9 9D .&-?? + + + + + +3V5II   W-----..s8/BHHHA%M  MM3(P''P+.P+z>Bz>BQQQQc2eZdZdZddZdZdZdZdZdS) r/z}metadata associated with persistent nodemap data The persistent data may come from disk or be on their way to disk. Ncv|tj}||_d|_d|_d|_d|_dS)Nr) docket_modmake_uiduidr0r1r2r3)rrs rr_zNodeMapDocket.__init__5sJ ;%''C   rct|j}|j|_|j|_|j|_|j|_|S)N)r)r/rr0r1r2r3)rnews rrzNodeMapDocket.copyQs?)))l } ** rc|j|jkrdS|j|jkrdS|j|jkrdS|j|jkrdSdS)Nrrrr2rothers r__cmp__zNodeMapDocket.__cmp__Ys[ 8ei  2 8ei  1   1 1 12   1 1 11qrcB|j|jko|j|jkSrRrrs r__eq__zNodeMapDocket.__eq__ds!x59$N)9U=N)NNrcg}|ttt |j|j|j|jt |j f}|tj|||j||j d |S)z9return serialized bytes for a docket using the passed uidr) appendr*packr-r<rr0r2r3r1r.join)rrGrAs rrzNodeMapDocket.serializegs INN>22333 MM L          HM7+,,, DH DM"""xx~~rrR) rrrrqr_rrrrrrrr/r//sq 8   OOOrr/c(|j}d||jfzS)z9The (vfs relative) nodemap's rawdata file for a given uids%s-%s.nd)rxr)r=r rs rr4r4xs \F &&*- --rch|j}tjd|z}t||}|j|}|j|}g}|j|D]2}||r||kr| |3|S)Ns(^|/)%s-[0-9a-f]+\.nd$) rxryrzr4r(basenamer{r}r~r) r=r rr new_file_path new_file_namerothersrs rrr~s \Fj3f<==G%ff55MM**=99Mm##M22G F ] " "7 + + ==   ] 2 2 MM!    Mrc>t|}t|S)zAreturn the persistent binary form for a nodemap for a given index) _build_trie _persist_trie)rtries rrrs u  D   rcjt|||\}}|tjzt||fS)zGreturn the incremental update for persistent nodemap from a given index) existing_idx) _update_trieS_BLOCKr,r)rrootmax_idxlast_rev changed_blockrs rupdate_persistent_datars<&udH==M4 $d111 rz>llllllllllllllllrc|tz S)zReturn the number used to represent the rev in the tree. (or retrieve a rev number from such representation) Note that this is an involution, a function equal to its inverse (i.e. which gives the identity when applied to itself). ) REV_OFFSET)revs r_transform_revrs:  rc"t|dS)z/turn an hexadecimal digit into a proper integer)int) hex_digits r_to_intrs y"  rc(eZdZdZfdZdZxZS)BlockzOrepresent a block of the Trie contains up to 16 entry indexed from 0 to 15cdtt|d|_dSrR)superrr_ ondisk_id)r __class__s rr_zBlock.__init__s* eT##%%%rcTtfdtdDS)Nc3BK|]}|VdSrR)r6).0irs r z!Block.__iter__..s-33ADHHQKK333333rr)iterranger^s`r__iter__zBlock.__iter__s,3333r333333r)rrrrqr_r __classcell__)rs@rrrsQ44 4444444rrct}tt|D]0}t||d}t |d|||1|S)zbuild a nodemap trie The nodemap stores revision number for each unique prefix. Each block is a dictionary with keys in `[0, 15]`. Values are either another block or a revision number. r)rrr<r_insert_into_block)rrr current_hexs rrrs] 77DSZZ  ==%*Q-(( 5!T3 <<<< Krc d}t|dzt|D]3}t||d}|t|d|||z }4||fS)consumerrr)rr<rr)rrrchangedrrs rrrshGX\3u::..HH%*Q-(( %eQc;GGG D=rcd}|jd|_t|||dz}||}||||<nt|tr|t ||dz|||z }n\t ||d}|} t} | ||<t ||dz| | |t ||dz| |||S)a7insert a new revision in a block index: the index we are adding revision for level: the depth of the current block in the trie block: the block currently being considered current_rev: the revision number we are adding current_hex: the hexadecimal representation of the of that revision rNr)rrr6 isinstancedictrrr) rlevelblock current_revrrrentry other_hex other_revrs rrrsG " EEAI$5677I IIi E }&i E4 L% 519e[+    e Q((  ggi5%!)S)YGGG5%!)S+{KKK Nrc4i}||dz}nd}g}t|D]f}|j|j|t|<!t||z|t|<|t ||gd|S)zaturn a nodemap trie into persistent binary data See `_build_trie` for nodemap trie structureNrrr) _walk_trieridr<r_persist_blockr)rr block_mapbase_idxchunkstns rrrsI!# F99 < # " Ibff   #F h 6Ibff  MM.Y77 8 8 8 8 88F  rc#Kt|D]0\}}t|trt |D]}|V1|VdS)zcyield all the block in a trie Children blocks are always yield before their parent block. N)rsitemsrrr)r__item sub_blocks rrr%sm U[[]]++  T dD ! ! '--   KKKKKrcVtfd|D}tj|S)zproduce persistent binary data for a single block Children block are assumed to be already persisted and present in block_map. c38K|]}t|VdSrR) _to_value)rvrs rrz!_persist_block..7s-==Q1i((======r)tuplerr) block_noderrGs ` rrr1s4 ====*=== = =D < rc|tSt|tr|t|St |S)zpersist any value as an integer)NO_ENTRYrrrr)r rs rrr;s= | D$  $D""d###rct|tjzdkr2d}tj|tjt|fz|st dfSi}g}t dt|tjD]v}t }t||_|||j<|||tjz}t|}| ||fw|D]J\}}t|D]5\} } | tkr| dkr || || <#t| || <6K||tjzfS)z,parse parse nodemap data into a nodemap Triers:nodemap data size is not a multiple of block size (%d): %dN) r<rr,rAbortrrrr+r enumeraterr) rGrr new_blocksrr block_datavaluesbidxrs r parse_datarEsf D GL Q&&Kk#s4yy 99::: ww}IJ 1c$ii . .++i..%* %/"!a',../  ++5&/****++ 6'' + +FCH}}a"1#'**#  + !w|# ##rcd}|dt|zt|\}}tt |}|dt|zt t|D]}||vrd|z}||d}n||t|t||d} | d|z}||d}| |krd || fz}||d}|r.t|D]}d |z}||d}|S) zBverify that the provided nodemap data are valid for the given idexrsrevision in index: %d srevision in nodemap: %d s$ revision missing from nodemap: %d rrNs/ revision node does not match any entries: %d s? revision node does not match the expected revision: %d != %d s! extra revision in nodemap: %d ) statusr<rset_all_revisionsr write_errremove _find_noderrs) uirrGretrr all_revsrrnm_revs r check_datar*cs CII+s5zz9:::$HD">$''((HII+s8}}<=== 3u::   H  :Q>C LL   CC OOA   D#eAhqk"2"233 >EIC LL   CC q[[!"F ,  LL   C!!  A7!;C LL     Jrc#pKt|D]#}|D]}|t|tr|V$dS)z%return all revisions stored in a TrieN)rrr)rrrs rr!r!s\D!!  AyJq%00yGGGG rc|t|dd}t|trt ||ddS|S)z.find the revision associated with a given noderrN)r6rrrr$)rrrs rr$r$sR IIgd1Q3i(( ) )E%+%abb*** Lrcp|jr&|jdz}|j|r|S|jdzS)Ns.n.as.n) _trypendingrxr(exists)r= pending_paths rrrsD  |g- =   - -   <% r)FFrR)/rystructrrrrrr rrr rr$rHrXrZrvrrMr-Structr*r.r/r4rrrrrrrrrrrrrrrrrr*r!r$rrrrr4s  #"""""99999d999     D D D(((VHHH(        2!!!"###m.m.m.m.L FM$   6= " "FFFFFFFFR...   L  &-( ) )    4 4 4 4 4D 4 4 4   D&   $$$$$$<   F     r