BVh (dZddlZddlZddlmZddlmZddlmZGddeZddZ Gd d ejZ d Z d Z Gd dejZdZdZdZy)zAST manipulation utilities.N)anno)parser) qual_namesc(eZdZdZfdZdZxZS) CleanCopierz0NodeTransformer-like visitor that copies an AST.c8tt| ||_yN)superr__init__preserve_annos)selfr __class__s Y/home/dcms/DCMS/lib/python3.12/site-packages/tensorflow/python/autograph/pyct/ast_util.pyr zCleanCopier.__init__s +t%'(Dct|tr|Dcgc]}j|c}St|trtfd|DSt|tj t j fs|St|tj t j fsJi}|jD]?}|jdrt||s"jt||||<At|di|}jr(jD]}tj||||Scc}w)zDReturns a deep copy of node (excluding some fields, see copy_clean).c3@K|]}j|ywr )copy).0nr s r z#CleanCopier.copy..'s.A499Q<.__) isinstancelistrtuplegastASTast_fields startswithhasattrgetattrtyper rcopyanno)r noder new_fieldsfnew_nodeks` rrzCleanCopier.copy!s$$( )qdiil )) D% .. .. txx1 2k dTXXsww/ 00 0J \\4 \\$ GD!$4 '$"23 1 4tDz'J'H "")! dHa() O'*sE)__name__ __module__ __qualname____doc__r r __classcell__)rs@rrrs8)rrc6t|j|S)a"Creates a deep copy of an AST. The copy will not include fields that are prefixed by '__', with the exception of user-specified annotations. Args: node: ast.AST preserve_annos: Optional[Set[Hashable]], annotation keys to include in the copy Returns: ast.AST )rr)r&r s r copy_cleanr1;s ^ $ ) )$ //rc@eZdZdZdZdZdZdZdZdZ dZ d Z y ) SymbolRenamerz6Transformer that can rename symbols to a simple names.c||_yr )name_map)r r5s rr zSymbolRenamer.__init__Ns DMrcttj|tjj}||jvrlt j t|j||jdd}tj|D]}tj||||S|j|S)N)ctx annotation type_comment) rgetannoBasicQNr5rNamestrr7keysr% generic_visit)r r&qnr)r*s r_process_name_nodez SymbolRenamer._process_name_nodeQs dDJJMM *B T]] dmmB hh h yy)! dHa() o   d ##rctt|D]D}tj||}||jvs*t |j|||<F|Sr )rangelenrr<r5r>)r namesirAs r_process_list_of_stringsz&SymbolRenamer._process_list_of_strings_sV 3u: * ==q "b t}} t}}R()a* LrcF|j|j|_|Sr rHrFr r&s rvisit_NonlocalzSymbolRenamer.visit_Nonlocalf..tzz:DJ KrcF|j|j|_|Sr rJrKs r visit_GlobalzSymbolRenamer.visit_GlobaljrMrc$|j|Sr )rBrKs r visit_NamezSymbolRenamer.visit_Namens  " "4 ((rctj|tjjr|j |S|j |Sr )rhasannor;r<rBr@rKs rvisit_AttributezSymbolRenamer.visit_Attributeqs: ||D$**--(  $ $T **   d ##rctj|j}||jvrt |j||_|j |Sr )rr<namer5r>r@)r r&rAs rvisit_FunctionDefzSymbolRenamer.visit_FunctionDefwsF tyy !B T]]dmmB'(di   d ##rN) r+r,r-r.r rBrHrLrOrQrTrWrrrr3r3Ks-> $)$ $rr3ct|t|tr|Dcgc]}j|c}St|trt fd|DSj|Scc}w)z;Renames symbols in an AST. Requires qual_names annotations.c3@K|]}j|ywr )visit)rrrenamers rrz!rename_symbols..s0aq!0r)r3rrrZr)r&r5rr[s @rrename_symbolsr\~s` ( #'d&* +GMM!  ++$ 040 00 t  ,sA1cg}g}|D]M}|jtj|jd|j|jOtj ||S)z1Converts a list of ast.keyword objects to a dict.N)kind)r?values)appendrConstantargvalueDict)keywordsr?r_kws rkeywords_to_dictrgsY $ & bKK bff401 MM"(( V ,,rc.eZdZdZdZdZdZdZdZy)PatternMatcherz7Matches a node against a pattern represented by a node.c.||_g|_d|_y)NT)pattern pattern_stackmatches)r rks rr zPatternMatcher.__init__sDLDDLrc|jj|j||_|j||jj |_yr )rlr`rkr@pop)r r&rks rcompare_and_visitz PatternMatcher.compare_and_visitsEdll+DLt%%))+DLrcd|_y)NF)rm)r s rno_matchzPatternMatcher.no_matchs DL rct|ttfrt|dk(r|\}t|tj r|j dk(ry|dk(ryy)N_TF)rrrrErr=id)r ps r is_wildcardzPatternMatcher.is_wildcardsI!dE]#A! ba!TYYADDCK Cx  rc|jsy|j}|jD]}|jdrt ||s+t ||rt ||r|j cSMt ||s|j cSt ||}t ||}|j|rt|ttfrgt|ttfrt|t|k7r|j cSt||D]\}}|j||t|tjt jfrPt|t#|s't|t#|s|j cS|j||||k7s|j cSy)Nr)rmrkr r!r"r#rrrxrrrrEziprprrrr$)r r&rkr(vrwv_itemp_items rr@zPatternMatcher.generic_visitse << llG \\! d  T1  7A 77A#6  Wa }} $ a '1 a  !  Ae} %!dE]+s1vQ/? !!Qi 1NFF   0 1 a$((CGG, -!T!W%jDG.D  q!$ 6 ;!rN) r+r,r-r.r rprrrxr@rrrriris? , "!rrict|trtj|}t |}|j ||j S)a5Basic pattern matcher for AST. The pattern may contain wildcards represented by the symbol '_'. A node matches a pattern if for every node in the tree, either there is a node of the same type in pattern, or a Name node with id='_'. Args: node: ast.AST pattern: ast.AST Returns: bool )rr>r parse_strrirZrm)r&rkmatchers rrmrms>w'G 7 #' -- rc.t|ttfs|f}|D]}t|tjtj frt t|jD]}|j|}t|tjtj fr|j|}nHtjt|}tj||tj}t||||||y)aApplies a function to each individual assignment. This function can process a possibly-unpacked (e.g. a, b = c, d) assignment. It tries to break down the unpacking if possible. In effect, it has the same effect as passing the assigned values in SSA form to apply_fn. Examples: The following will result in apply_fn(a, c), apply_fn(b, d): a, b = c, d The following will result in apply_fn(a, c[0]), apply_fn(b, c[1]): a, b = c The following will result in apply_fn(a, (b, c)): a = b, c It uses the visitor pattern to allow subclasses to process single assignments individually. Args: targets: Union[List[ast.AST, ...], Tuple[ast.AST, ...], ast.AST, should be used with the targets field of an ast.Assign node values: ast.AST apply_fn: Callable[[ast.AST, ast.AST], None], called with the respective nodes of each single assignment )r7N)rrrrTupleListrDrEeltsrparse_expressionr> SubscriptLoadapply_to_single_assignments)targetsr_apply_fntargetrG target_elvalue_elidxs rrrs> GdE] +jG f&4::tyy12S%&C!KKN ftzz4995 6[[^(''A/#^^FCTYY[A(#IxBCvv rc#Kt|ttfr t|}n|g}t|ttfr t|}n|g}|r|rt|t|k(sJ|j }|j }t|t j tj tfs|^t|t j tj tfs|-|jj|jjk7rEtdj||jj||jj||ft|trt|tsJdB| |JdO|jD]$}t||d}t||d}|jds||4t|ttfrlt|ttfrt|t|k7rtdj||||j!||j!|t|tj t j fr$|j#||j#|||k7s tdj||||r|ryyyyw)a!Walks two ASTs in parallel. The two trees must have identical structure. Args: node: Union[ast.AST, Iterable[ast.AST]] other: Union[ast.AST, Iterable[ast.AST]] Yields: Tuple[ast.AST, ast.AST] Raises: ValueError: if the two trees don't have identical structure. Nz'inconsistent nodes: {} ({}) and {} ({})z(The check above should have ensured thisrz+inconsistent values for field {}: {} and {})rrrrErorrrr>rr+ ValueErrorformatr r#r!extendr`) r&other node_stack other_stackror(n_childo_childs r parallel_walkrshtUm$dJJe}%u+K'K{ z?c+. .. .AA CGGTXXs3 4 CGGTXXs3 4  4 44 @GG Q[[ ! !1akk&:&:< == Q$J!S 3 K!KK y YBBBY YY&1d#g1d#g d w'/ GdE] +7T5M2 LCL (;BBWg'( ( '"7# g#''2 3'"7# g  9 @ @7G %& &)&) { { sJ/K3!KKr )r.rr tensorflow.python.autograph.pyctrrrobjectrr1NodeTransformerr3r\rg NodeVisitorrirmrrrrrrsl" 137&B 0 0$D((0$f-=!T%%=!@,,^A&r