o XipE@sdZddlmZddlZddlZddlZddlmZmZddl m m Z ddl m m Z ddlmZdd d ZGdddejZGdddeZdS)z1Implementation of the pattern matching algorithm.) annotationsN)IterableSequence)ir matched_nodesSequence[ir.Node] output_valuesSequence[ir.Value]returnboolcCsX|D]'}|jD]!}||vrq|rdS|D] \}}||vr'dSqqqdS)znCheck that values computed by the matched_nodes, except for output_values, are used only by the matched_nodes.FT)outputsis_graph_outputuses)rrnvconsumer_rP/home/ubuntu/.local/lib/python3.10/site-packages/onnxscript/rewriter/_matcher.py_valid_to_replaces   rc@s:eZdZdddZejddd d dddZdddZd S) PatternMatcherpattern_pattern_ir.GraphPatternr NonecCs ||_dSN)rselfrrrr__init__* zPatternMatcher.__init__rTNverbose remove_nodestracermodelir.Modelgraph_or_functionir.Graph | ir.Functionnodeir.Noder intr!r r"_basics.MatchingTracer | None_basics.MatchResultcCsdS)z@Match the pattern against the subgraph ending at the given node.Nr)rr#r%r'r r!r"rrrmatch-szPatternMatcher.matchstrcCs t|jSr)r-r)rrrr__str__:rzPatternMatcher.__str__rrr rr#r$r%r&r'r(r r)r!r r"r*r r+)r r-)__name__ __module__ __qualname__rabcabstractmethodr,r.rrrrr)s  rcseZdZd=fdd Zd>d?d dZd@ddZdAddZdBddZdCd d!ZdDd$d%Z dEd'd(Z dFd/d0Z dGd3d4Z d5d6dd7dHd;d<Z ZS)ISimplePatternMatcherrrr rcst|d|_dSr)superr _current_noder __class__rrr?s  zSimplePatternMatcher.__init__Nreasonr-r'ir.Node | Noner cCsD|jr|j}|dkrtd|d||j||p|jdS)NrzMatch failed after z nodes: F)_verbose_matchnum_matched_nodesprintfailr8)rr;r'r?rrrrACs  zSimplePatternMatcher.failpattern_constant_pattern_ir.Constantvalueir.Valuec s@|j}|dur|d|jdjdSz|Wnty.|d|jdYSwjttrqt f}j |krR|d|jdj d|dSt fd d t t Dso|d d dSd Sj dkr|d|jddStjjjds|dd dSd S)aXMatch 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. NValue z is not a constant, expecting .zConstant value of z not available.z has shape z , expecting c3s0|]}tj||jjdVqdS)rel_tolabs_tolN)mathiscloseitem_rel_tol_abs_tol).0i numpy_valuerBpattern_constant_valuerr fs z7SimplePatternMatcher._match_constant..zValue mismatch: expected , got Trz is not a scalar, expecting rHz"Constant value mismatch: expected ) const_valuerAnamerDnumpyFileNotFoundError_value isinstancelistlenshapeallrangendimrKrLrMrNrO)rrBrDconstant_valueexpected_shaperrRr_match_constantKsL        z$SimplePatternMatcher._match_constant pattern_node_pattern_ir.NodePatternr(c CsX||_|j|}|dur||ur|dSdS|j}|||s'||jS|jr2td|j| ||t |j t |j kr_|j sW|dt |j dt |j dSt |j |j }n tj|j |j dd}|D]\}}|dur|durxqk|d S|||sd Sqkt|jD]\}} |t |jkrd S|j| |j|sd SqdS) 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)r8r> lookup_noderAmatchesr;r=r@op_type bind_noder^inputsallow_other_inputszip itertools zip_longest _match_value enumerater bind_value) rrfr' matched_noder,checked_inputs arg_value arg_patternrQoutput_value_patternrrr _match_nodesH        z SimplePatternMatcher._match_node pattern_value_pattern_ir.ValuePatternir.Value | NonecCs|dur$|j|jur$t|tjtjtjfs$|d|jd|jjdSt|tjr,dS|j ||s5dSt|tj rJ|durD|dS| ||St|tjr_|durY|dS| ||St|tjrt|jD],\}}|j |||r|jdur|j |j|j||j dS|j qj|d St|tjr|dur|d S||}|dur|d S|\}}|||}|r|jdur|j |j||S|dur|js|d |d SdS)z2Match an IR value against a ValuePattern instance.NrFz 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_graphr\ _pattern_irVarConstantAnyValuerArXr>ruNodeOutputPattern_match_node_outputreBacktrackingOrrt_valuesenter_new_matchrstag_varbind _tag_valuesmerge_current_matchabandon_current_matchOpIdDispatchOr get_patterncan_match_none)rr|rDrQpattern_choice alternativeresultrrrrss\                     z!SimplePatternMatcher._match_value_pattern_ir.NodeOutputPatterncCsV|}|dur |dS||jkr#|d|jd|dS|||S)z7Match an IR value against a NodeOutputPattern instance.NzCMismatch: Computed node pattern does not match uncomputed IR value.z%Node output index mismatch: expected rVrG)producerrAindex output_index _output_indexr{)rr|rDr'rrrrsz'SimplePatternMatcher._match_node_outputr r)cCs||_t|_d|_dS)z@Initialize the match state. Invoked before starting a new match.N)r=_basics MatchResultr>r8)rr rrr _init_matchs  z SimplePatternMatcher._init_matchlist[ir.Value] | NonecCsg}g}t|jjD]:\}}|jdur,|j|jjvr%||jj|jq ||jq ||jjvr<||jj|q |d|q |rR|jd|dS|S)z8Get values bound to the output variables of the pattern.Noutput_z Error: Output values not found: ) rtrr rXr>bindingsappendvalue_bindingsrA)rrunbound_valuesj value_patternrrr_get_output_values s  z'SimplePatternMatcher._get_output_valuesr#r$r%r&check_removabler+cCsp~~|j}|j}|js|dS||j|s|S|}|dur#|S|r0t|j|s0|dS|j ||S)Nz`Internal Error: SimplePatternMatcher should not be used for patterns with multiple output nodes.5Matched nodes have other uses preventing replacement.) rr>has_single_output_noderAr{ output_noderrnodesr extend)rr#r%r'rrr,rrrr_match_single_output_node s"  z.SimplePatternMatcher._match_single_output_node candidateIterable[ir.Node]cCsp|j}t|jj|D]\}}|||s|Sq |}|dur#|S|r0t|j|s0|dS|j ||S)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). Nr) r>rpr output_nodesr{rrrrAr r)rrrr,rfr'rrrr _multi_match@s    z!SimplePatternMatcher._multi_matchrTrr!r"r*c s||_t|tjr ||_n|j|_|jjr#|||j ||||dS|jj }i|D] } | g |q+t|fddt|ggfdd|ddD} d} tj| D]} |||j| |d} | rr| Sq^| dur~tdS| S) aaMatch 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. )rcs |}|dur S|gSr) op_identifierget)rfid) all_nodes op_to_nodesrr get_nodess z-SimplePatternMatcher.match..get_nodescsg|]}|qSrr)rPpn)rrr sz.SimplePatternMatcher.match..NzNo match found.)_tracerr\rGraphrrrrrrr setdefaultrriterrqproductrrrrA) rr#r%r'r r!r"pattern_output_nodesr candidatesr, combinationr)rrrrr,[s4   & zSimplePatternMatcher.matchr/r)r;r-r'r<r r )rBrCrDrEr r )rfrgr'r(r r )r|r}rDr~r r )r|rrDrEr r )r r)r r)r r) r#r$r%r&r'r(rr r r+)rrrr r r+r0)r1r2r3rrArer{rsrrrrrr, __classcell__rrr9rr6>s   ; 8 9    !r6)rrrr r r )__doc__ __future__rr4rqrKtypingrronnxscript.rewriter._basicsrewriterronnxscript.rewriter._pattern_irr onnxscriptrrABCrr6rrrrs