diff options
| author | Kenneth Zadeck <zadeck@naturalbridge.com> | 2005-12-20 23:10:49 +0000 |
|---|---|---|
| committer | Kenneth Zadeck <zadeck@gcc.gnu.org> | 2005-12-20 23:10:49 +0000 |
| commit | f91a0bebdafa9d5810d0d55829cdda96d0d524c3 (patch) | |
| tree | 3c3755600937dd34ae35ee7f0ba92fc15d99c5c7 /gcc/tree-ssa-reassoc.c | |
| parent | df239d2bf9943dde3deb93ff19b89efccb973646 (diff) | |
| download | gcc-f91a0bebdafa9d5810d0d55829cdda96d0d524c3.zip gcc-f91a0bebdafa9d5810d0d55829cdda96d0d524c3.tar.gz gcc-f91a0bebdafa9d5810d0d55829cdda96d0d524c3.tar.bz2 | |
cfganal.c (flow_reverse_top_sort_order_compute): Renamed to post_order_compute and additional parameter added which allows the...
2005-12-20 Kenneth Zadeck <zadeck@naturalbridge.com>
* cfganal.c (flow_reverse_top_sort_order_compute):
Renamed to post_order_compute and additional parameter added which
allows the inclusion of entry and exit blocks into list.
(mark_dfs_back_edges): Fixed comment.
(flow_depth_first_order_compute): Renamed to
pre_and_rev_post_order_compute additional parameter added which
allows the inclusion of entry and exit blocks into list.
* global.c (set_up_bb_rts_numbers): Call to
flow_reverse_top_sort_order_compute renamed to
post_order_compute.
* var-tracking.c (vt_stack_adjustments): Fixed comment.
(vt_find_locations): Call to
flow_depth_first_order_compute renamed to
pre_and_rev_post_order_compute.
* cfgloop.c (flow_find_loops): Ditto.
* tree-ssa-reassoc.c (init_reassoc): Ditto.
* df.c (df_analyze_1, df_analyze_subcfg): Calls to
flow_reverse_top_sort_order_compute renamed to post_order_compute
and calls to flow_reverse_top_sort_order_compute renamed to
post_order_compute.
* basic_block.h: Ditto.
From-SVN: r108874
Diffstat (limited to 'gcc/tree-ssa-reassoc.c')
| -rw-r--r-- | gcc/tree-ssa-reassoc.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c index b8dfbfc..97492b8 100644 --- a/gcc/tree-ssa-reassoc.c +++ b/gcc/tree-ssa-reassoc.c @@ -1424,7 +1424,7 @@ init_reassoc (void) /* Reverse RPO (Reverse Post Order) will give us something where deeper loops come later. */ - flow_depth_first_order_compute (NULL, bbs); + pre_and_rev_post_order_compute (NULL, bbs, false); bb_rank = xcalloc (last_basic_block + 1, sizeof (unsigned int)); operand_rank = htab_create (511, operand_entry_hash, |