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

cfgloop.c (init_loops_structure): New function.

Browse Source 
* cfgloop.c (init_loops_structure): New function.
	(flow_loops_find): Create root of the loop tree unconditionally.

From-SVN: r126891
This commit is contained in:
Zdenek Dvorak 2007-07-25 01:31:28 +02:00 committed by Zdenek Dvorak
parent 7d0a07d0c6
commit 4ed88ee36c
2 changed files with 35 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2007-07-25 Zdenek Dvorak <dvorakz@suse.cz>
* cfgloop.c (init_loops_structure): New function.
(flow_loops_find): Create root of the loop tree unconditionally.
2007-07-24 Daniel Jacobowitz <dan@codesourcery.com>
* tree-ssa-ccp.c (fold_const_aggregate_ref): Use fold_convert.

48
gcc/cfgloop.c
View File

@ -343,6 +343,29 @@ alloc_loop (void)
return loop;
}
/* Initializes loops structure LOOPS, reserving place for NUM_LOOPS loops
(including the root of the loop tree). */
static void
init_loops_structure (struct loops *loops, unsigned num_loops)
{
struct loop *root;
memset (loops, 0, sizeof *loops);
loops->larray = VEC_alloc (loop_p, gc, num_loops);
/* Dummy loop containing whole function. */
root = alloc_loop ();
root->num_nodes = n_basic_blocks;
root->latch = EXIT_BLOCK_PTR;
root->header = ENTRY_BLOCK_PTR;
ENTRY_BLOCK_PTR->loop_father = root;
EXIT_BLOCK_PTR->loop_father = root;
VEC_quick_push (loop_p, loops->larray, root);
loops->tree_root = root;
}
/* Find all the natural loops in the function and save in LOOPS structure and
recalculate loop_depth information in basic block structures.
Return the number of natural loops found. */
@ -358,21 +381,21 @@ flow_loops_find (struct loops *loops)
int *rc_order;
basic_block header;
basic_block bb;
struct loop *root;
memset (loops, 0, sizeof *loops);
/* Ensure that the dominators are computed. */
calculate_dominance_info (CDI_DOMINATORS);
/* Taking care of this degenerate case makes the rest of
this code simpler. */
if (n_basic_blocks == NUM_FIXED_BLOCKS)
return 0;
{
init_loops_structure (loops, 1);
return 1;
}
dfs_order = NULL;
rc_order = NULL;
/* Ensure that the dominators are computed. */
calculate_dominance_info (CDI_DOMINATORS);
/* Count the number of loop headers. This should be the
same as the number of natural loops. */
headers = sbitmap_alloc (last_basic_block);
@ -415,18 +438,7 @@ flow_loops_find (struct loops *loops)
}
/* Allocate loop structures. */
loops->larray = VEC_alloc (loop_p, gc, num_loops + 1);
/* Dummy loop containing whole function. */
root = alloc_loop ();
root->num_nodes = n_basic_blocks;
root->latch = EXIT_BLOCK_PTR;
root->header = ENTRY_BLOCK_PTR;
ENTRY_BLOCK_PTR->loop_father = root;
EXIT_BLOCK_PTR->loop_father = root;
VEC_quick_push (loop_p, loops->larray, root);
loops->tree_root = root;
init_loops_structure (loops, num_loops + 1);
/* Find and record information about all the natural loops
in the CFG. */