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

re PR tree-optimization/46355 (ICE: SIGSEGV in create_preheader (cfgloopmanip.c:1336) with -O -fstrict-overflow -ftree-loop-distribution)

Browse Source 
2010-11-09  Richard Guenther  <rguenther@suse.de>

	PR tree-optimization/46355
	* tree-loop-distribution.c (tree_loop_distribution): Do not
	distribute loops without a single exit.

	* gcc.dg/pr46355.c: New testcase.

From-SVN: r166498
This commit is contained in:
Richard Guenther 2010-11-09 16:54:05 +00:00 committed by Richard Biener
parent 0644953e64
commit a3357f7dff
4 changed files with 31 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2010-11-09 Richard Guenther <rguenther@suse.de>
PR tree-optimization/46355
* tree-loop-distribution.c (tree_loop_distribution): Do not
distribute loops without a single exit.
2010-11-09 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>
PR rtl-optimization/46237

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
2010-11-09 Richard Guenther <rguenther@suse.de>
PR tree-optimization/46355
* gcc.dg/pr46355.c: New testcase.
2010-11-09 Richard Guenther <rguenther@suse.de>
PR tree-optimization/46177

14
gcc/testsuite/gcc.dg/pr46355.c Normal file
View File

@ -0,0 +1,14 @@
/* { dg-do compile } */
/* { dg-options "-O -ftree-loop-distribution -fstrict-overflow" } */
void
foo (int *dest, int i, int u, int v)
{
int j = i;
while (i)
{
dest[j--] = v;
dest[j--] = u;
}
}

7
gcc/tree-loop-distribution.c
View File

@ -1145,7 +1145,12 @@ tree_loop_distribution (void)
FOR_EACH_LOOP (li, loop, 0)
{
VEC (gimple, heap) *work_list = VEC_alloc (gimple, heap, 3);
VEC (gimple, heap) *work_list = NULL;
/* If the loop doesn't have a single exit we will fail anyway,
so do that early. */
if (!single_exit (loop))
continue;
/* If both flag_tree_loop_distribute_patterns and
flag_tree_loop_distribution are set, then only