blob: 0bc95be5c6385c11ad2e3d3013dd0fb9d7c0f08a [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
21#include <asm/stacktrace.h>
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050022#include <asm/unwind.h>
Neil Horman878719e2008-10-23 10:40:06 -040023
24int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -070025int panic_on_io_nmi;
Neil Horman878719e2008-10-23 10:40:06 -040026unsigned int code_bytes = 64;
Neil Horman878719e2008-10-23 10:40:06 -040027static int die_counter;
28
Josh Poimboeufcb76c932016-09-14 21:07:42 -050029bool in_task_stack(unsigned long *stack, struct task_struct *task,
30 struct stack_info *info)
31{
32 unsigned long *begin = task_stack_page(task);
33 unsigned long *end = task_stack_page(task) + THREAD_SIZE;
34
35 if (stack < begin || stack >= end)
36 return false;
37
38 info->type = STACK_TYPE_TASK;
39 info->begin = begin;
40 info->end = end;
41 info->next_sp = NULL;
42
43 return true;
44}
45
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010046static void printk_stack_address(unsigned long address, int reliable,
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050047 char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040048{
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050049 touch_nmi_watchdog();
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -050050 printk("%s %s%pB\n", log_lvl, reliable ? "" : "? ", (void *)address);
Jiri Slaby5f01c982013-10-25 15:06:58 +020051}
52
Josh Poimboeufb02fcf92017-12-04 15:07:09 +010053void show_iret_regs(struct pt_regs *regs)
54{
55 printk(KERN_DEFAULT "RIP: %04x:%pS\n", (int)regs->cs, (void *)regs->ip);
56 printk(KERN_DEFAULT "RSP: %04x:%016lx EFLAGS: %08lx", (int)regs->ss,
57 regs->sp, regs->flags);
58}
59
60static void show_regs_safe(struct stack_info *info, struct pt_regs *regs)
61{
62 if (on_stack(info, regs, sizeof(*regs)))
63 __show_regs(regs, 0);
64 else if (on_stack(info, (void *)regs + IRET_FRAME_OFFSET,
65 IRET_FRAME_SIZE)) {
66 /*
67 * When an interrupt or exception occurs in entry code, the
68 * full pt_regs might not have been saved yet. In that case
69 * just print the iret frame.
70 */
71 show_iret_regs(regs);
72 }
73}
74
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050075void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
76 unsigned long *stack, char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040077{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050078 struct unwind_state state;
79 struct stack_info stack_info = {0};
80 unsigned long visit_mask = 0;
81 int graph_idx = 0;
Neil Horman878719e2008-10-23 10:40:06 -040082
Neil Horman878719e2008-10-23 10:40:06 -040083 printk("%sCall Trace:\n", log_lvl);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050084
85 unwind_start(&state, task, regs, stack);
Josh Poimboeuff4474c92016-11-17 00:04:58 -060086 stack = stack ? : get_stack_pointer(task, regs);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050087
88 /*
89 * Iterate through the stacks, starting with the current stack pointer.
90 * Each stack has a pointer to the next one.
91 *
92 * x86-64 can have several stacks:
93 * - task stack
94 * - interrupt stack
95 * - HW exception stacks (double fault, nmi, debug, mce)
96 *
97 * x86-32 can have up to three stacks:
98 * - task stack
99 * - softirq stack
100 * - hardirq stack
101 */
Josh Poimboeufe335bb52017-04-17 08:44:00 -0500102 for (regs = NULL; stack; stack = PTR_ALIGN(stack_info.next_sp, sizeof(long))) {
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600103 const char *stack_name;
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500104
105 /*
106 * If we overflowed the task stack into a guard page, jump back
107 * to the bottom of the usable stack.
108 */
109 if (task_stack_page(task) - (void *)stack < PAGE_SIZE)
110 stack = task_stack_page(task);
111
112 if (get_stack_info(stack, task, &stack_info, &visit_mask))
113 break;
114
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600115 stack_name = stack_type_name(stack_info.type);
116 if (stack_name)
117 printk("%s <%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500118
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100119 if (regs)
120 show_regs_safe(&stack_info, regs);
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500121
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500122 /*
123 * Scan the stack, printing any text addresses we find. At the
124 * same time, follow proper stack frames with the unwinder.
125 *
126 * Addresses found during the scan which are not reported by
127 * the unwinder are considered to be additional clues which are
128 * sometimes useful for debugging and are prefixed with '?'.
129 * This also serves as a failsafe option in case the unwinder
130 * goes off in the weeds.
131 */
132 for (; stack < stack_info.end; stack++) {
133 unsigned long real_addr;
134 int reliable = 0;
Josh Poimboeuf91e08ab2016-11-17 09:57:24 -0600135 unsigned long addr = READ_ONCE_NOCHECK(*stack);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500136 unsigned long *ret_addr_p =
137 unwind_get_return_address_ptr(&state);
138
139 if (!__kernel_text_address(addr))
140 continue;
141
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500142 /*
143 * Don't print regs->ip again if it was already printed
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100144 * by show_regs_safe() below.
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500145 */
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500146 if (regs && stack == &regs->ip)
147 goto next;
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500148
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500149 if (stack == ret_addr_p)
150 reliable = 1;
151
152 /*
153 * When function graph tracing is enabled for a
154 * function, its return address on the stack is
155 * replaced with the address of an ftrace handler
156 * (return_to_handler). In that case, before printing
157 * the "real" address, we want to print the handler
158 * address as an "unreliable" hint that function graph
159 * tracing was involved.
160 */
161 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
162 addr, stack);
163 if (real_addr != addr)
164 printk_stack_address(addr, 0, log_lvl);
165 printk_stack_address(real_addr, reliable, log_lvl);
166
167 if (!reliable)
168 continue;
169
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500170next:
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500171 /*
172 * Get the next frame from the unwinder. No need to
173 * check for an error: if anything goes wrong, the rest
174 * of the addresses will just be printed as unreliable.
175 */
176 unwind_next_frame(&state);
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500177
178 /* if the frame has entry regs, print them */
179 regs = unwind_get_entry_regs(&state);
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100180 if (regs)
181 show_regs_safe(&stack_info, regs);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500182 }
183
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600184 if (stack_name)
185 printk("%s </%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500186 }
Neil Horman878719e2008-10-23 10:40:06 -0400187}
188
Neil Horman878719e2008-10-23 10:40:06 -0400189void show_stack(struct task_struct *task, unsigned long *sp)
190{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500191 task = task ? : current;
192
Tejun Heoa77f2a42013-04-30 15:27:09 -0700193 /*
194 * Stack frames below this one aren't interesting. Don't show them
195 * if we're printing for %current.
196 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500197 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500198 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700199
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500200 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
Neil Horman878719e2008-10-23 10:40:06 -0400201}
202
Borislav Petkov81c29492016-07-05 00:31:27 +0200203void show_stack_regs(struct pt_regs *regs)
204{
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500205 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
Borislav Petkov81c29492016-07-05 00:31:27 +0200206}
207
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100208static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400209static int die_owner = -1;
210static unsigned int die_nest_count;
211
Masami Hiramatsu93266382014-04-17 17:18:14 +0900212unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400213{
214 int cpu;
215 unsigned long flags;
216
Neil Horman878719e2008-10-23 10:40:06 -0400217 oops_enter();
218
219 /* racy, but better than risking deadlock. */
220 raw_local_irq_save(flags);
221 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100222 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400223 if (cpu == die_owner)
224 /* nested oops. should stop eventually */;
225 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100226 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400227 }
228 die_nest_count++;
229 die_owner = cpu;
230 console_verbose();
231 bust_spinlocks(1);
232 return flags;
233}
Huang Ying81e88fd2011-01-12 14:44:55 +0800234EXPORT_SYMBOL_GPL(oops_begin);
Masami Hiramatsu93266382014-04-17 17:18:14 +0900235NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400236
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700237void __noreturn rewind_stack_do_exit(int signr);
238
Masami Hiramatsu93266382014-04-17 17:18:14 +0900239void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400240{
241 if (regs && kexec_should_crash(current))
242 crash_kexec(regs);
243
244 bust_spinlocks(0);
245 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030246 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400247 die_nest_count--;
248 if (!die_nest_count)
249 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100250 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400251 raw_local_irq_restore(flags);
252 oops_exit();
253
254 if (!signr)
255 return;
256 if (in_interrupt())
257 panic("Fatal exception in interrupt");
258 if (panic_on_oops)
259 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700260
261 /*
262 * We're not going to return, but we might be on an IST stack or
263 * have very little stack space left. Rewind the stack and kill
264 * the task.
265 */
266 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400267}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900268NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400269
Masami Hiramatsu93266382014-04-17 17:18:14 +0900270int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400271{
272#ifdef CONFIG_X86_32
273 unsigned short ss;
274 unsigned long sp;
275#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500276 printk(KERN_DEFAULT
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100277 "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
278 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
279 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
280 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
281 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
282
Neil Horman878719e2008-10-23 10:40:06 -0400283 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530284 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400285 return 1;
286
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100287 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100288 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400289#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700290 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400291 sp = regs->sp;
Andy Lutomirski99504812017-07-28 06:00:32 -0700292 ss = regs->ss;
H. Peter Anvina343c752009-10-12 14:11:09 -0700293 } else {
294 sp = kernel_stack_pointer(regs);
295 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400296 }
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500297 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
298 (void *)regs->ip, ss, sp);
Neil Horman878719e2008-10-23 10:40:06 -0400299#else
300 /* Executive summary in case the oops scrolled away */
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500301 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
Neil Horman878719e2008-10-23 10:40:06 -0400302#endif
303 return 0;
304}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900305NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400306
307/*
308 * This is gone through when something in the kernel has done something bad
309 * and is about to be terminated:
310 */
311void die(const char *str, struct pt_regs *regs, long err)
312{
313 unsigned long flags = oops_begin();
314 int sig = SIGSEGV;
315
Neil Horman878719e2008-10-23 10:40:06 -0400316 if (__die(str, regs, err))
317 sig = 0;
318 oops_end(flags, regs, sig);
319}
320
Neil Horman878719e2008-10-23 10:40:06 -0400321static int __init code_bytes_setup(char *s)
322{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600323 ssize_t ret;
324 unsigned long val;
325
326 if (!s)
327 return -EINVAL;
328
329 ret = kstrtoul(s, 0, &val);
330 if (ret)
331 return ret;
332
333 code_bytes = val;
Neil Horman878719e2008-10-23 10:40:06 -0400334 if (code_bytes > 8192)
335 code_bytes = 8192;
336
337 return 1;
338}
339__setup("code_bytes=", code_bytes_setup);