summaryrefslogtreecommitdiff
path: root/gcc/testsuite
diff options
context:
space:
mode:
authordpatel <dpatel@138bc75d-0d04-0410-961f-82ee72b054a4>2005-06-14 18:47:36 +0000
committerdpatel <dpatel@138bc75d-0d04-0410-961f-82ee72b054a4>2005-06-14 18:47:36 +0000
commit701f93f66914ae0e0c7a4428c54ff0b323471ca0 (patch)
tree189b9af7fe02d8498314cba76294c50de660381b /gcc/testsuite
parent6bbd6d48b0abdd98f76dab6ddb68ffacdf83fd2b (diff)
downloadgcc-701f93f66914ae0e0c7a4428c54ff0b323471ca0.tar.gz
Remove vect-ifcvt-1.c
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@100947 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/testsuite')
-rw-r--r--gcc/testsuite/ChangeLog4
-rw-r--r--gcc/testsuite/gcc.dg/vect/vect-ifcvt-1.c75
2 files changed, 4 insertions, 75 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index d189f5d2fe9..9b38bcd1d59 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,7 @@
+2005-06-14 Devang Patel <dpatel@apple.com>
+
+ * gcc.dg/vect/vect-ifcvt-1.c: Remove.
+
2005-06-14 Nathan Sidwell <nathan@codesourcery.com>
PR c++/21929
diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-1.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-1.c
deleted file mode 100644
index 7b40998568b..00000000000
--- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-1.c
+++ /dev/null
@@ -1,75 +0,0 @@
-/* { dg-require-effective-target vect_condition } */
-
-#include <stdarg.h>
-#include <signal.h>
-
-#define N 64
-#define MAX 42
-
-extern void abort(void);
-
-int main ()
-{
- int A[N];
- int B[N];
- int C[N];
- int D[N];
-
- int i, j;
-
- for (i = 0; i < N; i++)
- {
- A[i] = i;
- B[i] = i;
- C[i] = i;
- D[i] = i;
- }
-
- /* Vectorizable */
- for (i = 0; i < 16; i++)
- {
- A[i] = A[i+20];
- }
-
- /* check results: */
- for (i = 0; i < 16; i++)
- {
- if (A[i] != A[i+20])
- abort ();
- }
-
- /* Vectorizable */
- for (i = 0; i < 16; i++)
- {
- B[i] = B[i] + 5;
- }
-
- /* check results: */
- for (i = 0; i < 16; i++)
- {
- if (B[i] != C[i] + 5)
- abort ();
- }
-
- /* Not vectorizable */
- for (i = 0; i < 4; i++)
- {
- C[i] = C[i+3];
- }
-
- /* check results: */
- for (i = 0; i < 4; i++)
- {
- if (C[i] != D[i+3])
- abort ();
- }
-
-
- return 0;
-}
-
-
-
-/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
-/* { dg-final { scan-tree-dump-times "accesses have the same alignment." 2 "vect" } } */
-/* { dg-final { cleanup-tree-dump "vect" } } */