:j.DddlmZddlmZddlZddlmZGddZy)) annotations)dequeN) ONNXModelcdeZdZdZddZ ddZddZdZe ddZ eddZ eddZ edd Z dd Z ddd Zddd Zdd Zdgf d dZddgdf d!dZ d" d#dZ d$dZ d% d&dZy)'Fusionz! Base class for fusions. c||_||_||_g|_g|_|jdz|jzdz|_d|_y)N_fused__)search_op_type fused_op_typemodelnodes_to_remove nodes_to_add_new_node_name_prefix_new_node_name_suffix)selfrr r s |/home/mcse/projects/srt_converter/srt-converter-venv/lib/python3.12/site-packages/onnxruntime/quantization/fusions/fusion.py__init__zFusion.__init__sU#1"/ % %'"$%)%7%7)%CdFYFY%Y\_%_"%)"ct)z Interface function for derived fusion classes. Tries to fuse a node sequence containing the specified node. )NotImplementedError)rnodeinput_name_to_nodesoutput_name_to_nodes rfusez Fusion.fuses "!rc|jj}|jj}|jjD]/}|j|j k(s|j |||1|jj|j|jj|jt|jxs |j}|r|jj|S)z? Apply graph fusion on the entire model graph. ) rrrnodesop_typer r remove_nodesr add_nodesrboolremove_unused_constant)rrrr graph_updateds rapplyz Fusion.apply*s#jj<<>"jj<<>JJ$$& JD||t222 $ 35HI J  4 45 T../T11FT5F5FG  JJ - - /rc|j}|j%|jj|}|dz|_||j}|xjdz c_|S)N)rrrget_largest_node_name_suffix)rprefixlargest_suffixnew_names rcreate_unique_node_namezFusion.create_unique_node_name?se++  % % -"&**"I"I&"QN)7!);D &Xd88;< ""a'"rcl|D]/}|jD]}||vr||vs ||D] }||vsy 1yNFT)output)r keep_outputsrrnode_to_removeoutput_to_remove impacted_nodes ris_safe_to_fuse_nodeszFusion.is_safe_to_fuse_nodesKsb. )N$2$9$9 ) #|3#'::)<=M)N) (?#()  ) )rc|jD]4}|j|k(stjj |}|cSy)N) attributenameonnxhelperget_attribute_value)rattribute_nameattrvalues rget_node_attributezFusion.get_node_attribute^s?NN DyyN* 77=  rcPt|jD]\}}||k(s |cSy)N) enumerateinput) node_output child_nodeindex input_names r input_indexzFusion.input_indexfs3!*:+;+;!<  E:[(  rcg}|jjD]m}|jdr|j|j0|jdr|j|j ]|jdo|S)N dim_value dim_param?)shapedimHasFieldappendrIrJ) tensor_type shape_listds rtensor_shape_to_listzFusion.tensor_shape_to_listmst ""&& 'Azz+&!!!++.K(!!!++.!!#&  'rct|jD](\}}|jj|}|$||fcSy)NNN)rArBrget_constant_value)rriinpr=s rget_constant_inputzFusion.get_constant_inputysF + FAsJJ11#6E %x rct|j|\}}|"|jdk(rt||z |kr|Sy)Nr'r@)rYsizeabs)rrexpected_valuedeltarWr=s rfind_constant_inputzFusion.find_constant_inputs@**405  qS9O5PSX5XHrc.|j|||dk\SNr)r_)rrr]r^s rhas_constant_inputzFusion.has_constant_inputs''neDIIrcr|jj|}|yt|j|k7ryyr.)rrVlenrL)r output_namerankr=s ris_constant_with_specified_rankz&Fusion.is_constant_with_specified_ranks5 --k: = u{{ t #rNc||jj}t|jD])\}}||vs ||}|j|k(s ||vs%||fcSy)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. rU)rrrArBr)rrparent_op_typerexcluderWrXparents rmatch_first_parentzFusion.match_first_parentsn(  &"&**"@"@"B  + %FAs)),S1>>^3g8M!19$  % rcL|J||dk\sJ||jj}|,|j||||\}}||j||S|t |j k\ry|jj |||}||j|k(r||vr|Sy)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)rrrlrOrdrB get_parentr) rrrirGrrj return_indicerkrEs r match_parentzFusion.match_parents2"kQ&666  &"&**"@"@"B    33D.J]_fgMFE($$U+M #djj/ )&&t[:MN  &..N"BvU\G\Mrc  |t|t|k(sJ||jj}|}g}t|D]:\}} |j || |||nd|g|} | y|j | | }<|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)rjro)rdrrrArprO) rrparent_op_typesparent_input_indexrro current_nodematched_parentsrWrmatched_parents rmatch_parent_pathzFusion.match_parent_paths0  ))*c/.BB BB  &"&**"@"@"B  #O4 *JAw!..);)G"1%T#+ /N%  " "> 2)L *rcvt|D]+\}}g}|j||d|d||}|s&|||fcSy)z@ Find a matching parent path to the given node. rr')r@NN)rArw)rrpathsrrWpathromatcheds rmatch_parent_pathszFusion.match_parent_pathssX!' 1GAtM,,T47DGEXZghG'=00  1 rc:|jj||}t|}t|dkDrf|j }|j |k(r|S|r4|jj||}|D]}|j |t|dkDrfyra)r get_childrenrrdpopr appendleft) rr child_typer recursivechildrendqrtchilds rfind_first_child_by_typezFusion.find_first_child_by_type$s::**41DE 8_"gk668L##z1##::22)rrr]floatr^rrr)rrr]rr^rrr")rerrfrrr") rrrirr dict[str, onnx.NodeProto] | Nonerjrrz(tuple[onnx.NodeProto | None, int | None])rrrirrGz int | Nonerrrjrrolist[int] | Noneronnx.NodeProto | None)NNN) rrrrrrsrrrrorrzlist[onnx.NodeProto] | None)rrryz!list[tuple[list[str], list[int]]]rrrz9tuple[int, list[onnx.NodeProto] | None, list[int] | None])NT) rrrrrz&dict[str, list[onnx.NodeProto]] | Nonerr"rr)__name__ __module__ __qualname____doc__rrr%r, staticmethodr4r>rGrSrYr_rbrgrlrprwr|rrrrrs* " "= "7 "* -=7   $   JAE(* >  &  2 F#'@D(**.--- - > - & -(- -f04@D*. //#/- / > / ( / %/b17  C (GK D     rr) __future__r collectionsrr8 onnx_modelrrrrrrs # "hhr