blob: 499aa6f0fde53cd6551ab0380d5459fc849c403f [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;
Neil Horman878719e2008-10-23 10:40:06 -040025static int die_counter;
26
Josh Poimboeufcb76c932016-09-14 21:07:42 -050027bool in_task_stack(unsigned long *stack, struct task_struct *task,
28 struct stack_info *info)
29{
30 unsigned long *begin = task_stack_page(task);
31 unsigned long *end = task_stack_page(task) + THREAD_SIZE;
32
33 if (stack < begin || stack >= end)
34 return false;
35
36 info->type = STACK_TYPE_TASK;
37 info->begin = begin;
38 info->end = end;
39 info->next_sp = NULL;
40
41 return true;
42}
43
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010044static void printk_stack_address(unsigned long address, int reliable,
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050045 char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040046{
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050047 touch_nmi_watchdog();
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -050048 printk("%s %s%pB\n", log_lvl, reliable ? "" : "? ", (void *)address);
Jiri Slaby5f01c982013-10-25 15:06:58 +020049}
50
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050051void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
52 unsigned long *stack, char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040053{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050054 struct unwind_state state;
55 struct stack_info stack_info = {0};
56 unsigned long visit_mask = 0;
57 int graph_idx = 0;
Neil Horman878719e2008-10-23 10:40:06 -040058
Neil Horman878719e2008-10-23 10:40:06 -040059 printk("%sCall Trace:\n", log_lvl);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050060
61 unwind_start(&state, task, regs, stack);
62
63 /*
64 * Iterate through the stacks, starting with the current stack pointer.
65 * Each stack has a pointer to the next one.
66 *
67 * x86-64 can have several stacks:
68 * - task stack
69 * - interrupt stack
70 * - HW exception stacks (double fault, nmi, debug, mce)
71 *
72 * x86-32 can have up to three stacks:
73 * - task stack
74 * - softirq stack
75 * - hardirq stack
76 */
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -050077 for (regs = NULL; stack; stack = stack_info.next_sp) {
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050078 const char *str_begin, *str_end;
79
80 /*
81 * If we overflowed the task stack into a guard page, jump back
82 * to the bottom of the usable stack.
83 */
84 if (task_stack_page(task) - (void *)stack < PAGE_SIZE)
85 stack = task_stack_page(task);
86
87 if (get_stack_info(stack, task, &stack_info, &visit_mask))
88 break;
89
90 stack_type_str(stack_info.type, &str_begin, &str_end);
91 if (str_begin)
Josh Poimboeuf79439d8e2016-10-20 11:34:42 -050092 printk("%s <%s>\n", log_lvl, str_begin);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050093
94 /*
95 * Scan the stack, printing any text addresses we find. At the
96 * same time, follow proper stack frames with the unwinder.
97 *
98 * Addresses found during the scan which are not reported by
99 * the unwinder are considered to be additional clues which are
100 * sometimes useful for debugging and are prefixed with '?'.
101 * This also serves as a failsafe option in case the unwinder
102 * goes off in the weeds.
103 */
104 for (; stack < stack_info.end; stack++) {
105 unsigned long real_addr;
106 int reliable = 0;
107 unsigned long addr = *stack;
108 unsigned long *ret_addr_p =
109 unwind_get_return_address_ptr(&state);
110
111 if (!__kernel_text_address(addr))
112 continue;
113
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500114 /*
115 * Don't print regs->ip again if it was already printed
116 * by __show_regs() below.
117 */
118 if (regs && stack == &regs->ip) {
119 unwind_next_frame(&state);
120 continue;
121 }
122
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500123 if (stack == ret_addr_p)
124 reliable = 1;
125
126 /*
127 * When function graph tracing is enabled for a
128 * function, its return address on the stack is
129 * replaced with the address of an ftrace handler
130 * (return_to_handler). In that case, before printing
131 * the "real" address, we want to print the handler
132 * address as an "unreliable" hint that function graph
133 * tracing was involved.
134 */
135 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
136 addr, stack);
137 if (real_addr != addr)
138 printk_stack_address(addr, 0, log_lvl);
139 printk_stack_address(real_addr, reliable, log_lvl);
140
141 if (!reliable)
142 continue;
143
144 /*
145 * Get the next frame from the unwinder. No need to
146 * check for an error: if anything goes wrong, the rest
147 * of the addresses will just be printed as unreliable.
148 */
149 unwind_next_frame(&state);
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500150
151 /* if the frame has entry regs, print them */
152 regs = unwind_get_entry_regs(&state);
153 if (regs)
154 __show_regs(regs, 0);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500155 }
156
157 if (str_end)
Josh Poimboeuf79439d8e2016-10-20 11:34:42 -0500158 printk("%s <%s>\n", log_lvl, str_end);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500159 }
Neil Horman878719e2008-10-23 10:40:06 -0400160}
161
Neil Horman878719e2008-10-23 10:40:06 -0400162void show_stack(struct task_struct *task, unsigned long *sp)
163{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500164 task = task ? : current;
165
Tejun Heoa77f2a42013-04-30 15:27:09 -0700166 /*
167 * Stack frames below this one aren't interesting. Don't show them
168 * if we're printing for %current.
169 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500170 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500171 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700172
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500173 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
Neil Horman878719e2008-10-23 10:40:06 -0400174}
175
Borislav Petkov81c29492016-07-05 00:31:27 +0200176void show_stack_regs(struct pt_regs *regs)
177{
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500178 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
Borislav Petkov81c29492016-07-05 00:31:27 +0200179}
180
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100181static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400182static int die_owner = -1;
183static unsigned int die_nest_count;
184
Masami Hiramatsu93266382014-04-17 17:18:14 +0900185unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400186{
187 int cpu;
188 unsigned long flags;
189
Neil Horman878719e2008-10-23 10:40:06 -0400190 oops_enter();
191
192 /* racy, but better than risking deadlock. */
193 raw_local_irq_save(flags);
194 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100195 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400196 if (cpu == die_owner)
197 /* nested oops. should stop eventually */;
198 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100199 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400200 }
201 die_nest_count++;
202 die_owner = cpu;
203 console_verbose();
204 bust_spinlocks(1);
205 return flags;
206}
Huang Ying81e88fd2011-01-12 14:44:55 +0800207EXPORT_SYMBOL_GPL(oops_begin);
Masami Hiramatsu93266382014-04-17 17:18:14 +0900208NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400209
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700210void __noreturn rewind_stack_do_exit(int signr);
211
Masami Hiramatsu93266382014-04-17 17:18:14 +0900212void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400213{
214 if (regs && kexec_should_crash(current))
215 crash_kexec(regs);
216
217 bust_spinlocks(0);
218 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030219 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400220 die_nest_count--;
221 if (!die_nest_count)
222 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100223 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400224 raw_local_irq_restore(flags);
225 oops_exit();
226
227 if (!signr)
228 return;
229 if (in_interrupt())
230 panic("Fatal exception in interrupt");
231 if (panic_on_oops)
232 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700233
234 /*
235 * We're not going to return, but we might be on an IST stack or
236 * have very little stack space left. Rewind the stack and kill
237 * the task.
238 */
239 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400240}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900241NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400242
Masami Hiramatsu93266382014-04-17 17:18:14 +0900243int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400244{
245#ifdef CONFIG_X86_32
246 unsigned short ss;
247 unsigned long sp;
248#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500249 printk(KERN_DEFAULT
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100250 "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
251 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
252 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
253 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
254 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
255
Neil Horman878719e2008-10-23 10:40:06 -0400256 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530257 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400258 return 1;
259
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100260 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100261 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400262#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700263 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400264 sp = regs->sp;
265 ss = regs->ss & 0xffff;
H. Peter Anvina343c752009-10-12 14:11:09 -0700266 } else {
267 sp = kernel_stack_pointer(regs);
268 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400269 }
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500270 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
271 (void *)regs->ip, ss, sp);
Neil Horman878719e2008-10-23 10:40:06 -0400272#else
273 /* Executive summary in case the oops scrolled away */
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500274 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
Neil Horman878719e2008-10-23 10:40:06 -0400275#endif
276 return 0;
277}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900278NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400279
280/*
281 * This is gone through when something in the kernel has done something bad
282 * and is about to be terminated:
283 */
284void die(const char *str, struct pt_regs *regs, long err)
285{
286 unsigned long flags = oops_begin();
287 int sig = SIGSEGV;
288
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700289 if (!user_mode(regs))
Neil Horman878719e2008-10-23 10:40:06 -0400290 report_bug(regs->ip, regs);
291
292 if (__die(str, regs, err))
293 sig = 0;
294 oops_end(flags, regs, sig);
295}
296
Neil Horman878719e2008-10-23 10:40:06 -0400297static int __init code_bytes_setup(char *s)
298{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600299 ssize_t ret;
300 unsigned long val;
301
302 if (!s)
303 return -EINVAL;
304
305 ret = kstrtoul(s, 0, &val);
306 if (ret)
307 return ret;
308
309 code_bytes = val;
Neil Horman878719e2008-10-23 10:40:06 -0400310 if (code_bytes > 8192)
311 code_bytes = 8192;
312
313 return 1;
314}
315__setup("code_bytes=", code_bytes_setup);