29 lines
1.5 KiB
Markdown
29 lines
1.5 KiB
Markdown
|
# OpenVINO Graph Rewrite Pass {#openvino_docs_Extensibility_UG_graph_rewrite_pass}
|
||
|
|
|
||
|
|
`ov::pass::GraphRewrite` serves for running multiple matcher passes on `ov::Model` in a single graph traversal.
|
||
|
|
Example:
|
||
|
|
|
||
|
|
@snippet src/transformations/template_pattern_transformation.cpp matcher_pass:graph_rewrite
|
||
|
|
|
||
|
|
In addition, GraphRewrite handles nodes that were registered by MatcherPasses during their execution. This nodes will be added to the beginning of the sequence with nodes for pattern matching.
|
||
|
|
|
||
|
|
> **NOTE**: when using `ov::pass::Manager` temporary GraphRewrite is used to execute single MatcherPass.
|
||
|
|
|
||
|
|
GraphRewrite has two algorithms for MatcherPasses execution. First algorithm is straightforward. It applies each MatcherPass in registration order to current node.
|
||
|
|
|
||
|
|
![graph_rewrite_execution]
|
||
|
|
|
||
|
|
But it is not really efficient when you have a lot of registered passes. So first of all GraphRewrite checks that all MatcherPass patterns has type-based root node (it means that type of this node is not hidden into predicate).
|
||
|
|
And then creates map from registered MatcherPasses. That helps to avoid additional cost of applying each MatcherPass for each node.
|
||
|
|
|
||
|
|
![graph_rewrite_efficient_search]
|
||
|
|
|
||
|
|
> **NOTE**: GraphRewrite execution algorithm cannot be set manually and depends only on root nodes registered inside MatcherPasses.
|
||
|
|
|
||
|
|
## See Also
|
||
|
|
|
||
|
|
* [OpenVINO™ Transformations](./ov_transformations.md)
|
||
|
|
|
||
|
|
[graph_rewrite_execution]: ./img/graph_rewrite_execution.png
|
||
|
|
[graph_rewrite_efficient_search]: ./img/graph_rewrite_efficient_search.png
|