1 /*
2 * Copyright (C) 2001 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
3 * Copyright (C) 2013 Richard Weinberger <richrd@nod.at>
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation.
8 */
9
10 #include <linux/kallsyms.h>
11 #include <linux/kernel.h>
12 #include <linux/module.h>
13 #include <linux/sched.h>
14 #include <linux/sched/debug.h>
15 #include <linux/sched/task_stack.h>
16
17 #include <asm/sysrq.h>
18 #include <asm/stacktrace.h>
19 #include <os.h>
20
_print_addr(void * data,unsigned long address,int reliable)21 static void _print_addr(void *data, unsigned long address, int reliable)
22 {
23 pr_info(" [<%08lx>] %s%pF\n", address, reliable ? "" : "? ",
24 (void *)address);
25 }
26
27 static const struct stacktrace_ops stackops = {
28 .address = _print_addr
29 };
30
show_stack(struct task_struct * task,unsigned long * stack)31 void show_stack(struct task_struct *task, unsigned long *stack)
32 {
33 unsigned long *sp = stack;
34 struct pt_regs *segv_regs = current->thread.segv_regs;
35 int i;
36
37 if (!segv_regs && os_is_signal_stack()) {
38 pr_err("Received SIGSEGV in SIGSEGV handler,"
39 " aborting stack trace!\n");
40 return;
41 }
42
43 if (!stack)
44 sp = get_stack_pointer(task, segv_regs);
45
46 pr_info("Stack:\n");
47 stack = sp;
48 for (i = 0; i < 3 * STACKSLOTS_PER_LINE; i++) {
49 if (kstack_end(stack))
50 break;
51 if (i && ((i % STACKSLOTS_PER_LINE) == 0))
52 pr_cont("\n");
53 pr_cont(" %08lx", *stack++);
54 }
55 pr_cont("\n");
56
57 pr_info("Call Trace:\n");
58 dump_trace(current, &stackops, NULL);
59 pr_info("\n");
60 }
61
