aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorPat Haugen <pthaugen@us.ibm.com>2005-06-17 21:42:08 +0000
committerDavid Edelsohn <dje@gcc.gnu.org>2005-06-17 17:42:08 -0400
commit1651e6408e11dec7af0dd3bff41473e5a7e478d1 (patch)
tree4e928e077a295583f5044b1cbbeb7b33a585796d /gcc
parent33674347e558340368b1ff447d09e978a2647708 (diff)
downloadgcc-1651e6408e11dec7af0dd3bff41473e5a7e478d1.zip
gcc-1651e6408e11dec7af0dd3bff41473e5a7e478d1.tar.gz
gcc-1651e6408e11dec7af0dd3bff41473e5a7e478d1.tar.bz2
bb-reorder.c (find_traces_1_round): Use succ block frequency instead of edge frequency for calls to better_edge_p.
2005-06-17 Pat Haugen <pthaugen@us.ibm.com> * bb-reorder.c (find_traces_1_round): Use succ block frequency instead of edge frequency for calls to better_edge_p. From-SVN: r101138
Diffstat (limited to 'gcc')
-rw-r--r--gcc/ChangeLog5
-rw-r--r--gcc/bb-reorder.c5
2 files changed, 8 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e20b9925..48e546c 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2005-06-17 Pat Haugen <pthaugen@us.ibm.com>
+
+ * bb-reorder.c (find_traces_1_round): Use succ block frequency
+ instead of edge frequency for calls to better_edge_p.
+
2005-06-17 Andrew Pinski <pinskia@physics.uc.edu>
PR tree-opt/22105
diff --git a/gcc/bb-reorder.c b/gcc/bb-reorder.c
index 2266ce5..185da15 100644
--- a/gcc/bb-reorder.c
+++ b/gcc/bb-reorder.c
@@ -504,7 +504,7 @@ find_traces_1_round (int branch_th, int exec_th, gcov_type count_th,
continue;
prob = e->probability;
- freq = EDGE_FREQUENCY (e);
+ freq = e->dest->frequency;
/* The only sensible preference for a call instruction is the
fallthru edge. Don't bother selecting anything else. */
@@ -522,7 +522,8 @@ find_traces_1_round (int branch_th, int exec_th, gcov_type count_th,
/* Edge that cannot be fallthru or improbable or infrequent
successor (i.e. it is unsuitable successor). */
if (!(e->flags & EDGE_CAN_FALLTHRU) || (e->flags & EDGE_COMPLEX)
- || prob < branch_th || freq < exec_th || e->count < count_th)
+ || prob < branch_th || EDGE_FREQUENCY (e) < exec_th
+ || e->count < count_th)
continue;
/* If partitioning hot/cold basic blocks, don't consider edges