File: //opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyc
�
��]c @ s d d l m Z d d l m Z d d l Z e j d e d e d e d e d e d e d
e d e d e � d d l Z d d l Z d d l Z d d l
Z
d d l Z d d l Z d d l
Z
d d l Z d d
l m Z d d l m Z m Z d d l m Z d d l m Z d d l Z y d d l m Z Wn! e k
rUd d l m Z n Xy d d l m Z Wn e k
r�e Z n Xd � Z e j e j! f d � Z" d � Z# d � Z$ d � Z% d e
j& f d � � YZ' d e
j( f d � � YZ) d e
j( e f d � � YZ* d e
j( f d � � YZ+ d e
j& f d! � � YZ, d" e
j- e
j& f d# � � YZ. d$ e
j/ f d% � � YZ0 e j1 d& d' � Z2 e j1 d( d' � Z3 e j1 d) d' � Z4 d* e
j( e f d+ � � YZ5 d, e
j6 f d- � � YZ7 d. e
j6 f d/ � � YZ8 d S(0 i����( t TypeSlots( t not_a_constantNt UtilityCodet
EncodedStringt BytesLiteralt Nodest ExprNodest
PyrexTypest Builtint UtilNodest Naming( R ( R R ( t error( t SkipDeclarations( t reduce( t
basestringc C s t j | d � S( Ns
Optimize.c( R t load_cached( t name( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt load_c_utility" s c C s t | | � r | j S| S( N( t
isinstancet arg( t nodet coercion_nodes( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt unwrap_coerced_node% s c C s& x t | t j � r! | j } q W| S( N( R R t
ResultRefNodet
expression( R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt unwrap_node* s
c C s� t | � } t | � } t | t j � rL t | t j � rL | j | j k St | t j � r� t | t j � r� | j o� t | j | j � o� | j | j k St
S( N( R R R t NameNodeR t
AttributeNodet
is_py_attrt is_common_valuet objt attributet False( t at b( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR / s $$/c C s# | d k r | j d k r d S| S( N( t Nonet constant_result( R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt filter_none_node8 s t IterationTransformc
B s e Z d Z d � Z d � Z e d � Z d � Z e j e j
e j d e j
d � g � Z e j e j e j d e j
d � g � Z e d � Z e j e j e j d e j d � e j d e j d � e j d e j d � g � Z e j e j e j d e j d � e j d
e j d � e j d e j d � e j d e j d � g d d �Z e d
� Z e d � Z d � Z d � Z e d � Z d � Z! e j e j e j d e j d � e j d e j d � e j d e j d � e j d e j d � e j d e j d � g � Z" RS( s Transform some common for-in loop patterns into efficient C loops:
- for-in-dict loop becomes a while loop calling PyDict_Next()
- for-in-enumerate is replaced by an external counter variable
- for-in-range loop becomes a plain C for loop
c C s | j � r�| j } t j | � } t | j t j � rN | j j j j
} n | j j j
} t j | � } | j | � } t j
| d d d | j d | �} t j | d t j | d | d t j | d d ��t j | � g �} t j | d
t j | d | d | �g d
d �} t j | d | g d t j | d | d t j | j j d | j �d | d
t j | d | d t j | d d ����}
|
j | j � � }
| j |
� }
t j | |
� } | j d k r�t j | d | �} n | S| j | � | Sd S( Nt operatoru ==t operand1t operand2t statst lhst rhst valuei t
if_clausest conditiont bodyt else_clauset tempst targett iteratort sequencei t not_int operand(! t is_ptr_containst posR R R R) R t IndexNodet baset typet base_typet
TempHandlet reft PrimaryCmpNodeR( R t StatListNodet SingleAssignmentNodet BoolNodet
BreakStatNodet
IfStatNodet IfClauseNodeR# t TempsBlockNodet
ForInStatNodet IteratorNodet analyse_expressionst current_envt visitt TempResultFromStatNodeR' t NotNodet
visitchildren( t selfR R9 t
result_refR= t
target_handleR3 t cmp_nodet if_bodyt if_nodet for_loopt new_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_PrimaryCmpNodeD sF ' 0
c C s# | j | � | j | | j j � S( N( RO t _optimise_for_loopR4 R5 ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_ForInStatNodeu s
c
C s� | j t j k rA | r | S| j | d | d d d t d t �S| j j sY | j j ro | j | | d | �S| j t j
k r� | j | | d | �S| j t j k r� | j
| | d | �St | t j � s� | S| j d k r| j r� t | j j � pd } n1 t | j � } | r9| j d k r9| d 8} n | j } | j r�| r�| r�| j ph| j } | j } | j � j j d k } | r�| d k r�t | t j � r�| j } | j r�| j d
k r�| j r�| j j r�t } q�q�n t }
} | d k s | r'| d k r't }
nR | d k sE| rN| d k rNt } n+ | d
k sl| ry| d k ryt }
} n |
s�| r�| j | | | |
| � Sn | j d k r#| j r#| j r#| j j r#| j d k r�| r�| S| j | | � S| j d k r#| r| S| j! | | � Sn t" j# r�| j$ j j% r�| j d k r�| j r�| j r�| j j r�| j d k r�| j& | | d | �Sn | S( Nt dict_objt methodt keyst valuest reversedi i i t itemst dictt iterkeyst
itervaluest iteritemst enumeratet ranget xrange( R] R^ R` ( Rf Rg (' R< R t dict_typet _transform_dict_iterationR# t TrueR t is_ptrt is_arrayt _transform_carray_iterationt
bytes_typet _transform_bytes_iterationt unicode_typet _transform_unicode_iterationR R t SimpleCallNodet argst arg_tuplet lenRP t functiont is_attributeR R t global_scopet contextt language_levelt is_nameR t entryt
is_builtint _transform_enumerate_iterationt _transform_reversed_iterationt Optionst
convert_rangeR3 t is_intt _transform_range_iteration( RP R R4 R_ t arg_countRv t base_objR\ t is_safe_itert inner_functionR] R^ ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRY y sp $
c C s� | j j } t | � d k r2 t | j d � | St | � d k rX t | j d � | S| d } | j t j t j f k r� | j d � | j
_ t | j
_
| S| j | | d t �S( Ni s( reversed() requires an iterable argumenti s# reversed() takes exactly 1 arguments! 'NoneType' object is not iterableR_ ( Rt Rs Ru R R9 R< R t
tuple_typet list_typet as_none_safe_nodeR4 R5 Rj R_ RY ( RP R t reversed_functionRs R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR � s
t sc C s� | j j } | j r) | t j k r) | St j | j d � � } t j | j
d | j d | g d d �} t j | j
d | j d | g d d �} t j
| | j | t j | j
d | d d d d d
| d | j d d �d
| �� S( Ns 'NoneType' is not iterablet PyBytes_AS_STRINGRs t is_tempi t PyBytes_GET_SIZER; t startt stept stopR< i R_ ( R3 R< R� R Rn R t
LetRefNodeR� R t PythonCapiCallNodeR9 t PyBytes_AS_STRING_func_typet PyBytes_GET_SIZE_func_typet LetNodeRm t SliceIndexNodeR# ( RP R t
slice_nodeR_ t target_typet unpack_temp_nodet slice_base_nodet len_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRo � s8 t kindt datat indext lengtht exception_values -1c C s t j | j d � � } t j | j d d d d d t j �} t j t j � } | j | j � } | r� d# \ } } | | } } n d$ \ } } t j t j
� }
t j t j � } t j t j � } t j | j d | j
d |
j | j � | j | j � | j | j j � g d
t �}
|
j | j j k rT|
j | j j | j � � }
n t j d | j j d | j d |
� } t j | j d | | j g �} t j | j d | d | d | j | j j � d | d | d d d | d | j d t � } t j | j d t j | j d | j d | t j | j d | j | j � d t j �t j | j d | j | j � d t j �t j | j d |
j | j � d t j �g d
t d t d t! j" d d! � ��} t j# | t j$ | j d" | | | |
g d t j | j d | | g ��� S(% Ns 'NoneType' is not iterableR- t 0R$ i R< t >s >=s <=t <t __Pyx_PyUnicode_READRs R� R9 R+ R, R* t bound1t relation1R3 t relation2t bound2R� R0 R1 t
from_ranget exprt __Pyx_init_unicode_iterationR7 t result_is_usedt utility_codet unicode_iters
Optimize.cR2 ( R� s >=( s <=R� (% R R� R� R t IntNodeR9 R t c_py_ssize_t_typeR> R? t
c_int_typet c_void_ptr_typeR� t PyUnicode_READ_func_typeR3 R R< t coerce_toRK R RB RA R0 t ForFromStatNodeR# R1 Rj t ExprStatNodet init_unicode_iteration_func_typet
AmpersandNodet c_py_ssize_t_ptr_typet c_void_ptr_ptr_typet c_int_ptr_typeR R R� RG ( RP R R� R_ R� t
start_nodet length_tempt end_nodeR� R� t kind_tempt data_tempt counter_tempt target_valuet
target_assignR0 t loop_nodet
setup_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRq st ! ! ! !c C sn t } t | t j � rq | j } t | j � } t | j � } d } | sa| j j
sj t | j d � n | Sn�t | t j
� r�t | j t j � s� t � | j } | j } t | j � } t | j � } t | j � } | rat | j t t f � s7| j d k s7| j d k r!| s7| j d k rZ| rZ| j j
sVt | j d � n | S| j }
| rs|
}
n |
d k } t j | j d t j d t t |
� � d t |
� �} qan� | j j r>| j j d k r�t | j d � | S| } d } t j | j d t | j j � d t j d | j j �} d } n# | j j
s]t | j d � n | S| r�| j t j | j � � } n | r�| j t j | j � � } n | d k r�| r�t j | j d d d t j d d �} q�t | j d � | Sn | rB| s2t j | j d d d d d t j �} n | | } } n | j } | j rc| j � } n | j | j � � } | r�| j d k r�t j | j d
| d d d
| d | �}
n | }
| r| j d k rt j | j d
t j! | � d d d
| d | �j | j � � } n t j! | � } t" j# | � } | j$ | j% j � } | j j& r�| j% j j
r�t j | j% j d t j | j% j d d d d d t j' �d t j | j% j d d d d d t j' �d | d t( j) d d �} n� | j% j j* r| j% j j+ | j, � r| } nT t j
| j% j d t j | j% j d d d d d t j' �d | d t d | j, �} | j | j% j k r�| j | j% j | j � � } n t- j. d | j% j d | j% d | � } t- j/ | j d | | j0 g �} | j1 | | � \ } } t- j2 | j d |
d | d | d | d | d | d | d! | j3 d" t4 � } t" j5 | j d# | g d | �S($ Ns* C array iteration requires known end indexi s8 C array iteration requires known step size and end indexR< R- R$ s -1i����R� R( R' t +R) R� R� t 1i R; R� R� t is_buffer_accessR9 R+ R, R* R� R� R3 R� R� R� R0 R1 R� R2 (6 R R R R� R; R% R� R� R# R< t is_pyobjectR R9 R: R� t SliceNodet AssertionErrorR� R$ t intt longR� R R� t strt absRl t sizeR� RK t element_ptr_typet coerce_to_simplet AddNodet CloneNodeR R> R? R3 t is_stringR� R Rn Rk t assignable_fromR= R RB RA R0 t _find_for_from_node_relationsR� R1 Rj RG ( RP R R� R_ t neg_stept
slice_baseR� R� R� R� t
step_valuet ptr_typet
carray_ptrt start_ptr_nodet
stop_ptr_nodet counterR� R� R� R0 R� R� t for_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRm c s�
$ ( c
C sl | j j } t | � d k r2 t | j d � | St | � d k rX t | j d � | S| j j sh | S| j j } t | � d k r� | S| \ } } | j } | j r� | j r� | St | � d k r� t
| d � j | | j � � } n$ t
j | j d d d | d d �} t j | � } t
j | j d
| d t
j | j d d d | d d �d
d d | d | j �}
t j d | j d | d | � t j d | j d | d |
� g } t | j t j � r�| | j j | j _ n. | j | j � t j | j j d | �| _ | | _ | j j | j | j � � | _ | d | j _ t j | | j | | j j � � S( Ni s) enumerate() requires an iterable argumenti s% enumerate() takes at most 2 argumentsi R- R� R< R$ R( R) R� R' R� R� R9 R+ R, R* ( Rt Rs Ru R R9 R3 t is_sequence_constructorR< R� R� R R� RK R R� R R� R� R RB R R0 RA R* t appendt itemR4 R5 R� RY ( RP R t enumerate_functionRs t targetst enumerate_targett iterable_targett counter_typeR� t tempt inc_expressiont loop_body( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR~ � sh % !c C s) | r | r d Sd Sn | r! d Sd Sd S( NR� s <=R� s >=( R� s <=( R� s >=( s >=R� ( s <=R� ( ( RP t neg_step_valueR_ ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� G s c C s� | j j } t | � d k rK | j } d } t j | d d d d �} n� | d } | j } t | j t t f � sz | S| j } | d k r� | S| r� | d k r� | St | t j � s� t j | d t
| � d | �} n t | � d k r+t j | j d d d d �} | d j | j � � } n2 | d j | j � � } | d j | j � � } | j
| d k | � \ }
} | r�| | } } | d k r�| } q�n | d k r�| } n t
| � | _ | | _ | j | j � � } | j s t } t j | � } n t } t j | j d
| j d | d |
d
| d | d | d | j d | j d t � }
| r}t j | |
� }
n |
S( Ni i R- R� R$ i i i����R� R3 R� R� R� R� R� R0 R1 R� ( i i����( Rt Rs Ru R9 R R� R R$ R� R� R� t coerce_to_integerRK R� R- t
is_literalRj R R� R R R� R3 R0 R1 R� ( RP R t range_functionR_ Rs t step_posR� R� R� R� R� R� t bound2_is_tempR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� S sb
c s� g } t j t j � } | j | � | j | j � } t j t j � } | j | � | j � j � } d }
} } | r� | r� � j j
r� t � j j � d k r� � j j \ }
} q� � Sq� � j } n | r� � j }
n � j } t
� j t j � r
� j }
n$ t j d � j j d � j g � }
t j t j � } | j | � t j � j d | j | j � d t j | j � �} t j t j � } | j | � | j � j � } t j � j d | d t j | j � �} t j | | j | j � | |
| | | � } | j | j � � } | g |
j d d +| rxt j | j d t d | �} | j d d
d d | g �} n! t j | j � } | j d
� } � f d � } t j � j d | d t j � j d d d d ��t j | j d | d t j | j d | j! d t" j# d d � d | | | j t$ j% k � | | | g d t ��t j& � j d d d |
d � j' �g } t j( � j d | d t j � j d | ��S( Ni R9 R* R7 R< i t
is_identifierR- s' 'NoneType' object has no attribute '%s'R t PyExc_AttributeErrort format_argss! 'NoneType' object is not iterablec s4 | r d p d } t j � j d t | � d | �S( Ni i R- R$ ( R R� R9 R� ( R- ( R ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt flag_node� s R+ R, R� R$ t __Pyx_dict_iteratorR� t dict_iters
Optimize.cRs R� R/ R0 R1 R2 () R R> R t py_object_typeR� R? R9 R� R# R3 R� Ru Rs R R0 R RA R R� t
c_ptr_typeR< R� t DictIterationNextNodeRJ RK R* t
StringNodeRj R� t NullNodeRB R� R� t PyDict_Iterator_func_typeR R R Rh t
WhileStatNodeR1 RG ( RP R R[ R\ R] R^ R2 R� t dict_tempt pos_tempt
key_targett value_targett tuple_targetR0 t
dict_len_tempt dict_len_temp_addrt is_dict_tempt is_dict_temp_addrt iter_next_nodet method_nodeR� t result_code( ( R sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRi � s�
Ra t is_dictt method_namet
p_orig_lengtht p_is_dictN(# t __name__t
__module__t __doc__RX RZ R RY R R t CFuncTypet c_char_ptr_typet CFuncTypeArgR Rn R# R� R� R� Ro t c_py_ucs4_typeR� R� R� R� R� R� R� R� Rq Rm R~ R� R� Ri R� ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR& = sJ 1 Q & E � I C ct SwitchTransformc B sz 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 e j j Z RS(
s�
This transformation tries to turn long if statements into C switch statements.
The requirement is that every clause be an (or of) var == value, where the var
is common among all clauses and both var and value are ints.
c
C s1 xe t rg t | t j � r' | j } q t | t j � rE | j } q t | t j � rc | j } q Pq Wt | t j
� r[| j d k r� | j
S| j � r$t | j t j t j f � r$| j d k } | r� | r� | j
St | j t j � r| j j � r| j
S| | j | j | j � f S| j � s*| j d k rHt } n% | rf| j d k rft } n | j
St | j | j � r�| j j r�| | j | j g f St | j d d � r�| j j j r�| | j | j g f Sn t | j | j � rX| j j r| | j | j g f St | j d d � rU| j j j rU| | j | j g f SqXq*n� t | t j � r*| j d k s�| r*| j d k r*| j d k } | j | j | � \ } } } | j | j | � \ } } } | d k r'| | k r't | | � r'| s| r$| | | | f Sq'q*n | j
S( NR6 s ==s !=R| t ort and( Rj R R t CoerceToTempNodeR R t EvalWithTempExprNodet
subexpressiont TypecastNodeR7 R@ t cascadeR# t NO_MATCHt is_c_string_containsR) t UnicodeNodet BytesNodeR' t contains_surrogatesR( t extract_in_string_conditionst is_python_comparisonR R R� t getattrR| t is_constt
BoolBinopNodet extract_conditions(
RP t condt allow_not_inR6 t not_in_1t t1t c1t not_in_2t t2t c2( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR* s^
$ '
c C s� t | t j � ro t t t t | j � � � } | j � g | D]* } t j | j
d t | � d | �^ qA S| j } t t g t t
| � � D] } | | | d !^ q� � � } | j � g | D]$ } t j | j
d | d | �^ q� Sd S( NR- R$ i ( R R R" t listt mapt ordt setR- t sortR� R9 R� Rf Ru t CharNode( RP t string_literalt charvalst charvalt
characterst i( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR% E s
2 <
c C s� | j | | � \ } } } | d k r. | j S| d k rQ t | | � rQ | j S| j j pf | j j s� t g | D] } | j j p� | j j ^ qt � r� | j S| | | f S( N( R* R# R R R< R� t is_enumt sum( RP t
common_varR/ R, R6 t vart
conditionsR+ ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt extract_common_conditionsW s Kc C sx t � } xh | D]` } | j t j k rN | j | k r; t S| j | j � q | j t t | d d � d � � q Wt S( NR| t cname( R6 R$ R R Rj t addR' R# R ( RP t condition_valuest seenR- ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt has_duplicate_valuesa s
&c C sA d } g } xz | j D]o } | j | | j t � \ } } } | d k rZ | j | � | S| j t j d | j d | d | j
� � q Wt g | D] } t | j
� ^ q� � d k r� | j | � | S| j t g | D] } | j
^ q� g � � r| j | � | St | � } t j d | j d | d | d | j � } | S( NR9 RB R0 i t testt casesR1 ( R# R. RC R/ R RO R� R t SwitchCaseNodeR9 R0 R? Ru RB RH R t SwitchStatNodeR1 ( RP R R@ RJ t if_clauset _RB t caset switch_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_IfStatNodeo s.
.
.
c C s� | j d | j t � \ } } } | d k sN t | � d k sN | j | � r_ | j | � | S| j | | | | | j | j � S( Ni (
RC R# RI Rj Ru RH RO t build_simple_switch_statementt true_valt false_val( RP R R6 R@ RB ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_CondExprNode� s
c C s� | j d | t � \ } } } | d k sK t | � d k sK | j | � r\ | j | � | S| j | | | | t j | j d t d t �t j | j d t
d t
�� S( Ni R- R$ ( RC R# Rj Ru RH RO RR R RC R9 R ( RP R R6 R@ RB ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_BoolBinopNode� s
c C s� | j d | t � \ } } } | d k sK t | � d k sK | j | � r\ | j | � | S| j | | | | t j | j d t d t �t j | j d t
d t
�� S( Ni R- R$ ( RC R# Rj Ru RH RO RR R RC R9 R ( RP R R6 R@ RB ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRX � s
c
C s� t j | � } t j | j d | d | d t �} t j | j d | d | d t �} | rm | | } } n t j d | j d | d | � g }
t | � } t j d | j d | d |
d | � } t j | | � } | S(
NR+ R, t firstR9 RB R0 RI RJ R1 (
R R R RB R9 Rj RK R RL RM (
RP R R@ RB R6 RS RT RQ t true_bodyt
false_bodyRJ RP t replacement( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRR � s. c C sQ | j } | j } | j | � | j | k rM t j | j | � sM | j Sn | S( N( R t lazy_tempRO t Visitort
tree_contains( RP R t orig_exprt temp_ref( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_EvalWithTempExprNode� s
N( NNN( R R R R# R R* R% RC RH RQ RU RV RX RR R` R\ t VisitorTransformt recurse_to_childrent
visit_Node( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR s :
t FlattenInListTransformc B s# e Z d Z d � Z e j j Z RS( sj
This transformation flattens "x in [val1, ..., valn]" into a sequential list
of comparisons.
c s | j � � � j d k r � S� j d k r> d � d } n" � j d k r\ d � d } n � St � j t j t j t j f � s� � S� j j
} t | � d k r� � j d k } t j d � j
d | d
| � St j � j � } g } g } x� | D]� } y | j � } Wn t k
r(t } n X| sNt j | � } | j | � n t j d � j
d | d | d
| d d � }
| j t j d � j
d |
d t j � � q� W� � f d � } t | | � } t j | | � }
x- | d d d � D] } t j | |
� }
q�W|
S( Nt inR s ==R6 R s !=i R9 R- R$ R( R' R) R R7 R< c s% t j d � j d � d | d | � S( NR9 R' R( R) ( R R) R9 ( t leftt right( t conjunctionR ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt concat s
i����( RO R R# R' R R) R t TupleNodet ListNodet SetNodeRs Ru RC R9 R R R( t is_simplet ExceptionR R� R� R@ R R t c_bint_typeR
R ( RP R t eq_or_neqRs R$ R+ t condsR2 R t
is_simple_argR+ Ri R/ RW R� ( ( Rh R sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRX � s\
( R R R RX R\ Ra Rb Rc ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRd � s @t DropRefcountingTransformc B s5 e Z d Z e j j Z d � Z d � Z d � Z RS( s& Drop ref-counting in safe places.
c C s g g } } g g } } g } x~ | j D]s } t | t j � r� | j | j | | | � sa | S| j | j | | | � s� | Sq* t | t j � r� | S| Sq* W| s� | r,g | D] \ } } | ^ q� }
g | D] \ } } | ^ q� } t |
� t | � k r| St t |
� � t | � k r,| Sn | s8| r�g } x4 | D], }
| j
|
� } | sd| S| j | � qEWg } x4 | D], } | j
| � } | s�| S| j | � q�Wt | � t | � k r�| St t | � � t | � k r�| S| Sg | D] } | j ^ q�} x | D] } t
| _ qWx0 | | D]$ \ } } | | k r5t
| _ q5q5Wx | | D] } t
| _ qhW| S( sF
Parallel swap assignments like 'a,b = b,a' are safe.
( R* R R RB t _extract_operandR+ R, t CascadedAssignmentNodeR6 Ru t _extract_index_idR� R R t use_managed_ref( RP R t
left_namest right_namest left_indicest
right_indicesR2 t statt patht nt lnamest rnamest lindicest lhs_nodet index_idt rindicest rhs_nodet tt temp_argsR� RN t name_nodet
index_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_ParallelAssignmentNode+ s`
c C sO t | � } | j j s t St | t j � rG | j | � | j } n g } | } x< t | t j � r� | j
ru t S| j | j � | j } qV Wt | t j
� r� | j | j � | j d j | d d d � � | f � nk t | t j � rG| j j t j k r t S| j j j s t St | j t j
� s7t S| j | � n t St S( Nt .i����( R R< R� R R R R R� R R R t memberR R R t joinR: R; R R� R� R� Rj ( RP R t namest indicesR2 t name_patht obj_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRt p s4
,c C sW | j } | j } t | t j � r0 | j } n t | t j � rF d Sd S| j | f S( N( R; R� R R R R t ConstNodeR# ( RP R� R; R� t index_val( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRv � s (
R R R R\ Ra Rb Rc R� Rt Rv ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRs & s
E t EarlyReplaceBuiltinCallsc B s e Z d Z e j j Z d � Z d � Z d � Z d d � Z d d � Z d d � Z
d � Z d e j f d � � YZ 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( s� Optimize some common calls to builtin types *before* the type
analysis phase and *after* the declarations analysis phase.
This transform cannot make use of any argument types, but it can
restructure the tree in a way that the type analysis phase can
respond to.
Introducing C function calls here may not be a good idea. Move
them to the OptimizeBuiltinCalls transform instead, which runs
after type analysis.
c C s? | j | � | j } | j | � s) | S| j | | | j � S( N( RO Rv t _function_is_builtin_namet _dispatch_to_handlerRs ( RP R Rv ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_SimpleCallNode� s
c C sj | j | � | j } | j | � s) | S| j } t | t j � sH | S| j } | j | | | | j � S( N(
RO Rv R� t positional_argsR R Rj Rs R� t keyword_args( RP R Rv Rt Rs ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_GeneralCallNode� s
c C sQ | j s
t S| j � } | j | j � } | | j � j | j � k rM t St S( N( R{ R RK t lookupR t
builtin_scopet lookup_hereRj ( RP Rv t envR| ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s c C sw | d k r d | j } n
d | j } t | | d � } | d k rs | d k r` | | | � S| | | | � Sn | S( Ns _handle_simple_function_%ss _handle_general_function_%s( R# R R' ( RP R Rv Rs t kwargst handler_namet handle_call( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s
c C s1 t j | j j | j j | | d | �| _ d S( NR� ( R t PythonCapiFunctionNodeRv R9 R ( RP R RD t func_typeR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _inject_capi_function� s c C s� | s d } n? t | t � s* | d k r3 d } n | d k rH d } n d } | d k rg d | } n d } t | j d | | | t | � f � d S( Nt i s ...t xs
expected %s, s3 %s(%s) called with wrong number of args, %sfound %d( R R R# R R9 Ru ( RP t
function_nameR Rs t expectedt arg_strt expected_str( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _error_wrong_arg_count� s
c C s� | s t j | j d d �St | � d k rG | j d | | d � n t | d d d � } | t j t j
f k r} | d S| S( NR- s 0.0i t floati R< ( R t FloatNodeR9 Ru R� R' R# R t
c_double_typeR t
float_type( RP R t pos_argst arg_type( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_float� s t YieldNodeCollectorc B s8 e Z d � Z e j j Z d � Z d � Z d � Z RS( c C s& t j j | � i | _ g | _ d S( N( R\ t TreeVisitort __init__t yield_stat_nodest yield_nodes( RP ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s c C s! | j j | � | j | � d S( N( R� R� RO ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt __visit_YieldExprNode� s c C s6 | j | � | j | j k r2 | | j | j <n d S( N( RO R� R� R� ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt __visit_ExprStatNode s
c C s d S( N( ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt __visit_GeneratorExpressionNode s (
R R R� R\ R� RO Rc t( _YieldNodeCollector__visit_YieldExprNodet' _YieldNodeCollector__visit_ExprStatNodet2 _YieldNodeCollector__visit_GeneratorExpressionNode( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s
c C sp | j � } | j | � t | j � d k r2 d S| j d } y | j | j | f SWn t k
rk d SXd S( Ni i ( NN( NN( R� RO Ru R� R# R R� t KeyError( RP R t collectort
yield_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _find_single_yield_expression s
c C s | j | | t � S( s= Transform
_result = all(x for L in LL for x in L)
into
for L in LL:
for x in L:
if not x:
_result = False
break
else:
continue
break
else:
_result = True
( t _transform_any_allR ( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_all s c C s | j | | t � S( s9 Transform
_result = any(x for L in LL for x in L)
into
for L in LL:
for x in L:
if x:
_result = True
break
else:
continue
break
else:
_result = False
( R� Rj ( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_any* s c
C s8 t | � d k r | St | d t j � s0 | S| d } | j } | j | � \ } } | d k rh | S| rw | } n t j | j d | �} t j
d | j d t j � } t
j | j d d d t
j | j d | d t
j | j d
t
j | j d | d t j | j d
| d | ��t
j | j � g ��g �}
| } xp t | j t
j � r�| j } t
j | j j d
| j t
j | j � g �| _ t
j | j � | _ | } qCWt
j | j d | d t j | j d
| d | ��| _ t j | | |
� t j | j d | d | d | j d | r1d p4d �S( Ni i R7 R9 R< R1 R. R/ R0 R* R+ R, R- R$ t loopt result_nodet
expr_scopet orig_funct anyt all( Ru R R t GeneratorExpressionNodeR� R� R# RN R9 R R R Ro R RE RF RA RB RC RD R0 t LoopNodet ContinueStatNodeR1 R\ t recursively_replace_nodet InlinedGeneratorExpressionNodeR� (
RP R R� t is_anyt
gen_expr_nodeR� t yield_expressiont yield_stat_nodeR/ RQ t test_nodeR� t next_loop( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� > sX
!
c
C s� t | � d k r | St | d t j � rX | d j t j k rX | d } | j } n� t | d t j � r| d } | j } | j | � \ } } | d k r� | St j | j d | �} t
j | | | � t j | j d | d | d t j d | j d t �} | | _ n | St j d | j d t j d
t � } t j | j d | d | d
t �}
t j | j d | d t d � d t �} t j | j d t j | j d | d g ��} | j | j � � t j | t j | j d |
| g �� S( s Transform sorted(genexpr) and sorted([listcomp]) into
[listcomp].sort(). CPython just reads the iterable into a
list and calls .sort() on it. Expanding the iterable in a
listcomp is still faster and the result can be sorted in
place.
i i R� R� R� R< R� t has_local_scopeR9 t
may_hold_noneR+ R, RW R R R7 t needs_none_checkRv Rs R* N( Ru R R t ComprehensionNodeR< R R� R� R� R� R# t ComprehensionAppendNodeR9 R\ R� R� Rj R3 R R R R RB R R R� Rr t analyse_declarationsRK RM RA (
RP R R� t
listcomp_nodeR� R� R� R� t append_nodeR� t listcomp_assign_nodet sort_methodt sort_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_sortedu sH
c C s� t | � d k r | St | d t j t j f � s9 | S| d } | j } t | t j � r� | j | � \ } } | d k r� | SnF | j } | j } y | j
s� | j j r� | SWn t
k
r� | SXt | � d k r� t j | j d d d d �} n
| d } t j d | j d t j � } t j | j d | d
t j | j d | | � �} t j | | | � t j | j d t j | j d t j d | j d
| � d
| d t �| g �}
t j | j d |
d | d | j d d d | j �S( sL Transform sum(genexpr) into an equivalent inlined aggregation loop.
i i i R- R� R$ R9 R< R+ R, R� R* R RW R� R� R� R� R? R� ( i i N( Ru R R R� R� R� R� R# R� R� R� R< R� t AttributeErrorR� R9 R R R R� R RB t
binop_nodeR\ R� RA Rj R� R� R� ( RP R R� R� R� R� R� R� RQ t add_nodet exec_code( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_sum� sN
!
c C s | j | | d � S( NR� ( t _optimise_min_max( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_min� s c C s | j | | d � S( NR� ( R� ( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_max� s c C s� t | � d k r | St t t j | d � � } | d } xq | D]i } t j | � } t j | j d | d | d t j | j d | d | d | ��} t j | | � } qC Wx- | d d d
� D] } t j | | � } q� W| S( sK Replace min(a,b,...) and max(a,b,...) by explicit comparison code.
i i RS RT RI R( R' R) Ni����(
Ru R3 R4 R R R t CondExprNodeR9 R@ R ( RP R Rs R' t cascaded_nodest last_resultt arg_nodeRQ t ref_node( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s&
c C s` | s" t j | j d g d d �S| j | | t j � } | | k r\ t j | j d | �S| S( NRs R$ R ( ( R Rj R9 t _transform_list_set_genexprR R� t AsTupleNode( RP R R� t result( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt& _DISABLED_handle_simple_function_tuple s c C s8 | s" t j | j d g d g �S| j | | t j � S( NRs R$ ( R Rk R9 R� R R� ( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_list s c C s; | s% t j | j d g d t � �S| j | | t j � S( NRs R$ ( R Rl R9 R6 R� R t set_type( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_set s c
C s� t | � d k r | St | d t j � s0 | S| d } | j } | j | � \ } } | d k rh | St j | j d | �} t j
| | | � t j | j d t d | j
d | d | d | �} | | _ | S(
sK Replace set(genexpr) and list(genexpr) by a literal comprehension.
i i R� R� R� R� R� R< N( Ru R R R� R� R� R# R� R9 R\ R� R� Rj R� R3 (
RP R R� R� R� R� R� R� R� t comp( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� s,
c C sG t | � d k r. t j | j d g d i �St | � d k rD | St | d t j � s^ | S| d } | j } | j | � \ } } | d
k r� | St | t j � s� | St | j
� d k r� | St j | j d | j
d d | j
d �} t j
| | | � t j | j d t d | j d
| d | d t j �} | | _ | S( sD Replace dict( (a,b) for ... ) by a literal { a:b for ... }.
i t key_value_pairsR$ i i t key_exprt
value_exprR� R� R� R� R< N( Ru R t DictNodeR9 R R� R� R� R# Rj Rs t DictComprehensionAppendNodeR\ R� R� Rj R� R Rh R3 ( RP R R� R� R� R� R� R� t dictcomp( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_dict= s:
c C s0 t | � d k r | St | t j � s, | S| S( sl Replace dict(a=b,c=d,...) by the underlying keyword dict
construction which is done anyway.
i ( Ru R R R� ( RP R R� R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_general_function_dicte s
N( R R R R\ Ra Rb Rc 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� ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s2
7 5 8 (t InlineDefNodeCallsc B s& e Z e j j Z d � Z d � Z RS( c C ss | j d k r d S| j j r# d S| j � j | j � } | sa | j sa t | j � d k re d S| j d j S( Ni i ( t cf_stateR# t
cf_is_nullRK R� R t cf_assignmentsRu R, ( RP R� R| ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt get_constant_value_nodes s c C s� | j | � | j j d � s# | S| j } | j s9 | S| j | � } t | t j � s^ | St j | j
d | d | d | j �} | j � r� | j
| | � S| S( Ns optimize.inline_defnode_callsR� Rv Rs ( RO t current_directivest getRv R{ R R R t PyCFunctionNodet InlinedDefNodeCallNodeR9 Rs t can_be_inlinedt replace( RP R R� Rv t inlined( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� s
( R R R\ Ra Rb Rc R R� ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� p s t OptimizeBuiltinCallsc B sk e Z d Z d � Z d � Z d � Z d � Z d � Z e j e j
e j d e j
dd � e j d e j dd � e j d e j dd � g d d
d e �Z d � Z d
� Z dd d � Z e j e j e j d e j dd � g � Z d � Z e j e j e j d e j dd � g � Z d � Z e j e j e j d e j dd � g d d d e �Z d � Z d � Z! d � Z" e j e j# e j d e j$ dd � g � Z% e j e j# e j d e j& dd � g � Z' e j e j e j d e j dd � g d d �Z( i d e j) 6d e j
6d e j 6d e j 6d e j 6d e j* 6d e j+ 6j, Z- e. d g � Z/ d! � Z0 e j e j1 e j d" e j dd � g � Z2 d# � Z3 e j e j4 e j d$ e j dd � g � Z5 d% � Z6 d& � Z7 e j e j e j d' e j dd � e j d( e j dd � g � Z8 e j e j e j d' e j dd � e j d( e j dd � e j d) e j dd � g � Z9 dd d* � Z: e j e j e j d e j dd � e j d+ e j dd � g � Z; d, � Z< e j e j e j d e j dd � g � Z= e j e j e j d e j dd � e j d e j> dd � g � Z? d- � Z@ e@ ZA e j e jB e j d e j dd � g d d �ZC d. � ZD e j e j e j d e j dd � e j d/ e j dd � e j d0 e j dd � g � ZE d1 � ZF e j e j e j d e j dd � e j d/ e j dd � e j d0 e j dd � e j d2 e j dd � g � ZG d3 � ZH e j e j4 e j d4 e jI dd � g � ZJ d5 � ZK eK ZL eK ZM eK ZN eK ZO eK ZP eK ZQ eK ZR eK ZS eK ZT e j e jI e j d4 e jI dd � g � ZU d6 � ZV eV ZW eV ZX eV ZY e j e j e j d7 e j) dd � e j d8 e j4 dd � g � ZZ d9 � Z[ e j e j e j d7 e j) dd � e j d: e j dd � e j d; e j dd � g � Z\ d< � Z] e j e j4 e j d7 e j dd � e j d= e j dd � e j d> e j dd � e j d? e j dd � e j d@ e j dd � g d d �Z^ dA � Z_ dB � Z` dC � Za e j e j e j d7 e j) dd � e j d= e j dd � e j d> e j dd � e j d? e j dd � e j d@ e j dd � g d dD �Zb dE � Zc dF � Zd dG � Ze e j e j e j d7 e j) dd � e j d= e j dd � e j d> e j dd � e j d? e j dd � g d d �Zf dH � Zg e j e j) e j d7 e j) dd � e j d= e j dd � e j dI e j dd � e j dJ e j dd � g � Zh dK � Zi e j e j
e j d e j) dd � e j dL e j$ dd � e j dM e j$ dd � g � Zj e j e j
e j d e j) dd � g � Zk dN dO dP dQ dR dS g Zl g el D] Zm em en jo em � f ^ qG Zp dT � Zq e jr e j e j) e j dU e j$ dd � e j dV e j dd � e j dM e j$ dd � g � � Zs e j e j) e j dU e j$ dd � e j d> e j dd � e j dW e j dd � e j dL e j$ dd � e j dM e j$ dd � e j dX es dd � g � Zt e j e j) e j dU e j dd � e j d> e j dd � e j dW e j dd � e j dL e j$ dd � e j dM e j$ dd � e j dX es dd � g � Zu dd Zv dY � Zw dZ � Zx d[ � Zy d\ � Zz d] � Z{ d^ � Z| d_ � Z} d` � Z~ de dd dd e j� j� da � Z� db � Z� dc � Z� RS(f s< Optimize some common methods calls and instantiation patterns
for builtin types *after* the type analysis phase.
Running after type analysis, this transform can only perform
function replacements that do not alter the function return type
in a way that was not anticipated by the type analysis.
c C sE | j } | j | � | | j k s: | j j | j k r> | S| j S( s: Flatten redundant type checks after tree changes.
( R RO R< ( RP R t old_arg( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _visit_PyTypeTestNode� s
$c C s- | j | � | j | j j k r) | j S| S( s,
Drop redundant type casts.
( RO R< R7 ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _visit_TypecastNode� s
c C s8 | j | � t | j t j � r4 | j j | _ n | S( s)
Drop useless coercions.
( RO R R� R t CoerceToPyTypeNodeR ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_ExprStatNode� s
c C s~ | j | � | j } t | t j � r4 | j } n t | t j � rz | j t j t j
f k rz | j j | j � � Sn | S( s< Drop redundant conversion nodes after tree changes.
(
RO R R R t PyTypeTestNodeR R< R R� R t bool_typet coerce_to_booleanRK ( RP R R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_CoerceToBooleanNode� s
c C sv | j | � | j } | j j sT | j | j k r8 | S| j | j | j � � Sn t | t j � rr | j } n t | t j � r� | j t
j k r� | j j | j j � r� | j j | j | j � � Sq� n t | t j
� r
| j j s� | j j rr| j | | � Sne t | t j � rr| j rr| j } t | t j � rP| j } n | j j rr| j | | | � Sn | S( s� Drop redundant conversion nodes after tree changes.
Also, optimise away calls to Python's builtin int() and
float() if the result is going to be coerced back into a C
type anyway.
( RO R R< R� R� RK R R R R R R� R� Rr R� t is_floatt _optimise_numeric_cast_callR: R� R� t _optimise_int_indexing( RP R R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_CoerceFromPyTypeNode� s,
" t bytesR� t check_boundsR� s
((char)-1)t exception_checkc C s | j � } | j d r d p" d } | j j t j k r| j t j t j f k rt j
| j d t | � d | �} t j
| j d | j d | j j d � | j t j | � | g d t d
t j d d � �} | j t j k r | j | j | � } n | Sn | S(
Nt boundschecki i R- R$ t __Pyx_PyBytes_GetItemIntRs s& 'NoneType' object is not subscriptableR� R� t bytes_indexs
StringTools.c( RK t
directivesR; R< R Rn R t c_char_typet c_uchar_typeR R� R9 R� R� t PyBytes_GetItemInt_func_typeR� R� R� Rj R R ( RP t coerce_nodeR R� R� t bound_check_boolt bound_check_nodeR ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR � s( c C s� | j } t | t j � s? | j j s? t | j t j � rC | S| j j } t | � d k re | S| d } t | t j
� r� | j } n | j j r� | S| j
d k r | j j s� | j j r�| j | j k r� | S| j j | j � s� | j j r t j | j d | d | j �Sq�n� | j
d k r�| j j sG| j j r�| j | j k r]| S| j j | j � s~| j j r�t j | j d | d | j �Sq�n | S( Ni i R� R7 R< R� ( Rv R R R R< t is_builtin_typeRt Rj Rs Ru R R R� R R� R� R R R9 ( RP R R Rv Rs t func_arg( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR s8
! ! c C s� | s d } n? t | t � s* | d k r3 d } n | d k rH d } n d } | d k rg d | } n d } t | j d | | | t | � f � d S( NR� i s ...R� s
expected %s, s3 %s(%s) called with wrong number of args, %sfound %d( R R R# R R9 Ru ( RP R� R Rs R� R� R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� ( s
Ra c C sp t | � d k r | S| d } | j t j k rl | j d � } t j | j d | j d | g d | j �S| S( s; Replace dict(some_dict) by PyDict_Copy(some_dict).
i i s 'NoneType' is not iterablet PyDict_CopyRs R� (
Ru R< R Rh R� R R� R9 t PyDict_Copy_func_typeR� ( RP R Rv R� R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� ? s
R3 c C s� t | � d k r | S| d } | j t j k r6 | St | t j t j f � sg | j d � | d <n t j | j
d | j d | d | j �S( s: Replace tuple([...]) by a call to PyList_AsTuple.
i i s! 'NoneType' object is not iterablet PyList_AsTupleRs R� (
Ru R< R R� R R R� Rk R� R� R9 t PyList_AsTuple_func_typeR� ( RP R Rv R� t list_arg( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_tupleS s
R s ((double)-1)c C s� t | � d k r� t | d t j t j f � r� g } g } xM | d j D]> } | j � s| t j | � } | j | � n | j | � qK Wt j
| j d d d | �} x- | d d d � D] } t j | | � } q� W| S| S( Ni i R� Rs i����(
Ru R R Rk Rj Rs Rm R R� R� Rl R9 R ( RP R Rv R� Rs R2 R R� R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� m s " c C s$ t | � d k r@ t j | d d d d �j t j | j � � St | � d k rl | j d | | d � | S| d } t | t j � r� | j
} n | j t j
k r� | S| j j | j � s� | j j r� t j | j d | d
| j �St j | j d | j d | d
| j d t d � d d �S( sY Transform float() into either a C type cast or a faster C
function call.
i R- s 0.0R$ g i R� s 0 or 1R7 R< t __Pyx_PyObject_AsDoubleRs R� R� t pyobject_as_doublet py_name( Ru R R� R� R R� RK R� R R R R< R R� R� t
is_numericR R9 R� t PyObject_AsDouble_func_typeR� R ( RP R Rv R� R' ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s,
! c C s� t | � d k rC t j | j d t d t �j t j | j � � St | � d k ro | j d | | d � | S| d j
| j � � } t j | j d | �} t j | j d | �} | j | j � � Sd S( s= Transform bool(x) into a type coercion to a boolean.
i R- R$ i t bools 0 or 1R7 N(
Ru R RC R9 R R� R R RK R� R RN t coerce_to_pyobject( RP R Rv R� R7 ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_bool� s t unicodes -1t __Pyx_PyUnicode_GET_LENGTHR� t PyList_GET_SIZEt PyTuple_GET_SIZEt PyDict_Sizet
PySet_Sizes cpython.array.arrayc C s� t | � d k r, | j d | | d � | S| d } t | t j � rT | j } n | j j r� t j | j d | j
d | g d | j d t j
d d � �} n| j j r� t j | j d
| j d | g d | j �} n� | j j r�| j | j � } | d k rH| j } | j s#| j rA| j j | j k rAd } qH| Sn | j d � } t j | j | | j d | g d | j �} n5 | j j r�t j | j d
d d d d | j �S| S| j t j t j f k r�| j | j | j � � } n | S( s� Replace len(char*) by the equivalent call to strlen(),
len(Py_UNICODE) by the equivalent Py_UNICODE_strlen() and
len(known_builtin_type) by an equivalent C-API call.
i Ru i t strlenRs R� R� t IncludeStringHs
StringTools.ct __Pyx_Py_UNICODE_strlent Py_SIZEs& object of type 'NoneType' has no len()R- R� R$ R< N(! Ru R� R R R R R< R� R� R9 t Pyx_strlen_func_typeR� R R t is_pyunicode_ptrt Pyx_Py_UNICODE_strlen_func_typeR� t _map_to_capi_len_functionR# t is_extension_typeR& R| t qualified_namet _ext_types_with_pysizeR� t PyObject_Size_func_typet is_unicode_charR� R t
c_size_t_typeR� R� RK ( RP R Rv R� R RW t
cfunc_nameR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_len� sL
t objectc C sP t | � d k r | St j | j d | j d | d t �} t j | t j � S( s7 Replace type(o) by a macro call to Py_TYPE(o).
i t Py_TYPERs R� ( Ru R R� R9 t Pyx_Type_func_typeR t CastNodeR R� ( RP R Rv R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_type s R c
s t | � d k r � S| \ } } d } t | t j � rY | j } t j | � } } n" | j t j
k rw | g } n � Sg } g } | j � } x| D]}
d } |
j r� |
j
r� | j |
j
j � } | r� | j r� | j j r� | j } q� q� n | rO| t j
k rO| j j d t � }
|
| k r6q� n | j |
� | g } n+ |
j t j
k rvd }
| |
g } n � S| j t j |
j |
| j d | d t �� q� Wt j � f d � } t | | � j � j | � } | d k r t j | | � } n | S( sc Replace isinstance() checks against builtin types by the
corresponding C-API call.
i t exactt __Pyx_TypeCheckRs R� c s1 | � j d | | � } t j | _ t | _ | S( NR ( R9 R Ro R< Rj R� ( R! R" t make_binop_nodet or_node( R ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt join_with_or> s N( Ru R# R R Rj Rs R R R< R t type_typeRK R{ R| R� R R& t type_check_functionR R� R� R9 t Py_type_check_func_typeRj R� R
R� R ( RP R Rv R� R t typesR� t testst
test_nodesR� t test_type_nodet builtin_typeR| RW t type_check_argsRU R� ( ( R sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt" _handle_simple_function_isinstance sP
c C s� t | � d k r | S| d } t | t j � r{ | j j j r�t j | j d | j d t j
�j | j | j � � Sn"t | t j
� r� t | j � d k r�t j t | j � d t j
d t t | j � � d t | j � �j | j | j � � Sn� t | t j � r�| j r�t | j � d k r�t | j � d k r�t j t | j � d t j
d t t | j � � d t | j � �j | j | j � � Sn | S( s- Unpack ord(Py_UNICODE) and ord('X').
i i R7 R< R- R$ i� ( Ru R R R R R< RH R R9 R R� R� RK R" R- R� R5 R� R� t
unicode_value( RP R Rv R� R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_function_ordI s0
R< Rs R� c
C s� | j } | s" t | � d k r& | S| d } | j sD | j rH | S| j t j k sl | j t j k rp | S| j s� | j r� | j | j k r� | Sn | j | j k r� | St j | j
d | d �} | j | j � d t
�} | j r>| j j } | j rM| j rM| j j � | j � j � k rMt j d d � }
t j | j |
� } | r;| j j } t j | j d � j � }
t j t j t j d |
d � t j d t j d � t j d t j d � g � } t j | |
� } | s
t j | j
d t j �} n t j | j
| | d | | | g d
t
�SqMn | j! d � } t" j# d d � } | r�t j | j
d
| j$ d | | | g d | d
| j% �St j | j
d | j& d | | g d | d
| j% �Sd S( sO Replace 'exttype.__new__(exttype, ...)' by a call to exttype->tp_new()
i i Rs t
skip_childrent tp_newt __new__t PyTypeObjectR< R� R� s4 object.__new__(X): X is not a type object (NoneType)s ObjectHandling.ct __Pyx_tp_new_kwargsR� t __Pyx_tp_newN(' R Ru R{ R< R RV t
type_entryR R Rj R9 t
analyse_typesRK Rj RD t
typeobj_cnamet scopeRx R t ConstructorSlott get_slot_functionRy t cython_scopeR t CPtrTypeR� R R� R R# RO R� R� R� R R t Pyx_tp_new_kwargs_func_typeR� t Pyx_tp_new_func_type( RP R Rv Rs t is_unbound_methodR� R t type_argt
args_tuplet ext_typet tp_slott slot_func_cnameRn t PyTypeObjectPtrt pyx_tp_new_kwargs_func_typeR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_any_slot__new__t sj
$ !
R� c
C sP t | � d k r | St j | j d | j d | d t d | j d t d � �S( s\ Optimistic optimisation as X.append() is almost always
referring to a list.
i t __Pyx_PyObject_AppendRs t may_return_noneR� R� R� ( Ru R R� R9 t PyObject_Append_func_typeRj R� R ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt# _handle_simple_method_object_append� s c
C s1 t | � d k rL t j | j d | j d | d t d | j d t d � �St | � d k r-| d } t | t j � r� | j
} n t | t j � r� | j t
j d � } n | j j r-t
j | j t
j � } | t
j k r*| | d <t j | j d | j d | d t d | j d t d
� �Sq-n | S( s\ Optimistic optimisation as X.pop([n]) is almost always
referring to a list.
i t __Pyx_PyObject_PopRs R| R� R� t popi t __Pyx_PyObject_PopIndext pop_indexN( Ru R R� R9 t PyObject_Pop_func_typeRj R� R R R R R� R� R R� R# R< R� t widest_numeric_typet PyObject_PopIndex_func_type( RP R Rv Rs Rr R� t widest( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_method_object_pop� s4
c C sJ t | � d k r | S| j | | d | j d | | � j | j | j � S( s? Call PyList_Sort() instead of the 0-argument l.sort().
i t PyList_SortR7 ( Ru t _substitute_method_callt single_param_func_typeR� R< RK ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_method_list_sort
s
t keyt defaultc
C s� t | � d k r. | j t j | j � � n, t | � d k rZ | j d | | d � | S| j | | d | j d | | d t d t d � �S(
s: Replace dict.get() by a call to PyDict_GetItem().
i i s dict.gets 2 or 3t __Pyx_PyDict_GetItemDefaultR R| R� t dict_getitem_default(
Ru R� R t NoneNodeR9 R� R� t Pyx_PyDict_GetItem_func_typeRj R ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _handle_simple_method_dict_get s t is_safe_typec
C s� t | � d k r. | j t j | j � � n, t | � d k rZ | j d | | d � | S| d j } | j r� t | j d k � } n | t
j k r� d } n d } | j t j | j d | d
| �� | j
| | d | j d | | d
t d t d � �S( sU Replace dict.setdefault() by calls to PyDict_GetItem() and PyDict_SetItem().
i i s dict.setdefaults 2 or 3i s% str bytes unicode float int long booli����i R- R$ t __Pyx_PyDict_SetDefaultt
setdefaultR| R� t dict_setdefault( Ru R� R R� R9 R� R< R& R� R R R� R� R� t Pyx_PyDict_SetDefault_func_typeRj R ( RP R Rv Rs Rr t key_typeR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt% _handle_simple_method_dict_setdefault2 s(
t ucharc
C s� | s t | � d k r | S| d } t | t j � sI | j j j rM | S| j } | j } | d k r� t j d d � } d } n d } d | j � } | j | | | | j
| | | g d | �}
| j j r� |
j | j � }
n |
S( Ni i t istitlet py_unicode_istitles
StringTools.ct __Pyx_Py_UNICODE_ISTITLEs
Py_UNICODE_%sR� ( Ru R R R R R< RH R R R R# t upperR� t# PyUnicode_uchar_predicate_func_typeR� R4 RK ( RP R Rv Rs Rr t ustringR� R R� R� t func_call( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _inject_unicode_predicateT s,
c
C s� | s t | � d k r | S| d } t | t j � sI | j j j rM | S| j } | j } d | j � } | j | | | | j
| | | g � } | j j r� | j | j
� } n | S( Ni i s Py_UNICODE_TO%s( Ru R R R R R< RH R R� R� t$ PyUnicode_uchar_conversion_func_typeR� R4 RK (
RP R Rv Rs Rr R� R� R R� R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt$ _inject_unicode_character_conversion} s
R� t keependsc C sd t | � d k r, | j d | | d � | S| j | | d t � | j | | d | j d | | � S( sf Replace unicode.splitlines(...) by a direct call to the
corresponding C-API function.
i i s unicode.splitliness 1 or 2t PyUnicode_Splitlinest
splitlines( i i ( Ru R� t _inject_bint_default_argumentR R� t PyUnicode_Splitlines_func_type( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt( _handle_simple_method_unicode_splitlines� s t sept maxsplitc C s� t | � d k r, | j d | | d � | St | � d k rZ | j t j | j � � n | j | | d t j d � | j | | d | j
d | | � S(
sa Replace unicode.split(...) by a direct call to the
corresponding C-API function.
i i i s
unicode.splits 1-3s -1t PyUnicode_Splitt split( i i i ( Ru R� R� R R� R9 t _inject_int_default_argumentR R� R� t PyUnicode_Split_func_type( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt# _handle_simple_method_unicode_split� s t substringR� t endt directionc C s# | j | | | | d d t d
� S( NR6 t endswithi ( t _inject_tailmatcht unicode_tailmatch_utility_code( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt& _handle_simple_method_unicode_endswith� s c C s" | j | | | | d d t d � S( NR6 t
startswithi����( R� R� ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt( _handle_simple_method_unicode_startswith� s c
C s� t | � d k r6 | j d | | f | | d � | S| j | | d t j d � | j | | d t j d � | j t j | j d t | � d t j
�� | j | | d
| j � | j
| | | d | �} | j t j | j � � S(
s� Replace unicode.startswith(...) and unicode.endswith(...)
by a direct call to the corresponding C-API function.
i i i s %s.%ss 2-4R� t PY_SSIZE_T_MAXR- R< s __Pyx_Py%s_TailmatchR� ( i i i ( Ru R� R� R R� R� R R� R9 R� R� R� t
capitalizet PyString_Tailmatch_func_typeR� R R RK (
RP R Rv Rs Rr t type_nameR R� R� t method_call( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s "
s -2c C s | j | | | | d d
� S( Nt findi ( t _inject_unicode_find( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt" _handle_simple_method_unicode_find� s c C s | j | | | | d d � S( Nt rfindi����( R� ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt# _handle_simple_method_unicode_rfind� s c C s� t | � d k r0 | j d | | | d � | S| j | | d t j d � | j | | d t j d � | j t j | j d t | � d t j
�� | j | | d
| j | | | � } | j
| j � � S( sw Replace unicode.find(...) and unicode.rfind(...) by a
direct call to the corresponding C-API function.
i i i s
unicode.%ss 2-4R� R� R- R< t PyUnicode_Find( i i i ( Ru R� R� R R� R� R R� R9 R� R� R� t PyUnicode_Find_func_typeR4 RK ( RP R Rv Rs Rr R R� R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s "c C s� t | � d
k r, | j d | | d � | S| j | | d t j d � | j | | d t j d � | j | | d | j d | | � } | j | j � � S( sa Replace unicode.count(...) by a direct call to the
corresponding C-API function.
i i i s
unicode.counts 2-4R� R� t PyUnicode_Countt count( i i i ( Ru R� R� R R� R� t PyUnicode_Count_func_typeR4 RK ( RP R Rv Rs Rr R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt# _handle_simple_method_unicode_count
s t replstrt maxcountc C sj t | � d k r, | j d | | d � | S| j | | d t j d � | j | | d | j d | | � S( sc Replace unicode.replace(...) by a direct call to the
corresponding C-API function.
i i s unicode.replaces 3-4s -1t PyUnicode_ReplaceR ( i i ( Ru R� R� R R� R� t PyUnicode_Replace_func_type( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt% _handle_simple_method_unicode_replace3
s t encodingt errorst UTF8t UTF16t Latin1t ASCIIt unicode_escapet raw_unicode_escapec
C s� t | � d k s$ t | � d k r> | j d | | d � | S| d } t | � d k r� t j | j � } | j | | d | j d | | | | g � S| j | j | � } | d k r� | S| \ } } }
} t | t j
� r:y | j j | |
� } Wn q:Xt
| � } | | _ t j | j d | d t j �Sn |
d
k r�| j | � }
|
d k r�d |
} | j | | | | j d | | g � Sn | j | | d | j d | | | | g � S(
s_ Replace unicode.encode(...) by a direct C-API call to the
corresponding codec.
i i s unicode.encodes 1-3i t PyUnicode_AsEncodedStringt encodeR- R< t stricts PyUnicode_As%sStringN( Ru R� R R� R9 R� t# PyUnicode_AsEncodedString_func_typet _unpack_encoding_and_error_modeR# R R" R- R� R R� R# R Rn t _find_special_codec_namet PyUnicode_AsXyzString_func_type( RP R Rv Rs Rr t string_nodet null_nodet
parametersR� t
encoding_nodet error_handlingt error_handling_nodeR- t
codec_namet encode_function( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt$ _handle_simple_method_unicode_encodeS
sH $
t stringR� R� t decode_funcc C s� d t | � k o d k n s< | j d | | d � | S| d } d$ } } t | t j � r� | } | j } | j | j } } | s� | j d k r� d$ } q� n t | t j
� r� | j } n | j } | t
j k r!| r | j d d d d g �} q9| j d
d d d d g �} n | j r9| j r9| S| j | j | � }
|
d$ k r^| S|
\ } } }
} | s�t j | j d
d d d �} n* | j j s�| j t j | j � � } n | r�| j j r�| j t j | j � � } n d$ } | d$ k r| j | � } n | d$ k r\t j | j d | j d d | �} t j | j � } n t j | j � } g } | j r| s�| j s�t j | � } | j! | � n t j" | j d | j# d | g d t$ d t% j& d d � �j t j | j � � } n | j' } d } n#| j r�| sDt j | j d
d d t j( �} n | j) d$ k r�t j* t
j+ t j, d | d$ � t j, d t j d$ � t j, d t j d$ � t j, d t j- d$ � t j, d t j- d$ � t j, d | j d$ � g � | _) n | j) } d! } n9 | s%t j | j d
d d t j( �} n | j. } d" } t j" | j d# | | d | | | | | | g d | j/ d t% j& | d � �} x- | d$ d$ d% � D] } t j0 | | � } q�W| S(& s� Replace char*.decode() by a direct C-API call to the
corresponding codec, possibly resolving a slice on the char*.
i i s bytes.decodes 1-3i s@ descriptor '%s' requires a '%s' object but received a 'NoneType'R� t decodeR s' 'NoneType' object has no attribute '%s'R R� R- R� R$ R< RD s PyUnicode_Decode%sR< Rs R� R� R= s
StringTools.ct decode_c_stringR� R� R� R� R� R� R� t decode_cpp_stringt decode_bytess __Pyx_%sNi����(1 Ru R� R# R R R� R; R� R� R$ R R R< R Rn R� R� t
is_cpp_stringR� R9 R� R� R� R R� RK R� t RawCNameExprNodet! PyUnicode_DecodeXyz_func_ptr_typeR� R{ R R� R� R� R@ R R R t _decode_c_string_func_typeR t _decode_cpp_string_func_typeR Rp R R t _decode_bytes_func_typeR� R ( RP R Rv Rs Rr R� R� R� R� t string_typeR� R� R� R� R� R� t decode_functionR2 t helper_func_typet utility_code_nameR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt" _handle_simple_method_bytes_decode�
s� "
!
$ c C s� y t j | � } Wn d SXxg | j D]\ \ } } | | k r( d | k r� d j g | j d � D] } | j � ^ qb � } n | Sq( Wd S( NRN R� ( t codecst
getencoderR# t _special_codecsR� R� R� ( RP R� t requested_codecR t codecR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� s +c C s� t j | � } t | � d k rM | j | d � \ } } | d k rY d Sn d } | } t | � d k r� | j | d � \ } } | d k r� d S| d k r� | } q� n d } | } | | | | f S( Ni i i R� ( R R� Ru t _unpack_string_and_cstring_nodeR# ( RP R9 Rs R� R� R� R� R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� ! s c C s t | t j � r | j } n t | t j � ri | j } t j | j d t | j � � d t
j �} n� t | t j t j f � r� | j j
d � } t j | j d | j d t
j �} nU | j t j k r� d } | j t
j | j � � } n | j j rd } n
d } } | | f S( NR- R< s
ISO-8859-1( R R R R R" R- R# R9 R t
utf8encodeR R R� R� R< R Rn R# R� RK R� ( RP R R� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� 8 s$ !
c C s# | j | | | | d d t d
� S( NR� R� i ( R� t str_tailmatch_utility_code( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt" _handle_simple_method_str_endswithM s c C s" | j | | | | d d t d � S( NR� R� i����( R� R ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt$ _handle_simple_method_str_startswithR s c C s# | j | | | | d d t d
� S( NR R� i ( R� t bytes_tailmatch_utility_code( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt$ _handle_simple_method_bytes_endswithW s c C s" | j | | | | d d t d � S( NR R� i����( R� R ( RP R Rv Rs Rr ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt& _handle_simple_method_bytes_startswith\ s c C s� t | � } | r | d j r | d } | rT | j d d | | j j g �} n | j d d d d | g �} | | d <n | d k r� | j } n t j | j | | d | d | d | d
|
d | j
�S( Ni s@ descriptor '%s' requires a '%s' object but received a 'NoneType'R� s' 'NoneType' object has no attribute '%s'R R� Rs R� R� R| R� ( R3 R� R� R R R# R� R R� R9 R� ( RP R Rv R R� t attr_nameRr Rs R� R� R| t self_arg( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� c s*
c C s� t | � | k s t � t | � | k r^ | j t j | j d t | � d | d | �� n | | j | | j � � | | <d S( NR- R< R$ ( Ru R� R� R R� R9 R� R� RK ( RP R Rs t arg_indexR< t
default_value( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� s
!c C s t | � | k s t � t | � | k r^ t | � } | j t j | j d | d | �� n | | j | j � � | | <d S( NR- R$ ( Ru R� R3 R� R RC R9 R RK ( RP R Rs R R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s
N( (� R R R R
R R R R R R R R R Rn R# R� R� Rj R" R R R� Rh R) R� R� R� R+ R- R� R� R2 R� R� R5 RI R R@ t c_py_unicode_ptr_typeRB RG Rp R� t frozenset_typeR RC R6 RF RK RV RN RP Ro RX R_ Ra Rq Rp Rz R} R~ R� t c_long_typeR� R� t _handle_simple_method_list_popt c_returncode_typeR� R� R� R� R� R� R R� R� t% _handle_simple_method_unicode_isalnumt% _handle_simple_method_unicode_isalphat' _handle_simple_method_unicode_isdecimalt% _handle_simple_method_unicode_isdigitt% _handle_simple_method_unicode_islowert' _handle_simple_method_unicode_isnumerict% _handle_simple_method_unicode_isspacet% _handle_simple_method_unicode_istitlet% _handle_simple_method_unicode_isupperR� R� t# _handle_simple_method_unicode_lowert# _handle_simple_method_unicode_uppert# _handle_simple_method_unicode_titleR� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� R� t _special_encodingsR R� R� R� R� Ro R� R� R� R� R� R� R� R� R R R R R R� R| R� R� R� ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR � s� !
. 7 K " % 3 ! q
t unicode_tailmatchs
StringTools.ct bytes_tailmatcht
str_tailmatcht ConstantFoldingc B s� e Z d Z e d � Z d � Z e j e j e j e j
g 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 e j j Z RS( sF Calculate the result of constant expressions to store it in
``expr_node.constant_result``, and replace trivial cases by their
constant result.
General rules:
- We calculate float constants to make them available to the
compiler, but we do not aggregate them into a single literal
node to prevent any loss of precision.
- We recursively calculate constants from non-literal nodes to
make them available to the compiler, but we only aggregate
literal nodes at each step. Non-literal nodes are never merged
into a single node.
c C s t t | � j � | | _ d S( s�
The reevaluate argument specifies whether constant values that were
previously computed should be recomputed.
N( t superR R� t
reevaluate( RP R! ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s c
C s) | j r | j t j k r d St j } | | _ | j | � } xr | j � D]d } t | � t k r� xI | D]" } t | d | � | k rm d Sqm WqN t | d | � | k rN d SqN Wy | j
� Wn^ t t t
t t t f k
r� n< t k
r$d d l } d d l } | j d | j � n Xd S( NR$ i����t file( R! R$ R t constant_value_not_setR RO R^ R< R3 R' t calculate_constant_resultt
ValueErrort TypeErrorR� t
IndexErrorR� t ArithmeticErrorRn t tracebackt syst print_exct stdout( RP R R t childrent child_resultt childR) R* ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _calculate_const� s(
c G sF y- | j t t | j j t t | � � � SWn t k
rA d SXd S( N( t NODE_TYPE_ORDERt maxR4 R� R< R% R# ( RP t nodes( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _widest_node_class� s
'
c C s | j | � | S( N( R0 ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_ExprNode� s
c C s� | j | � | j t j k r# | S| j j s3 | S| j d k rp t j | j d t | j � d t | j � �St
| j t j � r� t j | j d t t
| j � � d t j d t
| j � �S| j d k r� | j | � S| j d k r� | j | � S| S( Nt !R- R$ R< R� t -( R0 R$ R R R7 R� R' RC R9 R3 R R� R� R� R R� t _handle_UnaryPlusNodet _handle_UnaryMinusNode( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_UnopNode� s"
$
c
C s� d � } t | j t j � rI t j | j d | | j j � d | j �S| j j } | j rg | j s� t | j t j
� r� | j r� t j
| j d | | j j � d | d | j j d | j �S| S( Nc S s* | j d � r | d } n
d | } | S( NR7 i ( R� ( R- ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _negate� s
R- R$ R< t longness(
R R7 R R� R9 R- R$ R< R� t signedR� R� R< ( RP R R; t node_type( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR9 � s !
!
c C s | j | j j k r | j S| S( N( R$ R7 ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR8 s c C s� | j | � | j t j k r# | S| j j s= | j j rA | S| j | j j k ri | j j ri | j S| j | j j k r� | j j r� | j S| Sd S( N( R0 R$ R R R( R� R) ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRV
s
!!c C s� | j | � | j t j k r# | St | j t � r9 | S| j | j } } | j s` | j rd | Sy3 | j | j } } | d k s� | d k r� | SWn t k
r� | SX| j r� | j r� t
j | | � } n t
j } | j | | � } | d k r� | S| t j k r(| j d k r(t j } n | t j k rR| j d k rRt j } n | t j k r@t | d d � o�t | d d � } d t t t | d d � � t t | d d � � � } t j d | j d | d | d t t | j � � d t | j � � }
| j s|
j j r%t
j |
_ q�t
j | |
j � |
_ nQ | t j k r[| j } n t | j � } | d | j d
| d | d | j � }
|
S( Ns +-//<<%**>>s +-//<<%**>>&|^t unsignedR� t LLR< R9 R- R$ R< ( R0 R$ R R R R� R( R) R� R< R# R� R1 R R� R� R4 RC R' R� R8 R' R2 Ru R9 R� R� R� ( RP R R( R) t type1t type2t widest_typet target_classR? R< RW t
node_value( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_BinopNode sV
c C s� t | j t j t j f � ri | j } | j } | j | � | j d k rX | | _ n | j | � | St | j t j
� r� t | j t j t j f � r� | j } | j } | j | � | j d k r� | | _ n | j | � | S| j | � S( Ni ( R R( R Rk Rj R) R0 R$ t mult_factorRO R� RF ( RP R t
sequence_nodet factor( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt
visit_MulNodeS s$
c C s� | j | � | j t j k rJ t | j � } t j | j d | d | �S| j d k r� | j r� t | j
t j � r� | j
j � | _
q� n | S( NR- R$ Re R6 ( Re R6 (
R0 R$ R R R3 RC R9 R' R R R) Rk t as_tuple( RP R t bool_result( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRX g s
c C sD | j | � | j j t j k r& | S| j j r9 | j S| j Sd S( N( R0 RI R$ R R RS RT ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRU r s
c C s� | j | � g } xg | j D]\ } | j � } | d k rK | j | � q | t k rg | j | _ Pq | t k s t � q W| r� | | _ | S| j r� | j St
j | j d g �Sd S( NR* (
RO R. t get_constant_condition_resultR# R� Rj R0 R1 R R� R RA R9 ( RP R R. RM t condition_result( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRQ { s
c C s� | j | � | j d k s. | j j d k r> d } | _ n | j j } | j d k sk | j j d k r{ d } | _ n | j j } | j t k r� | j } | j r� | j | | !| _ | S| j r� | j
| | � } | d k r� | Sq� n | S( N( R0 R� R# R$ R� R R; R� Rs t is_string_literalt as_sliced_node( RP R R� R� R; ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_SliceIndexNode� s"
! !
c C s� | j | � t | j t j � r� | j j r� | j t j k rW t j
| j d g �S| j t j k r t j
| j d g �S| j t j k r� t j | j d g �Sn | S( NRs R� ( RO R R� R RA R* R< R R� R Rk R9 R� Rl Rh R� ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_ComprehensionNode� s
"c C s� | j | � | j j } t | t j � r� | j s] | j rD | j St j | j
d g �Sn t | t j � r� | j � | j _ q� n | S( NR* (
RO R4 R5 R R t SequenceNodeRs R1 R RA R9 Rk RK ( RP R R5 ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRZ � s
c C sB | j | � | j j � r> | j j r4 d | _ q> | j Sn | S( N( RO R/ t has_constant_resultR$ R# R1 ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_WhileStatNode� s
c C si t j t j f } x t | | � r0 | j } q Wt | t j � re | j } t | t j � re | Sn d S( N(
R RH RE R R0 R� R� R t
YieldExprNodeR# ( RP R t body_node_typesR� ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt _find_genexpr_yield_stat� s
( R R R R R� R0 R RC R8 R� R� R1 R4 R5 R: R9 R8 RV RF RJ RX RU RQ RQ RR RZ RU RX R\ Ra Rb Rc ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR � s, :
t FinalOptimizePhasec B s2 e Z d Z d � Z d � Z d � Z d � Z RS( s�
This visitor handles several commuting optimizations, and is run
just before the C code generation phase.
The optimizations currently implemented in this class are:
- eliminate None assignment and refcounting for first assignment.
- isinstance -> typecheck for cdef types
- eliminate checks for None and/or types that became redundant after tree changes
c C s/ | j | � | j r+ | j } t | _ n | S( sa Avoid redundant initialisation of local variables before their
first assignment.
( RO RW R+ Rj t lhs_of_first_assignment( RP R R+ ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_SingleAssignmentNode� s
c C s� | j | � | j j j r� t | j t j � r� | j j d k r� | j d } | j j r� | j j d k r� | j
j } | j d � | j _
| j j
j | j _ t j | j d � j � } t j | j d | � | j d <q� q� n | S( s] Replace generic calls to isinstance(x, type) by a more efficient
type check.
R i R< t PyObject_TypeCheckRe ( RO Rv R< t is_cfunctionR R R R Rs R& Ry Rn R� R| R Ro RO ( RP R Rs Rn Rx ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyR� � s
$
)c C s8 | j | � | j s4 | j j � s4 t | _ q4 n | S( s� Remove tests for alternatively allowed None values from
type tests when we know that the argument cannot be None
anyway.
( RO t notnoneR t may_be_noneRj ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_PyTypeTestNode
s
c C s' | j | � | j j � s# | j S| S( s_ Remove None checks from expressions that definitely do not
carry a None value.
( RO R R_ ( RP R ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_NoneCheckNode
s
( R R R R[ R� R` Ra ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRY � s
t ConsolidateOverflowCheckc B s& e Z d Z d Z d � Z d � Z RS( s5
This class facilitates the sharing of overflow checking among all nodes
of a nested arithmetic expression. For example, given the expression
a*b + c, where a, b, and x are all possibly overflowing ints, the entire
sequence will be evaluated and the overflow bit checked only at the end.
c C sK | j d k r: | j } d | _ | j | � | | _ n
| j | � | S( N( t overflow_bit_nodeR# RO ( RP R t saved( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRc
s
c C s{ | j rj | j rj | j d k } | r3 | | _ n | j | _ t | _ | j | � | rw d | _ qw n
| j | � | S( N( t overflow_checkt
overflow_foldRc R# R RO ( RP R t top_level_overflow( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt visit_NumBinopNode)
s
N( R R R R# Rc Rc Rh ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyRb
s
(9 t Cython.CompilerR t Cython.Compiler.ExprNodesR t cythont declareRL R R R R\ R R R� R
t CodeR t StringEncodingR R t ErrorsR t ParseTreeTransformsR R� t __builtin__R
t ImportErrort functoolsR R� R R t CoerceFromPyTypeNodeR R R R% t EnvTransformR& Ra R Rd Rs R� t NodeRefCleanupMixinR� t MethodDispatcherTransformR R R� R R R t CythonTransformRY Rb ( ( ( sK /opt/alt/python27/lib64/python2.7/site-packages/Cython/Compiler/Optimize.pyt <module> sj
� � �� It� � !� � � � � � I8