blob: c08f32ab8acedb3055de253c731fb42620230d1b [file] [log] [blame]
Neil Horman878719e2008-10-23 10:40:06 -04001/*
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>
8#include <linux/utsname.h>
9#include <linux/hardirq.h>
10#include <linux/kdebug.h>
11#include <linux/module.h>
12#include <linux/ptrace.h>
Steven Rostedt712406a2009-02-09 10:54:03 -080013#include <linux/ftrace.h>
Neil Horman878719e2008-10-23 10:40:06 -040014#include <linux/kexec.h>
15#include <linux/bug.h>
16#include <linux/nmi.h>
17#include <linux/sysfs.h>
18
19#include <asm/stacktrace.h>
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050020#include <asm/unwind.h>
Neil Horman878719e2008-10-23 10:40:06 -040021
22int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -070023int panic_on_io_nmi;
Neil Horman878719e2008-10-23 10:40:06 -040024unsigned int code_bytes = 64;
25int kstack_depth_to_print = 3 * STACKSLOTS_PER_LINE;
26static int die_counter;
27
Josh Poimboeufcb76c932016-09-14 21:07:42 -050028bool in_task_stack(unsigned long *stack, struct task_struct *task,
29 struct stack_info *info)
30{
31 unsigned long *begin = task_stack_page(task);
32 unsigned long *end = task_stack_page(task) + THREAD_SIZE;
33
34 if (stack < begin || stack >= end)
35 return false;
36
37 info->type = STACK_TYPE_TASK;
38 info->begin = begin;
39 info->end = end;
40 info->next_sp = NULL;
41
42 return true;
43}
44
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010045static void printk_stack_address(unsigned long address, int reliable,
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050046 char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040047{
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050048 touch_nmi_watchdog();
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010049 printk("%s [<%p>] %s%pB\n",
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050050 log_lvl, (void *)address, reliable ? "" : "? ",
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010051 (void *)address);
Neil Horman878719e2008-10-23 10:40:06 -040052}
53
Jiri Slaby5f01c982013-10-25 15:06:58 +020054void printk_address(unsigned long address)
55{
56 pr_cont(" [<%p>] %pS\n", (void *)address, (void *)address);
57}
58
Neil Horman878719e2008-10-23 10:40:06 -040059/*
60 * x86-64 can have up to three kernel stacks:
61 * process stack
62 * interrupt stack
63 * severe exception (double fault, nmi, stack fault, debug, mce) hardware stack
64 */
65
Neil Horman878719e2008-10-23 10:40:06 -040066unsigned long
Linus Torvaldsda01e182016-06-23 12:20:01 -070067print_context_stack(struct task_struct *task,
Neil Horman878719e2008-10-23 10:40:06 -040068 unsigned long *stack, unsigned long bp,
69 const struct stacktrace_ops *ops, void *data,
Josh Poimboeufcb76c932016-09-14 21:07:42 -050070 struct stack_info *info, int *graph)
Neil Horman878719e2008-10-23 10:40:06 -040071{
72 struct stack_frame *frame = (struct stack_frame *)bp;
73
Andy Lutomirski9a2e9da2016-07-14 13:22:52 -070074 /*
75 * If we overflowed the stack into a guard page, jump back to the
76 * bottom of the usable stack.
77 */
78 if ((unsigned long)task_stack_page(task) - (unsigned long)stack <
79 PAGE_SIZE)
80 stack = (unsigned long *)task_stack_page(task);
81
Josh Poimboeufcb76c932016-09-14 21:07:42 -050082 while (on_stack(info, stack, sizeof(*stack))) {
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -050083 unsigned long addr = *stack;
Neil Horman878719e2008-10-23 10:40:06 -040084
Neil Horman878719e2008-10-23 10:40:06 -040085 if (__kernel_text_address(addr)) {
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -050086 unsigned long real_addr;
87 int reliable = 0;
88
Neil Horman878719e2008-10-23 10:40:06 -040089 if ((unsigned long) stack == bp + sizeof(long)) {
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -050090 reliable = 1;
Neil Horman878719e2008-10-23 10:40:06 -040091 frame = frame->next_frame;
92 bp = (unsigned long) frame;
Neil Horman878719e2008-10-23 10:40:06 -040093 }
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -050094
Josh Poimboeuf6f727b82016-08-19 06:53:01 -050095 /*
96 * When function graph tracing is enabled for a
97 * function, its return address on the stack is
98 * replaced with the address of an ftrace handler
99 * (return_to_handler). In that case, before printing
100 * the "real" address, we want to print the handler
101 * address as an "unreliable" hint that function graph
102 * tracing was involved.
103 */
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -0500104 real_addr = ftrace_graph_ret_addr(task, graph, addr,
105 stack);
106 if (real_addr != addr)
Josh Poimboeuf6f727b82016-08-19 06:53:01 -0500107 ops->address(data, addr, 0);
108
109 ops->address(data, real_addr, reliable);
Neil Horman878719e2008-10-23 10:40:06 -0400110 }
111 stack++;
112 }
113 return bp;
114}
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100115EXPORT_SYMBOL_GPL(print_context_stack);
116
117unsigned long
Linus Torvaldsda01e182016-06-23 12:20:01 -0700118print_context_stack_bp(struct task_struct *task,
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100119 unsigned long *stack, unsigned long bp,
120 const struct stacktrace_ops *ops, void *data,
Josh Poimboeufcb76c932016-09-14 21:07:42 -0500121 struct stack_info *info, int *graph)
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100122{
123 struct stack_frame *frame = (struct stack_frame *)bp;
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -0500124 unsigned long *retp = &frame->return_address;
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100125
Josh Poimboeufcb76c932016-09-14 21:07:42 -0500126 while (on_stack(info, stack, sizeof(*stack) * 2)) {
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -0500127 unsigned long addr = *retp;
128 unsigned long real_addr;
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100129
Frederic Weisbeckerc2c5d452009-12-31 03:52:25 +0100130 if (!__kernel_text_address(addr))
131 break;
132
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -0500133 real_addr = ftrace_graph_ret_addr(task, graph, addr, retp);
Josh Poimboeuf6f727b82016-08-19 06:53:01 -0500134 if (ops->address(data, real_addr, 1))
135 break;
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -0500136
Frederic Weisbeckerc2c5d452009-12-31 03:52:25 +0100137 frame = frame->next_frame;
Josh Poimboeuf408fe5d2016-08-19 06:52:59 -0500138 retp = &frame->return_address;
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100139 }
Frederic Weisbeckerc2c5d452009-12-31 03:52:25 +0100140
Frederic Weisbecker06d65bd2009-12-17 05:40:34 +0100141 return (unsigned long)frame;
142}
143EXPORT_SYMBOL_GPL(print_context_stack_bp);
Neil Horman878719e2008-10-23 10:40:06 -0400144
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500145void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
146 unsigned long *stack, char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -0400147{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500148 struct unwind_state state;
149 struct stack_info stack_info = {0};
150 unsigned long visit_mask = 0;
151 int graph_idx = 0;
Neil Horman878719e2008-10-23 10:40:06 -0400152
Neil Horman878719e2008-10-23 10:40:06 -0400153 printk("%sCall Trace:\n", log_lvl);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500154
155 unwind_start(&state, task, regs, stack);
156
157 /*
158 * Iterate through the stacks, starting with the current stack pointer.
159 * Each stack has a pointer to the next one.
160 *
161 * x86-64 can have several stacks:
162 * - task stack
163 * - interrupt stack
164 * - HW exception stacks (double fault, nmi, debug, mce)
165 *
166 * x86-32 can have up to three stacks:
167 * - task stack
168 * - softirq stack
169 * - hardirq stack
170 */
171 for (; stack; stack = stack_info.next_sp) {
172 const char *str_begin, *str_end;
173
174 /*
175 * If we overflowed the task stack into a guard page, jump back
176 * to the bottom of the usable stack.
177 */
178 if (task_stack_page(task) - (void *)stack < PAGE_SIZE)
179 stack = task_stack_page(task);
180
181 if (get_stack_info(stack, task, &stack_info, &visit_mask))
182 break;
183
184 stack_type_str(stack_info.type, &str_begin, &str_end);
185 if (str_begin)
186 printk("%s <%s> ", log_lvl, str_begin);
187
188 /*
189 * Scan the stack, printing any text addresses we find. At the
190 * same time, follow proper stack frames with the unwinder.
191 *
192 * Addresses found during the scan which are not reported by
193 * the unwinder are considered to be additional clues which are
194 * sometimes useful for debugging and are prefixed with '?'.
195 * This also serves as a failsafe option in case the unwinder
196 * goes off in the weeds.
197 */
198 for (; stack < stack_info.end; stack++) {
199 unsigned long real_addr;
200 int reliable = 0;
201 unsigned long addr = *stack;
202 unsigned long *ret_addr_p =
203 unwind_get_return_address_ptr(&state);
204
205 if (!__kernel_text_address(addr))
206 continue;
207
208 if (stack == ret_addr_p)
209 reliable = 1;
210
211 /*
212 * When function graph tracing is enabled for a
213 * function, its return address on the stack is
214 * replaced with the address of an ftrace handler
215 * (return_to_handler). In that case, before printing
216 * the "real" address, we want to print the handler
217 * address as an "unreliable" hint that function graph
218 * tracing was involved.
219 */
220 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
221 addr, stack);
222 if (real_addr != addr)
223 printk_stack_address(addr, 0, log_lvl);
224 printk_stack_address(real_addr, reliable, log_lvl);
225
226 if (!reliable)
227 continue;
228
229 /*
230 * Get the next frame from the unwinder. No need to
231 * check for an error: if anything goes wrong, the rest
232 * of the addresses will just be printed as unreliable.
233 */
234 unwind_next_frame(&state);
235 }
236
237 if (str_end)
238 printk("%s <%s> ", log_lvl, str_end);
239 }
Neil Horman878719e2008-10-23 10:40:06 -0400240}
241
Neil Horman878719e2008-10-23 10:40:06 -0400242void show_stack(struct task_struct *task, unsigned long *sp)
243{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500244 task = task ? : current;
245
Tejun Heoa77f2a42013-04-30 15:27:09 -0700246 /*
247 * Stack frames below this one aren't interesting. Don't show them
248 * if we're printing for %current.
249 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500250 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500251 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700252
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500253 show_stack_log_lvl(current, NULL, sp, "");
Neil Horman878719e2008-10-23 10:40:06 -0400254}
255
Borislav Petkov81c29492016-07-05 00:31:27 +0200256void show_stack_regs(struct pt_regs *regs)
257{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500258 show_stack_log_lvl(current, regs, NULL, "");
Borislav Petkov81c29492016-07-05 00:31:27 +0200259}
260
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100261static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400262static int die_owner = -1;
263static unsigned int die_nest_count;
264
Masami Hiramatsu93266382014-04-17 17:18:14 +0900265unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400266{
267 int cpu;
268 unsigned long flags;
269
Neil Horman878719e2008-10-23 10:40:06 -0400270 oops_enter();
271
272 /* racy, but better than risking deadlock. */
273 raw_local_irq_save(flags);
274 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100275 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400276 if (cpu == die_owner)
277 /* nested oops. should stop eventually */;
278 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100279 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400280 }
281 die_nest_count++;
282 die_owner = cpu;
283 console_verbose();
284 bust_spinlocks(1);
285 return flags;
286}
Huang Ying81e88fd2011-01-12 14:44:55 +0800287EXPORT_SYMBOL_GPL(oops_begin);
Masami Hiramatsu93266382014-04-17 17:18:14 +0900288NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400289
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700290void __noreturn rewind_stack_do_exit(int signr);
291
Masami Hiramatsu93266382014-04-17 17:18:14 +0900292void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400293{
294 if (regs && kexec_should_crash(current))
295 crash_kexec(regs);
296
297 bust_spinlocks(0);
298 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030299 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400300 die_nest_count--;
301 if (!die_nest_count)
302 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100303 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400304 raw_local_irq_restore(flags);
305 oops_exit();
306
307 if (!signr)
308 return;
309 if (in_interrupt())
310 panic("Fatal exception in interrupt");
311 if (panic_on_oops)
312 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700313
314 /*
315 * We're not going to return, but we might be on an IST stack or
316 * have very little stack space left. Rewind the stack and kill
317 * the task.
318 */
319 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400320}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900321NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400322
Masami Hiramatsu93266382014-04-17 17:18:14 +0900323int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400324{
325#ifdef CONFIG_X86_32
326 unsigned short ss;
327 unsigned long sp;
328#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500329 printk(KERN_DEFAULT
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100330 "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
331 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
332 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
333 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
334 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
335
Neil Horman878719e2008-10-23 10:40:06 -0400336 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530337 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400338 return 1;
339
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100340 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100341 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400342#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700343 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400344 sp = regs->sp;
345 ss = regs->ss & 0xffff;
H. Peter Anvina343c752009-10-12 14:11:09 -0700346 } else {
347 sp = kernel_stack_pointer(regs);
348 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400349 }
350 printk(KERN_EMERG "EIP: [<%08lx>] ", regs->ip);
351 print_symbol("%s", regs->ip);
352 printk(" SS:ESP %04x:%08lx\n", ss, sp);
353#else
354 /* Executive summary in case the oops scrolled away */
355 printk(KERN_ALERT "RIP ");
Jiri Slaby5f01c982013-10-25 15:06:58 +0200356 printk_address(regs->ip);
Neil Horman878719e2008-10-23 10:40:06 -0400357 printk(" RSP <%016lx>\n", regs->sp);
358#endif
359 return 0;
360}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900361NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400362
363/*
364 * This is gone through when something in the kernel has done something bad
365 * and is about to be terminated:
366 */
367void die(const char *str, struct pt_regs *regs, long err)
368{
369 unsigned long flags = oops_begin();
370 int sig = SIGSEGV;
371
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700372 if (!user_mode(regs))
Neil Horman878719e2008-10-23 10:40:06 -0400373 report_bug(regs->ip, regs);
374
375 if (__die(str, regs, err))
376 sig = 0;
377 oops_end(flags, regs, sig);
378}
379
Neil Horman878719e2008-10-23 10:40:06 -0400380static int __init kstack_setup(char *s)
381{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600382 ssize_t ret;
383 unsigned long val;
384
Neil Horman878719e2008-10-23 10:40:06 -0400385 if (!s)
386 return -EINVAL;
Shuah Khan363f7ce2012-05-06 11:58:04 -0600387
388 ret = kstrtoul(s, 0, &val);
389 if (ret)
390 return ret;
391 kstack_depth_to_print = val;
Neil Horman878719e2008-10-23 10:40:06 -0400392 return 0;
393}
394early_param("kstack", kstack_setup);
395
396static int __init code_bytes_setup(char *s)
397{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600398 ssize_t ret;
399 unsigned long val;
400
401 if (!s)
402 return -EINVAL;
403
404 ret = kstrtoul(s, 0, &val);
405 if (ret)
406 return ret;
407
408 code_bytes = val;
Neil Horman878719e2008-10-23 10:40:06 -0400409 if (code_bytes > 8192)
410 code_bytes = 8192;
411
412 return 1;
413}
414__setup("code_bytes=", code_bytes_setup);