Lines Matching refs:rewrite

1 # Quickstart tutorial to adding MLIR graph rewrite
4 by defining an operation, showing multiple ways to define the rewrite using
5 patterns, as well as defining the rewrite using a graph walker (note: using
6 patterns and the rewrite engine is preferred, showing the walker is for
90 There are multiple forms of graph rewrite that can be performed in MLIR. One of
91 the most common is DAG tile to DAG tile rewrite. Patterns provide a concise way
219 /// Multi-step rewrite using "match" and "rewrite". This allows for separating
229   void rewrite(Operation *op, PatternRewriter &rewriter) const override {
236 /// Single-step rewrite with "matchAndRewrite". This allows for performing the
237 /// rewrite immediately upon a successful match.
252 In the C++ rewrite the static benefit of the rewrite pattern is specified at
257 the `match` function in a multi-step rewrite may populate and return a
259 matching to the rewrite. A single-step rewrite with the `matchAndRewrite`