diff options
| author | Nathan Froyd <froydnj@codesourcery.com> | 2010-10-21 02:33:33 +0000 |
|---|---|---|
| committer | Nathan Froyd <froydnj@gcc.gnu.org> | 2010-10-21 02:33:33 +0000 |
| commit | 0fd4b31d684af56704c69cdbc8a0c891403ac672 (patch) | |
| tree | 46c04a0ca71f226e6c7a15bdb22ae8bb69768800 /gcc/cfgrtl.c | |
| parent | b56f8e7c2adbbb60bbb3aef976dc6ebb22810f22 (diff) | |
| download | gcc-0fd4b31d684af56704c69cdbc8a0c891403ac672.zip gcc-0fd4b31d684af56704c69cdbc8a0c891403ac672.tar.gz gcc-0fd4b31d684af56704c69cdbc8a0c891403ac672.tar.bz2 | |
basic-block.h (find_fallthru_edge): Define.
* basic-block.h (find_fallthru_edge): Define.
* cfgcleanup.c (merge_blocks_move): Use it.
(try_crossjump_bb): Likewise.
* cfglayout.c (fixup_reorder_chains): Likewise.
(fixup_fallthru_exit_predecessor): Likewise.
* cfgrtl.c (rtl_split_edge): Likewise.
(rtl_verify_flow_info): Likewise.
* function.c (thread_prologue_and_epilogue_insns): Likewise.
* gimple-pretty-print.c (dump_implicit_edges): Likewise.
* ifcvt.c (block_fallthru): Likewise.
* reload1.c (fixup_abnormal_edges): Likewise.
* sched-ebb.c (being_schedule_ready): Likewise.
(schedule_ebb): Likwise.
* sched-rgn.c (find_single_block_region): Likewise.
* sel-sched-ir.c (bb_ends_ebb_p): Likewise.
* tree-complex.c (expand_complex_move): Likewise.
* sched-int.h (find_fallthru_edge): Rename to...
(find_fallthru_edge_from): ...this.
* haifa-sched.c (find_fallthru_edge): Rename to...
(find_fallthru_edge_from): ...this. Use new find_fallthru_edge.
(init_before_recovery): Call find_fallthru_edge_from.
* sel-sched-ir.c (merge_fences): Likewise.
* sel-sched.c (in_fallthru_bb_p): Likewise.
(move_cond_jump): Likewise.
From-SVN: r165748
Diffstat (limited to 'gcc/cfgrtl.c')
| -rw-r--r-- | gcc/cfgrtl.c | 12 |
1 files changed, 2 insertions, 10 deletions
diff --git a/gcc/cfgrtl.c b/gcc/cfgrtl.c index f7ce558..e46050d 100644 --- a/gcc/cfgrtl.c +++ b/gcc/cfgrtl.c @@ -1370,12 +1370,7 @@ rtl_split_edge (edge edge_in) Avoid existence of fallthru predecessors. */ if ((edge_in->flags & EDGE_FALLTHRU) == 0) { - edge e; - edge_iterator ei; - - FOR_EACH_EDGE (e, ei, edge_in->dest->preds) - if (e->flags & EDGE_FALLTHRU) - break; + edge e = find_fallthru_edge (edge_in->dest->preds); if (e) force_nonfallthru (e); @@ -2068,7 +2063,6 @@ rtl_verify_flow_info (void) FOR_EACH_BB_REVERSE (bb) { edge e; - edge_iterator ei; rtx head = BB_HEAD (bb); rtx end = BB_END (bb); @@ -2122,9 +2116,7 @@ rtl_verify_flow_info (void) last_head = PREV_INSN (x); - FOR_EACH_EDGE (e, ei, bb->succs) - if (e->flags & EDGE_FALLTHRU) - break; + e = find_fallthru_edge (bb->succs); if (!e) { rtx insn; |