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))
bar(float * pa,float * pb,float * pc)9 void bar (float *pa, float *pb, float *pc)
10 {
11 int i;
12
13 /* check results: */
14 for (i = 0; i < N/2; i++)
15 {
16 if (pa[i+1] != (pb[i+1] * pc[i+1]))
17 abort ();
18 }
19
20 return;
21 }
22
23 /* Unaligned pointer accesses, with a known alignment.
24 The loop bound is unknown.
25 No aliasing problems.
26 vect-54.c is similar to this one with one difference:
27 the loop bound is known. */
28
29 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57}; 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};
30
31 __attribute__ ((noinline)) int
main1(int n)32 main1 (int n)
33 {
34 int i;
35 float *pa = a;
36 float *pb = b;
37 float *pc = c;
38
39 for (i = 0; i < n/2; i++)
40 {
41 pa[i+1] = pb[i+1] * pc[i+1];
42 }
43
44 bar (a,b,c);
45
46 return 0;
47 }
48
main(void)49 int main (void)
50 {
51 int i;
52 int n=N;
53
54 check_vect ();
55 main1 (n);
56
57 return 0;
58 }
59
60 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
61 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
62 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_element_align_preferred } } } */
63