o ĎiB@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.m/Z/ddl0m1Z1m2Z2ddl3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z:m;Z;mZ>e8rddl?m@Z@ddlAmBZBddlCmDZDe e BZE e.ZFdeGde>deGfddZHdeGdeGfddZIdeGddd eGddfd!d"ZJd#eKdeKfd$d%ZLde(fd&e7e;e,d'fd(e5eMd)e;deMfd*e:e(ddf d+d,ZNd(e5eMde9eKeKffd-d.ZOd/e;e,e>eKfde9e>eKffd0d1ZPd(e5eMde9eKe4e9e>eKfd'feMeMffd2d3ZQ dBd&e6e-d4d5d6eRd7eKde9eMe6d8ff d9d:ZSd;d8dZTd4d5d?e7eMde6e,fd@dAZUdS)CzVStandalone 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) CE_EXTENDEDBaseIndexEntry IndexEntry CE_NAMEMASK CE_STAGESHIFT)packunpack) DictIOListSequence TYPE_CHECKINGTupleTypeUnioncast)PathLike)GitCmdObjectDB) TreeCacheTup) IndexFilenamegit_dirreturncCst|d|S)zK:return: path to the given named hook in the given git repository directoryhooks)ospjoin)r7r8r=I/home/jeff/fluffinator/venv/lib/python3.10/site-packages/git/index/fun.pyr>srpathcCst|dS)Nr")r;splitext)r?r=r=r>_has_file_extensionCsrAindexr6argsc Gs(t||jj}t|tjsdStj}tt |j |d<d|d<|g}z+t j dkr?t |s?t||jj}d|g}t|t||tjtj|jjd}Wntyc}zt|||d}~wwg} g} t|| j| jtd| } d| } |jd krt| 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: NGIT_INDEX_FILE: GIT_EDITORwin32zbash.exe)envstdoutstderrcwdr )rrepor8osaccessX_OKenvironcopyrfspathr?sysplatformrAr relative_to working_diras_posixrlist subprocessPIPE Exceptionrrappendr!r< returncoderr) r7rBrChprHcmd relative_hpprocessex stdout_list stderr_listrIrJr=r=r>rGs@         rmodecCs8t|rtSt|st|tkrtSt|t@rdpdBS)zZConvert the given mode from a stat call to the corresponding index mode and return it.ii)rr rrrrr)rfr=r=r>rzs rentriesr%streamextension_data ShaStreamClsc CsT||}|j}|j}tdd|Drdnd}|d|td|t||D]s}|} ||j||jt|j} t | t d} t| t @} | t| ksTJd|j| |j t @B} |jrb| tO} |td |j|j|j|j|j|j|j| |jr|td |j|| || d d @}|d | ||q'|dur|||dS)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). css|]}|jVqdS)N)extended_flags).0entryr=r=r> szwrite_cache..DIRC>LL)encodingz"Path %s too long to fit into index >LLLLLL20sH>HN)tellwriteanyr(len ctime_bytes mtime_bytesstrr?rrr&flagsCE_NAMEMASK_INVrkr#devinoderfuidgidsizebinsha write_sha)rgrhrirj stream_sharyrzversionrm beginoffsetpath_strr?plenr real_sizer=r=r>rsL        rcCs`|d}|dkrtd|ttttftd|d}|\}}|dvs,Jd|||fS)z>Return tuple(version_long, num_entries) from the given stream.rqzInvalid index file header: %rrrrv)r"rproz@Unsupported git index version %i, only 1, 2, and 3 are supported)readAssertionErrorr2r/intr))rhtype_idunpackedr num_entriesr=r=r> read_headers  rrmcGsDt|dkr|d}t|tsJ|j|jfSttttf|}|S)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 ) r| isinstancer$r?stager2r/r3r)rm entry_firstr=r=r>rs  rc CsPt|\}}d}i}|j}|j}||kr|}td|dd}td|dd} td|d\} } } } }}}}d}|t@rGtd|dd}|t@}||t}||dd@}||||t| ||||| | | | |||f }||||j f<|d 7}||ks|d }t |d ksJd t ||d d}|dd }||||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>8srvrt.rurprwr"zNIndex Footer was not at least a sha on content as it was only %i bytes in sizeiN) rrryr)r#r&decoderr%rr|)rhrrcountrgrryrctimemtimerinorfrrrsharrk path_sizer?rrmri content_shar=r=r>rs8       rodbr4slsir5cCsHg}|j}|j}||kr||}|jdkrt||d7}|jd|}|dkr8||j|j|j|dfnH|j||} |} | |krf|| } | jd|} | dks]| j|| | kr^n| d7} | |ksEt ||t |d| |d\} }|| t | f| }||ks t }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?findr]rrfrslicer r rrzseekstorerrr|getvalue)rgrrr tree_itemsciendrmrboundbasexioentryorboundr_tree_entry_listsioistreamr=r=r>r+s:   "   r tree_entryrcCs t|d|d|t>|dfS)Nr"r rp)r$r')rrr=r=r>_tree_entry_to_baseindexentryps r tree_shascCsg}t|dvrt||ddD] }|t|dq|St|dkr+tdt|t||dD]\}}}|dur|dur|dur|d|dkr[|d|dkr[|d|dkss|d|dkr|d|dkr|d|dkr|t|d|t|d |t|dq1|d|dks|d|dkr|t|dq1|t|dq1|d|dks|d|dkr|t|d|t|d q1|durq1|d|dks|d|dkr|t|d|t|dq1|dur |dusJ|t|dq1|dur|t|dq1|d|dks*|d|dkr;|t|d |t|dq1|t|dq1|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"rprrLr rozCannot handle %i trees at onceNr"rp)r|rr]r ValueErrorr)rroutrmrourstheirsr=r=r>aggressive_tree_mergetsN  00     $r)r )V__doc____all__ior rNos.pathr?r;pathlibr statr r rrrrrrZrT gitdb.baser gitdb.typrgit.cmdrr git.compatrrrrgit.excrrgit.objects.funrrrgit.utilr r!typr#r$r%r&r'utilr(r)typingr*r+r,r-r.r/r0r1r2 git.typesr3git.dbr4git.objects.treer5rr6rrrrrArrrbytesrrrrrrrrr=r=r=r>s   $  ,    3   I$  ; E"