Struct caffe2_transform::CommonSubexpressionEliminationTransform

pub struct CommonSubexpressionEliminationTransform { /* private fields */ }

| Common Subexpression Elimination | | This transforms looks for specific operators | (denoted by allowed_ops_), and removes | unnecessary repetition of that operator. | | Consider some operator of X, that reads from | blob b_ written to by W. X_a and X_b read the | output of X. However, another operator Y, is | the same type as X, has the same arguments as | X, and reads from the same input b_, written to | by W. It’s output is the same as X. Y_a, Y_b, | and Y_c read from Y. | | Then, we can eliminate the common | subexpressions X and Y, and merge them to Z, | where X_a, X_b, Y_a, Y_b, and Y_c all read from | Z. | | | TODO(benz): Fix the error to not match nodes | that write to external output.

Implementations

impl CommonSubexpressionEliminationTransform

pub fn is_allowed(&mut self, op_type: String) -> bool

pub fn pattern_rule(&mut self, g: &Graph, subgraph: &Vec<i32>, idx: i32) -> bool

pub fn validator_rule(&mut self, g: &Graph, subgraph: &Vec<i32>) -> bool

| As long as we have matched more than 2 | ops, it is worth eliminating. |

pub fn replace_rule(&mut self, subgraph: &Vec<i32>, g_ptr: *mut Graph) -> bool

Trait Implementations

impl Default for CommonSubexpressionEliminationTransform

fn default() -> Self

Returns the “default value” for a type.

impl Transform for CommonSubexpressionEliminationTransform

fn pattern_match(&mut self, graph: &Graph) -> Vec<Vec<i32>>

| Generates all matches (stored as ordered | subgraphs) and returns them. | | A match is stored as vector, which | is a mapping to OperatorDefs in Graph. | The order matters. |

fn try_neighbors( &mut self, graph: &Graph, neighbors: &HashMap<i32, Vec<String>>, matched: &Vec<bool>, subgraph_ptr: *mut Vec<i32>, best_subgraph_ptr: *mut Vec<i32> )

| Attempts to append each neighbor to | the end of the subgraph. |

fn pattern_match_helper( &mut self, graph: &Graph, matched: &Vec<bool>, subgraph_ptr: *mut Vec<i32>, best_subgraph_ptr: *mut Vec<i32> )

| A helper function for PatternMatch, | which keeps track of the best subgraph | so far. |

fn pattern_rule(&mut self, g: &Graph, subgraph: &Vec<i32>, idx: i32) -> bool

| The PatternRule essentially answers: | | Given the current subgraph (ordered), | should we append the new node at idx? |

fn validator_rule(&mut self, g: &Graph, subgraph: &Vec<i32>) -> bool

| The ValidatorRule essentially answers: | | Given a subgraph, can we accept it? |

fn replace_rule(&mut self, subgraph: &Vec<i32>, g_ptr: *mut Graph) -> bool

| The ReplaceRule actually mutates the | graph, and applies the transformation | upon the subgraph. |

fn set_pattern_match_type(&mut self, ty: PatternMatchType)

fn replace_pattern(&mut self, matches: &Vec<Vec<i32>>, graph: *mut Graph)

| Applies the replace rule onto each of | the matches found. |

fn apply_to(&mut self, orig_net: &NetDef) -> NetDef

| Apply a Transform onto a NetDef. | | Returns the transformed NetDef. | | The simple interface - performs the | transformation upon a NetDef, and returns | the result. |