git
/
gcc
mirror of git://gcc.gnu.org/git/gcc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

* analyze_brprob: Fix awk compatibility problems; update comment. 

From-SVN: r44266
This commit is contained in:
Jan Hubicka 2001-07-23 15:55:28 +02:00 committed by Jan Hubicka
parent bfa7942289
commit 4edc91ae51
2 changed files with 12 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
contrib/ChangeLog
View File

@ -1,3 +1,7 @@
Mon Jul 23 15:47:19 CEST 2001 Jan Hubicka <jh@suse.cz>
* analyze_brprob: Fix awk compatibility problems; update comment.
2001-07-23 Andreas Jaeger <aj@suse.de> 2001-07-23 Andreas Jaeger <aj@suse.de>
* analyze_brprob: Fix more typos. * analyze_brprob: Fix more typos.

17
contrib/analyze_brprob
View File

@ -36,7 +36,6 @@
# saved into *.life dumps. You need to pass the -df switch to the compiler as well # saved into *.life dumps. You need to pass the -df switch to the compiler as well
# as -fbranch-probabilities to get the results of profiling noted in the dumps. # as -fbranch-probabilities to get the results of profiling noted in the dumps.
# Ensure that there are no "Arc profiling: some edge counts were bad." warnings. # Ensure that there are no "Arc profiling: some edge counts were bad." warnings.
# Keep the -fprofile-arcs switch to ensure that CFGs match.
# Step 3: Run this script to concatenate all *.life files: # Step 3: Run this script to concatenate all *.life files:
# analyze_brprob `find . -name *.life` # analyze_brprob `find . -name *.life`
# the information is collected and print once all files are parsed. This # the information is collected and print once all files are parsed. This
@ -124,26 +123,26 @@ BEGIN {nnames = 0}
#BC crashes on long strings. Irritating. #BC crashes on long strings. Irritating.
if (length(counts[name]) > 4000) if (length(counts[name]) > 4000)
{ {
counts[name] = longeval (counts[name]) counts[name] = longeval(counts[name])
hits[name] = longeval (hits[name]) hits[name] = longeval(hits[name])
phits[name] = longeval (phits[name]) phits[name] = longeval(phits[name])
} }
} }
END { END {
# Heuristics called combined predicts just everything. # Heuristics called combined predicts just everything.
maxcounts = longeval (counts["first match"]) maxcounts = longeval(counts["first match"])
maxbranches = branches["first match"] maxbranches = branches["first match"]
max = names["first match"] max = names["first match"]
printf("HEURISTICS BRANCHES (REL) HITRATE COVERAGE (REL)\n") printf("HEURISTICS BRANCHES (REL) HITRATE COVERAGE (REL)\n")
for (i = 0; i < nnames ; i++) for (i = 0; i < nnames ; i++)
{ {
name = names[i] name = names[i]
counts[name] = longeval (counts[name]) counts[name] = longeval(counts[name])
printf ("%-27s %8i %5.1f%% %6s%%/%6s%% %12s %5.1f%%\n", printf ("%-27s %8i %5.1f%% %6s%%/%6s%% %12s %5.1f%%\n",
name, name,
branches[name], branches[name] * 100 / maxbranches, branches[name], branches[name] * 100 / maxbranches,
longeval ("("hits[name]") * 100 /(" counts[name]"-0.00001)"), longeval("("hits[name]") * 100 /(" counts[name]"-0.00001)"),
longeval ("("phits[name]") * 100 /(" counts[name]"-0.00001)"), longeval("("phits[name]") * 100 /(" counts[name]"-0.00001)"),
counts[name], longeval (counts[name]" * 100 / ("maxcounts"-0.00001)")) counts[name], longeval(counts[name]" * 100 / ("maxcounts"-0.00001)"))
} }
} }