blob: 5fa110699ed275fe81dc9d8f678a2a2f8902017e [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>
Ingo Molnarb17b0152017-02-08 18:51:35 +010013#include <linux/sched/debug.h>
Ingo Molnar68db0cf2017-02-08 18:51:37 +010014#include <linux/sched/task_stack.h>
Steven Rostedt712406a2009-02-09 10:54:03 -080015#include <linux/ftrace.h>
Neil Horman878719e2008-10-23 10:40:06 -040016#include <linux/kexec.h>
17#include <linux/bug.h>
18#include <linux/nmi.h>
19#include <linux/sysfs.h>
20
Thomas Gleixner92a0f812017-12-20 18:51:31 +010021#include <asm/cpu_entry_area.h>
Neil Horman878719e2008-10-23 10:40:06 -040022#include <asm/stacktrace.h>
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050023#include <asm/unwind.h>
Neil Horman878719e2008-10-23 10:40:06 -040024
25int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -070026int panic_on_io_nmi;
Neil Horman878719e2008-10-23 10:40:06 -040027unsigned int code_bytes = 64;
Neil Horman878719e2008-10-23 10:40:06 -040028static int die_counter;
29
Josh Poimboeufcb76c932016-09-14 21:07:42 -050030bool in_task_stack(unsigned long *stack, struct task_struct *task,
31 struct stack_info *info)
32{
33 unsigned long *begin = task_stack_page(task);
34 unsigned long *end = task_stack_page(task) + THREAD_SIZE;
35
36 if (stack < begin || stack >= end)
37 return false;
38
39 info->type = STACK_TYPE_TASK;
40 info->begin = begin;
41 info->end = end;
42 info->next_sp = NULL;
43
44 return true;
45}
46
Dave Hansen4fe2d8b2017-12-04 17:25:07 -080047bool in_entry_stack(unsigned long *stack, struct stack_info *info)
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010048{
Dave Hansen4fe2d8b2017-12-04 17:25:07 -080049 struct entry_stack *ss = cpu_entry_stack(smp_processor_id());
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010050
Andy Lutomirski0f9a4812017-12-04 15:07:28 +010051 void *begin = ss;
52 void *end = ss + 1;
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010053
54 if ((void *)stack < begin || (void *)stack >= end)
55 return false;
56
Dave Hansen4fe2d8b2017-12-04 17:25:07 -080057 info->type = STACK_TYPE_ENTRY;
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010058 info->begin = begin;
59 info->end = end;
60 info->next_sp = NULL;
61
62 return true;
63}
64
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010065static void printk_stack_address(unsigned long address, int reliable,
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050066 char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040067{
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050068 touch_nmi_watchdog();
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -050069 printk("%s %s%pB\n", log_lvl, reliable ? "" : "? ", (void *)address);
Jiri Slaby5f01c982013-10-25 15:06:58 +020070}
71
Josh Poimboeufb02fcf92017-12-04 15:07:09 +010072void show_iret_regs(struct pt_regs *regs)
73{
74 printk(KERN_DEFAULT "RIP: %04x:%pS\n", (int)regs->cs, (void *)regs->ip);
75 printk(KERN_DEFAULT "RSP: %04x:%016lx EFLAGS: %08lx", (int)regs->ss,
76 regs->sp, regs->flags);
77}
78
79static void show_regs_safe(struct stack_info *info, struct pt_regs *regs)
80{
81 if (on_stack(info, regs, sizeof(*regs)))
82 __show_regs(regs, 0);
83 else if (on_stack(info, (void *)regs + IRET_FRAME_OFFSET,
84 IRET_FRAME_SIZE)) {
85 /*
86 * When an interrupt or exception occurs in entry code, the
87 * full pt_regs might not have been saved yet. In that case
88 * just print the iret frame.
89 */
90 show_iret_regs(regs);
91 }
92}
93
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050094void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
95 unsigned long *stack, char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040096{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050097 struct unwind_state state;
98 struct stack_info stack_info = {0};
99 unsigned long visit_mask = 0;
100 int graph_idx = 0;
Neil Horman878719e2008-10-23 10:40:06 -0400101
Neil Horman878719e2008-10-23 10:40:06 -0400102 printk("%sCall Trace:\n", log_lvl);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500103
104 unwind_start(&state, task, regs, stack);
Josh Poimboeuff4474c92016-11-17 00:04:58 -0600105 stack = stack ? : get_stack_pointer(task, regs);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500106
107 /*
108 * Iterate through the stacks, starting with the current stack pointer.
109 * Each stack has a pointer to the next one.
110 *
111 * x86-64 can have several stacks:
112 * - task stack
113 * - interrupt stack
114 * - HW exception stacks (double fault, nmi, debug, mce)
Dave Hansen4fe2d8b2017-12-04 17:25:07 -0800115 * - entry stack
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500116 *
Andy Lutomirski6e60e582017-12-04 15:07:18 +0100117 * x86-32 can have up to four stacks:
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500118 * - task stack
119 * - softirq stack
120 * - hardirq stack
Dave Hansen4fe2d8b2017-12-04 17:25:07 -0800121 * - entry stack
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500122 */
Josh Poimboeufe335bb52017-04-17 08:44:00 -0500123 for (regs = NULL; stack; stack = PTR_ALIGN(stack_info.next_sp, sizeof(long))) {
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600124 const char *stack_name;
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500125
Andy Lutomirski6e60e582017-12-04 15:07:18 +0100126 if (get_stack_info(stack, task, &stack_info, &visit_mask)) {
127 /*
128 * We weren't on a valid stack. It's possible that
129 * we overflowed a valid stack into a guard page.
130 * See if the next page up is valid so that we can
131 * generate some kind of backtrace if this happens.
132 */
133 stack = (unsigned long *)PAGE_ALIGN((unsigned long)stack);
134 if (get_stack_info(stack, task, &stack_info, &visit_mask))
135 break;
136 }
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500137
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600138 stack_name = stack_type_name(stack_info.type);
139 if (stack_name)
140 printk("%s <%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500141
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100142 if (regs)
143 show_regs_safe(&stack_info, regs);
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500144
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500145 /*
146 * Scan the stack, printing any text addresses we find. At the
147 * same time, follow proper stack frames with the unwinder.
148 *
149 * Addresses found during the scan which are not reported by
150 * the unwinder are considered to be additional clues which are
151 * sometimes useful for debugging and are prefixed with '?'.
152 * This also serves as a failsafe option in case the unwinder
153 * goes off in the weeds.
154 */
155 for (; stack < stack_info.end; stack++) {
156 unsigned long real_addr;
157 int reliable = 0;
Josh Poimboeuf91e08ab2016-11-17 09:57:24 -0600158 unsigned long addr = READ_ONCE_NOCHECK(*stack);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500159 unsigned long *ret_addr_p =
160 unwind_get_return_address_ptr(&state);
161
162 if (!__kernel_text_address(addr))
163 continue;
164
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500165 /*
166 * Don't print regs->ip again if it was already printed
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100167 * by show_regs_safe() below.
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500168 */
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500169 if (regs && stack == &regs->ip)
170 goto next;
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500171
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500172 if (stack == ret_addr_p)
173 reliable = 1;
174
175 /*
176 * When function graph tracing is enabled for a
177 * function, its return address on the stack is
178 * replaced with the address of an ftrace handler
179 * (return_to_handler). In that case, before printing
180 * the "real" address, we want to print the handler
181 * address as an "unreliable" hint that function graph
182 * tracing was involved.
183 */
184 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
185 addr, stack);
186 if (real_addr != addr)
187 printk_stack_address(addr, 0, log_lvl);
188 printk_stack_address(real_addr, reliable, log_lvl);
189
190 if (!reliable)
191 continue;
192
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500193next:
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500194 /*
195 * Get the next frame from the unwinder. No need to
196 * check for an error: if anything goes wrong, the rest
197 * of the addresses will just be printed as unreliable.
198 */
199 unwind_next_frame(&state);
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500200
201 /* if the frame has entry regs, print them */
202 regs = unwind_get_entry_regs(&state);
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100203 if (regs)
204 show_regs_safe(&stack_info, regs);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500205 }
206
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600207 if (stack_name)
208 printk("%s </%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500209 }
Neil Horman878719e2008-10-23 10:40:06 -0400210}
211
Neil Horman878719e2008-10-23 10:40:06 -0400212void show_stack(struct task_struct *task, unsigned long *sp)
213{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500214 task = task ? : current;
215
Tejun Heoa77f2a42013-04-30 15:27:09 -0700216 /*
217 * Stack frames below this one aren't interesting. Don't show them
218 * if we're printing for %current.
219 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500220 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500221 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700222
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500223 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
Neil Horman878719e2008-10-23 10:40:06 -0400224}
225
Borislav Petkov81c29492016-07-05 00:31:27 +0200226void show_stack_regs(struct pt_regs *regs)
227{
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500228 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
Borislav Petkov81c29492016-07-05 00:31:27 +0200229}
230
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100231static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400232static int die_owner = -1;
233static unsigned int die_nest_count;
234
Masami Hiramatsu93266382014-04-17 17:18:14 +0900235unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400236{
237 int cpu;
238 unsigned long flags;
239
Neil Horman878719e2008-10-23 10:40:06 -0400240 oops_enter();
241
242 /* racy, but better than risking deadlock. */
243 raw_local_irq_save(flags);
244 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100245 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400246 if (cpu == die_owner)
247 /* nested oops. should stop eventually */;
248 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100249 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400250 }
251 die_nest_count++;
252 die_owner = cpu;
253 console_verbose();
254 bust_spinlocks(1);
255 return flags;
256}
Huang Ying81e88fd2011-01-12 14:44:55 +0800257EXPORT_SYMBOL_GPL(oops_begin);
Masami Hiramatsu93266382014-04-17 17:18:14 +0900258NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400259
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700260void __noreturn rewind_stack_do_exit(int signr);
261
Masami Hiramatsu93266382014-04-17 17:18:14 +0900262void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400263{
264 if (regs && kexec_should_crash(current))
265 crash_kexec(regs);
266
267 bust_spinlocks(0);
268 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030269 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400270 die_nest_count--;
271 if (!die_nest_count)
272 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100273 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400274 raw_local_irq_restore(flags);
275 oops_exit();
276
277 if (!signr)
278 return;
279 if (in_interrupt())
280 panic("Fatal exception in interrupt");
281 if (panic_on_oops)
282 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700283
284 /*
285 * We're not going to return, but we might be on an IST stack or
286 * have very little stack space left. Rewind the stack and kill
287 * the task.
288 */
289 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400290}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900291NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400292
Masami Hiramatsu93266382014-04-17 17:18:14 +0900293int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400294{
295#ifdef CONFIG_X86_32
296 unsigned short ss;
297 unsigned long sp;
298#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500299 printk(KERN_DEFAULT
Vlastimil Babka5f26d762017-12-19 22:33:46 +0100300 "%s: %04lx [#%d]%s%s%s%s%s\n", str, err & 0xffff, ++die_counter,
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100301 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
302 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
303 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
Vlastimil Babka5f26d762017-12-19 22:33:46 +0100304 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "",
305 IS_ENABLED(CONFIG_PAGE_TABLE_ISOLATION) ?
306 (boot_cpu_has(X86_FEATURE_PTI) ? " PTI" : " NOPTI") : "");
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100307
Neil Horman878719e2008-10-23 10:40:06 -0400308 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530309 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400310 return 1;
311
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100312 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100313 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400314#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700315 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400316 sp = regs->sp;
Andy Lutomirski99504812017-07-28 06:00:32 -0700317 ss = regs->ss;
H. Peter Anvina343c752009-10-12 14:11:09 -0700318 } else {
319 sp = kernel_stack_pointer(regs);
320 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400321 }
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500322 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
323 (void *)regs->ip, ss, sp);
Neil Horman878719e2008-10-23 10:40:06 -0400324#else
325 /* Executive summary in case the oops scrolled away */
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500326 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
Neil Horman878719e2008-10-23 10:40:06 -0400327#endif
328 return 0;
329}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900330NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400331
332/*
333 * This is gone through when something in the kernel has done something bad
334 * and is about to be terminated:
335 */
336void die(const char *str, struct pt_regs *regs, long err)
337{
338 unsigned long flags = oops_begin();
339 int sig = SIGSEGV;
340
Neil Horman878719e2008-10-23 10:40:06 -0400341 if (__die(str, regs, err))
342 sig = 0;
343 oops_end(flags, regs, sig);
344}
345
Neil Horman878719e2008-10-23 10:40:06 -0400346static int __init code_bytes_setup(char *s)
347{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600348 ssize_t ret;
349 unsigned long val;
350
351 if (!s)
352 return -EINVAL;
353
354 ret = kstrtoul(s, 0, &val);
355 if (ret)
356 return ret;
357
358 code_bytes = val;
Neil Horman878719e2008-10-23 10:40:06 -0400359 if (code_bytes > 8192)
360 code_bytes = 8192;
361
362 return 1;
363}
364__setup("code_bytes=", code_bytes_setup);