1 /* { dg-require-effective-target vect_int } */
14 struct s a; /* array a.n is unaligned */
17 struct s e[N]; /* array e.n is aligned */
25 for (i = 0; i < N; i++)
26 for (j = 3; j < N-3; j++)
28 tmp1.e[i].n[1][2][j] = 8;
32 for (i = 0; i < N; i++)
33 for (j = 3; j < N-3; j++)
35 if (tmp1.e[i].n[1][2][j] != 8)
40 for (i = 0; i < N; i++)
41 for (j = 3; j < N-3; j++)
43 tmp1.e[j].n[1][2][j] = 8;
47 for (i = 0; i < N; i++)
48 for (j = 3; j < N-3; j++)
50 if (tmp1.e[j].n[1][2][j] != 8)
64 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
65 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
66 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
67 /* { dg-final { cleanup-tree-dump "vect" } } */