mirror of
https://github.com/darlinghq/darling-gdb.git
synced 2024-12-14 15:50:34 +00:00
a6e0dae9c3
m3-nat.c, i386m3-nat.c, mipsm3-nat.c, ns32km3-nat.c: bcopy -> memcpy.
306 lines
7.9 KiB
C
306 lines
7.9 KiB
C
/* Low level interface to ptrace, for the remote server for GDB.
|
||
Copyright (C) 1986, 1987, 1993 Free Software Foundation, Inc.
|
||
|
||
This file is part of GDB.
|
||
|
||
This program 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 of the License, or
|
||
(at your option) any later version.
|
||
|
||
This program 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 this program; if not, write to the Free Software
|
||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
||
|
||
#include "defs.h"
|
||
#include "/usr/include/sys/wait.h"
|
||
#include "frame.h"
|
||
#include "inferior.h"
|
||
|
||
#include <stdio.h>
|
||
#include <sys/param.h>
|
||
#include <sys/dir.h>
|
||
#include <sys/user.h>
|
||
#include <signal.h>
|
||
#include <sys/ioctl.h>
|
||
#include <sgtty.h>
|
||
#include <fcntl.h>
|
||
|
||
/***************Begin MY defs*********************/
|
||
int quit_flag = 0;
|
||
char registers[REGISTER_BYTES];
|
||
|
||
/* Index within `registers' of the first byte of the space for
|
||
register N. */
|
||
|
||
|
||
char buf2[MAX_REGISTER_RAW_SIZE];
|
||
/***************End MY defs*********************/
|
||
|
||
#include <sys/ptrace.h>
|
||
#include <machine/reg.h>
|
||
|
||
extern int sys_nerr;
|
||
extern char **sys_errlist;
|
||
extern char **environ;
|
||
extern int errno;
|
||
extern int inferior_pid;
|
||
void error (), quit (), perror_with_name ();
|
||
int query ();
|
||
|
||
/* Start an inferior process and returns its pid.
|
||
ALLARGS is a vector of program-name and args.
|
||
ENV is the environment vector to pass. */
|
||
|
||
int
|
||
create_inferior (program, allargs)
|
||
char *program;
|
||
char **allargs;
|
||
{
|
||
int pid;
|
||
|
||
pid = fork ();
|
||
if (pid < 0)
|
||
perror_with_name ("fork");
|
||
|
||
if (pid == 0)
|
||
{
|
||
ptrace (PTRACE_TRACEME);
|
||
|
||
execv (program, allargs);
|
||
|
||
fprintf (stderr, "Cannot exec %s: %s.\n", program,
|
||
errno < sys_nerr ? sys_errlist[errno] : "unknown error");
|
||
fflush (stderr);
|
||
_exit (0177);
|
||
}
|
||
|
||
return pid;
|
||
}
|
||
|
||
/* Kill the inferior process. Make us have no inferior. */
|
||
|
||
void
|
||
kill_inferior ()
|
||
{
|
||
if (inferior_pid == 0)
|
||
return;
|
||
ptrace (8, inferior_pid, 0, 0);
|
||
wait (0);
|
||
/*************inferior_died ();****VK**************/
|
||
}
|
||
|
||
/* Wait for process, returns status */
|
||
|
||
unsigned char
|
||
mywait (status)
|
||
char *status;
|
||
{
|
||
int pid;
|
||
union wait w;
|
||
|
||
pid = wait (&w);
|
||
if (pid != inferior_pid)
|
||
perror_with_name ("wait");
|
||
|
||
if (WIFEXITED (w))
|
||
{
|
||
fprintf (stderr, "\nChild exited with retcode = %x \n", WEXITSTATUS (w));
|
||
*status = 'E';
|
||
return ((unsigned char) WEXITSTATUS (w));
|
||
}
|
||
else if (!WIFSTOPPED (w))
|
||
{
|
||
fprintf (stderr, "\nChild terminated with signal = %x \n", WTERMSIG (w));
|
||
*status = 'T';
|
||
return ((unsigned char) WTERMSIG (w));
|
||
}
|
||
|
||
fetch_inferior_registers (0);
|
||
|
||
*status = 'S';
|
||
return ((unsigned char) WSTOPSIG (w));
|
||
}
|
||
|
||
/* Resume execution of the inferior process.
|
||
If STEP is nonzero, single-step it.
|
||
If SIGNAL is nonzero, give it that signal. */
|
||
|
||
void
|
||
myresume (step, signal)
|
||
int step;
|
||
int signal;
|
||
{
|
||
errno = 0;
|
||
ptrace (step ? PTRACE_SINGLESTEP : PTRACE_CONT, inferior_pid, 1, signal);
|
||
if (errno)
|
||
perror_with_name ("ptrace");
|
||
}
|
||
|
||
/* Fetch one or more registers from the inferior. REGNO == -1 to get
|
||
them all. We actually fetch more than requested, when convenient,
|
||
marking them as valid so we won't fetch them again. */
|
||
|
||
void
|
||
fetch_inferior_registers (ignored)
|
||
int ignored;
|
||
{
|
||
struct regs inferior_registers;
|
||
struct fp_status inferior_fp_registers;
|
||
|
||
ptrace (PTRACE_GETREGS, inferior_pid,
|
||
(PTRACE_ARG3_TYPE) &inferior_registers);
|
||
#ifdef FP0_REGNUM
|
||
ptrace (PTRACE_GETFPREGS, inferior_pid,
|
||
(PTRACE_ARG3_TYPE) &inferior_fp_registers);
|
||
#endif
|
||
|
||
memcpy (registers, &inferior_registers, 16 * 4);
|
||
#ifdef FP0_REGNUM
|
||
memcpy (®isters[REGISTER_BYTE (FP0_REGNUM)], &inferior_fp_registers,
|
||
sizeof inferior_fp_registers.fps_regs);
|
||
#endif
|
||
*(int *)®isters[REGISTER_BYTE (PS_REGNUM)] = inferior_registers.r_ps;
|
||
*(int *)®isters[REGISTER_BYTE (PC_REGNUM)] = inferior_registers.r_pc;
|
||
#ifdef FP0_REGNUM
|
||
memcpy
|
||
(®isters[REGISTER_BYTE (FPC_REGNUM)],
|
||
&inferior_fp_registers.fps_control,
|
||
sizeof inferior_fp_registers - sizeof inferior_fp_registers.fps_regs);
|
||
#endif
|
||
}
|
||
|
||
/* Store our register values back into the inferior.
|
||
If REGNO is -1, do this for all registers.
|
||
Otherwise, REGNO specifies which register (so we can save time). */
|
||
|
||
void
|
||
store_inferior_registers (ignored)
|
||
int ignored;
|
||
{
|
||
struct regs inferior_registers;
|
||
struct fp_status inferior_fp_registers;
|
||
|
||
memcpy (&inferior_registers, registers, 16 * 4);
|
||
#ifdef FP0_REGNUM
|
||
memcpy (&inferior_fp_registers,
|
||
®isters[REGISTER_BYTE (FP0_REGNUM)],
|
||
sizeof inferior_fp_registers.fps_regs);
|
||
#endif
|
||
inferior_registers.r_ps = *(int *)®isters[REGISTER_BYTE (PS_REGNUM)];
|
||
inferior_registers.r_pc = *(int *)®isters[REGISTER_BYTE (PC_REGNUM)];
|
||
|
||
#ifdef FP0_REGNUM
|
||
memcpy (&inferior_fp_registers.fps_control,
|
||
®isters[REGISTER_BYTE (FPC_REGNUM)],
|
||
(sizeof inferior_fp_registers
|
||
- sizeof inferior_fp_registers.fps_regs));
|
||
#endif
|
||
|
||
ptrace (PTRACE_SETREGS, inferior_pid,
|
||
(PTRACE_ARG3_TYPE) &inferior_registers);
|
||
#if FP0_REGNUM
|
||
ptrace (PTRACE_SETFPREGS, inferior_pid,
|
||
(PTRACE_ARG3_TYPE) &inferior_fp_registers);
|
||
#endif
|
||
}
|
||
|
||
/* NOTE! I tried using PTRACE_READDATA, etc., to read and write memory
|
||
in the NEW_SUN_PTRACE case.
|
||
It ought to be straightforward. But it appears that writing did
|
||
not write the data that I specified. I cannot understand where
|
||
it got the data that it actually did write. */
|
||
|
||
/* Copy LEN bytes from inferior's memory starting at MEMADDR
|
||
to debugger memory starting at MYADDR. */
|
||
|
||
read_inferior_memory (memaddr, myaddr, len)
|
||
CORE_ADDR memaddr;
|
||
char *myaddr;
|
||
int len;
|
||
{
|
||
register int i;
|
||
/* Round starting address down to longword boundary. */
|
||
register CORE_ADDR addr = memaddr & -sizeof (int);
|
||
/* Round ending address up; get number of longwords that makes. */
|
||
register int count
|
||
= (((memaddr + len) - addr) + sizeof (int) - 1) / sizeof (int);
|
||
/* Allocate buffer of that many longwords. */
|
||
register int *buffer = (int *) alloca (count * sizeof (int));
|
||
|
||
/* Read all the longwords */
|
||
for (i = 0; i < count; i++, addr += sizeof (int))
|
||
{
|
||
buffer[i] = ptrace (1, inferior_pid, addr, 0);
|
||
}
|
||
|
||
/* Copy appropriate bytes out of the buffer. */
|
||
memcpy (myaddr, (char *) buffer + (memaddr & (sizeof (int) - 1)), len);
|
||
}
|
||
|
||
/* Copy LEN bytes of data from debugger memory at MYADDR
|
||
to inferior's memory at MEMADDR.
|
||
On failure (cannot write the inferior)
|
||
returns the value of errno. */
|
||
|
||
int
|
||
write_inferior_memory (memaddr, myaddr, len)
|
||
CORE_ADDR memaddr;
|
||
char *myaddr;
|
||
int len;
|
||
{
|
||
register int i;
|
||
/* Round starting address down to longword boundary. */
|
||
register CORE_ADDR addr = memaddr & -sizeof (int);
|
||
/* Round ending address up; get number of longwords that makes. */
|
||
register int count
|
||
= (((memaddr + len) - addr) + sizeof (int) - 1) / sizeof (int);
|
||
/* Allocate buffer of that many longwords. */
|
||
register int *buffer = (int *) alloca (count * sizeof (int));
|
||
extern int errno;
|
||
|
||
/* Fill start and end extra bytes of buffer with existing memory data. */
|
||
|
||
buffer[0] = ptrace (1, inferior_pid, addr, 0);
|
||
|
||
if (count > 1)
|
||
{
|
||
buffer[count - 1]
|
||
= ptrace (1, inferior_pid,
|
||
addr + (count - 1) * sizeof (int), 0);
|
||
}
|
||
|
||
/* Copy data to be written over corresponding part of buffer */
|
||
|
||
memcpy ((char *) buffer + (memaddr & (sizeof (int) - 1)), myaddr, len);
|
||
|
||
/* Write the entire buffer. */
|
||
|
||
for (i = 0; i < count; i++, addr += sizeof (int))
|
||
{
|
||
errno = 0;
|
||
ptrace (4, inferior_pid, addr, buffer[i]);
|
||
if (errno)
|
||
return errno;
|
||
}
|
||
|
||
return 0;
|
||
}
|
||
|
||
void
|
||
initialize ()
|
||
{
|
||
inferior_pid = 0;
|
||
}
|
||
|
||
int
|
||
have_inferior_p ()
|
||
{
|
||
return inferior_pid != 0;
|
||
}
|