From: Jan Hubicka <jh@suse.cz>
Date: Mon, 13 Aug 2001 14:34:11 +0000 (+0200)
Subject: * analyze_brprob: Update for changes in gcc debug output.
X-Git-Tag: prereleases/libstdc++-3.0.95~2683
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=e961606cfd568508e8d96323c49ec731e9b231af;p=thirdparty%2Fgcc.git

* analyze_brprob: Update for changes in gcc debug output.

From-SVN: r44854
---

diff --git a/contrib/ChangeLog b/contrib/ChangeLog
index 72b853962608..f66db7f6c027 100644
--- a/contrib/ChangeLog
+++ b/contrib/ChangeLog
@@ -1,3 +1,7 @@
+Mon Aug 13 02:29:08 CEST 2001  Jan Hubicka  <jh@suse.cz>
+
+	* analyze_brprob: Update for changes in gcc debug output.
+
 Sat Jul 28 22:37:49 CEST 2001  Jan Hubicka  <jh@suse.cz>
 
 	* analyze_brprob: Avoid more overflows.
diff --git a/contrib/analyze_brprob b/contrib/analyze_brprob
index 5166e8492b70..3650e60c075f 100755
--- a/contrib/analyze_brprob
+++ b/contrib/analyze_brprob
@@ -128,9 +128,9 @@ BEGIN {nnames = 0}
   }
 END {
   # Heuristics called combined predicts just everything.
-  maxcounts = longeval(counts["first match"])
-  maxbranches = branches["first match"]
-  max = names["first match"]
+  maxcounts = longeval(counts["combined"])
+  maxbranches = branches["combined"]
+  max = names["combined"]
   printf("HEURISTICS                  BRANCHES  (REL)  HITRATE             COVERAGE  (REL)\n")
   for (i = 0; i < nnames ; i++)
    {