Tryag File Manager
Home
-
Turbo Force
Current Path :
/
usr
/
lib
/
python2.4
/
compiler
/
Upload File :
New :
File
Dir
//usr/lib/python2.4/compiler/pyassem.pyc
m =5Dc @ s d 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 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 i Z d S( s/ A flow graph representation for Python bytecodeN( s misc( s CO_OPTIMIZEDs CO_NEWLOCALSs CO_VARARGSs CO_VARKEYWORDSt FlowGraphc B s t 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 RS( Nc C s[ t | _ | _ t d | _ t i | _ | i i | i | i i | i d S( Nt exit( t Blockt selft currentt entryR t misct Sett blockst add( R ( ( t& /usr/lib/python2.4/compiler/pyassem.pyt __init__ s c C sg | i oP | i o7 d Gt | i GHd G| i i GHd G| i i GHn t | GHn | | _ d S( Nt ends nexts ( R t _debugR t reprt nextt get_childrent block( R R ( ( R t startBlock s c C s> | d j o | i } n | i i | | i | d S( N( R t NoneR t newBlockR t addNextR ( R R ( ( R t nextBlock s c C s t } | i i | | S( N( R t bR R R ( R R ( ( R R 6 s c C s | i | i d S( N( R R R ( R ( ( R t startExitBlock; s i c C s d | _ d S( Ni ( R R ( R ( ( R t _enable_debug@ s c C s d | _ d S( Ni ( R R ( R ( ( R t _disable_debugC s c G s | i o d G| GHn | d d d g j o | i i | i n t | d j o, t | d t o | i i | d n | i i | d S( Ns i t RETURN_VALUEt YIELD_VALUEi i ( R R t instR t addOutEdgeR t lent isinstanceR t emit( R R ( ( R R! F s 'c C s xL | i i D]; } | | i j o q n | i p | i | i q q Wt | i h } | i | i | | i | i | j o | i | i n | S( sl Return the blocks in reverse postorder i.e. each node appears before all of its successors N( R R t elementsR R R R t dfs_postorderR t ordert reverset fixupOrdert append( R R R$ ( ( R t getBlocksInOrderO s c C s$ | i | | | i | | d S( s" Fixup bad order introduced by DFS.N( R t fixupOrderHonorNextR t default_nextt fixupOrderForward( R R R* ( ( R R& d s c C s h } x( t t | D] } | | | | <q Wxt d t | d D]p} | | } | | d } | i p( | i d | j p | i d | j o qK n | } g } | } xD | i o9 | i d | j o% | i | i d | i d } q Wg } x= | D]5 } | | | j p t | i | | | f q W| i | i x | D] \ } } | | | =q]W| g | | | | d +x( t t | D] } | | | | <qWqK Wd S( s Fix one problem with DFS. The DFS uses child block, but doesn't know about the special "next" block. As a result, the DFS can order blocks so that a block isn't next to the right block for implicit control transfers. i i N( t indext rangeR R t iR t nR R* t curt chaint eltR' t lt AssertionErrort sortR% t j( R R R* R, R R1 R. R6 R3 R/ R2 R0 ( ( R R) m s@ 3 c C s h } g } g } x` | D]X } t | | | <| i | | i o+ | i d | j o | i | g } q q W| i | x5g } x t t | D] } | | } x | D] } x | i D] } | | | j os d } xA | i D]6 } | d d j o | d | j o d } q%q q W| p q n | i | | | f q q Wq Wq W| p Pn | d \ } } | | j p t | | } | i | | i | | q W| 2x, | D]$ } x | D] } | i | qWqWd S( s( Make sure all JUMP_FORWARDs jump forwardi i t JUMP_FORWARDN( R, t chainsR0 R R R R' R R* t constraintsR- R. R3 R t ct forward_pt instsR t goes_beforet a_chainR4 t removet insert( R R R* R, R: R R. R3 R; R= R> R R9 R8 R0 ( ( R R+ sZ ' c C s | i i S( N( R R R" ( R ( ( R t getBlocks s c C s | i S( s/ Return nodes appropriate for use with dominatorN( R R ( R ( ( R t getRoot s c C s4 g } x' | i D] } | i | i q W| S( N( R3 R RA R t extendt getContainedGraphs( R R R3 ( ( R RD s ( t __name__t __module__R R R R R R R R R R! R( R& R) R+ RA RB RD ( ( ( R R s ) . c C sb g } | | | <x> | i D]0 } | i | o q n | t | | } q W| i | | S( s; Depth-first search of tree rooted at b, return in postorderN( R$ R t seenR R: t has_keyR# R' ( R RG R: R$ ( ( R R# s R c B sz t 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( Ni t c C sY g | _ t i | _ t i | _ | | _ t i | _ g | _ t i d t _ d S( Ni ( R R< R R t inEdgest outEdgest labelR t _countt bidR ( R RL ( ( R R s c C s1 | i o d | i | i f Sn d | i Sd S( Ns <block %s id=%d>s <block id=%d>( R RL RN ( R ( ( R t __repr__ s c C s2 t t | i } d | i | i d i | f S( Ns <block %s %d: %s>s ( t mapt strR R< RL RN t join( R R< ( ( R t __str__ s c C sG | d } | d d j o | i i | d n | i i | d S( Ni i t JUMPi ( R t opR RK R R< R' ( R R RU ( ( R R! s c C s | i S( N( R R< ( R ( ( R t getInstructions s c C s | i i | d S( N( R RJ R R ( R R ( ( R t addInEdge s c C s | i i | d S( N( R RK R R ( R R ( ( R R s c C s@ | i i | t | i d j p t t t | i d S( Ni ( R R R' R R R4 RP RQ ( R R ( ( R R s R t RAISE_VARARGSR t JUMP_ABSOLUTER7 t CONTINUE_LOOPc C sX y | i d \ } } Wn t t f j o d Sn X| | i j o g | _ n d S( sL Remove bogus edge for unconditional transfers Each block has a next edge that accounts for implicit control transfers, e.g. from a JUMP_IF_FALSE to the block that will be executed if the test is true. These edges must remain for the current assembler code to work. If they are removed, the dfs_postorder gets things in weird orders. However, they shouldn't be there for other purposes, e.g. conversion to SSA form. This method will remove the next edge when it follows an unconditional control transfer. iN( R R< RU t argt IndexErrort ValueErrort _uncond_transferR ( R R[ RU ( ( R t pruneNext s c C sP | i o2 | i d | i j o | i i | i d n | i i | i S( Ni ( R R RK R? R" ( R ( ( R R s !c C sf g } xY | i D]N } t | d j o q n | d } t | d o | i | i 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 graphN( t containedR R< R R RU t hasattrR' R` ( R Ra R RU ( ( R RD # s ( s RETURN_VALUERX s YIELD_VALUERY s JUMP_FORWARDRZ ( RE RF RM R RO RS R! RV RW R R R^ R_ R RD ( ( ( R R s t RAWt FLATt CONVt DONEt PyFlowGraphc B sI t Z e i Z f d d d Z d Z d Z d Z d Z d Z d Z d d Z d Z d Z e i Z x% e i D] Z e i e i e q We i Z x% e i D] Z e i e i e q Wd Z d Z d Z h 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 i0 Z1 d Z2 xF e3 i4 D]5 \ Z5 Z6 e5 d d j o e5 d Z e6 e e <qqW[5 [6 [ d Z7 h Z8 x. e9 e: e i D] Z; e; e8 e i e; <qW[; d Z< d Z= RS( Ni c C s | i | | _ | | _ d | _ | | _ t | | _ | | _ | o t t B| _ n d | _ g | _ g | _ g | _ g | _ g | _ t | p g | _ xQ t t | i D]: } | i | } t | t o | i | i | <q q Wt | _ d S( Ni ( R t super_initt namet filenameR t docstringt argst getArgCountt argcountt klasst optimizedt CO_OPTIMIZEDt CO_NEWLOCALSt flagst constst namest freevarst cellvarst closuret listt varnamesR- R R. t varR t TupleArgt getNameRc t stage( R Ri Rj Rl Rp Ro R. R{ ( ( R R = s, c C s | | _ d S( N( t docR Rk ( R R ( ( R t setDocstring[ s c C s5 | i | B| _ | t j o | i d | _ n d S( Ni ( R Rs t flagt CO_VARARGSRn ( R R ( ( R t setFlag^ s c C s | i | @o d Sn d S( Ni ( R Rs R ( R R ( ( R t checkFlagc s c C s t | | _ d S( N( Ry Ru R Rv ( R Ru ( ( R t setFreeVarsg s c C s | | _ d S( N( Ru R Rw ( R Ru ( ( R t setCellVarsj s c C s | i t j o | i | i n | i t j o | i n | i t j o | i n | i t j o | i Sn t d d S( s Get a Python code objects inconsistent PyFlowGraph stateN( R R~ Rc t computeStackDeptht flattenGraphRd t convertArgsRe t makeByteCodeRf t newCodeObjectt RuntimeError( R ( ( R t getCodem s c C s | o t i } | t _ n d } x | i D]w } | d } | d j o Hn t | d j o d Gd | G| GH| d } q- d Gd | G| G| d GH| d } q- W| o | t _ n d S( Ni t SET_LINENOi s s %3di ( t iot syst stdoutt savet pcR R< t tt opnameR ( R R R R R R ( ( R t dumpz s c sm h d } x* i D] } t | i | <q Wh d i 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 i | o | Sn d | <| | } | i } | o2 t g } | D] } | | | qQ ~ Sn) | i d j p i | Sn | Sd S( Ni R ( RG RH R t dt depthR t childrent maxt _[1]R: t max_depthRL R R ( R R R: R R ( R R R RG ( R R s 2i N( R R R R RA R t findDepthRV RG R R t stacksize( R R R R RG R ( ( R RG R R R R s c C s | i t j p t g | _ } d } h } h } x | i D]~ } | | | <xa | i D]S } | i | t | d j o | d } q` | d d j o | d } q` q` W| | | <qC Wd } x t t | D] } | | } t | d j o | d } n | d d j o | d } n | d } | i i | o, | d } | | | } | | f | | <q | i i | o | | | d f | | <q q Wt | _ d S( s- Arrange the blocks in order and resolve jumpsi i R i N( R R~ Rc R4 R< R t beginR R( R RV R R' R R- R. R t hasjrelt has_eltt opargt offsett hasjabsRd ( R R R R R< R R. R R R R ( ( R R sB c C s | i t j p t | i i d | i | i x t t | i D]r } | i | } t | d j oL | \ } } | i i | d } | o | | | | f | i | <q qM qM Wt | _ d S( s0 Convert arguments from symbolic to concrete formi i N( R R~ Rd R4 Rt R@ Rk t sort_cellvarsR- R R< R. R R R t _converterst getR t convRe ( R R R. R R R ( ( R R s (c C s h } x | i D] } d | | <q Wg } | i D]! } | i | o | | q2 q2 ~ | _ x | i D] } | | =qi W| i | i | _ | i | i | _ d S( sH Sort cellvars in the order of varnames and prune from freevars. i N( t cellsR Rw Ri R Rz RH t keysRv Rx ( R R R Ri ( ( R R s ; c C sv t | } xJ t t | D]6 } | t | | j o | | | j o | Sq q Wt | } | i | | 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. N( t typeRi R R- R Ry R. R R' ( R Ri Ry R R. R ( ( R t _lookupName s ( c C s3 t | d o | i } n | i | | i S( NR ( Rb R[ R R R Rt ( R R[ ( ( R t _convert_LOAD_CONST s c C s& | i | | i | i | | i S( N( R R R[ Ru Rz ( R R[ ( ( R t _convert_LOAD_FAST s c C s: | i d j o | i | | i n | i | | i S( N( R Ro R R R[ Rz Ru ( R R[ ( ( R t _convert_LOAD_NAME s c C s: | i d j o | i | | i n | i | | i S( N( R Ro R R R[ Rz Ru ( R R[ ( ( R t _convert_NAME s c C s9 | i | | i | i | | i | i | | i S( N( R R R[ Ru Rz Rx ( R R[ ( ( R t _convert_DEREF s c C s& | i | | i | i | | i S( N( R R R[ Rz Rx ( R R[ ( ( R t _convert_LOAD_CLOSURE% s c C s | i i | S( N( R t _cmpR, R[ ( R R[ ( ( R t _convert_COMPARE_OP* s i t _convert_c C s | i t j p t t | _ } x | i D] } | d } t | d j o | i | i | q1 | d } | d j o | i | q1 n t | \ } } y | i | i | | | Wq1 t j o' | G| GH| i | G| G| GH q1 Xq1 Wt | _ d S( Ni i R ( R R~ Re R4 t LineAddrTablet lnotabR< R R R t addCodet opnumR t nextLinet twobytet hit loR] Rf ( R R R R R R R ( ( R R 5 s& c C s | i t j p t | i t @d j o d } n t | i } | i } | i t @o | d } n t i | | | i | i | i i | i t | i t | i | i | i | i i | i i t | i t | i S( Ni i ( R R~ Rf R4 Rs Rr t nlocalsR Rz Rn t CO_VARKEYWORDSt newt codeR R R t getConstst tupleRu Rj Ri t firstlinet getTableRv Rw ( R R Rn ( ( R R O s c C sQ g } x> | i D]3 } t | t o | i } n | i | 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. N( R3 R Rt R2 R Rg R R' R ( R R3 R2 ( ( R R _ s (> RE RF R R Rh R R R R R R R R R R R R R t disR. 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 Ry t cmp_opR R t localst itemsRi t objR R R- R t numR R ( ( ( R Rg : sv ! c C s | d d j o d Sn d S( Ni RT i ( R ( R ( ( R t isJumpl s R| c B s) t 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 countR Ru ( R R Ru ( ( R R r s c C s d | i | i f S( Ns TupleArg(%s, %s)( R R Ru ( R ( ( R RO u s c C s d | i S( Ns .%d( R R ( R ( ( R R} w s ( RE RF t __doc__R RO R} ( ( ( R R| p s c C sb t | } | oK xH | D]< } t | t o& t t i | i } | | } q q Wn | S( N( R Rl Rn R[ R R| R t flattenRu t numNames( Rl R Rn R[ ( ( R Rm z s c C s* t | t i j p t t | d S( s/ Convert an int argument into high and low bytesi N( R t valt typest IntTypeR4 t divmod( R ( ( R R s R c B s; t 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 ( R R t codeOffsetR t lastlinet lastoffR ( R ( ( R R s c G sA x$ | D] } | i i t | q W| i t | | _ d S( N( Rl R[ R R R' t chrR R ( R Rl R[ ( ( R R s c C s | i d j o | | _ | | _ n | i | i } | | i } | d j o | i i } x0 | d j o" | d | d | d 8} q_ Wx6 | d j o( | | | d | d 8} d } q W| d j p | d j o | | | | n | | _ | i | _ n d S( Ni i ( R R t linenoR R R t addrt lineR R' t push( R R R R R ( ( R R s( c C s d i | i S( NRI ( RR R R ( R ( ( R R s c C s d i t t | i S( NRI ( RR RP R R R ( R ( ( R R s ( RE RF R R R R R R ( ( ( R R s t StackDepthTrackerc B s t Z d d Z h d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d d <d! d <d" d <d# d <d$ d <d% d <d& d' <d( d' <d) d <Z d* d f d+ d f g Z d, Z d- Z d. Z d/ Z d0 Z d1 Z d2 Z d3 Z d4 Z d5 Z d6 Z RS(7 Ni c C s# d } d } x| D]} | d } | o | Gn | i i | d } | d j o | | } n xC | i D]8 \ } } | t | | j o | } | | } Pql ql W| d j o; t | | d } | d j o | | | d } q n | | j o | } n | o | G| GHq q W| S( Ni i ( R t maxDepthR< R. R t debugR t effectR R t deltat patternst patt pat_deltaR t getattrt meth( R R< R R R. R R R R R R ( ( R R s2 t POP_TOPit DUP_TOPi s SLICE+1s SLICE+2s SLICE+3is STORE_SLICE+0s STORE_SLICE+1s STORE_SLICE+2s STORE_SLICE+3is DELETE_SLICE+0s DELETE_SLICE+1s DELETE_SLICE+2s DELETE_SLICE+3t STORE_SUBSCRt DELETE_SUBSCRt PRINT_ITEMR R t 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_ATTRt SETUP_EXCEPTi t SETUP_FINALLYt FOR_ITERt BINARY_t LOAD_c C s | d S( Ni ( R ( R R ( ( R t UNPACK_SEQUENCE s c C s | d S( Ni ( R ( R R ( ( R t BUILD_TUPLE s c C s | d S( Ni ( R ( R R ( ( R t BUILD_LIST s c C s" t | d \ } } | | d S( Ni i ( R t argcR R ( R R R R ( ( R t CALL_FUNCTION s c C s | i | d S( Ni ( R R R ( R R ( ( R t CALL_FUNCTION_VAR s c C s | i | d S( Ni ( R R R ( R R ( ( R t CALL_FUNCTION_KW! s c C s | i | d S( Ni ( R R R ( R R ( ( R t CALL_FUNCTION_VAR_KW# s c C s | S( N( R ( R R ( ( R t MAKE_FUNCTION% s c C s | S( N( R ( R R ( ( R t MAKE_CLOSURE' s c C s. | d j o d Sn | d j o d Sn d S( Ni ii i( R ( R R ( ( R t BUILD_SLICE* s c C s | S( N( R ( R R ( ( R t DUP_TOPX/ s ( RE RF R R R R R R R R R R R R R R ( ( ( R R s 9' ( R R R R R t compilerR t compiler.constsRq Rr R R R R# R Rc Rd Re Rf Rg R R| Rm R R R R ( Re R R R# Rf Rr R Rq Rm R R Rc R R Rd R R R R Rg R R| R R ( ( R t ? s, Y 3 Bh