OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR tree-optimization/80901 (ICE on valid code at -Os and above on x86_64-linux-gnu: in verify_loop_structure, at cfgloop.c:1644) 

2017-05-30  Richard Biener  <rguenther@suse.de>

	PR middle-end/80901
	* cfgexpand.c (expand_gimple_cond): Match up loop fixup with
	split_edge code.

	* gcc.dg/torture/pr80901.c: New testcase.

From-SVN: r248681
This commit is contained in:
Richard Biener 2017-05-30 11:08:36 +00:00 committed by Richard Biener
parent 4d3d23fb7d
commit ba7629e2dd
4 changed files with 48 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2017-05-30 Richard Biener <rguenther@suse.de>
PR middle-end/80901
* cfgexpand.c (expand_gimple_cond): Match up loop fixup with
split_edge code.
2017-05-24 Robin Dapp <rdapp@linux.vnet.ibm.com>
* tree-vect-data-refs.c (vect_get_peeling_costs_all_drs):

9
gcc/cfgexpand.c
View File

@ -2503,10 +2503,11 @@ expand_gimple_cond (basic_block bb, gcond *stmt)
false_edge->flags |= EDGE_FALLTHRU;
new_bb->count = false_edge->count;
new_bb->frequency = EDGE_FREQUENCY (false_edge);
add_bb_to_loop (new_bb, dest->loop_father);
if (dest->loop_father->latch == bb
&& dest->loop_father->header == dest)
dest->loop_father->latch = new_bb;
loop_p loop = find_common_loop (bb->loop_father, dest->loop_father);
add_bb_to_loop (new_bb, loop);
if (loop->latch == bb
&& loop->header == dest)
loop->latch = new_bb;
new_edge = make_edge (new_bb, dest, 0);
new_edge->probability = REG_BR_PROB_BASE;
new_edge->count = new_bb->count;

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
2017-05-30 Richard Biener <rguenther@suse.de>
PR middle-end/80901
* gcc.dg/torture/pr80901.c: New testcase.
2017-05-30 Robin Dapp <rdapp@linux.vnet.ibm.com>
* gcc.target/s390/vector/vec-nopeel-2.c: New test.

32
gcc/testsuite/gcc.dg/torture/pr80901.c Normal file
View File

@ -0,0 +1,32 @@
/* { dg-do compile } */
int a, b, c, d;
int fn1 ()
{
int f;
if (d)
while (c)
{
for (f = 0; f < 1; f++)
{
int g[70] = { 0 };
if (b)
;
else
{
int h = !b;
for (; h; h = 1)
;
}
}
return 0;
}
return a;
}
int main ()
{
fn1 ();
return 0;
}