1 /* { dg-require-effective-target vect_int } */
9 /* Check handling of accesses for which the "initial condition" -
10 the expression that represents the first location accessed - is
11 more involved than just an ssa_name. */
13 int ib[N+OFF] __attribute__ ((__aligned__(16))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
19 int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
21 for (i = OFF; i < N; i++)
28 for (i = OFF; i < N; i++)
30 if (ia[i] != pib[i - OFF])
34 for (i = 0; i < N; i++)
41 for (i = 0; i < N; i++)
43 if (ia[i] != pib[i - OFF])
47 for (i = OFF; i < N; i++)
54 for (i = OFF; i < N; i++)
56 if (ia[i] != ic[i - OFF])
72 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
73 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
74 /* { dg-final { cleanup-tree-dump "vect" } } */