Mercurial > hg > CbC > CbC_gcc

comparison gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c @ 145:1830386684a0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
gcc-9.2.0
author anatofuz
date Thu, 13 Feb 2020 11:34:05 +0900
parents 84e7813d76e9
children
comparison
equal deleted inserted replaced
131:84e7813d76e9 145:1830386684a0
1 /* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-profile" } */ 1 /* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-profile-optimized" } */
2 unsigned int a[1000]; 2 unsigned int a[1000];
3 unsigned int b = 256; 3 unsigned int b = 256;
4 unsigned int c = 1024; 4 unsigned int c = 1024;
5 unsigned int d = 17; 5 unsigned int d = 17;
6 int 6 int
23 a[i] %= n; 23 a[i] %= n;
24 } 24 }
25 return 0; 25 return 0;
26 } 26 }
27 /* autofdo does not do value profiling so far */ 27 /* autofdo does not do value profiling so far */
28 /* { dg-final-use-not-autofdo { scan-ipa-dump "Transformation done: mod power of 2" "profile" } } */ 28 /* { dg-final-use-not-autofdo { scan-ipa-dump "Transformation done: div/mod by constant 256" "profile" } } */
29 /* This is part of code checking that n is power of 2, so we are sure that the transformation
30 didn't get optimized out. */
31 /* { dg-final-use-not-autofdo { scan-tree-dump "n_\[0-9\]* \\+ (4294967295|0x0*ffffffff)" "optimized"} } */
32 /* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */ 29 /* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */