m�
�=5Dc@s
dZd
k
Z
d
kZd
kZd
kZdklZ
dklZl	Z	l
Z
lZ
dfd��YZd�Z
dfd��YZd	Zd
ZdZdZd
ef
d��YZd�Zdfd��YZd�Zd�Zdfd��YZdfd��YZe�iZd
S(s/A flow graph representation for Python bytecodeN(
smisc(sCO_OPTIMIZEDsCO_NEWLOCALSs
CO_VARARGSsCO_VARKEYWORDSt	FlowGraphcBs�tZ
d
�Zd�Zdd�
Zd�Zd�ZdZd�Z	d�Z
d	�Zd
�Zd�Z
d�Zd
�Zd�Zd�Zd�ZRS(Nc

Cs[t�|_|_td
�
|_ti�|_|ii|i�

|ii|i�

dS(Ntexit(	tBlocktselftcurrenttentryR
tmisctSettblockstadd(
R((t&/usr/lib/python2.4/compiler/pyassem.pyt__init__
s





cCsg|i
oP
|io7
d
Gt|i�
GHdG|iiGHdG|ii�GHn

t|
�
GHn

|
|_dS(Ntends    nexts   (Rt_debugRtreprtnexttget_childrentblock(RR((R
t
startBlocks








cCs>|
djo
|i�}
n

|ii|
�

|i|
�

dS(
N(RtNoneRtnewBlockRtaddNextR(RR((R
t	nextBlocks

	
c
Cst�}
|ii|
�

|
S(
N(Rt
bRRR	(RR((R
R6s
	

c

Cs|i
|i�

dS(
N(RRR
(
R((R
tstartExitBlock;s
ic

Cs
d
|_
dS(Ni
(RR
(
R((R
t
_enable_debug@s
c

Cs
d
|_
dS(Ni(RR
(
R((R
t_disable_debugCs
c
Gs�|i
o

d
G|
GHn

|
dddgjo
|ii|i�

n

t|
�
djo,
t|
dt�o
|ii|
d�

n

|ii	|
�

dS(Ns
	itRETURN_VALUEtYIELD_VALUEii
(
RR
tinstRt
addOutEdgeR
tlent
isinstanceRtemit(RR((R
R!Fs






'

c
Cs�xL|i
i�D];}
|
|ijo
qn

|
ip
|
i|i�

q
qWt|ih�}|i
�
|i||i�
|i|jo
|i|i�

n

|S(slReturn the blocks in reverse postorder

        i.e. each node appears before all of its successors
        N(
RRtelementsRR
RRt
dfs_postorderRtordertreverset
fixupOrdertappend(RRR$((R
tgetBlocksInOrderOs









cCs$|i
|
|�
|i|
|�
d
S(s"Fixup bad order introduced by DFS.N(RtfixupOrderHonorNextRtdefault_nexttfixupOrderForward(RRR*((R
R&ds

cCs�
h}x(t
t|
�
�
D]}|||
|<qWxs
t
d
t|
�
d�D]X
}|
|}|
|d}	|ip(
|id
|jp
|id
|	jo
qKn

|}g}|}
xD|
io9
|
id
|jo%
|i|
id
�

|
id
}
q�
Wg}x%|D]}|i|||f�

q	
W|i�
|i�
x|D]\}}|
||=qE
W|g
||
||d+x(t
t|
�
�
D]}|||
|<q�
WqKWdS(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.
        ii
N(tindextrangeRRt
iRt
nRR*tcurtchainteltR't
ltsortR%t
j(RRR*R,RR1R.R5R3R/R2R0((R
R)ms@






3















cCs�
h}g}
g}x`|
D]X}t|
�
||<|i|�

|io+
|id
|jo
|
i|�

g}q
qW|
i|�

x!
g}x�t
t|
�
�
D]�}|
|}x�|D]�}x�|i
�D]�}|||jos
d
}xA|iD]6}|d
djo
|d|jo

d}q%

q�
q�W|p
q�n

|i|||f�

q�
q�Wq�Wq�W|p
Pn

|d
\}	}
|
|
}|
i|�

|
i|	|�
q�
W|
2x,|
D]$}x|D]}|
i|�

q�
Wq�
WdS(s(Make sure all JUMP_FORWARDs jump forwardii
tJUMP_FORWARDN(R,tchainsR0RRRR'RR*tconstraintsR-R.R3Rt
ct	forward_ptinstsRtgoes_beforeta_chaintremovetinsert(RRR*R,R9RR.R3R:R<R=RR8R7R0((R
R+�sZ





























'









c


Cs
|i
i�S(
N(RRR"(
R((R
t	getBlocks�s
c


Cs|i
S(s/Return nodes appropriate for use with dominatorN(RR(
R((R
tgetRoot�s

c
Cs4g}x'|i�D]}
|i|
i��

qW|S(
N(R3RR@RtextendtgetContainedGraphs(RRR3((R
RC�s





(t__name__t
__module__RRRRRRR
RRR!R(R&R)R+R@RARC(((R
Rs 
													)	.		cCsbg}||
|<x>|i�D]0}|
i|�
o
qn

|t||
�}qW|i|�

|S(s;Depth-first search of tree rooted at b, return in postorderN(R$RtseenRR9thas_keyR#R'(RRFR9R$((R
R#�s











RcBsztZ
d
Zdd�
Zd�Zd�Zd�Zd�Zd�Zd	�Z	d
�Z
dZd�Zd�Z
d�ZRS(NitcCsYg|_
ti�|_ti�|_|
|_ti|_	g|_
tid
t_dS(Ni
(RR;RRtinEdgestoutEdgestlabelRt_counttbidR(RRK((R
R�s
	


	

	
c

Cs1|i
o
d
|i
|ifSn
d|iSdS(Ns<block %s id=%d>s
<block id=%d>(RRKRM(
R((R
t__repr__�s


c
Cs2tt
|i�}
d
|i|idi|
�
fS(Ns<block %s %d:
%s>s

(tmaptstrRR;RKRMtjoin(RR;((R
t__str__�s

cCsG|
d
}|d djo
|ii|
d�

n

|ii|
�

dS(NiitJUMPi
(RtopRRJR	R;R'(RRRT((R
R!�s




c


Cs|i
S(
N(RR;(
R((R
tgetInstructions�s
cCs|i
i|
�

dS(
N(RRIR	R(RR((R
t	addInEdge�s
cCs|i
i|
�

dS(
N(RRJR	R(RR((R
R�s
cCs|i
i|
�

dS(
N(RRR'R(RR((R
R
s
Rt
RAISE_VARARGSRt
JUMP_ABSOLUTER6t
CONTINUE_LOOPc
CsXy|i
d
\}}
Wnttfj
o



dSn
X||ijo

g|_n

dS(sLRemove 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.
        i����N(RR;RTtargt
IndexErrort
ValueErrort_uncond_transferR(RRZRT((R
t	pruneNext	
s




	

c

CsP|i
o2
|i
d
|ijo
|ii|i
d
�

n

|ii�|i
S(Ni(RRRJR>R"(
R((R
R
s
!

c
Csfg}
xY|iD]N}t|�
d
jo
qn

|d
}t|d�o
|
i|i�

q
qW|
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
tgraphN(	t	containedRR;RRRTthasattrR'R_(RR`RRT((R
RC#
s









(sRETURN_VALUERWsYIELD_VALUERXsJUMP_FORWARDRY(RDRERLRRNRRR!RURVRRR]R^RRC(((R
R�s
										tRAWtFLATtCONVtDONEtPyFlowGraphcBsItZ
eiZfd
dd�Zd�Zd�Zd�Zd�Z	d�Z
d�Zdd	�
Zd
�Z
d�Zei�Zx%eiD]Zeieie�

q�Wei�Zx%eiD]Zeieie�

q�Wd�Zd
�Zd�ZhZd�Zd�ZeZeZd�Zd�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/ei0�
Z1d�Z2xFe3�i4�D]5\Z5Z6e5d djo
e5dZe6ee<q�

q�
W[5[6[d�Z7hZ8x.e9e:ei�
�
D]Z;e;e8eie;<qW[;d�Z<d�Z=RS(NicCs
|i
�
|
|_||_d|_||_t|�
|_||_	|o
ttB|_
n

d
|_
g|_g|_g|_g|_g|_t|�
p
g|_xQtt|i�
�
D]:}|i|}t|t�o
|i�|i|<q�
q�Wt|_dS(Ni(Rt
super_inittnametfilenameRt	docstringtargstgetArgCounttargcounttklasst	optimizedtCO_OPTIMIZEDtCO_NEWLOCALStflagstconststnamestfreevarstcellvarstclosuretlisttvarnamesR-RR.tvarR tTupleArgtgetNameRbtstage(RRhRiRkRoRnR.Rz((R
R=
s,


	
	
	
	

	

	
	
		
		






cCs
|
|_dS(
N(tdocRRj(RR~((R
tsetDocstring[
s
cCs5|i
|
B|_
|
tjo
|id
|_n

dS(Ni
(RRrtflagt
CO_VARARGSRm(RR�((R
tsetFlag^
s



cCs|i
|
@o
d
Sn

dS(Ni
(RRrR�(RR�((R
t	checkFlagc
s

cCst|
�
|_dS(
N(RxRtRRu(RRt((R
tsetFreeVarsg
s
cCs
|
|_dS(
N(RtRRv(RRt((R
tsetCellVarsj
s
c

Cs�|i
tjo
|i�
|i�
n

|i
tjo
|i�
n

|i
tjo
|i�
n

|i
t	jo
|i
�Sn

td
�dS(sGet a Python code objectsinconsistent PyFlowGraph stateN(RR}RbtcomputeStackDepthtflattenGraphRctconvertArgsRdtmakeByteCodeRet
newCodeObjecttRuntimeError(
R((R
tgetCodem
s











cCs�|
o
t
i}|
t
_n

d
}x�|iD]w}|d
}|djo
Hn

t	|�
djo
dGd|G|GH|d}q-
dGd|G|G|dGH|d}q-W|
o

|t
_n

dS(Nit
SET_LINENOi
s
	s%3di(
tiotsyststdouttsavetpcRR;t
ttopnameR(RR�R�R�R�R�((R
tdumpz
s 

	















c
smh�d}x*�i�D]}
t|
i��
�|
<qWh�
����
d
����i
d��_dS(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.
        cs��i
|�
o
|
Sn

d
�|<|
�|}
|i�}|o2
tg}|D]}|�
||
�qQ~�
Sn)
|idjp
�
�i
|
�Sn
|
SdS(Ni
R
(RFRGRt
dtdepthRtchildrentmaxt_[1]R9t	max_depthRKRR
(RR�R9R�R�(RR�R�RF(R
R��
s







2
iN(R�RR
RR@Rt	findDepthRURFR�Rt	stacksize(RRR�R
RFR�((RRFR�R�R
R��
s




c
Cs�
g|_
}d
}h}
h}x�|i�D]~}||
|<xa|i�D]S}|i	|�

t
|�
djo
|d}qI
|d
djo
|d}qI
qIW|||<q,Wd
}x�tt
|�
�
D]�}||}t
|�
djo
|d}n 
|d
djo
|d}n

|d
}
|ii|
�
o,
|d}|
||}	|
|	f||<q�
|ii|
�
o
|
|
|df||<q�
q�Wt|_dS(s-Arrange the blocks in order and resolve jumpsii
R�iN(RR;R�tbeginRR(RRURR'RR-R.R�thasjrelthas_elttopargtoffsetthasjabsRcR}(RR�RRR;R.R�R�RR�R�((R
R��
sB



































 
c
Cs�|i
id
|i�
|i�
x�tt|i�
�
D]r}|i|}t|�
djoL
|\}}|ii
|d�}
|
o 
||
||�f|i|<q�
q6
q6Wt|_dS(s0Convert arguments from symbolic to concrete formiiN(RRsR?Rjt
sort_cellvarsR-RR;R.R�R�R�t_converterstgetRtconvRdR}(RR�R.R�R�R�((R
R��
s












(
c
Cs�h}x|iD]}d
||<qWg}
|iD]!}|i|�
o
|
|q2
q2~
|_x|iD]
}||=qiW|i|i�|_|i|i|_	dS(sHSort cellvars in the order of varnames and prune from freevars.
        i
N(
tcellsRRvRhR�RyRGtkeysRuRw(RR�R�Rh((R
R��
s




;



cCsvt|
�
}xJtt|�
�
D]6}|t||�
jo
|||
jo
|Sq
qWt|�
}|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(	ttypeRhR�R-RRxR.RR'(RRhRxRR.R�((R
t_lookupName�
s


(




cCs3t|
d
�o
|
i�}
n

|i|
|i�S(NR�(RaRZR�RR�Rs(RRZ((R
t_convert_LOAD_CONST�
s


cCs&|i
|
|i�
|i
|
|i�S(
N(RR�RZRtRy(RRZ((R
t_convert_LOAD_FASTs

cCs:|i
djo
|i|
|i�
n

|i|
|i�S(
N(RRnRR�RZRyRt(RRZ((R
t_convert_LOAD_NAME
s


cCs:|i
djo
|i|
|i�
n

|i|
|i�S(
N(RRnRR�RZRyRt(RRZ((R
t
_convert_NAMEs


cCs9|i
|
|i�
|i
|
|i�
|i
|
|i�S(
N(RR�RZRtRyRw(RRZ((R
t_convert_DEREFs


cCs&|i
|
|i�
|i
|
|i�S(
N(RR�RZRyRw(RRZ((R
t_convert_LOAD_CLOSURE%s

cCs|i
i|
�
S(
N(Rt_cmpR,RZ(RRZ((R
t_convert_COMPARE_OP*s
i	t	_convert_c
Cs�t�|_}x�|iD]�}|d
}t|�
djo
|i|i|�

q
|d}|djo
|i
|�

qn

t|�
\}}
y|i|i||
|�
Wqtj
o'



|G|GH|i|G|
G|GH�q
XqWt|_dS(Nii
R�(t
LineAddrTableRtlnotabR;R�R�RtaddCodetopnumR�tnextLinettwobytethitloR\ReR}(RR�R�R�R�R�R�((R
R�5s&


















	


c
Cs�|i
t@d
jo

d
}
n
t|i�
}
|i}|i
t@o
|d}n

ti	||
|i
|i
|ii�|i
�t|i�
t|i�
|i|i|ii|ii�t|i�
t|i�
�S(Nii
(RRrRqtnlocalsRRyRmtCO_VARKEYWORDStnewtcodeR�R�R�t	getConststtupleRtRiRht	firstlinetgetTableRuRv(RR�Rm((R
R�Os




	







c
CsQg}
x>|iD]3}t|t�o
|i�}n

|
i|�

qWt|
�
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(	R3RRsR2R RfR�R'R�(RR3R2((R
R�_s






(>RDRERRRgRRR�R�R�R�R�R�R�R�RRR�tdisR.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�Rxtcmp_opR�R�tlocalstitemsRhtobjR�R�R-RtnumR�R�(((R
Rf:
sv
							
		!






		
	
		
		








	
	
	




		


	c

Cs|d
 djo
dSn

dS(NiRSi
(
R�(
R�((R
tisJumpls

R{c
Bs)tZ
dZd
�Zd�Zd�ZRS(s:Helper for marking func defs with nested tuples in arglistcCs|
|_||_dS(
N(tcountRRt(RR�Rt((R
Rrs
	
c

Csd
|i
|ifS(NsTupleArg(%s, %s)(RR�Rt(
R((R
RNus
c

Csd
|i
S(Ns.%d(RR�(
R((R
R|ws
(RDREt__doc__RRNR|(((R
R{ps

		c
Csbt|�
}|oK
xH|D]<}t|t�o&
tti|i�
�
}
||
}q
qWn

|S(
N(
RRkRmRZR R{RtflattenRttnumNames(RkR�RmRZ((R
Rlzs






c

Cs
t|d
�S(s/Convert an int argument into high and low bytesi
N(tdivmodtval(
R�((R
R��s


R�c
Bs;tZ
dZd
�Zd�Zd�Zd�Zd�ZRS(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

Cs:g|_
d
|_d
|_d
|_d
|_g|_dS(Ni(RR�t
codeOffsetR�tlastlinetlastoffR�(
R((R
R�s
	
	
	
	
	
c
GsAx$|
D]}|iit|�
�

qW|it|
�
|_dS(
N(RkRZRR�R'tchrR�R(RRkRZ((R
R��s


cCs
|i
d
jo
|
|_
|
|_n�
|i|i}|
|i}|d
jo�
|ii	}x0|djo"
|d�

|d
�

|d8}q_
Wx6|djo(
||�

|d�

|d8}d
}q�
W|d
jp

|d
jo
||�

||�

n

|
|_|i|_n

dS(Nii�(RR�tlinenoR�R�R�taddrtlineR�R'tpush(RR�R�R�R�((R
R��s(

	


















	
c

Csd
i|i�
S(NRH(RQRR�(
R((R
R��s
c

Csd
it
t|i��
S(NRH(RQROR�RR�(
R((R
R��s
(RDRER�RR�R�R�R�(((R
R��s
			 	tStackDepthTrackercBs�
tZ
d
d�
Zhdd<dd<dd<dd<d	d
<dd<dd
<d
d
<dd<dd<dd
<dd
<dd<dd<dd
<dd<dd<dd<dd<dd
<dd<dd
<dd<dd<dd<d d<d!d<d"d<d#d
<d$d<d%d
<d&d'<d(d'<d)d<Zd*dfd+dfgZd,�Zd-�Zd.�Zd/�Zd0�Z	d1�Z
d2�Zd3�Zd4�Z
d5�Zd6�ZRS(7NicCs#
d
}d
}x
|
D]
}|d
}	|o
|Gn

|ii|	d�}|dj	o
||}n�
xC|iD]8\}}|	t|�
 |jo
|}||}Pql
qlW|djo;
t||	d�}
|
dj	o
||
|d�
}q�
n

||jo

|}n

|o

|G|GHq
qW|S(Nii
(R�tmaxDepthR;R.R�tdebugRteffectR�Rtdeltatpatternstpatt	pat_deltaRtgetattrtmeth(RR;R�R�R.R�R�R�R�R�R�((R
R��s2
















	











tPOP_TOPi����tDUP_TOPi
sSLICE+1sSLICE+2sSLICE+3i����s
STORE_SLICE+0s
STORE_SLICE+1s
STORE_SLICE+2s
STORE_SLICE+3i����sDELETE_SLICE+0sDELETE_SLICE+1sDELETE_SLICE+2sDELETE_SLICE+3tSTORE_SUBSCRt
DELETE_SUBSCRt
PRINT_ITEMRRt	EXEC_STMTtBUILD_CLASSt
STORE_NAMEt
STORE_ATTRtDELETE_ATTRtSTORE_GLOBALt	BUILD_MAPt
COMPARE_OPt
STORE_FASTtIMPORT_STARtIMPORT_NAMEtIMPORT_FROMt	LOAD_ATTRtSETUP_EXCEPTit
SETUP_FINALLYtFOR_ITERtBINARY_tLOAD_cCs|
d
S(Ni
(
R�(RR�((R
tUNPACK_SEQUENCEs
cCs	|
d
S(Ni
(
R�(RR�((R
tBUILD_TUPLEs
cCs	|
d
S(Ni
(
R�(RR�((R
t
BUILD_LISTs
cCs"t|
d
�\}}||dS(Ni
i(R�targcR�R�(RR
R�R�((R
t
CALL_FUNCTIONs

cCs|i
|
�
d
S(Ni
(RR

R
(RR
((R
tCALL_FUNCTION_VARs
cCs|i
|
�
d
S(Ni
(RR

R
(RR
((R
tCALL_FUNCTION_KW!s
cCs|i
|
�
d
S(Ni(RR

R
(RR
((R
tCALL_FUNCTION_VAR_KW#s
c
Cs|
S(
N(
R
(RR
((R
t
MAKE_FUNCTION%s
c
Cs|
S(
N(
R
(RR
((R
tMAKE_CLOSURE'scCs.|
d
jo
dSn
|
djo
dSn

dS(Nii����ii����(
R
(RR
((R
tBUILD_SLICE*s





c
Cs|
S(
N(
R
(RR
((R
tDUP_TOPX/s
(RDRER�R�R�R	
R

R
R

R
R
R
R
R
R
R
(((R
R��s�9'										(R�R�R�R�ttypestcompilerRtcompiler.constsRpRqR�R�RR#RRbRcRdReRfR�R{RlR�R�R�R�(RdR�R�R#ReRqR�RpRlR�R�RbR
R�RcR�R�RR�RfRR{RR�((R
t
?
s,	
	
	
	

�	Y


�3	
			Bh