diff options
| author | aoliva <aoliva@138bc75d-0d04-0410-961f-82ee72b054a4> | 2001-01-07 02:26:51 +0000 |
|---|---|---|
| committer | aoliva <aoliva@138bc75d-0d04-0410-961f-82ee72b054a4> | 2001-01-07 02:26:51 +0000 |
| commit | d3ff0f753948e4e595c6cf3d77ac1b05c655b464 (patch) | |
| tree | 17de3bb34420626f8eab111aee34a18e3a1f275f /gcc/reload.h | |
| parent | 0351a03252ba852c678fade3693ba70f6a75cdf4 (diff) | |
| download | gcc-d3ff0f753948e4e595c6cf3d77ac1b05c655b464.tar.gz | |
* reload.c (subst_reloads): Take INSN argument. When
replacing a LABEL_REF in a JUMP_INSN, add a REG_LABEL note.
* reload.h (subst_reloads): Adjust prototype.
* reload1.c (reload_as_needed): Pass INSN to subst_reloads.
* jump.c (mark_all_labels): Canonicalize any REG_LABEL notes
present in JUMP_INSNs and copy them to JUMP_LABEL.
* flow.c (find_label_refs, find_basic_blocks_1): Skip
JUMP_INSNs and insns with REG_LABELs that are followed by
JUMP_INSNs with the same REG_LABEL.
* sched-rgn.c (is_cfg_nonregular): Likewise.
* rtlanal.c (computed_jump_p): Make it false if a REG_LABEL
note is available.
* unroll.c (unroll_loop): Look for REG_LABEL notes in
JUMP_INSNs too.
* rtl.texi (REG_LABEL): Document usage in JUMP_INSNs.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@38755 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/reload.h')
| -rw-r--r-- | gcc/reload.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/reload.h b/gcc/reload.h index 7841c7ad7d1..b604184a529 100644 --- a/gcc/reload.h +++ b/gcc/reload.h @@ -1,6 +1,6 @@ /* Communication between reload.c and reload1.c. Copyright (C) 1987, 1991, 1992, 1993, 1994, 1995, 1997, 1998, - 1999, 2000 Free Software Foundation, Inc. + 1999, 2000, 2001 Free Software Foundation, Inc. This file is part of GNU CC. @@ -302,7 +302,7 @@ extern rtx form_sum PARAMS ((rtx, rtx)); /* Substitute into the current INSN the registers into which we have reloaded the things that need reloading. */ -extern void subst_reloads PARAMS ((void)); +extern void subst_reloads PARAMS ((rtx)); /* Make a copy of any replacements being done into X and move those copies to locations in Y, a copy of X. We only look at the highest level of |