diff options
Diffstat (limited to 'gcc/testsuite/gcc.dg/tree-ssa/ldist-4.c')
| -rw-r--r-- | gcc/testsuite/gcc.dg/tree-ssa/ldist-4.c | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ldist-4.c b/gcc/testsuite/gcc.dg/tree-ssa/ldist-4.c new file mode 100644 index 000000000..a744fea02 --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ldist-4.c @@ -0,0 +1,29 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */ + +int loop1 (int k) +{ + unsigned int i; + unsigned int j; + int a[100], b[100][100]; + + a[0] = k; + for (i = 1; i < 100; i ++) + { + for (j = 0; j < 100; j++) + { + a[j] = k * i; + b[i][j] = a[j-1] + k; + } + } + + return b[100-1][0]; +} + +/* We used to distribute also innermost loops, but these could produce + too much code in the outer loop, degrading performance of scalar + code. So this test was XFAILed because the cost model of the stand + alone distribution pass has evolved. Now it passes. */ +/* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" { target ilp32 } } } */ +/* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 1 "ldist" { target lp64 } } } */ +/* { dg-final { cleanup-tree-dump "ldist" } } */ |