korsygfhrtzangaiide
Elepffwdsff
/
lib64
/
python2.7
/
site-packages
/
mercurial
/
Upload FileeE
HOME
� Hq�Qc @ s� d Z d d l m Z m Z m Z m Z d d l m Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l Z e j Z e j Z e j Z e j Z e j Z d Z d Z d Z d Z e Z e Z e e BZ! e e BZ" d Z# d Z$ d Z% e j& Z& e j' Z' d � Z( d � Z) d � Z* e e � Z+ d � Z, d � Z d Z- d Z. d e/ f d � � YZ0 d Z1 d Z2 d Z3 d e/ f d � � YZ4 d e/ f d � � YZ5 d S( s� Storage back-end for Mercurial. This provides efficient delta storage with O(1) retrieve and append and O(changes) merge between branches. i����( t bint hext nullidt nullrev( t _Ni i i i i i c C s t | d ?� S( Ni ( t int( t q( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt getoffset. s c C s t | d @� S( Ni�� ( R ( R ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt gettype1 s c C s t t | � d >| B� S( Ni ( t long( t offsett type( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt offset_type4 s c C sv | t k r( t j � } | j | � n7 | | g } | j � t | d � } | j | d � | j | � | j � S( s� generate a hash from the given text and its parent hashes This hash combines both the current file contents and its history in a manner that makes it easy to distinguish nodes with the same content in the revision graph. i i ( R t nullhasht copyt updatet sortt _shat digest( t textt p1t p2t st l( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt hash9 s c C s� | s | S| d } | d k r$ | S| d k rv y t | � SWqv t j k rr } t t d � t | � � � qv Xn | d k r� | d St t d � | � � d S( s decompress the given input i t t xs revlog decompress error: %st ui s unknown compression type %rN( t _decompresst zlibt errort RevlogErrorR t str( R t tt e( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt decompressN s # s >4l20s20s20si8 t revlogoldioc B s# e Z d � Z d � Z d � Z RS( c C s t j t � | _ d S( N( t structt calcsizet indexformatv0t size( t self( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt __init__j s c C s% | j } g } i t t 6} d } } t | � } x� | | | k r� | | | | !} | | 7} t t | � } t | d d � | d d | d | d | j | d t � | j | d t � | d f } | j | � | | | d <| d 7} q5 W| j d d d d d d d t f � | | d f S( Ni i i����i i i i i ( R( R R t lent _unpackR' R t gett appendt None( R) t datat inlineR t indext nodemapt nt offR t curR" t e2( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt parseindexm s (3 %c C s{ t | d � r% t t d � � � n t | d � | d | d | d | | d � | | d � | d f } t t | � S( Ni s index entry flags need RevlogNGi i i i i i ( R R R R t _packR' ( R) t entryt nodet versiont revR7 ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt packentry� s "'( t __name__t __module__R* R8 R> ( ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR$ i s s >Qiiiiii20s12xi s >It revlogioc B s# e Z d � Z d � Z d � Z RS( c C s t j t � | _ d S( N( R% R& t indexformatngR( ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR* � s c C s1 t j | | � \ } } | t | d d � | f S( NR3 ( t parserst parse_index2t getattrR/ ( R) R0 R1 R2 t cache( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR8 � s c C s9 t t | � } | d k r5 t t | � | d } n | S( Ni i ( R9 RB t versionformat( R) R: R; R< R= t p( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR> � s ( R? R@ R* R8 R> ( ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyRA � s t revlogc B s? e Z d Z d � Z d � Z d � Z d � Z d d9 d � Z e j d � � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z e Z d e d � Z d � Z d9 d9 d � Z d9 d9 d � Z d9 d9 d � Z d9 d9 d � Z d � Z! d � Z" d9 d9 d � Z# d � Z$ d � Z% d � Z& d! � Z' d" � Z( d# � Z) d$ � Z* d% � Z+ d& � Z, d' � Z- d( � Z. d) � Z/ d* � Z0 d+ � Z1 d, � Z2 d- � Z3 d. � Z4 d/ � Z5 d9 d0 � Z6 d9 d1 � Z7 d2 � Z8 d3 � Z9 d9 d4 � Z: d5 � Z; d6 � Z< d7 � Z= d8 � Z> RS(: sM the underlying revision storage object A revlog consists of two parts, an index and the revision data. The index is a file with a fixed record size containing information on each revision, including its nodeid (hash), the nodeids of its parents, the position and offset of its data within the data file, and the revision it's based on. Finally, each entry contains a linkrev entry that can serve as a pointer to external data. The revision data itself is a linear collection of data chunks. Each chunk represents a revision and is usually represented as a delta against the previous chunk. To bound lookup time, runs of deltas are limited to about 2 times the length of the original version data. This makes retrieval of a version proportional to its size, or O(1) relative to the number of revisions. Both pieces of the revlog are written to in an append-only fashion, which means we never need to rewrite a file to insert or remove data, and can use some simple techniques to avoid the need for locking while reading. c C s | | _ | d d | _ | | _ d | _ d | _ d | _ g | _ i | _ i t t 6| _ d | _ t } t | d d � } | d k r� d | k r� d | k r� | t O} q� q� d } n d } t | _ yd | j | j � } | j � } | j � t | � d k r0t j t | d � d } t | _ n Wn+ t k r^} | j t j k r_� q_n X| | _ | t @| _ | t @| _ | d @} | d @} | t k r�| r�t! t" d � | j | d ?f � � nk | t# k r | t$ @r t! t" d � | j | d ?f � � n. | t# k r9t! t" d � | j | f � � n t% � | _& | j t k rct' � | _& n y | j& j( | | j � } Wn0 t) t* f k r�t! t" d � | j � � n X| \ | _ } | _ | d k r�| | _+ | _ n | j s�| j, � n d S( s� create a revlog object opener is a function that abstracts the file opening operation and can be used to implement COW semantics or the like. i����s .di t t optionst revlogv1t generaldeltai i�� s* index %s unknown flags %#04x for format v0i s) index %s unknown flags %#04x for revlogngs index %s unknown format %ds index %s is corruptedN( i i ( i RJ i ��(- t indexfilet datafilet openerR/ t _cachet _basecachet _chunkcacheR2 t _pcacheR R t _nodecachet _nodepost REVLOG_DEFAULT_VERSIONRE t REVLOGGENERALDELTAt Truet _initemptyt readt closeR+ R% t unpackRG t Falset IOErrort errnot ENOENTR< t REVLOGNGINLINEDATAt _inlinet _generaldeltat REVLOGV0R R t REVLOGNGt REVLOGNG_FLAGSRA t _ioR$ R8 t ValueErrort IndexErrorR3 t _chunkclear( R) RP RN t vt optst it ft instt flagst fmtt dR3 ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR* � sn c C s | j t | j � d � S( Ni ( R; R+ R2 ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt tip s c C s t | j � d S( Ni ( R+ R2 ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt __len__ s c C s t t t | � � � S( N( t itert xrangeR+ ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt __iter__ s i c C sP d } | d k r4 | | k r' d } n | | 7} n t | � } t | | | � S( s8 iterate over all rev in this revlog (from start to stop)i i����N( R/ R+ Rw ( R) t startt stopt step( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt revs s c C s | j | j d � � | j S( Ni ( R= R; RU ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR3 s c C s. y | j | � t SWn t k r) t SXd S( N( R= RY t KeyErrorR^ ( R) R; ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt hasnode s c C sB y | j j � Wn* t k r= i t t 6| _ d | _ n Xd S( N( RU t clearcachest AttributeErrorR R R/ RV ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR ! s c C s� y | j | SWn� t k r= t | | j t d � � � n� t k r� | j } | j } | j } | d k r� t | � d } n xO t | d d � D]; } | | d } | | | <| | k r� | d | _ | Sq� Wt | | j t d � � � n Xd S( Ns no nodei i����i i ( RU R t LookupErrorRN R R} R2 RV R/ R+ Rw ( R) R; R4 Rn RH t rRl ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR= ( s" c C s | j | d S( Ni ( R2 ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR; = s c C s | j | d S( Ni ( R2 ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt linkrev? s c C s> | j } | | j | � } | | d d | | d d f S( Ni i i ( R2 R= ( R) R; Rn Rs ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt parentsA s c C s | j | d d !S( Ni i ( R2 ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt parentrevsE s c C s t | j | d d ?� S( Ni i ( R R2 ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyRy G s c C s | j | � | j | � S( N( Ry t length( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt endI s c C s | j | d S( Ni ( R2 ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� K s c C sB | j } | | d } x$ | | k r= | } | | d } q W| S( Ni ( R2 ( R) R= R2 t base( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt chainbaseM s c C s | j | d d @S( Ni i�� ( R2 ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyRq T s c C sC | j | d } | d k r! | S| j | j | � � } t | � S( s? return the length of the uncompressed text for a given revisioni i ( R2 t revisionR; R+ ( R) R= R R! ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt rawsizeV s c C s t j | | d | d | �S( s� Generate the ancestors of 'revs' in reverse topological order. Does not generate revs lower than stoprev. See the documentation for ancestor.lazyancestors for more details.t stoprevt inclusive( t ancestort lazyancestors( R) R| R� R� ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt ancestors` s c c s� t | � } | t k r2 x | D] } | Vq Wd St | � } xf | j d | d � D]N } xE | j | � D]4 } | t k rk | | k rk | j | � | VPqk qk WqU Wd S( s$ Generate the descendants of 'revs' in revision order. Yield a sequence of revision numbers starting with a child of some rev in revs, i.e., each revision is *not* considered a descendant of itself. Results are ordered by revision number (a topological sort).NRy i ( t minR t setR| R� t add( R) R| t firstRn t seenR ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt descendantsi s c sx | d k r t g } n | d k r3 | j � } n g | D] } | j | � ^ q: } g | D] } | j | � ^ q\ } t | j | � � � � j t � � j | � t � } t j � f d � | D� � } xk | r;| j � } | | k r� q� q� | j | � x3 | j | � D]" } | � k r| j | � qqWq� Wt | � } | j � � g | D] } | j | � ^ q\f S( s� Return a tuple of the ancestors of common and the ancestors of heads that are not ancestors of common. In revset terminology, we return the tuple: ::common, (::heads) - (::common) The list is sorted by revision number, meaning it is topologically sorted. 'heads' and 'common' are both lists of node IDs. If heads is not supplied, uses all of the revlog's heads. If common is not supplied, uses nullid.c 3 s! | ] } | � k r | Vq d S( N( ( t .0R� ( t has( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pys <genexpr>� s N( R/ R t headsR= R� R� R� R R t utilt dequet popleftR� R. t listR R; ( R) t commonR� R4 t missingt visitR� RH ( ( R� s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt findcommonmissing~ s, "" c C sI | d k r t g } n | d k r3 | j � } n t j | | | j � S( sx Return the revision numbers of the ancestors of heads that are not ancestors of common. More specifically, return a list of revision numbers corresponding to nodes N such that every N satisfies the following constraints: 1. N is an ancestor of some node in 'heads' 2. N is not an ancestor of any node in 'common' The list is sorted by revision number, meaning it is topologically sorted. 'heads' and 'common' are both lists of revision numbers. If heads is not supplied, uses all of the revlog's heads. If common is not supplied, uses nullid.N( R/ R t headrevsR� t missingancestorsR� ( R) R� R� ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt findmissingrevs� s c C s� | d k r t g } n | d k r3 | j � } n g | D] } | j | � ^ q: } g | D] } | j | � ^ q\ } g t j | | | j � D] } | j | � ^ q� S( s. Return the ancestors of heads that are not ancestors of common. More specifically, return a list of nodes N such that every N satisfies the following constraints: 1. N is an ancestor of some node in 'heads' 2. N is not an ancestor of any node in 'common' The list is sorted by revision number, meaning it is topologically sorted. 'heads' and 'common' are both lists of node IDs. If heads is not supplied, uses all of the revlog's heads. If common is not supplied, uses nullid.N( R/ R R� R= R� R� R� R; ( R) R� R� R4 R� ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt findmissing� s ""c C s� g g g f } | d k r\ t | � } | s1 | St g | D] } | j | � ^ q; � } n t g } t } | t k r� | d k r� g | D] } | j | � ^ q� t g t | j � � f S| d k r� t | � d } d } i } n�t | � } | s� | St � } t j | t � } t | � } t g | D] } | j | � ^ q-� } x� | r | j � } | t k rrqNn | j | � } | | k rN| | k r�| j | � | j g | j | � D] } | t k r�| ^ q�� q�| | k r�| j | � q�qNqNW| s | S| t k rtg | D] } | | k r | ^ q } | rmt g | D] } | j | � ^ qL� } q�| Sn t } t g } t | � } | j � } g } x�| j d t | d � d | d � D]z} | j | � } t } | t k r�t } n� | | k r`t } | | k r�t | j | � � } | d | k sJ| d | k r]| j | � q]q�nK t | j | � � } | d | k s�| d | k r�| j | � t } n | r�| d k s�| | k r�| j | � | d k r�| | k r�t | | <qA| d k rAt | | <x* | j | � D] } | j | d � q!WqAq�q�Wg | j � D] \ } } | rR| ^ qR} t | � } | | | f S( s� Return a topological path from 'roots' to 'heads'. Return a tuple (nodes, outroots, outheads) where 'nodes' is a topologically sorted list of all nodes N that satisfy both of these constraints: 1. N is a descendant of some node in 'roots' 2. N is an ancestor of some node in 'heads' Every node is considered to be both a descendant and an ancestor of itself, so every reachable node in 'roots' and 'heads' will be included in 'nodes'. 'outroots' is the list of reachable nodes in 'roots', i.e., the subset of 'roots' that is returned in 'nodes'. Likewise, 'outheads' is the subset of 'heads' that is also in 'nodes'. 'roots' and 'heads' are both lists of node IDs. If 'roots' is unspecified, uses nullid as the only root. If 'heads' is unspecified, uses list of all of the revlog's heads.i Ry i Rz N( R/ R� R� R= R R R; R� R+ R� t dictt fromkeysR^ t maxt popR� R R� R R| RY t tuplet removeR. t iteritems( R) t rootsR� t nonodesR4 t lowestrevR� t highestrevR� t nodestotagRH R� t orderedoutt isdescendantt flag( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt nodesbetween� s� + 8 ( %+ , + c C s0 y | j j � SWn t k r+ | j � SXd S( N( R2 R� R� t _headrevs( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� t s c C s� t | � } | s t g Sd g | d } | j } x< | D]4 } d | | <| | } d | | d <| | d <q: Wg t | � D] \ } } | r | ^ q S( Ni i i i ( R+ R R2 t enumerate( R) t countt isheadR2 R� R" t val( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� z s c C s� | d k rQ | d k rQ t | � s+ t g Sg | j � D] } | j | � ^ q8 S| d k rf t } n | d k r{ g } n t g | D] } | j | � ^ q� � } | j | � } t | f � } t | f � } | j } x� | j d | d � D]} } xt | | � D]f } | | k rA| | k r1| j | � n | j | � n | | k r| | k r| j | � qqWq� Wg | D] } | j | � ^ qxS( s return the list of all nodes that have no children if start is specified, only heads that are descendants of start will be returned if stop is specified, it will consider all the revs from stop as if they had no children Ry i N( R/ R+ R R� R; R� R= R� R| R� R� ( R) Ry Rz R� R4 t stoprevst startrevt reachableR� R� RH ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� � s, & ( c C s� g } | j | � } x� | j d | d � D]� } g | j | � D] } | t k rB | ^ qB } | r� x[ | D]+ } | | k rm | j | j | � � qm qm Wq, | t k r, | j | j | � � q, q, W| S( s! find the children of a given nodeRy i ( R= R| R� R R. R; ( R) R; t cRH R� t prt prevs( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt children� s . c C sQ | t k r t Sx: | j | g � D]& } | | k r9 t S| | k r# Pq# q# Wt S( N( R RY R� R^ ( R) Ry R� Rn ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt descendant� s c C s� | j | � | j | � } } y | j j | | � } Wn/ t t f k ri t j | j | | � } n X| r� t t | j | � � St S( s4 calculate the least common ancestor of nodes a and b( R= R2 R� R� t OverflowErrorR� R� R� t mapR; R ( R) t at bt ancs( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� � s c C sL t | t � r | j | � St | � d k r` y | } | j | � | SWq` t k r\ q` Xn y~ t | � } t | � | k r� t � n | d k r� t | � | } n | d k s� | t | � k r� t � n | j | � SWn t t f k r� n Xt | � d k rHy! t | � } | j | � | SWqHt t f k rDqHXn d S( Ni i i( ( t isinstanceR R; R+ R= R� R Ri R� R t TypeError( R) t idR; R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _match� s6 c C s� y | j j | � SWnB t k rB t | | j t d � � � n t t f k rX n X| | j k rs | j | St | � d k r�y� t | � d } t | | d � } g | j D]# } | d j | � r� | d ^ q� } g | D]! } t | � j | � r� | ^ q� } t | � d k rht | � d k rJ| d | j | <| d St | | j t d � � � n d SWq�t k r�q�Xn d S( Ns ambiguous identifieri( i i i i ( R2 t partialmatchR R� RN R R� Ri RT R+ R t startswithR R/ R� ( R) R� R t prefixR" t nlR4 ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _partialmatch� s. 3. c C sW | j | � } | d k r | S| j | � } | r8 | St | | j t d � � � d S( s� locate a node based on: - revision number or str(revision number) - nodeid or subset of hex nodeid s no match foundN( R� R/ R� R� RN R ( R) R� R4 ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt lookup s c C s+ | j | � \ } } t | | | � | k S( sp compare text with a given file revision returns True if text is different than what is stored. ( R� R ( R) R; R R R ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt cmp s c C sj | j \ } } | t | � | k rW t | � t | � t k rW | | | f | _ n | | f | _ d S( N( RS R+ t _chunksize( R) R R0 t oRs ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _addchunk$ s 2c C s� | j r | j | j � } n | j | j � } t d | � } | j | � | j | � } | j � | j | | � | | k r� t j | d | � S| S( Ni i ( Rc RP RN RO R� t seekR[ R\ R� R� t buffer( R) R R� t dft readaheadRs ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _loadchunk, s c C s� | j \ } } t | � } | | } | | } | d k rz | | k rz | d k rc | | k rc | St j | | | | � S| j | | � S( Ni ( RS R+ R� R� R� ( R) R R� R� Rs R t cachestartt cacheend( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _getchunk; s c C sV | j | � } | j | � | } | j rF | | d | j j 7} n | j | | � S( Ni ( Ry R� Rc Rh R( R� ( R) R� t endrevRy R� ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _chunkrawI s c C s t | j | | � � S( N( R# R� ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _chunkP s c C s | j | � S( N( R� ( R) R= ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt _chunkbaseS s c C s d | _ d S( Ni RJ ( i RJ ( RS ( R) ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyRk V s c C s: | j | d } | | k r! t S| j r. | S| d Sd S( s( return deltaparent of the given revisioni i N( R2 R Rd ( R) R= R� ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt deltaparentY s c C sV | t k r4 | j | � | k r4 t | j | � � St j | j | � | j | � � S( s1 return or calculate a delta between two revisions( R R� R R� t mdifft textdiffR� ( R) t rev1t rev2( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt revdiffc s !c C s& t | t � r' | } | j | � } n | } d } d } | t k rI d S| j r� | j d | k rp | j d S| j d } n d } | d k r� | j | � } n | j | � t @r� t t d � | j | � t @� � n g } | j } | j } | } | | } xT | | d k r]| | k r]| j | � | rF| d } n | d 8} | | } q W| j � | } | | k r�| j d } n d | _ | j | | � | d k r�t | j | � � } n g | D] } | j | � ^ q�} t j | | � } | j | | | � } | | | f | _ | S( sT return an uncompressed revision of a given node or revision number. RJ i i i s incompatible revision flag %xi N( R� R R; R/ R RQ R= Rq t REVIDX_KNOWN_FLAGSR R R2 Rd R. t reverseR� R R� R� R� t patchest _checkhash( R) t nodeorrevR= R; t cachedrevR t chainR2 RM t iterrevR" R� R� t bins( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� k sT "c C sS | j | � \ } } | t | | | � k rO t t d � | j | f � � n | S( Ns integrity check failed on %s:%d( R� R R R RN ( R) R R; R= R R ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� � s c C s� | j s, | j d � | j d � t k r0 d S| j | j � } | d k rj t t d � | j � � n | d } | j | � } | j | j | � | r� | j � | j � n | j | j d � } z. x' | D] } | j | j | | � � q� WWd | j � X| j | j d d t �} | j t M_ t | _ xC | D]; } | j j | j | | j | j | � } | j | � q?W| j � | j | j | | j j � | j � d S( Ni����s %s not found in the transactioni t wt atomictemp( Rc Ry R� t _maxinlinet findRN R/ R R R� RO t flushR\ RP t writeR� RY R< Rb R^ Rh R> R2 R; t replaceR( Rk ( R) t trt fpt trinfot trindext dataoffR� R� Rn R" ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt checkinlinesize� s4 , ! ( c C s� t | | | � } | | j k r% | Sd } | j sL | j | j d � } n | j | j d � } z) | j | | | | | | | | | � SWd | r� | j � n | j � Xd S( s add a revision to the log text - the revision data to add transaction - the transaction object used for rollback link - the linkrev data to add p1, p2 - the parent nodeids of the revision cachedelta - an optional precomputed delta R� s a+N( R R3 R/ Rc RP RO RN t _addrevisionR\ ( R) R t transactiont linkR R t cachedeltaR; t dfht ifh( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt addrevision� s c C s0 | s d | f St | � } d } | d k r1 n� | d k r� t j � } g } d } x= | | k r� | d } | j | j | | | !� � | } qX W| j | j � � t t t | � � | k r� d j | � } q� n t | � } | d k st | � | k r&| d d k r d | f Sd | f Sd | f S( s7 generate a possibly-compressed representation of text RJ i, i@B i i i R R Ni ( R+ R/ R t compressobjR. t compressR� t sumR� t joint _compress( R) R R R t zRH t post pos2( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR � s. c s[ | g � � � � � � � � � f d � � � � � � � f d � } t � � } | d } | } } � j | � � d } d } � j � � j � � � j � � } } | t k r1� j r | � d k r� | | � } q| � d k r� | | � } q| | � } n | | � } | \ } } } } } n | d k rct j � j � d � � d � } n t | � } | d k s�| | d k r�� � } � j | � } t | d � t | d � } | } } n t � | � | | | | | | � f } � j j d | � | � j � <� j j | � j � j | � } � j s�| j � j � � | j � j | t | � � | d r�� j | d � n � j | d � � j � � j | � ni � | � j j 7� | j � j � | � � j | � � j | d � � j | d � � j | � � t | � t k rH� | | f � _ n | | f � _ � S( s internal function to add revisions to the log see addrevision for argument descriptions. invariants: - text is optional (can be None); if not set, cachedelta must be set. if both are set, they must correspond to each other. c s� � d d k r � d S� r+ � j � n � j � � j � j � d � � } t j | � d � � d <t � d � � � } | � k r� t t d � � � n � d S( Ni i s consistency error in delta( R/ R� R� R; R� t patchR R R ( t basetextt chk( t btextR R R R; R R R) ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt buildtext s c s� � r# � d | k r# � d } n3 � � } � j � j | � � } t j | | � } � j | � } t | d � t | d � } � d | k r� � d } n � j | � } | � � j | � } � j r� | } n | } | | | | | f S( Ni i ( R� R; R� R� R R+ R� Ry Rd ( R= t deltaR! t ptextR0 R R� t distR� ( t basecacheR R R R) ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt builddelta' s i i i i����N( R+ R� R/ RR R= R Rd R� t patchedsizeR� R R R2 t insertR3 Rh R> R; R< Rc R� RO RN R� R� R( R� R R RQ ( R) R; R R� R R R R R R R t currt prevR� R� Rq Rs t p1rt p2rR R R0 t textlenR" R: ( ( R R R R R R R; R R R R) s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyR� sh $ ! c # s6 t | � d k r! | j � Vd S� j r6 | t k s< | ry t j � � } t � f d � | D� � } | j | � } n( t g | D] } � j | � ^ q� � } � j | d � d } | j d | � x\ t t | � d � D]D } | | | | d } } x" | j � | | � D] } | VqWq� W| j � Vd S( s� Calculate a delta group, yielding a sequence of changegroup chunks (strings). Given a list of changeset revs, return a set of deltas and metadata corresponding to nodes. The first delta is first parent(nodelist[0]) -> nodelist[0], the receiver is guaranteed to have this parent as it has all history before these changesets. In the case firstparent is nullrev the changegroup starts with a full revision. i Nc 3 s | ] } � j | � Vq d S( N( R= ( R� R4 ( R) ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pys <genexpr>� s i ( R+ R\ Rd R^ t dagutilt revlogdagR� t linearizet sortedR= R� R Rw t revchunk( R) t nodelistt bundlert reordert dagR| R4 RH R� R R R� ( ( R) s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt groupz s ( c C s� g } d } t | � } d } | r: | j | d � } n | j | j d � } | | j j } | j r� | j | j | | | � d } n> | j | j | | � | j | j | � | j | j d � } z�d } x�t r\| j | � } | s� Pn | d } | d } | d } | d } | d } | d } | j | � | | � } | | j k rd| } q� n xA | | f D]3 } | | j k rqt | | j t d � � � qqqqW| | j k r�t | | j t d � � � n | j | � } | j | d | | | | | | f | | � } | r� | j r� | j � | j | j d � } | j | j d � } q� q� WWd | rt| j � n | j � X| S( s� add a delta group given a set of deltas, add them to the revision log. the first delta is against its parent, which should be in our log, the rest are against the previous delta. i i s a+R� R; R R t cst deltabaseR s unknown parents unknown delta baseN( R/ R+ R� RP RN Rh R( Rc R� RO RY t deltachunkR. R3 R� R R= R� R\ ( R) t bundlet linkmapperR� t contentR; R� R� R t isizeR R� t chunkdataR R R( R) R R RH t baserev( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt addgroup� sb c C s t | � d k r d Sx- | D]! } | j | d | k r Pq q Wd S| j | � } | j s� | j | j | � | | j j } n | | | j j 7} | j | j | � d | _ | j � x0 t | t | � � D] } | j | j | � =q� W| j | d 5d S( s7 truncate the revlog on the first revision with a linkrev >= minlink This function is called when we're stripping revision minlink and its descendants from the repository. We have to remove all revisions with linkrev >= minlink, because the equivalent changelog revisions will be renumbered after the strip. So we truncate the revlog on the first of these revisions, and trust that the caller has saved the revisions that shouldn't be removed and that it'll re-add them after this truncation. i Ni i����( R+ R2 Ry Rc R� RO Rh R( RN R/ RQ Rk Rw R3 R; ( R) t minlinkR� R= R� R ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt strip� s" c C s� d } t | � r7 t d | j t | � d � � } n yF | j | j � } | j d d � | j � } | j � | | } Wn1 t k r� } | j t j k r� � n d } n Xy� | j | j � } | j d d � | j � } | j � | j j } t d | | � } | | | } | j rvd } x* | D]" } | t d | j | � � 7} q/Wd } | t | � | | } n Wn1 t k r�} | j t j k r�� n d } n X| | f S( Ni i i ( R+ R� R� RP RO R� t tellR\ R_ R` Ra RN Rh R( Rc R� ( R) t expectedRo t actualt ddRp R Rn t dit databytesR� ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt checksize s@ % c C s, | j g } | j s( | j | j � n | S( N( RN Rc R. RO ( R) t res( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt files8 s N(? R? R@ t __doc__R* Rt Ru Rx R/ R| R� t propertycacheR3 R~ R R= R; R� R� R� Ry R� R� R� Rq R� R( R^ R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� Rk R� R� R� R� R� R R R� R' R1 R3 R: R< ( ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyRI � sr D *� " " @ ' k & J ) %i i (6 R= R; R R R R t i18nR R� R� RC R R� R R% R R` t packR9 R] R, R R R# R t sha1R Re Rf Rb RX t REVLOG_DEFAULT_FLAGSt REVLOG_DEFAULT_FORMATRW Rg R� R� R� R R� R R R R R R' t v0shaoffsett objectR$ RB t ngshaoffsetRG RA RI ( ( ( s6 /usr/lib64/python2.7/site-packages/mercurial/revlog.pyt <module> sH "H$ +