diff options
author | steven <steven@138bc75d-0d04-0410-961f-82ee72b054a4> | 2003-12-11 00:20:51 +0000 |
---|---|---|
committer | steven <steven@138bc75d-0d04-0410-961f-82ee72b054a4> | 2003-12-11 00:20:51 +0000 |
commit | 5496dbfccb2ff4c2376e880ead7a87d7a9178609 (patch) | |
tree | 753b85b3ca471980585369128978b9ba6e133c3a /gcc/ra-build.c | |
parent | 65d06e81de1a9905f0d5d06ebd56c6bd40b842e4 (diff) | |
download | gcc-5496dbfccb2ff4c2376e880ead7a87d7a9178609.tar.gz |
2003-12-11 Steven Bosscher <steven@gcc.gnu.org>
* basic-block.h (BLOCK_HEAD, BLOCK_END): Remove.
(BLOCK_HEAD_TREE, BLOCK_END_TREE): Remove.
(basic_block_def): Rename `head' to `head_' and `end' to `end_'.
(BB_HEAD, BB_END): New accessor macros for the `head_' and `end_'
fields of a basic block.
* bb-reorder.c, bt-load.c, caller-save.c, cfg.c, cfganal.c,
cfgbuild.c, cfgcleanup.c, cfglayout.c, cfgloop.c, cfgloopanal.c,
cfgloopmanip.c, cfgrtl.c, combine.c, conflict.c, df.c, emit-rtl.c,
final.c, flow.c, function.c, gcse.c, global.c, graph.c,
haifa-sched.c, ifcvt.c, lcm.c, local-alloc.c, loop-unswitch.c,
loop.c, postreload.c, predict.c, profile.c, ra-build.c, ra-debug.c,
ra-rewrite.c, ra.c, recog.c, reg-stack.c, regclass.c, regmove.c,
regrename.c, reload1.c, resource.c, sched-ebb.c, sched-rgn.c,
sibcall.c, tracer.c, config/frv/frv.c, config/i386/i386.c,
config/ia64/ia64.c: Use the BB_HEAD and BB_END macros instead of
accessing the `head' and `end' fields of a basic block directly.
* gengtype.c: Add missing piece from earlier patch. Dunno what
I was thinking...
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@74520 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ra-build.c')
-rw-r--r-- | gcc/ra-build.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/gcc/ra-build.c b/gcc/ra-build.c index 896570ebf91..a305921c250 100644 --- a/gcc/ra-build.c +++ b/gcc/ra-build.c @@ -884,7 +884,7 @@ live_in_edge (struct df *df, struct curr_use *use, edge e) use->live_over_abnormal = 1; bitmap_set_bit (live_at_end[e->src->index], DF_REF_ID (use->wp->ref)); info_pred = (struct ra_bb_info *) e->src->aux; - next_insn = e->src->end; + next_insn = BB_END (e->src); /* If the last insn of the pred. block doesn't completely define the current use, we need to check the block. */ @@ -899,7 +899,7 @@ live_in_edge (struct df *df, struct curr_use *use, edge e) creation to later. */ bitmap_set_bit (info_pred->live_throughout, DF_REF_ID (use->wp->ref)); - next_insn = e->src->head; + next_insn = BB_HEAD (e->src); } return next_insn; } @@ -1033,7 +1033,7 @@ livethrough_conflicts_bb (basic_block bb) /* First collect the IDs of all defs, count the number of death containing insns, and if there's some call_insn here. */ all_defs = BITMAP_XMALLOC (); - for (insn = bb->head; insn; insn = NEXT_INSN (insn)) + for (insn = BB_HEAD (bb); insn; insn = NEXT_INSN (insn)) { if (INSN_P (insn)) { @@ -1048,7 +1048,7 @@ livethrough_conflicts_bb (basic_block bb) if (GET_CODE (insn) == CALL_INSN) contains_call = 1; } - if (insn == bb->end) + if (insn == BB_END (bb)) break; } @@ -2674,10 +2674,10 @@ detect_webs_set_in_cond_jump (void) { basic_block bb; FOR_EACH_BB (bb) - if (GET_CODE (bb->end) == JUMP_INSN) + if (GET_CODE (BB_END (bb)) == JUMP_INSN) { struct df_link *link; - for (link = DF_INSN_DEFS (df, bb->end); link; link = link->next) + for (link = DF_INSN_DEFS (df, BB_END (bb)); link; link = link->next) if (link->ref && DF_REF_REGNO (link->ref) >= FIRST_PSEUDO_REGISTER) { struct web *web = def2web[DF_REF_ID (link->ref)]; |