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

re PR rtl-optimization/40761 (IRA memory hog for insanely nested loops)

Browse Source 
2010-03-04  Richard Guenther  <rguenther@suse.de>

	PR tree-optimization/40761
	* tree-ssa-pre.c (compute_antic): Walk reverse postorder
	in reverse order.
	(my_rev_post_order_compute): New function.
	(init_pre): Call it.

From-SVN: r157225
This commit is contained in:
Richard Biener 2010-03-04 13:25:27 +00:00
parent c09a001455
commit 9ca872365c
2 changed files with 92 additions and 5 deletions

12
gcc/ChangeLog

@ -1,8 +1,16 @@
2010-03-04 Richard Guenther <rguenther@suse.de>
PR tree-optimization/40761
* tree-ssa-pre.c (compute_antic): Walk reverse postorder
in reverse order.
(my_rev_post_order_compute): New function.
(init_pre): Call it.
2010-03-04 Changpeng Fang <changpeng.fang@amd.com>
PR middle-end/43209
* tree-ssa-loop-ivopts.c (determine_use_iv_cost_condition): Do not decrease
the cost of an IV candidate when the cost is infinite.
* tree-ssa-loop-ivopts.c (determine_use_iv_cost_condition): Do not
decrease the cost of an IV candidate when the cost is infinite.
2010-03-04 Ralf Wildenhues <Ralf.Wildenhues@gmx.de>

85
gcc/tree-ssa-pre.c

@ -2542,7 +2542,7 @@ compute_antic (void)
fprintf (dump_file, "Starting iteration %d\n", num_iterations);
num_iterations++;
changed = false;
for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++)
for (i = n_basic_blocks - NUM_FIXED_BLOCKS - 1; i >= 0; i--)
{
if (TEST_BIT (changed_blocks, postorder[i]))
{
@ -2573,7 +2573,7 @@ compute_antic (void)
fprintf (dump_file, "Starting iteration %d\n", num_iterations);
num_iterations++;
changed = false;
for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++)
for (i = n_basic_blocks - NUM_FIXED_BLOCKS - 1 ; i >= 0; i--)
{
if (TEST_BIT (changed_blocks, postorder[i]))
{
@ -4507,6 +4507,85 @@ remove_dead_inserted_code (void)
VEC_free (gimple, heap, worklist);
}
/* Compute a reverse post-order in *POST_ORDER. If INCLUDE_ENTRY_EXIT is
true, then then ENTRY_BLOCK and EXIT_BLOCK are included. Returns
the number of visited blocks. */
static int
my_rev_post_order_compute (int *post_order, bool include_entry_exit)
{
edge_iterator *stack;
int sp;
int post_order_num = 0;
sbitmap visited;
int count;
if (include_entry_exit)
post_order[post_order_num++] = EXIT_BLOCK;
/* Allocate stack for back-tracking up CFG. */
stack = XNEWVEC (edge_iterator, n_basic_blocks + 1);
sp = 0;
/* Allocate bitmap to track nodes that have been visited. */
visited = sbitmap_alloc (last_basic_block);
/* None of the nodes in the CFG have been visited yet. */
sbitmap_zero (visited);
/* Push the last edge on to the stack. */
stack[sp++] = ei_start (EXIT_BLOCK_PTR->preds);
while (sp)
{
edge_iterator ei;
basic_block src;
basic_block dest;
/* Look at the edge on the top of the stack. */
ei = stack[sp - 1];
src = ei_edge (ei)->src;
dest = ei_edge (ei)->dest;
/* Check if the edge destination has been visited yet. */
if (src != ENTRY_BLOCK_PTR && ! TEST_BIT (visited, src->index))
{
/* Mark that we have visited the destination. */
SET_BIT (visited, src->index);
if (EDGE_COUNT (src->preds) > 0)
/* Since the DEST node has been visited for the first
time, check its successors. */
stack[sp++] = ei_start (src->preds);
else
post_order[post_order_num++] = src->index;
}
else
{
if (ei_one_before_end_p (ei) && dest != EXIT_BLOCK_PTR)
post_order[post_order_num++] = dest->index;
if (!ei_one_before_end_p (ei))
ei_next (&stack[sp - 1]);
else
sp--;
}
}
if (include_entry_exit)
{
post_order[post_order_num++] = ENTRY_BLOCK;
count = post_order_num;
}
else
count = post_order_num + 2;
free (stack);
sbitmap_free (visited);
return post_order_num;
}
/* Initialize data structures used by PRE. */
static void
@ -4535,7 +4614,7 @@ init_pre (bool do_fre)
postorder = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS);
post_order_compute (postorder, false, false);
my_rev_post_order_compute (postorder, false);
FOR_ALL_BB (bb)
bb->aux = XCNEWVEC (struct bb_bitmap_sets, 1);