#include <tree-ssa-scopedtables.h>
Public Member Functions | |
| avail_exprs_stack (hash_table< expr_elt_hasher > *table) | |
| ~avail_exprs_stack (void) | |
| void | push_marker (void) |
| void | pop_to_marker (void) |
| void | record_expr (expr_hash_elt_t, expr_hash_elt_t, char) |
| hash_table< expr_elt_hasher > * | avail_exprs (void) |
| tree | lookup_avail_expr (gimple *, bool, bool, expr_hash_elt **=NULL) |
| void | record_cond (cond_equivalence *) |
Private Member Functions | |
| avail_exprs_stack & | operator= (const avail_exprs_stack &) |
| avail_exprs_stack (class avail_exprs_stack &) | |
Private Attributes | |
| vec< std::pair< expr_hash_elt_t, expr_hash_elt_t > > | m_stack |
| hash_table< expr_elt_hasher > * | m_avail_exprs |
Detailed Description
This class defines a unwindable expression equivalence table layered on top of the expression hash table. Essentially it's just a stack of available expression value pairs with a special marker (NULL, NULL) to indicate unwind points.
Constructor & Destructor Documentation
◆ avail_exprs_stack() [1/2]
|
inline |
References m_avail_exprs, and m_stack.
Referenced by avail_exprs_stack(), and operator=().
◆ ~avail_exprs_stack()
|
inline |
References m_stack.
◆ avail_exprs_stack() [2/2]
|
private |
References avail_exprs_stack().
Member Function Documentation
◆ avail_exprs()
|
inline |
References m_avail_exprs.
◆ lookup_avail_expr()
| tree avail_exprs_stack::lookup_avail_expr | ( | gimple * | stmt, |
| bool | insert, | ||
| bool | tbaa_p, | ||
| expr_hash_elt ** | elt = NULL ) |
Search for an existing instance of STMT in the AVAIL_EXPRS_STACK table. If found, return its LHS. Otherwise insert STMT in the table and return NULL_TREE. Also, when an expression is first inserted in the table, it is also is also added to AVAIL_EXPRS_STACK, so that it can be removed when we finish processing this block and its children.
References dump_file, dump_flags, expr_hash_elt::expr_hash_elt(), EXPR_SINGLE, hash_table< Descriptor, Lazy, Allocator >::find_slot(), gimple_get_lhs(), gimple_phi_result(), gimple_vuse(), if(), is_gimple_min_invariant(), m_avail_exprs, NULL, NULL_TREE, record_expr(), TDF_DETAILS, and TREE_CODE.
◆ operator=()
|
private |
References avail_exprs_stack().
◆ pop_to_marker()
| void avail_exprs_stack::pop_to_marker | ( | void | ) |
Initialize local stacks for this optimizer and record equivalences upon entry to BB. Equivalences can come from the edge traversed to reach BB or they may come from PHI nodes at the start of BB.
Pop items off the unwinding stack, removing each from the hash table until a marker is encountered.
References hash_table< Descriptor, Lazy, Allocator >::clear_slot(), dump_file, dump_flags, hash_table< Descriptor, Lazy, Allocator >::find_slot(), gcc_assert, m_avail_exprs, m_stack, NULL, and TDF_DETAILS.
◆ push_marker()
|
inline |
References NULL, and record_expr().
◆ record_cond()
| void avail_exprs_stack::record_cond | ( | cond_equivalence * | p | ) |
Enter condition equivalence P into the hash table. This indicates that a conditional expression has a known boolean value.
References cond_equivalence::cond, expr_hash_elt::expr_hash_elt(), hash_table< Descriptor, Lazy, Allocator >::find_slot_with_hash(), m_avail_exprs, NULL, record_expr(), and cond_equivalence::value.
Referenced by record_temporary_equivalences().
◆ record_expr()
| void avail_exprs_stack::record_expr | ( | expr_hash_elt_t | , |
| expr_hash_elt_t | , | ||
| char | ) |
Add <ELT1,ELT2> to the unwinding stack so they can be later removed from the hash table.
References dump_file, dump_flags, m_stack, expr_hash_elt::print(), and TDF_DETAILS.
Referenced by lookup_avail_expr(), push_marker(), and record_cond().
Field Documentation
◆ m_avail_exprs
|
private |
Referenced by avail_exprs(), avail_exprs_stack(), lookup_avail_expr(), pop_to_marker(), and record_cond().
◆ m_stack
|
private |
Referenced by avail_exprs_stack(), pop_to_marker(), record_expr(), and ~avail_exprs_stack().
The documentation for this class was generated from the following files:
