B %d@ @sddlmZddlmZddlZddlmZmZmZm Z m Z m Z m Z ddl Z ddlmZmZddlmZmZmZmZmZmZddlmZmZddlmZmZmZdd lm Z m!Z!dd l"m#Z#dd l$m%Z%ddl&m'Z(d d l)m*Z*m+Z+m,Z,m-Z-d dl.m/Z/m0Z0ddl1m2Z2m3Z3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z:ddl;mZ>ddl?m@Z@ddlAmBZBeeBZCe,ZDdZEeFeZ/work/yifan.wang/ringdown/master-ringdown-env/lib/python3.7/site-packages/git/index/fun.pyr7Jsr7cCst|dS)Nr)r<splitext)pathr>r>r?_has_file_extensionOsrBr-)r8indexargsr:c Gs2t||jj}t|tjs dStj}tt |j |d<d|d<|g}yVt rvt |svt ||jj}d|g}tj|t||tjtj|jjttd}Wn.tk r}zt|||Wdd}~XYn`Xg}g} t||j| jtd|} d| } |jdkr.t| t} t| t} t||j| | dS) 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:NZGIT_INDEX_FILE:Z GIT_EDITORzbash.exe)envstdoutstderrcwd close_fds creationflagsr) r7repor9osaccessX_OKenvironcopyrstrrArrBr relative_toZ working_diras_posix subprocessPopenlistPIPErr Exceptionrr appendrr= returncoderr ) r8rCrDhprFcmdZ relative_hpexZ stdout_listZ stderr_listrGrHr>r>r?r6Ss<         r6)moder:cCs8t|r tSt|s t|tkr$tSt|t@r2dp4dBS)zYConvert the given mode from a stat call to the corresponding index mode and return itii)rrrrr5r r )r`r>r>r?r4s r4r)entriesstreamextension_data ShaStreamClsr:c Cs ||}|j}|j}d}|d|td|t|x|D]}|} ||j||jt|j} t| t d} t| t @} | t| kst d|j| |j t @B} |td|j|j|j|j|j|j|j| || || dd@}|d | ||q:W|d k r|||d S) aWrite 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 )sDIRCz>LL)encodingz"Path %s too long to fit into indexz >LLLLLL20sHiN)tellwriter!lenZ ctime_bytesZ mtime_bytesrSrArr rAssertionErrorflagsCE_NAMEMASK_INVdevinoder`uidgidsizebinshaZ write_sha)rarbrcrdZ stream_sharirjversionentry beginoffsetZpath_strrAplenrm real_sizer>r>r?r0s@        r0)rbr:cCsX|d}|dkrtd|ttttftd|d}|\}}|dksPt||fS)z=Return tuple(version_long, num_entries) from the given streamsDIRCzInvalid index file header: %rz>LLrg)rre)readrlr+r(intr")rbZtype_idunpackedru num_entriesr>r>r? read_headers   r)rvr:cGsHt|dkr.|d}t|ts"t|j|jfStttt f|}|SdS)z:return: Key suitable to be used for the index.entries dictionary :param entry: One instance of type BaseIndexEntry or the path and the stagerrN) rk isinstancerrlrAstager+r(r,r|)rvZ entry_firstr>r>r?r3s   r3c Cs0t|\}}d}i}|j}|j}x||kr|}td|dd}td|dd} td|d\} } } } }}}}|t@}||t}||dd@}||||t| ||||| | | | ||f }||||jf<|d7}q"W|d}t |d ks t d t ||d d }|d d }||||fS) aRead a cache file from the given stream :return: tuple(version, entries_dict, extension_data, content_sha) * version is the integer version number * entries dict is a dictionary which maps IndexEntry instances to a path at a stage * extension_data is '' or 4 bytes of type + 4 bytes of size + size bytes * content_sha is a 20 byte sha on all cache file contentsrz>8srgz >LLLLLL20sH.irzNIndex Footer was not at least a sha on content as it was only %i bytes in sizeiN) rr{rir"rdecoder rrrkrl)rbrur~countrar{rirwctimemtimeroinor`rqrrrssharmZ path_sizerAryrvrcZ content_shar>r>r?r1s.     r1r.r/)raodbslsir:cCsFg}|j}|j}x||kr||}|jdkr6t||d7}|jd|}|dkrt||j|j|j|dfq|j||} |} xF| |kr|| } | jd|} | dks| j|| | krP| d7} qWt ||t |d| |d\} }|| t | f| }qWt }t ||j|d|ttt||}|j|fS)aCreate 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, namerr/rN)startstoprrrAfindr[rtr`r2slicerrrrjseekstorerrrkgetvalue)rarrrZ tree_itemsciendrvZrboundbasexiZoentryZorboundrZ_tree_entry_listsioZistreamr>r>r?r2s6         r2) tree_entryrr:cCs t|d|d|t>|dfS)Nrrre)rr )rrr>r>r?_tree_entry_to_baseindexentryXsr)r tree_shasr:cCsg}t|dkr>x(t||ddD]}|t|dq"W|St|dkrZtdt|xNt||dD]<\}}}|dk r |dk r|dk rt|d|dkr|d|dkr|d|dks|d|dkr,|d|dkr,|d|dkr,|t|d|t|d |t|dnF|d|dksP|d|dkrb|t|dn|t|dnD|d|dks|d|dkr |t|d|t|d nP|dkrnD|d|dks|d|dkr|t|d|t|dqj|dkr6|dk s$t|t|dqj|dkrR|t|dqj|d|dksv|d|dkr|t|d |t|dqj|t|dqjW|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 performed)rrerrLrzCannot handle %i trees at onceNrre)rkrr[r ValueErrorrrl)rroutrvrZoursZtheirsr>r>r?aggressive_tree_merge\sJ      06$$ $  $r)r)UiorpathlibrrNstatrrrrrr r rVZgit.cmdr r Z git.compatr rrrrrZgit.excrrZgit.objects.funrrrZgit.utilrrZ gitdb.baserZ gitdb.typros.pathrAr<typrrrr utilr!r"typingr#r$r%r&r'r(r)r*r+Z git.typesr,rr-Zgit.dbr.Zgit.objects.treer/r5rn__all__rSr7rBr6r|r4bytesr0rr3r1rr2rrr>r>r>r?sL  $     ,     . (; "*38