&4)? T d dl mZ d dlmZ d dlZd dlmZmZmZm Z m
Z
m Z m Z d dl
Z
d dlmZmZ d dlmZmZmZmZmZmZ d dlmZmZ d dlm Z m Z m Z d d l m Z m!Z! d d
l"m#Z# d d l$m%Z% d dl&m'Z( d d
l)m*Z*m+Z+m,Z,m-Z- d dl.m/Z/m0Z0 d dl1m2Z2m3Z3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z: d dl;mZ> d dl?m@Z@ d dlAmBZB eez ZCe, ZDdZEdeFde splitext)paths r@ _has_file_extensionrE O s < a rA indexr. argsc t | |j j }t j |t j sdS t j }t t |j
|d< d|d< |g} t rQt | sBt | |j j }d|g}t# j |t' | z |t" j t" j |j j t* t, }g }g }t/ ||j |j t2 d | } d | }
|j dk rAt9 | t: } t9 |
t: }
t= ||j |
| dS # t> $ r} t= || | d} ~ ww xY w) zRun the commit hook of the given name. Silently ignores hooks that do not exist.
:param name: name of hook, like 'pre-commit'
:param index: IndexFile instance
:param args: arguments passed to hook file
:raises HookExecutionError:NGIT_INDEX_FILE:
GIT_EDITORzbash.exe)envstdoutstderrcwd close_fds
creationflags r ) r8 repor: osaccessX_OKenvironcopyr strrD r rE r relative_to working_diras_posix
subprocessPopenlistPIPEr r r
appendr r?
returncoder r r Exception) r9 rF rG hprL cmd relative_hp stdout_list stderr_listrM rN exs r@ r7 r7 S s
4+ , ,B
9R ! ! t
*//
C 'EJ 8 8CC
$CI ,-b11 , r((..uz/EFFOOQQK {+C $t** ? ?
& ,
"$ !# c;#5{7IK[\\\%%%% >Q //F //F$R HH H 1 1 1 R((b01s B+G
G/G**G/modec t | rt S t | st | t k rt S t
| t z rdpdz S )zYConvert the given mode from a stat call to the corresponding index mode
and return iti i )r r r r r6 r
r )rj s r@ r5 r5 sT t}} t}} t 33 dWn.7% 88rA entriesr streamextension_data ShaStreamClsc B || }|j }|j }d} |d |t d|t | | D ]"} | } ||j ||j t
|j }
t |
t } t | t z } | t | k sJ d|j z | |j t z z }
|t d|j
|j |j |j |j |j |j |
|| | | z
dz dz } |d | |z | z
z $|| | | d
S ) a Write the cache represented by entries to a stream
:param entries: **sorted** list of entries
:param stream: stream to wrap into the AdapterStreamCls - it is used for
final output.
:param ShaStreamCls: Type to use when writing to the stream. It produces a sha
while writing to it, before the data is passed on to the wrapped stream
:param extension_data: any kind of data to write as a trailer, it must begin
a 4 byte identifier, followed by its size ( 4 bytes ) DIRC>LL)encodingz"Path %s too long to fit into index >LLLLLL20sH N)tellwriter" len ctime_bytes mtime_bytesrY rD r r r flagsCE_NAMEMASK_INVdevinoderj uidgidsizebinsha write_sha)rl rm rn ro
stream_shary rz versionentry beginoffsetpath_strrD plenr~ real_sizes r@ r1 r1 s $ f%%J ?D E G E'NNN E$ugs7||
,
,--- < <dff
e
e uz??!(V<<<4yy;&s4yy "F"S o56
d TVVk)A-3
e i/44669:;;;; ! ((( rA c
| d }|dk rt d|z t t t t f t d| d }|\ }}|dv sJ ||fS )z=Return tuple(version_long, num_entries) from the given stream rr z Invalid index file header: %rrs rv r rq )readAssertionErrorr, r) intr# )rm type_idunpackedr num_entriess r@ read_headerr s kk!nnG' 8srv ru . rw r zNIndex Footer was not at least a sha on content as it was only %i bytes in sizeiN)
r r ry r# r decoder r r r{ )rm r r countrl r ry r ctimemtimer inorj r r r shar~ path_sizerD r r rn content_shas r@ r2 r2 s 'v..G[
E8:G ;D ;D
+
dff udd1gg&&q)udd1gg&&q)7=mTTR`MaMa7b7b4c4c4eK' tI%%f--TVVk)A-3 kI%
/000D#udE5#sCQTVZ[\\',u{#$
+
, [[__N Nb WZ]^lZmZmm ! !&K $DSD)N Wnk ::rA odbr/ slsir0 c g }|j }|j }||k r&| | }|j dk rt | |dz
}|j d| }|dk r0| |j |j |j |d f n|j || } |}
|
|k rH| |
} | j d| } | dk s| j || | k rn |
dz
}
|
|k Ht | |t |dz
|
|dz \ }
}| |
t | f |
}||k &t }t ||j | d | t# t$ t' | | }|j |fS )a Create a tree from the given sorted list of entries and put the respective
trees into the given object database
:param entries: **sorted** list of IndexEntries
:param odb: object database to store the trees in
:param si: start index at which we should start creating subtrees
:param sl: slice indicating the range we should process on the entries list
:return: tuple(binsha, list(tree_entry, ...)) a tuple of a sha and a list of
tree entries being a tuple of hexsha, mode, namer r /r N)startstopr r rD findra r rj r3 slicer r r rz seekstorer r r{ getvalue)rl r r r
tree_itemsciendr rboundbasexioentryorboundr _tree_entry_listsioistreams r@ r3 r3 s (*J B
'C
s(( ;! &u-- -
a b)) R<< u|UZBCC I J J J J :bi(DBs(( +**333b==FK7
$;t$C$Ca
s(( %:'3bSTfVXHYHY[ade[e$f$f !C! sGT 2 3 3 3 B;
s((D ))C:sy)))HHQKKKii
s3<<>>/B/BCHHIIG NJ ''rA
tree_entryr c \ t | d | d |t z | d f S )Nr r rq )r r! )r r s r@ _tree_entry_to_baseindexentryr X s- :a=*Q--9OQ[\]Q^_ ` ``rA tree_shasc V g }t | dv r?t | |d d D ]%}| t |d &|S t | dk r t dt | z t | |d D ]\ }}}|&||D|d |d k r$|d |d k r|d |d k s6|d |d k r|d |d k r||d |d k rj| t |d | t |d | t |d |d |d k s|d |d k r%| t |d /| t |d T|d |d k s|d |d k rF| t |d | t |d ||d |d k s|d |d k rF| t |d | t |d 0|)|J | t |d [|%| t |d |d |d k s|d |d k rH| t |d | t |d | t |d |S )
a
:return: list of BaseIndexEntries representing the aggressive merge of the given
trees. All valid entries are on stage 0, whereas the conflicting ones are left
on stage 1, 2 or 3, whereas stage 1 corresponds to the common ancestor tree,
2 to our tree and 3 to 'their' tree.
:param tree_shas: 1, 2 or 3 trees as identified by their binary 20 byte shas
If 1 or two, the entries will effectively correspond to the last given tree
If 3 are given, a 3 way merge is performedr r rR r z Cannot handle %i trees at onceNr rq )r{ r ra r
ValueErrorr )r r outr r ourstheirss r@ aggressive_tree_merger \ s !#C 9~~ ,S)B-DD @ @E JJ4UA>> ? ? ? ?
9~~9C NNJKKK 7sIr J J BG BGdF % Q47**tAw&)/C/CQSYZ[S\H\H\ Q47**tAw&)/C/CQSYZ[S\H\H\
#@q#I#IJJJ
#@q#I#IJJJ
#@#K#KLLLL aDG++tAw$q'/A/A
#@q#I#IJJJJ
#@#K#KLLLL Aw$q'))T!WQ-?-?
#@q#I#IJJJ
#@q#I#IJJJ > ayDG++vayDG/C/C
#@q#I#IJJJ
#@#K#KLLL | )))
8CCDDDD
8qAABBBB 7fQi''47fQi+?+?JJ typr r r r! utilr" r# typingr$ r% r& r' r( r) r* r+ r, git.typesr- r r. git.dbr/ git.objects.treer0 r6 r __all__rY r8 rE r7 r r5 bytesr1 r r4 r2 r r3 r r rA r@ r s
= = = = = = = = = < < < < < < <
; : : : : : : : # # # # # # G G G G G G G G G G G G U T T T T T T T T T T T T T T T T T T T T T . %%%%%%------ , ,C ,( ,s , , , ,
! ! !*I# *Ik *I# *I$ *I *I *I *I\9# 9# 9 9 9 9 *..A = =
eNL 89
:= uI= $+&= *+ =
= = = =@
5
eCHo
eNHc 9: uXs]?S $1; uI1;
3U8S=)<78% FG1; 1; 1; 1;j LM7( 7(
*
7($47(:?7(EH7(
5$~& &'7( 7( 7( 7(tan aS a^ a a a a` / `HUO `PTUcPd ` ` ` ` ` `rA