Haiku/buildtools
1
0
Fork 0
mirror of https://review.haiku-os.org/buildtools synced 2025-02-23 06:07:41 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

[taken from gcc-2.95.3-latest-cvs]

Browse Source 
Fri Mar  3 12:49:28 2000  J"orn Rennecke <amylaar@cygnus.co.uk>
   * reload1.c (reload_combine_note_use): Handle return register USEs.
     REG case: Handle multi-hard-register hard regs.
	* reload1.c (delete_output_reload): Call eliminate_regs on substed.
	  (reload_as_needed): Call update_eliminable_offsets a bit later.


git-svn-id: file:///srv/svn/repos/haiku/trunk/buildtools@9596 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Oliver Tappe 2004-10-28 18:23:57 +00:00
parent 0e9863ca9a
commit e8b05382a1
1 changed files with 33 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
gcc/gcc/reload1.c
View File

@ -4278,9 +4278,6 @@ reload_as_needed (live_known)
spill_reg_order); spill_reg_order);
} }
if (num_eliminable && chain->need_elim)
update_eliminable_offsets ();
if (n_reloads > 0) if (n_reloads > 0)
{ {
rtx next = NEXT_INSN (insn); rtx next = NEXT_INSN (insn);
@ -4327,6 +4324,10 @@ reload_as_needed (live_known)
NOTE_LINE_NUMBER (p) = NOTE_INSN_DELETED; NOTE_LINE_NUMBER (p) = NOTE_INSN_DELETED;
} }
} }
if (num_eliminable && chain->need_elim)
update_eliminable_offsets ();
/* Any previously reloaded spilled pseudo reg, stored in this insn, /* Any previously reloaded spilled pseudo reg, stored in this insn,
is no longer validly lying around to save a future reload. is no longer validly lying around to save a future reload.
Note that this does not detect pseudos that were reloaded Note that this does not detect pseudos that were reloaded
@ -8071,7 +8072,9 @@ delete_output_reload (insn, j, last_reload_reg)
} }
n_occurrences = count_occurrences (PATTERN (insn), reg); n_occurrences = count_occurrences (PATTERN (insn), reg);
if (substed) if (substed)
n_occurrences += count_occurrences (PATTERN (insn), substed); n_occurrences += count_occurrences (PATTERN (insn),
eliminate_regs (substed, 0,
NULL_RTX));
if (n_occurrences > n_inherited) if (n_occurrences > n_inherited)
return; return;
@ -9967,6 +9970,21 @@ reload_combine_note_use (xp, insn)
} }
break; break;
case USE:
/* If this is the USE of a return value, we can't change it. */
if (GET_CODE (XEXP (x, 0)) == REG && REG_FUNCTION_VALUE_P (XEXP (x, 0)))
{
/* Mark the return register as used in an unknown fashion. */
rtx reg = XEXP (x, 0);
int regno = REGNO (reg);
int nregs = HARD_REGNO_NREGS (regno, GET_MODE (reg));
while (--nregs >= 0)
reg_state[regno + nregs].use_index = -1;
return;
}
break;
case CLOBBER: case CLOBBER:
if (GET_CODE (SET_DEST (x)) == REG) if (GET_CODE (SET_DEST (x)) == REG)
return; return;
@ -9983,12 +10001,23 @@ reload_combine_note_use (xp, insn)
{ {
int regno = REGNO (x); int regno = REGNO (x);
int use_index; int use_index;
int nregs;
/* Some spurious USEs of pseudo registers might remain. /* Some spurious USEs of pseudo registers might remain.
Just ignore them. */ Just ignore them. */
if (regno >= FIRST_PSEUDO_REGISTER) if (regno >= FIRST_PSEUDO_REGISTER)
return; return;
nregs = HARD_REGNO_NREGS (regno, GET_MODE (x));
/* We can't substitute into multi-hard-reg uses. */
if (nregs > 1)
{
while (--nregs >= 0)
reg_state[regno + nregs].use_index = -1;
return;
}
/* If this register is already used in some unknown fashion, we /* If this register is already used in some unknown fashion, we
can't do anything. can't do anything.
If we decrement the index from zero to -1, we can't store more If we decrement the index from zero to -1, we can't store more