1992-02-12 18:16:21 +01:00
|
|
|
|
/* Save and restore call-clobbered registers which are live across a call.
|
1999-01-12 00:15:28 +01:00
|
|
|
|
Copyright (C) 1989, 1992, 94-95, 97, 98, 1999 Free Software Foundation, Inc.
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
This file is part of GNU CC.
|
|
|
|
|
|
|
|
|
|
GNU CC is free software; you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
|
any later version.
|
|
|
|
|
|
|
|
|
|
GNU CC is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with GNU CC; see the file COPYING. If not, write to
|
1995-06-15 13:33:25 +02:00
|
|
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
|
|
|
Boston, MA 02111-1307, USA. */
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
#include "config.h"
|
Major cutover to using system.h:
* Makefile.in (alias.o, bitmap.o, c-aux-info.o, c-common.o,
c-decl.o, c-iterate.o, c-lang.o, c-lex.o, c-pragma.o, c-typeck.o,
caller-save.o, calls.o, collect2.o, combine.o, cse.o, dbxout.o,
dwarf2out.o, dwarfout.o, emit-rtl.o, except.o, explow.o, expmed.o,
expr.o, final.o, flow.o, function.o, getpwd.o, global.o,
integrate.o, jump.o, local-alloc.o, loop.o, optabs.o, pexecute.o,
prefix.o, print-rtl.o, print-tree.o, profile.o, real.o, recog.o,
reg-stack.o, regclass.o, regmove.o, reload.o, reload1.o, reorg.o,
rtl.o, rtlanal.o, sdbout.o, stmt.o, stor-layout.o, stupid.o,
tlink.o, toplev.o, tree.o, unroll.o, varasm.o, xcoffout.o): Depend
on system.h.
* alias.c, bitmap.c, c-aux-info.c, c-common.c, c-decl.c,
c-iterate.c, c-lang.c, c-lex.c, c-pragma.c, c-typeck.c,
caller-save.c, calls.c, collect2.c, combine.c, cse.c, dbxout.c,
dwarf2out.c, dwarfout.c, emit-rtl.c, except.c, explow.c, expmed.c,
expr.c, final.c, flow.c, function.c, gcc.c, getpwd.c, global.c,
integrate.c, jump.c, local-alloc.c, loop.c, optabs.c, pexecute.c,
prefix.c, print-rtl.c, print-tree.c, profile.c, real.c, recog.c,
reg-stack.c, regclass.c, regmove.c, reload.c, reload1.c, reorg.c,
rtl.c, rtlanal.c, sched.c, sdbout.c, stmt.c, stor-layout.c,
stupid.c, tlink.c, toplev.c, tree.c, unroll.c, varasm.c,
xcoffout.c: Include system.h. Organize include ordering so
that stdarg/varargs comes before other system headers. Remove
spurious casts of functions assured of a prototype in system.h.
From-SVN: r18726
1998-03-20 15:58:42 +01:00
|
|
|
|
#include "system.h"
|
1992-02-12 18:16:21 +01:00
|
|
|
|
#include "rtl.h"
|
|
|
|
|
#include "insn-config.h"
|
|
|
|
|
#include "flags.h"
|
|
|
|
|
#include "regs.h"
|
|
|
|
|
#include "hard-reg-set.h"
|
|
|
|
|
#include "recog.h"
|
|
|
|
|
#include "basic-block.h"
|
|
|
|
|
#include "reload.h"
|
|
|
|
|
#include "expr.h"
|
1998-06-20 01:37:04 +02:00
|
|
|
|
#include "toplev.h"
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1993-08-07 21:58:54 +02:00
|
|
|
|
#ifndef MAX_MOVE_MAX
|
|
|
|
|
#define MAX_MOVE_MAX MOVE_MAX
|
|
|
|
|
#endif
|
|
|
|
|
|
1995-02-11 01:06:12 +01:00
|
|
|
|
#ifndef MIN_UNITS_PER_WORD
|
|
|
|
|
#define MIN_UNITS_PER_WORD UNITS_PER_WORD
|
1993-08-07 21:58:54 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
#define MOVE_MAX_WORDS (MOVE_MAX / UNITS_PER_WORD)
|
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
/* Modes for each hard register that we can save. The smallest mode is wide
|
|
|
|
|
enough to save the entire contents of the register. When saving the
|
|
|
|
|
register because it is live we first try to save in multi-register modes.
|
|
|
|
|
If that is not possible the save is done one register at a time. */
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
static enum machine_mode
|
1995-02-11 01:06:12 +01:00
|
|
|
|
regno_save_mode[FIRST_PSEUDO_REGISTER][MAX_MOVE_MAX / MIN_UNITS_PER_WORD + 1];
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
/* For each hard register, a place on the stack where it can be saved,
|
|
|
|
|
if needed. */
|
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
static rtx
|
1995-02-11 01:06:12 +01:00
|
|
|
|
regno_save_mem[FIRST_PSEUDO_REGISTER][MAX_MOVE_MAX / MIN_UNITS_PER_WORD + 1];
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
/* We will only make a register eligible for caller-save if it can be
|
|
|
|
|
saved in its widest mode with a simple SET insn as long as the memory
|
|
|
|
|
address is valid. We record the INSN_CODE is those insns here since
|
|
|
|
|
when we emit them, the addresses might not be valid, so they might not
|
|
|
|
|
be recognized. */
|
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
static enum insn_code
|
1995-02-11 01:06:12 +01:00
|
|
|
|
reg_save_code[FIRST_PSEUDO_REGISTER][MAX_MOVE_MAX / MIN_UNITS_PER_WORD + 1];
|
1992-08-26 21:41:20 +02:00
|
|
|
|
static enum insn_code
|
1995-02-11 01:06:12 +01:00
|
|
|
|
reg_restore_code[FIRST_PSEUDO_REGISTER][MAX_MOVE_MAX / MIN_UNITS_PER_WORD + 1];
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
/* Set of hard regs currently residing in save area (during insn scan). */
|
|
|
|
|
|
|
|
|
|
static HARD_REG_SET hard_regs_saved;
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Number of registers currently in hard_regs_saved. */
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
static int n_regs_saved;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Computed by mark_referenced_regs, all regs referenced in a given
|
|
|
|
|
insn. */
|
|
|
|
|
static HARD_REG_SET referenced_regs;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Computed in mark_set_regs, holds all registers set by the current
|
|
|
|
|
instruction. */
|
|
|
|
|
static HARD_REG_SET this_insn_sets;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
|
|
|
|
|
static void mark_set_regs PROTO((rtx, rtx));
|
|
|
|
|
static void mark_referenced_regs PROTO((rtx));
|
|
|
|
|
static int insert_save PROTO((struct insn_chain *, int, int,
|
|
|
|
|
HARD_REG_SET *));
|
|
|
|
|
static int insert_restore PROTO((struct insn_chain *, int, int,
|
|
|
|
|
int));
|
|
|
|
|
static void insert_one_insn PROTO((struct insn_chain *, int,
|
|
|
|
|
enum insn_code, rtx));
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
/* Initialize for caller-save.
|
|
|
|
|
|
|
|
|
|
Look at all the hard registers that are used by a call and for which
|
|
|
|
|
regclass.c has not already excluded from being used across a call.
|
|
|
|
|
|
|
|
|
|
Ensure that we can find a mode to save the register and that there is a
|
|
|
|
|
simple insn to save and restore the register. This latter check avoids
|
|
|
|
|
problems that would occur if we tried to save the MQ register of some
|
|
|
|
|
machines directly into memory. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
init_caller_save ()
|
|
|
|
|
{
|
|
|
|
|
char *first_obj = (char *) oballoc (0);
|
|
|
|
|
rtx addr_reg;
|
|
|
|
|
int offset;
|
|
|
|
|
rtx address;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
int i, j;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
/* First find all the registers that we need to deal with and all
|
|
|
|
|
the modes that they can have. If we can't find a mode to use,
|
|
|
|
|
we can't have the register live over calls. */
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
{
|
|
|
|
|
if (call_used_regs[i] && ! call_fixed_regs[i])
|
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (j = 1; j <= MOVE_MAX_WORDS; j++)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-09-30 19:21:12 +02:00
|
|
|
|
regno_save_mode[i][j] = HARD_REGNO_CALLER_SAVE_MODE (i, j);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
if (regno_save_mode[i][j] == VOIDmode && j == 1)
|
|
|
|
|
{
|
|
|
|
|
call_fixed_regs[i] = 1;
|
|
|
|
|
SET_HARD_REG_BIT (call_fixed_reg_set, i);
|
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
1992-08-26 21:41:20 +02:00
|
|
|
|
regno_save_mode[i][1] = VOIDmode;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* The following code tries to approximate the conditions under which
|
|
|
|
|
we can easily save and restore a register without scratch registers or
|
|
|
|
|
other complexities. It will usually work, except under conditions where
|
|
|
|
|
the validity of an insn operand is dependent on the address offset.
|
|
|
|
|
No such cases are currently known.
|
|
|
|
|
|
|
|
|
|
We first find a typical offset from some BASE_REG_CLASS register.
|
|
|
|
|
This address is chosen by finding the first register in the class
|
|
|
|
|
and by finding the smallest power of two that is a valid offset from
|
|
|
|
|
that register in every mode we will use to save registers. */
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
|
|
|
|
if (TEST_HARD_REG_BIT (reg_class_contents[(int) BASE_REG_CLASS], i))
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
if (i == FIRST_PSEUDO_REGISTER)
|
|
|
|
|
abort ();
|
|
|
|
|
|
alias.c: Change all uses of gen_rtx(FOO...) to gen_rtx_FOO...
* alias.c: Change all uses of gen_rtx(FOO...) to gen_rtx_FOO;
change gen_rtx(expr...) to gen_rtx_fmt_foo(expr...).
* caller-save.c, calls.c, combine.c, cse.c: Likewise.
* dwarf2out.c, except.c, explow.c, expmed.c, expr.c: Likewise.
* final.c, flow.c, function.c, genpeep.c, haifa-sched.c: Likewise.
* halfpic.c, integrate.c, jump.c, local-alloc.c, loop.c: Likewise.
* profile.c, recog.c, reg-stack.c, regclass.c, regmove.c: Likewise.
* reload.c, reload1.c, reorg.c, sched.c, stmt.c, stupid.c: Likewise.
* unroll.c, varasm.c: Likewise.
* config/alpha/alpha.c, config/alpha/alpha.md: Likewise.
From-SVN: r17357
1998-01-15 00:10:50 +01:00
|
|
|
|
addr_reg = gen_rtx_REG (Pmode, i);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
for (offset = 1 << (HOST_BITS_PER_INT / 2); offset; offset >>= 1)
|
|
|
|
|
{
|
alias.c: Change all uses of gen_rtx(FOO...) to gen_rtx_FOO...
* alias.c: Change all uses of gen_rtx(FOO...) to gen_rtx_FOO;
change gen_rtx(expr...) to gen_rtx_fmt_foo(expr...).
* caller-save.c, calls.c, combine.c, cse.c: Likewise.
* dwarf2out.c, except.c, explow.c, expmed.c, expr.c: Likewise.
* final.c, flow.c, function.c, genpeep.c, haifa-sched.c: Likewise.
* halfpic.c, integrate.c, jump.c, local-alloc.c, loop.c: Likewise.
* profile.c, recog.c, reg-stack.c, regclass.c, regmove.c: Likewise.
* reload.c, reload1.c, reorg.c, sched.c, stmt.c, stupid.c: Likewise.
* unroll.c, varasm.c: Likewise.
* config/alpha/alpha.c, config/alpha/alpha.md: Likewise.
From-SVN: r17357
1998-01-15 00:10:50 +01:00
|
|
|
|
address = gen_rtx_PLUS (Pmode, addr_reg, GEN_INT (offset));
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
1992-08-26 21:41:20 +02:00
|
|
|
|
if (regno_save_mode[i][1] != VOIDmode
|
|
|
|
|
&& ! strict_memory_address_p (regno_save_mode[i][1], address))
|
1992-02-12 18:16:21 +01:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
if (i == FIRST_PSEUDO_REGISTER)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If we didn't find a valid address, we must use register indirect. */
|
|
|
|
|
if (offset == 0)
|
|
|
|
|
address = addr_reg;
|
|
|
|
|
|
|
|
|
|
/* Next we try to form an insn to save and restore the register. We
|
|
|
|
|
see if such an insn is recognized and meets its constraints. */
|
|
|
|
|
|
|
|
|
|
start_sequence ();
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (j = 1; j <= MOVE_MAX_WORDS; j++)
|
1992-08-26 21:41:20 +02:00
|
|
|
|
if (regno_save_mode[i][j] != VOIDmode)
|
|
|
|
|
{
|
alias.c: Change all uses of gen_rtx(FOO...) to gen_rtx_FOO...
* alias.c: Change all uses of gen_rtx(FOO...) to gen_rtx_FOO;
change gen_rtx(expr...) to gen_rtx_fmt_foo(expr...).
* caller-save.c, calls.c, combine.c, cse.c: Likewise.
* dwarf2out.c, except.c, explow.c, expmed.c, expr.c: Likewise.
* final.c, flow.c, function.c, genpeep.c, haifa-sched.c: Likewise.
* halfpic.c, integrate.c, jump.c, local-alloc.c, loop.c: Likewise.
* profile.c, recog.c, reg-stack.c, regclass.c, regmove.c: Likewise.
* reload.c, reload1.c, reorg.c, sched.c, stmt.c, stupid.c: Likewise.
* unroll.c, varasm.c: Likewise.
* config/alpha/alpha.c, config/alpha/alpha.md: Likewise.
From-SVN: r17357
1998-01-15 00:10:50 +01:00
|
|
|
|
rtx mem = gen_rtx_MEM (regno_save_mode[i][j], address);
|
|
|
|
|
rtx reg = gen_rtx_REG (regno_save_mode[i][j], i);
|
|
|
|
|
rtx savepat = gen_rtx_SET (VOIDmode, mem, reg);
|
|
|
|
|
rtx restpat = gen_rtx_SET (VOIDmode, reg, mem);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
rtx saveinsn = emit_insn (savepat);
|
|
|
|
|
rtx restinsn = emit_insn (restpat);
|
|
|
|
|
int ok;
|
|
|
|
|
|
|
|
|
|
reg_save_code[i][j] = recog_memoized (saveinsn);
|
|
|
|
|
reg_restore_code[i][j] = recog_memoized (restinsn);
|
|
|
|
|
|
1996-07-04 00:07:53 +02:00
|
|
|
|
/* Now extract both insns and see if we can meet their
|
|
|
|
|
constraints. */
|
1998-10-14 11:02:55 +02:00
|
|
|
|
ok = (reg_save_code[i][j] != (enum insn_code)-1
|
|
|
|
|
&& reg_restore_code[i][j] != (enum insn_code)-1);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
if (ok)
|
|
|
|
|
{
|
1998-11-04 22:25:00 +01:00
|
|
|
|
extract_insn (saveinsn);
|
|
|
|
|
ok = constrain_operands (1);
|
|
|
|
|
extract_insn (restinsn);
|
|
|
|
|
ok &= constrain_operands (1);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1992-09-03 01:08:44 +02:00
|
|
|
|
if (! ok)
|
|
|
|
|
{
|
|
|
|
|
regno_save_mode[i][j] = VOIDmode;
|
|
|
|
|
if (j == 1)
|
|
|
|
|
{
|
|
|
|
|
call_fixed_regs[i] = 1;
|
|
|
|
|
SET_HARD_REG_BIT (call_fixed_reg_set, i);
|
|
|
|
|
}
|
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
end_sequence ();
|
|
|
|
|
|
|
|
|
|
obfree (first_obj);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Initialize save areas by showing that we haven't allocated any yet. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
init_save_areas ()
|
|
|
|
|
{
|
1992-08-26 21:41:20 +02:00
|
|
|
|
int i, j;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (j = 1; j <= MOVE_MAX_WORDS; j++)
|
1992-08-26 21:41:20 +02:00
|
|
|
|
regno_save_mem[i][j] = 0;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Allocate save areas for any hard registers that might need saving.
|
|
|
|
|
We take a conservative approach here and look for call-clobbered hard
|
|
|
|
|
registers that are assigned to pseudos that cross calls. This may
|
|
|
|
|
overestimate slightly (especially if some of these registers are later
|
|
|
|
|
used as spill registers), but it should not be significant.
|
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
Future work:
|
|
|
|
|
|
|
|
|
|
In the fallback case we should iterate backwards across all possible
|
|
|
|
|
modes for the save, choosing the largest available one instead of
|
|
|
|
|
falling back to the smallest mode immediately. (eg TF -> DF -> SF).
|
|
|
|
|
|
|
|
|
|
We do not try to use "move multiple" instructions that exist
|
|
|
|
|
on some machines (such as the 68k moveml). It could be a win to try
|
|
|
|
|
and use them when possible. The hard part is doing it in a way that is
|
|
|
|
|
machine independent since they might be saving non-consecutive
|
|
|
|
|
registers. (imagine caller-saving d0,d1,a0,a1 on the 68k) */
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-07 02:13:49 +02:00
|
|
|
|
void
|
|
|
|
|
setup_save_areas ()
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1992-08-26 21:41:20 +02:00
|
|
|
|
int i, j, k;
|
|
|
|
|
HARD_REG_SET hard_regs_used;
|
|
|
|
|
|
|
|
|
|
/* Allocate space in the save area for the largest multi-register
|
|
|
|
|
pseudos first, then work backwards to single register
|
|
|
|
|
pseudos. */
|
|
|
|
|
|
|
|
|
|
/* Find and record all call-used hard-registers in this function. */
|
|
|
|
|
CLEAR_HARD_REG_SET (hard_regs_used);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
for (i = FIRST_PSEUDO_REGISTER; i < max_regno; i++)
|
1997-05-30 20:19:19 +02:00
|
|
|
|
if (reg_renumber[i] >= 0 && REG_N_CALLS_CROSSED (i) > 0)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
|
|
|
|
int regno = reg_renumber[i];
|
1992-08-26 21:41:20 +02:00
|
|
|
|
int endregno
|
1992-02-12 18:16:21 +01:00
|
|
|
|
= regno + HARD_REGNO_NREGS (regno, GET_MODE (regno_reg_rtx[i]));
|
1992-08-26 21:41:20 +02:00
|
|
|
|
int nregs = endregno - regno;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
for (j = 0; j < nregs; j++)
|
|
|
|
|
{
|
|
|
|
|
if (call_used_regs[regno+j])
|
|
|
|
|
SET_HARD_REG_BIT (hard_regs_used, regno+j);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Now run through all the call-used hard-registers and allocate
|
|
|
|
|
space for them in the caller-save area. Try to allocate space
|
|
|
|
|
in a manner which allows multi-register saves/restores to be done. */
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (j = MOVE_MAX_WORDS; j > 0; j--)
|
1992-08-26 21:41:20 +02:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int do_save = 1;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
|
|
|
|
/* If no mode exists for this size, try another. Also break out
|
|
|
|
|
if we have already saved this hard register. */
|
|
|
|
|
if (regno_save_mode[i][j] == VOIDmode || regno_save_mem[i][1] != 0)
|
|
|
|
|
continue;
|
|
|
|
|
|
1992-12-30 13:02:45 +01:00
|
|
|
|
/* See if any register in this group has been saved. */
|
|
|
|
|
for (k = 0; k < j; k++)
|
|
|
|
|
if (regno_save_mem[i + k][1])
|
|
|
|
|
{
|
|
|
|
|
do_save = 0;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (! do_save)
|
|
|
|
|
continue;
|
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
for (k = 0; k < j; k++)
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (! TEST_HARD_REG_BIT (hard_regs_used, i + k))
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
do_save = 0;
|
|
|
|
|
break;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (! do_save)
|
|
|
|
|
continue;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1996-07-04 00:07:53 +02:00
|
|
|
|
/* We have found an acceptable mode to store in. */
|
1998-10-14 03:14:42 +02:00
|
|
|
|
regno_save_mem[i][j]
|
|
|
|
|
= assign_stack_local (regno_save_mode[i][j],
|
|
|
|
|
GET_MODE_SIZE (regno_save_mode[i][j]), 0);
|
|
|
|
|
|
|
|
|
|
/* Setup single word save area just in case... */
|
|
|
|
|
for (k = 0; k < j; k++)
|
1992-08-26 21:41:20 +02:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* This should not depend on WORDS_BIG_ENDIAN.
|
|
|
|
|
The order of words in regs is the same as in memory. */
|
|
|
|
|
rtx temp = gen_rtx_MEM (regno_save_mode[i+k][1],
|
|
|
|
|
XEXP (regno_save_mem[i][j], 0));
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
regno_save_mem[i+k][1]
|
|
|
|
|
= adj_offsettable_operand (temp, k * UNITS_PER_WORD);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-10-07 02:13:49 +02:00
|
|
|
|
/* Find the places where hard regs are live across calls and save them. */
|
1992-02-12 18:16:21 +01:00
|
|
|
|
void
|
1998-10-07 02:13:49 +02:00
|
|
|
|
save_call_clobbered_regs ()
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
struct insn_chain *chain, *next;
|
|
|
|
|
|
|
|
|
|
CLEAR_HARD_REG_SET (hard_regs_saved);
|
|
|
|
|
n_regs_saved = 0;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (chain = reload_insn_chain; chain != 0; chain = next)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
rtx insn = chain->insn;
|
|
|
|
|
enum rtx_code code = GET_CODE (insn);
|
|
|
|
|
|
|
|
|
|
next = chain->next;
|
|
|
|
|
|
|
|
|
|
if (chain->is_caller_save_insn)
|
|
|
|
|
abort ();
|
|
|
|
|
|
|
|
|
|
if (GET_RTX_CLASS (code) == 'i')
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* If some registers have been saved, see if INSN references
|
|
|
|
|
any of them. We must restore them before the insn if so. */
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (n_regs_saved)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int regno;
|
|
|
|
|
|
|
|
|
|
if (code == JUMP_INSN)
|
|
|
|
|
/* Restore all registers if this is a JUMP_INSN. */
|
|
|
|
|
COPY_HARD_REG_SET (referenced_regs, hard_regs_saved);
|
1994-05-06 23:49:35 +02:00
|
|
|
|
else
|
1995-06-19 22:30:25 +02:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
CLEAR_HARD_REG_SET (referenced_regs);
|
|
|
|
|
mark_referenced_regs (PATTERN (insn));
|
|
|
|
|
AND_HARD_REG_SET (referenced_regs, hard_regs_saved);
|
1995-06-19 22:30:25 +02:00
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
|
|
|
|
|
if (TEST_HARD_REG_BIT (referenced_regs, regno))
|
|
|
|
|
regno += insert_restore (chain, 1, regno, MOVE_MAX_WORDS);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (code == CALL_INSN)
|
|
|
|
|
{
|
|
|
|
|
rtx x;
|
|
|
|
|
int regno, nregs;
|
|
|
|
|
HARD_REG_SET hard_regs_to_save;
|
|
|
|
|
|
|
|
|
|
/* Use the register life information in CHAIN to compute which
|
|
|
|
|
regs are live before the call. */
|
|
|
|
|
REG_SET_TO_HARD_REG_SET (hard_regs_to_save, chain->live_before);
|
|
|
|
|
compute_use_by_pseudos (&hard_regs_to_save, chain->live_before);
|
|
|
|
|
|
|
|
|
|
/* Record all registers set in this call insn. These don't need
|
|
|
|
|
to be saved. */
|
|
|
|
|
CLEAR_HARD_REG_SET (this_insn_sets);
|
|
|
|
|
note_stores (PATTERN (insn), mark_set_regs);
|
|
|
|
|
|
|
|
|
|
/* Compute which hard regs must be saved before this call. */
|
|
|
|
|
AND_COMPL_HARD_REG_SET (hard_regs_to_save, call_fixed_reg_set);
|
|
|
|
|
AND_COMPL_HARD_REG_SET (hard_regs_to_save, this_insn_sets);
|
|
|
|
|
AND_COMPL_HARD_REG_SET (hard_regs_to_save, hard_regs_saved);
|
|
|
|
|
AND_HARD_REG_SET (hard_regs_to_save, call_used_reg_set);
|
|
|
|
|
|
|
|
|
|
/* Registers used for function parameters need not be saved. */
|
|
|
|
|
for (x = CALL_INSN_FUNCTION_USAGE (insn); x != 0;
|
|
|
|
|
x = XEXP (x, 1))
|
|
|
|
|
{
|
|
|
|
|
rtx y;
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (XEXP (x, 0)) != USE)
|
|
|
|
|
continue;
|
|
|
|
|
y = XEXP (XEXP (x, 0), 0);
|
|
|
|
|
if (GET_CODE (y) != REG)
|
|
|
|
|
abort ();
|
|
|
|
|
regno = REGNO (y);
|
|
|
|
|
if (REGNO (y) >= FIRST_PSEUDO_REGISTER)
|
|
|
|
|
abort ();
|
|
|
|
|
nregs = HARD_REGNO_NREGS (regno, GET_MODE (y));
|
|
|
|
|
while (nregs-- > 0)
|
|
|
|
|
CLEAR_HARD_REG_BIT (hard_regs_to_save, regno + nregs);
|
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Neither do registers for which we find a death note. */
|
|
|
|
|
for (x = REG_NOTES (insn); x != 0; x = XEXP (x, 1))
|
|
|
|
|
{
|
|
|
|
|
rtx y = XEXP (x, 0);
|
|
|
|
|
|
|
|
|
|
if (REG_NOTE_KIND (x) != REG_DEAD)
|
|
|
|
|
continue;
|
|
|
|
|
if (GET_CODE (y) != REG)
|
|
|
|
|
abort ();
|
|
|
|
|
regno = REGNO (y);
|
|
|
|
|
|
|
|
|
|
if (regno >= FIRST_PSEUDO_REGISTER)
|
|
|
|
|
regno = reg_renumber[regno];
|
|
|
|
|
if (regno < 0)
|
|
|
|
|
continue;
|
|
|
|
|
nregs = HARD_REGNO_NREGS (regno, GET_MODE (y));
|
|
|
|
|
while (nregs-- > 0)
|
|
|
|
|
CLEAR_HARD_REG_BIT (hard_regs_to_save, regno + nregs);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
|
|
|
|
|
if (TEST_HARD_REG_BIT (hard_regs_to_save, regno))
|
|
|
|
|
regno += insert_save (chain, 1, regno, &hard_regs_to_save);
|
|
|
|
|
|
|
|
|
|
/* Must recompute n_regs_saved. */
|
|
|
|
|
n_regs_saved = 0;
|
|
|
|
|
for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
|
|
|
|
|
if (TEST_HARD_REG_BIT (hard_regs_saved, regno))
|
|
|
|
|
n_regs_saved++;
|
|
|
|
|
}
|
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (chain->next == 0 || chain->next->block > chain->block)
|
|
|
|
|
{
|
|
|
|
|
int regno;
|
|
|
|
|
/* At the end of the basic block, we must restore any registers that
|
|
|
|
|
remain saved. If the last insn in the block is a JUMP_INSN, put
|
|
|
|
|
the restore before the insn, otherwise, put it after the insn. */
|
|
|
|
|
|
|
|
|
|
if (n_regs_saved)
|
|
|
|
|
for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
|
|
|
|
|
if (TEST_HARD_REG_BIT (hard_regs_saved, regno))
|
|
|
|
|
regno += insert_restore (chain, GET_CODE (insn) == JUMP_INSN,
|
|
|
|
|
regno, MOVE_MAX_WORDS);
|
|
|
|
|
}
|
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Here from note_stores when an insn stores a value in a register.
|
1998-10-14 03:14:42 +02:00
|
|
|
|
Set the proper bit or bits in this_insn_sets. All pseudos that have
|
1992-02-12 18:16:21 +01:00
|
|
|
|
been assigned hard regs have had their register number changed already,
|
|
|
|
|
so we can ignore pseudos. */
|
|
|
|
|
static void
|
1998-10-14 03:14:42 +02:00
|
|
|
|
mark_set_regs (reg, setter)
|
Warning fixes:
* Makefile.in (c-lang.o): Depend on c-tree.h, c-lex.h and toplev.h.
(c-lex.o): Depend on output.h.
(c-common.o): Likewise.
(stmt.o): Likewise.
(calls.o): Likewise.
(integrate.o): Depend on toplev.h.
(regclass.o): Depend on output.h.
(final.o): Depend on reload.h.
* c-common.c: Include output.h.
(check_format_info): Remove unused variable `integral_format'.
* c-decl.c (print_lang_decl): Mark parameters `file', `node' and
`indent' with ATTRIBUTE_UNUSED.
(print_lang_type): Likewise.
(maybe_build_cleanup): Likewise for parameter `decl'.
(copy_lang_decl): Likewise for parameter `node'.
* c-lang.c: Include c-tree.h, c-lex.h and toplev.h.
(lang_print_xnode): Mark parameters `file', `node' and `indent'
with ATTRIBUTE_UNUSED.
(lookup_interface): Likewise for parameter `arg'.
(is_class_name): Likewise.
(maybe_objc_check_decl): Likewise for parameter `decl'.
(maybe_objc_comptypes): Likewise for parameters `lhs', `rhs' and
`reflexive'.
(maybe_objc_method_name): Likewise for parameter `decl'.
(build_objc_string): Likewise for parameters `len' and `str'.
* c-lex.c: Include output.h.
* c-lex.h (position_after_white_space): Correct typo in prototype.
* c-tree.h (finish_file, c_expand_start_cond, c_expand_start_else,
c_expand_end_cond, init_iterators): Add prototypes.
* caller-save.c (set_reg_live): Mark parameters `reg' and `setter'
with ATTRIBUTE_UNUSED.
* calls.c: Include output.h.
* cccp.c (pipe_closed): Mark parameter `signo' with
ATTRIBUTE_UNUSED.
* combine.c: Move inclusion of expr.h to after insn-config.h.
* iris6.h (ASM_IDENTIFY_GCC, ASM_IDENTIFY_LANGUAGE): Don't define
as empty, rather define as ((void)0).
* sparc.c (sparc_check_64): Add braces around ambiguous `else'.
Add parentheses around assignment used as truth value.
* cplus-dem.c (squangle_mop_up): Change return type to void.
(internal_cplus_demangle): Remove unused parameter `options'.
All callers changed.
(cplus_demangle_opname): Remove function wide variable `int i' and
replace with `size_t i' at each location where it is used.
(cplus_demangle_opname): change type of `i' from int to size_t.
* cppexp.c (right_shift): Mark parameter `pfile' with
ATTRIBUTE_UNUSED.
* cpphash.c (cpp_lookup): Likewise.
(cpp_hash_cleanup): Likewise.
* cpplib.c (parse_name): Add a prototype and make it static.
(null_underflow): Mark parameter `pfile' with ATTRIBUTE_UNUSED.
(null_cleanup): Likewise for parameters `pbuf' and `pfile'.
(macro_cleanup): Likewise for parameter `pfile'.
(file_cleanup): Likewise.
* cpplib.h (cpp_reader_init, cpp_options_init, cpp_start_read,
cpp_read_check_assertion, skip_rest_of_line): Add prototypes.
* crtstuff.c (force_to_data, __CTOR_LIST__, force_to_data,
__DTOR_END__, __FRAME_END__): Mark with ATTRIBUTE_UNUSED.
* cse.c (cse_check_loop_start): Mark parameter `set' with
ATTRIBUTE_UNUSED.
* dbxout.c (flag_minimal_debug, have_used_extensions,
source_label_number): Move inside macro wrapper check against
defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO).
* dwarf2out.c (gen_entry_point_die): Hide prototype and definition.
* except.h (doing_eh): Provide prototype.
* expr.c: Move inclusion of expr.h to after insn-config.h.
* final.c: Include reload.h.
(shorten_branches): Cast the first argument of bzero to char *.
* fix-header.c (cpp_print_containing_files): Mark parameter
`pfile' with ATTRIBUTE_UNUSED.
(cpp_fatal): Likewise.
* flow.c (find_basic_blocks_1): Cast the first argument of bzero
to char *.
* genattrtab.c (make_length_attrs): Change the type of variable
`i' from int to size_t.
(zero_fn): Mark parameter `exp' with ATTRIBUTE_UNUSED.
(one_fn): Likewise.
* genextract.c (main): When generating insn-extract.c, mark
variable `junk' with ATTRIBUTE_UNUSED.
* gengenrtl.c (gencode): When generating genrtl.c, cast the first
argument of bzero to char*.
* integrate.c: Include toplev.h.
* libgcc2.c: Wrap `struct exception_table' and
`find_exception_handler' in macro DWARF2_UNWIND_INFO.
* objc/Make-lang.in (objc-act.o): Depend on toplev.h.
* objc/objc-act.c: Include toplev.h.
(lang_print_xnode): Mark parameters `file', `node' and `indent'
with ATTRIBUTE_UNUSED.
(finish_protocol): Likewise for parameter `protocol'.
* output.h (declare_weak): Add prototype.
(decode_reg_name): Don't wrap with TREE_CODE macro.
(assemble_alias): Add prototype.
* regclass.c: Include output.h.
* reload.h (reloads_conflict): Add prototype.
* rtl.h (print_rtl_single, mark_elimiation, reg_class_subset_p,
output_func_start_profiler): Add prototypes.
* rtlanal.c (reg_set_p_1): Mark parameters `x' and `pat' with
ATTRIBUTE_UNUSED.
* scan-decls.c: Include scan.h.
* scan.h (recognized_function, recognized_extern): Add prototypes.
* stmt.c: Include output.h.
* toplev.c (error_for_asm, warning_for_asm): Remove prototypes.
(output_lang_identify): Hide prototype and definition.
(float_signal): Mark parameter `signo' with ATTRIBUTE_UNUSED.
(pipe_closed): Likewise.
* toplev.h (count_error, strip_off_ending, error_for_asm,
warning_for_asm): Add prototypes.
From-SVN: r19712
1998-05-13 14:40:39 +02:00
|
|
|
|
rtx reg;
|
|
|
|
|
rtx setter ATTRIBUTE_UNUSED;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
|
|
|
|
register int regno, endregno, i;
|
1992-02-21 07:30:52 +01:00
|
|
|
|
enum machine_mode mode = GET_MODE (reg);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
int word = 0;
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) == SUBREG)
|
|
|
|
|
{
|
|
|
|
|
word = SUBREG_WORD (reg);
|
|
|
|
|
reg = SUBREG_REG (reg);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (GET_CODE (reg) != REG || REGNO (reg) >= FIRST_PSEUDO_REGISTER)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
regno = REGNO (reg) + word;
|
1992-02-21 07:30:52 +01:00
|
|
|
|
endregno = regno + HARD_REGNO_NREGS (regno, mode);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
for (i = regno; i < endregno; i++)
|
1998-10-14 03:14:42 +02:00
|
|
|
|
SET_HARD_REG_BIT (this_insn_sets, i);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Walk X and record all referenced registers in REFERENCED_REGS. */
|
1992-02-12 18:16:21 +01:00
|
|
|
|
static void
|
1998-10-14 03:14:42 +02:00
|
|
|
|
mark_referenced_regs (x)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
rtx x;
|
|
|
|
|
{
|
|
|
|
|
enum rtx_code code = GET_CODE (x);
|
|
|
|
|
char *fmt;
|
|
|
|
|
int i, j;
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (code == SET)
|
|
|
|
|
mark_referenced_regs (SET_SRC (x));
|
|
|
|
|
if (code == SET || code == CLOBBER)
|
|
|
|
|
{
|
|
|
|
|
x = SET_DEST (x);
|
|
|
|
|
code = GET_CODE (x);
|
|
|
|
|
if (code == REG || code == PC || code == CC0
|
|
|
|
|
|| (code == SUBREG && GET_CODE (SUBREG_REG (x)) == REG))
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
if (code == MEM || code == SUBREG)
|
|
|
|
|
{
|
|
|
|
|
x = XEXP (x, 0);
|
|
|
|
|
code = GET_CODE (x);
|
|
|
|
|
}
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1992-02-12 18:16:21 +01:00
|
|
|
|
if (code == REG)
|
|
|
|
|
{
|
|
|
|
|
int regno = REGNO (x);
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int hardregno = (regno < FIRST_PSEUDO_REGISTER ? regno
|
|
|
|
|
: reg_renumber[regno]);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
if (hardregno >= 0)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int nregs = HARD_REGNO_NREGS (hardregno, GET_MODE (x));
|
|
|
|
|
while (nregs-- > 0)
|
|
|
|
|
SET_HARD_REG_BIT (referenced_regs, hardregno + nregs);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* If this is a pseudo that did not get a hard register, scan its
|
|
|
|
|
memory location, since it might involve the use of another
|
|
|
|
|
register, which might be saved. */
|
|
|
|
|
else if (reg_equiv_mem[regno] != 0)
|
|
|
|
|
mark_referenced_regs (XEXP (reg_equiv_mem[regno], 0));
|
|
|
|
|
else if (reg_equiv_address[regno] != 0)
|
|
|
|
|
mark_referenced_regs (reg_equiv_address[regno]);
|
1992-02-12 18:16:21 +01:00
|
|
|
|
return;
|
|
|
|
|
}
|
1998-10-14 03:14:42 +02:00
|
|
|
|
|
1992-02-12 18:16:21 +01:00
|
|
|
|
fmt = GET_RTX_FORMAT (code);
|
|
|
|
|
for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
if (fmt[i] == 'e')
|
1998-10-14 03:14:42 +02:00
|
|
|
|
mark_referenced_regs (XEXP (x, i));
|
1992-02-12 18:16:21 +01:00
|
|
|
|
else if (fmt[i] == 'E')
|
|
|
|
|
for (j = XVECLEN (x, i) - 1; j >= 0; j--)
|
1998-10-14 03:14:42 +02:00
|
|
|
|
mark_referenced_regs (XVECEXP (x, i, j));
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Insert a sequence of insns to restore. Place these insns in front of
|
|
|
|
|
CHAIN if BEFORE_P is nonzero, behind the insn otherwise. MAXRESTORE is
|
|
|
|
|
the maximum number of registers which should be restored during this call.
|
|
|
|
|
It should never be less than 1 since we only work with entire registers.
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
|
|
|
|
Note that we have verified in init_caller_save that we can do this
|
|
|
|
|
with a simple SET, so use it. Set INSN_CODE to what we save there
|
|
|
|
|
since the address might not be valid so the insn might not be recognized.
|
|
|
|
|
These insns will be reloaded and have register elimination done by
|
1992-08-26 21:41:20 +02:00
|
|
|
|
find_reload, so we need not worry about that here.
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
Return the extra number of registers saved. */
|
|
|
|
|
|
|
|
|
|
static int
|
1998-10-14 03:14:42 +02:00
|
|
|
|
insert_restore (chain, before_p, regno, maxrestore)
|
|
|
|
|
struct insn_chain *chain;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
int before_p;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
int regno;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
int maxrestore;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int i;
|
1998-04-02 01:18:11 +02:00
|
|
|
|
rtx pat = NULL_RTX;
|
|
|
|
|
enum insn_code code = CODE_FOR_nothing;
|
|
|
|
|
int numregs = 0;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1992-04-04 02:22:29 +02:00
|
|
|
|
/* A common failure mode if register status is not correct in the RTL
|
|
|
|
|
is for this routine to be called with a REGNO we didn't expect to
|
|
|
|
|
save. That will cause us to write an insn with a (nil) SET_DEST
|
|
|
|
|
or SET_SRC. Instead of doing so and causing a crash later, check
|
|
|
|
|
for this common case and abort here instead. This will remove one
|
|
|
|
|
step in debugging such problems. */
|
|
|
|
|
|
1992-08-26 21:41:20 +02:00
|
|
|
|
if (regno_save_mem[regno][1] == 0)
|
1992-04-04 02:22:29 +02:00
|
|
|
|
abort ();
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Get the pattern to emit and update our status.
|
1998-10-02 12:25:57 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
See if we can restore `maxrestore' registers at once. Work
|
1998-10-02 12:25:57 +02:00
|
|
|
|
backwards to the single register case. */
|
|
|
|
|
for (i = maxrestore; i > 0; i--)
|
1992-02-12 18:16:21 +01:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int j, k;
|
|
|
|
|
int ok = 1;
|
|
|
|
|
|
|
|
|
|
if (regno_save_mem[regno][i] == 0)
|
1998-10-02 12:25:57 +02:00
|
|
|
|
continue;
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (j = 0; j < i; j++)
|
|
|
|
|
if (! TEST_HARD_REG_BIT (hard_regs_saved, regno + j))
|
|
|
|
|
{
|
|
|
|
|
ok = 0;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1998-10-02 12:25:57 +02:00
|
|
|
|
/* Must do this one restore at a time */
|
|
|
|
|
if (! ok)
|
|
|
|
|
continue;
|
1998-10-14 03:14:42 +02:00
|
|
|
|
|
1998-10-02 12:25:57 +02:00
|
|
|
|
pat = gen_rtx_SET (VOIDmode,
|
|
|
|
|
gen_rtx_REG (GET_MODE (regno_save_mem[regno][i]),
|
|
|
|
|
regno),
|
|
|
|
|
regno_save_mem[regno][i]);
|
|
|
|
|
code = reg_restore_code[regno][i];
|
|
|
|
|
|
|
|
|
|
/* Clear status for all registers we restored. */
|
|
|
|
|
for (k = 0; k < i; k++)
|
1992-08-26 21:41:20 +02:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
CLEAR_HARD_REG_BIT (hard_regs_saved, regno + k);
|
1998-10-02 12:25:57 +02:00
|
|
|
|
n_regs_saved--;
|
|
|
|
|
}
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-02 12:25:57 +02:00
|
|
|
|
numregs = i;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
insert_one_insn (chain, before_p, code, pat);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-02 12:25:57 +02:00
|
|
|
|
/* Tell our callers how many extra registers we saved/restored */
|
|
|
|
|
return numregs - 1;
|
|
|
|
|
}
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Like insert_restore above, but save registers instead. */
|
1998-10-02 12:25:57 +02:00
|
|
|
|
static int
|
1998-10-14 03:14:42 +02:00
|
|
|
|
insert_save (chain, before_p, regno, to_save)
|
|
|
|
|
struct insn_chain *chain;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
int before_p;
|
|
|
|
|
int regno;
|
1998-10-14 03:14:42 +02:00
|
|
|
|
HARD_REG_SET *to_save;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int i;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
rtx pat = NULL_RTX;
|
|
|
|
|
enum insn_code code = CODE_FOR_nothing;
|
|
|
|
|
int numregs = 0;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-02 12:25:57 +02:00
|
|
|
|
/* A common failure mode if register status is not correct in the RTL
|
|
|
|
|
is for this routine to be called with a REGNO we didn't expect to
|
|
|
|
|
save. That will cause us to write an insn with a (nil) SET_DEST
|
|
|
|
|
or SET_SRC. Instead of doing so and causing a crash later, check
|
|
|
|
|
for this common case and abort here instead. This will remove one
|
|
|
|
|
step in debugging such problems. */
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-02 12:25:57 +02:00
|
|
|
|
if (regno_save_mem[regno][1] == 0)
|
|
|
|
|
abort ();
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Get the pattern to emit and update our status.
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
See if we can save several registers with a single instruction.
|
1998-10-02 12:25:57 +02:00
|
|
|
|
Work backwards to the single register case. */
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (i = MOVE_MAX_WORDS; i > 0; i--)
|
1998-10-02 12:25:57 +02:00
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
int j, k;
|
|
|
|
|
int ok = 1;
|
|
|
|
|
if (regno_save_mem[regno][i] == 0)
|
1998-10-02 12:25:57 +02:00
|
|
|
|
continue;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
for (j = 0; j < i; j++)
|
|
|
|
|
if (! TEST_HARD_REG_BIT (*to_save, regno + j))
|
|
|
|
|
{
|
|
|
|
|
ok = 0;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1998-10-02 12:25:57 +02:00
|
|
|
|
/* Must do this one save at a time */
|
|
|
|
|
if (! ok)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
pat = gen_rtx_SET (VOIDmode, regno_save_mem[regno][i],
|
|
|
|
|
gen_rtx_REG (GET_MODE (regno_save_mem[regno][i]),
|
|
|
|
|
regno));
|
|
|
|
|
code = reg_save_code[regno][i];
|
|
|
|
|
|
|
|
|
|
/* Set hard_regs_saved for all the registers we saved. */
|
|
|
|
|
for (k = 0; k < i; k++)
|
|
|
|
|
{
|
|
|
|
|
SET_HARD_REG_BIT (hard_regs_saved, regno + k);
|
|
|
|
|
n_regs_saved++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
numregs = i;
|
|
|
|
|
break;
|
1992-08-26 21:41:20 +02:00
|
|
|
|
}
|
1992-02-12 18:16:21 +01:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
insert_one_insn (chain, before_p, code, pat);
|
1992-08-26 21:41:20 +02:00
|
|
|
|
|
|
|
|
|
/* Tell our callers how many extra registers we saved/restored */
|
|
|
|
|
return numregs - 1;
|
1992-02-12 18:16:21 +01:00
|
|
|
|
}
|
1998-10-02 12:25:57 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
/* Emit a new caller-save insn and set the code. */
|
1998-10-02 12:25:57 +02:00
|
|
|
|
static void
|
1998-10-14 03:14:42 +02:00
|
|
|
|
insert_one_insn (chain, before_p, code, pat)
|
|
|
|
|
struct insn_chain *chain;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
int before_p;
|
1998-10-14 03:14:42 +02:00
|
|
|
|
enum insn_code code;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
rtx pat;
|
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
rtx insn = chain->insn;
|
|
|
|
|
struct insn_chain *new;
|
|
|
|
|
|
1998-10-02 12:25:57 +02:00
|
|
|
|
#ifdef HAVE_cc0
|
|
|
|
|
/* If INSN references CC0, put our insns in front of the insn that sets
|
|
|
|
|
CC0. This is always safe, since the only way we could be passed an
|
|
|
|
|
insn that references CC0 is for a restore, and doing a restore earlier
|
|
|
|
|
isn't a problem. We do, however, assume here that CALL_INSNs don't
|
|
|
|
|
reference CC0. Guard against non-INSN's like CODE_LABEL. */
|
|
|
|
|
|
|
|
|
|
if ((GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN)
|
|
|
|
|
&& before_p
|
|
|
|
|
&& reg_referenced_p (cc0_rtx, PATTERN (insn)))
|
1998-10-14 03:14:42 +02:00
|
|
|
|
chain = chain->prev, insn = chain->insn;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
new = new_insn_chain ();
|
1998-10-02 12:25:57 +02:00
|
|
|
|
if (before_p)
|
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
new->prev = chain->prev;
|
|
|
|
|
if (new->prev != 0)
|
|
|
|
|
new->prev->next = new;
|
|
|
|
|
else
|
|
|
|
|
reload_insn_chain = new;
|
|
|
|
|
|
|
|
|
|
chain->prev = new;
|
|
|
|
|
new->next = chain;
|
|
|
|
|
new->insn = emit_insn_before (pat, insn);
|
1998-11-23 10:39:24 +01:00
|
|
|
|
/* ??? It would be nice if we could exclude the already / still saved
|
|
|
|
|
registers from the live sets. */
|
|
|
|
|
COPY_REG_SET (new->live_before, chain->live_before);
|
|
|
|
|
COPY_REG_SET (new->live_after, chain->live_before);
|
basic-block.h (basic_block_head): Rename to x_basic_block_head.
* basic-block.h (basic_block_head): Rename to x_basic_block_head.
(basic_block_end): Rename to x_basic_block_end.
(BLOCK_HEAD, BLOCK_END): Update.
* caller-save.c: Change basic_block_head/end references to
BLOCK_HEAD/END.
* combine.c, flow.c, function.c, gcse.c, global.c: Likewise.
* graph.c, haifa-sched.c, local-alloc.c, regclass.c: Likewise.
* regmove.c, reload1.c, reorg.c, sched.c: Likewise.
From-SVN: r24622
1999-01-11 23:37:20 +01:00
|
|
|
|
if (chain->insn == BLOCK_HEAD (chain->block))
|
|
|
|
|
BLOCK_HEAD (chain->block) = new->insn;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1998-10-14 03:14:42 +02:00
|
|
|
|
new->next = chain->next;
|
|
|
|
|
if (new->next != 0)
|
|
|
|
|
new->next->prev = new;
|
|
|
|
|
chain->next = new;
|
|
|
|
|
new->prev = chain;
|
|
|
|
|
new->insn = emit_insn_after (pat, insn);
|
1998-11-23 10:39:24 +01:00
|
|
|
|
/* ??? It would be nice if we could exclude the already / still saved
|
|
|
|
|
registers from the live sets, and observe REG_UNUSED notes. */
|
|
|
|
|
COPY_REG_SET (new->live_before, chain->live_after);
|
|
|
|
|
COPY_REG_SET (new->live_after, chain->live_after);
|
basic-block.h (basic_block_head): Rename to x_basic_block_head.
* basic-block.h (basic_block_head): Rename to x_basic_block_head.
(basic_block_end): Rename to x_basic_block_end.
(BLOCK_HEAD, BLOCK_END): Update.
* caller-save.c: Change basic_block_head/end references to
BLOCK_HEAD/END.
* combine.c, flow.c, function.c, gcse.c, global.c: Likewise.
* graph.c, haifa-sched.c, local-alloc.c, regclass.c: Likewise.
* regmove.c, reload1.c, reorg.c, sched.c: Likewise.
From-SVN: r24622
1999-01-11 23:37:20 +01:00
|
|
|
|
if (chain->insn == BLOCK_END (chain->block))
|
|
|
|
|
BLOCK_END (chain->block) = new->insn;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
}
|
1998-10-14 03:14:42 +02:00
|
|
|
|
new->block = chain->block;
|
|
|
|
|
new->is_caller_save_insn = 1;
|
1998-10-07 02:13:49 +02:00
|
|
|
|
|
1998-10-14 03:14:42 +02:00
|
|
|
|
INSN_CODE (new->insn) = code;
|
1998-10-02 12:25:57 +02:00
|
|
|
|
}
|