Merge to HEAD at tree-cleanup-merge-20041024 .
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-6.c
blob2c7d084d372f3a8c87b49e73a4143fb53f60a683
1 /* { dg-do run { target powerpc*-*-* } } */
2 /* { dg-do run { target i?86-*-* x86_64-*-* } } */
3 /* { dg-do run { target mipsisa64*-*-* } } */
4 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -maltivec" { target powerpc*-*-* } } */
5 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -msse2" { target i?86-*-* x86_64-*-* } } */
6 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -mpaired-single" { target mipsisa64*-*-* } } */
8 #include <stdarg.h>
9 #include "tree-vect.h"
11 #define N 16
13 float results1[N] = {192.00,240.00,288.00,336.00,384.00,432.00,480.00,528.00,0.00};
14 float results2[N] = {0.00,0.00,0.00,0.00,0.00,0.00,0.00,0.00,0.00,54.00,120.00,198.00,288.00,390.00,504.00,630.00};
16 int main1 ()
18 int i;
19 float a[N] = {0};
20 float e[N] = {0};
21 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
22 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
24 for (i = 0; i < N/2; i++)
26 a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
27 e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
30 /* check results: */
31 for (i=0; i<N; i++)
33 if (a[i] != results1[i] || e[i] != results2[i])
34 abort();
38 for (i = 1; i <=N-4; i++)
40 a[i+3] = b[i-1];
43 /* check results: */
44 for (i = 1; i <=N-4; i++)
46 if (a[i+3] != b[i-1])
47 abort ();
50 return 0;
53 int main (void)
55 check_vect ();
57 return main1 ();
60 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */