1 /* { dg-require-effective-target vect_float } */
8 __attribute__ ((noinline
))
9 void bar (float *pa
, float *pb
, float *pc
)
14 for (i
= 0; i
< N
/2; i
++)
16 if (pa
[i
] != (pb
[i
+1] * pc
[i
+1]))
23 /* Unaligned pointer read accesses, aligned write access.
24 The loop bound is unknown
26 vect-52.c is similar to this one with one difference:
27 the alignment of the read accesses is unknown.
28 vect-56.c is similar to this one with one difference:
29 the loop bound is known.
30 vect-61.c is similar to this one with two differences:
31 aliasing is not a problem, and the write access has unknown alignment. */
33 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};
34 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};
36 __attribute__ ((noinline
)) int
40 float a
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)));
45 for (i
= 0; i
< n
/2; i
++)
47 pa
[i
] = pb
[i
+1] * pc
[i
+1];
51 for (i
= 0; i
< N
/2; i
++)
53 if (pa
[i
] != (pb
[i
+1] * pc
[i
+1]))
71 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
72 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
73 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
74 /* { dg-final { cleanup-tree-dump "vect" } } */