Your IP : 216.73.216.196
B
�s�X�) � @ s d Z ddlmZ ddlZddlZddlZddlmZ yddlZddlm Z W n$ e
k
rp ddl mZm Z Y nX dZ G dd � d e
�ZG d
d � d e
�ZG d d
� d
e
�ZG dd� de�ZG dd� de
�Zd dd�Zd dd�Zdd� Zd dd�Zed k�reejd d� � dS )!z� Meager code path measurement tool.
Ned Batchelder
http://nedbatchelder.com/blog/200803/python_code_complexity_microtool.html
MIT License.
� )�with_statementN)� defaultdict)�iter_child_nodes)�astr z0.6.1c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �
ASTVisitorz'Performs a depth-first walk of the AST.c C s d | _ i | _d S )N)�node�_cache)�self� r
�7/opt/alt/python37/lib/python3.7/site-packages/mccabe.py�__init__ s zASTVisitor.__init__c G s& x t |�D ]}| j|f|�� q
W d S )N)r �dispatch)r r �args�childr
r
r �default s zASTVisitor.defaultc G sR || _ |j}| j�|�}|d krD|j}t| jd| | j�}|| j|< ||f|�� S )N�visit)r � __class__r �get�__name__�getattr�visitorr )r r r �klass�methZ classNamer
r
r r
! s
zASTVisitor.dispatchc G s" || _ | j|_| j|f|�� dS )z&Do preorder walk of tree using visitorN)r r
r )r �treer r r
r
r �preorder+ s zASTVisitor.preorderN)r �
__module__� __qualname__�__doc__r r r
r r
r
r
r r s
r c @ s& e Zd Zd dd�Zdd� Zdd� ZdS )
�PathNode�circlec C s || _ || _d S )N)�name�look)r r r! r
r
r r 3 s zPathNode.__init__c C s t d| j| j| �� f � d S )Nz node [shape=%s,label="%s"] %d;)�printr! r �dot_id)r r
r
r �to_dot7 s zPathNode.to_dotc C s t | �S )N)�id)r r
r
r r# ; s zPathNode.dot_idN)r )r r r r r$ r# r
r
r
r r 2 s
r c @ s. e Zd Zd dd�Zdd� Zdd� Zdd � Zd
S ) � PathGraphr c C s& || _ || _|| _|| _tt�| _d S )N)r �entity�lineno�columnr �list�nodes)r r r' r( r) r
r
r r @ s
zPathGraph.__init__c C s | j | �|� g | j |< d S )N)r+ �append)r Zn1Zn2r
r
r �connectG s zPathGraph.connectc C sj t d� x| jD ] }|�� qW x<| j�� D ].\}}x$|D ] }t d|�� |�� f � q:W q,W t d� d S )Nz
subgraph {z %s -- %s;�})r" r+ r$ �itemsr# )r r Znexts�nextr
r
r r$ L s
zPathGraph.to_dotc C s. t dd� | j�� D ��}t| j�}|| d S )zG Return the McCabe complexity for the graph.
V-E+2
c S s g | ] }t |��qS r
)�len)�.0�nr
r
r �
<listcomp>Y s z(PathGraph.complexity.<locals>.<listcomp>� )�sumr+ �valuesr1 )r Z num_edgesZ num_nodesr
r
r �
complexityU s
zPathGraph.complexityN)r )r r r r r- r$ r8 r
r
r
r r& ? s
r& c s� e Zd ZdZ� fdd�Zdd� Zdd� Zdd � ZeZd
d � Z d d
� Z
dd� Z � fdd�Z dd� Z
e
Z ZZdd� Zd dd�Zdd� Zdd � ZeZd d � ZeZ� ZS ) �PathGraphingAstVisitorz\ A visitor for a parsed Abstract Syntax Tree which finds executable
statements.
c s& t t| ��� d| _i | _| �� d S )N� )�superr9 r � classname�graphs�reset)r )r r
r r c s z PathGraphingAstVisitor.__init__c C s d | _ d | _d S )N)�graph�tail)r r
r
r r> i s z PathGraphingAstVisitor.resetc C s x|D ]}| � |� qW d S )N)r
)r Z node_listr r
r
r �
dispatch_listm s
z$PathGraphingAstVisitor.dispatch_listc C s� | j rd| j |jf }n|j}d|j|j|f }| jd k r�| �|�}|| _| �|j� t ddd�}| j�
| j|� | j�
||� || _nNt |||j|j�| _t |�}|| _| �|j� | j| j d| j |jf < | �
� d S )Nz%s%sz %d:%d: %rr: �point)r! )r< r r( �
col_offsetr? �appendPathNoder@ rA �bodyr r- r& r= r> )r r r' r �pathnode�bottomr
r
r �visitFunctionDefq s$
z'PathGraphingAstVisitor.visitFunctionDefc C s0 | j }| j |jd 7 _ | �|j� || _ d S )N�.)r< r rA rE )r r Z
old_classnamer
r
r �
visitClassDef� s z$PathGraphingAstVisitor.visitClassDefc C s, | j s
d S t|�}| j�| j |� || _ |S )N)r@ r r? r- )r r rF r
r
r rD � s z%PathGraphingAstVisitor.appendPathNodec C s, |j d krd}n|j }d| }| �|� d S )Nr zStmt %d)r( rD )r r r( r r
r
r �visitSimpleStatement� s
z+PathGraphingAstVisitor.visitSimpleStatementc s2 t |tj�r| �|� ntt| �j|f|�� d S )N)�
isinstancer ZstmtrK r; r9 r )r r r )r r
r r � s z PathGraphingAstVisitor.defaultc C s d|j }| �||� d S )NzLoop %d)r( � _subgraph)r r r r
r
r � visitLoop� s
z PathGraphingAstVisitor.visitLoopc C s d|j }| �||� d S )NzIf %d)r( rM )r r r r
r
r �visitIf� s
z PathGraphingAstVisitor.visitIfr
c C sp | j dkrTt|||j|j�| _ t|�}| �|||� | j | jd| j|f < | �� n| � |�}| �|||� dS )z?create the subgraphs representing any `if` and `for` statementsNz%s%s)
r? r& r( rC r �_subgraph_parser= r< r> rD )r r r � extra_blocksrF r
r
r rM � s
z PathGraphingAstVisitor._subgraphc C s� g }|| _ | �|j� |�| j � x*|D ]"}|| _ | �|j� |�| j � q(W |jrt|| _ | �|j� |�| j � n
|�|� |r�tddd�}x|D ]}| j�||� q�W || _ dS )z@parse the body and any `else` block of `if` and `for` statementsr: rB )r! N)r@ rA rE r, Zorelser r? r- )r r rF rQ Z
loose_ends�extrarG �ler
r
r rP � s$
z&PathGraphingAstVisitor._subgraph_parsec C s d|j }| j|||jd� d S )Nz TryExcept %d)rQ )r( rM �handlers)r r r r
r
r �visitTryExcept� s
z%PathGraphingAstVisitor.visitTryExceptc C s$ d|j }| �|� | �|j� d S )NzWith %d)r( rD rA rE )r r r r
r
r � visitWith� s
z PathGraphingAstVisitor.visitWith)r
)r r r r r r> rA rH ZvisitAsyncFunctionDefrJ rD rK r rN Z
visitAsyncForZvisitForZ
visitWhilerO rM rP rU ZvisitTryrV ZvisitAsyncWith�
__classcell__r
r
)r r r9 ^ s&
r9 c @ sL e Zd ZdZdZeZdZdZdZ dd� Z
e dd � �Z e d
d � �Z
d d
� ZdS )�
McCabeCheckerz%McCabe cyclomatic complexity checker.�mccabeZC901zC901 %r is too complex (%d)���c C s
|| _ d S )N)r )r r �filenamer
r
r r � s zMcCabeChecker.__init__c C sb d}dddddd�}t |dd �}t|t�rP|�d � |j|f|� |j�d
� n|j|f|� d S ) Nz--max-complexityrZ �store�intzMcCabe complexity threshold�True)r �action�type�help�parse_from_config�config_optionsrb zmax-complexity)r rL r* �pop�
add_optionrc r, )�cls�parser�flag�kwargsZ config_optsr
r
r � add_options� s
zMcCabeChecker.add_optionsc C s t |j�| _d S )N)r] �max_complexity)rf �optionsr
r
r �
parse_options s zMcCabeChecker.parse_optionsc c sr | j dk rd S t� }|�| j|� xJ|j�� D ]<}|�� | j kr.| j|j|�� f }|j |j
|t | �fV q.W d S )Nr ) rk r9 r r r= r7 r8 � _error_tmplr' r( r) r` )r r r? �textr
r
r �run s
zMcCabeChecker.runN)r r r r r � __version__�version�_codern rk r � classmethodrj rm rp r
r
r
r rX � s rX � �stdinc
C s� yt | |dtj�}W n4 tk
rH t�� d }tj�d||f � dS X g }|t_ x2t||��
� D ] \}}}} |� d|||f � qdW t |�dkr�dS t
d�|�� t |�S )N�exec� zUnable to parse %s: %s
r z %s:%d:1: %s�
)�compiler �
PyCF_ONLY_AST� SyntaxError�sys�exc_info�stderr�writerX rk rp r, r1 r" �join)
�code� thresholdr[ r �eZcomplxr( �offsetro �checkr
r
r �get_code_complexity s r� c C s, t | d��}|�� }W dQ R X t||| d�S )z"Returns the complexity of a module�rUN)r[ )�open�readr� )� module_pathr� �modr� r
r
r �get_module_complexity$ s r� c C s� dt j k rdk r6n n t| d��
}|�� S Q R X n�dt j krLdk r�n n�y*t| d��}t�|j�\}}W d Q R X W n6 ttt fk
r� t| dd��
}|�� S Q R X Y nX t| d|d��
}|�� S Q R X d S ) N)r5 � )� r r� )� r �rbzlatin-1)�encoding�r)
r} � version_infor� r� �tokenize�detect_encoding�readline� LookupErrorr| � UnicodeError)r[ �fr� �_r
r
r �_read+ s r� c C s | d krt jdd � } t�� }|jdddddd� |jdd d
d d dd
� |�| �\}}t|d �}t||d dtj �}t
� }|� ||� |j r�t
d� x.|j�� D ] }|jr�|�� |jkr�|�� q�W t
d� n2x0|j�� D ]"}|�� |jkr�t
|j|�� � q�W d S )Nrx z-dz--dot�dotzoutput a graphviz dot file�
store_true)�destra r_ z-mz--minr� z minimum complexity for outputr] )r� ra r` r r rw zgraph {r. )r} �argv�optparse� OptionParserre �
parse_argsr� rz r r{ r9 r r� r" r= r7 r� r8 r$ r )r� Zoparrl r r� r r r? r
r
r �main< s.
r� �__main__rx )ru rv )ru )N)r �
__future__r r� r} r� � collectionsr r r � ImportErrorZ flake8.utilrq �objectr r r& r9 rX r� r� r� r� r r� r
r
r
r �<module> s.
-