2005-04-17 05:20:36 +07:00
|
|
|
/*
|
2008-09-12 17:52:36 +07:00
|
|
|
* SuperH process tracing
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
2008-09-12 17:52:36 +07:00
|
|
|
* Copyright (C) 1999, 2000 Kaz Kojima & Niibe Yutaka
|
|
|
|
* Copyright (C) 2002 - 2008 Paul Mundt
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
2008-09-12 17:52:36 +07:00
|
|
|
* Audit support by Yuichi Nakamura <ynakam@hitachisoft.jp>
|
|
|
|
*
|
|
|
|
* This file is subject to the terms and conditions of the GNU General Public
|
|
|
|
* License. See the file "COPYING" in the main directory of this archive
|
|
|
|
* for more details.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/user.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/security.h>
|
2005-05-01 22:59:14 +07:00
|
|
|
#include <linux/signal.h>
|
2007-02-23 11:22:17 +07:00
|
|
|
#include <linux/io.h>
|
2007-11-10 17:21:34 +07:00
|
|
|
#include <linux/audit.h>
|
2008-07-30 13:30:52 +07:00
|
|
|
#include <linux/seccomp.h>
|
2008-07-30 17:55:30 +07:00
|
|
|
#include <linux/tracehook.h>
|
2008-09-12 17:52:36 +07:00
|
|
|
#include <linux/elf.h>
|
|
|
|
#include <linux/regset.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/mmu_context.h>
|
2008-09-04 16:53:58 +07:00
|
|
|
#include <asm/syscalls.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine will get a word off of the process kernel stack.
|
|
|
|
*/
|
|
|
|
static inline int get_stack_long(struct task_struct *task, int offset)
|
|
|
|
{
|
|
|
|
unsigned char *stack;
|
|
|
|
|
2006-01-12 16:05:44 +07:00
|
|
|
stack = (unsigned char *)task_pt_regs(task);
|
2005-04-17 05:20:36 +07:00
|
|
|
stack += offset;
|
|
|
|
return (*((int *)stack));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine will put a word on the process kernel stack.
|
|
|
|
*/
|
|
|
|
static inline int put_stack_long(struct task_struct *task, int offset,
|
|
|
|
unsigned long data)
|
|
|
|
{
|
|
|
|
unsigned char *stack;
|
|
|
|
|
2006-01-12 16:05:44 +07:00
|
|
|
stack = (unsigned char *)task_pt_regs(task);
|
2005-04-17 05:20:36 +07:00
|
|
|
stack += offset;
|
|
|
|
*(unsigned long *) stack = data;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-07-30 17:09:31 +07:00
|
|
|
void user_enable_single_step(struct task_struct *child)
|
|
|
|
{
|
|
|
|
/* Next scheduling will set up UBC */
|
|
|
|
if (child->thread.ubc_pc == 0)
|
|
|
|
ubc_usercnt += 1;
|
|
|
|
|
2008-09-12 17:52:36 +07:00
|
|
|
child->thread.ubc_pc = get_stack_long(child,
|
|
|
|
offsetof(struct pt_regs, pc));
|
2008-07-30 17:09:31 +07:00
|
|
|
|
|
|
|
set_tsk_thread_flag(child, TIF_SINGLESTEP);
|
|
|
|
}
|
|
|
|
|
|
|
|
void user_disable_single_step(struct task_struct *child)
|
2007-02-23 11:22:17 +07:00
|
|
|
{
|
|
|
|
clear_tsk_thread_flag(child, TIF_SINGLESTEP);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ensure the UBC is not programmed at the next context switch.
|
|
|
|
*
|
|
|
|
* Normally this is not needed but there are sequences such as
|
|
|
|
* singlestep, signal delivery, and continue that leave the
|
|
|
|
* ubc_pc non-zero leading to spurious SIGTRAPs.
|
|
|
|
*/
|
|
|
|
if (child->thread.ubc_pc != 0) {
|
|
|
|
ubc_usercnt -= 1;
|
|
|
|
child->thread.ubc_pc = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Called by kernel/ptrace.c when detaching..
|
|
|
|
*
|
|
|
|
* Make sure single step bits etc are not set.
|
|
|
|
*/
|
|
|
|
void ptrace_disable(struct task_struct *child)
|
|
|
|
{
|
2008-07-30 17:09:31 +07:00
|
|
|
user_disable_single_step(child);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2008-09-12 17:52:36 +07:00
|
|
|
static int genregs_get(struct task_struct *target,
|
|
|
|
const struct user_regset *regset,
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
void *kbuf, void __user *ubuf)
|
|
|
|
{
|
|
|
|
const struct pt_regs *regs = task_pt_regs(target);
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = user_regset_copyout(&pos, &count, &kbuf, &ubuf,
|
|
|
|
regs->regs,
|
|
|
|
0, 16 * sizeof(unsigned long));
|
|
|
|
if (!ret)
|
|
|
|
/* PC, PR, SR, GBR, MACH, MACL, TRA */
|
|
|
|
ret = user_regset_copyout(&pos, &count, &kbuf, &ubuf,
|
|
|
|
®s->pc,
|
|
|
|
offsetof(struct pt_regs, pc),
|
|
|
|
sizeof(struct pt_regs));
|
|
|
|
if (!ret)
|
|
|
|
ret = user_regset_copyout_zero(&pos, &count, &kbuf, &ubuf,
|
|
|
|
sizeof(struct pt_regs), -1);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int genregs_set(struct task_struct *target,
|
|
|
|
const struct user_regset *regset,
|
|
|
|
unsigned int pos, unsigned int count,
|
|
|
|
const void *kbuf, const void __user *ubuf)
|
|
|
|
{
|
|
|
|
struct pt_regs *regs = task_pt_regs(target);
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
|
|
|
regs->regs,
|
|
|
|
0, 16 * sizeof(unsigned long));
|
|
|
|
if (!ret && count > 0)
|
|
|
|
ret = user_regset_copyin(&pos, &count, &kbuf, &ubuf,
|
|
|
|
®s->pc,
|
|
|
|
offsetof(struct pt_regs, pc),
|
|
|
|
sizeof(struct pt_regs));
|
|
|
|
if (!ret)
|
|
|
|
ret = user_regset_copyin_ignore(&pos, &count, &kbuf, &ubuf,
|
|
|
|
sizeof(struct pt_regs), -1);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These are our native regset flavours.
|
|
|
|
*/
|
|
|
|
enum sh_regset {
|
|
|
|
REGSET_GENERAL,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct user_regset sh_regsets[] = {
|
|
|
|
/*
|
|
|
|
* Format is:
|
|
|
|
* R0 --> R15
|
|
|
|
* PC, PR, SR, GBR, MACH, MACL, TRA
|
|
|
|
*/
|
|
|
|
[REGSET_GENERAL] = {
|
|
|
|
.core_note_type = NT_PRSTATUS,
|
|
|
|
.n = ELF_NGREG,
|
|
|
|
.size = sizeof(long),
|
|
|
|
.align = sizeof(long),
|
|
|
|
.get = genregs_get,
|
|
|
|
.set = genregs_set,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct user_regset_view user_sh_native_view = {
|
|
|
|
.name = "sh",
|
|
|
|
.e_machine = EM_SH,
|
|
|
|
.regsets = sh_regsets,
|
|
|
|
.n = ARRAY_SIZE(sh_regsets),
|
|
|
|
};
|
|
|
|
|
2005-11-07 15:59:47 +07:00
|
|
|
long arch_ptrace(struct task_struct *child, long request, long addr, long data)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct user * dummy = NULL;
|
2008-09-04 16:53:58 +07:00
|
|
|
unsigned long __user *datap = (unsigned long __user *)data;
|
2005-04-17 05:20:36 +07:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
switch (request) {
|
|
|
|
/* read the word at location addr in the USER area. */
|
|
|
|
case PTRACE_PEEKUSR: {
|
|
|
|
unsigned long tmp;
|
|
|
|
|
|
|
|
ret = -EIO;
|
2007-02-23 11:22:17 +07:00
|
|
|
if ((addr & 3) || addr < 0 ||
|
2005-04-17 05:20:36 +07:00
|
|
|
addr > sizeof(struct user) - 3)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (addr < sizeof(struct pt_regs))
|
|
|
|
tmp = get_stack_long(child, addr);
|
|
|
|
else if (addr >= (long) &dummy->fpu &&
|
|
|
|
addr < (long) &dummy->u_fpvalid) {
|
|
|
|
if (!tsk_used_math(child)) {
|
|
|
|
if (addr == (long)&dummy->fpu.fpscr)
|
|
|
|
tmp = FPSCR_INIT;
|
|
|
|
else
|
|
|
|
tmp = 0;
|
|
|
|
} else
|
|
|
|
tmp = ((long *)&child->thread.fpu)
|
|
|
|
[(addr - (long)&dummy->fpu) >> 2];
|
|
|
|
} else if (addr == (long) &dummy->u_fpvalid)
|
|
|
|
tmp = !!tsk_used_math(child);
|
|
|
|
else
|
|
|
|
tmp = 0;
|
2008-09-04 16:53:58 +07:00
|
|
|
ret = put_user(tmp, datap);
|
2005-04-17 05:20:36 +07:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case PTRACE_POKEUSR: /* write the word at location addr in the USER area */
|
|
|
|
ret = -EIO;
|
2007-02-23 11:22:17 +07:00
|
|
|
if ((addr & 3) || addr < 0 ||
|
2005-04-17 05:20:36 +07:00
|
|
|
addr > sizeof(struct user) - 3)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (addr < sizeof(struct pt_regs))
|
|
|
|
ret = put_stack_long(child, addr, data);
|
|
|
|
else if (addr >= (long) &dummy->fpu &&
|
|
|
|
addr < (long) &dummy->u_fpvalid) {
|
|
|
|
set_stopped_child_used_math(child);
|
|
|
|
((long *)&child->thread.fpu)
|
|
|
|
[(addr - (long)&dummy->fpu) >> 2] = data;
|
|
|
|
ret = 0;
|
|
|
|
} else if (addr == (long) &dummy->u_fpvalid) {
|
|
|
|
conditional_stopped_child_used_math(data, child);
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2008-09-12 17:52:36 +07:00
|
|
|
case PTRACE_GETREGS:
|
|
|
|
return copy_regset_to_user(child, &user_sh_native_view,
|
|
|
|
REGSET_GENERAL,
|
|
|
|
0, sizeof(struct pt_regs),
|
|
|
|
(void __user *)data);
|
|
|
|
case PTRACE_SETREGS:
|
|
|
|
return copy_regset_from_user(child, &user_sh_native_view,
|
|
|
|
REGSET_GENERAL,
|
|
|
|
0, sizeof(struct pt_regs),
|
|
|
|
(const void __user *)data);
|
2005-04-17 05:20:36 +07:00
|
|
|
#ifdef CONFIG_SH_DSP
|
|
|
|
case PTRACE_GETDSPREGS: {
|
|
|
|
unsigned long dp;
|
|
|
|
|
|
|
|
ret = -EIO;
|
|
|
|
dp = ((unsigned long) child) + THREAD_SIZE -
|
|
|
|
sizeof(struct pt_dspregs);
|
|
|
|
if (*((int *) (dp - 4)) == SR_FD) {
|
2008-02-08 15:26:54 +07:00
|
|
|
copy_to_user((void *)addr, (void *) dp,
|
2005-04-17 05:20:36 +07:00
|
|
|
sizeof(struct pt_dspregs));
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case PTRACE_SETDSPREGS: {
|
|
|
|
unsigned long dp;
|
|
|
|
|
|
|
|
ret = -EIO;
|
|
|
|
dp = ((unsigned long) child) + THREAD_SIZE -
|
|
|
|
sizeof(struct pt_dspregs);
|
|
|
|
if (*((int *) (dp - 4)) == SR_FD) {
|
2008-02-08 15:26:54 +07:00
|
|
|
copy_from_user((void *) dp, (void *)addr,
|
2005-04-17 05:20:36 +07:00
|
|
|
sizeof(struct pt_dspregs));
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2008-05-19 11:40:12 +07:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_BINFMT_ELF_FDPIC
|
|
|
|
case PTRACE_GETFDPIC: {
|
|
|
|
unsigned long tmp = 0;
|
|
|
|
|
|
|
|
switch (addr) {
|
|
|
|
case PTRACE_GETFDPIC_EXEC:
|
|
|
|
tmp = child->mm->context.exec_fdpic_loadmap;
|
|
|
|
break;
|
|
|
|
case PTRACE_GETFDPIC_INTERP:
|
|
|
|
tmp = child->mm->context.interp_fdpic_loadmap;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = 0;
|
2008-09-04 16:53:58 +07:00
|
|
|
if (put_user(tmp, datap)) {
|
2008-05-19 11:40:12 +07:00
|
|
|
ret = -EFAULT;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
ret = ptrace_request(child, request, addr, data);
|
|
|
|
break;
|
|
|
|
}
|
2005-11-07 15:59:47 +07:00
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-07-30 18:05:35 +07:00
|
|
|
static inline int audit_arch(void)
|
|
|
|
{
|
|
|
|
int arch = EM_SH;
|
|
|
|
|
|
|
|
#ifdef CONFIG_CPU_LITTLE_ENDIAN
|
|
|
|
arch |= __AUDIT_ARCH_LE;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return arch;
|
|
|
|
}
|
|
|
|
|
2008-07-30 17:55:30 +07:00
|
|
|
asmlinkage long do_syscall_trace_enter(struct pt_regs *regs)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2008-07-30 17:55:30 +07:00
|
|
|
long ret = 0;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-07-30 13:30:52 +07:00
|
|
|
secure_computing(regs->regs[0]);
|
|
|
|
|
2008-07-30 17:55:30 +07:00
|
|
|
if (test_thread_flag(TIF_SYSCALL_TRACE) &&
|
|
|
|
tracehook_report_syscall_entry(regs))
|
|
|
|
/*
|
|
|
|
* Tracing decided this syscall should not happen.
|
|
|
|
* We'll return a bogus call number to get an ENOSYS
|
|
|
|
* error, but leave the original number in regs->regs[0].
|
|
|
|
*/
|
|
|
|
ret = -1L;
|
2007-11-10 17:21:34 +07:00
|
|
|
|
2008-07-30 17:55:30 +07:00
|
|
|
if (unlikely(current->audit_context))
|
2008-07-30 18:05:35 +07:00
|
|
|
audit_syscall_entry(audit_arch(), regs->regs[3],
|
2007-11-10 17:21:34 +07:00
|
|
|
regs->regs[4], regs->regs[5],
|
|
|
|
regs->regs[6], regs->regs[7]);
|
|
|
|
|
2008-07-30 17:55:30 +07:00
|
|
|
return ret ?: regs->regs[0];
|
|
|
|
}
|
|
|
|
|
|
|
|
asmlinkage void do_syscall_trace_leave(struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
int step;
|
|
|
|
|
|
|
|
if (unlikely(current->audit_context))
|
|
|
|
audit_syscall_exit(AUDITSC_RESULT(regs->regs[0]),
|
|
|
|
regs->regs[0]);
|
|
|
|
|
|
|
|
step = test_thread_flag(TIF_SINGLESTEP);
|
|
|
|
if (step || test_thread_flag(TIF_SYSCALL_TRACE))
|
|
|
|
tracehook_report_syscall_exit(regs, step);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|