|
111
|
1 /* { dg-require-effective-target vect_float } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 16
|
|
|
7
|
|
|
8 float results1[N] = {192.00,240.00,288.00,336.00,384.00,432.00,480.00,528.00,0.00};
|
|
|
9 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};
|
|
|
10 float a[N] = {0};
|
|
|
11 float e[N] = {0};
|
|
|
12 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
|
|
|
13 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
|
|
|
14
|
|
|
15 __attribute__ ((noinline))
|
|
|
16 int main1 ()
|
|
|
17 {
|
|
|
18 int i;
|
|
|
19
|
|
|
20 for (i = 0; i < N/2; i++)
|
|
|
21 {
|
|
|
22 a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
|
|
|
23 e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
|
|
|
24 }
|
|
|
25
|
|
|
26 /* check results: */
|
|
|
27 for (i=0; i<N; i++)
|
|
|
28 {
|
|
|
29 if (a[i] != results1[i] || e[i] != results2[i])
|
|
|
30 abort();
|
|
|
31 }
|
|
|
32
|
|
|
33
|
|
|
34 for (i = 1; i <=N-4; i++)
|
|
|
35 {
|
|
|
36 a[i+3] = b[i-1];
|
|
|
37 }
|
|
|
38
|
|
|
39 /* check results: */
|
|
|
40 for (i = 1; i <=N-4; i++)
|
|
|
41 {
|
|
|
42 if (a[i+3] != b[i-1])
|
|
|
43 abort ();
|
|
|
44 }
|
|
|
45
|
|
|
46 return 0;
|
|
|
47 }
|
|
|
48
|
|
|
49 int main (void)
|
|
|
50 {
|
|
|
51 check_vect ();
|
|
|
52
|
|
|
53 return main1 ();
|
|
|
54 }
|
|
|
55
|
|
|
56 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
|
|
|
57 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target { { vect_aligned_arrays } && {! vect_sizes_32B_16B} } } } } */
|
|
|
58 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { {! vect_aligned_arrays } && {vect_sizes_32B_16B} } } } } */
|
