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__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17};
17 __attribute__ ((noinline))
23 for (i = OFF; i < N+OFF; i++)
25 ib[i] = ib[i%OFF]*(i/OFF);
29 for (i = 0; i < N; i++)
36 for (i = 0; i < N; i++)
38 if (ia[i] != ib[i+OFF])
54 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
55 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target vect_no_align } } } */
56 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail vect_no_align } } } */
57 /* { dg-final { cleanup-tree-dump "vect" } } */