mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-27 15:00:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

cfganal.c (flow_dfs_compute_reverse_execute): Accept new argument holding last unvisited block.

Browse Source 
* cfganal.c (flow_dfs_compute_reverse_execute): Accept new
        argument holding last unvisited block.  Start search for
        unvisited blocks at LAST_UNVISITED rather than EXIT_BLOCK.
        (connect_infinite_loops_to_exit): Supply last unvisited block
        to flow_dfs_compute_reverse_execute.

From-SVN: r90386
This commit is contained in:
Jeff Law 2004-11-09 22:03:10 -07:00 committed by Jeff Law
parent 9686c8110e
commit 24c75ec69c
2 changed files with 16 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
gcc/ChangeLog
View File

@ -1,3 +1,11 @@
2004-11-09 Jeff Law <law@redhat.com>
* cfganal.c (flow_dfs_compute_reverse_execute): Accept new
argument holding last unvisited block. Start search for
unvisited blocks at LAST_UNVISITED rather than EXIT_BLOCK.
(connect_infinite_loops_to_exit): Supply last unvisited block
to flow_dfs_compute_reverse_execute.
2004-10-22 Aldy Hernandez <aldyh@redhat.com>
* config/rs6000/rs6000.md (fix_truncdfsi2): Handle e500

13
gcc/cfganal.c
View File

@ -50,7 +50,8 @@ typedef struct depth_first_search_dsS *depth_first_search_ds;
static void flow_dfs_compute_reverse_init (depth_first_search_ds);
static void flow_dfs_compute_reverse_add_bb (depth_first_search_ds,
basic_block);
static basic_block flow_dfs_compute_reverse_execute (depth_first_search_ds);
static basic_block flow_dfs_compute_reverse_execute (depth_first_search_ds,
basic_block);
static void flow_dfs_compute_reverse_finish (depth_first_search_ds);
static bool flow_active_insn_p (rtx);
@ -613,7 +614,7 @@ add_noreturn_fake_exit_edges (void)
void
connect_infinite_loops_to_exit (void)
{
basic_block unvisited_block;
basic_block unvisited_block = EXIT_BLOCK_PTR;
struct depth_first_search_dsS dfs_ds;
/* Perform depth-first search in the reverse graph to find nodes
@ -624,7 +625,8 @@ connect_infinite_loops_to_exit (void)
/* Repeatedly add fake edges, updating the unreachable nodes. */
while (1)
{
unvisited_block = flow_dfs_compute_reverse_execute (&dfs_ds);
unvisited_block = flow_dfs_compute_reverse_execute (&dfs_ds,
unvisited_block);
if (!unvisited_block)
break;
@ -847,7 +849,8 @@ flow_dfs_compute_reverse_add_bb (depth_first_search_ds data, basic_block bb)
available. */
static basic_block
flow_dfs_compute_reverse_execute (depth_first_search_ds data)
flow_dfs_compute_reverse_execute (depth_first_search_ds data,
basic_block last_unvisited)
{
basic_block bb;
edge e;
@ -865,7 +868,7 @@ flow_dfs_compute_reverse_execute (depth_first_search_ds data)
}
/* Determine if there are unvisited basic blocks. */
FOR_BB_BETWEEN (bb, EXIT_BLOCK_PTR, NULL, prev_bb)
FOR_BB_BETWEEN (bb, last_unvisited, NULL, prev_bb)
if (!TEST_BIT (data->visited_blocks, bb->index - (INVALID_BLOCK + 1)))
return bb;