2 * Copyright (C) 1991, 1992 Linus Torvalds
3 * Copyright (C) 2000, 2001, 2002 Andi Kleen, SuSE Labs
5 #include <linux/kallsyms.h>
6 #include <linux/kprobes.h>
7 #include <linux/uaccess.h>
8 #include <linux/hardirq.h>
9 #include <linux/kdebug.h>
10 #include <linux/export.h>
11 #include <linux/ptrace.h>
12 #include <linux/kexec.h>
13 #include <linux/sysfs.h>
14 #include <linux/bug.h>
15 #include <linux/nmi.h>
17 #include <asm/stacktrace.h>
19 static char *exception_stack_names[N_EXCEPTION_STACKS] = {
20 [ DOUBLEFAULT_STACK-1 ] = "#DF",
21 [ NMI_STACK-1 ] = "NMI",
22 [ DEBUG_STACK-1 ] = "#DB",
23 [ MCE_STACK-1 ] = "#MC",
26 static unsigned long exception_stack_sizes[N_EXCEPTION_STACKS] = {
27 [0 ... N_EXCEPTION_STACKS - 1] = EXCEPTION_STKSZ,
28 [DEBUG_STACK - 1] = DEBUG_STKSZ
31 void stack_type_str(enum stack_type type, const char **begin, const char **end)
33 BUILD_BUG_ON(N_EXCEPTION_STACKS != 4);
40 case STACK_TYPE_EXCEPTION ... STACK_TYPE_EXCEPTION_LAST:
41 *begin = exception_stack_names[type - STACK_TYPE_EXCEPTION];
50 static bool in_exception_stack(unsigned long *stack, struct stack_info *info,
51 unsigned long *visit_mask)
53 unsigned long *begin, *end;
57 BUILD_BUG_ON(N_EXCEPTION_STACKS != 4);
59 for (k = 0; k < N_EXCEPTION_STACKS; k++) {
60 end = (unsigned long *)raw_cpu_ptr(&orig_ist)->ist[k];
61 begin = end - (exception_stack_sizes[k] / sizeof(long));
62 regs = (struct pt_regs *)end - 1;
64 if (stack < begin || stack >= end)
68 * Make sure we don't iterate through an exception stack more
69 * than once. If it comes up a second time then there's
70 * something wrong going on - just break out and report an
73 if (*visit_mask & (1U << k))
75 *visit_mask |= 1U << k;
77 info->type = STACK_TYPE_EXCEPTION + k;
80 info->next_sp = (unsigned long *)regs->sp;
88 static bool in_irq_stack(unsigned long *stack, struct stack_info *info)
90 unsigned long *end = (unsigned long *)this_cpu_read(irq_stack_ptr);
91 unsigned long *begin = end - (IRQ_STACK_SIZE / sizeof(long));
94 * This is a software stack, so 'end' can be a valid stack pointer.
95 * It just means the stack is empty.
97 if (stack < begin || stack > end)
100 info->type = STACK_TYPE_IRQ;
105 * The next stack pointer is the first thing pushed by the entry code
106 * after switching to the irq stack.
108 info->next_sp = (unsigned long *)*(end - 1);
113 int get_stack_info(unsigned long *stack, struct task_struct *task,
114 struct stack_info *info, unsigned long *visit_mask)
119 task = task ? : current;
121 if (in_task_stack(stack, task, info))
127 if (in_exception_stack(stack, info, visit_mask))
130 if (in_irq_stack(stack, info))
136 info->type = STACK_TYPE_UNKNOWN;
141 * x86-64 can have up to three kernel stacks:
144 * severe exception (double fault, nmi, stack fault, debug, mce) hardware stack
147 void dump_trace(struct task_struct *task, struct pt_regs *regs,
148 unsigned long *stack, unsigned long bp,
149 const struct stacktrace_ops *ops, void *data)
151 unsigned long visit_mask = 0;
152 struct stack_info info;
156 task = task ? : current;
157 stack = stack ? : get_stack_pointer(task, regs);
158 bp = bp ? : (unsigned long)get_frame_pointer(task, regs);
161 * Print function call entries in all stacks, starting at the
162 * current stack address. If the stacks consist of nested
166 const char *begin_str, *end_str;
168 get_stack_info(stack, task, &info, &visit_mask);
170 /* Default finish unless specified to continue */
175 /* Break out early if we are on the thread stack */
176 case STACK_TYPE_TASK:
180 case STACK_TYPE_EXCEPTION ... STACK_TYPE_EXCEPTION_LAST:
182 stack_type_str(info.type, &begin_str, &end_str);
184 if (ops->stack(data, begin_str) < 0)
187 bp = ops->walk_stack(task, stack, bp, ops,
188 data, &info, &graph);
190 ops->stack(data, end_str);
192 stack = info.next_sp;
197 ops->stack(data, "UNK");
203 * This handles the process stack:
205 bp = ops->walk_stack(task, stack, bp, ops, data, &info, &graph);
207 EXPORT_SYMBOL(dump_trace);
210 show_stack_log_lvl(struct task_struct *task, struct pt_regs *regs,
211 unsigned long *sp, unsigned long bp, char *log_lvl)
213 unsigned long *irq_stack_end;
214 unsigned long *irq_stack;
215 unsigned long *stack;
218 irq_stack_end = (unsigned long *)this_cpu_read(irq_stack_ptr);
219 irq_stack = irq_stack_end - (IRQ_STACK_SIZE / sizeof(long));
221 sp = sp ? : get_stack_pointer(task, regs);
224 for (i = 0; i < kstack_depth_to_print; i++) {
227 if (stack >= irq_stack && stack <= irq_stack_end) {
228 if (stack == irq_stack_end) {
229 stack = (unsigned long *) (irq_stack_end[-1]);
233 if (kstack_end(stack))
237 if (probe_kernel_address(stack, word))
240 if ((i % STACKSLOTS_PER_LINE) == 0) {
243 printk("%s %016lx", log_lvl, word);
245 pr_cont(" %016lx", word);
248 touch_nmi_watchdog();
252 show_trace_log_lvl(task, regs, sp, bp, log_lvl);
255 void show_regs(struct pt_regs *regs)
259 show_regs_print_info(KERN_DEFAULT);
260 __show_regs(regs, 1);
263 * When in-kernel, we also print out the stack and code at the
264 * time of the fault..
266 if (!user_mode(regs)) {
267 unsigned int code_prologue = code_bytes * 43 / 64;
268 unsigned int code_len = code_bytes;
272 printk(KERN_DEFAULT "Stack:\n");
273 show_stack_log_lvl(NULL, regs, NULL, 0, KERN_DEFAULT);
275 printk(KERN_DEFAULT "Code: ");
277 ip = (u8 *)regs->ip - code_prologue;
278 if (ip < (u8 *)PAGE_OFFSET || probe_kernel_address(ip, c)) {
279 /* try starting at IP */
281 code_len = code_len - code_prologue + 1;
283 for (i = 0; i < code_len; i++, ip++) {
284 if (ip < (u8 *)PAGE_OFFSET ||
285 probe_kernel_address(ip, c)) {
286 pr_cont(" Bad RIP value.");
289 if (ip == (u8 *)regs->ip)
290 pr_cont("<%02x> ", c);
298 int is_valid_bugaddr(unsigned long ip)
302 if (__copy_from_user(&ud2, (const void __user *) ip, sizeof(ud2)))
305 return ud2 == 0x0b0f;