TipESrSSKJr SSKrSSKrSSKrSSKJrJr SSK J s J r SSK J s J r SSKJr S Sjr"SS\R"5r"S S \5rg) z1Implementation of the pattern matching algorithm.) annotationsN)IterableSequence)ircUHWnURHDnX1;aM UR5(a gUR5HupEX@;dM g MF MY g)znCheck that values computed by the matched_nodes, except for output_values, are used only by the matched_nodes.FT)outputsis_graph_outputuses) matched_nodes output_valuesnvconsumer_s [/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/onnxscript/rewriter/_matcher.py_valid_to_replacersWA!  "" vvx 0  (  cv\rSrSrS Sjr\R SSSS.S Sjj5rS SjrS r g) PatternMatcher)cXlgNpattern)selfrs r__init__PatternMatcher.__init__*s rrTNverbose remove_nodestracercg)z@Match the pattern against the subgraph ending at the given node.N)rmodelgraph_or_functionnoderr r!s rmatchPatternMatcher.match-src,[UR5$r)strr)rs r__str__PatternMatcher.__str__:s4<<  rrrz_pattern_ir.GraphPatternreturnNoner$ir.Modelr%ir.Graph | ir.Functionr&ir.Noderintr boolr!z_basics.MatchingTracer | Noner._basics.MatchResult)r.r*) __name__ __module__ __qualname____firstlineno__rabcabstractmethodr'r+__static_attributes__r#rrrr)s~ !04 O O2 O O  O O. O  O O!rrc^\rSrSrSU4SjjrSSSjjrSSjrSSjrSSjrSSjr SS jr SS jr SS jr SS jr S SSS.SSjjrSrU=r$)SimplePatternMatcher>c2>[TU]U5 SUlgr)superr _current_node)rr __class__s rrSimplePatternMatcher.__init__?s !-1rNcUR(a1URR5nUS:a[SUSU35 URR X=(d UR 5 g)NrzMatch failed after z nodes: F)_verbose_matchnum_matched_nodesprintfailrC)rreasonr&rIs rrKSimplePatternMatcher.failCs\ == $ = = ?  1$+,=+>hvhOP !;););<rc ^^^URnUc,URSURSTRS35$UR 5mTR m[T[5(a[T54nTRU:wa/URSURSTRSUS35$[UUU4Sj[[T5555(dURS TS TS35$g TRS :wa"URSURS TS35$[R"TR!5TTR"TR$S9(d&URSTS TR!5S35$g ![ a" URSURS35s$f=f)a0Match a Constant pattern against a value. If the constant value is produced by a Constant node, we do not include the constant node as part of the matched graph. Thus, it will not be deleted, if subgraph replacement happens. But subsequent DCE will remove the constant node if it is not used elsewhere. Value z is not a constant, expecting .zConstant value of z not available.z has shape z , expecting c3># UHBn[R"TRU5TUTRTRS9v MD g7f)rel_tolabs_tolN)mathiscloseitem_rel_tol_abs_tol).0i numpy_valuepattern_constantpattern_constant_values r 7SimplePatternMatcher._match_constant..fsMX lURRU5nUbX2LaURS5$gURnUR X$5(dURUR 5$UR (a[SUR35 URX5 [UR5[UR5:apUR(d>URS[UR5S[UR5S35$[URUR5nO*[R"URURSS9nUH8upgUcUcM URS 5s $UR!Xv5(aM8 g [#UR$5HOupU[UR$5:a g URR'XR$U5(aMO g g) z;Matches a pattern subgraph against subgraph rooted at node.Nz;Same pattern node is matched against different graph nodes.Tz Matched: zNumber of inputs (z) is greater than expected ()) fillvaluez3(Optional) input is expected to be None but is not.F)rCrH lookup_noderKmatchesrLrGrJop_type bind_noderjinputsallow_other_inputszip itertools zip_longest _match_value enumerater bind_value) r pattern_noder& matched_noder'checked_inputs arg_value arg_patternr[output_value_patterns r _match_node SimplePatternMatcher._match_nodes!{{..|<  #'yy!^__ ##D0099U\\* * == Idll^, -  + t{{ c,"5"56 622yy(T[[)9(::VWZ[g[n[nWoVppqr!l.A.ABN'22 \00DN'5 "I"$99%Z[[$$[<<'5(11E1E'F #AC %%;;))*> QPP(GrcBUbURURLat[U[R[R [R 45(d6URSURSURRS35$[U[R 5(agURRX5(dg[U[R5(a%UcURS5$URX5$[U[R 5(a%UcURS5$URX5$[U[R5(a[UR 5Hup4URR#5 UR%XB5(a\UR&b3URR)UR&UR*U5 URR-5 gURR/5 M URS5$[U[R05(aUcURS 5$UR3U5nUcURS 5$Uup4UR%XB5nU(a3UR&b&URR)UR&U5 U$Uc&UR4(dURS US 35$g) z2Match an IR value against a ValuePattern instance.rOz is not in the graph z>. Pattern matches crossing graph boundaries are not supported.TFz4Mismatch: Computed node pattern does not match None.z/Mismatch: Constant pattern does not match None.z!None of the alternatives matched.z.Mismatch: OrValue pattern does not match None.z/Mismatch: OrValue pattern does not match value.zMismatch: pattern variable z does not match None.)graph_graphrh _pattern_irVarConstantAnyValuerKrcrHrNodeOutputPattern_match_node_outputrqBacktrackingOrr_valuesenter_new_matchrtag_varbind _tag_valuesmerge_current_matchabandon_current_matchOpIdDispatchOr get_patterncan_match_none)r pattern_valuerdr[pattern_choice alternativeresults rr!SimplePatternMatcher._match_values  DKK!? 1E1E{G[G[\ yyUZZL(=dkk>N>N=OPST m[%9%9 : :{{%%m;; m[%B%B C C}yy!WXX**=@ @ m[%9%9 : :}yy!RSS'' = = m[%?%? @ @%.}/D/D%E! ++-$$^;;$,,8 (()>)> @Y@YZ[@\]KK335 113&F99@A A m[%?%? @ @}yy!QRR'33E:K"yy!RSS + A&&~=F ((4KK$$]%:%:A>M =!=!=99-m_+>+@ !rc\/n/n[URR5Hup4URbuURURR ;a4UR URR UR5 MjUR UR5 MX@RR;a*UR URRU5 MUR SU35 M U(aURRSU35 gU$)z8Get values bound to the output variables of the pattern.Noutput_z Error: Output values not found: ) rrrrcrHbindingsappendvalue_bindingsrK)rr unbound_valuesj value_patterns r_get_output_values'SimplePatternMatcher._get_output_values s(* $& )$,,*>*> ? A!!- %%)=)==!(()=)=m>P>P)QR"))-*<*<= KK$>$>>!(()C)CM)RS"))GA3-8!@  KK  ??OP QrcAAURnURnUR(dURS5$UR UR U5(dU$UR 5nUcU$U(a,[URU5(dURS5$URRU5 U$)Nz`Internal Error: SimplePatternMatcher should not be used for patterns with multiple output nodes.5Matched nodes have other uses preventing replacement.) rrHhas_single_output_noderKr output_noderrnodesrextend)rr$r%r&check_removablerr'r s r_match_single_output_node.SimplePatternMatcher._match_single_output_node s  ,, --::r  3 3T::L//1  L #4U[[-#P#P::UV V ]+ rcjURn[URRU5HupEUR XE5(aMUs $ UR 5nUcU$U(a,[ URU5(dURS5$URRU5 U$)aFind a match for a pattern with multiple output nodes. For a pattern with K output nodes, the input candidate should specify K nodes in the graph that will be matched against the pattern output nodes. Args: candidate: An iterable of nodes that will be matched against the pattern output nodes. check_removable: If True, check that the matched nodes can be removed (that is, that they are not used elsewhere in the graph). r) rHr|r output_nodesrrrrrKrr)r candidaterr'rr&r s r _multi_match!SimplePatternMatcher._multi_match@s "%dll&?&?"K L##L77 #L//1  L #4U[[-#P#P::UV V ]+ rrTrc^^X`l[U[R5(aX lOUR UlUR R(a!URU5 URXX5S9$UR Rn0mUH2nTRUR5/5RU5 M4 [U5mUU4Sjn [U/5/USSV s/sH o"U 5PM sn -n Sn [R "U 6H.n URU5 UR#XS9n U (dM,U s $ U c$[$R&"5R)S5$U $s sn f)aMatch the pattern against the subgraph ending at the given node. For patterns with multiple output nodes, the given node is matched against the first output node in the pattern. For the remaining output nodes in the pattern, we use a brute-force algorithm that enumerates all possible combinations of nodes from the graph (with a filter based on op-type). TODO: Consider omitting parameters model and graph_or_function. With the new IR, the graph can be obtained from the node, and the model is not used. But this is a shared abstract method of the Matcher interface, so other matcher implementation also needs to be updated. More importantly, matching in the presence of subgraphs (control-flow) can introduce some complications which require careful consideration. )rcR>UR5nUcT$TRU/5$r) op_identifierget)rid all_nodes op_to_nodess r get_nodes-SimplePatternMatcher.match..get_nodess-!//1:$$"r2..rNzNo match found.)_tracerrhrGraphrrrrrrr setdefaultrriterr}productrrrrK)rr$r%r&rr r!pattern_output_nodesr rpn candidatesr' combinationrrs @@rr'SimplePatternMatcher.match[s^2 ' 2 2$5K+11DK << . .   W %11$2 $(<<#<#< EGK&&&q'8"=DDQG'./I / v,CWXYXZC[*\C[R9R=C[*\\JE(00*=   )))+)T5 L > }**,112CDDL+]s1E7)rCrrHrrGr-r)rLr*r&zir.Node | Noner.r5)r]z_pattern_ir.Constantrdir.Valuer.r5)rz_pattern_ir.NodePatternr&r3r.r5)rz_pattern_ir.ValuePatternrdzir.Value | Noner.r5)rz_pattern_ir.NodeOutputPatternrdrr.r5)rr4r.r/)r.zlist[ir.Value] | None) r$r1r%r2r&r3rr5r.r6)rzIterable[ir.Node]rr5r.r6r0)r7r8r9r:rrKrqrrrrrrrr'r= __classcell__)rDs@rr?r?>s29v6p757>M7 7r @: @CK @  @" (2     @*=A B!04BB2B B  BB.B BBrr?)r zSequence[ir.Node]r zSequence[ir.Value]r.r5)__doc__ __future__rr;r}rUtypingrronnxscript.rewriter._basicsrewriterronnxscript.rewriter._pattern_irr onnxscriptrrABCrr?r#rrrsg8"   .-55$5G *!SWW!*_>_r