q&f"zddlZddlZddlZddlZddlmZddlmZddlm Z ddl m Z dZ dZ dZGdd Zd Zy) N)hex)open)errorceZdZdZdZddZdZedZddZ dZ d Z d Z d Z dd Zd ZdZdZedZdZy)revmapz~trivial hg bin hash - linelog rev bidirectional map also stores a flag (uint8) for each revision, and track renames. sREVMAP1Nc||_dg|_dg|_i|_dg|_dg|_d|_|rAtjj|r|jy|jyy)a=create or load the revmap, optionally associate to a file if path is None, the revmap is entirely in-memory. the caller is responsible for locking. concurrent writes to a same file is unsafe. the caller needs to make sure one file is associated to at most one revmap object at a time.Nr) path_rev2hsh _rev2flag_hsh2rev _renamerevs _renamepaths _lastmaxrevosexists_loadflush)selfrs ;/usr/lib/python3/dist-packages/hgext/fastannotate/revmap.py__init__zrevmap.__init__:sn   3 E ww~~d#  r c|jdd|_|jdd|_|jj|_|jdd|_|j dd|_d|_y)z>copy the map data from another revmap. do not affect self.pathNr )rrrcopyrrr)rrhss rcopyfromzrevmap.copyfromQsa Q q) ))+ ??1-,,Q/r c2t|jdz S)z"return max linelog revision numberr)lenr)rs rmaxrevz revmap.maxrevZs4==!A%%r cX||jvr!tjdt|zt |t k7rt jdt zt |j}d}|r |tz}|Q||jdk7r?|tz}|jj||jj||jj||jj|||j|<|r|j|S)z~add a binary hg hash and return the mapped linelog revision. if flush is True, incrementally update the file. s%r is in revmap alreadyshsh must be %d-char longrr )rrCorruptedFileErrorrr!_hshlenhgerrorProgrammingErrorrsidebranchflagr renameflagrappendrr)rhsh sidebranchrridxflags rr*z revmap.append_s $-- ***SX5  s8w **+g5 $--   N "D  (9(9"(= = J D    # #C (    $ $T * S! d#  c  JJL r cJ||jkDs|dkry|j|S)z>convert linelog revision to hg hash. return None if not found.rN)r"rrrevs rrev2hshzrevmap.rev2hshzs&  a}}S!!r cJ||jkDs|dkry|j|S)zkget the flag (uint8) for a given linelog revision. return None if revision does not exist. rN)r"rr0s rrev2flagzrevmap.rev2flags(  a~~c""r c||jkDs|dkrytj|j|dz }|j|S)zcget the path for a given linelog revision. return None if revision does not exist. rNr)r"bisect bisect_rightrr)rr1r-s rrev2pathzrevmap.rev2pathsG  a!!$"2"2C81<  %%r c8|jj|S)z>convert hg hash to linelog revision. return None if not found.)rget)rr+s rhsh2revzrevmap.hsh2revs}}  %%r cvdg|_dg|_i|_dg|_d|_|r|j yy)z3make the map empty. if flush is True, write to diskNr r )rrr _rev2pathrr)rrs rclearz revmap.clears?    JJL r c8|jsy|jdk(rrt|jd5}|j|jt dt |jD]}|j|| dddnct|jd5}t |jdzt |jD]}|j|| ddd|j|_y#1swYxYw#1swY'xYw)z write the state down to the fileNr swbrsab) rrrwriteHEADERranger!r _writerevr")rfis rrz revmap.flushsyy    r !dii' )1 $q#dmm"45)ANN1a() ) ) dii' )1t//!3S5GH)ANN1a() ) ;; ) )  ) )sAD%ADD DcR|jsyd}t}t|jd5}|jt |j |j k7rt j|jd |j|}|snt|}t |j}|tzrG|j|}|jj||jj||j|}t ||k7rt j||j |<|j"j||jj| ddd|j$|_y#1swYxYw)zload state from fileNrrbF)r)rr%rreadr!rArr$r>ordrr) _readcstrrr*rrrr"r) rflaglenhshlenrDbufr.r1rr+s rrz revmap._loadsUyy  $))U # *qvvc$++&'4;;6..00 JJUJ #ffWo3x$--(*$>>!,D$$++C0%%,,T2ffVns8v%2244%( c"%%d+ $$S) *( ;;) * *s EFF&c<|j|}|j|}|jtjd||t zr?|j |}|tjd|z|j|dz|j|y)zappend a revision data to fileBNscannot find path for %s) rrr@structpackr)r8rr$)rr1rDr.r+rs rrCzrevmap._writerevs~~c"mmC   D$'( * ==%D|../IC/OPP GGD5L !  r crd} |jd}|stj|dk(r |S||z }5)z,read a C-language-like ''-terminated stringr rrP)rHrr$)rDrMchs rrJzrevmap._readcstrsJB..00U{  2IC r ct|tr|\}}n |j|j}}|j |}|y|||j |k7ry|j |tzdk(S)z(fctx or (node, path)) -> bool. test if (node, path) is in the map, and is not in a side branch. f can be either a tuple of (node, path), or a fctx. Fr) isinstancetuplenoderr;r8r4r()rrDr+rr1s r __contains__zrevmap.__contains__st a IC!&&(Cll3 ;   c(: : c"^399r )N)FNF)F)__name__ __module__ __qualname____doc__rArrpropertyr"r*r2r4r8r;r>rrrC staticmethodrJrYr rr r 2sr F.&&6" #&&  ''<   :r r c8d} t|d5}|jt tj|j t tjkDr|jt}ddd|S#1swY|SxYw#t$rY|SwxYw)zreturn the last hash in a revmap, without loading its full content. this is equivalent to `m = revmap(path); m.rev2hsh(m.maxrev)`, but faster. NrG) rseekr%ioSEEK_ENDtellr!r rArHIOError)rr+rDs r getlastnodergs C $  &! FFG8R[[ )vvx#fmm,,ffWo & J  & J   J s/ B A%A?5B ?B B B BB)r6rcrrQmercurial.nodermercurial.pycompatr mercurialrr&r(r)r%r rgr`r rrlsJ #,  B:B:J r