From: Jakub Jelinek <jakub@redhat.com>
Date: Fri, 2 Nov 2007 23:06:36 +0000 (+0100)
Subject: re PR middle-end/33670 (cc1 segfault with -O2 -fsched-stalled-insns=0 for twolf)
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=ec8628e835f6852551875ee1e916fae3d3980778;p=gcc.git

re PR middle-end/33670 (cc1 segfault with -O2 -fsched-stalled-insns=0 for twolf)

	PR middle-end/33670
	* haifa-sched.c (ok_for_early_queue_removal): Don't walk out of the
	current sched region.

	* gcc.dg/pr33670.c: New test.

From-SVN: r129863
---

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 6a6f682cbfb..4f1b10a1075 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+2007-11-03  Jakub Jelinek  <jakub@redhat.com>
+
+	PR middle-end/33670
+	* haifa-sched.c (ok_for_early_queue_removal): Don't walk out of the
+	current sched region.
+
 2007-11-02  Jakub Jelinek  <jakub@redhat.com>
 
 	* config/ia64/ia64.c (struct reg_write_state): Change into
diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index d3660089860..38d013672dc 100644
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -1590,6 +1590,12 @@ ok_for_early_queue_removal (rtx insn)
 	    {
 	      int cost;
 
+	      if (prev_insn == current_sched_info->prev_head)
+		{
+		  prev_insn = NULL;
+		  break;
+		}
+
 	      if (!NOTE_P (prev_insn))
 		{
 		  dep_t dep;
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index ccd4ccb2a5a..1cfe8ad30d0 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,8 @@
+2007-11-03  Jakub Jelinek  <jakub@redhat.com>
+
+	PR middle-end/33670
+	* gcc.dg/pr33670.c: New test.
+
 2007-11-02  Jakub Jelinek  <jakub@redhat.com>
 
 	PR c++/33516
diff --git a/gcc/testsuite/gcc.dg/pr33670.c b/gcc/testsuite/gcc.dg/pr33670.c
new file mode 100644
index 00000000000..5232af96548
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/pr33670.c
@@ -0,0 +1,19 @@
+/* PR middle-end/33670 */
+/* { dg-do compile } */
+/* { dg-options "-O2 -fsched-stalled-insns=0" } */
+
+struct B
+{
+  int p;
+  int n;
+};
+extern struct B ***b;
+extern int a;
+
+int
+foo (int d, int e)
+{
+  int c;
+  for (c = d; c <= e; c++)
+    b[a][c]->n = b[a][c]->p;
+}