1 files changed, 0 insertions, 57 deletions
diff --git a/gcc-4.8.1/gcc/testsuite/gcc.dg/vect/vect-75-big-array.c b/gcc-4.8.1/gcc/testsuite/gcc.dg/vect/vect-75-big-array.c
deleted file mode 100644
index 1c70cc2c5..000000000
--- a/gcc-4.8.1/gcc/testsuite/gcc.dg/vect/vect-75-big-array.c
+++ /dev/null
@@ -1,57 +0,0 @@
-/* { dg-require-effective-target vect_int } */
-
-#include <stdarg.h>
-#include "tree-vect.h"
-
-#define N 120
-#define OFF 8
-
-/* Check handling of accesses for which the "initial condition" -
-   the expression that represents the first location accessed - is
-   more involved than just an ssa_name.  */
-
-int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17};
-
-volatile int y = 0;
-
-__attribute__ ((noinline))
-int main1 (int *ib)
-{
-  int i;
-  int ia[N];
-
-  for (i = OFF; i < N+OFF; i++)
-    {
-      ib[i] = ib[i%OFF]*(i/OFF);
-      if (y)
-	abort ();
-    }
-  for (i = 0; i < N; i++)
-    {
-      ia[i] = ib[i+OFF];
-    }
-
-
-  /* check results:  */
-  for (i = 0; i < N; i++)
-    {
-     if (ia[i] != ib[i+OFF])
-        abort ();
-    }
-
-  return 0;
-}
-
-int main (void)
-{
-  check_vect ();
-
-  main1 (ib);
-  return 0;
-}
-
-
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
-/*  { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target vect_no_align } } } */
-/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail vect_no_align } } } */
-/* { dg-final { cleanup-tree-dump "vect" } } */