z
. Ity$++--21 1 2 2 2 2 2r c t | S r
)idr
s r r0 zPathNode.dot_id; s
$xxr N)r* )r r$ r% r r1 r0 r' r r r) r) 2 sF 2 2 2 r r) c ( e Zd ZddZd Zd Zd ZdS ) PathGraphr c p || _ || _ || _ || _ t t
| _ d S r
)r, entitylinenocolumnr listnodes)r r, r7 r8 r9 s r r zPathGraph.__init__@ s1 &&
r c Z | j | | g | j |< d S r
)r; append)r n1n2s r connectzPathGraph.connectG s+
2 b!!!
2r c 8 t d | j D ]}| | j D ]C\ }}|D ];}t | d| d z(PathGraph.complexity..Y s ===AQ===r )sumr; valuesrI )r num_edges num_nodess r
complexityzPathGraph.complexityU sK ==):):)<)<===>>
OO 9$q((r N)r )r r$ r% r r@ r1 rR r' r r r5 r5 ? sU ' ' ' '
) ) ) ) )r r5 c e Zd ZdZ fdZd Zd Zd ZeZd Z d Z
d Z fd Z d
Z
e
xZxZZd Zdd
Zd Zd ZeZd ZeZ xZS )PathGraphingAstVisitorz\ A visitor for a parsed Abstract Syntax Tree which finds executable
statements.
c t t | d| _ i | _ | d S )N )superrT r classnamegraphsreset)r r s r r z PathGraphingAstVisitor.__init__c s?
$d++44666
r c " d | _ d | _ d S r
)graphtailr
s r rZ z PathGraphingAstVisitor.reseti s
r c : |D ]}| | d S r
)r )r node_listr s r
dispatch_listz$PathGraphingAstVisitor.dispatch_listm s0 D MM$ r c | j r| j |j }n|j }d|j |j |fz }| j | | }|| _ | |j t dd }| j
| j | | j
|| || _ d S t |||j |j | _ t | }|| _ | |j | j | j | j |j < |
d S )Nz %d:%d: %rrV pointr- )rX r, r8
col_offsetr\ appendPathNoder] r` bodyr) r@ r5 rY rZ )r r r7 r, pathnodebottoms r visitFunctionDefz'PathGraphingAstVisitor.visitFunctionDefq s0 > #~~tyy9FFYFdk4?F CC : !**400H DI ty ) ) ) bw///F J ty& 1 1 1 J x 0 0 0 DIII"4doNNDJ ~~H DI ty ) ) )@D
DK$..$))< = JJLLLLLr c | j }| xj |j dz z
c_ | |j || _ d S )N.)rX r, r` rf )r r
old_classnames r
visitClassDefz$PathGraphingAstVisitor.visitClassDef s@
$)c/) 49%%%&r c | j sd S t | }| j | j | || _ |S r
)r] r) r\ r@ )r r, rg s r re z%PathGraphingAstVisitor.appendPathNode sB y FD>>
49h/// r c \ |j d}n|j }d|z }| | d S )Nr zStmt %d)r8 re )r r r8 r, s r visitSimpleStatementz+PathGraphingAstVisitor.visitSimpleStatement s< ; FF[F6! D!!!!!r c t |t j r| | d S t t
| j |g|R d S r
)
isinstancer stmtrp rW rT r )r r r r s r r z PathGraphingAstVisitor.default s^ dCH % % E % %d + + + + + 7E($ / / 7 Dt D D D D D Dr c F d|j z }| || d S )NzLoop %dr8 _subgraphr r r, s r visitLoopz PathGraphingAstVisitor.visitLoop s( 4;& tT"""""r c F d|j z }| || d S )NzIf %dru rw s r visitIfz PathGraphingAstVisitor.visitIf s( $ tT"""""r r' c V | j ut |||j |j | _ t | }| ||| | j | j | j |< | dS | | }| ||| dS )z?create the subgraphs representing any `if` and `for` statementsN)
r\ r5 r8 rd r) _subgraph_parserY rX rZ re )r r r, extra_blocksrg s r rv z PathGraphingAstVisitor._subgraph s : "4t{DOLLDJ ~~H x > > >;?:DK$..$$7 8 JJLLLLL**400H x > > > > >r c ( g }|| _ | |j | | j |D ]=}|| _ | |j | | j >|j r<|| _ | |j | | j n| | |r:t dd }|D ] }| j || || _ dS dS )z@parse the body and any `else` block of `if` and `for` statementsrV rb rc N)r] r` rf r= orelser) r\ r@ )r r rg r}
loose_endsextrarh les r r| z&PathGraphingAstVisitor._subgraph_parse s,
49%%%$)$$$! ) )E DI uz * * * di ( ( ( ( ; ( DI t{ + + + di ( ( ( ( h ' ' ' bw///F
/
/
""2v.... DIII r c T d|j z }| |||j d S )Nz TryExcept %d)r} )r8 rv handlersrw s r visitTryExceptz%PathGraphingAstVisitor.visitTryExcept s. + tT
>>>>>r c x d|j z }| | | |j d S )NzWith %d)r8 re r` rf rw s r visitWithz PathGraphingAstVisitor.visitWith s> 4;& D!!! 49%%%%%r )r' )r r$ r% r& r rZ r` ri visitAsyncFunctionDefrm re rp r rx
visitAsyncForvisitFor
visitWhilerz rv r| r visitTryr visitAsyncWith
__classcell__)r s @r rT rT ^ s4 4 -' ' ' " " "E E E E E # # # -65M5Hz# # # ? ? ? ? ,? ? ? H& & &
NNNNNr rT c ^ e Zd ZdZdZeZdZdZdZ d Z
e d Z e d Z
d Zd
S )
McCabeCheckerz%McCabe cyclomatic complexity checker.mccabeC901zC901 %r is too complex (%d)c || _ d S r
)r" )r r" filenames r r zMcCabeChecker.__init__ s
r c
d}ddt ddd}t |dd }t |t r?| d |j |fi | |j d d S |j |fi | d S )
Nz--max-complexityr storezMcCabe complexity thresholdTrue)r actiontypehelpparse_from_configconfig_optionsr zmax-complexity)intr rr r: pop
add_optionr r= )clsparserflagkwargs config_optss r add_optionszMcCabeChecker.add_options s ! 1!'
f&6== k4 ( ( . JJ* + + + F d - -f - - - ! ( ()9 : : : : : F d - -f - - - - -r c 8 t |j | _ d S r
)r max_complexity)r optionss r
parse_optionszMcCabeChecker.parse_options s !7 8 8r c # l K | j dk rd S t }| | j | |j D ]a}| | j k rB| j |j | fz }|j |j
|t | fV bd S )Nr ) r rT r# r" rY rO rR _error_tmplr7 r8 r9 r )r r r\ texts r runzMcCabeChecker.run s " " F(**G,,, ^**,, C CE !!D$777'5<9I9I9K9K*LLlEL$T
BBBB C Cr N)r r$ r% r& r, __version__version_coder r r classmethodr r r r' r r r r s // DG E/KN . . [.$ 9 9 [9C C C C Cr r stdinc t | |dt j }nP# t $ rC t j d }t j d|d|d Y dS w xY wg }|t _ t ||
D ]"\ }}}} | d|||fz #t | dk rdS t d | t | S )Nexec zUnable to parse z:
r z %s:%d:1: %s)compiler
PyCF_ONLY_AST SyntaxErrorsysexc_infostderrwriter r r r= rI r/ join)
code thresholdr r" ecomplxr8 offsetr checks
r get_code_complexityr s tXvs/@AA LNN1
xxxCDDDqq
F#,M '4T8'D'D'H'H'J'J @ @#e
mx&>>????
6{{aq $))F
v;;s A A,+A,c D t | }t ||| S )z"Returns the complexity of a module)r )_readr ) module_pathr r s r get_module_complexityr $ s$ D tY E E EEr c dt j cxk rdk rAn n>t | d 5 }| cd d d S # 1 swxY w Y d S dt j cxk rdk rn d S t | d 5 }t j |j \ }}d d d n # 1 swxY w Y n\# t t t f$ rB t | d 5 }| cd d d cY S # 1 swxY w Y Y nw xY wt | d| 5 }| cd d d S # 1 swxY w Y d S d S ) N)rM ) r rU) r rbzlatin-1)encodingr)
r version_infoopenreadtokenizedetect_encodingreadline LookupErrorr UnicodeError)r fr _s r r r * s
))))6)))))
(D
!
! Q6688 3# , , , ,f , , , , , ,# h%%
E ( 8 D D
1
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E[,7 h333
qvvxx
(C(
3
3
3 q6688
- ,s} A AA6B; B/# B; /B33B; 6B37B; ;(D#D7
DD
D
D
DD)E
EEc ^ | t j dd } t j }| ddddd | dd d
d d d
| | \ }}t
|d }t ||d dt j }t }| || |j rtt d |j D ]:}|j r | |j k r| ;t d d S |j D ]F}| |j k r't |j | Gd S )Nr z-dz--dotdotzoutput a graphviz dot file
store_true)destr r z-mz--minr z minimum complexity for outputr )r r r r r r zgraph {rC )r argvoptparse OptionParserr
parse_argsr r r r rT r# r r/ rY rO r rR r1 r, )r oparr r r r" r r\ s r mainr ; s |x| " "DOOD'5l L L LOOD' 8u OOD))MGT a>>D 4a&#*; < r s
& % % % % %
# # # # # #2JJJ$$$$$$$ 2 2 211111111112 # # # # # # # #8
v
) ) ) ) ) ) ) )>C C C C C Z C C C L*C *C *C *C *CF *C *C *CZ &F F F F "6 6 6 6< zD!"" s
'
77