1/* { dg-require-effective-target vect_int } */ 2 3#include <stdarg.h> 4#include "tree-vect.h" 5 6#define N 16 7 8__attribute__ ((noinline)) 9int main1 () 10{ 11 int i, j; 12 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; 13 int ia[N*2][4][N]; 14 15 /* Multidimensional array. Aligned. 16 The first dimension depends on j: not vectorizable. */ 17 for (i = 0; i < N; i++) 18 { 19 for (j = 0; j < N; j++) 20 { 21 ia[i + j][1][j] = ib[i]; 22 } 23 } 24 25 /* check results: */ 26 for (i = 0; i < N; i++) 27 { 28 for (j = 0; j < N; j++) 29 { 30 if (ia[i + j][1][j] != ib[i]) 31 abort(); 32 } 33 } 34 35 return 0; 36} 37 38int main (void) 39{ 40 check_vect (); 41 42 return main1 (); 43} 44 45/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */ 46/* { dg-final { cleanup-tree-dump "vect" } } */ 47