o Xi*@sdZddlmZgdZddlZddlZddlmZddlZ e e Z GdddeZ Gdd d e ZGd d d e jjZdddZdS)zAName fix pass for ensuring unique names for all values and nodes.) annotations) NameFixPass NameGeneratorSimpleNameGeneratorN)Protocolc@s eZdZd ddZd d d Zd S)rnodeir.NodereturnstrcCdS)%Generate a preferred name for a node.Nselfrr r P/home/ubuntu/.local/lib/python3.10/site-packages/onnx_ir/passes/common/naming.pygenerate_node_namez NameGenerator.generate_node_namevalueir.ValuecCr )&Generate a preferred name for a value.Nr rrr r rgenerate_value_namerz!NameGenerator.generate_value_nameNrrr r rrr r )__name__ __module__ __qualname__rrr r r rrs rc@s$eZdZdZd ddZdd d Zd S)rz)Base class for name generation functions.rrr r cC |jpdS)r rnamerr r rr# z&SimpleNameGenerator.generate_node_namerrcCr)rvrrr r rr'r z'SimpleNameGenerator.generate_value_nameNrr)rrr__doc__rrr r r rr s rcsleZdZdZ d)d*fdd Zd+d d Zd,ddZd-ddZd.dd Zd/d#d$Z d.d%d&Z d/d'd(Z Z S)0raPass for fixing names to ensure all values and nodes have unique names. This pass ensures that: 1. Graph inputs and outputs have unique names (take precedence) 2. All intermediate values have unique names (assign names to unnamed values) 3. All values in subgraphs have unique names within their graph and parent graphs 4. All nodes have unique names within their graph The pass maintains global uniqueness across the entire model. You can customize the name generation functions for nodes and values by passing a subclass of :class:`NameGenerator`. For example, you can use a custom naming scheme like this:: class CustomNameGenerator: def custom_node_name(node: ir.Node) -> str: return f"custom_node_{node.op_type}" def custom_value_name(value: ir.Value) -> str: return f"custom_value_{value.type}" name_fix_pass = NameFixPass(name_generator=CustomNameGenerator()) .. versionadded:: 0.1.6 Nname_generatorNameGenerator | Noner Nonecst|p t|_dS)aInitialize the NameFixPass with custom name generation functions. Args: name_generator (NameGenerator, optional): An instance of a subclass of :class:`NameGenerator` to customize name generation for nodes and values. If not provided, defaults to a basic implementation that uses the node's or value's existing name or a generic name like "node" or "v". N)super__init__r_name_generator)rr# __class__r rr'Hs zNameFixPass.__init__modelir.Modelir.passes.PassResultcCs:||j}|jD] }||p|}q tjj||dS)N)modified)_fix_graph_namesgraph functionsvaluesirpasses PassResult)rr+r.functionr r rcallWs zNameFixPass.call graph_likeir.Graph | ir.Functionboolcsdttgtgtt}d fdd }d fdd }tjj|||dD]D}|jsC|d |rBd n |d |rNd |j D]}|d urc |d rcd qQ|j D]} |d rud qgq2S) z@Fix names in a graph and return whether modifications were made.Fr r%cstdt|jD]}|dr dq|jD]}|dr2dq$t|tjrM|j D]}|drLdq>dSdS)z!Callback for entering a subgraph.TN) appendsetinputs_process_valueoutputs isinstancer3Graph initializersr2)r8 input_value output_value initializerr.scoped_used_node_namesscoped_used_value_names seen_valuesr value_counterr r enter_graphqs.       z1NameFixPass._fix_graph_names..enter_graphcsdS)z Callback for exiting a subgraph.N)pop)_)rHrIr r exit_graphs z0NameFixPass._fix_graph_names..exit_graph)rLrOr;TN)r r%) r= collectionsCounterr3 traversalRecursiveGraphIteratorr_assign_node_name_fix_duplicate_node_namer>r?r@)rr8 node_counterrLrOrrDrEr rGrr/asD      zNameFixPass._fix_graph_namesrrused_value_namesset[str]rJ set[ir.Value]rKcollections.Counter[str]cCsP||vrdSd}|js||||}n||||}|jdus!J|||S)z8Process a value only if it hasn't been processed before.FN)r_assign_value_name_fix_duplicate_value_nameadd)rrrWrJrKr.r r rr?s zNameFixPass._process_value used_namescountercC:|jrJd|j|}t||||_td|jdS)zs     d