hylSSKrSSKrSSKJr SSKJr SSKJr SSKJr SSKJr SSKJr SS KJ r SSK r \ R"\ \ \\\\45r"S S 5r"S S \5r"SS\5r"SS\5r"SS\5r"SS5r0SS_SS_SS_SS_SS_S S!_S"S#_S$S%_S&S'_S(S)_S*S+_S,S-_S.S/_S0S1_S2S3_S4S5_S6S7_S8S9S:.ER2rS;SS?.R2r"S@SA\5r"SBSC\5rSDr"SESF\5rSGr SHr!"SISJ\5r"\#SK:XaSSK$r$\$RJ"5 gg)LN) TypeSlots)Builtin)Nodes) ExprNodes)Errors) DebugFlags)Futurec^\rSrSrSrU4SjrSrSrSr\ RS5r Sr \ RS 5r \ RS 5rSS jr\ RS 5rS rU=r$) 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>>[TU]5 0Ul/UlgN)super__init__dispatch_table access_path)self __class__s Q/var/www/fran/franai/venv/lib/python3.13/site-packages/Cython/Compiler/Visitor.pyrTreeVisitor.__init__Ds  c"[UR=(d /5/SQ-n/n[USS5nU(a[USnU(a-SSKnURR UR 55nURU<SUS<SUS<35 [U5nUHnX;aM URS5(dURS5(aM8[X5n U bU S:XaMO[U [5(aS[U 5-n O"[U [5(dM[U 5n URU<S U <35 M UR R"<S S R%U5<S 3$![a Mf=f) N) child_attrspos gil_message cpp_messagesubexprsrr:r_z[...]/%d = (z, ))listrgetattros.pathpathbasenameget_descriptionappenddir startswithendswithAttributeError isinstancelen _PRINTABLEreprr__name__join) rnodeignoredvaluesrsourceosattribute_namesattrvalues r dump_nodeTreeVisitor.dump_nodeIsSt''-2.2LLdE4( VF))&*@*@*BC MMAA? @d)#Ds##t}}S'9'9 +} E4(("SZ/z22U  MMtU3 4#$$ >>22INN64JKK"  s F F FcSSKnUn/n[US5(aURnURR S5n[ U[ R5(a^URnURnURRUR5UR4n URXhU 45 UnURn[US5(aMX44$)Nrtb_framer)r'hasattrrAf_localsgetr0rNodef_codeco_namer(r) co_filenamef_linenor+tb_next) r stacktracer:last_tracebacknodesframer6code method_namers r_find_node_pathTreeVisitor._find_node_pathis#j*--''E>>%%f-D$ ++||"ll ww''(8(89~~' d56!+#++Jj*--&&rc DS/nURHbupEn[XE5nUcSnO XvnSU-nURURR<SU<U<SUR U5<35 Md UR [R"5S5upUn U H4up{n Un URSU SU SXR U54-5 M6 [R"[U S S5URRS RU5X(5e) Nz[%d].r"r zFile '%s', line %d, in %s: %srrr ) rr&r+rr4r>rQsysexc_infor CompilerCrashr5) rchildetraceparent attributeindexr6rK called_nodes last_noderPrs r_raise_compiler_error!TreeVisitor._raise_compiler_errorzs(,(8(8 $Fu6-D}{ LL  ))9et$& ')9$(#7#7 q8I#J  &2 "DsI LL8AA ^^D-A 'B99B>cURRX#U45 URU5nURR5 U$r)rr+rvpop)rrZr]attrnameidxresults r _visitchildTreeVisitor._visitchildsB 3 78U#  rc&URXU5$r)_visitchildrenrr]attrsexcludes r visitchildrenTreeVisitor.visitchildrens""6'::rc Ucg0nURHnUbXR;aM UbXS;aM[X5nUcM'[U5[La0[ U5VVs/sHupxUR XXW5PM n nnO7UR XaUS5n [ U [5(aSU<SU<35eXU'M U$s snnf)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&rgr% enumeraterr0) rr]rrrr<rZrx childretvals rrTreeVisitor._visitchildrens >$&&D T%6"tF)E ;$&XabgXh"iXhfc4#3#3At#IXhK"iK"&"2"25$"MK)+t<<reikq>rr<*t ' #jsB=)rrNN)r4 __module__ __qualname____firstlineno____doc__rr>rQrbcythonfinalrrrwrvrrr__static_attributes__ __classcell__rs@rr r s)T L@'"-, \\RR   \\//$ \\; \\rr c\rSrSrSrS Sjr\RS Sj5r\RS5r S Sjr Sr S r S r g) 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&URXU5$r_process_childrenrs rrVisitorTransform.visitchildrens%%fW==rcURXU5nUR5H4upV[U5[LaUR U5n[ XU5 M6 U$r)ritemsrgr% _flatten_listsetattr)rr]rrrr<newnodes rr"VisitorTransform._process_childrensU$$VG<#\\^MDG}$,,W5 F' *, rc/nUH>nUcM[U5[LaURU5 M-URU5 M@ U$r)rgr%extendr+)r orig_listnewlistrs rrVisitorTransform._flatten_listsBA}7d?NN1%NN1%  rcj[X5nUb$URXAX#5nXTLa [XU5 UnU$r)r&rr)rr]r<rrZr6s r visitchildVisitorTransform.visitchilds>%  ##E4=D d+E rc(URU5 U$rrrr6s rrecurse_to_children$VisitorTransform.recurse_to_children t$ rc$URU5$rru)rroots r__call__VisitorTransform.__call__s{{4  rr)r)r4rrrrrrrrrrrrrrrrrrsK&> \\ \\  !rrcD^\rSrSrSrU4SjrU4SjrSrSrSr U=r $)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 c.>[TU]5 Xlgr)rrcontext)rrrs rrCythonTransform.__init__)s  rcp>SSKJn [X5(aURUl[TU]U5$)Nr) ModuleNode)rr0 directivescurrent_directivesrr)rr6rrs rrCythonTransform.__call__-s-* d ' '&*ooD #w%%rcnURnURUlURU5 X lU$r)rrr)rr6olds rvisit_CompilerDirectivesNode,CythonTransform.visit_CompilerDirectivesNode3s2%%"&// t$"% rc(URU5 U$rrrs r visit_NodeCythonTransform.visit_Node:rr)rr) r4rrrrrrrrrrrs@rrr"s! & rrc8\rSrSrSrSrSrSrSrSr Sr g ) ScopeTrackingTransformi?cBSUlXlURU5 U$)Nmodule scope_type scope_noderrs rvisit_ModuleNode'ScopeTrackingTransform.visit_ModuleNodeDs!" t$ rcURUR4nX lXlURU5 UuUlUlU$rr)rr6rprevs r visit_scope"ScopeTrackingTransform.visit_scopeJs?/$ t$+/( rc&URUS5$)Ncclassrrs rvisit_CClassDefNode*ScopeTrackingTransform.visit_CClassDefNodeRh//rc&URUS5$)Npyclassrrs rvisit_PyClassDefNode+ScopeTrackingTransform.visit_PyClassDefNodeUsi00rc&URUS5$)Nfunctionrrs rvisit_FuncDefNode(ScopeTrackingTransform.visit_FuncDefNodeXsj11rc&URUS5$)Nstructrrs rvisit_CStructOrUnionDefNode2ScopeTrackingTransform.visit_CStructOrUnionDefNode[rr)rrN) r4rrrrrrrrrrrrrrr?s  0120rrct^\rSrSrSrU4SjrSrSrSrSr Sr S r S r S r S rS rSrSrSrU=r$) EnvTransformi_z8 This transformation keeps a stack of the environments. cf>/UlURXR5 [TU]U5$r) env_stack enter_scopescoperr)rrrs rrEnvTransform.__call__cs, zz*w%%rc&URSS$)Nrfrrrs r current_envEnvTransform.current_envh~~b!!$$rc&URSS$)Nrfrrrs rcurrent_scope_nodeEnvTransform.current_scope_nodekrrc>UR5R5$r)r global_scopers rrEnvTransform.global_scopens!..00rc<URRX45 gr)rr+)rr6rs rrEnvTransform.enter_scopeqs tm,rc8URR5 gr)rrrs r exit_scopeEnvTransform.exit_scopets rcURU5 URXR5 URUSURS9 UR 5 U$)N)rr)visit_func_outer_attrsr local_scoper outer_attrsrrs rrEnvTransform.visit_FuncDefNodewsN ##D) //0 4tT5E5EF  rc6URXRS9 g)N)r)rrrs rr#EnvTransform.visit_func_outer_attrs~s 4'7'78rc(URU5 U$rrrs rvisit_GeneratorBodyDefNode'EnvTransform.visit_GeneratorBodyDefNoderrc~URXR5 URU5 UR5 U$rrrrrrs rvisit_ClassDefNodeEnvTransform.visit_ClassDefNode1 zz* t$  rc~URXR5 URU5 UR5 U$rrrs rr(EnvTransform.visit_CStructOrUnionDefNoderrcUR(a>URXR5 URU5 UR5 U$URU5 U$r) expr_scoperrrrs rvisit_ScopedExprNode!EnvTransform.visit_ScopedExprNodesO ??   T?? 3  " "4 ( OO    " "4 ( rcVUR(aURVs/sH o"S:wdM UPM nnURX5 URXR 5R 5 UR US5 UR5 U$URU5 U$s snf)Ndefault)r)rrrrr outer_scoperr)rr6r<rs rvisit_CArgDeclNodeEnvTransform.visit_CArgDeclNodes <<&*&6&6L&6d):KT&6EL  " "4 /   T#3#3#5#A#A B   t\ 2 OO    " "4 ( Ms B&B&r)r4rrrrrrrrrrrrr rrrrrrrs@rrr_sN& %%1-9    rrc>^\rSrSrSrU4SjrSrSrSrSr U=r $)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. c.>[TU]"U6 0Ulgr)rr _replacements)rargsrs rrNodeRefCleanupMixin.__init__s $rcURnX R;aURU5 URRX"5UlU$r)argr!rrD)rr6r%s rvisit_CloneNode#NodeRefCleanupMixin.visit_CloneNodesBhh (( (   s #%%))#3 rcURnUbX R;aURU5 URnUb URRX"5UlU$r) expressionr!rrD)rr6exprs rvisit_ResultRefNode'NodeRefCleanupMixin.visit_ResultRefNodesU <4'9'99   t $??D  "0044T@DO rc"X RU'U$rr!)rr6 replacements rreplaceNodeRefCleanupMixin.replaces#.4 rr.) r4rrrrrr&r+r0rrrs@rrrs! 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__ __contains__)^in__not____inv____neg____pos__)not~rJr:c`\rSrSrSrSrSrSrSrSr Sr S r S r S r S rS rSrSrg)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 ctURU5 URnURR(dU$URn[ U[ R5(dU$URnU(a![ U[ R5(dU$URnURXXT5$r) rrrg is_pyobjectpositional_argsr0r TupleNode keyword_argsDictNoder"_dispatch_to_handler)rr6r arg_tupler\r"s rvisit_GeneralCallNode/MethodDispatcherTransform.visit_GeneralCallNodes t$==}}((K(( )Y%8%899K((  <9K9K L LK~~((LLrc$URU5 URnURR(a:URn[ U[ R5(dU$URnO URnURXUS5$r) rrrgrYr_r0rr[r"r^)rr6rr_r"s rvisit_SimpleCallNode.MethodDispatcherTransform.visit_SimpleCallNodesn t$== == $ $Ii)<)<== >>D99D((tDDrclUR(aURU5 U$URU5$r)cascader_visit_binop_noders rvisit_PrimaryCmpNode.MethodDispatcherTransform.visit_PrimaryCmpNodes- <<  " "4 (K%%d++rc$URU5$r)rgrs rvisit_BinopNode)MethodDispatcherTransform.visit_BinopNodes%%d++rc URU5 [UR5nU(aURURpCUS:XaXCpCO>US:Xa8[ R UR5RR;aSnURnUR(a URnOSnURUSSUUSX4/S5nU$)NrMr? __truediv__objectF)r'find_special_method_for_binary_operatoroperatoroperand1operand2r divisionrrfuture_directivesrgis_builtin_typename_dispatch_to_method_handler)rr6special_method_namerrrsobj_type type_names rrg+MethodDispatcherTransform._visit_binop_nodes t$EdmmT !% h"n4%-($ 1??d&6&6&8&@&@&R&RR*7'}}H''$MM $ 33#T5)dX0$8D rc URU5 [UR5nU(aQURnURnUR (a UR nOSnURUSSUUSU/S5nU$)NroF)r&find_special_method_for_unary_operatorrqoperandrgrvrwrx)rr6ryrrzr{s rvisit_UnopNode(MethodDispatcherTransform.visit_UnopNode1sv t$DT]]S llG||H''$MM $ 33#T5)dWIt-D rcUR5(dgU(aSOSn[USUSU3S5nUc[USU3S5nU$)Ngeneralsimple_handle_r! _handle_any_)isasciir&)r match_name has_kwargs call_typehandlers r _find_handler'MethodDispatcherTransform._find_handlerBsW!!##!+I $(9+Qzl CTJ ?dl:,$?FGrcURSnURnUR(a7UR(a#[ URR 5S:aU$OyUR (afURR(aKURR(a-[ URRR 5S:aU$OU$URXX45$)Nrr) cf_staterhsis_nameentryr1cf_assignments is_attributermr^)rr6rarg_listkwargs assignmentr=s r_delegate_to_assigned_value5MethodDispatcherTransform._delegate_to_assigned_valueMs&&q)  ==;;#ekk&@&@"AA"E #F  EII$5$599??c%))//*H*H&IA&M 'NK(( + +rc <UR(GaUR(dU$URnUR=(d8 XPR5R 5R UR 5LnU(dUR(a-URR(aURXX45$U(aUR(aUR(aURRR(abURRUSRLa<URUR SSURRR XX4S9$U$UR!SUR 3U5nUcUR#XR X#U5$U(a U"XX45$U"XU5$UR$(Ga>UR&nURR((a UR*n OfUR,(aSUR(aBURR.nU(aUR(dU$UR,n USSnOU$U Rn Sn U R(aoU [0R2LaGU R(a6U(a/USRR((aU R n Sn Sn O U R n U S:XaSn OS n URXXXX45$U$) NrT)self_argis_unbound_methodr{r6rrr function_rFstrunicodero)rr is_builtinr builtin_scope lookup_hererwr is_singler is_cmethodr parent_typervrgrxr_handle_functionrr^rYrmr as_variabler type_type) rr6rrrrrfunction_handler attr_namerrzrr{s rr^.MethodDispatcherTransform._dispatch_to_handler]s    >> NNE  W))+99;GG VV $$):):)D)D ;;:: 0 0U[[U[[E\E\ElEl{{..(1+2B2BB#??!JJ&+kk&=&=&B&B!%8 @ \\ #11HMM?+V 5 ',,T==(V\]]'II'AA  " " " **I}}((#<<x~~ 22E$4$4K99#AB< }}H % ''w000X5E5E(W_`aWbWgWgWsWs!) I#H(,% ( I% )I$ 33%62 2Krc $URSUSU3U5n U cFU[R;dUS;aURSU3U5n U cURXTXXsU5$UbU/[ U5-nU(a U "XVXsU5n U $U "XVXs5n U $)Nmethod_r!)__new__rslot)rrspecial_method_names_handle_methodr%) rrrrr{r6rrrmethod_handlerrs rrx5MethodDispatcherTransform._dispatch_to_method_handlers++i[) -v7  !Y;;; $<>[TU]5 XsUlUlgr)rr orig_nodenew_node)rrrrs rrRecursiveNodeReplacer.__init__s (1% rcXRLa UR$URURLaURUlU$r)rrr%rs rr&%RecursiveNodeReplacer.visit_CloneNodes6 >> !== 88t~~ %}}DH rc\URU5 XRLa UR$U$r)rrrrs rr RecursiveNodeReplacer.visit_Nodes) t$ >> !== Kr)rr) r4rrrrrr&rrrrs@rrrs<rrc*[X5nU"U5 gr)r)treeold_noder replace_ins rrecursively_replace_noders&x:Jtrc2^\rSrSrSrU4SjrSrSrU=r$) NodeFinderiz* Find out if a node appears in a subtree. c<>[TU]5 XlSUlg)NF)rrr6found)rr6rs rrNodeFinder.__init__s   rczUR(agXRLaSUlgURUSS5 g)NT)rr6rrs rrNodeFinder.visit_Nodes/ ::  YY DJ   dD 1r)rr6) r4rrrrrrrrrs@rrrs 22rrcR[U5nURU5 UR$r)rrwr)rr6finders r tree_containsrs"  F LL <<rcJUup#nUc [X#U5 gU[X#5U'g)zcReplaces a node. ptr is of the form used on the access path stack (parent, attrname, listidx|None) N)rr&)ptrr=r]rlistidxs r replace_noders,!$Fg%(-2!'*rcP\rSrSrSrS SjrSrSrSSjrSr S r S r S r S r g) PrintTreeizPrints a representation of the tree to standard output. Subclass and override repr_of to provide more information about nodes. Nc[RU5 SUlUcUbU=(d SU=(d S4UlgSUlg)NrTri@)r r_indent _line_range)rstartends rrPrintTree.__init__s>T"   % CL59D #D rc.U=RS- slg)Nz rrs rindentPrintTree.indents  rc,URSSUlg)Nrrs runindentPrintTree.unindents||CR( rcD[SU-5 URU5 U$)NzParse tree dump at phase '%s')rjrw)rrphases rrPrintTree.__call__s! -56 4 rcURU5 UR5 URU5 UR5 U$r) _print_noderrrrs rrPrintTree.visit_Nodes5   4   rc URU5 UR5 URSnURb*URSUs=::aURS::a<O O9[ UR <SS<SUR UR5<35 UR5 URUR5 UR5 UR5 U$)Nrr- r%: ) rrrrrjrrepr_ofr%rr)rr6lines rr&PrintTree.visit_CloneNode$s  xx{    #t'7'7':d'YdFVFVWXFY'Y $,,t||DHH7MN O  488$   rc dURSnURb*URSUs=::aURS::amO g[UR5S:XaSnOURSupEnUbSXV4-nOUn[ UR <SU<SUR U5<35 gg)Nrrz(root)rfz%s[%d]rr)rrr1rrjrr)rr6rrwr]r<rs rrPrintTree._print_node0sxx{    #t'7'7':d'YdFVFVWXFY'Y4##$)$($4$4R$8!c?#tk1DD $,,dll46HI J(Zrc UcgURRn[U[R5(a-US[ UR 5<SUR<S3- nU$[U[R5(aUSUR-- nU$[U[R5(a)USUR5<S[USS5<S3- nU$[U[R5(a-US[ UR 5<S UR<S3- nU$[U[R[R 45(a-US[ UR 5<S UR"<S 3- nU$[U[R$5(aUR nUS [ U5-- nU$UR&(akUR&nUS R)5nSU;aUR+S5SnSU;aUR+S5SnUSU<SUS<SUS<S3- nU$)Nz(none)z(type=z, name="z")z (name="%s")z(name="z ", type="rgz , attribute="z, value=r$z (type=%s)rr>rf\z(pos=(rrr z)))rr4r0rNameNoder3rgrwrDefNode CFuncDefNode declared_namer& AttributeNoder^ ConstNode PyConstNoder=ExprNoderr*split)rr6rtrr(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!fc!fEEMr)rrrr)r4rrrrrrrrrr&rrrrrrrrs0$)  Krr__main__)&rWrhrTrrrrrr r rdeclaretuplebytesrintfloatcomplexr2r rrrrrrDrpr~rWrrrrrrr4doctesttestmodrrrr s  ^^EE3UG#D E FFR=!{=!@&:0_0@E?EP  F+(+(+ (+ ( +  ( + ( +)+)+)+ .+ ,+)+)+(+ )+  ,!+")#+$  '+(#)(0     * # 'W Wt,. 22"3W Wr z OOr