File: //opt/saltstack/salt/lib/python3.10/lib2to3/__pycache__/refactor.cpython-310.pyc
o
�N�gsk � @ s d Z dZddlZddlZddlZddlZddlZddlZddlZddl m
Z
ddl m Z m
Z
mZ ddlmZ ddlmZmZ dd lmZ d!d d �ZG d
d� de�Zdd� Zdd� Zdd� Zdd� Z dd� Z G dd� de�Z G dd � d e �Z G d d � d e�Z!G d d � d e �Z"dS )"z�Refactoring framework.
Used as a main program, this can refactor any number of files and/or
recursively descend down directories. Imported as a module, this
provides infrastructure to write your own refactoring tool.
z#Guido van Rossum <guido@python.org>� N)�chain� )�driver�tokenize�token)� find_root)�pytree�pygram)� btm_matcherTc C sT t | g g dg�}g }t�|j�D ]\}}}|�d�r'|r"|dd� }|�|� q|S )zEReturn a sorted list of all available fix names in the given package.�*�fix_� N)�
__import__�pkgutilZ iter_modules�__path__�
startswith�append)Z fixer_pkgZ
remove_prefixZpkgZ fix_names�finder�nameZispkg� r �6/opt/saltstack/salt/lib/python3.10/lib2to3/refactor.py�get_all_fix_names s
�r c @ � e Zd ZdS )�
_EveryNodeN��__name__�
__module__� __qualname__r r r r r + � r c C s� t | tjtjf�r| jdu rt�| jhS t | tj�r$| jr"t| j�S t�t | tj �rAt
� }| jD ]}|D ] }|� t|�� q4q0|S t d| ��)zf Accepts a pytree Pattern Node and returns a set
of the pattern types which will match first. Nz$Oh no! I don't understand pattern %s)
�
isinstancer Z NodePatternZ LeafPattern�typer ZNegatedPattern�content�_get_head_typesZWildcardPattern�set�update� Exception)�pat�r�p�xr r r r" / s
� r" c C s� t �t�}g }| D ];}|jr1zt|j�}W n ty# |�|� Y q w |D ] }|| �|� q&q |jdur?||j �|� q |�|� q tt j
j � � t j
j
�D ] }|| �|� qPt|�S )z^ Accepts a list of fixers and returns a dictionary
of head node type --> fixer list. N)� collections� defaultdict�list�patternr" r r Z _accept_typer r �python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ node_typer r r �_get_headnode_dictK s(
��
�r4 c s � fdd�t � d�D �S )zN
Return the fully qualified names for fixers in the package pkg_name.
c s g | ]}� d | �qS ��.r )�.0�fix_name��pkg_namer r �
<listcomp>h s �z+get_fixers_from_package.<locals>.<listcomp>F)r r9 r r9 r �get_fixers_from_packaged s
�r< c C s | S �Nr )�objr r r � _identityk s r? c sj d}t �t�| �j�� � fdd�}ttjt jtj h�}t
� }z� |� \}}||v r*q |tj kr5|r2ncd}n_|tj kr�|dkr�|� \}}|tj ksL|dkrMnR|� \}}|tj ks[|dkr\nH|� \}}|tj
kro|dkro|� \}}|tj kr�|�|� |� \}}|tj
ks�|d kr�n
|� \}}|tj kstnnq W t|�S W t|�S W t|�S W t|�S ty� Y t|�S w )
NFc s t � �} | d | d fS )Nr r )�next)�tok��genr r �advancer s z(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r �generate_tokens�io�StringIO�readline� frozensetr �NEWLINE�NL�COMMENTr# �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringrD �ignore�features�tp�valuer rB r �_detect_future_featureso s\
������ ��r[ c @ s e Zd ZdZdS )�
FixerErrorz A fixer could not be loaded.N)r r r �__doc__r r r r r\ � s r\ c @ s� e Zd Zdddd�ZdZdZd4dd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d5dd�Z d5dd�Z
dd� Zd5dd�Zdd� Zd6d d �Zd d � Zd d!� Z d7d"d#�Zd8d$d%�Zd&Zd'Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Z d2d3� Z dS )9�RefactoringToolF)�print_function�
exec_function�write_unchanged_filesZFixr Nc C sH || _ |pg | _| j�� | _|dur| j�|� tj�� | _| jd r)| jj d= n
| jd r3| jj d= | j�
d�| _ g | _ t
�d�| _g | _d| _tj| jtj| jd �| _| �� \| _| _g | _t�� | _ g | _ g | _ t | j| j�D ]#}|j r~| j �!|� qr|| jv r�| j �"|� qr|| jv r�| j �"|� qrt#| j �| _$t#| j �| _%dS )
z�Initializer.
Args:
fixer_names: a list of fixers to import
options: a dict with configuration.
explicit: a list of fixers to run even if they are explicit.
Nr_ �printr` �execra r^ F)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr$ r r. �grammar�keywords�getra �errors�logging� getLoggerre � fixer_log�wroter ZDriverr rd �
get_fixers� pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderr Z
BM_compatibleZ add_fixerr r4 �bmi_pre_order_heads�bmi_post_order_heads)�selfZ fixer_namesrj rg r3 r r r �__init__� sD
�
� zRefactoringTool.__init__c C sJ g }g }| j D ]�}t|i i dg�}|�dd�d }|�| j�r(|t| j�d� }|�d�}| jd�dd � |D �� }zt ||�}W n t
yQ t d
||f �d�w || j | j
�} | jrm| jd urm|| jvrm| �d |� q| �d
|� | jdkr~|�| � q| jdkr�|�| � qt d| j ��t�d�}
|j|
d� |j|
d� ||fS )a Inspects the options to load the requested patterns and handlers.
Returns:
(pre_order, post_order), where pre_order is the list of fixers that
want a pre-order AST traversal, and post_order is the list that want
post-order traversal.
r r6 r ���N�_� c S s g | ]}|� � �qS r )�title)r7 r( r r r r; � s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ run_order��key)rf r �rsplitr � FILE_PREFIX�len�split� CLASS_PREFIX�join�getattr�AttributeErrorr\ rj rq rg � log_message� log_debug�orderr �operator�
attrgetter�sort) r{ Zpre_order_fixersZpost_order_fixersZ fix_mod_path�modr8 �parts�
class_nameZ fix_classr3 Zkey_funcr r r rs � s:
�
zRefactoringTool.get_fixersc O s � )z Called when an error occurs.r )r{ �msg�args�kwdsr r r � log_error s zRefactoringTool.log_errorc G s |r|| }| j �|� dS )zHook to log a message.N)re �info�r{ r� r� r r r r� s zRefactoringTool.log_messagec G s |r|| }| j �|� d S r= )re �debugr� r r r r�
s zRefactoringTool.log_debugc C s dS )zTCalled with the old version, new version, and filename of a
refactored file.Nr )r{ �old_text�new_text�filename�equalr r r � print_output s z RefactoringTool.print_outputc C s8 |D ]}t j�|�r| �|||� q| �|||� qdS )z)Refactor a list of files and directories.N)�os�path�isdir� refactor_dir�
refactor_file)r{ �items�write�
doctests_onlyZ dir_or_filer r r �refactor s
�zRefactoringTool.refactorc
C s� t jd }t �|�D ]@\}}}| �d|� |�� |�� |D ] }|�d�s>t j�|�d |kr>t j�||�} | � | ||� q dd� |D �|dd�< q
dS )z�Descends down a directory and refactor every Python file found.
Python files are assumed to have a .py extension.
Files and subdirectories starting with '.' are skipped.
�pyzDescending into %sr6 r c S s g | ] }|� d �s|�qS r5 )r )r7 �dnr r r r; 2 � z0RefactoringTool.refactor_dir.<locals>.<listcomp>N)
r� �extsep�walkr� r� r r� �splitextr� r� )
r{ Zdir_namer� r� Zpy_ext�dirpath�dirnames� filenamesr �fullnamer r r r� s
��z RefactoringTool.refactor_dirc
C s� zt |d�}W n ty! } z| �d||� W Y d}~dS d}~ww zt�|j�d }W |�� n|�� w tj |d|dd��}|�� |fW d � S 1 sPw Y dS ) zG
Do our best to decode a Python source file correctly.
�rbzCan't open %s: %sN�NNr r' r ��encoding�newline) �open�OSErrorr� r �detect_encodingrL �closerJ �read)r{ r� �f�errr� r r r �_read_python_source4 s ��
$�z#RefactoringTool._read_python_sourcec C s� | � |�\}}|du r
dS |d7 }|r9| �d|� | �||�}| js&||kr1| �|||||� dS | �d|� dS | �||�}| jsG|rX|jrX| jt|�dd� |||d� dS | �d|� dS )zRefactors a file.N�
zRefactoring doctests in %szNo doctest changes in %sr} )r� r� zNo changes in %s)r� r� �refactor_docstringra �processed_file�refactor_string� was_changed�str)r{ r� r� r� �inputr� �output�treer r r r� D s
�z RefactoringTool.refactor_filec
C s� t |�}d|v r
tj| j_z3z| j�|�}W n# ty9 } z| �d||jj |� W Y d}~W | j| j_dS d}~ww W | j| j_n| j| j_w ||_
| � d|� | � ||� |S )aF Refactor a given input string.
Args:
data: a string holding the code to be refactored.
name: a human-readable name for use in error/log messages.
Returns:
An AST corresponding to the refactored input stream; None if
there were errors during the parse.
r_ zCan't parse %s: %s: %sNzRefactoring %s)
r[ r Z!python_grammar_no_print_statementr rk � parse_stringr% r� � __class__r �future_featuresr� �
refactor_tree)r{ �datar rX r� r� r r r r� [ s&
� ��� z RefactoringTool.refactor_stringc C s� t j�� }|r)| �d� | �|d�}| js||kr"| �|d|� d S | �d� d S | �|d�}| js7|rB|jrB| �t |�d|� d S | �d� d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr� r� r� ra r� r� r� r� )r{ r� r� r� r� r r r �refactor_stdinv s
z RefactoringTool.refactor_stdinc
C s� t | j| j�D ]}|�||� q| �| j|�� � | �| j|�� � | j�|� � �}t
|� � �r�| jj D ]�}||v r�|| r�|| j
tjjdd� |jrV|| j
tjjd� t|| �D ]o}||| v rk|| �|� zt|� W n tyz Y q\w |jr�||jv r�q\|�|�}|r�|�||�}|dur�|�|� |�� D ]}|js�g |_|j�|� q�| j�|� � �}|D ]} | |vr�g || < || � || � q�q\q4t
|� � �s0t | j| j�D ]}|� ||� q�|j S )a� Refactors a parse tree (modifying the tree in place).
For compatible patterns the bottom matcher module is
used. Otherwise the tree is traversed node-to-node for
matches.
Args:
tree: a pytree.Node instance representing the root of the tree
to be refactored.
name: a human-readable name for this tree.
Returns:
True if the tree was modified, False otherwise.
T)r� �reverser� N) r rt ru Z
start_tree� traverse_byry rz rx �runZleaves�anyr/ rf r� r ZBase�depthZkeep_line_orderZ
get_linenor, �remover �
ValueErrorZfixers_applied�match� transform�replacer r1 Z finish_treer� )
r{ r� r r3 Z match_set�node�results�newZ new_matchesZfxrr r r r� � sP �
� �1z RefactoringTool.refactor_treec C sV |sdS |D ]"}||j D ]}|�|�}|r'|�||�}|dur'|�|� |}q
qdS )a Traverse an AST, applying a set of fixers to each node.
This is a helper method for refactor_tree().
Args:
fixers: a list of fixer instances.
traversal: a generator that yields AST nodes.
Returns:
None
N)r r� r� r� )r{ rf Z traversalr� r3 r� r� r r r r� � s
���zRefactoringTool.traverse_byc C s� | j �|� |du r| �|�d }|du rdS ||k}| �||||� |r0| �d|� | js0dS |r<| �||||� dS | �d|� dS )zR
Called when a file has been refactored and there may be changes.
Nr zNo changes to %szNot writing changes to %s)rv r r� r� r� ra �
write_file)r{ r� r� r� r� r� r� r r r r� � s z RefactoringTool.processed_filec C s� z t j|d|dd�}W n ty% } z| �d||� W Y d}~dS d}~ww |�) z|�|� W n tyI } z
| �d||� W Y d}~nd}~ww W d � n1 sTw Y | �d|� d| _dS ) z�Writes a string to a file.
It first shows a unified diff between the old text and the new text, and
then rewrites the file; the latter is only done if the write option is
set.
�wr r� zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)rJ r� r� r� r� r� rr )r{ r� r� r� r� �fpr� r r r r� s$ ����� �
zRefactoringTool.write_filez>>> z... c
C s g }d}d}d}d}|j dd�D ]d}|d7 }|�� �| j�r?|dur-|�| �||||�� |}|g}|�| j�} |d| � }q|dur\|�|| j �sV||| j�� d kr\|� |� q|durk|�| �||||�� d}d}|� |� q|dur�|�| �||||�� d�
|�S )a� Refactors a docstring, looking for doctests.
This returns a modified version of the input string. It looks
for doctests, which start with a ">>>" prompt, and may be
continued with "..." prompts, as long as the "..." is indented
the same as the ">>>".
(Unfortunately we can't use the doctest module's parser,
since, like most parsers, it is not geared towards preserving
the original source.)
Nr T��keependsr r� r ) �
splitlines�lstripr �PS1r1 �refactor_doctest�find�PS2�rstripr r� )
r{ r� r� �result�blockZ block_lineno�indent�lineno�line�ir r r r� sB � � � �
z"RefactoringTool.refactor_docstringc
s( z �� ||� �}W n4 ty= } z(�j�tj�r&|D ] }��d|�d�� q��d|||j j
|� |W Y d}~S d}~ww �� ||�r�t |�j
dd�}|d|d � ||d d� } }| dg|d ksjJ | ��|d �d�sy|d d7 < � �j |�d � g}|r�|� �fd
d �|D �7 }|S ) z�Refactors one doctest.
A doctest is given as a block of lines, the first of which starts
with ">>>" (possibly indented), while the remaining lines start
with "..." (identically indented).
z
Source: %sr� z+Can't parse docstring in %s line %s: %s: %sNTr� r r} r c s g | ] }� �j | �qS r )r� )r7 r� �r� r{ r r r; ^ r� z4RefactoringTool.refactor_doctest.<locals>.<listcomp>)� parse_blockr% re � isEnabledForro �DEBUGr� r� r� r� r r� r� r� �endswithr� �pop)
r{ r� r� r� r� r� r� r� r� Zclippedr r� r r� D s, ��� "z RefactoringTool.refactor_doctestc C s� | j rd}nd}| js| �d|� n| �d|� | jD ]}| �|� q| jr6| �d� | jD ]}| �|� q.| jrdt| j�dkrF| �d� n | �dt| j�� | jD ]\}}}| j|g|�R i |�� qRd S d S ) N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)rr rv r� rq rn r� )r{ r� �file�messager� r� r� r r r � summarizea s(
�zRefactoringTool.summarizec C s" | j �| �|||��}t� |_|S )z�Parses a block into a tree.
This is necessary to get correct line number / offset information
in the parser diagnostics and embedded into the parse tree.
)r Z parse_tokens� wrap_toksrM r� )r{ r� r� r� r� r r r r� x s zRefactoringTool.parse_blockc c sf � t �| �||�j�}|D ]#\}}\}}\} }
} ||d 7 }| |d 7 } ||||f| |
f| fV q
dS )z;Wraps a tokenize stream to systematically modify start/end.r N)r rI � gen_lines�__next__) r{ r� r� r� r0 r rZ Zline0Zcol0Zline1Zcol1Z line_textr r r r� � s � �zRefactoringTool.wrap_toksc c sx � || j }|| j }|}|D ]'}|�|�r |t|�d� V n||�� d kr,dV ntd||f ��|}q dV q8)z�Generates lines as expected by tokenize from a list of lines.
This strips the first len(indent + self.PS1) characters off each line.
Nr� zline=%r, prefix=%rTr )r� r� r r� r� �AssertionError)r{ r� r� �prefix1Zprefix2�prefixr� r r r r� � s �
�zRefactoringTool.gen_linesr� )FF)F)NFNr= ) r r r rh r� r� r| rs r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r^ � sB �
7(
O
�
+
r^ c @ r )�MultiprocessingUnsupportedNr r r r r r � r r c sF e Zd Z� fdd�Z d � fdd� Z� fdd�Z� fd d
�Z� ZS ) �MultiprocessRefactoringToolc s& t t| �j|i |�� d | _d | _d S r= )�superr r| �queue� output_lock�r{ r� �kwargs�r� r r r| � s
z$MultiprocessRefactoringTool.__init__Fr c
s2 |dkrt t���|||�S zdd l� W n ty t�w �jd ur'td��� �� �_� � � �_
� �fdd�t |�D �}z8|D ]}|� � q@t t���|||� W �j�
� t |�D ]}�j�d � q[|D ]
}|�� rp|�
� qfd �_d S �j�
� t |�D ]}�j�d � q|D ]
}|�� r�|�
� q�d �_w )Nr r z already doing multiple processesc s g | ] }� j �jd ��qS ))�target)ZProcess�_child)r7 r� ��multiprocessingr{ r r r; � s �z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r r r� r � ImportErrorr r � RuntimeErrorZ
JoinableQueue�Lockr �range�startr� �put�is_alive)r{ r� r� r� Z
num_processesZ processesr( r� r r
r r� � sL
� �
�
�
�
� �z$MultiprocessRefactoringTool.refactorc sf | j �� }|d ur1|\}}ztt| �j|i |�� W | j �� n| j �� w | j �� }|d us d S d S r= )r rm r r r� � task_done)r{ Ztaskr� r r r r r � s
��
�z"MultiprocessRefactoringTool._childc s4 | j d ur| j �||f� d S tt| �j|i |��S r= )r r r r r� r r r r r� � s
��z)MultiprocessRefactoringTool.refactor_file)FFr )r r r r| r� r r� �
__classcell__r r r r r � s � r )T)#r] �
__author__rJ r� r r� ro r� r* � itertoolsr Zpgen2r r r Z
fixer_utilr r r r r
rw r r% r r" r4 r< r? r[ r\ �objectr^ r r r r r r �<module> s:
(