1#define N 500 2 3int foo(void) 4{ 5 int i, j, k; 6 int A[N+5][N+5][N+5]; 7 8 /* Loop i: carried no dependency. */ 9 for (i = 0; i < N; i++) 10 for (j = 0; j < N; j++) 11 for (k = 0; k < N; k++) 12 A[k+1][j+2][i+1] = A[k][j][i+1]; 13 14 for (i = 0; i < N; i++) 15 /* Loop j: carried no dependency. */ 16 for (j = 0; j < N; j++) 17 /* Loop k: carreid no dependency. */ 18 for (k = 0; k < N; k++) 19 A[i+1][j][k] = A[i][j][k+1]; 20 21 return A[1][5][2]; 22} 23 24int main(void) 25{ 26 foo(); 27 28 return 0; 29} 30 31/* Check that parallel code generation part make the right answer. */ 32/* { dg-final { scan-tree-dump-times "3 loops carried no dependency" 1 "graphite" } } */ 33/* { dg-final { cleanup-tree-dump "graphite" } } */ 34/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */ 35/* { dg-final { cleanup-tree-dump "parloops" } } */ 36/* { dg-final { cleanup-tree-dump "optimized" } } */ 37