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

gcc/testsuite/ChangeLog

+2005-06-15  Giovanni Bajo  <giovannibajo@libero.it>
+
+	* 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  <phython@gcc.gnu.org>
 
 	PR testsuite/22056

gcc/testsuite/gcc.dg/vect/vect-dv-2.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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;

gcc/testsuite/gcc.dg/vect/vect-ifcvt-2.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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); 
 

gcc/testsuite/gcc.dg/vect/vect-ifcvt-3.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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); 
 

gcc/testsuite/gcc.dg/vect/vect-ifcvt-4.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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); 
 

gcc/testsuite/gcc.dg/vect/vect-ifcvt-5.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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); 
 

gcc/testsuite/gcc.dg/vect/vect-ifcvt-6.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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); 
 

gcc/testsuite/gcc.dg/vect/vect-ifcvt-7.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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); 
 

gcc/testsuite/gcc.dg/vect/vect-ifcvt-9.c

@@ -2,6 +2,7 @@
 
 #include <stdarg.h>
 #include <signal.h>
+#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++)