o i.@s>ddlmZddlmZddlZddlmZGdddZdS)) annotations)dequeN) ONNXModelc@seZdZdZdTddZdUddZdVddZddZedWddZ edXddZ edYd#d$Z edZd&d'Z d[d(d)Z d\d]d.d/Zd\d^d0d1Zd_d4d5Zd6gfd`d;d<Zd6d6gd6fdadBdCZ 6 6 6dbdcdGdHZdddLdMZ 6 NdedfdRdSZd6S)gFusionz! Base class for fusions. modelr fused_op_typestrsearch_op_typecCs>||_||_||_g|_g|_|jd|jd|_d|_dS)NZ_fused__)r rrnodes_to_remove nodes_to_add_new_node_name_prefix_new_node_name_suffix)selfrrr ra/home/kim/smarthome/.venv/lib/python3.10/site-packages/onnxruntime/quantization/fusions/fusion.py__init__s zFusion.__init__nodeonnx.NodeProtoinput_name_to_nodesdict[str, list[onnx.NodeProto]]output_name_to_nodedict[str, onnx.NodeProto]cCst)z Interface function for derived fusion classes. Tries to fuse a node sequence containing the specified node. )NotImplementedError)rrrrrrrfuses z Fusion.fusereturnboolcCs||j}|j}|jD]}|j|jkr||||q|j|j|j |j t |jp3|j }|r<|j |S)z? Apply graph fusion on the entire model graph. ) rrrnodesop_typer rZ remove_nodesr Z add_nodesr rZremove_unused_constant)rrrrZ graph_updatedrrrapply*s    z Fusion.applycCsF|j}|jdur|j|}|d|_||j}|jd7_|S)N)rrrZget_largest_node_name_suffix)rprefixZlargest_suffixnew_namerrrcreate_unique_node_name?s   zFusion.create_unique_node_namer list[onnx.NodeProto] keep_outputs list[str]cCsL|D]!}|jD]}||vrq||vr"||D] }||vr!dSqqqdSNFT)output)r r&rrZnode_to_removeZoutput_to_removeZ impacted_noderrris_safe_to_fuse_nodesKs    zFusion.is_safe_to_fuse_nodesattribute_namecCs.|jD]}|j|krtj|}|SqdS)N) attributenameonnxhelperZget_attribute_value)rr+attrvaluerrrget_node_attribute^s   zFusion.get_node_attribute node_output child_nodeintcCs(t|jD] \}}||kr|SqdS)N) enumerateinput)r3r4indexZ input_namerrr input_indexfs zFusion.input_index list[int]cCsPg}|jjD]}|dr||jq|dr ||jq|dq|S)N dim_value dim_param?)shapedimZHasFieldappendr<r=)Z tensor_typeZ shape_listdrrrtensor_shape_to_listms    zFusion.tensor_shape_to_listcCs8t|jD]\}}|j|}|dur||fSqdS)NNN)r7r8rget_constant_value)rriinpr1rrrget_constant_inputys   zFusion.get_constant_inputư>expected_valuefloatdeltacCs8||\}}|dur|jdkrt|||kr|SdS)Nr!r6)rHsizeabs)rrrJrLrFr1rrrfind_constant_inputs"zFusion.find_constant_inputcCs||||dkSNr)rO)rrrJrLrrrhas_constant_inputszFusion.has_constant_input output_namerankcCs.|j|}|dur dSt|j|krdSdSr()rrElenr?)rrRrSr1rrris_constant_with_specified_ranks z&Fusion.is_constant_with_specified_rankNparent_op_type dict[str, onnx.NodeProto] | Noneexclude(tuple[onnx.NodeProto | None, int | None]cCsX|dur |j}t|jD]\}}||vr)||}|j|kr)||vr)||fSqdS)a Find parent node based on constraints on op_type. Args: node: current node. parent_op_type (str): constraint of parent node op_type. output_name_to_node (dict): dictionary with output name as key, and node as value. exclude (list): list of nodes that are excluded (not allowed to match as parent). Returns: parent: The matched parent node. None if not found. index: The input index of matched parent node. None if not found. NrD)rrr7r8r)rrrVrrXrFrGparentrrrmatch_first_parents  zFusion.match_first_parentr: int | None return_indicelist[int] | Noneonnx.NodeProto | Nonec Cs|dusJ|dus|dksJ|dur|j}|dur2|||||\}}|dur0|||S|t|jkr;dS|j|||}|durR|j|krR||vrR|SdS)a* Find parent node based on constraints on op_type and index. When input_index is None, we will find the first parent node based on constraints, and return_indice will be appended the corresponding input index. Args: node (str): current node name. parent_op_type (str): constraint of parent node op_type. input_index (int or None): only check the parent given input index of current node. output_name_to_node (dict): dictionary with output name as key, and node as value. exclude (list): list of nodes that are excluded (not allowed to match as parent). return_indice (list): a list to append the input index when input_index is None. Returns: parent: The matched parent node. Nr)rrr[rArTr8Z get_parentr) rrrVr:rrXr]rZr9rrr match_parents   zFusion.match_parentparent_op_typesparent_input_indexlist[onnx.NodeProto] | Nonec Cs|durt|t|ksJ|dur|j}|}g}t|D]%\}} |j|| |dur/||nd|g|d} | dur=dS|| | }q|S)aJ Find a sequence of input edges based on constraints on parent op_type and index. When input_index is None, we will find the first parent node based on constraints, and return_indice will be appended the corresponding input index. Args: node (str): current node name. parent_op_types (str): constraint of parent node op_type of each input edge. parent_input_index (list): constraint of input index of each input edge. None means no constraint. output_name_to_node (dict): dictionary with output name as key, and node as value. return_indice (list): a list to append the input index When there is no constraint on input index of an edge. Returns: parents: a list of matched parent node. N)rXr])rTrrr7r`rA) rrrarbrr] current_nodeZmatched_parentsrFrZmatched_parentrrrmatch_parent_paths(  zFusion.match_parent_pathpaths!list[tuple[list[str], list[int]]]9tuple[int, list[onnx.NodeProto] | None, list[int] | None]cCsFt|D]\}}g}|||d|d||}|r |||fSqdS)z@ Find a matching parent path to the given node. rr!)r6NN)r7re)rrrfrrFpathr]Zmatchedrrrmatch_parent_pathss zFusion.match_parent_pathsT child_type&dict[str, list[onnx.NodeProto]] | None recursivec Csn|j||}t|}t|dkr5|}|j|kr|S|r/|j||}|D]}||q't|dksdSrP)rZ get_childrenrrTpopr appendleft) rrrkrrmchildrenZdqrdchildrrrfind_first_child_by_type$s     zFusion.find_first_child_by_type)rrrr r r )rrrrrr)rr) r r%r&r'rrrrrr)rrr+r )r3r r4rrr5)rr;)rr)rI)rrrJrKrLrKrr5)rrrJrKrLrKrr)rRr rSr5rr) rrrVr rrWrXr%rrY)rrrVr r:r\rrWrXr%r]r^rr_)NNN) rrrar'rbr^rrWr]r^rrc)rrrfrgrrrrh)NT) rrrkr rrlrmrrr_)__name__ __module__ __qualname____doc__rrr r$ staticmethodr*r2r:rCrHrOrQrUr[r`rerjrrrrrrrsD          # 3 1r) __future__r collectionsrr.Z onnx_modelrrrrrrs