* tree-vectorizer.c: New File: loop vectorization on SSAed GIMPLE trees.

[pf3gnuchains/gcc-fork.git] / gcc / testsuite / gcc.dg / vect / vect-30.c

diff --git a/gcc/testsuite/gcc.dg/vect/vect-30.c b/gcc/testsuite/gcc.dg/vect/vect-30.c
new file mode 100644 (file)
index 0000000..0e42679
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/vect/vect-30.c
@@ -0,0 +1,65 @@
+/* { dg-do run { target powerpc*-*-* } } */
+/* { dg-do run { target i?86-*-* x86_64-*-* } } */
+/* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -maltivec" { target powerpc*-*-* } } */
+/* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -msse2" { target i?86-*-* x86_64-*-* } } */
+
+#include <stdarg.h>
+#include "tree-vect.h"
+
+#define N 16
+
+float b[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};
+float a[N];
+float c[N];
+
+int main1 (int n)
+{
+  int i=0;
+
+  /* Vectorized: unknown loop bound.  */
+  while (n--) {
+    a[i] = b[i];
+    i++;
+  }
+
+  /* check results:  */
+  for (i = 0; i < n; i++)
+    {
+      if (a[i] != b[i])
+        abort ();
+    }
+
+  return 0;
+}
+
+int main2 (unsigned int n)
+{
+  int i=0;
+  int nn = n;
+
+  /* Vectorized: unknown loop bound.  */
+  while (n--) {
+    c[i] = b[i];
+    i++;
+  }
+
+  /* check results:  */
+  for (i = 0; i < nn; i++)
+    {
+      if (c[i] != b[i])
+        abort ();
+    }
+
+  return 0;
+}
+
+int main (void)
+{ 
+  check_vect ();
+  
+  main1 (N);
+  main2 (N);
+  return 0;
+}
+
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { xfail *-*-* } } } */