mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-03-12 18:37:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

regrename.c (regrename_optimize): Compute nregs for each potential target register.

Browse Source 
* regrename.c (regrename_optimize): Compute nregs for each
        potential target register.

From-SVN: r44234
This commit is contained in:
Richard Henderson 2001-07-22 00:10:46 -07:00 committed by Richard Henderson
parent f7e1058777
commit 4e812700ae
2 changed files with 9 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2001-07-22 Richard Henderson <rth@redhat.com>
* regrename.c (regrename_optimize): Compute nregs for each
potential target register.
2001-07-21 Neil Booth <neil@daikokuya.demon.co.uk>
Richard Henderson <rth@redhat.com>

8
gcc/regrename.c
View File

@ -238,8 +238,7 @@ regrename_optimize ()
struct du_chain *this = all_chains;
struct du_chain *tmp, *last;
HARD_REG_SET this_unavailable;
int reg = REGNO (*this->loc), treg;
int nregs = HARD_REGNO_NREGS (reg, GET_MODE (*this->loc));
int reg = REGNO (*this->loc);
int i;
all_chains = this->next_chain;
@ -287,9 +286,10 @@ regrename_optimize ()
/* Now potential_regs is a reasonable approximation, let's
have a closer look at each register still in there. */
for (treg = 0; treg < FIRST_PSEUDO_REGISTER; treg++)
for (new_reg = 0; new_reg < FIRST_PSEUDO_REGISTER; new_reg++)
{
new_reg = treg;
int nregs = HARD_REGNO_NREGS (new_reg, GET_MODE (*this->loc));
for (i = nregs - 1; i >= 0; --i)
if (TEST_HARD_REG_BIT (this_unavailable, new_reg + i)
|| fixed_regs[new_reg + i]