diff options
author | Kazu Hirata <kazu@cs.umass.edu> | 2005-05-27 22:43:05 +0000 |
---|---|---|
committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-05-27 22:43:05 +0000 |
commit | ea497bb84cf1e43948fd78d1d4a985182a91c0cd (patch) | |
tree | ab37166fa7754a17e6a22604189228ad8879627f /gcc/domwalk.h | |
parent | 4aab792de6d092becf03e1d23f74a1ec2047fc27 (diff) | |
download | gcc-ea497bb84cf1e43948fd78d1d4a985182a91c0cd.tar.gz |
domwalk.c (walk_dominator_tree, [...]): Use VEC instead of VARRAY.
* domwalk.c (walk_dominator_tree, init_walk_dominator_tree,
fini_walk_dominator_tree): Use VEC instead of VARRAY.
* domwalk.h (dom_walk_data): Change the type of
block_data_stack and free_block_data to VEC(void_p,heap)*.
* tree-ssa-dse.c (dse_initialize_block_local_data,
dse_optimize_stmt, dse_record_phis, dse_finalize_block): Use
VEC instead of VARRAY.
From-SVN: r100281
Diffstat (limited to 'gcc/domwalk.h')
-rw-r--r-- | gcc/domwalk.h | 8 |
1 files changed, 6 insertions, 2 deletions
diff --git a/gcc/domwalk.h b/gcc/domwalk.h index bf16229b488..ba0624ef160 100644 --- a/gcc/domwalk.h +++ b/gcc/domwalk.h @@ -19,6 +19,10 @@ along with GCC; see the file COPYING. If not, write to 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. */ @@ -94,7 +98,7 @@ struct dom_walk_data /* 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. */ @@ -104,7 +108,7 @@ struct dom_walk_data information/data outside domwalk.c. */ /* Stack of available block local structures. */ - varray_type free_block_data; + 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 |