whoami7 - Manager
:
/
home
/
creaupfw
/
public_html
/
wp-includes
/
assets
/
Upload File:
files >> /home/creaupfw/public_html/wp-includes/assets/compiler.zip
PK s�Z��@ E E symbols.pycnu �[��� � { fc @ s= d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z d d l m Z d d l Z d d l Z d Z d d d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d d d � � YZ d � Z e d k r9d d l Z d d l m Z m Z d d l Z d � Z x�e j d D]�Z e GHe e � Z e j � Z! e j" � e j e! e d � Z# e e# � Z$ e e � Z% e � Z& e e% e& � e& j' e% j � Z( e e$ e( � s"Hd Ge GHe) e$ � GHe) e( � GHe j* d � n i Z+ e+ j, e& j' � e+ e% =e+ j- � Z' [+ x� e# j. � D]� Z& e& j/ � r[g e' D]! Z0 e0 j1 e& j2 � k rte0 ^ qtZ3 e4 e3 � d k r�d Ge& j2 � GHq.e e e& j5 � � e3 d j � � s.e& j2 � GHe) e e& j5 � � � GHe) e3 d j � � GHe j* d � q.q[q[Wq`Wn d S( s Module symbol-table generatori����( t ast( t SC_LOCALt SC_GLOBAL_IMPLICITt SC_GLOBAL_EXPLICITt SC_FREEt SC_CELLt SC_UNKNOWN( t mangleNi t Scopec B s� e Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( c C s� | | _ | | _ i | _ i | _ i | _ i | _ i | _ i | _ g | _ d | _ d | _ d | _ | d k r� x> t t | � � D]' } | | d k r� | | | _ Pq� q� Wn d S( Nt _( t namet modulet defst usest globalst paramst freest cellst childrent Nonet nestedt generatort klasst ranget len( t selfR R R t i( ( s( /usr/lib64/python2.7/compiler/symbols.pyt __init__ s" c C s d | j j | j f S( Ns <%s: %s>( t __class__t __name__R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt __repr__% s c C s# | j d k r | St | | j � S( N( R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR ( s c C s d | j | j | � <d S( Ni ( R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_def- s c C s d | j | j | � <d S( Ni ( R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_use0 s c C sy | j | � } | | j k s0 | | j k r0 n | | j k rX t d | | j f � n d | j | <| j j | � d S( Ns %s in %s is global and parameteri ( R R R R t SyntaxErrorR R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_global3 s c C s- | j | � } d | j | <d | j | <d S( Ni ( R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_param= s c C s@ i } | j | j � | j | j � | j | j � | j � S( N( t updateR R R t keys( R t d( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_namesB s c C s | j j | � d S( N( R t append( R t child( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_childI s c C s | j S( N( R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_childrenL s c C s� t j | j I| j r d p" d IJt j d I| j IJt j d I| j IJt j d I| j IJt j d I| j IJt j d I| j IJd S( NR t s globals: s cells: s defs: s uses: s frees:( t syst stderrR R R R R R R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt DEBUGO s %c C sy | | j k r t S| | j k r& t S| | j k r9 t S| j rd | | j k s` | | j k rd t S| j rq t St Sd S( sb Return scope of name. The scope of a name could be LOCAL, GLOBAL, FREE, or CELL. N( R R R R R R R R R R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt check_nameW s ' c C sr | j s d Si } | j | j � xB | j j � D]1 } | | j k r3 | | j k r3 d | | <q3 q3 W| j � S( Ni ( ( R R$ R R R% R R ( R t freeR ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_free_varsi s c C sQ xJ | j D]? } | j � } | j | � } x | D] } | j | � q2 Wq Wd S( N( R R2 t add_freest force_global( R R) R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt handle_childrens s c C sf d | j | <| | j k r) | j | =n x6 | j D]+ } | j | � t k r3 | j | � q3 q3 Wd S( s� Force name to be global in scope. Some child of the current node had a free reference to name. When the child was processed, it was labelled a free variable. Now that all its enclosing scope have been processed, the name is known to be a global or builtin. So walk back down the child chain and set the name to be global rather than free. Be careful to stop if a child does not think the name is free. i N( R R R R0 R R4 ( R R R) ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR4 z s c C s g } x� | D]� } | j | � } | j r� | t k sR | t k sR t | t � rb d | j | <q | t k r~ | j | � q t | t � r� | t k r� d | j | <q | t k r | j | � q q | t k r� d | j | <q | t k r | j | � q q W| S( s� Process list of free vars from nested scope. Returns a list of names that are either 1) declared global in the parent or 2) undefined in a top-level parent. In either case, the nested scope should treat them as globals. i ( R0 R R R t isinstancet ClassScopeR R R( t FunctionScopeR R R ( R t namest child_globalsR t sc( ( s( /usr/lib64/python2.7/compiler/symbols.pyR3 � s$ c C s | j j � S( N( R R% ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_cell_vars� s N( R t __module__R R R R R R R" R# R' R* R+ R/ R0 R2 R5 R4 R3 R< ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR s" t ModuleScopec B s e Z e j Z d � Z RS( c C s | j d | � d S( Nt global( t _ModuleScope__super_init( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s ( R R= R R R@ ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR> � s R8 c B s e Z RS( ( R R= ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR8 � s t GenExprScopec B s, e Z e j Z d Z d d � Z d � Z RS( i c C s@ | j } | j d 7_ | j d | | | � | j d � d S( Ni s generator expression<%d>s .0( t _GenExprScope__countert _GenExprScope__super_initR# ( R R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s c C s t j | � } | S( N( R R' ( R R% ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR' � s N( R R= R R RC RB R R' ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRA � s t LambdaScopec B s# e Z e j Z d Z d d � Z RS( i c C s3 | j } | j d 7_ | j d | | | � d S( Ni s lambda.%d( t _LambdaScope__countert _LambdaScope__super_init( R R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s N( R R= R R RF RE R ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRD � s R7 c B s e Z e j Z d � Z RS( c C s | j | | | � d S( N( t _ClassScope__super_init( R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s ( R R= R R RG ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR7 � s t SymbolVisitorc B s e Z d � Z d � Z e Z d � Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z d � Z d d � Z d � Z d � Z d � Z d � Z d � Z d d � Z d d � Z d d � Z d d � Z d � Z e j e j e j f Z d � Z d � Z RS( c C s i | _ d | _ d S( N( t scopesR R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s c C s2 t � } | _ | j | <| j | j | � d S( N( R> R RI t visitt node( R RK t scope( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitModule� s c C s� | j r | j | j | � n | j | j � x! | j D] } | j | | � q9 Wt | j | j | j � } | j s� t | t � r� d | _ n | | j | <| j | | j � | j | j | � | j | | � d S( Ni ( t decoratorsRJ R R t defaultsR8 R R R R6 RI t _do_argst argnamest codet handle_free_vars( R RK t parentt nRL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitFunction� s c C s| t | j | j � } | j s< t | t � s< t | t � rH d | _ n | | j | <| j | j | � | j | | � d S( Ni ( RA R R R R6 R8 RI RJ RR RS ( R RK RT RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExpr� s c C s; x! | j D] } | j | | � q W| j | j | � d S( N( t qualsRJ t expr( R RK RL t genfor( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExprInner� s c C sQ | j | j | d � | j | j | � x! | j D] } | j | | � q3 Wd S( Ni ( RJ t assignt itert ifs( R RK RL t if_( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExprFor s c C s | j | j | � d S( N( RJ t test( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExprIf s i c C s� | s t � x! | j D] } | j | | � q Wt | j | j � } | j s^ t | t � rj d | _ n | | j | <| j | | j � | j | j | � | j | | � d S( Ni ( t AssertionErrorRO RJ RD R R R R6 R8 RI RP RQ RR RS ( R RK RT R\ RU RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitLambda s c C sJ xC | D]; } t | � t j k r5 | j | | � q | j | � q Wd S( N( t typet typest TupleTypeRP R# ( R RL t argsR ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRP s c C s | j | � | j � d S( N( R* R5 ( R RL RT ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRS s c C s� | j | j � x! | j D] } | j | | � q Wt | j | j � } | j sa t | t � rm d | _ n | j d k r� | j d � n | j d � | | j | <| j } | j | _ | j | j | � | | _ | j | | � d S( Ni t __doc__R= ( R R t basesRJ R7 R R R6 R8 t docR RI R RR RS ( R RK RT RU RL t prev( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitClass$ s c C s- | r | j | j � n | j | j � d S( N( R R R ( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitName; s c C s_ | j | j | d � | j | j | � | j | j | � | j r[ | j | j | � n d S( Ni ( RJ R\ t listt bodyt else_( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitForC s c C sC x< | j D]1 \ } } | d k r( q n | j | p7 | � q Wd S( Nt *( R9 R ( R RK RL R t asname( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitFromJ s c C sY xR | j D]G \ } } | j d � } | d k r> | | } n | j | pM | � q Wd S( Nt .i����( R9 t findR ( R RK RL R Rt R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitImportP s c C s% x | j D] } | j | � q Wd S( N( R9 R" ( R RK RL R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGlobalW s c C s> x$ | j D] } | j | | d � q W| j | j | � d S( s. Propagate assignment flag down to child nodes. The Assign node doesn't itself contains the variables being assigned to. Instead, the children in node.nodes are visited with the assign flag set to true. When the names occur in those nodes, they are marked as defs. Some names that occur in an assignment target are not bound by the assignment, e.g. a name occurring inside a slice. The visitor handles these nodes specially; they do not propagate the assign flag to their children. i N( t nodesRJ RY ( R RK RL RU ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAssign[ s i c C s | j | j � d S( N( R R ( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAssNamel s c C s | j | j | d � d S( Ni ( RJ RY ( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAssAttro s c C sA | j | j | d � x$ | j D] } | j | | d � q Wd S( Ni ( RJ RY t subs( R RK RL R\ RU ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitSubscriptr s c C s^ | j | j | d � | j r8 | j | j | d � n | j rZ | j | j | d � n d S( Ni ( RJ RY t lowert upper( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitSlicew s c C sX | j | j | � t | j t j � rA | j | j | d � n | j | j | � d S( Ni ( RJ RK R6 R t NameRY ( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAugAssign~ s c C s� xv | j D]k \ } } t | t j � rU t | j � | j k rU | j sR q qR qU n | j | | � | j | | � q W| j r� | j | j | � n d S( N( t testsR6 R t ConstRe t valuet _const_typesRJ Rq ( R RK RL Ra Rp ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitIf� s c C s d | _ | j | j | � d S( Ni ( R RJ R� ( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitYield� s ( R R= R RM t visitExpressionRV RW R[ R` Rb Rd RP RS Rm Rn Rr Ru Rx Ry R{ R| R} R R� R� Rf t StringTypet IntTypet FloatTypeR� R� R� ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRH � s4 c C s t | � t | � k S( N( t sorted( t l1t l2( ( s( /usr/lib64/python2.7/compiler/symbols.pyt list_eq� s t __main__( t parseFilet walkc C sT g g | j � D] } | j � ^ q D]* } | j d � pG | j d � s& | ^ q& S( Ns _[Rv ( t get_symbolst get_namet startswith( t symst s( ( s( /usr/lib64/python2.7/compiler/symbols.pyR' � s ,i t exect oopst skippingi ( ( (6 Ri t compilerR t compiler.constsR R R R R R t compiler.miscR Rf R- t MANGLE_LENR R> R8 RA RD R7 RH R� R R� R� t symtableR' t argvt filet opent ft readt buft closeR� t mod_namest treeR� RI t names2R� t exitR& R$ t valuesR� t is_namespaceR; R R� t lR t get_namespace( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt <module> sj . � � ! PK s�Zx��� � ast.pyonu �[��� � { fc @ s: d Z d d l m Z m Z d � Z d � Z i Z d d� d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d! e f d" � � YZ d# e f d$ � � YZ d% e f d& � � YZ d' e f d( � � YZ d) e f d* � � YZ d+ e f d, � � YZ d- e f d. � � YZ d/ e f d0 � � YZ d1 e f d2 � � YZ d3 e f d4 � � YZ d5 e f d6 � � YZ d7 e f d8 � � YZ d9 e f d: � � YZ! d; e f d< � � YZ" d= e f d> � � YZ# d? e f d@ � � YZ$ dA e f dB � � YZ% dC e f dD � � YZ& dE e f dF � � YZ' dG e f dH � � YZ( dI e f dJ � � YZ) dK e f dL � � YZ* dM e f dN � � YZ+ dO e f dP � � YZ, dQ e f dR � � YZ- dS e f dT � � YZ. dU e f dV � � YZ/ dW e f dX � � YZ0 dY e f dZ � � YZ1 d[ e f d\ � � YZ2 d] e f d^ � � YZ3 d_ e f d` � � YZ4 da e f db � � YZ5 dc e f dd � � YZ6 de e f df � � YZ7 dg e f dh � � YZ8 di e f dj � � YZ9 dk e f dl � � YZ: dm e f dn � � YZ; do e f dp � � YZ< dq e f dr � � YZ= ds e f dt � � YZ> du e f dv � � YZ? dw e f dx � � YZ@ dy e f dz � � YZA d{ e f d| � � YZB d} e f d~ � � YZC d e f d� � � YZD d� e f d� � � YZE d� e f d� � � YZF d� e f d� � � YZG d� e f d� � � YZH d� e f d� � � YZI d� e f d� � � YZJ d� e f d� � � YZK d� e f d� � � YZL d� e f d� � � YZM d� e f d� � � YZN d� e f d� � � YZO d� e f d� � � YZP d� e f d� � � YZQ d� e f d� � � YZR d� e f d� � � YZS d� e f d� � � YZT xN eU � jV � D]= \ ZW ZX eY eX eZ � r�e[ eX e � r�eX e eW j\ � <q�q�Wd� S(� sj Python abstract syntax node definitions This file is automatically generated by Tools/compiler/astgen.py i����( t CO_VARARGSt CO_VARKEYWORDSc C ss g } xf | D]^ } t | � } | t k s7 | t k r^ x1 t | � D] } | j | � qD Wq | j | � q W| S( N( t typet tuplet listt flattent append( t seqt lt eltt tt elt2( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s, g t | � D] } t | t � r | ^ q S( N( R t isinstancet Node( R t n( ( s$ /usr/lib64/python2.7/compiler/ast.pyt flatten_nodes s R c B s2 e Z d Z d � Z d � Z d � Z d � Z RS( s" Abstract base class for ast nodes.c C s d S( N( ( t self( ( s$ /usr/lib64/python2.7/compiler/ast.pyt getChildren s c c s x | j � D] } | Vq Wd S( N( R ( R R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt __iter__ s c C s | j � S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt asList s c C s d S( N( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt getChildNodes s ( t __name__t __module__t __doc__R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s t EmptyNodec B s e Z RS( ( R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR # s t Expressionc B s6 e Z d e d <d � Z d � Z d � Z d � Z RS( R t expressionc C s | | _ d S( N( t node( R R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt __init__) s c C s | j f S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR , s c C s | j f S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR / s c C s d t | j � S( Ns Expression(%s)( t reprR ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt __repr__2 s ( R R t nodesR R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR & s t Addc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( t leftt rightt lineno( R t leftrightR# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 6 s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ; s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR > s c C s d t | j � t | j � f S( Ns Add((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR A s N( R R t NoneR R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 5 s t Andc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR E s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR I s c C s& g } | j t | j � � t | � S( N( t extendR R R ( R t nodelist( ( s$ /usr/lib64/python2.7/compiler/ast.pyR L s c C s d t | j � f S( Ns And(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Q s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR& D s t AssAttrc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t exprt attrnamet flagsR# ( R R* R+ R, R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR U s c C s | j | j | j f S( N( R* R+ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR [ s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ^ s c C s, d t | j � t | j � t | j � f S( Ns AssAttr(%s, %s, %s)( R R* R+ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR a s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR) T s t AssListc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR e s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR l s c C s d t | j � f S( Ns AssList(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR q s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR- d s t AssNamec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( t nameR, R# ( R R/ R, R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR u s c C s | j | j f S( N( R/ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR } s c C s d t | j � t | j � f S( Ns AssName(%s, %s)( R R/ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR. t s t AssTuplec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns AssTuple(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR0 � s t Assertc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( t testt failR# ( R R2 R3 R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s0 g } | j | j � | j | j � t | � S( N( R R2 R3 R ( R t children( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sB g } | j | j � | j d k r8 | j | j � n t | � S( N( R R2 R3 R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Assert(%s, %s)( R R2 R3 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR1 � s t Assignc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R R* R# ( R R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R* R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R* R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Assign(%s, %s)( R R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR5 � s t AugAssignc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R t opR* R# ( R R R7 R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j | j f S( N( R R7 R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns AugAssign(%s, %s, %s)( R R R7 R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR6 � s t Backquotec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Backquote(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR8 � s t Bitandc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Bitand(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR9 � s t Bitorc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Bitor(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR: � s t Bitxorc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d t | j � f S( Ns Bitxor(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR; � s t Breakc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( Ns Break()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR< s t CallFuncc B s5 e Z d d d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ | | _ d S( N( R t argst star_argst dstar_argsR# ( R R R> R? R@ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C sV g } | j | j � | j t | j � � | j | j � | j | j � t | � S( N( R R R' R R> R? R@ R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ! s c C sz g } | j | j � | j t | j � � | j d k rN | j | j � n | j d k rp | j | j � n t | � S( N( R R R' R R> R? R% R@ R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ) s c C s8 d t | j � t | j � t | j � t | j � f S( Ns CallFunc(%s, %s, %s, %s)( R R R> R? R@ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 3 s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR= s t Classc B s2 e Z d d d � Z d � Z d � Z d � Z RS( c C s: | | _ | | _ | | _ | | _ | | _ | | _ d S( N( R/ t basest doct codet decoratorsR# ( R R/ RB RC RD RE R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 7 s c C sf g } | j | j � | j t | j � � | j | j � | j | j � | j | j � t | � S( N( R R/ R' R RB RC RD RE R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ? s c C sX g } | j t | j � � | j | j � | j d k rN | j | j � n t | � S( N( R' R RB R RD RE R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR H s c C sD d t | j � t | j � t | j � t | j � t | j � f S( Ns Class(%s, %s, %s, %s, %s)( R R/ RB RC RD RE ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR P s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRA 6 s t Comparec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* t opsR# ( R R* RG R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR T s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R RG R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Y s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R RG R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR _ s c C s d t | j � t | j � f S( Ns Compare(%s, %s)( R R* RG ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR e s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRF S s t Constc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( t valueR# ( R RI R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR m s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s c C s d t | j � f S( Ns Const(%s)( R RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRH h s t Continuec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR w s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR } s c C s d S( Ns Continue()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRJ v s t Decoratorsc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Decorators(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRK � s t Dictc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( t itemsR# ( R RM R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R RM ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R RM R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Dict(%s)( R RM ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRL � s t Discardc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Discard(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRN � s t Divc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Div((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRO � s t Ellipsisc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( Ns Ellipsis()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRP � s t Execc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R* t localst globalsR# ( R R* RR RS R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R* RR RS R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sd g } | j | j � | j d k r8 | j | j � n | j d k rZ | j | j � n t | � S( N( R R* RR R% RS R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns Exec(%s, %s, %s)( R R* RR RS ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRQ � s t FloorDivc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns FloorDiv((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRT � s t Forc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ | | _ d S( N( t assignR t bodyt else_R# ( R RV R RW RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sP g } | j | j � | j | j � | j | j � | j | j � t | � S( N( R RV R RW RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sb g } | j | j � | j | j � | j | j � | j d k rX | j | j � n t | � S( N( R RV R RW RX R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s8 d t | j � t | j � t | j � t | j � f S( Ns For(%s, %s, %s, %s)( R RV R RW RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRU � s t Fromc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t modnamet namest levelR# ( R RZ R[ R\ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j | j f S( N( RZ R[ R\ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s, d t | j � t | j � t | j � f S( Ns From(%s, %s, %s)( R RZ R[ R\ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRY s t Functionc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s� | | _ | | _ | | _ | | _ | | _ | | _ | | _ | | _ d | _ | _ | t @rn d | _ n | t @r� d | _ n d S( Ni ( RE R/ t argnamest defaultsR, RC RD R# R% t varargst kwargsR R ( R RE R/ R^ R_ R, RC RD R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR # s c C s� g } | j | j � | j | j � | j | j � | j t | j � � | j | j � | j | j � | j | j � t | � S( N( R RE R/ R^ R' R R_ R, RC RD R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 3 s c C sX g } | j d k r( | j | j � n | j t | j � � | j | j � t | � S( N( RE R% R R' R R_ RD R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR > s c C s\ d t | j � t | j � t | j � t | j � t | j � t | j � t | j � f S( Ns$ Function(%s, %s, %s, %s, %s, %s, %s)( R RE R/ R^ R_ R, RC RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR F s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR] " s t GenExprc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s2 | | _ | | _ d g | _ d | _ | _ d S( Ns .0( RD R# R^ R% R` Ra ( R RD R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR J s c C s | j f S( N( RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Q s c C s | j f S( N( RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR T s c C s d t | j � f S( Ns GenExpr(%s)( R RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR W s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRb I s t GenExprForc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ t | _ d S( N( RV t itert ifsR# t Falset is_outmost( R RV Rd Re R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR [ s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV Rd R' R Re R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR b s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV Rd R' R Re R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C s, d t | j � t | j � t | j � f S( Ns GenExprFor(%s, %s, %s)( R RV Rd Re ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRc Z s t GenExprIfc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R2 R# ( R R2 R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR t s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR x s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR { s c C s d t | j � f S( Ns GenExprIf(%s)( R R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ~ s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRh s s t GenExprInnerc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* t qualsR# ( R R* Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns GenExprInner(%s, %s)( R R* Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRi � s t Getattrc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* R+ R# ( R R* R+ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R* R+ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Getattr(%s, %s)( R R* R+ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRk � s t Globalc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R[ R# ( R R[ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Global(%s)( R R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRl � s t Ifc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( t testsRX R# ( R Rn RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R Rn R RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sH g } | j t | j � � | j d k r> | j | j � n t | � S( N( R' R Rn RX R% R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns If(%s, %s)( R Rn RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRm � s t IfExpc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R2 t thenRX R# ( R R2 Rp RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j | j f S( N( R2 Rp RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j | j f S( N( R2 Rp RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns IfExp(%s, %s, %s)( R R2 Rp RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRo � s t Importc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R[ R# ( R R[ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Import(%s)( R R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRq � s t Invertc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Invert(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRr � s t Keywordc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R/ R* R# ( R R/ R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R/ R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Keyword(%s, %s)( R R/ R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRs � s t Lambdac B s/ e Z d d � Z d � Z d � Z d � Z RS( c C sm | | _ | | _ | | _ | | _ | | _ d | _ | _ | t @rS d | _ n | t @ri d | _ n d S( Ni ( R^ R_ R, RD R# R% R` Ra R R ( R R^ R_ R, RD R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C sV g } | j | j � | j t | j � � | j | j � | j | j � t | � S( N( R R^ R' R R_ R, RD R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R_ R RD R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s8 d t | j � t | j � t | j � t | j � f S( Ns Lambda(%s, %s, %s, %s)( R R^ R_ R, RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRt s t LeftShiftc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR $ s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ) s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR , s c C s d t | j � t | j � f S( Ns LeftShift((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR / s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRu # s t Listc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 3 s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 7 s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR : s c C s d t | j � f S( Ns List(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ? s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRv 2 s t ListCompc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* Rj R# ( R R* Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR C s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR H s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR N s c C s d t | j � t | j � f S( Ns ListComp(%s, %s)( R R* Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR T s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRw B s t ListCompForc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( RV R Re R# ( R RV R Re R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR X s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV R R' R Re R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ^ s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV R R' R Re R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR e s c C s, d t | j � t | j � t | j � f S( Ns ListCompFor(%s, %s, %s)( R RV R Re ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR l s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRx W s t ListCompIfc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R2 R# ( R R2 R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR t s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR w s c C s d t | j � f S( Ns ListCompIf(%s)( R R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRy o s t SetCompc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* Rj R# ( R R* Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ~ s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns SetComp(%s, %s)( R R* Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRz } s t DictCompc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t keyRI Rj R# ( R R| RI Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R R| RI R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R R| RI R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns DictComp(%s, %s, %s)( R R| RI Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR{ � s t Modc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Mod((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR} � s t Modulec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( RC R R# ( R RC R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( RC R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Module(%s, %s)( R RC R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR~ � s t Mulc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Mul((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s t Namec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R/ R# ( R R/ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R/ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Name(%s)( R R/ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Notc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Not(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Orc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Or(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Passc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( Ns Pass()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Powerc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d t | j � t | j � f S( Ns Power((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Printc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R t destR# ( R R R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR % s c C sH g } | j t | j � � | j d k r> | j | j � n t | � S( N( R' R R R� R% R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR + s c C s d t | j � t | j � f S( Ns Print(%s, %s)( R R R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 2 s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Printnlc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R R� R# ( R R R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 6 s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ; s c C sH g } | j t | j � � | j d k r> | j | j � n t | � S( N( R' R R R� R% R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR A s c C s d t | j � t | j � f S( Ns Printnl(%s, %s)( R R R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR H s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� 5 s t Raisec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t expr1t expr2t expr3R# ( R R� R� R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR L s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R� R� R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR R s c C sv g } | j d k r( | j | j � n | j d k rJ | j | j � n | j d k rl | j | j � n t | � S( N( R� R% R R� R� R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Y s c C s, d t | j � t | j � t | j � f S( Ns Raise(%s, %s, %s)( R R� R� R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR c s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� K s t Returnc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( RI R# ( R RI R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR g s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR k s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR n s c C s d t | j � f S( Ns Return(%s)( R RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR q s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� f s t RightShiftc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR u s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR } s c C s d t | j � t | j � f S( Ns RightShift((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� t s t Setc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Set(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Slicec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ | | _ d S( N( R* R, t lowert upperR# ( R R* R, R� R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sP g } | j | j � | j | j � | j | j � | j | j � t | � S( N( R R* R, R� R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sd g } | j | j � | j d k r8 | j | j � n | j d k rZ | j | j � n t | � S( N( R R* R� R% R� R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s8 d t | j � t | j � t | j � t | j � f S( Ns Slice(%s, %s, %s, %s)( R R* R, R� R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Sliceobjc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Sliceobj(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Stmtc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Stmt(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Subc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Sub((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Subscriptc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R* R, t subsR# ( R R* R, R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R R* R, R' R R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R R� R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns Subscript(%s, %s, %s)( R R* R, R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t TryExceptc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( RW t handlersRX R# ( R RW R� RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j t | j � � | j | j � t | � S( N( R RW R' R R� RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sX g } | j | j � | j t | j � � | j d k rN | j | j � n t | � S( N( R RW R' R R� RX R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s, d t | j � t | j � t | j � f S( Ns TryExcept(%s, %s, %s)( R RW R� RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t TryFinallyc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( RW t finalR# ( R RW R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( RW R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( RW R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d t | j � t | j � f S( Ns TryFinally(%s, %s)( R RW R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Tuplec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR " s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR % s c C s d t | j � f S( Ns Tuple(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR * s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t UnaryAddc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR . s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 2 s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 5 s c C s d t | j � f S( Ns UnaryAdd(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 8 s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� - s t UnarySubc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR < s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR @ s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR C s c C s d t | j � f S( Ns UnarySub(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR F s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� ; s t Whilec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R2 RW RX R# ( R R2 RW RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR J s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R2 RW RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR P s c C sR g } | j | j � | j | j � | j d k rH | j | j � n t | � S( N( R R2 RW RX R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR W s c C s, d t | j � t | j � t | j � f S( Ns While(%s, %s, %s)( R R2 RW RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR _ s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� I s t Withc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R* t varsRW R# ( R R* R� RW R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR c s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R* R� RW R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C sR g } | j | j � | j d k r8 | j | j � n | j | j � t | � S( N( R R* R� R% RW R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s c C s, d t | j � t | j � t | j � f S( Ns With(%s, %s, %s)( R R* R� RW ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR x s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� b s t Yieldc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( RI R# ( R RI R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR | s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Yield(%s)( R RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� { s N( (] R t compiler.constsR R R R R R R R R R& R) R- R. R0 R1 R5 R6 R8 R9 R: R; R< R= RA RF RH RJ RK RL RN RO RP RQ RT RU RY R] Rb Rc Rh Ri Rk Rl Rm Ro Rq Rr Rs Rt Ru Rv Rw Rx Ry Rz R{ R} R~ R R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� RS RM R/ t objR R t issubclassR� ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt <module> s� ' PK s�Z��G� � __init__.pynu �[��� """Package for parsing and compiling Python source code There are several functions defined at the top level that are imported from modules contained in the package. parse(buf, mode="exec") -> AST Converts a string containing Python source code to an abstract syntax tree (AST). The AST is defined in compiler.ast. parseFile(path) -> AST The same as parse(open(path)) walk(ast, visitor, verbose=None) Does a pre-order walk over the ast using the visitor instance. See compiler.visitor for details. compile(source, filename, mode, flags=None, dont_inherit=None) Returns a code object. A replacement for the builtin compile() function. compileFile(filename) Generates a .pyc file by compiling filename. """ import warnings warnings.warn("The compiler package is deprecated and removed in Python 3.x.", DeprecationWarning, stacklevel=2) from compiler.transformer import parse, parseFile from compiler.visitor import walk from compiler.pycodegen import compile, compileFile PK s�Z�� �� � transformer.pyonu �[��� � { fc ) @ sf d Z d d l Td d l Z d d l Z d d l Z d e f d � � YZ d d l m Z m Z d d l m Z m Z m Z d � Z d d � Z d � Z d � Z d � Z d f d � � YZ e j e j e j e j e j e j e j e j e j e j e j e j e j e j e j! e j" g Z# i d e j$ 6d e j% 6d e j& 6d e j' 6d e j( 6d e j) 6d e j* 6Z+ e j, e j- e j. e j/ e j0 e j1 e j2 e j e j3 e j4 e j5 e j6 e j7 e j8 e j9 e j: e j; e j< e j= e j> e j? e j@ e jA e jB e jC e j e j e j e j e j e j e jD e j e j e j e j e j e j e j! e j" e jE g) ZF eG e d � r�eF jH e jI � n eG e d � r�eF jH e jJ � n e j e j e j e j e j e j e j e j e j e j e j e j! g ZK i ZL x' e jM jN � D] \ ZO ZP eP eL eO <qWx' e jQ jN � D] \ ZO ZP eP eL eO <q?Wd � ZR d S( s� Parse tree transformation module. Transforms Python source code into an abstract syntax tree (AST) defined in the ast module. The simplest ways to invoke this module are via parse and parseFile. parse(buf) -> AST parseFile(path) -> AST i����( t *Nt WalkerErrorc B s e Z RS( ( t __name__t __module__( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR ! s ( t CO_VARARGSt CO_VARKEYWORDS( t OP_ASSIGNt OP_DELETEt OP_APPLYc C s3 t | d � } | j � d } | j � t | � S( Nt Us ( t opent readt closet parse( t patht ft src( ( s, /usr/lib64/python2.7/compiler/transformer.pyt parseFile' s t execc C sT | d k s | d k r( t � j | � S| d k rD t � j | � St d � � d S( NR t singlet evals4 compile() arg 3 must be 'exec' or 'eval' or 'single'( t Transformert parsesuitet parseexprt ValueError( t buft mode( ( s, /usr/lib64/python2.7/compiler/transformer.pyR 1 s c C s� g } x� | D]� } t | d � r8 | j | j � � q t | � t d � k rl | j t t | � � � q t | � t g � k r� | j t | � � q | j | � q W| S( Nt asList( NN( t hasattrt appendR t typet Nonet tuple( t nodest lt item( ( s, /usr/lib64/python2.7/compiler/transformer.pyR : s c C sb t | d t � s | d Sx@ | d D]4 } t | t � r& t | � } | d k rZ | Sq& q& Wd S( Ni i ( t isinstanceR t extractLineNoR ( t astt childt lineno( ( s, /usr/lib64/python2.7/compiler/transformer.pyR% H s c G st | d } | t k r] y t | | d � SWqp t k rY t | Gt | � G| GH� qp Xn t d t | � � d S( Ni i s$ Can't find appropriate Node type: %s( R! t TypeErrort lenR t str( t argst kind( ( s, /usr/lib64/python2.7/compiler/transformer.pyt NodeR s R c B sU e Z d Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z e Z d � Z d � Z e Z e Z e Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z! d � Z" d � Z# d � Z$ d � Z% d � Z& d! � Z' d" � Z( d# � Z) d$ � Z* d% � Z+ d& � Z, d' � Z- d( � Z. d) � Z/ d* � Z0 d+ � Z1 d, � Z2 d- � Z3 d. � Z4 d/ � Z5 d0 � Z6 d1 � Z7 d2 � Z8 d3 � Z9 e9 Z: e9 Z; e9 Z< d4 � Z= d5 � Z> d6 � Z? e? Z@ d7 � ZA d8 � ZB d9 � ZC d: � ZD d; � ZE d< � ZF d= � ZG d> � ZH d? � ZI d@ � ZJ dA � ZK dB � ZL dC � ZM dD � ZN dE � ZO dF � ZP dG � ZQ dH � ZR dI � ZS dJ � ZT dK � ZU dL � ZV dM � ZW dN � ZX dO � ZY dP � ZZ dQ � Z[ dR � Z\ dS � Z] dT � Z^ dU � Z_ dV � Z` dW � Za dX � Zb dY � Zc dZ � Zd d[ � Ze d\ � Zf d] � Zg d^ � Zh d_ � Zi d` � Zj da � Zk db � Zl dc � Zm dd � Zn de � Zo df � Zp dg � Zq dh � Zr di � Zs dj � Zt dk � Zu dl � Zv dm � Zw dn � Zx do � Zy dp � Zz dq � Z{ dr � Z| ds � Z} du dt � Z RS(v s� Utility object for transforming Python parse trees. Exposes the following methods: tree = transform(ast_tree) tree = parsesuite(text) tree = parseexpr(text) tree = parsefile(fileob | filename) c C s� i | _ xE t j j � D]4 \ } } t | | � r t | | � | j | <q q W| j | j t j <i | j t j 6| j t j 6| j t j 6| j t j 6| j t j 6| j t j 6| j t j 6| _ d | _ d S( N( t _dispatcht symbolt sym_namet itemsR t getattrt com_NEWLINEt tokent NEWLINEt atom_lpart LPARt atom_lsqbt LSQBt atom_lbracet LBRACEt atom_backquotet BACKQUOTEt atom_numbert NUMBERt atom_stringt STRINGt atom_namet NAMEt _atom_dispatchR t encoding( t selft valuet name( ( s, /usr/lib64/python2.7/compiler/transformer.pyt __init__h s c C sC t | t � p t | t � s6 t j | d d �} n | j | � S( s, Transform an AST into a modified parse tree.t line_infoi ( R$ R t listt parsert st2tuplet compile_node( RG t tree( ( s, /usr/lib64/python2.7/compiler/transformer.pyt transformx s c C s | j t j | � � S( s6 Return a modified parse tree for the given suite text.( RQ RM t suite( RG t text( ( s, /usr/lib64/python2.7/compiler/transformer.pyR ~ s c C s | j t j | � � S( s; Return a modified parse tree for the given expression text.( RQ RM t expr( RG RS ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR � s c C s: t | � t d � k r' t | � } n | j | j � � S( s@ Return a modified parse tree for the contents of the given file.t ( R R R R ( RG t file( ( s, /usr/lib64/python2.7/compiler/transformer.pyt parsefile� s c C s | d } | t j k r= | d | _ | d } | d } n | t j k r] | j | d � S| t j k r} | j | d � S| t j k r� | j | d � S| t j k r� | j | d � S| t j k r� | j | d � S| t j k r� | j | d � St d | f � d S( Ni i i s unexpected node type( R0 t encoding_declRF t single_inputt file_inputt eval_inputt lambdeft funcdeft classdefR ( RG t nodet n( ( s, /usr/lib64/python2.7/compiler/transformer.pyRO � s$ c C s5 | d d } | t j k r. | j | d � St � S( Ni ( R5 R6 t com_stmtt Pass( RG R_ R` ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRY � s c C s� | j | t j � } | d k r* d } n d } g } xK | | D]? } | d t j k rA | d t j k rA | j | | � qA qA Wt | t | � � S( Ni i ( t get_docstringR0 RZ R R5 t ENDMARKERR6 t com_append_stmtt Modulet Stmt( RG t nodelistt doct it stmtsR_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRZ � s &c C s t | j | d � � S( Ni ( t Expressiont com_node( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR[ � s c C s] t | � } | j | � } d } x5 | | k rX t | | | d d � } | d 7} q$ W| S( Ni i ( R* RC t Getattr( RG Rh t listlenR# Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorator_name� s c C sL | j | d d � } t | � d k rB | j | | d � } n | } | S( Ni i ( Rp R* t com_call_function( RG Rh t funcnameRT ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorator� s c C s; g } x( | D] } | j | j | d � � q Wt | � S( Ni ( R Rs t Decorators( RG Rh R2 t dec_nodelist( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorators� s c C s� | d d t j k rC | d g t | d d � } | j | � S| d d t j k r� | j | d d � } | j | d d � } | | _ | St � � d S( Ni i ( R0 R] RL R^ Rv R ( RG Rh R` Rv t cls( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorated� s c C s� t | � d k r, | j | d d � } n d } | d d } | d d } | d d } | d t j k r� | j | d � \ } } } n d } } d } | j | d � } | j | d � } | d k r� | j d =n t | | | | | | | d | �S( Ni i i i����i i����i����R( ( ( R* Rv R R0 t varargslistt com_arglistRc Rm R! t Function( RG Rh Rv R( RI R, t namest defaultst flagsRi t code( ( s, /usr/lib64/python2.7/compiler/transformer.pyR] � s c C s~ | d d t j k r: | j | d d � \ } } } n d } } d } | j | d � } t | | | | d | d d �S( Ni i i i����R( ( ( R0 Ry Rz Rm t Lambda( RG Rh R| R} R~ R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR\ s # c C s� | d d } | j | d � } | d d t j k rA g } n3 | d d t j k ra g } n | j | d � } | j | d � } | d k r� | j d =n t | | | | d | d d �S( Ni i����i i i R( ( Rc R5 t COLONt RPARt com_basesRm R R! t Class( RG Rh RI Ri t basesR ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR^ & s c C s | j | d � S( Ni ( Ra ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt stmt< s c C sG g } x4 t d t | � d � D] } | j | | | � q Wt | � S( Ni i ( t rangeR* Re Rg ( RG Rh Rk Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt simple_stmtC s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt parametersJ s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRy M s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt fpdefP s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt fplistS s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt dotted_nameV s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt comp_opY s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt trailer\ s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt sliceop_ s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt argumentb s c C s | d } | j | � | d � } t | � d k rH t | d | j �S| d d t j k r� g } xA t d t | � d d � D]# } | j | j | | t � � q� Wt | | d | d d �S| j | d � } | j | d � } t | | d | d | d �St d � d S( Ni����i R( i i s can't get here( t lookup_nodeR* t DiscardR( R5 t EQUALR� R t com_assignR t Assignt com_augassignt com_augassign_opt AugAssignR ( RG Rh t ent exprNodet nodeslRj t lvalt op( ( s, /usr/lib64/python2.7/compiler/transformer.pyt expr_stmtj s #! c C s� g } t | � d k r' d } d } n? | d d t j k rZ | j | d � } d } n d } d } x: t | t | � d � D] } | j | j | | � � q W| d d t j k r� t | | d | d d �St | | d | d d �S( Ni i i i i����R( ( R* R R5 t RIGHTSHIFTRm R� R t COMMAt Printt Printnl( RG Rh R2 t startt destRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt print_stmt{ s c C s | j | d t � S( Ni ( R� R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt del_stmt� s c C s t d | d d � S( NR( i i ( Rb ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt pass_stmt� s c C s t d | d d � S( NR( i i ( t Break( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt break_stmt� s c C s t d | d d � S( NR( i i ( t Continue( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt continue_stmt� s c C sU t | � d k r0 t t d � d | d d �St | j | d � d | d d �S( Ni R( i i ( R* t Returnt ConstR Rm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt return_stmt� s c C s& | j | d � } t | d | j �S( Ni R( ( Rm R� R( ( RG Rh RT ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt yield_stmt� s c C sL t | � d k r( | j | d � } n t d � } t | d | d d �S( Ni R( i i ( R* Rm R� R t Yield( RG Rh RH ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt yield_expr� s c C s� t | � d k r( | j | d � } n d } t | � d k rV | j | d � } n d } t | � d k r� | j | d � } n d } t | | | d | d d �S( Ni i i R( i i ( R* Rm R t Raise( RG Rh t expr3t expr2t expr1( ( s, /usr/lib64/python2.7/compiler/transformer.pyt raise_stmt� s c C s | j | d � S( Ni ( Rm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt import_stmt� s c C s% t | j | d � d | d d �S( Ni R( i i ( t Importt com_dotted_as_names( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt import_name� s c C s d } x" | | d d k r* | d 7} q W| d } | | d t j k rl | j | | � } | d 7} n d } | | d d t j k r� t | d g | d | d d �S| | d | | d d t j k } t | | j | � | d | d d �Sd S( Ni t .i RU R R( i ( R N( R0 R� t com_dotted_nameR5 t STARt FromR R8 t com_import_as_names( RG Rh t idxt levelt fromnameR_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt import_from� s 'c C sV g } x5 t d t | � d � D] } | j | | d � q Wt | d | d d �S( Ni i R( i ( R� R* R t Global( RG Rh R| Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt global_stmt� s c C s� | j | d � } t | � d k ri | j | d � } t | � d k r` | j | d � } qs d } n d } } t | | | d | d d �S( Ni i i i i R( i i ( Rm R* R t Exec( RG Rh R� R� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt exec_stmt� s c C s\ | j | d � } t | � d k r; | j | d � } n d } t | | d | d d �S( Ni i i R( i i ( Rm R* R t Assert( RG Rh R� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt assert_stmt� s c C s� g } xe t d t | � d d � D]G } | j | | d � } | j | | d � } | j | | f � q# Wt | � d d k r� | j | d � } n d } t | | d | d d �S( Ni i i i i����R( i ( R� R* Rm R R t If( RG Rh t testsRj t testNodet suiteNodet elseNode( ( s, /usr/lib64/python2.7/compiler/transformer.pyt if_stmt� s #c C sr | j | d � } | j | d � } t | � d k rN | j | d � } n d } t | | | d | d d �S( Ni i i i R( i i ( Rm R* R t While( RG Rh R� t bodyNodeR� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt while_stmt s c C s� | j | d t � } | j | d � } | j | d � } t | � d k rd | j | d � } n d } t | | | | d | d d �S( Ni i i i R( i i ( R� R Rm R* R t For( RG Rh t assignNodet listNodeR� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt for_stmt s c C s | j | � S( N( t com_try_except_finally( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt try_stmt% s c C s | j | � S( N( t com_with( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt with_stmt( s c C s | j | � S( N( t com_with_var( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt with_var+ s c C sj t | � d k r# | j | d � Sg } x4 | D], } | d t j k r0 | j | | � q0 q0 Wt | � S( Ni i ( R* Ra R0 R� Re Rg ( RG Rh Rk R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRR . s c C s | j t | � S( N( t com_binaryt Tuple( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt testlist> s c C s] t | � d k rP | d d t j k rP | j | d � } | j | | d � S| j | � S( Ni i i ( R* R0 t comp_forRm t com_generator_expressionR� ( RG Rh t test( ( s, /usr/lib64/python2.7/compiler/transformer.pyt testlist_compH s )c C s� t | � d k r: | d d t j k r: | j | d � S| j | d � } t | � d k r� | j | d � } | j | d � } t | | | d | d d �S| S( Ni i i i R( ( R* R0 R\ Rm t IfExp( RG Rh t thenR� t else_( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� P s ) c C sJ t | � d k r: | d d t j k r: | j | d � S| j t | � S( Ni i ( R* R0 R\ R� t Or( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt or_test^ s )c C s | j t | � S( N( R� t And( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt and_teste s c C sA | j | d � } t | � d k r= t | d | d d �S| S( Ni����i R( i ( Rm R* t Not( RG Rh t result( ( s, /usr/lib64/python2.7/compiler/transformer.pyt not_testi s c C s | j | d � } t | � d k r) | Sg } x� t d t | � d � D]� } | | d } | d } | d t j k r� | d } t | � d k r� | d k r� d } q� d } q� n t | d } | d d } | j | | j | | � f � qH Wt | | d | �S( Ni i i i t nots not ins is notR( ( Rm R* R� R5 RD t _cmp_typesR t Compare( RG Rh R_ t resultsRj t nlR` R R( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt comparisonp s" $c C s | j t | � S( N( R� t Bitor( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRT � s c C s | j t | � S( N( R� t Bitxor( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt xor_expr� s c C s | j t | � S( N( R� t Bitand( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt and_expr� s c C s� | j | d � } x� t d t | � d � D]� } | j | | � } | | d d t j k r� t | | g d | d d �} q, | | d d t j k r� t | | g d | d d �} q, t d | | d d � q, W| S( Ni i i R( s unexpected token: %s( Rm R� R* R5 t LEFTSHIFTt LeftShiftR� t RightShiftR ( RG Rh R_ Rj t right( ( s, /usr/lib64/python2.7/compiler/transformer.pyt shift_expr� s ## c C s� | j | d � } x� t d t | � d � D]� } | j | | � } | | d d t j k r� t | | g d | d d �} q, | | d d t j k r� t | | g d | d d �} q, t d | | d d � q, W| S( Ni i i R( s unexpected token: %s( Rm R� R* R5 t PLUSt Addt MINUSt SubR ( RG Rh R_ Rj R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt arith_expr� s ## c C s | j | d � } x� t d t | � d � D]� } | j | | � } | | d d } | t j k r{ t | | g � } ny | t j k r� t | | g � } nU | t j k r� t | | g � } n1 | t j k r� t | | g � } n t d | � | d d | _ q, W| S( Ni i i s unexpected token: %s( Rm R� R* R5 R� t Mult SLASHt Divt PERCENTt Modt DOUBLESLASHt FloorDivR R( ( RG Rh R_ Rj R� t t( ( s, /usr/lib64/python2.7/compiler/transformer.pyt term� s c C s� | d } | d } | j | d � | d d � } | t j k rX t | d | d �S| t j k r{ t | d | d �S| t j k r� t | d | d �} n | S( Ni i����i R( i ( R� R5 R� t UnaryAddR t UnarySubt TILDEt Invert( RG Rh t eltR R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt factor� s !c C s� | j | d � } xw t d t | � � D]` } | | } | d t j k rw t | | j | | d � g d | d �S| j | | � } q) W| S( Ni i R( i ( Rm R� R* R5 t DOUBLESTARt Powert com_apply_trailer( RG Rh R_ Rj R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt power� s c C s | j | d d | � S( Ni ( RE ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt atom� s c C s@ | d d t j k r/ t d d | d d �S| j | d � S( Ni i R( i ( ( R5 R� R� Rm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR7 � s c C s@ | d d t j k r/ t d d | d d �S| j | d � S( Ni i R( i ( ( R5 t RSQBt Listt com_list_constructor( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR9 � s c C s@ | d d t j k r/ t d d | d d �S| j | d � S( Ni i R( i ( ( R5 t RBRACEt Dictt com_dictorsetmaker( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR; � s c C s t | j | d � � S( Ni ( t BackquoteRm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR= � s c C s, t | d d � } t | d | d d �S( Ni i R( i ( R R� ( RG Rh t k( ( s, /usr/lib64/python2.7/compiler/transformer.pyR? � s c C s[ | j rM | j d k r6 t | d � j | j � } n t d | j | f � St | � Sd S( Ns utf-8s iso-8859-1s # coding: %s %s( s utf-8s iso-8859-1( RF t unicodet encodeR ( RG t lit( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decode_literal� s c C sF d } x% | D] } | | j | d � 7} q Wt | d | d d �S( NRU i R( i i ( R" R� ( RG Rh R R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRA s c C s t | d d d | d d �S( Ni i R( i ( t Name( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRC s c C s | j | d S( Ni ( R/ ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� s c C s | j | d | d � S( Ni i ( R/ ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRm s c G s t t d � � S( N( R� R� R ( RG R, ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR4 ' s c C s� g } g } d } d } x�| t | � k r�| | } | d t j k s] | d t j k r+| d t j k r� | | d } | d t j k r� | j | d � | t B} | d } q� n | t | � k r'| | d } | t j k r� | | d } n t d | � | j | d � | t B} n Pn | j | j | � � | d } | t | � k r�| | d t j k r�| j | j | | d � � | d } n t | � r�t d � n | d } q W| | | f S( Ni i i s unexpected token: %si s- non-default argument follows default argument( R* R5 R� R RD R R R R t com_fpdefR� Rm t SyntaxError( RG Rh R| R} R~ Rj R_ R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRz - s< & ) c C s4 | d d t j k r( | j | d � S| d d S( Ni i i ( R5 R8 t com_fplist( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR$ _ s c C sp t | � d k r# | j | d � Sg } x: t d t | � d � D] } | j | j | | � � qB Wt | � S( Ni i ( R* R$ R� R R ( RG R_ RL Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR& e s c C s\ d } xK | D]C } t | � t d � k r | d d k r | | d d } q q W| d S( NRU i i R� i����( ( R ( RG R_ RI R` ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� n s (c C sO | d } | j | d d � } t | � d k r= | d f S| | d d f S( Ni i i ( R� R* R ( RG R_ t dot( ( s, /usr/lib64/python2.7/compiler/transformer.pyt com_dotted_as_namev s c C sa | d } | j | d � g } x: t d t | � d � D] } | j | j | | � � q9 W| S( Ni i i ( R( R� R* R ( RG R_ R| Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sH | d } t | � d k r. | d d d f S| d d | d d f S( Ni i i ( R* R ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt com_import_as_name� s c C sa | d } | j | d � g } x: t d t | � d � D] } | j | j | | � � q9 W| S( Ni i i ( R) R� R* R ( RG R_ R| Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sG g } x: t d t | � d � D] } | j | j | | � � q W| S( Ni i ( R� R* R Rm ( RG R_ R� Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C s� | d d t j k rL t | j | d � | j | d � d | d d �Sg } d } d } x4t d t | � d � D]} | | } | d t j k r't | � d k r� | j | d � } t | � d k r� | j | d t � } q� d } n d } } | j | | | j | | d � f � n | d t j k rw | d d k rd| j | | d � } q�| d d k r�| j | | d � } q�qw qw Wt | j | d � | | d | d d �} | r�t | | d | d d �S| Sd S( Ni i i i R( i i t elset finally( R5 RD t TryFinallyRm R R� R* R0 t except_clauseR� R R t TryExcept( RG Rh t clausesR� t finallyNodeRj R_ R� R� t try_except( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s6 *! c C su | j | d � } x[ t t | � d d d � D]= } | j | | | | d d � } | d k rg | S| } q0 Wd S( Ni����i i i����i i ( Rm R� R* t com_with_item( RG Rh t bodyRj t ret( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s #! c C sZ t | � d k r+ | j | d t � } n d } | j | d � } t | | | d | �S( Ni i i R( ( R* R� R R Rm t With( RG Rh R3 R( t varRT ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR2 � s c C s | d S( Ni ( ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sE | j | � } | j t t t t f k r. | St d | j j � d S( s� Return node suitable for lvalue of augmented assignment Names, slices, and attributes are the only allowable nodes. s can't assign to %sN( Rm t __class__R# t Slicet SubscriptRn R% R ( RG R_ R" ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sU xN| d } | t j t j t j t j f k r` t | � d k rS | j | | � S| d } q | t k r� t | � d k r� t d � n | d } q | t j k rq| d d t j k r� t d � n t | � d k rd| j | d � } x\ t d t | � d � D]A } | | } | d t j k r7t d � n | j | | � } qW| j | | d | � S| d } q | t j k r@| d d } | t j k r�| d } | d t j k r=t d � q=qM| t j k r| d } | d t j k rt d � n | j | | � S| t j k r4| j | d | � St d � q t d | � q Wd S( Ni i i s can't assign to operatori����s can't assign to ()s can't assign to []s can't assign to literals bad assignment (%s)( R0 t exprlistR� t testlist_safeR� R* t com_assign_tuplet _assign_typesR% R R Rm R� R5 R R t com_assign_trailerR8 R� R: R t com_assign_listRD t com_assign_name( RG R_ t assigningR t primaryRj t ch( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � sL $ c C s\ g } x= t d t | � d � D]# } | j | j | | | � � q Wt | d t | � �S( Ni i R( ( R� R* R R� t AssTupleR% ( RG R_ RA t assignsRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR< s !c C s� g } x} t d t | � d � D]c } | d t | � k re | | d d t j k re t d � qe n | j | j | | | � � q Wt | d t | � �S( Ni i i s" can't assign to list comprehensionR( ( R� R* R0 t list_forR% R R� t AssListR% ( RG R_ RA RE Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR? s !c C s t | d | d | d �S( Ni R( i ( t AssName( RG R_ RA ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR@ % s c C s� | d d } | t j k r4 | j | | d | � S| t j k rZ | j | | d | � S| t j k ru t d � n t d | � d S( Ni i i s can't assign to function calls unknown trailer type: %s( R5 t DOTt com_assign_attrR: t com_subscriptlistR8 R% ( RG RB R_ RA R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR> ( s c C s t | | d | d | d �S( Ni R( i����( t AssAttr( RG RB R_ RA ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRJ 2 s c C s� t | � } | d k r9 | d } | j | � | d � Sg } xD t d | d � D]0 } | | } | j | j | � | d � � qR W| | d t | � �S( s= Compile 'NODE (OP NODE)*' into (type, [ node1, ..., nodeN ]).i i i R( ( R* R� R� R R% ( RG t constructorRh R" R` R2 Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� 5 s $c C s9 | j | � | d � } t | t � r, | St | g � S( Ni ( R� R$ Rg ( RG R_ R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRa A s c C sL | j | � | d � } t | t � r; | j | j � n | j | � d S( Ni ( R� R$ Rg t extendR! R ( RG Rk R_ R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRe H s c C s� g } x� t d t | � � D]l } | | d t j k rQ | j | d | | � S| | d t j k rn q n | j | j | | � � q Wt | d | d j �S( Ni i R( ( R� R* R0 RF t com_list_comprehensionR5 R� R Rm R R( ( RG Rh t valuesRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR P s c C s | j | d | d � S( NRL ( t com_comprehensionR ( RG RT R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRO ] s c C s | d d } g } x| r�| d d } | d k r� | j | d t � } | j | d � } t | | g � } | d d | _ | j | � t | � d k r� d } q�| d k r� | j | d � } q�| j | d � } q | d k r| j | d � } t | d | d d �} | j j | � t | � d k rGd } q�| d k ri| j | d � } q�| j | d � } q t d | | f � q W| d k r�t | | d | �S| d k r�t | | d | �S| d k r�t | | | d | �St d t | � � � d S( Ni i t fori i RL t ifR( i s' unexpected comprehension element: %s %dt sett dicts unexpected comprehension type: ( R� R Rm t ListCompForR( R R* R t com_list_itert com_comp_itert ListCompIft ifsR% t ListCompt SetCompt DictCompR t repr( RG R� R� R_ R R( t forsR R� t compNodet newforR� t newif( ( s, /usr/lib64/python2.7/compiler/transformer.pyRQ ` sD c C s | d S( Ni ( ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRW � s c C s | d S( Ni ( ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRX � s c C su | d d } g } x8| rN| d d } | d k r� | j | d t � } | j | d � } t | | g d | d d �} | j | � t | � d k r� d } qK| j | d � } q | d k r8| j | d � } t | d | d d �} | j j | � t | � d k r"d } qK| j | d � } q t d | | f � q Wt | d _ t t | | � d | �S( Ni i RR i R( i RS i s. unexpected generator expression element: %s %di ( R� R Rm t GenExprForR R* R RX t GenExprIfRZ R% t Truet is_outmostt GenExprt GenExprInner( RG RT R_ R( R_ R R� t genNodeRa R� Rb ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s2 c C s� | d } t | � d k s3 | d d t j k r� g } x: t d t | � d � D] } | j | j | | � � qR Wt | d | d j �S| d d t j k r� | j | d � } | j | d | d d � St | � d k r:| d d t j k r:| j | d � } | j | d � } | j | | | d d � Sg } xQ t d t | � d � D]7 } | j | j | | � | j | | d � f � qYWt | d | d d j �Sd S( Ni i i R( RT i RU i ( R* R5 R� R� R Rm t SetR( R0 R� RQ R R ( RG Rh R2 Rj RT t keyRH ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR � s$ ) ) c C s� | d d } | t j k r1 | j | | d � S| t j k rT | j | | d � S| t j k rz | j | | d t � St d | � d S( Ni i i s unknown node type: %s( R5 R8 Rq RI t com_select_memberR: RK R R% ( RG t primaryNodeRh R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR � s c C s: | d t j k r t d � n t | | d d | d �S( Ni s member must be a namei R( i ( R5 RD R% Rn ( RG Rm Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRl � s c C s� | d t j k r, t | g d t | � �Sg } d } d } } t | � } d } x@| | k r�| | } | d t j k r� | d k r� t d � n | j | | d � } | d } qW nR | d t j k r| d k r� t d � n | j | | d � } | d } qW n | j | | | � \ } } | d k r|t | t � r|t | � d k r|| d d t j k r|t d � n | j | � | d } qW Wt | | | | d t | � �S( Ni R( i s$ already have the varargs indentifieri s# already have the kwargs indentifieri s& generator expression needs parenthesis( R5 R� t CallFuncR% R R* R� R% Rm R t com_argumentR$ Rg R0 R� R ( RG Rm Rh R, t kwt star_nodet dstar_nodet len_nodelistRj R_ R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRq � s: ) c C sD t | � d k rV | d d t j k rV | j | d � } d | j | | d � f St | � d k r� | rz t d � n | r� t d � n d | j | d � f S| j | d � } | d } x3 t | � d k r� | d t j k r� | d } q� W| d t j k r t d | d � n t | d | d | d �} d | f S( Ni i i i s! non-keyword arg after keyword args+ only named arguments may follow *expressions# keyword can't be an expression (%s)R( ( R* R0 R� Rm R� R% R5 RD t Keyword( RG Rh Rp Rq R� R� R` R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRo s" ) ( c C s� t | � d k r� | d } | d d t j k s\ t | � d k r� | d d t j k r� | d d t j k r� | j | | | � Sn g } x: t d t | � d � D] } | j | j | | � � q� Wt | | | d t | � �S( Ni i i i����R( ( R* R5 R� R0 R� t com_sliceR� R t com_subscriptR9 R% ( RG RB Rh RA t subt subscriptsRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRK " s ) c C s| | d } | d } | t j k rA | d d t j k rA t � S| t j k sb t | � d k ro | j | � S| j | � S( Ni i i ( R5 RI t EllipsisR� R* t com_sliceobjRm ( RG R_ RC R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRv 6 s &! c C s> g } | d d t j k r9 | j t d � � d } n | j | j | d � � d } | t | � k r� | | d t j k r� | j | j | | � � | d } n | j t d � � xi t | t | � � D]R } | | } t | � d k r | j t d � � q� | j | j | d � � q� Wt | d t | � �S( Ni i i i R( ( R5 R� R R� R Rm R* R0 R� R� t SliceobjR% ( RG R_ R2 Rj t jRC ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRz @ s ) c C s� d } } t | � d k r_ | d d t j k rI | j | d � } q� | j | d � } n; t | � d k r� | j | d � } | j | d � } n t | | | | d t | � �S( Ni i i i i R( ( R R* R5 R� Rm R8 R% ( RG RB R_ RA t lowert upper( ( s, /usr/lib64/python2.7/compiler/transformer.pyRu d s c C s� | d k r# | d } | d } n | t j k r� t | � d k rU | j | d � Sx. | D]& } | d t j k r\ | j | � Sq\ Wd S| t j k r� x. | D]& } | d t j k r� | j | � Sq� Wd S| t j k r'| d d t j k r#d } x" | D] } | t | d � } qW| Sd S| t j k sT| t j k sT| t j k re| j | d � S| t k r�t | � d k r�| j | d � Sd S( Ni i RU ( R R0 RR R* Rc R� RZ R R5 RB R R� t small_stmtt _doc_nodes( RG R_ R` Rw t sR ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRc r s8 N(� R R t __doc__RJ RQ R R RW RO RY RZ R[ Rp Rs Rv Rx R] R\ t old_lambdefR^ R� R t flow_stmtt compound_stmtR� R� Ry R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� RR R� R; t testlist1R: R� R� R� t old_testR� R� R� RT R� R� R� R R R R R R7 R9 R; R= R? R" RA RC R� Rm R4 Rz R$ R& R� R( R� R) R� R� R� R� R2 R� R� R� R< R? R@ R> RJ R� Ra Re R RO RQ RW RX R� R R Rl Rq Ro RK Rv Rz Ru R Rc ( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR ^ s� ! ! 2 ) , 1 " ' $ t <t >s ==s <=s >=s !=R� R� c C s~ g } xq | D]i } t | t t f � rD | j t j | | � � q t | t � rc | j | � q | j t | � � q W| S( N( R$ t intt longR t _namest getR+ t debug_tree( RP R" R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s (S R� t compiler.astRM R0 R5 t StandardErrorR t compiler.constsR R R R R R R R R% R. R R� R� R; R� R� R� R� R� RT R� R� R� R R R R R� t LESSt GREATERt EQEQUALR� t LESSEQUALt GREATEREQUALt NOTEQUALR� R] R^ R� R R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� RR R: R t _legal_node_typesR R R� R� R= R� R1 R2 R t vt tok_nameR� ( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt <module> s� � � � � � 9 PK s�Z��� �� �� pycodegen.pycnu �[��� � { fc @ s� d d l Z d d l Z d d l Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z m Z d d l m Z m Z m Z m Z d d l m Z m Z m Z m Z m Z d d l m Z m Z m Z m Z m Z m Z m Z m Z m Z d d l m Z y e j! d Z" Wn e# k r2d Z" n Xi d d d f 6d d d f 6d d d f 6d d d f 6Z$ d Z% d Z& d Z' d Z( d d � Z) e* e* d � Z+ d f d � � YZ, d e, f d � � YZ- d e, f d � � YZ. d e, f d � � YZ/ d f d � � YZ0 d � Z1 d f d � � YZ2 d f d! � � YZ3 d" e3 e2 f d# � � YZ4 d$ e3 e2 f d% � � YZ5 d& e3 e2 f d' � � YZ6 d( f d) � � YZ7 d* e3 e7 e2 f d+ � � YZ8 d, e3 e7 e2 f d- � � YZ9 d. f d/ � � YZ: d0 e3 e: e2 f d1 � � YZ; d2 � Z< d3 � Z= d4 f d5 � � YZ> d6 f d7 � � YZ? d8 e? f d9 � � YZ@ d: e? f d; � � YZA d< e? f d= � � YZB d> e? f d? � � YZC i e@ e jD 6eA e jE 6eB e jF 6eC e jG 6ZH d@ � ZI eJ dA k r�x e jK d D] ZL e) eL � q�Wn d S(B i����N( t StringIO( t astt parset walkt syntax( t pyassemt misct futuret symbols( t SC_LOCALt SC_GLOBAL_IMPLICITt SC_GLOBAL_EXPLICITt SC_FREEt SC_CELL( t CO_VARARGSt CO_VARKEYWORDSt CO_NEWLOCALSt CO_NESTEDt CO_GENERATORt CO_FUTURE_DIVISIONt CO_FUTURE_ABSIMPORTt CO_FUTURE_WITH_STATEMENTt CO_FUTURE_PRINT_FUNCTION( t TupleArgi i t CALL_FUNCTIONt CALL_FUNCTION_VARt CALL_FUNCTION_KWt CALL_FUNCTION_VAR_KWi i i c C s� t | d � } | j � } | j � t | | � } y | j | � Wn t k r[ � n+ Xt | d d � } | j | � | j � d S( Nt Ut ct wb( t opent readt closet Modulet compilet SyntaxErrort dump( t filenamet displayt ft buft mod( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt compileFile% s c C s� | d k s | d k r$ t d � n | d k rB t | | � } nH | d k r` t | | � } n* | d k r~ t | | � } n t d � � | j � | j S( s* Replacement for builtin compile() functions not implemented yett singlet exect evals6 compile() 3rd arg must be 'exec' or 'eval' or 'single'N( t Nonet RuntimeErrort InteractiveR" t Expressiont ValueErrorR# t code( t sourceR& t modet flagst dont_inheritt gen( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# 3 s t AbstractCompileModec B s2 e Z d Z d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d | _ d S( N( R5 R& R/ R4 ( t selfR5 R& ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt __init__H s c C s9 t | j | j � } t j | j | � t j | � | S( N( R R5 R6 R t set_filenameR& R t check( R; t tree( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt _get_treeM s c C s d S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# S s c C s | j S( N( R4 ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt getCodeV s N( t __name__t __module__R/ R6 R< R@ R# RA ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR: D s R2 c B s e Z d Z d � Z RS( R. c C s+ | j � } t | � } | j � | _ d S( N( R@ t ExpressionCodeGeneratorRA R4 ( R; R? R9 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# ] s ( RB RC R6 R# ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR2 Y s R1 c B s e Z d Z d � Z RS( R, c C s+ | j � } t | � } | j � | _ d S( N( R@ t InteractiveCodeGeneratorRA R4 ( R; R? R9 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# f s ( RB RC R6 R# ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR1 b s R" c B s8 e Z d Z d d � Z d � Z e j � Z d � Z RS( R- i c C sN | j � } t | � } | r; d d l } | j | � GHn | j � | _ d S( Ni����( R@ t ModuleCodeGeneratort pprintRA R4 ( R; R' R? R9 RG ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# o s c C s* | j | j � � t j | j | � d S( N( t writet getPycHeadert marshalR% R4 ( R; R( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR% w s c C s2 t j j | j � } t j d | � } | j | S( Ns <i( t ost patht getmtimeR& t structt packt MAGIC( R; t mtime( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRI } s ( RB RC R6 R# R% t impt get_magicRP RI ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR" k s t LocalNameFinderc B sk e Z d Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( s Find local names in scopec C sC t j � | _ t j � | _ x | D] } | j j | � q% Wd S( N( R t Sett namest globalst add( R; RV t name( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C sF x< | j j � D]+ } | j j | � r | j j | � q q W| j S( N( RW t elementsRV t has_eltt remove( R; t elt( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt getLocals� s c C s d S( N( ( R; t node( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDict� s c C s( x! | j D] } | j j | � q Wd S( N( RV RW RX ( R; R_ RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGlobal� s c C s | j j | j � d S( N( RV RX RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFunction� s c C s d S( N( ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitLambda� s c C s4 x- | j D]" \ } } | j j | p( | � q Wd S( N( RV RX ( R; R_ RY t alias( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitImport� s c C s4 x- | j D]" \ } } | j j | p( | � q Wd S( N( RV RX ( R; R_ RY Rd ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFrom� s c C s | j j | j � d S( N( RV RX RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitClass� s c C s | j j | j � d S( N( RV RX RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssName� s ( ( RB RC t __doc__R< R^ R` Ra Rb Rc Re Rf Rg Rh ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRT � s c C s& t | t j � r" | j s" d Sn d S( Ni i ( t isinstanceR t Constt value( R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt is_constant_false� s t CodeGeneratorc B sU e Z d Z d Z d� Z d� Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z e d � Z e Z d� Z d� Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z! d � Z" d � Z# d � Z$ d � Z% d � Z& d � Z' d � Z( d � Z) d � Z* d! � Z+ d" � Z, d# � Z- d$ � Z. d% � Z/ d& � Z0 d' � Z1 d( � Z2 d) � Z3 d* � Z4 d+ � Z5 d, � Z6 d- � Z7 d. � Z8 d Z9 d/ � Z: d0 � Z; d1 � Z< d2 � Z= d3 � Z> d4 � Z? d5 � Z@ d6 � ZA d7 � ZB d8 � ZC d9 � ZD d: � ZE d; � ZF d< � ZG d= d> � ZH eI d? k rveH ZJ eH ZK n d@ � ZJ dA � ZK dB � ZL i dC dD 6dE dF 6dG dH 6dI dJ 6dK dL 6dM dN 6dO dP 6dQ dR 6dS dT 6dU dV 6dW dX 6dY dZ 6ZM d[ � ZN d\ � ZO d] � ZP d^ � ZQ d_ � ZR d` � ZS d da � ZT db � ZU dc � ZV dd � ZW d� de � ZX d� df � ZY dg � ZZ dh � Z[ di � Z\ dj � Z] dk � Z^ dl � Z_ dm � Z` dn � Za do � Zb dp � Zc dq � Zd dr � Ze ds � Zf dt � Zg du � Zh dv � Zi dw � Zj dx � Zk dy � Zl dz � Zm d{ � Zn d| � Zo d} � Zp d~ � Zq d � Zr d� � Zs d� � Zt RS(� s� Defines basic code generator for Python bytecode This class is an abstract base class. Concrete subclasses must define an __init__() that defines self.graph and then calls the __init__() defined in this class. The concrete class must also define the class attributes NameFinder, FunctionGen, and ClassGen. These attributes can be defined in the initClass() method, which is a hook for initializing these methods after all the classes have been defined. i c C s | j d k r( | j � d | j _ n | j � t j � | _ t j � | _ d | _ | j � d | _ | j � j } x� | D]� } | d k r� | j j t � d | _ q� | d k r� | j j t � q� | d k r� | j j t � q� | d k r� | j j t � q� q� Wd S( Ni t BINARY_DIVIDEt divisiont BINARY_TRUE_DIVIDEt absolute_importt with_statementt print_function( t _CodeGenerator__initializedR/ t initClasst __class__t checkClassR t Stackt localst setupst last_linenot _setupGraphDelegationt _div_opt get_modulet futurest grapht setFlagR R R R ( R; R� t feature( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s( c C s d S( s) This method is called once for each classN( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRv � t c C s� yX t | d � s t � t | d � s- t � t | d � sB t � t | d � sW t � Wn, t k r� } d | j j } t | � n Xd S( s* Verify that class is constructed correctlyR� t NameFindert FunctionGent ClassGens Bad class construction for %sN( t hasattrt AssertionErrort getattrRw RB ( R; t msgt intro( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRx � s c C sO | j j | _ | j j | _ | j j | _ | j j | _ | j j | _ d S( N( R� t emitt newBlockt startBlockt nextBlockt setDocstring( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR} � s c C s | j j � S( s Return a code object( R� RA ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRA � s c C s* | j d k r" t j | | j � S| Sd S( N( t class_nameR/ R t mangle( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s t j � } t | | � | j S( N( R t SymbolVisitorR t scopes( R; R? t s( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt parseSymbols s c C s t d � d S( Ns# should be implemented by subclasses( R0 ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s c C s | j j � j | � S( N( Rz t topR[ ( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt isLocalName s c C s | j d | � d S( Nt STORE( t _nameOp( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt storeName s c C s | j d | � d S( Nt LOAD( R� ( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt loadName s c C s | j d | � d S( Nt DELETE( R� ( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt delName s c C s | j | � } | j j | � } | t k rd | j sM | j | d | � q | j | d | � n� | t k r� | j | d | � n� | t k r� | j s� | j | d | � q | j | d | � nB | t k s� | t k r� | j | d | � n t d | | f � d S( Nt _NAMEt _FASTt _GLOBALt _DEREFs unsupported scope for var %s: %d( R� t scopet check_nameR t optimizedR� R R R R R0 ( R; t prefixRY R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� s c C s8 | j r | j | d | � n | j | d | � d S( s� Emit name ops for names generated implicitly by for loops The interpreter generates names that start with a period or dollar sign. The symbol table ignores these names because they aren't present in the program text. R� R� N( R� R� ( R; R� RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt _implicitNameOp+ s c C sT t | d d � } | d k rP | | j k s3 | rP | j d | � | | _ t St S( s� Emit SET_LINENO if necessary. The instruction is considered necessary if the node has a lineno attribute and it is different than the last lineno emitted. Returns true if SET_LINENO was emitted. There are no rules for when an AST node should have a lineno attribute. The transformer and AST code need to be reviewed and a consistent policy implemented and documented. Until then, this method works around missing line numbers. t linenot SET_LINENON( R� R/ R| R� t Truet False( R; R_ t forceR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt set_lineno< s c C s� | j | � | _ | j | | _ | j d d � | j r^ | j d | j � | j d � n t | j | j � d d �} | j j | j � � | j | j � | j d d � | j d � d S( NR� i t LOAD_CONSTRi t verboset RETURN_VALUE( R� R� R� R� t docR� R R_ R� Rz t pushR^ t visitR/ ( R; R_ t lnf( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitModuleZ s c C sP | j | � | j | � | _ | j | | _ | j | j � | j d � d S( NR� ( R� R� R� R� R� R_ R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitExpressiong s c C sC | j | d d �| j r/ | j | j � n | j | j � d S( Nt isLambdai ( t _visitFuncOrLambdaR� R� R� RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRb n s c C s | j | d d �d S( NR� i ( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRc t s c C s | rI | j rI x! | j j D] } | j | � q Wt | j j � } n d } | j | | j | | j | j � � } t | j | � | j � | j | � x | j D] } | j | � q� W| j | t | j � � x$ t | � D] } | j d d � q� Wd S( Ni R i ( t decoratorst nodesR� t lenR� R� R� R R R4 t finishR� t defaultst _makeClosuret rangeR� ( R; R_ R� t decoratort ndecoratorsR9 t defaultt i( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� w s c C s� | j | | j | j � � } t | j | � | j � | j | � | j d | j � x | j D] } | j | � qb W| j d t | j � � | j | d � | j d d � | j d � | j | j � d S( NR� t BUILD_TUPLEi R t BUILD_CLASS( R� R� R R R4 R� R� R� RY t basesR� R� R� R� ( R; R_ R9 t base( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRg � s c C s� | j � } t | j � } x� t | � D]� } | j | \ } } t | � rS q( n | j | � | j | � | j � } | j d | � | j � | j | � | j d | � | j | � q( W| j r� | j | j � n | j | � d S( Nt POP_JUMP_IF_FALSEt JUMP_FORWARD( R� R� t testsR� Rm R� R� R� R� R� t else_( R; R_ t endt numtestsR� t testt suitet nextTest( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitIf� s" c C s | j | � | j � } | j � } | j � } | j d | � | j | � | j j t | f � | j | d t �| j | j � | j d | p� | � | j � | j | j � | j d | � | j | � | j d � | j j � | j r | j | j � n | j | � d S( Nt SETUP_LOOPR� R� t JUMP_ABSOLUTEt POP_BLOCK( R� R� R� R� R{ R� t LOOPR� R� R� t bodyR� t popR� ( R; R_ t loopR� t after( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitWhile� s& c C s( | j � } | j � } | j � } | j j t | f � | j | � | j d | � | j | j � | j d � | j | � | j | d d �| j d | � | j | j � | j | j � | j d | � | j | � | j d � | j j � | j r| j | j � n | j | � d S( NR� t GET_ITERR� i t FOR_ITERR� R� ( R� R{ R� R� R� R� R� t listR� t assignR� R� R� ( R; R_ t startt anchorR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFor� s( c C sC | j s% t d | j | j f � n | j | � | j d � d S( Ns 'break' outside loop (%s, %d)t BREAK_LOOP( R{ R$ R& R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBreak� s c C s[ | j s% t d | j | j f � n | j j � \ } } | t k rp | j | � | j d | � | j � n� | t k s� | t k r)| j | � t | j � } x= | d k r� | d } | j | \ } } | t k r� Pq� q� W| t k r t d | j | j f � n | j d | � | j � n. | t k rWd } t | | j | j f � n d S( Ns 'continue' outside loop (%s, %d)R� i i t CONTINUE_LOOPs7 'continue' not allowed inside 'finally' clause (%s, %d)( R{ R$ R& R� R� R� R� R� R� t EXCEPTt TRY_FINALLYR� t END_FINALLY( R; R_ t kindt blockR� t loop_blockR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitContinue� s0 c C sp | j � } x< | j d D]- } | j | � | j | | � | j � q W| j | j d � | j | � d S( Ni����( R� R� R� R� R� ( R; R_ t jumpR� t child( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTest s c C s | j | d � d S( Nt JUMP_IF_FALSE_OR_POP( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAnd s c C s | j | d � d S( Nt JUMP_IF_TRUE_OR_POP( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitOr s c C s� | j � } | j � } | j | j � | j d | � | j | j � | j d | � | j | � | j | j � | j | � d S( NR� R� ( R� R� R� R� t thenR� R� ( R; R_ t endblockt elseblock( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitIfExp s c C s3 | j | j � | j � } xl | j d D]] \ } } | j | � | j d � | j d � | j d | � | j d | � | j � q* W| j r� | j d \ } } | j | � | j d | � n t | j � d k r/| j � } | j d | � | j | � | j d � | j d � | j | � n d S( Ni����t DUP_TOPt ROT_THREEt COMPARE_OPR� i R� t ROT_TWOt POP_TOP( R� t exprR� t opsR� R� R� R� ( R; R_ t cleanupt opR4 R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitCompare s( c C sF | j | � | j d d � g } x� t t t | j � � | j � D] \ } } | j | � \ } } d } x< | j D]1 } | d k r� | j � } n | j | | � qv W| j d | | | f � qE W| j | j � | j d t | j � d � xJ | D]B \ } } } | r!| j | � n | j d | � | j | � q� Wd S( Nt BUILD_LISTi t LIST_APPENDi R� ( R� R� t zipR� R� t qualsR� R/ t ifsR� t insertR� R� R� ( R; R_ t stackR� t for_R� R� t contt if_( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitListComp8 s$ . c C sF | j | � | j d d � g } x� t t t | j � � | j � D] \ } } | j | � \ } } d } x< | j D]1 } | d k r� | j � } n | j | | � qv W| j d | | | f � qE W| j | j � | j d t | j � d � xJ | D]B \ } } } | r!| j | � n | j d | � | j | � q� Wd S( Nt BUILD_SETi t SET_ADDi R� ( R� R� R R� R� R R� R/ R R� R R� R� R� ( R; R_ R R� R R� R� R R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSetCompP s$ . c C sV | j | � | j d d � g } x� t t t | j � � | j � D] \ } } | j | � \ } } d } x< | j D]1 } | d k r� | j � } n | j | | � qv W| j d | | | f � qE W| j | j � | j | j � | j d t | j � d � xJ | D]B \ } } } | r1| j | � n | j d | � | j | � q Wd S( Nt BUILD_MAPi t MAP_ADDi R� ( R� R� R R� R� R R� R/ R R� R Rl t keyR� R� ( R; R_ R R� R R� R� R R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDictComph s& . c C s� | j � } | j � } | j | j � | j d � | j | � | j | d t �| j d | � | j � | j | j � | | f S( NR� R� R� ( R� R� R� R� R� R� R� R� ( R; R_ R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitListCompFor� s c C sA | j | d t �| j | j � | j d | � | j � d S( NR� R� ( R� R� R� R� R� R� ( R; R_ t branch( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitListCompIf� s c C s� | j j � } | ro x | D] } | j d | � q W| j d t | � � | j d | � | j d | � n | j d | � | j d | � d S( Nt LOAD_CLOSURER� R� t MAKE_CLOSUREt MAKE_FUNCTION( R� t get_free_varsR� R� ( R; R9 t argst freesRY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s� t | | j | j | j � � } t | j | � | j � | j | � | j | d � | j | j j d j � | j d � | j d d � d S( Ni R� R i ( t GenExprCodeGeneratorR� R� R R R4 R� R� R� R� R t iterR� ( R; R_ R9 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExpr� s c C ss | j | � g } x� t t t | j � � | j � D]� \ } } | j | � \ } } } d } x< | j D]1 } | d k r� | j � } n | j | | � qi W| j d | | | | f � q5 W| j | j � | j d � | j d � xt | D]l \ } } } } | r| j | � n | j d | � | j | � | j d � | j j � | j | � q� W| j d d � d S( Ni t YIELD_VALUER� R� R� R� ( R� R R� R� R R� R/ R R� R R� R� R� R� R{ R� ( R; R_ R R� R R� R� R� R R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExprInner� s, . c C s� | j � } | j � } | j � } | j j t | f � | j d | � | j rc | j d � n | j | j � | j d � | j | � | j | d t �| j d | � | j � | j | j � | | | f S( NR� s .0R� R� R� ( R� R{ R� R� R� t is_outmostR� R� R R� R� R� R� ( R; R_ R� R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExprFor� s c C sA | j | d t �| j | j � | j d | � | j � d S( NR� R� ( R� R� R� R� R� R� ( R; R_ R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExprIf� s c C s� | j � } | j | � | j � | j | j � | j d | � | j � | j d d � | j r� | j | j � | j d d � n | j d d � | j | � d S( Nt POP_JUMP_IF_TRUEt LOAD_GLOBALR� t RAISE_VARARGSi i ( R� R� R� R� R� R� t fail( R; R_ R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssert� s c C s� | j | � d } | j r9 | j | j � | d } n | j r_ | j | j � | d } n | j r� | j | j � | d } n | j d | � d S( Ni i R( ( R� t expr1R� t expr2t expr3R� ( R; R_ t n( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitRaise� s c C s9 | j � } | j � } | j � } | j r< | j � } n | } | j | � | j d | � | j | � | j j t | f � | j | j � | j d � | j j � | j d | � | j | � t | j � d } xt t | j � � D]� } | j | \ } } } | j | � | rt| j d � | j | � | j d d � | j � } | j d | � | j � n | j d � | r�| j | � n | j d � | j d � | j | � | j d | � | r�| j | � q� | j � q� W| j d � | j r(| j | � | j | j � n | j | � d S( Nt SETUP_EXCEPTR� R� i R� R� s exception matchR� R� R� ( R� R� R� R� R� R{ R� R� R� R� R� R� R� t handlersR� ( R; R_ R� R1 R� t lElset lastR� R� t targett next( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTryExcept sR c C s� | j � } | j � } | j | � | j d | � | j | � | j j t | f � | j | j � | j d � | j j � | j d d � | j | � | j j t | f � | j | j � | j d � | j j � d S( Nt SETUP_FINALLYR� R� R� ( R� R� R� R� R{ R� R� R� R� R� R/ R� t final( R; R_ R� R8 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTryFinally8 s c C s� | j � } | j � } | j d 7_ d | j } | j | � | j | j � | j d � | j d d � | j d � | j d d � | j d d � | j d k r� | j d � n | j d | � | j d | � | j | � | j j t | f � | j d k r?| j d | � | j d | � | j | j � n | j | j � | j d � | j j � | j d d � | j | � | j j t | f � | j d � | j d � | j j � | j d 8_ d S( Ni s _[%d]R� t LOAD_ATTRt __exit__R� t __enter__R i R� R� R7 R� R� R� R� t WITH_CLEANUPR� ( R� t _CodeGenerator__with_countR� R� R� R� t varsR/ R� R� R{ R� R� R� R� R� ( R; R_ R� R8 t valuevar( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitWithK s> c C s. | j | � | j | j � | j d � d S( NR� ( R� R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDiscardo s c C s | j d | j � d S( NR� ( R� Rl ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitConstt s c C s' | j d | j � | j | j � d S( NR� ( R� RY R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitKeywordw s c C s d S( N( ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRa { s c C s! | j | � | j | j � d S( N( R� R� RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitName s c C s | j | � d S( N( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPass� s c C s� | j | � | j j t � r% d n d } x� | j D]� \ } } t d k rp | j d | � | j d d � n | j d | � | j d � d } | r� | j | � | j | � q5 | j | � q5 Wd S( Ni i����i R� t IMPORT_NAMEt .( R� R� t checkFlagR RV t VERSIONR� R/ t splitt _resolveDotsR� ( R; R_ t levelRY Rd R* ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRe � s c C sT | j | � | j } | d k r> | j j t � r> d } n t d � | j D� � } t d k r� | j d | � | j d | � n | j d | j � x� | j D]� \ } } t d k r/| d k r� d | _ | j d � t | j � d k s� t � d S| j d | � | j | � | j | p(| � q� | j d | � q� W| j d � d S( Ni i����c s s | ] \ } } | Vq d S( N( ( t .0RY Rd ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pys <genexpr>� s i R� RG t *t IMPORT_STARt IMPORT_FROMR� ( R� RM R� RI R t tupleRV RJ R� t modnamet namespaceR� R� RL R� ( R; R_ RM t fromlistRY Rd ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRf � s* c C sN | j d � } t | � d k r% d Sx" | d D] } | j d | � q0 Wd S( NRH i R: ( RK R� R� ( R; RY t eltsR] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRL � s c C s0 | j | j � | j d | j | j � � d S( NR: ( R� R� R� R� t attrname( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGetattr� s c C s� | j | � | j | j � t | j � d } xh t t | j � � D]Q } | j | } | | k ru | j d � n t | t j � rF | j | � qF qF Wd S( Ni R� ( R� R� R� R� R� R� R� Rj R t Node( R; R_ t dupsR� R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssign� s c C sa | j d k r" | j | j � n; | j d k rQ | j | � | j | j � n d G| j GHd S( Nt OP_ASSIGNt OP_DELETEt oops( R7 R� RY R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRh � s c C s� | j | j � | j d k r> | j d | j | j � � n? | j d k rl | j d | j | j � � n d G| j GH| GHd S( NR\ t STORE_ATTRR] t DELETE_ATTRs warning: unexpected flags:( R� R� R7 R� R� RW ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssAttr� s t UNPACK_SEQUENCEc C sS t | � d k r. | j | t | j � � n x | j D] } | j | � q8 Wd S( NR] ( t findOpR� R� R� R� ( R; R_ R R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt _visitAssSequence� s i c C s | j | d � d S( Nt UNPACK_TUPLE( Rd ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssTuple� s c C s | j | d � d S( Nt UNPACK_LIST( Rd ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssList� s c C sg | j | � t | j � } | j | d � | j | j � | j | j | j � | j | d � d S( Nt loadt store( R� t wrap_augR_ R� R� R� t _augmented_opcodeR ( R; R_ t aug_node( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugAssign� s t INPLACE_ADDs +=t INPLACE_SUBTRACTs -=t INPLACE_MULTIPLYs *=t INPLACE_DIVIDEs /=t INPLACE_FLOOR_DIVIDEs //=t INPLACE_MODULOs %=t INPLACE_POWERs **=t INPLACE_RSHIFTs >>=t INPLACE_LSHIFTs <<=t INPLACE_ANDs &=t INPLACE_XORs ^=t INPLACE_ORs |=c C sB | d k r | j | j � n | d k r> | j | j � n d S( NRi Rj ( R� RY R� ( R; R_ R6 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugName s c C s� | d k rH | j | j � | j d � | j d | j | j � � n8 | d k r� | j d � | j d | j | j � � n d S( NRi R� R: Rj R� R_ ( R� R� R� R� RW ( R; R_ R6 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugGetattr s c C s� | d k r | j | d � n� | d k r� d } | j rG | d B} n | j r] | d B} n | d k ry | j d � n) | d k r� | j d � n | j d � | j d | � n d S( NRi i Rj i i R� i t ROT_FOURR� s STORE_SLICE+%d( t visitSlicet lowert upperR� ( R; R_ R6 t slice( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugSlice s c C sL | d k r | j | d � n) | d k rH | j d � | j d � n d S( NRi i Rj R� t STORE_SUBSCR( t visitSubscriptR� ( R; R_ R6 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugSubscript# s c C s� | j | j � | j d k r2 | j d d � n | j | j � | j d k ra | j d � n | j | j � | j d � d S( NR� R� t EXEC_STMT( R� R� Rz R/ R� RW ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitExec* s c C s d } d } | j | � | j | j � xG | j D]< } | j | � t | t j � re | d } q3 | d } q3 W| j d k r� | j | j � n | j d k r� | j | j � n | j d k } | j d k } t | | f } | j | | d >| B� d S( Ni i i ( R� R� R_ R Rj R t Keywordt star_argsR/ t dstar_argst callfunc_opcode_infoR� ( R; R_ t post kwt argt have_start have_dstart opcode( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitCallFunc6 s" c C s� | j | � | j r) | j | j � n xj | j D]_ } | j rR | j d � n | j | � | j r� | j d � | j d � q3 | j d � q3 W| j r� | r� | j d � n d S( NR� R� t PRINT_ITEM_TOt PRINT_ITEMR� ( R� t destR� R� R� ( R; R_ t newlineR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPrintJ s c C s= | j | d d �| j r, | j d � n | j d � d S( NR� i t PRINT_NEWLINE_TOt PRINT_NEWLINE( R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPrintnlZ s c C s. | j | � | j | j � | j d � d S( NR� ( R� R� Rl R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitReturna s c C s. | j | � | j | j � | j d � d S( NR! ( R� R� Rl R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitYieldf s c C s2 | j | j � d } | j r< | j | j � | d B} n | j rb | j | j � | d B} n | r� | d k r� | j d � q� | d k r� | j d d � q� | j d d � n | j d k r� | j d | � nU | j d k r� | j d | � n2 | j d k r | j d | � n d G| j GH� d S( Ni i i R� i t DUP_TOPXt OP_APPLYs SLICE+%dR\ s STORE_SLICE+%dR] s DELETE_SLICE+%ds weird slice( R� R� R R� R� R7 ( R; R_ t aug_flagR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR~ m s, c C s� | j | j � x | j D] } | j | � q Wt | j � d k rb | j d t | j � � n | r{ | j d d � n | j d k r� | j d � n> | j d k r� | j d � n | j d k r� | j d � n d S( Ni R� R� i R� t BINARY_SUBSCRR\ R� R] t DELETE_SUBSCR( R� R� t subsR� R� R7 ( R; R_ R� t sub( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s1 | j | j � | j | j � | j | � d S( N( R� t leftt rightR� ( R; R_ R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt binaryOp� s c C s | j | d � S( Nt BINARY_ADD( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAdd� s c C s | j | d � S( Nt BINARY_SUBTRACT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSub� s c C s | j | d � S( Nt BINARY_MULTIPLY( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitMul� s c C s | j | | j � S( N( R� R~ ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDiv� s c C s | j | d � S( Nt BINARY_FLOOR_DIVIDE( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFloorDiv� s c C s | j | d � S( Nt BINARY_MODULO( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitMod� s c C s | j | d � S( Nt BINARY_POWER( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPower� s c C s | j | d � S( Nt BINARY_LSHIFT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitLeftShift� s c C s | j | d � S( Nt BINARY_RSHIFT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitRightShift� s c C s! | j | j � | j | � d S( N( R� R� R� ( R; R_ R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt unaryOp� s c C s | j | d � S( Nt UNARY_INVERT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitInvert� s c C s | j | d � S( Nt UNARY_NEGATIVE( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitUnarySub� s c C s | j | d � S( Nt UNARY_POSITIVE( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitUnaryAdd� s c C s | j | d � S( NR� ( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitUnaryInvert� s c C s | j | d � S( Nt UNARY_NOT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitNot� s c C s | j | d � S( Nt UNARY_CONVERT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBackquote� s c C sD | j | d � x, | d D] } | j | � | j | � q Wd S( Ni i ( R� R� ( R; R� R R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt bitOp� s c C s | j | j d � S( Nt BINARY_AND( R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBitand� s c C s | j | j d � S( Nt BINARY_OR( R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBitor� s c C s | j | j d � S( Nt BINARY_XOR( R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBitxor� s c C s | j d t � d S( NR� ( R� t Ellipsis( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitEllipsis� s c C sK | j | � x | j D] } | j | � q W| j d t | j � � d S( NR� ( R� R� R� R� R� ( R; R_ R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTuple� s c C sK | j | � x | j D] } | j | � q W| j d t | j � � d S( NR ( R� R� R� R� R� ( R; R_ R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitList� s c C sK | j | � x | j D] } | j | � q W| j d t | j � � d S( NR ( R� R� R� R� R� ( R; R_ R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSet� s c C s> x | j D] } | j | � q W| j d t | j � � d S( Nt BUILD_SLICE( R� R� R� R� ( R; R_ R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSliceobj� s c C s| | j | � | j d d � xX | j D]M \ } } | j d � | j | � | j | � | j d � | j d � q' Wd S( NR i R� R� R� ( R� R� t itemsR� ( R; R_ t kt v( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR` � s N(u RB RC Ri R� R/ Ru R� R< Rv Rx R} RA R� R� R R� R� R� R� R� R� R� R� RT R� R� R� R� R� Rb Rc R� Rg R� R� R� R� R� R� R� R� R� R R R R R R R� R R" R$ R% R* R/ R6 R9 R> RA RB RC RD Ra RE RF Re Rf RL RX R[ Rh Ra Rd RJ Rf Rh Rn Rl R{ R| R� R� R� R� R� R� R� R� R~ R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R` ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRn � s� / $ t NestedScopeMixinc B s e Z d Z d � Z RS( s> Defines initClass() for nested scoping (Python 2.2-compatible)c C s( t | j _ t | j _ t | j _ d S( N( RT Rw R� t FunctionCodeGeneratorR� t ClassCodeGeneratorR� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRv s ( RB RC Ri Rv ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� s RF c B s) e Z e j Z d Z d � Z d � Z RS( c C sE t j d | j � | _ t j | � | _ | j � t | | � d S( Ns <module>( R t PyFlowGraphR& R� R t find_futuresR� t _ModuleCodeGenerator__super_initR ( R; R? ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< s c C s | S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s N( RB RC Rn R< R� R/ R� R ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRF s RD c B s/ e Z e j Z d Z d Z d � Z d � Z RS( c C s3 t j d | j � | _ | j � t | | � d S( Ns <expression>( R R� R& R� t$ _ExpressionCodeGenerator__super_initR ( R; R? ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< # s c C s | S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR ( s N( ( RB RC Rn R< R� R/ R� R� R ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRD s RE c B s8 e Z e j Z d Z d Z d � Z d � Z d � Z RS( c C sM t j d | j � | _ | j � | j | � t | | � | j d � d S( Ns <interactive>R� ( R R� R& R� t% _InteractiveCodeGenerator__super_initR� R R� ( R; R? ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< 2 s c C s | S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR 9 s c C s! | j | j � | j d � d S( Nt PRINT_EXPR( R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRB < s N( ( RB RC Rn R< R� R/ R� R� R RB ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRE + s t AbstractFunctionCodec B sG e Z d Z d Z d � Z d � Z d � Z d � Z d � Z e Z RS( i i c C sL | | _ | | _ | r> t } d | j } | j d | _ n | j } t | j � \ } } t j | | j | d d �| _ | | _ | j � | r� | j r� | j | j � n t | j | j | � d d �} | j j | j � � | j r| j j t � n | j r"| j j t � n | j | � | rH| j | j � n d S( Ns <lambda.%d>i R� R� i ( R� t moduleR� t lambdaCountRY t generateArgListt argnamesR R� R& R� R� t super_initR� R� R R4 R� Rz R� R^ t varargsR� R t kwargsR R� t generateArgUnpack( R; t funcR� R� R� R* t klassRY R t hasTupleArgR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< F s. ! c C s | j S( N( R� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR c s c C s: | j j � | j s) | j d d � n | j d � d S( NR� R� ( R� t startExitBlockR� R� R/ ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� f s c C sb x[ t t | � � D]G } | | } t | t � r | j d d | d � | j | � q q Wd S( Nt LOAD_FASTs .%di ( R� R� Rj RR R� t unpackSequence( R; R R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� l s c C s t d k r% | j d t | � � n | j d t | � � x= | D]5 } t | t � rg | j | � qB | j d | � qB Wd S( Ni Rb Re R� ( RJ R� R� Rj RR R� R� ( R; t tupR] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� s s ( RB RC R� R� R< R R� R� R� t unpackTuple( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� B s R� c B s) e Z e j Z d Z e j Z d � Z RS( c C s� | | _ | | | _ | j | | | | | � | j j | j j � � | j j | j j � � | j j d k r� | j j t � n d S( N( R� R� t" _FunctionCodeGenerator__super_initR� t setFreeVarsR t setCellVarst get_cell_varst generatorR/ R� R ( R; R� R� R� R� R* ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s N( RB RC Rn R< R� R/ R� R� R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s R c B s) e Z e j Z d Z e j Z d � Z RS( c C su | | _ | | | _ | j | | d | | � | j j | j j � � | j j | j j � � | j j t � d S( Ni ( R� R� t! _GenExprCodeGenerator__super_initR� R� R R� R� R� R ( R; t gexpR� R� R* ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s N( RB RC Rn R< R� R/ R� R� R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AbstractClassCodec B s# e Z d � Z d � Z d � Z RS( c C s� | j | _ | | _ t j | j | j d d d d �| _ | j � t | j | j � d d �} | j j | j � � | j j t � | j r� | j | j � n d S( NR� i R� i R� ( RY R� R� R R� R& R� R� R R4 R� Rz R� R^ R� R R� R� ( R; R� R� R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C s | j S( N( R� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s c C s+ | j j � | j d � | j d � d S( Nt LOAD_LOCALSR� ( R� R� R� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s ( RB RC R< R R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s R� c B s) e Z e j Z d Z e j Z d � Z RS( c C s� | | _ | | | _ | j | | | � | j j | j j � � | j j | j j � � | j | � | j d d � | j d � | j r� | j d | j � | j d � n d S( NR' RB RC R� Ri ( R� R� t _ClassCodeGenerator__super_initR� R� R R� R� R� R� R� R� ( R; R� R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s N( RB RC Rn R< R� R/ R� R� R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s� g } g } d } x� t t | � � D]� } | | } t | t � rT | j | � q% t | t � r� | j t | d | � � | j t j | � � | d } q% t d | � q% W| | | f S( s& Generate an arg list marking TupleArgsi i i s unexpect argument type:( R� R� Rj t strt appendRR R t extendR t flattenR3 ( t arglistR t extrat countR� R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s# t � } t | | d d �| j S( s5 Find the op (DELETE, LOAD, STORE) in an AssTuple treeR� i ( t OpFinderR R ( R_ R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRc � s R c B s& e Z d � Z d � Z e Z e Z RS( c C s d | _ d S( N( R/ R ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C s@ | j d k r | j | _ n | j | j k r< t d � n d S( Ns mixed ops in stmt( R R/ R7 R3 ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRh � s ( RB RC R< Rh Ra R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t Delegatorc B s e Z d Z d � Z d � Z RS( s Base class to support delegation for augmented assignment nodes To generator code for augmented assignments, we use the following wrapper classes. In visitAugAssign, the left-hand expression node is visited twice. The first time the visit uses the normal method for that node . The second time the visit uses a different method that generates the appropriate code to perform the assignment. These delegator classes wrap the original AST nodes in order to support the variant visit methods. c C s | | _ d S( N( t obj( R; R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C s t | j | � S( N( R� R ( R; t attr( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt __getattr__� s ( RB RC Ri R< R ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AugGetattrc B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AugNamec B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AugSlicec B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s t AugSubscriptc B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s c C s t | j | � S( N( t wrapperRw ( R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRk s t __main__(M RR RK RJ RN t syst cStringIOR t compilerR R R R R R R R t compiler.constsR R R R R R R R R R R R R R t compiler.pyassemR t version_infoRJ t AttributeErrorR� R� R� R� R� R+ R/ R# R: R2 R1 R" RT Rm Rn R� RF RD RE R� R� R R� R� R� Rc R R R R R R t Getattrt Namet Slicet SubscriptR Rk RB t argvt file( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt <module> s� ""(@ + � � � � U> PK s�Z����_e _e pyassem.pycnu �[��� � { fc @ s d Z d d l Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z m Z d f d � � YZ d � Z d f d � � YZ d Z d Z d Z d Z d e f d � � YZ d � Z d f d � � YZ d � Z d � Z d f d � � YZ d f d � � YZ e � j Z d S( s/ A flow graph representation for Python bytecodei����N( t misc( t CO_OPTIMIZEDt CO_NEWLOCALSt CO_VARARGSt CO_VARKEYWORDSt FlowGraphc B s} e Z d � Z d � Z d d � Z d � Z d � Z d Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( c C s[ t � | _ | _ t d � | _ t j � | _ | j j | j � | j j | j � d S( Nt exit( t Blockt currentt entryR R t Sett blockst add( t self( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt __init__ s c C sr | j re | j rW d Gt | j � GHd G| j j GHd G| j j GHd G| j j � GHn t | � GHn | | _ d S( Nt ends nexts prevs ( t _debugR t reprt nextt prevt get_children( R t block( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt startBlock s c C s< | d k r | j � } n | j j | � | j | � d S( N( t Nonet newBlockR t addNextR ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt nextBlock s c C s t � } | j j | � | S( N( R R R ( R t b( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR 5 s c C s | j | j � d S( N( R R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt startExitBlock: s i c C s d | _ d S( Ni ( R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _enable_debug? s c C s d | _ d S( Ni ( R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _disable_debugB s c G se | j r d G| GHn t | � d k rQ t | d t � rQ | j j | d � n | j j | � d S( Ns i i ( R t lent isinstanceR R t addOutEdget emit( R t inst( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR" E s %c C s t | j | j � } | S( sl Return the blocks in reverse postorder i.e. each node appears before all of its successors ( t order_blocksR R ( R t order( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getBlocksInOrderL s c C s | j j � S( N( R t elements( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getBlocksT s c C s | j S( s/ Return nodes appropriate for use with dominator( R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getRootW s c C s4 g } x' | j � D] } | j | j � � q W| S( N( R( t extendt getContainedGraphs( R t lR ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR+ [ s N( t __name__t __module__R R R R R R R R R R" R& R( R) R+ ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR s c s� g } t � � | g } xh | r� | j � } | � k r? q n � j | � x0 | j � D]" } | � k rY | j | � qY qY Wq Wi � x� � D]� } t r� | j r� | | j d j d k s� t | | j f � � n � j | t � � xd | j � D]V } xM � j | t � � j | � | j rH| j d | k rH| j d } q Pq Wq� Wq� W� � f d � } | } xv | j | � � j | � | j r�| j d } qpn) | | k r�| j � r�| j | � n � s�Pn | � } qpW| S( s8 Order blocks so that they are emitted in the right orderi c sP x7 � D]/ } x& � | D] } | � k r Pq q W| Sq Wd sL t d � � d S( Ni s+ circular dependency, cannot find next block( t AssertionError( R t c( t dominatorst remaining( s( /usr/lib64/python2.7/compiler/pyassem.pyt find_next� s ( t sett popR R t appendt __debug__R R R/ t setdefaultt get_followerst discardt has_unconditional_transfer( t start_blockt exit_blockR% t todoR R0 R3 ( ( R1 R2 s( /usr/lib64/python2.7/compiler/pyassem.pyR$ b sH 2 R c B sz e Z d Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d Z d � Z d � Z d � Z d � Z RS( i t c C sP g | _ t � | _ | | _ t j | _ g | _ g | _ t j d t _ d S( Ni ( t instsR4 t outEdgest labelR t _countt bidR R ( R RB ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s c C s, | j r d | j | j f Sd | j Sd S( Ns <block %s id=%d>s <block id=%d>( RB RD ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt __repr__� s c C s2 t t | j � } d | j | j d j | � f S( Ns <block %s %d: %s>s ( t mapt strR@ RB RD t join( R R@ ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt __str__� s c C s | d } | j j | � d S( Ni ( R@ R6 ( R R# t op( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR" � s c C s | j S( N( R@ ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getInstructions� s c C s | j j | � d S( N( RA R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR! � s c C s~ | j j | � t | j � d k s= t t t | j � � � | j j | � t | j � d k sz t t t | j � � � d S( Ni ( R R6 R R/ RF RG R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s -t RETURN_VALUEt RAISE_VARARGSt JUMP_ABSOLUTEt JUMP_FORWARDt CONTINUE_LOOPc C s? y | j d \ } } Wn t t f k r1 d SX| | j k S( s� Returns True if there is an unconditional transfer to an other block at the end of this block. This means there is no risk for the bytecode executer to go past this block's bytecode.i����N( R@ t IndexErrort ValueErrort _uncond_transfer( R RJ t arg( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR; � s c C s t | j � | j S( N( t listRA R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s c C sN t | j � } x8 | j D]- } | d t j k r | j | d � q q W| S( s: Get the whole list of followers, including the next block.i i ( R4 R R@ t PyFlowGrapht hasjrelR ( R t followersR# ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR9 � s c C sb g } xU | j D]J } t | � d k r. q n | d } t | d � r | j | j � q q W| S( s� Return all graphs contained within this block. For example, a MAKE_FUNCTION block will contain a reference to the graph for the function body. i t graph( R@ R t hasattrR6 RY ( R t containedR# RJ ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR+ � s ( RL RM RN RO RP ( R- R. RC R RE RI R" RK R! R RS R; R R9 R+ ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s t RAWt FLATt CONVt DONERV c B sA e Z e j Z d d d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z e � Z x% e j D] Z e j e j e � q� We � Z x% e j D] Z e j e j e � q� Wd � Z d � Z d � Z i Z d � Z d � Z e Z e Z d � Z d � Z e Z e Z! e Z" e Z# e Z$ e Z% e Z& e Z' e Z( e Z) d � Z* e* Z+ e* Z, d � Z- e. e j/ � Z0 d � Z1 xD e2 � j3 � D]3 \ Z4 Z5 e4 d d k r�e4 d Z e5 e e <q�q�W[4 [5 [ d � Z6 i Z7 x. e8 e9 e j � � D] Z: e: e7 e j e: <qW[: d � Z; d � Z< RS( i c C s | j � | | _ | | _ d | _ | | _ t | � | _ | | _ | r\ t t B| _ n d | _ g | _ g | _ g | _ g | _ g | _ t | � p� g | _ xO t t | j � � D]8 } | j | } t | t � r� | j � | j | <q� q� Wt | _ d S( Ni ( t super_initt namet filenameR t docstringt argst getArgCountt argcountt klassR R t flagst constst namest freevarst cellvarst closureRU t varnamest rangeR R t TupleArgt getNameR\ t stage( R Ra Rb Rd t optimizedRg t it var( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR s* c C s | | _ d S( N( Rc ( R t doc( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setDocstring s c C s3 | j | B| _ | t k r/ | j d | _ n d S( Ni ( Rh R Rf ( R t flag( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setFlag" s c C s | j | @r d Sd S( Ni ( Rh ( R Rx ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt checkFlag' s c C s t | � | _ d S( N( RU Rk ( R Rj ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setFreeVars+ s c C s | | _ d S( N( Rl ( R Rj ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setCellVars. s c C s� | j t k s t � | j � | j � | j t k s> t � | j � | j t k s] t � | j � | j t k s| t � | j � S( s Get a Python code object( Rr R\ R/ t computeStackDeptht flattenGraphR] t convertArgsR^ t makeByteCodeR_ t newCodeObject( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getCode1 s c C s� | r t j } | t _ n d } x~ | j D]s } | d } | d k rK Hn t | � d k r{ d Gd | G| GH| d } q+ d Gd | G| G| d GH| d } q+ W| r� | t _ n d S( Ni t SET_LINENOi s s %3di ( t syst stdoutR@ R ( R t iot savet pct tt opname( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt dump= s c sp i � d } x* � j � D] } t | j � � � | <q Wi � � � � � f d � � � � j d � � _ d S( s� Compute the max stack depth. Approach is to compute the stack effect of each basic block. Then find the path through the code with the largest total effect. c s� | � k r | Sd � | <| � | } | j � } | r` t g | D] } � | | � ^ qD � S| j d k s � � j | � S| Sd S( Ni R ( R t maxRB R ( R t dt childrenR0 ( t deptht max_deptht seenR ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� ] s &i N( R R( t findDepthRK R t stacksize( R R R ( ( R� R� R� R s( /usr/lib64/python2.7/compiler/pyassem.pyR} O s c C s� | j t k s t � g | _ } d } i } i } x� | j � D]z } | | | <x] | j � D]O } | j | � t | � d k r� | d } q^ | d d k r^ | d } q^ q^ W| | | <qA Wd } x� t t | � � D]� } | | } t | � d k r| d } n | d d k r$| d } n | d } | | j k rh| d } | | | } | | f | | <q� | | j k r� | | | d f | | <q� q� Wt | _ d S( s- Arrange the blocks in order and resolve jumpsi i R� i N( Rr R\ R/ R@ R& RK R6 R Ro RW t hasjabsR] ( R R@ R� t beginR R R# Rt R� t opargt offset( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR~ m s: c C s� | j t k s t � | j j d | j � | j � x� t t | j � � D]n } | j | } t | � d k rK | \ } } | j j | d � } | r� | | | | � f | j | <q� qK qK Wt | _ d S( s0 Convert arguments from symbolic to concrete formi i N( Rr R] R/ Ri t insertRc t sort_cellvarsRo R R@ t _converterst getR R^ ( R Rt R� R� R� t conv( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s &c C s� i } x | j D] } d | | <q Wg | j D] } | | k r. | ^ q. | _ x | j D] } | | =qY W| j | j � | _ | j | j | _ d S( sH Sort cellvars in the order of varnames and prune from freevars. i N( Rl Rn t keysRk Rm ( R t cellsRa ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s c C sp t | � } xD t t | � � D]0 } | t | | � k r | | | k r | Sq Wt | � } | j | � | S( s� Return index of name in list, appending if necessary This routine uses a list instead of a dictionary, because a dictionary can't store two different keys if the keys have the same value but different types, e.g. 2 and 2L. The compiler must treat these two separately, so it does an explicit type comparison before comparing the values. ( t typeRo R R6 ( R Ra RU R� Rt R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _lookupName� s & c C s1 t | d � r | j � } n | j | | j � S( NR� ( RZ R� R� Ri ( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_CONST� s c C s& | j | | j � | j | | j � S( N( R� Rj Rn ( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_FAST� s c C s8 | j d k r% | j | | j � n | j | | j � S( N( Rg R R� Rn Rj ( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_NAME� s c C s8 | j d k r% | j | | j � n | j | | j � S( N( Rg R R� Rn Rj ( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_NAME� s c C s9 | j | | j � | j | | j � | j | | j � S( N( R� Rj Rn Rm ( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_DEREF� s c C s& | j | | j � | j | | j � S( N( R� Rn Rm ( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_CLOSURE� s c C s | j j | � S( N( t _cmpt index( R RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_COMPARE_OP� s i t _convert_c C s | j t k s t � t � | _ } x� | j D]� } | d } t | � d k rh | j | j | � q/ | d } | d k r� | j | � q/ n t | � \ } } y | j | j | | | � Wq/ t k r� | G| GH| j | G| G| GH� q/ Xq/ Wt | _ d S( Ni i R� ( Rr R^ R/ t LineAddrTablet lnotabR@ R t addCodet opnumt nextLinet twobyteRR R_ ( R R� R� R� R� t hit lo( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s$ c C s� | j t k s t � | j t @d k r1 d } n t | j � } | j } | j t @rc | d } n t j | | | j | j | j j � | j � t | j � t | j � | j | j | j j | j j � t | j � t | j � � S( Ni i ( Rr R_ R/ Rh R R Rn Rf R t typest CodeTypeR� R� R� t getConstst tupleRj Rb Ra t firstlinet getTableRk Rl ( R t nlocalsRf ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� s c C sO g } x< | j D]1 } t | t � r4 | j � } n | j | � q Wt | � S( s� Return a tuple for the const slot of the code object Must convert references to code (MAKE_FUNCTION) to code objects recursively. ( Ri R RV R� R6 R� ( R R, t elt( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� " s ( N(= R- R. R R R` R Rw Ry Rz R{ R| R� R� R} R~ R4 RW t disRt R R� R� R R� R� R� R� R� t _convert_STORE_FASTt _convert_DELETE_FASTR� R� t _convert_STORE_NAMEt _convert_DELETE_NAMEt _convert_IMPORT_NAMEt _convert_IMPORT_FROMt _convert_STORE_ATTRt _convert_LOAD_ATTRt _convert_DELETE_ATTRt _convert_LOAD_GLOBALt _convert_STORE_GLOBALt _convert_DELETE_GLOBALR� t _convert_LOAD_DEREFt _convert_STORE_DEREFR� RU t cmp_opR� R� t localst itemsRa t objR� R� Ro R t numR� R� ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRV � sn ! c C s | d d k r d Sd S( Ni t JUMPi ( ( R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt isJump/ s Rp c B s) e Z d Z d � Z d � Z d � Z RS( s: Helper for marking func defs with nested tuples in arglistc C s | | _ | | _ d S( N( t countRj ( R R� Rj ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR 5 s c C s d | j | j f S( Ns TupleArg(%s, %s)( R� Rj ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRE 8 s c C s d | j S( Ns .%d( R� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRq : s ( R- R. t __doc__R RE Rq ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRp 3 s c C s^ t | � } | rZ xE | D]: } t | t � r t t j | j � � } | | } q q Wn | S( N( R R Rp R t flattenRj ( Rd Rf RT t numNames( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRe = s c C s( t | t t f � s t � t | d � S( s/ Convert an int argument into high and low bytesi ( R t intt longR/ t divmod( t val( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� F s R� c B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( s( lnotab This class builds the lnotab, which is documented in compile.c. Here's a brief recap: For each SET_LINENO instruction after the first one, two bytes are added to lnotab. (In some cases, multiple two-byte entries are added.) The first byte is the distance in bytes between the instruction for the last SET_LINENO and the current SET_LINENO. The second byte is offset in line numbers. If either offset is greater than 255, multiple two-byte entries are added -- see compile.c for the delicate details. c C s: g | _ d | _ d | _ d | _ d | _ g | _ d S( Ni ( t codet codeOffsetR� t lastlinet lastoffR� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR Z s c G sA x$ | D] } | j j t | � � q W| j t | � | _ d S( N( R� R6 t chrR� R ( R Rd RT ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� b s c C s | j d k r$ | | _ | | _ n� | j | j } | | j } | d k r| j j } x. | d k r� | d � | d � | d 8} q\ Wx4 | d k r� | | � | d � | d 8} d } q� W| d k s� | d k r� | | � | | � n | | _ | j | _ n d S( Ni i� ( R� R� R� R� R� R6 ( R t linenot addrt linet push( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� g s* c C s d j | j � S( NR? ( RH R� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s c C s d j t t | j � � S( NR? ( RH RF R� R� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s ( R- R. R� R R� R� R� R� ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� K s t StackDepthTrackerc B s� e Z d d � Z i& d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d! 6d d" 6d d# 6d d$ 6d d% 6d d& 6d d' 6d( d) 6d( d* 6d d+ 6d d, 6Z d; d< g Z d/ � Z d0 � Z d1 � Z d2 � Z d3 � Z d4 � Z d5 � Z d6 � Z d7 � Z d8 � Z d9 � Z d: � Z RS(= i c C s d } d } x| D]� } | d } | r0 | Gn | j j | d � } | d k r^ | | } n� xA | j D]6 \ } } | t | � | k rh | } | | } Pqh qh W| d k r� t | | d � } | d k r� | | | d � } q� n | | k r� | } n | r | G| GHq q W| S( Ni i ( t effectR� R t patternsR t getattr( R R@ t debugR� t maxDepthRt R� t deltat patt pat_deltat meth( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s. i����t POP_TOPi t DUP_TOPt LIST_APPENDt SET_ADDi����t MAP_ADDs SLICE+1s SLICE+2s SLICE+3s STORE_SLICE+0s STORE_SLICE+1s STORE_SLICE+2i����s STORE_SLICE+3s DELETE_SLICE+0s DELETE_SLICE+1s DELETE_SLICE+2s DELETE_SLICE+3t STORE_SUBSCRt DELETE_SUBSCRt PRINT_ITEMRL t YIELD_VALUEt EXEC_STMTt BUILD_CLASSt STORE_NAMEt STORE_ATTRt DELETE_ATTRt STORE_GLOBALt BUILD_MAPt COMPARE_OPt STORE_FASTt IMPORT_STARt IMPORT_NAMEt IMPORT_FROMt LOAD_ATTRi t SETUP_EXCEPTt SETUP_FINALLYt FOR_ITERt WITH_CLEANUPt BINARY_t LOAD_c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt UNPACK_SEQUENCE� s c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_TUPLE� s c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_LIST� s c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_SET� s c C s" t | d � \ } } | | d S( Ni i ( R� ( R t argcR� R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION� s c C s | j | � d S( Ni ( R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION_VAR� s c C s | j | � d S( Ni ( R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION_KW� s c C s | j | � d S( Ni ( R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION_VAR_KW� s c C s | S( N( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt MAKE_FUNCTION� s c C s | S( N( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt MAKE_CLOSURE� s c C s$ | d k r d S| d k r d Sd S( Ni i����i i����( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_SLICE� s c C s | S( N( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt DUP_TOPX� s ( R i����( R i ( R- R. R� R� R� R R R R R R R R R R R R ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � sl ( R� R� R� R� t compilerR t compiler.constsR R R R R R$ R R\ R] R^ R_ RV R� Rp Re R� R� R� R� ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt <module> s* "W CT� 2 BnPK s�Z��?� � misc.pycnu �[��� � { fc @ sK d � Z d d d � � YZ d d d � � YZ d Z d � Z d � Z d S( c C sJ g } x= | D]5 } t | t � r5 | t | � } q | j | � q W| S( N( t isinstancet tuplet flattent append( t tupt eltst elt( ( s% /usr/lib64/python2.7/compiler/misc.pyR s t Setc B sP e Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( c C s i | _ d S( N( R ( t self( ( s% /usr/lib64/python2.7/compiler/misc.pyt __init__ s c C s t | j � S( N( t lenR ( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt __len__ s c C s | | j k S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt __contains__ s c C s | | j | <d S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt add s c C s | j j � S( N( R t keys( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt elements s c C s | | j k S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt has_elt s c C s | j | =d S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt remove s c C s t � } | j j | j � | S( N( R R t update( R t c( ( s% /usr/lib64/python2.7/compiler/misc.pyt copy s ( t __name__t __module__R R R R R R R R ( ( ( s% /usr/lib64/python2.7/compiler/misc.pyR s t Stackc B s5 e Z d � Z d � Z d � Z d � Z d � Z RS( c C s g | _ | j j | _ d S( N( t stackt pop( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyR s c C s t | j � S( N( R R ( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyR # s c C s | j j | � d S( N( R R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt push% s c C s | j d S( Ni����( R ( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt top' s c C s | j | S( N( R ( R t index( ( s% /usr/lib64/python2.7/compiler/misc.pyt __getitem__) s ( R R R R R R R ( ( ( s% /usr/lib64/python2.7/compiler/misc.pyR s i c C s� | j d � s | St | � d t k r- | S| j d � r@ | Sy+ d } x | | d k ri | d } qL WWn t k r | SX| | } t | � t | � } | t k r� | t | } n d | | f S( Nt __i i t _i s _%s%s( t startswithR t MANGLE_LENt endswitht IndexError( t namet klasst it tlen( ( s% /usr/lib64/python2.7/compiler/misc.pyt mangle. s" c C sE | g } x5 | r@ | j d � } | | _ | j | j � � q Wd S( s< Set the filename attribute to filename on every node in treei N( R t filenamet extendt getChildNodes( R) t treet worklistt node( ( s% /usr/lib64/python2.7/compiler/misc.pyt set_filenameC s N( ( ( R R R R! R( R/ ( ( ( s% /usr/lib64/python2.7/compiler/misc.pyt <module> s PK s�Z oP�^ �^ pyassem.pynu �[��� """A flow graph representation for Python bytecode""" import dis import types import sys from compiler import misc from compiler.consts \ import CO_OPTIMIZED, CO_NEWLOCALS, CO_VARARGS, CO_VARKEYWORDS class FlowGraph: def __init__(self): self.current = self.entry = Block() self.exit = Block("exit") self.blocks = misc.Set() self.blocks.add(self.entry) self.blocks.add(self.exit) def startBlock(self, block): if self._debug: if self.current: print "end", repr(self.current) print " next", self.current.next print " prev", self.current.prev print " ", self.current.get_children() print repr(block) self.current = block def nextBlock(self, block=None): # XXX think we need to specify when there is implicit transfer # from one block to the next. might be better to represent this # with explicit JUMP_ABSOLUTE instructions that are optimized # out when they are unnecessary. # # I think this strategy works: each block has a child # designated as "next" which is returned as the last of the # children. because the nodes in a graph are emitted in # reverse post order, the "next" block will always be emitted # immediately after its parent. # Worry: maintaining this invariant could be tricky if block is None: block = self.newBlock() # Note: If the current block ends with an unconditional control # transfer, then it is techically incorrect to add an implicit # transfer to the block graph. Doing so results in code generation # for unreachable blocks. That doesn't appear to be very common # with Python code and since the built-in compiler doesn't optimize # it out we don't either. self.current.addNext(block) self.startBlock(block) def newBlock(self): b = Block() self.blocks.add(b) return b def startExitBlock(self): self.startBlock(self.exit) _debug = 0 def _enable_debug(self): self._debug = 1 def _disable_debug(self): self._debug = 0 def emit(self, *inst): if self._debug: print "\t", inst if len(inst) == 2 and isinstance(inst[1], Block): self.current.addOutEdge(inst[1]) self.current.emit(inst) def getBlocksInOrder(self): """Return the blocks in reverse postorder i.e. each node appears before all of its successors """ order = order_blocks(self.entry, self.exit) return order def getBlocks(self): return self.blocks.elements() def getRoot(self): """Return nodes appropriate for use with dominator""" return self.entry def getContainedGraphs(self): l = [] for b in self.getBlocks(): l.extend(b.getContainedGraphs()) return l def order_blocks(start_block, exit_block): """Order blocks so that they are emitted in the right order""" # Rules: # - when a block has a next block, the next block must be emitted just after # - when a block has followers (relative jumps), it must be emitted before # them # - all reachable blocks must be emitted order = [] # Find all the blocks to be emitted. remaining = set() todo = [start_block] while todo: b = todo.pop() if b in remaining: continue remaining.add(b) for c in b.get_children(): if c not in remaining: todo.append(c) # A block is dominated by another block if that block must be emitted # before it. dominators = {} for b in remaining: if __debug__ and b.next: assert b is b.next[0].prev[0], (b, b.next) # Make sure every block appears in dominators, even if no # other block must precede it. dominators.setdefault(b, set()) # preceding blocks dominate following blocks for c in b.get_followers(): while 1: dominators.setdefault(c, set()).add(b) # Any block that has a next pointer leading to c is also # dominated because the whole chain will be emitted at once. # Walk backwards and add them all. if c.prev and c.prev[0] is not b: c = c.prev[0] else: break def find_next(): # Find a block that can be emitted next. for b in remaining: for c in dominators[b]: if c in remaining: break # can't emit yet, dominated by a remaining block else: return b assert 0, 'circular dependency, cannot find next block' b = start_block while 1: order.append(b) remaining.discard(b) if b.next: b = b.next[0] continue elif b is not exit_block and not b.has_unconditional_transfer(): order.append(exit_block) if not remaining: break b = find_next() return order class Block: _count = 0 def __init__(self, label=''): self.insts = [] self.outEdges = set() self.label = label self.bid = Block._count self.next = [] self.prev = [] Block._count = Block._count + 1 def __repr__(self): if self.label: return "<block %s id=%d>" % (self.label, self.bid) else: return "<block id=%d>" % (self.bid) def __str__(self): insts = map(str, self.insts) return "<block %s %d:\n%s>" % (self.label, self.bid, '\n'.join(insts)) def emit(self, inst): op = inst[0] self.insts.append(inst) def getInstructions(self): return self.insts def addOutEdge(self, block): self.outEdges.add(block) def addNext(self, block): self.next.append(block) assert len(self.next) == 1, map(str, self.next) block.prev.append(self) assert len(block.prev) == 1, map(str, block.prev) _uncond_transfer = ('RETURN_VALUE', 'RAISE_VARARGS', 'JUMP_ABSOLUTE', 'JUMP_FORWARD', 'CONTINUE_LOOP', ) def has_unconditional_transfer(self): """Returns True if there is an unconditional transfer to an other block at the end of this block. This means there is no risk for the bytecode executer to go past this block's bytecode.""" try: op, arg = self.insts[-1] except (IndexError, ValueError): return return op in self._uncond_transfer def get_children(self): return list(self.outEdges) + self.next def get_followers(self): """Get the whole list of followers, including the next block.""" followers = set(self.next) # Blocks that must be emitted *after* this one, because of # bytecode offsets (e.g. relative jumps) pointing to them. for inst in self.insts: if inst[0] in PyFlowGraph.hasjrel: followers.add(inst[1]) return followers def getContainedGraphs(self): """Return all graphs contained within this block. For example, a MAKE_FUNCTION block will contain a reference to the graph for the function body. """ contained = [] for inst in self.insts: if len(inst) == 1: continue op = inst[1] if hasattr(op, 'graph'): contained.append(op.graph) return contained # flags for code objects # the FlowGraph is transformed in place; it exists in one of these states RAW = "RAW" FLAT = "FLAT" CONV = "CONV" DONE = "DONE" class PyFlowGraph(FlowGraph): super_init = FlowGraph.__init__ def __init__(self, name, filename, args=(), optimized=0, klass=None): self.super_init() self.name = name self.filename = filename self.docstring = None self.args = args # XXX self.argcount = getArgCount(args) self.klass = klass if optimized: self.flags = CO_OPTIMIZED | CO_NEWLOCALS else: self.flags = 0 self.consts = [] self.names = [] # Free variables found by the symbol table scan, including # variables used only in nested scopes, are included here. self.freevars = [] self.cellvars = [] # The closure list is used to track the order of cell # variables and free variables in the resulting code object. # The offsets used by LOAD_CLOSURE/LOAD_DEREF refer to both # kinds of variables. self.closure = [] self.varnames = list(args) or [] for i in range(len(self.varnames)): var = self.varnames[i] if isinstance(var, TupleArg): self.varnames[i] = var.getName() self.stage = RAW def setDocstring(self, doc): self.docstring = doc def setFlag(self, flag): self.flags = self.flags | flag if flag == CO_VARARGS: self.argcount = self.argcount - 1 def checkFlag(self, flag): if self.flags & flag: return 1 def setFreeVars(self, names): self.freevars = list(names) def setCellVars(self, names): self.cellvars = names def getCode(self): """Get a Python code object""" assert self.stage == RAW self.computeStackDepth() self.flattenGraph() assert self.stage == FLAT self.convertArgs() assert self.stage == CONV self.makeByteCode() assert self.stage == DONE return self.newCodeObject() def dump(self, io=None): if io: save = sys.stdout sys.stdout = io pc = 0 for t in self.insts: opname = t[0] if opname == "SET_LINENO": print if len(t) == 1: print "\t", "%3d" % pc, opname pc = pc + 1 else: print "\t", "%3d" % pc, opname, t[1] pc = pc + 3 if io: sys.stdout = save def computeStackDepth(self): """Compute the max stack depth. Approach is to compute the stack effect of each basic block. Then find the path through the code with the largest total effect. """ depth = {} exit = None for b in self.getBlocks(): depth[b] = findDepth(b.getInstructions()) seen = {} def max_depth(b, d): if b in seen: return d seen[b] = 1 d = d + depth[b] children = b.get_children() if children: return max([max_depth(c, d) for c in children]) else: if not b.label == "exit": return max_depth(self.exit, d) else: return d self.stacksize = max_depth(self.entry, 0) def flattenGraph(self): """Arrange the blocks in order and resolve jumps""" assert self.stage == RAW self.insts = insts = [] pc = 0 begin = {} end = {} for b in self.getBlocksInOrder(): begin[b] = pc for inst in b.getInstructions(): insts.append(inst) if len(inst) == 1: pc = pc + 1 elif inst[0] != "SET_LINENO": # arg takes 2 bytes pc = pc + 3 end[b] = pc pc = 0 for i in range(len(insts)): inst = insts[i] if len(inst) == 1: pc = pc + 1 elif inst[0] != "SET_LINENO": pc = pc + 3 opname = inst[0] if opname in self.hasjrel: oparg = inst[1] offset = begin[oparg] - pc insts[i] = opname, offset elif opname in self.hasjabs: insts[i] = opname, begin[inst[1]] self.stage = FLAT hasjrel = set() for i in dis.hasjrel: hasjrel.add(dis.opname[i]) hasjabs = set() for i in dis.hasjabs: hasjabs.add(dis.opname[i]) def convertArgs(self): """Convert arguments from symbolic to concrete form""" assert self.stage == FLAT self.consts.insert(0, self.docstring) self.sort_cellvars() for i in range(len(self.insts)): t = self.insts[i] if len(t) == 2: opname, oparg = t conv = self._converters.get(opname, None) if conv: self.insts[i] = opname, conv(self, oparg) self.stage = CONV def sort_cellvars(self): """Sort cellvars in the order of varnames and prune from freevars. """ cells = {} for name in self.cellvars: cells[name] = 1 self.cellvars = [name for name in self.varnames if name in cells] for name in self.cellvars: del cells[name] self.cellvars = self.cellvars + cells.keys() self.closure = self.cellvars + self.freevars def _lookupName(self, name, list): """Return index of name in list, appending if necessary This routine uses a list instead of a dictionary, because a dictionary can't store two different keys if the keys have the same value but different types, e.g. 2 and 2L. The compiler must treat these two separately, so it does an explicit type comparison before comparing the values. """ t = type(name) for i in range(len(list)): if t == type(list[i]) and list[i] == name: return i end = len(list) list.append(name) return end _converters = {} def _convert_LOAD_CONST(self, arg): if hasattr(arg, 'getCode'): arg = arg.getCode() return self._lookupName(arg, self.consts) def _convert_LOAD_FAST(self, arg): self._lookupName(arg, self.names) return self._lookupName(arg, self.varnames) _convert_STORE_FAST = _convert_LOAD_FAST _convert_DELETE_FAST = _convert_LOAD_FAST def _convert_LOAD_NAME(self, arg): if self.klass is None: self._lookupName(arg, self.varnames) return self._lookupName(arg, self.names) def _convert_NAME(self, arg): if self.klass is None: self._lookupName(arg, self.varnames) return self._lookupName(arg, self.names) _convert_STORE_NAME = _convert_NAME _convert_DELETE_NAME = _convert_NAME _convert_IMPORT_NAME = _convert_NAME _convert_IMPORT_FROM = _convert_NAME _convert_STORE_ATTR = _convert_NAME _convert_LOAD_ATTR = _convert_NAME _convert_DELETE_ATTR = _convert_NAME _convert_LOAD_GLOBAL = _convert_NAME _convert_STORE_GLOBAL = _convert_NAME _convert_DELETE_GLOBAL = _convert_NAME def _convert_DEREF(self, arg): self._lookupName(arg, self.names) self._lookupName(arg, self.varnames) return self._lookupName(arg, self.closure) _convert_LOAD_DEREF = _convert_DEREF _convert_STORE_DEREF = _convert_DEREF def _convert_LOAD_CLOSURE(self, arg): self._lookupName(arg, self.varnames) return self._lookupName(arg, self.closure) _cmp = list(dis.cmp_op) def _convert_COMPARE_OP(self, arg): return self._cmp.index(arg) # similarly for other opcodes... for name, obj in locals().items(): if name[:9] == "_convert_": opname = name[9:] _converters[opname] = obj del name, obj, opname def makeByteCode(self): assert self.stage == CONV self.lnotab = lnotab = LineAddrTable() for t in self.insts: opname = t[0] if len(t) == 1: lnotab.addCode(self.opnum[opname]) else: oparg = t[1] if opname == "SET_LINENO": lnotab.nextLine(oparg) continue hi, lo = twobyte(oparg) try: lnotab.addCode(self.opnum[opname], lo, hi) except ValueError: print opname, oparg print self.opnum[opname], lo, hi raise self.stage = DONE opnum = {} for num in range(len(dis.opname)): opnum[dis.opname[num]] = num del num def newCodeObject(self): assert self.stage == DONE if (self.flags & CO_NEWLOCALS) == 0: nlocals = 0 else: nlocals = len(self.varnames) argcount = self.argcount if self.flags & CO_VARKEYWORDS: argcount = argcount - 1 return types.CodeType(argcount, nlocals, self.stacksize, self.flags, self.lnotab.getCode(), self.getConsts(), tuple(self.names), tuple(self.varnames), self.filename, self.name, self.lnotab.firstline, self.lnotab.getTable(), tuple(self.freevars), tuple(self.cellvars)) def getConsts(self): """Return a tuple for the const slot of the code object Must convert references to code (MAKE_FUNCTION) to code objects recursively. """ l = [] for elt in self.consts: if isinstance(elt, PyFlowGraph): elt = elt.getCode() l.append(elt) return tuple(l) def isJump(opname): if opname[:4] == 'JUMP': return 1 class TupleArg: """Helper for marking func defs with nested tuples in arglist""" def __init__(self, count, names): self.count = count self.names = names def __repr__(self): return "TupleArg(%s, %s)" % (self.count, self.names) def getName(self): return ".%d" % self.count def getArgCount(args): argcount = len(args) if args: for arg in args: if isinstance(arg, TupleArg): numNames = len(misc.flatten(arg.names)) argcount = argcount - numNames return argcount def twobyte(val): """Convert an int argument into high and low bytes""" assert isinstance(val, (int, long)) return divmod(val, 256) class LineAddrTable: """lnotab This class builds the lnotab, which is documented in compile.c. Here's a brief recap: For each SET_LINENO instruction after the first one, two bytes are added to lnotab. (In some cases, multiple two-byte entries are added.) The first byte is the distance in bytes between the instruction for the last SET_LINENO and the current SET_LINENO. The second byte is offset in line numbers. If either offset is greater than 255, multiple two-byte entries are added -- see compile.c for the delicate details. """ def __init__(self): self.code = [] self.codeOffset = 0 self.firstline = 0 self.lastline = 0 self.lastoff = 0 self.lnotab = [] def addCode(self, *args): for arg in args: self.code.append(chr(arg)) self.codeOffset = self.codeOffset + len(args) def nextLine(self, lineno): if self.firstline == 0: self.firstline = lineno self.lastline = lineno else: # compute deltas addr = self.codeOffset - self.lastoff line = lineno - self.lastline # Python assumes that lineno always increases with # increasing bytecode address (lnotab is unsigned char). # Depending on when SET_LINENO instructions are emitted # this is not always true. Consider the code: # a = (1, # b) # In the bytecode stream, the assignment to "a" occurs # after the loading of "b". This works with the C Python # compiler because it only generates a SET_LINENO instruction # for the assignment. if line >= 0: push = self.lnotab.append while addr > 255: push(255); push(0) addr -= 255 while line > 255: push(addr); push(255) line -= 255 addr = 0 if addr > 0 or line > 0: push(addr); push(line) self.lastline = lineno self.lastoff = self.codeOffset def getCode(self): return ''.join(self.code) def getTable(self): return ''.join(map(chr, self.lnotab)) class StackDepthTracker: # XXX 1. need to keep track of stack depth on jumps # XXX 2. at least partly as a result, this code is broken def findDepth(self, insts, debug=0): depth = 0 maxDepth = 0 for i in insts: opname = i[0] if debug: print i, delta = self.effect.get(opname, None) if delta is not None: depth = depth + delta else: # now check patterns for pat, pat_delta in self.patterns: if opname[:len(pat)] == pat: delta = pat_delta depth = depth + delta break # if we still haven't found a match if delta is None: meth = getattr(self, opname, None) if meth is not None: depth = depth + meth(i[1]) if depth > maxDepth: maxDepth = depth if debug: print depth, maxDepth return maxDepth effect = { 'POP_TOP': -1, 'DUP_TOP': 1, 'LIST_APPEND': -1, 'SET_ADD': -1, 'MAP_ADD': -2, 'SLICE+1': -1, 'SLICE+2': -1, 'SLICE+3': -2, 'STORE_SLICE+0': -1, 'STORE_SLICE+1': -2, 'STORE_SLICE+2': -2, 'STORE_SLICE+3': -3, 'DELETE_SLICE+0': -1, 'DELETE_SLICE+1': -2, 'DELETE_SLICE+2': -2, 'DELETE_SLICE+3': -3, 'STORE_SUBSCR': -3, 'DELETE_SUBSCR': -2, # PRINT_EXPR? 'PRINT_ITEM': -1, 'RETURN_VALUE': -1, 'YIELD_VALUE': -1, 'EXEC_STMT': -3, 'BUILD_CLASS': -2, 'STORE_NAME': -1, 'STORE_ATTR': -2, 'DELETE_ATTR': -1, 'STORE_GLOBAL': -1, 'BUILD_MAP': 1, 'COMPARE_OP': -1, 'STORE_FAST': -1, 'IMPORT_STAR': -1, 'IMPORT_NAME': -1, 'IMPORT_FROM': 1, 'LOAD_ATTR': 0, # unlike other loads # close enough... 'SETUP_EXCEPT': 3, 'SETUP_FINALLY': 3, 'FOR_ITER': 1, 'WITH_CLEANUP': -1, } # use pattern match patterns = [ ('BINARY_', -1), ('LOAD_', 1), ] def UNPACK_SEQUENCE(self, count): return count-1 def BUILD_TUPLE(self, count): return -count+1 def BUILD_LIST(self, count): return -count+1 def BUILD_SET(self, count): return -count+1 def CALL_FUNCTION(self, argc): hi, lo = divmod(argc, 256) return -(lo + hi * 2) def CALL_FUNCTION_VAR(self, argc): return self.CALL_FUNCTION(argc)-1 def CALL_FUNCTION_KW(self, argc): return self.CALL_FUNCTION(argc)-1 def CALL_FUNCTION_VAR_KW(self, argc): return self.CALL_FUNCTION(argc)-2 def MAKE_FUNCTION(self, argc): return -argc def MAKE_CLOSURE(self, argc): # XXX need to account for free variables too! return -argc def BUILD_SLICE(self, argc): if argc == 2: return -1 elif argc == 3: return -2 def DUP_TOPX(self, argc): return argc findDepth = StackDepthTracker().findDepth PK s�Z \^A|� |� transformer.pynu �[��� """Parse tree transformation module. Transforms Python source code into an abstract syntax tree (AST) defined in the ast module. The simplest ways to invoke this module are via parse and parseFile. parse(buf) -> AST parseFile(path) -> AST """ # Original version written by Greg Stein (gstein@lyra.org) # and Bill Tutt (rassilon@lima.mudlib.org) # February 1997. # # Modifications and improvements for Python 2.0 by Jeremy Hylton and # Mark Hammond # # Some fixes to try to have correct line number on almost all nodes # (except Module, Discard and Stmt) added by Sylvain Thenault # # Portions of this file are: # Copyright (C) 1997-1998 Greg Stein. All Rights Reserved. # # This module is provided under a BSD-ish license. See # http://www.opensource.org/licenses/bsd-license.html # and replace OWNER, ORGANIZATION, and YEAR as appropriate. from compiler.ast import * import parser import symbol import token class WalkerError(StandardError): pass from compiler.consts import CO_VARARGS, CO_VARKEYWORDS from compiler.consts import OP_ASSIGN, OP_DELETE, OP_APPLY def parseFile(path): f = open(path, "U") # XXX The parser API tolerates files without a trailing newline, # but not strings without a trailing newline. Always add an extra # newline to the file contents, since we're going through the string # version of the API. src = f.read() + "\n" f.close() return parse(src) def parse(buf, mode="exec"): if mode == "exec" or mode == "single": return Transformer().parsesuite(buf) elif mode == "eval": return Transformer().parseexpr(buf) else: raise ValueError("compile() arg 3 must be" " 'exec' or 'eval' or 'single'") def asList(nodes): l = [] for item in nodes: if hasattr(item, "asList"): l.append(item.asList()) else: if type(item) is type( (None, None) ): l.append(tuple(asList(item))) elif type(item) is type( [] ): l.append(asList(item)) else: l.append(item) return l def extractLineNo(ast): if not isinstance(ast[1], tuple): # get a terminal node return ast[2] for child in ast[1:]: if isinstance(child, tuple): lineno = extractLineNo(child) if lineno is not None: return lineno def Node(*args): kind = args[0] if kind in nodes: try: return nodes[kind](*args[1:]) except TypeError: print nodes[kind], len(args), args raise else: raise WalkerError, "Can't find appropriate Node type: %s" % str(args) #return apply(ast.Node, args) class Transformer: """Utility object for transforming Python parse trees. Exposes the following methods: tree = transform(ast_tree) tree = parsesuite(text) tree = parseexpr(text) tree = parsefile(fileob | filename) """ def __init__(self): self._dispatch = {} for value, name in symbol.sym_name.items(): if hasattr(self, name): self._dispatch[value] = getattr(self, name) self._dispatch[token.NEWLINE] = self.com_NEWLINE self._atom_dispatch = {token.LPAR: self.atom_lpar, token.LSQB: self.atom_lsqb, token.LBRACE: self.atom_lbrace, token.BACKQUOTE: self.atom_backquote, token.NUMBER: self.atom_number, token.STRING: self.atom_string, token.NAME: self.atom_name, } self.encoding = None def transform(self, tree): """Transform an AST into a modified parse tree.""" if not (isinstance(tree, tuple) or isinstance(tree, list)): tree = parser.st2tuple(tree, line_info=1) return self.compile_node(tree) def parsesuite(self, text): """Return a modified parse tree for the given suite text.""" return self.transform(parser.suite(text)) def parseexpr(self, text): """Return a modified parse tree for the given expression text.""" return self.transform(parser.expr(text)) def parsefile(self, file): """Return a modified parse tree for the contents of the given file.""" if type(file) == type(''): file = open(file) return self.parsesuite(file.read()) # -------------------------------------------------------------- # # PRIVATE METHODS # def compile_node(self, node): ### emit a line-number node? n = node[0] if n == symbol.encoding_decl: self.encoding = node[2] node = node[1] n = node[0] if n == symbol.single_input: return self.single_input(node[1:]) if n == symbol.file_input: return self.file_input(node[1:]) if n == symbol.eval_input: return self.eval_input(node[1:]) if n == symbol.lambdef: return self.lambdef(node[1:]) if n == symbol.funcdef: return self.funcdef(node[1:]) if n == symbol.classdef: return self.classdef(node[1:]) raise WalkerError, ('unexpected node type', n) def single_input(self, node): ### do we want to do anything about being "interactive" ? # NEWLINE | simple_stmt | compound_stmt NEWLINE n = node[0][0] if n != token.NEWLINE: return self.com_stmt(node[0]) return Pass() def file_input(self, nodelist): doc = self.get_docstring(nodelist, symbol.file_input) if doc is not None: i = 1 else: i = 0 stmts = [] for node in nodelist[i:]: if node[0] != token.ENDMARKER and node[0] != token.NEWLINE: self.com_append_stmt(stmts, node) return Module(doc, Stmt(stmts)) def eval_input(self, nodelist): # from the built-in function input() ### is this sufficient? return Expression(self.com_node(nodelist[0])) def decorator_name(self, nodelist): listlen = len(nodelist) assert listlen >= 1 and listlen % 2 == 1 item = self.atom_name(nodelist) i = 1 while i < listlen: assert nodelist[i][0] == token.DOT assert nodelist[i + 1][0] == token.NAME item = Getattr(item, nodelist[i + 1][1]) i += 2 return item def decorator(self, nodelist): # '@' dotted_name [ '(' [arglist] ')' ] assert len(nodelist) in (3, 5, 6) assert nodelist[0][0] == token.AT assert nodelist[-1][0] == token.NEWLINE assert nodelist[1][0] == symbol.dotted_name funcname = self.decorator_name(nodelist[1][1:]) if len(nodelist) > 3: assert nodelist[2][0] == token.LPAR expr = self.com_call_function(funcname, nodelist[3]) else: expr = funcname return expr def decorators(self, nodelist): # decorators: decorator ([NEWLINE] decorator)* NEWLINE items = [] for dec_nodelist in nodelist: assert dec_nodelist[0] == symbol.decorator items.append(self.decorator(dec_nodelist[1:])) return Decorators(items) def decorated(self, nodelist): assert nodelist[0][0] == symbol.decorators if nodelist[1][0] == symbol.funcdef: n = [nodelist[0]] + list(nodelist[1][1:]) return self.funcdef(n) elif nodelist[1][0] == symbol.classdef: decorators = self.decorators(nodelist[0][1:]) cls = self.classdef(nodelist[1][1:]) cls.decorators = decorators return cls raise WalkerError() def funcdef(self, nodelist): # -6 -5 -4 -3 -2 -1 # funcdef: [decorators] 'def' NAME parameters ':' suite # parameters: '(' [varargslist] ')' if len(nodelist) == 6: assert nodelist[0][0] == symbol.decorators decorators = self.decorators(nodelist[0][1:]) else: assert len(nodelist) == 5 decorators = None lineno = nodelist[-4][2] name = nodelist[-4][1] args = nodelist[-3][2] if args[0] == symbol.varargslist: names, defaults, flags = self.com_arglist(args[1:]) else: names = defaults = () flags = 0 doc = self.get_docstring(nodelist[-1]) # code for function code = self.com_node(nodelist[-1]) if doc is not None: assert isinstance(code, Stmt) assert isinstance(code.nodes[0], Discard) del code.nodes[0] return Function(decorators, name, names, defaults, flags, doc, code, lineno=lineno) def lambdef(self, nodelist): # lambdef: 'lambda' [varargslist] ':' test if nodelist[2][0] == symbol.varargslist: names, defaults, flags = self.com_arglist(nodelist[2][1:]) else: names = defaults = () flags = 0 # code for lambda code = self.com_node(nodelist[-1]) return Lambda(names, defaults, flags, code, lineno=nodelist[1][2]) old_lambdef = lambdef def classdef(self, nodelist): # classdef: 'class' NAME ['(' [testlist] ')'] ':' suite name = nodelist[1][1] doc = self.get_docstring(nodelist[-1]) if nodelist[2][0] == token.COLON: bases = [] elif nodelist[3][0] == token.RPAR: bases = [] else: bases = self.com_bases(nodelist[3]) # code for class code = self.com_node(nodelist[-1]) if doc is not None: assert isinstance(code, Stmt) assert isinstance(code.nodes[0], Discard) del code.nodes[0] return Class(name, bases, doc, code, lineno=nodelist[1][2]) def stmt(self, nodelist): return self.com_stmt(nodelist[0]) small_stmt = stmt flow_stmt = stmt compound_stmt = stmt def simple_stmt(self, nodelist): # small_stmt (';' small_stmt)* [';'] NEWLINE stmts = [] for i in range(0, len(nodelist), 2): self.com_append_stmt(stmts, nodelist[i]) return Stmt(stmts) def parameters(self, nodelist): raise WalkerError def varargslist(self, nodelist): raise WalkerError def fpdef(self, nodelist): raise WalkerError def fplist(self, nodelist): raise WalkerError def dotted_name(self, nodelist): raise WalkerError def comp_op(self, nodelist): raise WalkerError def trailer(self, nodelist): raise WalkerError def sliceop(self, nodelist): raise WalkerError def argument(self, nodelist): raise WalkerError # -------------------------------------------------------------- # # STATEMENT NODES (invoked by com_node()) # def expr_stmt(self, nodelist): # augassign testlist | testlist ('=' testlist)* en = nodelist[-1] exprNode = self.lookup_node(en)(en[1:]) if len(nodelist) == 1: return Discard(exprNode, lineno=exprNode.lineno) if nodelist[1][0] == token.EQUAL: nodesl = [] for i in range(0, len(nodelist) - 2, 2): nodesl.append(self.com_assign(nodelist[i], OP_ASSIGN)) return Assign(nodesl, exprNode, lineno=nodelist[1][2]) else: lval = self.com_augassign(nodelist[0]) op = self.com_augassign_op(nodelist[1]) return AugAssign(lval, op[1], exprNode, lineno=op[2]) raise WalkerError, "can't get here" def print_stmt(self, nodelist): # print ([ test (',' test)* [','] ] | '>>' test [ (',' test)+ [','] ]) items = [] if len(nodelist) == 1: start = 1 dest = None elif nodelist[1][0] == token.RIGHTSHIFT: assert len(nodelist) == 3 \ or nodelist[3][0] == token.COMMA dest = self.com_node(nodelist[2]) start = 4 else: dest = None start = 1 for i in range(start, len(nodelist), 2): items.append(self.com_node(nodelist[i])) if nodelist[-1][0] == token.COMMA: return Print(items, dest, lineno=nodelist[0][2]) return Printnl(items, dest, lineno=nodelist[0][2]) def del_stmt(self, nodelist): return self.com_assign(nodelist[1], OP_DELETE) def pass_stmt(self, nodelist): return Pass(lineno=nodelist[0][2]) def break_stmt(self, nodelist): return Break(lineno=nodelist[0][2]) def continue_stmt(self, nodelist): return Continue(lineno=nodelist[0][2]) def return_stmt(self, nodelist): # return: [testlist] if len(nodelist) < 2: return Return(Const(None), lineno=nodelist[0][2]) return Return(self.com_node(nodelist[1]), lineno=nodelist[0][2]) def yield_stmt(self, nodelist): expr = self.com_node(nodelist[0]) return Discard(expr, lineno=expr.lineno) def yield_expr(self, nodelist): if len(nodelist) > 1: value = self.com_node(nodelist[1]) else: value = Const(None) return Yield(value, lineno=nodelist[0][2]) def raise_stmt(self, nodelist): # raise: [test [',' test [',' test]]] if len(nodelist) > 5: expr3 = self.com_node(nodelist[5]) else: expr3 = None if len(nodelist) > 3: expr2 = self.com_node(nodelist[3]) else: expr2 = None if len(nodelist) > 1: expr1 = self.com_node(nodelist[1]) else: expr1 = None return Raise(expr1, expr2, expr3, lineno=nodelist[0][2]) def import_stmt(self, nodelist): # import_stmt: import_name | import_from assert len(nodelist) == 1 return self.com_node(nodelist[0]) def import_name(self, nodelist): # import_name: 'import' dotted_as_names return Import(self.com_dotted_as_names(nodelist[1]), lineno=nodelist[0][2]) def import_from(self, nodelist): # import_from: 'from' ('.'* dotted_name | '.') 'import' ('*' | # '(' import_as_names ')' | import_as_names) assert nodelist[0][1] == 'from' idx = 1 while nodelist[idx][1] == '.': idx += 1 level = idx - 1 if nodelist[idx][0] == symbol.dotted_name: fromname = self.com_dotted_name(nodelist[idx]) idx += 1 else: fromname = "" assert nodelist[idx][1] == 'import' if nodelist[idx + 1][0] == token.STAR: return From(fromname, [('*', None)], level, lineno=nodelist[0][2]) else: node = nodelist[idx + 1 + (nodelist[idx + 1][0] == token.LPAR)] return From(fromname, self.com_import_as_names(node), level, lineno=nodelist[0][2]) def global_stmt(self, nodelist): # global: NAME (',' NAME)* names = [] for i in range(1, len(nodelist), 2): names.append(nodelist[i][1]) return Global(names, lineno=nodelist[0][2]) def exec_stmt(self, nodelist): # exec_stmt: 'exec' expr ['in' expr [',' expr]] expr1 = self.com_node(nodelist[1]) if len(nodelist) >= 4: expr2 = self.com_node(nodelist[3]) if len(nodelist) >= 6: expr3 = self.com_node(nodelist[5]) else: expr3 = None else: expr2 = expr3 = None return Exec(expr1, expr2, expr3, lineno=nodelist[0][2]) def assert_stmt(self, nodelist): # 'assert': test, [',' test] expr1 = self.com_node(nodelist[1]) if (len(nodelist) == 4): expr2 = self.com_node(nodelist[3]) else: expr2 = None return Assert(expr1, expr2, lineno=nodelist[0][2]) def if_stmt(self, nodelist): # if: test ':' suite ('elif' test ':' suite)* ['else' ':' suite] tests = [] for i in range(0, len(nodelist) - 3, 4): testNode = self.com_node(nodelist[i + 1]) suiteNode = self.com_node(nodelist[i + 3]) tests.append((testNode, suiteNode)) if len(nodelist) % 4 == 3: elseNode = self.com_node(nodelist[-1]) ## elseNode.lineno = nodelist[-1][1][2] else: elseNode = None return If(tests, elseNode, lineno=nodelist[0][2]) def while_stmt(self, nodelist): # 'while' test ':' suite ['else' ':' suite] testNode = self.com_node(nodelist[1]) bodyNode = self.com_node(nodelist[3]) if len(nodelist) > 4: elseNode = self.com_node(nodelist[6]) else: elseNode = None return While(testNode, bodyNode, elseNode, lineno=nodelist[0][2]) def for_stmt(self, nodelist): # 'for' exprlist 'in' exprlist ':' suite ['else' ':' suite] assignNode = self.com_assign(nodelist[1], OP_ASSIGN) listNode = self.com_node(nodelist[3]) bodyNode = self.com_node(nodelist[5]) if len(nodelist) > 8: elseNode = self.com_node(nodelist[8]) else: elseNode = None return For(assignNode, listNode, bodyNode, elseNode, lineno=nodelist[0][2]) def try_stmt(self, nodelist): return self.com_try_except_finally(nodelist) def with_stmt(self, nodelist): return self.com_with(nodelist) def with_var(self, nodelist): return self.com_with_var(nodelist) def suite(self, nodelist): # simple_stmt | NEWLINE INDENT NEWLINE* (stmt NEWLINE*)+ DEDENT if len(nodelist) == 1: return self.com_stmt(nodelist[0]) stmts = [] for node in nodelist: if node[0] == symbol.stmt: self.com_append_stmt(stmts, node) return Stmt(stmts) # -------------------------------------------------------------- # # EXPRESSION NODES (invoked by com_node()) # def testlist(self, nodelist): # testlist: expr (',' expr)* [','] # testlist_safe: test [(',' test)+ [',']] # exprlist: expr (',' expr)* [','] return self.com_binary(Tuple, nodelist) testlist_safe = testlist # XXX testlist1 = testlist exprlist = testlist def testlist_comp(self, nodelist): # test ( comp_for | (',' test)* [','] ) assert nodelist[0][0] == symbol.test if len(nodelist) == 2 and nodelist[1][0] == symbol.comp_for: test = self.com_node(nodelist[0]) return self.com_generator_expression(test, nodelist[1]) return self.testlist(nodelist) def test(self, nodelist): # or_test ['if' or_test 'else' test] | lambdef if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef: return self.lambdef(nodelist[0]) then = self.com_node(nodelist[0]) if len(nodelist) > 1: assert len(nodelist) == 5 assert nodelist[1][1] == 'if' assert nodelist[3][1] == 'else' test = self.com_node(nodelist[2]) else_ = self.com_node(nodelist[4]) return IfExp(test, then, else_, lineno=nodelist[1][2]) return then def or_test(self, nodelist): # and_test ('or' and_test)* | lambdef if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef: return self.lambdef(nodelist[0]) return self.com_binary(Or, nodelist) old_test = or_test def and_test(self, nodelist): # not_test ('and' not_test)* return self.com_binary(And, nodelist) def not_test(self, nodelist): # 'not' not_test | comparison result = self.com_node(nodelist[-1]) if len(nodelist) == 2: return Not(result, lineno=nodelist[0][2]) return result def comparison(self, nodelist): # comparison: expr (comp_op expr)* node = self.com_node(nodelist[0]) if len(nodelist) == 1: return node results = [] for i in range(2, len(nodelist), 2): nl = nodelist[i-1] # comp_op: '<' | '>' | '=' | '>=' | '<=' | '<>' | '!=' | '==' # | 'in' | 'not' 'in' | 'is' | 'is' 'not' n = nl[1] if n[0] == token.NAME: type = n[1] if len(nl) == 3: if type == 'not': type = 'not in' else: type = 'is not' else: type = _cmp_types[n[0]] lineno = nl[1][2] results.append((type, self.com_node(nodelist[i]))) # we need a special "compare" node so that we can distinguish # 3 < x < 5 from (3 < x) < 5 # the two have very different semantics and results (note that the # latter form is always true) return Compare(node, results, lineno=lineno) def expr(self, nodelist): # xor_expr ('|' xor_expr)* return self.com_binary(Bitor, nodelist) def xor_expr(self, nodelist): # xor_expr ('^' xor_expr)* return self.com_binary(Bitxor, nodelist) def and_expr(self, nodelist): # xor_expr ('&' xor_expr)* return self.com_binary(Bitand, nodelist) def shift_expr(self, nodelist): # shift_expr ('<<'|'>>' shift_expr)* node = self.com_node(nodelist[0]) for i in range(2, len(nodelist), 2): right = self.com_node(nodelist[i]) if nodelist[i-1][0] == token.LEFTSHIFT: node = LeftShift([node, right], lineno=nodelist[1][2]) elif nodelist[i-1][0] == token.RIGHTSHIFT: node = RightShift([node, right], lineno=nodelist[1][2]) else: raise ValueError, "unexpected token: %s" % nodelist[i-1][0] return node def arith_expr(self, nodelist): node = self.com_node(nodelist[0]) for i in range(2, len(nodelist), 2): right = self.com_node(nodelist[i]) if nodelist[i-1][0] == token.PLUS: node = Add([node, right], lineno=nodelist[1][2]) elif nodelist[i-1][0] == token.MINUS: node = Sub([node, right], lineno=nodelist[1][2]) else: raise ValueError, "unexpected token: %s" % nodelist[i-1][0] return node def term(self, nodelist): node = self.com_node(nodelist[0]) for i in range(2, len(nodelist), 2): right = self.com_node(nodelist[i]) t = nodelist[i-1][0] if t == token.STAR: node = Mul([node, right]) elif t == token.SLASH: node = Div([node, right]) elif t == token.PERCENT: node = Mod([node, right]) elif t == token.DOUBLESLASH: node = FloorDiv([node, right]) else: raise ValueError, "unexpected token: %s" % t node.lineno = nodelist[1][2] return node def factor(self, nodelist): elt = nodelist[0] t = elt[0] node = self.lookup_node(nodelist[-1])(nodelist[-1][1:]) # need to handle (unary op)constant here... if t == token.PLUS: return UnaryAdd(node, lineno=elt[2]) elif t == token.MINUS: return UnarySub(node, lineno=elt[2]) elif t == token.TILDE: node = Invert(node, lineno=elt[2]) return node def power(self, nodelist): # power: atom trailer* ('**' factor)* node = self.com_node(nodelist[0]) for i in range(1, len(nodelist)): elt = nodelist[i] if elt[0] == token.DOUBLESTAR: return Power([node, self.com_node(nodelist[i+1])], lineno=elt[2]) node = self.com_apply_trailer(node, elt) return node def atom(self, nodelist): return self._atom_dispatch[nodelist[0][0]](nodelist) def atom_lpar(self, nodelist): if nodelist[1][0] == token.RPAR: return Tuple((), lineno=nodelist[0][2]) return self.com_node(nodelist[1]) def atom_lsqb(self, nodelist): if nodelist[1][0] == token.RSQB: return List((), lineno=nodelist[0][2]) return self.com_list_constructor(nodelist[1]) def atom_lbrace(self, nodelist): if nodelist[1][0] == token.RBRACE: return Dict((), lineno=nodelist[0][2]) return self.com_dictorsetmaker(nodelist[1]) def atom_backquote(self, nodelist): return Backquote(self.com_node(nodelist[1])) def atom_number(self, nodelist): ### need to verify this matches compile.c k = eval(nodelist[0][1]) return Const(k, lineno=nodelist[0][2]) def decode_literal(self, lit): if self.encoding: # this is particularly fragile & a bit of a # hack... changes in compile.c:parsestr and # tokenizer.c must be reflected here. if self.encoding not in ['utf-8', 'iso-8859-1']: lit = unicode(lit, 'utf-8').encode(self.encoding) return eval("# coding: %s\n%s" % (self.encoding, lit)) else: return eval(lit) def atom_string(self, nodelist): k = '' for node in nodelist: k += self.decode_literal(node[1]) return Const(k, lineno=nodelist[0][2]) def atom_name(self, nodelist): return Name(nodelist[0][1], lineno=nodelist[0][2]) # -------------------------------------------------------------- # # INTERNAL PARSING UTILITIES # # The use of com_node() introduces a lot of extra stack frames, # enough to cause a stack overflow compiling test.test_parser with # the standard interpreter recursionlimit. The com_node() is a # convenience function that hides the dispatch details, but comes # at a very high cost. It is more efficient to dispatch directly # in the callers. In these cases, use lookup_node() and call the # dispatched node directly. def lookup_node(self, node): return self._dispatch[node[0]] def com_node(self, node): # Note: compile.c has handling in com_node for del_stmt, pass_stmt, # break_stmt, stmt, small_stmt, flow_stmt, simple_stmt, # and compound_stmt. # We'll just dispatch them. return self._dispatch[node[0]](node[1:]) def com_NEWLINE(self, *args): # A ';' at the end of a line can make a NEWLINE token appear # here, Render it harmless. (genc discards ('discard', # ('const', xxxx)) Nodes) return Discard(Const(None)) def com_arglist(self, nodelist): # varargslist: # (fpdef ['=' test] ',')* ('*' NAME [',' '**' NAME] | '**' NAME) # | fpdef ['=' test] (',' fpdef ['=' test])* [','] # fpdef: NAME | '(' fplist ')' # fplist: fpdef (',' fpdef)* [','] names = [] defaults = [] flags = 0 i = 0 while i < len(nodelist): node = nodelist[i] if node[0] == token.STAR or node[0] == token.DOUBLESTAR: if node[0] == token.STAR: node = nodelist[i+1] if node[0] == token.NAME: names.append(node[1]) flags = flags | CO_VARARGS i = i + 3 if i < len(nodelist): # should be DOUBLESTAR t = nodelist[i][0] if t == token.DOUBLESTAR: node = nodelist[i+1] else: raise ValueError, "unexpected token: %s" % t names.append(node[1]) flags = flags | CO_VARKEYWORDS break # fpdef: NAME | '(' fplist ')' names.append(self.com_fpdef(node)) i = i + 1 if i < len(nodelist) and nodelist[i][0] == token.EQUAL: defaults.append(self.com_node(nodelist[i + 1])) i = i + 2 elif len(defaults): # we have already seen an argument with default, but here # came one without raise SyntaxError, "non-default argument follows default argument" # skip the comma i = i + 1 return names, defaults, flags def com_fpdef(self, node): # fpdef: NAME | '(' fplist ')' if node[1][0] == token.LPAR: return self.com_fplist(node[2]) return node[1][1] def com_fplist(self, node): # fplist: fpdef (',' fpdef)* [','] if len(node) == 2: return self.com_fpdef(node[1]) list = [] for i in range(1, len(node), 2): list.append(self.com_fpdef(node[i])) return tuple(list) def com_dotted_name(self, node): # String together the dotted names and return the string name = "" for n in node: if type(n) == type(()) and n[0] == 1: name = name + n[1] + '.' return name[:-1] def com_dotted_as_name(self, node): assert node[0] == symbol.dotted_as_name node = node[1:] dot = self.com_dotted_name(node[0][1:]) if len(node) == 1: return dot, None assert node[1][1] == 'as' assert node[2][0] == token.NAME return dot, node[2][1] def com_dotted_as_names(self, node): assert node[0] == symbol.dotted_as_names node = node[1:] names = [self.com_dotted_as_name(node[0])] for i in range(2, len(node), 2): names.append(self.com_dotted_as_name(node[i])) return names def com_import_as_name(self, node): assert node[0] == symbol.import_as_name node = node[1:] assert node[0][0] == token.NAME if len(node) == 1: return node[0][1], None assert node[1][1] == 'as', node assert node[2][0] == token.NAME return node[0][1], node[2][1] def com_import_as_names(self, node): assert node[0] == symbol.import_as_names node = node[1:] names = [self.com_import_as_name(node[0])] for i in range(2, len(node), 2): names.append(self.com_import_as_name(node[i])) return names def com_bases(self, node): bases = [] for i in range(1, len(node), 2): bases.append(self.com_node(node[i])) return bases def com_try_except_finally(self, nodelist): # ('try' ':' suite # ((except_clause ':' suite)+ ['else' ':' suite] ['finally' ':' suite] # | 'finally' ':' suite)) if nodelist[3][0] == token.NAME: # first clause is a finally clause: only try-finally return TryFinally(self.com_node(nodelist[2]), self.com_node(nodelist[5]), lineno=nodelist[0][2]) #tryexcept: [TryNode, [except_clauses], elseNode)] clauses = [] elseNode = None finallyNode = None for i in range(3, len(nodelist), 3): node = nodelist[i] if node[0] == symbol.except_clause: # except_clause: 'except' [expr [(',' | 'as') expr]] */ if len(node) > 2: expr1 = self.com_node(node[2]) if len(node) > 4: expr2 = self.com_assign(node[4], OP_ASSIGN) else: expr2 = None else: expr1 = expr2 = None clauses.append((expr1, expr2, self.com_node(nodelist[i+2]))) if node[0] == token.NAME: if node[1] == 'else': elseNode = self.com_node(nodelist[i+2]) elif node[1] == 'finally': finallyNode = self.com_node(nodelist[i+2]) try_except = TryExcept(self.com_node(nodelist[2]), clauses, elseNode, lineno=nodelist[0][2]) if finallyNode: return TryFinally(try_except, finallyNode, lineno=nodelist[0][2]) else: return try_except def com_with(self, nodelist): # with_stmt: 'with' with_item (',' with_item)* ':' suite body = self.com_node(nodelist[-1]) for i in range(len(nodelist) - 3, 0, -2): ret = self.com_with_item(nodelist[i], body, nodelist[0][2]) if i == 1: return ret body = ret def com_with_item(self, nodelist, body, lineno): # with_item: test ['as' expr] if len(nodelist) == 4: var = self.com_assign(nodelist[3], OP_ASSIGN) else: var = None expr = self.com_node(nodelist[1]) return With(expr, var, body, lineno=lineno) def com_augassign_op(self, node): assert node[0] == symbol.augassign return node[1] def com_augassign(self, node): """Return node suitable for lvalue of augmented assignment Names, slices, and attributes are the only allowable nodes. """ l = self.com_node(node) if l.__class__ in (Name, Slice, Subscript, Getattr): return l raise SyntaxError, "can't assign to %s" % l.__class__.__name__ def com_assign(self, node, assigning): # return a node suitable for use as an "lvalue" # loop to avoid trivial recursion while 1: t = node[0] if t in (symbol.exprlist, symbol.testlist, symbol.testlist_safe, symbol.testlist_comp): if len(node) > 2: return self.com_assign_tuple(node, assigning) node = node[1] elif t in _assign_types: if len(node) > 2: raise SyntaxError, "can't assign to operator" node = node[1] elif t == symbol.power: if node[1][0] != symbol.atom: raise SyntaxError, "can't assign to operator" if len(node) > 2: primary = self.com_node(node[1]) for i in range(2, len(node)-1): ch = node[i] if ch[0] == token.DOUBLESTAR: raise SyntaxError, "can't assign to operator" primary = self.com_apply_trailer(primary, ch) return self.com_assign_trailer(primary, node[-1], assigning) node = node[1] elif t == symbol.atom: t = node[1][0] if t == token.LPAR: node = node[2] if node[0] == token.RPAR: raise SyntaxError, "can't assign to ()" elif t == token.LSQB: node = node[2] if node[0] == token.RSQB: raise SyntaxError, "can't assign to []" return self.com_assign_list(node, assigning) elif t == token.NAME: return self.com_assign_name(node[1], assigning) else: raise SyntaxError, "can't assign to literal" else: raise SyntaxError, "bad assignment (%s)" % t def com_assign_tuple(self, node, assigning): assigns = [] for i in range(1, len(node), 2): assigns.append(self.com_assign(node[i], assigning)) return AssTuple(assigns, lineno=extractLineNo(node)) def com_assign_list(self, node, assigning): assigns = [] for i in range(1, len(node), 2): if i + 1 < len(node): if node[i + 1][0] == symbol.list_for: raise SyntaxError, "can't assign to list comprehension" assert node[i + 1][0] == token.COMMA, node[i + 1] assigns.append(self.com_assign(node[i], assigning)) return AssList(assigns, lineno=extractLineNo(node)) def com_assign_name(self, node, assigning): return AssName(node[1], assigning, lineno=node[2]) def com_assign_trailer(self, primary, node, assigning): t = node[1][0] if t == token.DOT: return self.com_assign_attr(primary, node[2], assigning) if t == token.LSQB: return self.com_subscriptlist(primary, node[2], assigning) if t == token.LPAR: raise SyntaxError, "can't assign to function call" raise SyntaxError, "unknown trailer type: %s" % t def com_assign_attr(self, primary, node, assigning): return AssAttr(primary, node[1], assigning, lineno=node[-1]) def com_binary(self, constructor, nodelist): "Compile 'NODE (OP NODE)*' into (type, [ node1, ..., nodeN ])." l = len(nodelist) if l == 1: n = nodelist[0] return self.lookup_node(n)(n[1:]) items = [] for i in range(0, l, 2): n = nodelist[i] items.append(self.lookup_node(n)(n[1:])) return constructor(items, lineno=extractLineNo(nodelist)) def com_stmt(self, node): result = self.lookup_node(node)(node[1:]) assert result is not None if isinstance(result, Stmt): return result return Stmt([result]) def com_append_stmt(self, stmts, node): result = self.lookup_node(node)(node[1:]) assert result is not None if isinstance(result, Stmt): stmts.extend(result.nodes) else: stmts.append(result) def com_list_constructor(self, nodelist): # listmaker: test ( list_for | (',' test)* [','] ) values = [] for i in range(1, len(nodelist)): if nodelist[i][0] == symbol.list_for: assert len(nodelist[i:]) == 1 return self.com_list_comprehension(values[0], nodelist[i]) elif nodelist[i][0] == token.COMMA: continue values.append(self.com_node(nodelist[i])) return List(values, lineno=values[0].lineno) def com_list_comprehension(self, expr, node): return self.com_comprehension(expr, None, node, 'list') def com_comprehension(self, expr1, expr2, node, type): # list_iter: list_for | list_if # list_for: 'for' exprlist 'in' testlist [list_iter] # list_if: 'if' test [list_iter] # XXX should raise SyntaxError for assignment # XXX(avassalotti) Set and dict comprehensions should have generator # semantics. In other words, they shouldn't leak # variables outside of the comprehension's scope. lineno = node[1][2] fors = [] while node: t = node[1][1] if t == 'for': assignNode = self.com_assign(node[2], OP_ASSIGN) compNode = self.com_node(node[4]) newfor = ListCompFor(assignNode, compNode, []) newfor.lineno = node[1][2] fors.append(newfor) if len(node) == 5: node = None elif type == 'list': node = self.com_list_iter(node[5]) else: node = self.com_comp_iter(node[5]) elif t == 'if': test = self.com_node(node[2]) newif = ListCompIf(test, lineno=node[1][2]) newfor.ifs.append(newif) if len(node) == 3: node = None elif type == 'list': node = self.com_list_iter(node[3]) else: node = self.com_comp_iter(node[3]) else: raise SyntaxError, \ ("unexpected comprehension element: %s %d" % (node, lineno)) if type == 'list': return ListComp(expr1, fors, lineno=lineno) elif type == 'set': return SetComp(expr1, fors, lineno=lineno) elif type == 'dict': return DictComp(expr1, expr2, fors, lineno=lineno) else: raise ValueError("unexpected comprehension type: " + repr(type)) def com_list_iter(self, node): assert node[0] == symbol.list_iter return node[1] def com_comp_iter(self, node): assert node[0] == symbol.comp_iter return node[1] def com_generator_expression(self, expr, node): # comp_iter: comp_for | comp_if # comp_for: 'for' exprlist 'in' test [comp_iter] # comp_if: 'if' test [comp_iter] lineno = node[1][2] fors = [] while node: t = node[1][1] if t == 'for': assignNode = self.com_assign(node[2], OP_ASSIGN) genNode = self.com_node(node[4]) newfor = GenExprFor(assignNode, genNode, [], lineno=node[1][2]) fors.append(newfor) if (len(node)) == 5: node = None else: node = self.com_comp_iter(node[5]) elif t == 'if': test = self.com_node(node[2]) newif = GenExprIf(test, lineno=node[1][2]) newfor.ifs.append(newif) if len(node) == 3: node = None else: node = self.com_comp_iter(node[3]) else: raise SyntaxError, \ ("unexpected generator expression element: %s %d" % (node, lineno)) fors[0].is_outmost = True return GenExpr(GenExprInner(expr, fors), lineno=lineno) def com_dictorsetmaker(self, nodelist): # dictorsetmaker: ( (test ':' test (comp_for | (',' test ':' test)* [','])) | # (test (comp_for | (',' test)* [','])) ) assert nodelist[0] == symbol.dictorsetmaker nodelist = nodelist[1:] if len(nodelist) == 1 or nodelist[1][0] == token.COMMA: # set literal items = [] for i in range(0, len(nodelist), 2): items.append(self.com_node(nodelist[i])) return Set(items, lineno=items[0].lineno) elif nodelist[1][0] == symbol.comp_for: # set comprehension expr = self.com_node(nodelist[0]) return self.com_comprehension(expr, None, nodelist[1], 'set') elif len(nodelist) > 3 and nodelist[3][0] == symbol.comp_for: # dict comprehension assert nodelist[1][0] == token.COLON key = self.com_node(nodelist[0]) value = self.com_node(nodelist[2]) return self.com_comprehension(key, value, nodelist[3], 'dict') else: # dict literal items = [] for i in range(0, len(nodelist), 4): items.append((self.com_node(nodelist[i]), self.com_node(nodelist[i+2]))) return Dict(items, lineno=items[0][0].lineno) def com_apply_trailer(self, primaryNode, nodelist): t = nodelist[1][0] if t == token.LPAR: return self.com_call_function(primaryNode, nodelist[2]) if t == token.DOT: return self.com_select_member(primaryNode, nodelist[2]) if t == token.LSQB: return self.com_subscriptlist(primaryNode, nodelist[2], OP_APPLY) raise SyntaxError, 'unknown node type: %s' % t def com_select_member(self, primaryNode, nodelist): if nodelist[0] != token.NAME: raise SyntaxError, "member must be a name" return Getattr(primaryNode, nodelist[1], lineno=nodelist[2]) def com_call_function(self, primaryNode, nodelist): if nodelist[0] == token.RPAR: return CallFunc(primaryNode, [], lineno=extractLineNo(nodelist)) args = [] kw = 0 star_node = dstar_node = None len_nodelist = len(nodelist) i = 1 while i < len_nodelist: node = nodelist[i] if node[0]==token.STAR: if star_node is not None: raise SyntaxError, 'already have the varargs indentifier' star_node = self.com_node(nodelist[i+1]) i = i + 3 continue elif node[0]==token.DOUBLESTAR: if dstar_node is not None: raise SyntaxError, 'already have the kwargs indentifier' dstar_node = self.com_node(nodelist[i+1]) i = i + 3 continue # positional or named parameters kw, result = self.com_argument(node, kw, star_node) if len_nodelist != 2 and isinstance(result, GenExpr) \ and len(node) == 3 and node[2][0] == symbol.comp_for: # allow f(x for x in y), but reject f(x for x in y, 1) # should use f((x for x in y), 1) instead of f(x for x in y, 1) raise SyntaxError, 'generator expression needs parenthesis' args.append(result) i = i + 2 return CallFunc(primaryNode, args, star_node, dstar_node, lineno=extractLineNo(nodelist)) def com_argument(self, nodelist, kw, star_node): if len(nodelist) == 3 and nodelist[2][0] == symbol.comp_for: test = self.com_node(nodelist[1]) return 0, self.com_generator_expression(test, nodelist[2]) if len(nodelist) == 2: if kw: raise SyntaxError, "non-keyword arg after keyword arg" if star_node: raise SyntaxError, "only named arguments may follow *expression" return 0, self.com_node(nodelist[1]) result = self.com_node(nodelist[3]) n = nodelist[1] while len(n) == 2 and n[0] != token.NAME: n = n[1] if n[0] != token.NAME: raise SyntaxError, "keyword can't be an expression (%s)"%n[0] node = Keyword(n[1], result, lineno=n[2]) return 1, node def com_subscriptlist(self, primary, nodelist, assigning): # slicing: simple_slicing | extended_slicing # simple_slicing: primary "[" short_slice "]" # extended_slicing: primary "[" slice_list "]" # slice_list: slice_item ("," slice_item)* [","] # backwards compat slice for '[i:j]' if len(nodelist) == 2: sub = nodelist[1] if (sub[1][0] == token.COLON or \ (len(sub) > 2 and sub[2][0] == token.COLON)) and \ sub[-1][0] != symbol.sliceop: return self.com_slice(primary, sub, assigning) subscripts = [] for i in range(1, len(nodelist), 2): subscripts.append(self.com_subscript(nodelist[i])) return Subscript(primary, assigning, subscripts, lineno=extractLineNo(nodelist)) def com_subscript(self, node): # slice_item: expression | proper_slice | ellipsis ch = node[1] t = ch[0] if t == token.DOT and node[2][0] == token.DOT: return Ellipsis() if t == token.COLON or len(node) > 2: return self.com_sliceobj(node) return self.com_node(ch) def com_sliceobj(self, node): # proper_slice: short_slice | long_slice # short_slice: [lower_bound] ":" [upper_bound] # long_slice: short_slice ":" [stride] # lower_bound: expression # upper_bound: expression # stride: expression # # Note: a stride may be further slicing... items = [] if node[1][0] == token.COLON: items.append(Const(None)) i = 2 else: items.append(self.com_node(node[1])) # i == 2 is a COLON i = 3 if i < len(node) and node[i][0] == symbol.test: items.append(self.com_node(node[i])) i = i + 1 else: items.append(Const(None)) # a short_slice has been built. look for long_slice now by looking # for strides... for j in range(i, len(node)): ch = node[j] if len(ch) == 2: items.append(Const(None)) else: items.append(self.com_node(ch[2])) return Sliceobj(items, lineno=extractLineNo(node)) def com_slice(self, primary, node, assigning): # short_slice: [lower_bound] ":" [upper_bound] lower = upper = None if len(node) == 3: if node[1][0] == token.COLON: upper = self.com_node(node[2]) else: lower = self.com_node(node[1]) elif len(node) == 4: lower = self.com_node(node[1]) upper = self.com_node(node[3]) return Slice(primary, assigning, lower, upper, lineno=extractLineNo(node)) def get_docstring(self, node, n=None): if n is None: n = node[0] node = node[1:] if n == symbol.suite: if len(node) == 1: return self.get_docstring(node[0]) for sub in node: if sub[0] == symbol.stmt: return self.get_docstring(sub) return None if n == symbol.file_input: for sub in node: if sub[0] == symbol.stmt: return self.get_docstring(sub) return None if n == symbol.atom: if node[0][0] == token.STRING: s = '' for t in node: s = s + eval(t[1]) return s return None if n == symbol.stmt or n == symbol.simple_stmt \ or n == symbol.small_stmt: return self.get_docstring(node[0]) if n in _doc_nodes and len(node) == 1: return self.get_docstring(node[0]) return None _doc_nodes = [ symbol.expr_stmt, symbol.testlist, symbol.testlist_safe, symbol.test, symbol.or_test, symbol.and_test, symbol.not_test, symbol.comparison, symbol.expr, symbol.xor_expr, symbol.and_expr, symbol.shift_expr, symbol.arith_expr, symbol.term, symbol.factor, symbol.power, ] # comp_op: '<' | '>' | '=' | '>=' | '<=' | '<>' | '!=' | '==' # | 'in' | 'not' 'in' | 'is' | 'is' 'not' _cmp_types = { token.LESS : '<', token.GREATER : '>', token.EQEQUAL : '==', token.EQUAL : '==', token.LESSEQUAL : '<=', token.GREATEREQUAL : '>=', token.NOTEQUAL : '!=', } _legal_node_types = [ symbol.funcdef, symbol.classdef, symbol.stmt, symbol.small_stmt, symbol.flow_stmt, symbol.simple_stmt, symbol.compound_stmt, symbol.expr_stmt, symbol.print_stmt, symbol.del_stmt, symbol.pass_stmt, symbol.break_stmt, symbol.continue_stmt, symbol.return_stmt, symbol.raise_stmt, symbol.import_stmt, symbol.global_stmt, symbol.exec_stmt, symbol.assert_stmt, symbol.if_stmt, symbol.while_stmt, symbol.for_stmt, symbol.try_stmt, symbol.with_stmt, symbol.suite, symbol.testlist, symbol.testlist_safe, symbol.test, symbol.and_test, symbol.not_test, symbol.comparison, symbol.exprlist, symbol.expr, symbol.xor_expr, symbol.and_expr, symbol.shift_expr, symbol.arith_expr, symbol.term, symbol.factor, symbol.power, symbol.atom, ] if hasattr(symbol, 'yield_stmt'): _legal_node_types.append(symbol.yield_stmt) if hasattr(symbol, 'yield_expr'): _legal_node_types.append(symbol.yield_expr) _assign_types = [ symbol.test, symbol.or_test, symbol.and_test, symbol.not_test, symbol.comparison, symbol.expr, symbol.xor_expr, symbol.and_expr, symbol.shift_expr, symbol.arith_expr, symbol.term, symbol.factor, ] _names = {} for k, v in symbol.sym_name.items(): _names[k] = v for k, v in token.tok_name.items(): _names[k] = v def debug_tree(tree): l = [] for elt in tree: if isinstance(elt, (int, long)): l.append(_names.get(elt, elt)) elif isinstance(elt, str): l.append(elt) else: l.append(debug_tree(elt)) return l PK s�Z��>�� � consts.pycnu �[��� � { fc @ s| d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d S( t OP_ASSIGNt OP_DELETEt OP_APPLYi i i i i i i i i i i i @ i � i N( R R R t SC_LOCALt SC_GLOBAL_IMPLICITt SC_GLOBAL_EXPLICITt SC_FREEt SC_CELLt SC_UNKNOWNt CO_OPTIMIZEDt CO_NEWLOCALSt CO_VARARGSt CO_VARKEYWORDSt CO_NESTEDt CO_GENERATORt CO_GENERATOR_ALLOWEDt CO_FUTURE_DIVISIONt CO_FUTURE_ABSIMPORTt CO_FUTURE_WITH_STATEMENTt CO_FUTURE_PRINT_FUNCTION( ( ( s' /usr/lib64/python2.7/compiler/consts.pyt <module> s& PK s�Z��@� � syntax.pynu �[��� """Check for errs in the AST. The Python parser does not catch all syntax errors. Others, like assignments with invalid targets, are caught in the code generation phase. The compiler package catches some errors in the transformer module. But it seems clearer to write checkers that use the AST to detect errors. """ from compiler import ast, walk def check(tree, multi=None): v = SyntaxErrorChecker(multi) walk(tree, v) return v.errors class SyntaxErrorChecker: """A visitor to find syntax errors in the AST.""" def __init__(self, multi=None): """Create new visitor object. If optional argument multi is not None, then print messages for each error rather than raising a SyntaxError for the first. """ self.multi = multi self.errors = 0 def error(self, node, msg): self.errors = self.errors + 1 if self.multi is not None: print "%s:%s: %s" % (node.filename, node.lineno, msg) else: raise SyntaxError, "%s (%s:%s)" % (msg, node.filename, node.lineno) def visitAssign(self, node): # the transformer module handles many of these pass ## for target in node.nodes: ## if isinstance(target, ast.AssList): ## if target.lineno is None: ## target.lineno = node.lineno ## self.error(target, "can't assign to list comprehension") PK s�Z��R-[ [ visitor.pyonu �[��� � { fc @ s[ d d l m Z d d d � � YZ d e f d � � YZ e Z d d d � Z d � Z d S( i����( t astt ASTVisitorc B s8 e Z d Z d Z d � Z d � Z d � Z d � Z RS( s Performs a depth-first walk of the AST The ASTVisitor will walk the AST, performing either a preorder or postorder traversal depending on which method is called. methods: preorder(tree, visitor) postorder(tree, visitor) tree: an instance of ast.Node visitor: an instance with visitXXX methods The ASTVisitor is responsible for walking over the tree in the correct order. For each node, it checks the visitor argument for a method named 'visitNodeType' where NodeType is the name of the node's class, e.g. Class. If the method exists, it is called with the node as its sole argument. The visitor method for a particular node type can control how child nodes are visited during a preorder walk. (It can't control the order during a postorder walk, because it is called _after_ the walk has occurred.) The ASTVisitor modifies the visitor argument by adding a visit method to the visitor; this method can be used to visit a child node of arbitrary type. i c C s d | _ i | _ d S( N( t Nonet nodet _cache( t self( ( s( /usr/lib64/python2.7/compiler/visitor.pyt __init__" s c G s+ x$ | j � D] } | j | | � q Wd S( N( t getChildNodest dispatch( R R t argst child( ( s( /usr/lib64/python2.7/compiler/visitor.pyt default& s c G su | | _ | j } | j j | d � } | d k rh | j } t | j d | | j � } | | j | <n | | | � S( Nt visit( R t __class__R t getR t __name__t getattrt visitorR ( R R R t klasst metht className( ( s( /usr/lib64/python2.7/compiler/visitor.pyR * s c G s) | | _ | j | _ | j | | � d S( s& Do preorder walk of tree using visitorN( R R R ( R t treeR R ( ( s( /usr/lib64/python2.7/compiler/visitor.pyt preorder; s ( R t __module__t __doc__t VERBOSER R R R ( ( ( s( /usr/lib64/python2.7/compiler/visitor.pyR s t ExampleASTVisitorc B s e Z d Z i Z d � Z RS( s� Prints examples of the nodes that aren't visited This visitor-driver is only useful for development, when it's helpful to develop a visitor incrementally, and get feedback on what you still have to do. c G sG | | _ | j j | j d � } | j j } | d k re t | j d | d � } | | j | j <n | j d k r� d G| G| r� | j p� d GHn | r� | | | � n� | j d k rC| j } | | j k r3| | j | <H| j GH| GHxA t | � D]3 } | d d k r� d Gd | Gt | | � GHq� q� WHn | j | | � Sd S( NR i i R t t _s s %-12.12s( R R R R R R R R R t examplest dirR ( R R R R R R t attr( ( s( /usr/lib64/python2.7/compiler/visitor.pyR J s, !( R R R R R ( ( ( s( /usr/lib64/python2.7/compiler/visitor.pyR A s c C sG | d k r t � } n | d k r0 | | _ n | j | | � | j S( N( R t _walkerR R R ( R R t walkert verbose( ( s( /usr/lib64/python2.7/compiler/visitor.pyt walke s c C sP | j GHxA t | � D]3 } | d d k r d Gd | Gt | | � GHq q Wd S( Ni R s s %-10.10s( R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/visitor.pyt dumpNodem s N( ( t compilerR R R R R R# R$ ( ( ( s( /usr/lib64/python2.7/compiler/visitor.pyt <module> s ;#PK s�Z0~�F8 8 visitor.pynu �[��� from compiler import ast # XXX should probably rename ASTVisitor to ASTWalker # XXX can it be made even more generic? class ASTVisitor: """Performs a depth-first walk of the AST The ASTVisitor will walk the AST, performing either a preorder or postorder traversal depending on which method is called. methods: preorder(tree, visitor) postorder(tree, visitor) tree: an instance of ast.Node visitor: an instance with visitXXX methods The ASTVisitor is responsible for walking over the tree in the correct order. For each node, it checks the visitor argument for a method named 'visitNodeType' where NodeType is the name of the node's class, e.g. Class. If the method exists, it is called with the node as its sole argument. The visitor method for a particular node type can control how child nodes are visited during a preorder walk. (It can't control the order during a postorder walk, because it is called _after_ the walk has occurred.) The ASTVisitor modifies the visitor argument by adding a visit method to the visitor; this method can be used to visit a child node of arbitrary type. """ VERBOSE = 0 def __init__(self): self.node = None self._cache = {} def default(self, node, *args): for child in node.getChildNodes(): self.dispatch(child, *args) def dispatch(self, node, *args): self.node = node klass = node.__class__ meth = self._cache.get(klass, None) if meth is None: className = klass.__name__ meth = getattr(self.visitor, 'visit' + className, self.default) self._cache[klass] = meth ## if self.VERBOSE > 0: ## className = klass.__name__ ## if self.VERBOSE == 1: ## if meth == 0: ## print "dispatch", className ## else: ## print "dispatch", className, (meth and meth.__name__ or '') return meth(node, *args) def preorder(self, tree, visitor, *args): """Do preorder walk of tree using visitor""" self.visitor = visitor visitor.visit = self.dispatch self.dispatch(tree, *args) # XXX *args make sense? class ExampleASTVisitor(ASTVisitor): """Prints examples of the nodes that aren't visited This visitor-driver is only useful for development, when it's helpful to develop a visitor incrementally, and get feedback on what you still have to do. """ examples = {} def dispatch(self, node, *args): self.node = node meth = self._cache.get(node.__class__, None) className = node.__class__.__name__ if meth is None: meth = getattr(self.visitor, 'visit' + className, 0) self._cache[node.__class__] = meth if self.VERBOSE > 1: print "dispatch", className, (meth and meth.__name__ or '') if meth: meth(node, *args) elif self.VERBOSE > 0: klass = node.__class__ if klass not in self.examples: self.examples[klass] = klass print print self.visitor print klass for attr in dir(node): if attr[0] != '_': print "\t", "%-12.12s" % attr, getattr(node, attr) print return self.default(node, *args) # XXX this is an API change _walker = ASTVisitor def walk(tree, visitor, walker=None, verbose=None): if walker is None: walker = _walker() if verbose is not None: walker.VERBOSE = verbose walker.preorder(tree, visitor) return walker.visitor def dumpNode(node): print node.__class__ for attr in dir(node): if attr[0] != '_': print "\t", "%-10.10s" % attr, getattr(node, attr) PK s�Zx��� � ast.pycnu �[��� � { fc @ s: d Z d d l m Z m Z d � Z d � Z i Z d d� d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d! e f d" � � YZ d# e f d$ � � YZ d% e f d& � � YZ d' e f d( � � YZ d) e f d* � � YZ d+ e f d, � � YZ d- e f d. � � YZ d/ e f d0 � � YZ d1 e f d2 � � YZ d3 e f d4 � � YZ d5 e f d6 � � YZ d7 e f d8 � � YZ d9 e f d: � � YZ! d; e f d< � � YZ" d= e f d> � � YZ# d? e f d@ � � YZ$ dA e f dB � � YZ% dC e f dD � � YZ& dE e f dF � � YZ' dG e f dH � � YZ( dI e f dJ � � YZ) dK e f dL � � YZ* dM e f dN � � YZ+ dO e f dP � � YZ, dQ e f dR � � YZ- dS e f dT � � YZ. dU e f dV � � YZ/ dW e f dX � � YZ0 dY e f dZ � � YZ1 d[ e f d\ � � YZ2 d] e f d^ � � YZ3 d_ e f d` � � YZ4 da e f db � � YZ5 dc e f dd � � YZ6 de e f df � � YZ7 dg e f dh � � YZ8 di e f dj � � YZ9 dk e f dl � � YZ: dm e f dn � � YZ; do e f dp � � YZ< dq e f dr � � YZ= ds e f dt � � YZ> du e f dv � � YZ? dw e f dx � � YZ@ dy e f dz � � YZA d{ e f d| � � YZB d} e f d~ � � YZC d e f d� � � YZD d� e f d� � � YZE d� e f d� � � YZF d� e f d� � � YZG d� e f d� � � YZH d� e f d� � � YZI d� e f d� � � YZJ d� e f d� � � YZK d� e f d� � � YZL d� e f d� � � YZM d� e f d� � � YZN d� e f d� � � YZO d� e f d� � � YZP d� e f d� � � YZQ d� e f d� � � YZR d� e f d� � � YZS d� e f d� � � YZT xN eU � jV � D]= \ ZW ZX eY eX eZ � r�e[ eX e � r�eX e eW j\ � <q�q�Wd� S(� sj Python abstract syntax node definitions This file is automatically generated by Tools/compiler/astgen.py i����( t CO_VARARGSt CO_VARKEYWORDSc C ss g } xf | D]^ } t | � } | t k s7 | t k r^ x1 t | � D] } | j | � qD Wq | j | � q W| S( N( t typet tuplet listt flattent append( t seqt lt eltt tt elt2( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s, g t | � D] } t | t � r | ^ q S( N( R t isinstancet Node( R t n( ( s$ /usr/lib64/python2.7/compiler/ast.pyt flatten_nodes s R c B s2 e Z d Z d � Z d � Z d � Z d � Z RS( s" Abstract base class for ast nodes.c C s d S( N( ( t self( ( s$ /usr/lib64/python2.7/compiler/ast.pyt getChildren s c c s x | j � D] } | Vq Wd S( N( R ( R R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt __iter__ s c C s | j � S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt asList s c C s d S( N( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt getChildNodes s ( t __name__t __module__t __doc__R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s t EmptyNodec B s e Z RS( ( R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR # s t Expressionc B s6 e Z d e d <d � Z d � Z d � Z d � Z RS( R t expressionc C s | | _ d S( N( t node( R R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt __init__) s c C s | j f S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR , s c C s | j f S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR / s c C s d t | j � S( Ns Expression(%s)( t reprR ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt __repr__2 s ( R R t nodesR R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR & s t Addc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( t leftt rightt lineno( R t leftrightR# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 6 s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ; s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR > s c C s d t | j � t | j � f S( Ns Add((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR A s N( R R t NoneR R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 5 s t Andc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR E s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR I s c C s& g } | j t | j � � t | � S( N( t extendR R R ( R t nodelist( ( s$ /usr/lib64/python2.7/compiler/ast.pyR L s c C s d t | j � f S( Ns And(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Q s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR& D s t AssAttrc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t exprt attrnamet flagsR# ( R R* R+ R, R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR U s c C s | j | j | j f S( N( R* R+ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR [ s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ^ s c C s, d t | j � t | j � t | j � f S( Ns AssAttr(%s, %s, %s)( R R* R+ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR a s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR) T s t AssListc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR e s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR l s c C s d t | j � f S( Ns AssList(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR q s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR- d s t AssNamec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( t nameR, R# ( R R/ R, R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR u s c C s | j | j f S( N( R/ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR } s c C s d t | j � t | j � f S( Ns AssName(%s, %s)( R R/ R, ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR. t s t AssTuplec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns AssTuple(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR0 � s t Assertc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( t testt failR# ( R R2 R3 R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s0 g } | j | j � | j | j � t | � S( N( R R2 R3 R ( R t children( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sB g } | j | j � | j d k r8 | j | j � n t | � S( N( R R2 R3 R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Assert(%s, %s)( R R2 R3 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR1 � s t Assignc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R R* R# ( R R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R* R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R* R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Assign(%s, %s)( R R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR5 � s t AugAssignc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R t opR* R# ( R R R7 R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j | j f S( N( R R7 R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns AugAssign(%s, %s, %s)( R R R7 R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR6 � s t Backquotec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Backquote(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR8 � s t Bitandc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Bitand(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR9 � s t Bitorc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Bitor(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR: � s t Bitxorc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d t | j � f S( Ns Bitxor(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR; � s t Breakc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( Ns Break()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR< s t CallFuncc B s5 e Z d d d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ | | _ d S( N( R t argst star_argst dstar_argsR# ( R R R> R? R@ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C sV g } | j | j � | j t | j � � | j | j � | j | j � t | � S( N( R R R' R R> R? R@ R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ! s c C sz g } | j | j � | j t | j � � | j d k rN | j | j � n | j d k rp | j | j � n t | � S( N( R R R' R R> R? R% R@ R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ) s c C s8 d t | j � t | j � t | j � t | j � f S( Ns CallFunc(%s, %s, %s, %s)( R R R> R? R@ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 3 s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR= s t Classc B s2 e Z d d d � Z d � Z d � Z d � Z RS( c C s: | | _ | | _ | | _ | | _ | | _ | | _ d S( N( R/ t basest doct codet decoratorsR# ( R R/ RB RC RD RE R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 7 s c C sf g } | j | j � | j t | j � � | j | j � | j | j � | j | j � t | � S( N( R R/ R' R RB RC RD RE R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ? s c C sX g } | j t | j � � | j | j � | j d k rN | j | j � n t | � S( N( R' R RB R RD RE R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR H s c C sD d t | j � t | j � t | j � t | j � t | j � f S( Ns Class(%s, %s, %s, %s, %s)( R R/ RB RC RD RE ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR P s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRA 6 s t Comparec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* t opsR# ( R R* RG R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR T s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R RG R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Y s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R RG R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR _ s c C s d t | j � t | j � f S( Ns Compare(%s, %s)( R R* RG ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR e s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRF S s t Constc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( t valueR# ( R RI R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR m s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s c C s d t | j � f S( Ns Const(%s)( R RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRH h s t Continuec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR w s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR } s c C s d S( Ns Continue()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRJ v s t Decoratorsc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Decorators(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRK � s t Dictc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( t itemsR# ( R RM R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R RM ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R RM R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Dict(%s)( R RM ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRL � s t Discardc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Discard(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRN � s t Divc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Div((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRO � s t Ellipsisc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( Ns Ellipsis()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRP � s t Execc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R* t localst globalsR# ( R R* RR RS R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R* RR RS R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sd g } | j | j � | j d k r8 | j | j � n | j d k rZ | j | j � n t | � S( N( R R* RR R% RS R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns Exec(%s, %s, %s)( R R* RR RS ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRQ � s t FloorDivc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns FloorDiv((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRT � s t Forc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ | | _ d S( N( t assignR t bodyt else_R# ( R RV R RW RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sP g } | j | j � | j | j � | j | j � | j | j � t | � S( N( R RV R RW RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sb g } | j | j � | j | j � | j | j � | j d k rX | j | j � n t | � S( N( R RV R RW RX R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s8 d t | j � t | j � t | j � t | j � f S( Ns For(%s, %s, %s, %s)( R RV R RW RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRU � s t Fromc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t modnamet namest levelR# ( R RZ R[ R\ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j | j f S( N( RZ R[ R\ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s, d t | j � t | j � t | j � f S( Ns From(%s, %s, %s)( R RZ R[ R\ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRY s t Functionc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s� | | _ | | _ | | _ | | _ | | _ | | _ | | _ | | _ d | _ | _ | t @rn d | _ n | t @r� d | _ n d S( Ni ( RE R/ t argnamest defaultsR, RC RD R# R% t varargst kwargsR R ( R RE R/ R^ R_ R, RC RD R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR # s c C s� g } | j | j � | j | j � | j | j � | j t | j � � | j | j � | j | j � | j | j � t | � S( N( R RE R/ R^ R' R R_ R, RC RD R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 3 s c C sX g } | j d k r( | j | j � n | j t | j � � | j | j � t | � S( N( RE R% R R' R R_ RD R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR > s c C s\ d t | j � t | j � t | j � t | j � t | j � t | j � t | j � f S( Ns$ Function(%s, %s, %s, %s, %s, %s, %s)( R RE R/ R^ R_ R, RC RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR F s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR] " s t GenExprc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s2 | | _ | | _ d g | _ d | _ | _ d S( Ns .0( RD R# R^ R% R` Ra ( R RD R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR J s c C s | j f S( N( RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Q s c C s | j f S( N( RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR T s c C s d t | j � f S( Ns GenExpr(%s)( R RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR W s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRb I s t GenExprForc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ t | _ d S( N( RV t itert ifsR# t Falset is_outmost( R RV Rd Re R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR [ s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV Rd R' R Re R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR b s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV Rd R' R Re R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C s, d t | j � t | j � t | j � f S( Ns GenExprFor(%s, %s, %s)( R RV Rd Re ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRc Z s t GenExprIfc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R2 R# ( R R2 R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR t s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR x s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR { s c C s d t | j � f S( Ns GenExprIf(%s)( R R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ~ s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRh s s t GenExprInnerc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* t qualsR# ( R R* Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns GenExprInner(%s, %s)( R R* Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRi � s t Getattrc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* R+ R# ( R R* R+ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R* R+ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Getattr(%s, %s)( R R* R+ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRk � s t Globalc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R[ R# ( R R[ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Global(%s)( R R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRl � s t Ifc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( t testsRX R# ( R Rn RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R Rn R RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sH g } | j t | j � � | j d k r> | j | j � n t | � S( N( R' R Rn RX R% R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns If(%s, %s)( R Rn RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRm � s t IfExpc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R2 t thenRX R# ( R R2 Rp RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j | j f S( N( R2 Rp RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j | j f S( N( R2 Rp RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns IfExp(%s, %s, %s)( R R2 Rp RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRo � s t Importc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R[ R# ( R R[ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Import(%s)( R R[ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRq � s t Invertc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Invert(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRr � s t Keywordc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R/ R* R# ( R R/ R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R/ R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Keyword(%s, %s)( R R/ R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRs � s t Lambdac B s/ e Z d d � Z d � Z d � Z d � Z RS( c C sm | | _ | | _ | | _ | | _ | | _ d | _ | _ | t @rS d | _ n | t @ri d | _ n d S( Ni ( R^ R_ R, RD R# R% R` Ra R R ( R R^ R_ R, RD R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C sV g } | j | j � | j t | j � � | j | j � | j | j � t | � S( N( R R^ R' R R_ R, RD R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R_ R RD R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s8 d t | j � t | j � t | j � t | j � f S( Ns Lambda(%s, %s, %s, %s)( R R^ R_ R, RD ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRt s t LeftShiftc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR $ s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ) s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR , s c C s d t | j � t | j � f S( Ns LeftShift((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR / s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRu # s t Listc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 3 s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 7 s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR : s c C s d t | j � f S( Ns List(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ? s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRv 2 s t ListCompc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* Rj R# ( R R* Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR C s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR H s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR N s c C s d t | j � t | j � f S( Ns ListComp(%s, %s)( R R* Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR T s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRw B s t ListCompForc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( RV R Re R# ( R RV R Re R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR X s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV R R' R Re R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ^ s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R RV R R' R Re R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR e s c C s, d t | j � t | j � t | j � f S( Ns ListCompFor(%s, %s, %s)( R RV R Re ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR l s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRx W s t ListCompIfc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R2 R# ( R R2 R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR t s c C s | j f S( N( R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR w s c C s d t | j � f S( Ns ListCompIf(%s)( R R2 ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRy o s t SetCompc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R* Rj R# ( R R* Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ~ s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns SetComp(%s, %s)( R R* Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyRz } s t DictCompc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t keyRI Rj R# ( R R| RI Rj R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R R| RI R' R Rj R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R R| RI R' R Rj R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns DictComp(%s, %s, %s)( R R| RI Rj ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR{ � s t Modc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Mod((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR} � s t Modulec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( RC R R# ( R RC R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( RC R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Module(%s, %s)( R RC R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR~ � s t Mulc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Mul((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s t Namec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R/ R# ( R R/ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R/ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Name(%s)( R R/ ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Notc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Not(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Orc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Or(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Passc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ d S( N( R# ( R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( N( ( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d S( Ns Pass()( ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Powerc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d t | j � t | j � f S( Ns Power((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Printc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R t destR# ( R R R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR % s c C sH g } | j t | j � � | j d k r> | j | j � n t | � S( N( R' R R R� R% R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR + s c C s d t | j � t | j � f S( Ns Print(%s, %s)( R R R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 2 s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Printnlc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R R� R# ( R R R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 6 s c C s6 g } | j t | j � � | j | j � t | � S( N( R' R R R R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR ; s c C sH g } | j t | j � � | j d k r> | j | j � n t | � S( N( R' R R R� R% R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR A s c C s d t | j � t | j � f S( Ns Printnl(%s, %s)( R R R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR H s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� 5 s t Raisec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( t expr1t expr2t expr3R# ( R R� R� R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR L s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R� R� R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR R s c C sv g } | j d k r( | j | j � n | j d k rJ | j | j � n | j d k rl | j | j � n t | � S( N( R� R% R R� R� R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR Y s c C s, d t | j � t | j � t | j � f S( Ns Raise(%s, %s, %s)( R R� R� R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR c s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� K s t Returnc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( RI R# ( R RI R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR g s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR k s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR n s c C s d t | j � f S( Ns Return(%s)( R RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR q s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� f s t RightShiftc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR u s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR z s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR } s c C s d t | j � t | j � f S( Ns RightShift((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� t s t Setc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Set(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Slicec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s1 | | _ | | _ | | _ | | _ | | _ d S( N( R* R, t lowert upperR# ( R R* R, R� R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sP g } | j | j � | j | j � | j | j � | j | j � t | � S( N( R R* R, R� R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sd g } | j | j � | j d k r8 | j | j � n | j d k rZ | j | j � n t | � S( N( R R* R� R% R� R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s8 d t | j � t | j � t | j � t | j � f S( Ns Slice(%s, %s, %s, %s)( R R* R, R� R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Sliceobjc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Sliceobj(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Stmtc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Stmt(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Subc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s' | d | _ | d | _ | | _ d S( Ni i ( R! R" R# ( R R$ R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j | j f S( N( R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � t | j � f S( Ns Sub((%s, %s))( R R! R" ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t Subscriptc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R* R, t subsR# ( R R* R, R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j | j � | j t | j � � t | � S( N( R R* R, R' R R� R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s6 g } | j | j � | j t | j � � t | � S( N( R R* R' R R� R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s, d t | j � t | j � t | j � f S( Ns Subscript(%s, %s, %s)( R R* R, R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t TryExceptc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( RW t handlersRX R# ( R RW R� RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sF g } | j | j � | j t | j � � | j | j � t | � S( N( R RW R' R R� RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C sX g } | j | j � | j t | j � � | j d k rN | j | j � n t | � S( N( R RW R' R R� RX R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s, d t | j � t | j � t | j � f S( Ns TryExcept(%s, %s, %s)( R RW R� RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� � s t TryFinallyc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( RW t finalR# ( R RW R� R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( RW R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s | j | j f S( N( RW R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s d t | j � t | j � f S( Ns TryFinally(%s, %s)( R RW R� ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t Tuplec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R R# ( R R R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR s c C s t t | j � � S( N( R R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR " s c C s& g } | j t | j � � t | � S( N( R' R R R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR % s c C s d t | j � f S( Ns Tuple(%s)( R R ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR * s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� s t UnaryAddc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR . s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 2 s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 5 s c C s d t | j � f S( Ns UnaryAdd(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR 8 s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� - s t UnarySubc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( R* R# ( R R* R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR < s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR @ s c C s | j f S( N( R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR C s c C s d t | j � f S( Ns UnarySub(%s)( R R* ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR F s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� ; s t Whilec B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R2 RW RX R# ( R R2 RW RX R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR J s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R2 RW RX R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR P s c C sR g } | j | j � | j | j � | j d k rH | j | j � n t | � S( N( R R2 RW RX R% R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR W s c C s, d t | j � t | j � t | j � f S( Ns While(%s, %s, %s)( R R2 RW RX ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR _ s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� I s t Withc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s( | | _ | | _ | | _ | | _ d S( N( R* t varsRW R# ( R R* R� RW R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR c s c C s@ g } | j | j � | j | j � | j | j � t | � S( N( R R* R� RW R ( R R4 ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR i s c C sR g } | j | j � | j d k r8 | j | j � n | j | j � t | � S( N( R R* R� R% RW R ( R R( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR p s c C s, d t | j � t | j � t | j � f S( Ns With(%s, %s, %s)( R R* R� RW ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR x s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� b s t Yieldc B s/ e Z d d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d S( N( RI R# ( R RI R# ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR | s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s | j f S( N( RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s c C s d t | j � f S( Ns Yield(%s)( R RI ( R ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR � s N( R R R% R R R R ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyR� { s N( (] R t compiler.constsR R R R R R R R R R& R) R- R. R0 R1 R5 R6 R8 R9 R: R; R< R= RA RF RH RJ RK RL RN RO RP RQ RT RU RY R] Rb Rc Rh Ri Rk Rl Rm Ro Rq Rr Rs Rt Ru Rv Rw Rx Ry Rz R{ R} R~ R R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� RS RM R/ t objR R t issubclassR� ( ( ( s$ /usr/lib64/python2.7/compiler/ast.pyt <module> s� ' PK s�Z�� � future.pyonu �[��� � { fc @ s� d Z d d l m Z m Z d � Z d d d � � YZ d d d � � YZ d � Z e d k r� d d l Z d d l m Z m Z xH e j d D]6 Z e GHe e � Z e � Z e e e � e j GHHq� Wn d S( s Parser for future statements i����( t astt walkc C s1 t | t j � s d S| j d k r) d Sd Sd S( s: Return true if statement is a well-formed future statementi t __future__i N( t isinstanceR t Fromt modname( t stmt( ( s' /usr/lib64/python2.7/compiler/future.pyt is_future s t FutureParserc B s2 e Z d Z d � Z d � Z d � Z d � Z RS( t nested_scopest generatorst divisiont absolute_importt with_statementt print_functiont unicode_literalsc C s i | _ d S( N( t found( t self( ( s' /usr/lib64/python2.7/compiler/future.pyt __init__ s c C s4 | j } x$ | j D] } | j | � s Pq q Wd S( N( t nodet nodest check_stmt( R R R t s( ( s' /usr/lib64/python2.7/compiler/future.pyt visitModule s c C sc t | � r_ xC | j D]8 \ } } | | j k rA d | j | <q t d | � q Wd | _ d Sd S( Ni s future feature %s is not definedi ( R t namest featuresR t SyntaxErrort valid_future( R R t namet asname( ( s' /usr/lib64/python2.7/compiler/future.pyR s c C s | j j � S( s4 Return list of features enabled by future statements( R t keys( R ( ( s' /usr/lib64/python2.7/compiler/future.pyt get_features+ s ( R R R R R R R ( t __name__t __module__R R R R R ( ( ( s' /usr/lib64/python2.7/compiler/future.pyR s t BadFutureParserc B s e Z d Z d � Z RS( s# Check for invalid future statementsc C s= t | d � r d S| j d k r& d St d t | � � d S( NR R s invalid future statement ( t hasattrR R t repr( R R ( ( s' /usr/lib64/python2.7/compiler/future.pyt visitFrom2 s ( R R! t __doc__R% ( ( ( s' /usr/lib64/python2.7/compiler/future.pyR" / s c C s6 t � } t � } t | | � t | | � | j � S( N( R R" R R ( R t p1t p2( ( s' /usr/lib64/python2.7/compiler/future.pyt find_futures9 s t __main__N( t parseFileR i ( ( ( R& t compilerR R R R R" R) R t sysR+ t argvt filet treet vR ( ( ( s' /usr/lib64/python2.7/compiler/future.pyt <module> s PK s�Z��S�Z Z syntax.pycnu �[��� � { fc @ s? d Z d d l m Z m Z d d � Z d d d � � YZ d S( s8 Check for errs in the AST. The Python parser does not catch all syntax errors. Others, like assignments with invalid targets, are caught in the code generation phase. The compiler package catches some errors in the transformer module. But it seems clearer to write checkers that use the AST to detect errors. i����( t astt walkc C s t | � } t | | � | j S( N( t SyntaxErrorCheckerR t errors( t treet multit v( ( s' /usr/lib64/python2.7/compiler/syntax.pyt check s R c B s, e Z d Z d d � Z d � Z d � Z RS( s+ A visitor to find syntax errors in the AST.c C s | | _ d | _ d S( s� Create new visitor object. If optional argument multi is not None, then print messages for each error rather than raising a SyntaxError for the first. i N( R R ( t selfR ( ( s' /usr/lib64/python2.7/compiler/syntax.pyt __init__ s c C sZ | j d | _ | j d k r: d | j | j | f GHn t d | | j | j f � d S( Ni s %s:%s: %ss %s (%s:%s)( R R t Nonet filenamet linenot SyntaxError( R t nodet msg( ( s' /usr/lib64/python2.7/compiler/syntax.pyt error s c C s d S( N( ( R R ( ( s' /usr/lib64/python2.7/compiler/syntax.pyt visitAssign' s N( t __name__t __module__t __doc__R R R R ( ( ( s' /usr/lib64/python2.7/compiler/syntax.pyR s N( ( R t compilerR R R R R ( ( ( s' /usr/lib64/python2.7/compiler/syntax.pyt <module> s PK s�Z'���!c !c pyassem.pyonu �[��� � { fc @ s d Z d d l Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z m Z d f d � � YZ d � Z d f d � � YZ d Z d Z d Z d Z d e f d � � YZ d � Z d f d � � YZ d � Z d � Z d f d � � YZ d f d � � YZ e � j Z d S( s/ A flow graph representation for Python bytecodei����N( t misc( t CO_OPTIMIZEDt CO_NEWLOCALSt CO_VARARGSt CO_VARKEYWORDSt FlowGraphc B s} e Z d � Z d � Z d d � Z d � Z d � Z d Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( c C s[ t � | _ | _ t d � | _ t j � | _ | j j | j � | j j | j � d S( Nt exit( t Blockt currentt entryR R t Sett blockst add( t self( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt __init__ s c C sr | j re | j rW d Gt | j � GHd G| j j GHd G| j j GHd G| j j � GHn t | � GHn | | _ d S( Nt ends nexts prevs ( t _debugR t reprt nextt prevt get_children( R t block( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt startBlock s c C s< | d k r | j � } n | j j | � | j | � d S( N( t Nonet newBlockR t addNextR ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt nextBlock s c C s t � } | j j | � | S( N( R R R ( R t b( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR 5 s c C s | j | j � d S( N( R R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt startExitBlock: s i c C s d | _ d S( Ni ( R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _enable_debug? s c C s d | _ d S( Ni ( R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _disable_debugB s c G se | j r d G| GHn t | � d k rQ t | d t � rQ | j j | d � n | j j | � d S( Ns i i ( R t lent isinstanceR R t addOutEdget emit( R t inst( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR" E s %c C s t | j | j � } | S( sl Return the blocks in reverse postorder i.e. each node appears before all of its successors ( t order_blocksR R ( R t order( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getBlocksInOrderL s c C s | j j � S( N( R t elements( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getBlocksT s c C s | j S( s/ Return nodes appropriate for use with dominator( R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getRootW s c C s4 g } x' | j � D] } | j | j � � q W| S( N( R( t extendt getContainedGraphs( R t lR ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR+ [ s N( t __name__t __module__R R R R R R R R R R" R& R( R) R+ ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR s c s� g } t � � | g } xh | r� | j � } | � k r? q n � j | � x0 | j � D]" } | � k rY | j | � qY qY Wq Wi � x� � D]� } t r� | j r� n � j | t � � xd | j � D]V } xM � j | t � � j | � | j r| j d | k r| j d } q� Pq� Wq� Wq� W� � f d � } | } xv | j | � � j | � | j rw| j d } qAn) | | k r�| j � r�| j | � n � s�Pn | � } qAW| S( s8 Order blocks so that they are emitted in the right orderi c s> x7 � D]/ } x& � | D] } | � k r Pq q W| Sq Wd S( N( ( R t c( t dominatorst remaining( s( /usr/lib64/python2.7/compiler/pyassem.pyt find_next� s ( t sett popR R t appendt __debug__R t setdefaultt get_followersR t discardt has_unconditional_transfer( t start_blockt exit_blockR% t todoR R/ R2 ( ( R0 R1 s( /usr/lib64/python2.7/compiler/pyassem.pyR$ b sH R c B sz e Z d Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d Z d � Z d � Z d � Z d � Z RS( i t c C sP g | _ t � | _ | | _ t j | _ g | _ g | _ t j d t _ d S( Ni ( t instsR3 t outEdgest labelR t _countt bidR R ( R RA ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s c C s, | j r d | j | j f Sd | j Sd S( Ns <block %s id=%d>s <block id=%d>( RA RC ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt __repr__� s c C s2 t t | j � } d | j | j d j | � f S( Ns <block %s %d: %s>s ( t mapt strR? RA RC t join( R R? ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt __str__� s c C s | d } | j j | � d S( Ni ( R? R5 ( R R# t op( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR" � s c C s | j S( N( R? ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getInstructions� s c C s | j j | � d S( N( R@ R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR! � s c C s$ | j j | � | j j | � d S( N( R R5 R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s t RETURN_VALUEt RAISE_VARARGSt JUMP_ABSOLUTEt JUMP_FORWARDt CONTINUE_LOOPc C s? y | j d \ } } Wn t t f k r1 d SX| | j k S( s� Returns True if there is an unconditional transfer to an other block at the end of this block. This means there is no risk for the bytecode executer to go past this block's bytecode.i����N( R? t IndexErrort ValueErrort _uncond_transfer( R RI t arg( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR: � s c C s t | j � | j S( N( t listR@ R ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s c C sN t | j � } x8 | j D]- } | d t j k r | j | d � q q W| S( s: Get the whole list of followers, including the next block.i i ( R3 R R? t PyFlowGrapht hasjrelR ( R t followersR# ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR8 � s c C sb g } xU | j D]J } t | � d k r. q n | d } t | d � r | j | j � q q W| S( s� Return all graphs contained within this block. For example, a MAKE_FUNCTION block will contain a reference to the graph for the function body. i t graph( R? R t hasattrR5 RX ( R t containedR# RI ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR+ � s ( RK RL RM RN RO ( R- R. RB R RD RH R" RJ R! R RR R: R R8 R+ ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s t RAWt FLATt CONVt DONERU c B sA e Z e j Z d d d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z e � Z x% e j D] Z e j e j e � q� We � Z x% e j D] Z e j e j e � q� Wd � Z d � Z d � Z i Z d � Z d � Z e Z e Z d � Z d � Z e Z e Z! e Z" e Z# e Z$ e Z% e Z& e Z' e Z( e Z) d � Z* e* Z+ e* Z, d � Z- e. e j/ � Z0 d � Z1 xD e2 � j3 � D]3 \ Z4 Z5 e4 d d k r�e4 d Z e5 e e <q�q�W[4 [5 [ d � Z6 i Z7 x. e8 e9 e j � � D] Z: e: e7 e j e: <qW[: d � Z; d � Z< RS( i c C s | j � | | _ | | _ d | _ | | _ t | � | _ | | _ | r\ t t B| _ n d | _ g | _ g | _ g | _ g | _ g | _ t | � p� g | _ xO t t | j � � D]8 } | j | } t | t � r� | j � | j | <q� q� Wt | _ d S( Ni ( t super_initt namet filenameR t docstringt argst getArgCountt argcountt klassR R t flagst constst namest freevarst cellvarst closureRT t varnamest rangeR R t TupleArgt getNameR[ t stage( R R` Ra Rc t optimizedRf t it var( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR s* c C s | | _ d S( N( Rb ( R t doc( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setDocstring s c C s3 | j | B| _ | t k r/ | j d | _ n d S( Ni ( Rg R Re ( R t flag( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setFlag" s c C s | j | @r d Sd S( Ni ( Rg ( R Rw ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt checkFlag' s c C s t | � | _ d S( N( RT Rj ( R Ri ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setFreeVars+ s c C s | | _ d S( N( Rk ( R Ri ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt setCellVars. s c C s2 | j � | j � | j � | j � | j � S( s Get a Python code object( t computeStackDeptht flattenGrapht convertArgst makeByteCodet newCodeObject( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt getCode1 s c C s� | r t j } | t _ n d } x~ | j D]s } | d } | d k rK Hn t | � d k r{ d Gd | G| GH| d } q+ d Gd | G| G| d GH| d } q+ W| r� | t _ n d S( Ni t SET_LINENOi s s %3di ( t syst stdoutR? R ( R t iot savet pct tt opname( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt dump= s c sp i � d } x* � j � D] } t | j � � � | <q Wi � � � � � f d � � � � j d � � _ d S( s� Compute the max stack depth. Approach is to compute the stack effect of each basic block. Then find the path through the code with the largest total effect. c s� | � k r | Sd � | <| � | } | j � } | r` t g | D] } � | | � ^ qD � S| j d k s � � j | � S| Sd S( Ni R ( R t maxRA R ( R t dt childrenR/ ( t deptht max_deptht seenR ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� ] s &i N( R R( t findDepthRJ R t stacksize( R R R ( ( R� R� R� R s( /usr/lib64/python2.7/compiler/pyassem.pyR| O s c C s� g | _ } d } i } i } x� | j � D]z } | | | <x] | j � D]O } | j | � t | � d k r{ | d } qI | d d k rI | d } qI qI W| | | <q, Wd } x� t t | � � D]� } | | } t | � d k r� | d } n | d d k r| d } n | d } | | j k rS| d } | | | } | | f | | <q� | | j k r� | | | d f | | <q� q� Wt | _ d S( s- Arrange the blocks in order and resolve jumpsi i R� i N( R? R& RJ R5 R Rn RV t hasjabsR\ Rq ( R R? R� t beginR R R# Rs R� t opargt offset( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR} m s8 c C s� | j j d | j � | j � x� t t | j � � D]n } | j | } t | � d k r6 | \ } } | j j | d � } | r� | | | | � f | j | <q� q6 q6 Wt | _ d S( s0 Convert arguments from symbolic to concrete formi i N( Rh t insertRb t sort_cellvarsRn R R? t _converterst getR R] Rq ( R Rs R� R� R� t conv( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR~ � s &c C s� i } x | j D] } d | | <q Wg | j D] } | | k r. | ^ q. | _ x | j D] } | | =qY W| j | j � | _ | j | j | _ d S( sH Sort cellvars in the order of varnames and prune from freevars. i N( Rk Rm t keysRj Rl ( R t cellsR` ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s c C sp t | � } xD t t | � � D]0 } | t | | � k r | | | k r | Sq Wt | � } | j | � | S( s� Return index of name in list, appending if necessary This routine uses a list instead of a dictionary, because a dictionary can't store two different keys if the keys have the same value but different types, e.g. 2 and 2L. The compiler must treat these two separately, so it does an explicit type comparison before comparing the values. ( t typeRn R R5 ( R R` RT R� Rs R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _lookupName� s & c C s1 t | d � r | j � } n | j | | j � S( NR� ( RY R� R� Rh ( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_CONST� s c C s& | j | | j � | j | | j � S( N( R� Ri Rm ( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_FAST� s c C s8 | j d k r% | j | | j � n | j | | j � S( N( Rf R R� Rm Ri ( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_NAME� s c C s8 | j d k r% | j | | j � n | j | | j � S( N( Rf R R� Rm Ri ( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_NAME� s c C s9 | j | | j � | j | | j � | j | | j � S( N( R� Ri Rm Rl ( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_DEREF� s c C s& | j | | j � | j | | j � S( N( R� Rm Rl ( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_LOAD_CLOSURE� s c C s | j j | � S( N( t _cmpt index( R RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt _convert_COMPARE_OP� s i t _convert_c C s� t � | _ } x� | j D]� } | d } t | � d k rS | j | j | � q | d } | d k r| | j | � q n t | � \ } } y | j | j | | | � Wq t k r� | G| GH| j | G| G| GH� q Xq Wt | _ d S( Ni i R� ( t LineAddrTablet lnotabR? R t addCodet opnumt nextLinet twobyteRQ R^ Rq ( R R� R� R� R� t hit lo( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR � s" c C s� | j t @d k r d } n t | j � } | j } | j t @rN | d } n t j | | | j | j | j j � | j � t | j � t | j � | j | j | j j | j j � t | j � t | j � � S( Ni i ( Rg R R Rm Re R t typest CodeTypeR� R� R� t getConstst tupleRi Ra R` t firstlinet getTableRj Rk ( R t nlocalsRe ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� s c C sO g } x< | j D]1 } t | t � r4 | j � } n | j | � q Wt | � S( s� Return a tuple for the const slot of the code object Must convert references to code (MAKE_FUNCTION) to code objects recursively. ( Rh R RU R� R5 R� ( R R, t elt( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� " s ( N(= R- R. R R R_ R Rv Rx Ry Rz R{ R� R� R| R} R3 RV t disRs R R� R� R~ R� R� R� R� R� t _convert_STORE_FASTt _convert_DELETE_FASTR� R� t _convert_STORE_NAMEt _convert_DELETE_NAMEt _convert_IMPORT_NAMEt _convert_IMPORT_FROMt _convert_STORE_ATTRt _convert_LOAD_ATTRt _convert_DELETE_ATTRt _convert_LOAD_GLOBALt _convert_STORE_GLOBALt _convert_DELETE_GLOBALR� t _convert_LOAD_DEREFt _convert_STORE_DEREFR� RT t cmp_opR� R� t localst itemsR` t objR R� Rn R t numR� R� ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRU � sn ! c C s | d d k r d Sd S( Ni t JUMPi ( ( R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt isJump/ s Ro c B s) e Z d Z d � Z d � Z d � Z RS( s: Helper for marking func defs with nested tuples in arglistc C s | | _ | | _ d S( N( t countRi ( R R� Ri ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR 5 s c C s d | j | j f S( Ns TupleArg(%s, %s)( R� Ri ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRD 8 s c C s d | j S( Ns .%d( R� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRp : s ( R- R. t __doc__R RD Rp ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRo 3 s c C s^ t | � } | rZ xE | D]: } t | t � r t t j | j � � } | | } q q Wn | S( N( R R Ro R t flattenRi ( Rc Re RS t numNames( ( s( /usr/lib64/python2.7/compiler/pyassem.pyRd = s c C s t | d � S( s/ Convert an int argument into high and low bytesi ( t divmod( t val( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� F s R� c B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( s( lnotab This class builds the lnotab, which is documented in compile.c. Here's a brief recap: For each SET_LINENO instruction after the first one, two bytes are added to lnotab. (In some cases, multiple two-byte entries are added.) The first byte is the distance in bytes between the instruction for the last SET_LINENO and the current SET_LINENO. The second byte is offset in line numbers. If either offset is greater than 255, multiple two-byte entries are added -- see compile.c for the delicate details. c C s: g | _ d | _ d | _ d | _ d | _ g | _ d S( Ni ( t codet codeOffsetR� t lastlinet lastoffR� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR Z s c G sA x$ | D] } | j j t | � � q W| j t | � | _ d S( N( R� R5 t chrR� R ( R Rc RS ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� b s c C s | j d k r$ | | _ | | _ n� | j | j } | | j } | d k r| j j } x. | d k r� | d � | d � | d 8} q\ Wx4 | d k r� | | � | d � | d 8} d } q� W| d k s� | d k r� | | � | | � n | | _ | j | _ n d S( Ni i� ( R� R� R� R� R� R5 ( R t linenot addrt linet push( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� g s* c C s d j | j � S( NR> ( RG R� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s c C s d j t t | j � � S( NR> ( RG RE R� R� ( R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s ( R- R. R� R R� R� R� R� ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� K s t StackDepthTrackerc B s� e Z d d � Z i& d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d! 6d d" 6d d# 6d d$ 6d d% 6d d& 6d d' 6d( d) 6d( d* 6d d+ 6d d, 6Z d; d< g Z d/ � Z d0 � Z d1 � Z d2 � Z d3 � Z d4 � Z d5 � Z d6 � Z d7 � Z d8 � Z d9 � Z d: � Z RS(= i c C s d } d } x| D]� } | d } | r0 | Gn | j j | d � } | d k r^ | | } n� xA | j D]6 \ } } | t | � | k rh | } | | } Pqh qh W| d k r� t | | d � } | d k r� | | | d � } q� n | | k r� | } n | r | G| GHq q W| S( Ni i ( t effectR� R t patternsR t getattr( R R? t debugR� t maxDepthRs R� t deltat patt pat_deltat meth( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � s. i����t POP_TOPi t DUP_TOPt LIST_APPENDt SET_ADDi����t MAP_ADDs SLICE+1s SLICE+2s SLICE+3s STORE_SLICE+0s STORE_SLICE+1s STORE_SLICE+2i����s STORE_SLICE+3s DELETE_SLICE+0s DELETE_SLICE+1s DELETE_SLICE+2s DELETE_SLICE+3t STORE_SUBSCRt DELETE_SUBSCRt PRINT_ITEMRK t YIELD_VALUEt EXEC_STMTt BUILD_CLASSt STORE_NAMEt STORE_ATTRt DELETE_ATTRt STORE_GLOBALt BUILD_MAPt COMPARE_OPt STORE_FASTt IMPORT_STARt IMPORT_NAMEt IMPORT_FROMt LOAD_ATTRi t SETUP_EXCEPTt SETUP_FINALLYt FOR_ITERt WITH_CLEANUPt BINARY_t LOAD_c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt UNPACK_SEQUENCE� s c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_TUPLE� s c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_LIST� s c C s | d S( Ni ( ( R R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_SET� s c C s" t | d � \ } } | | d S( Ni i ( R� ( R t argcR� R� ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION� s c C s | j | � d S( Ni ( R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION_VAR� s c C s | j | � d S( Ni ( R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION_KW� s c C s | j | � d S( Ni ( R ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt CALL_FUNCTION_VAR_KW� s c C s | S( N( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt MAKE_FUNCTION� s c C s | S( N( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt MAKE_CLOSURE� s c C s$ | d k r d S| d k r d Sd S( Ni i����i i����( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt BUILD_SLICE� s c C s | S( N( ( R R ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt DUP_TOPX� s ( R i����( R i ( R- R. R� R� R� R R R R R R R R R R R R ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyR� � sl ( R� R� R� R� t compilerR t compiler.constsR R R R R R$ R R[ R\ R] R^ RU R� Ro Rd R� R� R� R� ( ( ( s( /usr/lib64/python2.7/compiler/pyassem.pyt <module> s* "W CT� 2 BnPK s�ZLn&$ misc.pynu �[��� def flatten(tup): elts = [] for elt in tup: if isinstance(elt, tuple): elts = elts + flatten(elt) else: elts.append(elt) return elts class Set: def __init__(self): self.elts = {} def __len__(self): return len(self.elts) def __contains__(self, elt): return elt in self.elts def add(self, elt): self.elts[elt] = elt def elements(self): return self.elts.keys() def has_elt(self, elt): return elt in self.elts def remove(self, elt): del self.elts[elt] def copy(self): c = Set() c.elts.update(self.elts) return c class Stack: def __init__(self): self.stack = [] self.pop = self.stack.pop def __len__(self): return len(self.stack) def push(self, elt): self.stack.append(elt) def top(self): return self.stack[-1] def __getitem__(self, index): # needed by visitContinue() return self.stack[index] MANGLE_LEN = 256 # magic constant from compile.c def mangle(name, klass): if not name.startswith('__'): return name if len(name) + 2 >= MANGLE_LEN: return name if name.endswith('__'): return name try: i = 0 while klass[i] == '_': i = i + 1 except IndexError: return name klass = klass[i:] tlen = len(klass) + len(name) if tlen > MANGLE_LEN: klass = klass[:MANGLE_LEN-tlen] return "_%s%s" % (klass, name) def set_filename(filename, tree): """Set the filename attribute to filename on every node in tree""" worklist = [tree] while worklist: node = worklist.pop(0) node.filename = filename worklist.extend(node.getChildNodes()) PK s�Z�� � future.pycnu �[��� � { fc @ s� d Z d d l m Z m Z d � Z d d d � � YZ d d d � � YZ d � Z e d k r� d d l Z d d l m Z m Z xH e j d D]6 Z e GHe e � Z e � Z e e e � e j GHHq� Wn d S( s Parser for future statements i����( t astt walkc C s1 t | t j � s d S| j d k r) d Sd Sd S( s: Return true if statement is a well-formed future statementi t __future__i N( t isinstanceR t Fromt modname( t stmt( ( s' /usr/lib64/python2.7/compiler/future.pyt is_future s t FutureParserc B s2 e Z d Z d � Z d � Z d � Z d � Z RS( t nested_scopest generatorst divisiont absolute_importt with_statementt print_functiont unicode_literalsc C s i | _ d S( N( t found( t self( ( s' /usr/lib64/python2.7/compiler/future.pyt __init__ s c C s4 | j } x$ | j D] } | j | � s Pq q Wd S( N( t nodet nodest check_stmt( R R R t s( ( s' /usr/lib64/python2.7/compiler/future.pyt visitModule s c C sc t | � r_ xC | j D]8 \ } } | | j k rA d | j | <q t d | � q Wd | _ d Sd S( Ni s future feature %s is not definedi ( R t namest featuresR t SyntaxErrort valid_future( R R t namet asname( ( s' /usr/lib64/python2.7/compiler/future.pyR s c C s | j j � S( s4 Return list of features enabled by future statements( R t keys( R ( ( s' /usr/lib64/python2.7/compiler/future.pyt get_features+ s ( R R R R R R R ( t __name__t __module__R R R R R ( ( ( s' /usr/lib64/python2.7/compiler/future.pyR s t BadFutureParserc B s e Z d Z d � Z RS( s# Check for invalid future statementsc C s= t | d � r d S| j d k r& d St d t | � � d S( NR R s invalid future statement ( t hasattrR R t repr( R R ( ( s' /usr/lib64/python2.7/compiler/future.pyt visitFrom2 s ( R R! t __doc__R% ( ( ( s' /usr/lib64/python2.7/compiler/future.pyR" / s c C s6 t � } t � } t | | � t | | � | j � S( N( R R" R R ( R t p1t p2( ( s' /usr/lib64/python2.7/compiler/future.pyt find_futures9 s t __main__N( t parseFileR i ( ( ( R& t compilerR R R R R" R) R t sysR+ t argvt filet treet vR ( ( ( s' /usr/lib64/python2.7/compiler/future.pyt <module> s PK s�Z��R-[ [ visitor.pycnu �[��� � { fc @ s[ d d l m Z d d d � � YZ d e f d � � YZ e Z d d d � Z d � Z d S( i����( t astt ASTVisitorc B s8 e Z d Z d Z d � Z d � Z d � Z d � Z RS( s Performs a depth-first walk of the AST The ASTVisitor will walk the AST, performing either a preorder or postorder traversal depending on which method is called. methods: preorder(tree, visitor) postorder(tree, visitor) tree: an instance of ast.Node visitor: an instance with visitXXX methods The ASTVisitor is responsible for walking over the tree in the correct order. For each node, it checks the visitor argument for a method named 'visitNodeType' where NodeType is the name of the node's class, e.g. Class. If the method exists, it is called with the node as its sole argument. The visitor method for a particular node type can control how child nodes are visited during a preorder walk. (It can't control the order during a postorder walk, because it is called _after_ the walk has occurred.) The ASTVisitor modifies the visitor argument by adding a visit method to the visitor; this method can be used to visit a child node of arbitrary type. i c C s d | _ i | _ d S( N( t Nonet nodet _cache( t self( ( s( /usr/lib64/python2.7/compiler/visitor.pyt __init__" s c G s+ x$ | j � D] } | j | | � q Wd S( N( t getChildNodest dispatch( R R t argst child( ( s( /usr/lib64/python2.7/compiler/visitor.pyt default& s c G su | | _ | j } | j j | d � } | d k rh | j } t | j d | | j � } | | j | <n | | | � S( Nt visit( R t __class__R t getR t __name__t getattrt visitorR ( R R R t klasst metht className( ( s( /usr/lib64/python2.7/compiler/visitor.pyR * s c G s) | | _ | j | _ | j | | � d S( s& Do preorder walk of tree using visitorN( R R R ( R t treeR R ( ( s( /usr/lib64/python2.7/compiler/visitor.pyt preorder; s ( R t __module__t __doc__t VERBOSER R R R ( ( ( s( /usr/lib64/python2.7/compiler/visitor.pyR s t ExampleASTVisitorc B s e Z d Z i Z d � Z RS( s� Prints examples of the nodes that aren't visited This visitor-driver is only useful for development, when it's helpful to develop a visitor incrementally, and get feedback on what you still have to do. c G sG | | _ | j j | j d � } | j j } | d k re t | j d | d � } | | j | j <n | j d k r� d G| G| r� | j p� d GHn | r� | | | � n� | j d k rC| j } | | j k r3| | j | <H| j GH| GHxA t | � D]3 } | d d k r� d Gd | Gt | | � GHq� q� WHn | j | | � Sd S( NR i i R t t _s s %-12.12s( R R R R R R R R R t examplest dirR ( R R R R R R t attr( ( s( /usr/lib64/python2.7/compiler/visitor.pyR J s, !( R R R R R ( ( ( s( /usr/lib64/python2.7/compiler/visitor.pyR A s c C sG | d k r t � } n | d k r0 | | _ n | j | | � | j S( N( R t _walkerR R R ( R R t walkert verbose( ( s( /usr/lib64/python2.7/compiler/visitor.pyt walke s c C sP | j GHxA t | � D]3 } | d d k r d Gd | Gt | | � GHq q Wd S( Ni R s s %-10.10s( R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/visitor.pyt dumpNodem s N( ( t compilerR R R R R R# R$ ( ( ( s( /usr/lib64/python2.7/compiler/visitor.pyt <module> s ;#PK s�Z'O�� �� pycodegen.pynu �[��� import imp import os import marshal import struct import sys from cStringIO import StringIO from compiler import ast, parse, walk, syntax from compiler import pyassem, misc, future, symbols from compiler.consts import SC_LOCAL, SC_GLOBAL_IMPLICIT, SC_GLOBAL_EXPLICIT, \ SC_FREE, SC_CELL from compiler.consts import (CO_VARARGS, CO_VARKEYWORDS, CO_NEWLOCALS, CO_NESTED, CO_GENERATOR, CO_FUTURE_DIVISION, CO_FUTURE_ABSIMPORT, CO_FUTURE_WITH_STATEMENT, CO_FUTURE_PRINT_FUNCTION) from compiler.pyassem import TupleArg # XXX The version-specific code can go, since this code only works with 2.x. # Do we have Python 1.x or Python 2.x? try: VERSION = sys.version_info[0] except AttributeError: VERSION = 1 callfunc_opcode_info = { # (Have *args, Have **args) : opcode (0,0) : "CALL_FUNCTION", (1,0) : "CALL_FUNCTION_VAR", (0,1) : "CALL_FUNCTION_KW", (1,1) : "CALL_FUNCTION_VAR_KW", } LOOP = 1 EXCEPT = 2 TRY_FINALLY = 3 END_FINALLY = 4 def compileFile(filename, display=0): f = open(filename, 'U') buf = f.read() f.close() mod = Module(buf, filename) try: mod.compile(display) except SyntaxError: raise else: f = open(filename + "c", "wb") mod.dump(f) f.close() def compile(source, filename, mode, flags=None, dont_inherit=None): """Replacement for builtin compile() function""" if flags is not None or dont_inherit is not None: raise RuntimeError, "not implemented yet" if mode == "single": gen = Interactive(source, filename) elif mode == "exec": gen = Module(source, filename) elif mode == "eval": gen = Expression(source, filename) else: raise ValueError("compile() 3rd arg must be 'exec' or " "'eval' or 'single'") gen.compile() return gen.code class AbstractCompileMode: mode = None # defined by subclass def __init__(self, source, filename): self.source = source self.filename = filename self.code = None def _get_tree(self): tree = parse(self.source, self.mode) misc.set_filename(self.filename, tree) syntax.check(tree) return tree def compile(self): pass # implemented by subclass def getCode(self): return self.code class Expression(AbstractCompileMode): mode = "eval" def compile(self): tree = self._get_tree() gen = ExpressionCodeGenerator(tree) self.code = gen.getCode() class Interactive(AbstractCompileMode): mode = "single" def compile(self): tree = self._get_tree() gen = InteractiveCodeGenerator(tree) self.code = gen.getCode() class Module(AbstractCompileMode): mode = "exec" def compile(self, display=0): tree = self._get_tree() gen = ModuleCodeGenerator(tree) if display: import pprint print pprint.pprint(tree) self.code = gen.getCode() def dump(self, f): f.write(self.getPycHeader()) marshal.dump(self.code, f) MAGIC = imp.get_magic() def getPycHeader(self): # compile.c uses marshal to write a long directly, with # calling the interface that would also generate a 1-byte code # to indicate the type of the value. simplest way to get the # same effect is to call marshal and then skip the code. mtime = os.path.getmtime(self.filename) mtime = struct.pack('<i', mtime) return self.MAGIC + mtime class LocalNameFinder: """Find local names in scope""" def __init__(self, names=()): self.names = misc.Set() self.globals = misc.Set() for name in names: self.names.add(name) # XXX list comprehensions and for loops def getLocals(self): for elt in self.globals.elements(): if self.names.has_elt(elt): self.names.remove(elt) return self.names def visitDict(self, node): pass def visitGlobal(self, node): for name in node.names: self.globals.add(name) def visitFunction(self, node): self.names.add(node.name) def visitLambda(self, node): pass def visitImport(self, node): for name, alias in node.names: self.names.add(alias or name) def visitFrom(self, node): for name, alias in node.names: self.names.add(alias or name) def visitClass(self, node): self.names.add(node.name) def visitAssName(self, node): self.names.add(node.name) def is_constant_false(node): if isinstance(node, ast.Const): if not node.value: return 1 return 0 class CodeGenerator: """Defines basic code generator for Python bytecode This class is an abstract base class. Concrete subclasses must define an __init__() that defines self.graph and then calls the __init__() defined in this class. The concrete class must also define the class attributes NameFinder, FunctionGen, and ClassGen. These attributes can be defined in the initClass() method, which is a hook for initializing these methods after all the classes have been defined. """ optimized = 0 # is namespace access optimized? __initialized = None class_name = None # provide default for instance variable def __init__(self): if self.__initialized is None: self.initClass() self.__class__.__initialized = 1 self.checkClass() self.locals = misc.Stack() self.setups = misc.Stack() self.last_lineno = None self._setupGraphDelegation() self._div_op = "BINARY_DIVIDE" # XXX set flags based on future features futures = self.get_module().futures for feature in futures: if feature == "division": self.graph.setFlag(CO_FUTURE_DIVISION) self._div_op = "BINARY_TRUE_DIVIDE" elif feature == "absolute_import": self.graph.setFlag(CO_FUTURE_ABSIMPORT) elif feature == "with_statement": self.graph.setFlag(CO_FUTURE_WITH_STATEMENT) elif feature == "print_function": self.graph.setFlag(CO_FUTURE_PRINT_FUNCTION) def initClass(self): """This method is called once for each class""" def checkClass(self): """Verify that class is constructed correctly""" try: assert hasattr(self, 'graph') assert getattr(self, 'NameFinder') assert getattr(self, 'FunctionGen') assert getattr(self, 'ClassGen') except AssertionError, msg: intro = "Bad class construction for %s" % self.__class__.__name__ raise AssertionError, intro def _setupGraphDelegation(self): self.emit = self.graph.emit self.newBlock = self.graph.newBlock self.startBlock = self.graph.startBlock self.nextBlock = self.graph.nextBlock self.setDocstring = self.graph.setDocstring def getCode(self): """Return a code object""" return self.graph.getCode() def mangle(self, name): if self.class_name is not None: return misc.mangle(name, self.class_name) else: return name def parseSymbols(self, tree): s = symbols.SymbolVisitor() walk(tree, s) return s.scopes def get_module(self): raise RuntimeError, "should be implemented by subclasses" # Next five methods handle name access def isLocalName(self, name): return self.locals.top().has_elt(name) def storeName(self, name): self._nameOp('STORE', name) def loadName(self, name): self._nameOp('LOAD', name) def delName(self, name): self._nameOp('DELETE', name) def _nameOp(self, prefix, name): name = self.mangle(name) scope = self.scope.check_name(name) if scope == SC_LOCAL: if not self.optimized: self.emit(prefix + '_NAME', name) else: self.emit(prefix + '_FAST', name) elif scope == SC_GLOBAL_EXPLICIT: self.emit(prefix + '_GLOBAL', name) elif scope == SC_GLOBAL_IMPLICIT: if not self.optimized: self.emit(prefix + '_NAME', name) else: self.emit(prefix + '_GLOBAL', name) elif scope == SC_FREE or scope == SC_CELL: self.emit(prefix + '_DEREF', name) else: raise RuntimeError, "unsupported scope for var %s: %d" % \ (name, scope) def _implicitNameOp(self, prefix, name): """Emit name ops for names generated implicitly by for loops The interpreter generates names that start with a period or dollar sign. The symbol table ignores these names because they aren't present in the program text. """ if self.optimized: self.emit(prefix + '_FAST', name) else: self.emit(prefix + '_NAME', name) # The set_lineno() function and the explicit emit() calls for # SET_LINENO below are only used to generate the line number table. # As of Python 2.3, the interpreter does not have a SET_LINENO # instruction. pyassem treats SET_LINENO opcodes as a special case. def set_lineno(self, node, force=False): """Emit SET_LINENO if necessary. The instruction is considered necessary if the node has a lineno attribute and it is different than the last lineno emitted. Returns true if SET_LINENO was emitted. There are no rules for when an AST node should have a lineno attribute. The transformer and AST code need to be reviewed and a consistent policy implemented and documented. Until then, this method works around missing line numbers. """ lineno = getattr(node, 'lineno', None) if lineno is not None and (lineno != self.last_lineno or force): self.emit('SET_LINENO', lineno) self.last_lineno = lineno return True return False # The first few visitor methods handle nodes that generator new # code objects. They use class attributes to determine what # specialized code generators to use. NameFinder = LocalNameFinder FunctionGen = None ClassGen = None def visitModule(self, node): self.scopes = self.parseSymbols(node) self.scope = self.scopes[node] self.emit('SET_LINENO', 0) if node.doc: self.emit('LOAD_CONST', node.doc) self.storeName('__doc__') lnf = walk(node.node, self.NameFinder(), verbose=0) self.locals.push(lnf.getLocals()) self.visit(node.node) self.emit('LOAD_CONST', None) self.emit('RETURN_VALUE') def visitExpression(self, node): self.set_lineno(node) self.scopes = self.parseSymbols(node) self.scope = self.scopes[node] self.visit(node.node) self.emit('RETURN_VALUE') def visitFunction(self, node): self._visitFuncOrLambda(node, isLambda=0) if node.doc: self.setDocstring(node.doc) self.storeName(node.name) def visitLambda(self, node): self._visitFuncOrLambda(node, isLambda=1) def _visitFuncOrLambda(self, node, isLambda=0): if not isLambda and node.decorators: for decorator in node.decorators.nodes: self.visit(decorator) ndecorators = len(node.decorators.nodes) else: ndecorators = 0 gen = self.FunctionGen(node, self.scopes, isLambda, self.class_name, self.get_module()) walk(node.code, gen) gen.finish() self.set_lineno(node) for default in node.defaults: self.visit(default) self._makeClosure(gen, len(node.defaults)) for i in range(ndecorators): self.emit('CALL_FUNCTION', 1) def visitClass(self, node): gen = self.ClassGen(node, self.scopes, self.get_module()) walk(node.code, gen) gen.finish() self.set_lineno(node) self.emit('LOAD_CONST', node.name) for base in node.bases: self.visit(base) self.emit('BUILD_TUPLE', len(node.bases)) self._makeClosure(gen, 0) self.emit('CALL_FUNCTION', 0) self.emit('BUILD_CLASS') self.storeName(node.name) # The rest are standard visitor methods # The next few implement control-flow statements def visitIf(self, node): end = self.newBlock() numtests = len(node.tests) for i in range(numtests): test, suite = node.tests[i] if is_constant_false(test): # XXX will need to check generator stuff here continue self.set_lineno(test) self.visit(test) nextTest = self.newBlock() self.emit('POP_JUMP_IF_FALSE', nextTest) self.nextBlock() self.visit(suite) self.emit('JUMP_FORWARD', end) self.startBlock(nextTest) if node.else_: self.visit(node.else_) self.nextBlock(end) def visitWhile(self, node): self.set_lineno(node) loop = self.newBlock() else_ = self.newBlock() after = self.newBlock() self.emit('SETUP_LOOP', after) self.nextBlock(loop) self.setups.push((LOOP, loop)) self.set_lineno(node, force=True) self.visit(node.test) self.emit('POP_JUMP_IF_FALSE', else_ or after) self.nextBlock() self.visit(node.body) self.emit('JUMP_ABSOLUTE', loop) self.startBlock(else_) # or just the POPs if not else clause self.emit('POP_BLOCK') self.setups.pop() if node.else_: self.visit(node.else_) self.nextBlock(after) def visitFor(self, node): start = self.newBlock() anchor = self.newBlock() after = self.newBlock() self.setups.push((LOOP, start)) self.set_lineno(node) self.emit('SETUP_LOOP', after) self.visit(node.list) self.emit('GET_ITER') self.nextBlock(start) self.set_lineno(node, force=1) self.emit('FOR_ITER', anchor) self.visit(node.assign) self.visit(node.body) self.emit('JUMP_ABSOLUTE', start) self.nextBlock(anchor) self.emit('POP_BLOCK') self.setups.pop() if node.else_: self.visit(node.else_) self.nextBlock(after) def visitBreak(self, node): if not self.setups: raise SyntaxError, "'break' outside loop (%s, %d)" % \ (node.filename, node.lineno) self.set_lineno(node) self.emit('BREAK_LOOP') def visitContinue(self, node): if not self.setups: raise SyntaxError, "'continue' outside loop (%s, %d)" % \ (node.filename, node.lineno) kind, block = self.setups.top() if kind == LOOP: self.set_lineno(node) self.emit('JUMP_ABSOLUTE', block) self.nextBlock() elif kind == EXCEPT or kind == TRY_FINALLY: self.set_lineno(node) # find the block that starts the loop top = len(self.setups) while top > 0: top = top - 1 kind, loop_block = self.setups[top] if kind == LOOP: break if kind != LOOP: raise SyntaxError, "'continue' outside loop (%s, %d)" % \ (node.filename, node.lineno) self.emit('CONTINUE_LOOP', loop_block) self.nextBlock() elif kind == END_FINALLY: msg = "'continue' not allowed inside 'finally' clause (%s, %d)" raise SyntaxError, msg % (node.filename, node.lineno) def visitTest(self, node, jump): end = self.newBlock() for child in node.nodes[:-1]: self.visit(child) self.emit(jump, end) self.nextBlock() self.visit(node.nodes[-1]) self.nextBlock(end) def visitAnd(self, node): self.visitTest(node, 'JUMP_IF_FALSE_OR_POP') def visitOr(self, node): self.visitTest(node, 'JUMP_IF_TRUE_OR_POP') def visitIfExp(self, node): endblock = self.newBlock() elseblock = self.newBlock() self.visit(node.test) self.emit('POP_JUMP_IF_FALSE', elseblock) self.visit(node.then) self.emit('JUMP_FORWARD', endblock) self.nextBlock(elseblock) self.visit(node.else_) self.nextBlock(endblock) def visitCompare(self, node): self.visit(node.expr) cleanup = self.newBlock() for op, code in node.ops[:-1]: self.visit(code) self.emit('DUP_TOP') self.emit('ROT_THREE') self.emit('COMPARE_OP', op) self.emit('JUMP_IF_FALSE_OR_POP', cleanup) self.nextBlock() # now do the last comparison if node.ops: op, code = node.ops[-1] self.visit(code) self.emit('COMPARE_OP', op) if len(node.ops) > 1: end = self.newBlock() self.emit('JUMP_FORWARD', end) self.startBlock(cleanup) self.emit('ROT_TWO') self.emit('POP_TOP') self.nextBlock(end) # list comprehensions def visitListComp(self, node): self.set_lineno(node) # setup list self.emit('BUILD_LIST', 0) stack = [] for i, for_ in zip(range(len(node.quals)), node.quals): start, anchor = self.visit(for_) cont = None for if_ in for_.ifs: if cont is None: cont = self.newBlock() self.visit(if_, cont) stack.insert(0, (start, cont, anchor)) self.visit(node.expr) self.emit('LIST_APPEND', len(node.quals) + 1) for start, cont, anchor in stack: if cont: self.nextBlock(cont) self.emit('JUMP_ABSOLUTE', start) self.startBlock(anchor) def visitSetComp(self, node): self.set_lineno(node) # setup list self.emit('BUILD_SET', 0) stack = [] for i, for_ in zip(range(len(node.quals)), node.quals): start, anchor = self.visit(for_) cont = None for if_ in for_.ifs: if cont is None: cont = self.newBlock() self.visit(if_, cont) stack.insert(0, (start, cont, anchor)) self.visit(node.expr) self.emit('SET_ADD', len(node.quals) + 1) for start, cont, anchor in stack: if cont: self.nextBlock(cont) self.emit('JUMP_ABSOLUTE', start) self.startBlock(anchor) def visitDictComp(self, node): self.set_lineno(node) # setup list self.emit('BUILD_MAP', 0) stack = [] for i, for_ in zip(range(len(node.quals)), node.quals): start, anchor = self.visit(for_) cont = None for if_ in for_.ifs: if cont is None: cont = self.newBlock() self.visit(if_, cont) stack.insert(0, (start, cont, anchor)) self.visit(node.value) self.visit(node.key) self.emit('MAP_ADD', len(node.quals) + 1) for start, cont, anchor in stack: if cont: self.nextBlock(cont) self.emit('JUMP_ABSOLUTE', start) self.startBlock(anchor) def visitListCompFor(self, node): start = self.newBlock() anchor = self.newBlock() self.visit(node.list) self.emit('GET_ITER') self.nextBlock(start) self.set_lineno(node, force=True) self.emit('FOR_ITER', anchor) self.nextBlock() self.visit(node.assign) return start, anchor def visitListCompIf(self, node, branch): self.set_lineno(node, force=True) self.visit(node.test) self.emit('POP_JUMP_IF_FALSE', branch) self.newBlock() def _makeClosure(self, gen, args): frees = gen.scope.get_free_vars() if frees: for name in frees: self.emit('LOAD_CLOSURE', name) self.emit('BUILD_TUPLE', len(frees)) self.emit('LOAD_CONST', gen) self.emit('MAKE_CLOSURE', args) else: self.emit('LOAD_CONST', gen) self.emit('MAKE_FUNCTION', args) def visitGenExpr(self, node): gen = GenExprCodeGenerator(node, self.scopes, self.class_name, self.get_module()) walk(node.code, gen) gen.finish() self.set_lineno(node) self._makeClosure(gen, 0) # precomputation of outmost iterable self.visit(node.code.quals[0].iter) self.emit('GET_ITER') self.emit('CALL_FUNCTION', 1) def visitGenExprInner(self, node): self.set_lineno(node) # setup list stack = [] for i, for_ in zip(range(len(node.quals)), node.quals): start, anchor, end = self.visit(for_) cont = None for if_ in for_.ifs: if cont is None: cont = self.newBlock() self.visit(if_, cont) stack.insert(0, (start, cont, anchor, end)) self.visit(node.expr) self.emit('YIELD_VALUE') self.emit('POP_TOP') for start, cont, anchor, end in stack: if cont: self.nextBlock(cont) self.emit('JUMP_ABSOLUTE', start) self.startBlock(anchor) self.emit('POP_BLOCK') self.setups.pop() self.nextBlock(end) self.emit('LOAD_CONST', None) def visitGenExprFor(self, node): start = self.newBlock() anchor = self.newBlock() end = self.newBlock() self.setups.push((LOOP, start)) self.emit('SETUP_LOOP', end) if node.is_outmost: self.loadName('.0') else: self.visit(node.iter) self.emit('GET_ITER') self.nextBlock(start) self.set_lineno(node, force=True) self.emit('FOR_ITER', anchor) self.nextBlock() self.visit(node.assign) return start, anchor, end def visitGenExprIf(self, node, branch): self.set_lineno(node, force=True) self.visit(node.test) self.emit('POP_JUMP_IF_FALSE', branch) self.newBlock() # exception related def visitAssert(self, node): # XXX would be interesting to implement this via a # transformation of the AST before this stage if __debug__: end = self.newBlock() self.set_lineno(node) # XXX AssertionError appears to be special case -- it is always # loaded as a global even if there is a local name. I guess this # is a sort of renaming op. self.nextBlock() self.visit(node.test) self.emit('POP_JUMP_IF_TRUE', end) self.nextBlock() self.emit('LOAD_GLOBAL', 'AssertionError') if node.fail: self.visit(node.fail) self.emit('RAISE_VARARGS', 2) else: self.emit('RAISE_VARARGS', 1) self.nextBlock(end) def visitRaise(self, node): self.set_lineno(node) n = 0 if node.expr1: self.visit(node.expr1) n = n + 1 if node.expr2: self.visit(node.expr2) n = n + 1 if node.expr3: self.visit(node.expr3) n = n + 1 self.emit('RAISE_VARARGS', n) def visitTryExcept(self, node): body = self.newBlock() handlers = self.newBlock() end = self.newBlock() if node.else_: lElse = self.newBlock() else: lElse = end self.set_lineno(node) self.emit('SETUP_EXCEPT', handlers) self.nextBlock(body) self.setups.push((EXCEPT, body)) self.visit(node.body) self.emit('POP_BLOCK') self.setups.pop() self.emit('JUMP_FORWARD', lElse) self.startBlock(handlers) last = len(node.handlers) - 1 for i in range(len(node.handlers)): expr, target, body = node.handlers[i] self.set_lineno(expr) if expr: self.emit('DUP_TOP') self.visit(expr) self.emit('COMPARE_OP', 'exception match') next = self.newBlock() self.emit('POP_JUMP_IF_FALSE', next) self.nextBlock() self.emit('POP_TOP') if target: self.visit(target) else: self.emit('POP_TOP') self.emit('POP_TOP') self.visit(body) self.emit('JUMP_FORWARD', end) if expr: self.nextBlock(next) else: self.nextBlock() self.emit('END_FINALLY') if node.else_: self.nextBlock(lElse) self.visit(node.else_) self.nextBlock(end) def visitTryFinally(self, node): body = self.newBlock() final = self.newBlock() self.set_lineno(node) self.emit('SETUP_FINALLY', final) self.nextBlock(body) self.setups.push((TRY_FINALLY, body)) self.visit(node.body) self.emit('POP_BLOCK') self.setups.pop() self.emit('LOAD_CONST', None) self.nextBlock(final) self.setups.push((END_FINALLY, final)) self.visit(node.final) self.emit('END_FINALLY') self.setups.pop() __with_count = 0 def visitWith(self, node): body = self.newBlock() final = self.newBlock() self.__with_count += 1 valuevar = "_[%d]" % self.__with_count self.set_lineno(node) self.visit(node.expr) self.emit('DUP_TOP') self.emit('LOAD_ATTR', '__exit__') self.emit('ROT_TWO') self.emit('LOAD_ATTR', '__enter__') self.emit('CALL_FUNCTION', 0) if node.vars is None: self.emit('POP_TOP') else: self._implicitNameOp('STORE', valuevar) self.emit('SETUP_FINALLY', final) self.nextBlock(body) self.setups.push((TRY_FINALLY, body)) if node.vars is not None: self._implicitNameOp('LOAD', valuevar) self._implicitNameOp('DELETE', valuevar) self.visit(node.vars) self.visit(node.body) self.emit('POP_BLOCK') self.setups.pop() self.emit('LOAD_CONST', None) self.nextBlock(final) self.setups.push((END_FINALLY, final)) self.emit('WITH_CLEANUP') self.emit('END_FINALLY') self.setups.pop() self.__with_count -= 1 # misc def visitDiscard(self, node): self.set_lineno(node) self.visit(node.expr) self.emit('POP_TOP') def visitConst(self, node): self.emit('LOAD_CONST', node.value) def visitKeyword(self, node): self.emit('LOAD_CONST', node.name) self.visit(node.expr) def visitGlobal(self, node): # no code to generate pass def visitName(self, node): self.set_lineno(node) self.loadName(node.name) def visitPass(self, node): self.set_lineno(node) def visitImport(self, node): self.set_lineno(node) level = 0 if self.graph.checkFlag(CO_FUTURE_ABSIMPORT) else -1 for name, alias in node.names: if VERSION > 1: self.emit('LOAD_CONST', level) self.emit('LOAD_CONST', None) self.emit('IMPORT_NAME', name) mod = name.split(".")[0] if alias: self._resolveDots(name) self.storeName(alias) else: self.storeName(mod) def visitFrom(self, node): self.set_lineno(node) level = node.level if level == 0 and not self.graph.checkFlag(CO_FUTURE_ABSIMPORT): level = -1 fromlist = tuple(name for (name, alias) in node.names) if VERSION > 1: self.emit('LOAD_CONST', level) self.emit('LOAD_CONST', fromlist) self.emit('IMPORT_NAME', node.modname) for name, alias in node.names: if VERSION > 1: if name == '*': self.namespace = 0 self.emit('IMPORT_STAR') # There can only be one name w/ from ... import * assert len(node.names) == 1 return else: self.emit('IMPORT_FROM', name) self._resolveDots(name) self.storeName(alias or name) else: self.emit('IMPORT_FROM', name) self.emit('POP_TOP') def _resolveDots(self, name): elts = name.split(".") if len(elts) == 1: return for elt in elts[1:]: self.emit('LOAD_ATTR', elt) def visitGetattr(self, node): self.visit(node.expr) self.emit('LOAD_ATTR', self.mangle(node.attrname)) # next five implement assignments def visitAssign(self, node): self.set_lineno(node) self.visit(node.expr) dups = len(node.nodes) - 1 for i in range(len(node.nodes)): elt = node.nodes[i] if i < dups: self.emit('DUP_TOP') if isinstance(elt, ast.Node): self.visit(elt) def visitAssName(self, node): if node.flags == 'OP_ASSIGN': self.storeName(node.name) elif node.flags == 'OP_DELETE': self.set_lineno(node) self.delName(node.name) else: print "oops", node.flags def visitAssAttr(self, node): self.visit(node.expr) if node.flags == 'OP_ASSIGN': self.emit('STORE_ATTR', self.mangle(node.attrname)) elif node.flags == 'OP_DELETE': self.emit('DELETE_ATTR', self.mangle(node.attrname)) else: print "warning: unexpected flags:", node.flags print node def _visitAssSequence(self, node, op='UNPACK_SEQUENCE'): if findOp(node) != 'OP_DELETE': self.emit(op, len(node.nodes)) for child in node.nodes: self.visit(child) if VERSION > 1: visitAssTuple = _visitAssSequence visitAssList = _visitAssSequence else: def visitAssTuple(self, node): self._visitAssSequence(node, 'UNPACK_TUPLE') def visitAssList(self, node): self._visitAssSequence(node, 'UNPACK_LIST') # augmented assignment def visitAugAssign(self, node): self.set_lineno(node) aug_node = wrap_aug(node.node) self.visit(aug_node, "load") self.visit(node.expr) self.emit(self._augmented_opcode[node.op]) self.visit(aug_node, "store") _augmented_opcode = { '+=' : 'INPLACE_ADD', '-=' : 'INPLACE_SUBTRACT', '*=' : 'INPLACE_MULTIPLY', '/=' : 'INPLACE_DIVIDE', '//=': 'INPLACE_FLOOR_DIVIDE', '%=' : 'INPLACE_MODULO', '**=': 'INPLACE_POWER', '>>=': 'INPLACE_RSHIFT', '<<=': 'INPLACE_LSHIFT', '&=' : 'INPLACE_AND', '^=' : 'INPLACE_XOR', '|=' : 'INPLACE_OR', } def visitAugName(self, node, mode): if mode == "load": self.loadName(node.name) elif mode == "store": self.storeName(node.name) def visitAugGetattr(self, node, mode): if mode == "load": self.visit(node.expr) self.emit('DUP_TOP') self.emit('LOAD_ATTR', self.mangle(node.attrname)) elif mode == "store": self.emit('ROT_TWO') self.emit('STORE_ATTR', self.mangle(node.attrname)) def visitAugSlice(self, node, mode): if mode == "load": self.visitSlice(node, 1) elif mode == "store": slice = 0 if node.lower: slice = slice | 1 if node.upper: slice = slice | 2 if slice == 0: self.emit('ROT_TWO') elif slice == 3: self.emit('ROT_FOUR') else: self.emit('ROT_THREE') self.emit('STORE_SLICE+%d' % slice) def visitAugSubscript(self, node, mode): if mode == "load": self.visitSubscript(node, 1) elif mode == "store": self.emit('ROT_THREE') self.emit('STORE_SUBSCR') def visitExec(self, node): self.visit(node.expr) if node.locals is None: self.emit('LOAD_CONST', None) else: self.visit(node.locals) if node.globals is None: self.emit('DUP_TOP') else: self.visit(node.globals) self.emit('EXEC_STMT') def visitCallFunc(self, node): pos = 0 kw = 0 self.set_lineno(node) self.visit(node.node) for arg in node.args: self.visit(arg) if isinstance(arg, ast.Keyword): kw = kw + 1 else: pos = pos + 1 if node.star_args is not None: self.visit(node.star_args) if node.dstar_args is not None: self.visit(node.dstar_args) have_star = node.star_args is not None have_dstar = node.dstar_args is not None opcode = callfunc_opcode_info[have_star, have_dstar] self.emit(opcode, kw << 8 | pos) def visitPrint(self, node, newline=0): self.set_lineno(node) if node.dest: self.visit(node.dest) for child in node.nodes: if node.dest: self.emit('DUP_TOP') self.visit(child) if node.dest: self.emit('ROT_TWO') self.emit('PRINT_ITEM_TO') else: self.emit('PRINT_ITEM') if node.dest and not newline: self.emit('POP_TOP') def visitPrintnl(self, node): self.visitPrint(node, newline=1) if node.dest: self.emit('PRINT_NEWLINE_TO') else: self.emit('PRINT_NEWLINE') def visitReturn(self, node): self.set_lineno(node) self.visit(node.value) self.emit('RETURN_VALUE') def visitYield(self, node): self.set_lineno(node) self.visit(node.value) self.emit('YIELD_VALUE') # slice and subscript stuff def visitSlice(self, node, aug_flag=None): # aug_flag is used by visitAugSlice self.visit(node.expr) slice = 0 if node.lower: self.visit(node.lower) slice = slice | 1 if node.upper: self.visit(node.upper) slice = slice | 2 if aug_flag: if slice == 0: self.emit('DUP_TOP') elif slice == 3: self.emit('DUP_TOPX', 3) else: self.emit('DUP_TOPX', 2) if node.flags == 'OP_APPLY': self.emit('SLICE+%d' % slice) elif node.flags == 'OP_ASSIGN': self.emit('STORE_SLICE+%d' % slice) elif node.flags == 'OP_DELETE': self.emit('DELETE_SLICE+%d' % slice) else: print "weird slice", node.flags raise def visitSubscript(self, node, aug_flag=None): self.visit(node.expr) for sub in node.subs: self.visit(sub) if len(node.subs) > 1: self.emit('BUILD_TUPLE', len(node.subs)) if aug_flag: self.emit('DUP_TOPX', 2) if node.flags == 'OP_APPLY': self.emit('BINARY_SUBSCR') elif node.flags == 'OP_ASSIGN': self.emit('STORE_SUBSCR') elif node.flags == 'OP_DELETE': self.emit('DELETE_SUBSCR') # binary ops def binaryOp(self, node, op): self.visit(node.left) self.visit(node.right) self.emit(op) def visitAdd(self, node): return self.binaryOp(node, 'BINARY_ADD') def visitSub(self, node): return self.binaryOp(node, 'BINARY_SUBTRACT') def visitMul(self, node): return self.binaryOp(node, 'BINARY_MULTIPLY') def visitDiv(self, node): return self.binaryOp(node, self._div_op) def visitFloorDiv(self, node): return self.binaryOp(node, 'BINARY_FLOOR_DIVIDE') def visitMod(self, node): return self.binaryOp(node, 'BINARY_MODULO') def visitPower(self, node): return self.binaryOp(node, 'BINARY_POWER') def visitLeftShift(self, node): return self.binaryOp(node, 'BINARY_LSHIFT') def visitRightShift(self, node): return self.binaryOp(node, 'BINARY_RSHIFT') # unary ops def unaryOp(self, node, op): self.visit(node.expr) self.emit(op) def visitInvert(self, node): return self.unaryOp(node, 'UNARY_INVERT') def visitUnarySub(self, node): return self.unaryOp(node, 'UNARY_NEGATIVE') def visitUnaryAdd(self, node): return self.unaryOp(node, 'UNARY_POSITIVE') def visitUnaryInvert(self, node): return self.unaryOp(node, 'UNARY_INVERT') def visitNot(self, node): return self.unaryOp(node, 'UNARY_NOT') def visitBackquote(self, node): return self.unaryOp(node, 'UNARY_CONVERT') # bit ops def bitOp(self, nodes, op): self.visit(nodes[0]) for node in nodes[1:]: self.visit(node) self.emit(op) def visitBitand(self, node): return self.bitOp(node.nodes, 'BINARY_AND') def visitBitor(self, node): return self.bitOp(node.nodes, 'BINARY_OR') def visitBitxor(self, node): return self.bitOp(node.nodes, 'BINARY_XOR') # object constructors def visitEllipsis(self, node): self.emit('LOAD_CONST', Ellipsis) def visitTuple(self, node): self.set_lineno(node) for elt in node.nodes: self.visit(elt) self.emit('BUILD_TUPLE', len(node.nodes)) def visitList(self, node): self.set_lineno(node) for elt in node.nodes: self.visit(elt) self.emit('BUILD_LIST', len(node.nodes)) def visitSet(self, node): self.set_lineno(node) for elt in node.nodes: self.visit(elt) self.emit('BUILD_SET', len(node.nodes)) def visitSliceobj(self, node): for child in node.nodes: self.visit(child) self.emit('BUILD_SLICE', len(node.nodes)) def visitDict(self, node): self.set_lineno(node) self.emit('BUILD_MAP', 0) for k, v in node.items: self.emit('DUP_TOP') self.visit(k) self.visit(v) self.emit('ROT_THREE') self.emit('STORE_SUBSCR') class NestedScopeMixin: """Defines initClass() for nested scoping (Python 2.2-compatible)""" def initClass(self): self.__class__.NameFinder = LocalNameFinder self.__class__.FunctionGen = FunctionCodeGenerator self.__class__.ClassGen = ClassCodeGenerator class ModuleCodeGenerator(NestedScopeMixin, CodeGenerator): __super_init = CodeGenerator.__init__ scopes = None def __init__(self, tree): self.graph = pyassem.PyFlowGraph("<module>", tree.filename) self.futures = future.find_futures(tree) self.__super_init() walk(tree, self) def get_module(self): return self class ExpressionCodeGenerator(NestedScopeMixin, CodeGenerator): __super_init = CodeGenerator.__init__ scopes = None futures = () def __init__(self, tree): self.graph = pyassem.PyFlowGraph("<expression>", tree.filename) self.__super_init() walk(tree, self) def get_module(self): return self class InteractiveCodeGenerator(NestedScopeMixin, CodeGenerator): __super_init = CodeGenerator.__init__ scopes = None futures = () def __init__(self, tree): self.graph = pyassem.PyFlowGraph("<interactive>", tree.filename) self.__super_init() self.set_lineno(tree) walk(tree, self) self.emit('RETURN_VALUE') def get_module(self): return self def visitDiscard(self, node): # XXX Discard means it's an expression. Perhaps this is a bad # name. self.visit(node.expr) self.emit('PRINT_EXPR') class AbstractFunctionCode: optimized = 1 lambdaCount = 0 def __init__(self, func, scopes, isLambda, class_name, mod): self.class_name = class_name self.module = mod if isLambda: klass = FunctionCodeGenerator name = "<lambda.%d>" % klass.lambdaCount klass.lambdaCount = klass.lambdaCount + 1 else: name = func.name args, hasTupleArg = generateArgList(func.argnames) self.graph = pyassem.PyFlowGraph(name, func.filename, args, optimized=1) self.isLambda = isLambda self.super_init() if not isLambda and func.doc: self.setDocstring(func.doc) lnf = walk(func.code, self.NameFinder(args), verbose=0) self.locals.push(lnf.getLocals()) if func.varargs: self.graph.setFlag(CO_VARARGS) if func.kwargs: self.graph.setFlag(CO_VARKEYWORDS) self.set_lineno(func) if hasTupleArg: self.generateArgUnpack(func.argnames) def get_module(self): return self.module def finish(self): self.graph.startExitBlock() if not self.isLambda: self.emit('LOAD_CONST', None) self.emit('RETURN_VALUE') def generateArgUnpack(self, args): for i in range(len(args)): arg = args[i] if isinstance(arg, tuple): self.emit('LOAD_FAST', '.%d' % (i * 2)) self.unpackSequence(arg) def unpackSequence(self, tup): if VERSION > 1: self.emit('UNPACK_SEQUENCE', len(tup)) else: self.emit('UNPACK_TUPLE', len(tup)) for elt in tup: if isinstance(elt, tuple): self.unpackSequence(elt) else: self._nameOp('STORE', elt) unpackTuple = unpackSequence class FunctionCodeGenerator(NestedScopeMixin, AbstractFunctionCode, CodeGenerator): super_init = CodeGenerator.__init__ # call be other init scopes = None __super_init = AbstractFunctionCode.__init__ def __init__(self, func, scopes, isLambda, class_name, mod): self.scopes = scopes self.scope = scopes[func] self.__super_init(func, scopes, isLambda, class_name, mod) self.graph.setFreeVars(self.scope.get_free_vars()) self.graph.setCellVars(self.scope.get_cell_vars()) if self.scope.generator is not None: self.graph.setFlag(CO_GENERATOR) class GenExprCodeGenerator(NestedScopeMixin, AbstractFunctionCode, CodeGenerator): super_init = CodeGenerator.__init__ # call be other init scopes = None __super_init = AbstractFunctionCode.__init__ def __init__(self, gexp, scopes, class_name, mod): self.scopes = scopes self.scope = scopes[gexp] self.__super_init(gexp, scopes, 1, class_name, mod) self.graph.setFreeVars(self.scope.get_free_vars()) self.graph.setCellVars(self.scope.get_cell_vars()) self.graph.setFlag(CO_GENERATOR) class AbstractClassCode: def __init__(self, klass, scopes, module): self.class_name = klass.name self.module = module self.graph = pyassem.PyFlowGraph(klass.name, klass.filename, optimized=0, klass=1) self.super_init() lnf = walk(klass.code, self.NameFinder(), verbose=0) self.locals.push(lnf.getLocals()) self.graph.setFlag(CO_NEWLOCALS) if klass.doc: self.setDocstring(klass.doc) def get_module(self): return self.module def finish(self): self.graph.startExitBlock() self.emit('LOAD_LOCALS') self.emit('RETURN_VALUE') class ClassCodeGenerator(NestedScopeMixin, AbstractClassCode, CodeGenerator): super_init = CodeGenerator.__init__ scopes = None __super_init = AbstractClassCode.__init__ def __init__(self, klass, scopes, module): self.scopes = scopes self.scope = scopes[klass] self.__super_init(klass, scopes, module) self.graph.setFreeVars(self.scope.get_free_vars()) self.graph.setCellVars(self.scope.get_cell_vars()) self.set_lineno(klass) self.emit("LOAD_GLOBAL", "__name__") self.storeName("__module__") if klass.doc: self.emit("LOAD_CONST", klass.doc) self.storeName('__doc__') def generateArgList(arglist): """Generate an arg list marking TupleArgs""" args = [] extra = [] count = 0 for i in range(len(arglist)): elt = arglist[i] if isinstance(elt, str): args.append(elt) elif isinstance(elt, tuple): args.append(TupleArg(i * 2, elt)) extra.extend(misc.flatten(elt)) count = count + 1 else: raise ValueError, "unexpect argument type:", elt return args + extra, count def findOp(node): """Find the op (DELETE, LOAD, STORE) in an AssTuple tree""" v = OpFinder() walk(node, v, verbose=0) return v.op class OpFinder: def __init__(self): self.op = None def visitAssName(self, node): if self.op is None: self.op = node.flags elif self.op != node.flags: raise ValueError, "mixed ops in stmt" visitAssAttr = visitAssName visitSubscript = visitAssName class Delegator: """Base class to support delegation for augmented assignment nodes To generator code for augmented assignments, we use the following wrapper classes. In visitAugAssign, the left-hand expression node is visited twice. The first time the visit uses the normal method for that node . The second time the visit uses a different method that generates the appropriate code to perform the assignment. These delegator classes wrap the original AST nodes in order to support the variant visit methods. """ def __init__(self, obj): self.obj = obj def __getattr__(self, attr): return getattr(self.obj, attr) class AugGetattr(Delegator): pass class AugName(Delegator): pass class AugSlice(Delegator): pass class AugSubscript(Delegator): pass wrapper = { ast.Getattr: AugGetattr, ast.Name: AugName, ast.Slice: AugSlice, ast.Subscript: AugSubscript, } def wrap_aug(node): return wrapper[node.__class__](node) if __name__ == "__main__": for file in sys.argv[1:]: compileFile(file) PK s�Z2�e e future.pynu �[��� """Parser for future statements """ from compiler import ast, walk def is_future(stmt): """Return true if statement is a well-formed future statement""" if not isinstance(stmt, ast.From): return 0 if stmt.modname == "__future__": return 1 else: return 0 class FutureParser: features = ("nested_scopes", "generators", "division", "absolute_import", "with_statement", "print_function", "unicode_literals") def __init__(self): self.found = {} # set def visitModule(self, node): stmt = node.node for s in stmt.nodes: if not self.check_stmt(s): break def check_stmt(self, stmt): if is_future(stmt): for name, asname in stmt.names: if name in self.features: self.found[name] = 1 else: raise SyntaxError, \ "future feature %s is not defined" % name stmt.valid_future = 1 return 1 return 0 def get_features(self): """Return list of features enabled by future statements""" return self.found.keys() class BadFutureParser: """Check for invalid future statements""" def visitFrom(self, node): if hasattr(node, 'valid_future'): return if node.modname != "__future__": return raise SyntaxError, "invalid future statement " + repr(node) def find_futures(node): p1 = FutureParser() p2 = BadFutureParser() walk(node, p1) walk(node, p2) return p1.get_features() if __name__ == "__main__": import sys from compiler import parseFile, walk for file in sys.argv[1:]: print file tree = parseFile(file) v = FutureParser() walk(tree, v) print v.found print PK s�Z��S�Z Z syntax.pyonu �[��� � { fc @ s? d Z d d l m Z m Z d d � Z d d d � � YZ d S( s8 Check for errs in the AST. The Python parser does not catch all syntax errors. Others, like assignments with invalid targets, are caught in the code generation phase. The compiler package catches some errors in the transformer module. But it seems clearer to write checkers that use the AST to detect errors. i����( t astt walkc C s t | � } t | | � | j S( N( t SyntaxErrorCheckerR t errors( t treet multit v( ( s' /usr/lib64/python2.7/compiler/syntax.pyt check s R c B s, e Z d Z d d � Z d � Z d � Z RS( s+ A visitor to find syntax errors in the AST.c C s | | _ d | _ d S( s� Create new visitor object. If optional argument multi is not None, then print messages for each error rather than raising a SyntaxError for the first. i N( R R ( t selfR ( ( s' /usr/lib64/python2.7/compiler/syntax.pyt __init__ s c C sZ | j d | _ | j d k r: d | j | j | f GHn t d | | j | j f � d S( Ni s %s:%s: %ss %s (%s:%s)( R R t Nonet filenamet linenot SyntaxError( R t nodet msg( ( s' /usr/lib64/python2.7/compiler/syntax.pyt error s c C s d S( N( ( R R ( ( s' /usr/lib64/python2.7/compiler/syntax.pyt visitAssign' s N( t __name__t __module__t __doc__R R R R ( ( ( s' /usr/lib64/python2.7/compiler/syntax.pyR s N( ( R t compilerR R R R R ( ( ( s' /usr/lib64/python2.7/compiler/syntax.pyt <module> s PK s�Z~TE# __init__.pyonu �[��� � { fc @ sh d Z d d l Z e j d e d d �d d l m Z m Z d d l m Z d d l m Z m Z d S( s� Package for parsing and compiling Python source code There are several functions defined at the top level that are imported from modules contained in the package. parse(buf, mode="exec") -> AST Converts a string containing Python source code to an abstract syntax tree (AST). The AST is defined in compiler.ast. parseFile(path) -> AST The same as parse(open(path)) walk(ast, visitor, verbose=None) Does a pre-order walk over the ast using the visitor instance. See compiler.visitor for details. compile(source, filename, mode, flags=None, dont_inherit=None) Returns a code object. A replacement for the builtin compile() function. compileFile(filename) Generates a .pyc file by compiling filename. i����Ns= The compiler package is deprecated and removed in Python 3.x.t stackleveli ( t parset parseFile( t walk( t compilet compileFile( t __doc__t warningst warnt DeprecationWarningt compiler.transformerR R t compiler.visitorR t compiler.pycodegenR R ( ( ( s) /usr/lib64/python2.7/compiler/__init__.pyt <module> s PK s�Z�4�� � pycodegen.pyonu �[��� � { fc @ s� d d l Z d d l Z d d l Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z m Z d d l m Z m Z m Z m Z d d l m Z m Z m Z m Z m Z d d l m Z m Z m Z m Z m Z m Z m Z m Z m Z d d l m Z y e j! d Z" Wn e# k r2d Z" n Xi d d d f 6d d d f 6d d d f 6d d d f 6Z$ d Z% d Z& d Z' d Z( d d � Z) e* e* d � Z+ d f d � � YZ, d e, f d � � YZ- d e, f d � � YZ. d e, f d � � YZ/ d f d � � YZ0 d � Z1 d f d � � YZ2 d f d! � � YZ3 d" e3 e2 f d# � � YZ4 d$ e3 e2 f d% � � YZ5 d& e3 e2 f d' � � YZ6 d( f d) � � YZ7 d* e3 e7 e2 f d+ � � YZ8 d, e3 e7 e2 f d- � � YZ9 d. f d/ � � YZ: d0 e3 e: e2 f d1 � � YZ; d2 � Z< d3 � Z= d4 f d5 � � YZ> d6 f d7 � � YZ? d8 e? f d9 � � YZ@ d: e? f d; � � YZA d< e? f d= � � YZB d> e? f d? � � YZC i e@ e jD 6eA e jE 6eB e jF 6eC e jG 6ZH d@ � ZI eJ dA k r�x e jK d D] ZL e) eL � q�Wn d S(B i����N( t StringIO( t astt parset walkt syntax( t pyassemt misct futuret symbols( t SC_LOCALt SC_GLOBAL_IMPLICITt SC_GLOBAL_EXPLICITt SC_FREEt SC_CELL( t CO_VARARGSt CO_VARKEYWORDSt CO_NEWLOCALSt CO_NESTEDt CO_GENERATORt CO_FUTURE_DIVISIONt CO_FUTURE_ABSIMPORTt CO_FUTURE_WITH_STATEMENTt CO_FUTURE_PRINT_FUNCTION( t TupleArgi i t CALL_FUNCTIONt CALL_FUNCTION_VARt CALL_FUNCTION_KWt CALL_FUNCTION_VAR_KWi i i c C s� t | d � } | j � } | j � t | | � } y | j | � Wn t k r[ � n+ Xt | d d � } | j | � | j � d S( Nt Ut ct wb( t opent readt closet Modulet compilet SyntaxErrort dump( t filenamet displayt ft buft mod( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt compileFile% s c C s� | d k s | d k r$ t d � n | d k rB t | | � } nH | d k r` t | | � } n* | d k r~ t | | � } n t d � � | j � | j S( s* Replacement for builtin compile() functions not implemented yett singlet exect evals6 compile() 3rd arg must be 'exec' or 'eval' or 'single'N( t Nonet RuntimeErrort InteractiveR" t Expressiont ValueErrorR# t code( t sourceR& t modet flagst dont_inheritt gen( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# 3 s t AbstractCompileModec B s2 e Z d Z d � Z d � Z d � Z d � Z RS( c C s | | _ | | _ d | _ d S( N( R5 R& R/ R4 ( t selfR5 R& ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt __init__H s c C s9 t | j | j � } t j | j | � t j | � | S( N( R R5 R6 R t set_filenameR& R t check( R; t tree( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt _get_treeM s c C s d S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# S s c C s | j S( N( R4 ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt getCodeV s N( t __name__t __module__R/ R6 R< R@ R# RA ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR: D s R2 c B s e Z d Z d � Z RS( R. c C s+ | j � } t | � } | j � | _ d S( N( R@ t ExpressionCodeGeneratorRA R4 ( R; R? R9 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# ] s ( RB RC R6 R# ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR2 Y s R1 c B s e Z d Z d � Z RS( R, c C s+ | j � } t | � } | j � | _ d S( N( R@ t InteractiveCodeGeneratorRA R4 ( R; R? R9 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# f s ( RB RC R6 R# ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR1 b s R" c B s8 e Z d Z d d � Z d � Z e j � Z d � Z RS( R- i c C sN | j � } t | � } | r; d d l } | j | � GHn | j � | _ d S( Ni����( R@ t ModuleCodeGeneratort pprintRA R4 ( R; R' R? R9 RG ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR# o s c C s* | j | j � � t j | j | � d S( N( t writet getPycHeadert marshalR% R4 ( R; R( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR% w s c C s2 t j j | j � } t j d | � } | j | S( Ns <i( t ost patht getmtimeR& t structt packt MAGIC( R; t mtime( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRI } s ( RB RC R6 R# R% t impt get_magicRP RI ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR" k s t LocalNameFinderc B sk e Z d Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( s Find local names in scopec C sC t j � | _ t j � | _ x | D] } | j j | � q% Wd S( N( R t Sett namest globalst add( R; RV t name( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C sF x< | j j � D]+ } | j j | � r | j j | � q q W| j S( N( RW t elementsRV t has_eltt remove( R; t elt( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt getLocals� s c C s d S( N( ( R; t node( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDict� s c C s( x! | j D] } | j j | � q Wd S( N( RV RW RX ( R; R_ RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGlobal� s c C s | j j | j � d S( N( RV RX RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFunction� s c C s d S( N( ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitLambda� s c C s4 x- | j D]" \ } } | j j | p( | � q Wd S( N( RV RX ( R; R_ RY t alias( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitImport� s c C s4 x- | j D]" \ } } | j j | p( | � q Wd S( N( RV RX ( R; R_ RY Rd ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFrom� s c C s | j j | j � d S( N( RV RX RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitClass� s c C s | j j | j � d S( N( RV RX RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssName� s ( ( RB RC t __doc__R< R^ R` Ra Rb Rc Re Rf Rg Rh ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRT � s c C s& t | t j � r" | j s" d Sn d S( Ni i ( t isinstanceR t Constt value( R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt is_constant_false� s t CodeGeneratorc B sU e Z d Z d Z d� Z d� Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z e d � Z e Z d� Z d� Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z! d � Z" d � Z# d � Z$ d � Z% d � Z& d � Z' d � Z( d � Z) d � Z* d! � Z+ d" � Z, d# � Z- d$ � Z. d% � Z/ d& � Z0 d' � Z1 d( � Z2 d) � Z3 d* � Z4 d+ � Z5 d, � Z6 d- � Z7 d. � Z8 d Z9 d/ � Z: d0 � Z; d1 � Z< d2 � Z= d3 � Z> d4 � Z? d5 � Z@ d6 � ZA d7 � ZB d8 � ZC d9 � ZD d: � ZE d; � ZF d< � ZG d= d> � ZH eI d? k rveH ZJ eH ZK n d@ � ZJ dA � ZK dB � ZL i dC dD 6dE dF 6dG dH 6dI dJ 6dK dL 6dM dN 6dO dP 6dQ dR 6dS dT 6dU dV 6dW dX 6dY dZ 6ZM d[ � ZN d\ � ZO d] � ZP d^ � ZQ d_ � ZR d` � ZS d da � ZT db � ZU dc � ZV dd � ZW d� de � ZX d� df � ZY dg � ZZ dh � Z[ di � Z\ dj � Z] dk � Z^ dl � Z_ dm � Z` dn � Za do � Zb dp � Zc dq � Zd dr � Ze ds � Zf dt � Zg du � Zh dv � Zi dw � Zj dx � Zk dy � Zl dz � Zm d{ � Zn d| � Zo d} � Zp d~ � Zq d � Zr d� � Zs d� � Zt RS(� s� Defines basic code generator for Python bytecode This class is an abstract base class. Concrete subclasses must define an __init__() that defines self.graph and then calls the __init__() defined in this class. The concrete class must also define the class attributes NameFinder, FunctionGen, and ClassGen. These attributes can be defined in the initClass() method, which is a hook for initializing these methods after all the classes have been defined. i c C s | j d k r( | j � d | j _ n | j � t j � | _ t j � | _ d | _ | j � d | _ | j � j } x� | D]� } | d k r� | j j t � d | _ q� | d k r� | j j t � q� | d k r� | j j t � q� | d k r� | j j t � q� q� Wd S( Ni t BINARY_DIVIDEt divisiont BINARY_TRUE_DIVIDEt absolute_importt with_statementt print_function( t _CodeGenerator__initializedR/ t initClasst __class__t checkClassR t Stackt localst setupst last_linenot _setupGraphDelegationt _div_opt get_modulet futurest grapht setFlagR R R R ( R; R� t feature( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s( c C s d S( s) This method is called once for each classN( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRv � t c C s7 y Wn, t k r2 } d | j j } t | � n Xd S( s* Verify that class is constructed correctlys Bad class construction for %sN( t AssertionErrorRw RB ( R; t msgt intro( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRx � s c C sO | j j | _ | j j | _ | j j | _ | j j | _ | j j | _ d S( N( R� t emitt newBlockt startBlockt nextBlockt setDocstring( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR} � s c C s | j j � S( s Return a code object( R� RA ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRA � s c C s* | j d k r" t j | | j � S| Sd S( N( t class_nameR/ R t mangle( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s t j � } t | | � | j S( N( R t SymbolVisitorR t scopes( R; R? t s( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt parseSymbols s c C s t d � d S( Ns# should be implemented by subclasses( R0 ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s c C s | j j � j | � S( N( Rz t topR[ ( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt isLocalName s c C s | j d | � d S( Nt STORE( t _nameOp( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt storeName s c C s | j d | � d S( Nt LOAD( R� ( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt loadName s c C s | j d | � d S( Nt DELETE( R� ( R; RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt delName s c C s | j | � } | j j | � } | t k rd | j sM | j | d | � q | j | d | � n� | t k r� | j | d | � n� | t k r� | j s� | j | d | � q | j | d | � nB | t k s� | t k r� | j | d | � n t d | | f � d S( Nt _NAMEt _FASTt _GLOBALt _DEREFs unsupported scope for var %s: %d( R� t scopet check_nameR t optimizedR� R R R R R0 ( R; t prefixRY R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� s c C s8 | j r | j | d | � n | j | d | � d S( s� Emit name ops for names generated implicitly by for loops The interpreter generates names that start with a period or dollar sign. The symbol table ignores these names because they aren't present in the program text. R� R� N( R� R� ( R; R� RY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt _implicitNameOp+ s c C sT t | d d � } | d k rP | | j k s3 | rP | j d | � | | _ t St S( s� Emit SET_LINENO if necessary. The instruction is considered necessary if the node has a lineno attribute and it is different than the last lineno emitted. Returns true if SET_LINENO was emitted. There are no rules for when an AST node should have a lineno attribute. The transformer and AST code need to be reviewed and a consistent policy implemented and documented. Until then, this method works around missing line numbers. t linenot SET_LINENON( t getattrR/ R| R� t Truet False( R; R_ t forceR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt set_lineno< s c C s� | j | � | _ | j | | _ | j d d � | j r^ | j d | j � | j d � n t | j | j � d d �} | j j | j � � | j | j � | j d d � | j d � d S( NR� i t LOAD_CONSTRi t verboset RETURN_VALUE( R� R� R� R� t docR� R R_ t NameFinderRz t pushR^ t visitR/ ( R; R_ t lnf( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitModuleZ s c C sP | j | � | j | � | _ | j | | _ | j | j � | j d � d S( NR� ( R� R� R� R� R� R_ R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitExpressiong s c C sC | j | d d �| j r/ | j | j � n | j | j � d S( Nt isLambdai ( t _visitFuncOrLambdaR� R� R� RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRb n s c C s | j | d d �d S( NR� i ( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRc t s c C s | rI | j rI x! | j j D] } | j | � q Wt | j j � } n d } | j | | j | | j | j � � } t | j | � | j � | j | � x | j D] } | j | � q� W| j | t | j � � x$ t | � D] } | j d d � q� Wd S( Ni R i ( t decoratorst nodesR� t lent FunctionGenR� R� R R R4 t finishR� t defaultst _makeClosuret rangeR� ( R; R_ R� t decoratort ndecoratorsR9 t defaultt i( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� w s c C s� | j | | j | j � � } t | j | � | j � | j | � | j d | j � x | j D] } | j | � qb W| j d t | j � � | j | d � | j d d � | j d � | j | j � d S( NR� t BUILD_TUPLEi R t BUILD_CLASS( t ClassGenR� R R R4 R� R� R� RY t basesR� R� R� R� ( R; R_ R9 t base( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRg � s c C s� | j � } t | j � } x� t | � D]� } | j | \ } } t | � rS q( n | j | � | j | � | j � } | j d | � | j � | j | � | j d | � | j | � q( W| j r� | j | j � n | j | � d S( Nt POP_JUMP_IF_FALSEt JUMP_FORWARD( R� R� t testsR� Rm R� R� R� R� R� t else_( R; R_ t endt numtestsR� t testt suitet nextTest( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitIf� s" c C s | j | � | j � } | j � } | j � } | j d | � | j | � | j j t | f � | j | d t �| j | j � | j d | p� | � | j � | j | j � | j d | � | j | � | j d � | j j � | j r | j | j � n | j | � d S( Nt SETUP_LOOPR� R� t JUMP_ABSOLUTEt POP_BLOCK( R� R� R� R� R{ R� t LOOPR� R� R� t bodyR� t popR� ( R; R_ t loopR� t after( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitWhile� s& c C s( | j � } | j � } | j � } | j j t | f � | j | � | j d | � | j | j � | j d � | j | � | j | d d �| j d | � | j | j � | j | j � | j d | � | j | � | j d � | j j � | j r| j | j � n | j | � d S( NR� t GET_ITERR� i t FOR_ITERR� R� ( R� R{ R� R� R� R� R� t listR� t assignR� R� R� ( R; R_ t startt anchorR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFor� s( c C sC | j s% t d | j | j f � n | j | � | j d � d S( Ns 'break' outside loop (%s, %d)t BREAK_LOOP( R{ R$ R& R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBreak� s c C s[ | j s% t d | j | j f � n | j j � \ } } | t k rp | j | � | j d | � | j � n� | t k s� | t k r)| j | � t | j � } x= | d k r� | d } | j | \ } } | t k r� Pq� q� W| t k r t d | j | j f � n | j d | � | j � n. | t k rWd } t | | j | j f � n d S( Ns 'continue' outside loop (%s, %d)R� i i t CONTINUE_LOOPs7 'continue' not allowed inside 'finally' clause (%s, %d)( R{ R$ R& R� R� R� R� R� R� t EXCEPTt TRY_FINALLYR� t END_FINALLY( R; R_ t kindt blockR� t loop_blockR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitContinue� s0 c C sp | j � } x< | j d D]- } | j | � | j | | � | j � q W| j | j d � | j | � d S( Ni����( R� R� R� R� R� ( R; R_ t jumpR� t child( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTest s c C s | j | d � d S( Nt JUMP_IF_FALSE_OR_POP( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAnd s c C s | j | d � d S( Nt JUMP_IF_TRUE_OR_POP( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitOr s c C s� | j � } | j � } | j | j � | j d | � | j | j � | j d | � | j | � | j | j � | j | � d S( NR� R� ( R� R� R� R� t thenR� R� ( R; R_ t endblockt elseblock( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitIfExp s c C s3 | j | j � | j � } xl | j d D]] \ } } | j | � | j d � | j d � | j d | � | j d | � | j � q* W| j r� | j d \ } } | j | � | j d | � n t | j � d k r/| j � } | j d | � | j | � | j d � | j d � | j | � n d S( Ni����t DUP_TOPt ROT_THREEt COMPARE_OPR� i R� t ROT_TWOt POP_TOP( R� t exprR� t opsR� R� R� R� ( R; R_ t cleanupt opR4 R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitCompare s( c C sF | j | � | j d d � g } x� t t t | j � � | j � D] \ } } | j | � \ } } d } x< | j D]1 } | d k r� | j � } n | j | | � qv W| j d | | | f � qE W| j | j � | j d t | j � d � xJ | D]B \ } } } | r!| j | � n | j d | � | j | � q� Wd S( Nt BUILD_LISTi t LIST_APPENDi R� ( R� R� t zipR� R� t qualsR� R/ t ifsR� t insertR� R� R� ( R; R_ t stackR� t for_R� R� t contt if_( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitListComp8 s$ . c C sF | j | � | j d d � g } x� t t t | j � � | j � D] \ } } | j | � \ } } d } x< | j D]1 } | d k r� | j � } n | j | | � qv W| j d | | | f � qE W| j | j � | j d t | j � d � xJ | D]B \ } } } | r!| j | � n | j d | � | j | � q� Wd S( Nt BUILD_SETi t SET_ADDi R� ( R� R� R R� R� R R� R/ R R� R R� R� R� ( R; R_ R R� R R� R� R R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSetCompP s$ . c C sV | j | � | j d d � g } x� t t t | j � � | j � D] \ } } | j | � \ } } d } x< | j D]1 } | d k r� | j � } n | j | | � qv W| j d | | | f � qE W| j | j � | j | j � | j d t | j � d � xJ | D]B \ } } } | r1| j | � n | j d | � | j | � q Wd S( Nt BUILD_MAPi t MAP_ADDi R� ( R� R� R R� R� R R� R/ R R� R Rl t keyR� R� ( R; R_ R R� R R� R� R R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDictComph s& . c C s� | j � } | j � } | j | j � | j d � | j | � | j | d t �| j d | � | j � | j | j � | | f S( NR� R� R� ( R� R� R� R� R� R� R� R� ( R; R_ R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitListCompFor� s c C sA | j | d t �| j | j � | j d | � | j � d S( NR� R� ( R� R� R� R� R� R� ( R; R_ t branch( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitListCompIf� s c C s� | j j � } | ro x | D] } | j d | � q W| j d t | � � | j d | � | j d | � n | j d | � | j d | � d S( Nt LOAD_CLOSURER� R� t MAKE_CLOSUREt MAKE_FUNCTION( R� t get_free_varsR� R� ( R; R9 t argst freesRY ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s� t | | j | j | j � � } t | j | � | j � | j | � | j | d � | j | j j d j � | j d � | j d d � d S( Ni R� R i ( t GenExprCodeGeneratorR� R� R R R4 R� R� R� R� R t iterR� ( R; R_ R9 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExpr� s c C ss | j | � g } x� t t t | j � � | j � D]� \ } } | j | � \ } } } d } x< | j D]1 } | d k r� | j � } n | j | | � qi W| j d | | | | f � q5 W| j | j � | j d � | j d � xt | D]l \ } } } } | r| j | � n | j d | � | j | � | j d � | j j � | j | � q� W| j d d � d S( Ni t YIELD_VALUER� R� R� R� ( R� R R� R� R R� R/ R R� R R� R� R� R� R{ R� ( R; R_ R R� R R� R� R� R R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExprInner� s, . c C s� | j � } | j � } | j � } | j j t | f � | j d | � | j rc | j d � n | j | j � | j d � | j | � | j | d t �| j d | � | j � | j | j � | | | f S( NR� s .0R� R� R� ( R� R{ R� R� R� t is_outmostR� R� R R� R� R� R� ( R; R_ R� R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExprFor� s c C sA | j | d t �| j | j � | j d | � | j � d S( NR� R� ( R� R� R� R� R� R� ( R; R_ R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGenExprIf� s c C s d S( N( ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssert� s c C s� | j | � d } | j r9 | j | j � | d } n | j r_ | j | j � | d } n | j r� | j | j � | d } n | j d | � d S( Ni i t RAISE_VARARGS( R� t expr1R� t expr2t expr3R� ( R; R_ t n( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitRaise� s c C s9 | j � } | j � } | j � } | j r< | j � } n | } | j | � | j d | � | j | � | j j t | f � | j | j � | j d � | j j � | j d | � | j | � t | j � d } xt t | j � � D]� } | j | \ } } } | j | � | rt| j d � | j | � | j d d � | j � } | j d | � | j � n | j d � | r�| j | � n | j d � | j d � | j | � | j d | � | r�| j | � q� | j � q� W| j d � | j r(| j | � | j | j � n | j | � d S( Nt SETUP_EXCEPTR� R� i R� R� s exception matchR� R� R� ( R� R� R� R� R� R{ R� R� R� R� R� R� R� t handlersR� ( R; R_ R� R- R� t lElset lastR� R� t targett next( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTryExcept sR c C s� | j � } | j � } | j | � | j d | � | j | � | j j t | f � | j | j � | j d � | j j � | j d d � | j | � | j j t | f � | j | j � | j d � | j j � d S( Nt SETUP_FINALLYR� R� R� ( R� R� R� R� R{ R� R� R� R� R� R/ R� t final( R; R_ R� R4 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTryFinally8 s c C s� | j � } | j � } | j d 7_ d | j } | j | � | j | j � | j d � | j d d � | j d � | j d d � | j d d � | j d k r� | j d � n | j d | � | j d | � | j | � | j j t | f � | j d k r?| j d | � | j d | � | j | j � n | j | j � | j d � | j j � | j d d � | j | � | j j t | f � | j d � | j d � | j j � | j d 8_ d S( Ni s _[%d]R� t LOAD_ATTRt __exit__R� t __enter__R i R� R� R3 R� R� R� R� t WITH_CLEANUPR� ( R� t _CodeGenerator__with_countR� R� R� R� t varsR/ R� R� R{ R� R� R� R� R� ( R; R_ R� R4 t valuevar( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitWithK s> c C s. | j | � | j | j � | j d � d S( NR� ( R� R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDiscardo s c C s | j d | j � d S( NR� ( R� Rl ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitConstt s c C s' | j d | j � | j | j � d S( NR� ( R� RY R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitKeywordw s c C s d S( N( ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRa { s c C s! | j | � | j | j � d S( N( R� R� RY ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitName s c C s | j | � d S( N( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPass� s c C s� | j | � | j j t � r% d n d } x� | j D]� \ } } t d k rp | j d | � | j d d � n | j d | � | j d � d } | r� | j | � | j | � q5 | j | � q5 Wd S( Ni i����i R� t IMPORT_NAMEt .( R� R� t checkFlagR RV t VERSIONR� R/ t splitt _resolveDotsR� ( R; R_ t levelRY Rd R* ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRe � s c C s9 | j | � | j } | d k r> | j j t � r> d } n t d � | j D� � } t d k r� | j d | � | j d | � n | j d | j � x� | j D]� \ } } t d k r| d k r� d | _ | j d � d S| j d | � | j | � | j | p | � q� | j d | � q� W| j d � d S( Ni i����c s s | ] \ } } | Vq d S( N( ( t .0RY Rd ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pys <genexpr>� s i R� RC t *t IMPORT_STARt IMPORT_FROMR� ( R� RI R� RE R t tupleRV RF R� t modnamet namespaceRH R� ( R; R_ RI t fromlistRY Rd ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRf � s( c C sN | j d � } t | � d k r% d Sx" | d D] } | j d | � q0 Wd S( NRD i R6 ( RG R� R� ( R; RY t eltsR] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRH � s c C s0 | j | j � | j d | j | j � � d S( NR6 ( R� R� R� R� t attrname( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitGetattr� s c C s� | j | � | j | j � t | j � d } xh t t | j � � D]Q } | j | } | | k ru | j d � n t | t j � rF | j | � qF qF Wd S( Ni R� ( R� R� R� R� R� R� R� Rj R t Node( R; R_ t dupsR� R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssign� s c C sa | j d k r" | j | j � n; | j d k rQ | j | � | j | j � n d G| j GHd S( Nt OP_ASSIGNt OP_DELETEt oops( R7 R� RY R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRh � s c C s� | j | j � | j d k r> | j d | j | j � � n? | j d k rl | j d | j | j � � n d G| j GH| GHd S( NRX t STORE_ATTRRY t DELETE_ATTRs warning: unexpected flags:( R� R� R7 R� R� RS ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssAttr� s t UNPACK_SEQUENCEc C sS t | � d k r. | j | t | j � � n x | j D] } | j | � q8 Wd S( NRY ( t findOpR� R� R� R� ( R; R_ R R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt _visitAssSequence� s i c C s | j | d � d S( Nt UNPACK_TUPLE( R` ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssTuple� s c C s | j | d � d S( Nt UNPACK_LIST( R` ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAssList� s c C sg | j | � t | j � } | j | d � | j | j � | j | j | j � | j | d � d S( Nt loadt store( R� t wrap_augR_ R� R� R� t _augmented_opcodeR ( R; R_ t aug_node( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugAssign� s t INPLACE_ADDs +=t INPLACE_SUBTRACTs -=t INPLACE_MULTIPLYs *=t INPLACE_DIVIDEs /=t INPLACE_FLOOR_DIVIDEs //=t INPLACE_MODULOs %=t INPLACE_POWERs **=t INPLACE_RSHIFTs >>=t INPLACE_LSHIFTs <<=t INPLACE_ANDs &=t INPLACE_XORs ^=t INPLACE_ORs |=c C sB | d k r | j | j � n | d k r> | j | j � n d S( NRe Rf ( R� RY R� ( R; R_ R6 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugName s c C s� | d k rH | j | j � | j d � | j d | j | j � � n8 | d k r� | j d � | j d | j | j � � n d S( NRe R� R6 Rf R� R[ ( R� R� R� R� RS ( R; R_ R6 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugGetattr s c C s� | d k r | j | d � n� | d k r� d } | j rG | d B} n | j r] | d B} n | d k ry | j d � n) | d k r� | j d � n | j d � | j d | � n d S( NRe i Rf i i R� i t ROT_FOURR� s STORE_SLICE+%d( t visitSlicet lowert upperR� ( R; R_ R6 t slice( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugSlice s c C sL | d k r | j | d � n) | d k rH | j d � | j d � n d S( NRe i Rf R� t STORE_SUBSCR( t visitSubscriptR� ( R; R_ R6 ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAugSubscript# s c C s� | j | j � | j d k r2 | j d d � n | j | j � | j d k ra | j d � n | j | j � | j d � d S( NR� R� t EXEC_STMT( R� R� Rz R/ R� RW ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitExec* s c C s d } d } | j | � | j | j � xG | j D]< } | j | � t | t j � re | d } q3 | d } q3 W| j d k r� | j | j � n | j d k r� | j | j � n | j d k } | j d k } t | | f } | j | | d >| B� d S( Ni i i ( R� R� R_ R Rj R t Keywordt star_argsR/ t dstar_argst callfunc_opcode_infoR� ( R; R_ t post kwt argt have_start have_dstart opcode( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitCallFunc6 s" c C s� | j | � | j r) | j | j � n xj | j D]_ } | j rR | j d � n | j | � | j r� | j d � | j d � q3 | j d � q3 W| j r� | r� | j d � n d S( NR� R� t PRINT_ITEM_TOt PRINT_ITEMR� ( R� t destR� R� R� ( R; R_ t newlineR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPrintJ s c C s= | j | d d �| j r, | j d � n | j d � d S( NR� i t PRINT_NEWLINE_TOt PRINT_NEWLINE( R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPrintnlZ s c C s. | j | � | j | j � | j d � d S( NR� ( R� R� Rl R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitReturna s c C s. | j | � | j | j � | j d � d S( NR ( R� R� Rl R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitYieldf s c C s2 | j | j � d } | j r< | j | j � | d B} n | j rb | j | j � | d B} n | r� | d k r� | j d � q� | d k r� | j d d � q� | j d d � n | j d k r� | j d | � nU | j d k r� | j d | � n2 | j d k r | j d | � n d G| j GH� d S( Ni i i R� i t DUP_TOPXt OP_APPLYs SLICE+%dRX s STORE_SLICE+%dRY s DELETE_SLICE+%ds weird slice( R� R� R{ R| R� R7 ( R; R_ t aug_flagR} ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRz m s, c C s� | j | j � x | j D] } | j | � q Wt | j � d k rb | j d t | j � � n | r{ | j d d � n | j d k r� | j d � n> | j d k r� | j d � n | j d k r� | j d � n d S( Ni R� R� i R� t BINARY_SUBSCRRX R RY t DELETE_SUBSCR( R� R� t subsR� R� R7 ( R; R_ R� t sub( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s1 | j | j � | j | j � | j | � d S( N( R� t leftt rightR� ( R; R_ R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt binaryOp� s c C s | j | d � S( Nt BINARY_ADD( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitAdd� s c C s | j | d � S( Nt BINARY_SUBTRACT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSub� s c C s | j | d � S( Nt BINARY_MULTIPLY( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitMul� s c C s | j | | j � S( N( R� R~ ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitDiv� s c C s | j | d � S( Nt BINARY_FLOOR_DIVIDE( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitFloorDiv� s c C s | j | d � S( Nt BINARY_MODULO( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitMod� s c C s | j | d � S( Nt BINARY_POWER( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitPower� s c C s | j | d � S( Nt BINARY_LSHIFT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitLeftShift� s c C s | j | d � S( Nt BINARY_RSHIFT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitRightShift� s c C s! | j | j � | j | � d S( N( R� R� R� ( R; R_ R ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt unaryOp� s c C s | j | d � S( Nt UNARY_INVERT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitInvert� s c C s | j | d � S( Nt UNARY_NEGATIVE( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitUnarySub� s c C s | j | d � S( Nt UNARY_POSITIVE( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitUnaryAdd� s c C s | j | d � S( NR� ( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitUnaryInvert� s c C s | j | d � S( Nt UNARY_NOT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitNot� s c C s | j | d � S( Nt UNARY_CONVERT( R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBackquote� s c C sD | j | d � x, | d D] } | j | � | j | � q Wd S( Ni i ( R� R� ( R; R� R R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt bitOp� s c C s | j | j d � S( Nt BINARY_AND( R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBitand� s c C s | j | j d � S( Nt BINARY_OR( R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBitor� s c C s | j | j d � S( Nt BINARY_XOR( R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitBitxor� s c C s | j d t � d S( NR� ( R� t Ellipsis( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitEllipsis� s c C sK | j | � x | j D] } | j | � q W| j d t | j � � d S( NR� ( R� R� R� R� R� ( R; R_ R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitTuple� s c C sK | j | � x | j D] } | j | � q W| j d t | j � � d S( NR ( R� R� R� R� R� ( R; R_ R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitList� s c C sK | j | � x | j D] } | j | � q W| j d t | j � � d S( NR ( R� R� R� R� R� ( R; R_ R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSet� s c C s> x | j D] } | j | � q W| j d t | j � � d S( Nt BUILD_SLICE( R� R� R� R� ( R; R_ R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt visitSliceobj� s c C s| | j | � | j d d � xX | j D]M \ } } | j d � | j | � | j | � | j d � | j d � q' Wd S( NR i R� R� R ( R� R� t itemsR� ( R; R_ t kt v( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR` � s N(u RB RC Ri R� R/ Ru R� R< Rv Rx R} RA R� R� R R� R� R� R� R� R� R� R� RT R� R� R� R� R� Rb Rc R� Rg R� R� R� R� R� R� R� R� R� R R R R R R R� R R! R# R$ R% R+ R2 R5 R: R= R> R? R@ Ra RA RB Re Rf RH RT RW Rh R] R` RF Rb Rd Rj Rh Rw Rx R~ R� R� R� R� R� R� R� Rz R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R` ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRn � s� / $ t NestedScopeMixinc B s e Z d Z d � Z RS( s> Defines initClass() for nested scoping (Python 2.2-compatible)c C s( t | j _ t | j _ t | j _ d S( N( RT Rw R� t FunctionCodeGeneratorR� t ClassCodeGeneratorR� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRv s ( RB RC Ri Rv ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� s RF c B s) e Z e j Z d Z d � Z d � Z RS( c C sE t j d | j � | _ t j | � | _ | j � t | | � d S( Ns <module>( R t PyFlowGraphR& R� R t find_futuresR� t _ModuleCodeGenerator__super_initR ( R; R? ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< s c C s | S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s N( RB RC Rn R< R� R/ R� R ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRF s RD c B s/ e Z e j Z d Z d Z d � Z d � Z RS( c C s3 t j d | j � | _ | j � t | | � d S( Ns <expression>( R R� R& R� t$ _ExpressionCodeGenerator__super_initR ( R; R? ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< # s c C s | S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR ( s N( ( RB RC Rn R< R� R/ R� R� R ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRD s RE c B s8 e Z e j Z d Z d Z d � Z d � Z d � Z RS( c C sM t j d | j � | _ | j � | j | � t | | � | j d � d S( Ns <interactive>R� ( R R� R& R� t% _InteractiveCodeGenerator__super_initR� R R� ( R; R? ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< 2 s c C s | S( N( ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR 9 s c C s! | j | j � | j d � d S( Nt PRINT_EXPR( R� R� R� ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR> < s N( ( RB RC Rn R< R� R/ R� R� R R> ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRE + s t AbstractFunctionCodec B sG e Z d Z d Z d � Z d � Z d � Z d � Z d � Z e Z RS( i i c C sL | | _ | | _ | r> t } d | j } | j d | _ n | j } t | j � \ } } t j | | j | d d �| _ | | _ | j � | r� | j r� | j | j � n t | j | j | � d d �} | j j | j � � | j r| j j t � n | j r"| j j t � n | j | � | rH| j | j � n d S( Ns <lambda.%d>i R� R� i ( R� t moduleR� t lambdaCountRY t generateArgListt argnamesR R� R& R� R� t super_initR� R� R R4 R� Rz R� R^ t varargsR� R t kwargsR R� t generateArgUnpack( R; t funcR� R� R� R* t klassRY R t hasTupleArgR� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< F s. ! c C s | j S( N( R� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR c s c C s: | j j � | j s) | j d d � n | j d � d S( NR� R� ( R� t startExitBlockR� R� R/ ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� f s c C sb x[ t t | � � D]G } | | } t | t � r | j d d | d � | j | � q q Wd S( Nt LOAD_FASTs .%di ( R� R� Rj RN R� t unpackSequence( R; R R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� l s c C s t d k r% | j d t | � � n | j d t | � � x= | D]5 } t | t � rg | j | � qB | j d | � qB Wd S( Ni R^ Ra R� ( RF R� R� Rj RN R� R� ( R; t tupR] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� s s ( RB RC R� R� R< R R� R� R� t unpackTuple( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� B s R� c B s) e Z e j Z d Z e j Z d � Z RS( c C s� | | _ | | | _ | j | | | | | � | j j | j j � � | j j | j j � � | j j d k r� | j j t � n d S( N( R� R� t" _FunctionCodeGenerator__super_initR� t setFreeVarsR t setCellVarst get_cell_varst generatorR/ R� R ( R; R� R� R� R� R* ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s N( RB RC Rn R< R� R/ R� R� R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s R c B s) e Z e j Z d Z e j Z d � Z RS( c C su | | _ | | | _ | j | | d | | � | j j | j j � � | j j | j j � � | j j t � d S( Ni ( R� R� t! _GenExprCodeGenerator__super_initR� R� R R� R� R� R ( R; t gexpR� R� R* ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s N( RB RC Rn R< R� R/ R� R� R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AbstractClassCodec B s# e Z d � Z d � Z d � Z RS( c C s� | j | _ | | _ t j | j | j d d d d �| _ | j � t | j | j � d d �} | j j | j � � | j j t � | j r� | j | j � n d S( NR� i R� i R� ( RY R� R� R R� R& R� R� R R4 R� Rz R� R^ R� R R� R� ( R; R� R� R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C s | j S( N( R� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s c C s+ | j j � | j d � | j d � d S( Nt LOAD_LOCALSR� ( R� R� R� ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s ( RB RC R< R R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s R� c B s) e Z e j Z d Z e j Z d � Z RS( c C s� | | _ | | | _ | j | | | � | j j | j j � � | j j | j j � � | j | � | j d d � | j d � | j r� | j d | j � | j d � n d S( Nt LOAD_GLOBALRB RC R� Ri ( R� R� t _ClassCodeGenerator__super_initR� R� R R� R� R� R� R� R� ( R; R� R� R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s N( RB RC Rn R< R� R/ R� R� R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s� g } g } d } x� t t | � � D]� } | | } t | t � rT | j | � q% t | t � r� | j t | d | � � | j t j | � � | d } q% t d | � q% W| | | f S( s& Generate an arg list marking TupleArgsi i i s unexpect argument type:( R� R� Rj t strt appendRN R t extendR t flattenR3 ( t arglistR t extrat countR� R] ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s c C s# t � } t | | d d �| j S( s5 Find the op (DELETE, LOAD, STORE) in an AssTuple treeR� i ( t OpFinderR R ( R_ R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR_ � s R� c B s& e Z d � Z d � Z e Z e Z RS( c C s d | _ d S( N( R/ R ( R; ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C s@ | j d k r | j | _ n | j | j k r< t d � n d S( Ns mixed ops in stmt( R R/ R7 R3 ( R; R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRh � s ( RB RC R< Rh R] R� ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s t Delegatorc B s e Z d Z d � Z d � Z RS( s Base class to support delegation for augmented assignment nodes To generator code for augmented assignments, we use the following wrapper classes. In visitAugAssign, the left-hand expression node is visited twice. The first time the visit uses the normal method for that node . The second time the visit uses a different method that generates the appropriate code to perform the assignment. These delegator classes wrap the original AST nodes in order to support the variant visit methods. c C s | | _ d S( N( t obj( R; R� ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR< � s c C s t | j | � S( N( R� R� ( R; t attr( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt __getattr__� s ( RB RC Ri R< R ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR� � s t AugGetattrc B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AugNamec B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR � s t AugSlicec B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s t AugSubscriptc B s e Z RS( ( RB RC ( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyR s c C s t | j | � S( N( t wrapperRw ( R_ ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyRg s t __main__(M RR RK RJ RN t syst cStringIOR t compilerR R R R R R R R t compiler.constsR R R R R R R R R R R R R R t compiler.pyassemR t version_infoRF t AttributeErrorR� R� R� R� R� R+ R/ R# R: R2 R1 R" RT Rm Rn R� RF RD RE R� R� R R� R� R� R_ R� R� R R R R t Getattrt Namet Slicet SubscriptR Rg RB t argvt file( ( ( s* /usr/lib64/python2.7/compiler/pycodegen.pyt <module> s� ""(@ + � � � � U> PK s�ZP��r�8 �8 symbols.pynu �[��� """Module symbol-table generator""" from compiler import ast from compiler.consts import SC_LOCAL, SC_GLOBAL_IMPLICIT, SC_GLOBAL_EXPLICIT, \ SC_FREE, SC_CELL, SC_UNKNOWN from compiler.misc import mangle import types import sys MANGLE_LEN = 256 class Scope: # XXX how much information do I need about each name? def __init__(self, name, module, klass=None): self.name = name self.module = module self.defs = {} self.uses = {} self.globals = {} self.params = {} self.frees = {} self.cells = {} self.children = [] # nested is true if the class could contain free variables, # i.e. if it is nested within another function. self.nested = None self.generator = None self.klass = None if klass is not None: for i in range(len(klass)): if klass[i] != '_': self.klass = klass[i:] break def __repr__(self): return "<%s: %s>" % (self.__class__.__name__, self.name) def mangle(self, name): if self.klass is None: return name return mangle(name, self.klass) def add_def(self, name): self.defs[self.mangle(name)] = 1 def add_use(self, name): self.uses[self.mangle(name)] = 1 def add_global(self, name): name = self.mangle(name) if name in self.uses or name in self.defs: pass # XXX warn about global following def/use if name in self.params: raise SyntaxError, "%s in %s is global and parameter" % \ (name, self.name) self.globals[name] = 1 self.module.add_def(name) def add_param(self, name): name = self.mangle(name) self.defs[name] = 1 self.params[name] = 1 def get_names(self): d = {} d.update(self.defs) d.update(self.uses) d.update(self.globals) return d.keys() def add_child(self, child): self.children.append(child) def get_children(self): return self.children def DEBUG(self): print >> sys.stderr, self.name, self.nested and "nested" or "" print >> sys.stderr, "\tglobals: ", self.globals print >> sys.stderr, "\tcells: ", self.cells print >> sys.stderr, "\tdefs: ", self.defs print >> sys.stderr, "\tuses: ", self.uses print >> sys.stderr, "\tfrees:", self.frees def check_name(self, name): """Return scope of name. The scope of a name could be LOCAL, GLOBAL, FREE, or CELL. """ if name in self.globals: return SC_GLOBAL_EXPLICIT if name in self.cells: return SC_CELL if name in self.defs: return SC_LOCAL if self.nested and (name in self.frees or name in self.uses): return SC_FREE if self.nested: return SC_UNKNOWN else: return SC_GLOBAL_IMPLICIT def get_free_vars(self): if not self.nested: return () free = {} free.update(self.frees) for name in self.uses.keys(): if name not in self.defs and name not in self.globals: free[name] = 1 return free.keys() def handle_children(self): for child in self.children: frees = child.get_free_vars() globals = self.add_frees(frees) for name in globals: child.force_global(name) def force_global(self, name): """Force name to be global in scope. Some child of the current node had a free reference to name. When the child was processed, it was labelled a free variable. Now that all its enclosing scope have been processed, the name is known to be a global or builtin. So walk back down the child chain and set the name to be global rather than free. Be careful to stop if a child does not think the name is free. """ self.globals[name] = 1 if name in self.frees: del self.frees[name] for child in self.children: if child.check_name(name) == SC_FREE: child.force_global(name) def add_frees(self, names): """Process list of free vars from nested scope. Returns a list of names that are either 1) declared global in the parent or 2) undefined in a top-level parent. In either case, the nested scope should treat them as globals. """ child_globals = [] for name in names: sc = self.check_name(name) if self.nested: if sc == SC_UNKNOWN or sc == SC_FREE \ or isinstance(self, ClassScope): self.frees[name] = 1 elif sc == SC_GLOBAL_IMPLICIT: child_globals.append(name) elif isinstance(self, FunctionScope) and sc == SC_LOCAL: self.cells[name] = 1 elif sc != SC_CELL: child_globals.append(name) else: if sc == SC_LOCAL: self.cells[name] = 1 elif sc != SC_CELL: child_globals.append(name) return child_globals def get_cell_vars(self): return self.cells.keys() class ModuleScope(Scope): __super_init = Scope.__init__ def __init__(self): self.__super_init("global", self) class FunctionScope(Scope): pass class GenExprScope(Scope): __super_init = Scope.__init__ __counter = 1 def __init__(self, module, klass=None): i = self.__counter self.__counter += 1 self.__super_init("generator expression<%d>"%i, module, klass) self.add_param('.0') def get_names(self): keys = Scope.get_names(self) return keys class LambdaScope(FunctionScope): __super_init = Scope.__init__ __counter = 1 def __init__(self, module, klass=None): i = self.__counter self.__counter += 1 self.__super_init("lambda.%d" % i, module, klass) class ClassScope(Scope): __super_init = Scope.__init__ def __init__(self, name, module): self.__super_init(name, module, name) class SymbolVisitor: def __init__(self): self.scopes = {} self.klass = None # node that define new scopes def visitModule(self, node): scope = self.module = self.scopes[node] = ModuleScope() self.visit(node.node, scope) visitExpression = visitModule def visitFunction(self, node, parent): if node.decorators: self.visit(node.decorators, parent) parent.add_def(node.name) for n in node.defaults: self.visit(n, parent) scope = FunctionScope(node.name, self.module, self.klass) if parent.nested or isinstance(parent, FunctionScope): scope.nested = 1 self.scopes[node] = scope self._do_args(scope, node.argnames) self.visit(node.code, scope) self.handle_free_vars(scope, parent) def visitGenExpr(self, node, parent): scope = GenExprScope(self.module, self.klass); if parent.nested or isinstance(parent, FunctionScope) \ or isinstance(parent, GenExprScope): scope.nested = 1 self.scopes[node] = scope self.visit(node.code, scope) self.handle_free_vars(scope, parent) def visitGenExprInner(self, node, scope): for genfor in node.quals: self.visit(genfor, scope) self.visit(node.expr, scope) def visitGenExprFor(self, node, scope): self.visit(node.assign, scope, 1) self.visit(node.iter, scope) for if_ in node.ifs: self.visit(if_, scope) def visitGenExprIf(self, node, scope): self.visit(node.test, scope) def visitLambda(self, node, parent, assign=0): # Lambda is an expression, so it could appear in an expression # context where assign is passed. The transformer should catch # any code that has a lambda on the left-hand side. assert not assign for n in node.defaults: self.visit(n, parent) scope = LambdaScope(self.module, self.klass) if parent.nested or isinstance(parent, FunctionScope): scope.nested = 1 self.scopes[node] = scope self._do_args(scope, node.argnames) self.visit(node.code, scope) self.handle_free_vars(scope, parent) def _do_args(self, scope, args): for name in args: if type(name) == types.TupleType: self._do_args(scope, name) else: scope.add_param(name) def handle_free_vars(self, scope, parent): parent.add_child(scope) scope.handle_children() def visitClass(self, node, parent): parent.add_def(node.name) for n in node.bases: self.visit(n, parent) scope = ClassScope(node.name, self.module) if parent.nested or isinstance(parent, FunctionScope): scope.nested = 1 if node.doc is not None: scope.add_def('__doc__') scope.add_def('__module__') self.scopes[node] = scope prev = self.klass self.klass = node.name self.visit(node.code, scope) self.klass = prev self.handle_free_vars(scope, parent) # name can be a def or a use # XXX a few calls and nodes expect a third "assign" arg that is # true if the name is being used as an assignment. only # expressions contained within statements may have the assign arg. def visitName(self, node, scope, assign=0): if assign: scope.add_def(node.name) else: scope.add_use(node.name) # operations that bind new names def visitFor(self, node, scope): self.visit(node.assign, scope, 1) self.visit(node.list, scope) self.visit(node.body, scope) if node.else_: self.visit(node.else_, scope) def visitFrom(self, node, scope): for name, asname in node.names: if name == "*": continue scope.add_def(asname or name) def visitImport(self, node, scope): for name, asname in node.names: i = name.find(".") if i > -1: name = name[:i] scope.add_def(asname or name) def visitGlobal(self, node, scope): for name in node.names: scope.add_global(name) def visitAssign(self, node, scope): """Propagate assignment flag down to child nodes. The Assign node doesn't itself contains the variables being assigned to. Instead, the children in node.nodes are visited with the assign flag set to true. When the names occur in those nodes, they are marked as defs. Some names that occur in an assignment target are not bound by the assignment, e.g. a name occurring inside a slice. The visitor handles these nodes specially; they do not propagate the assign flag to their children. """ for n in node.nodes: self.visit(n, scope, 1) self.visit(node.expr, scope) def visitAssName(self, node, scope, assign=1): scope.add_def(node.name) def visitAssAttr(self, node, scope, assign=0): self.visit(node.expr, scope, 0) def visitSubscript(self, node, scope, assign=0): self.visit(node.expr, scope, 0) for n in node.subs: self.visit(n, scope, 0) def visitSlice(self, node, scope, assign=0): self.visit(node.expr, scope, 0) if node.lower: self.visit(node.lower, scope, 0) if node.upper: self.visit(node.upper, scope, 0) def visitAugAssign(self, node, scope): # If the LHS is a name, then this counts as assignment. # Otherwise, it's just use. self.visit(node.node, scope) if isinstance(node.node, ast.Name): self.visit(node.node, scope, 1) # XXX worry about this self.visit(node.expr, scope) # prune if statements if tests are false _const_types = types.StringType, types.IntType, types.FloatType def visitIf(self, node, scope): for test, body in node.tests: if isinstance(test, ast.Const): if type(test.value) in self._const_types: if not test.value: continue self.visit(test, scope) self.visit(body, scope) if node.else_: self.visit(node.else_, scope) # a yield statement signals a generator def visitYield(self, node, scope): scope.generator = 1 self.visit(node.value, scope) def list_eq(l1, l2): return sorted(l1) == sorted(l2) if __name__ == "__main__": import sys from compiler import parseFile, walk import symtable def get_names(syms): return [s for s in [s.get_name() for s in syms.get_symbols()] if not (s.startswith('_[') or s.startswith('.'))] for file in sys.argv[1:]: print file f = open(file) buf = f.read() f.close() syms = symtable.symtable(buf, file, "exec") mod_names = get_names(syms) tree = parseFile(file) s = SymbolVisitor() walk(tree, s) # compare module-level symbols names2 = s.scopes[tree].get_names() if not list_eq(mod_names, names2): print print "oops", file print sorted(mod_names) print sorted(names2) sys.exit(-1) d = {} d.update(s.scopes) del d[tree] scopes = d.values() del d for s in syms.get_symbols(): if s.is_namespace(): l = [sc for sc in scopes if sc.name == s.get_name()] if len(l) > 1: print "skipping", s.get_name() else: if not list_eq(get_names(s.get_namespace()), l[0].get_names()): print s.get_name() print sorted(get_names(s.get_namespace())) print sorted(l[0].get_names()) sys.exit(-1) PK s�Z~TE# __init__.pycnu �[��� � { fc @ sh d Z d d l Z e j d e d d �d d l m Z m Z d d l m Z d d l m Z m Z d S( s� Package for parsing and compiling Python source code There are several functions defined at the top level that are imported from modules contained in the package. parse(buf, mode="exec") -> AST Converts a string containing Python source code to an abstract syntax tree (AST). The AST is defined in compiler.ast. parseFile(path) -> AST The same as parse(open(path)) walk(ast, visitor, verbose=None) Does a pre-order walk over the ast using the visitor instance. See compiler.visitor for details. compile(source, filename, mode, flags=None, dont_inherit=None) Returns a code object. A replacement for the builtin compile() function. compileFile(filename) Generates a .pyc file by compiling filename. i����Ns= The compiler package is deprecated and removed in Python 3.x.t stackleveli ( t parset parseFile( t walk( t compilet compileFile( t __doc__t warningst warnt DeprecationWarningt compiler.transformerR R t compiler.visitorR t compiler.pycodegenR R ( ( ( s) /usr/lib64/python2.7/compiler/__init__.pyt <module> s PK s�Z��>�� � consts.pyonu �[��� � { fc @ s| d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d Z d S( t OP_ASSIGNt OP_DELETEt OP_APPLYi i i i i i i i i i i i @ i � i N( R R R t SC_LOCALt SC_GLOBAL_IMPLICITt SC_GLOBAL_EXPLICITt SC_FREEt SC_CELLt SC_UNKNOWNt CO_OPTIMIZEDt CO_NEWLOCALSt CO_VARARGSt CO_VARKEYWORDSt CO_NESTEDt CO_GENERATORt CO_GENERATOR_ALLOWEDt CO_FUTURE_DIVISIONt CO_FUTURE_ABSIMPORTt CO_FUTURE_WITH_STATEMENTt CO_FUTURE_PRINT_FUNCTION( ( ( s' /usr/lib64/python2.7/compiler/consts.pyt <module> s& PK s�ZA M��D �D symbols.pyonu �[��� � { fc @ s= d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z d d l m Z d d l Z d d l Z d Z d d d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d d d � � YZ d � Z e d k r9d d l Z d d l m Z m Z d d l Z d � Z x�e j d D]�Z e GHe e � Z e j � Z! e j" � e j e! e d � Z# e e# � Z$ e e � Z% e � Z& e e% e& � e& j' e% j � Z( e e$ e( � s"Hd Ge GHe) e$ � GHe) e( � GHe j* d � n i Z+ e+ j, e& j' � e+ e% =e+ j- � Z' [+ x� e# j. � D]� Z& e& j/ � r[g e' D]! Z0 e0 j1 e& j2 � k rte0 ^ qtZ3 e4 e3 � d k r�d Ge& j2 � GHq.e e e& j5 � � e3 d j � � s.e& j2 � GHe) e e& j5 � � � GHe) e3 d j � � GHe j* d � q.q[q[Wq`Wn d S( s Module symbol-table generatori����( t ast( t SC_LOCALt SC_GLOBAL_IMPLICITt SC_GLOBAL_EXPLICITt SC_FREEt SC_CELLt SC_UNKNOWN( t mangleNi t Scopec B s� e Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( c C s� | | _ | | _ i | _ i | _ i | _ i | _ i | _ i | _ g | _ d | _ d | _ d | _ | d k r� x> t t | � � D]' } | | d k r� | | | _ Pq� q� Wn d S( Nt _( t namet modulet defst usest globalst paramst freest cellst childrent Nonet nestedt generatort klasst ranget len( t selfR R R t i( ( s( /usr/lib64/python2.7/compiler/symbols.pyt __init__ s" c C s d | j j | j f S( Ns <%s: %s>( t __class__t __name__R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt __repr__% s c C s# | j d k r | St | | j � S( N( R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR ( s c C s d | j | j | � <d S( Ni ( R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_def- s c C s d | j | j | � <d S( Ni ( R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_use0 s c C sy | j | � } | | j k s0 | | j k r0 n | | j k rX t d | | j f � n d | j | <| j j | � d S( Ns %s in %s is global and parameteri ( R R R R t SyntaxErrorR R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_global3 s c C s- | j | � } d | j | <d | j | <d S( Ni ( R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_param= s c C s@ i } | j | j � | j | j � | j | j � | j � S( N( t updateR R R t keys( R t d( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_namesB s c C s | j j | � d S( N( R t append( R t child( ( s( /usr/lib64/python2.7/compiler/symbols.pyt add_childI s c C s | j S( N( R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_childrenL s c C s� t j | j I| j r d p" d IJt j d I| j IJt j d I| j IJt j d I| j IJt j d I| j IJt j d I| j IJd S( NR t s globals: s cells: s defs: s uses: s frees:( t syst stderrR R R R R R R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt DEBUGO s %c C sy | | j k r t S| | j k r& t S| | j k r9 t S| j rd | | j k s` | | j k rd t S| j rq t St Sd S( sb Return scope of name. The scope of a name could be LOCAL, GLOBAL, FREE, or CELL. N( R R R R R R R R R R R R ( R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt check_nameW s ' c C sr | j s d Si } | j | j � xB | j j � D]1 } | | j k r3 | | j k r3 d | | <q3 q3 W| j � S( Ni ( ( R R$ R R R% R R ( R t freeR ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_free_varsi s c C sQ xJ | j D]? } | j � } | j | � } x | D] } | j | � q2 Wq Wd S( N( R R2 t add_freest force_global( R R) R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt handle_childrens s c C sf d | j | <| | j k r) | j | =n x6 | j D]+ } | j | � t k r3 | j | � q3 q3 Wd S( s� Force name to be global in scope. Some child of the current node had a free reference to name. When the child was processed, it was labelled a free variable. Now that all its enclosing scope have been processed, the name is known to be a global or builtin. So walk back down the child chain and set the name to be global rather than free. Be careful to stop if a child does not think the name is free. i N( R R R R0 R R4 ( R R R) ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR4 z s c C s g } x� | D]� } | j | � } | j r� | t k sR | t k sR t | t � rb d | j | <q | t k r~ | j | � q t | t � r� | t k r� d | j | <q | t k r | j | � q q | t k r� d | j | <q | t k r | j | � q q W| S( s� Process list of free vars from nested scope. Returns a list of names that are either 1) declared global in the parent or 2) undefined in a top-level parent. In either case, the nested scope should treat them as globals. i ( R0 R R R t isinstancet ClassScopeR R R( t FunctionScopeR R R ( R t namest child_globalsR t sc( ( s( /usr/lib64/python2.7/compiler/symbols.pyR3 � s$ c C s | j j � S( N( R R% ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt get_cell_vars� s N( R t __module__R R R R R R R" R# R' R* R+ R/ R0 R2 R5 R4 R3 R< ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR s" t ModuleScopec B s e Z e j Z d � Z RS( c C s | j d | � d S( Nt global( t _ModuleScope__super_init( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s ( R R= R R R@ ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR> � s R8 c B s e Z RS( ( R R= ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR8 � s t GenExprScopec B s, e Z e j Z d Z d d � Z d � Z RS( i c C s@ | j } | j d 7_ | j d | | | � | j d � d S( Ni s generator expression<%d>s .0( t _GenExprScope__countert _GenExprScope__super_initR# ( R R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s c C s t j | � } | S( N( R R' ( R R% ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR' � s N( R R= R R RC RB R R' ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRA � s t LambdaScopec B s# e Z e j Z d Z d d � Z RS( i c C s3 | j } | j d 7_ | j d | | | � d S( Ni s lambda.%d( t _LambdaScope__countert _LambdaScope__super_init( R R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s N( R R= R R RF RE R ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRD � s R7 c B s e Z e j Z d � Z RS( c C s | j | | | � d S( N( t _ClassScope__super_init( R R R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s ( R R= R R RG ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR7 � s t SymbolVisitorc B s e Z d � Z d � Z e Z d � Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z d � Z d d � Z d � Z d � Z d � Z d � Z d � Z d d � Z d d � Z d d � Z d d � Z d � Z e j e j e j f Z d � Z d � Z RS( c C s i | _ d | _ d S( N( t scopesR R ( R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyR � s c C s2 t � } | _ | j | <| j | j | � d S( N( R> R RI t visitt node( R RK t scope( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitModule� s c C s� | j r | j | j | � n | j | j � x! | j D] } | j | | � q9 Wt | j | j | j � } | j s� t | t � r� d | _ n | | j | <| j | | j � | j | j | � | j | | � d S( Ni ( t decoratorsRJ R R t defaultsR8 R R R R6 RI t _do_argst argnamest codet handle_free_vars( R RK t parentt nRL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitFunction� s c C s| t | j | j � } | j s< t | t � s< t | t � rH d | _ n | | j | <| j | j | � | j | | � d S( Ni ( RA R R R R6 R8 RI RJ RR RS ( R RK RT RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExpr� s c C s; x! | j D] } | j | | � q W| j | j | � d S( N( t qualsRJ t expr( R RK RL t genfor( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExprInner� s c C sQ | j | j | d � | j | j | � x! | j D] } | j | | � q3 Wd S( Ni ( RJ t assignt itert ifs( R RK RL t if_( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExprFor s c C s | j | j | � d S( N( RJ t test( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGenExprIf s i c C s� x! | j D] } | j | | � q Wt | j | j � } | j sQ t | t � r] d | _ n | | j | <| j | | j � | j | j | � | j | | � d S( Ni ( RO RJ RD R R R R6 R8 RI RP RQ RR RS ( R RK RT R\ RU RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitLambda s c C sJ xC | D]; } t | � t j k r5 | j | | � q | j | � q Wd S( N( t typet typest TupleTypeRP R# ( R RL t argsR ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRP s c C s | j | � | j � d S( N( R* R5 ( R RL RT ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRS s c C s� | j | j � x! | j D] } | j | | � q Wt | j | j � } | j sa t | t � rm d | _ n | j d k r� | j d � n | j d � | | j | <| j } | j | _ | j | j | � | | _ | j | | � d S( Ni t __doc__R= ( R R t basesRJ R7 R R R6 R8 t docR RI R RR RS ( R RK RT RU RL t prev( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitClass$ s c C s- | r | j | j � n | j | j � d S( N( R R R ( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitName; s c C s_ | j | j | d � | j | j | � | j | j | � | j r[ | j | j | � n d S( Ni ( RJ R\ t listt bodyt else_( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitForC s c C sC x< | j D]1 \ } } | d k r( q n | j | p7 | � q Wd S( Nt *( R9 R ( R RK RL R t asname( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitFromJ s c C sY xR | j D]G \ } } | j d � } | d k r> | | } n | j | pM | � q Wd S( Nt .i����( R9 t findR ( R RK RL R Rs R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitImportP s c C s% x | j D] } | j | � q Wd S( N( R9 R" ( R RK RL R ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitGlobalW s c C s> x$ | j D] } | j | | d � q W| j | j | � d S( s. Propagate assignment flag down to child nodes. The Assign node doesn't itself contains the variables being assigned to. Instead, the children in node.nodes are visited with the assign flag set to true. When the names occur in those nodes, they are marked as defs. Some names that occur in an assignment target are not bound by the assignment, e.g. a name occurring inside a slice. The visitor handles these nodes specially; they do not propagate the assign flag to their children. i N( t nodesRJ RY ( R RK RL RU ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAssign[ s i c C s | j | j � d S( N( R R ( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAssNamel s c C s | j | j | d � d S( Ni ( RJ RY ( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAssAttro s c C sA | j | j | d � x$ | j D] } | j | | d � q Wd S( Ni ( RJ RY t subs( R RK RL R\ RU ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitSubscriptr s c C s^ | j | j | d � | j r8 | j | j | d � n | j rZ | j | j | d � n d S( Ni ( RJ RY t lowert upper( R RK RL R\ ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitSlicew s c C sX | j | j | � t | j t j � rA | j | j | d � n | j | j | � d S( Ni ( RJ RK R6 R t NameRY ( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitAugAssign~ s c C s� xv | j D]k \ } } t | t j � rU t | j � | j k rU | j sR q qR qU n | j | | � | j | | � q W| j r� | j | j | � n d S( N( t testsR6 R t ConstRd t valuet _const_typesRJ Rp ( R RK RL Ra Ro ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitIf� s c C s d | _ | j | j | � d S( Ni ( R RJ R� ( R RK RL ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt visitYield� s ( R R= R RM t visitExpressionRV RW R[ R` Rb Rc RP RS Rl Rm Rq Rt Rw Rx Rz R{ R| R~ R� R� Re t StringTypet IntTypet FloatTypeR� R� R� ( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyRH � s4 c C s t | � t | � k S( N( t sorted( t l1t l2( ( s( /usr/lib64/python2.7/compiler/symbols.pyt list_eq� s t __main__( t parseFilet walkc C sT g g | j � D] } | j � ^ q D]* } | j d � pG | j d � s& | ^ q& S( Ns _[Ru ( t get_symbolst get_namet startswith( t symst s( ( s( /usr/lib64/python2.7/compiler/symbols.pyR' � s ,i t exect oopst skippingi ( ( (6 Rh t compilerR t compiler.constsR R R R R R t compiler.miscR Re R- t MANGLE_LENR R> R8 RA RD R7 RH R� R R� R� t symtableR' t argvt filet opent ft readt buft closeR� t mod_namest treeR� RI t names2R� t exitR& R$ t valuesR� t is_namespaceR; R R� t lR t get_namespace( ( ( s( /usr/lib64/python2.7/compiler/symbols.pyt <module> sj . � � ! PK s�Z��?� � misc.pyonu �[��� � { fc @ sK d � Z d d d � � YZ d d d � � YZ d Z d � Z d � Z d S( c C sJ g } x= | D]5 } t | t � r5 | t | � } q | j | � q W| S( N( t isinstancet tuplet flattent append( t tupt eltst elt( ( s% /usr/lib64/python2.7/compiler/misc.pyR s t Setc B sP e Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( c C s i | _ d S( N( R ( t self( ( s% /usr/lib64/python2.7/compiler/misc.pyt __init__ s c C s t | j � S( N( t lenR ( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt __len__ s c C s | | j k S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt __contains__ s c C s | | j | <d S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt add s c C s | j j � S( N( R t keys( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt elements s c C s | | j k S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt has_elt s c C s | j | =d S( N( R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt remove s c C s t � } | j j | j � | S( N( R R t update( R t c( ( s% /usr/lib64/python2.7/compiler/misc.pyt copy s ( t __name__t __module__R R R R R R R R ( ( ( s% /usr/lib64/python2.7/compiler/misc.pyR s t Stackc B s5 e Z d � Z d � Z d � Z d � Z d � Z RS( c C s g | _ | j j | _ d S( N( t stackt pop( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyR s c C s t | j � S( N( R R ( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyR # s c C s | j j | � d S( N( R R ( R R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt push% s c C s | j d S( Ni����( R ( R ( ( s% /usr/lib64/python2.7/compiler/misc.pyt top' s c C s | j | S( N( R ( R t index( ( s% /usr/lib64/python2.7/compiler/misc.pyt __getitem__) s ( R R R R R R R ( ( ( s% /usr/lib64/python2.7/compiler/misc.pyR s i c C s� | j d � s | St | � d t k r- | S| j d � r@ | Sy+ d } x | | d k ri | d } qL WWn t k r | SX| | } t | � t | � } | t k r� | t | } n d | | f S( Nt __i i t _i s _%s%s( t startswithR t MANGLE_LENt endswitht IndexError( t namet klasst it tlen( ( s% /usr/lib64/python2.7/compiler/misc.pyt mangle. s" c C sE | g } x5 | r@ | j d � } | | _ | j | j � � q Wd S( s< Set the filename attribute to filename on every node in treei N( R t filenamet extendt getChildNodes( R) t treet worklistt node( ( s% /usr/lib64/python2.7/compiler/misc.pyt set_filenameC s N( ( ( R R R R! R( R/ ( ( ( s% /usr/lib64/python2.7/compiler/misc.pyt <module> s PK s�Z�F�� � consts.pynu �[��� # operation flags OP_ASSIGN = 'OP_ASSIGN' OP_DELETE = 'OP_DELETE' OP_APPLY = 'OP_APPLY' SC_LOCAL = 1 SC_GLOBAL_IMPLICIT = 2 SC_GLOBAL_EXPLICIT = 3 SC_FREE = 4 SC_CELL = 5 SC_UNKNOWN = 6 CO_OPTIMIZED = 0x0001 CO_NEWLOCALS = 0x0002 CO_VARARGS = 0x0004 CO_VARKEYWORDS = 0x0008 CO_NESTED = 0x0010 CO_GENERATOR = 0x0020 CO_GENERATOR_ALLOWED = 0 CO_FUTURE_DIVISION = 0x2000 CO_FUTURE_ABSIMPORT = 0x4000 CO_FUTURE_WITH_STATEMENT = 0x8000 CO_FUTURE_PRINT_FUNCTION = 0x10000 PK s�Z�ޒ�� �� ast.pynu �[��� """Python abstract syntax node definitions This file is automatically generated by Tools/compiler/astgen.py """ from compiler.consts import CO_VARARGS, CO_VARKEYWORDS def flatten(seq): l = [] for elt in seq: t = type(elt) if t is tuple or t is list: for elt2 in flatten(elt): l.append(elt2) else: l.append(elt) return l def flatten_nodes(seq): return [n for n in flatten(seq) if isinstance(n, Node)] nodes = {} class Node: """Abstract base class for ast nodes.""" def getChildren(self): pass # implemented by subclasses def __iter__(self): for n in self.getChildren(): yield n def asList(self): # for backwards compatibility return self.getChildren() def getChildNodes(self): pass # implemented by subclasses class EmptyNode(Node): pass class Expression(Node): # Expression is an artificial node class to support "eval" nodes["expression"] = "Expression" def __init__(self, node): self.node = node def getChildren(self): return self.node, def getChildNodes(self): return self.node, def __repr__(self): return "Expression(%s)" % (repr(self.node)) class Add(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "Add((%s, %s))" % (repr(self.left), repr(self.right)) class And(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "And(%s)" % (repr(self.nodes),) class AssAttr(Node): def __init__(self, expr, attrname, flags, lineno=None): self.expr = expr self.attrname = attrname self.flags = flags self.lineno = lineno def getChildren(self): return self.expr, self.attrname, self.flags def getChildNodes(self): return self.expr, def __repr__(self): return "AssAttr(%s, %s, %s)" % (repr(self.expr), repr(self.attrname), repr(self.flags)) class AssList(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "AssList(%s)" % (repr(self.nodes),) class AssName(Node): def __init__(self, name, flags, lineno=None): self.name = name self.flags = flags self.lineno = lineno def getChildren(self): return self.name, self.flags def getChildNodes(self): return () def __repr__(self): return "AssName(%s, %s)" % (repr(self.name), repr(self.flags)) class AssTuple(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "AssTuple(%s)" % (repr(self.nodes),) class Assert(Node): def __init__(self, test, fail, lineno=None): self.test = test self.fail = fail self.lineno = lineno def getChildren(self): children = [] children.append(self.test) children.append(self.fail) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.test) if self.fail is not None: nodelist.append(self.fail) return tuple(nodelist) def __repr__(self): return "Assert(%s, %s)" % (repr(self.test), repr(self.fail)) class Assign(Node): def __init__(self, nodes, expr, lineno=None): self.nodes = nodes self.expr = expr self.lineno = lineno def getChildren(self): children = [] children.extend(flatten(self.nodes)) children.append(self.expr) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) nodelist.append(self.expr) return tuple(nodelist) def __repr__(self): return "Assign(%s, %s)" % (repr(self.nodes), repr(self.expr)) class AugAssign(Node): def __init__(self, node, op, expr, lineno=None): self.node = node self.op = op self.expr = expr self.lineno = lineno def getChildren(self): return self.node, self.op, self.expr def getChildNodes(self): return self.node, self.expr def __repr__(self): return "AugAssign(%s, %s, %s)" % (repr(self.node), repr(self.op), repr(self.expr)) class Backquote(Node): def __init__(self, expr, lineno=None): self.expr = expr self.lineno = lineno def getChildren(self): return self.expr, def getChildNodes(self): return self.expr, def __repr__(self): return "Backquote(%s)" % (repr(self.expr),) class Bitand(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Bitand(%s)" % (repr(self.nodes),) class Bitor(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Bitor(%s)" % (repr(self.nodes),) class Bitxor(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Bitxor(%s)" % (repr(self.nodes),) class Break(Node): def __init__(self, lineno=None): self.lineno = lineno def getChildren(self): return () def getChildNodes(self): return () def __repr__(self): return "Break()" class CallFunc(Node): def __init__(self, node, args, star_args = None, dstar_args = None, lineno=None): self.node = node self.args = args self.star_args = star_args self.dstar_args = dstar_args self.lineno = lineno def getChildren(self): children = [] children.append(self.node) children.extend(flatten(self.args)) children.append(self.star_args) children.append(self.dstar_args) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.node) nodelist.extend(flatten_nodes(self.args)) if self.star_args is not None: nodelist.append(self.star_args) if self.dstar_args is not None: nodelist.append(self.dstar_args) return tuple(nodelist) def __repr__(self): return "CallFunc(%s, %s, %s, %s)" % (repr(self.node), repr(self.args), repr(self.star_args), repr(self.dstar_args)) class Class(Node): def __init__(self, name, bases, doc, code, decorators = None, lineno=None): self.name = name self.bases = bases self.doc = doc self.code = code self.decorators = decorators self.lineno = lineno def getChildren(self): children = [] children.append(self.name) children.extend(flatten(self.bases)) children.append(self.doc) children.append(self.code) children.append(self.decorators) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.bases)) nodelist.append(self.code) if self.decorators is not None: nodelist.append(self.decorators) return tuple(nodelist) def __repr__(self): return "Class(%s, %s, %s, %s, %s)" % (repr(self.name), repr(self.bases), repr(self.doc), repr(self.code), repr(self.decorators)) class Compare(Node): def __init__(self, expr, ops, lineno=None): self.expr = expr self.ops = ops self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.extend(flatten(self.ops)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) nodelist.extend(flatten_nodes(self.ops)) return tuple(nodelist) def __repr__(self): return "Compare(%s, %s)" % (repr(self.expr), repr(self.ops)) class Const(Node): def __init__(self, value, lineno=None): self.value = value self.lineno = lineno def getChildren(self): return self.value, def getChildNodes(self): return () def __repr__(self): return "Const(%s)" % (repr(self.value),) class Continue(Node): def __init__(self, lineno=None): self.lineno = lineno def getChildren(self): return () def getChildNodes(self): return () def __repr__(self): return "Continue()" class Decorators(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Decorators(%s)" % (repr(self.nodes),) class Dict(Node): def __init__(self, items, lineno=None): self.items = items self.lineno = lineno def getChildren(self): return tuple(flatten(self.items)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.items)) return tuple(nodelist) def __repr__(self): return "Dict(%s)" % (repr(self.items),) class Discard(Node): def __init__(self, expr, lineno=None): self.expr = expr self.lineno = lineno def getChildren(self): return self.expr, def getChildNodes(self): return self.expr, def __repr__(self): return "Discard(%s)" % (repr(self.expr),) class Div(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "Div((%s, %s))" % (repr(self.left), repr(self.right)) class Ellipsis(Node): def __init__(self, lineno=None): self.lineno = lineno def getChildren(self): return () def getChildNodes(self): return () def __repr__(self): return "Ellipsis()" class Exec(Node): def __init__(self, expr, locals, globals, lineno=None): self.expr = expr self.locals = locals self.globals = globals self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.append(self.locals) children.append(self.globals) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) if self.locals is not None: nodelist.append(self.locals) if self.globals is not None: nodelist.append(self.globals) return tuple(nodelist) def __repr__(self): return "Exec(%s, %s, %s)" % (repr(self.expr), repr(self.locals), repr(self.globals)) class FloorDiv(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "FloorDiv((%s, %s))" % (repr(self.left), repr(self.right)) class For(Node): def __init__(self, assign, list, body, else_, lineno=None): self.assign = assign self.list = list self.body = body self.else_ = else_ self.lineno = lineno def getChildren(self): children = [] children.append(self.assign) children.append(self.list) children.append(self.body) children.append(self.else_) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.assign) nodelist.append(self.list) nodelist.append(self.body) if self.else_ is not None: nodelist.append(self.else_) return tuple(nodelist) def __repr__(self): return "For(%s, %s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.body), repr(self.else_)) class From(Node): def __init__(self, modname, names, level, lineno=None): self.modname = modname self.names = names self.level = level self.lineno = lineno def getChildren(self): return self.modname, self.names, self.level def getChildNodes(self): return () def __repr__(self): return "From(%s, %s, %s)" % (repr(self.modname), repr(self.names), repr(self.level)) class Function(Node): def __init__(self, decorators, name, argnames, defaults, flags, doc, code, lineno=None): self.decorators = decorators self.name = name self.argnames = argnames self.defaults = defaults self.flags = flags self.doc = doc self.code = code self.lineno = lineno self.varargs = self.kwargs = None if flags & CO_VARARGS: self.varargs = 1 if flags & CO_VARKEYWORDS: self.kwargs = 1 def getChildren(self): children = [] children.append(self.decorators) children.append(self.name) children.append(self.argnames) children.extend(flatten(self.defaults)) children.append(self.flags) children.append(self.doc) children.append(self.code) return tuple(children) def getChildNodes(self): nodelist = [] if self.decorators is not None: nodelist.append(self.decorators) nodelist.extend(flatten_nodes(self.defaults)) nodelist.append(self.code) return tuple(nodelist) def __repr__(self): return "Function(%s, %s, %s, %s, %s, %s, %s)" % (repr(self.decorators), repr(self.name), repr(self.argnames), repr(self.defaults), repr(self.flags), repr(self.doc), repr(self.code)) class GenExpr(Node): def __init__(self, code, lineno=None): self.code = code self.lineno = lineno self.argnames = ['.0'] self.varargs = self.kwargs = None def getChildren(self): return self.code, def getChildNodes(self): return self.code, def __repr__(self): return "GenExpr(%s)" % (repr(self.code),) class GenExprFor(Node): def __init__(self, assign, iter, ifs, lineno=None): self.assign = assign self.iter = iter self.ifs = ifs self.lineno = lineno self.is_outmost = False def getChildren(self): children = [] children.append(self.assign) children.append(self.iter) children.extend(flatten(self.ifs)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.assign) nodelist.append(self.iter) nodelist.extend(flatten_nodes(self.ifs)) return tuple(nodelist) def __repr__(self): return "GenExprFor(%s, %s, %s)" % (repr(self.assign), repr(self.iter), repr(self.ifs)) class GenExprIf(Node): def __init__(self, test, lineno=None): self.test = test self.lineno = lineno def getChildren(self): return self.test, def getChildNodes(self): return self.test, def __repr__(self): return "GenExprIf(%s)" % (repr(self.test),) class GenExprInner(Node): def __init__(self, expr, quals, lineno=None): self.expr = expr self.quals = quals self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.extend(flatten(self.quals)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) nodelist.extend(flatten_nodes(self.quals)) return tuple(nodelist) def __repr__(self): return "GenExprInner(%s, %s)" % (repr(self.expr), repr(self.quals)) class Getattr(Node): def __init__(self, expr, attrname, lineno=None): self.expr = expr self.attrname = attrname self.lineno = lineno def getChildren(self): return self.expr, self.attrname def getChildNodes(self): return self.expr, def __repr__(self): return "Getattr(%s, %s)" % (repr(self.expr), repr(self.attrname)) class Global(Node): def __init__(self, names, lineno=None): self.names = names self.lineno = lineno def getChildren(self): return self.names, def getChildNodes(self): return () def __repr__(self): return "Global(%s)" % (repr(self.names),) class If(Node): def __init__(self, tests, else_, lineno=None): self.tests = tests self.else_ = else_ self.lineno = lineno def getChildren(self): children = [] children.extend(flatten(self.tests)) children.append(self.else_) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.tests)) if self.else_ is not None: nodelist.append(self.else_) return tuple(nodelist) def __repr__(self): return "If(%s, %s)" % (repr(self.tests), repr(self.else_)) class IfExp(Node): def __init__(self, test, then, else_, lineno=None): self.test = test self.then = then self.else_ = else_ self.lineno = lineno def getChildren(self): return self.test, self.then, self.else_ def getChildNodes(self): return self.test, self.then, self.else_ def __repr__(self): return "IfExp(%s, %s, %s)" % (repr(self.test), repr(self.then), repr(self.else_)) class Import(Node): def __init__(self, names, lineno=None): self.names = names self.lineno = lineno def getChildren(self): return self.names, def getChildNodes(self): return () def __repr__(self): return "Import(%s)" % (repr(self.names),) class Invert(Node): def __init__(self, expr, lineno=None): self.expr = expr self.lineno = lineno def getChildren(self): return self.expr, def getChildNodes(self): return self.expr, def __repr__(self): return "Invert(%s)" % (repr(self.expr),) class Keyword(Node): def __init__(self, name, expr, lineno=None): self.name = name self.expr = expr self.lineno = lineno def getChildren(self): return self.name, self.expr def getChildNodes(self): return self.expr, def __repr__(self): return "Keyword(%s, %s)" % (repr(self.name), repr(self.expr)) class Lambda(Node): def __init__(self, argnames, defaults, flags, code, lineno=None): self.argnames = argnames self.defaults = defaults self.flags = flags self.code = code self.lineno = lineno self.varargs = self.kwargs = None if flags & CO_VARARGS: self.varargs = 1 if flags & CO_VARKEYWORDS: self.kwargs = 1 def getChildren(self): children = [] children.append(self.argnames) children.extend(flatten(self.defaults)) children.append(self.flags) children.append(self.code) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.defaults)) nodelist.append(self.code) return tuple(nodelist) def __repr__(self): return "Lambda(%s, %s, %s, %s)" % (repr(self.argnames), repr(self.defaults), repr(self.flags), repr(self.code)) class LeftShift(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "LeftShift((%s, %s))" % (repr(self.left), repr(self.right)) class List(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "List(%s)" % (repr(self.nodes),) class ListComp(Node): def __init__(self, expr, quals, lineno=None): self.expr = expr self.quals = quals self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.extend(flatten(self.quals)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) nodelist.extend(flatten_nodes(self.quals)) return tuple(nodelist) def __repr__(self): return "ListComp(%s, %s)" % (repr(self.expr), repr(self.quals)) class ListCompFor(Node): def __init__(self, assign, list, ifs, lineno=None): self.assign = assign self.list = list self.ifs = ifs self.lineno = lineno def getChildren(self): children = [] children.append(self.assign) children.append(self.list) children.extend(flatten(self.ifs)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.assign) nodelist.append(self.list) nodelist.extend(flatten_nodes(self.ifs)) return tuple(nodelist) def __repr__(self): return "ListCompFor(%s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.ifs)) class ListCompIf(Node): def __init__(self, test, lineno=None): self.test = test self.lineno = lineno def getChildren(self): return self.test, def getChildNodes(self): return self.test, def __repr__(self): return "ListCompIf(%s)" % (repr(self.test),) class SetComp(Node): def __init__(self, expr, quals, lineno=None): self.expr = expr self.quals = quals self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.extend(flatten(self.quals)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) nodelist.extend(flatten_nodes(self.quals)) return tuple(nodelist) def __repr__(self): return "SetComp(%s, %s)" % (repr(self.expr), repr(self.quals)) class DictComp(Node): def __init__(self, key, value, quals, lineno=None): self.key = key self.value = value self.quals = quals self.lineno = lineno def getChildren(self): children = [] children.append(self.key) children.append(self.value) children.extend(flatten(self.quals)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.key) nodelist.append(self.value) nodelist.extend(flatten_nodes(self.quals)) return tuple(nodelist) def __repr__(self): return "DictComp(%s, %s, %s)" % (repr(self.key), repr(self.value), repr(self.quals)) class Mod(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "Mod((%s, %s))" % (repr(self.left), repr(self.right)) class Module(Node): def __init__(self, doc, node, lineno=None): self.doc = doc self.node = node self.lineno = lineno def getChildren(self): return self.doc, self.node def getChildNodes(self): return self.node, def __repr__(self): return "Module(%s, %s)" % (repr(self.doc), repr(self.node)) class Mul(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "Mul((%s, %s))" % (repr(self.left), repr(self.right)) class Name(Node): def __init__(self, name, lineno=None): self.name = name self.lineno = lineno def getChildren(self): return self.name, def getChildNodes(self): return () def __repr__(self): return "Name(%s)" % (repr(self.name),) class Not(Node): def __init__(self, expr, lineno=None): self.expr = expr self.lineno = lineno def getChildren(self): return self.expr, def getChildNodes(self): return self.expr, def __repr__(self): return "Not(%s)" % (repr(self.expr),) class Or(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Or(%s)" % (repr(self.nodes),) class Pass(Node): def __init__(self, lineno=None): self.lineno = lineno def getChildren(self): return () def getChildNodes(self): return () def __repr__(self): return "Pass()" class Power(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "Power((%s, %s))" % (repr(self.left), repr(self.right)) class Print(Node): def __init__(self, nodes, dest, lineno=None): self.nodes = nodes self.dest = dest self.lineno = lineno def getChildren(self): children = [] children.extend(flatten(self.nodes)) children.append(self.dest) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) if self.dest is not None: nodelist.append(self.dest) return tuple(nodelist) def __repr__(self): return "Print(%s, %s)" % (repr(self.nodes), repr(self.dest)) class Printnl(Node): def __init__(self, nodes, dest, lineno=None): self.nodes = nodes self.dest = dest self.lineno = lineno def getChildren(self): children = [] children.extend(flatten(self.nodes)) children.append(self.dest) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) if self.dest is not None: nodelist.append(self.dest) return tuple(nodelist) def __repr__(self): return "Printnl(%s, %s)" % (repr(self.nodes), repr(self.dest)) class Raise(Node): def __init__(self, expr1, expr2, expr3, lineno=None): self.expr1 = expr1 self.expr2 = expr2 self.expr3 = expr3 self.lineno = lineno def getChildren(self): children = [] children.append(self.expr1) children.append(self.expr2) children.append(self.expr3) return tuple(children) def getChildNodes(self): nodelist = [] if self.expr1 is not None: nodelist.append(self.expr1) if self.expr2 is not None: nodelist.append(self.expr2) if self.expr3 is not None: nodelist.append(self.expr3) return tuple(nodelist) def __repr__(self): return "Raise(%s, %s, %s)" % (repr(self.expr1), repr(self.expr2), repr(self.expr3)) class Return(Node): def __init__(self, value, lineno=None): self.value = value self.lineno = lineno def getChildren(self): return self.value, def getChildNodes(self): return self.value, def __repr__(self): return "Return(%s)" % (repr(self.value),) class RightShift(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "RightShift((%s, %s))" % (repr(self.left), repr(self.right)) class Set(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Set(%s)" % (repr(self.nodes),) class Slice(Node): def __init__(self, expr, flags, lower, upper, lineno=None): self.expr = expr self.flags = flags self.lower = lower self.upper = upper self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.append(self.flags) children.append(self.lower) children.append(self.upper) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) if self.lower is not None: nodelist.append(self.lower) if self.upper is not None: nodelist.append(self.upper) return tuple(nodelist) def __repr__(self): return "Slice(%s, %s, %s, %s)" % (repr(self.expr), repr(self.flags), repr(self.lower), repr(self.upper)) class Sliceobj(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Sliceobj(%s)" % (repr(self.nodes),) class Stmt(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Stmt(%s)" % (repr(self.nodes),) class Sub(Node): def __init__(self, leftright, lineno=None): self.left = leftright[0] self.right = leftright[1] self.lineno = lineno def getChildren(self): return self.left, self.right def getChildNodes(self): return self.left, self.right def __repr__(self): return "Sub((%s, %s))" % (repr(self.left), repr(self.right)) class Subscript(Node): def __init__(self, expr, flags, subs, lineno=None): self.expr = expr self.flags = flags self.subs = subs self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.append(self.flags) children.extend(flatten(self.subs)) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) nodelist.extend(flatten_nodes(self.subs)) return tuple(nodelist) def __repr__(self): return "Subscript(%s, %s, %s)" % (repr(self.expr), repr(self.flags), repr(self.subs)) class TryExcept(Node): def __init__(self, body, handlers, else_, lineno=None): self.body = body self.handlers = handlers self.else_ = else_ self.lineno = lineno def getChildren(self): children = [] children.append(self.body) children.extend(flatten(self.handlers)) children.append(self.else_) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.body) nodelist.extend(flatten_nodes(self.handlers)) if self.else_ is not None: nodelist.append(self.else_) return tuple(nodelist) def __repr__(self): return "TryExcept(%s, %s, %s)" % (repr(self.body), repr(self.handlers), repr(self.else_)) class TryFinally(Node): def __init__(self, body, final, lineno=None): self.body = body self.final = final self.lineno = lineno def getChildren(self): return self.body, self.final def getChildNodes(self): return self.body, self.final def __repr__(self): return "TryFinally(%s, %s)" % (repr(self.body), repr(self.final)) class Tuple(Node): def __init__(self, nodes, lineno=None): self.nodes = nodes self.lineno = lineno def getChildren(self): return tuple(flatten(self.nodes)) def getChildNodes(self): nodelist = [] nodelist.extend(flatten_nodes(self.nodes)) return tuple(nodelist) def __repr__(self): return "Tuple(%s)" % (repr(self.nodes),) class UnaryAdd(Node): def __init__(self, expr, lineno=None): self.expr = expr self.lineno = lineno def getChildren(self): return self.expr, def getChildNodes(self): return self.expr, def __repr__(self): return "UnaryAdd(%s)" % (repr(self.expr),) class UnarySub(Node): def __init__(self, expr, lineno=None): self.expr = expr self.lineno = lineno def getChildren(self): return self.expr, def getChildNodes(self): return self.expr, def __repr__(self): return "UnarySub(%s)" % (repr(self.expr),) class While(Node): def __init__(self, test, body, else_, lineno=None): self.test = test self.body = body self.else_ = else_ self.lineno = lineno def getChildren(self): children = [] children.append(self.test) children.append(self.body) children.append(self.else_) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.test) nodelist.append(self.body) if self.else_ is not None: nodelist.append(self.else_) return tuple(nodelist) def __repr__(self): return "While(%s, %s, %s)" % (repr(self.test), repr(self.body), repr(self.else_)) class With(Node): def __init__(self, expr, vars, body, lineno=None): self.expr = expr self.vars = vars self.body = body self.lineno = lineno def getChildren(self): children = [] children.append(self.expr) children.append(self.vars) children.append(self.body) return tuple(children) def getChildNodes(self): nodelist = [] nodelist.append(self.expr) if self.vars is not None: nodelist.append(self.vars) nodelist.append(self.body) return tuple(nodelist) def __repr__(self): return "With(%s, %s, %s)" % (repr(self.expr), repr(self.vars), repr(self.body)) class Yield(Node): def __init__(self, value, lineno=None): self.value = value self.lineno = lineno def getChildren(self): return self.value, def getChildNodes(self): return self.value, def __repr__(self): return "Yield(%s)" % (repr(self.value),) for name, obj in globals().items(): if isinstance(obj, type) and issubclass(obj, Node): nodes[name.lower()] = obj PK s�Z�.�� � � transformer.pycnu �[��� � { fc ) @ sf d Z d d l Td d l Z d d l Z d d l Z d e f d � � YZ d d l m Z m Z d d l m Z m Z m Z d � Z d d � Z d � Z d � Z d � Z d f d � � YZ e j e j e j e j e j e j e j e j e j e j e j e j e j e j e j! e j" g Z# i d e j$ 6d e j% 6d e j& 6d e j' 6d e j( 6d e j) 6d e j* 6Z+ e j, e j- e j. e j/ e j0 e j1 e j2 e j e j3 e j4 e j5 e j6 e j7 e j8 e j9 e j: e j; e j< e j= e j> e j? e j@ e jA e jB e jC e j e j e j e j e j e j e jD e j e j e j e j e j e j e j! e j" e jE g) ZF eG e d � r�eF jH e jI � n eG e d � r�eF jH e jJ � n e j e j e j e j e j e j e j e j e j e j e j e j! g ZK i ZL x' e jM jN � D] \ ZO ZP eP eL eO <qWx' e jQ jN � D] \ ZO ZP eP eL eO <q?Wd � ZR d S( s� Parse tree transformation module. Transforms Python source code into an abstract syntax tree (AST) defined in the ast module. The simplest ways to invoke this module are via parse and parseFile. parse(buf) -> AST parseFile(path) -> AST i����( t *Nt WalkerErrorc B s e Z RS( ( t __name__t __module__( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR ! s ( t CO_VARARGSt CO_VARKEYWORDS( t OP_ASSIGNt OP_DELETEt OP_APPLYc C s3 t | d � } | j � d } | j � t | � S( Nt Us ( t opent readt closet parse( t patht ft src( ( s, /usr/lib64/python2.7/compiler/transformer.pyt parseFile' s t execc C sT | d k s | d k r( t � j | � S| d k rD t � j | � St d � � d S( NR t singlet evals4 compile() arg 3 must be 'exec' or 'eval' or 'single'( t Transformert parsesuitet parseexprt ValueError( t buft mode( ( s, /usr/lib64/python2.7/compiler/transformer.pyR 1 s c C s� g } x� | D]� } t | d � r8 | j | j � � q t | � t d � k rl | j t t | � � � q t | � t g � k r� | j t | � � q | j | � q W| S( Nt asList( NN( t hasattrt appendR t typet Nonet tuple( t nodest lt item( ( s, /usr/lib64/python2.7/compiler/transformer.pyR : s c C sb t | d t � s | d Sx@ | d D]4 } t | t � r& t | � } | d k rZ | Sq& q& Wd S( Ni i ( t isinstanceR t extractLineNoR ( t astt childt lineno( ( s, /usr/lib64/python2.7/compiler/transformer.pyR% H s c G st | d } | t k r] y t | | d � SWqp t k rY t | Gt | � G| GH� qp Xn t d t | � � d S( Ni i s$ Can't find appropriate Node type: %s( R! t TypeErrort lenR t str( t argst kind( ( s, /usr/lib64/python2.7/compiler/transformer.pyt NodeR s R c B sU e Z d Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z e Z d � Z d � Z e Z e Z e Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z! d � Z" d � Z# d � Z$ d � Z% d � Z& d! � Z' d" � Z( d# � Z) d$ � Z* d% � Z+ d& � Z, d' � Z- d( � Z. d) � Z/ d* � Z0 d+ � Z1 d, � Z2 d- � Z3 d. � Z4 d/ � Z5 d0 � Z6 d1 � Z7 d2 � Z8 d3 � Z9 e9 Z: e9 Z; e9 Z< d4 � Z= d5 � Z> d6 � Z? e? Z@ d7 � ZA d8 � ZB d9 � ZC d: � ZD d; � ZE d< � ZF d= � ZG d> � ZH d? � ZI d@ � ZJ dA � ZK dB � ZL dC � ZM dD � ZN dE � ZO dF � ZP dG � ZQ dH � ZR dI � ZS dJ � ZT dK � ZU dL � ZV dM � ZW dN � ZX dO � ZY dP � ZZ dQ � Z[ dR � Z\ dS � Z] dT � Z^ dU � Z_ dV � Z` dW � Za dX � Zb dY � Zc dZ � Zd d[ � Ze d\ � Zf d] � Zg d^ � Zh d_ � Zi d` � Zj da � Zk db � Zl dc � Zm dd � Zn de � Zo df � Zp dg � Zq dh � Zr di � Zs dj � Zt dk � Zu dl � Zv dm � Zw dn � Zx do � Zy dp � Zz dq � Z{ dr � Z| ds � Z} du dt � Z RS(v s� Utility object for transforming Python parse trees. Exposes the following methods: tree = transform(ast_tree) tree = parsesuite(text) tree = parseexpr(text) tree = parsefile(fileob | filename) c C s� i | _ xE t j j � D]4 \ } } t | | � r t | | � | j | <q q W| j | j t j <i | j t j 6| j t j 6| j t j 6| j t j 6| j t j 6| j t j 6| j t j 6| _ d | _ d S( N( t _dispatcht symbolt sym_namet itemsR t getattrt com_NEWLINEt tokent NEWLINEt atom_lpart LPARt atom_lsqbt LSQBt atom_lbracet LBRACEt atom_backquotet BACKQUOTEt atom_numbert NUMBERt atom_stringt STRINGt atom_namet NAMEt _atom_dispatchR t encoding( t selft valuet name( ( s, /usr/lib64/python2.7/compiler/transformer.pyt __init__h s c C sC t | t � p t | t � s6 t j | d d �} n | j | � S( s, Transform an AST into a modified parse tree.t line_infoi ( R$ R t listt parsert st2tuplet compile_node( RG t tree( ( s, /usr/lib64/python2.7/compiler/transformer.pyt transformx s c C s | j t j | � � S( s6 Return a modified parse tree for the given suite text.( RQ RM t suite( RG t text( ( s, /usr/lib64/python2.7/compiler/transformer.pyR ~ s c C s | j t j | � � S( s; Return a modified parse tree for the given expression text.( RQ RM t expr( RG RS ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR � s c C s: t | � t d � k r' t | � } n | j | j � � S( s@ Return a modified parse tree for the contents of the given file.t ( R R R R ( RG t file( ( s, /usr/lib64/python2.7/compiler/transformer.pyt parsefile� s c C s | d } | t j k r= | d | _ | d } | d } n | t j k r] | j | d � S| t j k r} | j | d � S| t j k r� | j | d � S| t j k r� | j | d � S| t j k r� | j | d � S| t j k r� | j | d � St d | f � d S( Ni i i s unexpected node type( R0 t encoding_declRF t single_inputt file_inputt eval_inputt lambdeft funcdeft classdefR ( RG t nodet n( ( s, /usr/lib64/python2.7/compiler/transformer.pyRO � s$ c C s5 | d d } | t j k r. | j | d � St � S( Ni ( R5 R6 t com_stmtt Pass( RG R_ R` ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRY � s c C s� | j | t j � } | d k r* d } n d } g } xK | | D]? } | d t j k rA | d t j k rA | j | | � qA qA Wt | t | � � S( Ni i ( t get_docstringR0 RZ R R5 t ENDMARKERR6 t com_append_stmtt Modulet Stmt( RG t nodelistt doct it stmtsR_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRZ � s &c C s t | j | d � � S( Ni ( t Expressiont com_node( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR[ � s c C s� t | � } | d k r( | d d k s. t � | j | � } d } xs | | k r� | | d t j k so t � | | d d t j k s� t � t | | | d d � } | d 7} qF W| S( Ni i i ( R* t AssertionErrorRC R5 t DOTRD t Getattr( RG Rh t listlenR# Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorator_name� s " !c C s� t | � d k s t � | d d t j k s5 t � | d d t j k sR t � | d d t j k so t � | j | d d � } t | � d k r� | d d t j k s� t � | j | | d � } n | } | S( Ni i i i i����i i ( i i i ( R* Rn R5 t ATR6 R0 t dotted_nameRr R8 t com_call_function( RG Rh t funcnameRT ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorator� s c C sT g } xA | D]9 } | d t j k s, t � | j | j | d � � q Wt | � S( Ni i ( R0 Rw Rn R t Decorators( RG Rh R2 t dec_nodelist( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorators� s c C s� | d d t j k s t � | d d t j k r` | d g t | d d � } | j | � S| d d t j k r� | j | d d � } | j | d d � } | | _ | St � � d S( Ni i ( R0 Rz Rn R] RL R^ R ( RG Rh R` Rz t cls( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decorated� s c C se t | � d k rI | d d t j k s/ t � | j | d d � } n t | � d k sa t � d } | d d } | d d } | d d } | d t j k r� | j | d � \ } } } n d } } d } | j | d � } | j | d � } | d k rCt | t � st � t | j d t � s6t � | j d =n t | | | | | | | d | �S( Ni i i i i����i i����i����R( ( ( R* R0 Rz Rn R t varargslistt com_arglistRc Rm R$ Rg R! t Discardt Function( RG Rh Rz R( RI R, t namest defaultst flagsRi t code( ( s, /usr/lib64/python2.7/compiler/transformer.pyR] � s( c C s~ | d d t j k r: | j | d d � \ } } } n d } } d } | j | d � } t | | | | d | d d �S( Ni i i i����R( ( ( R0 R} R~ Rm t Lambda( RG Rh R� R� R� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR\ s # c C s� | d d } | j | d � } | d d t j k rA g } n3 | d d t j k ra g } n | j | d � } | j | d � } | d k r� t | t � s� t � t | j d t � s� t � | j d =n t | | | | d | d d �S( Ni i����i i i R( ( Rc R5 t COLONt RPARt com_basesRm R R$ Rg Rn R! R t Class( RG Rh RI Ri t basesR� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR^ & s c C s | j | d � S( Ni ( Ra ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt stmt< s c C sG g } x4 t d t | � d � D] } | j | | | � q Wt | � S( Ni i ( t rangeR* Re Rg ( RG Rh Rk Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt simple_stmtC s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt parametersJ s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR} M s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt fpdefP s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt fplistS s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRt V s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt comp_opY s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt trailer\ s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt sliceop_ s c C s t � d S( N( R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt argumentb s c C s | d } | j | � | d � } t | � d k rH t | d | j �S| d d t j k r� g } xA t d t | � d d � D]# } | j | j | | t � � q� Wt | | d | d d �S| j | d � } | j | d � } t | | d | d | d �St d � d S( Ni����i R( i i s can't get here( t lookup_nodeR* R R( R5 t EQUALR� R t com_assignR t Assignt com_augassignt com_augassign_opt AugAssignR ( RG Rh t ent exprNodet nodeslRj t lvalt op( ( s, /usr/lib64/python2.7/compiler/transformer.pyt expr_stmtj s #! c C s g } t | � d k r' d } d } nn | d d t j k r� t | � d k sm | d d t j k sm t � | j | d � } d } n d } d } x: t | t | � d � D] } | j | j | | � � q� W| d d t j k rt | | d | d d �St | | d | d d �S( Ni i i i i i����R( ( R* R R5 t RIGHTSHIFTt COMMARn Rm R� R t Printt Printnl( RG Rh R2 t startt destRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt print_stmt{ s c C s | j | d t � S( Ni ( R� R ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt del_stmt� s c C s t d | d d � S( NR( i i ( Rb ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt pass_stmt� s c C s t d | d d � S( NR( i i ( t Break( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt break_stmt� s c C s t d | d d � S( NR( i i ( t Continue( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt continue_stmt� s c C sU t | � d k r0 t t d � d | d d �St | j | d � d | d d �S( Ni R( i i ( R* t Returnt ConstR Rm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt return_stmt� s c C s& | j | d � } t | d | j �S( Ni R( ( Rm R R( ( RG Rh RT ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt yield_stmt� s c C sL t | � d k r( | j | d � } n t d � } t | d | d d �S( Ni R( i i ( R* Rm R� R t Yield( RG Rh RH ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt yield_expr� s c C s� t | � d k r( | j | d � } n d } t | � d k rV | j | d � } n d } t | � d k r� | j | d � } n d } t | | | d | d d �S( Ni i i R( i i ( R* Rm R t Raise( RG Rh t expr3t expr2t expr1( ( s, /usr/lib64/python2.7/compiler/transformer.pyt raise_stmt� s c C s) t | � d k s t � | j | d � S( Ni i ( R* Rn Rm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt import_stmt� s c C s% t | j | d � d | d d �S( Ni R( i i ( t Importt com_dotted_as_names( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt import_name� s c C s4 | d d d k s t � d } x" | | d d k rD | d 7} q# W| d } | | d t j k r� | j | | � } | d 7} n d } | | d d k s� t � | | d d t j k r� t | d g | d | d d �S| | d | | d d t j k } t | | j | � | d | d d �Sd S( Ni i t fromt .RU t importR R( i ( R N( Rn R0 Rt t com_dotted_nameR5 t STARt FromR R8 t com_import_as_names( RG Rh t idxt levelt fromnameR_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt import_from� s 'c C sV g } x5 t d t | � d � D] } | j | | d � q Wt | d | d d �S( Ni i R( i ( R� R* R t Global( RG Rh R� Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt global_stmt� s c C s� | j | d � } t | � d k ri | j | d � } t | � d k r` | j | d � } qs d } n d } } t | | | d | d d �S( Ni i i i i R( i i ( Rm R* R t Exec( RG Rh R� R� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt exec_stmt� s c C s\ | j | d � } t | � d k r; | j | d � } n d } t | | d | d d �S( Ni i i R( i i ( Rm R* R t Assert( RG Rh R� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt assert_stmt� s c C s� g } xe t d t | � d d � D]G } | j | | d � } | j | | d � } | j | | f � q# Wt | � d d k r� | j | d � } n d } t | | d | d d �S( Ni i i i i����R( i ( R� R* Rm R R t If( RG Rh t testsRj t testNodet suiteNodet elseNode( ( s, /usr/lib64/python2.7/compiler/transformer.pyt if_stmt� s #c C sr | j | d � } | j | d � } t | � d k rN | j | d � } n d } t | | | d | d d �S( Ni i i i R( i i ( Rm R* R t While( RG Rh R� t bodyNodeR� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt while_stmt s c C s� | j | d t � } | j | d � } | j | d � } t | � d k rd | j | d � } n d } t | | | | d | d d �S( Ni i i i R( i i ( R� R Rm R* R t For( RG Rh t assignNodet listNodeR� R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt for_stmt s c C s | j | � S( N( t com_try_except_finally( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt try_stmt% s c C s | j | � S( N( t com_with( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt with_stmt( s c C s | j | � S( N( t com_with_var( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt with_var+ s c C sj t | � d k r# | j | d � Sg } x4 | D], } | d t j k r0 | j | | � q0 q0 Wt | � S( Ni i ( R* Ra R0 R� Re Rg ( RG Rh Rk R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRR . s c C s | j t | � S( N( t com_binaryt Tuple( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt testlist> s c C sz | d d t j k s t � t | � d k rm | d d t j k rm | j | d � } | j | | d � S| j | � S( Ni i i ( R0 t testRn R* t comp_forRm t com_generator_expressionR� ( RG Rh R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt testlist_compH s )c C s� t | � d k r: | d d t j k r: | j | d � S| j | d � } t | � d k r� t | � d k sw t � | d d d k s� t � | d d d k s� t � | j | d � } | j | d � } t | | | d | d d �S| S( Ni i i t ifi t elsei i R( ( R* R0 R\ Rm Rn t IfExp( RG Rh t thenR� t else_( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� P s ) c C sJ t | � d k r: | d d t j k r: | j | d � S| j t | � S( Ni i ( R* R0 R\ R� t Or( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt or_test^ s )c C s | j t | � S( N( R� t And( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt and_teste s c C sA | j | d � } t | � d k r= t | d | d d �S| S( Ni����i R( i ( Rm R* t Not( RG Rh t result( ( s, /usr/lib64/python2.7/compiler/transformer.pyt not_testi s c C s | j | d � } t | � d k r) | Sg } x� t d t | � d � D]� } | | d } | d } | d t j k r� | d } t | � d k r� | d k r� d } q� d } q� n t | d } | d d } | j | | j | | � f � qH Wt | | d | �S( Ni i i i t nots not ins is notR( ( Rm R* R� R5 RD t _cmp_typesR t Compare( RG Rh R_ t resultsRj t nlR` R R( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt comparisonp s" $c C s | j t | � S( N( R� t Bitor( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRT � s c C s | j t | � S( N( R� t Bitxor( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt xor_expr� s c C s | j t | � S( N( R� t Bitand( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt and_expr� s c C s� | j | d � } x� t d t | � d � D]� } | j | | � } | | d d t j k r� t | | g d | d d �} q, | | d d t j k r� t | | g d | d d �} q, t d | | d d � q, W| S( Ni i i R( s unexpected token: %s( Rm R� R* R5 t LEFTSHIFTt LeftShiftR� t RightShiftR ( RG Rh R_ Rj t right( ( s, /usr/lib64/python2.7/compiler/transformer.pyt shift_expr� s ## c C s� | j | d � } x� t d t | � d � D]� } | j | | � } | | d d t j k r� t | | g d | d d �} q, | | d d t j k r� t | | g d | d d �} q, t d | | d d � q, W| S( Ni i i R( s unexpected token: %s( Rm R� R* R5 t PLUSt Addt MINUSt SubR ( RG Rh R_ Rj R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt arith_expr� s ## c C s | j | d � } x� t d t | � d � D]� } | j | | � } | | d d } | t j k r{ t | | g � } ny | t j k r� t | | g � } nU | t j k r� t | | g � } n1 | t j k r� t | | g � } n t d | � | d d | _ q, W| S( Ni i i s unexpected token: %s( Rm R� R* R5 R� t Mult SLASHt Divt PERCENTt Modt DOUBLESLASHt FloorDivR R( ( RG Rh R_ Rj R t t( ( s, /usr/lib64/python2.7/compiler/transformer.pyt term� s c C s� | d } | d } | j | d � | d d � } | t j k rX t | d | d �S| t j k r{ t | d | d �S| t j k r� t | d | d �} n | S( Ni i����i R( i ( R� R5 R t UnaryAddR t UnarySubt TILDEt Invert( RG Rh t eltR R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt factor� s !c C s� | j | d � } xw t d t | � � D]` } | | } | d t j k rw t | | j | | d � g d | d �S| j | | � } q) W| S( Ni i R( i ( Rm R� R* R5 t DOUBLESTARt Powert com_apply_trailer( RG Rh R_ Rj R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt power� s c C s | j | d d | � S( Ni ( RE ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt atom� s c C s@ | d d t j k r/ t d d | d d �S| j | d � S( Ni i R( i ( ( R5 R� R� Rm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR7 � s c C s@ | d d t j k r/ t d d | d d �S| j | d � S( Ni i R( i ( ( R5 t RSQBt Listt com_list_constructor( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR9 � s c C s@ | d d t j k r/ t d d | d d �S| j | d � S( Ni i R( i ( ( R5 t RBRACEt Dictt com_dictorsetmaker( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR; � s c C s t | j | d � � S( Ni ( t BackquoteRm ( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR= � s c C s, t | d d � } t | d | d d �S( Ni i R( i ( R R� ( RG Rh t k( ( s, /usr/lib64/python2.7/compiler/transformer.pyR? � s c C s[ | j rM | j d k r6 t | d � j | j � } n t d | j | f � St | � Sd S( Ns utf-8s iso-8859-1s # coding: %s %s( s utf-8s iso-8859-1( RF t unicodet encodeR ( RG t lit( ( s, /usr/lib64/python2.7/compiler/transformer.pyt decode_literal� s c C sF d } x% | D] } | | j | d � 7} q Wt | d | d d �S( NRU i R( i i ( R) R� ( RG Rh R% R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRA s c C s t | d d d | d d �S( Ni i R( i ( t Name( RG Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRC s c C s | j | d S( Ni ( R/ ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� s c C s | j | d | d � S( Ni i ( R/ ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRm s c G s t t d � � S( N( R R� R ( RG R, ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR4 ' s c C s� g } g } d } d } x�| t | � k r�| | } | d t j k s] | d t j k r+| d t j k r� | | d } | d t j k r� | j | d � | t B} | d } q� n | t | � k r'| | d } | t j k r� | | d } n t d | � | j | d � | t B} n Pn | j | j | � � | d } | t | � k r�| | d t j k r�| j | j | | d � � | d } n t | � r�t d � n | d } q W| | | f S( Ni i i s unexpected token: %si s- non-default argument follows default argument( R* R5 R� R RD R R R R t com_fpdefR� Rm t SyntaxError( RG Rh R� R� R� Rj R_ R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR~ - s< & ) c C s4 | d d t j k r( | j | d � S| d d S( Ni i i ( R5 R8 t com_fplist( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR+ _ s c C sp t | � d k r# | j | d � Sg } x: t d t | � d � D] } | j | j | | � � qB Wt | � S( Ni i ( R* R+ R� R R ( RG R_ RL Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR- e s c C s\ d } xK | D]C } t | � t d � k r | d d k r | | d d } q q W| d S( NRU i i R� i����( ( R ( RG R_ RI R` ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� n s (c C s� | d t j k s t � | d } | j | d d � } t | � d k rV | d f S| d d d k sp t � | d d t j k s� t � | | d d f S( Ni i t asi ( R0 t dotted_as_nameRn R� R* R R5 RD ( RG R_ t dot( ( s, /usr/lib64/python2.7/compiler/transformer.pyt com_dotted_as_namev s c C sz | d t j k s t � | d } | j | d � g } x: t d t | � d � D] } | j | j | | � � qR W| S( Ni i i ( R0 t dotted_as_namesRn R1 R� R* R ( RG R_ R� Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C s� | d t j k s t � | d } | d d t j k s@ t � t | � d k rd | d d d f S| d d d k s� t | � � | d d t j k s� t � | d d | d d f S( Ni i R. i ( R0 t import_as_nameRn R5 RD R* R ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt com_import_as_name� s c C sz | d t j k s t � | d } | j | d � g } x: t d t | � d � D] } | j | j | | � � qR W| S( Ni i i ( R0 t import_as_namesRn R4 R� R* R ( RG R_ R� Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sG g } x: t d t | � d � D] } | j | j | | � � q W| S( Ni i ( R� R* R Rm ( RG R_ R� Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C s� | d d t j k rL t | j | d � | j | d � d | d d �Sg } d } d } x4t d t | � d � D]} | | } | d t j k r't | � d k r� | j | d � } t | � d k r� | j | d t � } q� d } n d } } | j | | | j | | d � f � n | d t j k rw | d d k rd| j | | d � } q�| d d k r�| j | | d � } q�qw qw Wt | j | d � | | d | d d �} | r�t | | d | d d �S| Sd S( Ni i i i R( i i R� t finally( R5 RD t TryFinallyRm R R� R* R0 t except_clauseR� R R t TryExcept( RG Rh t clausesR� t finallyNodeRj R_ R� R� t try_except( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s6 *! c C su | j | d � } x[ t t | � d d d � D]= } | j | | | | d d � } | d k rg | S| } q0 Wd S( Ni����i i i����i i ( Rm R� R* t com_with_item( RG Rh t bodyRj t ret( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s #! c C sZ t | � d k r+ | j | d t � } n d } | j | d � } t | | | d | �S( Ni i i R( ( R* R� R R Rm t With( RG Rh R> R( t varRT ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR= � s c C s! | d t j k s t � | d S( Ni i ( R0 t augassignRn ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sE | j | � } | j t t t t f k r. | St d | j j � d S( s� Return node suitable for lvalue of augmented assignment Names, slices, and attributes are the only allowable nodes. s can't assign to %sN( Rm t __class__R* t Slicet SubscriptRp R, R ( RG R_ R" ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s c C sU xN| d } | t j t j t j t j f k r` t | � d k rS | j | | � S| d } q | t k r� t | � d k r� t d � n | d } q | t j k rq| d d t j k r� t d � n t | � d k rd| j | d � } x\ t d t | � d � D]A } | | } | d t j k r7t d � n | j | | � } qW| j | | d | � S| d } q | t j k r@| d d } | t j k r�| d } | d t j k r=t d � q=qM| t j k r| d } | d t j k rt d � n | j | | � S| t j k r4| j | d | � St d � q t d | � q Wd S( Ni i i s can't assign to operatori����s can't assign to ()s can't assign to []s can't assign to literals bad assignment (%s)( R0 t exprlistR� t testlist_safeR� R* t com_assign_tuplet _assign_typesR, R R Rm R� R5 R R t com_assign_trailerR8 R� R: R t com_assign_listRD t com_assign_name( RG R_ t assigningR t primaryRj t ch( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � sL $ c C s\ g } x= t d t | � d � D]# } | j | j | | | � � q Wt | d t | � �S( Ni i R( ( R� R* R R� t AssTupleR% ( RG R_ RM t assignsRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRH s !c C s� g } x� t d t | � d � D]� } | d t | � k r� | | d d t j k rb t d � n | | d d t j k s� t | | d � � n | j | j | | | � � q Wt | d t | � �S( Ni i i s" can't assign to list comprehensionR( ( R� R* R0 t list_forR, R5 R� Rn R R� t AssListR% ( RG R_ RM RQ Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRK s 2!c C s t | d | d | d �S( Ni R( i ( t AssName( RG R_ RM ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRL % s c C s� | d d } | t j k r4 | j | | d | � S| t j k rZ | j | | d | � S| t j k ru t d � n t d | � d S( Ni i i s can't assign to function calls unknown trailer type: %s( R5 Ro t com_assign_attrR: t com_subscriptlistR8 R, ( RG RN R_ RM R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRJ ( s c C s t | | d | d | d �S( Ni R( i����( t AssAttr( RG RN R_ RM ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRU 2 s c C s� t | � } | d k r9 | d } | j | � | d � Sg } xD t d | d � D]0 } | | } | j | j | � | d � � qR W| | d t | � �S( s= Compile 'NODE (OP NODE)*' into (type, [ node1, ..., nodeN ]).i i i R( ( R* R� R� R R% ( RG t constructorRh R" R` R2 Rj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� 5 s $c C sK | j | � | d � } | d k s+ t � t | t � r> | St | g � S( Ni ( R� R Rn R$ Rg ( RG R_ R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRa A s c C s^ | j | � | d � } | d k s+ t � t | t � rM | j | j � n | j | � d S( Ni ( R� R Rn R$ Rg t extendR! R ( RG Rk R_ R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRe H s c C s� g } x� t d t | � � D]� } | | d t j k rm t | | � d k sU t � | j | d | | � S| | d t j k r� q n | j | j | | � � q Wt | d | d j �S( Ni i R( ( R� R* R0 RR Rn t com_list_comprehensionR5 R� R Rm R R( ( RG Rh t valuesRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR P s c C s | j | d | d � S( NRL ( t com_comprehensionR ( RG RT R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRZ ] s c C s | d d } g } x| r�| d d } | d k r� | j | d t � } | j | d � } t | | g � } | d d | _ | j | � t | � d k r� d } q�| d k r� | j | d � } q�| j | d � } q | d k r| j | d � } t | d | d d �} | j j | � t | � d k rGd } q�| d k ri| j | d � } q�| j | d � } q t d | | f � q W| d k r�t | | d | �S| d k r�t | | d | �S| d k r�t | | | d | �St d t | � � � d S( Ni i t fori i RL R� R( i s' unexpected comprehension element: %s %dt sett dicts unexpected comprehension type: ( R� R Rm t ListCompForR( R R* R t com_list_itert com_comp_itert ListCompIft ifsR, t ListCompt SetCompt DictCompR t repr( RG R� R� R_ R R( t forsR R� t compNodet newforR� t newif( ( s, /usr/lib64/python2.7/compiler/transformer.pyR\ ` sD c C s! | d t j k s t � | d S( Ni i ( R0 t list_iterRn ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRa � s c C s! | d t j k s t � | d S( Ni i ( R0 t comp_iterRn ( RG R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRb � s c C su | d d } g } x8| rN| d d } | d k r� | j | d t � } | j | d � } t | | g d | d d �} | j | � t | � d k r� d } qK| j | d � } q | d k r8| j | d � } t | d | d d �} | j j | � t | � d k r"d } qK| j | d � } q t d | | f � q Wt | d _ t t | | � d | �S( Ni i R] i R( i R� i s. unexpected generator expression element: %s %di ( R� R Rm t GenExprForR R* R Rb t GenExprIfRd R, t Truet is_outmostt GenExprt GenExprInner( RG RT R_ R( Ri R R� t genNodeRk R� Rl ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s2 c C s� | d t j k s t � | d } t | � d k sL | d d t j k r� g } x: t d t | � d � D] } | j | j | | � � qk Wt | d | d j �S| d d t j k r� | j | d � } | j | d | d d � St | � d k rp| d d t j k rp| d d t j k s0t � | j | d � } | j | d � } | j | | | d d � Sg } xQ t d t | � d � D]7 } | j | j | | � | j | | d � f � q�Wt | d | d d j �Sd S( Ni i i R( R^ i R_ i ( R0 t dictorsetmakerRn R* R5 R� R� R Rm t SetR( R� R\ R R� R" ( RG Rh R2 Rj RT t keyRH ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR# � s( ) ) c C s� | d d } | t j k r1 | j | | d � S| t j k rT | j | | d � S| t j k rz | j | | d t � St d | � d S( Ni i i s unknown node type: %s( R5 R8 Ru Ro t com_select_memberR: RV R R, ( RG t primaryNodeRh R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR � s c C s: | d t j k r t d � n t | | d d | d �S( Ni s member must be a namei R( i ( R5 RD R, Rp ( RG Rz Rh ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRy � s c C s� | d t j k r, t | g d t | � �Sg } d } d } } t | � } d } x@| | k r�| | } | d t j k r� | d k r� t d � n | j | | d � } | d } qW nR | d t j k r| d k r� t d � n | j | | d � } | d } qW n | j | | | � \ } } | d k r|t | t � r|t | � d k r|| d d t j k r|t d � n | j | � | d } qW Wt | | | | d t | � �S( Ni R( i s$ already have the varargs indentifieri s# already have the kwargs indentifieri s& generator expression needs parenthesis( R5 R� t CallFuncR% R R* R� R, Rm R t com_argumentR$ Rs R0 R� R ( RG Rz Rh R, t kwt star_nodet dstar_nodet len_nodelistRj R_ R� ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRu � s: ) c C sD t | � d k rV | d d t j k rV | j | d � } d | j | | d � f St | � d k r� | rz t d � n | r� t d � n d | j | d � f S| j | d � } | d } x3 t | � d k r� | d t j k r� | d } q� W| d t j k r t d | d � n t | d | d | d �} d | f S( Ni i i i s! non-keyword arg after keyword args+ only named arguments may follow *expressions# keyword can't be an expression (%s)R( ( R* R0 R� Rm R� R, R5 RD t Keyword( RG Rh R} R~ R� R� R` R_ ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR| s" ) ( c C s� t | � d k r� | d } | d d t j k s\ t | � d k r� | d d t j k r� | d d t j k r� | j | | | � Sn g } x: t d t | � d � D] } | j | j | | � � q� Wt | | | d t | � �S( Ni i i i����R( ( R* R5 R� R0 R� t com_sliceR� R t com_subscriptRE R% ( RG RN Rh RM t subt subscriptsRj ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRV " s ) c C s| | d } | d } | t j k rA | d d t j k rA t � S| t j k sb t | � d k ro | j | � S| j | � S( Ni i i ( R5 Ro t EllipsisR� R* t com_sliceobjRm ( RG R_ RO R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� 6 s &! c C s> g } | d d t j k r9 | j t d � � d } n | j | j | d � � d } | t | � k r� | | d t j k r� | j | j | | � � | d } n | j t d � � xi t | t | � � D]R } | | } t | � d k r | j t d � � q� | j | j | d � � q� Wt | d t | � �S( Ni i i i R( ( R5 R� R R� R Rm R* R0 R� R� t SliceobjR% ( RG R_ R2 Rj t jRO ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� @ s ) c C s� d } } t | � d k r_ | d d t j k rI | j | d � } q� | j | d � } n; t | � d k r� | j | d � } | j | d � } n t | | | | d t | � �S( Ni i i i i R( ( R R* R5 R� Rm RD R% ( RG RN R_ RM t lowert upper( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� d s c C s� | d k r# | d } | d } n | t j k r� t | � d k rU | j | d � Sx. | D]& } | d t j k r\ | j | � Sq\ Wd S| t j k r� x. | D]& } | d t j k r� | j | � Sq� Wd S| t j k r'| d d t j k r#d } x" | D] } | t | d � } qW| Sd S| t j k sT| t j k sT| t j k re| j | d � S| t k r�t | � d k r�| j | d � Sd S( Ni i RU ( R R0 RR R* Rc R� RZ R R5 RB R R� t small_stmtt _doc_nodes( RG R_ R` R� t sR ( ( s, /usr/lib64/python2.7/compiler/transformer.pyRc r s8 N(� R R t __doc__RJ RQ R R RW RO RY RZ R[ Rr Rw Rz R| R] R\ t old_lambdefR^ R� R� t flow_stmtt compound_stmtR� R� R} R� R� Rt R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� RR R� RG t testlist1RF R� R� R� t old_testR� R� R� RT R� R� R R R R R R R7 R9 R; R= R? R) RA RC R� Rm R4 R~ R+ R- R� R1 R� R4 R� R� R� R� R= R� R� R� RH RK RL RJ RU R� Ra Re R RZ R\ Ra Rb R� R# R Ry Ru R| RV R� R� R� R Rc ( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR ^ s� ! ! 2 ) , 1 " ' $ t <t >s ==s <=s >=s !=R� R� c C s~ g } xq | D]i } t | t t f � rD | j t j | | � � q t | t � rc | j | � q | j t | � � q W| S( N( R$ t intt longR t _namest getR+ t debug_tree( RP R" R ( ( s, /usr/lib64/python2.7/compiler/transformer.pyR� � s (S R� t compiler.astRM R0 R5 t StandardErrorR t compiler.constsR R R R R R R R R% R. R R� R� RG R� R� R� R� R� RT R� R� R R R R R R� t LESSt GREATERt EQEQUALR� t LESSEQUALt GREATEREQUALt NOTEQUALR� R] R^ R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� RR RF R t _legal_node_typesR R R� R� RI R� R1 R2 R% t vt tok_nameR� ( ( ( s, /usr/lib64/python2.7/compiler/transformer.pyt <module> s� � � � � � 9 PK s�Z��@ E E symbols.pycnu �[��� PK s�Zx��� � HE ast.pyonu �[��� PK s�Z��G� � <_ __init__.pynu �[��� PK s�Z�� �� � vc transformer.pyonu �[��� PK s�Z��� �� �� � pycodegen.pycnu �[��� PK s�Z����_e _e �� pyassem.pycnu �[��� PK s�Z��?� � UY misc.pycnu �[��� PK s�Z oP�^ �^ "h pyassem.pynu �[��� PK s�Z \^A|� |� (� transformer.pynu �[��� PK s�Z��>�� � � consts.pycnu �[��� PK s�Z��@� � �� syntax.pynu �[��� PK s�Z��R-[ [ ڟ visitor.pyonu �[��� PK s�Z0~�F8 8 p� visitor.pynu �[��� PK s�Zx��� � � ast.pycnu �[��� PK s�Z�� � �� future.pyonu �[��� PK s�Z��S�Z Z �� syntax.pycnu �[��� PK s�Z'���!c !c 0� pyassem.pyonu �[��� PK s�ZLn&$ �P misc.pynu �[��� PK s�Z�� � �W future.pycnu �[��� PK s�Z��R-[ [ �c visitor.pycnu �[��� PK s�Z'O�� �� !t pycodegen.pynu �[��� PK s�Z2�e e / future.pynu �[��� PK s�Z��S�Z Z �6 syntax.pyonu �[��� PK s�Z~TE# P> __init__.pyonu �[��� PK s�Z�4�� � �C pycodegen.pyonu �[��� PK s�ZP��r�8 �8 � symbols.pynu �[��� PK s�Z~TE# �W __init__.pycnu �[��� PK s�Z��>�� � ] consts.pyonu �[��� PK s�ZA M��D �D ` symbols.pyonu �[��� PK s�Z��?� � B� misc.pyonu �[��� PK s�Z�F�� � � consts.pynu �[��� PK s�Z�ޒ�� �� � ast.pynu �[��� PK s�Z�.�� � � �H transformer.pycnu �[��� PK ! ! � 2
Copyright ©2021 || Defacer Indonesia