Initial checkin of GCC 4.9.0 from trunk (r208799).

Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba

1 files changed, 59 insertions, 0 deletions

diff --git a/gcc-4.9/gcc/testsuite/gcc.dg/vect/vect-cond-6.c b/gcc-4.9/gcc/testsuite/gcc.dg/vect/vect-cond-6.c
new file mode 100644
index 000000000..944c9c272
--- /dev/null
+++ b/gcc-4.9/gcc/testsuite/gcc.dg/vect/vect-cond-6.c
@@ -0,0 +1,59 @@
+/* { dg-require-effective-target vect_condition } */
+
+#include <stdarg.h>
+#include "tree-vect.h"
+
+#define K 32
+
+int cond_array[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
+int a[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
+int out[K];
+
+__attribute__ ((noinline)) void 
+foo (int c)
+{
+  int res, i, j, k, next;
+
+  for (k = 0; k < K; k++)
+    {
+      for (j = 0; j < K; j++) 
+        {
+          res = 0;
+          for (i = 0; i < K; i++)
+            { 
+              next = a[i][j]; 
+              res = c > cond_array[i+k][j] ? next : res;
+            }
+ 
+          out[j] = res;
+        }
+    }
+}
+
+int main ()
+{
+  int i, j, k;
+
+  check_vect ();
+
+  for  (j = 0; j < K; j++)
+    {
+      for (i = 0; i < 2*K; i++)
+        cond_array[i][j] = i+j;
+
+      for (i = 0; i < K; i++)
+        a[i][j] = i+2;
+    }
+
+  foo(125);
+
+  for (k = 0; k < K; k++) 
+    if (out[k] != 33)
+      abort ();
+
+  return 0;
+}
+
+/* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */
+/* { dg-final { cleanup-tree-dump "vect" } } */
+