diff options
author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-11-27 17:33:11 +0000 |
---|---|---|
committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-11-27 17:33:11 +0000 |
commit | 9c745380d8b34e035d1e25cc85b423fad5f77a7b (patch) | |
tree | 3e71f09b7e3fe94204b57b2bbf9576fcb7c9e4f6 /gcc/bb-reorder.c | |
parent | 5373158fd475af45c768f0438333866c9f4eb756 (diff) | |
download | gcc-9c745380d8b34e035d1e25cc85b423fad5f77a7b.tar.gz |
* bb-reorder.c (find_traces_1_round): Speed up by using
EDGE_COUNT instead of FOR_EACH_EDGE.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@91386 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/bb-reorder.c')
-rw-r--r-- | gcc/bb-reorder.c | 10 |
1 files changed, 2 insertions, 8 deletions
diff --git a/gcc/bb-reorder.c b/gcc/bb-reorder.c index 603f921c5e8..774affb7678 100644 --- a/gcc/bb-reorder.c +++ b/gcc/bb-reorder.c @@ -638,14 +638,8 @@ find_traces_1_round (int branch_th, int exec_th, gcov_type count_th, { /* The loop has less than 4 iterations. */ - /* Check whether there is another edge from BB. */ - edge another_edge; - FOR_EACH_EDGE (another_edge, ei, bb->succs) - if (another_edge != best_edge) - break; - - if (!another_edge && copy_bb_p (best_edge->dest, - !optimize_size)) + if (EDGE_COUNT (bb->succs) == 1 + && copy_bb_p (best_edge->dest, !optimize_size)) { bb = copy_bb (best_edge->dest, best_edge, bb, *n_traces); |