|
111
|
1 /* { dg-require-effective-target vect_float } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 256
|
|
|
7
|
|
|
8 __attribute__ ((noinline))
|
|
|
9 void bar (float *pa, float *pb, float *pc)
|
|
|
10 {
|
|
|
11 int i;
|
|
|
12
|
|
|
13 /* check results: */
|
|
|
14 for (i = 0; i < N; i++)
|
|
|
15 {
|
|
|
16 if (pa[i] != (pb[i] * pc[i]))
|
|
|
17 abort ();
|
|
|
18 }
|
|
|
19
|
|
|
20 return;
|
|
|
21 }
|
|
|
22
|
|
|
23 /* Unaligned pointer read accesses, aligned pointer write access.
|
|
|
24 The loop bound is known and divisible by the vectorization factor.
|
|
|
25 Can't prove that the pointers don't alias.
|
|
|
26 vect-53.c is similar to this one with one difference:
|
|
|
27 the loop bound is unknown.
|
|
|
28 vect-48.c is similar to this one with one difference:
|
|
|
29 aliasing is not a problem. */
|
|
|
30
|
|
|
31 __attribute__ ((noinline)) int
|
|
|
32 main1 (float *pb, float *pc)
|
|
|
33 {
|
|
|
34 float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
35 int i;
|
|
|
36
|
|
|
37 for (i = 0; i < N; i++)
|
|
|
38 {
|
|
|
39 pa[i] = pb[i] * pc[i];
|
|
|
40 }
|
|
|
41
|
|
|
42 bar (pa,pb,pc);
|
|
|
43
|
|
|
44 return 0;
|
|
|
45 }
|
|
|
46
|
|
|
47 int main (void)
|
|
|
48 {
|
|
|
49 int i;
|
|
|
50 float b[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60};
|
|
|
51 float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
|
|
|
52
|
|
|
53 check_vect ();
|
|
|
54
|
|
|
55 main1 (b,c);
|
|
|
56 main1 (&b[1],c);
|
|
|
57
|
|
|
58 return 0;
|
|
|
59 }
|
|
|
60
|
|
|
61 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
