1 files changed, 39 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/testsuite/gcc.dg/vect/pr43430-1.c b/gcc-4.9/gcc/testsuite/gcc.dg/vect/pr43430-1.c
new file mode 100644
index 000000000..9eaa23cca
--- /dev/null
+++ b/gcc-4.9/gcc/testsuite/gcc.dg/vect/pr43430-1.c
@@ -0,0 +1,39 @@
+/* { dg-require-effective-target vect_int } */
+
+#include <stdarg.h>
+#include "tree-vect.h"
+
+#define N 16
+
+typedef int myint;
+myint data_ch1[N + 1] =
+  { 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30 };
+myint data_ch2[N + 1] =
+  { 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30 };
+#define SUM 480
+
+__attribute__ ((noinline)) int
+foo (myint * s1, myint * s2, int stride)
+{
+  int score = 0;
+  int x;
+  for (x = 0; x < N; x++)
+    score += ((s1[x] - s1[x + stride] + s2[x + stride]) >= 0 ?
+	      s1[x] + s2[x + stride] :
+	      s2[x + stride]);
+
+  if (score != SUM)
+    abort ();
+
+  return 0;
+}
+
+int
+main (void)
+{
+  check_vect ();
+  return foo (data_ch1, data_ch2, 1);
+}
+
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_condition } } } */
+/* { dg-final { cleanup-tree-dump "vect" } } */