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

cfgrtl.c (rtl_tidy_fallthru_edge): Speed up by using EDGE_COUNT. 

* cfgrtl.c (rtl_tidy_fallthru_edge): Speed up by using
	EDGE_COUNT.

From-SVN: r91475
This commit is contained in:
Kazu Hirata 2004-11-29 17:58:27 +00:00 committed by Kazu Hirata
parent 03101c6f2b
commit afb7cf1807
2 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
gcc/ChangeLog
View File

@ -9,6 +9,9 @@
* cfgrtl.c (cfg_layout_redirect_edge_and_branch): Speed up by
simplifying edge manipulation.
* cfgrtl.c (rtl_tidy_fallthru_edge): Speed up by using
EDGE_COUNT.
2004-11-29 Alan Modra <amodra@bigpond.net.au>
* varasm.c (default_elf_select_section_1): Only pass DECL_P decl

8
gcc/cfgrtl.c
View File

@ -1201,12 +1201,6 @@ rtl_tidy_fallthru_edge (edge e)
{
rtx q;
basic_block b = e->src, c = b->next_bb;
edge e2;
edge_iterator ei;
FOR_EACH_EDGE (e2, ei, b->succs)
if (e == e2)
break;
/* ??? In a late-running flow pass, other folks may have deleted basic
blocks by nopping out blocks, leaving multiple BARRIERs between here
@ -1229,7 +1223,7 @@ rtl_tidy_fallthru_edge (edge e)
if (JUMP_P (q)
&& onlyjump_p (q)
&& (any_uncondjump_p (q)
|| (EDGE_SUCC (b, 0) == e && ei.index == EDGE_COUNT (b->succs) - 1)))
|| EDGE_COUNT (b->succs) == 1))
{
#ifdef HAVE_cc0
/* If this was a conditional jump, we need to also delete