1 /* { dg-require-effective-target vect_int } */
2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
10 /* Check handling of accesses for which the "initial condition" -
11 the expression that represents the first location accessed - is
12 more involved than just an ssa_name. */
14 int ib
[N
+OFF
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
15 int ic
[N
+OFF
] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
17 __attribute__ ((noinline
))
23 for (i
= OFF
; i
< N
; i
++)
31 for (i
= OFF
; i
< N
; i
++)
33 if (ia
[i
] != pib
[i
- OFF
])
37 for (i
= 0; i
< N
; i
++)
45 for (i
= 0; i
< N
; i
++)
47 if (ia
[i
] != pib
[i
- OFF
])
51 for (i
= OFF
; i
< N
; i
++)
59 for (i
= OFF
; i
< N
; i
++)
61 if (ia
[i
] != ic
[i
- OFF
])
77 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
78 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */