[;j}jddlZddlZddlmZddlmZddlmZddlmZddlmZddlmZdd lm Z ddl Z e je e eeeefZGd d ZGd d eZGddeZGddeZGddeZGddZiddddddddddd d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:j2Zd;dd?j2ZGd@dAeZGdBdCeZdDZGdEdFeZdGZ dHZ!GdIdJeZ"e#dKk(rddl$Z$e$jJyy)LN) TypeSlots)Builtin)Nodes) ExprNodes)Errors) DebugFlags)FutureceZdZdZfdZdZdZdZejdZ dZ ejdZ ejd Z d d Zejd ZxZS) 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>t|i|_g|_yN)super__init__dispatch_table access_path)self __class__s `G:\00. PROJECTS\API\Inventory\templateJSON\kerjaOCR\Lib\site-packages\Cython/Compiler/Visitor.pyrzTreeVisitor.__init__Ds  ct|jxsggdz}g}t|dd}|rS|d}|r-ddl}|jj |j }|j|d|dd|dt|}|D]}||vr|jds|jdr+ t||} | | dk(r@t| trdt| z} nt| tspt| } |j|d | |j j"d d j%|d S#t$rYwxYw) N) child_attrspos gil_message cpp_messagesubexprsrr:r_z[...]/%d = (z, ))listrgetattros.pathpathbasenameget_descriptionappenddir startswithendswithAttributeError isinstancelen _PRINTABLEreprr__name__join) rnodeignoredvaluesrsourceosattribute_namesattrvalues r dump_nodezTreeVisitor.dump_nodeIsKt''-2.2LLdE4( VF))&*@*@*BC MMAA? @d)#Dws#t}}S'9 d+} E4("SZ/z2U  MMtU3 4#$$ >>22INN64JKK"  s< E EEcddl}|}g}t|dr|j}|jj d}t |t jr_|j}|j}|jj|j|jf} |j||| f|}|j}t|dr||fS)Nrtb_framer)r%hasattrr>f_localsgetr.rNodef_codeco_namer&r' co_filenamef_linenor)tb_next) r stacktracer8last_tracebacknodesframer4code method_namers r_find_node_pathzTreeVisitor._find_node_pathis#j*-''E>>%%f-D$ +||"ll ww''(8(89~~' dK56!+#++Jj*-&&rc <dg}|jD]_\}}}t||}|d}n ||}d|z}|j|jjd||d|j |a|j tjd\}} |} | D]5\}} } |} |jd| d| d| |j |fz7tjt| d d|jjd j|||) Nz[%d].r rzFile '%s', line %d, in %s: %srrr ) rr$r)rr2r<rNsysexc_infor CompilerCrashr3) rchildetraceparent attributeindexr4rH called_nodes last_noderMrs r_raise_compiler_errorz!TreeVisitor._raise_compiler_errorzs((,(8(8 $FIu69-D}E{ LL  ))9et$& ')9$(#7#7 q8I#J L &2 "D+sI LL8AA T^^D-A$&&D T%6"twFD)E ;$&XabgXh"iXhfcST4#3#3AvtS#IXhK"i"&"2"25&$"MK)+t<reikq>rr<*t ' #jsB-NN)r2 __module__ __qualname____doc__rr<rNr^cythonfinalrmrqrpr}rr __classcell__rs@rr r s)T L@'"-, \\RR   \\//$ \\; \\rr cveZdZdZd dZej d dZej dZd dZ dZ dZ y) 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(|j|||Sr_process_childrenrs rrzVisitorTransform.visitchildrens%%feW==rc|j|||}|jD]4\}}t|tur|j |}t |||6|Sr)ritemsrbr# _flatten_listsetattr)rrYrrr|r:newnodes rrz"VisitorTransform._process_childrens[$$VUG<#\\^MD'G}$,,W5 FD' *, rcg}|D]9}|t|tur|j|)|j|;|Sr)rbr#extendr))r orig_listnewlistrs rrzVisitorTransform._flatten_listsBA}7d?NN1%NN1%  rcpt||}|'|j||||}||ur t||||}|Sr)r$r}r)rrYr:r{rVr4s r visitchildzVisitorTransform.visitchildsH%  ##E64=D5 d+E rc(|j||Srrrr4s rrecurse_to_childrenz$VisitorTransform.recurse_to_children t$ rc$|j|Srro)rroots r__call__zVisitorTransform.__call__s{{4  rr)r) r2rrrrrrrrrrrrrrrsK&> \\ \\  !rrc8eZdZdZfdZfdZdZdZxZS)CythonTransformz 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 c0t|||_yr)rrcontext)rrrs rrzCythonTransform.__init__)s  rchddlm}t||r|j|_t||S)Nr) ModuleNode)rr. directivescurrent_directivesrr)rr4rrs rrzCythonTransform.__call__-s,* dJ '&*ooD #w%%rcp|j}|j|_|j|||_|Sr)rrr)rr4olds rvisit_CompilerDirectivesNodez,CythonTransform.visit_CompilerDirectivesNode3s4%%"&// t$"% rc(|j||Srrrs r visit_NodezCythonTransform.visit_Node:rr) r2rrrrrrrrrs@rrr"s & rrc0eZdZdZdZdZdZdZdZy)ScopeTrackingTransformcDd|_||_|j||S)Nmodule scope_type scope_noderrs rvisit_ModuleNodez'ScopeTrackingTransform.visit_ModuleNodeDs#" t$ rc|j|jf}||_||_|j||\|_|_|Srr)rr4rprevs r visit_scopez"ScopeTrackingTransform.visit_scopeJsC/$ t$+/( rc&|j|dS)Ncclassrrs rvisit_CClassDefNodez*ScopeTrackingTransform.visit_CClassDefNodeRh//rc&|j|dS)Npyclassrrs rvisit_PyClassDefNodez+ScopeTrackingTransform.visit_PyClassDefNodeUsi00rc&|j|dS)Nfunctionrrs rvisit_FuncDefNodez(ScopeTrackingTransform.visit_FuncDefNodeXsj11rc&|j|dS)Nstructrrs rvisit_CStructOrUnionDefNodez2ScopeTrackingTransform.visit_CStructOrUnionDefNode[rrN) r2rrrrrrrrrrrrr?s  0120rrcjeZdZdZfdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZxZS) EnvTransformz@ This transformation keeps a stack of the environments. chg|_|j||jt||Sr) env_stack enter_scopescoperr)rrrs rrzEnvTransform.__call__cs. tzz*w%%rc&|jddS)Nrarrrs r current_envzEnvTransform.current_envh~~b!!$$rc&|jddS)Nrarrrs rcurrent_scope_nodezEnvTransform.current_scope_nodekrrc>|jjSr)r global_scopers rrzEnvTransform.global_scopens!..00rc>|jj||fyr)rr))rr4rs rrzEnvTransform.enter_scopeqs tUm,rc8|jjyr)rryrs r exit_scopezEnvTransform.exit_scopets rc|j||j||j|j|d|j|j |S)N)rr)visit_func_outer_attrsr local_scoper outer_attrsrrs rrzEnvTransform.visit_FuncDefNodewsP ##D) t//0 4tT5E5EF  rc>|j||jy)N)r)rrrs rrz#EnvTransform.visit_func_outer_attrs~s 4t'7'78rc(|j||Srrrs rvisit_GeneratorBodyDefNodez'EnvTransform.visit_GeneratorBodyDefNoderrc|j||j|j||j|Srrrrrrs rvisit_ClassDefNodezEnvTransform.visit_ClassDefNode3 tzz* t$  rc|j||j|j||j|Srrrs rrz(EnvTransform.visit_CStructOrUnionDefNoderrc|jr?|j||j|j||j|S|j||Sr) expr_scoperrrrs rvisit_ScopedExprNodez!EnvTransform.visit_ScopedExprNodesQ ??   T4?? 3  " "4 ( OO    " "4 ( rcH|jr|jDcgc] }|dk7s | }}|j|||j||j j |j |d|j|S|j||Scc}w)Ndefault)r)rrrrr outer_scoperr)rr4r:rs rvisit_CArgDeclNodezEnvTransform.visit_CArgDeclNodes <<&*&6&6L&6d$):KT&6EL  " "4 /   T4#3#3#5#A#A B   t\ 2 OO    " "4 ( Ms BB)r2rrrrrrrrrrrrrrrrrrs@rrr_sI& %%1-9   rrc4eZdZdZfdZdZdZdZxZS)NodeRefCleanupMixinas 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,t||i|_yr)rr _replacements)rargsrs rrzNodeRefCleanupMixin.__init__s $rc|j}||jvr|j||jj|||_|Sr)argrrrA)rr4rs rvisit_CloneNodez#NodeRefCleanupMixin.visit_CloneNodesFhh d(( (   s #%%))#s3 rc|j}|||jvr|j||j}|!|jj|||_|Sr) expressionrrrA)rr4exprs rvisit_ResultRefNodez'NodeRefCleanupMixin.visit_ResultRefNodesY <4t'9'99   t $??D  "0044T4@DO rc$||j|<|Sr)r)rr4 replacements rreplacezNodeRefCleanupMixin.replaces#.4 r) r2rrrrrrrrrs@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~rr cXeZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd Zy)MethodDispatcherTransforma 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 cP|j||j}|jjs|S|j}t |t js|S|j}|rt |t js|S|j}|j||||Sr) rrrb is_pyobjectpositional_argsr.r TupleNode keyword_argsDictNoder_dispatch_to_handler)rr4r arg_tupler,rs rvisit_GeneralCallNodez/MethodDispatcherTransform.visit_GeneralCallNodes t$==}}((K(( )Y%8%89K((  <9K9K LK~~((x|LLrc|j||j}|jjr5|j}t |t js|S|j}n |j}|j|||dSr) rrrbr)r/r.rr+rr.)rr4rr/rs rvisit_SimpleCallNodez.MethodDispatcherTransform.visit_SimpleCallNodesm t$== == $ $Ii)<)<= >>D99D((xtDDrcb|jr|j||S|j|Sr)cascader_visit_binop_noders rvisit_PrimaryCmpNodez.MethodDispatcherTransform.visit_PrimaryCmpNodes- <<  " "4 (K%%d++rc$|j|Sr)r5rs rvisit_BinopNodez)MethodDispatcherTransform.visit_BinopNodes%%d++rc |j|t|j}|r|j|j}}|dk(r||}}n;|dk(r6t j |jjjvrd}|j}|jr|js |j}nd}|j|dd||d||gd}|S)Nrr __truediv__objectF)r'find_special_method_for_binary_operatoroperatoroperand1operand2r divisionrrfuture_directivesrbis_builtin_typeis_exception_typename_dispatch_to_method_handler)rr4special_method_namer>r?obj_type type_names rr5z+MethodDispatcherTransform._visit_binop_nodes t$EdmmT !% hH"n4%-x($ 1??d&6&6&8&@&@&R&RR*7'}}H''0J0J$MM $ 33#T5)dXx0$8D rc |j|t|j}|rX|j}|j}|j r|j s |j}nd}|j|dd||d|gd}|S)Nr;F) r&find_special_method_for_unary_operatorr=operandrbrBrCrDrE)rr4rFrKrGrHs rvisit_UnopNodez(MethodDispatcherTransform.visit_UnopNode1s~ t$DT]]S llG||H''0J0J$MM $ 33#T5)dWIt-D rc~|jsy|rdnd}t|d|d|d}|t|d|d}|S)Ngeneralsimple_handle_r _handle_any_)isasciir$)r match_name has_kwargs call_typehandlers r _find_handlerz'MethodDispatcherTransform._find_handlerBsT!!#!+I $(9+Qzl CTJ ?dl:,$?FGrc|jd}|j}|jr0|jr"t |jj dkDrj|S|j rZ|jjrD|jjr,t |jjj dkDr|S|S|j||||S)Nrr) cf_staterhsis_nameentryr/cf_assignments is_attributerhr.)rr4rarg_listkwargs assignmentr;s r_delegate_to_assigned_valuez5MethodDispatcherTransform._delegate_to_assigned_valueMs&&q)  ==;;#ekk&@&@"AA"E   EII$5$599??c%))//*H*H&IA&M K(( %6+ +rc |jr|js|S|j}|jxs9||jj j |j u}|s|jr*|jjr|j||||S|r|jr|jr|jjjr|jjjsf|jj|djurA|j!|j dd|jjj ||||S|S|j#d|j |}||j%||j |||S|r |||||S||||S|j&r|j(}|jj*r |j,} nR|j.rD|jr8|jj0}|r |js|S|j.} |dd}n|S| j} d} | jrj| js^| t2j4ur8| jr,|r*|djj*r| j } d} d} n | j } | dk(rd} nd } |j!|| | | ||||S|S) NrT)self_argis_unbound_methodrHr4rr_r` function_rFstrunicoder;)r[r\ is_builtinr builtin_scope lookup_hererDrY is_singlerb is_cmethodr parent_typerBrCrbrErW_handle_functionr^rZr)rhr as_variabler type_type) rr4rr_r`r\rifunction_handler attr_namerdrGrerHs rr.z.MethodDispatcherTransform._dispatch_to_handler]s   >> NNE  W))+99;GG VV $$):):)D)D ;;h&::!1!1ekk //?? H_H_HqHq{{..(1+2B2BB#??!JJ&+kk&=&=&B&B!%8TZ @ \\ #11HMM?+V 5 ',,T8==(HV\]]'h&II'hAA  " " **I}}((#<<x~~ 22E$4$4K99#AB< }}H % ''0J0Jw000X5E5E(W_`aWbWgWgWsWs!) I#H(,% ( I% )I$ 338%6 h&2 2Krc |jd|d||} | D|tjvs|dvr|jd||} | |j|||||||S||gt |z}|r| |||||} | S| ||||} | S)Nmethod_r)__new__rslot)rWrspecial_method_names_handle_methodr#) rrsrdrerHr4rr_r`method_handlerr|s rrEz5MethodDispatcherTransform._dispatch_to_method_handlers++i[) -v7  !Y;;; $<> !== 88t~~ %}}DH rc\|j|||jur |jS|Sr)rrrrs rrz RecursiveNodeReplacer.visit_Nodes+ t$ 4>> !== Kr)r2rrrrrrrrs@rrrs<rrc,t||}||yr)r)treeold_noder replace_ins rrecursively_replace_noders&x:Jtrc(eZdZdZfdZdZxZS) NodeFinderz2 Find out if a node appears in a subtree. c>t|||_d|_y)NF)rrr4found)rr4rs rrzNodeFinder.__init__s   rcp|jry||jurd|_y|j|ddy)NT)rr4rrs rrzNodeFinder.visit_Nodes1 ::  TYY DJ   dD 1r)r2rrrrrrrs@rrrs 2rrcRt|}|j||jSr)rrqr)rr4finders r tree_containsrs"  F LL <<rcN|\}}}|t|||y|t|||<y)zkReplaces a node. ptr is of the form used on the access path stack (parent, attrname, listidx|None) N)rr$)ptrr;rYrzlistidxs r replace_noders2!$FHg%(-2!'*rcDeZdZdZd dZdZdZd dZdZdZ d Z d Z y) PrintTreezPrints a representation of the tree to standard output. Subclass and override repr_of to provide more information about nodes. Ncvtj|d|_|||xsd|xsdf|_yd|_y)NrPri@)r r_indent _line_range)rstartends rrzPrintTree.__init__s>T"   % CL59D #D rc.|xjdz c_y)Nz rrs rindentzPrintTree.indents  rc,|jdd|_y)Nrrs runindentzPrintTree.unindents||CR( rcDtd|z|j||S)NzParse tree dump at phase '%s')rerq)rrphases rrzPrintTree.__call__s! -56 4 rc|j||j|j||j|Sr) _print_noderrrrs rrzPrintTree.visit_Nodes5   4   rc |j||j|jd}|j(|jd|cxkr|jdkr9nn6t |j ddd|j |j|j|j|j|j|j|S)Nrr- r: ) rrrrrerrepr_ofrrr)rr4lines rrzPrintTree.visit_CloneNode&s  xx{    #t'7'7':d'YdFVFVWXFY'Y $,,t||DHH7MN O  488$   rc X|jd}|j(|jd|cxkr|jdkrjnyt|jdk(rd}n|jd\}}}|d||fz}n|}t |j d|d|j |yy)Nrrz(root)raz%s[%d]rr)rrr/rrerr)rr4rrDrYr:r{s rrzPrintTree._print_node2sxx{    #t'7'7':d'YdFVFVWXFY'Y4##$)$($4$4R$8!c?#tSk1DD $,,dll46HI J(Zrc &|y|jj}t|tjr+|dt |j d|jdz }|St|tjr|d|jzz }|St|tjr'|d|jdt|dddz }|St|tjr+|dt |j d |jdz }|St|tjtj fr+|dt |j d |j"d z }|St|tj$r|j }|d t |zz }|S|j&rd|j&}|d j)}d|vr|j+dd}d|vr|j+dd}|d|d|dd|ddz }|S)Nz(none)z(type=z, name="z")z (name="%s")z(name="z ", type="rbz , attribute="z, value=r"z (type=%s)rrra\z(pos=(rrrz)))rr2r.rNameNoder1rbrDrDefNode CFuncDefNode declared_namer$ AttributeNoderZ ConstNode PyConstNoder;ExprNoderr(split)rr4r|trr&s rrzPrintTree.repr_of?s <^^,,F$ 2 23d499otyyQQ,M+D%--0/DII55(M'D%"4"45&&('$*EGG$M!D)"9"9:4 ?DNN[[MD9#6#6 8M8M"NO4 ?DJJOOMD)"4"45II+Q//Mhh1v--/$;::c?2.D4<::d+B/Dc!fc!fEEMrrr) r2rrrrrrrrrrrrrrrrs0$)  Krr__main__)&rSrcrPrrrrrr r rdeclaretuplebytesrgintfloatcomplexr0r rrrrrrAr<rJr'rrrrrrr2doctesttestmodrrrrs  V^^EE3UG#D E FFR=!{=!@&:0_0@E?EP  F+(+(+ (+ ( +  ( + ( +)+)+)+ .+ ,+)+)+(+ )+  ,!+")#+$  '+(#)(0     * # 'Y Yx,. 22"3W Wr zGOOr