bIgngddlmZddlmZddlmZmZmZmZm Z m Z m Z  d d dZ d ddZ d ddZ d ddZ d dd Z d dd Z d dd Zy)) annotations)MutableMapping)AttributeProto GraphProto ModelProto TensorProtocheckerhelperutilsNct|tur tdt|tur tdd d}d d d}g}|sg}|Dchc]}|d }}||||||}|r|jd|f||jD cgc]} | j c} |jD cgc]} | j c} }|r|jd|f||j D cgc]} | j c} |j D cgc]} | j c} }|r|jd |f||jD cgc]} | jj c} |jD cgc]} | jj c} ||jD cgc]} | jj c} |jD cgc]} | jj c} z}|r|jd |f|Scc}wcc} wcc} wcc} wcc} wcc} wcc} wcc} wcc} w)aChecks whether there are name collisions between two graphs Returns a list of tuples where the first element represents the member containing overlapping names (One of: "node", "edge", "value_info", "initializer", "sparse_initializer"), and the second element contains a list of names that appear in both graphs on that category. Optionally, it takes an io_map, representing the output/inputs to be connected. It provided, overlapping present in the io_map argument will be ignored. g1 argument is not an ONNX graph g2 argument is not an ONNX graphcBtt|t|zSN)listset)c1c2s I/var/www/html/answerous/venv/lib/python3.12/site-packages/onnx/compose.py _overlappingz-check_overlapping_names.._overlapping$sCGc"g%&&c| t}g}|jD]\}|jD]}|dk7s ||vs|j| |jD]}|dk7s ||vs|j| ^|S)N)rnodeinputappendoutput)graphexcludeedgesnios r _edge_namesz,check_overlapping_names.._edge_names's ?eG $AWW $7q/LLO $XX $7q/LLO $  $ r)redge value_info initializersparse_initializer)r list[str]rr*returnr*r)rrrzset[str] | Noner+r*) typer ValueErrorrr'namer(r)valuesindices) g1g2io_maprr$resultelem io_map_inputsoverlapes rcheck_overlapping_namesr9s Bxz!;<< Bxz!;<<' F )/0T!W0M0;r?KM,RSG vw'('A'"--)HQ!&&)HG |W-.(A(2>>*Ja166*JG }g./ " 5 5616 " 5 5616 !#!6!67A7!#!6!67A7 G +W56 M;1 ()H )*J 7677s6 H$H)9H. 8H3H8 H=I :I 'I c >&'t|tur tdt|tur td|s|r|r*t} | j|| }t ||}|r*t} | j|| }t ||}|D cgc] } |r|| dzn| d|r|| dzn| df"}} |D chc]} | d } } |D chc]} | d } } |Dcic]\}}|| c}}'|j Dchc]}|j }}|jDchc]}|j }}|s|r|sG|jDcgc]}|j }}|jDcgc]}|j }}n|t|}|jDcgc]}|j |vs|j }}|jDcgc]*}|j |vs|j | vr |j ,}}|sG|j Dcgc]}|j }}|j Dcgc]}|j }}n|t|}|j Dcgc]*}|j |vs|j | vr |j ,}}|j Dcgc]}|j |vs|j }}t|t|jks!t|t|j krDtjtj|}|j||j}t|t|jks!t|t|j krDtjtj|}|j||j}|D]+\}}||vrtd|d||vstd|d t!|||}t|dkDr/|d\}} td |d d j#| zd zdzt}!|!j$j'|j$t|!j$}"|!j$j'|j$t|!j$}#d&'fd &&|!|"|#|rt|}|!jj'|jDcgc]}|j |vs|c}|!jj'|jDcgc]}|j |vs|c}ng|!jj'|j|!jj'|jDcgc]}|j | vs|c}|rt|}|!j j'|j Dcgc]}|j |vs|c}|!j j'|j Dcgc]}|j |vs|c}ng|!j j'|j Dcgc]}|j | vs|c}|!j j'|j |!j(j'|j(|!j(j'|j(D$cgc]}$|$j | vs|$c}$|!j*j'|j*|!j*j'|j*D$cgc]}$|$j,j | vr|$c}$|!j.j'|j.|!j.j'|j.D%cgc]}%|%j | vs|%c}%||n&dj#|j |j g|!_|Zd|j d|j d |j zdz|j0zdz|j zdz|j0z}||!_|!Scc} wcc} wcc} wcc}}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}wcc}$wcc}$wcc}%w)aCombines two ONNX graphs into a single one. The combined graph is defined by connecting the specified set of outputs/inputs. Those inputs/outputs not specified in the io_map argument will remain as inputs/outputs of the combined graph. Arguments: g1 (GraphProto): First graph g2 (GraphProto): Second graph io_map (list of pairs of string): The pairs of names [(out0, in0), (out1, in1), ...] representing outputs of the first graph and inputs of the second to be connected inputs (list of string): Optional list of inputs to be included in the combined graph By default, all inputs not present in the ``io_map`` argument will be included in the combined model outputs (list of string): Optional list of outputs to be included in the combined graph By default, all outputs not present in the ``io_map`` argument will be included in the combined model prefix1 (string): Optional prefix to be added to all names in g1 prefix2 (string): Optional prefix to be added to all names in g2 name (string): Optional name for the combined graph By default, the name is g1.name and g2.name concatenated with an undescore delimiter doc_string (string): Optional docstring for the combined graph If not provided, a default docstring with the concatenation of g1 and g2 docstrings is used Returns: GraphProto r rprefixrr%zOutput z is not present in g1zInput z is not present in g2z=Cant merge two graphs with overlapping names. Found repeated z names: ,  zYConsider using ``onnx.compose.add_prefix`` to add a prefix to names in one of the graphs.c nt||D]}|j|}|jD]Q}|jtj k(s!|j dt|j jSt|jD]\}}| vs ||j|<yNr) ranger attributer,rGRAPHglen enumerater) sub_graphstartendnode_idxrattrindexname_ connect_ioreversed_io_maps rrNz merge_graphs..connect_ioseS) ?H>>(+D <99 4 44tvvq#dffkk*:; <!*$** 5 ? uO+(7(>DJJu% ?  ?r_zGraph combining  and z )rGrrHintrIrRr+None)r,rr-CopyFromadd_prefix_graphrr.rrrEr Extractorr make_model extract_modelrr9joinrextendr(r)r/r' doc_string)(r1r2r3inputsoutputsprefix1prefix2r.r[g1_copyg2_copyioio_map_g1_outs io_map_g2_insout_namein_namer#g1_outsr"g2_ins g1_inputs g2_inputs input_set g1_outputs g2_outputs output_sete1e2 g1_out_name g2_in_nameoverlapping_namescategorynamesrDg2_nodes_begin g2_nodes_endinitvirNrOs( @@r merge_graphsrzXsL Bxz!;<< Bxz!;<<'  lG   R B!"W5B  lG   R B!"W5B   $+"Q%1#*"Q%1   '--be-N-%+,rRU,M,BHI->Xww(IO!yy)!qvv)G) hh 'aff 'F ')+2A2I2)+2A2I2F I)+IAQVVy5HIII66Y&!&&M*AI *,))4Q!&&4J4*,))4Q!&&4J4WJ66Z'166^+CJ +-))LQqvv7K!&&LJL y>CM )S_s299~-M!2!22!67B!!)Z8>>B y>CM )S_s299~-M!2!22!67B!!)Z8>>B$*I Z g %w{m3HIJ J V #vj\1FGH H I0B? !+A.% &Zx 1ii  j  j    AFFMM"''[NFFMM"''qvv;L ?q.,/ K  288Caqvv/BCD 288Caqvv/BCD rxx  288Kaqvv]/JKL\  BIIFq:1EFG BIIFq:1EFG BIINq~1MNO  "MM(MM..K$DII],JK 5 56-- {{}4  LL &LLbmmTrwwm7STU%T388RWWbgg4F+GAFrwwiuRWWIR 8gg  mm    gg     mm  AL HS .,I) ' 32J54 MjDCLGFN L  Us%b+ b0 b5+ b: c-cc :c)c=c/cc?c#./c(-c-c-c2*c2c7,c7c<c<d#dd%dd (d  d4d!d7d dc t|tur tdt|tur td|j|jk7r&td|jd|jd|j} i}t |j t |j z}|D]m}|j |vrD||j }|j|k7s0td|j d|j |j||j <o|s|r|r*t}|j||}t||}|r*t}|j||}t||}|Dcgc] }|r||d zn|d |r||d zn|d f"}}t|j|j||||| }tj|| | | | || }i}|jD]}|j||j <|jD]q}|j |vrH||j }||jk7s0td |j d|d|jd|j||j <stj"||t |j$Dchc]}|j&c}|j$Dchc]}|j&c}z}|rtddj)|z|j$j+|j$|j$j+|j$t-j.||Scc}wcc}wcc}w)a=Combines two ONNX models into a single one. The combined model is defined by connecting the specified set of outputs/inputs. Those inputs/outputs not specified in the io_map argument will remain as inputs/outputs of the combined model. Both models should have the same IR version, and same operator sets imported. Arguments: m1 (ModelProto): First model m2 (ModelProto): Second model io_map (list of pairs of string): The pairs of names [(out0, in0), (out1, in1), ...] representing outputs of the first graph and inputs of the second to be connected inputs (list of string): Optional list of inputs to be included in the combined graph By default, all inputs not present in the ``io_map`` argument will be included in the combined model outputs (list of string): Optional list of outputs to be included in the combined graph By default, all outputs not present in the ``io_map`` argument will be included in the combined model prefix1 (string): Optional prefix to be added to all names in m1 prefix2 (string): Optional prefix to be added to all names in m2 name (string): Optional name for the combined graph By default, the name is g1.name and g2.name concatenated with an undescore delimiter doc_string (string): Optional docstring for the combined graph If not provided, a default docstring with the concatenation of g1 and g2 docstrings is used producer_name (string): Optional producer name for the combined model. Default: 'onnx.compose' producer_version (string): Optional producer version for the combined model. Default: "1.0" domain (string): Optional domain of the combined model. Default: "" model_version (int): Optional version of the graph encoded. Default: 1 Returns: ModelProto z m1 argument is not an ONNX modelz m2 argument is not an ONNX modelzIR version mismatch z != z-. Both models should have the same IR versionzPCan't merge two models with different operator set ids for a given domain. Got: rQr;rr%)r\r]r.r[) producer_nameproducer_versiondomain model_version opset_imports ir_versionzaCan't merge models with different values for the same model metadata property. Found: property = z, with values .zPCan't merge models with overlapping local function names. Found in both graphs: r=)r,rr-rr opset_importr~versionrT add_prefixrzrr rWmetadata_propsvaluekeyset_model_props functionsr.rY MergeFromr check_model)m1m2r3r\r]r^r_r.r[r|r}r~rropset_import_maprentry found_versionm1_copym2_copyrbrmodel model_props meta_entryrffunction_overlaps r merge_modelsrsb Bxz!;<< Bxz!;<< }} %"2==/bmm_E; ;  J13)D,AAM ; <<+ +,U\\:M}} - OO,E"//1BD .3]] U\\ * ;'  lG   R BBw/B  lG   R BBw/B   $+"Q%1#*"Q%1        E    #)## EK''7 &0&6&6 JNN#7'' ; >>[ ( /E ((( **4..)9weT^TdTdSeefh +5*:*:K  ' ; 5+.&A&",,)GQ!&&)GG &(, 2B(C D   OObll+ OObll+  Lq Z ')Gs%NN$N c `t|tur td|st} | j|n|} dd} | i} |rK| jD]<} | j D]} | || | | <| j D]} | || | | <>|r1| j D]"}| ||j| |j<$|r1| j D]"}| ||j| |j<$|r`| jD]Q} | || j| _| jD](}|jst|j|d| *S|r| jD]"}| ||j| |j<$| jD]j}| ||jj| |jj<| ||jj| |jj<l|r1| jD]"}| ||j| |j<$| jD]} t!| j D])\}}| j || vs| || j |<+t!| j D])\}}| j || vs| || j |<+| j D]%}|j| vs| |j|_'| j D]%}|j| vs| |j|_'| jD]%}|j| vs| |j|_'| jD]}|jj| vr(| |jj|j_|jj| vs\| |jj|j_| jD]%}|j| vs| |j|_'| S)aAdds a prefix to names of elements in a graph: nodes, edges, inputs, outputs, initializers, sparse initializer, value infos. It can be used as a utility before merging graphs that have overlapping names. Empty names are not prefixed. Arguments: graph (GraphProto): Graph prefix (str): Prefix to be added to each name in the graph rename_nodes (bool): Whether to prefix node names rename_edges (bool): Whether to prefix node edge names rename_inputs (bool): Whether to prefix input names rename_outputs (bool): Whether to prefix output names rename_initializers (bool): Whether to prefix initializer and sparse initializer names rename_value_infos (bool): Whether to prefix value info names inplace (bool): If True, mutates the graph directly. Otherwise, a copy will be created name_map: (Dict): shared name_map in subgraph Returns: GraphProto #graph argument is not an ONNX graphc,t|dkDr||zS|Sr@)rE)r<r.s r _prefixedz#add_prefix_graph.._prefixeds #D A v}747rT)inplacename_map)r<strr.rr+r)r,rr-rTrrrr.rBrDrUr(r)r/r0r'rF)rr< rename_nodes rename_edges rename_inputsrename_outputsrename_initializersrename_value_infosrrrDrr!r8rrBrx sparse_initr"rinput_in_descout_descr(r)r's rrUrUsD E{*$>??  L 5 8 3AWW 3'2  3XX 3'2  3 3 WW AE#,VUZZ#@HUZZ  AXX AE#,VUZZ#@HUZZ  A Avqvv.AF[[  ;;$! VTH  MM ?D"+FDII">HTYY  ?// K09 **//1H['',, -2; ++002H[((-- .  \\ AE#,VUZZ#@HUZZ  AVV."188, /IAvxx{h&&v.  /#177+ .IAvwwqzX%%f-  . .772 <<8 ##GLL1GL2HH4 ==H $$X]]3HM4}}:   x '' (8(89K : 22X  $ $ ) )X 5-56H6O6O6T6T-U  % % *  % % * *h 6.67I7Q7Q7V7V.W  & & + X ll8 ??h &&z7JO8 Hrc 2t|tur td| st} | j|| }t |j |||||||d |ri} |j D]'} || jz} | | | j<| | _)|j D]6} | jD]%}|j| vs| |j|_ '8|j jD]%}|j| vs| |j|_ '|S)aAdds a prefix to names of elements in a graph: nodes, edges, inputs, outputs, initializers, sparse initializer, value infos, and local functions. It can be used as a utility before merging graphs that have overlapping names. Empty names are not _prefixed. Arguments: model (ModelProto): Model prefix (str): Prefix to be added to each name in the graph rename_nodes (bool): Whether to prefix node names rename_edges (bool): Whether to prefix node edge names rename_inputs (bool): Whether to prefix input names rename_outputs (bool): Whether to prefix output names rename_initializers (bool): Whether to prefix initializer and sparse initializer names rename_value_infos (bool): Whether to prefix value info nanes rename_functions (bool): Whether to prefix local function names inplace (bool): If True, mutates the model directly. Otherwise, a copy will be created Returns: ModelProto #model argument is not an ONNX modelT)rrrrrrr) r,rr-rTrUrrr.rop_type)rr<rrrrrrrename_functionsrm f_name_mapr new_f_namer!s rrr"s D E{*$>??  L 5 !!#%/-   A!&&J!+Jqvv AF  6AVV 699 * *199 5AI 6 6 !! 2AyyJ&&qyy1  2 LrcHt|tur td|st}|j|n|}|jDcgc]}|j }}|j D]p}t|jD]\}}||vs |d|z|j|<!t|jD]\}} | |vs | d|z|j|<!r|j dz} |j jtjdg| g| dtj| dtjdg|g tt!|jD]'} |jj#d } | j d|z} |j jtjd | | g| j gd | j  | jj$j&j(Dcgc]}|j*}}|j-|d|jjtj.| j | jj$j0|*|Scc}wcc}w)aEInserts an extra dimension with extent 1 to each output in the graph. Inserts an Unsqueeze node for each output. It can be used as a utility before merging graphs, for example when the second one expects a batch dimension. Arguments: graph (GraphProto): Graph dim_idx (int): Index of the dimension to be inserted. A negative value means counting dimensions from the back. inplace (bool): If True, mutates the model directly. Otherwise, a copy will be created Returns: GraphProto r_collapsed_dim__expand_out_dim_idxConstantz -constantz-valuer%)r. data_typedimsvals)r\r]r.rr Unsqueezez unsqueeze-)r\r]r.)r,rr-rTrr.rrFrrr make_node make_tensorrINT64rArEpop tensor_typeshapedim dim_valueinsertmake_tensor_value_info elem_type)rdim_idxrrDrorig_out_namesr!r"outinp expand_dim_krPr# prev_outputd new_shapes rexpand_out_dim_graphrlsj( E{*$>??  L 5 019ffkk9N9 VV?) @FAsn$!ogY$??  @ ( ?FAsn$ _WI#>>  ? ?6611LFFMM !N >+$$$~V,%++   &3qxx= !  HHLLOff ::     #\2!!&&*   +,&&*<*<*B*B*F*FGQQ[[G G!$   ) )**44i   $ Ha:RHs JJct|tur td|st}|j||}t |j |d|S)aEInserts an extra dimension with extent 1 to each output in the graph. Inserts an Unsqueeze node for each output. It can be used as a utility before merging graphs, for example when the second one expects a batch dimension. Arguments: model (ModelProto): Model dim_idx (int): Index of the dimension to be inserted. A negative value means counting dimensions from the back. inplace (bool): If True, mutates the model directly. Otherwise, a copy will be created Returns: ModelProto rT)r)r,rr-rTrr)rrrrs rexpand_out_dimrsS( E{*$>??  L 5  Lrr)r1rr2rr3zlist[tuple[str, str]] | Noner+zlist[tuple[str, list[str]]])NNNNNN)r1rr2rr3list[tuple[str, str]]r\list[str] | Noner]rr^ str | Noner_rr.rr[rr+r) NNNNNNzonnx.compose.merge_modelsz1.0rr%)rrrrr3rr\rr]rr^rr_rr.rr[rr|rr}rr~rrz int | Noner+r)TTTTTTFN)rrr<rr bool | Nonerrrrrrrrrrrrrzdict[str, str] | Noner+r)TTTTTTTF)rrr<rrrrrrrrrrrrrrrrrr+r)F)rrrrRrrr+r)rrrrRrrr+r) __future__rtypingronnxrrrrr r r r9rzrrUrrrrrrs#!LPBB"B,HB BR $ $!@ @ @  "@   @  @  @ @  @ @ @ N $ $! ;#( !OOO "O  O  O  OO OOO!O OOOj!% $!%"&'+&* &*r r r r  r  r  r %r $r r $r r p!% $!%"&'+&*$( G G GG G  G  G%G$G"GGGZ!M M M M  M f!! ! !! !r