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 21 static void _print_addr(void *data, unsigned long address, int reliable) 22 { 23 pr_info(" [<%08lx>]", address); 24 pr_cont(" %s", reliable ? "" : "? "); 25 print_symbol("%s", address); 26 pr_cont("\n"); 27 } 28 29 static const struct stacktrace_ops stackops = { 30 .address = _print_addr 31 }; 32 33 void show_stack(struct task_struct *task, unsigned long *stack) 34 { 35 unsigned long *sp = stack; 36 struct pt_regs *segv_regs = current->thread.segv_regs; 37 int i; 38 39 if (!segv_regs && os_is_signal_stack()) { 40 pr_err("Received SIGSEGV in SIGSEGV handler," 41 " aborting stack trace!\n"); 42 return; 43 } 44 45 if (!stack) 46 sp = get_stack_pointer(task, segv_regs); 47 48 pr_info("Stack:\n"); 49 stack = sp; 50 for (i = 0; i < 3 * STACKSLOTS_PER_LINE; i++) { 51 if (kstack_end(stack)) 52 break; 53 if (i && ((i % STACKSLOTS_PER_LINE) == 0)) 54 pr_cont("\n"); 55 pr_cont(" %08lx", *stack++); 56 } 57 pr_cont("\n"); 58 59 pr_info("Call Trace:\n"); 60 dump_trace(current, &stackops, NULL); 61 pr_info("\n"); 62 } 63