Ng.LddlmZddlmZddlZddlmZGddZdS)) annotations)dequeN) ONNXModelceZdZdZdCdZdDdZdEdZdZedFdZ edGdZ edHdZ edIdZ dJd Z dKdLd%ZdKdMd&ZdNd)Zd*gfdOd/Zd*d*gd*fdPd5Z dQdRd9ZdSd=Z dTdUdBZd*S)VFusionz! Base class for fusions. modelr fused_op_typestrsearch_op_typec||_||_||_g|_g|_|jdz|jzdz|_d|_dS)N_fused__)r r r nodes_to_remove nodes_to_add_new_node_name_prefix_new_node_name_suffix)selfr r r s c/var/www/html/ai-engine/env/lib/python3.11/site-packages/onnxruntime/quantization/fusions/fusion.py__init__zFusion.__init__sU#1"/ % %'"$%)%7)%CdFY%Y\_%_"%)"""nodeonnx.NodeProtoinput_name_to_nodesdict[str, list[onnx.NodeProto]]output_name_to_nodedict[str, onnx.NodeProto]ct)z Interface function for derived fusion classes. Tries to fuse a node sequence containing the specified node. )NotImplementedError)rrrrs rfusez Fusion.fuses "!rreturnboolc|j}|j}|jD])}|j|jkr||||*|j|j|j |j t|jp|j }|r|j |S)z? Apply graph fusion on the entire model graph. ) r rrnodesop_typer r remove_nodesr add_nodesrr"remove_unused_constant)rrrr graph_updateds rapplyz Fusion.apply*s#j<<>>"j<<>>J$$&& J JD|t222 $ 35HIII  4555 T.///T1FT5FGG  0 J - - / / /rc|j}|j$|j|}|dz|_||j}|xjdz c_|S)N)rrr get_largest_node_name_suffix)rprefixlargest_suffixnew_names rcreate_unique_node_namezFusion.create_unique_node_name?sa+  % -"&*"I"I&"Q"QN)7!);D &expected_valuefloatdeltac||\}}|#|jdkrt||z |kr|SdS)Nr,rJ)rbsizeabs)rrrdrfr`rDs rfind_constant_inputzFusion.find_constant_inputsK**4005  qS9O5P5PSX5X5XHrrc8||||dkSNr)rj)rrrdrfs rhas_constant_inputzFusion.has_constant_inputs''neDDIIr output_namerankcv|j|}|dSt|j|krdSdSr6)r r_lenrU)rrnrorDs ris_constant_with_specified_rankz&Fusion.is_constant_with_specified_ranks@ --k:: =5 u{  t # #5trNparent_op_type dict[str, onnx.NodeProto] | Noneexclude(tuple[onnx.NodeProto | None, int | None]c||j}t|jD]&\}}||vr||}|j|kr ||vr||fcS'dS)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. Nr^)r rrKrLr%)rrrsrrur`raparents rmatch_first_parentzFusion.match_first_parents~(  &"&*"@"@"B"B  ++ % %FAs))),S1>^33g8M8M!19$$$zrrO int | None return_indicelist[int] | Noneonnx.NodeProto | NonecV|J||dksJ||j}|4|||||\}}||||S|t |jkrdS|j|||}||j|kr||vr|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)r rryrXrqrL get_parentr%) rrrsrOrrur{rxrMs r match_parentzFusion.match_parents2"kQ&6&6&6&6  &"&*"@"@"B"B    33D.J]_fggMFE($$U+++M #dj// ) )4&&t[:MNN  &.N"B"BvU\G\G\Mtrparent_op_typesparent_input_indexlist[onnx.NodeProto] | Nonec 8|"t|t|ksJ||j}|}g}t|D]F\}} ||| |||nd|g|} | dS|| | }G|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)rur{)rqr rrKrrX) rrrrrr{ current_nodematched_parentsr`r%matched_parents rmatch_parent_pathzFusion.match_parent_paths0  ))**c/.B.BBBBB  &"&*"@"@"B"B  #O44 * *JAw!..);)G"1%%T#+ /N%tt  " "> 2 2 2)LLrpaths!list[tuple[list[str], list[int]]]9tuple[int, list[onnx.NodeProto] | None, list[int] | None]ct|D]5\}}g}|||d|d||}|r|||fcS6dS)z@ Find a matching parent path to the given node. rr,)rJNN)rKr)rrrrr`pathr{matcheds rmatch_parent_pathszFusion.match_parent_pathssn!'' 1 1GAtM,,T47DGEXZghhG 1'=0000 1~rT child_type&dict[str, list[onnx.NodeProto]] | None recursivecV|j||}t|}t|dkrk|}|j|kr|S|r5|j||}|D]}||t|dkkdSrl)r get_childrenrrqpopr% appendleft) rrrrrchildrendqrchilds rfind_first_child_by_typezFusion.find_first_child_by_type$s:**41DEE 8__"ggkk6688L#z11## ):22rs #""""" """"""hhhhhhhhhhr