a _Df`A @sdZgdZddlmZddlZddlmZddlm Z ddl m Z m Z m Z mZmZmZmZddlZddlZddlmZddlmZdd lmZmZdd lmZmZmZmZdd l m!Z!m"Z"dd l#m$Z$m%Z%m&Z&dd l'm(Z(m)Z)ddl*m+Z+m,Z,m-Z-m.Z.ddl/m0Z0m1Z1ddl2m3Z3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z:m;Z;ddlm?Z?ddl@mAZAddlBmCZCe e BZDe-ZEeFe=eFdddZGeFeFdddZHeFdeFddddZIeJeJd d!d"ZKde(fe6e:e+d#fe4eLe:deLfe9e(dd$d%d&ZMe4eLe8eJeJfd'd(d)ZNe:e+e=eJfe8e=eJfd*d+d,ZOe4eLe8eJe3e8e=eJfd#feLeLfd'd-d.ZPd:e5e,d/eQeJe8eLe5d0fd1d2d3ZRd0eJe+d4d5d6ZSd/e6eLe5e+d7d8d9ZTdS);zVStandalone functions to accompany the index implementation and make it more versatile.) write_cache read_cachewrite_tree_from_cache entry_keystat_mode_to_index_mode S_IFGITLINKrun_commit_hook hook_path)BytesION)Path)S_IFDIRS_IFLNKS_IFMTS_IFREGS_ISDIRS_ISLNKS_IXUSR)IStream) str_tree_type)handle_process_output safer_popen)defenc force_bytes force_text safe_decode)HookExecutionErrorUnmergedEntriesError)traverse_tree_recursivetraverse_trees_recursivetree_to_stream)IndexFileSHA1Writerfinalize_process)BaseIndexEntry IndexEntry CE_NAMEMASK CE_STAGESHIFT)packunpack) DictIOListSequence TYPE_CHECKINGTupleTypeUnioncast)PathLike)GitCmdObjectDB) TreeCacheTup) IndexFile)namegit_dirreturncCst|d|S)zK:return: path to the given named hook in the given git repository directoryhooks)ospjoin)r6r7r<Z/nfs/NAS7/SABIOD/METHODE/ermites/ermites_venv/lib/python3.9/site-packages/git/index/fun.pyr>sr)pathr8cCst|dS)Nr")r:splitext)r>r<r<r=_has_file_extensionCsr@r5)r6indexargsr8c Gs4t||jj}t|tjs dStj}tt |j |d<d|d<|g}zVt j dkr|t |s|t||jj}d|g}t|t||tjtj|jjd}Wn0ty}zt|||WYd}~nhd}~00g} g} t|| j| jtd| } d| } |jd kr0t| t} t| t} t||j| | dS) a:Run the commit hook of the given name. Silently ignore hooks that do not exist. :param name: Name of hook, like ``pre-commit``. :param index: :class:`~git.index.base.IndexFile` instance. :param args: Arguments passed to hook file. :raise git.exc.HookExecutionError: NZGIT_INDEX_FILE:Z GIT_EDITORwin32zbash.exe)envstdoutstderrcwdr )rrepor7osaccessX_OKenvironcopyrstrr>sysplatformr@r relative_toZ working_diras_posixrlist subprocessPIPE Exceptionrrappendr!r; returncoderr) r6rArBhprEcmdZ relative_hpprocessexZ stdout_listZ stderr_listrFrGr<r<r=rGs:   "     r)moder8cCs8t|r tSt|s t|tkr$tSt|t@r2dp4dBS)zZConvert the given mode from a stat call to the corresponding index mode and return it.ii)rr rrrrr)r_r<r<r=rzs rr$)entriesstreamextension_data ShaStreamClsr8c Cs||}|j}|j}d}|d|td|t||D]}|} ||j||jt|j} t| t d} t| t @} | t| ksJd|j| |j t @B} |td|j |j|j|j|j|j|j| || || dd@}|d | ||q8|d ur|||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). DIRC>LL)encodingz"Path %s too long to fit into index >LLLLLL20sHN)tellwriter'lenZ ctime_bytesZ mtime_bytesrPr>rrr%flagsCE_NAMEMASK_INVdevinoder_uidgidsizebinshaZ write_sha)r`rarbrcZ stream_sharlrmversionentry beginoffsetZpath_strr>plenro real_sizer<r<r=rsD        r)rar8cCsX|d}|dkrtd|ttttftd|d}|\}}|dvsPJ||fS)z>Return tuple(version_long, num_entries) from the given stream.rezInvalid index file header: %rrfrir"rd)readAssertionErrorr1r.intr()raZtype_idunpackedrw num_entriesr<r<r= read_headers   r)rxr8cGsHt|dkr.|d}t|ts"J|j|jfSttttf|}|SdS)z :return: Key suitable to be used for the :attr:`index.entries ` dictionary. :param entry: One instance of type BaseIndexEntry or the path and the stage. r"r N) rn isinstancer#r>stager1r.r2r)rxZ entry_firstr<r<r=rs  rc Cs,t|\}}d}i}|j}|j}||kr|}td|dd}td|dd} td|d\} } } } }}}}|t@}||t}||dd@}||||t| ||||| | | | ||f }||||jf<|d7}q |d}t |d ksJd 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 contents. r z>8srirh.rjr"zNIndex Footer was not at least a sha on content as it was only %i bytes in sizeiN) rr~rlr(r%decoderr$rrn)rarwrcountr`r~rlryctimemtimerqinor_rsrtrusharoZ path_sizer>r{rxrbZ content_shar<r<r=rs0     rr3r4)r`odbslsir8cCs<g}|j}|j}||kr||}|jdkr2t||d7}|jd|}|dkrp||j|j|j|dfq|j||} |} | |kr|| } | jd|} | dks| j|| | krq| d7} qt ||t |d| |d\} }|| t | f| }qt }t ||j|d|ttt||}|j|fS)aNCreate a tree from the given sorted list of entries and put the respective trees into the given object database. :param entries: **Sorted** list of :class:`~git.index.typ.IndexEntry`\s. :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, name. r r"/rN)startstoprrr>findrYrvr_rslicer r rrmseekstorerrrngetvalue)r`rrrZ tree_itemsciendrxZrboundbasexiZoentryZorboundrZ_tree_entry_listsioZistreamr<r<r=r%s6      r) tree_entryrr8cCs t|d|d|t>|dfS)Nr"r rd)r#r&)rrr<r<r=_tree_entry_to_baseindexentryjsr)r tree_shasr8cCsg}t|dvr:t||ddD]}|t|dq |St|dkrVtdt|t||dD]<\}}}|dur|dur|durl|d|dkr|d|dkr|d|dks|d|dkr$|d|dkr$|d|dkr$|t|d|t|d |t|dnF|d|dksH|d|dkrZ|t|dn|t|dnD|d|dks|d|dkr|t|d|t|d nP|durnD|d|dks|d|dkr|t|d|t|dqb|dur.|dusJ|t|dqb|durJ|t|dqb|d|dksn|d|dkr|t|d |t|dqb|t|dqb|S) a7 :return: List of :class:`~git.index.typ.BaseIndexEntry`\s 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. r}rrIr zCannot handle %i trees at onceNr"rd)rnrrYr ValueErrorr)rroutrxrZoursZtheirsr<r<r=aggressive_tree_mergensT      0$$ $  $r)r )U__doc____all__ior rKos.pathr>r:pathlibr statr r rrrrrrVrQZ gitdb.baserZ gitdb.typrZgit.cmdrrZ git.compatrrrrZgit.excrrZgit.objects.funrrrZgit.utilr r!typr#r$r%r&utilr'r(typingr)r*r+r,r-r.r/r0r1Z git.typesr2Zgit.dbr3Zgit.objects.treer4rr5rrprPrr@rrrbytesrrrrrrrrr<r<r<r=sd   $  ,    3   E " 8  E