2002-02-16 05:38:07 +00:00
|
|
|
/*-
|
1994-05-24 10:09:53 +00:00
|
|
|
* Copyright (c) 1993 Jan-Simon Pendry
|
|
|
|
* Copyright (c) 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Jan-Simon Pendry.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
1997-02-10 02:22:35 +00:00
|
|
|
* @(#)procfs_fpregs.c 8.2 (Berkeley) 6/15/94
|
1994-05-24 10:09:53 +00:00
|
|
|
*
|
1997-02-10 02:22:35 +00:00
|
|
|
* From:
|
2002-02-16 05:38:07 +00:00
|
|
|
* $Id: procfs_regs.c,v 3.2 1993/12/15 09:40:17 jsp Exp $
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/lock.h>
|
|
|
|
#include <sys/mutex.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/proc.h>
|
Dissociate ptrace from procfs.
Until now, the ptrace syscall was implemented as a wrapper that called
various functions in procfs depending on which ptrace operation was
requested. Most of these functions were themselves wrappers around
procfs_{read,write}_{,db,fp}regs(), with only some extra error checks,
which weren't necessary in the ptrace case anyway.
This commit moves procfs_rwmem() from procfs_mem.c into sys_process.c
(renaming it to proc_rwmem() in the process), and implements ptrace()
directly in terms of procfs_{read,write}_{,db,fp}regs() instead of
having it fake up a struct uio and then call procfs_do{,db,fp}regs().
It also moves the prototypes for procfs_{read,write}_{,db,fp}regs()
and proc_rwmem() from proc.h to ptrace.h, and marks all procfs files
except procfs_machdep.c as "optional procfs" instead of "standard".
2001-10-07 20:08:42 +00:00
|
|
|
#include <sys/ptrace.h>
|
2001-12-04 01:35:06 +00:00
|
|
|
#include <sys/uio.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <machine/reg.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
|
2001-12-04 01:35:06 +00:00
|
|
|
#include <fs/pseudofs/pseudofs.h>
|
2001-05-23 09:42:29 +00:00
|
|
|
#include <fs/procfs/procfs.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
int
|
2001-12-04 01:35:06 +00:00
|
|
|
procfs_doprocfpregs(PFS_FILL_ARGS)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
int error;
|
|
|
|
struct fpreg r;
|
|
|
|
|
2002-04-13 23:14:08 +00:00
|
|
|
PROC_LOCK(p);
|
2004-10-01 05:01:17 +00:00
|
|
|
KASSERT(p->p_lock > 0, ("proc not held"));
|
2002-05-19 00:14:50 +00:00
|
|
|
if (p_candebug(td, p)) {
|
2002-04-13 23:14:08 +00:00
|
|
|
PROC_UNLOCK(p);
|
2002-02-16 05:38:07 +00:00
|
|
|
return (EPERM);
|
2002-04-13 23:14:08 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-10-02 15:00:55 +00:00
|
|
|
/* XXXKSE: */
|
|
|
|
error = proc_read_fpregs(FIRST_THREAD_IN_PROC(p), &r);
|
2003-05-05 15:12:51 +00:00
|
|
|
if (error == 0) {
|
|
|
|
PROC_UNLOCK(p);
|
2003-10-02 15:00:55 +00:00
|
|
|
error = uiomove_frombuf(&r, sizeof(r), uio);
|
2003-05-05 15:12:51 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
if (error == 0 && uio->uio_rw == UIO_WRITE) {
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
if (!P_SHOULDSTOP(p))
|
1994-05-24 10:09:53 +00:00
|
|
|
error = EBUSY;
|
|
|
|
else
|
2002-02-16 05:38:07 +00:00
|
|
|
/* XXXKSE: */
|
2002-02-07 20:58:47 +00:00
|
|
|
error = proc_write_fpregs(FIRST_THREAD_IN_PROC(p), &r);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2002-04-13 23:14:08 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
uio->uio_offset = 0;
|
|
|
|
return (error);
|
|
|
|
}
|