1 /* { dg-require-effective-target vect_int } */
2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
9 __attribute__ ((noinline
))
13 int ib
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
16 /* Multidimensional array. Aligned.
17 The first dimension depends on j: use strided stores. */
18 for (i
= 0; i
< N
; i
++)
20 for (j
= 0; j
< N
; j
++)
22 ia
[i
+ j
][1][j
] = ib
[i
];
27 for (i
= 0; i
< N
; i
++)
30 for (j
= 0; j
< N
; j
++)
32 if (ia
[i
+ j
][1][j
] != ib
[i
])
47 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
48 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */