1 /* { dg-require-effective-target size32plus } */
20 for (i = 0; i < MAX; i++)
21 for (j = 0; j < MAX; j++)
27 for (i = 0; i < MAX; i++)
28 for (j = 0; j < MAX; j++)
29 A[i*MAX + j] += B[j*MAX + i];
31 for(i = 0; i < MAX; i++)
32 for(j = 0; j < MAX; j++)
36 fprintf (stderr, "sum = %d \n", sum);
45 /* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */
46 /* { dg-final { cleanup-tree-dump "graphite" } } */