blob: 00f79e59985bccaf54bd3b1c8f2e292f49014a47 [file] [log] [blame]
Paul Gortmakerecea4ab2011-07-22 10:58:34 -04001#include <linux/export.h>
Russell Kingf16fb1e2007-04-28 09:59:37 +01002#include <linux/sched.h>
3#include <linux/stacktrace.h>
4
Catalin Marinas2d7c11b2009-02-11 13:07:53 +01005#include <asm/stacktrace.h>
Russell Kingf16fb1e2007-04-28 09:59:37 +01006
Catalin Marinas2d7c11b2009-02-11 13:07:53 +01007#if defined(CONFIG_FRAME_POINTER) && !defined(CONFIG_ARM_UNWIND)
8/*
9 * Unwind the current stack frame and store the new register values in the
10 * structure passed as argument. Unwinding is equivalent to a function return,
11 * hence the new PC value rather than LR should be used for backtrace.
12 *
13 * With framepointer enabled, a simple function prologue looks like this:
14 * mov ip, sp
15 * stmdb sp!, {fp, ip, lr, pc}
16 * sub fp, ip, #4
17 *
18 * A simple function epilogue looks like this:
19 * ldm sp, {fp, sp, pc}
20 *
21 * Note that with framepointer enabled, even the leaf functions have the same
22 * prologue and epilogue, therefore we can ignore the LR value in this case.
23 */
Uwe Kleine-König4bf1fa52009-07-21 09:56:27 +010024int notrace unwind_frame(struct stackframe *frame)
Russell Kingf16fb1e2007-04-28 09:59:37 +010025{
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010026 unsigned long high, low;
27 unsigned long fp = frame->fp;
Russell Kingf16fb1e2007-04-28 09:59:37 +010028
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010029 /* only go to a higher address on the stack */
30 low = frame->sp;
Will Deacond33aadb2010-11-04 18:22:51 +010031 high = ALIGN(low, THREAD_SIZE);
Russell Kingf16fb1e2007-04-28 09:59:37 +010032
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010033 /* check current frame pointer is within bounds */
34 if (fp < (low + 12) || fp + 4 >= high)
35 return -EINVAL;
36
37 /* restore the registers from the stack frame */
38 frame->fp = *(unsigned long *)(fp - 12);
39 frame->sp = *(unsigned long *)(fp - 8);
40 frame->pc = *(unsigned long *)(fp - 4);
41
42 return 0;
43}
44#endif
45
Uwe Kleine-König4bf1fa52009-07-21 09:56:27 +010046void notrace walk_stackframe(struct stackframe *frame,
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010047 int (*fn)(struct stackframe *, void *), void *data)
48{
49 while (1) {
50 int ret;
Russell Kingf16fb1e2007-04-28 09:59:37 +010051
52 if (fn(frame, data))
53 break;
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010054 ret = unwind_frame(frame);
55 if (ret < 0)
56 break;
57 }
Russell Kingf16fb1e2007-04-28 09:59:37 +010058}
Al Viro7b104bc2007-05-15 20:37:20 +010059EXPORT_SYMBOL(walk_stackframe);
Russell Kingf16fb1e2007-04-28 09:59:37 +010060
61#ifdef CONFIG_STACKTRACE
62struct stack_trace_data {
63 struct stack_trace *trace;
Nicolas Pitref76e9152008-04-24 01:31:46 -040064 unsigned int no_sched_functions;
Russell Kingf16fb1e2007-04-28 09:59:37 +010065 unsigned int skip;
66};
67
68static int save_trace(struct stackframe *frame, void *d)
69{
70 struct stack_trace_data *data = d;
71 struct stack_trace *trace = data->trace;
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010072 unsigned long addr = frame->pc;
Russell Kingf16fb1e2007-04-28 09:59:37 +010073
Nicolas Pitref76e9152008-04-24 01:31:46 -040074 if (data->no_sched_functions && in_sched_functions(addr))
75 return 0;
Russell Kingf16fb1e2007-04-28 09:59:37 +010076 if (data->skip) {
77 data->skip--;
78 return 0;
79 }
80
Nicolas Pitref76e9152008-04-24 01:31:46 -040081 trace->entries[trace->nr_entries++] = addr;
Russell Kingf16fb1e2007-04-28 09:59:37 +010082
83 return trace->nr_entries >= trace->max_entries;
84}
85
Nicolas Pitref76e9152008-04-24 01:31:46 -040086void save_stack_trace_tsk(struct task_struct *tsk, struct stack_trace *trace)
Russell Kingf16fb1e2007-04-28 09:59:37 +010087{
88 struct stack_trace_data data;
Catalin Marinas2d7c11b2009-02-11 13:07:53 +010089 struct stackframe frame;
Russell Kingf16fb1e2007-04-28 09:59:37 +010090
91 data.trace = trace;
92 data.skip = trace->skip;
Nicolas Pitref76e9152008-04-24 01:31:46 -040093
94 if (tsk != current) {
95#ifdef CONFIG_SMP
96 /*
Russell Kingd5996b22011-01-15 09:27:04 +000097 * What guarantees do we have here that 'tsk' is not
98 * running on another CPU? For now, ignore it as we
99 * can't guarantee we won't explode.
Nicolas Pitref76e9152008-04-24 01:31:46 -0400100 */
Russell Kingd5996b22011-01-15 09:27:04 +0000101 if (trace->nr_entries < trace->max_entries)
102 trace->entries[trace->nr_entries++] = ULONG_MAX;
103 return;
Nicolas Pitref76e9152008-04-24 01:31:46 -0400104#else
105 data.no_sched_functions = 1;
Catalin Marinas2d7c11b2009-02-11 13:07:53 +0100106 frame.fp = thread_saved_fp(tsk);
107 frame.sp = thread_saved_sp(tsk);
108 frame.lr = 0; /* recovered from the stack */
109 frame.pc = thread_saved_pc(tsk);
Nicolas Pitref76e9152008-04-24 01:31:46 -0400110#endif
111 } else {
Catalin Marinas2d7c11b2009-02-11 13:07:53 +0100112 register unsigned long current_sp asm ("sp");
113
Nicolas Pitref76e9152008-04-24 01:31:46 -0400114 data.no_sched_functions = 0;
Catalin Marinas2d7c11b2009-02-11 13:07:53 +0100115 frame.fp = (unsigned long)__builtin_frame_address(0);
116 frame.sp = current_sp;
117 frame.lr = (unsigned long)__builtin_return_address(0);
118 frame.pc = (unsigned long)save_stack_trace_tsk;
Nicolas Pitref76e9152008-04-24 01:31:46 -0400119 }
Russell Kingf16fb1e2007-04-28 09:59:37 +0100120
Catalin Marinas2d7c11b2009-02-11 13:07:53 +0100121 walk_stackframe(&frame, save_trace, &data);
Nicolas Pitref76e9152008-04-24 01:31:46 -0400122 if (trace->nr_entries < trace->max_entries)
123 trace->entries[trace->nr_entries++] = ULONG_MAX;
124}
125
126void save_stack_trace(struct stack_trace *trace)
127{
128 save_stack_trace_tsk(current, trace);
Russell Kingf16fb1e2007-04-28 09:59:37 +0100129}
Ingo Molnar7b4c9502008-07-03 09:17:55 +0200130EXPORT_SYMBOL_GPL(save_stack_trace);
Russell Kingf16fb1e2007-04-28 09:59:37 +0100131#endif