1jZnddlmZddlmZddlmZmZmZmZm Z m Z m Z erddl m Z  dd?dZ d@dAd$Z dBdCd4Z dDdEd7Z dFdGd:Z dFdHd;ZdS)I) annotations) TYPE_CHECKING)AttributeProto GraphProto ModelProto TensorProtocheckerhelperutils)MutableMappingNg1rg2io_maplist[tuple[str, str]] | Nonereturnlist[tuple[str, list[str]]]c&t|tstdt|tstddd}ddd }g}|sg}d|D}||||||}|r|d|f|d|jDd|jD}|r|d|f|d|jDd|jD}|r|d|f|d|jDd|jD|d|jDd|jDz}|r|d|f|S)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 graphc1 list[str]c2rcZtt|t|zSN)listset)rrs =C:\Projects\Historical\venv\Lib\site-packages\onnx/compose.py _overlappingz-check_overlapping_names.._overlapping's!CGGc"gg%&&&Ngraphrexcludeset[str] | Nonec|t}g}|jD]T}|jD]!}|dkr||vr||"|jD]!}|dkr||vr||"U|S)N)rnodeinputappendoutput)r r!edgesnios r _edge_namesz,check_overlapping_names.._edge_names*s ?eeG $ $AW $ $77q//LLOOOX $ $77q//LLOOO $ rch|] }|d S).0elems r z*check_overlapping_names..;s000T!W000r)r!edgecg|] }|j Sr1namer2es r z+check_overlapping_names..Cs'''A'''rcg|] }|j Sr1r7r9s rr;z+check_overlapping_names..Cs)H)H)HQ!&)H)H)Hr value_infocg|] }|j Sr1r7r9s rr;z+check_overlapping_names..Is(((A(((rcg|] }|j Sr1r7r9s rr;z+check_overlapping_names..Is*J*J*Ja16*J*J*Jr initializerc&g|]}|jjSr1valuesr8r9s rr;z+check_overlapping_names..O6661666rc&g|]}|jjSr1rBr9s rr;z+check_overlapping_names..PrDrc&g|]}|jjSr1indicesr8r9s rr;z+check_overlapping_names..R777A777rc&g|]}|jjSr1rGr9s rr;z+check_overlapping_names..SrIrsparse_initializer)rrrrrrr)r rr!r"rr) isinstancer TypeErrorr'r=r@rK)r rrrr-result io_map_inputsoverlaps rcheck_overlapping_namesrQs1 b* % %<:;;; b* % %<:;;;''''     F 00000Ml;;r??KKM,R,R,RSSG) vw'(((l''''')H)H"-)H)H)HG/ |W-...l(((((*J*J2>*J*J*JG0 }g.///l66 566666 5666  77!677777!6777  G7 +W5666 Mrlist[tuple[str, str]]inputslist[str] | Noneoutputsprefix1 str | Noneprefix2r8 doc_stringc   !"t|tstdt|tstdsrr6t} | || }t |}r6t} | || }t |}fd|D}d|Dd|Dd|D!d|jD} d |jD} |s|r|s#d |jD} d |jD}n6t|fd |jD} fd |jD}|s#d|jD}d|jD}n6t|  fd|jD} fd|jD}t| t|jks%t|t|jkrAtj tj |}| | |j}t|t|jks%t|t|jkrAtj tj |}| ||j}|D]3\}}|| vrtd|d|| vrtd|d4t!|||}t|dkr:|d\}}td|dd|zdzdzt}|j|jt|j}|j|jt|j}d5!fd# ||||rft||jfd$|jD|jfd%|jDnJ|j|j|jfd&|jD|rft| |j fd'|jD|j fd(|jDnJ|jfd)|jD|j|j|j|j|jfd*|jD|j|j|jfd+|jD|j|j|jfd,|jDd-|jD"d.|jD|j"fd/|jD||n|jd1|j|_|.]   $+5"Q%1#*5"Q%1    rch|] }|d S)rr1r2r`s rr4zmerge_graphs..s---be---rch|] }|d Sr/r1rcs rr4zmerge_graphs..s,,,rRU,,,rci|]\}}|| Sr1r1)r2out_namein_names r z merge_graphs..sIII->XwwIIIrch|] }|j Sr1r7r2r,s rr4zmerge_graphs..s)))!qv)))rch|] }|j Sr1r7r2r+s rr4zmerge_graphs..s ' ' 'af ' ' 'rcg|] }|j Sr1r7rls rr;z merge_graphs..222A222rcg|] }|j Sr1r7rls rr;z merge_graphs..rnrc0g|]}|jv |jSr1r7r2r+ input_sets rr;z merge_graphs..s'IIIAQVy5H5H5H5H5HrcBg|]}|jvs |jv|jSr1r7)r2r+rr io_map_g2_inss rr;z merge_graphs..s>6Y&&!&M*A*A*A*A*Arcg|] }|j Sr1r7rjs rr;z merge_graphs..444Q!&444rcg|] }|j Sr1r7rjs rr;z merge_graphs..rvrcBg|]}|jvs |jv|jSr1r7)r2r,io_map_g1_outs output_sets rr;z merge_graphs..s>6Z''16^+C+C+C+C+Crc0g|]}|jv |jSr1r7r2r,rzs rr;z merge_graphs..s'LLLQqv7K7K!&7K7K7KrzOutput z is not present in g1zInput z is not present in g2rz=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. sub_graphrstartintendrNonec t||D]}|j|}|jD]}|jtjkr* |jdt|jjA|jtjkr)|j D]!} |dt|j"t|j D]\}}| vr ||j |<dSNr) ranger% attributetyperGRAPHglenGRAPHSgraphs enumerater&) rrrnode_idxr%attrsub_gindexname_ connect_ioreversed_io_maps rrz merge_graphs..connect_ioseS)) ? ?H>(+D > >9 444Jtvq#dfk*:*:;;;;Y."777!%>>" 5!S__==== )$* 5 5 ? ? uO++(7(>DJu% ? ? ?rc&g|] }|jv |Sr1r7rqs rr;z merge_graphs..%CCCaqv/B/B/B/B/Brc&g|] }|jv |Sr1r7rqs rr;z merge_graphs..rrc&g|] }|jv |Sr1r7)r2r+rts rr;z merge_graphs..s%KKKaqv]/J/J/J/J/Jrc&g|] }|jv |Sr1r7r|s rr;z merge_graphs..%FFFq:1E1E1E1E1Erc&g|] }|jv |Sr1r7r|s rr;z merge_graphs..rrc&g|] }|jv |Sr1r7)r2r,rys rr;z merge_graphs..s%NNNq~1M1M1M1M1Mrc&g|] }|jv |Sr1r7r2initrts rr;z merge_graphs..s%KKK$DI],J,J,J,J,Jrc0g|]}|jjv|Sr1rBrs rr;z merge_graphs..s3   {}44 444rc&g|] }|jv |Sr1r7)r2virts rr;z merge_graphs.. s%TTTrwm7S7S7S7S7Srch|] }|j Sr1r7)r2rs rr4zmerge_graphs..s777B777rch|] }|j Sr1r7rjs rr4zmerge_graphs..s---qAF---rcJg|]}|jvr|jvr |jv| Sr1r7)r2r,ry output_namesvalue_info_namess rr;z merge_graphs..sM   v''...l** +**rN_zGraph combining  and z )rrrrrrrr)rLrrMCopyFromadd_prefix_graphr(r&rrr Extractorr make_model extract_modelr ValueErrorrQjoinr%extendr@rKr=r8rY)#r rrrSrUrVrXr8rYg1_copyg2_copyg1_outsg2_ins g1_inputs g2_inputs g1_outputs g2_outputse1e2 g1_out_name g2_in_nameoverlapping_namescategorynamesrg2_nodes_begin g2_nodes_endrrrryrtrrzrrs# `` @@@@@@@@r merge_graphsr[s<L b* % %<:;;; b* % %<:;;; '  6 llG   R B!"W555B  6 llG   R B!"W555B         .-f---N,,V,,,MII&IIIO))ry)))G ' 'bh ' ' 'F?? 22222I22222IIF IIIIIIIIII  M44")444J44")444JJWJJ MLLL")LLLJ y>>CMM ) )S__s29~~-M-M!22!6!677B!!)Z88>B y>>CMM ) )S__s29~~-M-M!22!6!677B!!)Z88>B$*II Z g % %I{IIIJJ J V # #GjGGGHH H $0B?? !!+A.% 1& 1 1 1ii  j  j     AFMM"'[[NFMM"'qv;;L ? ? ? ? ? ? ?Jq.,/// MKK  CCCC28CCCDDD CCCC28CCCDDDD rx    KKKK28KKKLLL#\\  FFFFBIFFFGGG FFFFBIFFFGGGG NNNNBINNNOOO  """M(((MKKKK".KKK 5666    -   L &&&LTTTTbmTTTUUU77!,777--AH---LL      Y   %TTbg+A+A+A+AAF 8rw 8 8RW 8 8 8g  m    g     m  AL Hronnx.compose.merge_models1.0r$r0m1rm2 producer_nameproducer_versiondomain model_version int | Nonec t|tstdt|tstd|j|jkr t d|jd|jd|j} i}t |jt |jz}|D]R}|j|vr8||j}|j|krt d|jd|jC|j||j<Ssrr6t}| ||}t|}r6t}| ||}t|}fd |D}t|j |j ||||| }tj|| | | | || }i}|jD]}|j||j<|jD]V}|j|vr<||j}||jkr#t d |jd |d|jdG|j||j<Wtj||t d|jDd|jDz}|r%t dd|z|j|j|j|jt-j||S)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 underscore 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: rr[cdg|],}r |dzn|dr |dzn|df-Sr^r1r_s rr;z merge_models..rar)rSrUr8rY)rrrr opset_imports ir_versionzaCan't merge models with different values for the same model metadata property. Found: property = z, with values .ch|] }|j Sr1r7r2fs rr4zmerge_models..s&&&A&&&rch|] }|j Sr1r7rs rr4zmerge_models..s)G)G)GQ!&)G)G)GrzPCan't merge models with overlapping local function names. Found in both graphs: r})rLrrMrrr opset_importrversionr add_prefixrr r rmetadata_propsvaluekeyset_model_props functionsr MergeFromr check_model)rrrrSrUrVrXr8rYrrrrropset_import_maprentry found_versionm1_copym2_copyr model model_props meta_entryrfunction_overlaps `` r merge_modelsr,sb b* % %<:;;; b* % %<:;;; } %% ;2= ; ;bm ; ; ;   J13))D,A,AAM ; ; <+ + +,U\:M} -- DODD24/DD. .3] U\ * * '  0 llG   R BBw///B  0 llG   R BBw///B                E   #)##   EK'77 &0&6 JN##' ; ; >[ ( ( /E ((( h*4.hhHMhhT^Tdhhh) +5*:K  ' ' 5+...&&&&&)G)G",)G)G)GG  &(, 2B(C(C D    Obl+++ Obl+++  LrTFr r\str rename_nodes bool | None rename_edges rename_inputsrename_outputsrename_initializersrename_value_infosinplacename_mapdict[str, str] | Nonec t|tstd|s$t} | |n|} d d} | i} |r8d| jD} | jD]} | jD]}|| vr| ||| |< |r#| jD]}| ||j| |j<|r#| jD]}| ||j| |j<|rt| jD]l} | || j| _| jD]L}| d rt|j |d | |j D]}t||d | Mm|rs| j D]}| ||j| |j<| jD]H}| ||jj| |jj<| ||jj| |jj<I|r#| jD]}| ||j| |j<| jD]t} t%| jD]$\}}| j|| vr| || j|<%t%| jD]$\}}| j|| vr| || j|<%u| jD]}|j| vr| |j|_| jD]}|j| vr| |j|_| j D]}|j| vr| |j|_| jD]V}|jj| vr| |jj|j_|jj| vr| |jj|j_W| jD]}|j| vr| |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 graphr\rr8rc6t|dkr||zn|Sr)r)r\r8s r _prefixedz#add_prefix_graph.._prefixeds #D A v}}47rNch|] }|j Sr1r7rjs rr4z#add_prefix_graph..s777af777rrT)rr)r\rr8rrr)rLrrMrr(r%r&r8rHasFieldrrrr@rKrCrHr=r)r r\rrrrrrrrrrgraph_output_namesr*r:rrrr sparse_initr+r(input_in_descout_descr@rKr=s rrrsD eZ ( (?=>>>  LL 5 8888787ah777 7 7AX 7 7..."+)FA"6"6HQK 7AW A AE#,9VUZ#@#@HUZ AX A AE#,9VUZ#@#@HUZ  U U UAYvqv..AF[ U U %%c**$! VTH'-UUE$UFD8TTTTTU  U M ? ?D"+)FDI">">HTY  /  K09  */11H[', -2; +022H[(- . .A\ A AE#,9VUZ#@#@HUZ V.."18,, / /IAvx{h&&&v. "17++ . .IAvwqzX%%%f-  .722 <8 # ##GL1GLH44 =H $ $$X]3HM}::  x ' '' (89K 2XX  $ )X 5 5-56H6O6T-U  % *  % *h 6 6.67I7Q7V.W  & +l88 ?h & &&z7JO Hrrrename_functionsc t|tstd| s%t} | || }t |j|||||||d |ri} |jD]} || jz} | | | j<| | _|jD]'} | jD]}|j | vr| |j |_ (|jjD]}|j | vr| |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) rLrrMrrr rr8r%op_type)rr\rrrrrrrrm f_name_mapr new_f_namer*s rrr9s>D eZ ( (?=>>>  LL 5 !!#%/-    2   A!&J!+Jqv AFF 6 6AV 6 69 ** *19 5AI 6! 2 2AyJ&&&qy1 Lrdim_idxrcZt|tstd|s$t}||n|}d|jD}|jD]^}t |jD]\}}||vr|d|z|j|<t |jD]\}}||vr|d|z|j|<_|jdz} |j tj dg| g| dtj | dtjdg|g  tt!|jD]} |jd } | jd|z} |j tj d | | g| jgd | jd| jjjjD} | |d|j tj| j| jjj| |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: 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 rcg|] }|j Sr1r7)r2r(s rr;z(expand_out_dim_graph..s999ffk999r_collapsed_dim__expand_out_dim_idxConstantz -constantz-valuer0)r8 data_typedimsvals)rSrUr8rr Unsqueezez unsqueeze-)rSrUr8cg|] }|j Sr1) dim_value)r2ds rr;z(expand_out_dim_graph..sGGGQQ[GGGr)rLrrMrr(r%rr&r8r'r make_node make_tensorrINT64rrpopr tensor_typeshapediminsertmake_tensor_value_info elem_type)r rrrorig_out_namesr*r+outinp expand_dim_krr, prev_output new_shapes rexpand_out_dim_graphr%s( eZ ( (?=>>>  LL 5 99999N V??)) @ @FAsn$$!$?g$?$?? (( ? ?FAsn$$ #>W#>#>>  ?611LFMM !N +++$$,,,%+       &3qx== ! !   HLLOOf::::    #\2*!&**       HG!&*<*B*FGGG !$$$   )*4i      Hrct|tstd|s%t}|||}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)rLrrMrr%r )rrrrs rexpand_out_dimr'sv( eZ ( (?=>>>  LL 5  Lrr)r rrrrrrr)NNNNNN)r rrrrrRrSrTrUrTrVrWrXrWr8rWrYrWrr) NNNNNNrrr$r0)rrrrrrRrSrTrUrTrVrWrXrWr8rWrYrWrrWrrWrrWrrrr)TTTTTTFN)r rr\rrrrrrrrrrrrrrrrrrr)TTTTTTTF)rrr\rrrrrrrrrrrrrrrrrrr)F)r rrrrrrr)rrrrrrrr) __future__rtypingronnxrrrrr r r collections.abcr rQrrrrr%r'r1rrr,s#""""" /......LPBBBBBR $ $!N N N N N j $ $! ;#( !OOOOOj!% $!%"&'+&* &*x x x x x |!% $!%"&'+&*$( GGGGGZ!M M M M M f!!!!!!!!r