/* Generic dominator tree walker
- Copyright (C) 2003, 2004 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
+typedef void *void_p;
+DEF_VEC_P(void_p);
+DEF_VEC_ALLOC_P(void_p,heap);
+
/* This is the main data structure for the dominator walker. It provides
the callback hooks as well as a convenient place to hang block local
data and pass-global data. */
struct dom_walk_data
{
- /* This is the direction of the dominator tree we want to walk. ie,
+ /* This is the direction of the dominator tree we want to walk. i.e.,
if it is set to CDI_DOMINATORS, then we walk the dominator tree,
if it is set to CDI_POST_DOMINATORS, then we walk the post
dominator tree. */
to use the second statement walker for anything, so it's hard to
predict if we really need the ability to select their direction
independently. */
- bool walk_stmts_backward : 1;
+ BOOL_BITFIELD walk_stmts_backward : 1;
/* Function to initialize block local data.
/* Function to call before the statement walk occurring before the
recursive walk of the dominator children.
- This typically initializes an block local data and pushes that
+ This typically initializes a block local data and pushes that
data onto BLOCK_DATA_STACK. */
void (*before_dom_children_before_stmts) (struct dom_walk_data *,
basic_block);
/* Stack of any data we need to keep on a per-block basis.
If you have no local data, then BLOCK_DATA_STACK will be NULL. */
- varray_type block_data_stack;
+ VEC(void_p,heap) *block_data_stack;
/* Size of the block local data. If this is zero, then it is assumed
you have no local data and thus no BLOCK_DATA_STACK as well. */
/* From here below are private data. Please do not use this
information/data outside domwalk.c. */
- /* Stack of available block local structures. */
- varray_type free_block_data;
+ /* Stack of available block local structures. */
+ VEC(void_p,heap) *free_block_data;
+
+ /* Interesting blocks to process. If this field is not NULL, this
+ set is used to determine which blocks to walk. If we encounter
+ block I in the dominator traversal, but block I is not present in
+ INTERESTING_BLOCKS, then none of the callback functions are
+ invoked on it. This is useful when a particular traversal wants
+ to filter out non-interesting blocks from the dominator tree. */
+ sbitmap interesting_blocks;
};
void walk_dominator_tree (struct dom_walk_data *, basic_block);