blob: 64101335de19aad09ec03d75dea8260b28051747 [file] [log] [blame]
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +02001/*
2 * Copyright (C) 1991, 1992 Linus Torvalds
3 * Copyright (C) 2000, 2001, 2002 Andi Kleen, SuSE Labs
4 */
5#include <linux/kallsyms.h>
6#include <linux/kprobes.h>
7#include <linux/uaccess.h>
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +02008#include <linux/hardirq.h>
9#include <linux/kdebug.h>
10#include <linux/module.h>
11#include <linux/ptrace.h>
12#include <linux/kexec.h>
Ingo Molnarb8030902009-11-26 08:17:31 +010013#include <linux/sysfs.h>
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020014#include <linux/bug.h>
15#include <linux/nmi.h>
16
17#include <asm/stacktrace.h>
18
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020019
Ingo Molnarb8030902009-11-26 08:17:31 +010020#define N_EXCEPTION_STACKS_END \
21 (N_EXCEPTION_STACKS + DEBUG_STKSZ/EXCEPTION_STKSZ - 2)
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020022
23static char x86_stack_ids[][8] = {
Ingo Molnarb8030902009-11-26 08:17:31 +010024 [ DEBUG_STACK-1 ] = "#DB",
25 [ NMI_STACK-1 ] = "NMI",
26 [ DOUBLEFAULT_STACK-1 ] = "#DF",
27 [ STACKFAULT_STACK-1 ] = "#SS",
28 [ MCE_STACK-1 ] = "#MC",
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020029#if DEBUG_STKSZ > EXCEPTION_STKSZ
Ingo Molnarb8030902009-11-26 08:17:31 +010030 [ N_EXCEPTION_STACKS ...
31 N_EXCEPTION_STACKS_END ] = "#DB[?]"
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020032#endif
Ingo Molnarb8030902009-11-26 08:17:31 +010033};
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020034
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020035static unsigned long *in_exception_stack(unsigned cpu, unsigned long stack,
Ingo Molnarb8030902009-11-26 08:17:31 +010036 unsigned *usedp, char **idp)
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020037{
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020038 unsigned k;
39
40 /*
41 * Iterate over all exception stacks, and figure out whether
42 * 'stack' is in one of them:
43 */
44 for (k = 0; k < N_EXCEPTION_STACKS; k++) {
45 unsigned long end = per_cpu(orig_ist, cpu).ist[k];
46 /*
47 * Is 'stack' above this exception frame's end?
48 * If yes then skip to the next frame.
49 */
50 if (stack >= end)
51 continue;
52 /*
53 * Is 'stack' above this exception frame's start address?
54 * If yes then we found the right frame.
55 */
56 if (stack >= end - EXCEPTION_STKSZ) {
57 /*
58 * Make sure we only iterate through an exception
59 * stack once. If it comes up for the second time
60 * then there's something wrong going on - just
61 * break out and return NULL:
62 */
63 if (*usedp & (1U << k))
64 break;
65 *usedp |= 1U << k;
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020066 *idp = x86_stack_ids[k];
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020067 return (unsigned long *)end;
68 }
69 /*
70 * If this is a debug stack, and if it has a larger size than
71 * the usual exception stacks, then 'stack' might still
72 * be within the lower portion of the debug stack:
73 */
74#if DEBUG_STKSZ > EXCEPTION_STKSZ
75 if (k == DEBUG_STACK - 1 && stack >= end - DEBUG_STKSZ) {
76 unsigned j = N_EXCEPTION_STACKS - 1;
77
78 /*
79 * Black magic. A large debug stack is composed of
80 * multiple exception stack entries, which we
81 * iterate through now. Dont look:
82 */
83 do {
84 ++j;
85 end -= EXCEPTION_STKSZ;
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020086 x86_stack_ids[j][4] = '1' +
87 (j - N_EXCEPTION_STACKS);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020088 } while (stack < end - EXCEPTION_STKSZ);
89 if (*usedp & (1U << j))
90 break;
91 *usedp |= 1U << j;
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020092 *idp = x86_stack_ids[j];
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020093 return (unsigned long *)end;
94 }
95#endif
96 }
97 return NULL;
98}
99
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100100static inline int
101in_irq_stack(unsigned long *stack, unsigned long *irq_stack,
102 unsigned long *irq_stack_end)
103{
104 return (stack >= irq_stack && stack < irq_stack_end);
105}
106
107/*
108 * We are returning from the irq stack and go to the previous one.
109 * If the previous stack is also in the irq stack, then bp in the first
110 * frame of the irq stack points to the previous, interrupted one.
111 * Otherwise we have another level of indirection: We first save
112 * the bp of the previous stack, then we switch the stack to the irq one
113 * and save a new bp that links to the previous one.
114 * (See save_args())
115 */
116static inline unsigned long
117fixup_bp_irq_link(unsigned long bp, unsigned long *stack,
118 unsigned long *irq_stack, unsigned long *irq_stack_end)
119{
120#ifdef CONFIG_FRAME_POINTER
121 struct stack_frame *frame = (struct stack_frame *)bp;
Frederic Weisbecker29044ad2010-03-03 02:25:22 +0100122 unsigned long next;
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100123
Frederic Weisbecker29044ad2010-03-03 02:25:22 +0100124 if (!in_irq_stack(stack, irq_stack, irq_stack_end)) {
125 if (!probe_kernel_address(&frame->next_frame, next))
126 return next;
127 else
128 WARN_ONCE(1, "Perf: bad frame pointer = %p in "
129 "callchain\n", &frame->next_frame);
130 }
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100131#endif
132 return bp;
133}
134
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200135/*
136 * x86-64 can have up to three kernel stacks:
137 * process stack
138 * interrupt stack
139 * severe exception (double fault, nmi, stack fault, debug, mce) hardware stack
140 */
141
Soeren Sandmann Pedersen9c0729d2010-11-05 05:59:39 -0400142void dump_trace(struct task_struct *task,
143 struct pt_regs *regs, unsigned long *stack,
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200144 const struct stacktrace_ops *ops, void *data)
145{
146 const unsigned cpu = get_cpu();
Brian Gerst26f80bd2009-01-19 00:38:58 +0900147 unsigned long *irq_stack_end =
148 (unsigned long *)per_cpu(irq_stack_ptr, cpu);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200149 unsigned used = 0;
150 struct thread_info *tinfo;
Steven Rostedt7ee991f2008-12-02 23:50:04 -0500151 int graph = 0;
Soeren Sandmann Pedersen9c0729d2010-11-05 05:59:39 -0400152 unsigned long bp;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200153
154 if (!task)
155 task = current;
156
157 if (!stack) {
158 unsigned long dummy;
159 stack = &dummy;
160 if (task && task != current)
161 stack = (unsigned long *)task->thread.sp;
162 }
163
Soeren Sandmann Pedersen9c0729d2010-11-05 05:59:39 -0400164 bp = stack_frame(task, regs);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200165 /*
166 * Print function call entries in all stacks, starting at the
167 * current stack address. If the stacks consist of nested
168 * exceptions
169 */
170 tinfo = task_thread_info(task);
171 for (;;) {
172 char *id;
173 unsigned long *estack_end;
174 estack_end = in_exception_stack(cpu, (unsigned long)stack,
175 &used, &id);
176
177 if (estack_end) {
178 if (ops->stack(data, id) < 0)
179 break;
180
Frederic Weisbecker61c19172009-12-17 05:40:33 +0100181 bp = ops->walk_stack(tinfo, stack, bp, ops,
182 data, estack_end, &graph);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200183 ops->stack(data, "<EOE>");
184 /*
185 * We link to the next stack via the
186 * second-to-last pointer (index -2 to end) in the
187 * exception stack:
188 */
189 stack = (unsigned long *) estack_end[-2];
190 continue;
191 }
Brian Gerst26f80bd2009-01-19 00:38:58 +0900192 if (irq_stack_end) {
193 unsigned long *irq_stack;
194 irq_stack = irq_stack_end -
195 (IRQ_STACK_SIZE - 64) / sizeof(*irq_stack);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200196
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100197 if (in_irq_stack(stack, irq_stack, irq_stack_end)) {
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200198 if (ops->stack(data, "IRQ") < 0)
199 break;
Frederic Weisbecker61e67fb2010-03-03 07:38:37 +0100200 bp = ops->walk_stack(tinfo, stack, bp,
Brian Gerst26f80bd2009-01-19 00:38:58 +0900201 ops, data, irq_stack_end, &graph);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200202 /*
203 * We link to the next stack (which would be
204 * the process stack normally) the last
205 * pointer (index -1 to end) in the IRQ stack:
206 */
Brian Gerst26f80bd2009-01-19 00:38:58 +0900207 stack = (unsigned long *) (irq_stack_end[-1]);
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100208 bp = fixup_bp_irq_link(bp, stack, irq_stack,
209 irq_stack_end);
Brian Gerst26f80bd2009-01-19 00:38:58 +0900210 irq_stack_end = NULL;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200211 ops->stack(data, "EOI");
212 continue;
213 }
214 }
215 break;
216 }
217
218 /*
219 * This handles the process stack:
220 */
Frederic Weisbecker61e67fb2010-03-03 07:38:37 +0100221 bp = ops->walk_stack(tinfo, stack, bp, ops, data, NULL, &graph);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200222 put_cpu();
223}
224EXPORT_SYMBOL(dump_trace);
225
Neil Horman878719e2008-10-23 10:40:06 -0400226void
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200227show_stack_log_lvl(struct task_struct *task, struct pt_regs *regs,
Soeren Sandmann Pedersen9c0729d2010-11-05 05:59:39 -0400228 unsigned long *sp, char *log_lvl)
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200229{
Ingo Molnar67f2de02009-11-26 08:29:10 +0100230 unsigned long *irq_stack_end;
231 unsigned long *irq_stack;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200232 unsigned long *stack;
Ingo Molnar67f2de02009-11-26 08:29:10 +0100233 int cpu;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200234 int i;
Ingo Molnar67f2de02009-11-26 08:29:10 +0100235
236 preempt_disable();
237 cpu = smp_processor_id();
238
239 irq_stack_end = (unsigned long *)(per_cpu(irq_stack_ptr, cpu));
240 irq_stack = (unsigned long *)(per_cpu(irq_stack_ptr, cpu) - IRQ_STACK_SIZE);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200241
242 /*
Ingo Molnar67f2de02009-11-26 08:29:10 +0100243 * Debugging aid: "show_stack(NULL, NULL);" prints the
244 * back trace for this cpu:
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200245 */
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200246 if (sp == NULL) {
247 if (task)
248 sp = (unsigned long *)task->thread.sp;
249 else
250 sp = (unsigned long *)&sp;
251 }
252
253 stack = sp;
254 for (i = 0; i < kstack_depth_to_print; i++) {
Brian Gerst26f80bd2009-01-19 00:38:58 +0900255 if (stack >= irq_stack && stack <= irq_stack_end) {
256 if (stack == irq_stack_end) {
257 stack = (unsigned long *) (irq_stack_end[-1]);
Jiri Slabye4072a92010-10-20 16:48:51 +0200258 printk(KERN_CONT " <EOI> ");
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200259 }
260 } else {
261 if (((long) stack & (THREAD_SIZE-1)) == 0)
262 break;
263 }
Alexander van Heukelum8a541662008-10-04 23:12:46 +0200264 if (i && ((i % STACKSLOTS_PER_LINE) == 0))
Jiri Slabye4072a92010-10-20 16:48:51 +0200265 printk(KERN_CONT "\n");
266 printk(KERN_CONT " %016lx", *stack++);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200267 touch_nmi_watchdog();
268 }
Ingo Molnar67f2de02009-11-26 08:29:10 +0100269 preempt_enable();
270
Jiri Slabye4072a92010-10-20 16:48:51 +0200271 printk(KERN_CONT "\n");
Soeren Sandmann Pedersen9c0729d2010-11-05 05:59:39 -0400272 show_trace_log_lvl(task, regs, sp, log_lvl);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200273}
274
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200275void show_registers(struct pt_regs *regs)
276{
277 int i;
278 unsigned long sp;
279 const int cpu = smp_processor_id();
Brian Gerstc6f5e0a2009-01-19 00:38:58 +0900280 struct task_struct *cur = current;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200281
282 sp = regs->sp;
283 printk("CPU %d ", cpu);
Alexey Dobriyanf266d7f2010-02-03 21:21:32 +0200284 print_modules();
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200285 __show_regs(regs, 1);
286 printk("Process %s (pid: %d, threadinfo %p, task %p)\n",
287 cur->comm, cur->pid, task_thread_info(cur), cur);
288
289 /*
290 * When in-kernel, we also print out the stack and code at the
291 * time of the fault..
292 */
293 if (!user_mode(regs)) {
294 unsigned int code_prologue = code_bytes * 43 / 64;
295 unsigned int code_len = code_bytes;
296 unsigned char c;
297 u8 *ip;
298
Alexander van Heukelumca0a8162008-10-04 23:12:44 +0200299 printk(KERN_EMERG "Stack:\n");
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200300 show_stack_log_lvl(NULL, regs, (unsigned long *)sp,
Soeren Sandmann Pedersen9c0729d2010-11-05 05:59:39 -0400301 KERN_EMERG);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200302
303 printk(KERN_EMERG "Code: ");
304
305 ip = (u8 *)regs->ip - code_prologue;
306 if (ip < (u8 *)PAGE_OFFSET || probe_kernel_address(ip, c)) {
Alexander van Heukelum8a541662008-10-04 23:12:46 +0200307 /* try starting at IP */
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200308 ip = (u8 *)regs->ip;
309 code_len = code_len - code_prologue + 1;
310 }
311 for (i = 0; i < code_len; i++, ip++) {
312 if (ip < (u8 *)PAGE_OFFSET ||
313 probe_kernel_address(ip, c)) {
314 printk(" Bad RIP value.");
315 break;
316 }
317 if (ip == (u8 *)regs->ip)
318 printk("<%02x> ", c);
319 else
320 printk("%02x ", c);
321 }
322 }
323 printk("\n");
324}
325
326int is_valid_bugaddr(unsigned long ip)
327{
328 unsigned short ud2;
329
330 if (__copy_from_user(&ud2, (const void __user *) ip, sizeof(ud2)))
331 return 0;
332
333 return ud2 == 0x0b0f;
334}