111
|
1 /* { dg-require-effective-target vect_int } */
|
|
2
|
|
3 #include <stdarg.h>
|
|
4 #include "tree-vect.h"
|
|
5
|
131
|
6 #if VECTOR_BITS > 128
|
|
7 #define N (VECTOR_BITS / 8)
|
|
8 #else
|
111
|
9 #define N 16
|
131
|
10 #endif
|
|
11
|
111
|
12 __attribute__ ((noinline))
|
|
13 int main1 ()
|
|
14 {
|
|
15 struct {
|
|
16 char ca[N];
|
|
17 } s;
|
|
18 int i;
|
|
19
|
|
20 for (i = 0; i < N; i++)
|
|
21 {
|
|
22 s.ca[i] = 5;
|
|
23 }
|
|
24
|
|
25 /* check results: */
|
|
26 for (i = 0; i < N; i++)
|
|
27 {
|
|
28 if (s.ca[i] != 5)
|
|
29 abort ();
|
|
30 }
|
|
31
|
|
32 return 0;
|
|
33 }
|
|
34
|
|
35 int main (void)
|
|
36 {
|
|
37 check_vect ();
|
|
38
|
|
39 return main1 ();
|
|
40 }
|
|
41
|
|
42 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
131
|
43 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
|