o ?e (@sdZddlZddlZddlmZddlmZddlmZGdddeZddd Z Gd d d ej Z d d Z ddZ GdddejZddZddZddZdS)zAST manipulation utilities.N)anno)parser) qual_namescs(eZdZdZfddZddZZS) CleanCopierz0NodeTransformer-like visitor that copies an AST.cstt|||_dSN)superr__init__preserve_annos)selfr  __class__j/home/www/facesmatcher.com/pyenv/lib/python3.10/site-packages/tensorflow/python/autograph/pyct/ast_util.pyrs zCleanCopier.__init__cst|trfdd|DSt|trtfdd|DSt|tjtjfs)|St|tjtjfs4Ji}|jD]}|dsOt||rO t ||||<q9t |di|}j rij D] }t |||q_|S)zDReturns a deep copy of node (excluding some fields, see copy_clean).cg|]}|qSr copy.0nr r r %z$CleanCopier.copy..c3|]}|VqdSrrrrr r 'z#CleanCopier.copy..__Nr ) isinstancelisttuplegastASTast_fields startswithhasattrrgetattrtyper rcopyanno)r node new_fieldsfnew_nodekr rrr!s"    zCleanCopier.copy)__name__ __module__ __qualname____doc__rr __classcell__r r r rrs rcCst||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 r r r copy_clean;s r2c@sPeZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ dS) SymbolRenamerz6Transformer that can rename symbols to a simple names.cCs ||_dSr)name_map)r r4r r rrN zSymbolRenamer.__init__cCsdt|tjj}||jvr-tjt|j||jddd}t |D] }t |||q!|S| |S)N)ctx annotation type_comment) rZgetannoBasicQNr4rNamestrr6keysr' generic_visit)r r(qnr+r,r r r_process_name_nodeQs   z SymbolRenamer._process_name_nodecCs@tt|D]}t||}||jvrt|j|||<q|Sr)rangelenrr:r4r<)r namesir?r r r_process_list_of_strings_s  z&SymbolRenamer._process_list_of_stringscC||j|_|SrrErCr r(r r rvisit_NonlocalfzSymbolRenamer.visit_NonlocalcCrFrrGrHr r r visit_GlobaljrJzSymbolRenamer.visit_GlobalcCs ||Sr)r@rHr r r visit_Namenr5zSymbolRenamer.visit_NamecCs$t|tjjr ||S||Sr)rZhasannor9r:r@r>rHr r rvisit_Attributeqs  zSymbolRenamer.visit_AttributecCs0t|j}||jvrt|j||_||Sr)rr:namer4r<r>)r r(r?r r rvisit_FunctionDefws   zSymbolRenamer.visit_FunctionDefN) r-r.r/r0rr@rErIrKrLrMrOr r r rr3Ks r3csNt|t|trfdd|DSt|tr"tfdd|DS|S)z;Renames symbols in an AST. Requires qual_names annotations.crr visitrZrenamerr rrrz"rename_symbols..c3rrrPrrRr rrrz!rename_symbols..)r3rrrrQ)r(r4r rRrrename_symbols~s    rScCsBg}g}|D]}|tj|jdd||jqtj||dS)z1Converts a list of ast.keyword objects to a dict.N)kind)r=values)appendrConstantargvalueDict)keywordsr=rUkwr r rkeywords_to_dicts r]c@s8eZdZdZddZddZddZdd Zd d Zd S) PatternMatcherz7Matches a node against a pattern represented by a node.cCs||_g|_d|_dS)NT)pattern pattern_stackmatches)r r_r r rrs zPatternMatcher.__init__cCs.|j|j||_|||j|_dSr)r`rVr_r>pop)r r(r_r r rcompare_and_visits z PatternMatcher.compare_and_visitcCs d|_dS)NF)rarr r rno_matchszPatternMatcher.no_matchcCsJt|ttfrt|dkr|\}t|tjr|jdkrdS|dkr#dSdS)N_TF)rrrrBrr;id)r pr r r is_wildcardszPatternMatcher.is_wildcardcCsD|jsdS|j}|jD]}|drq t||s)t||r(t||r(|Sq t||s4|St||}t||}||rDq t|t t frqt|t t frZt |t |kr`|St ||D] \}}| ||qeq t|tjtjfrt|t|st|t|s|S| ||q ||kr|Sq dS)Nr)rar_r"r#r$r%rdrirrrrBziprcrr r!r&)r r(r_r*vrhZv_itemZp_itemr r rr>s<            zPatternMatcher.generic_visitN) r-r.r/r0rrcrdrir>r r r rr^s r^cCs,t|tr t|}t|}|||jS)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<rZ parse_strr^rQra)r(r_Zmatcherr r rras  racCst|ttfs |f}|D]F}t|tjtjfrMtt|jD]-}|j|}t|tjtjfr4|j|}nt t |}tj ||t d}t|||qq |||q dS)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 )r6N)rrrrTupleListrArBeltsrZparse_expressionr< SubscriptLoadapply_to_single_assignments)targetsrUZapply_fntargetrDZ target_elZvalue_elidxr r rrqs   rqc cst|ttfr t|}n|g}t|ttfrt|}n|g}|r|rt|t|ks-J|}|}t|tjtjtfsC|dusYt|tjtjtfsQ|dusY|j j |j j krgt d ||j j ||j j ||fVt|tr{t|tszJdq|dur|dusJdq|j D]g}t||d}t||d}|ds|dus|durqt|ttfrt|ttfrt|t|krt d |||||||qt|tjtjfr||||q||krt d |||q|r|s#dSdSdSdS)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 {})rrrrBrbr!r rr<r r- ValueErrorformatr"r%r#extendrV) r(otherZ node_stackZ other_stackror*Zn_childZo_childr r r parallel_walksn           rzr)r0r!rZ tensorflow.python.autograph.pyctrrrobjectrr2NodeTransformerr3rSr] NodeVisitorr^rarqrzr r r rs    !3  @ /