GCC Middle and Back End API Reference
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

find_candidates_dom_walker::find_candidates_dom_walker ( cdi_direction  direction)

Member Function Documentation

virtual void dom_walker::after_dom_children ( basic_block  )
void find_candidates_dom_walker::before_dom_children ( basic_block  bb)
   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.  

Reimplemented from dom_walker.

void dom_walker::walk ( basic_block  bb)
     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, free(), inverted_post_order_compute(), and postorder_num.

The documentation for this class was generated from the following file: