Fix the direction of the scheduling window & Fix scheduling order within a row

From-SVN: r130567

gcc/ChangeLog

+2007-12-02  Ayal Zaks  <zaks@il.ibm.com>
+	    Revital Eres  <eres@il.ibm.com>
+
+	* modulo-sched.c (calculate_must_precede_follow,
+	try_scheduling_node_in_cycle): New functions.
+	(sms_schedule_by_order): Call the new functions.
+	(ps_insn_find_column): Use must_follow and must_precede only if
+	they are not NULL.
+	(ps_insn_advance_column): Likewise.
+
+2007-12-02  Ayal Zaks  <zaks@il.ibm.com>
+	    Revital Eres  <eres@il.ibm.com>
+
+	* modulo-sched.c (get_sched_window): Fix the direction of the
+	scheduling window and add dump info.
+
 2007-12-02  Samuel Tardieu  <sam@rfc1149.net>
 
 	* config/sh/sh.md (cmpgeusi_t): Fix condition.

gcc/testsuite/ChangeLog

+2007-12-02  Revital Eres  <eres@il.ibm.com>
+
+	* gcc.dg/sms-4.c: New testcase.
+
+2007-12-02  Vladimir Yanovsky  <yanov@il.ibm.com>
+            Revital Eres  <eres@il.ibm.com>
+
+	* gcc.dg/sms-3.c: New testcase.
+
 2007-12-01  Ollie Wild  <aaw@google.com>
 
 	PR c++/8171

gcc/testsuite/gcc.dg/sms-3.c

+/* { dg-do run } */
+/* { dg-options "-O2 -fmodulo-sched -funroll-loops" } */
+
+extern void abort (void);
+
+int X[1000]={0};
+int Y[1000]={0};
+
+extern void abort (void);
+
+int
+foo (int len, long a)
+{
+  int i;
+  long res = a;
+
+  len = 1000;
+  for (i = 0; i < len; i++)
+    res += X[i]* Y[i];
+
+  if (res != 601)
+    abort ();
+
+}
+
+int
+main ()
+{
+  X[0] = Y[1] = 2;
+  Y[0] = X[1] = 21;
+  X[2] = Y[3] = 3;
+  Y[2] = X[3] = 31;
+  X[4] = Y[5] = 4;
+  Y[4] = X[5] = 41;
+
+  foo (6, 3);
+  return 0;
+}
+

gcc/testsuite/gcc.dg/sms-4.c

+/* Inspired from sbitmap_a_or_b_and_c_cg function in sbitmap.c.  */
+/* { dg-do run } */
+/* { dg-options "-O2 -fmodulo-sched -fmodulo-sched-allow-regmoves" } */
+
+extern void abort (void);
+
+int a[5] = { 0, 1, 0, 0, 0 };
+int b[5] = { 0, 1, 0, 1, 0 };
+int c[5] = { 0, 0, 1, 1, 0 };
+int dst[5] = { 0, 0, 0, 0, 0 };
+
+void
+foo (int size, int *ap, int *bp, int *cp, int *dstp)
+{
+  unsigned int i, n = size;
+  int changed = 0;
+
+  for (i = 0; i < n; i++)
+    {
+      const int tmp = *ap++ | (*bp++ & *cp++);
+      changed |= *dstp ^ tmp;
+      *dstp++ = tmp;
+    }
+
+  if (changed == 0)
+    abort ();
+}
+
+int
+main ()
+{
+  foo (5, a, b, c, dst);
+  return 0;
+}
+