stacktrace.c 3.4 KB
Newer Older
1 2 3
/*
 * Stack trace management functions
 *
I
Ingo Molnar 已提交
4
 *  Copyright (C) 2006-2009 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
5 6 7
 */
#include <linux/sched.h>
#include <linux/stacktrace.h>
8
#include <linux/module.h>
9
#include <linux/uaccess.h>
10
#include <asm/stacktrace.h>
11

12
static void save_stack_warning(void *data, char *msg)
13 14 15
{
}

16 17
static void
save_stack_warning_symbol(void *data, char *msg, unsigned long symbol)
18 19 20
{
}

21
static int save_stack_stack(void *data, char *name)
22
{
23
	return 0;
24
}
25

26
static void save_stack_address(void *data, unsigned long addr, int reliable)
27
{
J
Jan Engelhardt 已提交
28
	struct stack_trace *trace = data;
29 30
	if (!reliable)
		return;
31 32 33
	if (trace->skip > 0) {
		trace->skip--;
		return;
34
	}
35
	if (trace->nr_entries < trace->max_entries)
36
		trace->entries[trace->nr_entries++] = addr;
37 38
}

39 40
static void
save_stack_address_nosched(void *data, unsigned long addr, int reliable)
A
Arjan van de Ven 已提交
41 42
{
	struct stack_trace *trace = (struct stack_trace *)data;
43 44
	if (!reliable)
		return;
A
Arjan van de Ven 已提交
45 46 47 48 49 50 51 52 53 54
	if (in_sched_functions(addr))
		return;
	if (trace->skip > 0) {
		trace->skip--;
		return;
	}
	if (trace->nr_entries < trace->max_entries)
		trace->entries[trace->nr_entries++] = addr;
}

J
Jan Beulich 已提交
55
static const struct stacktrace_ops save_stack_ops = {
56 57 58 59 60
	.warning = save_stack_warning,
	.warning_symbol = save_stack_warning_symbol,
	.stack = save_stack_stack,
	.address = save_stack_address,
};
61

A
Arjan van de Ven 已提交
62 63 64 65 66 67 68
static const struct stacktrace_ops save_stack_ops_nosched = {
	.warning = save_stack_warning,
	.warning_symbol = save_stack_warning_symbol,
	.stack = save_stack_stack,
	.address = save_stack_address_nosched,
};

69 70 71
/*
 * Save stack-backtrace addresses into a stack_trace buffer.
 */
C
Christoph Hellwig 已提交
72
void save_stack_trace(struct stack_trace *trace)
73
{
74
	dump_trace(current, NULL, NULL, 0, &save_stack_ops, trace);
75 76
	if (trace->nr_entries < trace->max_entries)
		trace->entries[trace->nr_entries++] = ULONG_MAX;
77
}
78
EXPORT_SYMBOL_GPL(save_stack_trace);
A
Arjan van de Ven 已提交
79 80 81

void save_stack_trace_tsk(struct task_struct *tsk, struct stack_trace *trace)
{
82
	dump_trace(tsk, NULL, NULL, 0, &save_stack_ops_nosched, trace);
A
Arjan van de Ven 已提交
83 84 85
	if (trace->nr_entries < trace->max_entries)
		trace->entries[trace->nr_entries++] = ULONG_MAX;
}
86
EXPORT_SYMBOL_GPL(save_stack_trace_tsk);
87 88 89 90 91

/* Userspace stacktrace - based on kernel/trace/trace_sysprof.c */

struct stack_frame {
	const void __user	*next_fp;
92
	unsigned long		ret_addr;
93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110
};

static int copy_stack_frame(const void __user *fp, struct stack_frame *frame)
{
	int ret;

	if (!access_ok(VERIFY_READ, fp, sizeof(*frame)))
		return 0;

	ret = 1;
	pagefault_disable();
	if (__copy_from_user_inatomic(frame, fp, sizeof(*frame)))
		ret = 0;
	pagefault_enable();

	return ret;
}

111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137
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) {
		struct stack_frame frame;

		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;
	}
}

138 139 140 141 142 143
void save_stack_trace_user(struct stack_trace *trace)
{
	/*
	 * Trace user stack if we are not a kernel thread
	 */
	if (current->mm) {
144
		__save_stack_trace_user(trace);
145 146 147 148 149
	}
	if (trace->nr_entries < trace->max_entries)
		trace->entries[trace->nr_entries++] = ULONG_MAX;
}