diff options
author | Richard Sandiford <richard.sandiford@linaro.org> | 2017-09-12 13:28:27 +0000 |
---|---|---|
committer | Richard Sandiford <rsandifo@gcc.gnu.org> | 2017-09-12 13:28:27 +0000 |
commit | 4edd6298d853890dca6a30cfdf209e3e89a2a533 (patch) | |
tree | cb773aeb0a0539470b01a2b8d572da3b6dfe2742 /gcc/lra.c | |
parent | 036620db8a9f9e4d807de8ba07a7004aa02a9941 (diff) | |
download | gcc-4edd6298d853890dca6a30cfdf209e3e89a2a533.zip gcc-4edd6298d853890dca6a30cfdf209e3e89a2a533.tar.gz gcc-4edd6298d853890dca6a30cfdf209e3e89a2a533.tar.bz2 |
Make more use of end_hard_regno
An upcoming patch will convert hard_regno_nregs into an inline
function, which in turn allows hard_regno_nregs to be used as the
name of a targetm field. This patch rewrites uses that can use
end_hard_regno instead.
2017-09-12 Richard Sandiford <richard.sandiford@linaro.org>
gcc/
* config/aarch64/aarch64.c (aarch64_hard_regno_mode_ok): Use
end_hard_regno instead of hard_regno_nregs.
* config/s390/s390.c (s390_reg_clobbered_rtx): Likewise.
* config/sparc/sparc.h (ASM_DECLARE_REGISTER_GLOBAL): Likewise.
* config/visium/visium.c (visium_hard_regno_mode_ok): Likewise.
* ira-color.c (improve_allocation): Likewise.
* lra-assigns.c (find_hard_regno_for_1): Likewise.
* lra-lives.c (mark_regno_live): Likewise.
(mark_regno_dead): Likewise.
* lra-remat.c (operand_to_remat): Likewise.
* lra.c (collect_non_operand_hard_regs): Likewise.
* postreload.c (reload_combine_note_store): Likewise.
(move2add_valid_value_p): Likewise.
* reload.c (regno_clobbered_p): Likewise.
From-SVN: r252012
Diffstat (limited to 'gcc/lra.c')
-rw-r--r-- | gcc/lra.c | 4 |
1 files changed, 1 insertions, 3 deletions
@@ -846,9 +846,7 @@ collect_non_operand_hard_regs (rtx *x, lra_insn_recog_data_t data, return list; /* Process all regs even unallocatable ones as we need info about all regs for rematerialization pass. */ - for (last = regno + hard_regno_nregs[regno][mode]; - regno < last; - regno++) + for (last = end_hard_regno (mode, regno); regno < last; regno++) { for (curr = list; curr != NULL; curr = curr->next) if (curr->regno == regno && curr->subreg_p == subreg_p |