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