+ 9i.F^RIHt^RIHt^RIt^RIHt!RR4tR#)) annotations)dequeN) ONNXModelc,]tRt^tRtRRltRRltRRltRt] R R l4t ] R R l4t ] R Rl4t ] RRl4t RRltR%RRlltR%RRlltRRltR.3RRlltRR.R3RRlltR&RRlltR R!ltR'R"R#lltR$tR#)(Fusionz Base class for fusions. c$V^8dQhRRRRRR/#)modelr fused_op_typestrsearch_op_type)formats"e/var/www/html/photoedit/myenv/lib/python3.14/site-packages/onnxruntime/quantization/fusions/fusion.py __annotate__Fusion.__annotate__s!**i**S*c W0nW nWn.Vn.VnVPR,VP,R,VnRVnR#)_fused__N)r r r nodes_to_remove nodes_to_add_new_node_name_prefix_new_node_name_suffix)selfr r r s&&&&r__init__Fusion.__init__sO#1"/ % %'"$%)%7%7)%CdFYFY%Y\_%_"%)"rc$V^8dQhRRRRRR/#)r nodeonnx.NodeProtoinput_name_to_nodesdict[str, list[onnx.NodeProto]]output_name_to_nodedict[str, onnx.NodeProto]r)rs"rrrs( " " "= "7 "rc \h)zm Interface function for derived fusion classes. Tries to fuse a node sequence containing the specified node. )NotImplementedError)rrr!r#s&&&&rfuse Fusion.fuses "!rcV^8dQhRR/#)r returnboolr)rs"rrr*strc 8VPP4pVPP4pVPP4F2pVPVP 8XgK VP W1V4K4 VPPVP4VPPVP4\VP;'g VP4pV'dVPP4V#)z/ Apply graph fusion on the entire model graph. ) r r!r#nodesop_typer r' remove_nodesr add_nodesrr+remove_unused_constant)rr!r#r graph_updateds& rapply Fusion.apply*s#jj<<>"jj<<>JJ$$&D||t222 $5HI'  4 45 T../T11FFT5F5FG  JJ - - /rc VPpVPf*VPPV4pV^,VnV VP: 2pV;P^, unV#N)rrr get_largest_node_name_suffix)rprefixlargest_suffixnew_names& rcreate_unique_node_nameFusion.create_unique_node_name?se++  % % -"&**"I"I&"QN)7!);D &Xd88;< ""a'"rc ,V^8dQhRRRRRRRRR R /#) r rlist[onnx.NodeProto] keep_outputs list[str]r!r"r#r$r*r+r)rs"rrrLs:-=7   rc VF@pVPF-pWQ9dK WR9gKW%,FpW`9gK R# K/ KB R#)FT)output)rr?r!r#node_to_removeoutput_to_remove impacted_nodes&&&& ris_safe_to_fuse_nodesFusion.is_safe_to_fuse_nodesKsM.N$2$9$9 #3#:)<)N)N (?#(*O %:.rc V^8dQhRRRR/#)r rr attribute_namer r)rs"rrr_src VPF7pVPV8XgK\PP V4pVu# R#r6) attributenameonnxhelperget_attribute_value)rrIattrvalues&& rget_node_attributeFusion.get_node_attribute^s:NNDyyN* 77= #rc$V^8dQhRRRRRR/#)r node_outputr child_noder r*intr)rs"rrrgs!.Src V\VP4Fwr#W08XgK Vu# R#)) enumerateinput)rUrVindex input_names&& r input_indexFusion.input_indexfs,!*:+;+;!< E( "= rcV^8dQhRR/#)r r*z list[int]r)rs"rrrns  Y rc 6.pVPPF|pVPR4'dVPVP4K7VPR4'dVPVP 4KkVPR4K~ V#) dim_value dim_param?)shapedimHasFieldappendrcrd) tensor_type shape_listds& rtensor_shape_to_listFusion.tensor_shape_to_listmsu ""&&Azz+&&!!!++.K((!!!++.!!#& 'rcV^8dQhRR/#)r rr r)rs"rrrys~rc \VP4F)wr#VPPV4pVfK&W$3u# R#)NNN)r[r\r get_constant_value)rriinprQs&& rget_constant_inputFusion.get_constant_inputys@ +FAJJ11#6E x, rc(V^8dQhRRRRRRRR/#)r rr expected_valuefloatdeltar*rWr)rs"rrrs*V[knrc VPV4wrEVe*VP^8Xd\WR, 4V8dV#R#)NrZ)rusizeabs)rrrxrzrsrQs&&&& rfind_constant_inputFusion.find_constant_inputs>**40  qS9O5PSX5XH rc(V^8dQhRRRRRRRR/#)r rr rxryrzr*r+r)rs"rrrs0JJ~JuJUZJjnJrc ,VPWV4^8#)r)r~)rrrxrzs&&&&rhas_constant_inputFusion.has_constant_inputs''eDIIrc$V^8dQhRRRRRR/#)r output_namer rankrWr*r+r)rs"rrrs!3cdrc VPPV4pVfR#\VP4V8wdR#R#)NFT)r rrlenrf)rrrrQs&&& ris_constant_with_specified_rank&Fusion.is_constant_with_specified_ranks5 --k: = u{{ t #rNc ,V^8dQhRRRRRRRRR R /#) r rr parent_op_typer r# dict[str, onnx.NodeProto] | Noneexcluder>r*z(tuple[onnx.NodeProto | None, int | None]r)rs"rrrs<>  &  2 rc VfVPP4p\VP4F3wrVWc9gK W6,pVPV8XgK(Wt9gK0Wu3u# R#)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. rq)r r#r[r\r.)rrrr#rrsrtparents&&&&& rmatch_first_parentFusion.match_first_parentsa(  &"&**"@"@"B  +FA),1>>^38M!9$ , rc4V^8dQhRRRRRRRRR R R R R R/#)r rr rr r_z int | Noner#rrr> return_indicelist[int] | Noner*onnx.NodeProto | Noner)rs"rrrsP---- - > - & -(- -rc pVfQhVe V^8gQhVfVPP4pVf,VPWWE4wrxVeVPV4V#V\ VP 48dR#VPP WV4pVeVPV8Xd Wu9dV#R#)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. N)r r#rrirr\ get_parentr.) rrrr_r#rrrr]s &&&&&&& r match_parentFusion.match_parents2"kQ&666  &"&**"@"@"B    33DJ]gMF($$U+M #djj/ )&&t:MN  &..N"BvG\Mrc 0V^8dQhRRRRRRRRR RR R /#) r rr parent_op_typesr@parent_input_indexrr#rrr*zlist[onnx.NodeProto] | Noner)rs"rrrsF///#/- / > / ( / %/rc  *Ve\V4\V48XgQhVfVPP4pTp.p\V4FBwrTP TT Ve W8,MRV.VR7p V fR#VP V 4T pKD V#)a 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)rr)rr r#r[rri) rrrrr#r current_nodematched_parentsrsr.matched_parents &&&&&& rmatch_parent_pathFusion.match_parent_paths0  ))*c/.BB BB  &"&**"@"@"B  #O4JA!..);)G"%T#+ /N%  " "> 2)L5rc(V^8dQhRRRRRRRR/#) r rr pathsz!list[tuple[list[str], list[int]]]r#r$r*z9tuple[int, list[onnx.NodeProto] | None, list[int] | None]r)rs"rrrs317  C rc \V4F6wrE.pVPW^,V^,W64pV'gK2WGV3u# R#)z0 Find a matching parent path to the given node. )rZNN)r[r)rrrr#rspathrmatcheds&&&& rmatch_parent_pathsFusion.match_parent_pathssO!'GAM,,T7DGEXhGw=00 ( rc ,V^8dQhRRRRRRRRR R /#) r rr child_typer r!z&dict[str, list[onnx.NodeProto]] | None recursiver+r*rr)rs"rrr$s=D     rc :VPPW4p\V4p\V4^8deVP 4pVP V8XdV#V'gK=VPPWs4pVFpVP V4K KtR#)rN)r get_childrenrrpopr. appendleft) rrrr!rchildrendqrchilds &&&&& rfind_first_child_by_typeFusion.find_first_child_by_type$s::**4E 8_"gk668L##z1##y::22<U%EMM%(&r)rrr r rrr )gư>)NNN)NT)__name__ __module__ __qualname____firstlineno____doc__rr'r3r; staticmethodrFrRr_rmrur~rrrrrrr__static_attributes__rrrrrs* "* $   JAE(* F#'@D(**.-^/b rr) __future__r collectionsrrM onnx_modelrrrrrrs # "hhr