1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
8 int a[100], b[100][100];
11 for (i = 1; i < 100; i ++)
13 for (j = 0; j < 100; j++)
23 /* We used to distribute also innermost loops, but these could produce
24 too much code in the outer loop, degrading performance of scalar
25 code. So this test was XFAILed because the cost model of the stand
26 alone distribution pass has evolved. Now it passes. */
27 /* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" { target ilp32 } } } */
28 /* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 1 "ldist" { target lp64 } } } */
29 /* { dg-final { cleanup-tree-dump "ldist" } } */