diff options
| author | Diego Novillo <dnovillo@redhat.com> | 2001-07-10 03:50:25 +0000 |
|---|---|---|
| committer | Diego Novillo <dnovillo@gcc.gnu.org> | 2001-07-09 23:50:25 -0400 |
| commit | 2b1d9dc0efa7f724ce91c3463b1f5a70ab936cd1 (patch) | |
| tree | 6798316b89ab69c995e28b442a4782b978b2535b /gcc/flow.c | |
| parent | 70bdc2ff0aa08ce5166cd202074100eea97a653d (diff) | |
| download | gcc-2b1d9dc0efa7f724ce91c3463b1f5a70ab936cd1.zip gcc-2b1d9dc0efa7f724ce91c3463b1f5a70ab936cd1.tar.gz gcc-2b1d9dc0efa7f724ce91c3463b1f5a70ab936cd1.tar.bz2 | |
basic-block.h (tree_node): Forward declare if needed.
2001-07-09 Diego Novillo <dnovillo@redhat.com>
* basic-block.h (tree_node): Forward declare if needed.
(struct basic_block_def): Add fields 'head_tree' and 'end_tree'.
(BLOCK_HEAD_TREE): Define.
(BLOCK_END_TREE): Define.
(struct loops): Rename field 'tree' to 'tree_root'.
* flow.c (entry_exit_blocks): Add initializers for 'head_tree' and
'end_tree'.
(flow_loops_tree_build): Rename reference to field 'tree' to
'tree_root'.
(flow_loops_level_compute): Ditto.
* predict.c (estimate_bb_frequencies): Ditto.
* tree.h (struct tree_common): Add field 'aux'.
From-SVN: r43886
Diffstat (limited to 'gcc/flow.c')
| -rw-r--r-- | gcc/flow.c | 10 |
1 files changed, 7 insertions, 3 deletions
@@ -195,6 +195,8 @@ varray_type basic_block_info; struct basic_block_def entry_exit_blocks[2] = {{NULL, /* head */ NULL, /* end */ + NULL, /* head_tree */ + NULL, /* end_tree */ NULL, /* pred */ NULL, /* succ */ NULL, /* local_set */ @@ -210,6 +212,8 @@ struct basic_block_def entry_exit_blocks[2] { NULL, /* head */ NULL, /* end */ + NULL, /* head_tree */ + NULL, /* end_tree */ NULL, /* pred */ NULL, /* succ */ NULL, /* local_set */ @@ -8718,8 +8722,8 @@ flow_loops_tree_build (loops) /* Root the loop hierarchy tree with the first loop found. Since we used a depth first search this should be the outermost loop. */ - loops->tree = &loops->array[0]; - loops->tree->outer = loops->tree->inner = loops->tree->next = NULL; + loops->tree_root = &loops->array[0]; + loops->tree_root->outer = loops->tree_root->inner = loops->tree_root->next = NULL; /* Add the remaining loops to the tree. */ for (i = 1; i < num_loops; i++) @@ -8773,7 +8777,7 @@ flow_loops_level_compute (loops) int levels = 0; /* Traverse all the outer level loops. */ - for (loop = loops->tree; loop; loop = loop->next) + for (loop = loops->tree_root; loop; loop = loop->next) { level = flow_loop_level_compute (loop, 1); if (level > levels) |