FreeChainXenon/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

re PR tree-optimization/84584 ([graphite] ICE: Segmentation fault (in dominated_by_p))

Browse source 
2018-02-28  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/84584
	* graphite-scop-detection.c (scop_detection::add_scop): Discard
	SCoPs with fake exit edge.

	* gcc.dg/graphite/pr84584.c: New testcase.

From-SVN: r258070
This commit is contained in:
Richard Biener 2018-02-28 15:33:33 +00:00 • committed by Richard Biener
parent b44f8ad8b2
commit 0e0e545fc6
4 changed files with 43 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
gcc/ChangeLog
View file

@ -1,3 +1,9 @@
2018-02-28 Richard Biener <rguenther@suse.de>
PR tree-optimization/84584
* graphite-scop-detection.c (scop_detection::add_scop): Discard
SCoPs with fake exit edge.
2018-02-28 Martin Liska <mliska@suse.cz>
PR testsuite/84597

9
gcc/graphite-scop-detection.c
View file

@ -590,6 +590,15 @@ scop_detection::add_scop (sese_l s)
{
gcc_assert (s);
/* If the exit edge is fake discard the SCoP for now as we're removing the
fake edges again after analysis. */
if (s.exit->flags & EDGE_FAKE)
{
DEBUG_PRINT (dp << "[scop-detection-fail] Discarding infinite loop SCoP: ";
print_sese (dump_file, s));
return;
}
/* Include the BB with the loop-closed SSA PHI nodes, we need this
block in the region for code-generating out-of-SSA copies.
canonicalize_loop_closed_ssa makes sure that is in proper shape. */

5
gcc/testsuite/ChangeLog
View file

@ -1,3 +1,8 @@
2018-02-28 Richard Biener <rguenther@suse.de>
PR tree-optimization/84584
* gcc.dg/graphite/pr84584.c: New testcase.
2018-02-28 Jonathan Wakely <jwakely@redhat.com>
PR preprocessor/84517

23
gcc/testsuite/gcc.dg/graphite/pr84584.c Normal file
View file

@ -0,0 +1,23 @@
/* { dg-do compile } */
/* { dg-options "-O -fgraphite-identity -fno-tree-loop-im" } */
int q3, w1;
void
bw (int b8)
{
const int sd = 2;
int mc;
for (mc = 0; mc < sd; ++mc)
{
ik:
for (w1 = 0; w1 < sd; ++w1)
++b8;
}
for (q3 = 0; q3 < sd; ++q3)
;
goto ik;
}