blob: 579455c2b91eb2591c8a9aec64f9b64088528e2c [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
Borislav Petkov5d12f042018-04-17 18:11:16 +020025#define OPCODE_BUFSIZE 64
26
Neil Horman878719e2008-10-23 10:40:06 -040027int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -070028int panic_on_io_nmi;
Neil Horman878719e2008-10-23 10:40:06 -040029static int die_counter;
30
Josh Poimboeufcb76c932016-09-14 21:07:42 -050031bool in_task_stack(unsigned long *stack, struct task_struct *task,
32 struct stack_info *info)
33{
34 unsigned long *begin = task_stack_page(task);
35 unsigned long *end = task_stack_page(task) + THREAD_SIZE;
36
37 if (stack < begin || stack >= end)
38 return false;
39
40 info->type = STACK_TYPE_TASK;
41 info->begin = begin;
42 info->end = end;
43 info->next_sp = NULL;
44
45 return true;
46}
47
Dave Hansen4fe2d8b2017-12-04 17:25:07 -080048bool in_entry_stack(unsigned long *stack, struct stack_info *info)
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010049{
Dave Hansen4fe2d8b2017-12-04 17:25:07 -080050 struct entry_stack *ss = cpu_entry_stack(smp_processor_id());
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010051
Andy Lutomirski0f9a4812017-12-04 15:07:28 +010052 void *begin = ss;
53 void *end = ss + 1;
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010054
55 if ((void *)stack < begin || (void *)stack >= end)
56 return false;
57
Dave Hansen4fe2d8b2017-12-04 17:25:07 -080058 info->type = STACK_TYPE_ENTRY;
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010059 info->begin = begin;
60 info->end = end;
61 info->next_sp = NULL;
62
63 return true;
64}
65
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010066static void printk_stack_address(unsigned long address, int reliable,
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050067 char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040068{
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050069 touch_nmi_watchdog();
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -050070 printk("%s %s%pB\n", log_lvl, reliable ? "" : "? ", (void *)address);
Jiri Slaby5f01c982013-10-25 15:06:58 +020071}
72
Josh Poimboeufb02fcf92017-12-04 15:07:09 +010073void show_iret_regs(struct pt_regs *regs)
74{
75 printk(KERN_DEFAULT "RIP: %04x:%pS\n", (int)regs->cs, (void *)regs->ip);
76 printk(KERN_DEFAULT "RSP: %04x:%016lx EFLAGS: %08lx", (int)regs->ss,
77 regs->sp, regs->flags);
78}
79
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -060080static void show_regs_if_on_stack(struct stack_info *info, struct pt_regs *regs,
81 bool partial)
Josh Poimboeufb02fcf92017-12-04 15:07:09 +010082{
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -060083 /*
84 * These on_stack() checks aren't strictly necessary: the unwind code
85 * has already validated the 'regs' pointer. The checks are done for
86 * ordering reasons: if the registers are on the next stack, we don't
87 * want to print them out yet. Otherwise they'll be shown as part of
88 * the wrong stack. Later, when show_trace_log_lvl() switches to the
89 * next stack, this function will be called again with the same regs so
90 * they can be printed in the right context.
91 */
92 if (!partial && on_stack(info, regs, sizeof(*regs))) {
Josh Poimboeufb02fcf92017-12-04 15:07:09 +010093 __show_regs(regs, 0);
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -060094
95 } else if (partial && on_stack(info, (void *)regs + IRET_FRAME_OFFSET,
96 IRET_FRAME_SIZE)) {
Josh Poimboeufb02fcf92017-12-04 15:07:09 +010097 /*
98 * When an interrupt or exception occurs in entry code, the
99 * full pt_regs might not have been saved yet. In that case
100 * just print the iret frame.
101 */
102 show_iret_regs(regs);
103 }
104}
105
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500106void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
107 unsigned long *stack, char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -0400108{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500109 struct unwind_state state;
110 struct stack_info stack_info = {0};
111 unsigned long visit_mask = 0;
112 int graph_idx = 0;
Arnd Bergmannebfc1502018-02-02 15:56:17 +0100113 bool partial = false;
Neil Horman878719e2008-10-23 10:40:06 -0400114
Neil Horman878719e2008-10-23 10:40:06 -0400115 printk("%sCall Trace:\n", log_lvl);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500116
117 unwind_start(&state, task, regs, stack);
Josh Poimboeuff4474c92016-11-17 00:04:58 -0600118 stack = stack ? : get_stack_pointer(task, regs);
Josh Poimboeuf3ffdeb12017-12-31 10:18:07 -0600119 regs = unwind_get_entry_regs(&state, &partial);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500120
121 /*
122 * Iterate through the stacks, starting with the current stack pointer.
123 * Each stack has a pointer to the next one.
124 *
125 * x86-64 can have several stacks:
126 * - task stack
127 * - interrupt stack
128 * - HW exception stacks (double fault, nmi, debug, mce)
Dave Hansen4fe2d8b2017-12-04 17:25:07 -0800129 * - entry stack
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500130 *
Andy Lutomirski6e60e582017-12-04 15:07:18 +0100131 * x86-32 can have up to four stacks:
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500132 * - task stack
133 * - softirq stack
134 * - hardirq stack
Dave Hansen4fe2d8b2017-12-04 17:25:07 -0800135 * - entry stack
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500136 */
Josh Poimboeuf3ffdeb12017-12-31 10:18:07 -0600137 for ( ; stack; stack = PTR_ALIGN(stack_info.next_sp, sizeof(long))) {
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600138 const char *stack_name;
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500139
Andy Lutomirski6e60e582017-12-04 15:07:18 +0100140 if (get_stack_info(stack, task, &stack_info, &visit_mask)) {
141 /*
142 * We weren't on a valid stack. It's possible that
143 * we overflowed a valid stack into a guard page.
144 * See if the next page up is valid so that we can
145 * generate some kind of backtrace if this happens.
146 */
147 stack = (unsigned long *)PAGE_ALIGN((unsigned long)stack);
148 if (get_stack_info(stack, task, &stack_info, &visit_mask))
149 break;
150 }
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500151
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600152 stack_name = stack_type_name(stack_info.type);
153 if (stack_name)
154 printk("%s <%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500155
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100156 if (regs)
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -0600157 show_regs_if_on_stack(&stack_info, regs, partial);
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500158
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500159 /*
160 * Scan the stack, printing any text addresses we find. At the
161 * same time, follow proper stack frames with the unwinder.
162 *
163 * Addresses found during the scan which are not reported by
164 * the unwinder are considered to be additional clues which are
165 * sometimes useful for debugging and are prefixed with '?'.
166 * This also serves as a failsafe option in case the unwinder
167 * goes off in the weeds.
168 */
169 for (; stack < stack_info.end; stack++) {
170 unsigned long real_addr;
171 int reliable = 0;
Josh Poimboeuf91e08ab2016-11-17 09:57:24 -0600172 unsigned long addr = READ_ONCE_NOCHECK(*stack);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500173 unsigned long *ret_addr_p =
174 unwind_get_return_address_ptr(&state);
175
176 if (!__kernel_text_address(addr))
177 continue;
178
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500179 /*
180 * Don't print regs->ip again if it was already printed
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -0600181 * by show_regs_if_on_stack().
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500182 */
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500183 if (regs && stack == &regs->ip)
184 goto next;
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500185
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500186 if (stack == ret_addr_p)
187 reliable = 1;
188
189 /*
190 * When function graph tracing is enabled for a
191 * function, its return address on the stack is
192 * replaced with the address of an ftrace handler
193 * (return_to_handler). In that case, before printing
194 * the "real" address, we want to print the handler
195 * address as an "unreliable" hint that function graph
196 * tracing was involved.
197 */
198 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
199 addr, stack);
200 if (real_addr != addr)
201 printk_stack_address(addr, 0, log_lvl);
202 printk_stack_address(real_addr, reliable, log_lvl);
203
204 if (!reliable)
205 continue;
206
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500207next:
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500208 /*
209 * Get the next frame from the unwinder. No need to
210 * check for an error: if anything goes wrong, the rest
211 * of the addresses will just be printed as unreliable.
212 */
213 unwind_next_frame(&state);
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500214
215 /* if the frame has entry regs, print them */
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -0600216 regs = unwind_get_entry_regs(&state, &partial);
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100217 if (regs)
Josh Poimboeufa9cdbe72017-12-31 10:18:06 -0600218 show_regs_if_on_stack(&stack_info, regs, partial);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500219 }
220
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600221 if (stack_name)
222 printk("%s </%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500223 }
Neil Horman878719e2008-10-23 10:40:06 -0400224}
225
Neil Horman878719e2008-10-23 10:40:06 -0400226void show_stack(struct task_struct *task, unsigned long *sp)
227{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500228 task = task ? : current;
229
Tejun Heoa77f2a42013-04-30 15:27:09 -0700230 /*
231 * Stack frames below this one aren't interesting. Don't show them
232 * if we're printing for %current.
233 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500234 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500235 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700236
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500237 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
Neil Horman878719e2008-10-23 10:40:06 -0400238}
239
Borislav Petkov81c29492016-07-05 00:31:27 +0200240void show_stack_regs(struct pt_regs *regs)
241{
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500242 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
Borislav Petkov81c29492016-07-05 00:31:27 +0200243}
244
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100245static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400246static int die_owner = -1;
247static unsigned int die_nest_count;
248
Masami Hiramatsu93266382014-04-17 17:18:14 +0900249unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400250{
251 int cpu;
252 unsigned long flags;
253
Neil Horman878719e2008-10-23 10:40:06 -0400254 oops_enter();
255
256 /* racy, but better than risking deadlock. */
257 raw_local_irq_save(flags);
258 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100259 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400260 if (cpu == die_owner)
261 /* nested oops. should stop eventually */;
262 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100263 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400264 }
265 die_nest_count++;
266 die_owner = cpu;
267 console_verbose();
268 bust_spinlocks(1);
269 return flags;
270}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900271NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400272
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700273void __noreturn rewind_stack_do_exit(int signr);
274
Masami Hiramatsu93266382014-04-17 17:18:14 +0900275void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400276{
277 if (regs && kexec_should_crash(current))
278 crash_kexec(regs);
279
280 bust_spinlocks(0);
281 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030282 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400283 die_nest_count--;
284 if (!die_nest_count)
285 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100286 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400287 raw_local_irq_restore(flags);
288 oops_exit();
289
290 if (!signr)
291 return;
292 if (in_interrupt())
293 panic("Fatal exception in interrupt");
294 if (panic_on_oops)
295 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700296
297 /*
298 * We're not going to return, but we might be on an IST stack or
299 * have very little stack space left. Rewind the stack and kill
300 * the task.
301 */
302 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400303}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900304NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400305
Masami Hiramatsu93266382014-04-17 17:18:14 +0900306int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400307{
308#ifdef CONFIG_X86_32
309 unsigned short ss;
310 unsigned long sp;
311#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500312 printk(KERN_DEFAULT
Vlastimil Babka5f26d762017-12-19 22:33:46 +0100313 "%s: %04lx [#%d]%s%s%s%s%s\n", str, err & 0xffff, ++die_counter,
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100314 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
315 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
316 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
Vlastimil Babka5f26d762017-12-19 22:33:46 +0100317 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "",
318 IS_ENABLED(CONFIG_PAGE_TABLE_ISOLATION) ?
319 (boot_cpu_has(X86_FEATURE_PTI) ? " PTI" : " NOPTI") : "");
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100320
Neil Horman878719e2008-10-23 10:40:06 -0400321 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530322 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400323 return 1;
324
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100325 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100326 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400327#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700328 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400329 sp = regs->sp;
Andy Lutomirski99504812017-07-28 06:00:32 -0700330 ss = regs->ss;
H. Peter Anvina343c752009-10-12 14:11:09 -0700331 } else {
332 sp = kernel_stack_pointer(regs);
333 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400334 }
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500335 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
336 (void *)regs->ip, ss, sp);
Neil Horman878719e2008-10-23 10:40:06 -0400337#else
338 /* Executive summary in case the oops scrolled away */
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500339 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
Neil Horman878719e2008-10-23 10:40:06 -0400340#endif
341 return 0;
342}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900343NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400344
345/*
346 * This is gone through when something in the kernel has done something bad
347 * and is about to be terminated:
348 */
349void die(const char *str, struct pt_regs *regs, long err)
350{
351 unsigned long flags = oops_begin();
352 int sig = SIGSEGV;
353
Neil Horman878719e2008-10-23 10:40:06 -0400354 if (__die(str, regs, err))
355 sig = 0;
356 oops_end(flags, regs, sig);
357}
358
Borislav Petkov16d1cb02018-03-06 10:49:14 +0100359void show_regs(struct pt_regs *regs)
360{
361 bool all = true;
362 int i;
363
364 show_regs_print_info(KERN_DEFAULT);
365
366 if (IS_ENABLED(CONFIG_X86_32))
367 all = !user_mode(regs);
368
369 __show_regs(regs, all);
370
371 /*
372 * When in-kernel, we also print out the stack and code at the
373 * time of the fault..
374 */
375 if (!user_mode(regs)) {
Borislav Petkov5d12f042018-04-17 18:11:16 +0200376 unsigned int code_prologue = OPCODE_BUFSIZE * 43 / 64;
377 unsigned int code_len = OPCODE_BUFSIZE;
Borislav Petkov16d1cb02018-03-06 10:49:14 +0100378 unsigned char c;
379 u8 *ip;
380
381 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
382
383 printk(KERN_DEFAULT "Code: ");
384
385 ip = (u8 *)regs->ip - code_prologue;
386 if (ip < (u8 *)PAGE_OFFSET || probe_kernel_address(ip, c)) {
387 /* try starting at IP */
388 ip = (u8 *)regs->ip;
389 code_len = code_len - code_prologue + 1;
390 }
391 for (i = 0; i < code_len; i++, ip++) {
392 if (ip < (u8 *)PAGE_OFFSET ||
393 probe_kernel_address(ip, c)) {
394 pr_cont(" Bad RIP value.");
395 break;
396 }
397 if (ip == (u8 *)regs->ip)
398 pr_cont("<%02x> ", c);
399 else
400 pr_cont("%02x ", c);
401 }
402 }
403 pr_cont("\n");
404}