2006-07-03 11:24:40 +04:00
|
|
|
/*
|
|
|
|
* Stack trace management functions
|
|
|
|
*
|
2009-01-31 04:03:42 +03:00
|
|
|
* Copyright (C) 2006-2009 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
|
2006-07-03 11:24:40 +04:00
|
|
|
*/
|
|
|
|
#include <linux/sched.h>
|
2017-02-08 20:51:35 +03:00
|
|
|
#include <linux/sched/debug.h>
|
2017-02-08 20:51:37 +03:00
|
|
|
#include <linux/sched/task_stack.h>
|
2006-07-03 11:24:40 +04:00
|
|
|
#include <linux/stacktrace.h>
|
2016-07-14 03:18:56 +03:00
|
|
|
#include <linux/export.h>
|
2008-11-22 14:28:47 +03:00
|
|
|
#include <linux/uaccess.h>
|
2006-09-26 12:52:34 +04:00
|
|
|
#include <asm/stacktrace.h>
|
2016-09-16 22:18:14 +03:00
|
|
|
#include <asm/unwind.h>
|
2006-07-03 11:24:40 +04:00
|
|
|
|
2016-09-16 22:18:14 +03:00
|
|
|
static int save_stack_address(struct stack_trace *trace, unsigned long addr,
|
|
|
|
bool nosched)
|
2006-07-03 11:24:40 +04:00
|
|
|
{
|
2010-06-03 23:32:43 +04:00
|
|
|
if (nosched && in_sched_functions(addr))
|
2016-02-18 06:58:57 +03:00
|
|
|
return 0;
|
2016-09-16 22:18:14 +03:00
|
|
|
|
2006-09-26 12:52:34 +04:00
|
|
|
if (trace->skip > 0) {
|
|
|
|
trace->skip--;
|
2016-02-18 06:58:57 +03:00
|
|
|
return 0;
|
2006-07-03 11:24:40 +04:00
|
|
|
}
|
|
|
|
|
2016-09-16 22:18:14 +03:00
|
|
|
if (trace->nr_entries >= trace->max_entries)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
trace->entries[trace->nr_entries++] = addr;
|
|
|
|
return 0;
|
2010-06-03 23:32:43 +04:00
|
|
|
}
|
|
|
|
|
2017-09-29 12:23:35 +03:00
|
|
|
static void noinline __save_stack_trace(struct stack_trace *trace,
|
2016-09-16 22:18:14 +03:00
|
|
|
struct task_struct *task, struct pt_regs *regs,
|
|
|
|
bool nosched)
|
2008-01-25 23:08:34 +03:00
|
|
|
{
|
2016-09-16 22:18:14 +03:00
|
|
|
struct unwind_state state;
|
|
|
|
unsigned long addr;
|
2008-01-25 23:08:34 +03:00
|
|
|
|
2016-09-16 22:18:14 +03:00
|
|
|
if (regs)
|
|
|
|
save_stack_address(trace, regs->ip, nosched);
|
2006-07-03 11:24:40 +04:00
|
|
|
|
2016-09-16 22:18:14 +03:00
|
|
|
for (unwind_start(&state, task, regs, NULL); !unwind_done(&state);
|
|
|
|
unwind_next_frame(&state)) {
|
|
|
|
addr = unwind_get_return_address(&state);
|
|
|
|
if (!addr || save_stack_address(trace, addr, nosched))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (trace->nr_entries < trace->max_entries)
|
|
|
|
trace->entries[trace->nr_entries++] = ULONG_MAX;
|
|
|
|
}
|
2008-01-25 23:08:34 +03:00
|
|
|
|
2006-07-03 11:24:40 +04:00
|
|
|
/*
|
|
|
|
* Save stack-backtrace addresses into a stack_trace buffer.
|
|
|
|
*/
|
2007-05-08 11:23:29 +04:00
|
|
|
void save_stack_trace(struct stack_trace *trace)
|
2006-07-03 11:24:40 +04:00
|
|
|
{
|
2017-09-29 12:23:35 +03:00
|
|
|
trace->skip++;
|
2016-09-16 22:18:14 +03:00
|
|
|
__save_stack_trace(trace, current, NULL, false);
|
2006-07-03 11:24:40 +04:00
|
|
|
}
|
2008-06-27 23:20:17 +04:00
|
|
|
EXPORT_SYMBOL_GPL(save_stack_trace);
|
2008-01-25 23:08:34 +03:00
|
|
|
|
2011-06-08 11:09:21 +04:00
|
|
|
void save_stack_trace_regs(struct pt_regs *regs, struct stack_trace *trace)
|
2008-05-20 13:15:43 +04:00
|
|
|
{
|
2016-09-16 22:18:14 +03:00
|
|
|
__save_stack_trace(trace, current, regs, false);
|
2008-05-20 13:15:43 +04:00
|
|
|
}
|
|
|
|
|
2008-01-25 23:08:34 +03:00
|
|
|
void save_stack_trace_tsk(struct task_struct *tsk, struct stack_trace *trace)
|
|
|
|
{
|
2016-09-16 08:45:45 +03:00
|
|
|
if (!try_get_task_stack(tsk))
|
|
|
|
return;
|
|
|
|
|
2017-09-29 12:23:35 +03:00
|
|
|
if (tsk == current)
|
|
|
|
trace->skip++;
|
2016-09-16 22:18:14 +03:00
|
|
|
__save_stack_trace(trace, tsk, NULL, true);
|
2016-09-16 08:45:45 +03:00
|
|
|
|
|
|
|
put_task_stack(tsk);
|
2008-01-25 23:08:34 +03:00
|
|
|
}
|
2008-06-27 23:20:17 +04:00
|
|
|
EXPORT_SYMBOL_GPL(save_stack_trace_tsk);
|
2008-11-22 14:28:47 +03:00
|
|
|
|
2017-02-14 04:42:28 +03:00
|
|
|
#ifdef CONFIG_HAVE_RELIABLE_STACKTRACE
|
|
|
|
|
2017-09-29 12:23:35 +03:00
|
|
|
static int __always_inline
|
|
|
|
__save_stack_trace_reliable(struct stack_trace *trace,
|
|
|
|
struct task_struct *task)
|
2017-02-14 04:42:28 +03:00
|
|
|
{
|
|
|
|
struct unwind_state state;
|
|
|
|
struct pt_regs *regs;
|
|
|
|
unsigned long addr;
|
|
|
|
|
2018-05-18 09:47:10 +03:00
|
|
|
for (unwind_start(&state, task, NULL, NULL);
|
|
|
|
!unwind_done(&state) && !unwind_error(&state);
|
2017-02-14 04:42:28 +03:00
|
|
|
unwind_next_frame(&state)) {
|
|
|
|
|
2017-12-31 19:18:06 +03:00
|
|
|
regs = unwind_get_entry_regs(&state, NULL);
|
2017-02-14 04:42:28 +03:00
|
|
|
if (regs) {
|
2018-05-18 09:47:10 +03:00
|
|
|
/* Success path for user tasks */
|
|
|
|
if (user_mode(regs))
|
|
|
|
goto success;
|
|
|
|
|
2017-02-14 04:42:28 +03:00
|
|
|
/*
|
|
|
|
* Kernel mode registers on the stack indicate an
|
|
|
|
* in-kernel interrupt or exception (e.g., preemption
|
|
|
|
* or a page fault), which can make frame pointers
|
|
|
|
* unreliable.
|
|
|
|
*/
|
|
|
|
|
2018-05-18 09:47:11 +03:00
|
|
|
if (IS_ENABLED(CONFIG_FRAME_POINTER))
|
|
|
|
return -EINVAL;
|
2017-02-14 04:42:28 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
addr = unwind_get_return_address(&state);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* A NULL or invalid return address probably means there's some
|
|
|
|
* generated code which __kernel_text_address() doesn't know
|
|
|
|
* about.
|
|
|
|
*/
|
2018-05-18 09:47:09 +03:00
|
|
|
if (!addr)
|
2017-02-14 04:42:28 +03:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (save_stack_address(trace, addr, false))
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for stack corruption */
|
2018-05-18 09:47:09 +03:00
|
|
|
if (unwind_error(&state))
|
2017-02-14 04:42:28 +03:00
|
|
|
return -EINVAL;
|
|
|
|
|
2018-05-18 09:47:10 +03:00
|
|
|
/* Success path for non-user tasks, i.e. kthreads and idle tasks */
|
|
|
|
if (!(task->flags & (PF_KTHREAD | PF_IDLE)))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
success:
|
2017-02-14 04:42:28 +03:00
|
|
|
if (trace->nr_entries < trace->max_entries)
|
|
|
|
trace->entries[trace->nr_entries++] = ULONG_MAX;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function returns an error if it detects any unreliable features of the
|
|
|
|
* stack. Otherwise it guarantees that the stack trace is reliable.
|
|
|
|
*
|
|
|
|
* If the task is not 'current', the caller *must* ensure the task is inactive.
|
|
|
|
*/
|
|
|
|
int save_stack_trace_tsk_reliable(struct task_struct *tsk,
|
|
|
|
struct stack_trace *trace)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
2017-12-19 00:13:44 +03:00
|
|
|
/*
|
|
|
|
* If the task doesn't have a stack (e.g., a zombie), the stack is
|
|
|
|
* "reliably" empty.
|
|
|
|
*/
|
2017-02-14 04:42:28 +03:00
|
|
|
if (!try_get_task_stack(tsk))
|
2017-12-19 00:13:44 +03:00
|
|
|
return 0;
|
2017-02-14 04:42:28 +03:00
|
|
|
|
|
|
|
ret = __save_stack_trace_reliable(trace, tsk);
|
|
|
|
|
|
|
|
put_task_stack(tsk);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_HAVE_RELIABLE_STACKTRACE */
|
|
|
|
|
2008-11-22 14:28:47 +03:00
|
|
|
/* Userspace stacktrace - based on kernel/trace/trace_sysprof.c */
|
|
|
|
|
2010-05-19 23:35:17 +04:00
|
|
|
struct stack_frame_user {
|
2008-11-22 14:28:47 +03:00
|
|
|
const void __user *next_fp;
|
2008-11-23 13:39:06 +03:00
|
|
|
unsigned long ret_addr;
|
2008-11-22 14:28:47 +03:00
|
|
|
};
|
|
|
|
|
2010-05-19 23:35:17 +04:00
|
|
|
static int
|
|
|
|
copy_stack_frame(const void __user *fp, struct stack_frame_user *frame)
|
2008-11-22 14:28:47 +03:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
Remove 'type' argument from access_ok() function
Nobody has actually used the type (VERIFY_READ vs VERIFY_WRITE) argument
of the user address range verification function since we got rid of the
old racy i386-only code to walk page tables by hand.
It existed because the original 80386 would not honor the write protect
bit when in kernel mode, so you had to do COW by hand before doing any
user access. But we haven't supported that in a long time, and these
days the 'type' argument is a purely historical artifact.
A discussion about extending 'user_access_begin()' to do the range
checking resulted this patch, because there is no way we're going to
move the old VERIFY_xyz interface to that model. And it's best done at
the end of the merge window when I've done most of my merges, so let's
just get this done once and for all.
This patch was mostly done with a sed-script, with manual fix-ups for
the cases that weren't of the trivial 'access_ok(VERIFY_xyz' form.
There were a couple of notable cases:
- csky still had the old "verify_area()" name as an alias.
- the iter_iov code had magical hardcoded knowledge of the actual
values of VERIFY_{READ,WRITE} (not that they mattered, since nothing
really used it)
- microblaze used the type argument for a debug printout
but other than those oddities this should be a total no-op patch.
I tried to fix up all architectures, did fairly extensive grepping for
access_ok() uses, and the changes are trivial, but I may have missed
something. Any missed conversion should be trivially fixable, though.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2019-01-04 05:57:57 +03:00
|
|
|
if (!access_ok(fp, sizeof(*frame)))
|
2008-11-22 14:28:47 +03:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
ret = 1;
|
|
|
|
pagefault_disable();
|
|
|
|
if (__copy_from_user_inatomic(frame, fp, sizeof(*frame)))
|
|
|
|
ret = 0;
|
|
|
|
pagefault_enable();
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-11-23 13:39:06 +03:00
|
|
|
static inline void __save_stack_trace_user(struct stack_trace *trace)
|
|
|
|
{
|
|
|
|
const struct pt_regs *regs = task_pt_regs(current);
|
|
|
|
const void __user *fp = (const void __user *)regs->bp;
|
|
|
|
|
|
|
|
if (trace->nr_entries < trace->max_entries)
|
|
|
|
trace->entries[trace->nr_entries++] = regs->ip;
|
|
|
|
|
|
|
|
while (trace->nr_entries < trace->max_entries) {
|
2010-05-19 23:35:17 +04:00
|
|
|
struct stack_frame_user frame;
|
2008-11-23 13:39:06 +03:00
|
|
|
|
|
|
|
frame.next_fp = NULL;
|
|
|
|
frame.ret_addr = 0;
|
|
|
|
if (!copy_stack_frame(fp, &frame))
|
|
|
|
break;
|
|
|
|
if ((unsigned long)fp < regs->sp)
|
|
|
|
break;
|
|
|
|
if (frame.ret_addr) {
|
|
|
|
trace->entries[trace->nr_entries++] =
|
|
|
|
frame.ret_addr;
|
|
|
|
}
|
|
|
|
if (fp == frame.next_fp)
|
|
|
|
break;
|
|
|
|
fp = frame.next_fp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-11-22 14:28:47 +03:00
|
|
|
void save_stack_trace_user(struct stack_trace *trace)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Trace user stack if we are not a kernel thread
|
|
|
|
*/
|
|
|
|
if (current->mm) {
|
2008-11-23 13:39:06 +03:00
|
|
|
__save_stack_trace_user(trace);
|
2008-11-22 14:28:47 +03:00
|
|
|
}
|
|
|
|
if (trace->nr_entries < trace->max_entries)
|
|
|
|
trace->entries[trace->nr_entries++] = ULONG_MAX;
|
|
|
|
}
|