Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/tree-ssa/pr32044.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children | 1830386684a0 |
line wrap: on
line source
/* { dg-do compile } */ /* { dg-options "-O2 -fdump-tree-optimized" } */ int foo (int n) { while (n >= 45) n -= 45; return n; } int bar (int n) { while (n >= 64) n -= 64; return n; } int bla (int n) { int i = 0; while (n >= 45) { i++; n -= 45; } return i; } int baz (int n) { int i = 0; while (n >= 64) { i++; n -= 64; } return i; } /* The loops computing division/modulo by 64 should be eliminated */ /* { dg-final { scan-tree-dump-times "if" 6 "optimized" } } */ /* There should be no division/modulo in the final dump (division and modulo by 64 are done using bit operations). */ /* { dg-final { scan-tree-dump-times " / " 0 "optimized" } } */ /* { dg-final { scan-tree-dump-times " % " 0 "optimized" } } */