Your IP : 216.73.216.213
2tX^� � @ s� d Z d d l Z d d l Z d d l Z d d l Z e j dK k Z e j dL k Z e j dM k Z e j dN k Z y e j
d Z Wn e k
r� d Z Yn Xe
e e r� d n d � � Z y d d l Z WnT e k
r"d d l Z d
e j j k r f e j _ e d d � � e j _ Yn Xd d
l m Z e rHd d � Z n d d � Z e rid d � Z n d d � Z e r�e j e j f Z n e j e j e j f Z Gd d � d e � Z! d d � Z" d e! � d d � Z# d d � Z$ Gd d � d e% � Z& Gd d � d e& � Z' Gd d! � d! e% � Z( Gd" d# � d# e% � Z) Gd$ d% � d% e' � Z* Gd& d' � d' e* � Z+ Gd( d) � d) e* � Z, Gd* d+ � d+ e* � Z- Gd, d- � d- e, � Z. Gd. d/ � d/ e& � Z/ Gd0 d1 � d1 e& � Z0 Gd2 d3 � d3 e' � Z1 Gd4 d5 � d5 e' � Z2 Gd6 d7 � d7 e& � Z3 Gd8 d9 � d9 e � Z4 Gd: d; � d; e4 � Z5 Gd< d= � d= e4 � Z6 Gd> d? � d? e4 � Z7 Gd@ dA � dA e4 � Z8 GdB dC � dC e8 � Z9 dD dE dF g Z: dG dH � Z; GdI dJ � dJ e% � Z< d S)Oz]
Main module.
Implement the central Checker class.
Also, it models the Bindings and Scopes.
� N� � � TFZ __builtin__�builtins�decorator_listc C s | j S)N)Z
decorators)�s� r �A/opt/alt/python35/lib/python3.5/site-packages/pyflakes/checker.py�<lambda> s r
)�messagesc C s t t | j � j � � S)N)�str�unicode�__name__�upper)�
node_classr r r � getNodeType& s r c C s
| j j � S)N)r r )r r r r r * s c C s` t | t j t j f � r% | j g St | t j � r\ | j | j g d d � | j D� Sd S)Nc S s g | ] } | g � q Sr r )�.0�hdlr r r �
<listcomp>3 s z#getAlternatives.<locals>.<listcomp>)�
isinstance�ast�IfZ
TryFinally�bodyZ TryExcept�orelse�handlers)�nr r r �getAlternatives/ s
r c C sW t | t j � r | j g St | t j � rS | j | j g d d � | j D� Sd S)Nc S s g | ] } | g � q Sr r )r r r r r r 9 s z#getAlternatives.<locals>.<listcomp>)r r r r �Tryr r )r r r r r 5 s
c @ s. e Z d Z d Z d d � Z d d � Z d S)� _FieldsOrderz Fix order of AST node fields.c C s^ | j } d | k r! d j } n! d | k r9 d j } n d j } t t | d | d d �� S)N�iter�
generators�value�key�reverseT)�_fields�find�tuple�sorted)�selfr �fieldsZ key_firstr r r � _get_fieldsD s z_FieldsOrder._get_fieldsc C s | j | � | | <} | S)N)r* )r( r r) r r r � __missing__O s z_FieldsOrder.__missing__N)r �
__module__� __qualname__�__doc__r* r+ r r r r r A s r c C s5 i } x( | D] } | j | d � d | | <q
W| S)z|
Simplest required implementation of collections.Counter. Required as 2.6
does not have Counter in collections.
r � )�get)�items�results�itemr r r �counterT s
r4 c c s| xu | | j D]f } | | k r# q t | | d � } t | t j � rO | Vq t | t � r x | D] } | Vqe Wq Wd S)z�
Yield all direct child nodes of *node*, that is, all fields that
are nodes and all items of fields that are lists of nodes.
N)� __class__�getattrr r �AST�list)�node�omitZ
_fields_order�name�fieldr3 r r r �iter_child_nodes_ s
r= c C s� t | t j � r | j St t d � rA t | t j � rA | j St | t j � rm t d d � | j D� � St | t j � r� | j
St | t j � r� t d | � } d d d d d d i } | j
| j | � St r� t | t j � r� | j St � Sd S)
N�Bytesc s s | ] } t | � Vq d S)N)�convert_to_value)r �ir r r � <genexpr>u s z#convert_to_value.<locals>.<genexpr>r3 �TrueT�FalseF�None)r r �Strr �hasattrr> �Tupler& �elts�Numr �Name� VariableKeyr0 r; �PY33� NameConstantr! �UnhandledKeyType)r3 �resultZconstants_lookupr r r r? o s& ! r? c @ sF e Z d Z d Z d d � Z d d � Z d d � Z d d � Z d
S) �Bindingar
Represents the binding of a value to a name.
The checker uses this to keep track of which names have been bound and
which names have not. See L{Assignment} for a special type of binding that
is checked with stricter rules.
@ivar used: pair of (L{Scope}, node) indicating the scope and
the node that this binding was last used.
c C s | | _ | | _ d | _ d S)NF)r; �source�used)r( r; rQ r r r �__init__� s zBinding.__init__c C s | j S)N)r; )r( r r r �__str__� s zBinding.__str__c C s) d | j j | j | j j t | � f S)Nz#<%s object %r from line %r at 0x%x>)r5 r r; rQ �lineno�id)r( r r r �__repr__� s zBinding.__repr__c C s t | t � o | j | j k S)N)r �
Definitionr; )r( �otherr r r � redefines� s zBinding.redefinesN)r r, r- r. rS rT rW rZ r r r r rP � s
rP c @ s e Z d Z d Z d S)rX z7
A binding that defines a function or a class.
N)r r, r- r. r r r r rX � s rX c @ s e Z d Z d Z d S)rN zS
A dictionary key of a type that we cannot or do not check for duplicates.
N)r r, r- r. r r r r rN � s rN c @ s: e Z d Z d Z d d � Z d d � Z d d � Z d S) rK zY
A dictionary key which is a variable.
@ivar item: The variable AST object.
c C s | j | _ d S)N)rV r; )r( r3 r r r rS � s zVariableKey.__init__c C s" | j | j k o! | j | j k S)N)r5 r; )r( Zcomparer r r �__eq__� s zVariableKey.__eq__c C s
t | j � S)N)�hashr; )r( r r r �__hash__� s zVariableKey.__hash__N)r r, r- r. rS r[ r] r r r r rK � s rK c sa e Z d Z d Z d � f d d � Z d d � Z d d � Z e d d
� � Z d d � Z � S)
� Importationz�
A binding created by an import statement.
@ivar fullName: The complete name given to the import statement,
possibly including multiple dotted components.
@type fullName: C{str}
Nc s5 | p | | _ g | _ t t | � j | | � d S)N)�fullName� redefined�superr^ rS )r( r; rQ � full_name)r5 r r rS � s zImportation.__init__c C s> t | t � r | j | j k St | t � o= | j | j k S)N)r �SubmoduleImportationr_ rX r; )r( rY r r r rZ � s zImportation.redefinesc C s | j j d � d | j k S)z.Return whether importation needs an as clause.�.r/ ���)r_ �splitr; )r( r r r �
_has_alias� s zImportation._has_aliasc C s/ | j � r d | j | j f Sd | j Sd S)z5Generate a source statement equivalent to the import.zimport %s as %sz import %sN)rg r_ r; )r( r r r �source_statement� s z Importation.source_statementc C s) | j � r | j d | j S| j Sd S)z#Return import full name with alias.z as N)rg r_ r; )r( r r r rT � s zImportation.__str__)
r r, r- r. rS rZ rg �propertyrh rT r r )r5 r r^ � s r^ c sX e Z d Z d Z � f d d � Z � f d d � Z d d � Z e d d � � Z � S)
rc a�
A binding created by a submodule import statement.
A submodule import is a special case where the root module is implicitly
imported, without an 'as' clause, and the submodule is also imported.
Python does not restrict which attributes of the root module may be used.
This class is only used when the submodule import is without an 'as' clause.
pyflakes handles this case by registering the root module name in the scope,
allowing any attribute of the root module to be accessed.
RedefinedWhileUnused is suppressed in `redefines` unless the submodule
name is also the same, to avoid false positives.
c sd d | k r% | s+ t | t j � s+ t � | j d � d } t t | � j | | � | | _ d S)Nrd r ) r r �Import�AssertionErrorrf ra rc rS r_ )r( r; rQ � package_name)r5 r r rS s +z SubmoduleImportation.__init__c s5 t | t � r | j | j k St t | � j | � S)N)r r^ r_ ra rc rZ )r( rY )r5 r r rZ s z SubmoduleImportation.redefinesc C s | j S)N)r_ )r( r r r rT s z SubmoduleImportation.__str__c C s d | j S)Nzimport )r_ )r( r r r rh s z%SubmoduleImportation.source_statement) r r, r- r. rS rZ rT ri rh r r )r5 r rc � s
rc c sC e Z d Z d � f d d � Z d d � Z e d d � � Z � S)�ImportationFromNc sh | | _ | p | | _ | j d � r7 | | j } n | d | j } t t | � j | | | � d S)Nrd )�module� real_name�endswithra rm rS )r( r; rQ rn ro rb )r5 r r rS s zImportationFrom.__init__c C s/ | j | j k r$ | j d | j S| j Sd S)z#Return import full name with alias.z as N)ro r; r_ )r( r r r rT ! s zImportationFrom.__str__c C sD | j | j k r, d | j | j | j f Sd | j | j f Sd S)Nzfrom %s import %s as %szfrom %s import %s)ro r; rn )r( r r r rh ( s
z ImportationFrom.source_statement)r r, r- rS rT ri rh r r )r5 r rm s rm c sF e Z d Z d Z � f d d � Z e d d � � Z d d � Z � S)�StarImportationz3A binding created by a 'from x import *' statement.c s3 t t | � j d | � | d | _ | | _ d S)N�*z.*)ra rq rS r; r_ )r( r; rQ )r5 r r rS 5 s
zStarImportation.__init__c C s d | j d S)Nzfrom z import *)r_ )r( r r r rh < s z StarImportation.source_statementc C s$ | j j d � r | j S| j Sd S)Nrd )r_ rp rh r; )r( r r r rT @ s zStarImportation.__str__)r r, r- r. rS ri rh rT r r )r5 r rq 2 s rq c s( e Z d Z d Z � f d d � Z � S)�FutureImportationzs
A binding created by a from `__future__` import statement.
`__future__` imports are implicitly used.
c s/ t t | � j | | d � | | f | _ d S)N�
__future__)ra rs rS rR )r( r; rQ �scope)r5 r r rS O s zFutureImportation.__init__)r r, r- r. rS r r )r5 r rs H s rs c @ s e Z d Z d Z d S)�Argumentz3
Represents binding a name as an argument.
N)r r, r- r. r r r r rv T s rv c @ s e Z d Z d Z d S)�
Assignmenta
Represents binding a name with an explicit assignment.
The checker will raise warnings for any Assignment that isn't used. Also,
the checker does not consider assignments in tuple/list unpacking to be
Assignments, rather it treats them as simple Bindings.
N)r r, r- r. r r r r rw Z s rw c @ s e Z d Z d S)�FunctionDefinitionN)r r, r- r r r r rx d s rx c @ s e Z d Z d S)�ClassDefinitionN)r r, r- r r r r ry h s ry c s( e Z d Z d Z � f d d � Z � S)�
ExportBindinga
A binding created by an C{__all__} assignment. If the names in the list
can be determined statically, they will be treated as names for export and
additional checking applied to them.
The only C{__all__} assignment that can be recognized is one which takes
the value of a literal list containing literal strings. For example::
__all__ = ["foo", "bar"]
Names which are imported and not otherwise used but appear in the value of
C{__all__} will not have an unused import warning reported for them.
c s� d | k r7 t | t j � r7 t | d j � | _ n g | _ t | j t j t j f � r� x9 | j j D]+ } t | t j � rk | j j
| j � qk Wt t
| � j | | � d S)N�__all__)r r � AugAssignr8 �namesr! �ListrG rH rE �appendr ra rz rS )r( r; rQ ru r9 )r5 r r rS { s zExportBinding.__init__)r r, r- r. rS r r )r5 r rz l s
rz c @ s" e Z d Z d Z d d � Z d S)�ScopeFc C s, | j j } d | t | � t j | � f S)Nz<%s at 0x%x %s>)r5 r rV �dictrW )r( Z scope_clsr r r rW � s zScope.__repr__N)r r, r- �
importStarredrW r r r r r� � s r� c @ s e Z d Z d S)�
ClassScopeN)r r, r- r r r r r� � s r� c sO e Z d Z d Z d Z e d d d g � Z � f d d � Z d d � Z � S)
�
FunctionScopezp
I represent a name scope for a function.
@ivar globals: Names declared 'global' in this function.
FZ__tracebackhide__Z__traceback_info__Z__traceback_supplement__c s; t t | � j � | j j � | _ d | _ d | _ d S)NF)ra r� rS �
alwaysUsed�copy�globals� returnValue� isGenerator)r( )r5 r r rS � s zFunctionScope.__init__c c s^ xW | j � D]I \ } } | j r
| | j k r
| j r
t | t � r
| | f Vq
Wd S)zR
Return a generator for the assignments which have not been used.
N)r1 rR r� �
usesLocalsr rw )r( r; �bindingr r r �unusedAssignments� s
z FunctionScope.unusedAssignments) r r, r- r. r� �setr� rS r� r r )r5 r r� � s r� c @ s e Z d Z d S)�GeneratorScopeN)r r, r- r r r r r� � s r� c @ s e Z d Z d Z d Z d S)� ModuleScopezScope for a module.TN)r r, r- r. �_futures_allowedr r r r r� � s r� c @ s e Z d Z d Z d S)� DoctestScopezScope for a doctest.N)r r, r- r. r r r r r� � s r� �__file__� __builtins__Z WindowsErrorc C s0 t | d � r | j St | d � r, | j Sd S)NrV r; )rF rV r; )r9 r r r � getNodeName� s r� c @ sN e Z d Z d Z d Z d Z d Z e e � j e
� Z e j
j d � Z e rg e j e j d � � [ d d d e j
k d d
� Z d d � Z d
d � Z d d � Z d d � Z e d d � � Z e j d d � � Z e d d � � Z d d � Z d d � Z e d d � Z d d � Z d d! � Z d" d# � Z! d$ d% � Z" d& d' � Z# d( d) � Z$ d* d+ � Z% d, d- � Z& d. d/ � Z' d0 d1 � Z( d d2 d3 � Z) d4 d5 � Z* d6 d7 � Z+ d8 d9 � Z, d: d; � Z- e. j/ � j0 Z1 d< d= � Z2 d> d? � Z3 e) Z4 Z5 Z6 Z7 Z8 Z9 Z: Z; Z< Z= Z> Z? Z@ ZA ZB e3 ZC e) ZD ZE ZF ZG ZH ZI ZJ ZK ZL ZM ZN ZO e3 ZP ZQ ZR ZS e) ZT ZU ZV e3 ZW ZX ZY ZZ Z[ Z\ e3 Z] Z^ Z_ Z` Za Zb Zc Zd Ze Zf Zg Zh Zi Zj Zk Zl Zm Zn Zo Zp Zq Zr Zs Zt Zu Zv Zw Zx Zy e) Zz Z{ Z| Z} d@ dA � Z~ dB dC � Z dD dE � Z� e� Z� dF dG � Z� e� rpe) n e� Z� e� Z� Z� dH dI � Z� dJ dK � Z� e� Z� dL dM � Z� dN dO � Z� e� Z� Z� dP dQ � Z� e� Z� dR dS � Z� dT dU � Z� dV dW � Z� dX dY � Z� e� Z� dZ d[ � Z� d\ d] � Z� d^ d_ � Z� e� Z� d` da � Z� db dc � Z� d S)d�Checkera�
I check the cleanliness and sanity of Python code.
@ivar _deferredFunctions: Tracking list used by L{deferFunction}. Elements
of the list are two-tuples. The first element is the callable passed
to L{deferFunction}. The second element is a copy of the scope stack
at the time L{deferFunction} was called.
@ivar _deferredAssignments: Similar to C{_deferredFunctions}, but for
callables which are deferred assignment checks.
r NFZPYFLAKES_BUILTINS�,z(none)ZPYFLAKES_DOCTESTc C s� i | _ g | _ g | _ g | _ g | _ | | _ | rQ | j j | � | _ | | _ t � g | _
f g | _ | | _ | j
| � | j | j � d | _ | j | j � d | _ | j
d d � =| j � | j � d S)Nr/ )�
_nodeHandlers�_deferredFunctions�_deferredAssignments�
deadScopesr �filename�builtIns�union� withDoctestr� �
scopeStack�exceptHandlers�root�handleChildren� runDeferred�popScope�checkDeadScopes)r( �treer� r r� r r r rS � s(
zChecker.__init__c C s- | j j | | j d d � | j f � d S)a{
Schedule a function handler to be called just before completion.
This is used for handling function bodies, which must be deferred
because code later in the file might modify the global scope. When
`callable` is called, the scope at the time this is called will be
restored, however it will contain any new bindings added to it.
N)r� r r� �offset)r( �callabler r r �
deferFunction� s zChecker.deferFunctionc C s- | j j | | j d d � | j f � d S)zl
Schedule an assignment handler to be called just after deferred
function handlers.
N)r� r r� r� )r( r� r r r �deferAssignment s zChecker.deferAssignmentc C s7 x0 | D]( \ } } } | | _ | | _ | � q Wd S)zV
Run the callables in C{deferred} using their associated scope stack.
N)r� r� )r( Zdeferred�handlerru r� r r r r�
s zChecker.runDeferredc C s) t | j � d k o( t | j d t � S)N� r/ )�lenr� r r� )r( r r r � _in_doctest s zChecker._in_doctestc C s* t d d � | j D� � s d S| j j S)Nc s s | ] } t | t � Vq d S)N)r r� )r ru r r r rA s z)Checker.futuresAllowed.<locals>.<genexpr>F)�allr� ru r� )r( r r r �futuresAllowed s zChecker.futuresAllowedc C s4 | d k s t � t | j t � r0 d | j _ d S)NF)rk r ru r� r� )r( r! r r r r� " s c C s | j d S)Nr/ re )r� )r( r r r ru ( s z
Checker.scopec C s | j j | j j � � d S)N)r� r r� �pop)r( r r r r� , s zChecker.popScopec C s� x�| j D]�} t | t � r" q
| j d � } | rM t | t � rM d } | rt t | j � } | j | � } n
g } } | r| j r� t j
j | j � d k r� x+ | D]# } | j
t j | d j | � q� W| j rx, | j � D] } t | t � r� | | _ q� Wx� | j � D]� } t | t � r | j pF| j | k } | stt j } | j
| | j t | � � xi | j D]^ }
t | j |
� t j � r�t j } n | r�q~n t j } | j
| |
| j | j � q~Wq Wq
Wd S)z�
Look at scopes which have been fully examined and report names in them
which were imported but unused.
r{ Nz __init__.py) r� r r� r0 rz r� r} �
differencer� �os�path�basenamer� �reportr ZUndefinedExportrQ �valuesrq rR r^ r; Z UnusedImportr r` � getParentr �For�ImportShadowedByLoopVar�RedefinedWhileUnused) r( ru Z all_bindingZ all_namesZ undefinedr; r� r! rR Zmessgr9 r r r r� / sB
zChecker.checkDeadScopesc C s | j j | � � d S)N)r� r )r( Z
scopeClassr r r � pushScopea s zChecker.pushScopec O s# | j j | | j | | � � d S)N)r r r� )r( Z messageClass�args�kwargsr r r r� d s zChecker.reportc C s8 x1 | j } t | d � r t | d � r | Sq Wd S)NrH �ctx)�parentrF )r( r9 r r r r� g s zChecker.getParentc C s� | | | f k s1 t | d � o- t | d � r5 d S| | k rE | S| j | j k rm | j | j | | � S| j | j k r� | j | | j | � S| j | j | j | � S)Nr� )rF �depth�getCommonAncestorr� )r( �lnode�rnode�stopr r r r� n s ! zChecker.getCommonAncestorc C s. x' | D] } | j | | | � r d Sq Wd S)NTF)r� )r( r9 Z ancestorsr� �ar r r � descendantOf{ s
zChecker.descendantOfc C sk | j | | | j � } t | � } | rg x: | D]2 } | j | | | � | j | | | � Ar1 d Sq1 Wd S)zATrue, if lnode and rnode are located on different forks of IF/TRYTF)r� r� r r� )r( r� r� Zancestor�partsr1 r r r �differentForks� s
zChecker.differentForksc C s� x. | j d d d � D] } | j | k r Pq W| j | j � } | r�| j | | j � r�| j | j � } t | t � r� t | t j � r� | j
t j | | j | j � n� | | j
k rZt | t j � r t | j | j � t j t j f � r | j
t j | | j | j � q�| j r�| j | � r�| j
t j | | j | j � n. t | t � r�| j | � r�| j j | � | j | j
k r�| j
| j j | _ | | j
| j <d S)z�
Called when a binding is altered.
- `node` is the statement responsible for the change
- `value` is the new value, a Binding instance
Nr/ re )r� r; r0 r� rQ r� r r^ r r� r� r r� ru �
comprehensionZRedefinedInListComprR rZ r� r` r )r( r9 r! ru �existing� parent_stmtr r r �
addBinding� s. ! zChecker.addBindingc C sN y | j | SWn t k
r/ t | � } Yn Xt | | � | j | <} | S)N)r� �KeyErrorr r6 )r( r ZnodeTyper� r r r �getNodeHandler� s
zChecker.getNodeHandlerc C s� t | � } | s d Sd } d } x� | j d d d � D]� } | d k r] t | t � r] q9 y | j | f | | _ Wn t k
r� Yn Xd S| p� | j } | d k r9 t | t � } q9 W| | j k r� d S| rxg } xf | j d d d
� D]N } xE | j
� D]7 } t | t � r| j | f | _ | j | j
� qWq� Wd j t | � � } | j t j | | | � d S| d k r�t j j | j � d k r�d Sd | j d k r�| j t j | | � d S) Nr/ Fz, �__path__z __init__.py� NameErrorre re re re re )r� r� r r� ru rR r� r� r� r� r� rq r r_ �joinr' r� r ZImportStarUsager� r� r� r� r� �
UndefinedName)r( r9 r; Z
in_generatorsr� ru � from_listr� r r r �handleNodeLoad� s@
'zChecker.handleNodeLoadc C s� t | � } | s d St | j t � r� | | j k r� x� | j d d � D]� } t | t t f � si qK | | k o | | j } | rK | d | j k rK | | j j k rK | j t j
| | j d | | | j � PqK W| j | � } t | t
j t
j f � s&| | j k r8| j | � r8t | | � } nH | d k rqt | j t � rqt | | j | j � } n t | | � } | j | | � d S)Nr/ r r{ re )r� r ru r� r� r� rR r� r� r ZUndefinedLocalrQ r� r r� r� r� �isLiteralTupleUnpackingrP rz rw r� )r( r9 r; ru rR r� r� r r r �handleNodeStore� s* !+ zChecker.handleNodeStorec s� � f d d � } t � � } | s( d S| � r5 d St | j t � ro | | j j k ro | j j j | � n9 y | j | =Wn( t k
r� | j t j � | � Yn Xd S)Nc sZ t � d d � } xA | rU t | t j t j t j f � r@ d St | d d � } q Wd S)zN
Return `True` if node is part of a conditional body.
r� NTF)r6 r r r �While�IfExp)�current)r9 r r �on_conditional_branch s !z7Checker.handleNodeDelete.<locals>.on_conditional_branch)
r� r ru r� r� �remover� r� r r� )r( r9 r� r; r )r9 r �handleNodeDelete s $
zChecker.handleNodeDeletec C s1 x* t | d | �D] } | j | | � q Wd S)Nr: )r= �
handleNode)r( r� r: r9 r r r r� . s zChecker.handleChildrenc C sK t | t j � rG x. | j | j g D] } t | d � s& d Sq& Wd Sd S)NrH FT)r r �Assign�targetsr! rF )r( r9 �childr r r r� 2 s
z Checker.isLiteralTupleUnpackingc C s7 t | t j � p6 t | t j � o6 t | j t j � S)z}
Determine if the given node is a docstring, as long as it is at the
correct place in the node tree.
)r r rE �Exprr! )r( r9 r r r � isDocstring9 s $zChecker.isDocstringc C sq t | t j � r | j } t | t j � s1 d St rG | j d } n | j | j j d � d } | j | f S)Nr/ �
)NN) r r r� r! rE �PYPYrU r �count)r( r9 Zdoctest_linenor r r � getDocstringA s zChecker.getDocstringc C s8 | d k r d S| j r] t | d d � d k r] | j | j d 7_ | j | j d 7_ | j r� t d | j | j j � | j r� t
| t j � p� | j
| � r� d | _ | j d 7_ | j | _ | | _ z | j | j � } | | � Wd | j d 8_ X| j r4t d | j d | j j � d S)NrU r r/ z Fzend )r� r6 rU �
col_offset� traceTree�print� nodeDepthr5 r r� r r �
ImportFromr� r� r� r� )r( r9 r� r� r r r r� O s& ! zChecker.handleNodec C s� y5 | j | j d � \ } } | o1 | j | � } Wn t t f k
rS d SYn X| s^ d S| j } | j d g | _ | j p� d } | j t � d | j k } | s� | j j
d � x� | D]� } y t | j d d t
j � } Wn{ t k
rdt j � d }
t r |
j d 7_ | | j |
j | j d |
j pCd f } | j t j | | � Yq� X| d | | j | d | j d f | _ | j | � | | _ q� W| s�| j j d � | j � | | _ d S)Nr �_z <doctest>�execr/ r )r r )r� r �_getDoctestExamples�
ValueError�
IndexErrorr� r� r� r� r� �add�compilerQ r �
PyCF_ONLY_AST� SyntaxError�sys�exc_infor� rU �indentr� r ZDoctestSyntaxErrorr� r� r� ) r( r9 Z docstringZ node_linenoZexamplesZ saved_stackZ node_offsetZunderscore_in_builtinsZexampler� �e�positionr r r �handleDoctestsg s@
zChecker.handleDoctestsc C s d S)Nr )r( r9 r r r �ignore� s zChecker.ignorec s d d � � j D� } t | � } d d � | j � D� } x� | D]� � � f d d � t | � D� } t � f d d � | D� � } t d d � | j � D� � rB x\ | D]T } � j | } t � t � r� | j t j | � j
� q� | j t j | � � q� WqB W| j � � d S)Nc S s g | ] } t | � � q Sr )r? )r r" r r r r � s z Checker.DICT.<locals>.<listcomp>c S s( g | ] \ } } | d k r | � q S)r/ r )r r" r� r r r r � s c s( g | ] \ } } | � k r | � q Sr r )r r@ Zi_key)r" r r r � s c 3 s" | ] } t � j | � Vq d S)N)r? r� )r �index)r9 r r rA � s z Checker.DICT.<locals>.<genexpr>c s s! | ] \ } } | d k Vq d S)r/ Nr )r r! r� r r r rA � s )
�keysr4 r1 � enumerate�anyr rK r� r Z MultiValueRepeatedKeyVariabler; Z MultiValueRepeatedKeyLiteralr� ) r( r9 r� Z
key_countsZduplicate_keysZ key_indicesr� Z key_indexZkey_noder )r" r9 r �DICT� s(
z Checker.DICTc C sK t | j t j � r: | j j g k r: | j t j | � | j | � d S)N) r �testr rG rH r� r Z AssertTupler� )r( r9 r r r �ASSERT� s 'zChecker.ASSERTc s� | j � r d n d } | j | } | j | k r� x� | j D] � t � | � } � f d d � | j D� | _ | j � | � | | f | _ x) | j | d d � D] } | | � <q� Wq> Wd S)z5
Keep track of globals declarations.
r/ r c s< g | ]2 } t | t j � s2 | j d � k r | � q S)r )r r r� Z message_args)r �m)� node_namer r r � s z"Checker.GLOBAL.<locals>.<listcomp>N)r� r� ru r} rw r �
setdefaultrR )r( r9 Zglobal_scope_indexZ global_scopeZ
node_valueru r )r r �GLOBAL� s
zChecker.GLOBALc C s( | j t � | j | � | j � d S)N)r� r� r� r� )r( r9 r r r � GENERATOREXP� s
zChecker.GENERATOREXPc C s� t | j t j t j f � rp | j | � | j d k r� t | j t � r� t | j t j
� r� d | j _ ni t | j t j t j
f � r� | j | � n; t | j t j � r� | j | � n t d | j f � � d S)zV
Handle occurrence of Name (which can be a load/store/delete access.)
�localsTz%Got impossible expression context: %rN)r r� r �Load�AugLoadr� rV ru r� r� �Callr� �Store�AugStorer� �Delr� � RuntimeError)r( r9 r r r �NAME s
! z Checker.NAMEc C s� | } x� t | d � r� | j | } } t | t � rJ | | j k rJ d St | t j t j f � rf Pt | d � r t | t j � r | | j k r | j
t j | � d Sq Wt | t j � r� | j
t j
| � n | j
t j | � d S)Nr� � finalbody)rF r� r �
LOOP_TYPESr r � FunctionDef�ClassDef�Continuer r� r ZContinueInFinallyZContinueOutsideLoopZBreakOutsideLoop)r( r9 r Zn_childr r r �CONTINUE s !zChecker.CONTINUEc C s} t | j t t f � r/ | j t j | � d S| j rf t | j d � rf | j j rf | j | j _ | j
| j | � d S)Nr� ) r ru r� r� r� r ZReturnOutsideFunctionr! rF r� r� )r( r9 r r r �RETURN- s
zChecker.RETURNc C sR t | j t t f � r/ | j t j | � d Sd | j _ | j | j | � d S)NT)
r ru r� r� r� r ZYieldOutsideFunctionr� r� r! )r( r9 r r r �YIELD: s
z
Checker.YIELDc s� x! � j D] } � j | � � q
W� j � � � j � t � j � � � � j r� � j � r� t � j t
� r� � j � � f d d � � d S)Nc s
� j � � S)N)r� r )r9 r( r r r
N s z%Checker.FUNCTIONDEF.<locals>.<lambda>) r r� �LAMBDAr� rx r; r� r� r ru r� r� )r( r9 �decor )r9 r( r � FUNCTIONDEFD s
zChecker.FUNCTIONDEFc s g � g } t rF � � f d d � � � � j j � � j j } nW x> � j j � j j D]& } � j | j � | j | j � q] W� j j � j j } t � d � } x� d D] } t � j | � } | s� q� � j t
r� | n | j � | r� t
r"| d } | j t � j | � � q� | j | j � q� W| rL| j � j � t t
� � � t � � k r�xF t � � D]8 \ } } | � d | � k rw� j t j � | � qwWx( | | D] }
|
r�� j |
� � q�W� � � f d d � } � j | � d S)
Nc sG x@ | D]8 } t | t j � r/ � | j � q � j | j � q Wd S)N)r r rG rH r rV )Zarglist�arg)�addArgsr� r r r W s
z Checker.LAMBDA.<locals>.addArgs�returns�vararg�kwarg�
annotationc s� � j � x' � D] } � j � t | � � � q Wt � j t � rm x7 � j D] } � j | � � qP Wn � j � j � � � f d d � } � j | � t r� � f d d � } � j | � � j � d S)Nc s= x6 � j j � D]% \ } } � j t j | j | � q Wd S)zU
Check to see if any assignments have not been used.
N)ru r� r� r ZUnusedVariablerQ )r; r� )r( r r �checkUnusedAssignments� s zCChecker.LAMBDA.<locals>.runFunction.<locals>.checkUnusedAssignmentsc s5 � j j r1 � j j r1 � j t j � j j � d S)z�
Check to see if there is any return statement with
arguments but the function is a generator.
N)ru r� r� r� r Z ReturnWithArgsInsideGeneratorr )r( r r �&checkReturnWithArgumentInsideGenerator� s zSChecker.LAMBDA.<locals>.runFunction.<locals>.checkReturnWithArgumentInsideGenerator)
r� r� rv r r r8 r� r� �PY32r� )r; �stmtr# r$ )r� r9 r( r r � runFunction� s
z#Checker.LAMBDA.<locals>.runFunction)r r! )�PY2r� �defaults�
kwonlyargsr r r" � kw_defaultsrF r6 rL r r� r� r� r� r ZDuplicateArgumentr� r� ) r( r9 � annotationsr) r Z is_py3_funcZarg_nameZwildcardZ
argannotation�idxr� r' r )r r� r9 r( r r R s@
!zChecker.LAMBDAc s x! � j D] } � j | � � q
Wx! � j D] } � j | � � q. Wt sr x! � j D] } � j | � � qX W� j t � � j r� � j � r� t � j
t � r� � j � � f d d � � x! � j
D] } � j | � � q� W� j � � j � t � j � � � d S)z�
Check names used in a class definition, including its decorators, base
classes, and the body of its definition. Additionally, add its name to
the current scope.
c s
� j � � S)N)r� r )r9 r( r r r
� s z"Checker.CLASSDEF.<locals>.<lambda>N)r r� �basesr( �keywordsr� r� r� r� r ru r� r� r r� r� ry r; )r( r9 r ZbaseNodeZ keywordNoder& r )r9 r( r �CLASSDEF� s
zChecker.CLASSDEFc C s: | j | j � | j | j | � | j | j | � d S)N)r� �targetr� r! )r( r9 r r r � AUGASSIGN� s zChecker.AUGASSIGNc C s� t r� t | j t j � r� d } d } xU t | j � D]D \ } } t | t j � r8 | rp | j t j
| � Pd } | } q8 W| d k s� t | j � | d d k r� | j t j | � | j
| � d S) NFr/ T� � re � i )r( r r� r r
r� rH �Starredr� r ZTwoStarredExpressionsr� Z%TooManyExpressionsInStarredAssignmentr� )r( r9 Z has_starredZstar_locr@ r r r r �TUPLE� s
)z
Checker.TUPLEc C s} xv | j D]k } d | j k r> | j r> t | j | � } n' | j pM | j } t | | | j � } | j | | � q
Wd S)Nrd )r} r; �asnamerc r^ r� )r( r9 �alias� importationr; r r r �IMPORT� s zChecker.IMPORTc C s~ | j d k rA | j sJ | j t j | d d � | j D� � n d | _ d | j | j p` d } x| j D]} | j p� | j } | j d k r� t | | | j
� } | j t j k rf| j t j
| | j � n� | j d k rNt rt | j
t � r| j t j | | � qn d | j
_ | j t j | | � t | | � } n t | | | | j � } | j | | � qn Wd S) Nrt c S s g | ] } | j � q Sr )r; )r r r r r r � s z&Checker.IMPORTFROM.<locals>.<listcomp>Frd � rr T)rn r� r� r ZLateFutureImportr} �levelr8 r; rs ru rt �all_feature_namesZFutureFeatureNotDefinedr( r r� ZImportStarNotPermittedr� ZImportStarUsedrq rm r� )r( r9 rn r9 r; r: r r r �
IMPORTFROM� s0
zChecker.IMPORTFROMc C s g } x� t | j � D]� \ } } t | j t j � rd xI | j j D] } | j t | � � qD Wn | j r� | j t | j � � | j d k r | t | j � d k r | j
t j | � q W| j
j | � x! | j D] } | j | | � q� W| j
j � | j | d d �d S)Nr/ r: r )r� r r �typer rG rH r r� r� r� r ZDefaultExceptNotLastr� r r� r� r� )r( r9 Z
handler_namesr@ r� �exc_typer� r r r �TRY s (
z Checker.TRYc C s� t s | j d k r& | j | � d Sx: | j d d d � D] } | j | k r= d } Pq= Wd } | j | � | j | � | s� y | j | j =Wn t k
r� Yn Xd S)Nr/ TFre )r( r; r� r� r� ru r� )r( r9 ru Zis_name_previously_definedr r r �
EXCEPTHANDLER s
zChecker.EXCEPTHANDLERc C sa | j r | j | j | � t | j t � sA | j | j | � | j r] | j | j | � d S)z�
Annotated assignments don't have annotations evaluated on function
scope, hence the custom implementation.
See: PEP 526.
N)r! r� r1 r ru r� r" )r( r9 r r r � ANNASSIGN; s zChecker.ANNASSIGN)�r r, r- r. r� r� r� r� � builtin_varsr� �_MAGIC_GLOBALSr� r� �environr0 Z_customBuiltIns�updaterf rS r� r� r� r� ri r� �setterru r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �doctestZ
DocTestParserZ get_examplesr� r� r� ZDELETEZPRINTZFORZASYNCFORZWHILEZIFZWITHZWITHITEMZ ASYNCWITHZ
ASYNCWITHITEMZRAISEZ
TRYFINALLYZEXECZEXPRZASSIGNZPASS�BOOLOPZBINOPZUNARYOPZIFEXPZSETZCOMPARE�CALLZREPRZ ATTRIBUTEZ SUBSCRIPTZSTARREDZ NAMECONSTANTZNUMZSTRZBYTES�ELLIPSISZSLICEZEXTSLICEZINDEXZLOADZSTOREZDELZAUGLOADZAUGSTOREZPARAMZAND�ORZADDZSUBZMULTZDIVZMODZPOWZLSHIFTZRSHIFTZBITORZBITXORZBITANDZFLOORDIVZINVERTZNOTZUADDZUSUBZEQZNOTEQZLTZLTEZGTZGTEZISZISNOT�INZNOTINZMATMULTZ
COMPREHENSIONZKEYWORDZFORMATTEDVALUEZ JOINEDSTRr r r ZNONLOCALr r( ZLISTCOMPZDICTCOMPZSETCOMPr r ZBREAKr r �AWAITZ YIELDFROMr ZASYNCFUNCTIONDEFr r0 r2 r7 ZLISTr; r? rB Z TRYEXCEPTrC rD r r r r r� � s� 2
' 6 ' >2v $
Q "r� )r r )r r )r r )r r )=r. rt rJ r� r� � version_infor( r% rL �PY34Zpypy_version_infor� �AttributeError�dir�
__import__rE r � ImportError�_astr r$ r ri r �pyflakesr r r r� r� r �AsyncForr� r r4 r= r? �objectrP rX rN rK r^ rc rm rq rs rv rw rx ry rz r� r� r� r� r� r� rF r� r� r r r r �<module> st
(%