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, 0, 2, 6, 10, 14, 22, 26, 34};
15 __attribute__ ((noinline
))
16 int main1 (int *ib
, int off
)
21 for (i
= 0; i
< N
; i
++)
28 for (i
= 0; i
< N
; i
++)
30 if (ia
[i
] != ib
[i
+off
])
45 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
46 /* { dg-final { cleanup-tree-dump "vect" } } */