Tryag File Manager
Home
-
Turbo Force
Current Path :
/
usr
/
lib
/
python2.4
/
compiler
/
Upload File :
New :
File
Dir
//usr/lib/python2.4/compiler/symbols.pyo
mò ‚=5Dc @ s? d Z d k l Z d k l Z l Z l Z l Z l Z d k l Z d k Z d k Z d Z d 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 f d „ ƒ YZ d „ Z d „ Z e d j o+d k Z d k l Z l Z d k Z d „ Z xúe i d D]çZ e GHe e ƒ Z e i ƒ Z! e i" ƒ e i e! e d ƒ Z# e e# ƒ Z$ e e ƒ Z% e ƒ Z& e e% e& ƒ e& i' e% i ƒ Z( e e$ e( ƒ p1 Hd Ge GHe e$ ƒ GHe e( ƒ GHe i) d ƒ n h Z* e* i+ e& i' ƒ e* e% =e* i, ƒ Z' [* xô e# i- ƒ D]æ Z& e& i. ƒ oÓ g Z/ e' D]' Z0 e0 i1 e& i2 ƒ j o e/ e0 qgqg[/ Z3 e4 e3 ƒ d j o d Ge& i2 ƒ GHq/e e e& i5 ƒ ƒ e3 d i ƒ ƒ pH e& i2 ƒ GHe e e& i5 ƒ ƒ ƒ GHe e3 d i ƒ ƒ GHe i) d ƒ q/qIqIWqLWn d S( s Module symbol-table generator( s ast( s SC_LOCALs SC_GLOBALs SC_FREEs SC_CELLs SC_UNKNOWN( s mangleNi t Scopec B s¤ t 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( Nc C sÁ | | _ | | _ h | _ h | _ h | _ h | _ h | _ h | _ g | _ d | _ d | _ d | _ | d j oD xA t t | ƒ ƒ D]) } | | d j o | | | _ PqŒ qŒ Wn d S( Nt _( t namet selft modulet defst usest globalst paramst freest cellst childrent Nonet nestedt generatort klasst ranget lent i( R R R R R ( ( t& /usr/lib/python2.4/compiler/symbols.pyt __init__ s$ c C s d | i i | i f S( Ns <%s: %s>( R t __class__t __name__R ( R ( ( R t __repr__$ s c C s( | i d j o | Sn t | | i ƒ S( N( R R R R t mangle( R R ( ( R R ' s c C s d | i | i | ƒ <d S( Ni ( R R R R ( R R ( ( R t add_def, s c C s d | i | i | ƒ <d S( Ni ( R R R R ( R R ( ( R t add_use/ s c C s‡ | i | ƒ } | i i | ƒ p | i i | ƒ o n | i i | ƒ o t d | | i f ‚ n d | i | <| i i | ƒ d S( Ns %s in %s is global and parameteri ( R R R R t has_keyR R t SyntaxErrorR R R ( R R ( ( R t add_global2 s & c C s- | i | ƒ } d | i | <d | i | <d S( Ni ( R R R R R ( R R ( ( R t add_param< s c C s@ h } | i | i ƒ | i | i ƒ | i | i ƒ | i ƒ S( N( t dt updateR R R R t keys( R R ( ( R t get_namesA s c C s | i i | ƒ d S( N( R R t appendt child( R R$ ( ( R t add_childH s c C s | i S( N( R R ( R ( ( R t get_childrenK s c C s™ t i | i I| i o d p d IJt i d I| i IJt i d I| i IJt i d I| i IJt i d I| i IJt i d I| i IJd S( NR t s globals: s cells: s defs: s uses: s frees:( t syst stderrR R R R R R R R ( R ( ( R t DEBUGN s 'c C s£ | i i | ƒ o t Sn | i i | ƒ o t Sn | i i | ƒ o t Sn | i o. | i i | ƒ p | i i | ƒ o t Sn | i o t Sn t Sd S( sb Return scope of name. The scope of a name could be LOCAL, GLOBAL, FREE, or CELL. N( R R R R t SC_GLOBALR t SC_CELLR t SC_LOCALR R R t SC_FREEt SC_UNKNOWN( R R ( ( R t check_nameV s 0 c C s€ | i p f Sn h } | i | i ƒ xK | i i ƒ D]: } | i i | ƒ p | i i | ƒ p d | | <q8 q8 W| i ƒ S( Ni ( R R t freeR R R R! R R R R ( R R R1 ( ( R t get_free_varsi s &c C sQ xJ | i D]? } | i ƒ } | i | ƒ } x | D] } | i | ƒ q2 Wq Wd S( N( R R R$ R2 R t add_freesR R t force_global( R R R R R$ ( ( R t handle_childrent s c C sm d | i | <| i i | ƒ o | i | =n x8 | i D]- } | i | ƒ t j o | i | ƒ q8 q8 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 R R R R$ R0 R. R4 ( R R R$ ( ( R R4 { s c C s g } x | D]} | i | ƒ } | i o© | t j p | t j p t | t ƒ o d | i | <q| t j o | i | ƒ qt | t ƒ o | t j o d | i | <q| t j o | i | ƒ qq | t j o d | i | <q | t j o | i | ƒ 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 N( t child_globalst namesR R R0 t scR R/ R. t isinstancet ClassScopeR R+ R# t FunctionScopeR- R R, ( R R7 R R8 R6 ( ( R R3 s& * c C s | i i ƒ S( N( R R R! ( R ( ( R t get_cell_varsª s ( R t __module__R R R R R R R R R" R% R& R* R0 R2 R5 R4 R3 R< ( ( ( R R s" t ModuleScopec B s t Z e i Z d „ Z RS( Nc C s | i d | ƒ d S( Nt global( R t _ModuleScope__super_init( R ( ( R R ° s ( R R= R R R@ ( ( ( R R> s R; c B s t Z RS( N( R R= ( ( ( R R; ³ s t GenExprScopec B s, t Z e i Z d Z d d „ Z d „ Z RS( Ni c C s@ | i } | i d 7_ | i d | | | ƒ | i d ƒ d S( Ni s generator expression<%d>s [outmost-iterable]( R t _GenExprScope__counterR t _GenExprScope__super_initR R R ( R R R R ( ( R R » s c C s t i ƒ } | S( N( R R" R! ( R R! ( ( R R" Á s ( R R= R R RC RB R R" ( ( ( R RA ¶ s t LambdaScopec B s# t Z e i Z d Z d d „ Z RS( Ni c C s3 | i } | i d 7_ | i d | | | ƒ d S( Ni s lambda.%d( R t _LambdaScope__counterR t _LambdaScope__super_initR R ( R R R R ( ( R R Ê s ( R R= R R RF RE R ( ( ( R RD Å s R: c B s t Z e i Z d „ Z RS( Nc C s | i | | | ƒ d S( N( R t _ClassScope__super_initR R ( R R R ( ( R R Ò s ( R R= R R RG ( ( ( R R: Ï s t SymbolVisitorc B s t 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 i e i e i f Z d „ Z d „ Z RS( Nc C s h | _ d | _ d S( N( R t scopesR R ( R ( ( R R Ö s c C s2 t ƒ } | _ | i | <| i | i | ƒ d S( N( R> t scopeR R RI t nodet visit( R RK RJ ( ( R t visitModuleÜ s c C sÞ | i o | i | i | ƒ n | i | i ƒ x! | i D] } | i | | ƒ q; Wt | i | i | i ƒ } | i p t | t ƒ o d | _ n | | i | <| i | | i ƒ | i | i | ƒ | i | | ƒ d S( Ni ( RK t decoratorsR RL t parentR R t defaultst nR; R R RJ R R9 RI t _do_argst argnamest codet handle_free_vars( R RK RO RQ RJ ( ( R t visitFunctionâ s c C s€ t | i | i ƒ } | i p t | t ƒ p t | t ƒ o d | _ n | | i | <| i | i | ƒ | i | | ƒ d S( Ni ( RA R R R RJ RO R R9 R; RI RK RL RT RU ( R RK RO RJ ( ( R t visitGenExprð s * c C s; x! | i D] } | i | | ƒ q W| i | i | ƒ d S( N( RK t qualst genforR RL RJ t expr( R RK RJ RY ( ( R t visitGenExprInnerû s c C sQ | i | i | d ƒ | i | i | ƒ x! | i D] } | i | | ƒ q3 Wd S( Ni ( R RL RK t assignRJ t itert ifst if_( R RK RJ R_ ( ( R t visitGenExprFor s c C s | i | i | ƒ d S( N( R RL RK t testRJ ( R RK RJ ( ( R t visitGenExprIf s i c C s§ x! | i D] } | i | | ƒ q Wt | i | i ƒ } | i p t | t ƒ o d | _ n | | i | <| i | | i ƒ | i | i | ƒ | i | | ƒ d S( Ni ( RK RP RQ R RL RO RD R R RJ R R9 R; RI RR RS RT RU ( R RK RO R\ RQ RJ ( ( R t visitLambda s c C sL xE | D]= } t | ƒ t i j o | i | | ƒ q | i | ƒ q Wd S( N( t argsR t typet typest TupleTypeR RR RJ R ( R RJ Rd R ( ( R RR s c C s | i | ƒ | i ƒ d S( N( RO R% RJ R5 ( R RJ RO ( ( R RU ! s c C sð | i | i ƒ x! | i D] } | i | | ƒ q Wt | i | i ƒ } | i p t | t ƒ o d | _ n | i d j o | i d ƒ n | i d ƒ | | i | <| i } | i | _ | i | i | ƒ | | _ | i | | ƒ d S( Ni t __doc__R= ( RO R RK R t basesRQ R RL R: R RJ R R9 R; t docR RI R t prevRT RU ( R RK RO Rk RQ RJ ( ( R t visitClass% s c C s/ | o | i | i ƒ n | i | i ƒ d S( N( R\ RJ R RK R R ( R RK RJ R\ ( ( R t visitName< s c C sa | i | i | d ƒ | i | i | ƒ | i | i | ƒ | i o | i | i | ƒ n d S( Ni ( R RL RK R\ RJ t listt bodyt else_( R RK RJ ( ( R t visitForD s c C sF x? | i D]4 \ } } | d j o q n | i | p | ƒ q Wd S( Nt *( RK R7 R t asnameRJ R ( R RK RJ R Rs ( ( R t visitFromK s c C s\ xU | i D]J \ } } | i d ƒ } | d j o | | } n | i | p | ƒ q Wd S( Nt .iÿÿÿÿ( RK R7 R Rs t findR RJ R ( R RK RJ R R Rs ( ( R t visitImportQ s c C s% x | i D] } | i | ƒ q Wd S( N( RK R7 R RJ R ( R RK RJ R ( ( R t visitGlobalX s c C s> x$ | i D] } | i | | d ƒ q W| i | i | ƒ 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( RK t nodesRQ R RL RJ RZ ( R RK RJ RQ ( ( R t visitAssign\ s i c C s | i | i ƒ d S( N( RJ R RK R ( R RK RJ R\ ( ( R t visitAssNamem s c C s | i | i | d ƒ d S( Ni ( R RL RK RZ RJ ( R RK RJ R\ ( ( R t visitAssAttrp s c C sA | i | i | d ƒ x$ | i D] } | i | | d ƒ q Wd S( Ni ( R RL RK RZ RJ t subsRQ ( R RK RJ R\ RQ ( ( R t visitSubscripts s c C sb | i | i | d ƒ | i o | i | i | d ƒ n | i o | i | i | d ƒ n d S( Ni ( R RL RK RZ RJ t lowert upper( R RK RJ R\ ( ( R t visitSlicex s c C sZ | i | i | ƒ t | i t i ƒ o | i | i | d ƒ n | i | i | ƒ d S( Ni ( R RL RK RJ R9 t astt NameRZ ( R RK RJ ( ( R t visitAugAssign s c C s¤ x| | i D]q \ } } t | t i ƒ o2 t | i ƒ | i j o | i p q qW q[ n | i | | ƒ | i | | ƒ q W| i o | i | i | ƒ n d S( N( RK t testsRa Ro R9 R‚ t ConstRe t valueR t _const_typesRL RJ Rp ( R RK RJ Ro Ra ( ( R t visitIf‹ s c C s d | _ | i | i | ƒ d S( Ni ( RJ R R RL RK R‡ ( R RK RJ ( ( R t visitYield˜ s ( R R= R RM t visitExpressionRV RW R[ R` Rb Rc RR RU Rl Rm Rq Rt Rw Rx Rz R{ R| R~ R R„ Rf t StringTypet IntTypet FloatTypeRˆ R‰ RŠ ( ( ( R RH Õ s4 c C s | } | i ƒ | S( N( t lt sort( R ( ( R R œ s c C s t | ƒ t | ƒ j S( N( R t l1t l2( R‘ R’ ( ( R t list_eq¡ s t __main__( s parseFiles walkc C sj g } g } | i ƒ D] } | | i ƒ q ~ D]1 } | i d ƒ p | i d ƒ p | | q2 q2 ~ S( Ns _[Ru ( t _[1]t _[2]t symst get_symbolst st get_namet startswith( R— R• R™ R– ( ( R R" © s i t exect oopsiÿÿÿÿt skippingi (6 Rh t compilerR‚ t compiler.constsR- R+ R. R, R/ t compiler.miscR Rf R( t MANGLE_LENR R> R; RA RD R: RH R R“ R t parseFilet walkt symtableR" t argvt filet opent ft readt buft closeR— t mod_namest treeR™ RI t names2t exitR R t valuesR˜ t is_namespaceR• R8 R Rš R R t get_namespace($ RD R R¯ R¢ R¤ R+ R§ R R¥ R- R; R™ Rf R RI R. R“ R‚ R" R( R£ RH R/ R« R: R— R R© R® R R> R• R, R8 R RA ( ( R t ? sn % Ç ;