1 /* { dg-require-effective-target vect_int } */
2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
16 char b
[N
-1]; /* unaligned (offset 1B) */
17 char c
[N
]; /* aligned (offset NB) */
18 struct t d
; /* aligned (offset 2NB) */
19 struct t e
; /* unaligned (offset 2N+4N+4 B) */
22 __attribute__ ((noinline
))
29 for (i
= 0; i
< N
/2; i
++)
36 for (i
= 0; i
<N
/2; i
++)
43 for (i
= 0; i
< N
/2; i
++)
50 for (i
= 0; i
<N
/2; i
++)
57 for (i
= 0; i
< N
/2; i
++)
64 for (i
= 0; i
<N
/2; i
++)
71 for (i
= 0; i
< N
/2; i
++)
78 for (i
= 0; i
<N
/2; i
++)
94 /* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */
95 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */