OSDN Git Service

* tree-vectorizer.c (vect_can_force_dr_alignment_p): Replace
[pf3gnuchains/gcc-fork.git] / gcc / testsuite / gcc.dg / vect / vect-6.c
1 /* { dg-do run { target powerpc*-*-* } } */
2 /* { dg-do run { target i?86-*-* x86_64-*-* } } */
3 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -maltivec" { target powerpc*-*-* } } */
4 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -msse2" { target i?86-*-* x86_64-*-* } } */
5
6 #include <stdarg.h>
7 #include "tree-vect.h"
8
9 #define N 16
10
11 float results1[N] = {192.00,240.00,288.00,336.00,384.00,432.00,480.00,528.00,0.00};
12 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};
13
14 int main1 ()
15 {
16   int i;
17   float a[N] = {0};
18   float e[N] = {0};
19   float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
20   float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
21
22   for (i = 0; i < N/2; i++)
23     { 
24       a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
25       e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
26     }
27
28   /* check results:  */
29   for (i=0; i<N; i++)
30     {
31       if (a[i] != results1[i] || e[i] != results2[i])
32         abort(); 
33     }
34
35
36   for (i = 1; i <=N-4; i++)
37     {
38       a[i+3] = b[i-1];
39     }
40
41   /* check results:  */
42   for (i = 1; i <=N-4; i++)
43     {
44       if (a[i+3] != b[i-1])
45         abort ();
46     }
47
48   return 0;
49 }
50
51 int main (void)
52 {
53   check_vect ();
54
55   return main1 ();
56 }
57
58 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
59
60