Dashboard
PHP:
8.2.30
OS:
Linux
User:
dh_nv8b2m
/
/
usr
/
lib
/
python3
/
dist-packages
/
mercurial
/
dirstateutils
/
__pycache__
📤 Upload
📝 New File
📁 New Folder
Close
Editing: v2.cpython-310.pyc
o �]Lb8; � @ s� d dl mZ d dlZddlmZ ddlmZmZ e�d�Z dZ dZ e� d�Z e� d �Ze e jks2J �e ejks9J �d Zd d � Zd d� Zdd� ZejG dd� de��Zdd� Zdd� Zdd� Zdd� Zdd � ZdS ) � )�absolute_importN� )�attr)�error�policy�parsers�, z >LLLLL4s20sz>LHHLHLLLLHlll� c C s, t �|�\}}}}}} } t| ||||� dS )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 �r c C s� t |�D ]I}|t| }t||t�}t�|�\ }} } } } } }}}}}}}t| ||| |� tj�||||�}|j s9qt||| �}|| |< | rMt|| | �||< qdS )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�NODEr r r � DirstateItem� from_v2_data� any_tracked)r r r �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�pathr r r r S s< � ���r c C s | ||| � S �Nr )r r" r# r r r r | s r c @ s` e Zd Ze�� Ze�� Zejdd�Zejdd�Zejdd�Z ejdd�Z ejdd�Z dd� Z dS )�NodeN)�defaultr c C s� | j }|�|�}| j}|}t|�}|�d�d }|d ur'|t|� } t|�} nd} d} |d ur8|�� \} } } }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+ r0 r1 r2 r3 r r r r@ � s@ �z Node.pack) �__name__� __module__� __qualname__r �ibr5 r< �parentr- rA rB rC r@ r r r r r7 � s r7 c C s� t � }d}d}d}d}d}d}d} t| �dkr&t�||||||| �} || fS t| �� dd� d�} g } tdd�} | �| � t| d �D ]�\}\}}|d 7 }||v rS|d 7 }t |�}t || | �} | j d 7 _ |j rn| j d 7 _ | jd 7 _| �t||| �� d }d}|t| �k r�| | d }t||� }|r�t| ||| � | r�| jdkr�| j}|duo�t|t | d j��}|du s�|r�nt|||| � |} | r�| jdks�qA| �� } | jdks�J | j��t| �dks�J t| ���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 s s c S s | d S )Nr r )�xr r r �<lambda> s z pack_dirstate.<locals>.<lambda>)�key� Nr: T���)� bytearrayr# r r@ �sorted�itemsr7 �append� enumerate� get_folder� move_to_correct_node_in_treer- �trackedrC rB � is_ancestor�pack_directory_childrenr5 rL �poprA )r r r r r �nodes_with_entry_count� nodes_with_copy_source_count�unreachable_bytes�unused�ignore_patterns_hashr � sorted_map�stack� current_node�indexr5 r< �current_folder� should_pack� next_pathrL �in_ancestor_of_next_pathr r r � pack_dirstate� s� K � � � ��� rj c C s d| v r | � dd�d S dS )zU Return the folder of the path that's given, an empty string for root paths. r9 r: r rP )�rsplit)r5 r r r rW T s rW c C sD |dkrdS | |kr dS | � d�}|� d�}tdd� 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 rP TFr9 c s s � | ] \}}||kV qd S r6 r )�.0�c�or r r � <genexpr>m s � z is_ancestor.<locals>.<genexpr>)�split�all�zip)r5 �maybe_ancestor�path_components�ancestor_componentsr r r rZ [ s rZ c C s� | |j krSt| |j �rK| t|j �d� �d�}|�dd�d }|j r*|j d | }n|}|d }|j | kr8|}n| jd7 _t|d|�}|�|� n|j}| |j ks|S )z� Move inside the dirstate node tree to the node corresponding to `target_folder`, creating the missing nodes along the way if needed. Nr9 r: r rQ ) r5 rZ r# �lstriprp r- r7 rU rL )� target_folderrd rc �prefix�subfolder_name�subfolder_path� next_noder r r rX p s �rX c C s� g }|d j dkr+t|d j �| j kr+|�|�� � |d j dkr+t|d j �| j ks|s5t�d| j ��|�� t� }|D ]0}|j|t |�d�}|� |� |� |j � |� |� |j d�� | j |j 7 _ | j |j 7 _ q>t |�| _|� |� dS )z_ Write the binary representation of the direct sorted children of `node` to `data` rQ rP s no direct children for %r)r rE N)r5 rW rU r\ r �ProgrammingError�reverserR r@ r# �extendr; rC rB rA )�noder r rc �direct_children�packed_children�child�packedr r r r[ � s" ""� r[ ) � __future__r �struct� thirdpartyr � r r � importmodr �TREE_METADATA_SIZEr �Structr r r1 r? r r r �s�objectr7 rj rW rZ rX r[ r r r r �<module> s. )0 $
Save
Cancel