Expand description
Common Subexpression Elimination logic implemented in CSE can be controlled with
a CSEController, that defines how to eliminate common subtrees from a particular
TreeNode tree.
Structs§
- CSE
- The main entry point of Common Subexpression Elimination.
- CSERewriter 🔒
- Rewrite a
TreeNodetree by replacing detected common subtrees with the corresponding temporaryTreeNode, that column contains the evaluate result of replacedTreeNodetree. - CSEVisitor 🔒
- Go through a
TreeNodetree and generate identifiers for each subtrees. - Identifier 🔒
- Identifier that represents a
TreeNodetree.
Enums§
- Found
Common Nodes - The result of potentially rewriting a list of
TreeNodes to eliminate common subtrees. - Node
Evaluation 🔒 - How many times a node is evaluated. A node can be considered common if evaluated surely at least 2 times or surely only once but also conditionally.
- Visit
Record 🔒 - Record item that used when traversing a
TreeNodetree.
Traits§
- CSEController
- The
TreeNodespecific definition of elimination. - Hash
Node - Hashes the direct content of an
TreeNodewithout recursing into its children. - Normalize
Eq - The
NormalizeEqtrait extendsEqandNormalizeableto provide a method for comparing normalized nodes in optimizations like Common Subexpression Elimination (CSE). - Normalizeable
- The
Normalizeabletrait defines a method to determine whether a node can be normalized.
Type Aliases§
- Children
List 🔒 - Common
Nodes 🔒 - A map that contains the common
TreeNodes and their alias by their identifiers, extracted during the second, rewriting traversal. - IdArray 🔒
- A cache that contains the postorder index and the identifier of
TreeNodes by the preorder index of the nodes. - Node
Stats 🔒 - A map that contains the evaluation stats of
TreeNodes by their identifiers.