aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2017-07-25 11:05:55 +0000
committerRichard Biener <rguenth@gcc.gnu.org>2017-07-25 11:05:55 +0000
commit01614e64b3c2fdbf700ee4c42228430853003eba (patch)
tree9551c9324aec4579e594ab6938f2b872bc8ab810
parent5ea71a5a7c9f25a7539bdc8c5ed7a92bf2e2115c (diff)
downloadgcc-01614e64b3c2fdbf700ee4c42228430853003eba.zip
gcc-01614e64b3c2fdbf700ee4c42228430853003eba.tar.gz
gcc-01614e64b3c2fdbf700ee4c42228430853003eba.tar.bz2
re PR tree-optimization/81546 (ICE at -O3 during GIMPLE pass dom)
2017-07-25 Richard Biener <rguenther@suse.de> PR middle-end/81546 * tree-ssa-operands.c (verify_imm_links): Remove cap on number of immediate uses, be more verbose on errors. From-SVN: r250505
-rw-r--r--gcc/ChangeLog6
-rw-r--r--gcc/tree-ssa-operands.c45
2 files changed, 39 insertions, 12 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 880b10e..ed281e8 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,5 +1,11 @@
2017-07-25 Richard Biener <rguenther@suse.de>
+ PR middle-end/81546
+ * tree-ssa-operands.c (verify_imm_links): Remove cap on number
+ of immediate uses, be more verbose on errors.
+
+2017-07-25 Richard Biener <rguenther@suse.de>
+
PR tree-optimization/81510
* tree-vect-loop.c (vect_is_simple_reduction): When the
reduction stmt is not inside the loop bail out.
diff --git a/gcc/tree-ssa-operands.c b/gcc/tree-ssa-operands.c
index fb843af..ed80442 100644
--- a/gcc/tree-ssa-operands.c
+++ b/gcc/tree-ssa-operands.c
@@ -1139,7 +1139,7 @@ DEBUG_FUNCTION bool
verify_imm_links (FILE *f, tree var)
{
use_operand_p ptr, prev, list;
- int count;
+ unsigned int count;
gcc_assert (TREE_CODE (var) == SSA_NAME);
@@ -1157,20 +1157,31 @@ verify_imm_links (FILE *f, tree var)
for (ptr = list->next; ptr != list; )
{
if (prev != ptr->prev)
- goto error;
+ {
+ fprintf (f, "prev != ptr->prev\n");
+ goto error;
+ }
if (ptr->use == NULL)
- goto error; /* 2 roots, or SAFE guard node. */
+ {
+ fprintf (f, "ptr->use == NULL\n");
+ goto error; /* 2 roots, or SAFE guard node. */
+ }
else if (*(ptr->use) != var)
- goto error;
+ {
+ fprintf (f, "*(ptr->use) != var\n");
+ goto error;
+ }
prev = ptr;
ptr = ptr->next;
- /* Avoid infinite loops. 50,000,000 uses probably indicates a
- problem. */
- if (count++ > 50000000)
- goto error;
+ count++;
+ if (count == 0)
+ {
+ fprintf (f, "number of immediate uses doesn't fit unsigned int\n");
+ goto error;
+ }
}
/* Verify list in the other direction. */
@@ -1178,15 +1189,25 @@ verify_imm_links (FILE *f, tree var)
for (ptr = list->prev; ptr != list; )
{
if (prev != ptr->next)
- goto error;
+ {
+ fprintf (f, "prev != ptr->next\n");
+ goto error;
+ }
prev = ptr;
ptr = ptr->prev;
- if (count-- < 0)
- goto error;
+ if (count == 0)
+ {
+ fprintf (f, "count-- < 0\n");
+ goto error;
+ }
+ count--;
}
if (count != 0)
- goto error;
+ {
+ fprintf (f, "count != 0\n");
+ goto error;
+ }
return false;