blob: 1c022af8fe1eb22ff7935928598ffb2b299b589d [file] [log] [blame]
Ingo Molnar21b32bb2006-07-03 00:24:40 -07001/*
2 * arch/x86_64/kernel/stacktrace.c
3 *
4 * Stack trace management functions
5 *
6 * Copyright (C) 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
7 */
8#include <linux/sched.h>
9#include <linux/stacktrace.h>
10
11#include <asm/smp.h>
12
13static inline int
14in_range(unsigned long start, unsigned long addr, unsigned long end)
15{
16 return addr >= start && addr <= end;
17}
18
19static unsigned long
20get_stack_end(struct task_struct *task, unsigned long stack)
21{
22 unsigned long stack_start, stack_end, flags;
23 int i, cpu;
24
25 /*
26 * The most common case is that we are in the task stack:
27 */
28 stack_start = (unsigned long)task->thread_info;
29 stack_end = stack_start + THREAD_SIZE;
30
31 if (in_range(stack_start, stack, stack_end))
32 return stack_end;
33
34 /*
35 * We are in an interrupt if irqstackptr is set:
36 */
37 raw_local_irq_save(flags);
38 cpu = safe_smp_processor_id();
39 stack_end = (unsigned long)cpu_pda(cpu)->irqstackptr;
40
41 if (stack_end) {
42 stack_start = stack_end & ~(IRQSTACKSIZE-1);
43 if (in_range(stack_start, stack, stack_end))
44 goto out_restore;
45 /*
46 * We get here if we are in an IRQ context but we
47 * are also in an exception stack.
48 */
49 }
50
51 /*
52 * Iterate over all exception stacks, and figure out whether
53 * 'stack' is in one of them:
54 */
55 for (i = 0; i < N_EXCEPTION_STACKS; i++) {
56 /*
57 * set 'end' to the end of the exception stack.
58 */
59 stack_end = per_cpu(init_tss, cpu).ist[i];
60 stack_start = stack_end - EXCEPTION_STKSZ;
61
62 /*
63 * Is 'stack' above this exception frame's end?
64 * If yes then skip to the next frame.
65 */
66 if (stack >= stack_end)
67 continue;
68 /*
69 * Is 'stack' above this exception frame's start address?
70 * If yes then we found the right frame.
71 */
72 if (stack >= stack_start)
73 goto out_restore;
74
75 /*
76 * If this is a debug stack, and if it has a larger size than
77 * the usual exception stacks, then 'stack' might still
78 * be within the lower portion of the debug stack:
79 */
80#if DEBUG_STKSZ > EXCEPTION_STKSZ
81 if (i == DEBUG_STACK - 1 && stack >= stack_end - DEBUG_STKSZ) {
82 /*
83 * Black magic. A large debug stack is composed of
84 * multiple exception stack entries, which we
85 * iterate through now. Dont look:
86 */
87 do {
88 stack_end -= EXCEPTION_STKSZ;
89 stack_start -= EXCEPTION_STKSZ;
90 } while (stack < stack_start);
91
92 goto out_restore;
93 }
94#endif
95 }
96 /*
97 * Ok, 'stack' is not pointing to any of the system stacks.
98 */
99 stack_end = 0;
100
101out_restore:
102 raw_local_irq_restore(flags);
103
104 return stack_end;
105}
106
107
108/*
109 * Save stack-backtrace addresses into a stack_trace buffer:
110 */
111static inline unsigned long
Andi Kleen5a1b3992006-09-26 10:52:34 +0200112save_context_stack(struct stack_trace *trace,
Ingo Molnar21b32bb2006-07-03 00:24:40 -0700113 unsigned long stack, unsigned long stack_end)
114{
Andi Kleen5a1b3992006-09-26 10:52:34 +0200115 int skip = trace->skip;
Ingo Molnar21b32bb2006-07-03 00:24:40 -0700116 unsigned long addr;
117
118#ifdef CONFIG_FRAME_POINTER
119 unsigned long prev_stack = 0;
120
121 while (in_range(prev_stack, stack, stack_end)) {
122 pr_debug("stack: %p\n", (void *)stack);
123 addr = (unsigned long)(((unsigned long *)stack)[1]);
124 pr_debug("addr: %p\n", (void *)addr);
125 if (!skip)
126 trace->entries[trace->nr_entries++] = addr-1;
127 else
128 skip--;
129 if (trace->nr_entries >= trace->max_entries)
130 break;
131 if (!addr)
132 return 0;
133 /*
134 * Stack frames must go forwards (otherwise a loop could
135 * happen if the stackframe is corrupted), so we move
136 * prev_stack forwards:
137 */
138 prev_stack = stack;
139 stack = (unsigned long)(((unsigned long *)stack)[0]);
140 }
141 pr_debug("invalid: %p\n", (void *)stack);
142#else
143 while (stack < stack_end) {
144 addr = ((unsigned long *)stack)[0];
145 stack += sizeof(long);
146 if (__kernel_text_address(addr)) {
147 if (!skip)
148 trace->entries[trace->nr_entries++] = addr-1;
149 else
150 skip--;
151 if (trace->nr_entries >= trace->max_entries)
152 break;
153 }
154 }
155#endif
156 return stack;
157}
158
159#define MAX_STACKS 10
160
161/*
162 * Save stack-backtrace addresses into a stack_trace buffer.
Ingo Molnar21b32bb2006-07-03 00:24:40 -0700163 */
Andi Kleen5a1b3992006-09-26 10:52:34 +0200164void save_stack_trace(struct stack_trace *trace, struct task_struct *task)
Ingo Molnar21b32bb2006-07-03 00:24:40 -0700165{
166 unsigned long stack = (unsigned long)&stack;
167 int i, nr_stacks = 0, stacks_done[MAX_STACKS];
168
169 WARN_ON(trace->nr_entries || !trace->max_entries);
170
171 if (!task)
172 task = current;
173
174 pr_debug("task: %p, ti: %p\n", task, task->thread_info);
175
176 if (!task || task == current) {
177 /* Grab rbp right from our regs: */
178 asm ("mov %%rbp, %0" : "=r" (stack));
179 pr_debug("rbp: %p\n", (void *)stack);
180 } else {
181 /* rbp is the last reg pushed by switch_to(): */
182 stack = task->thread.rsp;
183 pr_debug("other task rsp: %p\n", (void *)stack);
184 stack = (unsigned long)(((unsigned long *)stack)[0]);
185 pr_debug("other task rbp: %p\n", (void *)stack);
186 }
187
188 while (1) {
189 unsigned long stack_end = get_stack_end(task, stack);
190
191 pr_debug("stack: %p\n", (void *)stack);
192 pr_debug("stack end: %p\n", (void *)stack_end);
193
194 /*
195 * Invalid stack addres?
196 */
197 if (!stack_end)
198 return;
199 /*
200 * Were we in this stack already? (recursion)
201 */
202 for (i = 0; i < nr_stacks; i++)
203 if (stacks_done[i] == stack_end)
204 return;
205 stacks_done[nr_stacks] = stack_end;
206
Andi Kleen5a1b3992006-09-26 10:52:34 +0200207 stack = save_context_stack(trace, stack, stack_end);
208 if (!stack || trace->nr_entries >= trace->max_entries)
Ingo Molnar21b32bb2006-07-03 00:24:40 -0700209 return;
210 trace->entries[trace->nr_entries++] = ULONG_MAX;
211 if (trace->nr_entries >= trace->max_entries)
212 return;
213 if (++nr_stacks >= MAX_STACKS)
214 return;
215 }
216}
217