blob: 7b9e7e68f316c231f1570a641015599fc54b368e [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>
Steven Rostedt712406a2009-02-09 10:54:03 -080014#include <linux/ftrace.h>
Neil Horman878719e2008-10-23 10:40:06 -040015#include <linux/kexec.h>
16#include <linux/bug.h>
17#include <linux/nmi.h>
18#include <linux/sysfs.h>
19
20#include <asm/stacktrace.h>
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050021#include <asm/unwind.h>
Neil Horman878719e2008-10-23 10:40:06 -040022
23int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -070024int panic_on_io_nmi;
Neil Horman878719e2008-10-23 10:40:06 -040025unsigned int code_bytes = 64;
Neil Horman878719e2008-10-23 10:40:06 -040026static int die_counter;
27
Josh Poimboeufcb76c932016-09-14 21:07:42 -050028bool in_task_stack(unsigned long *stack, struct task_struct *task,
29 struct stack_info *info)
30{
31 unsigned long *begin = task_stack_page(task);
32 unsigned long *end = task_stack_page(task) + THREAD_SIZE;
33
34 if (stack < begin || stack >= end)
35 return false;
36
37 info->type = STACK_TYPE_TASK;
38 info->begin = begin;
39 info->end = end;
40 info->next_sp = NULL;
41
42 return true;
43}
44
Adrien Schildknecht1fc7f612015-02-20 03:34:21 +010045static void printk_stack_address(unsigned long address, int reliable,
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050046 char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040047{
Josh Poimboeufd438f5f2016-08-24 11:50:16 -050048 touch_nmi_watchdog();
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -050049 printk("%s %s%pB\n", log_lvl, reliable ? "" : "? ", (void *)address);
Jiri Slaby5f01c982013-10-25 15:06:58 +020050}
51
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050052void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
53 unsigned long *stack, char *log_lvl)
Neil Horman878719e2008-10-23 10:40:06 -040054{
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050055 struct unwind_state state;
56 struct stack_info stack_info = {0};
57 unsigned long visit_mask = 0;
58 int graph_idx = 0;
Neil Horman878719e2008-10-23 10:40:06 -040059
Neil Horman878719e2008-10-23 10:40:06 -040060 printk("%sCall Trace:\n", log_lvl);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050061
62 unwind_start(&state, task, regs, stack);
Josh Poimboeuff4474c92016-11-17 00:04:58 -060063 stack = stack ? : get_stack_pointer(task, regs);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050064
65 /*
66 * Iterate through the stacks, starting with the current stack pointer.
67 * Each stack has a pointer to the next one.
68 *
69 * x86-64 can have several stacks:
70 * - task stack
71 * - interrupt stack
72 * - HW exception stacks (double fault, nmi, debug, mce)
73 *
74 * x86-32 can have up to three stacks:
75 * - task stack
76 * - softirq stack
77 * - hardirq stack
78 */
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -050079 for (regs = NULL; stack; stack = stack_info.next_sp) {
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -060080 const char *stack_name;
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050081
82 /*
83 * If we overflowed the task stack into a guard page, jump back
84 * to the bottom of the usable stack.
85 */
86 if (task_stack_page(task) - (void *)stack < PAGE_SIZE)
87 stack = task_stack_page(task);
88
89 if (get_stack_info(stack, task, &stack_info, &visit_mask))
90 break;
91
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -060092 stack_name = stack_type_name(stack_info.type);
93 if (stack_name)
94 printk("%s <%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -050095
96 /*
97 * Scan the stack, printing any text addresses we find. At the
98 * same time, follow proper stack frames with the unwinder.
99 *
100 * Addresses found during the scan which are not reported by
101 * the unwinder are considered to be additional clues which are
102 * sometimes useful for debugging and are prefixed with '?'.
103 * This also serves as a failsafe option in case the unwinder
104 * goes off in the weeds.
105 */
106 for (; stack < stack_info.end; stack++) {
107 unsigned long real_addr;
108 int reliable = 0;
Josh Poimboeuf91e08ab2016-11-17 09:57:24 -0600109 unsigned long addr = READ_ONCE_NOCHECK(*stack);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500110 unsigned long *ret_addr_p =
111 unwind_get_return_address_ptr(&state);
112
113 if (!__kernel_text_address(addr))
114 continue;
115
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500116 /*
117 * Don't print regs->ip again if it was already printed
118 * by __show_regs() below.
119 */
120 if (regs && stack == &regs->ip) {
121 unwind_next_frame(&state);
122 continue;
123 }
124
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500125 if (stack == ret_addr_p)
126 reliable = 1;
127
128 /*
129 * When function graph tracing is enabled for a
130 * function, its return address on the stack is
131 * replaced with the address of an ftrace handler
132 * (return_to_handler). In that case, before printing
133 * the "real" address, we want to print the handler
134 * address as an "unreliable" hint that function graph
135 * tracing was involved.
136 */
137 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
138 addr, stack);
139 if (real_addr != addr)
140 printk_stack_address(addr, 0, log_lvl);
141 printk_stack_address(real_addr, reliable, log_lvl);
142
143 if (!reliable)
144 continue;
145
146 /*
147 * Get the next frame from the unwinder. No need to
148 * check for an error: if anything goes wrong, the rest
149 * of the addresses will just be printed as unreliable.
150 */
151 unwind_next_frame(&state);
Josh Poimboeuf3b3fa112016-10-20 11:34:43 -0500152
153 /* if the frame has entry regs, print them */
154 regs = unwind_get_entry_regs(&state);
155 if (regs)
156 __show_regs(regs, 0);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500157 }
158
Josh Poimboeuf3d02a9c2016-11-18 11:46:23 -0600159 if (stack_name)
160 printk("%s </%s>\n", log_lvl, stack_name);
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500161 }
Neil Horman878719e2008-10-23 10:40:06 -0400162}
163
Neil Horman878719e2008-10-23 10:40:06 -0400164void show_stack(struct task_struct *task, unsigned long *sp)
165{
Josh Poimboeuf81539162016-09-16 08:05:20 -0500166 task = task ? : current;
167
Tejun Heoa77f2a42013-04-30 15:27:09 -0700168 /*
169 * Stack frames below this one aren't interesting. Don't show them
170 * if we're printing for %current.
171 */
Josh Poimboeufe18bccc2016-09-16 14:18:16 -0500172 if (!sp && task == current)
Josh Poimboeuf4b8afaf2016-08-24 11:50:17 -0500173 sp = get_stack_pointer(current, NULL);
Tejun Heoa77f2a42013-04-30 15:27:09 -0700174
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500175 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
Neil Horman878719e2008-10-23 10:40:06 -0400176}
177
Borislav Petkov81c29492016-07-05 00:31:27 +0200178void show_stack_regs(struct pt_regs *regs)
179{
Josh Poimboeuf0ee1dd92016-10-25 09:51:13 -0500180 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
Borislav Petkov81c29492016-07-05 00:31:27 +0200181}
182
Thomas Gleixneredc35bd2009-12-03 12:38:57 +0100183static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
Neil Horman878719e2008-10-23 10:40:06 -0400184static int die_owner = -1;
185static unsigned int die_nest_count;
186
Masami Hiramatsu93266382014-04-17 17:18:14 +0900187unsigned long oops_begin(void)
Neil Horman878719e2008-10-23 10:40:06 -0400188{
189 int cpu;
190 unsigned long flags;
191
Neil Horman878719e2008-10-23 10:40:06 -0400192 oops_enter();
193
194 /* racy, but better than risking deadlock. */
195 raw_local_irq_save(flags);
196 cpu = smp_processor_id();
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100197 if (!arch_spin_trylock(&die_lock)) {
Neil Horman878719e2008-10-23 10:40:06 -0400198 if (cpu == die_owner)
199 /* nested oops. should stop eventually */;
200 else
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100201 arch_spin_lock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400202 }
203 die_nest_count++;
204 die_owner = cpu;
205 console_verbose();
206 bust_spinlocks(1);
207 return flags;
208}
Huang Ying81e88fd2011-01-12 14:44:55 +0800209EXPORT_SYMBOL_GPL(oops_begin);
Masami Hiramatsu93266382014-04-17 17:18:14 +0900210NOKPROBE_SYMBOL(oops_begin);
Neil Horman878719e2008-10-23 10:40:06 -0400211
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700212void __noreturn rewind_stack_do_exit(int signr);
213
Masami Hiramatsu93266382014-04-17 17:18:14 +0900214void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
Neil Horman878719e2008-10-23 10:40:06 -0400215{
216 if (regs && kexec_should_crash(current))
217 crash_kexec(regs);
218
219 bust_spinlocks(0);
220 die_owner = -1;
Rusty Russell373d4d02013-01-21 17:17:39 +1030221 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
Neil Horman878719e2008-10-23 10:40:06 -0400222 die_nest_count--;
223 if (!die_nest_count)
224 /* Nest count reaches zero, release the lock. */
Thomas Gleixner0199c4e2009-12-02 20:01:25 +0100225 arch_spin_unlock(&die_lock);
Neil Horman878719e2008-10-23 10:40:06 -0400226 raw_local_irq_restore(flags);
227 oops_exit();
228
229 if (!signr)
230 return;
231 if (in_interrupt())
232 panic("Fatal exception in interrupt");
233 if (panic_on_oops)
234 panic("Fatal exception");
Andy Lutomirski2deb4be2016-07-14 13:22:55 -0700235
236 /*
237 * We're not going to return, but we might be on an IST stack or
238 * have very little stack space left. Rewind the stack and kill
239 * the task.
240 */
241 rewind_stack_do_exit(signr);
Neil Horman878719e2008-10-23 10:40:06 -0400242}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900243NOKPROBE_SYMBOL(oops_end);
Neil Horman878719e2008-10-23 10:40:06 -0400244
Masami Hiramatsu93266382014-04-17 17:18:14 +0900245int __die(const char *str, struct pt_regs *regs, long err)
Neil Horman878719e2008-10-23 10:40:06 -0400246{
247#ifdef CONFIG_X86_32
248 unsigned short ss;
249 unsigned long sp;
250#endif
Prarit Bhargavab0f4c4b2012-01-26 08:55:34 -0500251 printk(KERN_DEFAULT
Rasmus Villemoes8fad7ec2016-03-26 21:40:16 +0100252 "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
253 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
254 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
255 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
256 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
257
Neil Horman878719e2008-10-23 10:40:06 -0400258 if (notify_die(DIE_OOPS, str, regs, err,
Srikar Dronamraju51e7dc72012-03-12 14:55:55 +0530259 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
Neil Horman878719e2008-10-23 10:40:06 -0400260 return 1;
261
Jan Beulich0fa0e2f2012-06-18 11:40:04 +0100262 print_modules();
Jan Beulich57da8b92012-05-09 08:47:37 +0100263 show_regs(regs);
Neil Horman878719e2008-10-23 10:40:06 -0400264#ifdef CONFIG_X86_32
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700265 if (user_mode(regs)) {
Neil Horman878719e2008-10-23 10:40:06 -0400266 sp = regs->sp;
267 ss = regs->ss & 0xffff;
H. Peter Anvina343c752009-10-12 14:11:09 -0700268 } else {
269 sp = kernel_stack_pointer(regs);
270 savesegment(ss, ss);
Neil Horman878719e2008-10-23 10:40:06 -0400271 }
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500272 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
273 (void *)regs->ip, ss, sp);
Neil Horman878719e2008-10-23 10:40:06 -0400274#else
275 /* Executive summary in case the oops scrolled away */
Josh Poimboeufbb5e5ce2016-10-25 09:51:12 -0500276 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
Neil Horman878719e2008-10-23 10:40:06 -0400277#endif
278 return 0;
279}
Masami Hiramatsu93266382014-04-17 17:18:14 +0900280NOKPROBE_SYMBOL(__die);
Neil Horman878719e2008-10-23 10:40:06 -0400281
282/*
283 * This is gone through when something in the kernel has done something bad
284 * and is about to be terminated:
285 */
286void die(const char *str, struct pt_regs *regs, long err)
287{
288 unsigned long flags = oops_begin();
289 int sig = SIGSEGV;
290
Andy Lutomirskif39b6f02015-03-18 18:33:33 -0700291 if (!user_mode(regs))
Neil Horman878719e2008-10-23 10:40:06 -0400292 report_bug(regs->ip, regs);
293
294 if (__die(str, regs, err))
295 sig = 0;
296 oops_end(flags, regs, sig);
297}
298
Neil Horman878719e2008-10-23 10:40:06 -0400299static int __init code_bytes_setup(char *s)
300{
Shuah Khan363f7ce2012-05-06 11:58:04 -0600301 ssize_t ret;
302 unsigned long val;
303
304 if (!s)
305 return -EINVAL;
306
307 ret = kstrtoul(s, 0, &val);
308 if (ret)
309 return ret;
310
311 code_bytes = val;
Neil Horman878719e2008-10-23 10:40:06 -0400312 if (code_bytes > 8192)
313 code_bytes = 8192;
314
315 return 1;
316}
317__setup("code_bytes=", code_bytes_setup);