OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

bb-reorder.c (find_traces_1_round): Speed up by using EDGE_COUNT instead of FOR_EACH_EDGE.

Browse Source 
* bb-reorder.c (find_traces_1_round): Speed up by using
	EDGE_COUNT instead of FOR_EACH_EDGE.

From-SVN: r91386
This commit is contained in:
Kazu Hirata 2004-11-27 17:33:11 +00:00 committed by Kazu Hirata
parent cdef8bc6d1
commit 51027369ac
2 changed files with 5 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
gcc/ChangeLog
View File

@ -6,6 +6,9 @@
Replace operand_equal_p with operand_for_phi_arg_p
appropriately.
* bb-reorder.c (find_traces_1_round): Speed up by using
EDGE_COUNT instead of FOR_EACH_EDGE.
2004-11-27 John David Anglin <dave.anglin@nrc-cnrc.gc.ca>
PR pch/14940

10
gcc/bb-reorder.c
View File

@ -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);