o

�]Lb8;�@s�dd
lm
Z

ddlZddlmZ
ddlmZmZ
e�d�
Z	dZ
dZe�d�
Z
e�d	�
Ze
e
jks2J�
eejks9J�
d
Zdd�Zd
d�Zdd�ZejGdd�de��
Zdd�Zdd�Zdd�Zdd�Zdd�ZdS)�)
�absolute_importN�)
�attr)�error�policy�parsers�,z>LLLLL4s20sz>LHHLHLLLLHlll� cCs,t�
|�
\}}}}}}	}
t||
|||�
d
S)a;
parse a full v2-dirstate from a binary data into dictionnaries:

    - map: a {path: entry} mapping that will be filled
    - copy_map: a {path: copy-source} mapping that will be filled
    - data: a binary blob contains v2 nodes data
    - tree_metadata:: a binary blob of the top level node (from the docket)
    N)�
TREE_METADATA�unpack�parse_nodes)�map�copy_map�data�
tree_metadata�root_nodes_start�root_nodes_len�_nodes_with_entry_count�_nodes_with_copy_source_count�_unreachable_bytes�_unused�_ignore_patterns_hash�r�</usr/lib/python3/dist-packages/mercurial/dirstateutils/v2.py�parse_dirstate?s�






rcCs�t|�
D]I}|t
|}t||t
�}t�|�
\
}}	}
}}}
}}}}}}}t||
||
|�
tj�||||�}|j	s9qt|||	�}|||<|rMt|||�|
|<qd
S)a
parse <len> nodes from <data> starting at offset <start>

    This is used by parse_dirstate to recursively fill `map` and `copy_map`.

    All directory specific information is ignored and do not need any
    processing (DIRECTORY, ALL_UNKNOWN_RECORDED, ALL_IGNORED_RECORDED)
    N)
�range�	NODE_SIZE�slice_with_len�NODErrr�DirstateItem�from_v2_data�any_tracked)r
rr�start�len�
i�
node_start�
node_bytes�
path_start�path_len�_basename_start�copy_source_start�copy_source_len�children_start�children_count�_descendants_with_entry_count�_tracked_descendants_count�flags�size�mtime_s�mtime_ns�item�pathrrrrSs<

�



















���rcCs||
|
|�S�
Nr)rr"r#rrrr|s
rc@s`eZ
dZe��Ze��Zejd
d�
Zejdd�
Zejdd�
Z	ejdd�
Z
ejdd�
Zdd�Zd
S)�NodeN)
�defaultr
cCs�|j}|
�
|�
}|j}|}t|�
}|�d
�
d}|du
r'|t|�
}	t|�
}
nd}	d}
|du
r8|��\}}}
}nt}d}d}
d}t�||||	|
|j	|j
|j|j|||
|�
S)N�
/�
r
)
r5�get�entryr#�rfind�v2_data�DIRSTATE_V2_DIRECTORYr�pack�children_offsetr-�descendants_with_entry�tracked_descendants)�selfr�paths_offsetr5�copyr<r'r(�basename_startr*r+r0r1r2r3rrrr@�s@





























�z	Node.pack)
�__name__�
__module__�__qualname__r�ibr5r<�parentr-rArBrCr@rrrrr7�s





r7c	Cs�
t�}d
}d
}d
}d
}d
}d}d}	t
|�
d
kr&t�|||||||	�}
||
fSt|��dd�d�}g}tdd�}
|�|
�

t|d	�D]�\}\}}|d	7}||
vrS|d	7}t	|�
}t
||
|�}
|
jd	7_|jrn|
j
d	7_
|
jd	7_|�t|||
��

d
}d}|t
|�
kr�||d
}t||�}|r�t|
|
||�
|r�|
jdkr�|
j}|du
o�t|t	|dj�
�}|dus�|r�nt||
||�
|}
|r�|
jdks�qA|��}
|
jdks�J|
j�
�
t
|�
d
ks�Jt
|�
�
�
t�|
j|
j|||||	�}
||
fS)a

    Pack `map` and `copy_map` into the dirstate v2 binary format and return
    the bytearray.

    The on-disk format expects a tree-like structure where the leaves are
    written first (and sorted per-directory), going up levels until the root
    node and writing that one to the docket. See more details on the on-disk
    format in `mercurial/helptext/internals/dirstate-v2`.

    Since both `map` and `copy_map` are flat dicts we need to figure out the
    hierarchy. This algorithm does so without having to build the entire tree
    in-memory: it only keeps the minimum number of nodes around to satisfy the
    format.

    # Algorithm explanation

    This explanation does not talk about the different counters for tracked
    descendents and storing the copies, but that work is pretty simple once this
    algorithm is in place.

    ## Building a subtree

    First, sort `map`: this makes it so the leaves of the tree are contiguous
    per directory (i.e. a/b/c and a/b/d will be next to each other in the list),
    and enables us to use the ordering of folders to have a "cursor" of the
    current folder we're in without ever going twice in the same branch of the
    tree. The cursor is a node that remembers its parent and any information
    relevant to the format (see the `Node` class), building the relevant part
    of the tree lazily.
    Then, for each file in `map`, move the cursor into the tree to the
    corresponding folder of the file: for example, if the very first file
    is "a/b/c", we start from `Node[""]`, create `Node["a"]` which points to
    its parent `Node[""]`, then create `Node["a/b"]`, which points to its parent
    `Node["a"]`. These nodes are kept around in a stack.
    If the next file in `map` is in the same subtree ("a/b/d" or "a/b/e/f"), we
    add it to the stack and keep looping with the same logic of creating the
    tree nodes as needed. If however the next file in `map` is *not* in the same
    subtree ("a/other", if we're still in the "a/b" folder), then we know that
    the subtree we're in is complete.

    ## Writing the subtree

    We have the entire subtree in the stack, so we start writing it to disk
    folder by folder. The way we write a folder is to pop the stack into a list
    until the folder changes, revert this list of direct children (to satisfy
    the format requirement that children be sorted). This process repeats until
    we hit the "other" subtree.

    An example:
        a
        dir1/b
        dir1/c
        dir2/dir3/d
        dir2/dir3/e
        dir2/f

    Would have us:
        - add to the stack until "dir2/dir3/e"
        - realize that "dir2/f" is in a different subtree
        - pop "dir2/dir3/e", "dir2/dir3/d", reverse them so they're sorted and
          pack them since the next entry is "dir2/dir3"
        - go back up to "dir2"
        - add "dir2/f" to the stack
        - realize we're done with the map
        - pop "dir2/f", "dir2/dir3" from the stack, reverse and pack them
        - go up to the root node, do the same to write "a", "dir1" and "dir2" in
          that order

    ## Special case for the root node

    The root node is not serialized in the format, but its information is
    written to the docket. Again, see more details on the on-disk format in
    `mercurial/helptext/internals/dirstate-v2`.
    r
ssc

Ss|d
S)Nr
r)
�
xrrr�<lambda>
szpack_dirstate.<locals>.<lambda>)
�key�Nr:T���)�	bytearrayr#r
r@�sorted�itemsr7�append�	enumerate�
get_folder�move_to_correct_node_in_treer-�trackedrCrB�is_ancestor�pack_directory_childrenr5rL�poprA)r
rrrr�nodes_with_entry_count�nodes_with_copy_source_count�unreachable_bytes�unused�ignore_patterns_hashr�
sorted_map�stack�current_node�indexr5r<�current_folder�should_pack�	next_pathrL�in_ancestor_of_next_pathrrr�
pack_dirstate�s�K












�	









�










�


��








�
rjc

Csd
|vr|�d
d�dSdS)zU
    Return the folder of the path that's given, an empty string for root paths.
    r9r:r
rP)
�rsplit)
r5rrrrWT
srWcCsD|
d
krdS||
k
rdS|�d�
}|
�d�
}t
dd�t||�D�
�
S)a
Returns whether `maybe_ancestor` is an ancestor of `path`.

    >>> is_ancestor(b"a", b"")
    True
    >>> is_ancestor(b"a/b/c", b"a/b/c")
    False
    >>> is_ancestor(b"hgext3rd/__init__.py", b"hgext")
    False
    >>> is_ancestor(b"hgext3rd/__init__.py", b"hgext3rd")
    True
    rPTFr9c
ss�|]	\}
}|
|kV
qdSr6r)�.0�
c�
orrr�	<genexpr>m
s�zis_ancestor.<locals>.<genexpr>)�split�all�zip)r5�maybe_ancestor�path_components�ancestor_componentsrrrrZ[
s







rZcCs�||
jkrSt
||
j�rK|t|
j�
d
��d�
}|�dd�d}|
jr*|
jd|}n|}|d}|j|kr8|}
n|
jd7_t|d
|
�}
|�|
�

n|
j}
||
jks|
S)z�
    Move inside the dirstate node tree to the node corresponding to
    `target_folder`, creating the missing nodes along the way if needed.
    Nr9r:r
rQ)	r5rZr#�lstriprpr-r7rUrL)�
target_folderrdrc�prefix�subfolder_name�subfolder_path�	next_noderrrrXp
s 










�rXcCs�g}|d
jdkr+t
|d
j�
|jkr+|�|���

|d
jdkr+t
|d
j�
|jks|s5t�d|j�
�
|��
t�}|D]0}|j|
t	|�
d�}|�
|�

|�
|j�

|�
|
�|jd��

|j|j7_|j
|j
7_
q>t	|�
|_|�
|�

dS)z_
    Write the binary representation of the direct sorted children of `node` to
    `data`
    rQrPsno direct children for %r)rrEN)r5rWrUr\r�ProgrammingError�reverserRr@r#�extendr;rCrBrA)�noderrrc�direct_children�packed_children�child�packedrrrr[�
s""
"�










r[)�
__future__r�struct�
thirdpartyr�rr�	importmodr�TREE_METADATA_SIZEr�Structr
rr1r?rrr�
s�objectr7rjrWrZrXr[rrrr�<module>
s.





)
0$