3
tûœ]Å)  ã               @   s  d Z ddlmZ ddlZddlZddlZddlmZ yddlZddlm	Z	 W n$ e
k
rp   ddlmZm	Z	 Y nX dZG dd	„ d	eƒZG d
d„ deƒZG dd„ deƒZG dd„ deƒZG dd„ deƒZddd„Zddd„Zdd„ Zd dd„Zedk�reejdd… ƒ dS )!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   z0.6.1c               @   s0   e Zd ZdZdd„ Zdd„ Zdd„ Zdd	„ Zd
S )Ú
ASTVisitorz'Performs a depth-first walk of the AST.c             C   s   d | _ i | _d S )N)ÚnodeÚ_cache)Úself© r
   ú(/tmp/pip-build-fn42xldr/mccabe/mccabe.pyÚ__init__   s    zASTVisitor.__init__c             G   s&   x t |ƒD ]}| j|f|žŽ  q
W d S )N)r   Údispatch)r	   r   ÚargsÚchildr
   r
   r   Údefault   s    zASTVisitor.defaultc             G   sR   || _ |j}| jj|ƒ}|d krD|j}t| jd| | jƒ}|| j|< ||f|žŽ S )NÚvisit)r   Ú	__class__r   ÚgetÚ__name__ÚgetattrÚvisitorr   )r	   r   r   ÚklassÚmethZ	classNamer
   r
   r   r   !   s    
zASTVisitor.dispatchc             G   s"   || _ | j|_| j|f|žŽ  dS )z&Do preorder walk of tree using visitorN)r   r   r   )r	   Útreer   r   r
   r
   r   Úpreorder+   s    zASTVisitor.preorderN)r   Ú
__module__Ú__qualname__Ú__doc__r   r   r   r   r
   r
   r
   r   r      s
   
r   c               @   s&   e Zd Zd	dd„Zdd„ Zdd„ ZdS )
ÚPathNodeÚcirclec             C   s   || _ || _d S )N)ÚnameÚlook)r	   r    r!   r
   r
   r   r   3   s    zPathNode.__init__c             C   s   t d| j| j| jƒ f ƒ d S )Nznode [shape=%s,label="%s"] %d;)Úprintr!   r    Údot_id)r	   r
   r
   r   Úto_dot7   s    zPathNode.to_dotc             C   s   t | ƒS )N)Úid)r	   r
   r
   r   r#   ;   s    zPathNode.dot_idN)r   )r   r   r   r   r$   r#   r
   r
   r
   r   r   2   s   
r   c               @   s.   e Zd Zddd„Zdd„ Zdd„ Zdd	„ Zd
S )Ú	PathGraphr   c             C   s&   || _ || _|| _|| _ttƒ| _d S )N)r    ÚentityÚlinenoÚcolumnr   ÚlistÚnodes)r	   r    r'   r(   r)   r
   r
   r   r   @   s
    zPathGraph.__init__c             C   s   | j | j|ƒ g | j |< d S )N)r+   Úappend)r	   Zn1Zn2r
   r
   r   ÚconnectG   s    zPathGraph.connectc             C   sj   t dƒ x| jD ]}|jƒ  qW x<| jjƒ D ].\}}x$|D ]}t d|jƒ |jƒ f ƒ q:W q,W t dƒ d S )Nz
subgraph {z	%s -- %s;Ú})r"   r+   r$   Úitemsr#   )r	   r   ZnextsÚnextr
   r
   r   r$   L   s    
 zPathGraph.to_dotc             C   s.   t dd„ | jjƒ D ƒƒ}t| jƒ}|| d S )zG Return the McCabe complexity for the graph.
            V-E+2
        c             S   s   g | ]}t |ƒ‘qS 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    
zPathGraph.complexityN)r   )r   r   r   r   r-   r$   r8   r
   r
   r
   r   r&   ?   s   
	r&   c                   s¨   e Zd ZdZ‡ fdd„Zdd„ Zdd„ Zdd	„ ZeZd
d„ Z	dd„ Z
dd„ Z‡ fdd„Zdd„ Ze Z ZZdd„ Zf fdd„Zdd„ Zdd„ ZeZdd„ ZeZ‡  ZS )ÚPathGraphingAstVisitorz\ A visitor for a parsed Abstract Syntax Tree which finds executable
        statements.
    c                s&   t t| ƒjƒ  d| _i | _| jƒ  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 ]}| j |ƒ qW d S )N)r   )r	   Z	node_listr   r
   r
   r   Údispatch_listm   s    
z$PathGraphingAstVisitor.dispatch_listc             C   sÚ   | j rd| j |jf }n|j}d|j|j|f }| jd k	rˆ| j|ƒ}|| _| j|jƒ t	ddd�}| jj
| j|ƒ | jj
||ƒ || _nNt|||j|jƒ| _t	|ƒ}|| _| j|jƒ | j| jd| j |jf < | jƒ  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 |jd 7  _ | j|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| j |ƒ || _ |S )N)r@   r   r?   r-   )r	   r    rF   r
   r
   r   rD   “   s    z%PathGraphingAstVisitor.appendPathNodec             C   s,   |j d krd}n|j }d| }| j|ƒ d S )Nr   zStmt %d)r(   rD   )r	   r   r(   r    r
   r
   r   ÚvisitSimpleStatement›   s
    
z+PathGraphingAstVisitor.visitSimpleStatementc                s2   t |tjƒr| j|ƒ ntt| ƒj|f|žŽ  d S )N)Ú
isinstancer   ÚstmtrK   r;   r9   r   )r	   r   r   )r   r
   r   r   £   s    zPathGraphingAstVisitor.defaultc             C   s   d|j  }| j||ƒ d S )NzLoop %d)r(   Ú	_subgraph)r	   r   r    r
   r
   r   Ú	visitLoop©   s    
z PathGraphingAstVisitor.visitLoopc             C   s   d|j  }| j||ƒ d S )NzIf %d)r(   rN   )r	   r   r    r
   r
   r   ÚvisitIf¯   s    
zPathGraphingAstVisitor.visitIfc             C   sp   | j dkrTt|||j|jƒ| _ t|ƒ}| j|||ƒ | j | jd| j|f < | jƒ  n| j	|ƒ}| j|||ƒ dS )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   rN   ³   s    


z PathGraphingAstVisitor._subgraphc             C   s´   g }|| _ | j|jƒ |j| j ƒ x*|D ]"}|| _ | j|jƒ |j| j ƒ q(W |jrt|| _ | j|jƒ |j| j ƒ n
|j|ƒ |r°tddd�}x|D ]}| jj||ƒ q”W || _ dS )z@parse the body and any `else` block of `if` and `for` statementsr:   rB   )r!   N)r@   rA   rE   r,   Zorelser   r?   r-   )r	   r   rF   rR   Z
loose_endsÚextrarG   Úler
   r
   r   rQ   À   s$    


z&PathGraphingAstVisitor._subgraph_parsec             C   s    d|j  }| j|||jd� d S )NzTryExcept %d)rR   )r(   rN   Úhandlers)r	   r   r    r
   r
   r   ÚvisitTryExceptÖ   s    
z%PathGraphingAstVisitor.visitTryExceptc             C   s$   d|j  }| j|ƒ | j|jƒ d S )NzWith %d)r(   rD   rA   rE   )r	   r   r    r
   r
   r   Ú	visitWithÜ   s    

z PathGraphingAstVisitor.visitWith)r   r   r   r   r   r>   rA   rH   ZvisitAsyncFunctionDefrJ   rD   rK   r   rO   ZvisitAsyncForZvisitForZ
visitWhilerP   rN   rQ   rV   ZvisitTryrW   ZvisitAsyncWithÚ__classcell__r
   r
   )r   r   r9   ^   s&   r9   c               @   sL   e Zd ZdZdZeZdZdZdZ	dd„ Z
edd	„ ƒZed
d„ ƒZdd„ ZdS )ÚMcCabeCheckerz%McCabe cyclomatic complexity checker.ZmccabeZC901zC901 %r is too complex (%d)é   c             C   s
   || _ d S )N)r   )r	   r   Úfilenamer
   r
   r   r   ì   s    zMcCabeChecker.__init__c             C   sb   d}ddddddœ}t |dd ƒ}t|tƒrP|jd	ƒ |j|f|Ž |jjd
ƒ n|j|f|Ž d S )Nz--max-complexityrZ   ÚstoreÚintzMcCabe complexity thresholdÚTrue)r   ÚactionÚtypeÚhelpÚparse_from_configÚconfig_optionsrb   zmax-complexityéÿÿÿÿ)r   rL   r*   ÚpopÚ
add_optionrc   r,   )ÚclsÚparserÚflagÚkwargsZconfig_optsr
   r
   r   Úadd_optionsï   s    

zMcCabeChecker.add_optionsc             C   s   t |jƒ| _d S )N)r]   Úmax_complexity)rg   Úoptionsr
   r
   r   Úparse_options  s    zMcCabeChecker.parse_optionsc             c   sr   | j dk rd S tƒ }|j| j|ƒ xJ|jjƒ D ]<}|jƒ | j kr.| j|j|jƒ f }|j	|j
|t| ƒfV  q.W d S )Nr   )rl   r9   r   r   r=   r7   r8   Ú_error_tmplr'   r(   r)   r`   )r	   r   r?   Útextr
   r
   r   Úrun  s    
zMcCabeChecker.runNrd   )r   r   r   r   r    Ú__version__ÚversionÚ_codero   rl   r   Úclassmethodrk   rn   rq   r
   r
   r
   r   rY   ä   s   rY   é   Ústdinc       
      C   s®   yt | |dtjƒ}W n4 tk
rH   tjƒ d }tjjd||f ƒ dS X g }|t_	x2t||ƒj
ƒ D ] \}}}}	|jd|||f ƒ qdW t|ƒdkr˜dS tdj|ƒƒ t|ƒS )NÚexecrZ   zUnable to parse %s: %s
r   z%s:%d:1: %sÚ
)Úcompiler   ÚPyCF_ONLY_ASTÚSyntaxErrorÚsysÚexc_infoÚstderrÚwriterY   rl   rq   r,   r1   r"   Újoin)
ÚcodeÚ	thresholdr[   r   ÚeZcomplxr(   Úoffsetrp   Úcheckr
   r
   r   Úget_code_complexity  s    r‡   c             C   s,   t | dƒ�}|jƒ }W dQ 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Ô   dt j  k odk n  r6t| dƒ�
}|jƒ S Q R X nšdt j  koJdk n  rÐy*t| dƒ�}tj|jƒ\}}W d Q R X W n6 ttt	fk
r°   t| dd	��
}|jƒ S Q R X Y nX t| d
|d	��
}|jƒ S Q R X d S )Nr5   é   é   r   rˆ   é   Úrbzlatin-1)ÚencodingÚr)r5   rŽ   )r�   r   )r�   r   )r�   r   )
r}   Úversion_infor‰   rŠ   ÚtokenizeÚdetect_encodingÚreadlineÚLookupErrorr|   ÚUnicodeError)r[   Úfr’   Ú_r
   r
   r   Ú_read+  s    rœ   c             C   s  | d krt jdd … } tjƒ }|jdddddd� |jdd	d
dddd� |j| ƒ\}}t|d ƒ}t||d dtj	ƒ}t
ƒ }|j||ƒ |jrÒtdƒ x0|jjƒ D ]"}|j s¼|jƒ |jkr¢|jƒ  q¢W tdƒ n2x0|jjƒ D ]"}|jƒ |jkrÞt|j|jƒ ƒ qÞW d S )NrZ   z-dz--dotÚdotzoutput a graphviz dot fileÚ
store_true)Údestra   r_   z-mz--minrƒ   zminimum complexity for outputr]   )rŸ   ra   r`   r   r   rx   zgraph {r.   )r}   ÚargvÚoptparseÚOptionParserrf   Ú
parse_argsrœ   rz   r   r{   r9   r   r�   r"   r=   r7   rƒ   r8   r$   r    )r    Zoparrm   r   r‚   r   r   r?   r
   r
   r   Úmain<  s.    



r¤   Ú__main__rZ   )rv   rw   )rv   )N)r   Ú
__future__r   r¡   r}   r•   Úcollectionsr   r   r   ÚImportErrorZflake8.utilrr   Úobjectr   r   r&   r9   rY   r‡   r�   rœ   r¤   r   r    r
   r
   r
   r   Ú<module>   s.    -



