]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - arch/x86/kernel/dumpstack.c
x86/cpu_entry_area: Move it out of the fixmap
[mirror_ubuntu-artful-kernel.git] / arch / x86 / kernel / dumpstack.c
1 /*
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>
13 #include <linux/sched/debug.h>
14 #include <linux/sched/task_stack.h>
15 #include <linux/ftrace.h>
16 #include <linux/kexec.h>
17 #include <linux/bug.h>
18 #include <linux/nmi.h>
19 #include <linux/sysfs.h>
20
21 #include <asm/cpu_entry_area.h>
22 #include <asm/stacktrace.h>
23 #include <asm/unwind.h>
24
25 int panic_on_unrecovered_nmi;
26 int panic_on_io_nmi;
27 unsigned int code_bytes = 64;
28 static int die_counter;
29
30 bool 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
47 bool in_entry_stack(unsigned long *stack, struct stack_info *info)
48 {
49 struct entry_stack *ss = cpu_entry_stack(smp_processor_id());
50
51 void *begin = ss;
52 void *end = ss + 1;
53
54 if ((void *)stack < begin || (void *)stack >= end)
55 return false;
56
57 info->type = STACK_TYPE_ENTRY;
58 info->begin = begin;
59 info->end = end;
60 info->next_sp = NULL;
61
62 return true;
63 }
64
65 static void printk_stack_address(unsigned long address, int reliable,
66 char *log_lvl)
67 {
68 touch_nmi_watchdog();
69 printk("%s %s%pB\n", log_lvl, reliable ? "" : "? ", (void *)address);
70 }
71
72 void 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
79 static 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
94 void show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
95 unsigned long *stack, char *log_lvl)
96 {
97 struct unwind_state state;
98 struct stack_info stack_info = {0};
99 unsigned long visit_mask = 0;
100 int graph_idx = 0;
101
102 printk("%sCall Trace:\n", log_lvl);
103
104 unwind_start(&state, task, regs, stack);
105 stack = stack ? : get_stack_pointer(task, regs);
106
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 * - entry stack
116 *
117 * x86-32 can have up to four stacks:
118 * - task stack
119 * - softirq stack
120 * - hardirq stack
121 * - entry stack
122 */
123 for (regs = NULL; stack; stack = PTR_ALIGN(stack_info.next_sp, sizeof(long))) {
124 const char *stack_name;
125
126 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 }
137
138 stack_name = stack_type_name(stack_info.type);
139 if (stack_name)
140 printk("%s <%s>\n", log_lvl, stack_name);
141
142 if (regs)
143 show_regs_safe(&stack_info, regs);
144
145 /*
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;
158 unsigned long addr = READ_ONCE_NOCHECK(*stack);
159 unsigned long *ret_addr_p =
160 unwind_get_return_address_ptr(&state);
161
162 if (!__kernel_text_address(addr))
163 continue;
164
165 /*
166 * Don't print regs->ip again if it was already printed
167 * by show_regs_safe() below.
168 */
169 if (regs && stack == &regs->ip) {
170 unwind_next_frame(&state);
171 continue;
172 }
173
174 if (stack == ret_addr_p)
175 reliable = 1;
176
177 /*
178 * When function graph tracing is enabled for a
179 * function, its return address on the stack is
180 * replaced with the address of an ftrace handler
181 * (return_to_handler). In that case, before printing
182 * the "real" address, we want to print the handler
183 * address as an "unreliable" hint that function graph
184 * tracing was involved.
185 */
186 real_addr = ftrace_graph_ret_addr(task, &graph_idx,
187 addr, stack);
188 if (real_addr != addr)
189 printk_stack_address(addr, 0, log_lvl);
190 printk_stack_address(real_addr, reliable, log_lvl);
191
192 if (!reliable)
193 continue;
194
195 /*
196 * Get the next frame from the unwinder. No need to
197 * check for an error: if anything goes wrong, the rest
198 * of the addresses will just be printed as unreliable.
199 */
200 unwind_next_frame(&state);
201
202 /* if the frame has entry regs, print them */
203 regs = unwind_get_entry_regs(&state);
204 if (regs)
205 show_regs_safe(&stack_info, regs);
206 }
207
208 if (stack_name)
209 printk("%s </%s>\n", log_lvl, stack_name);
210 }
211 }
212
213 void show_stack(struct task_struct *task, unsigned long *sp)
214 {
215 task = task ? : current;
216
217 /*
218 * Stack frames below this one aren't interesting. Don't show them
219 * if we're printing for %current.
220 */
221 if (!sp && task == current)
222 sp = get_stack_pointer(current, NULL);
223
224 show_trace_log_lvl(task, NULL, sp, KERN_DEFAULT);
225 }
226
227 void show_stack_regs(struct pt_regs *regs)
228 {
229 show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
230 }
231
232 static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
233 static int die_owner = -1;
234 static unsigned int die_nest_count;
235
236 unsigned long oops_begin(void)
237 {
238 int cpu;
239 unsigned long flags;
240
241 oops_enter();
242
243 /* racy, but better than risking deadlock. */
244 raw_local_irq_save(flags);
245 cpu = smp_processor_id();
246 if (!arch_spin_trylock(&die_lock)) {
247 if (cpu == die_owner)
248 /* nested oops. should stop eventually */;
249 else
250 arch_spin_lock(&die_lock);
251 }
252 die_nest_count++;
253 die_owner = cpu;
254 console_verbose();
255 bust_spinlocks(1);
256 return flags;
257 }
258 EXPORT_SYMBOL_GPL(oops_begin);
259 NOKPROBE_SYMBOL(oops_begin);
260
261 void __noreturn rewind_stack_do_exit(int signr);
262
263 void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
264 {
265 if (regs && kexec_should_crash(current))
266 crash_kexec(regs);
267
268 bust_spinlocks(0);
269 die_owner = -1;
270 add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
271 die_nest_count--;
272 if (!die_nest_count)
273 /* Nest count reaches zero, release the lock. */
274 arch_spin_unlock(&die_lock);
275 raw_local_irq_restore(flags);
276 oops_exit();
277
278 if (!signr)
279 return;
280 if (in_interrupt())
281 panic("Fatal exception in interrupt");
282 if (panic_on_oops)
283 panic("Fatal exception");
284
285 /*
286 * We're not going to return, but we might be on an IST stack or
287 * have very little stack space left. Rewind the stack and kill
288 * the task.
289 */
290 rewind_stack_do_exit(signr);
291 }
292 NOKPROBE_SYMBOL(oops_end);
293
294 int __die(const char *str, struct pt_regs *regs, long err)
295 {
296 #ifdef CONFIG_X86_32
297 unsigned short ss;
298 unsigned long sp;
299 #endif
300 printk(KERN_DEFAULT
301 "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
302 IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
303 IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
304 debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
305 IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
306
307 if (notify_die(DIE_OOPS, str, regs, err,
308 current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
309 return 1;
310
311 print_modules();
312 show_regs(regs);
313 #ifdef CONFIG_X86_32
314 if (user_mode(regs)) {
315 sp = regs->sp;
316 ss = regs->ss & 0xffff;
317 } else {
318 sp = kernel_stack_pointer(regs);
319 savesegment(ss, ss);
320 }
321 printk(KERN_EMERG "EIP: %pS SS:ESP: %04x:%08lx\n",
322 (void *)regs->ip, ss, sp);
323 #else
324 /* Executive summary in case the oops scrolled away */
325 printk(KERN_ALERT "RIP: %pS RSP: %016lx\n", (void *)regs->ip, regs->sp);
326 #endif
327 return 0;
328 }
329 NOKPROBE_SYMBOL(__die);
330
331 /*
332 * This is gone through when something in the kernel has done something bad
333 * and is about to be terminated:
334 */
335 void die(const char *str, struct pt_regs *regs, long err)
336 {
337 unsigned long flags = oops_begin();
338 int sig = SIGSEGV;
339
340 if (__die(str, regs, err))
341 sig = 0;
342 oops_end(flags, regs, sig);
343 }
344
345 static int __init code_bytes_setup(char *s)
346 {
347 ssize_t ret;
348 unsigned long val;
349
350 if (!s)
351 return -EINVAL;
352
353 ret = kstrtoul(s, 0, &val);
354 if (ret)
355 return ret;
356
357 code_bytes = val;
358 if (code_bytes > 8192)
359 code_bytes = 8192;
360
361 return 1;
362 }
363 __setup("code_bytes=", code_bytes_setup);