re PR middle-end/33670 (cc1 segfault with -O2 -fsched-stalled-insns=0 for twolf)
authorJakub Jelinek <jakub@redhat.com>
Fri, 2 Nov 2007 23:06:36 +0000 (00:06 +0100)
committerJakub Jelinek <jakub@gcc.gnu.org>
Fri, 2 Nov 2007 23:06:36 +0000 (00:06 +0100)
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

gcc/ChangeLog
gcc/haifa-sched.c
gcc/testsuite/ChangeLog
gcc/testsuite/gcc.dg/pr33670.c [new file with mode: 0644]

index 6a6f682cbfb8ba27574bea2e2d0eb5fb30ca2c14..4f1b10a107551b439960176fd86576dad2e89d66 100644 (file)
@@ -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
index d36600898600399fd832101b3ff7a490f5ce8ac2..38d013672dc313e73028ba75aa4ba6957daf3f46 100644 (file)
@@ -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;
index ccd4ccb2a5a3d1d133e66922c3567fd6c999b1aa..1cfe8ad30d089b3a28c7d006541fd28935f1b962 100644 (file)
@@ -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 (file)
index 0000000..5232af9
--- /dev/null
@@ -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;
+}