Mercurial > hg > CbC > CbC_gcc
diff gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c @ 145:1830386684a0
gcc-9.2.0
author | anatofuz |
---|---|
date | Thu, 13 Feb 2020 11:34:05 +0900 |
parents | 84e7813d76e9 |
children |
line wrap: on
line diff
--- a/gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c Thu Oct 25 07:37:49 2018 +0900 +++ b/gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c Thu Feb 13 11:34:05 2020 +0900 @@ -1,4 +1,4 @@ -/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-profile" } */ +/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-profile-optimized" } */ unsigned int a[1000]; unsigned int b = 256; unsigned int c = 1024; @@ -25,8 +25,5 @@ return 0; } /* autofdo does not do value profiling so far */ -/* { dg-final-use-not-autofdo { scan-ipa-dump "Transformation done: mod power of 2" "profile" } } */ -/* This is part of code checking that n is power of 2, so we are sure that the transformation - didn't get optimized out. */ -/* { dg-final-use-not-autofdo { scan-tree-dump "n_\[0-9\]* \\+ (4294967295|0x0*ffffffff)" "optimized"} } */ +/* { dg-final-use-not-autofdo { scan-ipa-dump "Transformation done: div/mod by constant 256" "profile" } } */ /* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */