ia64.c (ia64_single_set): Return first set for prologue_allocate_stack and…

ia64.c (ia64_single_set): Return first set for prologue_allocate_stack and epilogue_deallocate_stack...

	* config/ia64/ia64.c (ia64_single_set): Return first set for
	prologue_allocate_stack and epilogue_deallocate_stack instructions.

	* gcc.c-torture/compile/20011219-1.c: New test.

From-SVN: r48187

gcc/ChangeLog

+2001-12-19  Jakub Jelinek  <jakub@redhat.com>
+
+	* config/ia64/ia64.c (ia64_single_set): Return first set for
+	prologue_allocate_stack and epilogue_deallocate_stack instructions.
+
 2001-12-19  Dale Johannesen  <dalej@apple.com>
 
 	 * config/rs6000/rs6000.h: LEGITIMIZE_RELOAD_ADDRESS:

gcc/config/ia64/ia64.c

@@ -5226,12 +5226,27 @@ static rtx
 ia64_single_set (insn)
      rtx insn;
 {
-  rtx x = PATTERN (insn);
+  rtx x = PATTERN (insn), ret;
   if (GET_CODE (x) == COND_EXEC)
     x = COND_EXEC_CODE (x);
   if (GET_CODE (x) == SET)
     return x;
-  return single_set_2 (insn, x);
+  ret = single_set_2 (insn, x);
+  if (ret == NULL && GET_CODE (x) == PARALLEL)
+    {
+      /* Special case here prologue_allocate_stack and
+	 epilogue_deallocate_stack.  Although it is not a classical
+	 single set, the second set is there just to protect it
+	 from moving past FP-relative stack accesses.  */
+      if (XVECLEN (x, 0) == 2
+	  && GET_CODE (XVECEXP (x, 0, 0)) == SET
+	  && GET_CODE (XVECEXP (x, 0, 1)) == SET
+	  && GET_CODE (SET_DEST (XVECEXP (x, 0, 1))) == REG
+	  && SET_DEST (XVECEXP (x, 0, 1)) == SET_SRC (XVECEXP (x, 0, 1))
+	  && ia64_safe_itanium_class (insn) == ITANIUM_CLASS_IALU)
+	ret = XVECEXP (x, 0, 0);
+    }
+  return ret;
 }
 
 /* Adjust the cost of a scheduling dependency.  Return the new cost of

gcc/testsuite/ChangeLog

+2001-12-19  Jakub Jelinek  <jakub@redhat.com>
+
+	* gcc.c-torture/compile/20011219-1.c: New test.
+
 2001-12-19  Nathan Sidwell  <nathan@codesourcery.com>
 
 	* g++.dg/other/error1.C: New test.

gcc/testsuite/gcc.c-torture/compile/20011219-1.c

+/* This testcase failed on IA-64 at -O2 during scheduling.  */
+
+void * baz (unsigned long);
+static inline double **
+bar (long w, long x, long y, long z)
+{
+  long i, a = x - w + 1, b = z - y + 1;
+  double **m = (double **) baz (sizeof (double *) * (a + 1));
+
+  m += 1;
+  m -= w;
+  m[w] = (double *) baz (sizeof (double) * (a * b + 1));
+  m[w] += 1;
+  m[w] -= y;
+  for (i = w + 1; i <= x; i++)
+    m[i] = m[i - 1] + b;
+  return m;
+}
+
+void
+foo (double w[], int x, double y[], double z[])
+{
+  int i;
+  double **a;
+
+  a = bar (1, 50, 1, 50);
+  for (i = 1; i <= x; i++)
+    a[1][i] = - w[x - i] / w[x];
+}