Tryag File Manager
Home
-
Turbo Force
Current Path :
/
usr
/
lib
/
python2.4
/
compiler
/
Upload File :
New :
File
Dir
//usr/lib/python2.4/compiler/pycodegen.pyo
m =5Dc @ s d k Z d k Z d k Z d k Z d k Z d k Z d k l Z d k l Z l Z l Z l Z d k l Z l Z l Z l Z d k l Z l Z l Z l Z d k l Z l Z l Z l Z l Z l Z l Z d k l Z y e i d Z Wn e! j o d Z n Xh d d f d <d d f d <d d f d <d d f d <Z" 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 YZ. d Z/ d f d YZ0 d f d YZ1 d! e1 e0 f d" YZ2 d# e1 e0 f d$ YZ3 d% e1 e0 f d& YZ4 d' f d( YZ5 d) e1 e5 e0 f d* YZ6 d+ e1 e5 e0 f d, YZ7 d- f d. YZ8 d/ e1 e8 e0 f d0 YZ9 d1 Z: d2 Z; d3 f d4 YZ< d5 f d6 YZ= d7 e= f d8 YZ> d9 e= f d: YZ? d; e= f d< YZ@ d= e= f d> YZA h e iB e> <e iC e? <e iD e@ <e iE eA <ZF d? ZG eH d@ j o& x e iI d D] ZJ e' eJ qWn d S(A N( s StringIO( s asts parses walks syntax( s pyassems miscs futures symbols( s SC_LOCALs SC_GLOBALs SC_FREEs SC_CELL( s CO_VARARGSs CO_VARKEYWORDSs CO_NEWLOCALSs CO_NESTEDs CO_GENERATORs CO_GENERATOR_ALLOWEDs CO_FUTURE_DIVISION( s TupleArgi i t CALL_FUNCTIONt CALL_FUNCTION_VARt CALL_FUNCTION_KWt CALL_FUNCTION_VAR_KWi i i c C s t | d } | i } | i t | | } y | i | Wn t j o n, Xt | d d } | i | | i d S( Nt Ut ct wb( t opent filenamet ft readt buft closet Modulet modt compilet displayt SyntaxErrort dump( R R R R R ( ( t( /usr/lib/python2.4/compiler/pycodegen.pyt compileFile$ s c C s | d j p | d j o t d n | d j o t | | } nM | d j o t | | } n- | d j o t | | } n t d | i | i 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 flagst Nonet dont_inheritt RuntimeErrort modet Interactivet sourceR t genR t Expressiont ValueErrorR t code( R R R R R R ( ( R R 2 s t AbstractCompileModec B s2 t Z d Z d Z d Z d Z d Z RS( Nc C s | | _ | | _ d | _ d S( N( R t selfR R R" ( R$ R R ( ( R t __init__G s c C s9 t | i | i } t i | i | t i | | S( N( t parseR$ R R t treet misct set_filenameR t syntaxt check( R$ R' ( ( R t _get_treeL s c C s d S( N( ( R$ ( ( R R R s c C s | i S( N( R$ R" ( R$ ( ( R t getCodeU s ( t __name__t __module__R R R% R, R R- ( ( ( R R# C s R c B s t Z d Z d Z RS( NR c C s+ | i } t | } | i | _ d S( N( R$ R, R' t ExpressionCodeGeneratorR R- R" ( R$ R' R ( ( R R \ s ( R. R/ R R ( ( ( R R X s R c B s t Z d Z d Z RS( NR c C s+ | i } t | } | i | _ d S( N( R$ R, R' t InteractiveCodeGeneratorR R- R" ( R$ R' R ( ( R R e s ( R. R/ R R ( ( ( R R a s R c B s8 t Z d Z d d Z d Z e i Z d Z RS( NR i c C sM | i } t | } | o d k } | i | GHn | i | _ d S( N( R$ R, R' t ModuleCodeGeneratorR R t pprintR- R" ( R$ R R3 R' R ( ( R R n s c C s* | i | i t i | i | d S( N( R t writeR$ t getPycHeadert marshalR R" ( R$ R ( ( R R v s c C s2 t i i | i } t i d | } | i | S( Ns <i( t ost patht getmtimeR$ R t mtimet structt packt MAGIC( R$ R: ( ( R R5 | s ( R. R/ R R R t impt get_magicR= R5 ( ( ( R R j s t LocalNameFinderc B sk t Z d Z f 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 i | _ t i | _ x | D] } | i i | q% Wd S( N( R( t SetR$ t namest globalst namet add( R$ RB RD ( ( R R% s c C sH x> | i i D]- } | i i | o | i i | q q W| i S( N( R$ RC t elementst eltRB t has_eltt remove( R$ RG ( ( R t getLocals s c C s d S( N( ( R$ t node( ( R t visitDict s c C s( x! | i D] } | i i | q Wd S( N( RK RB RD R$ RC RE ( R$ RK RD ( ( R t visitGlobal s c C s | i i | i d S( N( R$ RB RE RK RD ( R$ RK ( ( R t visitFunction s c C s d S( N( ( R$ RK ( ( R t visitLambda s c C s5 x. | i D]# \ } } | i i | p | q Wd S( N( RK RB RD t aliasR$ RE ( R$ RK RP RD ( ( R t visitImport s c C s5 x. | i D]# \ } } | i i | p | q Wd S( N( RK RB RD RP R$ RE ( R$ RK RP RD ( ( R t visitFrom s c C s | i i | i d S( N( R$ RB RE RK RD ( R$ RK ( ( R t visitClass s c C s | i i | i d S( N( R$ RB RE RK RD ( R$ RK ( ( R t visitAssName s ( R. R/ t __doc__R% RJ RL RM RN RO RQ RR RS RT ( ( ( R R@ s c C s- t | t i o | i p d Sq) n d S( Ni i ( t isinstanceRK t astt Constt value( RK ( ( R t is_constant_false s t CodeGeneratorc B s9 t Z d Z d 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 e d Z e Z e Z e 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 d9 ZC eD d: j o eC ZE eC ZF n d; ZE d< ZF d= ZG h d> d? <d@ dA <dB dC <dD dE <dF dG <dH dI <dJ dK <dL dM <dN dO <dP dQ <dR dS <dT dU <ZH dV ZI dW ZJ dX ZK dY ZL dZ ZM d[ ZN d d\ ZO d] ZP d^ ZQ d_ ZR e d` ZS e da ZT db ZU dc ZV dd ZW de ZX 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 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 | i d j o | i d | i _ n | i t i | _ t i | _ d | _ | i d | _ | i i } xY | D]Q } | d j o | i i t d | _ q | d j o | i i t q q Wd S( Ni t BINARY_DIVIDEt divisiont BINARY_TRUE_DIVIDEt generators( R$ t _CodeGenerator__initializedR t initClasst __class__t checkClassR( t Stackt localst setupst last_linenot _setupGraphDelegationt _div_opt get_modulet futurest featuret grapht setFlagt CO_FUTURE_DIVISIONt CO_GENERATOR_ALLOWED( R$ Rk Rl ( ( R R% s" c C s d S( s) This method is called once for each classN( ( R$ ( ( R Ra s c C s9 y Wn. t j o" } d | i i } t | n Xd S( s* Verify that class is constructed correctlys Bad class construction for %sN( t AssertionErrort msgR$ Rb R. t intro( R$ Rr Rs ( ( R Rc s c C sO | i i | _ | i i | _ | i i | _ | i i | _ | i i | _ d S( N( R$ Rm t emitt newBlockt startBlockt nextBlockt setDocstring( R$ ( ( R Rh s c C s | i i S( s Return a code objectN( R$ Rm R- ( R$ ( ( R R- s c C s/ | i d j o t i | | i Sn | Sd S( N( R$ t class_nameR R( t mangleRD ( R$ RD ( ( R Rz s c C s t i } t | | | i S( N( t symbolst SymbolVisitort st walkR' t scopes( R$ R' R} ( ( R t parseSymbols s c C s t d d S( Ns# should be implemented by subclasses( R ( R$ ( ( R Rj s c C s | i i i | S( N( R$ Re t topRH RD ( R$ RD ( ( R t isLocalName s c C s | i d | d S( Nt STORE( R$ t _nameOpRD ( R$ RD ( ( R t storeName s c C s | i d | d S( Nt LOAD( R$ R RD ( R$ RD ( ( R t loadName s c C s | i d | d S( Nt DELETE( R$ R RD ( R$ RD ( ( R t delName s c C s | i | } | i i | } | t j o: | i p | i | d | q | i | d | n | t j o: | i p | i | d | q | i | d | nF | t j p | t j o | i | d | n t d | | f d S( Nt _NAMEt _FASTt _GLOBALt _DEREFs unsupported scope for var %s: %d( R$ Rz RD t scopet check_namet SC_LOCALt optimizedRt t prefixt SC_GLOBALt SC_FREEt SC_CELLR ( R$ R RD R ( ( R R s c C s: | i o | i | d | n | i | 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 Rt R RD ( R$ R RD ( ( R t _implicitNameOp$ s c C s[ t | d d } | d j o8 | | i j p | o! | i d | | | _ t Sn t 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 getattrRK R R R$ Rg t forceRt t Truet False( R$ RK R R ( ( R t set_lineno5 s $ c C s | i | | _ | i | | _ | i d d | i o$ | i d | i | i d n t | i | i d d } | i i | i | i | i | i d d | i d d S( NR i t LOAD_CONSTRU t verboset RETURN_VALUE( R$ R RK R R Rt t docR R~ t NameFindert lnfRe t pushRJ t visitR ( R$ RK R ( ( R t visitModuleS s c C sP | i | | i | | _ | i | | _ | i | i | i d d S( NR ( R$ R RK R R R R Rt ( R$ RK ( ( R t visitExpression` s c C sE | i | d d | i o | i | i n | i | i d S( Nt isLambdai ( R$ t _visitFuncOrLambdaRK R Rx R RD ( R$ RK ( ( R RN g s c C s | i | d d d S( NR i ( R$ R RK ( R$ RK ( ( R RO m s c C sy | oD | i o: x! | i i D] } | i | q Wt | i i } n d } | i | | i | | i | i } t | i | | i | i | x | i D] } | i | q W| i i } | oN x | D] } | i d | q W| i d | | i d t | i n* | i d | | i d t | i x$ t | D] } | i d d q[Wd S( Ni t LOAD_CLOSURER t MAKE_CLOSUREt MAKE_FUNCTIONR i ( R RK t decoratorst nodest decoratorR$ R t lent ndecoratorst FunctionGenR Ry Rj R R~ R" t finishR t defaultst defaultR t get_free_varst freesRD Rt t ranget i( R$ RK R RD R R R R R R ( ( R R p s4 c C s. | i | | i | i } t | i | | i | i | | i d | i x | i D] } | i | qb W| i d t | i | i i } x | D] } | i d | q W| i d | | o | i d d n | i d d | i d d | i d | i | i d S( NR t BUILD_TUPLER R i R R t BUILD_CLASS( R$ t ClassGenRK R Rj R R~ R" R R Rt RD t basest baseR R R R R R ( R$ RK RD R R R ( ( R RS s* c C s | i } t | i } x t | D] } | i | \ } } t | o q( n | i | | i | | i } | i d | | i | i d | i | | i d | | i | | i d q( W| i o | i | i n | i | d S( Nt JUMP_IF_FALSEt POP_TOPt JUMP_FORWARD( R$ Ru t endR RK t testst numtestsR R t testt suiteRZ R R t nextTestRt Rw Rv t else_( R$ RK R R R R R R ( ( R t visitIf s( c C s8 | i | | i } | i } | i } | i d | | i | | i i t | f | i | d t | i | i | i d | p | | i | i d | i | i | i d | | i | | i d | i d | i i | i o | i | i n | i | d S( Nt SETUP_LOOPR R R t JUMP_ABSOLUTEt POP_BLOCK( R$ R RK Ru t loopR t afterRt Rw Rf R t LOOPR R R t bodyRv t pop( R$ RK R R R ( ( R t visitWhile s* c C s* | i } | i } | i } | i i t | f | i | | i d | | i | i | i d | i | | i | d d | i d | | i | i | i | i | i d | | i | | i d | i i | i o | i | i n | i | d S( NR t GET_ITERR i t FOR_ITERR R ( R$ Ru t startt anchorR Rf R R R RK Rt R t listRw t assignR R R ( R$ RK R R R ( ( R t visitFor s( c C sE | i p t d | i | i f n | i | | i d d S( Ns 'break' outside loop (%s, %d)t BREAK_LOOP( R$ Rf R RK R R R Rt ( R$ RK ( ( R t visitBreak s c C sj | i p t d | i | i f n | i i \ } } | t j o+ | i | | i d | | i n | t j p | t j o | i | t | i } xA | d j o3 | d } | i | \ } } | t j o Pq q W| t j o t d | i | i f n | i d | | i n1 | t j o# d } t | | i | i 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$ Rf R RK R R R t kindt blockR R Rt Rw t EXCEPTt TRY_FINALLYR t loop_blockt END_FINALLYRr ( R$ RK R R R Rr R ( ( R t visitContinue s. c C s} | i } xI | i d D]: } | i | | i | | | i | i d q W| i | i d | i | d S( NiR ( R$ Ru R RK R t childR Rt t jumpRw ( R$ RK R R R ( ( R t visitTest s c C s | i | d d S( NR ( R$ R RK ( R$ RK ( ( R t visitAnd s c C s | i | d d S( Nt JUMP_IF_TRUE( R$ R RK ( R$ RK ( ( R t visitOr s c C sD | i | i | i } xy | i d D]j \ } } | i | | i d | i d | i d | | i d | | i | i d q* W| i o4 | i d \ } } | i | | i d | n t | i d j oT | i } | i d | | i | | i d | i d | i | n d S( Nit DUP_TOPt ROT_THREEt COMPARE_OPR R i R t ROT_TWO( R$ R RK t exprRu t cleanupt opst opR" Rt Rw R R Rv ( R$ RK R" R R R ( ( R t visitCompare# s, c C s | i | d | i } | i d | _ | i d d | i d | i d d | i d | g } x t t t | i | i D] \ } } | i | \ } } d } x> | i D]3 } | d j o | i } n | i | | q W| i d | | | f q W| i d | | i | i | i d d | i d x | D]z \ } } } | oG | i } | i d | | i | | i d | i | n | i d | | i | qXW| i d | | i d | _ d S( Ns $append%di t BUILD_LISTi R t LOAD_ATTRt appendR R R R R R R ( R$ R RK t _CodeGenerator__list_countR Rt R t stackt zipR R t qualsR t for_R R R R t contt ifst if_Ru t insertR t skip_oneRv Rw ( R$ RK R R R R R R R R R ( ( R t visitListComp> sD " c C s | i } | i } | i | i | i d | i | | i | d t | i d | | i | i | i | | f S( NR R R ( R$ Ru R R R RK R Rt Rw R R R ( R$ RK R R ( ( R t visitListCompFord s c C sN | i | d t | i | i | i d | | i | i d d S( NR R R ( R$ R RK R R R Rt t branchRu ( R$ RK R ( ( R t visitListCompIfq s c C s t | | i | i | i } t | i | | i | i | | i i } | oE x | D] } | i d | qe W| i d | | i d d n! | i d | | i d d | i | i i d i | i d | i d d d S( NR R R i R R R i ( t GenExprCodeGeneratorRK R$ R Ry Rj R R~ R" R R R R R RD Rt R R t iter( R$ RK RD R R ( ( R t visitGenExprx s" c C sp | i | g } x t t t | i | i D] \ } } | i | \ } } d } x> | i D]3 } | d j o | i } n | i | | qf W| i d | | | f q5 W| i | i | i d x | D]z \ } } } | oG | i } | i d | | i | | i d | i | n | i d | | i | q W| i d d d S( Ni t YIELD_VALUER R R R ( R$ R RK R R R R R R R R R R R R R R Ru R R Rt R Rv Rw ( R$ RK R R R R R R R R ( ( R t visitGenExprInner s2 " c C s | i } | i } | i o | i d n | i | i | i d | i | | i | d t | i d | | i | i | i | | f S( Ns [outmost-iterable]R R R ( R$ Ru R R RK t is_outmostR R R Rt Rw R R R ( R$ RK R R ( ( R t visitGenExprFor s c C sN | i | d t | i | i | i d | | i | i d d S( NR R R ( R$ R RK R R R Rt R Ru ( R$ RK R ( ( R t visitGenExprIf s c C s d S( N( ( R$ RK ( ( R t visitAssert s c C s | i | d } | i o | i | i | d } n | i o | i | i | d } n | i o | i | i | d } n | i d | d S( Ni i t RAISE_VARARGS( R$ R RK t nt expr1R t expr2t expr3Rt ( R$ RK R ( ( R t visitRaise s c C sh | i } | i } | i } | i o | i } n | } | i | | i d | | i | | i i t | f | i | i | i d | i i | i d | | i | t | i d } x>t t | i D]'} | i | \ } } } | i | | oa | i d | i | | i d d | i } | i d | | i | i d n | i d | o | i | n | i d | i d | i | | i d | | o | i | n | i | o | i d q q W| i d | i o! | i | | i | i n | i | d S( Nt SETUP_EXCEPTR R i R R s exception matchR R R ( R$ Ru R t handlersR RK R t lElseR Rt Rw Rf R R R R Rv R t lastR R R t targett next( R$ RK R R R R R R R R R ( ( R t visitTryExcept sZ c C s | i } | i } | i | | i d | | i | | i i t | f | i | i | i d | i i | i d d | i | | i i t | f | i | i | i d | i i d S( Nt SETUP_FINALLYR R R ( R$ Ru R t finalR RK Rt Rw Rf R R R R R R ( R$ RK R R ( ( R t visitTryFinally s c C s. | i | | i | i | i d d S( NR ( R$ R RK R R Rt ( R$ RK ( ( R t visitDiscard- s c C s | i d | i d S( NR ( R$ Rt RK RY ( R$ RK ( ( R t visitConst2 s c C s' | i d | i | i | i d S( NR ( R$ Rt RK RD R R ( R$ RK ( ( R t visitKeyword5 s c C s d S( N( ( R$ RK ( ( R RM 9 s c C s! | i | | i | i d S( N( R$ R RK R RD ( R$ RK ( ( R t visitName= s c C s | i | d S( N( R$ R RK ( R$ RK ( ( R t visitPassA s c C s | i | x | i D] \ } } t d j o | i d d n | i d | | i d d } | o | i | | i | q | i | q Wd S( Ni R t IMPORT_NAMEt .i ( R$ R RK RB RD RP t VERSIONRt R t splitR t _resolveDotsR ( R$ RK RD RP R ( ( R RQ D s c C s | i | t d | i } t d j o | i d t | n | i d | i x | i D] \ } } t d j o` | d j o d | _ | i d d Sq | i d | | i | | i | p | qf | i d | qf W| i d d S( Nc C s | \ } } | S( N( RD RP ( t .0RD RP ( ( R t <lambda>S s i R R" t *i t IMPORT_STARt IMPORT_FROMR ( R$ R RK t mapRB t fromlistR$ Rt t tuplet modnameRD RP t namespaceR& R ( R$ RK R- RD RP ( ( R RR Q s$ c C sS | i d } t | d j o d Sn x" | d D] } | i d | q5 Wd S( NR# i R ( RD R% t eltsR RG R$ Rt ( R$ RD R1 RG ( ( R R& g s c C s0 | i | i | i d | i | i d S( NR ( R$ R RK R Rt Rz t attrname( R$ RK ( ( R t visitGetattrn s c C s | i | | i | i t | i d } xl t t | i D]U } | i | } | | j o | i d n t | t i o | i | qF qF Wd S( Ni R ( R$ R RK R R R R t dupsR R RG Rt RV RW t Node( R$ RK R4 R RG ( ( R t visitAssignt s c C se | i d j o | i | i n> | i d j o! | i | | i | i n d G| i GHd S( Nt OP_ASSIGNt OP_DELETEt oops( RK R R$ R RD R R ( R$ RK ( ( R RT s c C s | i | i | i d j o | i d | i | i nB | i d j o | i d | i | i n d G| i GH| GHd S( NR7 t STORE_ATTRR8 t DELETE_ATTRs warning: unexpected flags:( R$ R RK R R Rt Rz R2 ( R$ RK ( ( R t visitAssAttr s t UNPACK_SEQUENCEc C sU t | d j o | i | t | i n x | i D] } | i | q: Wd S( NR8 ( t findOpRK R$ Rt R R R R R ( R$ RK R R ( ( R t _visitAssSequence s i c C s | i | d d S( Nt UNPACK_TUPLE( R$ R? RK ( R$ RK ( ( R t visitAssTuple s c C s | i | d d S( Nt UNPACK_LIST( R$ R? RK ( R$ RK ( ( R t visitAssList s c C sg | i | t | i } | i | d | i | i | i | i | i | i | d d S( Nt loadt store( R$ R RK t wrap_augt aug_nodeR R Rt t _augmented_opcodeR ( R$ RK RG ( ( R t visitAugAssign s 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_ORc C sF | d j o | i | i n" | d j o | i | i n d S( NRD RE ( R R$ R RK RD R ( R$ RK R ( ( R t visitAugName s c C s | d j o= | i | i | i d | i d | i | i n; | d j o- | i d | i d | i | i n d S( NRD R R RE R R: ( R R$ R RK R Rt Rz R2 ( R$ RK R ( ( R t visitAugGetattr s c C s | d j o | i | d n | d j o d } | i o | d B} n | i o | d B} n | d j o | i d n, | d j o | i d n | i d | i d | n d S( NRD i RE i i R i t ROT_FOURR s STORE_SLICE+%d( R R$ t visitSliceRK t slicet lowert upperRt ( R$ RK R RZ ( ( R t visitAugSlice s c C ss t | i d j o t d n | d j o | i | d n, | d j o | i d | i d n d S( Ni s- augmented assignment to tuple is not possibleRD RE R t STORE_SUBSCR( R RK t subsR R R$ t visitSubscriptRt ( R$ RK R ( ( R t visitAugSubscript s c C s | i | i | i d j o | i d d n | i | i | i d j o | i d n | i | i | i d d S( NR R t EXEC_STMT( R$ R RK R Re R Rt RC ( R$ RK ( ( R t visitExec s c C s d } d } | i | | i | i xI | i D]> } | i | t | t i o | d } q3 | d } q3 W| i d j o | i | i n | i d j o | i | i n | i d j } | i d j } t | | f } | i | | d >| B d S( Ni i i ( t post kwR$ R RK R t argst argRV RW t Keywordt star_argsR t dstar_argst have_start have_dstart callfunc_opcode_infot opcodeRt ( R$ RK Rn Rl Rd Re Rg Rk ( ( R t visitCallFunc s$ c C s | i | | i o | i | i n xn | i D]c } | i o | i d n | i | | i o | i d | i d q5 | i d q5 W| i o | o | i d n d S( NR R t PRINT_ITEM_TOt PRINT_ITEMR ( R$ R RK t destR R R Rt t newline( R$ RK Rs R ( ( R t visitPrint s c C s? | i | d d | i o | i d n | i d d S( NRs i t PRINT_NEWLINE_TOt PRINT_NEWLINE( R$ Rt RK Rr Rt ( R$ RK ( ( R t visitPrintnl s c C s. | i | | i | i | i d d S( NR ( R$ R RK R RY Rt ( R$ RK ( ( R t visitReturn s c C s. | i | | i | i | i d d S( NR ( R$ R RK R RY Rt ( R$ RK ( ( R t visitYield s c C sB | i | i d } | i o | i | i | d B} n | i o | i | i | d B} n | oS | d j o | i d q | d j o | i d d q | i d d n | i d j o | i d | nZ | i d j o | i d | n5 | i d j o | i d | n d G| i GH d S( Ni i i R i t DUP_TOPXt OP_APPLYs SLICE+%dR7 s STORE_SLICE+%dR8 s DELETE_SLICE+%ds weird slice( R$ R RK R RZ R[ R\ t aug_flagRt R ( R$ RK R| RZ ( ( R RY ' s, c C s | i | i x | i D] } | i | q W| o | i d d n t | i d j o | i d t | i n | i d j o | i d nC | i d j o | i d n" | i d j o | i d n d S( NRz i i R R{ t BINARY_SUBSCRR7 R^ R8 t DELETE_SUBSCR( R$ R RK R R_ t subR| Rt R R ( R$ RK R| R ( ( R R` B s c C s1 | i | i | i | i | i | d S( N( R$ R RK t leftt rightRt R ( R$ RK R ( ( R t binaryOpS s c C s | i | d S( Nt BINARY_ADD( R$ R RK ( R$ RK ( ( R t visitAddX s c C s | i | d S( Nt BINARY_SUBTRACT( R$ R RK ( R$ RK ( ( R t visitSub[ s c C s | i | d S( Nt BINARY_MULTIPLY( R$ R RK ( R$ RK ( ( R t visitMul^ s c C s | i | | i S( N( R$ R RK Ri ( R$ RK ( ( R t visitDiva s c C s | i | d S( Nt BINARY_FLOOR_DIVIDE( R$ R RK ( R$ RK ( ( R t visitFloorDivd s c C s | i | d S( Nt BINARY_MODULO( R$ R RK ( R$ RK ( ( R t visitModg s c C s | i | d S( Nt BINARY_POWER( R$ R RK ( R$ RK ( ( R t visitPowerj s c C s | i | d S( Nt BINARY_LSHIFT( R$ R RK ( R$ RK ( ( R t visitLeftShiftm s c C s | i | d S( Nt BINARY_RSHIFT( R$ R RK ( R$ RK ( ( R t visitRightShiftp s c C s! | i | i | i | d S( N( R$ R RK R Rt R ( R$ RK R ( ( R t unaryOpu s c C s | i | d S( Nt UNARY_INVERT( R$ R RK ( R$ RK ( ( R t visitInverty s c C s | i | d S( Nt UNARY_NEGATIVE( R$ R RK ( R$ RK ( ( R t visitUnarySub| s c C s | i | d S( Nt UNARY_POSITIVE( R$ R RK ( R$ RK ( ( R t visitUnaryAdd s c C s | i | d S( NR ( R$ R RK ( R$ RK ( ( R t visitUnaryInvert s c C s | i | d S( Nt UNARY_NOT( R$ R RK ( R$ RK ( ( R t visitNot s c C s | i | d S( Nt UNARY_CONVERT( R$ R RK ( R$ RK ( ( R t visitBackquote s c C sD | i | d x, | d D] } | i | | i | q Wd S( Ni i ( R$ R R RK Rt R ( R$ R R RK ( ( R t bitOp s c C s | i | i d S( Nt BINARY_AND( R$ R RK R ( R$ RK ( ( R t visitBitand s c C s | i | i d S( Nt BINARY_OR( R$ R RK R ( R$ RK ( ( R t visitBitor s c C s | i | i d S( Nt BINARY_XOR( R$ R RK R ( R$ RK ( ( R t visitBitxor s c C s | i d t d S( NR ( R$ Rt t Ellipsis( R$ RK ( ( R t visitEllipsis s c C sK | i | x | i D] } | i | q W| i d t | i d S( NR ( R$ R RK R RG R Rt R ( R$ RK RG ( ( R t visitTuple s c C sK | i | x | i D] } | i | q W| i d t | i d S( NR ( R$ R RK R RG R Rt R ( R$ RK RG ( ( R t visitList s c C s> x | i D] } | i | q W| i d t | i d S( Nt BUILD_SLICE( RK R R R$ R Rt R ( R$ RK R ( ( R t visitSliceobj s c C s| | i | | i d d xX | i D]M \ } } | i d | i | | i | | i d | i d q' Wd S( Nt BUILD_MAPi R R R^ ( R$ R RK Rt t itemst kt vR ( R$ RK R R ( ( R RL s (o R. R/ RU R R R` Ry R% Ra Rc Rh R- Rz R Rj R R R R R R R R R@ R R R R R RN RO R RS R R R R R R R R R R R R R R R R R R R R R R R R RM R R! RQ RR R& R3 R6 RT R< R? R$ RA RC RI RH RV RW R] Ra Rc Ro Rt Rw Rx Ry 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 RL ( ( ( R R[ s & 2 r t NestedScopeMixinc B s t Z d Z d Z RS( s> Defines initClass() for nested scoping (Python 2.2-compatible)c C s( t | i _ t | i _ t | i _ d S( N( R@ R$ Rb R t FunctionCodeGeneratorR t ClassCodeGeneratorR ( R$ ( ( R Ra s ( R. R/ RU Ra ( ( ( R R s R2 c B s) t Z e i Z d Z d Z d Z RS( Nc C sE t i d | i | _ t i | | _ | i t | | d S( Ns <module>( t pyassemt PyFlowGraphR' R R$ Rm t futuret find_futuresRk t _ModuleCodeGenerator__super_initR~ ( R$ R' ( ( R R% s c C s | S( N( R$ ( R$ ( ( R Rj s ( R. R/ R[ R% R R R Rj ( ( ( R R2 s R0 c B s/ t Z e i Z d Z f Z d Z d Z RS( Nc C s3 t i d | i | _ | i t | | d S( Ns <expression>( R R R' R R$ Rm t$ _ExpressionCodeGenerator__super_initR~ ( R$ R' ( ( R R% s c C s | S( N( R$ ( R$ ( ( R Rj s ( R. R/ R[ R% R R R Rk Rj ( ( ( R R0 s R1 c B s8 t Z e i Z d Z f Z d Z d Z d Z RS( Nc C sM t i d | i | _ | i | i | t | | | i d d S( Ns <interactive>R ( R R R' R R$ Rm t% _InteractiveCodeGenerator__super_initR R~ Rt ( R$ R' ( ( R R% s c C s | S( N( R$ ( R$ ( ( R Rj s c C s! | i | i | i d d S( Nt PRINT_EXPR( R$ R RK R Rt ( R$ RK ( ( R R s ( R. R/ R[ R% R R R Rk Rj R ( ( ( R R1 s t AbstractFunctionCodec B sG t Z d Z d Z d Z d Z d Z d Z d Z e Z RS( Ni i c C sW | | _ | | _ | o' t } d | i } | i d | _ n | i } t | i \ } } t i | | i | d d | _ | | _ | i | o | i o | i | i n t | i | i | d d } | i i | i | i o | i i t n | i o | i i t n | i! | | o | i" | i n d S( Ns <lambda.%d>i R R i (# Ry R$ R t moduleR R t klasst lambdaCountRD t funct generateArgListt argnamesRf t hasTupleArgR R R Rm t super_initR Rx R~ R" R R Re R RJ t varargsRn t CO_VARARGSt kwargst CO_VARKEYWORDSR t generateArgUnpack( R$ R R R Ry R R RD Rf R R ( ( R R% s. ! c C s | i S( N( R$ R ( R$ ( ( R Rj s c C s< | i i | i p | i d d n | i d d S( NR R ( R$ Rm t startExitBlockR Rt R ( R$ ( ( R R s c C sj xc t t | D]O } | | } t | t i j o) | i d d | d | i | q q Wd S( Nt LOAD_FASTs .%di ( R R Rf R Rg t typet typest TupleTypeR$ Rt t unpackSequence( R$ Rf R Rg ( ( R R s c C s t d j o | i d t | n | i d t | xE | D]= } t | t i j o | i | qD | i d | qD Wd S( Ni R= R@ R ( R$ R$ Rt R t tupRG R R R R R ( R$ R RG ( ( R R ' s ( R. R/ R R R% Rj R R R t unpackTuple( ( ( R R s R c B s) t Z e i Z d Z e i Z d Z RS( Nc C s | | _ | | | _ | i | | | | | | i i | i i | i i | i i | i i d j o | i i t n d S( N( R R$ R R t" _FunctionCodeGenerator__super_initR Ry R Rm t setFreeVarsR t setCellVarst get_cell_varst generatorR Rn t CO_GENERATOR( R$ R R R Ry R ( ( R R% ; s ( R. R/ R[ R% R R R R R ( ( ( R R 4 s R c B s) t Z e i Z d Z e i Z d Z RS( Nc C su | | _ | | | _ | i | | d | | | i i | i i | i i | i i | i i t d S( Ni ( R R$ t gexpR t! _GenExprCodeGenerator__super_initRy R Rm R R R R Rn R ( R$ R R Ry R ( ( R R% K s ( R. R/ R[ R% R R R R R ( ( ( R R D s t AbstractClassCodec B s# t Z d Z d Z d Z RS( Nc C s | i | _ | | _ t i | i | i d d d d | _ | i t | i | i d d } | i i | i | i i t | i o | i | i n d S( NR i R i R ( R RD R$ Ry R R R R Rm R R~ R" R R Re R RJ Rn t CO_NEWLOCALSR Rx ( R$ R R R R ( ( R R% U s c C s | i S( N( R$ R ( R$ ( ( R Rj a s c C s+ | i i | i d | i d d S( Nt LOAD_LOCALSR ( R$ Rm R Rt ( R$ ( ( R R d s ( R. R/ R% Rj R ( ( ( R R S s R c B s) t Z e i Z d Z e i Z d Z RS( Nc C s | | _ | | | _ | i | | | | i i | i i | i i | i i | i | | i d d | i d | i o$ | i d | i | i d n d S( Nt LOAD_GLOBALR. R/ R RU ( R R$ R R t _ClassCodeGenerator__super_initR Rm R R R R R Rt R R ( R$ R R R ( ( R R% o s ( R. R/ R[ R% R R R R R ( ( ( R R i s c C s g } g } d } x t t | D] } | | } t | t i j o | i | q% t | t i j o> | i t | d | | i t i | | d } q% t d | q% W| | | f S( s& Generate an arg list marking TupleArgsi i i s unexpect argument type:N( Rf t extrat countR R t arglistR RG R R t StringTypeR R t TupleArgt extendR( t flattenR! ( R R R R Rf RG ( ( R R | s c C s# t } t | | d d | i S( s5 Find the op (DELETE, LOAD, STORE) in an AssTuple treeR i N( t OpFinderR R~ RK R ( RK R ( ( R R> s R c B s& t Z d Z d Z e Z e Z RS( Nc C s d | _ d S( N( R R$ R ( R$ ( ( R R% s c C sD | i d j o | i | _ n! | i | i j o t d n d S( Ns mixed ops in stmt( R$ R R RK R R! ( R$ RK ( ( R RT s ( R. R/ R% RT R< R` ( ( ( R R s t Delegatorc B s t 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 objR$ ( R$ R ( ( R R% s c C s t | i | S( N( R R$ R t attr( R$ R ( ( R t __getattr__ s ( R. R/ RU R% R ( ( ( R R s t AugGetattrc B s t Z RS( N( R. R/ ( ( ( R R s t AugNamec B s t Z RS( N( R. R/ ( ( ( R R s t AugSlicec B s t Z RS( N( R. R/ ( ( ( R R s t AugSubscriptc B s t Z RS( N( R. R/ ( ( ( R R s c C s t | i | S( N( t wrapperRK Rb ( RK ( ( R RF s t __main__(K R> R7 R6 R; t sysR t cStringIOt StringIOt compilerRW R& R~ R* R R( R R{ t compiler.constsR R R R R R R t CO_NESTEDR Rp Ro t compiler.pyassemR t version_infoR$ t AttributeErrorRm R R R R R R R R# R R R R@ RZ R[ R R2 R0 R1 R R R R R R R> R R R R R R t Getattrt Namet Slicet SubscriptR RF R. t argvt file(> R R0 R@ R R( R~ R& R R1 R R R R R R R RF R; RZ R> R R R R R Rm R Ro Rp R> R R R R# R RW R R R R R R R$ R* R R R R R{ R R R[ R R R2 R R R R R7 R6 R ( ( R t ? sp 1 B + > 6