:KPdZddlZddlZddlZddlZddlZddlZddlZddlZddl Z ddl Z ddl Z ddl Z ddl ZddlZddlZddlZddlZddlZddlZddlmZddlmZddlmZmZmZmZddlmZddl m!Z!m"Z"m#Z#m$Z$mZm%Z%dd l&m'Z'm(Z(m)Z)m*Z*ejVrdd l,m-Z-m.Z.m/Z/m0Z0m1Z1e$jdd Z3e$jdd Z4e3jjZ5e3jlZ6ejnZ7ejpZ8ejrZ9ejtZ:ejvZe%j~Z?e%jZ@e%jZAejZCejrdd l mEZFnddl mGZFe#jZHeFjZIeFjZJeFjZKeFjZLeFjZMeFjZNeFjZOeFjZPeFjZQeFjZReFjZSeFjZTeFjZUeFjZVe4jZWeFjZXeFjZYeFjZZeFjZ[eFjZ\eFjZ]eFjZ^eFjZ_eFjZ`eFjZaeFjZbeFjZceFjZdeFjZeeFjZfeFjZgeFjZheFjZieFjZjeFjZkeFjZleFjZmee4deFjZneFjZoeFjZpeFjaqeFjZreFjZsdZte'jZue'jZve'jZwexZydZze{e!jjdZ~e~r?ejddedejddedejddede~r?ejddedejddedejddedddZeje(jejdZgdZeD]ZeevrJGdd ZGd!d"Z eZd$ZGd%d&Zdd'ZGd(d)ZGd*d+eZhd,ZGd-d.ZGd/d0ZGd1d2eZ dd4ZGd5d6eZ dd7Zd8Zdd9Zd:ZGd;d<ZGd=d>ej8ZGd?d@eeZGdAdBeeZGdCdDZejDddEZejDddFZGdGdHZGdIdJZdKZGdLdMZdNZddPZdQZdRZdSZej\rdTZdUZddVZhdWZ ddXZddYZhdZZd[Zd\Zeed]dZejreZes)ejrZneFjpZes ej$Zd^Zd_Zd`ZdaZdba ddlZdadcZGdddeZeëZ iZdfZdgZdhZdiZddjZGdkdlZGdmdnZdoZddpZdqZddrZdsZdtZduZGdvdwZddxZGdydzZd{Zd|Zed}d~eHdfdd~eHdfdd~eHdfd}deHdfddeHdfddeHdfd}dOeHdfddOeHdfddOeHdfddeHdf ZGddZejdZdZdZdZejdk(reZeZeZn'ejZejZejZdZdZdZddZeddeHdfd}deHdfddeHdfddeHdfd}deHdfddeHdfddeHdfd}deHdfddeHdfddeHdfd}deHdfddeHdfddeHdf ZejGddZejDdZde_dZdZdZGddZddZdde)je)jddfdZeZddZdZdZdZejDdZdZy#e$rdd#ZYwxYw#e$rd3aY~wxYw)zMercurial utility functions and platform specific implementations. This contains helper routines that are independent of the SCM core and hide platform-specific details from the core. N)hex)attr)delattrgetattropensetattr)tracing)encodingerrori18npolicypycompat urllibcompat) compressionhashutilprocutil stringutil)IterableIteratorListOptionalTuplebase85osutil)windows)posix statfilescptjrytj||dzxt_ay)z%updates the umask. used by chg serverNi)r iswindowsosumaskplatform)vals 2usr/lib/python3.12/site-packages/mercurial/util.pysetumaskr&s+HHSM 5[(HNUc"d}|D]}||z} |SNr) containerbitsbits r%bitsfromr.s D   Kr'sHGEMITWARNINGSdefault mercurialhgexthgext3rdignorez bad escapezinvalid escape sequencezthe imp module is deprecatedctrX|d|zz }tjtj|t |dzt jjyy)zxIssue an python native deprecation warning This is a noop outside of tests, use 'ui.deprecwarn' when possible. sF (compatibility will be dropped after Mercurial-%s, update your code.)rN) _dowarnwarningswarnrsysstrDeprecationWarningsysstderrflush)msgversion stacklevels r%nouideprecwarnrAsS   #    hooc*,> QO r')md5sha1sha512)rDrCrBc:eZdZdZddZdZdZdZedZ y) digesterahelper to compute digests. This helper can be used to compute one or more digests given their name. >>> d = digester([b'md5', b'sha1']) >>> d.update(b'foo') >>> [k for k in sorted(d)] ['md5', 'sha1'] >>> d[b'md5'] 'acbd18db4cc2f85cedef654fccc4a4d8' >>> d[b'sha1'] '0beec7b5ea3f0fdbc95d0dd47f3c5bc275da8a33' >>> digester.preferred([b'md5', b'sha1']) 'sha1' ci|_|D]E}|tvr!tjt d|zt||j|<G|r|j |yyNsunknown digest type: %s)_hashesDIGESTSr Abort_update)selfdigestssks r%__init__zdigester.__init__s] Akk!$>"?!"CDD%ajlDLLO KKN r'cd|jjD]}|j|yN)rIvaluesrM)rNdatahs r%rMzdigester.updates$$$&A HHTN'r'c|tvr%tjtdtzt |j |jSrH)rJr rKrLrQrrIdigest)rNkeys r% __getitem__zdigester.__getitem__sA g ++a :;a?@ @4<<$++-..r'c,t|jSrT)iterrIrNs r%__iter__zdigester.__iter__ sDLL!!r'c*tD] }||vs|cSy)z@returns the strongest digest type in both supported and DIGESTS.N)DIGESTS_BY_STRENGTH) supportedrQs r% preferredzdigester.preferred s%AI~%r'N)r') __name__ __module__ __qualname____doc__rRrMr[r_ staticmethodrcr*r'r%rFrFs/ / "r'rFc$eZdZdZdZddZdZy) digestcheckerzfile handle wrapper that additionally checks content against a given size and digests. d = digestchecker(fh, size, {'md5': '...'}) When multiple digests are given, all of them are validated. c||_||_d|_t||_t |jj |_yr))_fh_size_gotdict_digestsrFkeys _digester)rNfhsizerOs r%rRzdigestchecker.__init__s;  W  !$--"4"4"67r'c|jj|}|jj||xjt |z c_|SrT)rlreadrrrMrnlen)rNlengthcontents r%rvzdigestchecker.read&s=((--' g& S\! r'cn|j|jk7r7tjt d|j|jfz|j j D]H\}}||j|k7stjt d|||j|fzy)Ns"size mismatch: expected %d, got %ds %s mismatch: expected %s, got %s)rmrnr rKrLrpitemsrrrNrQvs r%validatezdigestchecker.validate,s :: "++78::tyy)* MM'')DAqDNN1%%kk9:!T^^A./0*r'N)rdrerfrgrRrvr~r*r'r%rjrjs8 r'rjcD|t||||zSt||dSrT) memoryview) sliceableoffsetrxs r%bufferr?s0  i(&6/B B)$VW--r'icveZdZdZfdZdZedZedZdZ dZ dZ d Z d Z d Zefd ZxZS) bufferedinputpipeaWa manually buffered input pipe Python will not let us use buffered IO and lazy reading with 'polling' at the same time. We cannot probe the buffer state and select will not detect that data are ready to read if they are already buffered. This class let us work around that by implementing its own buffering (allowing efficient readline) while offering a way to know if the buffer is empty from the output (allowing collaboration of the buffer with polling). This class lives in the 'util' module because it makes use of the 'os' module from the python stdlib. cVt|trt}tt||SrT) isinstancefileobjectproxyobservedbufferedinputpipesuperr__new__)clsrs __class__s r%rzbufferedinputpipe.__new__Ws' b/ *+C&4S99r'c<||_g|_d|_d|_y)NFr)_input_buffer_eof_lenbuf)rNinputs r%rRzbufferedinputpipe.__init___s    r'c,t|jS)zTrue is any data is currently buffered This will be used externally a pre-step for polling IO. If there is already data then no polling should be set in place.)boolrr^s r% hasbufferzbufferedinputpipe.hasbufferes DLL!!r'c.|jjSrT)rclosedr^s r%rzbufferedinputpipe.closedms{{!!!r'c6|jjSrT)rfilenor^s r%rzbufferedinputpipe.filenoqs{{!!##r'c6|jjSrT)rcloser^s r%rzbufferedinputpipe.closets{{  ""r'c|js;|j|kr,|j|js|j|kr,|j|SrT)rr _fillbuffer _frombufferrNrts r%rvzbufferedinputpipe.readwsE994<<$#6    994<<$#6%%r'c|js.|jdk(r|jt|t|j t |j|Sr))rrrmax _chunksizerminrs r%unbufferedreadz bufferedinputpipe.unbufferedread|sEyyT\\Q.   Sz2 3DLL$ 788r'ct|jdkDr>dj|jg|_t|jd|_d}|jr|jdj d}|j sQ|dkrL|j |jr|jdj d}|j s|dkrL|dz}|dkr |j}n@t|jdkDr(||jt|jdz z }|j|S)Nrr'rr )rwrjoinrfindrrr)rNargskwargslfirts r%readlinezbufferedinputpipe.readlines  t|| q  HHT\\23DLt||A/DL <<,,r"''.C99#'    ||ll2&++E299#'Qw 7<zmmapread..srr')access)rmmap ACCESS_READ ValueErrorr!fstatst_size)rrtfds` r%mmapreadrsw qy  *Xz * ,ByyT$*:*:;;  88B<  1 $ s%A+A75A7ceZdZdZdZdZdZdZeZdZ dZ dZ d Z d Z d Zd Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZy)rzA proxy around file objects that tells a watcher when events occur. This type is intended to only be used for testing purposes. Think hard before using it in important code. _orig _observerc`tj|d|tj|d|yNrrobject __setattr__)rNrsobservers r%rRzfileobjectproxy.__init__s&4"-4h7r'c~hd}||vrtj||Sttj|d|S)N>rvseektellrr=read1writedetachrisattyreadallreadablereadintorseekabletruncatewritabler readlines writelinesrr__getattribute__r)rNnameourss r%rz fileobjectproxy.__getattribute__s@ @ 4<**46 6v..tW=tDDr'c@ttj|dSNrrrrr^s r% __nonzero__zfileobjectproxy.__nonzero__F++D':;;r'cBttj|d|SrrrrrNrs r% __delattr__zfileobjectproxy.__delattr__v..tW=tDDr'cDttj|d||Srr rrrNrvalues r%rzfileobjectproxy.__setattr__v..tW=tUKKr'cJtj|djSr)rrr_r^s r%r_zfileobjectproxy.__iter__ s&&tW5>>@@r'ctj|d}t|||i|}tj|d}t||d}|r ||g|i||SrrrNrrrorigresrfns r% _observedcallzfileobjectproxy._observedcall h&&tW5!gdD!4262**4= XtT * s $T $V $ r'c@tj|ddg|i|S)NrrrrrNrrs r%rzfileobjectproxy.close/&&t_=   $  r'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.fileno/&&t_=   %  r'c@tj|ddg|i|S)Nrr=rrs r%r=zfileobjectproxy.flush$rr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.isatty)rr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.readable./&&t_=   !'  r'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.readline3rr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.readlines8/&&t_=   "(  r'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.seek=/&&t_=   #  r'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.seekableBrr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.tellGrr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.truncateLrr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.writableQrr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.writelinesV/&&t_=   #)  r'c@tj|ddg|i|S)Nrrvrrs r%rvzfileobjectproxy.read[rr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.readall`/&&t_=   &  r'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.readintoerr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.writejrr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.detachorr'c@tj|ddg|i|S)Nrrrrs r%rzfileobjectproxy.read1trr'N) rdrerfrg __slots__rRrr__bool__rrr_rrrr=rrrrrrrrrrrvrrrrrr*r'r%rrs I 8$EL<HELA                    r'rc:eZdZdZeffd ZfdZfdZxZS)raA variation of bufferedinputpipe that is aware of fileobjectproxy. ``bufferedinputpipe`` makes low-level calls to ``os.read()`` that bypass ``fileobjectproxy``. Because of this, we need to make ``bufferedinputpipe`` aware of these operations. This variation of ``bufferedinputpipe`` can notify observers about ``os.read()`` events. It also re-publishes other events, such as ``read()`` and ``readline()``. ctt| |}t|jj dd}|r ||||S)N)rtosread)rrrrrrrNrtrrrs r%rz%observedbufferedinputpipe._fillbuffersA-t@d@K T[[**Hd ; sDM r'ctt| |}t|jj dd}|r ||||S)N bufferedread)rrrvrrrrs r%rvzobservedbufferedinputpipe.reads>-t9$? T[[**ND A sDM r'ctt| |i|}t|jj dd}|r|||S)Nbufferedreadline)rrrrrr)rNrrrrrs r%rz"observedbufferedinputpipe.readlinesB-t=tNvN T[[**,> E sG r') rdrerfrgrrrvrrrs@r%rrzs!  *r'r> recvsendsendtosendallmakefilerecvfrom recv_into gettimeout setsockopt settimeout setblocking recvfrom_intoceZdZdZdZdZdZdZdZdZ e Z dZ d Z d Z d Zd Zd ZdZdZdZdZdZdZdZy) socketproxyzA proxy around a socket that tells a watcher when events occur. This is like ``fileobjectproxy`` except for sockets. This type is intended to only be used for testing purposes. Think hard before using it in important code. rc`tj|d|tj|d|yrr)rNsockrs r%rRzsocketproxy.__init__s&4$/4h7r'c~|tvrtj||Sttj|d|Sr)PROXIED_SOCKET_METHODSrrrrs r%rzsocketproxy.__getattribute__s8 ) )**46 6v..tW=tDDr'cBttj|d|Srrrs r%rzsocketproxy.__delattr__rr'cDttj|d||Srrrs r%rzsocketproxy.__setattr__rr'c@ttj|dSrrr^s r%rzsocketproxy.__nonzero__rr'ctj|d}t|||i|}tj|d}t||d}|r ||g|i||Srrrs r%rzsocketproxy._observedcallrr'c tj|ddg|i|}tj|d}t|j||j|j |j |j|jS)Nrr"rreadswriteslogdata logdataapis) rrmakeloggingfileobjectrsrr6r7r8r9)rNrrrrs r%r"zsocketproxy.makefiles~%%dO<   !'  **4=$ KK  MM..??$$ ,,  r'c@tj|ddg|i|S)Nrrrrs r%rzsocketproxy.recvrr'c@tj|ddg|i|S)Nrr#rrs r%r#zsocketproxy.recvfromrr'c@tj|ddg|i|S)Nrr)rrs r%r)zsocketproxy.recvfrom_intos/&&t_=  " &,  r'c@tj|ddg|i|S)Nr recv_inforrs r%r$zsocketproxy.recv_intorr'c@tj|ddg|i|S)Nrrrrs r%rzsocketproxy.send rr'c@tj|ddg|i|S)Nrr!rrs r%r!zsocketproxy.sendallrr'c@tj|ddg|i|S)Nrr rrs r%r zsocketproxy.sendtorr'c@tj|ddg|i|S)Nrr(rrs r%r(zsocketproxy.setblockings/&&t_=    $*  r'c@tj|ddg|i|S)Nrr'rrs r%r'zsocketproxy.settimeoutr r'c@tj|ddg|i|S)Nrr%rrs r%r%zsocketproxy.gettimeout$r r'c@tj|ddg|i|S)Nrr&rrs r%r&zsocketproxy.setsockopt)r r'N)rdrerfrgrrRrrrrrrr"rr#r)r$rr!r r(r'r%r&r*r'r%r+r+srI 8E EL<H  $           r'r+ceZdZdZdZy)baseproxyobserverc<||_||_||_||_yrT)rsrr8r9)rNrsrr8r9s r%rRzbaseproxyobserver.__init__0s  &r'c|jsB|jr5|jjd|jj yd|vr|jr2|jjdt j |zn=|jjd|jt j |fz|jj y|jr|jjd|jd}|D]?}|jjd|jt j |fzA|jj y)Nrs: %s s %s> %s s: T) r8r9rsrr=r escapestrr splitlines)rNrVlineslines r% _writedatazbaseproxyobserver._writedata6s|| e$     i**>*>t*DDE #tyy*2F2Ft2L&MM GGMMO     GGMM& !%D GGMM499j.B.B4.H"II   r'N)rdrerfrRrOr*r'r%rHrH/s ' r'rHcTeZdZdZ d fd Zd dZd dZdZdZdZ dZ d Z xZ S) fileobjectobserverzLogs file object activity.cNtt| ||||||_||_yrT)rrQrRr6r7)rNrsrr6r7r8r9rs r%rRzfileobjectobserver.__init__Ws)  $0T7KP  r'c|jsy|d}|dk(r|dk(ry|jr4|jjd|j|t |fz|j |y)Nr'rs%s> read(%d) -> %dr6r9rsrrrwrOrNrrts r%rvzfileobjectobserver.read^sbzz  ;C 2:#*     GGMM/499dCH2MM N r'c|jsy|jr3|jjd|jt |fz|j |y)Ns%s> readline() -> %drT)rNrlimits r%rzfileobjectobserver.readlineqsDzz     GGMM1TYYC4II J r'c|jsy|jr4|jjd|jt ||fz||d|nd}t |tr|j}|j|y)Ns%s> readinto(%d) -> %rrr') r6r9rsrrrwrrtobytesrO)rNrdestrVs r%rzfileobjectobserver.readintozsrzz     GGMM)TYYD 3,GG "otAc{3 dJ '<<>D r'c|jsy| |r t|}|jr4|jj d|j t||fz|j |y)Ns%s> write(%d) -> %r)r7rwr9rsrrrO)rNrrVs r%rzfileobjectobserver.writesX{{  ;4d)C    GGMM0DIIs4y#3NN O r'cr|jsy|jjd|j|fzy)Ns%s> flush() -> %r )r7rsrrrNrs r%r=zfileobjectobserver.flushs+{{   , 3/??@r'c|jsy|jr4|jjd|j|t |fz|j |y)Ns%s> bufferedread(%d) -> %drTrUs r%rzfileobjectobserver.bufferedreadsJzz     GGMM-D#c(0KK  r'c|jsy|jr3|jjd|jt |fz|j |y)Ns%s> bufferedreadline() -> %drTr]s r%rz#fileobjectobserver.bufferedreadlinesHzz     GGMM/499c#h2GG  r'TTFTr) rdrerfrgrRrvrrrr=rrrrs@r%rQrQTs6$MQ&$ A  r'rQFc<t||||||}t||S)z.Turn a file object into a logging file object.r5)rQr)loghrsrr6r7r8r9rs r%r:r:s/ "   H 2x ((r'ceZdZdZ dfd ZddZddZddZddZddZ ddZ dd Z dd Z d Z d Zd ZdZxZS)socketobserverzLogs socket activity.c\tt| ||||||_||_||_yrT)rrdrRr6r7states) rNrsrr6r7rfr8r9rs r%rRzsocketobserver.__init__s/ nd,Rw L   r'ct|jsy|jjd|j||fzy)Ns%s> makefile(%r, %r) rfrsrr)rNrmodebufsizes r%r"zsocketobserver.makefiles-{{   /499dG2LLMr'c |jsy|jr5|jjd|j||t |fz|j |y)Ns%s> recv(%d, %d) -> %drTrNrrtflagss r%rzsocketobserver.recvsLzz     GGMM)TYYeSX,NN  r'c |jsy|jr8|jjd|j||t |dfz|j |dy)Ns%s> recvfrom(%d, %d) -> %drrTrls r%r#zsocketobserver.recvfromsWzz     GGMM-99dE3s1v;78  Ar'c|jsy|jr/|jjd|j|||dfz|j |d|dy)Ns%s> recvfrom_into(%d, %d) -> %drr6r9rsrrrOrNrrrtrms r%r)zsocketobserver.recvfrom_intosYzz     GGMM299dE3q623  AA(r'c|jsy|jr,|jjd|j|||fz|j |d|y)Ns%s> recv_into(%d, %d) -> %drrprqs r%r$zsocketobserver.recv_intosNzz     GGMM.$))T5#1NN  Ac #r'c |jsy|jjd|jt ||t |fz|j |y)Ns%s> send(%d, %d) -> %d)r7rsrrrwrOrNrrVrms r%rzsocketobserver.send sG{{   %CIuc#h(O O  r'c|jsy|jr4|jjd|jt ||fz|j |y)Ns%s> sendall(%d, %d)r7r9rsrrrwrOrts r%r!zsocketobserver.sendallsJ{{     GGMM&$))SY)FF  r'c|jsy|r|}nd}|jr6|jjd|jt ||||fz|j |y)Nrs%s> sendto(%d, %d, %r) -> %drv)rNrrVflagsoraddressaddressrms r%r zsocketobserver.sendto"s^{{  "EE    GGMM/99c$i=>  r'cr|jsy|jjd|j|fzy)Ns%s> setblocking(%r) rh)rNrflags r%r(zsocketobserver.setblocking3s+{{   .$))T1BBCr'cr|jsy|jjd|j|fzy)Ns%s> settimeout(%r) rh)rNrrs r%r'zsocketobserver.settimeout9s+{{   -E0BBCr'cr|jsy|jjd|j|fzy)Ns%s> gettimeout() -> %f rhr]s r%r%zsocketobserver.gettimeout?s+{{   1TYY4DDEr'cx|jsy|jjd|j||||fzy)Ns!%s> setsockopt(%r, %r, %r) -> %r rh)rNrleveloptnamers r%r&zsocketobserver.setsockoptEs6{{   1yy%%5 6 r'TTTFTNNr)rrrT)rdrerfrgrRr"rr#r)r$rr!r r(r'r%r&rrs@r%rdrds\  N    ) $ "D D F  r'rdc >t|||||||}t||S)z$Turn a socket into a logging socket.)r6r7rfr8r9)rdr+) rbrsrr6r7rfr8r9rs r%makeloggingsocketrOs2  H r8 $$r'cF ddlm}|jS#t$rYywxYw)z(Return version information if available.r __version__sunknown)r0rr? ImportErrorrs r%r?r?gs(!""" s   cJ|s t}tjd|}|sd|}}n8|jdr|j \}}n|jdd}}|Jg}|j dD]} |j t|t|dkr |j dt|dkr |dk(r |d|dfS|dk(r|d|d|dfS|d k(r|d|d|d|fStjd |z#t$rYwxYw) azParses a Mercurial version string into an N-tuple. The version string to be parsed is specified with the ``v`` argument. If it isn't defined, the current Mercurial version string will be parsed. ``n`` can be 2, 3, or 4. Here is how some version strings map to returned values: >>> v = b'3.6.1+190-df9b73d2d444' >>> versiontuple(v, 2) (3, 6) >>> versiontuple(v, 3) (3, 6, 1) >>> versiontuple(v, 4) (3, 6, 1, '190-df9b73d2d444') >>> versiontuple(b'3.6.1+190-df9b73d2d444+20151118') (3, 6, 1, '190-df9b73d2d444+20151118') >>> v = b'3.6' >>> versiontuple(v, 2) (3, 6) >>> versiontuple(v, 3) (3, 6, None) >>> versiontuple(v, 4) (3, 6, None, None) >>> v = b'3.9-rc' >>> versiontuple(v, 2) (3, 9) >>> versiontuple(v, 3) (3, 9, None) >>> versiontuple(v, 4) (3, 9, None, 'rc') >>> v = b'3.9-rc+2-02a8fea4289b' >>> versiontuple(v, 2) (3, 9) >>> versiontuple(v, 3) (3, 9, None) >>> versiontuple(v, 4) (3, 9, None, 'rc+2-02a8fea4289b') >>> versiontuple(b'4.6rc0') (4, 6, None, 'rc0') >>> versiontuple(b'4.6rc0+12-425d55e54f98') (4, 6, None, 'rc0+12-425d55e54f98') >>> versiontuple(b'.1.2.3') (None, None, None, '.1.2.3') >>> versiontuple(b'12.34..5') (12, 34, None, '..5') >>> versiontuple(b'1.2.3.4.5.6') (1, 2, 3, '.4.5.6') s(\d+(?:\.\d+){,2})[+-]?(.*)r'rN.rs invalid version part request: %d) r?remodmatchgroupgroupssplitrintrrwr ProgrammingError)r}nmvpartsextravintsis r% versiontuplerqs?n I 3Q7A Q   D    E \\$   LLQ  e*q. T e*q. Ava%(##Ava%(E!H--Ava%(E!He44  !Dq!H II   s=D D"!D"cjjdk(r gfd}|Sijjdk(rfd}|Sfd}|S)z"cache the result of function callsrcVtdk(rjdSr))rwr)func listcachesr%fzcachefunc..fs)9~"  (Q< r'rc,|vr ||<|SrTr*)argcachers r%rzcachefunc..fs"%!#Yc : r'c&|vr||<|SrTr*)rrrs r%rzcachefunc..fs"5 "Dkd ; r')__code__ co_argcount)rrrrs` @@r% cachefuncrsW }}  A%   E }}  A%  H   Hr'ceZdZdZdZdZy)cowz^helper class to make copy-on-write easier Call preparewrite before doing any writes. clt|ddr&|xjdzc_|j|S|S)z;call this before writes, return self or a copied new object_copiedrr)rrrr^s r% preparewritezcow.preparewrites0 4A & LLA L>>$' ' r'c0t|dddz|_|S)zalways do a cheap copyrrr)rrr^s r%copyzcow.copystY2Q6  r'N)rdrerfrgrrr*r'r%rrs r'rcFeZdZdZfdZej rdZdZxZ S)sortdicta[a simple sorted dictionary >>> d1 = sortdict([(b'a', 0), (b'b', 1)]) >>> d2 = d1.copy() >>> d2 sortdict([('a', 0), ('b', 1)]) >>> d2.update([(b'a', 2)]) >>> list(d2.keys()) # should still be in last-set order ['b', 'a'] >>> d1.insert(1, b'a.5', 0.5) >>> d1 sortdict([('a', 0), ('a.5', 0.5), ('b', 1)]) c<||vr||=tt| ||yrT)rr __setitem__)rNrZrrs r%rzsortdict.__setitem__ s" $;S  h)#u5r'c t|tr|j}|D] \}}|||< |D] }||||< yrT)rror{)rNsrcrrQr}s r%rMzsortdict.updatesE#t$iik1QA$Qr'ctt|jD] \}\}}||k(r|||<||k\s||=|||<"yrT) enumeratelistr{)rNpositionrZrrrQr}s r%insertzsortdict.insertsK$T$**,%78KQAH}!S H}GQ 9r') rdrerfrgrrispypyrMrrrs@r%rrs  6  r'rceZdZdZy)cowdictacopy-on-write dict Be sure to call d = d.preparewrite() before writing to d. >>> a = cowdict() >>> a is a.preparewrite() True >>> b = a.copy() >>> b is a True >>> c = b.copy() >>> c is a True >>> a = a.preparewrite() >>> b is a False >>> a is a.preparewrite() True >>> c = c.preparewrite() >>> b is c False >>> b is b.preparewrite() True Nrdrerfrgr*r'r%rr"sr'rceZdZdZy) cowsortdictzZcopy-on-write sortdict Be sure to call d = d.preparewrite() before writing to d. Nrr*r'r%rr=sr'rc|eZdZdZej ZejdZejdZ dZ dZ y) transactionalzBBase class for making a transactional type into a context manager.cy)z$Successfully closes the transaction.Nr*r^s r%rztransactional.closeIr'cy)zoMarks the end of the transaction. If the transaction has not been closed, it will be aborted. Nr*r^s r%releaseztransactional.releaseMrr'c|SrTr*r^s r% __enter__ztransactional.__enter__T r'ct ||j|jy#|jwxYwrT)rr)rNexc_typeexc_valexc_tbs r%__exit__ztransactional.__exit__Ws)  LLNDLLNs%7N) rdrerfrgabcABCMeta __metaclass__abstractmethodrrrrr*r'r%rrDsJLKKM33   r'rc#K|sdy d|j |jy#tj$r|jwxYw#|jwxYww)zA context manager that closes the transaction on InterventionRequired If no transaction was provided, this simply runs the body and returns N)rr InterventionRequiredr)trs r%acceptinterventionr_s[      % %    s%A.1A.%AAA++A.c#K|ywrTr*) enter_results r%nullcontextmanagerrrs sc eZdZdZdZdZdZy) _lrucachenodezA node in a doubly linked list. Holds a reference to nodes on either side as well as a key-value pair for the dictionary entry. )nextprevrZrcostcR||_||_t|_d|_d|_yr))rr_notsetrZrrr^s r%rRz_lrucachenode.__init__s%    r'c6t|_d|_d|_y)zMark the node as emptied.Nr)rrZrrr^s r% markemptyz_lrucachenode.markemptys  r'N)rdrerfrgrrRrr*r'r%rrws 9Ir'rceZdZdZddZdZdZdZdZddZ dZ d Z e fd Z dd Ze fd ZdZddZdZdZdZdZy ) lrucachedictaDict that caches most recent accesses and sets. The dict consists of an actual backing dict - indexed by original key - and a doubly linked circular list defining the order of entries in the cache. The head node is the newest entry in the cache. If the cache is full, we recycle head.prev and make it the new head. Cache accesses result in the node being moved to before the existing head and being marked as the new head node. Items in the cache can be inserted with an optional "cost" value. This is simply an integer that is specified by the caller. The cache can be queried for the total cost of all items presently in the cache. The cache can also define a maximum cost. If a cache insertion would cause the total cost of the cache to go beyond the maximum cost limit, nodes will be evicted to make room for the new code. This can be used to e.g. set a max memory limit and associate an estimated bytes size cost to each item in the cache. By default, no maximum cost is enforced. chi|_t|_d|_||_d|_||_y)Nrr)_cacher_headrmcapacity totalcostmaxcost)rNrrs r%rRzlrucachedict.__init__s. "_    r'c,t|jSrT)rwrr^s r%__len__zlrucachedict.__len__s4;;r'c||jvSrT)rrNrQs r% __contains__zlrucachedict.__contains__sDKKr'c#K|j}tt|jD]}|j|j }ywrT)rrangerwrrZr)rNrrs r%r_zlrucachedict.__iter__s9 JJs4;;'(A%%KA)sA A cZ|j|}|j||jSrT)r _movetoheadr)rNrQnodes r%r[zlrucachedict.__getitem__s'{{1~ zzr'c|jj|}|p|xj|jzc_||_||_|xj|z c_|j ||j r|jy|j|jkr|j}n|jj}|jtur6|xj|jzc_|j|j=||_ ||_||_|xj|z c_||j|<||_ |j r|jyy)z8Insert a new item in the cache with optional cost value.N)rgetrrrrr_enforcecostlimitrmr _addcapacityrrrZr)rNrQr}rrs r%rzlrucachedict.inserts{{q!   NNdii 'NDJDI NNd "N   T "||&&(  :: %$$&D::??D 887 " NNdii 'N DHH%   $ A <<  " " $ r'c(|j||yrT)rr|s r%rzlrucachedict.__setitem__s Aqr'c&|j|yrT)poprs r% __delitem__zlrucachedict.__delitem__s   r'c4 |jj|}|J|j}|xj |j zc_|j|j||j|_ |S#t$r|tur|cYSwxYwrT) rrKeyErrorrrrrrrrr)rNrQr/rrs r%rzlrucachedict.pops ;;??1%D   $))#  YY   '!N sBBBNcH |j|S#t$r|cYSwxYwrT)r[r)rNrQr/s r%rzlrucachedict.gets, ##A& & N s  !!cv |j|}|J|jS#t$r|tur|cYSwxYw)zGet the specified item without moving it to the head Unlike get(), this doesn't mutate the internal state. But be aware that it doesn't mean peek() is thread safe. )rrrr)rNrQr/rs r%peekzlrucachedict.peek sI  ;;q>D# ##::  '!N s !88c|j}|jturN|xj|jzc_|j |j }|jturN|jjyrT) rrZrrrrrrclear)rNrs r%rzlrucachedict.clears[ JJee7" NNaff $N KKMAee7" r'c|xs |j}|xs |j}t||}|jj}|j t ur;||jur-|j}|j t ur||jur-tt|jD]@}|j|j |j|j|j}B|S)a8Create a new cache as a copy of the current one. By default, the new cache has the same capacity as the existing one. But, the cache capacity can be changed as part of performing the copy. Items in the copy have an insertion/access order matching this instance. )r)r) rrrrrrZrrrwrrrr)rNrrresultrrs r%rzlrucachedict.copy"s,t}})T\\h8 JJOOeew1DJJ#6Aeew1DJJ#6 s4;;'(A MM!%%qvvM 6A) r'c~|jsy|jj}|J|jtur|j}|jtur|J|j|j }}|j|j=|xj |jzc_|j||fS)zuRemove the oldest item from the cache. Returns the (key, value) describing the removed cache entry. N) rrrrZrrrrr)rNrrZrs r% popoldestzlrucachedict.popoldestAs {{  JJOO}}eewAeew}}UUAGGU KK  !&&  Ezr'c2|j}|j|j_|j|j_|j|_|jj|_||j_||j_||_y)aqMark a node as the newest, making it the new head. When a node is accessed, it becomes the freshest entry in the LRU list, which is denoted by self._head. Visually, let's make ``N`` the new head node (* denotes head): previous/oldest <-> head <-> next/next newest ----<->--- A* ---<->----- | | E <-> D <-> N <-> C <-> B To: ----<->--- N* ---<->----- | | E <-> D <-> C <-> B <-> A This requires the following moves: C.next = D (node.prev.next = node.next) D.prev = C (node.next.prev = node.prev) E.next = N (head.prev.next = node) N.prev = E (node.prev = head.prev) N.next = A (node.next = head) A.prev = N (head.prev = node) N)rrr)rNrheads r%rzlrucachedict._movetohead]sd:zz  II IINN    r'c|j}t}||j_|j|_||_||_|xjdz c_|S)zhAdd a node to the circular linked list. The new node is inserted before the head node. r)rrrrrm)rNr rs r%rzlrucachedict._addcapacitysJ zz II    a  r'c2t|dks|j|jkryt|jdz}|jj }|j tur|j }|j turt|dkDr|j|kDrr|j|j =|xj|jzc_|j|j }t|dkDr|j|kDrpyyyy)Nrg?) rwrrrrrrZrrrr)rN targetcostrs r%rzlrucachedict._enforcecostlimits t9>T^^t||; ,- JJOOeewAeew$i!m ; AEE" NNaff $N KKMA $i!m ;m ;mr'rrTr))rdrerfrgrRrrr_r[rrrrrrrrrrrrrr*r'r%rrsh,   %%N%, & >8-^ r'rcitjjjdk(r fd}|Sfd}|S)z+cache most recent results of function callsrc|vr+tdkDrj=||<nj|j||SNrwpopleftremover)rrrorders r%rzlrucachefunc..fsS%u:?emmo.!#Yc  S! LL : r'c|vr(tdkDrj=||<nj|j||Srr)rrrrs r%rzlrucachefunc..fsS5 u:?emmo."Dkd  T" LL ; r') collectionsdequerr)rrrrs` @@r% lrucachefuncrs@ E    E }}  A% , H  Hr'c eZdZdZddZdZy) propertycachec4||_|j|_yrT)rrdr)rNrs r%rRzpropertycache.__init__s MM r'NcL|j|}|j|||SrT)r cachevalue)rNobjtypers r%__get__zpropertycache.__get__s"3 V$ r'c6||j|j<yrT)__dict__r)rNrrs r%rzpropertycache.cachevalues"' TYYr'rT)rdrerfrRr rr*r'r%rrs" (r'rcftj|}||jvr|j|=yy)z2clear a cached property value, if one has been setN)rr9r")rprops r%clearcachedpropertyr%s- ??4 D s|| LL r'c#Kd}g}d}|D]a}|j||t|z }||k\s(||kr|dz}d||z}||kDr|}||kDr|}dj|d}g}c|rdj|yyw)zrreturn no less than min bytes per chunk while data remains, doubling min after each chunk until it reaches maxc4|syd}|r |dz}|dz }|r |dz S)Nrrr*)xrs r%log2zincreasingchunks..log2s2  !GA FA1u r'rrr'N)rrwr)sourcerrr*rblenchunknmins r%increasingchunksr/s C D 5 E  3;SyQhDJ#:C9C((3- DC hhsm s 1BABcy)NTr*rs r%alwaysr2s r'cyNFr*r1s r%neverr5s r'cfd}|S)a disable garbage collector Python's garbage collector triggers a GC each time a certain number of container objects (the number being defined by gc.get_threshold()) are allocated even when marked not to be tracked by the collector. Tracking has no effect on when GCs are triggered, only on what objects the GC looks into. As a workaround, disable GC while building complex (huge) containers. This garbage collector issue have been fixed in 2.7. But it still affect CPython's performance. ctj}tj |i||rtjSS#|rtjwwxYwrT)gc isenableddisableenable)rr gcenabledrs r%wrapperznogc..wrapper'sLLLN   (( y s A A#r*rr=s` r%nogcr?s Nr'c|SrTr*r)s r%rr5sQr'c|s t|Stjj|rtjj |dtjj |dk7r)tjj |t|Sdj t ||f}t||jd}}|j|j|r=|r;|d|dk(r0|j|j|r|r |d|dk(r0|jtjj dgt|z|zxsdS)aareturn the relative path from one place to another. root should use os.sep to separate directories n1 should use os.sep to separate directories n2 should use "/" to separate directories returns an os.sep-separated path. If n1 is a relative path, it's assumed it's relative to root. n2 should always be relative to root. r/r..r) localpathr!pathisabs splitdriverpconvert splitpathrreverserrosseprw)rootn1n2abs r%pathtorR8s } ww}}R 77  d #A &"''*<*.settopics .6Qz]AjMHN r'NFr)r!rFisdirrst_devrqmkdirlistdirr copyfilesrtrurrrvrwr{r increment) rdstrrnumrrkindsrcnamedstnamerrs `` r%rrs CJ ww}}S   ##rwwrwws/C'D'K'KK     !#,JD$ggll3-Gggll3-G#GWhIKHa 1HC '6 S=+  ,-4477277??3/0778    &sC  KKS ! q     S=W% &99 ,$H C%%  &s GH"#5HH">auxconnulprncom1com2com3com4com5com6com7com8com9lpt1lpt2lpt3lpt4lpt5lpt6lpt7lpt8lpt9s:*?"<>|c|jdr tdSd|vr tdS|jddjdD]}|st |D]O}|t vrtd|zccSt |dks,tdtj|zccS|jd d }|r&|jtvrtd|zcS|d d }|d vs|dvstd|zcSy )aUCheck that the base-relative path is a valid filename on Windows. Returns None if the path is ok, or a UI string describing the problem. >>> checkwinfilename(b"just/a/normal/path") >>> checkwinfilename(b"foo/bar/con.xml") "filename contains 'con', which is reserved on Windows" >>> checkwinfilename(b"foo/con.xml/bar") "filename contains 'con', which is reserved on Windows" >>> checkwinfilename(b"foo/bar/xml.con") >>> checkwinfilename(b"foo/bar/AUX/bla.txt") "filename contains 'AUX', which is reserved on Windows" >>> checkwinfilename(b"foo/bar/bla:.txt") "filename contains ':', which is reserved on Windows" >>> checkwinfilename(b"foo/bar/b\07la.txt") "filename contains '\\x07', which is invalid on Windows" >>> checkwinfilename(b"foo/bar/bla ") "filename ends with ' ', which is not allowed on Windows" >>> checkwinfilename(b"../bar") >>> checkwinfilename(b"foo\\") "filename ends with '\\', which is invalid on Windows" >>> checkwinfilename(b"foo\\/bar") "directory name ends with '\\', which is invalid on Windows" \s3filename ends with '\', which is invalid on Windowss\/s9directory name ends with '\', which is invalid on WindowsrCs4filename contains '%s', which is reserved on Windowss3filename contains '%s', which is invalid on WindowsrrrNs. rDs8filename ends with '%s', which is not allowed on Windows) endswithrLreplacer_filenamebytestr_winreservedcharsordrrKlower_winreservednames)rFrcbasets r%checkwinfilenamer s*2 }}UHII ~NOO \\% & , ,T 2 !!$A%%& 1v|J((+,,%wwt}Q DJJL$55IJ  bcF :!5."  13r' perf_counterc tj||S#t$r(}|jtjk(rYd}~nd}~wt $rYnwxYwtj tjztjzttddz}tj||}tj||tj|y)zCreate a lock file atomically if possible This may leave a stale lock file if symlink isn't supported and signal interrupt is enabled. NO_BINARYr) r!ryrrrvrwAttributeErrorO_CREATO_WRONLYO_EXCLrrrr)infopathnamewhyrmlds r%makelockrWs  zz$))  99 $  %     JJ $ryy 072z13M ME 5 !BHHRHHRLs AA AAc t|S#t$r7}|jtjtjfvrYd}~nd}~wt $rYnwxYwt |d5}|jcdddS#1swYyxYwNrb)rzrrrvEINVALENOSYSr posixfilerv)rrrs r%readlockrkso !!  99U\\5<<8 8  9    8U #rwwy $ # #s& A-A AA&BB c tj|jS#t$r"tj|j cYSwxYw)z1stat file object that may not have fileno method.)r!rrrrrrs r%rrxs> xx $$  wwrww s"%(AAc^tj|}tjj|\}}|j }||k(r|j }||k(rytjj ||} tj|}||k(ryy#t$rYywxYw)z Return true if the given path is on a case-sensitive filesystem Requires a path (like /foo/.hg) ending with a foldable final directory component. TF)r!lstatrFrupperrrrr)rFs1drQb2p2s2s r%fscasesensitivers $B 77== DAq BBw WWY 7 a B XXb\ 8 sB B,+B,c|SrTr*rAs r%rrsqr'cBttjtS)z0return True is re2 is available, False otherwise)_re2_re _checkre2r*r'r%has_re2rs |  Kr'c4eZdZedZddZedZy)rcBtyd}d} ttj||ay#t$rdaYyt $r\t j|}t j|}ttj||at jaYywxYw)Ns \[([^\[]+)\]s[ui]F) rrre2rrrUrr9 _re2_input) check_pattern check_inputs r%rz _re._checkre2s   (   ) -=>D D )%OOM:M"//+6K -=>D!J  )s- BA!BBct|jtrw|tjtjzzdk(rO|tjzrd|z}|tjzrd|z} t j t|Stj ||S#t j$rY+wxYw)zCompile a regular expression, using re2 if possible For best performance, use only re2-compatible regexp features. The only flags from the re module that are re2-compatible are IGNORECASE and MULTILINE.rs(?i)s(?m)) rrr IGNORECASE MULTILINErcompilerr )rNpatrms r%rz _re.compiles < NN  Uu//%//ABBqHu'''mu&m {{:c?33}}S%((99  s6B**C?Cczt|jtrtjStjS)zReturn the version of escape corresponding to self.compile. This is imperfect because whether re2 or re is used for a particular function depends on the flags, etc, but it's the best we can do. )rrrescaperr^s r%rz _re.escapes* < NN  :: << r'Nr)rdrerfrhrrrrr*r'r%rrs-)),)&    r'rcd}tj}tjr|tjz}|jddt j d||fz}t jj|}g}|j|D]\}}|r|j||tvr||t|<t|} | j|} | s"||xt|<} | j|} |j| xs|t jj||}dj|S)a4Get name in the case stored in the filesystem The name should be relative to root, and be normcase-ed for efficiency. Note that this function is unnecessary, and should not be called, for case-sensitive filesystems (simply because it's expensive). The root should be normcase-ed, too. cftj|Dcic]}t||c}Scc}wrT)r!rnormcase)dirrs r%_makefspathcacheentryz%fspath.._makefspathcacheentrys*(* 381 Q888s.rs\\s([^%s]+)|([%s]+)r')rrLosaltseprrrr!rFnormpathfindallr _fspathcacherr) rrMrsepspatternrrpartsepcontentsfounds r%fspathrs9 >>Dh'''LL mm0D$<?@G ''  4 C F__T* c  MM#   l " 5c :L $ T",A+E EL LL&E emt$ggll3%#+& 88F r'cd\}}} tjdtjj |zdtjj |\}}tj |d|ddz}t||t|}t|dkD||j ||fD]} |tj|S#t$rY)wxYw#t$rEY||j ||fD])} |tj|#t$rY'wxYwy wxYw#||j ||fD])} |tj|#t$rY'wxYwwxYw) z5check whether hardlink count reporting works properly)NNN.%s-s1~prefixsuffixrs%s2~NrF) rmkstempr!rFbasenamerqrrtrnlinksrorr)testfilef1f2rrrs r% checknlinkr sr "JBB!!RWW--h77) B  r#2w r2r]bzA~ > HHJbA =IIaL    > HHJbA =IIaL     > HHJbA =IIaL   slBC$;C C! C!$ D2-D5D  D,+D,1D22D55E9E('E9( E4 1E93E4 4E9ct|jtjxs1tjxr|jtjS)z)Check path ends with os.sep or os.altsep.)rrrrLrrFs r% endswithsepr; sF  hnn% -    - MM(++ , r'c@|jtjS)zSplit path by os.sep. Note that this function does not use os.altsep because this is an alternative of simple "xxx.split(os.sep)". It is recommended to use os.path.normpath() before using this function if need.)rrrLrs r%rJrJE s ::hnn %%r'cttjj|\}}tjd|zd|\}}tj |t |||||r|S t|d}t|d} t|D]} | j| |j | j |S#t$r>} | jtjk(r|cYd} ~ St| dds|| _ d} ~ wwxYw# tj|#t $rYwxYwxYw)aCreate a temporary file with the same contents from name The permission bits are copied from the original file. If the temporary file is going to be truncated immediately, you can use emptyok=True as an optimization. Returns the name of the temporary file. r~rrNfilenamewb)r!rFrrr rr~rrurvENOENTrr filechunkiterrrorr) remptyok createmodeenforcewritablerrrtempifprofpr-s r% mktempcopyr!O s GGMM$ EArw|DaHHBHHRL T4_5  D%(Ce$"3'E IIe (   K# zzU\\) 4T2 $     IIdO     sa* C6A D D D,D -D2DD  DD7D('D7( D41D73D44D7cfeZdZdZdZedZedZejZ dZ dZ dZ dZ y ) rmzhelp to exactly detect change of a file 'stat' attribute is result of 'os.stat()' if specified 'path' exists. Otherwise, it is None. This can avoid preparative 'exists()' examination on client side of this class. c||_yrT)r)rNrs r%rRzfilestat.__init__ s  r'c` tj|}||S#t$rd}YwxYwrT)r!rFileNotFoundError)rrFrs r%rnzfilestat.frompath s6 774=D4y! D s  --cXtj|j}||SrT)r!rr)rrrs r%fromfpzfilestat.fromfp s xx $4yr'c |jj|jjk(xrx|jtj|jtjk(xr;|jtj|jtjk(S#t$rYnwxYw |jduxr|jduS#t$rYywxYwr4)rrST_CTIMErrrNolds r%__eq__zfilestat.__eq__ s   !!SXX%5%55HIIdmm,0GGHIIdmm,0GG      99$9T)9 9  s$B&B)) B54B59C C#"C#c |jtj|jtjk(S#t$rYywxYw)aExamine whether new (= self) stat is ambiguous against old one "S[N]" below means stat of a file at N-th change: - S[n-1].ctime < S[n].ctime: can detect change of a file - S[n-1].ctime == S[n].ctime - S[n-1].ctime < S[n].mtime: means natural advancing (*1) - S[n-1].ctime == S[n].mtime: is ambiguous (*2) - S[n-1].ctime > S[n].mtime: never occurs naturally (don't care) - S[n-1].ctime > S[n].ctime: never occurs naturally (don't care) Case (*2) above means that a file was changed twice or more at same time in sec (= S[n-1].ctime), and comparison of timestamp is ambiguous. Base idea to avoid such ambiguity is "advance mtime 1 sec, if timestamp is ambiguous". But advancing mtime only in case (*2) doesn't work as expected, because naturally advanced S[n].mtime in case (*1) might be equal to manually advanced S[n-1 or earlier].mtime. Therefore, all "S[n-1].ctime == S[n].ctime" cases should be treated as ambiguous regardless of mtime, to avoid overlooking by confliction between such mtime. Advancing mtime "if isambig(oldstat)" ensures "S[n-1].mtime != S[n].mtime", even if size of a file isn't changed. F)rr)rr*s r%rzfilestat.isambig s>< 99T]]+sxx /FF F  s:= A A c|jtjdzdz} tj|||fy#t$rYywxYw)aLChange file stat of specified path to avoid ambiguity 'old' should be previous filestat of 'path'. This skips avoiding ambiguity, if a process doesn't have appropriate privileges for 'path'. This returns False in this case. Otherwise, this returns True, as "ambiguity is avoided". rrkFT)rrr!rPermissionError)rNrFr+rs r% avoidambigzfilestat.avoidambig sSHHT]]+a/:=  HHTHh/ 0    s> A  A c||k( SrTr*)rNothers r%__ne__zfilestat.__ne__ s5=  r'N)rdrerfrgrR classmethodrnr'r__hash__r,rr0r3r*r'r%rmrmz sTH"!F(!r'rmc6eZdZdZd dZdZdZdZdZdZ y) atomictempfileawritable file object that atomically updates a file All writes will go to a temporary copy of the original file. Call close() when you are done writing, and atomictempfile will rename the temporary copy to the original name, making the changes visible. If the object is destroyed without being closed, all your writes are discarded. checkambig argument of constructor is used with filestat, and is useful only if target file is guarded by any lock (e.g. repo.lock or repo.wlock). Nc||_t|d|v|d|v|_t|j||_||_|jj |_|jj|_|jj|_|jj|_ |jj|_ |jj|_ y)Nw)rrr) _atomictempfile__namer! _tempnamer_fp _checkambigrvrrrrr)rNrrirrs r%rRzatomictempfile.__init__ s # T\!!T\  T^^T2%HHMM XX^^ ((--HHMM HHMM hhoo r'c|jjs|jjt|j}|j xrt j|}|r|jryt|j|t j|}|j|r<|jtjdzdz}tj|||fyyt|j|yy)Nrrk)r<rrrEr:r=rmrnrrenamer;rrr!r)rNrrrrs r%rzatomictempfile.close sxx HHNN  -H&&F8+<+t|dr|jyy)Nr<) safehasattrrAr^s r%__del__zatomictempfile.__del__ s tU # LLN $r'c|SrTr*r^s r%rzatomictempfile.__enter__ rr'cJ||jy|jyrT)rAr)rNexctypeexcvaluerVs r%rzatomictempfile.__exit__ s   LLN JJLr')sw+bNF) rdrerfrgrRrrArDrrr*r'r%r7r7 s% &( 1r'r7c t|y#t$rJ}|jtjk7r#|jtjk7rYd}~yYd}~yd}~wwxYwrT) removedirsrrrvr ENOTEMPTY)res r%tryrmdirrM' sI1  77ell "qww%//'A (B "s  A!;AA!c|r t|n t||r* ttjj |yy#t $rYywxYw)z.unlink and remove the directory if it is emptyN) tryunlinkrorJr!rFrqrr)r ignoremissingrmdirs r% unlinkpathrR/ sK! q    rwwq) *    s(A AAc: t|y#t$rYywxYw)z5Attempt to remove a file, ignoring FileNotFoundError.N)ror%)rs r%rOrO> s  q    s  c t|||t j||yy#t$r}|jtjk(rYd}~y|jtjk7s|st j jt|}||k(rt||| t||n8#t$r,}|jtjk(r Yd}~Yd}~yd}~wwxYwYd}~d}~wwxYw)zrecursive directory creation with parent mode inheritance Newly created directories are marked as "not to be indexed by the content indexing service", if ``notindexed`` is specified for "write" mode access. N) makedirrrrvrwrr!rFrqabspathmakedirschmod)rri notindexederrparents r%rWrWG sj!"  t!  99 $  99 $D / T> z*  D* % yyELL(    &sK ( C>C9AC9/ B<;C9< C1C,"C9+C,,C11C99C>cft|d5}|jcdddS#1swYyxYwr)rrv)rFrs r%readfiler]e s# dE bwwy   s'0cht|d5}|j|dddy#1swYyxYw)NrrrrFtextrs r% writefilerbk % dE b    (1cht|d5}|j|dddy#1swYyxYw)Nsabr_r`s r% appendfilerfq rcrdceZdZdZdZddZy) chunkbufferzoAllow arbitrary sized chunks of data to be efficiently read from an iterator over chunks of arbitrary size.cdd}|||_tj|_d|_y)z?in_iter is the iterator that's iterating over the input chunks.c3K|D]C}t|dkDr/d}|t|ks"|dz}||||}|t|kr@|Eyw)Nrrw)chunksr-posends r%splitbigz&chunkbuffer.__init__..splitbig~ s\u:'CE *!Gm#Cn,!E *  K s$A A A rN)r]rr_queue _chunkoffset)rNin_iterrqs r%rRzchunkbuffer.__init__{ s- W% !'') r'Nc|dj|jS|}g}|j}|dkDr|s*$%! 5&4-89!!T)!&[Qh^xx}r'rT)rdrerfrgrRrvr*r'r%rhrhw s/$:r'rhc#K|dk\sJ||dk\sJ ||}n t||}|xr|j|}|sy|r|t|z}|>w)aYCreate a generator that produces the data in the file size (default 131072) bytes at a time, up to optional limit (default is to read all data). Chunks may be less than size bytes if the chunk is the last chunk in the file, or the file is a socket or some other type of file that sometimes reads less data than is requested.rN)rrvrw)rrtrWnbytesrPs r%rr sp 199 =EQJ& &  =F%F  %qvvf~   SVOE sAAc$eZdZdZdZddZdZy) cappedreaderaA file object proxy that allows reading up to N bytes. Given a source file object, instances of this type allow reading up to N bytes from that source file object. Attempts to read past the allowed limit are treated as EOF. It is assumed that I/O is not performed on the original file object in addition to I/O that is performed by this instance. If there is, state tracking will get out of sync and unexpected results will ensue. c ||_||_y)z,Allow reading up to bytes from .N)rl_left)rNrsrWs r%rRzcappedreader.__init__ s r'c|jsy|dkr |j}|jjt||j}|xjt |zc_|jdk\sJ|S)Nr'r)rrlrvrrw)rNrrVs r%rvzcappedreader.read s`zz q5 Axx}}SDJJ/0 c$i zzQ r'cn|jt|}|y||dt|t|Sr))rvrw)rNrQrs r%rzcappedreader.readinto s4iiA ;!c#h3xr'Nr)rdrerfrgrRrvrr*r'r%rr s  r'rcfd}|S)z@return a function that renders a readable count of some quantitycxD]*\}}}t|||zk\s||t|z zcSdd|zS)Nrr)absfloat)count multiplierdivisorformat unittables r%gozunitcountfn..go sO+4 'J5zWz11w!788,5}Q%''r'r*)rrs` r% unitcountfnr s( Ir'c||z dkrtjtd|dkrtjtd|dz |fS)aCheck that linerange : makes sense and return a 0-based range. >>> processlinerange(10, 20) (9, 20) >>> processlinerange(2, 1) Traceback (most recent call last): ... ParseError: line range must be positive >>> processlinerange(0, 5) Traceback (most recent call last): ... ParseError: fromline must be strictly positive rsline range must be positivers"fromline must be strictly positive)r ParseErrorrL)fromlinetolines r%processlineranger sU 1q!?@AA!|q!FGHH a< r'd@s%.0f GB s%.1f GBs%.2f GBrks%.0f MBs%.1f MBs%.2f MBs%.0f KBs%.1f KBs%.2f KBs %.0f bytesc(eZdZdZdZdZdZdZy)transformingwriterz3Writable file wrapper to transform data by functionc ||_||_yrT)r<_encode)rNrencodes r%rRztransformingwriter.__init__; s r'c8|jjyrT)r<rr^s r%rztransformingwriter.close?  r'c8|jjyrT)r<r=r^s r%r=ztransformingwriter.flushB rr'cV|jj|j|SrT)r<rr)rNrVs r%rztransformingwriter.writeE sxx~~dll4011r'N)rdrerfrgrRrr=rr*r'r%rr8 s=2r'rs\r*\nc.tjd|S)Nr_eolresubrPs r%tolfrO s ::eQ r'c.tjd|S)N rrs r%tocrlfrT s ::gq !!r'c"t|tSrT)rrrs r% _crlfwriterrY s b& ))r'rc|SrTr*rs r%iterfilerh s Ir'c#LK|D]}|jD]}|ywrT)rL)iteratorr-rNs r% iterlinesrl s($$&DJ's"$cztjjtjj|SrT)r!rF expanduser expandvarsrs r% expandpathrs s& 77  bgg006 77r'cxsddjj}|r#|d|zz }t|dkDr|dd}n|}||<tjd||fz}|j fd|S)aReturn the result of interpolating items in the mapping into string s. prefix is a single character string, or a two character string with a backslash as the first character if the prefix needs to be escaped in a regular expression. fn is an optional function that will be applied to the replacement text just before replacement. escape_prefix is an optional flag that allows using doubled prefix for its escaping. c|SrTr*rs r%rzinterpolate.. s!r'|rNs%s(%s)c<|jddS)Nr)r)r)rmappings r%rzinterpolate.. s2gaggim45r')rrqrwrrr)rrrPr escape_prefixpatterns prefix_charrs ` ` r% interpolaterx s  Byy(HD6M! v;? *K K*  jFH#556A 555q 99r'g@@s%.0f ss%.1f ss%.2f ss%.3f sgMbP?s%.1f mss%.2f mss%.3f msgư>s%.1f uss%.2f uss%.3f usg& .>s%.1f nss%.2f nss%.3f nsceZdZdZej ej dZej dZej dZ dZ e je Z y) timedcmstatszFStats information produced by the timedcm context manager on entering.ctSrT)timerr*r'r%rztimedcmstats. sr')r/rrcH|jrt|jSdS)Ns )elapsed timecountr^s r% __bytes__ztimedcmstats.__bytes__ s*.,,y&HLHr'N)rdrerfrgribFactorystartrrrr strmethod__str__r*r'r%rr s^P DGGLDLL9 :Edgga G DGGA EI!h  +Gr'rc'Ktxjdz c_ttj} tj|g|5|dddt |j z |_txjdzc_y#1swY?xYw#t |j z |_txjdzc_wxYww)zA context manager that produces timing information for a given context. On entering a timedcmstats instance is produced. This context manager is reentrant. r)rN)timedcm_nestedrr logrrr) whencefmt whenceargs timing_statss r%rr s OOqOgoo6L [[ 0Z 0 1 %w););; 1 1 0 %w););; 1s44CB BB6CBB7CCcfd}|S)zReport the execution time of a function call to stderr. During development, use as a decorator when you need to measure the cost of a function, e.g. as follows: @util.timed def foo(a, b, c): pass c:ttjj5}|i|}dddtj }|j ddjzdztjj|fzS#1swY_xYw)Ns %s%s: %s  r)rrbytestrrdrr<rr)rr time_statsrr<rs r%r=ztimed..wrapper s X%%dmm4 54*6*F6 z'''!+  /   6 5s BBr*r>s` r%timedr s  Nr'))mrk)kr&)gr)skbr&)smbrk)sgbr)brc <|jj} tD]<\}}|j|st t |dt | |zcSt |S#t$r"tjtd|zwxYw)zConvert a space specifier to a byte count. >>> sizetoint(b'30') 30 >>> sizetoint(b'2.2kb') 2252 >>> sizetoint(b'6M') 6291456 Nscouldn't parse size: %s) stripr _sizeunitsrrrrwrr rrL)rPrrQus r% sizetointr s  ABDAqzz!}59c!fW.2331v Bq!;|jj||fyrT)rr)rNr+hooks r%addz hooks.add s FD>*r'c|jjdg}|jD]\}}|j|||S)Nc |dSr)r*rAs r%rz hooks.__call__.. sqtr')rZ)rsortr)rNrresultsr+rs r%__call__zhooks.__call__ sC ^, KKLFD NN4; '(r'N)rdrerfrgrRrrr*r'r%rr s,+r'rc #LKtjd| dz Dcgc]6\}}}}|tj||fztj|f8c}}}}| d}|r1t d|D} |D]\} }|| | |f|| | |fzyycc}}}}ww)aYields lines for a nicely formatted stacktrace. Skips the 'skip' last entries, then return the last 'depth' entries. Each file+linenumber is formatted according to fileline. Each line is formatted according to line. If line is None, it yields: length of longest filepath+line number, filepath+linenumber, function Not be used in production code but very convenient while developing. Nrc38K|]}t|dywrNrm).0entrys r% z!getstackframes..- s7weCaMws)rV extract_stackrsysbytesr) skiprNfilelinerZrlnr_textentriesfnmaxfnlns r%getstackframesr s$-#:#:#<[uqy#I#I BD% X&&r*B/ /1B1B41HI#I fgG7w77!JD$|dD))eT4000 " s!B$;B AB$s stacktracer'c|r|j|jd||jfzt|dz|D]}|j||z|jy)aWWrites a message to f (stderr) with a nicely formatted stacktrace. Skips the 'skip' entries closest to the call, then show 'depth' entries. By default it will flush stdout first. It can be used everywhere and intentionally does not require an ui object. Not be used in production code but very convenient while developing. s %s%s at: r)rZN)r=rrstripr)r>rrotherfrZrrNs r%debugstacktracer5 sZ GGMVSZZ\2 23taxu5  6GGIr'c| t}d||fz}||vr||vr|StjdD]}d|||fz}||vs||vs|cSy)a Generate a name that it is safe to rename f to in the given context. f: filename to rename tag: a string tag that will be included in the new name ctx: a context, in which the new name must not exist others: a set of other filenames that the new name must not be in Returns a file name of the form oldname~tag[~number] which does not exist in the provided context and is not in the set of other names. Ns%s~%srs%s~%s~%s)set itertoolsr)rtagctxothersrrs r%safenamerO sg~ QH B }6) __Q  AsA; & S=Rv-I r'c|j|}t||kr,tjt dt||fz|S)z=read n bytes from stream.read and abort if less was availables5stream ended unexpectedly (got %d bytes, expected %d))rvrwr rKrL)streamrrPs r% readexactlyr g sK AA 1vzkk F G1vqk    Hr'c*|dkrtjd|z|dz}|dz}g}|r4|jtjd|z|dz}|dz}|r4|jtj|dj |S)aiEncode an unsigned integer value to a varint. A varint is a variable length integer of 1 or more bytes. Each byte except the last has the most significant bit set. The lower 7 bits of each byte store the 2's complement representation, least significant group first. >>> uvarintencode(0) '\x00' >>> uvarintencode(1) '\x01' >>> uvarintencode(127) '\x7f' >>> uvarintencode(1337) '\xb9\n' >>> uvarintencode(65536) '\x80\x80\x04' >>> uvarintencode(-1) Traceback (most recent call last): ... ProgrammingError: negative value for uvarint: -1 rsnegative value for uvarint: %dr')r rrrbytechrr)rr,bytess r% uvarintencoderr s. qy$$%F%NOO 4>> from io import BytesIO >>> uvarintdecodestream(BytesIO(b'\x00')) 0 >>> uvarintdecodestream(BytesIO(b'\x01')) 1 >>> uvarintdecodestream(BytesIO(b'\x7f')) 127 >>> uvarintdecodestream(BytesIO(b'\xb9\n')) 1337 >>> uvarintdecodestream(BytesIO(b'\x80\x80\x04')) 65536 >>> uvarintdecodestream(BytesIO(b'\x80')) Traceback (most recent call last): ... Abort: stream ended unexpectedly (got 0 bytes, expected 1) rrr rr )rr )rsrshiftbytes r%uvarintdecodestreamr sO*F E ;r1%&4$;5((t M   r'c#Ktjtjd}|dk(rO tjtjddtjtj|ydy#tj$rYCwxYw#tjtj|wxYww)NCr0)locale setlocaleLC_CTYPEr)oldlocs r% with_lc_ctyper s   foot 4F } 6   "5    V__f 5 <<     V__f 5s:*C$BB*CBBBB&B??Cc tjjdrcddlmm ddlm}m}m }m }G fdd|}|}|||_ |jj|||jS tj tj"d}tj tj"d}||zS#t$$rYy t&$rYy wxYw) zProvide an estimate for the available system memory in Bytes. If no estimate can be provided on the platform, returns None. swinr)c_long c_ulonglong) Structurebyrefsizeofwindllc ZeZdZdWfdWfdWfdWfdWfdWfdWfdWfd Wfg Zy ) '_estimatememory..MEMORYSTATUSEXdwLength dwMemoryLoad ullTotalPhys ullAvailPhysullTotalPageFileullAvailPageFileullTotalVirtualullAvailVirtualullExtendedVirtualN)rdrerf_fields_)DWORD DWORDLONGsr%MEMORYSTATUSEXr% sRU#'++#Y/#Y/"I."I.%y1 Hr'r2 SC_PAGE_SIZE SC_PHYS_PAGESN)r sysplatform startswithctypesrrctypes.wintypesr r!r"r#r&kernel32GlobalMemoryStatusExr)r!sysconf sysconf_namesrrr) r r!r"r#r2r)pagesizepagesr0r1s @@r%_estimatememoryr? s &&v.D   Y   AY ,,U1X6~~  ::b..~>? 2++O<=%      sAC C-"C-,C-)rrrTr`r)Nr)r&i)FFFNNTr)FNF)FTr4)iN)rs %-*s in %s s%s:%dr)rgrr contextlibrvr8hashlibiorrrr!picklererr{rr;timerVr7rr thirdpartyrrrrrr hgdemandimportr r0r r r rrutilsrrrr TYPE_CHECKINGtypingrrrrr importmodrr b85decode b85encode cookielibhttplibrC socketserverBytesIObytesiostringio xmlrpclib httpserverurlerrurlreqrrr rr#rrLrVbindunixsocket cachestat checkexec checklinkr~ expandglobsgetfsmountpointrp get_password groupmembers groupnameisexecisownerrrE lookupregrUr rr normcasespecnormcasefallback openhardlinksrtparsepatchoutputrIpollrrzr?rJ samedevicesamefilesamestatsetflagsrr statisexec statislinkr"rousernamer& compengines SERVERROLE CLIENTROLErrr.renvironrr6filterwarningsr:rAmd5sha1sha512rJrarQrFrjr NameErrorrrrrrr/r+rHrQr:rdrr?rrr OrderedDictrrorrrcontextmanagerrrrrrrr%r/r2r5r?rrRr\rsr|rrrrrcheckosfilenameclockrrrrrrrrrrrrrrrJr!rmr7rMrRrOrWr]rbrfrhrrrr bytecountrrrrrr oslinesep tonativeeol fromnativeeolnativeeolwriteridentityrrrrrrPrrrrrrrrr<stdoutrrrr rrrr?r*r'r%rs       #    ( #   ( #            "" $$ **      $ $      ## %#FF   ((            "" **    $$ $$        ..                $$ ,,&& ,,   }}                   FK);); <       )%%  # #  # #  ( x##$56 7 HIr+={KHIr+=wGHIr+=zJ H, 2KH+-?H&   KK ]]~~  3 A << --`""J. F kk\$o o d' 1'T  x x v""Ja*aJIM ) D &D V    %0TJn >(${&&$Nc46#x6 $ 0iiX  > ( (B4 ?? D?8 (  M=`*Z0;| nd+ &O  ..O  (  2  D 8 8 v U *ZD&(Vc!c!LDDN  <   PPf,$$N  . '1Z=!!J- :'1Z=!!J- :'1Z=!!J- :1]   22( y ! " *  KM!O##K%%M''O8 :4 Qy\!Qy\AiL1Y<%:* q}(AjM"1Z=!!J- +q}%a m$ Qz]#  ",,,$ &8 B*&14  oo ??  .0 "JT ", m\...H; Ds$/b&<b6& b32b36cc