6h?VSSKJr SSKrSSKrSSKJr SSKJrJrJ r SSKJ r "SS \ 5r S rS rS rS r"SS5rSrSrS-SjrSr\R."S5r\R."S5r"SS5rSrSrSrSr\R."S5rSr Sr!Sr"Sr#"SS \ 5r$S!r%S"r&S#r'S.S$jr(S%r)S&r*S'r+S(r,S)r-S*r.S+r/S,r0g)/) annotationsN)hex)error requirementsutil)docketc\rSrSrSrSrg)NodeMapc4[R"SU-5e)Nsunknown node: %s)r RevlogError)selfxs ?/usr/lib/python3/dist-packages/mercurial/revlogutils/nodemap.py __missing__NodeMap.__missing__s 3a 788N)__name__ __module__ __qualname____firstlineno__r__static_attributes__rrrr r s9rr cg)zjhook point for test This let tests to have things happens between the docket reading and the data readingNrrrrtest_race_hook_1rs  rc [RUR;ag[RUR;agUR5n[ SXR 5 [ SXR RR5 g)zgThe 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)%sh((0A0AA''4+<+<< ?? D4~~.4//::BBCrcURcgURRUR5nU(dgSn[R XU[R -5unU[ :wagU[R - n[R XU[R -5nUupVpxn U[R - n[XX%-5n X%- nXjl XX)-U l Xzl Xl [X 5n URRRS5n [!5 URU 5n U (aLURR#U 5(a,[$R&"[$R("X55nOU R-U5nSSS5 [1W5U:agX4$![*a SnN)f=f!,(df  N3=f![.a gf=f)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_filepathoptionsgetr is_mmap_saferbuffermmapread ValueErrorreadFileNotFoundErrorlen)revlogpdataoffsetversionheadersuid_sizer5r7r8 tip_node_sizer filenameuse_mmapfddatas rpersisted_datarN2s # MM ! !&"6"6 7E  F!!%)..1H"IJJW.  innFooeVhmm-CDEGAH>H{ hmmF 5&*;< =F FNV%;[UTSS9$)NT)pendingpersist_nodemaptrrCs r*setup_persistent_nodemap..lsFD Irc>[UT5$NrRrTs rrVrWns ?2v+Fr)_inliner, hasfinalize addpending addfinalize)rUrC callback_ids ` rsetup_persistent_nodemapr_]se ~~ #5v7K7KKK ~~k""MMINN; FGrcB\rSrSrSrSrSrSrSrSr Sr S r S r g ) _NoTransactionqzCtransaction like object to update the nodemap outside a transactionc0UlgrY _postclosers r__init___NoTransaction.__init__ts rc X RU'grYrd)rr^ callback_funcs r addpostclose_NoTransaction.addpostclosews'4 $rcgrYrrargskwargss r registertmp_NoTransaction.registertmpz rcgrYrrns r addbackup_NoTransaction.addbackup}rsrcgrYrrns radd_NoTransaction.addrsrcgrYrrns raddabort_NoTransaction.addabortrsrcgrYr)rros r_report_NoTransaction._reportrsrrdN) rrrr__doc__rgrkrqrurxr{r~rrrrraraqs(M5     rracUR(agURcg[5n[X5 [ UR 5HnUR U"S5 M g)zupdate the persistent nodemap right now To be used for updating the nodemap on disk outside of a normal transaction setup (eg, `debugupdatecache`). N)rZr,rarSsortedre)rCnotrks rupdate_persistent_nodemaprsQ ~~ #  DD! DOO $ 4 %rcBURn[R"SU-5nURR UR 5nURR U5H6nURU5(dMURRU5 M8 g)z.Delete nodemap data on disk for a given revlogs"(^|/)%s(-[0-9a-f]+\.nd|\.n(\.a)?)$N) radixrecompiler-dirname _indexfilelistdirmatchsvfs tryunlink)rUr'rCprefixpatterndirpathfs rr"r"ss \\Fjj?&HIGmm##F$5$56G ]] " "7 + ==   II   ",rc  ^^^^[UR5S::ag[USS5(a[R"S5eUR c0U(a[ U5UlOSn[R"U5e[URS5nURn[URS5nURRRS 5nSn U(Ga}UGbyURR5n URR5un n n U R[U 5-n U RU -nX:waSn GOXS -::aSn GO[!X5mUR#TU R5 URTS 5nUR%U R5 UR'U 5 U(aU(a[URR)T5(a;UR+5 [,R."[,R0"X55nO"UR%S5 UR3U 5nSSS5 XlXlU GcE[55n [!X5m[URS 5(aURR75n O[9UR5n URR:mUU4S jnST-nUR=UU5 URTS5nUR'U 5 U(anU(aeURR)T5(aEUR+5 [,R."[,R0"U[U 555nOU nSSS5 [U 5U lUR?5W l URCU R@5U l"UR nU(aUS- nURGU5 OURIU5 URUSSS9nUR'U RK55 SSS5 XlU(aURRMU W5 [OX5mT(a@[USUR5mUU4SjnSUR -nURQUU5 gg!,(df  GN=f!,(df  GNV=f!,(df  N=f)z-Write nodemap data on disk for a given revlogrN filteredrevsrz.cannot persist nodemap of a filtered changelogz?calling persist nodemap on a revlog without the feature enablednodemap_data_incrementalupdate_nodemap_datar+ sr+nodemap_data_allc>T"T5 grYr)rUdatafilers rabortck persist_nodemap..abortcks h rs delete-%ssw+s.awT) atomictemp _realopenerc:>THnTRU5 M grY)r)rUoldfileoldsrealvfss rcleanup persist_nodemap..cleanups!!'* rsrevlog-cleanup-nodemap-%s))rBindexgetattrrProgrammingErrorr,get_nodemap_filehasattr_nodemap_docketr-r:r;copyrr7r8r9rxseekwriter<flushrr=r>r@r4rpersistent_datarr{tiprevr5noder6rqru serializer_other_rawdata_filepathrk)rUrCrQforcemsgcan_incremental ondisk_docket feed_datarKrM target_docket src_docketdata_changed_count new_length new_unusedrLnew_datarr^ file_pathfprrrrrs @@@@rrSrSs 6<<Av~r**$$ <  # #3F#;F SC((- -fll,FGO**M &;$>x$H$H #';;t}}R/L#M #%77:#60)3 %(2 % |% $V; 6<)>?M$$IU  y! Y y$4 8B ((*+ 9* ((A #6 9D &-? +3V5I5II   W- 0/D, +( 9 8s&B8SBS(2 S: S%( S7: Tz>Bz>BQQQQc:\rSrSrSrS SjrSrSrSrSr S r g) r4i2zumetadata associated with persistent nodemap data The persistent data may come from disk or be on their way to disk. NcxUc[R"5nXlSUlSUlSUlSUlg)Nr) docket_modmake_uiduidr5r6r7r8)rrs rrgNodeMapDocket.__init__8sB ;%%'C   rc[URS9nURUlURUlURUlUR UlU$)N)r)r4rr5r6r7r8)rnews rrNodeMapDocket.copyTsE)ll }} **** rcURUR:agURUR:agURUR:agURUR:agg)Nr rrr7rothers r__cmp__NodeMapDocket.__cmp__\sY 88eii  88eii     1 1 1    1 1 1rctURUR:H=(a URUR:H$rYrrs r__eq__NodeMapDocket.__eq__gs+xx599$N)9)9U=N=N)NNrc/nUR[R[55 [ UR 5UR URUR[ UR54nUR[R"U65 URUR 5 URUR5 SRU5$)z9return serialized bytes for a docket using the passed uidr) appendr/packr2rBrr5r7r8r6r3join)rrMrGs rrNodeMapDocket.serializejs INN>23 M LL           HMM7+, DHH DMM"xx~r)r7r8r6r5rrY) rrrrrrgrrrrrrrrr4r42s! 8 Orr4c:URnSX!R4-$)z9The (vfs relative) nodemap's rawdata file for a given uids%s-%s.nd)rr)rCr rs rr9r9{s \\F &**- --rczURn[R"SU-5n[X5nURR U5nURR U5n/nURRU5H3nURU5(dMX:wdM"URU5 M5 U$)Ns(^|/)%s-[0-9a-f]+\.nd$) rrrr9r-basenamerrrr) rCr rr new_file_path new_file_namerothersrs rrrs \\Fjj3f<=G%f5MMM**=9Mmm##M2G F ]] " "7 + ==   2 MM! , Mrc.[U5n[U5$)zAreturn the persistent binary form for a nodemap for a given index) _build_trie _persist_trie)rtries rrrs u D  rcV[XU5upEU[R-[XRS94$)zGreturn the incremental update for persistent nodemap from a given index) existing_idx) _update_trieS_BLOCKr1r)rrootmax_idxlast_rev changed_blockrs rupdate_persistent_datars/&uH=M $d1 rz>llllllllllllllllrcU[-*$)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[US5$)z/turn an hexadecimal digit into a proper integer)int) hex_digits r_to_intrs y" rc2^\rSrSrSrU4SjrSrSrU=r$)BlockizKrepresent a block of the Trie contains up to 16 entry indexed from 0 to 15c0>[TU]5 SUlgrY)superrg ondisk_id)r __class__s rrgBlock.__init__s rc@^[U4Sj[S555$)Nc3F># UHnTRU5v M g7frY)r;).0irs r !Block.__iter__..s3ADHHQKKs!r)iterrangerfs`r__iter__Block.__iter__s3r333r)r) rrrrrrgrr __classcell__)rs@rrrs4 44rrc[5n[[U55H!n[XS5n[ USXU5 M# U$)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)rrrBr_insert_into_block)rrr current_hexs rrrsC 7DSZ %*Q-( 5!T <! Krc Sn[US-[U55H$n[XS5nU[USXU5- nM& X14$)consumerr r )rrBrr )rrrchangedrr s rrrsPGX\3u:.%*Q-( %eQ;GG/ =rcZSnURbSUl[XAUS-5nURU5nUcX2U'U$[U[5(aU[ XS-XsU5- nU$[ XS5nUn [5n XU'[ XS-XU5 [ XS-XU5 U$)ainsert 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 r Nr )rrr; isinstancedictr rr) rlevelblock current_revr rrentry other_hex other_revrs rr r sG " EAI67I IIi E }&i N E4 % 19e+   N  Q(  gi5!)SYG5!)S{K Nrc0nUbUS-nOSn/n[U5H^nURbURU[U5'M*[U5U-U[U5'UR [ XR55 M` SR U5$)z]turn a nodemap trie into persistent binary data See `_build_trie` for nodemap trie structurer rr) _walk_trieridrBr_persist_blockr)rr block_mapbase_idxchunkstns rrrsI!# F << # " Ibf  #F h 6Ibf  MM.7 8  88F rc## [UR55H/up[U[5(dM[ U5ShvN M1 Uv gN 7f)z[yield all the block in a trie Children blocks are always yield before their parent block. N)ritemsrrr)r__items rrr(sE 5;;=) dD ! !!$' ' '* K (s2AAAAcT^[U4SjU55n[R"U6$)zproduce persistent binary data for a single block Children block are assumed to be already persisted and present in block_map. c3<># UHn[UT5v M g7frY) _to_value)rvrs rr!_persist_block..9s=*Q1i((*s)tuplerr) block_noderrMs ` rrr3s$ =*= =D << rcpUc[$[U[5(aU[U5$[ U5$)zpersist any value as an integer)NO_ENTRYrrrr)r$rs rr'r'=s3 | D$  D""d##rc[U5[R-S:wa4Sn[R"U[R[U54-5eU(d [ 5S4$0n/n[ S[U5[R5Hgn[ 5n[U5UlXRUR'XU[R-n[RU5nURXW45 Mi UH@up[U5H,upU [:XaMU S:aX*X'M[U 5X'M. MB WW[R-4$)z,parse parse nodemap data into a nodemap Triers:nodemap data size is not a multiple of block size (%d): %dN) rBrr1rAbortrrrr0r enumerater-r) rMrr new_blocksrr block_datavaluesbidxr(s r parse_datar6Gs D GLL Q&Kkk#s4y 99:: w}IJ 1c$i .i.%*%//"a',,./  +5/* / 'FCH}a"'* (  !w||# ##rcdSnURS[U5-5 [U5upE[[ U55nURS[U5-5 [ [U55HnXv;aSU-nUR U5 SnOURU5 [U[XS55n U cSU-nUR U5 SnMiX:wdMpSXy4-nUR U5 SnM U(a*[U5HnS U-nUR U5 M SnU$) zBverify that the provided nodemap data are valid for the given idexrsrevisions in index: %d srevisions in nodemap: %d s$ revision missing from nodemap: %d r r s/ revision node does not match any entries: %d s? revision node does not match the expected revision: %d != %d s" extra revisions in nodemap: %d ) statusrBr6set_all_revisionsr write_errremove _find_noderr) uirrMretrr#all_revsrrnm_revs r check_datarCes' CII,E :;$HD>$'(HII,H => 3u:  :Q>C LL C OOA D#ehqk"23 >EIC LL C [!" ,  LL C%(!A81 IIgd1Qi( )E%%ab** LrcUR(a1URS-nURRU5(aU$URS-$)Ns.n.as.n) _trypendingrr-exists)rC pending_paths rrrsC ||g- ==   - -  <<% r)FFrY)1 __future__rrstructrrrrrr rrr rr)rNr_rarr"rSr2Structr/r3r4r9rrrrr-rrrrrrr rrrr'r6rCr:r=rrrrrNs#  #9d9   D(VH(  2!"#o.P MM$  == "FFR. L  --( )    4D 4 D&$$< F r