1 /* { dg-require-effective-target size32plus } */
16 for (i
= 0; i
< MAX
; i
++)
17 for (j
= 0; j
< MAX
; j
++)
23 for (i
= 0; i
< MAX
; i
++)
24 for (j
= 0; j
< MAX
; j
++)
25 A
[i
*MAX
+ j
] += B
[j
*MAX
+ i
];
29 for(i
= 0; i
< MAX
; i
++)
30 for(j
= 0; j
< MAX
; j
++)
36 /* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */
37 /* { dg-final { cleanup-tree-dump "graphite" } } */