HEX

File: //usr/lib/python3/dist-packages/mercurial/__pycache__/metadata.cpython-310.pyc
o

�]LbM��@s�ddlmZmZddlZddlZddlmZddlmZm	Z	ddl
mZm
ZGdd�de�Zd	d
�Zdd�ZdAd
d�Zdd�Zdd�Zdd�Zdd�Zdd�ZdBdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Z e!d)d*�Z"e!d+d*�Z#e!d,d*�Z$e!d-d*�Z%e!d.d*�Z&e!d/d*�Z'e!d0d*�Z(e!d1d*�Z)e!d0d*�Z*e�+d2�Z,e�+d3�Z-d4d5�Z.d6d7�Z/d8d9�Z0d:d;�Z1d<d=�Z2d>Z3d?d@�Z4dS)C�)�absolute_import�print_functionN�)�nullrev)�error�util)�flagutil�sidedatac@seZdZdZ							d3dd�Zdd�Zedd��Zej	d	d
��Z
dd�Zd
d�Zej	dd��Z
dd�Zdd�Zej	dd��Zdd�Zdd�Zej	dd��Zdd�Zdd �Zej	d!d"��Zd#d$�Zd%d&�Zej	d'd(��Zd)d*�Zd+d,�Zej	d-d.��Zd/d0�Zd1d2�ZdS)4�
ChangingFilesazA class recording the changes made to files by a changeset

    Actions performed on files are gathered into 3 sets:

    - added:   files actively added in the changeset.
    - merged:  files whose history got merged
    - removed: files removed in the revision
    - salvaged: files that might have been deleted by a merge but were not
    - touched: files affected by the merge

    and copies information is held by 2 mappings

    - copied_from_p1: {"<new-name>": "<source-name-in-p1>"} mapping for copies
    - copied_from_p2: {"<new-name>": "<source-name-in-p2>"} mapping for copies

    See their inline help for details.
    NcCs�t|durdn|�|_t|durdn|�|_t|durdn|�|_t|dur(dn|�|_t|dur3dn|�|_|j�|j�|j�|j�|j�|j�t|durSdn|�|_t|dur^dn|�|_	dS)N�)
�set�_added�_merged�_removed�_touched�	_salvaged�update�dict�
_p1_copies�
_p2_copies)�self�touched�added�removed�merged�salvaged�	p1_copies�	p2_copiesrr�4/usr/lib/python3/dist-packages/mercurial/metadata.py�__init__-s
zChangingFiles.__init__cCsT|j|jko)|j|jko)|j|jko)|j|jko)|j|jko)|j|jko)|j|jkS�N)rrrrr�copied_from_p1�copied_from_p2)r�otherrrr�__eq__Bs
�
�
�
�
�
�zChangingFiles.__eq__cCs"t|jp|jp|jp|jp|j�Sr )�boolrrrr!r"�rrrr�has_copies_infoMs����zChangingFiles.has_copies_infocC�
t|j�S)aKfiles actively added in the changeset

        Any file present in that revision that was absent in all the changeset's
        parents.

        In case of merge, this means a file absent in one of the parents but
        existing in the other will *not* be contained in this set. (They were
        added by an ancestor)
        )�	frozensetr
r&rrrrWs
zChangingFiles.addedcC�*dt|�vr|`|j�|�|�|�dS)Nr)�varsrr
�add�mark_touched�r�filenamerrr�
mark_addedd�zChangingFiles.mark_addedcC�|D]}|�|�qdSr )r0�r�	filenames�frrr�update_addedj��zChangingFiles.update_addedcCr()z�files actively merged during a merge

        Any modified files which had modification on both size that needed merging.

        In this case a new filenode was created and it has two parents.
        )r)rr&rrrrn�
zChangingFiles.mergedcCr*)Nr)r+rrr,r-r.rrr�mark_mergedxr1zChangingFiles.mark_mergedcCr2r )r9r3rrr�
update_merged~r7zChangingFiles.update_mergedcCr()afiles actively removed by the changeset

        In case of merge this will only contain the set of files removing "new"
        content. For any file absent in the current changeset:

        a) If the file exists in both parents, it is clearly "actively" removed
        by this changeset.

        b) If a file exists in only one parent and in none of the common
        ancestors, then the file was newly added in one of the merged branches
        and then got "actively" removed.

        c) If a file exists in only one parent and at least one of the common
        ancestors using the same filenode, then the file was unchanged on one
        side and deleted on the other side. The merge "passively" propagated
        that deletion, but didn't "actively" remove the file. In this case the
        file is *not* included in the `removed` set.

        d) If a file exists in only one parent and at least one of the common
        ancestors using a different filenode, then the file was changed on one
        side and removed on the other side. The merge process "actively"
        decided to drop the new change and delete the file. Unlike in the
        previous case, (c), the file included in the `removed` set.

        Summary table for merge:

        case | exists in parents | exists in gca || removed
         (a) |       both        |     *         ||   yes
         (b) |       one         |     none      ||   yes
         (c) |       one         | same filenode ||   no
         (d) |       one         |  new filenode ||   yes
        )r)rr&rrrr�s
"zChangingFiles.removedcCr*)Nr)r+rrr,r-r.rrr�mark_removed�r1zChangingFiles.mark_removedcCr2r )r;r3rrr�update_removed�r7zChangingFiles.update_removedcCr()a.files that might have been deleted by a merge, but still exists.

        During a merge, the manifest merging might select some files for
        removal, or for a removed/changed conflict. If at commit time the file
        still exists, its removal was "reverted" and the file is "salvaged"
        )r)rr&rrrr�r8zChangingFiles.salvagedcCr*)Nr)r+rrr,r-r.rrr�
mark_salvaged�r1zChangingFiles.mark_salvagedcCr2r )r=r3rrr�update_salvaged�r7zChangingFiles.update_salvagedcCr()z0files either actively modified, added or removed)r)rr&rrrr�s
zChangingFiles.touchedcCs dt|�vr|`|j�|�dS)Nr)r+rrr,r.rrrr-�szChangingFiles.mark_touchedcCr2r )r-r3rrr�update_touched�r7zChangingFiles.update_touchedcC�
|j��Sr )r�copyr&rrrr!��
zChangingFiles.copied_from_p1cC�dt|�vr|`||j|<dS)Nr!)r+r!r�r�source�destrrr�mark_copied_from_p1��z!ChangingFiles.mark_copied_from_p1cC�"|��D]
\}}|�||�qdSr )�itemsrG�r�copiesrFrErrr�update_copies_from_p1���z#ChangingFiles.update_copies_from_p1cCr@r )rrAr&rrrr"�rBzChangingFiles.copied_from_p2cCrC)Nr")r+r"rrDrrr�mark_copied_from_p2�rHz!ChangingFiles.mark_copied_from_p2cCrIr )rJrOrKrrr�update_copies_from_p2�rNz#ChangingFiles.update_copies_from_p2)NNNNNNN)�__name__�
__module__�__qualname__�__doc__rr$�propertyr'r�
propertycacherr0r6rr9r:rr;r<rr=r>rr-r?r!rGrMr"rOrPrrrrr
sR
�
	

	
#
	


r
cCs�|��}|��}|��tkr|��tkrt|�S|��tkr)|��tkr)t||�S|��tkr<|��tkr<t||dd�S|��|��krIt||�St|||�S)z'compute the files changed by a revision�)�parent)�p1�p2�revr�
_process_root�_process_linear�_process_merge��ctxrYrZrrr�compute_all_files_changes�s

racCs&t�}|��}|D]}|�|�q	|S)zEcompute the appropriate changed files for a changeset with no parents)r
�manifestr0)r`�mdrbr/rrrr\�s
r\c
Cs�t�}|��}|��}g}|�|���D]*\}}|dddur&|�|�q|�|�|dddur9|�|�q|�|�q|dkrG|j}	n|dkrO|j	}	nJd|��|D]}||�
�}
|
rj|
\}}|	||�qW|S)zJcompute the appropriate changed files for a changeset with a single parentrrNrWFzbad parent value %d)r
rb�diffrJr;�appendr0r-rGrO�renamed)
�
parent_ctx�children_ctxrXrc�parent_manifest�children_manifest�copies_candidater/�d�copied�	copy_inforE�srcnoderrrr]	s.

�r]csb���}t�}���}|��}|��}|�|�}|�|�}	���j�|��|���}
|
s/tg}
�fdd�|
D�}g}|��D]�\�}
|	�	�d�}|durTt
||�|
�q>|
ddduro|ddduro|���|���q>|
dddur�|dddur�|�
��q>|
dddur�|dddur�|
dddus�|dddur�t�fdd�|D��r�|���n$|���n|j�|
ddd�}|����tkr�|���n|���|���q>Jd
��|	��D]\�}t
||�|�q�|D]8�����}|�r.|\}}||v�r||��|k�r|�|��q�||v�r.||��|k�r.|�|��q�|S)u�compute the appropriate changed files for a changeset with two parents

    This is a more advance case. The information we need to record is summarise
    in the following table:

    ┌──────────────┬──────────────┬──────────────┬──────────────┬──────────────┐
    │ diff ╲  diff │       ø      │ (Some, None) │ (None, Some) │ (Some, Some) │
    │  p2   ╲  p1  │              │              │              │              │
    ├──────────────┼──────────────┼──────────────┼──────────────┼──────────────┤
    │              │              │🄱  No Changes │🄳  No Changes │              │
    │  ø           │🄰  No Changes │      OR      │     OR       │🄵  No Changes │
    │              │              │🄲  Deleted[1] │🄴  Salvaged[2]│     [3]      │
    ├──────────────┼──────────────┼──────────────┼──────────────┼──────────────┤
    │              │🄶  No Changes │              │              │              │
    │ (Some, None) │      OR      │🄻  Deleted    │       ø      │      ø       │
    │              │🄷  Deleted[1] │              │              │              │
    ├──────────────┼──────────────┼──────────────┼──────────────┼──────────────┤
    │              │🄸  No Changes │              │              │   🄽 Touched  │
    │ (None, Some) │     OR       │      ø       │🄼   Added     │OR 🅀 Salvaged │
    │              │🄹  Salvaged[2]│              │   (copied?)  │   (copied?)  │
    ├──────────────┼──────────────┼──────────────┼──────────────┼──────────────┤
    │              │              │              │   🄾 Touched  │   🄿 Merged   │
    │ (Some, Some) │🄺  No Changes │      ø       │OR 🅁 Salvaged │OR 🅂 Touched  │
    │              │     [3]      │              │   (copied?)  │   (copied?)  │
    └──────────────┴──────────────┴──────────────┴──────────────┴──────────────┘

    Special case [1]:

      The situation is:
        - parent-A:     file exists,
        - parent-B:     no file,
        - working-copy: no file.

      Detecting a "deletion" will depend on the presence of actual change on
      the "parent-A" branch:

      Subcase 🄱 or 🄶 : if the state of the file in "parent-A" is unchanged
      compared to the merge ancestors, then parent-A branch left the file
      untouched while parent-B deleted it. We simply apply the change from
      "parent-B" branch the file was automatically dropped.
      The result is:
          - file is not recorded as touched by the merge.

      Subcase 🄲 or 🄷 : otherwise, the change from parent-A branch were explicitly dropped and
      the file was "deleted again". From a user perspective, the message
      about "locally changed" while "remotely deleted" (or the other way
      around) was issued and the user chose to deleted the file.
      The result:
          - file is recorded as touched by the merge.


    Special case [2]:

      The situation is:
        - parent-A:     no file,
        - parent-B:     file,
        - working-copy: file (same content as parent-B).

      There are three subcases depending on the ancestors contents:

      - A) the file is missing in all ancestors,
      - B) at least one ancestor has the file with filenode ≠ from parent-B,
      - C) all ancestors use the same filenode as parent-B,

      Subcase (A) is the simpler, nothing happend on parent-A side while
      parent-B added it.

        The result:
            - the file is not marked as touched by the merge.

      Subcase (B) is the counter part of "Special case [1]", the file was
        modified on parent-B side, while parent-A side deleted it. However this
        time, the conflict was solved by keeping the file (and its
        modification). We consider the file as "salvaged".

        The result:
            - the file is marked as "salvaged" by the merge.

      Subcase (C) is subtle variation of the case above. In this case, the
        file in unchanged on the parent-B side and actively removed on the
        parent-A side. So the merge machinery correctly decide it should be
        removed. However, the file was explicitly restored to its parent-B
        content before the merge was commited. The file is be marked
        as salvaged too. From the merge result perspective, this is similar to
        Subcase (B), however from the merge resolution perspective they differ
        since in (C), there was some conflict not obvious solution to the
        merge (That got reversed)

    Special case [3]:

      The situation is:
        - parent-A:     file,
        - parent-B:     file (different filenode as parent-A),
        - working-copy: file (same filenode as parent-B).

      This case is in theory much simple, for this to happens, this mean the
      filenode in parent-A is purely replacing the one in parent-B (either a
      descendant, or a full new file history, see changeset). So the merge
      introduce no changes, and the file is not affected by the merge...

      However, in the wild it is possible to find commit with the above is not
      True. For example repository have some commit where the *new* node is an
      ancestor of the node in parent-A, or where parent-A and parent-B are two
      branches of the same file history, yet not merge-filenode were created
      (while the "merge" should have led to a "modification").

      Detecting such cases (and not recording the file as modified) would be a
      nice bonus. However do not any of this yet.
    c�g|]
}���|���qSr��reporb��.0�r�r`rr�
<listcomp>��z"_process_merge.<locals>.<listcomp>Nrrc3��|]
}t|��duVqdSr ��_find�rt�ma�r/rr�	<genexpr>���z!_process_merge.<locals>.<genexpr>)�fileidF�unreachable)rrr
rbrd�	changelog�commonancestorsheads�noderrJ�pop�_process_other_unchangedr0rer;�anyr=r-�filectxrZr[r9rf�filenoderGrO)�p1_ctx�p2_ctxr`rrrc�m�p1m�p2m�diff_p1�diff_p2�cahs�mas�copy_candidates�d1�d2�fctxrnrEror)r`r/rr^.s\o


� 
   
�r^cCs||vrdS|�|�dS)z%return the associate filenode or NoneNr��find)rbr/rrrr{�sr{cs�|dd�|dd}�dur)|dur)t��fdd�|D��r'|���dSdS�durE|durEt�fdd�|D��rC|���dSdS�durO|durOdSJd��)Nrrc3s �|]}t|���kVqdSr rzr|�r/�source_noderrr�s�z+_process_other_unchanged.<locals>.<genexpr>c3ryr rzr|r~rrr�r�Fr�)r�r;r=)rcr�r/rd�target_noderr�rr��s��r�cst�fdd�|D��S)Nc3s�|]
}t|��duVqdSr rzr|r~rrrr�z._missing_from_all_ancestors.<locals>.<genexpr>��all)r�r/rr~r�_missing_from_all_ancestorssr�cs:g}|��D]�t�fdd�|��D��s|���q|S)z-return the list of files added in a changesetc3s�|]}�|vVqdSr r)rt�p�r5rrrs�z-computechangesetfilesadded.<locals>.<genexpr>)�filesr��parentsre)r`rrr�r�computechangesetfilesaddeds
�r�cs`|dur|\����n����������������tj���fdd������fdd�}|S)a<return a function to detect files "wrongly" detected as `removed`

    When a file is removed relative to p1 in a merge, this
    function determines whether the absence is due to a
    deletion from a parent, or whether the merge commit
    itself deletes the file. We decide this by doing a
    simplified three way merge of the manifest entry for
    the file. There are two ways we decide the merge
    itself didn't delete a file:
    - neither parent (nor the merge) contain the file
    - exactly one parent contains the file, and that
      parent has the same filelog entry as the merge
      ancestor (or all of them if there two). In other
      words, that parent left the file unchanged while the
      other one deleted it.
    One way to think about this is that deleting a file is
    similar to emptying it, so the list of changed files
    should be similar either way. The computation
    described above is not done directly in _filecommit
    when creating the list of changed files, however
    it does something very similar by comparing filelog
    nodes.
    Ncs>���}���}���j�||�}|stg}�fdd�|D�S)NcrprrqrsrvrrrwCrxz3get_removal_filter.<locals>.mas.<locals>.<listcomp>)r�rrr�r�r)�p1n�p2nr�r_rrr�<szget_removal_filter.<locals>.mascsP��vr��vot��fdd���D��S��vr&t��fdd���D��SdS)Nc3�,�|]}�|vo|�������kVqdSr r�r|)r5�m1rrrGs�
�zAget_removal_filter.<locals>.deletionfromparent.<locals>.<genexpr>c3r�r r�r|)r5�m2rrrKs�*Tr�r�)r�r�r�r�r�deletionfromparentEs�z.get_removal_filter.<locals>.deletionfromparent)rYrZrbr�	cachefunc)r`�xr�r)r`r�r�r�rYrZr�get_removal_filters
r�csFg}|��D]}||vr|�|�q|r!t|���fdd�|D�}|S)z/return the list of files removed in a changesetcsg|]}�|�s|�qSrrrs��rfrrrwZsz0computechangesetfilesremoved.<locals>.<listcomp>)r�rer�)r`rr5rr�r�computechangesetfilesremovedRs
�r�cCsdg}t|���dkr|S|��D]}||vr/||}|j�|j�}|d|��jkr/|�|�q|S)z.return the list of files merged in a changesetrWr)�lenr�r��_filelog�	_filenoderr�nullidre)r`rr5r�r�rrr�computechangesetfilesmerged^s
�r�c
Cs�i}i}|��}|��}|j��}|��D]9}||�r||vr q||��}|s)q|\}}	||vr>||��|	kr>|||<q||vrN||��|	krN|||<q||fS)z�return the copies data for a changeset

    The copies data are returned as a pair of dictionnary (p1copies, p2copies).

    Each dictionnary are in the form: `{newname: oldname}`
    )rYrZ�_repo�narrowmatchr�rfr�)
r`�p1copies�p2copiesrYrZr��dstrm�srcrorrr�computechangesetcopiesls$

�r�cCsXg}t|�D]\}}||vr|�d|||f�qt|�t|�kr't�d��d�|�S)Ns%d%ss(some copy targets missing from file list�
)�	enumeraterer�r�ProgrammingError�join)r�rLrJ�ir�rrr�encodecopies�s��
r�c	Csdz%i}|s|WS|�d�D]}|�d�\}}t|�}||}|||<q
|WSttfy1YdSw)Nr��)�split�int�
ValueError�
IndexError)r��datarL�l�strindexr�r�r�rrr�decodecopies�s
�r�cCs>t|�}g}t|�D]\}}||vr|�d|�q
d�|�S)Ns%dr�)rr�rer�)r��subset�indicesr�r5rrr�encodefileindices�s�
r�c	Cspz+g}|s|WS|�d�D]}t|�}|dks|t|�kr!WdS|�||�q
|WSttfy7YdSw)Nr�r)r�r�r�rer�r�)r�r�r�r�r�rrr�decodefileindices�s�r��11100rW�00100�01000�01100�10000�10100�11�10z>Lz>bLLc
CsXt|j�}|�|j���|�|j���t|�}dd�t|�D�}d|d<t�	t
|��g}d}|D]l}t
|�}||7}d}||jvrH|tO}n'||j
vrR|tO}n||jvr\|tO}n||jvrf|tO}n	||jvro|tO}d}||jvr�|tO}|j�|�}n||jvr�|j�|�}|tO}||}	|�t�	|||	��q2|�|�tjd�|�iS)NcSsi|]\}}||�qSrr)rtr�r5rrr�
<dictcomp>�sz)encode_files_sidedata.<locals>.<dictcomp>r�)rrrr!�valuesr"�sortedr��INDEX_HEADER�packr�r�
ADDED_FLAGr�MERGED_FLAGr�REMOVED_FLAGr�
SALVAGED_FLAG�TOUCHED_FLAG�COPIED_FROM_P1_FLAG�get�COPIED_FROM_P2_FLAGre�INDEX_ENTRY�extend�sidedatamod�SD_FILESr�)
r��	all_files�file_idx�chunks�filename_lengthr5�
filename_size�flagrA�copy_idxrrr�encode_files_sidedata�sB












r�cCs�t�}|�tj�}|dur|Sg}g}t|�tjksJ�t�|d�d}tj}|tj|}|}t|�|ks8J�t	|�D]�}	t�||�\}
}}||7}|||�}
||}t|
�|ks]J�|tj7}|}|�
|
�|
t@tkru|�
|
�n/|
t@tkr�|�|
�n#|
t@tkr�|�|
�n|
t@tkr�|�|
�n|
t@tkr�|�|
�d}|
t@tkr�|j}n	|
t@tkr�|j}|dur�|�
||
|f�q<|D]\}}
}||||
�q�|S�Nr)r
r�r�r�r�r��size�unpack_fromr��rangere�ACTION_MASKr�r0r�r9r�r;r�r=r�r-�COPIED_MASKr�rGr�rO)r	rc�rawrLr��total_files�offset�file_offset_base�file_offset_last�idxr��file_endr�r/�filesizermrrr�decode_files_sidedata�sT


�rcCs||}t|�}t|�|jfSr )rar�r')�srcrepor[r`r�rrr�_getsidedata-srcCs(t||�\}}|rtjnd}||dffSr�)r�sidedataflag�REVIDX_HASCOPIESINFO)rr�revlogr[�existing_sidedatar	r'�flags_to_addrrr�copies_sidedata_computer3srcCsT|��|��}|dur$t||�}|�||f�|��|��}|dus|��dS)a�The function used by worker precomputing sidedata

    It read an input queue containing revision numbers
    It write in an output queue containing (rev, <sidedata-map>)

    The `None` input value is used as a stop signal.

    The `tokens` semaphore is user to avoid having too many unprocessed
    entries. The workers needs to acquire one token before fetching a task.
    They will be released by the consumer of the produced data.
    N)�acquirer�r�put�release)r�
revs_queue�sidedata_queue�tokensr[r�rrr�_sidedata_worker9s
�r�2cs�ddlm}|�|j�}t�|t��t��}t���|jdus"J�|j	�
�D]}|�|�q't|�D]}|�d�q3g}t|�D]}||��f}tj
t|d�}	|�|	�|	��qAi����fdd�}
|
S)z�The parallel version of the sidedata computation

    This code spawn a pool of worker that precompute a buffer of sidedata
    before we actually need themr)�workerN)�target�argsc	sn��|d�}|dur"���\}}||kr"|�|<���\}}||ks���|\}}d}|r1tj}||dffSr�)r�r�rrr)	rrrr[�old_sidedatar�rur	r'�new_flag��	sidedataq�stagingrrr�sidedata_companion{s�z6_get_worker_sidedata_adder.<locals>.sidedata_companion)�r�_numworkers�ui�multiprocessing�BoundedSemaphore�BUFF_PER_WORKER�Queue�
filternamer��revsr
r��Processrre�start)r�destrepor�	nbworkers�revsqrur��
allworkersr�wrrrr�_get_worker_sidedata_adderSs&

r*)rr )5�
__future__rrr�structr�rrrr�revlogutilsrrr	r��objectr
rar\r]r^r{r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r��Structr�r�r�rrrrrr*rrrr�<module>sVT

%?
	7	










'6