⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.67
Server IP:
50.6.168.112
Server:
Linux server-617809.webnetzimbabwe.com 5.14.0-570.25.1.el9_6.x86_64 #1 SMP PREEMPT_DYNAMIC Wed Jul 9 04:57:09 EDT 2025 x86_64
Server Software:
Apache
PHP Version:
8.4.10
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
lib64
/
python3.9
/
lib2to3
/
__pycache__
/
View File Name :
btm_matcher.cpython-39.pyc
a DOg @ sl d Z dZddlZddlZddlmZ ddlmZ ddlm Z G dd d e Z G d d d e Z i a d d ZdS )a A bottom-up tree matching algorithm implementation meant to speed up 2to3's matching process. After the tree patterns are reduced to their rarest linear path, a linear Aho-Corasick automaton is created. The linear automaton traverses the linear paths from the leaves to the root of the AST and returns a set of nodes for further matching. This reduces significantly the number of candidate nodes.z+George Boutsioukis <gboutsioukis@gmail.com> N) defaultdict )pytree) reduce_treec @ s e Zd ZdZe Zdd ZdS )BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc C s" i | _ g | _ttj| _d| _d S )N )transition_tablefixersnextr countidcontentself r +/usr/lib64/python3.9/lib2to3/btm_matcher.py__init__ s zBMNode.__init__N)__name__ __module__ __qualname____doc__ itertoolsr r r r r r r s r c @ s8 e Zd ZdZdd Zdd Zdd Zdd Zd d Zd S ) BottomMatcherzgThe main matcher class. After instantiating the patterns should be added using the add_fixer methodc C s0 t | _t | _| jg| _g | _td| _d S )NZRefactoringTool) setmatchr rootZnodesr logging getLoggerloggerr r r r r s zBottomMatcher.__init__c C sH | j | t|j}| }| j|| jd}|D ]}|j | q2dS )zReduces a fixer's pattern tree to a linear path and adds it to the matcher(a common Aho-Corasick automaton). The fixer is appended on the matching states and called when they are reachedstartN)r appendr Z pattern_treeZget_linear_subpatternaddr )r fixerZtreeZlinear match_nodesZ match_noder r r add_fixer% s zBottomMatcher.add_fixerc C s |s |gS t |d tr`g }|d D ]6}| j||d}|D ] }|| |dd | q:q$|S |d |jvrt }||j|d < n|j|d }|dd r| j|dd |d}n|g}|S dS )z5Recursively adds a linear pattern to the AC automatonr r r N) isinstancetupler" extendr r )r patternr r$ alternativeZ end_nodesendZ next_noder r r r" 1 s" zBottomMatcher.addc C s | j }tt}|D ]}|}|rd|_|jD ]$}t|tjr*|jdkr*d|_ qPq*|j dkrb|j}n|j }||j v r|j | }|j D ]}|| | qnH| j }|j dur|j jrq||j v r|j | }|j D ]}|| | q|j }qq|S )au The main interface with the bottom matcher. The tree is traversed from the bottom using the constructed automaton. Nodes are only checked once as the tree is retraversed. When the automaton fails, we give it one more shot(in case the above tree matches as a whole with the rejected leaf), then we break for the next leaf. There is the special case of multiple arguments(see code comments) where we recheck the nodes Args: The leaves of the AST tree to be matched Returns: A dictionary of node matches with fixers as the keys T;Fr N)r r listZ was_checkedZchildrenr& r ZLeafvaluetyper r r! parent) r ZleavesZcurrent_ac_noderesultsZleafZcurrent_ast_nodechildZ node_tokenr# r r r runS s8 zBottomMatcher.runc s* t d fdd | j t d dS )z<Prints a graphviz diagram of the BM automaton(for debugging)z digraph g{c sZ | j D ]J}| j | }td| j|jt|t|jf |dkrLt|j | q d S )Nz%d -> %d [label=%s] //%sr )r keysprintr type_reprstrr r )ZnodeZ subnode_keyZsubnode print_noder r r9 s z*BottomMatcher.print_ac.<locals>.print_node}N)r5 r r r r8 r print_ac s zBottomMatcher.print_acN) r r r r r r% r" r3 r; r r r r r s "8r c C sD t s8ddlm} |j D ] \}}t|tkr|t |< qt | | S )Nr )python_symbols) _type_reprsZpygramr< __dict__itemsr/ int setdefault)Ztype_numr< namevalr r r r6 s r6 )r __author__r r collectionsr r r Z btm_utilsr objectr r r= r6 r r r r <module> s