| || _ || _ || _ || _ d S r3 r> )selfr- r' r. r/ s r* __init__zDeltaChunk.__init__ s" r c @ d| j | j | j | j pdfz S )NzDeltaChunk(%i, %i, %s, %s) r> r@ s r* __repr__zDeltaChunk.__repr__ s# +tw$)/WY.ZZZr c | j | j z S r3 )r- r' rD s r* rboundzDeltaChunk.rbound s w r c | j duS )zB:return: True if the instance has data to add to the target streamN)r/ rD s r* has_datazDeltaChunk.has_data s y$$r N) __name__
__module__ __qualname____doc__ __slots__rA rE rG rI r r* r4 r4 t sd I [ [ [
! ! !% % % % %r r4 c d}t | }||k rN||z dz }| | }|j |k r|}n*| |k s |j |k r|S |dz }||k Nt | dz
S )z:return: index at which the given absofs should be inserted. The index points
to the DeltaChunk with a target buffer absofs that equals or is greater than
absofs.
**Note:** global method for performance only, it belongs to DeltaChunkListr r r )r8 r- rG )dclabsofslohimidr9 s r* _closest_indexrV s
B SB
r''Bw!m
X
56>>BB
YY[[6
!
!RUf__JqB
r'' s88a<r c 2 | D ]}t ||| dS )aU Apply the chain's changes and write the final result using the passed
write function.
:param bbuf: base buffer containing the base of all deltas contained in this
list. It will only be used if the chunk in question does not have a base
chain.
:param write: function taking a string of bytes to write to the outputN)r< )rQ r: r; r9 s r* delta_list_applyrX s2 + +"dE****+ +r c t | | }| | }t | }|j }|j |k rrt |j |j |j |j }t |||j z
t |j | |_ || ||j z }|dz
}||k r|r| | }|j |k r: |t |j |j |j |j ||j z }nDt |j |j |j |j }||_ || ||j z }dS |dz
}||k r|dS dS dS dS )zx:return: Subsection of this list at the given absolute offset, with the given
size in bytes.
:return: Noner N)
rV r8 appendr- r4 r' r. r/ r1 min) rQ rR r) ndclcdicdslenlappendtcds r* delta_list_slicerb s[ f
%
%C SB s88DkG urubg663///SVT"" q ***
X
5D== GJrubeRUBG<< = = = BEMDD RUBE25"'::CCF GCLLL CFND E q ***********r c L e Zd ZdZ e Zd Zd Zd Zd Z d Z
d
dZ d S ) r# aZ List with special functionality to deal with DeltaChunks.
There are two types of lists we represent. The one was created bottom-up, working
towards the latest delta, the other kind was created top-down, working from the
latest delta down to the earliest ancestor. This attribute is queryable
after all processing with is_reversed.c ` t | dk rdS | d S )z,:return: rightmost extend in bytes, absoluter )r8 rG rD s r* rG zDeltaChunkList.rbound s* t99>>1Bx r c F t | dk rdS | d j S )z5:return: leftmost byte at which this chunklist startsr )r8 r- rD s r* lboundzDeltaChunkList.lbound s" t99>>1Awzr c T | | z
S )z6:return: size of bytes as measured by our delta chunks)rG rg rD s r* r) zDeltaChunkList.size s {{}}t{{}},,r c $ t | || S )z_Only used by public clients, internally we only use the global routines
for performance)rX )r@ r: r; s r* applyzDeltaChunkList.apply s dE222r c 2 t | }|dk r| S d}d}||k r| | }|dz
}|j ||dz
|z
dk rt }| | j }t ||dz
D ]1}| | }| |j d|j 2| ||dz
= | } | |t |t | d| t | }|dz }d}||dz
}||k | S )zoAlter the list to reduce the amount of nodes. Currently we concatenate
add-chunks
:return: selfr r Nr )
r8 r/ r r- ranger; r' getvalueinsertr4 )
r@ r_ ifirst_data_indexr9 ndr. xxdcbufs
r* compresszDeltaChunkList.compress sR 4yy !88K
$hhaB
FAw#/AE r re c p |dk rB| d |k sJ t d d | D d |k sJ t | dk rdS | D ]B}|j dk sJ | r t |j |j k sJ Ct
| dt | dz
}t | }| t || D ]>\ }}| |j
k sJ |j
|j z |j
k sJ ?dS )zVerify the list has non-overlapping chunks only, and the total size matches
target_size
:param target_size: if not -1, the total size of the chain must be target_size
:raise AssertionError: if the size doesn't matchre c | |z S r3 rO )rr ys r* z0DeltaChunkList.check_integrity..* s
q1u r c 3 $ K | ] }|j V d S r3 r& ).0r( s r* z1DeltaChunkList.check_integrity..* s$ .B.Bqt.B.B.B.B.B.Br r r Nr ) rG r r8 r' rI r/ r iternextzipr- )r@ target_sizer9 leftrightlftrgts r* check_integrityz DeltaChunkList.check_integrity# sW
8??$$ 3333,,.B.BT.B.B.BAFF+UUUU t99q== F - -B519999{{}}
-27||ru,,,, dAs4yy1}--T
D%(( - -HC::<<36))))6CF?cf,,,,, - -r N)re ) rJ rK rL rM tuplerN rG rg r) rj ru r rO r r* r# r# s . . I! ! ! - - -3 3 3
) ) )V- - - - - -r r# c , e Zd ZdZ e Zd ZdS )TopdownDeltaChunkListzSRepresents a list which is generated by feeding its ancestor streams one by
onec 2 d}d}t | }t }||k r| | }|dz
}|j |dz
} |dd= t ||j |j | |j |j z
}|D ]}|xj |z
c_ t | dk r|d | |dz
< n`| |d } | |dz
d= | | | | t | }|t | dz
z
}||k ||k rdS dS )a= Connect this chain with the next level of our base delta chunklist.
The goal in this game is to mark as many of our chunks rigid, hence they
cannot be changed by any of the upcoming bases anymore. Once all our
chunks are marked like that, we can stop all processing
:param bdcl: data chunk list being one of our bases. They must be fed in
consecutively and in order, towards the earliest ancestor delta
:return: True if processing was done. Use it to abort processing of
remaining streams if False is returnedr r NFT)r8 listr/ rb r. r' r- extend)
r@ bdclnfcdcir_ cclr9 ofscdcpost_dcis
r* connect_with_next_basez,TopdownDeltaChunkList.connect_with_next_baseH sN 4yyffDjjcB 1HC w"q AAA T25"% 5 5 5 %"%-C
#
3xx1}} #AS1W
:qN C H%%%4yys3xx!|#M DjjV $;;5tr N)rJ rK rL rM r rN r rO r r* r r B s8 I; ; ; ; ;r r c p t t | dd \ }}|dz |z }|dk o|dz dk S )z
:return: True the file contained in memory map m appears to be a loose object.
Only the first two bytes are neededNr x r )mapord)mb0b1words r* r r sB ae__FB !Gr>D
: *4"9**r c d}t | | }|d| t t
\ }}|t
| fS )z
:return: tuple(type_string, uncompressed_size_in_bytes) the type string of the
object as well as its uncompressed size in bytes.
:param m: memory map from which to read the compressed object datai N)
decompressobj
decompressfindr splitr int)r decompress_sizehdr type_namer) s r* r r sa
O
//
$
$Q
8
8C.388I.../55jAAOIt c$ii r c t | d }d}|dz dz }|dz }d}|dz r/t | | }|dz
}||dz |z z
}|dz
}|dz /|||fS )a1
:return: tuple(type_id, uncompressed_size_in_bytes, byte_offset)
The type_id should be interpreted according to the ``type_id_to_type_map`` map
The byte-offset specifies the start of the actual zlib compressed datastream
:param m: random-access memory, like a string or memory mapr r r r r )r/ cro type_idr) ss r* r r s aA AAvlG r6D A
d( T!W Q Ta Q d(
T1 r c d}t }| dz |dz z }|dz }|r$| |dz |dz }|dz }|$| | |S )z
:return: string defining the pack header comprised of the object type
and its incompressed size in bytes
:param obj_type: pack type_id of the object
:param obj_size: uncompressed size in bytes of the following object streamr r r r r r ) bytearrayrZ )obj_typeobj_sizer r s r* r$ r$ s}
A
++C Q 8c>*A NH
1t8 tOQ
JJqMMM Jr c d}d}t | }d}||k r,| ||z }||dz |dz z z }|dz
}|dz sd}n||k ,|st d ||z |fS ) z
:return: tuple(read_bytes, size) read the msb size from the given random
access data starting at the given byte offsetr Fr r r r Tz2Could not find terminating MSB byte in data stream)r8 AssertionError)r/ offsetr) ro lhit_msbr s r* r r s
D A D AG
a%% V Ta!e## Q4x G
a%% S QRRR v:t r c P dt | |fz d S )z
:return: bytes representing the loose object header, which is immediately
followed by the content stream of size 'size'z%s %i ascii)r encode)typer) s r* r r s*
D))40 0 8 8 A AAr c l d}| |t | | z
}|t |||| z
}|S )a0
Write the object as identified by type, size and source_stream into the
target_stream
:param type: type string of the object
:param size: amount of bytes to write from source_stream
:param read: read method of a stream providing the content data
:param write: write method of the output stream
:param close_target_stream: if True, the target stream will be closed when
the routine exits, even if an error is thrown
:return: The actual amount of bytes written to stream, which includes the header and a trailing newliner )r r )r r) readr;
chunk_sizetbws r* r r sG C 55$T400 1 11C;tUD* 5 55C Jr c d} t |||z
} | | }t | }||z
} || ||k s||k rnK|S )z
Copy a stream up to size bytes using the provided read and write methods,
in chunks of chunk_size
**Note:** its much like stream_copy utility, but operates just using methodsr )r[ r8 )r r; r) r dbwcsr/ data_lens r* r r sq C
TCZ
(
( tBxxt99 x
d b==C4KK Jr c d}t x}}t | D ]>\ }}| }|j }t | \ }}t || \ }} d}
||k rt || } |dz
}| dz r=d\ } }
| dz rt || } |dz
}| dz r | t || dz z } |dz
}| dz r | t || d z z } |dz
}| dz r | t || d
z z } |dz
}| d z rt || }
|dz
}| d z r |
t || dz z }
|dz
}| d z r |
t || d z z }
|dz
}|
sd
}
| |
z }||
k s||k rn~| t |
|
| d |
|
z
}
nL| r;| t |
| d|||| z || z
}|
| z
}
nt d ||k | |dk r|
| s nt }@|S )aM
Read the condensed delta chunk information from dstream and merge its information
into a list of existing delta chunks
:param dstreams: iterable of delta stream objects, the delta to be applied last
comes first, then all its ancestors in order
:return: DeltaChunkList, containing all operations to applyNr r r r r r r r @ unexpected delta opcode 0) r enumerater r) r r rZ r4
ValueErrorru r r# )dstreamstdclrQ dsidsdbdelta_buf_sizero base_sizer r r cp_offcp_sizerG s r* r" r" s D&(((C$ X&& D D R
WWYY || 9!"a ; . BqE
A
FA4x )
>"&H AZZFFAH s2a5zzQ/FFAH s2a5zzR /0FFAH s2a5zzR /0FFAH !"Q%jjGFAH BqE
a0GFAH BqE
b 01GFA & %G ')W$$ **
:c7FDAABBBw
>
:c1aAa!eG==>>>Qq !<===Y . ` 77..s33
Kr c d d}|}||k r|| }|dz
}|dz rd\ }} |dz r
|| }|dz
}|dz r||| dz z }|dz
}|dz r||| dz z }|dz
}|dz r||| d z z }|dz
}|dz r
|| } |dz
}|d
z r| || dz z } |dz
}|d z r| || dz z } |dz
}| sd } || z }
|
| k s|
|k rnK || ||| z n-|r |||||z ||z
}nt d
||k ||k s
J d dS )a
Apply data from a delta buffer using a source buffer to the target file
:param src_buf: random access data from which the delta was created
:param src_buf_size: size of the source buffer in bytes
:param delta_buf_size: size for the delta buffer in bytes
:param delta_buf: random access delta data
:param write: write method taking a chunk of bytes
**Note:** transcribed to python from the similar routine in patch-delta.cr r r r r r r r r r r r r zdelta replay has gone wildN)r ) src_buf src_buf_size delta_bufr r; ro r r r r rG s r* r r m s
A B
n
qE Q t8 $ : "OFGD
AQD
2a5A:&QD
2a5B;'QD
2a5B;'QD
Q%QD
BqEQJ'QD
BqERK(Q
"!g%F \)) E'&'!112 3 3 3 3
: E"Qq1uW+
FAA 899 9O n
X
< r c | dz }|d| |d| k rdS | |z
r@t |d t |t | dz
z dz rdS dS )a:
:return: True if the given lhs and rhs 20 byte binary shas
The comparison will take the canonical_length of the match sha into account,
hence the comparison will only use the last 4 bytes for uneven canonical representations
:param match: less than 20 byte sha
:param sha1: 20 byte shar NFre r T)r r8 )canonical_lengthmatchsha1
binary_lengths r* r! r! s| %)M ^m^ ^m^ 444u-'
eBi
8DUa ,@#A#A
AT Iu 4r )r" )r )6rM zlib
gitdb.utilr r mmap itertoolsr functoolsr gitdb.constr r gitdb.utils.encodingr gitdb.typr
r r r
ior r r delta_typestype_id_to_type_maptype_to_type_id_mapPAGESIZEr __all__r+ r1 r6 r< r4 rV rX rb r r# r r r r r$ r r r r r" r r! gitdb_speedups._perf ImportErrorrO r r* r sV
"
- - - - - - - - + + + + + +
)$ s}}|s
{
{ Q11!
DM
!
f
$8 8 8 & % % % % % % % %B *+ + + Fe- e- e- e- e-T e- e- e-RA A A A AN A A AP+ + + * , .B B B 6@ * 6R R Rj9= 9= 9=x ( 33333333 DD s C# #C,+C,