Ti@%SrSSKJr SSKrSSKrSSKrSSKJrJrJ r SSK r SSK J s Jr SSKJ s Jr SSKJ s Jr SSKJ s Jr SSKJs Jr SSK Jr SSKJrJr \ "S5r\R:rSr\R@"S S 55r!S S jr""S S5r#"SS5r$S!Sjr%"SS\#5r&"SS\RN5r("SS\(5r)S"Sjr*S#Sjr+\RX"\\RZ05r.S\/S'Sr0S \/S'"SS5r1g)$zRewrite rules for ONNX models.) annotationsN)CallableSequenceTypeVar)ir)_tape convenienceTz!pkg.onnxscript.rewriter.rule_namecL\rSrSr%SrS\S'S\S'S\S'S\S 'S \S 'S rg )ReplacementSubgraph#z1A subgraph that will replace the matched pattern._basics.MatchResultmatchSequence[ir.Value] new_outputsSequence[ir.Node] new_nodesnew_initializersz_tape.UsedOpsets used_opsetsN)__name__ __module__ __qualname____firstlineno____doc____annotations____static_attributes__r`/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/onnxscript/rewriter/_rewrite_rule.pyr r #s#; ##  ((!!rr boolcg)zxA condition function that always returns True. This is used when no condition function is provided for a rewrite rule. Tr)argskwargss r always_truer$.s rc~\rSrSrSrS S SjjrS SjrSSSS.S SjjrS rg)Pattern6zA pattern that can be matched against nodes in an ONNX graph. This class encapsulates pattern matching functionality, providing the ability to match patterns against nodes without requiring replacement functionality. Nc[U[R5(d[R"U5nXlU=(d [ Ul[U[R5(aX0lO@Uc&[R"UR5UlOU"UR5UlX@l XPl g)aQCreate a pattern matcher. Args: target_pattern: The _pattern_ir.GraphPattern that will be matched against the IR. If a callable is provided, it will be converted to a _pattern_ir.GraphPattern. condition_function: The condition function that will be used to check if the pattern match found should be rewritten. matcher: The pattern matcher that will be used to match the pattern. If not provided, a default matcher will be used. verbose: The verbosity level of the rule. name: An optional name for the pattern that will show up in verbose logging. N) isinstance _pattern_ir GraphPattern_to_graph_pattern_target_patternr$_condition_function_matcherPatternMatcherSimplePatternMatcher_verbosename)selftarget_patterncondition_functionmatcherverboser3s r__init__Pattern.__init__=s,.+*B*BCC(::>JN-#5#D gx66 7 7#M _$99$:N:NODM#D$8$89DM  rc@UR(a UR$S$)NzAnonymous Patternr3r4s r__str__Pattern.__str__as IItyy>+>>rTr8check_nodes_are_removabletracerc^^^^^U(aUS:a[ST35 UbUO TRnTRRUTTUUS9mT(Ga[R "UTTT5nTR RHJnURcMURTR;dM.TRURS5 ML S UUUUU4Sjjn Sn TRR5HBupU RcMU "U R5"X|5n U (aM5U "U SU 3U 5s $ TRR5HBupURcMU "UR5"X5n U (aM5U "U SU3U5s $ U "TR5"U40TRD6nU(d U "US 5$T(a-TR!TTTT[R"R$5 T$T(a-TR!TTTT[R"R&5 T$) Check if the node matches the pattern and return the match result. Args: model: The model containing the graph or function. graph_or_function: The graph or function to match against. node: The node to try to match the pattern against. verbose: The verbosity level of messages. check_nodes_are_removable: If True, validate that matched nodes can be safely removed. tracer: The tracer for debugging. Returns: MatchResult if the pattern matches successfully and passes the condition function, None otherwise. z[match] N)r8 remove_nodesc>[U[R5(a'TRURUR 5 OTRX5 T(a-TR TTTT[RR5 g)z4Local utility to handle check failures consistently.N) r)_basics MatchResultfailreasonfailure_nodes_and_valueslog MatchStatusCONDITION_FAILED) check_resultdefault_messagefailure_objectgraph_or_functionrnoder4rBs rrJPattern.match..failsqlG,?,?@@JJ$++$== JJ?JJ)++<< rc^U4SjnU$)z4Encapsulates try-except pattern for check functions.c>T"U0UD6$![RaPn[R"5nURUR[ UR 55 UsSnA$SnAff=fN)rHMatchFailureErrorrIrJrKlistfailure_sources)r"r#eresultfs rwrapped0Pattern.match..wrap_try..wrappeds^& $1&11"44&!(!4!4!6 AHHd13D3D.EF% &s A/AA*$A/*A/r)r^r_s` rwrap_tryPattern.match..wrap_trys&rz)Node-level check failed for pattern node z+Value-level check failed for pattern value zCondition function check failedrX)printr2r/rrH MatchContextr-inputsr3bindingsbind node_bindingsitems check_methodvalue_bindingsr.rMrNSUCCESSNO_MATCH)r4modelrSrTr8rArBcontextvarrJra pattern_nodeir_noderP pattern_valueir_valuecheck_match_resultrs` `` ` @rr Pattern.matchds 0 w{ HTF# $$0'dmm ##   2 $  **52CT5QG++2288'xxu~~5 388T23   & */)<)<)B)B)D% ,,8#+L,E,E#Fw#XL'<#(G ~V#  *E,1+?+?+E+E+G'  --9#+M,F,F#G#ZL'<#(I-Y$  ,H"*$*B*B!CG!^u~~!^ %.0QRR 4!2D%ATATA\A\]L  JJt.eW=P=P=Y=Y Z r)r.r/r-r2r3)NNrN) r5#_pattern_ir.GraphPattern | Callabler6Callable | Noner7^_matcher.PatternMatcher | Callable[[_pattern_ir.GraphPattern], _matcher.PatternMatcher] | Noner8intr3 str | NonereturnNoner|strrnir.ModelrSir.Graph | ir.FunctionrTir.Noder8 int | NonerAr rB_basics.MatchingTracer | Noner|z_basics.MatchResult | None) rrrrrr9r>rrrrrr&r&6s/3";"," """ "H?#*.04ii2i i  i$(i.i $iirr&c,\rSrSrSrSSjrSSjrSrg) ReplacementPatternFunctionzThe replacement pattern that will replace the targeted pattern. Attributes: function (Callable): The replacement function that will be used to replace the matched pattern. cXlgrX _function)r4functions rr9#ReplacementPatternFunction.__init__s!rc[5nUR"U40URD6nUcg[U[5(dU/n[ XUR URUR5$rX) RewriterContextrrfr)rr nodes initializersr)r4rrors rget_replacement*ReplacementPatternFunction.get_replacementsd!#nnW??  +x00&-K"  w/C/CWEXEX  rrN)r|r})rrr|ReplacementSubgraph | None)rrrrrr9rrrrrrrs "  rrc URnURH9up4X2;a UbUOSX#'MUcMXBU:wdM$[SUSX#SUS35e g)NzMultiple versions of opset z used. Expected version , but got .) opset_importsr ValueError)rSdeltaimportsdomainversions r_update_opset_importsrss --G ,,  )0)U (aU(d [S5e[T U] XXEU5 [U[5(d [ U5nX lXplXlXlXl g)aVCreate a rewrite rule. Args: target_pattern: The _pattern_ir.GraphPattern that will be matched against the IR. If a callable is provided, it will be converted to a _pattern_ir.GraphPattern. replacement_pattern: The ReplacementPatternFunction that will be used to replace the matched pattern. If a callable is provided, it will be converted to a ReplacementPatternFunction. condition_function: The condition function that will be used to check if the pattern match found should be rewritten. matcher: The pattern matcher that will be used to match the pattern. If not provided, a default matcher will be used. verbose: The verbosity level of the rule. name: An optional name for the pattern that will show up in verbose logging. remove_nodes: If True, the matched nodes will be removed from the graph. graph_pre_visitor: A function that will be called before applying the rewriting to the top-level graph or a function. graph_post_visitor: A function that will be called after the rewriting is complete for a graph or function. as_function: If True, the matched nodes will be extracted into a model local function. This is only supported when remove_nodes=True and when the replacement subgraph has a single node, representing the function call. z:as_function=True is only supported when remove_nodes=True.N) rsuperr9r)r_replacement_patternrFgraph_pre_visitorgraph_post_visitor as_function) r4r5replacement_patternr6r7r8r3rFrrr __class__s rr9RewriteRule.__init__scN |YZ Z WtT-/IJJ"<=P"Q $7!(!2"4&rc@UR(a UR$S$)NzAnonymous Ruler<r=s rr>RewriteRule.__str__+s IItyy;+;;rr8rBc URUUUUURUS9nU(dgURRU5nUc5U(a-UR UUUU[ R R5 g[UR5URR:wa9[SURRS[UR5S35e[X'5 [URU5 U$)zTIf the node matches the pattern, then replace the node with the replacement pattern.r@NzsNumber of outputs from replacement function does not match the number of outputs from the target pattern. Expected rr)rrFrrrMrHrNREPLACEMENT_FAILEDlenrr- num_outputsrrgraph)r4rnrSrTr8rBrreplacement_subgraphs r try_rewriteRewriteRule.try_rewrite.s   &*&7&7  #88HHO  ' %''::  #// 0D4H4H4T4T T 00<<=ZL`LlLlHmGnnoq  /Fekk+?@##r)commuter8rBc4[U/US9RXUS9$)Nrr)RewriteRuleSetapply_to_model)r4rnrr8rBs rrRewriteRule.apply_to_modelYs+tfg6EE 6F  rcz^U4SjnTRR5Vs/sH o!"U5PM sn$s snf)Nc >[TR5n[UTRTRU"U5TR TR TRTRTRTR5 $)zHReturn a shallow copy of self with node_pattern replaced by new_pattern.) typer/rrr.r2r3rFrrr) new_pattern matcher_classr4s rreplace_pattern,RewriteRule.commute..replace_patternhso!/M))((k*  !!&&''    r)r-r)r4rps` rrRewriteRule.commutegs8 "-1,@,@,H,H,JK,Jq",JKKKs8)rrrrrF)NNrNTNNF)r5rwrz%ReplacementPatternFunction | Callabler6rxr7ryr8rzr3r{rFr rCallable[[], None] | Nonerrrr r|r}r~) rnrrSrrTrr8rrBrr|r)rnrrr r8rrBr)r|Sequence[RewriteRule]) rrrrr9r>rrrr __classcell__rs@rrrs& /3!7;8<!3';3'C3', 3'  3'3'3'3'53'63'3' 3'3'j<#04)$)$2)$ )$  )$.)$ $)$^"04        .  LLrrc\rSrSrSrS S Sjjr\RS5rS Sjr SSSS.SS jjr S r g) PatternBasei|akBase class for implementing pattern matching as a class. This class encapsulates the pattern definition and condition checking without the replacement functionality. Example:: class TransposePattern(PatternBase): def pattern(cls, op, x, perm): return op.Transpose(x, perm=perm) def check(cls, context, x: ir.Value, perm: ir.Attr) -> bool: if perm.is_ref(): return False if perm.type == ir.AttributeType.INTS: if list(perm.as_ints()) == list(range(len(perm.as_ints()))): return True return False Nc fU=(d URRUlSUlX lgrX)rrr3_compiled_pattern_pattern_kwargs)r4r3r#s rr9PatternBase.__init__s&3DNN33 15%rc[S5e)Nz6Method 'pattern' must be implemented by derived class.NotImplementedErrorr4opr"r#s rpatternPatternBase.pattern!"Z[[rc,[R"5$)zaDefault check function that returns a _basics.MatchResult object with success always set to True.)rHrIrs rcheckPatternBase.checks""$$rTr@c URc<[URUR4SUR0UR D6UlURR UUUUUUS9$)rDr3r@)rr&rrr3rr)r4rnrSrTr8rArBs rrPatternBase.matchsv2  ! ! )%, djj&/3yy&<@ bool: if perm.is_ref(): return False if perm.type == ir.AttributeType.INTS: if list(perm.as_ints()) == list(range(len(perm.as_ints()))): return True return False def rewrite(cls, op, x: ir.Value, perm: ir.Attr | None = None): return op.Identity(x) # Then use # TransposeIdentity.rule() # to create a RewriteRule object. c U"U0UD6n[URURURURUR UR URURS9$)N)r3rFrrr) rrrewriterr3rFsetupcleanupr)clsr"r#instances rruleRewriteRuleClassBase.rules`''       NN!..&nn'// ,,  rc<>[TU]U5 X lX0lgrX)rr9rFr)r4r3rFrrs rr9RewriteRuleClassBase.__init__s (&rc[S5e)Nz6Method 'rewrite' must be implemented by derived class.rrs rrRewriteRuleClassBase.rewriterrcg)zrOptional setup function that can be overridden by derived classes. Used to do per model/function initialization. Nrr=s rrRewriteRuleClassBase.setup rcg)zmOptional cleanup function that can be overridden by derived classes. Used to do per model/function cleanup. Nrr=s rrRewriteRuleClassBase.cleanuprr)rrF)NTF)r3r{rFr rr r|r})rrrrr classmethodrr9rrrrrrrrs@rrrsx2    W\''59'OS' '' \\rrc^ ^ ^ ^0m/n/m UHwnU(a?[R"URURURUR S9O[R"5nUbUTU'UR U5 My SU U4Sjjm SSjm SU U U4SjjnUVs/sH ov"U5PM nnUV s/sH n T "U 5PM n n UT U-U 4$s snfs sn f)z9Utility function to extract a subgraph out as a function.)r3shaper doc_stringc>UcgUT;avURnUbX[R"SU5n[R"SS/U/5nTR U5 UR S=TU'nU$[ SUS35eTU$)NvalueConstantrzValue z not found in value_map.) const_valuer AttrTensorNodeappendoutputsr)rr value_attr const_noder]constant_nodes value_maps r copy_value&_copy_for_function..copy_values =  !++K&]]7K@ WWRR*F %%j1,6,>,>q,AA % 6 veW,DEF FrcUR5(a [S5eUR[RR [RR 1;a [S5eU$)NzRefAttr not supported.zGraph attributes not supported.)is_refrrr AttributeTypeGRAPHGRAPHS)attrs rcopy_attr_value+_copy_for_function..copy_attr_value.sW ;;==&&>? ? 99))//1A1A1H1HI I&&GH H rc Z>URVs/sH nT "U5PM nnURR5Vs/sH nT"U5PM nn[R"UR UR UUUR[UR5SURURURR5S9 nURn[UR5H.upgXVT U'URcMURXVl M0 U$s snfs snf)N)overloadrrr3rmetadata_props)re attributesvaluesrrrop_typerrrr3rrcopy enumerate) rTv new_inputsnew_attributesnew_noderioutputr rrs r copy_node%_copy_for_function..copy_node:s-1[[9[jm[ 96:oo6L6L6NO6N/!,6NO77 KK LL  ]]DLL)..335  && "4<<0IA +If {{&&,kk #1':Os D#D()rir.Value | Noner|r)r ir.Attrr|r)rTrr|r)rValuer3rrrr)rerrfunction_inputsinput new_valuerrTfunction_nodesrfunction_outputsrr rrs @@@@r_copy_for_functionr%s+-I&(O$&N HHZZkkZZ ++     (Ie y)    ,388%$io%N8/67w! 1 w7 ^n<>N OO97s $C;CcXURnSn[U5nXU4U;aU$US- nM)zGet a new overload for the given domain and name. Args: model: The model to which the new overload will be added. domain: The domain of the new overload. name: The opname of the new overload. Returns: The new overload name. r) functionsr)rnrr3existing_functionsr overload_names r_get_new_overloadr*UsAH H - (0B B A  rzmetadata_merger.MetadataMerger_default_metadata_mergerTmerge_metadatac|\rSrSrSS.S SjjrSSjrSS.SSjjrSSS .SS jjrS rS r g)risFrc U(d [S5eU(aF[[RR UVs/sHo3R 5PM sn55nXl[SU55Ulgs snf)Nz$rules must contain at least one rulec3B# UHoR(+v M g7frX)rF).0rs r *RewriteRuleSet.__init__..|s&O+<+<'<'<s) rrZ itertoolschain from_iterablerrulesanyremove_unused_nodes)r4r6rrs rr9RewriteRuleSet.__init__tscCD D 66SX7YSX4 SX7YZ[E $'&O&O#O 8ZsA> cNURRSURS3$)N())rrr6r=s r__repr__RewriteRuleSet.__repr__~s$..))*!DJJURA5'U(aUR(aURS 3OS n [S U S35 [BRD"UR.R05 [S5 [BRD"UR5 [S5 UR(a0URH nURURF[H'M" [JRL"UWURN(aUR.R0O/URUR.R6URP5 [R(a4[TRWUR.R0UR5 US- n O URXR[5HnUR\[ R^R`:XaXPRcUURdX4S9- nMJUR\[ R^Rf:XdMtURdHnXPRcUUX4S9- nM M GM URH&nURh(dMURi5 M( U$s snfs snfs snnf)aq Apply the rewrite rules to the given graph or function. Args: model: The model to which the rewrite rules are applied. graph_or_function: The graph or function to which the rewrite rules are applied. verbose: The verbosity level. Defaults to None. tracer: The tracer for debugging. Defaults to None. Returns: The number of rewrite rules applied. rrz:Rewrites adding initializers not supported for functions: z Initializer z already exists.rzOas_function=True is only supported for patterns with a single replacement node.)rrr)rrz: rz----zMatched Nodes----z++++Replacement Nodes++++z++++End Replacement Nodes++++)5r6rrr)r rrFunctionrcrr3 onnxscript optimizerbasic_constant_propagationrrrrrrr*rsetrrr%rerrriGraphr' identifier _ir_utils display_nodesr RULE_NAME_TAGr replace_nodes_and_valuesrFrr,r+copy_merged_metadatarrrrr_apply_to_graph_or_functionrr r)r4rnrSr8rBcountrrTrr initializer call_noderr3runsorted_nodesnoriginal_nodesrerr used_domainsparent_opset_importskrused_opset_importsrr^r s rrL*RewriteRuleSet._apply_to_graph_or_functions(JJD%%%&&(&D ((dF)=F$6!%)<====))!"3R[[AA#!"\]a\b c!#4#A#AL','='= &++|;& % [5E5E4FFV&W X$ (> (-'='= 9D[%5%56(> $$??P###5??+q0(m!& 2I&--F$,,D0EH)1&&)):):%;N1B%Z1BAa>FYa1BN%Z-?!((.%++:M:M.*FE7GU-UndkknL-U+<+J+J()=)C)C)E*)EAlIZ1)E'*HHuDVE F(%TVWA67EOOALLN3/3yydii[+bDD&789++EKK,=,=>56++EOO<9: 99"__:>))((7-44%)-):):EKK%%OOKK''%% ">,AA ))5?? w#|..099 0 0 6 66==tzz7>EYY""2"2"9"99!%!A!A!5'"B"", 1&TJJD&&&'') E&[ .V*s3 UU<U2 U" U" rc [U[R5(de[RR UR 5 [URR55nURXR X#S9nUH4n[RR U5 XPRXX#S9- nM6 UR(a[RRU5 U$)aoApply the rewrite rules in the set to the model. Args: model: The model to which the rewrite rules are applied. verbose: The verbosity level of messages. Defaults to None. tracer: if specified, no changes are made to the model, only information about the best matches found is computed. Returns: The number of applications of rewrite rules. r) r)rModelrArBrCrrZr'rrLr8)r4rnr8rBoriginal_functionsrMrs rrRewriteRuleSet.apply_to_model s$%****77 D"%//"8"8":;00 ;;1 +H  ; ;H E 556 E+  # #  4 4U ; rc#8# URShvN gN7frX)r6r=s r__iter__RewriteRuleSet.__iter__.s::s )r8r6)r6rrr r|r}r~) rnrrSrr8rrBrr|rz)rnrr8rrBrr|rz) rrrrr9r=rLrr]rrrrrrssHMP:15 HH2H  H . H H\#04 !! ! . ! !Frr)r|r )rSrrr )rezSequence[ir.Value | None]rrrr)rnrrrr3rr|r)2r __future__rr dataclassesr3typingrrronnxscript.optimizerrAonnxscript.rewriter._basicsrewriterrHonnxscript.rewriter._ir_utilsrGonnxscript.rewriter._matcherr/onnxscript.rewriter._pattern_irr* onnxscript.utils.metadata_mergerutilsmetadata_mergerr onnxscript.irrr r BuilderrrI dataclassr r$r&rrrABCrrr%r*MetadataMergercomma_separator_mergerr+rr,rrrrrqsP%"  --11//55::, CL-- 4  """WWt  , - 6I DL'DLNG #''G T?;?DJP %JP.?JPJ\JPZ*