2005-04-16 15:20:36 -07:00
|
|
|
/*
|
|
|
|
* linux/kernel/ptrace.c
|
|
|
|
*
|
|
|
|
* (C) Copyright 1999 Linus Torvalds
|
|
|
|
*
|
|
|
|
* Common interfaces for "ptrace()" which we do not want
|
|
|
|
* to continually duplicate across every architecture.
|
|
|
|
*/
|
|
|
|
|
2006-01-11 13:17:46 -07:00
|
|
|
#include <linux/capability.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/pagemap.h>
|
|
|
|
#include <linux/smp_lock.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/security.h>
|
2005-05-01 08:59:14 -07:00
|
|
|
#include <linux/signal.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ptrace a task: make the debugger its new parent and
|
|
|
|
* move it to the ptrace list.
|
|
|
|
*
|
|
|
|
* Must be called with the tasklist lock write-held.
|
|
|
|
*/
|
2006-07-03 00:25:41 -07:00
|
|
|
void __ptrace_link(struct task_struct *child, struct task_struct *new_parent)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
2006-04-02 04:43:40 -07:00
|
|
|
BUG_ON(!list_empty(&child->ptrace_list));
|
2005-04-16 15:20:36 -07:00
|
|
|
if (child->parent == new_parent)
|
|
|
|
return;
|
|
|
|
list_add(&child->ptrace_list, &child->parent->ptrace_children);
|
2006-03-28 17:11:05 -07:00
|
|
|
remove_parent(child);
|
2005-04-16 15:20:36 -07:00
|
|
|
child->parent = new_parent;
|
2006-03-28 17:11:05 -07:00
|
|
|
add_parent(child);
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Turn a tracing stop into a normal stop now, since with no tracer there
|
|
|
|
* would be no way to wake it up with SIGCONT or SIGKILL. If there was a
|
|
|
|
* signal sent that would resume the child, but didn't because it was in
|
|
|
|
* TASK_TRACED, resume it now.
|
|
|
|
* Requires that irqs be disabled.
|
|
|
|
*/
|
2006-07-03 00:25:41 -07:00
|
|
|
void ptrace_untrace(struct task_struct *child)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
|
|
|
spin_lock(&child->sighand->siglock);
|
|
|
|
if (child->state == TASK_TRACED) {
|
|
|
|
if (child->signal->flags & SIGNAL_STOP_STOPPED) {
|
|
|
|
child->state = TASK_STOPPED;
|
|
|
|
} else {
|
|
|
|
signal_wake_up(child, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
spin_unlock(&child->sighand->siglock);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* unptrace a task: move it back to its original parent and
|
|
|
|
* remove it from the ptrace list.
|
|
|
|
*
|
|
|
|
* Must be called with the tasklist lock write-held.
|
|
|
|
*/
|
2006-07-03 00:25:41 -07:00
|
|
|
void __ptrace_unlink(struct task_struct *child)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
2006-02-15 12:50:10 -07:00
|
|
|
BUG_ON(!child->ptrace);
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
child->ptrace = 0;
|
|
|
|
if (!list_empty(&child->ptrace_list)) {
|
|
|
|
list_del_init(&child->ptrace_list);
|
2006-03-28 17:11:05 -07:00
|
|
|
remove_parent(child);
|
2005-04-16 15:20:36 -07:00
|
|
|
child->parent = child->real_parent;
|
2006-03-28 17:11:05 -07:00
|
|
|
add_parent(child);
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
|
2006-04-12 16:30:20 -07:00
|
|
|
if (child->state == TASK_TRACED)
|
|
|
|
ptrace_untrace(child);
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check that we have indeed attached to the thing..
|
|
|
|
*/
|
|
|
|
int ptrace_check_attach(struct task_struct *child, int kill)
|
|
|
|
{
|
|
|
|
int ret = -ESRCH;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We take the read lock around doing both checks to close a
|
|
|
|
* possible race where someone else was tracing our child and
|
|
|
|
* detached between these two checks. After this locked check,
|
|
|
|
* we are sure that this is our traced child and that can only
|
|
|
|
* be changed by us so it's not changing right after this.
|
|
|
|
*/
|
|
|
|
read_lock(&tasklist_lock);
|
|
|
|
if ((child->ptrace & PT_PTRACED) && child->parent == current &&
|
|
|
|
(!(child->ptrace & PT_ATTACHED) || child->real_parent != current)
|
|
|
|
&& child->signal != NULL) {
|
|
|
|
ret = 0;
|
|
|
|
spin_lock_irq(&child->sighand->siglock);
|
|
|
|
if (child->state == TASK_STOPPED) {
|
|
|
|
child->state = TASK_TRACED;
|
|
|
|
} else if (child->state != TASK_TRACED && !kill) {
|
|
|
|
ret = -ESRCH;
|
|
|
|
}
|
|
|
|
spin_unlock_irq(&child->sighand->siglock);
|
|
|
|
}
|
|
|
|
read_unlock(&tasklist_lock);
|
|
|
|
|
|
|
|
if (!ret && !kill) {
|
|
|
|
wait_task_inactive(child);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* All systems go.. */
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2005-09-06 15:18:24 -07:00
|
|
|
static int may_attach(struct task_struct *task)
|
|
|
|
{
|
2006-06-26 00:25:59 -07:00
|
|
|
/* May we inspect the given task?
|
|
|
|
* This check is used both for attaching with ptrace
|
|
|
|
* and for allowing access to sensitive information in /proc.
|
|
|
|
*
|
|
|
|
* ptrace_attach denies several cases that /proc allows
|
|
|
|
* because setting up the necessary parent/child relationship
|
|
|
|
* or halting the specified task is impossible.
|
|
|
|
*/
|
|
|
|
int dumpable = 0;
|
|
|
|
/* Don't let security modules deny introspection */
|
|
|
|
if (task == current)
|
|
|
|
return 0;
|
2005-09-06 15:18:24 -07:00
|
|
|
if (((current->uid != task->euid) ||
|
|
|
|
(current->uid != task->suid) ||
|
|
|
|
(current->uid != task->uid) ||
|
|
|
|
(current->gid != task->egid) ||
|
|
|
|
(current->gid != task->sgid) ||
|
|
|
|
(current->gid != task->gid)) && !capable(CAP_SYS_PTRACE))
|
|
|
|
return -EPERM;
|
|
|
|
smp_rmb();
|
2006-06-26 00:25:59 -07:00
|
|
|
if (task->mm)
|
|
|
|
dumpable = task->mm->dumpable;
|
|
|
|
if (!dumpable && !capable(CAP_SYS_PTRACE))
|
2005-09-06 15:18:24 -07:00
|
|
|
return -EPERM;
|
|
|
|
|
|
|
|
return security_ptrace(current, task);
|
|
|
|
}
|
|
|
|
|
|
|
|
int ptrace_may_attach(struct task_struct *task)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
task_lock(task);
|
|
|
|
err = may_attach(task);
|
|
|
|
task_unlock(task);
|
|
|
|
return !err;
|
|
|
|
}
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
int ptrace_attach(struct task_struct *task)
|
|
|
|
{
|
|
|
|
int retval;
|
2006-05-07 10:49:33 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
retval = -EPERM;
|
|
|
|
if (task->pid <= 1)
|
2006-05-07 10:49:33 -07:00
|
|
|
goto out;
|
2005-11-09 12:33:07 -07:00
|
|
|
if (task->tgid == current->tgid)
|
2006-05-07 10:49:33 -07:00
|
|
|
goto out;
|
|
|
|
|
2006-05-11 11:08:49 -07:00
|
|
|
repeat:
|
|
|
|
/*
|
|
|
|
* Nasty, nasty.
|
|
|
|
*
|
|
|
|
* We want to hold both the task-lock and the
|
|
|
|
* tasklist_lock for writing at the same time.
|
|
|
|
* But that's against the rules (tasklist_lock
|
|
|
|
* is taken for reading by interrupts on other
|
|
|
|
* cpu's that may have task_lock).
|
|
|
|
*/
|
2006-05-07 10:49:33 -07:00
|
|
|
task_lock(task);
|
2006-05-11 11:08:49 -07:00
|
|
|
local_irq_disable();
|
|
|
|
if (!write_trylock(&tasklist_lock)) {
|
|
|
|
local_irq_enable();
|
|
|
|
task_unlock(task);
|
|
|
|
do {
|
|
|
|
cpu_relax();
|
|
|
|
} while (!write_can_lock(&tasklist_lock));
|
|
|
|
goto repeat;
|
|
|
|
}
|
2006-05-07 10:49:33 -07:00
|
|
|
|
2006-06-26 00:25:59 -07:00
|
|
|
if (!task->mm)
|
|
|
|
goto bad;
|
2005-04-16 15:20:36 -07:00
|
|
|
/* the same process cannot be attached many times */
|
|
|
|
if (task->ptrace & PT_PTRACED)
|
|
|
|
goto bad;
|
2005-09-06 15:18:24 -07:00
|
|
|
retval = may_attach(task);
|
2005-04-16 15:20:36 -07:00
|
|
|
if (retval)
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
/* Go */
|
|
|
|
task->ptrace |= PT_PTRACED | ((task->real_parent != current)
|
|
|
|
? PT_ATTACHED : 0);
|
|
|
|
if (capable(CAP_SYS_PTRACE))
|
|
|
|
task->ptrace |= PT_PTRACE_CAP;
|
|
|
|
|
|
|
|
__ptrace_link(task, current);
|
|
|
|
|
|
|
|
force_sig_specific(SIGSTOP, task);
|
|
|
|
|
|
|
|
bad:
|
2006-05-07 10:49:33 -07:00
|
|
|
write_unlock_irq(&tasklist_lock);
|
2005-04-16 15:20:36 -07:00
|
|
|
task_unlock(task);
|
2006-05-07 10:49:33 -07:00
|
|
|
out:
|
2005-04-16 15:20:36 -07:00
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2006-06-26 00:26:07 -07:00
|
|
|
static inline void __ptrace_detach(struct task_struct *child, unsigned int data)
|
2006-02-15 12:50:10 -07:00
|
|
|
{
|
|
|
|
child->exit_code = data;
|
|
|
|
/* .. re-parent .. */
|
|
|
|
__ptrace_unlink(child);
|
|
|
|
/* .. and wake it up. */
|
|
|
|
if (child->exit_state != EXIT_ZOMBIE)
|
|
|
|
wake_up_process(child);
|
|
|
|
}
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
int ptrace_detach(struct task_struct *child, unsigned int data)
|
|
|
|
{
|
2005-05-01 08:59:14 -07:00
|
|
|
if (!valid_signal(data))
|
2006-02-15 12:50:10 -07:00
|
|
|
return -EIO;
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
/* Architecture-specific hardware disable .. */
|
|
|
|
ptrace_disable(child);
|
|
|
|
|
|
|
|
write_lock_irq(&tasklist_lock);
|
2006-06-26 00:26:07 -07:00
|
|
|
/* protect against de_thread()->release_task() */
|
2006-02-15 12:50:10 -07:00
|
|
|
if (child->ptrace)
|
|
|
|
__ptrace_detach(child, data);
|
2005-04-16 15:20:36 -07:00
|
|
|
write_unlock_irq(&tasklist_lock);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Access another process' address space.
|
|
|
|
* Source/target buffer must be kernel space,
|
|
|
|
* Do not walk the page table directly, use get_user_pages
|
|
|
|
*/
|
|
|
|
|
|
|
|
int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
|
|
|
|
{
|
|
|
|
struct mm_struct *mm;
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
struct page *page;
|
|
|
|
void *old_buf = buf;
|
|
|
|
|
|
|
|
mm = get_task_mm(tsk);
|
|
|
|
if (!mm)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
down_read(&mm->mmap_sem);
|
|
|
|
/* ignore errors, just check how much was sucessfully transfered */
|
|
|
|
while (len) {
|
|
|
|
int bytes, ret, offset;
|
|
|
|
void *maddr;
|
|
|
|
|
|
|
|
ret = get_user_pages(tsk, mm, addr, 1,
|
|
|
|
write, 1, &page, &vma);
|
|
|
|
if (ret <= 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
bytes = len;
|
|
|
|
offset = addr & (PAGE_SIZE-1);
|
|
|
|
if (bytes > PAGE_SIZE-offset)
|
|
|
|
bytes = PAGE_SIZE-offset;
|
|
|
|
|
|
|
|
maddr = kmap(page);
|
|
|
|
if (write) {
|
|
|
|
copy_to_user_page(vma, page, addr,
|
|
|
|
maddr + offset, buf, bytes);
|
2006-02-14 14:52:59 -07:00
|
|
|
set_page_dirty_lock(page);
|
2005-04-16 15:20:36 -07:00
|
|
|
} else {
|
|
|
|
copy_from_user_page(vma, page, addr,
|
|
|
|
buf, maddr + offset, bytes);
|
|
|
|
}
|
|
|
|
kunmap(page);
|
|
|
|
page_cache_release(page);
|
|
|
|
len -= bytes;
|
|
|
|
buf += bytes;
|
|
|
|
addr += bytes;
|
|
|
|
}
|
|
|
|
up_read(&mm->mmap_sem);
|
|
|
|
mmput(mm);
|
|
|
|
|
|
|
|
return buf - old_buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ptrace_readdata(struct task_struct *tsk, unsigned long src, char __user *dst, int len)
|
|
|
|
{
|
|
|
|
int copied = 0;
|
|
|
|
|
|
|
|
while (len > 0) {
|
|
|
|
char buf[128];
|
|
|
|
int this_len, retval;
|
|
|
|
|
|
|
|
this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
|
|
|
|
retval = access_process_vm(tsk, src, buf, this_len, 0);
|
|
|
|
if (!retval) {
|
|
|
|
if (copied)
|
|
|
|
break;
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
if (copy_to_user(dst, buf, retval))
|
|
|
|
return -EFAULT;
|
|
|
|
copied += retval;
|
|
|
|
src += retval;
|
|
|
|
dst += retval;
|
|
|
|
len -= retval;
|
|
|
|
}
|
|
|
|
return copied;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ptrace_writedata(struct task_struct *tsk, char __user *src, unsigned long dst, int len)
|
|
|
|
{
|
|
|
|
int copied = 0;
|
|
|
|
|
|
|
|
while (len > 0) {
|
|
|
|
char buf[128];
|
|
|
|
int this_len, retval;
|
|
|
|
|
|
|
|
this_len = (len > sizeof(buf)) ? sizeof(buf) : len;
|
|
|
|
if (copy_from_user(buf, src, this_len))
|
|
|
|
return -EFAULT;
|
|
|
|
retval = access_process_vm(tsk, dst, buf, this_len, 1);
|
|
|
|
if (!retval) {
|
|
|
|
if (copied)
|
|
|
|
break;
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
copied += retval;
|
|
|
|
src += retval;
|
|
|
|
dst += retval;
|
|
|
|
len -= retval;
|
|
|
|
}
|
|
|
|
return copied;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ptrace_setoptions(struct task_struct *child, long data)
|
|
|
|
{
|
|
|
|
child->ptrace &= ~PT_TRACE_MASK;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACESYSGOOD)
|
|
|
|
child->ptrace |= PT_TRACESYSGOOD;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACEFORK)
|
|
|
|
child->ptrace |= PT_TRACE_FORK;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACEVFORK)
|
|
|
|
child->ptrace |= PT_TRACE_VFORK;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACECLONE)
|
|
|
|
child->ptrace |= PT_TRACE_CLONE;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACEEXEC)
|
|
|
|
child->ptrace |= PT_TRACE_EXEC;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACEVFORKDONE)
|
|
|
|
child->ptrace |= PT_TRACE_VFORK_DONE;
|
|
|
|
|
|
|
|
if (data & PTRACE_O_TRACEEXIT)
|
|
|
|
child->ptrace |= PT_TRACE_EXIT;
|
|
|
|
|
|
|
|
return (data & ~PTRACE_O_MASK) ? -EINVAL : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ptrace_getsiginfo(struct task_struct *child, siginfo_t __user * data)
|
|
|
|
{
|
|
|
|
siginfo_t lastinfo;
|
|
|
|
int error = -ESRCH;
|
|
|
|
|
|
|
|
read_lock(&tasklist_lock);
|
|
|
|
if (likely(child->sighand != NULL)) {
|
|
|
|
error = -EINVAL;
|
|
|
|
spin_lock_irq(&child->sighand->siglock);
|
|
|
|
if (likely(child->last_siginfo != NULL)) {
|
|
|
|
lastinfo = *child->last_siginfo;
|
|
|
|
error = 0;
|
|
|
|
}
|
|
|
|
spin_unlock_irq(&child->sighand->siglock);
|
|
|
|
}
|
|
|
|
read_unlock(&tasklist_lock);
|
|
|
|
if (!error)
|
|
|
|
return copy_siginfo_to_user(data, &lastinfo);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ptrace_setsiginfo(struct task_struct *child, siginfo_t __user * data)
|
|
|
|
{
|
|
|
|
siginfo_t newinfo;
|
|
|
|
int error = -ESRCH;
|
|
|
|
|
|
|
|
if (copy_from_user(&newinfo, data, sizeof (siginfo_t)))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
read_lock(&tasklist_lock);
|
|
|
|
if (likely(child->sighand != NULL)) {
|
|
|
|
error = -EINVAL;
|
|
|
|
spin_lock_irq(&child->sighand->siglock);
|
|
|
|
if (likely(child->last_siginfo != NULL)) {
|
|
|
|
*child->last_siginfo = newinfo;
|
|
|
|
error = 0;
|
|
|
|
}
|
|
|
|
spin_unlock_irq(&child->sighand->siglock);
|
|
|
|
}
|
|
|
|
read_unlock(&tasklist_lock);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ptrace_request(struct task_struct *child, long request,
|
|
|
|
long addr, long data)
|
|
|
|
{
|
|
|
|
int ret = -EIO;
|
|
|
|
|
|
|
|
switch (request) {
|
|
|
|
#ifdef PTRACE_OLDSETOPTIONS
|
|
|
|
case PTRACE_OLDSETOPTIONS:
|
|
|
|
#endif
|
|
|
|
case PTRACE_SETOPTIONS:
|
|
|
|
ret = ptrace_setoptions(child, data);
|
|
|
|
break;
|
|
|
|
case PTRACE_GETEVENTMSG:
|
|
|
|
ret = put_user(child->ptrace_message, (unsigned long __user *) data);
|
|
|
|
break;
|
|
|
|
case PTRACE_GETSIGINFO:
|
|
|
|
ret = ptrace_getsiginfo(child, (siginfo_t __user *) data);
|
|
|
|
break;
|
|
|
|
case PTRACE_SETSIGINFO:
|
|
|
|
ret = ptrace_setsiginfo(child, (siginfo_t __user *) data);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2005-11-07 01:59:47 -07:00
|
|
|
|
2006-01-08 02:02:33 -07:00
|
|
|
/**
|
|
|
|
* ptrace_traceme -- helper for PTRACE_TRACEME
|
|
|
|
*
|
|
|
|
* Performs checks and sets PT_PTRACED.
|
|
|
|
* Should be used by all ptrace implementations for PTRACE_TRACEME.
|
|
|
|
*/
|
|
|
|
int ptrace_traceme(void)
|
2005-11-07 01:59:47 -07:00
|
|
|
{
|
2006-05-07 10:49:33 -07:00
|
|
|
int ret = -EPERM;
|
2005-11-07 01:59:47 -07:00
|
|
|
|
|
|
|
/*
|
2006-01-08 02:02:33 -07:00
|
|
|
* Are we already being traced?
|
|
|
|
*/
|
2006-05-07 10:49:33 -07:00
|
|
|
task_lock(current);
|
|
|
|
if (!(current->ptrace & PT_PTRACED)) {
|
|
|
|
ret = security_ptrace(current->parent, current);
|
|
|
|
/*
|
|
|
|
* Set the ptrace bit in the process ptrace flags.
|
|
|
|
*/
|
|
|
|
if (!ret)
|
|
|
|
current->ptrace |= PT_PTRACED;
|
|
|
|
}
|
|
|
|
task_unlock(current);
|
|
|
|
return ret;
|
2006-01-08 02:02:33 -07:00
|
|
|
}
|
2005-11-07 01:59:47 -07:00
|
|
|
|
2006-01-08 02:02:33 -07:00
|
|
|
/**
|
|
|
|
* ptrace_get_task_struct -- grab a task struct reference for ptrace
|
|
|
|
* @pid: process id to grab a task_struct reference of
|
|
|
|
*
|
|
|
|
* This function is a helper for ptrace implementations. It checks
|
|
|
|
* permissions and then grabs a task struct for use of the actual
|
|
|
|
* ptrace implementation.
|
|
|
|
*
|
|
|
|
* Returns the task_struct for @pid or an ERR_PTR() on failure.
|
|
|
|
*/
|
|
|
|
struct task_struct *ptrace_get_task_struct(pid_t pid)
|
|
|
|
{
|
|
|
|
struct task_struct *child;
|
2005-11-07 01:59:47 -07:00
|
|
|
|
|
|
|
/*
|
2006-01-08 02:02:33 -07:00
|
|
|
* Tracing init is not allowed.
|
2005-11-07 01:59:47 -07:00
|
|
|
*/
|
|
|
|
if (pid == 1)
|
2006-01-08 02:02:33 -07:00
|
|
|
return ERR_PTR(-EPERM);
|
2005-11-07 01:59:47 -07:00
|
|
|
|
|
|
|
read_lock(&tasklist_lock);
|
|
|
|
child = find_task_by_pid(pid);
|
|
|
|
if (child)
|
|
|
|
get_task_struct(child);
|
|
|
|
read_unlock(&tasklist_lock);
|
|
|
|
if (!child)
|
2006-01-08 02:02:33 -07:00
|
|
|
return ERR_PTR(-ESRCH);
|
|
|
|
return child;
|
2005-11-07 01:59:47 -07:00
|
|
|
}
|
|
|
|
|
2006-01-08 02:02:33 -07:00
|
|
|
#ifndef __ARCH_SYS_PTRACE
|
2005-11-07 01:59:47 -07:00
|
|
|
asmlinkage long sys_ptrace(long request, long pid, long addr, long data)
|
|
|
|
{
|
|
|
|
struct task_struct *child;
|
|
|
|
long ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This lock_kernel fixes a subtle race with suid exec
|
|
|
|
*/
|
|
|
|
lock_kernel();
|
2006-01-08 02:02:33 -07:00
|
|
|
if (request == PTRACE_TRACEME) {
|
|
|
|
ret = ptrace_traceme();
|
2005-11-07 01:59:47 -07:00
|
|
|
goto out;
|
2006-01-08 02:02:33 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
child = ptrace_get_task_struct(pid);
|
|
|
|
if (IS_ERR(child)) {
|
|
|
|
ret = PTR_ERR(child);
|
|
|
|
goto out;
|
|
|
|
}
|
2005-11-07 01:59:47 -07:00
|
|
|
|
|
|
|
if (request == PTRACE_ATTACH) {
|
|
|
|
ret = ptrace_attach(child);
|
2005-11-13 17:06:33 -07:00
|
|
|
goto out_put_task_struct;
|
2005-11-07 01:59:47 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = ptrace_check_attach(child, request == PTRACE_KILL);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_put_task_struct;
|
|
|
|
|
|
|
|
ret = arch_ptrace(child, request, addr, data);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_put_task_struct;
|
|
|
|
|
|
|
|
out_put_task_struct:
|
|
|
|
put_task_struct(child);
|
|
|
|
out:
|
|
|
|
unlock_kernel();
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* __ARCH_SYS_PTRACE */
|