diff options
Diffstat (limited to 'gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-3.c')
| -rw-r--r-- | gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-3.c | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-3.c b/gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-3.c new file mode 100644 index 000000000..72020aac7 --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-3.c @@ -0,0 +1,35 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-cddce1" } */ + +int main(void) +{ + unsigned i, j; + + for (i = 1, j = 0; i != 0; i+=2) + { + j += 500; + if (j % 7) + { + j++; + } + else + { + j--; + } + } + + return 0; +} + +/* We now can prove the infiniteness of the loop during CCP and fail + to eliminate the code inside the infinite loop because we start + by marking the j % 7 condition as useful. See PR45178. */ + +/* We should eliminate the inner condition, but the loop must be preserved + as it is infinite. Therefore there should be just one phi node (for i): */ +/* { dg-final { scan-tree-dump-times "PHI " 1 "cddce1" { xfail *-*-* } } } */ + +/* And one if (for the exit condition of the loop): */ +/* { dg-final { scan-tree-dump-times "if " 1 "cddce1" } } */ + +/* { dg-final { cleanup-tree-dump "cddce1" } } */ |