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};
14 int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17};
18 __attribute__ ((noinline))
23 for (i = OFF; i < N+OFF; i++)
25 ib[i] = ib[i%8]*(i/8);
26 ic[i] = ic[i%8]*(i/8);
31 for (i = OFF; i < N; i++)
38 for (i = OFF; i < N; i++)
40 if (ia[i] != pib[i - OFF])
44 for (i = 0; i < N; i++)
51 for (i = 0; i < N; i++)
53 if (ia[i] != pib[i - OFF])
57 for (i = OFF; i < N; i++)
64 for (i = OFF; i < N; i++)
66 if (ia[i] != ic[i - OFF])
82 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
83 /* { dg-final { cleanup-tree-dump "vect" } } */