mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2024-12-30 16:15:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

haifa-sched.c (sched_analyze_1): Use free_list instead of zapping reg_last_uses directly.

Browse Source 
* haifa-sched.c (sched_analyze_1): Use free_list instead of
        zapping reg_last_uses directly.
        (sched_analyze_2, sched_analyze_insn): Likewise.
        (sched_analyze): Likewise.  Don't clear reg_last_uses on calls.

From-SVN: r27622
This commit is contained in:
Richard Henderson 1999-06-20 10:29:49 -07:00 committed by Richard Henderson
parent 2f76d42cf7
commit 0adb548cc7
2 changed files with 12 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -1,3 +1,10 @@
Sun Jun 20 17:27:20 1999 Richard Henderson <rth@cygnus.com>
* haifa-sched.c (sched_analyze_1): Use free_list instead of
zapping reg_last_uses directly.
(sched_analyze_2, sched_analyze_insn): Likewise.
(sched_analyze): Likewise. Don't clear reg_last_uses on calls.
Sun Jun 20 16:57:29 1999 David Edelsohn <edelsohn@gnu.org>
* rs6000.md (movdf_hardfloat32): Use worst case insn length

12
gcc/haifa-sched.c
View File

@ -3366,7 +3366,7 @@ sched_analyze_1 (x, insn)
but sets must be ordered with respect to a pending clobber. */
if (code == SET)
{
reg_last_uses[regno + i] = 0;
free_list (&reg_last_uses[regno + i], &unused_insn_list);
for (u = reg_last_clobbers[regno + i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_OUTPUT);
SET_REGNO_REG_SET (reg_pending_sets, regno + i);
@ -3393,7 +3393,7 @@ sched_analyze_1 (x, insn)
if (code == SET)
{
reg_last_uses[regno] = 0;
free_list (&reg_last_uses[regno], &unused_insn_list);
for (u = reg_last_clobbers[regno]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_OUTPUT);
SET_REGNO_REG_SET (reg_pending_sets, regno);
@ -3659,7 +3659,7 @@ sched_analyze_2 (x, insn)
{
for (u = reg_last_uses[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_ANTI);
reg_last_uses[i] = 0;
free_list (&reg_last_uses[i], &unused_insn_list);
for (u = reg_last_sets[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), 0);
@ -3792,7 +3792,7 @@ sched_analyze_insn (x, insn, loop_notes)
rtx u;
for (u = reg_last_uses[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_ANTI);
reg_last_uses[i] = 0;
free_list (&reg_last_uses[i], &unused_insn_list);
for (u = reg_last_sets[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), 0);
@ -3924,8 +3924,7 @@ sched_analyze (head, tail)
{
for (u = reg_last_uses[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_ANTI);
reg_last_uses[i] = 0;
free_list (&reg_last_uses[i], &unused_insn_list);
for (u = reg_last_sets[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), 0);
@ -3952,7 +3951,6 @@ sched_analyze (head, tail)
{
for (u = reg_last_uses[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_ANTI);
reg_last_uses[i] = 0;
for (u = reg_last_sets[i]; u; u = XEXP (u, 1))
add_dependence (insn, XEXP (u, 0), REG_DEP_ANTI);