From: Giovanni Bajo Date: Thu, 16 Jun 2005 23:39:51 +0000 (+0200) Subject: vect-dv-2.c, [...]: Call check_vect to verify the presence of hardware vector support. X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=18338c6e737e1c097e5c551e8047dc046fb0d837;p=gcc.git vect-dv-2.c, [...]: Call check_vect to verify the presence of hardware vector support. * gcc.dg/vect/vect-dv-2.c, gcc.dg/vect/vect-ifcvt-2.c, gcc.dg/vect/vect-ifcvt-3.c, gcc.dg/vect/vect-ifcvt-4.c, gcc.dg/vect/vect-ifcvt-5.c, gcc.dg/vect/vect-ifcvt-6.c, gcc.dg/vect/vect-ifcvt-7.c, gcc.dg/vect/vect-ifcvt-9.c: Call check_vect to verify the presence of hardware vector support. From-SVN: r101114 --- diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index 4266bc98b72..d6b5619cfb5 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,11 @@ +2005-06-15 Giovanni Bajo + + * gcc.dg/vect/vect-dv-2.c, gcc.dg/vect/vect-ifcvt-2.c, + gcc.dg/vect/vect-ifcvt-3.c, gcc.dg/vect/vect-ifcvt-4.c, + gcc.dg/vect/vect-ifcvt-5.c, gcc.dg/vect/vect-ifcvt-6.c, + gcc.dg/vect/vect-ifcvt-7.c, gcc.dg/vect/vect-ifcvt-9.c: Call + check_vect to verify the presence of hardware vector support. + 2005-06-16 James A. Morrison PR testsuite/22056 diff --git a/gcc/testsuite/gcc.dg/vect/vect-dv-2.c b/gcc/testsuite/gcc.dg/vect/vect-dv-2.c index 69d619ed1ea..f8ee0280bf5 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-dv-2.c +++ b/gcc/testsuite/gcc.dg/vect/vect-dv-2.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 64 #define MAX 42 @@ -17,6 +18,8 @@ int main () int i, j; + check_vect (); + for (i = 0; i < N; i++) { A[i] = i; diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-2.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-2.c index b6f9f3f2bd2..74f6b9339cf 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-2.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-2.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -14,6 +15,8 @@ int main () int B[N] = {0,0,42,42,42,0,0,0,0,0,42,42,42,42,42,0}; int i, j; + check_vect (); + for (i = 0; i < 16; i++) A[i] = ( A[i] >= MAX ? MAX : 0); diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-3.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-3.c index 8d0bfec8988..3f591d9e6f7 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-3.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-3.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -14,6 +15,8 @@ int main () int B[N] = {0,0,0,42,42,0,0,0,0,0,42,42,42,42,42,0}; int i, j; + check_vect (); + for (i = 0; i < 16; i++) A[i] = ( A[i] > MAX ? MAX : 0); diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-4.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-4.c index a2f3a7b6b33..0d11c85d519 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-4.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-4.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -14,6 +15,8 @@ int main () int B[N] = {42,42,42,0,0,42,42,42,42,42,0,0,0,0,0,42}; int i, j; + check_vect (); + for (i = 0; i < 16; i++) A[i] = ( A[i] <= MAX ? MAX : 0); diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-5.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-5.c index b79b3ae7258..5ee9ba628e2 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-5.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-5.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -14,6 +15,8 @@ int main () int B[N] = {42,42,0,0,0,42,42,42,42,42,0,0,0,0,0,42}; int i, j; + check_vect (); + for (i = 0; i < 16; i++) A[i] = ( A[i] < MAX ? MAX : 0); diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-6.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-6.c index d40008b2119..6d01803fb49 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-6.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-6.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -14,6 +15,8 @@ int main () int B[N] = {42,42,0,42,42,42,42,0,42,42,42,42,42,0,42,42}; int i, j; + check_vect (); + for (i = 0; i < 16; i++) A[i] = ( A[i] != MAX ? MAX : 0); diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-7.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-7.c index 06e5a9e3d20..81b225bb93c 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-7.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-7.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -14,6 +15,8 @@ int main () int B[N] = {42,42,0,42,42,42,42,42,42,42,42,42,0,42,42,42}; int i, j; + check_vect (); + for (i = 0; i < 16; i++) A[i] = ( A[i] == MAX ? 0 : MAX); diff --git a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-9.c b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-9.c index fb948c9ad00..75941d7f10f 100644 --- a/gcc/testsuite/gcc.dg/vect/vect-ifcvt-9.c +++ b/gcc/testsuite/gcc.dg/vect/vect-ifcvt-9.c @@ -2,6 +2,7 @@ #include #include +#include "tree-vect.h" #define N 16 #define MAX 42 @@ -23,6 +24,7 @@ int main () { int i, j; + check_vect (); foo (); /* check results: */ for (i = 0; i < N; i++)