Loading...
1/*
2 * Copyright (C) 2001 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
3 * Licensed under the GPL
4 */
5
6#include <linux/kallsyms.h>
7#include <linux/kernel.h>
8#include <linux/module.h>
9#include <linux/sched.h>
10#include "sysrq.h"
11
12/* Catch non-i386 SUBARCH's. */
13#if !defined(CONFIG_UML_X86) || defined(CONFIG_64BIT)
14void show_trace(struct task_struct *task, unsigned long * stack)
15{
16 unsigned long addr;
17
18 if (!stack) {
19 stack = (unsigned long*) &stack;
20 WARN_ON(1);
21 }
22
23 printk(KERN_INFO "Call Trace: \n");
24 while (((long) stack & (THREAD_SIZE-1)) != 0) {
25 addr = *stack;
26 if (__kernel_text_address(addr)) {
27 printk(KERN_INFO "%08lx: [<%08lx>]",
28 (unsigned long) stack, addr);
29 print_symbol(KERN_CONT " %s", addr);
30 printk(KERN_CONT "\n");
31 }
32 stack++;
33 }
34 printk(KERN_INFO "\n");
35}
36#endif
37
38/*
39 * stack dumps generator - this is used by arch-independent code.
40 * And this is identical to i386 currently.
41 */
42void dump_stack(void)
43{
44 unsigned long stack;
45
46 show_trace(current, &stack);
47}
48EXPORT_SYMBOL(dump_stack);
49
50/*Stolen from arch/i386/kernel/traps.c */
51static const int kstack_depth_to_print = 24;
52
53/* This recently started being used in arch-independent code too, as in
54 * kernel/sched.c.*/
55void show_stack(struct task_struct *task, unsigned long *esp)
56{
57 unsigned long *stack;
58 int i;
59
60 if (esp == NULL) {
61 if (task != current && task != NULL) {
62 esp = (unsigned long *) KSTK_ESP(task);
63 } else {
64 esp = (unsigned long *) &esp;
65 }
66 }
67
68 stack = esp;
69 for (i = 0; i < kstack_depth_to_print; i++) {
70 if (kstack_end(stack))
71 break;
72 if (i && ((i % 8) == 0))
73 printk(KERN_INFO " ");
74 printk(KERN_CONT "%08lx ", *stack++);
75 }
76
77 show_trace(task, esp);
78}
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 <asm/sysrq.h>
15#include <os.h>
16
17struct stack_frame {
18 struct stack_frame *next_frame;
19 unsigned long return_address;
20};
21
22static void do_stack_trace(unsigned long *sp, unsigned long bp)
23{
24 int reliable;
25 unsigned long addr;
26 struct stack_frame *frame = (struct stack_frame *)bp;
27
28 printk(KERN_INFO "Call Trace:\n");
29 while (((long) sp & (THREAD_SIZE-1)) != 0) {
30 addr = *sp;
31 if (__kernel_text_address(addr)) {
32 reliable = 0;
33 if ((unsigned long) sp == bp + sizeof(long)) {
34 frame = frame ? frame->next_frame : NULL;
35 bp = (unsigned long)frame;
36 reliable = 1;
37 }
38
39 printk(KERN_INFO " [<%08lx>]", addr);
40 printk(KERN_CONT " %s", reliable ? "" : "? ");
41 print_symbol(KERN_CONT "%s", addr);
42 printk(KERN_CONT "\n");
43 }
44 sp++;
45 }
46 printk(KERN_INFO "\n");
47}
48
49static unsigned long get_frame_pointer(struct task_struct *task,
50 struct pt_regs *segv_regs)
51{
52 if (!task || task == current)
53 return segv_regs ? PT_REGS_BP(segv_regs) : current_bp();
54 else
55 return KSTK_EBP(task);
56}
57
58static unsigned long *get_stack_pointer(struct task_struct *task,
59 struct pt_regs *segv_regs)
60{
61 if (!task || task == current)
62 return segv_regs ? (unsigned long *)PT_REGS_SP(segv_regs) : current_sp();
63 else
64 return (unsigned long *)KSTK_ESP(task);
65}
66
67void show_stack(struct task_struct *task, unsigned long *stack)
68{
69 unsigned long *sp = stack, bp = 0;
70 struct pt_regs *segv_regs = current->thread.segv_regs;
71 int i;
72
73 if (!segv_regs && os_is_signal_stack()) {
74 printk(KERN_ERR "Received SIGSEGV in SIGSEGV handler,"
75 " aborting stack trace!\n");
76 return;
77 }
78
79#ifdef CONFIG_FRAME_POINTER
80 bp = get_frame_pointer(task, segv_regs);
81#endif
82
83 if (!stack)
84 sp = get_stack_pointer(task, segv_regs);
85
86 printk(KERN_INFO "Stack:\n");
87 stack = sp;
88 for (i = 0; i < 3 * STACKSLOTS_PER_LINE; i++) {
89 if (kstack_end(stack))
90 break;
91 if (i && ((i % STACKSLOTS_PER_LINE) == 0))
92 printk(KERN_CONT "\n");
93 printk(KERN_CONT " %08lx", *stack++);
94 }
95 printk(KERN_CONT "\n");
96
97 do_stack_trace(sp, bp);
98}