1 files changed, 76 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/testsuite/gcc.dg/vect/vect-strided-a-u8-i2-gap.c b/gcc-4.9/gcc/testsuite/gcc.dg/vect/vect-strided-a-u8-i2-gap.c
new file mode 100644
index 000000000..22030b06b
--- /dev/null
+++ b/gcc-4.9/gcc/testsuite/gcc.dg/vect/vect-strided-a-u8-i2-gap.c
@@ -0,0 +1,76 @@
+/* { dg-require-effective-target vect_int } */
+
+#include <stdarg.h>
+#include "tree-vect.h"
+
+#define N 64 
+
+typedef struct {
+   unsigned char a;
+   unsigned char b;
+} s;
+
+volatile int y = 0;
+
+__attribute__ ((noinline)) int
+main1 ()
+{
+  s arr[N];
+  s *ptr = arr;
+  s res[N];
+  int i;
+
+  for (i = 0; i < N; i++)
+    {
+      arr[i].a = i;
+      arr[i].b = i * 2;
+      if (y) /* Avoid vectorization.  */
+        abort ();
+    }
+
+  for (i = 0; i < N; i++)
+    {
+      res[i].a = ptr->a;
+      res[i].b = ptr->a;
+      ptr++;
+    }
+  
+  /* check results:  */
+  for (i = 0; i < N; i++)
+    {
+      if (res[i].a != arr[i].a
+          || res[i].b != arr[i].a)
+	abort ();
+    }
+
+  ptr = arr;
+  /* Not vectorizable: gap in store.  */ 
+  for (i = 0; i < N; i++)
+    {
+      res[i].a = ptr->b;
+      ptr++;
+    }
+
+  /* check results:  */
+  for (i = 0; i < N; i++)
+    {
+      if (res[i].a != arr[i].b)
+        abort ();
+    }
+
+
+  return 0;
+}
+
+int main (void)
+{
+  check_vect ();
+
+  main1 ();
+
+  return 0;
+}
+
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"  { target vect_strided2 } } } */
+/* { dg-final { cleanup-tree-dump "vect" } } */
+