��
���Lc@s
dZd
dk
Z
d
dkZd
dkZd
dklZ
d
dklZlZl	Z	l
Z

dfd��YZd�Zdfd	��YZ
d
ZdZdZd
Zdef
d��YZd�Zdfd��YZd�Zd�Zdfd��YZdfd��YZe�iZdS(s/A flow graph representation for Python bytecodei����N(
tmisc(tCO_OPTIMIZEDtCO_NEWLOCALSt
CO_VARARGStCO_VARKEYWORDSt	FlowGraphcBs�eZ
d�Zd
�Zdd�
Zd�Zd�ZdZd�Z	d�Z
d�Zd	�Zd
�Z
d�Zd�Zd
�Zd�Zd�ZRS(c

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

|ii|i�

dS(Ntexit(tBlocktcurrenttentryRRtSettblockstadd(
tself((s&/usr/lib/python2.6/compiler/pyassem.pyt__init__s





cCsg|ioP
|i
o7
d
Gt|i
�
GHdG|i
iGHdG|i
i�GHn

t|
�
GHn

|
|_
dS(Ntends    nexts   (t_debugRtreprtnexttget_children(R
tblock((s&/usr/lib/python2.6/compiler/pyassem.pyt
startBlocks








cCs>|
djo
|i
�}
n

|ii|
�

|i|
�

dS(
N(tNonetnewBlockRtaddNextR(R
R((s&/usr/lib/python2.6/compiler/pyassem.pyt	nextBlocks

	
c
Cst�}
|i
i|
�

|
S(
N(RRR(R
t
b((s&/usr/lib/python2.6/compiler/pyassem.pyR5s
	

c

Cs|i|i
�

dS(
N(RR(
R
((s&/usr/lib/python2.6/compiler/pyassem.pytstartExitBlock:s
ic

Cs
d
|_dS(Ni
(
R(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyt
_enable_debug?s
c

Cs
d
|_dS(Ni(
R(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyt_disable_debugBs
c
Gs�|io

d
G|
GHn

|
ddjo
|i
i|i�

n

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

n

|i
i|
�

dS(Ns
	itRETURN_VALUEtYIELD_VALUEii
(RR(RRt
addOutEdgeRtlent
isinstanceRtemit(R
tinst((s&/usr/lib/python2.6/compiler/pyassem.pyR#Es






'

c
Cs�xL|ii
�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
        (
RtelementsRRRt
dfs_postorderR	treverset
fixupOrdertappend(R
Rtorder((s&/usr/lib/python2.6/compiler/pyassem.pytgetBlocksInOrderNs









cCs$|i|
|�
|i
|
|�
d
S(s"Fixup bad order introduced by DFS.N(tfixupOrderHonorNexttfixupOrderForward(R
Rtdefault_next((s&/usr/lib/python2.6/compiler/pyassem.pyR(cs
cCs�
h}x(tt
|
�
�
D]}|||
|<qWxs
td
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(tt
|
�
�
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(trangeR!RR)tsortR'(R
RR.tindext
iRt
ntcurtchainteltt
lt
j((s&/usr/lib/python2.6/compiler/pyassem.pyR,ls<





3













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

|io+
|id
|jo
|i
|�

g}q
qW|i
|�

x
g}x�tt|�
�
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�|
2x,|D]$}
x|
D]}|
i
|�

q�
Wq�
WdS(s(Make sure all JUMP_FORWARDs jump forwarditJUMP_FORWARDi
N(R!R)RR/Rtinststremovetinsert(R
RR.R1tchainsR4RtconstraintsR2R7t
ct	forward_pR$tgoes_beforeta_chain((s&/usr/lib/python2.6/compiler/pyassem.pyR-�sT



























'







c


Cs
|ii
�S(
N(RR%(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyt	getBlocks�s
c


Cs|iS(
s/Return nodes appropriate for use with dominator(
R	(
R
((s&/usr/lib/python2.6/compiler/pyassem.pytgetRoot�sc
Cs4g}
x'|i�D]}|
i
|i��

qW|
S(
N(RCtextendtgetContainedGraphs(R
R7R((s&/usr/lib/python2.6/compiler/pyassem.pyRF�s





N(t__name__t
__module__RRRRRRRRRR#R+R(R,R-RCRDRF(((s&/usr/lib/python2.6/compiler/pyassem.pyRs 
													)	.		cCs_g}||
|<x;|i�D]-}||
jo
qn

|t
||
�}qW|i|�

|S(
s;Depth-first search of tree rooted at b, return in postorder(RR&R)(RtseenR*R?((s&/usr/lib/python2.6/compiler/pyassem.pyR&�s










RcBszeZ
dZd
d�
Zd�Zd�Zd�Zd�Zd�Zd�Z	d	�Z
dZd�Zd�Z
d�ZRS(itcCsYg|_t
i�|_t
i�|_|
|_ti|_g|_	tid
t_dS(Ni
(
R:RR
tinEdgestoutEdgestlabelRt_counttbidR(R
RM((s&/usr/lib/python2.6/compiler/pyassem.pyR�s
	


	

	
c

Cs.|io
d
|i|i
fS
d|i
SdS(Ns<block %s id=%d>s
<block id=%d>(RMRO(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyt__repr__�s


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

(tmaptstrR:RMROtjoin(R
R:((s&/usr/lib/python2.6/compiler/pyassem.pyt__str__�s


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

n

|ii|
�

dS(NiitJUMPi
(RLRR:R)(R
R$top((s&/usr/lib/python2.6/compiler/pyassem.pyR#�s




c


Cs|iS(
N(
R:(
R
((s&/usr/lib/python2.6/compiler/pyassem.pytgetInstructions�s
cCs|ii
|
�

dS(
N(RKR(R
R((s&/usr/lib/python2.6/compiler/pyassem.pyt	addInEdge�s
cCs|ii
|
�

dS(
N(RLR(R
R((s&/usr/lib/python2.6/compiler/pyassem.pyR �s
cCs|ii
|
�

dS(
N(RR)(R
R((s&/usr/lib/python2.6/compiler/pyassem.pyR

s

Rt
RAISE_VARARGSRt
JUMP_ABSOLUTER9t
CONTINUE_LOOPc
CsUy|id
\}
}Wnt
tfj
o



dS
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(R:t
IndexErrort
ValueErrort_uncond_transferR(R
RVtarg((s&/usr/lib/python2.6/compiler/pyassem.pyt	pruneNext
s




c

CsP|io2
|id
|i
jo
|i
i|id
�

n

|i
i�|iS(Ni(RRLR;R%(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyR
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
tgraph(R:R!thasattrR)Ra(R
t	containedR$RV((s&/usr/lib/python2.6/compiler/pyassem.pyRF"
s








(sRETURN_VALUERYsYIELD_VALUERZsJUMP_FORWARDR[(RGRHRNRRPRTR#RWRXR RR^R`RRF(((s&/usr/lib/python2.6/compiler/pyassem.pyR�s
								
		tRAWtFLATtCONVtDONEtPyFlowGraphcBsIeZ
eiZdddd
�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(icCs
|i�
|
|_
||_d|_||_t|�
|_||_|o
t	t
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(t
super_inittnametfilenameRt	docstringtargstgetArgCounttargcounttklassR
RtflagstconststnamestfreevarstcellvarstclosuretlisttvarnamesR/R!R"tTupleArgtgetNameRdtstage(R
RjRkRmt	optimizedRpR2tvar((s&/usr/lib/python2.6/compiler/pyassem.pyR<
s,


	
	
	
	

	

	
	
		
		






cCs
|
|_dS(
N(
Rl(R
tdoc((s&/usr/lib/python2.6/compiler/pyassem.pytsetDocstringZ
s
cCs5|i|
B|_|
t
jo
|id
|_n

dS(Ni
(RqRRo(R
tflag((s&/usr/lib/python2.6/compiler/pyassem.pytsetFlag]
s



cCs|i|
@o
d
S
dS(Ni
(
Rq(R
R�((s&/usr/lib/python2.6/compiler/pyassem.pyt	checkFlagb
s

cCst|
�
|_
dS(
N(RwRt(R
Rs((s&/usr/lib/python2.6/compiler/pyassem.pytsetFreeVarsf
s
cCs
|
|_dS(
N(
Ru(R
Rs((s&/usr/lib/python2.6/compiler/pyassem.pytsetCellVarsi
s
c


Cs2|i�
|i
�
|i�
|i�
|i�S(
sGet a Python code object(tcomputeStackDepthtflattenGraphtconvertArgstmakeByteCodet
newCodeObject(
R
((s&/usr/lib/python2.6/compiler/pyassem.pytgetCodel
s





cCs�|
o
ti
}|
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(tsyststdoutR:R!(R
tiotsavetpct
ttopname((s&/usr/lib/python2.6/compiler/pyassem.pytdumpx
s 

	















c
sph�
d}
x*�i
�D]}t|i��
�
|<qWh����
�fd
����id��_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�|�jo
|
S
d
�|<|
�|}
|i�}|o/
t
g}|D]}|�
||
�qK~�
S
|idjp
�
�i|
�S
|
SdS(Ni
R(RtmaxRMR(Rt
dtchildrent_[1]R?(R
t	max_depthtdepthRI(s&/usr/lib/python2.6/compiler/pyassem.pyR��
s








/
iN(RRCt	findDepthRWR	t	stacksize(R
RR((R
R�RIR�s&/usr/lib/python2.6/compiler/pyassem.pyR��
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(R:R+RWR)R!R/thasjrelthas_eltthasjabsReR{(R
R:R�tbeginRRR$R2R�topargtoffset((s&/usr/lib/python2.6/compiler/pyassem.pyR��
s>
































 
c
Cs�|ii
d
|i�
|i�
x�tt|i�
�
D]r}
|i|
}t|�
djoL
|\}}|ii|d�}|o 
||||�f|i|
<q�
q6
q6Wt
|_dS(s0Convert arguments from symbolic to concrete formiiN(RrR<Rlt
sort_cellvarsR/R!R:t_converterstgetRRfR{(R
R2R�R�R�tconv((s&/usr/lib/python2.6/compiler/pyassem.pyR��
s









(
c
Cs�h}
x|iD]}d
|
|<qWg}|i
D]}||
jo
||q2
q2~|_x|iD]
}|
|=qfW|i|
i�|_|i|i|_dS(sHSort cellvars in the order of varnames and prune from freevars.
        i
N(RuRxtkeysRtRv(R
tcellsRjR�((s&/usr/lib/python2.6/compiler/pyassem.pyR��
s




$




cCsst|
�
}xGt
t|�
�
D]3}|t||�
jo
|||
jo
|S
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.
        (ttypeR/R!R)(R
RjRwR�R2R((s&/usr/lib/python2.6/compiler/pyassem.pyt_lookupName�
s	

(
	



cCs3t|
d
�o
|
i
�}
n

|i|
|i�S(NR�(RbR�R�Rr(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt_convert_LOAD_CONST�
s


cCs&|i|
|i
�
|i|
|i�S(
N(R�RsRx(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt_convert_LOAD_FASTs

cCs:|idjo
|i|
|i�
n

|i|
|i�S(
N(RpRR�RxRs(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt_convert_LOAD_NAMEs


cCs:|idjo
|i|
|i�
n

|i|
|i�S(
N(RpRR�RxRs(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt
_convert_NAME
s


cCs9|i|
|i
�
|i|
|i�
|i|
|i�S(
N(R�RsRxRv(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt_convert_DEREFs


cCs&|i|
|i
�
|i|
|i�S(
N(R�RxRv(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt_convert_LOAD_CLOSURE#s

cCs|ii
|
�
S(
N(t_cmpR1(R
R_((s&/usr/lib/python2.6/compiler/pyassem.pyt_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
LineAddrTabletlnotabR:R!taddCodetopnumtnextLinettwobyteR]RgR{(R
R�R�R�R�thitlo((s&/usr/lib/python2.6/compiler/pyassem.pyR�3s$
















	


c
Cs�|it
@d
jo

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

ti||
|i|i|i	i
�|i�t|i
�
t|i�
|i|i|i	i|i	i�t|i�
t|i�
�S(Nii
(RqRR!RxRoRttypestCodeTypeR�R�R�t	getConststtupleRsRkRjt	firstlinetgetTableRtRu(R
tnlocalsRo((s&/usr/lib/python2.6/compiler/pyassem.pyR�Ms


	







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.
        (RrR"RhR�R)R�(R
R7R6((s&/usr/lib/python2.6/compiler/pyassem.pyR�]s





(N(>RGRHRRRiRRR�R�R�R�R�R�R�R�RR
R�tdisR2R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�Rwtcmp_opR�R�tlocalstitemsRjtobjR�R�R/R!tnumR�R�(((s&/usr/lib/python2.6/compiler/pyassem.pyRh9
sv
									!






		
	
		
		








	
	
	




		


	c

Cs|d
 djo
dS
dS(NiRUi
((
R�((s&/usr/lib/python2.6/compiler/pyassem.pytisJumpjs

Ryc
Bs)eZ
dZd
�Zd�Zd�ZRS(s:Helper for marking func defs with nested tuples in arglistcCs|
|_||_
dS(
N(tcountRs(R
R�Rs((s&/usr/lib/python2.6/compiler/pyassem.pyRps
	
c

Csd
|i|i
fS(NsTupleArg(%s, %s)(R�Rs(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyRPss
c

Csd
|iS(Ns.%d(
R�(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyRzus
(RGRHt__doc__RRPRz(((s&/usr/lib/python2.6/compiler/pyassem.pyRyns

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

|
S(
N(R!R"RyRtflattenRs(RmRoR_tnumNames((s&/usr/lib/python2.6/compiler/pyassem.pyRnxs






c

Cs
t|d
�S(s/Convert an int argument into high and low bytesi
(
tdivmod(
tval((s&/usr/lib/python2.6/compiler/pyassem.pyR��sR�c
Bs;eZ
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(tcodet
codeOffsetR�tlastlinetlastoffR�(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyR�s
	
	
	
	
	
c
GsAx$|
D]}|ii
t|�
�

qW|it|
�
|_dS(
N(R�R)tchrR�R!(R
RmR_((s&/usr/lib/python2.6/compiler/pyassem.pyR��s


cCs
|id
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�(R�R�R�R�R�R)(R
tlinenotaddrtlinetpush((s&/usr/lib/python2.6/compiler/pyassem.pyR��s.

	























	
c

Csd
i|i
�
S(NRJ(RSR�(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyR��s
c

Csd
it
t|i��
S(NRJ(RSRQR�R�(
R
((s&/usr/lib/python2.6/compiler/pyassem.pyR��s
(RGRHR�RR�R�R�R�(((s&/usr/lib/python2.6/compiler/pyassem.pyR��s
			 	tStackDepthTrackercBs�
eZ
dd
�
Zh$dd6dd6dd6dd6dd	6dd
6dd6dd6dd
6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd6dd 6dd!6dd"6dd#6dd$6dd%6d&d'6d&d(6dd)6dd*6Zd8d9gZd-�Zd.�Zd/�Zd0�Zd1�Z	d2�Z
d3�Zd4�Zd5�Z
d6�Zd7�ZRS(:icCs#
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
(teffectR�RtpatternsR!tgetattr(R
R:tdebugR�tmaxDepthR2R�tdeltatpatt	pat_deltatmeth((s&/usr/lib/python2.6/compiler/pyassem.pyR��s2
















	











i����tPOP_TOPi
tDUP_TOPi����tLIST_APPENDsSLICE+1sSLICE+2sSLICE+3s
STORE_SLICE+0s
STORE_SLICE+1s
STORE_SLICE+2i����s
STORE_SLICE+3sDELETE_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_ATTRitSETUP_EXCEPTt
SETUP_FINALLYtFOR_ITERtWITH_CLEANUPtBINARY_tLOAD_cCs|
d
S(Ni
((R
R�((s&/usr/lib/python2.6/compiler/pyassem.pytUNPACK_SEQUENCEs
cCs	|
d
S(Ni
((R
R�((s&/usr/lib/python2.6/compiler/pyassem.pytBUILD_TUPLEs
cCs	|
d
S(Ni
((R
R�((s&/usr/lib/python2.6/compiler/pyassem.pyt
BUILD_LISTs
cCs"t|
d
�\}}||dS(Ni
i(
R�(R
targcR�R�((s&/usr/lib/python2.6/compiler/pyassem.pyt
CALL_FUNCTIONs

cCs|i|
�
d
S(Ni
(
R

(R
R
((s&/usr/lib/python2.6/compiler/pyassem.pytCALL_FUNCTION_VARs
cCs|i|
�
d
S(Ni
(
R

(R
R
((s&/usr/lib/python2.6/compiler/pyassem.pytCALL_FUNCTION_KW!s
cCs|i|
�
d
S(Ni(
R

(R
R
((s&/usr/lib/python2.6/compiler/pyassem.pytCALL_FUNCTION_VAR_KW#s
c
Cs|
S(
N((R
R
((s&/usr/lib/python2.6/compiler/pyassem.pyt
MAKE_FUNCTION%s
c
Cs|
S(
N((R
R
((s&/usr/lib/python2.6/compiler/pyassem.pytMAKE_CLOSURE'scCs(|
d
jo
dS
|
djo
dS
dS(Nii����ii����((R
R
((s&/usr/lib/python2.6/compiler/pyassem.pytBUILD_SLICE*s





c
Cs|
S(
N((R
R
((s&/usr/lib/python2.6/compiler/pyassem.pytDUP_TOPX/s
(R
i����(R
i
(RGRHR�R�R�R	
R

R
R

R
R
R
R
R
R
R
(((s&/usr/lib/python2.6/compiler/pyassem.pyR��sf



































											(R�R�R�R�tcompilerRtcompiler.constsR
RRRRR&RRdReRfRgRhR�RyRnR�R�R�R�(((s&/usr/lib/python2.6/compiler/pyassem.pyt<module>
s*


"�	Y


�2	
			Bj