1 /* { dg-require-effective-target size32plus } */
11 int A
[M
][M
], B
[M
][M
], C
[M
][M
];
13 static int __attribute__((noinline
))
18 for (i
= 0; i
< 24; i
++)
19 for (j
= 0; j
< 24; j
++)
20 for (k
= 0; k
< 24; k
++)
21 A
[i
][j
] = B
[i
][k
] * C
[k
][j
];
23 for (i
= 0; i
< M
; i
++)
24 for (j
= 0; j
< M
; j
++)
25 for (k
= 0; k
< M
; k
++)
26 A
[i
][j
] = B
[i
][k
] * C
[k
][j
];
28 return A
[0][0] + A
[M
-1][M
-1];
38 for (i
= 0; i
< M
; i
++)
39 for (j
= 0; j
< M
; j
++)
48 fprintf (stderr
, "res = %d \n", res
);
57 /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
58 /* { dg-final { cleanup-tree-dump "graphite" } } */