+ VBizz^RIt^RIt^RIHt^RIHt^RIHt^RIHt^RIHt^RIHt^RIH t ^RI t ] P!] ] ]]]]34t!R R 4t!R R ]4t!R R]4t!RR]4t!RR]4t!RR4t/RRbRRbRRbRRbRRbRR bR!R"bR#R$bR%R&bR'R(bR)R*bR+R,bR-R.bR/R0bR1R2bR3R4bR5R6bR7R8R9R:/CP2tR;RR5R?R!R@/P2t!RARB]4t!RCRD]4tREt!RFRG]4tRHt RIt!!RJRK]4t"]#RL8Xd^RI$t$]$PJ!4R#R#)MN) TypeSlots)Builtin)Nodes) ExprNodes)Errors) DebugFlags)Futurecaa]tRt^toRtV3RltRtRtRt] PR4t Rt ] PR4t ] PR 4tR R lt] PR 4tR tVtV;t#) TreeVisitora  Base class for writing visitors for a Cython tree, contains utilities for recursing such trees using visitors. Each node is expected to have a child_attrs iterable containing the names of attributes containing child nodes or lists of child nodes. Lists are not considered part of the tree structure (i.e. contained nodes are considered direct children of the parent node). visit_children visits each of the children of a given node (see the visit_children documentation). When recursing the tree using visit_children, an attribute access_path is maintained which gives information about the current location in the tree as a stack of tuples: (parent_node, attrname, index), representing the node, attribute and optional list index that was taken in each step in the path to the current node. Example: >>> class SampleNode(object): ... child_attrs = ["head", "body"] ... def __init__(self, value, head=None, body=None): ... self.value = value ... self.head = head ... self.body = body ... def __repr__(self): return "SampleNode(%s)" % self.value ... >>> tree = SampleNode(0, SampleNode(1), [SampleNode(2), SampleNode(3)]) >>> class MyVisitor(TreeVisitor): ... def visit_SampleNode(self, node): ... print("in %s %s" % (node.value, self.access_path)) ... self.visitchildren(node) ... print("out %s" % node.value) ... >>> MyVisitor().visit(tree) in 0 [] in 1 [(SampleNode(0), 'head', None)] out 1 in 2 [(SampleNode(0), 'body', 0)] out 2 in 3 [(SampleNode(0), 'body', 1)] out 3 out 0 c@<\SV`4/Vn.VnR#N)super__init__dispatch_table access_path)self __class__s&>22INN64JKK"  s1 F F-,F-c^RIpTp.p\VR4'dVPpVPP R4p\ V\ P4'd_VPpVPpVPPVP4VP3p VPWhV 34TpVPpKW43#)rNtb_framer)r$hasattrr>f_localsgetr-rNodef_codeco_namer%r& co_filenamef_linenor(tb_next) r stacktracer7last_tracebacknodesframer3code method_namers && r_find_node_pathTreeVisitor._find_node_pathis#j*--''E>>%%f-D$ ++||"ll ww''(8(89~~' d56!+#++J&&rc vR.pVPFkwrEp\WE4pVfRpMWv,pRV,pVPVPP: RV: V: RVP V4: 24Km VP \P!4^,4wrTp V F@wr{p Tp VPRV ^,V ^,WP V43,4KB \P!\V RR4VPPRPV4W(4h)Nz[%d].rzFile '%s', line %d, in %s: %sr ) rr#r(rr1r;rNsysexc_infor CompilerCrashr2) rchildetraceparent attributeindexr3rH called_nodes last_noderMrs &&& r_raise_compiler_error!TreeVisitor._raise_compiler_errorzs(,(8(8 $Fu6-D}{ LL  ))9et$& ')9$(#7#7 q8I#J  &2 "DsI LL8AA ^^D-A'A 3AA AA (C CC(CCcVPPW#V34VPV4pVPP4V#r )rr(rspop)rrWrZattrnameidxresults&&&&& r _visitchildTreeVisitor._visitchildsB 3 78U#  rc&VPWV4#r )_visitchildrenrrZattrsexcludes&&&&r visitchildrenTreeVisitor.visitchildrens""6'::rc  VfR#/pVPFpVe WR9dKVe WS9dK\W4pVfK,\V4\Jd0\ V4UUu.uFwrxVP WWW4NK p ppM8VP WaVR4p \ V \4'dQRV: RV: 24hWV&K V#uuppi)a. Visits the children of the given parent. If parent is None, returns immediately (returning None). The return value is a dictionary giving the results for each child (mapping the attribute name to either the return value or a list of return values (in the case of multiple children in an attribute)). NzCannot insert list here: z in )rr#rdr" enumeraterr-) rrZrrrr9rWrx childretvals &&&& rrTreeVisitor._visitchildrens >$&&D T%6"tF)E ;$&XabgXh"iXhfc4#3#3At#IXhK"iK"&"2"25$"MK)+t<<reikq>rr<*t ' #js"C)rrNN)r1 __module__ __qualname____firstlineno____doc__rr;rNr_cythonfinalrortrsrrr__static_attributes____classdictcell__ __classcell__r __classdict__s@@rr r s)T L@'"-, \\RR   \\//$ \\; \\rr ca]tRt^toRtR Rlt]PR Rl4t]PR4t R Rlt Rt Rt R t VtR#) VisitorTransforma A tree transform is a base class for visitors that wants to do stream processing of the structure (rather than attributes etc.) of a tree. It implements __call__ to simply visit the argument node. It requires the visitor methods to return the nodes which should take the place of the visited node in the result tree (which can be the same or one or more replacement). Specifically, if the return value from a visitor method is: - [] or None; the visited node will be removed (set to None if an attribute and removed if in a list) - A single node; the visited node will be replaced by the returned node. - A list of nodes; the visited nodes will be replaced by all the nodes in the list. This will only work if the node was already a member of a list; if it was not, an exception will be raised. (Typically you want to ensure that you are within a StatListNode or similar before doing this.) Nc&VPWV4#r _process_childrenrs&&&&rrVisitorTransform.visitchildrens%%fW==rcVPWV4pVP4F5wrV\V4\JdVP V4p\ WV4K7 V#r )ritemsrdr" _flatten_listsetattr)rrZrrrr9newnodes&&&& rr"VisitorTransform._process_childrensU$$VG<#\\^MDG}$,,W5 F' *, rc.pVF@pVfK \V4\JdVPV4K/VPV4KB V#r )rdr"extendr()r orig_listnewlistrs&& rrVisitorTransform._flatten_listsBA}7d?NN1%NN1%  rcn\W4pVe&VPWAW#4pWTJd \WV4TpV#r )r#rr)rrZr9rrWr3s&&&& r visitchildVisitorTransform.visitchilds>%  ##E4=D d+E rc(VPV4V#r rrr3s&&rrecurse_to_children$VisitorTransform.recurse_to_children t$ rc$VPV4#r rr)rroots&&r__call__VisitorTransform.__call__s{{4  rrr)r1rrrrrrrrrrrrrrrs@rrrsS&> \\ \\  !!rrcNaa]tRtRtoRtV3RltV3RltRtRtRt Vt V;t #)CythonTransformi"z Certain common conventions and utilities for Cython transforms. - Sets up the context of the pipeline in self.context - Tracks directives in effect in self.current_directives c0<\SV`4WnR#r )rrcontext)rrrs&&rrCythonTransform.__init__)s  rcr<^RIHp\W4'dVPVn\SV`V4#)) ModuleNode)rr- directivescurrent_directivesrr)rr3rrs&& rrCythonTransform.__call__-s-* d ' '&*ooD #w%%rcnVPpVPVnVPV4W nV#r )rrr)rr3olds&& rvisit_CompilerDirectivesNode,CythonTransform.visit_CompilerDirectivesNode3s2%%"&// t$"% rc(VPV4V#r rrs&&r visit_NodeCythonTransform.visit_Node:rr)rr) r1rrrrrrrrrrrrs@@rrr"s# & rrcDa]tRtRtoRtRtRtRtRtRt Rt Vt R #) ScopeTrackingTransformi?cBRVnWnVPV4V#)module scope_type scope_noderrs&&rvisit_ModuleNode'ScopeTrackingTransform.visit_ModuleNodeDs!" t$ rcVPVP3pW nWnVPV4VwVnVnV#r r)rr3rprevs&&& r visit_scope"ScopeTrackingTransform.visit_scopeJs?/$ t$+/( rc&VPVR4#)cclassrrs&&rvisit_CClassDefNode*ScopeTrackingTransform.visit_CClassDefNodeRh//rc&VPVR4#)pyclassrrs&&rvisit_PyClassDefNode+ScopeTrackingTransform.visit_PyClassDefNodeUsi00rc&VPVR4#)functionrrs&&rvisit_FuncDefNode(ScopeTrackingTransform.visit_FuncDefNodeXsj11rc&VPVR4#)structrrs&&rvisit_CStructOrUnionDefNode2ScopeTrackingTransform.visit_CStructOrUnionDefNode[rr)rrN) r1rrrrrrrrrrrrs@rrr?s(  01200rrc~aa]tRtRtoRtV3RltRtRtRtRt Rt R t R t R t R tR tRtRtRtVtV;t#) EnvTransformi_z8 This transformation keeps a stack of the environments. cf<.VnVPWP4\SV`V4#r ) env_stack enter_scopescoperr)rrrs&&rrEnvTransform.__call__cs, zz*w%%rc6VPR,^,#rrcrrs&r current_envEnvTransform.current_envh~~b!!$$rc6VPR,^,#rrrs&rcurrent_scope_nodeEnvTransform.current_scope_nodekrrc>VP4P4#r )r global_scopers&rrEnvTransform.global_scopens!..00rc>VPPW34R#r )rr()rr3rs&&&rrEnvTransform.enter_scopeqs tm,rc:VPP4R#r )rr~rs&r exit_scopeEnvTransform.exit_scopets rcVPV4VPWP4VPVRVPR7VP 4V#)N)rr)visit_func_outer_attrsr local_scoper outer_attrsrrs&&rrEnvTransform.visit_FuncDefNodewsN ##D) //0 4tT5E5EF  rc>VPWPR7R#))rN)rr rs&&rr#EnvTransform.visit_func_outer_attrs~s 4'7'78rc(VPV4V#r rrs&&rvisit_GeneratorBodyDefNode'EnvTransform.visit_GeneratorBodyDefNoderrc~VPWP4VPV4VP4V#r rrrrrs&&rvisit_ClassDefNodeEnvTransform.visit_ClassDefNode1 zz* t$  rc~VPWP4VPV4VP4V#r rrs&&rr(EnvTransform.visit_CStructOrUnionDefNoderrcVP'd?VPWP4VPV4VP4V#VPV4V#r ) expr_scoperrrrs&&rvisit_ScopedExprNode!EnvTransform.visit_ScopedExprNodesQ ???   T?? 3  " "4 ( OO    " "4 ( rcXVP'dVPUu.uF q"R8wgK VNK ppVPW4VPWP 4P 4VP VR4VP4V#VPV4V#uupi)default)r)rrrrr outer_scoperr)rr3r9rs&& rvisit_CArgDeclNodeEnvTransform.visit_CArgDeclNodes <<<&*&6&6L&6d):KTT&6EL  " "4 /   T#3#3#5#A#A B   t\ 2 OO    " "4 ( Ms B'B'r)r1rrrrrrrrrrrrrrrrrrrrrs@@rrr_sP& %%1-9    rrcHaa]tRtRtoRtV3RltRtRtRtRt Vt V;t #)NodeRefCleanupMixiniaW Clean up references to nodes that were replaced. NOTE: this implementation assumes that the replacement is done first, before hitting any further references during normal tree traversal. This needs to be arranged by calling "self.visitchildren()" at a proper place in the transform and by ordering the "child_attrs" of nodes appropriately. c2<\SV`!V!/VnR#r )rr _replacements)rargsrs&*rrNodeRefCleanupMixin.__init__s $rcVPpW P9dVPV4VPPW"4VnV#r )argr#rrA)rr3r's&& rvisit_CloneNode#NodeRefCleanupMixin.visit_CloneNodesBhh (( (   s #%%))#3 rcVPpVeW P9dVPV4VPpVe!VPPW"4VnV#r ) expressionr#rrA)rr3exprs&& rvisit_ResultRefNode'NodeRefCleanupMixin.visit_ResultRefNodesU <4'9'99   t $??D  "0044T@DO rc"W PV&V#r r#)rr3 replacements&&&rreplaceNodeRefCleanupMixin.replaces#.4 rr0) r1rrrrrr(r-r2rrrrs@@rr!r!s# rr!<__lt__z<=__le__z==__eq__z!=__ne__z>=__ge__>__gt__+__add__&__and__/__div__z// __floordiv__z<< __lshift__%__mod__*__mul__|__or__z**__pow__z>> __rshift__-__sub__^__xor__in __contains__not__not__~__inv____neg____pos__cla]tRtRtoRtRtRtRtRtRt Rt R t R t R t R tR tRtRtVtR#)MethodDispatcherTransformia Base class for transformations that want to intercept on specific builtin functions or methods of builtin types, including special methods triggered by Python operators. Must run after declaration analysis when entries were assigned. Naming pattern for handler methods is as follows: * builtin functions: _handle_(general|simple|any)_function_NAME * builtin methods: _handle_(general|simple|any)_method_TYPENAME_METHODNAME c|VPV4VPpVPP'gV#VPp\ V\ P4'gV#VPpV'd#\ V\ P4'gV#VPpVPWWT4#r ) rrrd is_pyobjectpositional_argsr-r TupleNode keyword_argsDictNoder$_dispatch_to_handler)rr3r arg_tupler^r$s&& rvisit_GeneralCallNode/MethodDispatcherTransform.visit_GeneralCallNodes t$==}}(((K(( )Y%8%899K((  <9K9K L LK~~((LLrc(VPV4VPpVPP'd<VPp\ V\ P4'gV#VPpM VPpVPWVR4#r ) rrrdr[rar-rr]r$r`)rr3rrar$s&& rvisit_SimpleCallNode.MethodDispatcherTransform.visit_SimpleCallNodesq t$== == $ $ $Ii)<)<== >>D99D((tDDrcnVP'dVPV4V#VPV4#r )cascader_visit_binop_noders&&rvisit_PrimaryCmpNode.MethodDispatcherTransform.visit_PrimaryCmpNodes/ <<<  " "4 (K%%d++rc$VPV4#r )rirs&&rvisit_BinopNode)MethodDispatcherTransform.visit_BinopNodes%%d++rc VPV4\VP4pV'dVPVPrCVR8XdYCrCM@VR8Xd:\ P VP4PP9dRpVPpVP'd VP'gVPpMRpVPVRRVVRW4.R4pV#)rQrA __truediv__objectNF)r'find_special_method_for_binary_operatoroperatoroperand1operand2r divisionrrfuture_directivesrdis_builtin_typeis_exception_typename_dispatch_to_method_handler)rr3special_method_namertruobj_type type_names&& rri+MethodDispatcherTransform._visit_binop_nodes t$EdmmT !% h"n4%-($ 1??d&6&6&8&@&@&R&RR*7'}}H'''0J0J0J$MM $ 33#T5)dX0$8D rc *VPV4\VP4pV'deVPpVPpVP 'd VP 'gVPpMRpVPVRRVVRV.R4pV#)rqNF) r&find_special_method_for_unary_operatorrsoperandrdrxryrzr{)rr3r|rr}r~s&& rvisit_UnopNode(MethodDispatcherTransform.visit_UnopNode1s t$DT]]S llG||H'''0J0J0J$MM $ 33#T5)dWIt-D rcVP4'gR#V'dRMRp\VRV RV 2R4pVf\VRV 2R4pV#)Ngeneralsimple_handle_r _handle_any_)isasciir#)r match_name has_kwargs call_typehandlers&&& r _find_handler'MethodDispatcherTransform._find_handlerBsW!!##!+I $(9+Qzl CTJ ?dl:,$?FGrcVP^,pVPpVP'd:VP'd%\ VPP 4^8dV#M}VP 'djVPP'dNVPP'd/\ VPPP 4^8dV#MV#VPWW44#r) cf_staterhsis_nameentryr.cf_assignments is_attributerjr`)rr3rarg_listkwargs assignmentr:s&&&&& r_delegate_to_assigned_value5MethodDispatcherTransform._delegate_to_assigned_valueMs&&q)  ===;;;#ekk&@&@"AA"E #F   EII$5$5$599???c%))//*H*H&IA&M 'NK(( + +rc VP'EdVP'gV#VPpVP;'g9WPP4P 4P VP 4JpV'Eg%VP'd/VPP'dVPWW44#V'dVP'dVP'dVPPP'dVPPP'gkVPPV^,PJd@VP!VP RRVPPP WW4R7#V#VP#RVP 2V4pVfVP%WP W#V4#V'd V!WW44#V!WV4#VP&'EddVP(pVPP*'dVP,p MnVP.'d[VP'dIVPP0pV'dVP'gV#VP.p VR,pMV#V Pp Rp V P'dV P'gyV \2P4JdOV P'd=V'd5V^,PP*'dV P p Rp Rp M V P p V R8XdRp MR p VP!WWWW44#V#) rNT)self_argis_unbound_methodr~r3rrr function_:rNNFstrunicoderq)rr is_builtinr builtin_scope lookup_hererzr is_singler is_cmethodr parent_typerxryrdr{r_handle_functionrr[r[rjr as_variabler type_type) rr3rrrrrfunction_handler attr_namerr}rr~s &&&&& rr`.MethodDispatcherTransform._dispatch_to_handler]s    >>> NNE  WW))+99;GG VV :$$$):):)D)D)D ;;::!1!1!1ekkk //??? H_H_HqHqHq{{..(1+2B2BB#??!JJ&+kk&=&=&B&B!%8 @ \\ #11HMM?+V 5 ',,T==(V\]]'II'AA  " " " **I}}(((#<<x~~~ 22E$4$4$4K99#B< }}H % '''0J0J0Jw000X5E5E5E(W_`aWbWgWgWsWsWs!) I#H(,% ( I% )I$ 33%62 2Krc 8VPRV RV 2V4p V fJV\P9gVR9dVPRV 2V4p V fVPWTWWsV4#VeV.\ V4,pV'd V !WVWsV4p V #V !WVWs4p V #)method_rslot)__new__r)rrspecial_method_names_handle_methodr") rrrrr~r3rrrmethod_handlerrs &&&&&&&&& rr{5MethodDispatcherTransform._dispatch_to_method_handlers++i[) -v7  !Y;;; $<> !== 88t~~ %}}DH rc^VPV4WPJd VP#V#r )rrrrs&&rr RecursiveNodeReplacer.visit_Nodes) t$ >> !== Kr)rr) r1rrrrrr(rrrrrs@@rrrs<rrc,\W4pV!V4R#r )r)treeold_noder replace_ins&&& rrecursively_replace_noders&x:Jtrc<aa]tRtRtoRtV3RltRtRtVtV;t #) NodeFinderiz* Find out if a node appears in a subtree. c><\SV`4WnRVnR#)FN)rrr3found)rr3rs&&rrNodeFinder.__init__s   rcVP'dR#WPJd RVnR#VPVRR4R#)TN)rr3rrs&&rrNodeFinder.visit_Nodes1 :::  YY DJ   dD 1r)rr3) r1rrrrrrrrrrs@@rrrs 22rrcR\V4pVPV4VP#r )rrtr)rr3finders&& r tree_containsrs"  F LL <<rcPVwr#pVf\W#V4R#V\W#4V&R#)zcReplaces a node. ptr is of the form used on the access path stack (parent, attrname, listidx|None) N)rr#)ptrr:rZrlistidxs&& r replace_noders,!$Fg%(-2!'*rc\a]tRtRtoRtR RltRtRtRRltRt R t R t R t R t VtR#) PrintTreeizPrints a representation of the tree to standard output. Subclass and override repr_of to provide more information about nodes. Nc\PV4RVnVfVe T;'g^T;'gR3VnR#RVnR#)rQNi@)r r_indent _line_range)rstartends&&&rrPrintTree.__init__sBT"   % CLL59D #D rc8V;PR, unR#)z Nrrs&rindentPrintTree.indents  rc.VPRRVnR#)Nrrs&runindentPrintTree.unindents||CR( rcL\RV,4VPV4V#)zParse tree dump at phase '%s')rgrt)rrphases&&&rrPrintTree.__call__s! -56 4 rcVPV4VP4VPV4VP4V#r ) _print_noderrrrs&&rrPrintTree.visit_Nodes5   4   rc VPV4VP4VP^,pVPe5VP^,Tu;8:dVP^,8:d=MM9\ VP : RR: RVP VP4: 24VP4VPVP4VP4VP4V#)r- r': ) rrrrrgrrepr_ofr'rr)rr3lines&& rr(PrintTree.visit_CloneNode&s  xx{    #t'7'7':d'YdFVFVWXFY'Y $,,t||DHH7MN O  488$   rc VP^,pVPe6VP^,Tu;8:dVP^,8:dzMR#\VP4^8XdRpM'VPR,wrEpVe RWV3,pMTp\ VP : RV: RVP V4: 24R#R#)rNz(root)z%s[%d]rrrc)rrr.rrgrr)rr3rrzrZr9rs&& rrPrintTree._print_node2sxx{    #t'7'7':d'YdFVFVWXFY'Y'Y4##$)$($4$4R$8!c?#tk1DD $,,dll46HI J(Zrc VfR#VPPp\V\P4'd2VR\ VP 4: RVP: R2, pV#\V\P4'dVRVP,, pV#\V\P4'd.VRVP4: R\VRR4: R2, pV#\V\P4'd2VR\ VP 4: R VP: R2, pV#\V\P\P 34'd2VR\ VP 4: R VP": R 2, pV#\V\P$4'd(VP pVR \ V4,, pV#VP&'dVP&pV^,P)4pR V9dVP+R 4R,pRV9dVP+R4R,pVRV: RV^,: RV^,: R2, pV#)Nz(none)z(type=z, name="z")z (name="%s")z(name="z ", type="rdz , attribute="z, value=rz (type=%s)r@\z(pos=(rz))rc)rr1r-rNameNoder0rdrzrDefNode CFuncDefNode declared_namer# AttributeNoder[ ConstNode PyConstNoder:ExprNoderr'split)rr3rtrr%s&& rrPrintTree.repr_of?s <^^,,F$ 2 233d499otyyQQ,M+D%--00/DII55(M'D%"4"455&&('$*EGG$M!D)"9"9::4 ?DNN[[MD9#6#6 8M8M"NOO4 ?DJJOOMD)"4"455II+Q//Mhh1v--/$;::c?2.D4<::d+B/Dc!ffc!ffEEMr)rrrr )r1rrrrrrrrrr(rrrrrs@rrrs8$)  Krr__main__)&rTrerQrrrrrrr rdeclaretuplebytesrintfloatcomplexr/r rrrrr!rArrrrYrrrrrrr1doctesttestmodrrrrs  ^^EE3UG#D E FFR=!{=!@&:0_0@E?EP  F+(+(+ (+ ( +  ( + ( +)+)+)+ .+ ,+)+)+(+ )+  ,!+")#+$).'+(#)(0 9999 * # 'Y Yx,. 22"3W Wr z OOr