blob: a33a1373a2522fbfe4fcfba9afe6c38f585c7d58 [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
Andy Lutomirski33a2f1a2017-12-04 15:07:13 +010046bool in_sysenter_stack(unsigned long *stack, struct stack_info *info)
47{
48 struct tss_struct *tss = this_cpu_ptr(&cpu_tss);
49
50 /* Treat the canary as part of the stack for unwinding purposes. */
51 void *begin = &tss->SYSENTER_stack_canary;
52 void *end = (void *)&tss->SYSENTER_stack + sizeof(tss->SYSENTER_stack);
53
54 if ((void *)stack < begin || (void *)stack >= end)
55 return false;
56
57 info->type = STACK_TYPE_SYSENTER;
58 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)
115 *
116 * x86-32 can have up to three stacks:
117 * - task stack
118 * - softirq stack
119 * - hardirq stack
120 */
Josh Poimboeufe335bb52017-04-17 08:44:00 -0500121 for (regs = NULL; stack; stack = PTR_ALIGN(stack_info.next_sp, sizeof(long))) {
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600122 const char *stack_name;
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500123
124 /*
125 * If we overflowed the task stack into a guard page, jump back
126 * to the bottom of the usable stack.
127 */
128 if (task_stack_page(task) - (void *)stack < PAGE_SIZE)
129 stack = task_stack_page(task);
130
131 if (get_stack_info(stack, task, &stack_info, &visit_mask))
132 break;
133
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600134 stack_name = stack_type_name(stack_info.type);
135 if (stack_name)
136 printk("%s <%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500137
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100138 if (regs)
139 show_regs_safe(&stack_info, regs);
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500140
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500141 /*
142 * Scan the stack, printing any text addresses we find. At the
143 * same time, follow proper stack frames with the unwinder.
144 *
145 * Addresses found during the scan which are not reported by
146 * the unwinder are considered to be additional clues which are
147 * sometimes useful for debugging and are prefixed with '?'.
148 * This also serves as a failsafe option in case the unwinder
149 * goes off in the weeds.
150 */
151 for (; stack < stack_info.end; stack++) {
152 unsigned long real_addr;
153 int reliable = 0;
Josh Poimboeuf91e08ab2016-11-17 09:57:24 -0600154 unsigned long addr = READ_ONCE_NOCHECK(*stack);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500155 unsigned long *ret_addr_p =
156 unwind_get_return_address_ptr(&state);
157
158 if (!__kernel_text_address(addr))
159 continue;
160
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500161 /*
162 * Don't print regs->ip again if it was already printed
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100163 * by show_regs_safe() below.
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500164 */
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500165 if (regs && stack == &regs->ip)
166 goto next;
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500167
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500168 if (stack == ret_addr_p)
169 reliable = 1;
170
171 /*
172 * When function graph tracing is enabled for a
173 * function, its return address on the stack is
174 * replaced with the address of an ftrace handler
175 * (return_to_handler). In that case, before printing
176 * the "real" address, we want to print the handler
177 * address as an "unreliable" hint that function graph
178 * tracing was involved.
179 */
180 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
181 addr, stack);
182 if (real_addr != addr)
183 printk_stack_address(addr, 0, log_lvl);
184 printk_stack_address(real_addr, reliable, log_lvl);
185
186 if (!reliable)
187 continue;
188
Josh Poimboeufb0529be2017-07-11 10:33:40 -0500189next:
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500190 /*
191 * Get the next frame from the unwinder. No need to
192 * check for an error: if anything goes wrong, the rest
193 * of the addresses will just be printed as unreliable.
194 */
195 unwind_next_frame(&state);
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500196
197 /* if the frame has entry regs, print them */
198 regs = unwind_get_entry_regs(&state);
Josh Poimboeufb02fcf92017-12-04 15:07:09 +0100199 if (regs)
200 show_regs_safe(&stack_info, regs);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500201 }
202
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600203 if (stack_name)
204 printk("%s </%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500205 }
Neil Horman878719e2008-10-23 10:40:06 -0400206}
207
Neil Horman878719e2008-10-23 10:40:06 -0400208void show_stack(struct task_struct *task, unsigned long *sp)
209{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500210 task = task ? : current;
211
Tejun Heoa77f2a42013-04-30 15:27:09 -0700212 /*
213 * Stack frames below this one aren't interesting. Don't show them
214 * if we're printing for %current.
215 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500216 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500217 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700218
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500219 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
Neil Horman878719e2008-10-23 10:40:06 -0400220}
221
Borislav Petkov81c29492016-07-05 00:31:27 +0200222void show_stack_regs(struct pt_regs *regs)
223{
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500224 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
Borislav Petkov81c29492016-07-05 00:31:27 +0200225}
226
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100227static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400228static int die_owner = -1;
229static unsigned int die_nest_count;
230
Masami Hiramatsu93266382014-04-17 17:18:14 +0900231unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400232{
233 int cpu;
234 unsigned long flags;
235
Neil Horman878719e2008-10-23 10:40:06 -0400236 oops_enter();
237
238 /* racy, but better than risking deadlock. */
239 raw_local_irq_save(flags);
240 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100241 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400242 if (cpu == die_owner)
243 /* nested oops. should stop eventually */;
244 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100245 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400246 }
247 die_nest_count++;
248 die_owner = cpu;
249 console_verbose();
250 bust_spinlocks(1);
251 return flags;
252}
Huang Ying81e88fd2011-01-12 14:44:55 +0800253EXPORT_SYMBOL_GPL(oops_begin);
Masami Hiramatsu93266382014-04-17 17:18:14 +0900254NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400255
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700256void __noreturn rewind_stack_do_exit(int signr);
257
Masami Hiramatsu93266382014-04-17 17:18:14 +0900258void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400259{
260 if (regs && kexec_should_crash(current))
261 crash_kexec(regs);
262
263 bust_spinlocks(0);
264 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030265 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400266 die_nest_count--;
267 if (!die_nest_count)
268 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100269 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400270 raw_local_irq_restore(flags);
271 oops_exit();
272
273 if (!signr)
274 return;
275 if (in_interrupt())
276 panic("Fatal exception in interrupt");
277 if (panic_on_oops)
278 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700279
280 /*
281 * We're not going to return, but we might be on an IST stack or
282 * have very little stack space left. Rewind the stack and kill
283 * the task.
284 */
285 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400286}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900287NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400288
Masami Hiramatsu93266382014-04-17 17:18:14 +0900289int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400290{
291#ifdef CONFIG_X86_32
292 unsigned short ss;
293 unsigned long sp;
294#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500295 printk(KERN_DEFAULT
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100296 "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
297 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
298 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
299 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
300 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
301
Neil Horman878719e2008-10-23 10:40:06 -0400302 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530303 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400304 return 1;
305
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100306 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100307 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400308#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700309 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400310 sp = regs->sp;
Andy Lutomirski99504812017-07-28 06:00:32 -0700311 ss = regs->ss;
H. Peter Anvina343c752009-10-12 14:11:09 -0700312 } else {
313 sp = kernel_stack_pointer(regs);
314 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400315 }
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500316 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
317 (void *)regs->ip, ss, sp);
Neil Horman878719e2008-10-23 10:40:06 -0400318#else
319 /* Executive summary in case the oops scrolled away */
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500320 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
Neil Horman878719e2008-10-23 10:40:06 -0400321#endif
322 return 0;
323}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900324NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400325
326/*
327 * This is gone through when something in the kernel has done something bad
328 * and is about to be terminated:
329 */
330void die(const char *str, struct pt_regs *regs, long err)
331{
332 unsigned long flags = oops_begin();
333 int sig = SIGSEGV;
334
Neil Horman878719e2008-10-23 10:40:06 -0400335 if (__die(str, regs, err))
336 sig = 0;
337 oops_end(flags, regs, sig);
338}
339
Neil Horman878719e2008-10-23 10:40:06 -0400340static int __init code_bytes_setup(char *s)
341{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600342 ssize_t ret;
343 unsigned long val;
344
345 if (!s)
346 return -EINVAL;
347
348 ret = kstrtoul(s, 0, &val);
349 if (ret)
350 return ret;
351
352 code_bytes = val;
Neil Horman878719e2008-10-23 10:40:06 -0400353 if (code_bytes > 8192)
354 code_bytes = 8192;
355
356 return 1;
357}
358__setup("code_bytes=", code_bytes_setup);