Struct caffe2_opt::GraphMatcher

pub struct GraphMatcher { /* private fields */ }

| \brief Main graph matcher interface. | | This class solves a problem of finding | a matching subgraph, which is specified in | a text form.

Implementations

impl GraphMatcher

pub fn init_from_string(&mut self, str: *const u8)

| @brief | | Initialize subgraph pattern from \p | | STR. |

pub fn init_from_file(&mut self, fname: *const u8)

| ———– | @brief | | Initialize subgraph patter from IR | stored in file \p fname. |

pub fn find_subgraph(&mut self, df: &mut NNGraph) -> bool

| @brief | | Try to find the pattern in the given graph | \p DF and return true if it was found. |

pub fn replace_subgraph_with(&mut self)

| ———– | @brief | | Replace the found subgraph with another | one. |

pub fn get_matcher_graph(&mut self) -> *mut TestMatchGraph

\brief Return the matcher graph.

pub fn get_matcher(&mut self) -> TestMatchGraph_NodeRef

| TODO: Do we need this, or can we get it | from getMatcherGraph? |

pub fn get_match_map(&self) -> HashMap<String, NNGraph_NodeRef>

| @brief | | Return a mapping from IR variable name | (std::string) to Node in the matched | graph. |

pub fn does_match(&mut self, df: &mut NNGraph) -> bool

pub fn gen_matcher_from_astexpr( &mut self, expr: *mut ASTExpr, insert_temp: Option<bool> ) -> TestMatchGraph_NodeRef

pub fn gen_matcher_from_aststmt( &mut self, stmt: *mut ASTStmt ) -> TestMatchGraph_NodeRef

pub fn gen_matcher_from_astgraph( &mut self, ast: *mut ASTGraph ) -> TestMatchGraph_NodeRef

pub fn gen_matcher_from_irfile( &mut self, fname: *const u8 ) -> TestMatchGraph_NodeRef

pub fn gen_matcher_from_irstr( &mut self, str: *const u8 ) -> TestMatchGraph_NodeRef

pub fn get_matches<T, U>(&self, df: &mut NNGraph) -> Vec<MatchedSubgraph<T, U>>

\brief Returns a vector of matches.