14 for (i = 0; i < MAX; i++)
15 for (j = 0; j < MAX; j++)
21 for (i = 0; i < MAX; i++)
22 for (j = 0; j < MAX; j++)
23 A[i*MAX + j] += B[j*MAX + i];
27 /* FIXME: For now, reductions are not handled by the code generation
28 of graphite. We have to bound the scop to the above loops. */
30 for(i = 0; i < MAX; i++)
31 for(j = 0; j < MAX; j++)
37 /* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */
38 /* { dg-final { cleanup-tree-dump "graphite" } } */