1992-03-29 23:14:34 +00:00
|
|
|
|
/* Target-dependent code for the SPARC for GDB, the GNU debugger.
|
* Makefile.in (TAGS): Use variables directly, rather than using
find, to locate TM_FILE, XM_FILE, and NAT_FILE. This is faster
and means that these filenames no longer need be unique across all
the config/* directories.
* configure.in: Put the config/*/ into TM_FILE, etc.
* m68k-stub.c (computeSignal): Return SIGFPE, not SIGURG, for chk
and trapv exceptions.
* target.h (struct section_table), objfiles.h (struct obj_section):
Change name of field sec_ptr to the_bfd_section. More mnemonic
and avoids the (sort of, for the ptx compiler) name clash with
the name of the typedef.
* exec.c, xcoffexec.c, sparc-tdep.c, rs6000-nat.c, osfsolib.c,
solib.c, irix5-nat.c, objfiles.c, remote.c: Change users.
* utils.c: Include readline.h.
* Makefile.in (utils.o): Add dependency.
* remote.c (getpkt): Add support for run-length encoding.
1994-03-19 18:49:50 +00:00
|
|
|
|
Copyright 1986, 1987, 1989, 1991, 1992, 1993, 1994
|
|
|
|
|
Free Software Foundation, Inc.
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
This file is part of GDB.
|
|
|
|
|
|
1991-08-14 00:00:25 +00:00
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
1991-03-28 16:26:26 +00:00
|
|
|
|
it under the terms of the GNU General Public License as published by
|
1991-08-14 00:00:25 +00:00
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
|
(at your option) any later version.
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1991-08-14 00:00:25 +00:00
|
|
|
|
This program is distributed in the hope that it will be useful,
|
1991-03-28 16:26:26 +00:00
|
|
|
|
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
|
1991-08-14 00:00:25 +00:00
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
#include "defs.h"
|
|
|
|
|
#include "frame.h"
|
|
|
|
|
#include "inferior.h"
|
|
|
|
|
#include "obstack.h"
|
|
|
|
|
#include "target.h"
|
1994-02-28 06:06:05 +00:00
|
|
|
|
#include "value.h"
|
1993-04-22 20:42:37 +00:00
|
|
|
|
|
1992-06-19 21:09:54 +00:00
|
|
|
|
#ifdef USE_PROC_FS
|
|
|
|
|
#include <sys/procfs.h>
|
|
|
|
|
#endif
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
#include "gdbcore.h"
|
|
|
|
|
|
|
|
|
|
/* From infrun.c */
|
|
|
|
|
extern int stop_after_trap;
|
|
|
|
|
|
1992-09-26 09:04:24 +00:00
|
|
|
|
/* We don't store all registers immediately when requested, since they
|
|
|
|
|
get sent over in large chunks anyway. Instead, we accumulate most
|
|
|
|
|
of the changes and send them over once. "deferred_stores" keeps
|
|
|
|
|
track of which sets of registers we have locally-changed copies of,
|
|
|
|
|
so we only need send the groups that have changed. */
|
|
|
|
|
|
|
|
|
|
int deferred_stores = 0; /* Cumulates stores we want to do eventually. */
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* Macros to extract fields from sparc instructions. */
|
|
|
|
|
#define X_OP(i) (((i) >> 30) & 0x3)
|
|
|
|
|
#define X_RD(i) (((i) >> 25) & 0x1f)
|
|
|
|
|
#define X_A(i) (((i) >> 29) & 1)
|
|
|
|
|
#define X_COND(i) (((i) >> 25) & 0xf)
|
|
|
|
|
#define X_OP2(i) (((i) >> 22) & 0x7)
|
|
|
|
|
#define X_IMM22(i) ((i) & 0x3fffff)
|
|
|
|
|
#define X_OP3(i) (((i) >> 19) & 0x3f)
|
|
|
|
|
#define X_RS1(i) (((i) >> 14) & 0x1f)
|
|
|
|
|
#define X_I(i) (((i) >> 13) & 1)
|
|
|
|
|
#define X_IMM13(i) ((i) & 0x1fff)
|
|
|
|
|
/* Sign extension macros. */
|
|
|
|
|
#define X_SIMM13(i) ((X_IMM13 (i) ^ 0x1000) - 0x1000)
|
|
|
|
|
#define X_DISP22(i) ((X_IMM22 (i) ^ 0x200000) - 0x200000)
|
|
|
|
|
|
1991-03-28 16:26:26 +00:00
|
|
|
|
typedef enum
|
|
|
|
|
{
|
1992-03-29 23:14:34 +00:00
|
|
|
|
Error, not_branch, bicc, bicca, ba, baa, ticc, ta
|
1991-03-28 16:26:26 +00:00
|
|
|
|
} branch_type;
|
|
|
|
|
|
|
|
|
|
/* Simulate single-step ptrace call for sun4. Code written by Gary
|
|
|
|
|
Beihl (beihl@mcc.com). */
|
|
|
|
|
|
|
|
|
|
/* npc4 and next_pc describe the situation at the time that the
|
|
|
|
|
step-breakpoint was set, not necessary the current value of NPC_REGNUM. */
|
|
|
|
|
static CORE_ADDR next_pc, npc4, target;
|
|
|
|
|
static int brknpc4, brktrg;
|
|
|
|
|
typedef char binsn_quantum[BREAKPOINT_MAX];
|
|
|
|
|
static binsn_quantum break_mem[3];
|
|
|
|
|
|
|
|
|
|
/* Non-zero if we just simulated a single-step ptrace call. This is
|
|
|
|
|
needed because we cannot remove the breakpoints in the inferior
|
|
|
|
|
process until after the `wait' in `wait_for_inferior'. Used for
|
|
|
|
|
sun4. */
|
|
|
|
|
|
|
|
|
|
int one_stepped;
|
|
|
|
|
|
1991-05-30 08:52:52 +00:00
|
|
|
|
/* single_step() is called just before we want to resume the inferior,
|
|
|
|
|
if we want to single-step it but there is no hardware or kernel single-step
|
|
|
|
|
support (as on all SPARCs). We find all the possible targets of the
|
|
|
|
|
coming instruction and breakpoint them.
|
|
|
|
|
|
|
|
|
|
single_step is also called just after the inferior stops. If we had
|
|
|
|
|
set up a simulated single-step, we undo our damage. */
|
|
|
|
|
|
1991-03-28 16:26:26 +00:00
|
|
|
|
void
|
1992-06-19 21:09:54 +00:00
|
|
|
|
single_step (ignore)
|
|
|
|
|
int ignore; /* pid, but we don't need it */
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
|
|
|
|
branch_type br, isannulled();
|
|
|
|
|
CORE_ADDR pc;
|
|
|
|
|
long pc_instruction;
|
|
|
|
|
|
|
|
|
|
if (!one_stepped)
|
|
|
|
|
{
|
|
|
|
|
/* Always set breakpoint for NPC. */
|
|
|
|
|
next_pc = read_register (NPC_REGNUM);
|
|
|
|
|
npc4 = next_pc + 4; /* branch not taken */
|
|
|
|
|
|
|
|
|
|
target_insert_breakpoint (next_pc, break_mem[0]);
|
1994-01-19 20:45:30 +00:00
|
|
|
|
/* printf_unfiltered ("set break at %x\n",next_pc); */
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
pc = read_register (PC_REGNUM);
|
1994-12-18 06:59:12 +00:00
|
|
|
|
pc_instruction = read_memory_integer (pc, 4);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
br = isannulled (pc_instruction, pc, &target);
|
|
|
|
|
brknpc4 = brktrg = 0;
|
|
|
|
|
|
|
|
|
|
if (br == bicca)
|
|
|
|
|
{
|
|
|
|
|
/* Conditional annulled branch will either end up at
|
|
|
|
|
npc (if taken) or at npc+4 (if not taken).
|
|
|
|
|
Trap npc+4. */
|
|
|
|
|
brknpc4 = 1;
|
|
|
|
|
target_insert_breakpoint (npc4, break_mem[1]);
|
|
|
|
|
}
|
|
|
|
|
else if (br == baa && target != next_pc)
|
|
|
|
|
{
|
|
|
|
|
/* Unconditional annulled branch will always end up at
|
|
|
|
|
the target. */
|
|
|
|
|
brktrg = 1;
|
|
|
|
|
target_insert_breakpoint (target, break_mem[2]);
|
|
|
|
|
}
|
|
|
|
|
|
1991-05-30 08:52:52 +00:00
|
|
|
|
/* We are ready to let it go */
|
1991-03-28 16:26:26 +00:00
|
|
|
|
one_stepped = 1;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Remove breakpoints */
|
|
|
|
|
target_remove_breakpoint (next_pc, break_mem[0]);
|
|
|
|
|
|
|
|
|
|
if (brknpc4)
|
|
|
|
|
target_remove_breakpoint (npc4, break_mem[1]);
|
|
|
|
|
|
|
|
|
|
if (brktrg)
|
|
|
|
|
target_remove_breakpoint (target, break_mem[2]);
|
|
|
|
|
|
|
|
|
|
one_stepped = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Call this for each newly created frame. For SPARC, we need to calculate
|
|
|
|
|
the bottom of the frame, and do some extra work if the prologue
|
|
|
|
|
has been generated via the -mflat option to GCC. In particular,
|
|
|
|
|
we need to know where the previous fp and the pc have been stashed,
|
|
|
|
|
since their exact position within the frame may vary. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
sparc_init_extra_frame_info (fromleaf, fi)
|
|
|
|
|
int fromleaf;
|
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
{
|
|
|
|
|
char *name;
|
|
|
|
|
CORE_ADDR addr;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
int insn;
|
1994-12-17 10:46:32 +00:00
|
|
|
|
|
|
|
|
|
fi->bottom =
|
|
|
|
|
(fi->next ?
|
|
|
|
|
(fi->frame == fi->next->frame ? fi->next->bottom : fi->next->frame) :
|
|
|
|
|
read_register (SP_REGNUM));
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* If fi->next is NULL, then we already set ->frame by passing read_fp()
|
|
|
|
|
to create_new_frame. */
|
|
|
|
|
if (fi->next)
|
|
|
|
|
{
|
|
|
|
|
char buf[MAX_REGISTER_RAW_SIZE];
|
|
|
|
|
int err;
|
|
|
|
|
|
|
|
|
|
/* Compute ->frame as if not flat. If it is flat, we'll change
|
|
|
|
|
it later. */
|
|
|
|
|
/* FIXME: If error reading memory, should just stop backtracing, rather
|
|
|
|
|
than error(). */
|
|
|
|
|
get_saved_register (buf, 0, 0, fi, FP_REGNUM, 0);
|
|
|
|
|
fi->frame = extract_address (buf, REGISTER_RAW_SIZE (FP_REGNUM));
|
|
|
|
|
}
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Decide whether this is a function with a ``flat register window''
|
|
|
|
|
frame. For such functions, the frame pointer is actually in %i7. */
|
|
|
|
|
fi->flat = 0;
|
|
|
|
|
if (find_pc_partial_function (fi->pc, &name, &addr, NULL))
|
|
|
|
|
{
|
|
|
|
|
/* See if the function starts with an add (which will be of a
|
1994-12-18 06:59:12 +00:00
|
|
|
|
negative number if a flat frame) to the sp. FIXME: Does not
|
|
|
|
|
handle large frames which will need more than one instruction
|
|
|
|
|
to adjust the sp. */
|
|
|
|
|
insn = read_memory_integer (addr, 4);
|
|
|
|
|
if (X_OP (insn) == 2 && X_RD (insn) == 14 && X_OP3 (insn) == 0
|
|
|
|
|
&& X_I (insn) && X_SIMM13 (insn) < 0)
|
1994-12-17 10:46:32 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
int offset = X_SIMM13 (insn);
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Then look for a save of %i7 into the frame. */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (addr + 4, 4);
|
|
|
|
|
if (X_OP (insn) == 3
|
|
|
|
|
&& X_RD (insn) == 31
|
|
|
|
|
&& X_OP3 (insn) == 4
|
|
|
|
|
&& X_RS1 (insn) == 14)
|
1994-12-17 10:46:32 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
char buf[MAX_REGISTER_RAW_SIZE];
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* We definitely have a flat frame now. */
|
|
|
|
|
fi->flat = 1;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
|
|
|
|
|
fi->sp_offset = offset;
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Overwrite the frame's address with the value in %i7. */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
get_saved_register (buf, 0, 0, fi, I7_REGNUM, 0);
|
|
|
|
|
fi->frame = extract_address (buf, REGISTER_RAW_SIZE (I7_REGNUM));
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Record where the fp got saved. */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
fi->fp_addr = fi->frame + fi->sp_offset + X_SIMM13 (insn);
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Also try to collect where the pc got saved to. */
|
|
|
|
|
fi->pc_addr = 0;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (addr + 12, 4);
|
|
|
|
|
if (X_OP (insn) == 3
|
|
|
|
|
&& X_RD (insn) == 15
|
|
|
|
|
&& X_OP3 (insn) == 4
|
|
|
|
|
&& X_RS1 (insn) == 14)
|
|
|
|
|
fi->pc_addr = fi->frame + fi->sp_offset + X_SIMM13 (insn);
|
1994-12-17 10:46:32 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (fi->next && fi->frame == 0)
|
|
|
|
|
{
|
|
|
|
|
/* Kludge to cause init_prev_frame_info to destroy the new frame. */
|
|
|
|
|
fi->frame = fi->next->frame;
|
|
|
|
|
fi->pc = fi->next->pc;
|
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
}
|
|
|
|
|
|
1991-05-30 08:52:52 +00:00
|
|
|
|
CORE_ADDR
|
1994-12-17 10:46:32 +00:00
|
|
|
|
sparc_frame_chain (frame)
|
|
|
|
|
struct frame_info *frame;
|
1991-05-30 08:52:52 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* Value that will cause FRAME_CHAIN_VALID to not worry about the chain
|
|
|
|
|
value. If it realy is zero, we detect it later in
|
|
|
|
|
sparc_init_prev_frame. */
|
|
|
|
|
return (CORE_ADDR)1;
|
1991-05-30 08:52:52 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
CORE_ADDR
|
|
|
|
|
sparc_extract_struct_value_address (regbuf)
|
|
|
|
|
char regbuf[REGISTER_BYTES];
|
|
|
|
|
{
|
1992-03-29 23:14:34 +00:00
|
|
|
|
return read_memory_integer (((int *)(regbuf))[SP_REGNUM]+(16*4),
|
1994-01-19 20:45:30 +00:00
|
|
|
|
TARGET_PTR_BIT / TARGET_CHAR_BIT);
|
1991-05-30 08:52:52 +00:00
|
|
|
|
}
|
|
|
|
|
|
1992-03-29 23:14:34 +00:00
|
|
|
|
/* Find the pc saved in frame FRAME. */
|
|
|
|
|
|
1991-03-28 16:26:26 +00:00
|
|
|
|
CORE_ADDR
|
1994-01-22 08:42:14 +00:00
|
|
|
|
sparc_frame_saved_pc (frame)
|
1994-12-17 10:46:32 +00:00
|
|
|
|
struct frame_info *frame;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1994-01-19 20:45:30 +00:00
|
|
|
|
char buf[MAX_REGISTER_RAW_SIZE];
|
1993-07-10 01:35:53 +00:00
|
|
|
|
CORE_ADDR addr;
|
1992-03-29 23:14:34 +00:00
|
|
|
|
|
1994-02-28 06:06:05 +00:00
|
|
|
|
if (frame->signal_handler_caller)
|
|
|
|
|
{
|
|
|
|
|
/* This is the signal trampoline frame.
|
|
|
|
|
Get the saved PC from the sigcontext structure. */
|
|
|
|
|
|
|
|
|
|
#ifndef SIGCONTEXT_PC_OFFSET
|
|
|
|
|
#define SIGCONTEXT_PC_OFFSET 12
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
CORE_ADDR sigcontext_addr;
|
|
|
|
|
char scbuf[TARGET_PTR_BIT / HOST_CHAR_BIT];
|
* Makefile.in (TAGS): Use variables directly, rather than using
find, to locate TM_FILE, XM_FILE, and NAT_FILE. This is faster
and means that these filenames no longer need be unique across all
the config/* directories.
* configure.in: Put the config/*/ into TM_FILE, etc.
* m68k-stub.c (computeSignal): Return SIGFPE, not SIGURG, for chk
and trapv exceptions.
* target.h (struct section_table), objfiles.h (struct obj_section):
Change name of field sec_ptr to the_bfd_section. More mnemonic
and avoids the (sort of, for the ptx compiler) name clash with
the name of the typedef.
* exec.c, xcoffexec.c, sparc-tdep.c, rs6000-nat.c, osfsolib.c,
solib.c, irix5-nat.c, objfiles.c, remote.c: Change users.
* utils.c: Include readline.h.
* Makefile.in (utils.o): Add dependency.
* remote.c (getpkt): Add support for run-length encoding.
1994-03-19 18:49:50 +00:00
|
|
|
|
int saved_pc_offset = SIGCONTEXT_PC_OFFSET;
|
|
|
|
|
char *name = NULL;
|
|
|
|
|
|
|
|
|
|
/* Solaris2 ucbsigvechandler passes a pointer to a sigcontext
|
|
|
|
|
as the third parameter. The offset to the saved pc is 12. */
|
|
|
|
|
find_pc_partial_function (frame->pc, &name,
|
|
|
|
|
(CORE_ADDR *)NULL,(CORE_ADDR *)NULL);
|
|
|
|
|
if (name && STREQ (name, "ucbsigvechandler"))
|
|
|
|
|
saved_pc_offset = 12;
|
1994-02-28 06:06:05 +00:00
|
|
|
|
|
|
|
|
|
/* The sigcontext address is contained in register O2. */
|
|
|
|
|
get_saved_register (buf, (int *)NULL, (CORE_ADDR *)NULL,
|
|
|
|
|
frame, O0_REGNUM + 2, (enum lval_type *)NULL);
|
|
|
|
|
sigcontext_addr = extract_address (buf, REGISTER_RAW_SIZE (O0_REGNUM));
|
|
|
|
|
|
|
|
|
|
/* Don't cause a memory_error when accessing sigcontext in case the
|
|
|
|
|
stack layout has changed or the stack is corrupt. */
|
* Makefile.in (TAGS): Use variables directly, rather than using
find, to locate TM_FILE, XM_FILE, and NAT_FILE. This is faster
and means that these filenames no longer need be unique across all
the config/* directories.
* configure.in: Put the config/*/ into TM_FILE, etc.
* m68k-stub.c (computeSignal): Return SIGFPE, not SIGURG, for chk
and trapv exceptions.
* target.h (struct section_table), objfiles.h (struct obj_section):
Change name of field sec_ptr to the_bfd_section. More mnemonic
and avoids the (sort of, for the ptx compiler) name clash with
the name of the typedef.
* exec.c, xcoffexec.c, sparc-tdep.c, rs6000-nat.c, osfsolib.c,
solib.c, irix5-nat.c, objfiles.c, remote.c: Change users.
* utils.c: Include readline.h.
* Makefile.in (utils.o): Add dependency.
* remote.c (getpkt): Add support for run-length encoding.
1994-03-19 18:49:50 +00:00
|
|
|
|
target_read_memory (sigcontext_addr + saved_pc_offset,
|
1994-02-28 06:06:05 +00:00
|
|
|
|
scbuf, sizeof (scbuf));
|
|
|
|
|
return extract_address (scbuf, sizeof (scbuf));
|
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
if (frame->flat)
|
|
|
|
|
addr = frame->pc_addr;
|
|
|
|
|
else
|
|
|
|
|
addr = frame->bottom + FRAME_SAVED_I0 +
|
|
|
|
|
REGISTER_RAW_SIZE (I7_REGNUM) * (I7_REGNUM - I0_REGNUM);
|
1994-12-18 06:59:12 +00:00
|
|
|
|
|
|
|
|
|
if (addr == 0)
|
|
|
|
|
/* A flat frame leaf function might not save the PC anywhere,
|
|
|
|
|
just leave it in %o7. */
|
|
|
|
|
return PC_ADJUST (read_register (O7_REGNUM));
|
|
|
|
|
|
1994-01-19 20:45:30 +00:00
|
|
|
|
read_memory (addr, buf, REGISTER_RAW_SIZE (I7_REGNUM));
|
|
|
|
|
return PC_ADJUST (extract_address (buf, REGISTER_RAW_SIZE (I7_REGNUM)));
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Since an individual frame in the frame cache is defined by two
|
|
|
|
|
arguments (a frame pointer and a stack pointer), we need two
|
|
|
|
|
arguments to get info for an arbitrary stack frame. This routine
|
|
|
|
|
takes two arguments and makes the cached frames look as if these
|
|
|
|
|
two arguments defined a frame on the cache. This allows the rest
|
|
|
|
|
of info frame to extract the important arguments without
|
|
|
|
|
difficulty. */
|
|
|
|
|
|
|
|
|
|
struct frame_info *
|
1993-03-31 00:29:22 +00:00
|
|
|
|
setup_arbitrary_frame (argc, argv)
|
|
|
|
|
int argc;
|
1994-12-17 10:46:32 +00:00
|
|
|
|
CORE_ADDR *argv;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1994-12-17 10:46:32 +00:00
|
|
|
|
struct frame_info *frame;
|
1993-03-31 00:29:22 +00:00
|
|
|
|
|
|
|
|
|
if (argc != 2)
|
|
|
|
|
error ("Sparc frame specifications require two arguments: fp and sp");
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame = create_new_frame (argv[0], 0);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
if (!frame)
|
|
|
|
|
fatal ("internal: create_new_frame returned invalid frame");
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame->bottom = argv[1];
|
|
|
|
|
frame->pc = FRAME_SAVED_PC (frame);
|
|
|
|
|
return frame;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
|
1991-08-14 00:00:25 +00:00
|
|
|
|
/* Given a pc value, skip it forward past the function prologue by
|
|
|
|
|
disassembling instructions that appear to be a prologue.
|
|
|
|
|
|
|
|
|
|
If FRAMELESS_P is set, we are only testing to see if the function
|
|
|
|
|
is frameless. This allows a quicker answer.
|
|
|
|
|
|
|
|
|
|
This routine should be more specific in its actions; making sure
|
1991-04-22 21:40:42 +00:00
|
|
|
|
that it uses the same register in the initial prologue section. */
|
1994-12-17 10:46:32 +00:00
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
static CORE_ADDR examine_prologue PARAMS ((CORE_ADDR, int, struct frame_info *,
|
|
|
|
|
struct frame_saved_regs *));
|
|
|
|
|
|
|
|
|
|
static CORE_ADDR
|
|
|
|
|
examine_prologue (start_pc, frameless_p, fi, saved_regs)
|
1991-04-22 21:40:42 +00:00
|
|
|
|
CORE_ADDR start_pc;
|
1991-08-14 00:00:25 +00:00
|
|
|
|
int frameless_p;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
struct frame_saved_regs *saved_regs;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
int insn;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
int dest = -1;
|
1991-04-22 21:40:42 +00:00
|
|
|
|
CORE_ADDR pc = start_pc;
|
1994-12-17 10:46:32 +00:00
|
|
|
|
int is_flat = 0;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (pc, 4);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
/* Recognize the `sethi' insn and record its destination. */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (X_OP (insn) == 0 && X_OP2 (insn) == 4)
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
dest = X_RD (insn);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
pc += 4;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (pc, 4);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Recognize an add immediate value to register to either %g1 or
|
|
|
|
|
the destination register recorded above. Actually, this might
|
1991-04-22 21:40:42 +00:00
|
|
|
|
well recognize several different arithmetic operations.
|
|
|
|
|
It doesn't check that rs1 == rd because in theory "sub %g0, 5, %g1"
|
|
|
|
|
followed by "save %sp, %g1, %sp" is a valid prologue (Not that
|
|
|
|
|
I imagine any compiler really does that, however). */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (X_OP (insn) == 2
|
|
|
|
|
&& X_I (insn)
|
|
|
|
|
&& (X_RD (insn) == 1 || X_RD (insn) == dest))
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
|
|
|
|
pc += 4;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (pc, 4);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* Recognize any SAVE insn. */
|
|
|
|
|
if (X_OP (insn) == 2 && X_OP3 (insn) == 60)
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
|
|
|
|
pc += 4;
|
1991-08-14 00:00:25 +00:00
|
|
|
|
if (frameless_p) /* If the save is all we care about, */
|
|
|
|
|
return pc; /* return before doing more work */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (pc, 4);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* Recognize add to %sp. */
|
|
|
|
|
else if (X_OP (insn) == 2 && X_RD (insn) == 14 && X_OP3 (insn) == 0)
|
1991-08-14 00:00:25 +00:00
|
|
|
|
{
|
1994-12-17 10:46:32 +00:00
|
|
|
|
pc += 4;
|
|
|
|
|
if (frameless_p) /* If the add is all we care about, */
|
|
|
|
|
return pc; /* return before doing more work */
|
1994-12-18 06:59:12 +00:00
|
|
|
|
is_flat = 1;
|
|
|
|
|
insn = read_memory_integer (pc, 4);
|
|
|
|
|
/* Recognize store of frame pointer (i7). */
|
|
|
|
|
if (X_OP (insn) == 3
|
|
|
|
|
&& X_RD (insn) == 31
|
|
|
|
|
&& X_OP3 (insn) == 4
|
|
|
|
|
&& X_RS1 (insn) == 14)
|
|
|
|
|
{
|
|
|
|
|
pc += 4;
|
|
|
|
|
insn = read_memory_integer (pc, 4);
|
|
|
|
|
|
|
|
|
|
/* Recognize sub %sp, <anything>, %i7. */
|
|
|
|
|
if (X_OP (insn) == 2
|
|
|
|
|
&& X_OP3 (insn) == 4
|
|
|
|
|
&& X_RS1 (insn) == 14
|
|
|
|
|
&& X_RD (insn) == 31)
|
|
|
|
|
{
|
|
|
|
|
pc += 4;
|
|
|
|
|
insn = read_memory_integer (pc, 4);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return pc;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return pc;
|
1991-08-14 00:00:25 +00:00
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
else
|
|
|
|
|
/* Without a save or add instruction, it's not a prologue. */
|
|
|
|
|
return start_pc;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
while (1)
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* Recognize stores into the frame from the input registers.
|
|
|
|
|
This recognizes all non alternate stores of input register,
|
|
|
|
|
into a location offset from the frame pointer. */
|
|
|
|
|
if ((X_OP (insn) == 3
|
|
|
|
|
&& (X_OP3 (insn) & 0x3c) == 4 /* Store, non-alternate. */
|
|
|
|
|
&& (X_RD (insn) & 0x18) == 0x18 /* Input register. */
|
|
|
|
|
&& X_I (insn) /* Immediate mode. */
|
|
|
|
|
&& X_RS1 (insn) == 30 /* Off of frame pointer. */
|
|
|
|
|
/* Into reserved stack space. */
|
|
|
|
|
&& X_SIMM13 (insn) >= 0x44
|
|
|
|
|
&& X_SIMM13 (insn) < 0x5b))
|
|
|
|
|
;
|
|
|
|
|
else if (is_flat
|
|
|
|
|
&& X_OP (insn) == 3
|
|
|
|
|
&& X_OP3 (insn) == 4
|
|
|
|
|
&& X_RS1 (insn) == 14
|
|
|
|
|
)
|
|
|
|
|
{
|
|
|
|
|
if (saved_regs && X_I (insn))
|
|
|
|
|
saved_regs->regs[X_RD (insn)] =
|
|
|
|
|
fi->frame + fi->sp_offset + X_SIMM13 (insn);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
break;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
pc += 4;
|
1994-12-18 06:59:12 +00:00
|
|
|
|
insn = read_memory_integer (pc, 4);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
|
1991-08-14 00:00:25 +00:00
|
|
|
|
return pc;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
CORE_ADDR
|
|
|
|
|
skip_prologue (start_pc, frameless_p)
|
|
|
|
|
CORE_ADDR start_pc;
|
|
|
|
|
int frameless_p;
|
|
|
|
|
{
|
|
|
|
|
return examine_prologue (start_pc, frameless_p, NULL, NULL);
|
|
|
|
|
}
|
|
|
|
|
|
1991-03-28 16:26:26 +00:00
|
|
|
|
/* Check instruction at ADDR to see if it is an annulled branch.
|
|
|
|
|
All other instructions will go to NPC or will trap.
|
1994-12-17 10:46:32 +00:00
|
|
|
|
Set *TARGET if we find a candidate branch; set to zero if not. */
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
branch_type
|
|
|
|
|
isannulled (instruction, addr, target)
|
|
|
|
|
long instruction;
|
|
|
|
|
CORE_ADDR addr, *target;
|
|
|
|
|
{
|
|
|
|
|
branch_type val = not_branch;
|
|
|
|
|
long int offset; /* Must be signed for sign-extend. */
|
|
|
|
|
|
|
|
|
|
*target = 0;
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (X_OP (instruction) == 0
|
|
|
|
|
&& (X_OP2 (instruction) == 2
|
|
|
|
|
|| X_OP2 (instruction) == 6
|
|
|
|
|
|| X_OP2 (instruction) == 7))
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (X_COND (instruction) == 8)
|
|
|
|
|
val = X_A (instruction) ? baa : ba;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
else
|
1994-12-18 06:59:12 +00:00
|
|
|
|
val = X_A (instruction) ? bicca : bicc;
|
|
|
|
|
offset = 4 * X_DISP22 (instruction);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
*target = addr + offset;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return val;
|
|
|
|
|
}
|
1994-12-18 06:59:12 +00:00
|
|
|
|
|
|
|
|
|
/* Find register number REGNUM relative to FRAME and put its
|
|
|
|
|
(raw) contents in *RAW_BUFFER. Set *OPTIMIZED if the variable
|
|
|
|
|
was optimized out (and thus can't be fetched). If the variable
|
|
|
|
|
was fetched from memory, set *ADDRP to where it was fetched from,
|
|
|
|
|
otherwise it was fetched from a register.
|
|
|
|
|
|
|
|
|
|
The argument RAW_BUFFER must point to aligned memory. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
get_saved_register (raw_buffer, optimized, addrp, frame, regnum, lval)
|
|
|
|
|
char *raw_buffer;
|
|
|
|
|
int *optimized;
|
|
|
|
|
CORE_ADDR *addrp;
|
|
|
|
|
struct frame_info *frame;
|
|
|
|
|
int regnum;
|
|
|
|
|
enum lval_type *lval;
|
|
|
|
|
{
|
|
|
|
|
struct frame_info *frame1;
|
|
|
|
|
CORE_ADDR addr;
|
|
|
|
|
|
1994-12-20 21:06:13 +00:00
|
|
|
|
if (!target_has_registers)
|
|
|
|
|
error ("No registers.");
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (optimized)
|
|
|
|
|
*optimized = 0;
|
|
|
|
|
|
|
|
|
|
addr = 0;
|
|
|
|
|
frame1 = frame->next;
|
|
|
|
|
while (frame1 != NULL)
|
|
|
|
|
{
|
|
|
|
|
if (frame1->pc >= (frame1->bottom ? frame1->bottom :
|
|
|
|
|
read_register (SP_REGNUM))
|
|
|
|
|
&& frame1->pc <= FRAME_FP (frame1))
|
|
|
|
|
{
|
|
|
|
|
/* Dummy frame. All but the window regs are in there somewhere. */
|
|
|
|
|
if (regnum >= G1_REGNUM && regnum < G1_REGNUM + 7)
|
|
|
|
|
addr = frame1->frame + (regnum - G0_REGNUM) * 4 - 0xa0;
|
|
|
|
|
else if (regnum >= I0_REGNUM && regnum < I0_REGNUM + 8)
|
|
|
|
|
addr = frame1->frame + (regnum - I0_REGNUM) * 4 - 0xc0;
|
|
|
|
|
else if (regnum >= FP0_REGNUM && regnum < FP0_REGNUM + 32)
|
|
|
|
|
addr = frame1->frame + (regnum - FP0_REGNUM) * 4 - 0x80;
|
|
|
|
|
else if (regnum >= Y_REGNUM && regnum < NUM_REGS)
|
|
|
|
|
addr = frame1->frame + (regnum - Y_REGNUM) * 4 - 0xe0;
|
|
|
|
|
}
|
|
|
|
|
else if (frame1->flat)
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
if (regnum == RP_REGNUM)
|
|
|
|
|
addr = frame1->pc_addr;
|
|
|
|
|
else if (regnum == I7_REGNUM)
|
|
|
|
|
addr = frame1->fp_addr;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR func_start;
|
|
|
|
|
struct frame_saved_regs regs;
|
|
|
|
|
memset (®s, 0, sizeof (regs));
|
|
|
|
|
|
|
|
|
|
find_pc_partial_function (frame1->pc, NULL, &func_start, NULL);
|
|
|
|
|
examine_prologue (func_start, 0, frame1, ®s);
|
|
|
|
|
addr = regs.regs[regnum];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Normal frame. Local and In registers are saved on stack. */
|
|
|
|
|
if (regnum >= I0_REGNUM && regnum < I0_REGNUM + 8)
|
|
|
|
|
addr = (frame1->prev->bottom
|
|
|
|
|
+ (regnum - I0_REGNUM) * REGISTER_RAW_SIZE (I0_REGNUM)
|
|
|
|
|
+ FRAME_SAVED_I0);
|
|
|
|
|
else if (regnum >= L0_REGNUM && regnum < L0_REGNUM + 8)
|
|
|
|
|
addr = (frame1->prev->bottom
|
|
|
|
|
+ (regnum - L0_REGNUM) * REGISTER_RAW_SIZE (L0_REGNUM)
|
|
|
|
|
+ FRAME_SAVED_L0);
|
|
|
|
|
else if (regnum >= O0_REGNUM && regnum < O0_REGNUM + 8)
|
|
|
|
|
{
|
|
|
|
|
/* Outs become ins. */
|
|
|
|
|
get_saved_register (raw_buffer, optimized, addrp, frame1,
|
|
|
|
|
(regnum - O0_REGNUM + I0_REGNUM), lval);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (addr != 0)
|
|
|
|
|
break;
|
|
|
|
|
frame1 = frame1->next;
|
|
|
|
|
}
|
|
|
|
|
if (addr != 0)
|
|
|
|
|
{
|
|
|
|
|
if (lval != NULL)
|
|
|
|
|
*lval = lval_memory;
|
|
|
|
|
if (regnum == SP_REGNUM)
|
|
|
|
|
{
|
|
|
|
|
if (raw_buffer != NULL)
|
|
|
|
|
{
|
|
|
|
|
/* Put it back in target format. */
|
|
|
|
|
store_address (raw_buffer, REGISTER_RAW_SIZE (regnum), addr);
|
|
|
|
|
}
|
|
|
|
|
if (addrp != NULL)
|
|
|
|
|
*addrp = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
if (raw_buffer != NULL)
|
|
|
|
|
read_memory (addr, raw_buffer, REGISTER_RAW_SIZE (regnum));
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
if (lval != NULL)
|
|
|
|
|
*lval = lval_register;
|
|
|
|
|
addr = REGISTER_BYTE (regnum);
|
|
|
|
|
if (raw_buffer != NULL)
|
|
|
|
|
read_register_gen (regnum, raw_buffer);
|
|
|
|
|
}
|
|
|
|
|
if (addrp != NULL)
|
|
|
|
|
*addrp = addr;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Push an empty stack frame, and record in it the current PC, regs, etc.
|
|
|
|
|
|
|
|
|
|
We save the non-windowed registers and the ins. The locals and outs
|
|
|
|
|
are new; they don't need to be saved. The i's and l's of
|
|
|
|
|
the last frame were already saved on the stack. */
|
|
|
|
|
|
|
|
|
|
/* Definitely see tm-sparc.h for more doc of the frame format here. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
sparc_push_dummy_frame ()
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR sp, old_sp;
|
|
|
|
|
char register_temp[0x140];
|
|
|
|
|
|
|
|
|
|
old_sp = sp = read_register (SP_REGNUM);
|
|
|
|
|
|
|
|
|
|
/* Y, PS, WIM, TBR, PC, NPC, FPS, CPS regs */
|
|
|
|
|
read_register_bytes (REGISTER_BYTE (Y_REGNUM), ®ister_temp[0],
|
|
|
|
|
REGISTER_RAW_SIZE (Y_REGNUM) * 8);
|
|
|
|
|
|
|
|
|
|
read_register_bytes (REGISTER_BYTE (O0_REGNUM), ®ister_temp[8 * 4],
|
|
|
|
|
REGISTER_RAW_SIZE (O0_REGNUM) * 8);
|
|
|
|
|
|
|
|
|
|
read_register_bytes (REGISTER_BYTE (G0_REGNUM), ®ister_temp[16 * 4],
|
|
|
|
|
REGISTER_RAW_SIZE (G0_REGNUM) * 8);
|
|
|
|
|
|
|
|
|
|
read_register_bytes (REGISTER_BYTE (FP0_REGNUM), ®ister_temp[24 * 4],
|
|
|
|
|
REGISTER_RAW_SIZE (FP0_REGNUM) * 32);
|
|
|
|
|
|
|
|
|
|
sp -= 0x140;
|
|
|
|
|
|
|
|
|
|
write_register (SP_REGNUM, sp);
|
|
|
|
|
|
|
|
|
|
write_memory (sp + 0x60, ®ister_temp[0], (8 + 8 + 8 + 32) * 4);
|
|
|
|
|
|
|
|
|
|
write_register (FP_REGNUM, old_sp);
|
|
|
|
|
|
|
|
|
|
/* Set return address register for the call dummy to the current PC. */
|
|
|
|
|
write_register (I7_REGNUM, read_pc() - 8);
|
|
|
|
|
}
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
/* sparc_frame_find_saved_regs (). This function is here only because
|
|
|
|
|
pop_frame uses it. Note there is an interesting corner case which
|
|
|
|
|
I think few ports of GDB get right--if you are popping a frame
|
|
|
|
|
which does not save some register that *is* saved by a more inner
|
|
|
|
|
frame (such a frame will never be a dummy frame because dummy
|
|
|
|
|
frames save all registers). Rewriting pop_frame to use
|
|
|
|
|
get_saved_register would solve this problem and also get rid of the
|
|
|
|
|
ugly duplication between sparc_frame_find_saved_regs and
|
|
|
|
|
get_saved_register.
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
Stores, into a struct frame_saved_regs,
|
|
|
|
|
the addresses of the saved registers of frame described by FRAME_INFO.
|
|
|
|
|
This includes special registers such as pc and fp saved in special
|
|
|
|
|
ways in the stack frame. sp is even more special:
|
|
|
|
|
the address we return for it IS the sp for the next frame.
|
|
|
|
|
|
|
|
|
|
Note that on register window machines, we are currently making the
|
|
|
|
|
assumption that window registers are being saved somewhere in the
|
|
|
|
|
frame in which they are being used. If they are stored in an
|
|
|
|
|
inferior frame, find_saved_register will break.
|
|
|
|
|
|
|
|
|
|
On the Sun 4, the only time all registers are saved is when
|
|
|
|
|
a dummy frame is involved. Otherwise, the only saved registers
|
|
|
|
|
are the LOCAL and IN registers which are saved as a result
|
|
|
|
|
of the "save/restore" opcodes. This condition is determined
|
|
|
|
|
by address rather than by value.
|
|
|
|
|
|
|
|
|
|
The "pc" is not stored in a frame on the SPARC. (What is stored
|
|
|
|
|
is a return address minus 8.) sparc_pop_frame knows how to
|
|
|
|
|
deal with that. Other routines might or might not.
|
|
|
|
|
|
|
|
|
|
See tm-sparc.h (PUSH_FRAME and friends) for CRITICAL information
|
|
|
|
|
about how this works. */
|
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
static void sparc_frame_find_saved_regs PARAMS ((struct frame_info *,
|
|
|
|
|
struct frame_saved_regs *));
|
|
|
|
|
|
|
|
|
|
static void
|
1991-03-28 16:26:26 +00:00
|
|
|
|
sparc_frame_find_saved_regs (fi, saved_regs_addr)
|
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
struct frame_saved_regs *saved_regs_addr;
|
|
|
|
|
{
|
|
|
|
|
register int regnum;
|
1994-12-17 10:46:32 +00:00
|
|
|
|
CORE_ADDR frame_addr = FRAME_FP (fi);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
if (!fi)
|
1991-03-28 16:26:26 +00:00
|
|
|
|
fatal ("Bad frame info struct in FRAME_FIND_SAVED_REGS");
|
|
|
|
|
|
1992-09-26 09:04:24 +00:00
|
|
|
|
memset (saved_regs_addr, 0, sizeof (*saved_regs_addr));
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
|
|
|
|
if (fi->pc >= (fi->bottom ? fi->bottom :
|
|
|
|
|
read_register (SP_REGNUM))
|
|
|
|
|
&& fi->pc <= FRAME_FP(fi))
|
|
|
|
|
{
|
|
|
|
|
/* Dummy frame. All but the window regs are in there somewhere. */
|
|
|
|
|
for (regnum = G1_REGNUM; regnum < G1_REGNUM+7; regnum++)
|
|
|
|
|
saved_regs_addr->regs[regnum] =
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame_addr + (regnum - G0_REGNUM) * 4 - 0xa0;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
for (regnum = I0_REGNUM; regnum < I0_REGNUM+8; regnum++)
|
|
|
|
|
saved_regs_addr->regs[regnum] =
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame_addr + (regnum - I0_REGNUM) * 4 - 0xc0;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
for (regnum = FP0_REGNUM; regnum < FP0_REGNUM + 32; regnum++)
|
|
|
|
|
saved_regs_addr->regs[regnum] =
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame_addr + (regnum - FP0_REGNUM) * 4 - 0x80;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
for (regnum = Y_REGNUM; regnum < NUM_REGS; regnum++)
|
|
|
|
|
saved_regs_addr->regs[regnum] =
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame_addr + (regnum - Y_REGNUM) * 4 - 0xe0;
|
|
|
|
|
frame_addr = fi->bottom ?
|
1991-03-28 16:26:26 +00:00
|
|
|
|
fi->bottom : read_register (SP_REGNUM);
|
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
else if (fi->flat)
|
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
CORE_ADDR func_start;
|
|
|
|
|
find_pc_partial_function (fi->pc, NULL, &func_start, NULL);
|
|
|
|
|
examine_prologue (func_start, 0, fi, saved_regs_addr);
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
/* Flat register window frame. */
|
|
|
|
|
saved_regs_addr->regs[RP_REGNUM] = fi->pc_addr;
|
|
|
|
|
saved_regs_addr->regs[I7_REGNUM] = fi->fp_addr;
|
|
|
|
|
}
|
1991-03-28 16:26:26 +00:00
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Normal frame. Just Local and In registers */
|
1994-12-17 10:46:32 +00:00
|
|
|
|
frame_addr = fi->bottom ?
|
1991-03-28 16:26:26 +00:00
|
|
|
|
fi->bottom : read_register (SP_REGNUM);
|
1994-12-17 10:46:32 +00:00
|
|
|
|
for (regnum = L0_REGNUM; regnum < L0_REGNUM+8; regnum++)
|
The point of these changes is to avoid reading the frame pointer
and stack pointer during stepping, to speed things up.
A. Changes to not select a frame until we need a selected frame:
* blockframe.c (flush_cached_frames): Call select_frame (NULL, -1).
* infrun.c (wait_for_inferior): Move call to select_frame back to
normal_stop. This reverts a change of 13 Apr 94 (it says Jeff
Law, but the change was my idea); the only reason for that change
was so we could save and restore the selected frame in
wait_for_inferior, and now that flush_cached frames clears the
selected frame, that should work OK now.
B. Changes to not create a current_frame until we need one:
* blockframe.c (get_current_frame): If current_frame is NULL, try
to create an innermost frame.
* sparc-tdep.c (sparc_pop_frame), infcmd.c (run-stack_dummy),
infrun.c (wait_for_inferior), thread.c (thread_switch),
convex-tdep.c (set_thread_command), a29k-tdep.c (pop_frame),
alpha-tdep.c (alpha_pop_frame), convex-xdep.c (core_file_command),
h8300-tdep.c (h8300_pop_frame), h8500-tdep.c (h8300_pop_frame),
hppa-tdep.c (hppa_pop_frame), i386-tdep.c (i386_pop_frame),
i960-tdep.c (pop_frame), m68k-tdep.c
(m68k_pop_frame), mips-tdep.c (mips_pop_frame), rs6000-tdep.c
(push_dummy_frame, pop_dummy_frame, pop_frame), sh-tdep.c
(pop_frame), config/arm/tm-arm.h (POP_FRAME),
config/convex/tm-convex.h (POP_FRAME), config/gould/tm-pn.h
(POP_FRAME), config/ns32k/tm-merlin.h (POP_FRAME),
config/ns32k/tm-umax.h (POP_FRAME), config/tahoe/tm-tahoe.h
(POP_FRAME), config/vax/tm-vax.h (POP_FRAME): Don't
call create_new_frame.
* corelow.c (core_open), altos-xdep.c (core_file_command),
arm-xdep.c (core_file_command), gould-xdep.c (core_file_command),
m3-nat.c (select_thread), sun386-nat.c (core_file_command),
umax-xdep.c (core_file_command): Don't call create_new_frame; do
call flush_cached_frames.
* blockframe.c (reinit_frame_cache): Don't call create_new_frame
or select_frame.
C. Changes to get rid of stop_frame_address and instead only
fetch the frame pointer when we need it.
* breakpoint.c (bpstat_stop_status): Remove argument
frame_address; use FRAME_FP (get_current_frame ()).
* infrun.c (wait_for_inferior): Don't pass frame pointer to
bpstat_stop_status.
* infrun.c (wait_for_inferior): Use FRAME_FP (get_current_frame
()) instead of stop_frame_address.
* infrun.c (save_inferior_status, restore_inferior_status),
inferior.h (struct inferior_status): Don't save and restore
stop_frame_address.
* inferior.h, infcmd.c, thread.c (thread_switch), m3-nat.c
(select_thread): Remove stop_frame_address and uses thereof.
D. Same thing for the stack pointer.
* infrun.c (wait_for_inferior): Remove stop_sp and replace
uses thereof with read_sp ().
E. Change to eliminate one nasty little spot where we were
wanting to know the frame pointer from before the current step
(idea from GDB 3.5, which saved my ass, because my other ideas of
how to fix it were very baroque).
* infrun.c: Remove prev_frame_address.
* infrun.c (wait_for_inferior, step_over_function): Use
step_frame_address instead of prev_frame_address.
F. Same basic idea for the stack pointer.
* inferior.h, infcmd.c: New variable step_sp.
* infcmd.c (step_1, until_next_command): Set it.
* infrun.c: Remove prev_sp and replace uses by step_sp.
* infrun.c (wait_for_inferior): If we get out of the step
range, then set step_sp to the current stack pointer before we
start going again.
1994-10-08 03:41:21 +00:00
|
|
|
|
saved_regs_addr->regs[regnum] =
|
1994-12-17 10:46:32 +00:00
|
|
|
|
(frame_addr + (regnum - L0_REGNUM) * REGISTER_RAW_SIZE (L0_REGNUM)
|
|
|
|
|
+ FRAME_SAVED_L0);
|
|
|
|
|
for (regnum = I0_REGNUM; regnum < I0_REGNUM+8; regnum++)
|
|
|
|
|
saved_regs_addr->regs[regnum] =
|
|
|
|
|
(frame_addr + (regnum - I0_REGNUM) * REGISTER_RAW_SIZE (I0_REGNUM)
|
|
|
|
|
+ FRAME_SAVED_I0);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
if (fi->next)
|
|
|
|
|
{
|
1994-12-17 10:46:32 +00:00
|
|
|
|
if (fi->flat)
|
|
|
|
|
{
|
|
|
|
|
saved_regs_addr->regs[O7_REGNUM] = fi->pc_addr;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Pull off either the next frame pointer or the stack pointer */
|
|
|
|
|
CORE_ADDR next_next_frame_addr =
|
|
|
|
|
(fi->next->bottom ?
|
|
|
|
|
fi->next->bottom :
|
|
|
|
|
read_register (SP_REGNUM));
|
|
|
|
|
for (regnum = O0_REGNUM; regnum < O0_REGNUM+8; regnum++)
|
|
|
|
|
saved_regs_addr->regs[regnum] =
|
|
|
|
|
(next_next_frame_addr
|
|
|
|
|
+ (regnum - O0_REGNUM) * REGISTER_RAW_SIZE (O0_REGNUM)
|
|
|
|
|
+ FRAME_SAVED_I0);
|
|
|
|
|
}
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
/* Otherwise, whatever we would get from ptrace(GETREGS) is accurate */
|
|
|
|
|
saved_regs_addr->regs[SP_REGNUM] = FRAME_FP (fi);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Discard from the stack the innermost frame, restoring all saved registers.
|
|
|
|
|
|
|
|
|
|
Note that the values stored in fsr by get_frame_saved_regs are *in
|
|
|
|
|
the context of the called frame*. What this means is that the i
|
|
|
|
|
regs of fsr must be restored into the o regs of the (calling) frame that
|
|
|
|
|
we pop into. We don't care about the output regs of the calling frame,
|
|
|
|
|
since unless it's a dummy frame, it won't have any output regs in it.
|
|
|
|
|
|
|
|
|
|
We never have to bother with %l (local) regs, since the called routine's
|
|
|
|
|
locals get tossed, and the calling routine's locals are already saved
|
|
|
|
|
on its stack. */
|
|
|
|
|
|
|
|
|
|
/* Definitely see tm-sparc.h for more doc of the frame format here. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
sparc_pop_frame ()
|
|
|
|
|
{
|
1994-12-17 10:46:32 +00:00
|
|
|
|
register struct frame_info *frame = get_current_frame ();
|
1991-03-28 16:26:26 +00:00
|
|
|
|
register CORE_ADDR pc;
|
|
|
|
|
struct frame_saved_regs fsr;
|
|
|
|
|
char raw_buffer[REGISTER_BYTES];
|
1994-12-17 10:46:32 +00:00
|
|
|
|
int regnum;
|
1991-03-28 16:26:26 +00:00
|
|
|
|
|
1994-12-18 06:59:12 +00:00
|
|
|
|
sparc_frame_find_saved_regs (frame, &fsr);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
if (fsr.regs[FP0_REGNUM])
|
|
|
|
|
{
|
|
|
|
|
read_memory (fsr.regs[FP0_REGNUM], raw_buffer, 32 * 4);
|
|
|
|
|
write_register_bytes (REGISTER_BYTE (FP0_REGNUM), raw_buffer, 32 * 4);
|
|
|
|
|
}
|
1994-01-19 20:45:30 +00:00
|
|
|
|
if (fsr.regs[FPS_REGNUM])
|
|
|
|
|
{
|
|
|
|
|
read_memory (fsr.regs[FPS_REGNUM], raw_buffer, 4);
|
|
|
|
|
write_register_bytes (REGISTER_BYTE (FPS_REGNUM), raw_buffer, 4);
|
|
|
|
|
}
|
|
|
|
|
if (fsr.regs[CPS_REGNUM])
|
|
|
|
|
{
|
|
|
|
|
read_memory (fsr.regs[CPS_REGNUM], raw_buffer, 4);
|
|
|
|
|
write_register_bytes (REGISTER_BYTE (CPS_REGNUM), raw_buffer, 4);
|
|
|
|
|
}
|
1991-03-28 16:26:26 +00:00
|
|
|
|
if (fsr.regs[G1_REGNUM])
|
|
|
|
|
{
|
|
|
|
|
read_memory (fsr.regs[G1_REGNUM], raw_buffer, 7 * 4);
|
|
|
|
|
write_register_bytes (REGISTER_BYTE (G1_REGNUM), raw_buffer, 7 * 4);
|
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
|
|
|
|
|
if (frame->flat)
|
|
|
|
|
{
|
|
|
|
|
/* Each register might or might not have been saved, need to test
|
|
|
|
|
individually. */
|
|
|
|
|
for (regnum = L0_REGNUM; regnum < L0_REGNUM + 8; ++regnum)
|
|
|
|
|
if (fsr.regs[regnum])
|
|
|
|
|
write_register (regnum, read_memory_integer (fsr.regs[regnum], 4));
|
|
|
|
|
for (regnum = I0_REGNUM; regnum < I0_REGNUM + 8; ++regnum)
|
|
|
|
|
if (fsr.regs[regnum])
|
|
|
|
|
write_register (regnum, read_memory_integer (fsr.regs[regnum], 4));
|
1994-12-18 06:59:12 +00:00
|
|
|
|
|
|
|
|
|
/* Handle all outs except stack pointer (o0-o5; o7). */
|
|
|
|
|
for (regnum = O0_REGNUM; regnum < O0_REGNUM + 6; ++regnum)
|
1994-12-17 10:46:32 +00:00
|
|
|
|
if (fsr.regs[regnum])
|
|
|
|
|
write_register (regnum, read_memory_integer (fsr.regs[regnum], 4));
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (fsr.regs[O0_REGNUM + 7])
|
|
|
|
|
write_register (O0_REGNUM + 7,
|
|
|
|
|
read_memory_integer (fsr.regs[O0_REGNUM + 7], 4));
|
|
|
|
|
|
1994-12-18 19:55:28 +00:00
|
|
|
|
write_register (SP_REGNUM, frame->frame);
|
1994-12-17 10:46:32 +00:00
|
|
|
|
}
|
|
|
|
|
else if (fsr.regs[I0_REGNUM])
|
1991-03-28 16:26:26 +00:00
|
|
|
|
{
|
1993-07-09 03:53:46 +00:00
|
|
|
|
CORE_ADDR sp;
|
|
|
|
|
|
|
|
|
|
char reg_temp[REGISTER_BYTES];
|
|
|
|
|
|
1991-03-28 16:26:26 +00:00
|
|
|
|
read_memory (fsr.regs[I0_REGNUM], raw_buffer, 8 * 4);
|
1993-07-09 03:53:46 +00:00
|
|
|
|
|
|
|
|
|
/* Get the ins and locals which we are about to restore. Just
|
|
|
|
|
moving the stack pointer is all that is really needed, except
|
|
|
|
|
store_inferior_registers is then going to write the ins and
|
|
|
|
|
locals from the registers array, so we need to muck with the
|
|
|
|
|
registers array. */
|
|
|
|
|
sp = fsr.regs[SP_REGNUM];
|
|
|
|
|
read_memory (sp, reg_temp, REGISTER_RAW_SIZE (L0_REGNUM) * 16);
|
|
|
|
|
|
|
|
|
|
/* Restore the out registers.
|
|
|
|
|
Among other things this writes the new stack pointer. */
|
|
|
|
|
write_register_bytes (REGISTER_BYTE (O0_REGNUM), raw_buffer,
|
|
|
|
|
REGISTER_RAW_SIZE (O0_REGNUM) * 8);
|
|
|
|
|
|
|
|
|
|
write_register_bytes (REGISTER_BYTE (L0_REGNUM), reg_temp,
|
|
|
|
|
REGISTER_RAW_SIZE (L0_REGNUM) * 16);
|
1991-03-28 16:26:26 +00:00
|
|
|
|
}
|
|
|
|
|
if (fsr.regs[PS_REGNUM])
|
|
|
|
|
write_register (PS_REGNUM, read_memory_integer (fsr.regs[PS_REGNUM], 4));
|
|
|
|
|
if (fsr.regs[Y_REGNUM])
|
|
|
|
|
write_register (Y_REGNUM, read_memory_integer (fsr.regs[Y_REGNUM], 4));
|
|
|
|
|
if (fsr.regs[PC_REGNUM])
|
|
|
|
|
{
|
|
|
|
|
/* Explicitly specified PC (and maybe NPC) -- just restore them. */
|
|
|
|
|
write_register (PC_REGNUM, read_memory_integer (fsr.regs[PC_REGNUM], 4));
|
|
|
|
|
if (fsr.regs[NPC_REGNUM])
|
|
|
|
|
write_register (NPC_REGNUM,
|
|
|
|
|
read_memory_integer (fsr.regs[NPC_REGNUM], 4));
|
|
|
|
|
}
|
1994-12-18 06:59:12 +00:00
|
|
|
|
else if (frame->flat)
|
1994-12-17 10:46:32 +00:00
|
|
|
|
{
|
1994-12-18 06:59:12 +00:00
|
|
|
|
if (frame->pc_addr)
|
|
|
|
|
pc = PC_ADJUST ((CORE_ADDR) read_memory_integer (frame->pc_addr, 4));
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* I think this happens only in the innermost frame, if so then
|
|
|
|
|
it is a complicated way of saying
|
|
|
|
|
"pc = read_register (O7_REGNUM);". */
|
|
|
|
|
char buf[MAX_REGISTER_RAW_SIZE];
|
|
|
|
|
get_saved_register (buf, 0, 0, frame, O7_REGNUM, 0);
|
|
|
|
|
pc = PC_ADJUST (extract_address
|
|
|
|
|
(buf, REGISTER_RAW_SIZE (O7_REGNUM)));
|
|
|
|
|
}
|
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
write_register (PC_REGNUM, pc);
|
|
|
|
|
write_register (NPC_REGNUM, pc + 4);
|
|
|
|
|
}
|
1991-03-28 16:26:26 +00:00
|
|
|
|
else if (fsr.regs[I7_REGNUM])
|
|
|
|
|
{
|
|
|
|
|
/* Return address in %i7 -- adjust it, then restore PC and NPC from it */
|
Speed up GDB startup time by not demangling partial symbols.
* symfile.h (ADD_PSYMBOL_VT_TO_LIST),
symfile.c (add_psymbol_to_list, add_psymbol_addr_to_list):
No longer demangle partial symbols.
* symtab.c (lookup_symbol, list_symbols): Handle mangled
variables, e.g. C++ static members, via the minimal symbols.
Handle reordered functions in an objfile, for Irix 5.2 shared
libraries.
* objfiles.h (OBJF_REORDERED): New bit in the objfile flags,
set if the functions in an objfile are reordered.
* mdebugread.c (parse_partial_symbols): Detect reordered
functions in an objfile.
* symtab.c (find_pc_psymtab, find_pc_symtab): Use expensive
lookup algorithm if the functions in the objfile are reordered.
* xcoffexec.c (exec_close): If the current target has a copy
of the exec_ops sections, reflect the freeing of the sections
in current_target.
* valops.c (call_function_by_hand): Use `sizeof dummy1', not
`sizeof dummy', for constructing the call dummy code.
* config/sparc/tm-sparc.h: Add PARAMS declarations to all
function declarations.
* sparc-tdep.c (sparc_pop_frame): Cast result of
read_memory_integer to CORE_ADDR when passing it to PC_ADJUST.
* irix5-nat.c (enable_break): Set breakpoint at the entry point
of the executable, to handle the case where main resides in a
shared library.
* irix5-nat.c (solib_create_inferior_hook): Reset stop_soon_quietly
after shared library symbol reading, to get rid of a warning from
heuristic_proc_start if the startup code has no symbolic debug info.
* breakpoint.h (struct breakpoint): Add new fields language
and input_radix, to enable breakpoint resetting with the
proper language and radix.
* breakpoint.c (set_raw_breakpoint): Initialize them.
(breakpoint_re_set_one): Use them when resetting the breakpoint.
(breakpoint_re_set): Preserve current language and input_radix
across breakpoint_re_set_one calls.
* symtab.c (decode_line_1): Do not build a canonical line
specification for `*expr' line specifications.
* breakpoint.h (bpstat_stop_status): Fix prototype declaration.
1994-10-08 11:54:29 +00:00
|
|
|
|
pc = PC_ADJUST ((CORE_ADDR) read_memory_integer (fsr.regs[I7_REGNUM], 4));
|
1991-03-28 16:26:26 +00:00
|
|
|
|
write_register (PC_REGNUM, pc);
|
|
|
|
|
write_register (NPC_REGNUM, pc + 4);
|
|
|
|
|
}
|
|
|
|
|
flush_cached_frames ();
|
|
|
|
|
}
|
|
|
|
|
|
1991-08-20 03:02:39 +00:00
|
|
|
|
/* On the Sun 4 under SunOS, the compile will leave a fake insn which
|
|
|
|
|
encodes the structure size being returned. If we detect such
|
|
|
|
|
a fake insn, step past it. */
|
|
|
|
|
|
|
|
|
|
CORE_ADDR
|
|
|
|
|
sparc_pc_adjust(pc)
|
|
|
|
|
CORE_ADDR pc;
|
|
|
|
|
{
|
1993-07-10 01:35:53 +00:00
|
|
|
|
unsigned long insn;
|
|
|
|
|
char buf[4];
|
1991-08-20 03:02:39 +00:00
|
|
|
|
int err;
|
|
|
|
|
|
1993-07-10 01:35:53 +00:00
|
|
|
|
err = target_read_memory (pc + 8, buf, sizeof(long));
|
|
|
|
|
insn = extract_unsigned_integer (buf, 4);
|
1991-08-20 03:02:39 +00:00
|
|
|
|
if ((err == 0) && (insn & 0xfffffe00) == 0)
|
|
|
|
|
return pc+12;
|
|
|
|
|
else
|
|
|
|
|
return pc+8;
|
|
|
|
|
}
|
1994-12-17 10:46:32 +00:00
|
|
|
|
|
|
|
|
|
/* If pc is in a shared library trampoline, return its target.
|
|
|
|
|
The SunOs 4.x linker rewrites the jump table entries for PIC
|
|
|
|
|
compiled modules in the main executable to bypass the dynamic linker
|
|
|
|
|
with jumps of the form
|
|
|
|
|
sethi %hi(addr),%g1
|
|
|
|
|
jmp %g1+%lo(addr)
|
|
|
|
|
and removes the corresponding jump table relocation entry in the
|
|
|
|
|
dynamic relocations.
|
|
|
|
|
find_solib_trampoline_target relies on the presence of the jump
|
|
|
|
|
table relocation entry, so we have to detect these jump instructions
|
|
|
|
|
by hand. */
|
|
|
|
|
|
|
|
|
|
CORE_ADDR
|
|
|
|
|
sunos4_skip_trampoline_code (pc)
|
|
|
|
|
CORE_ADDR pc;
|
|
|
|
|
{
|
|
|
|
|
unsigned long insn1;
|
|
|
|
|
char buf[4];
|
|
|
|
|
int err;
|
|
|
|
|
|
|
|
|
|
err = target_read_memory (pc, buf, 4);
|
|
|
|
|
insn1 = extract_unsigned_integer (buf, 4);
|
|
|
|
|
if (err == 0 && (insn1 & 0xffc00000) == 0x03000000)
|
|
|
|
|
{
|
|
|
|
|
unsigned long insn2;
|
|
|
|
|
|
|
|
|
|
err = target_read_memory (pc + 4, buf, 4);
|
|
|
|
|
insn2 = extract_unsigned_integer (buf, 4);
|
|
|
|
|
if (err == 0 && (insn2 & 0xffffe000) == 0x81c06000)
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR target_pc = (insn1 & 0x3fffff) << 10;
|
|
|
|
|
int delta = insn2 & 0x1fff;
|
|
|
|
|
|
|
|
|
|
/* Sign extend the displacement. */
|
|
|
|
|
if (delta & 0x1000)
|
|
|
|
|
delta |= ~0x1fff;
|
|
|
|
|
return target_pc + delta;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return find_solib_trampoline_target (pc);
|
|
|
|
|
}
|
1992-06-19 21:09:54 +00:00
|
|
|
|
|
|
|
|
|
#ifdef USE_PROC_FS /* Target dependent support for /proc */
|
|
|
|
|
|
|
|
|
|
/* The /proc interface divides the target machine's register set up into
|
|
|
|
|
two different sets, the general register set (gregset) and the floating
|
|
|
|
|
point register set (fpregset). For each set, there is an ioctl to get
|
|
|
|
|
the current register set and another ioctl to set the current values.
|
|
|
|
|
|
|
|
|
|
The actual structure passed through the ioctl interface is, of course,
|
|
|
|
|
naturally machine dependent, and is different for each set of registers.
|
|
|
|
|
For the sparc for example, the general register set is typically defined
|
|
|
|
|
by:
|
|
|
|
|
|
|
|
|
|
typedef int gregset_t[38];
|
|
|
|
|
|
|
|
|
|
#define R_G0 0
|
|
|
|
|
...
|
|
|
|
|
#define R_TBR 37
|
|
|
|
|
|
|
|
|
|
and the floating point set by:
|
|
|
|
|
|
|
|
|
|
typedef struct prfpregset {
|
|
|
|
|
union {
|
|
|
|
|
u_long pr_regs[32];
|
|
|
|
|
double pr_dregs[16];
|
|
|
|
|
} pr_fr;
|
|
|
|
|
void * pr_filler;
|
|
|
|
|
u_long pr_fsr;
|
|
|
|
|
u_char pr_qcnt;
|
|
|
|
|
u_char pr_q_entrysize;
|
|
|
|
|
u_char pr_en;
|
|
|
|
|
u_long pr_q[64];
|
|
|
|
|
} prfpregset_t;
|
|
|
|
|
|
|
|
|
|
These routines provide the packing and unpacking of gregset_t and
|
|
|
|
|
fpregset_t formatted data.
|
|
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* Given a pointer to a general register set in /proc format (gregset_t *),
|
|
|
|
|
unpack the register contents and supply them as gdb's idea of the current
|
|
|
|
|
register values. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
supply_gregset (gregsetp)
|
|
|
|
|
prgregset_t *gregsetp;
|
|
|
|
|
{
|
1992-09-26 09:04:24 +00:00
|
|
|
|
register int regi;
|
1992-06-19 21:09:54 +00:00
|
|
|
|
register prgreg_t *regp = (prgreg_t *) gregsetp;
|
|
|
|
|
|
|
|
|
|
/* GDB register numbers for Gn, On, Ln, In all match /proc reg numbers. */
|
1992-09-26 09:04:24 +00:00
|
|
|
|
for (regi = G0_REGNUM ; regi <= I7_REGNUM ; regi++)
|
1992-06-19 21:09:54 +00:00
|
|
|
|
{
|
1992-09-26 09:04:24 +00:00
|
|
|
|
supply_register (regi, (char *) (regp + regi));
|
1992-06-19 21:09:54 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* These require a bit more care. */
|
|
|
|
|
supply_register (PS_REGNUM, (char *) (regp + R_PS));
|
|
|
|
|
supply_register (PC_REGNUM, (char *) (regp + R_PC));
|
|
|
|
|
supply_register (NPC_REGNUM,(char *) (regp + R_nPC));
|
|
|
|
|
supply_register (Y_REGNUM, (char *) (regp + R_Y));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
fill_gregset (gregsetp, regno)
|
|
|
|
|
prgregset_t *gregsetp;
|
|
|
|
|
int regno;
|
|
|
|
|
{
|
|
|
|
|
int regi;
|
|
|
|
|
register prgreg_t *regp = (prgreg_t *) gregsetp;
|
|
|
|
|
extern char registers[];
|
|
|
|
|
|
|
|
|
|
for (regi = 0 ; regi <= R_I7 ; regi++)
|
|
|
|
|
{
|
|
|
|
|
if ((regno == -1) || (regno == regi))
|
|
|
|
|
{
|
1992-09-26 09:04:24 +00:00
|
|
|
|
*(regp + regi) = *(int *) ®isters[REGISTER_BYTE (regi)];
|
1992-06-19 21:09:54 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if ((regno == -1) || (regno == PS_REGNUM))
|
|
|
|
|
{
|
|
|
|
|
*(regp + R_PS) = *(int *) ®isters[REGISTER_BYTE (PS_REGNUM)];
|
|
|
|
|
}
|
|
|
|
|
if ((regno == -1) || (regno == PC_REGNUM))
|
|
|
|
|
{
|
|
|
|
|
*(regp + R_PC) = *(int *) ®isters[REGISTER_BYTE (PC_REGNUM)];
|
|
|
|
|
}
|
|
|
|
|
if ((regno == -1) || (regno == NPC_REGNUM))
|
|
|
|
|
{
|
|
|
|
|
*(regp + R_nPC) = *(int *) ®isters[REGISTER_BYTE (NPC_REGNUM)];
|
|
|
|
|
}
|
|
|
|
|
if ((regno == -1) || (regno == Y_REGNUM))
|
|
|
|
|
{
|
|
|
|
|
*(regp + R_Y) = *(int *) ®isters[REGISTER_BYTE (Y_REGNUM)];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#if defined (FP0_REGNUM)
|
|
|
|
|
|
|
|
|
|
/* Given a pointer to a floating point register set in /proc format
|
|
|
|
|
(fpregset_t *), unpack the register contents and supply them as gdb's
|
|
|
|
|
idea of the current floating point register values. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
supply_fpregset (fpregsetp)
|
|
|
|
|
prfpregset_t *fpregsetp;
|
|
|
|
|
{
|
|
|
|
|
register int regi;
|
|
|
|
|
char *from;
|
|
|
|
|
|
|
|
|
|
for (regi = FP0_REGNUM ; regi < FP0_REGNUM+32 ; regi++)
|
|
|
|
|
{
|
|
|
|
|
from = (char *) &fpregsetp->pr_fr.pr_regs[regi-FP0_REGNUM];
|
|
|
|
|
supply_register (regi, from);
|
|
|
|
|
}
|
|
|
|
|
supply_register (FPS_REGNUM, (char *) &(fpregsetp->pr_fsr));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Given a pointer to a floating point register set in /proc format
|
|
|
|
|
(fpregset_t *), update the register specified by REGNO from gdb's idea
|
|
|
|
|
of the current floating point register set. If REGNO is -1, update
|
|
|
|
|
them all. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
fill_fpregset (fpregsetp, regno)
|
|
|
|
|
prfpregset_t *fpregsetp;
|
|
|
|
|
int regno;
|
|
|
|
|
{
|
|
|
|
|
int regi;
|
|
|
|
|
char *to;
|
|
|
|
|
char *from;
|
|
|
|
|
extern char registers[];
|
|
|
|
|
|
|
|
|
|
for (regi = FP0_REGNUM ; regi < FP0_REGNUM+32 ; regi++)
|
|
|
|
|
{
|
|
|
|
|
if ((regno == -1) || (regno == regi))
|
|
|
|
|
{
|
|
|
|
|
from = (char *) ®isters[REGISTER_BYTE (regi)];
|
|
|
|
|
to = (char *) &fpregsetp->pr_fr.pr_regs[regi-FP0_REGNUM];
|
1992-09-26 09:04:24 +00:00
|
|
|
|
memcpy (to, from, REGISTER_RAW_SIZE (regi));
|
1992-06-19 21:09:54 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if ((regno == -1) || (regno == FPS_REGNUM))
|
|
|
|
|
{
|
|
|
|
|
fpregsetp->pr_fsr = *(int *) ®isters[REGISTER_BYTE (FPS_REGNUM)];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* defined (FP0_REGNUM) */
|
|
|
|
|
|
|
|
|
|
#endif /* USE_PROC_FS */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef GET_LONGJMP_TARGET
|
1992-03-29 23:14:34 +00:00
|
|
|
|
|
|
|
|
|
/* Figure out where the longjmp will land. We expect that we have just entered
|
|
|
|
|
longjmp and haven't yet setup the stack frame, so the args are still in the
|
|
|
|
|
output regs. %o0 (O0_REGNUM) points at the jmp_buf structure from which we
|
|
|
|
|
extract the pc (JB_PC) that we will land at. The pc is copied into ADDR.
|
|
|
|
|
This routine returns true on success */
|
|
|
|
|
|
|
|
|
|
int
|
1994-12-17 10:46:32 +00:00
|
|
|
|
get_longjmp_target (pc)
|
1992-03-29 23:14:34 +00:00
|
|
|
|
CORE_ADDR *pc;
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR jb_addr;
|
1993-07-10 01:35:53 +00:00
|
|
|
|
#define LONGJMP_TARGET_SIZE 4
|
|
|
|
|
char buf[LONGJMP_TARGET_SIZE];
|
1992-03-29 23:14:34 +00:00
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
jb_addr = read_register (O0_REGNUM);
|
1992-03-29 23:14:34 +00:00
|
|
|
|
|
1994-12-17 10:46:32 +00:00
|
|
|
|
if (target_read_memory (jb_addr + JB_PC * JB_ELEMENT_SIZE, buf,
|
|
|
|
|
LONGJMP_TARGET_SIZE))
|
1992-03-29 23:14:34 +00:00
|
|
|
|
return 0;
|
|
|
|
|
|
1993-07-10 01:35:53 +00:00
|
|
|
|
*pc = extract_address (buf, LONGJMP_TARGET_SIZE);
|
1992-03-29 23:14:34 +00:00
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
1992-06-19 21:09:54 +00:00
|
|
|
|
#endif /* GET_LONGJMP_TARGET */
|