find_candidates_dom_walker Class Reference
Inheritance diagram for find_candidates_dom_walker:
Collaboration diagram for find_candidates_dom_walker:
Public Member Functions | |
| find_candidates_dom_walker (cdi_direction direction) | |
| virtual void | before_dom_children (basic_block) |
| void | walk (basic_block) |
| virtual void | after_dom_children (basic_block) |
Constructor & Destructor Documentation
|
inline |
Member Function Documentation
|
inlinevirtualinherited |
Function to call after the recursive walk of the dominator children.
Reimplemented in eliminate_dom_walker, rewrite_update_dom_walker, strlen_dom_walker, rewrite_dom_walker, nontrapping_dom_walker, dom_opt_dom_walker, uncprop_dom_walker, and single_def_use_dom_walker.
|
virtual |
Find strength-reduction candidates in block BB.
Should never happen, but currently some buggy situations
in earlier phases put constants in rhs1.
Possible future opportunity: rhs1 of a ptr+ can be
an ADDR_EXPR. Fall-through.
Reimplemented from dom_walker.
|
inherited |
Walk the dominator tree.
Recursively walk the dominator tree. BB is the basic block we are currently visiting.
Don't worry about unreachable blocks.
Callback for subclasses to do custom things before we have walked
the dominator children, but before we walk statements. Mark the current BB to be popped out of the recursion stack
once children are processed. NULL is used to mark pop operations in the recursion stack.
Callback allowing subclasses to do custom things after we have
walked dominator children, but before we walk statements.
References bb_postorder, inverted_post_order_compute(), last_basic_block, n_basic_blocks, and postorder_num.
The documentation for this class was generated from the following file:
