blob: 907a90e2901c61105788b9fd22ad3524545a1746 [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
Neil Horman878719e2008-10-23 10:40:06 -040019#include "dumpstack.h"
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020020
Ingo Molnarb8030902009-11-26 08:17:31 +010021#define N_EXCEPTION_STACKS_END \
22 (N_EXCEPTION_STACKS + DEBUG_STKSZ/EXCEPTION_STKSZ - 2)
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020023
24static char x86_stack_ids[][8] = {
Ingo Molnarb8030902009-11-26 08:17:31 +010025 [ DEBUG_STACK-1 ] = "#DB",
26 [ NMI_STACK-1 ] = "NMI",
27 [ DOUBLEFAULT_STACK-1 ] = "#DF",
28 [ STACKFAULT_STACK-1 ] = "#SS",
29 [ MCE_STACK-1 ] = "#MC",
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020030#if DEBUG_STKSZ > EXCEPTION_STKSZ
Ingo Molnarb8030902009-11-26 08:17:31 +010031 [ N_EXCEPTION_STACKS ...
32 N_EXCEPTION_STACKS_END ] = "#DB[?]"
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020033#endif
Ingo Molnarb8030902009-11-26 08:17:31 +010034};
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020035
36int x86_is_stack_id(int id, char *name)
37{
38 return x86_stack_ids[id - 1] == name;
39}
40
41static unsigned long *in_exception_stack(unsigned cpu, unsigned long stack,
Ingo Molnarb8030902009-11-26 08:17:31 +010042 unsigned *usedp, char **idp)
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020043{
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020044 unsigned k;
45
46 /*
47 * Iterate over all exception stacks, and figure out whether
48 * 'stack' is in one of them:
49 */
50 for (k = 0; k < N_EXCEPTION_STACKS; k++) {
51 unsigned long end = per_cpu(orig_ist, cpu).ist[k];
52 /*
53 * Is 'stack' above this exception frame's end?
54 * If yes then skip to the next frame.
55 */
56 if (stack >= end)
57 continue;
58 /*
59 * Is 'stack' above this exception frame's start address?
60 * If yes then we found the right frame.
61 */
62 if (stack >= end - EXCEPTION_STKSZ) {
63 /*
64 * Make sure we only iterate through an exception
65 * stack once. If it comes up for the second time
66 * then there's something wrong going on - just
67 * break out and return NULL:
68 */
69 if (*usedp & (1U << k))
70 break;
71 *usedp |= 1U << k;
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020072 *idp = x86_stack_ids[k];
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020073 return (unsigned long *)end;
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 (k == DEBUG_STACK - 1 && stack >= end - DEBUG_STKSZ) {
82 unsigned j = N_EXCEPTION_STACKS - 1;
83
84 /*
85 * Black magic. A large debug stack is composed of
86 * multiple exception stack entries, which we
87 * iterate through now. Dont look:
88 */
89 do {
90 ++j;
91 end -= EXCEPTION_STKSZ;
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020092 x86_stack_ids[j][4] = '1' +
93 (j - N_EXCEPTION_STACKS);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020094 } while (stack < end - EXCEPTION_STKSZ);
95 if (*usedp & (1U << j))
96 break;
97 *usedp |= 1U << j;
Frederic Weisbecker0406ca62009-07-01 21:02:09 +020098 *idp = x86_stack_ids[j];
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +020099 return (unsigned long *)end;
100 }
101#endif
102 }
103 return NULL;
104}
105
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100106static inline int
107in_irq_stack(unsigned long *stack, unsigned long *irq_stack,
108 unsigned long *irq_stack_end)
109{
110 return (stack >= irq_stack && stack < irq_stack_end);
111}
112
113/*
114 * We are returning from the irq stack and go to the previous one.
115 * If the previous stack is also in the irq stack, then bp in the first
116 * frame of the irq stack points to the previous, interrupted one.
117 * Otherwise we have another level of indirection: We first save
118 * the bp of the previous stack, then we switch the stack to the irq one
119 * and save a new bp that links to the previous one.
120 * (See save_args())
121 */
122static inline unsigned long
123fixup_bp_irq_link(unsigned long bp, unsigned long *stack,
124 unsigned long *irq_stack, unsigned long *irq_stack_end)
125{
126#ifdef CONFIG_FRAME_POINTER
127 struct stack_frame *frame = (struct stack_frame *)bp;
128
129 if (!in_irq_stack(stack, irq_stack, irq_stack_end))
130 return (unsigned long)frame->next_frame;
131#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
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200142void dump_trace(struct task_struct *task, struct pt_regs *regs,
143 unsigned long *stack, unsigned long bp,
144 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;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200152
153 if (!task)
154 task = current;
155
156 if (!stack) {
157 unsigned long dummy;
158 stack = &dummy;
159 if (task && task != current)
160 stack = (unsigned long *)task->thread.sp;
161 }
162
163#ifdef CONFIG_FRAME_POINTER
164 if (!bp) {
165 if (task == current) {
166 /* Grab bp right from our regs */
Alexander van Heukelum8a541662008-10-04 23:12:46 +0200167 get_bp(bp);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200168 } else {
169 /* bp is the last reg pushed by switch_to */
170 bp = *(unsigned long *) task->thread.sp;
171 }
172 }
173#endif
174
175 /*
176 * Print function call entries in all stacks, starting at the
177 * current stack address. If the stacks consist of nested
178 * exceptions
179 */
180 tinfo = task_thread_info(task);
181 for (;;) {
182 char *id;
183 unsigned long *estack_end;
184 estack_end = in_exception_stack(cpu, (unsigned long)stack,
185 &used, &id);
186
187 if (estack_end) {
188 if (ops->stack(data, id) < 0)
189 break;
190
Frederic Weisbecker61c19172009-12-17 05:40:33 +0100191 bp = ops->walk_stack(tinfo, stack, bp, ops,
192 data, estack_end, &graph);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200193 ops->stack(data, "<EOE>");
194 /*
195 * We link to the next stack via the
196 * second-to-last pointer (index -2 to end) in the
197 * exception stack:
198 */
199 stack = (unsigned long *) estack_end[-2];
200 continue;
201 }
Brian Gerst26f80bd2009-01-19 00:38:58 +0900202 if (irq_stack_end) {
203 unsigned long *irq_stack;
204 irq_stack = irq_stack_end -
205 (IRQ_STACK_SIZE - 64) / sizeof(*irq_stack);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200206
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100207 if (in_irq_stack(stack, irq_stack, irq_stack_end)) {
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200208 if (ops->stack(data, "IRQ") < 0)
209 break;
210 bp = print_context_stack(tinfo, stack, bp,
Brian Gerst26f80bd2009-01-19 00:38:58 +0900211 ops, data, irq_stack_end, &graph);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200212 /*
213 * We link to the next stack (which would be
214 * the process stack normally) the last
215 * pointer (index -1 to end) in the IRQ stack:
216 */
Brian Gerst26f80bd2009-01-19 00:38:58 +0900217 stack = (unsigned long *) (irq_stack_end[-1]);
Frederic Weisbeckeraf2d8282009-12-06 05:34:27 +0100218 bp = fixup_bp_irq_link(bp, stack, irq_stack,
219 irq_stack_end);
Brian Gerst26f80bd2009-01-19 00:38:58 +0900220 irq_stack_end = NULL;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200221 ops->stack(data, "EOI");
222 continue;
223 }
224 }
225 break;
226 }
227
228 /*
229 * This handles the process stack:
230 */
Steven Rostedt7ee991f2008-12-02 23:50:04 -0500231 bp = print_context_stack(tinfo, stack, bp, ops, data, NULL, &graph);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200232 put_cpu();
233}
234EXPORT_SYMBOL(dump_trace);
235
Neil Horman878719e2008-10-23 10:40:06 -0400236void
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200237show_stack_log_lvl(struct task_struct *task, struct pt_regs *regs,
Ingo Molnarb8030902009-11-26 08:17:31 +0100238 unsigned long *sp, unsigned long bp, char *log_lvl)
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200239{
Ingo Molnar67f2de02009-11-26 08:29:10 +0100240 unsigned long *irq_stack_end;
241 unsigned long *irq_stack;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200242 unsigned long *stack;
Ingo Molnar67f2de02009-11-26 08:29:10 +0100243 int cpu;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200244 int i;
Ingo Molnar67f2de02009-11-26 08:29:10 +0100245
246 preempt_disable();
247 cpu = smp_processor_id();
248
249 irq_stack_end = (unsigned long *)(per_cpu(irq_stack_ptr, cpu));
250 irq_stack = (unsigned long *)(per_cpu(irq_stack_ptr, cpu) - IRQ_STACK_SIZE);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200251
252 /*
Ingo Molnar67f2de02009-11-26 08:29:10 +0100253 * Debugging aid: "show_stack(NULL, NULL);" prints the
254 * back trace for this cpu:
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200255 */
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200256 if (sp == NULL) {
257 if (task)
258 sp = (unsigned long *)task->thread.sp;
259 else
260 sp = (unsigned long *)&sp;
261 }
262
263 stack = sp;
264 for (i = 0; i < kstack_depth_to_print; i++) {
Brian Gerst26f80bd2009-01-19 00:38:58 +0900265 if (stack >= irq_stack && stack <= irq_stack_end) {
266 if (stack == irq_stack_end) {
267 stack = (unsigned long *) (irq_stack_end[-1]);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200268 printk(" <EOI> ");
269 }
270 } else {
271 if (((long) stack & (THREAD_SIZE-1)) == 0)
272 break;
273 }
Alexander van Heukelum8a541662008-10-04 23:12:46 +0200274 if (i && ((i % STACKSLOTS_PER_LINE) == 0))
Alexander van Heukelumca0a8162008-10-04 23:12:44 +0200275 printk("\n%s", log_lvl);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200276 printk(" %016lx", *stack++);
277 touch_nmi_watchdog();
278 }
Ingo Molnar67f2de02009-11-26 08:29:10 +0100279 preempt_enable();
280
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200281 printk("\n");
282 show_trace_log_lvl(task, regs, sp, bp, log_lvl);
283}
284
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200285void show_registers(struct pt_regs *regs)
286{
287 int i;
288 unsigned long sp;
289 const int cpu = smp_processor_id();
Brian Gerstc6f5e0a2009-01-19 00:38:58 +0900290 struct task_struct *cur = current;
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200291
292 sp = regs->sp;
293 printk("CPU %d ", cpu);
Alexey Dobriyanf266d7f2010-02-03 21:21:32 +0200294 print_modules();
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200295 __show_regs(regs, 1);
296 printk("Process %s (pid: %d, threadinfo %p, task %p)\n",
297 cur->comm, cur->pid, task_thread_info(cur), cur);
298
299 /*
300 * When in-kernel, we also print out the stack and code at the
301 * time of the fault..
302 */
303 if (!user_mode(regs)) {
304 unsigned int code_prologue = code_bytes * 43 / 64;
305 unsigned int code_len = code_bytes;
306 unsigned char c;
307 u8 *ip;
308
Alexander van Heukelumca0a8162008-10-04 23:12:44 +0200309 printk(KERN_EMERG "Stack:\n");
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200310 show_stack_log_lvl(NULL, regs, (unsigned long *)sp,
Alexander van Heukelumca0a8162008-10-04 23:12:44 +0200311 regs->bp, KERN_EMERG);
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200312
313 printk(KERN_EMERG "Code: ");
314
315 ip = (u8 *)regs->ip - code_prologue;
316 if (ip < (u8 *)PAGE_OFFSET || probe_kernel_address(ip, c)) {
Alexander van Heukelum8a541662008-10-04 23:12:46 +0200317 /* try starting at IP */
Alexander van Heukelum6fcbede2008-09-30 13:12:15 +0200318 ip = (u8 *)regs->ip;
319 code_len = code_len - code_prologue + 1;
320 }
321 for (i = 0; i < code_len; i++, ip++) {
322 if (ip < (u8 *)PAGE_OFFSET ||
323 probe_kernel_address(ip, c)) {
324 printk(" Bad RIP value.");
325 break;
326 }
327 if (ip == (u8 *)regs->ip)
328 printk("<%02x> ", c);
329 else
330 printk("%02x ", c);
331 }
332 }
333 printk("\n");
334}
335
336int is_valid_bugaddr(unsigned long ip)
337{
338 unsigned short ud2;
339
340 if (__copy_from_user(&ud2, (const void __user *) ip, sizeof(ud2)))
341 return 0;
342
343 return ud2 == 0x0b0f;
344}