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