sh: unwinder: Introduce UNWINDER_BUG() and UNWINDER_BUG_ON()
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / arch / sh / kernel / unwinder.c
blobb9c122abe251d2a17982c4a0b41126df59ee2308
1 /*
2 * Copyright (C) 2009 Matt Fleming
4 * Based, in part, on kernel/time/clocksource.c.
6 * This file provides arbitration code for stack unwinders.
8 * Multiple stack unwinders can be available on a system, usually with
9 * the most accurate unwinder being the currently active one.
11 #include <linux/errno.h>
12 #include <linux/list.h>
13 #include <linux/spinlock.h>
14 #include <asm/unwinder.h>
15 #include <asm/atomic.h>
18 * This is the most basic stack unwinder an architecture can
19 * provide. For architectures without reliable frame pointers, e.g.
20 * RISC CPUs, it can be implemented by looking through the stack for
21 * addresses that lie within the kernel text section.
23 * Other CPUs, e.g. x86, can use their frame pointer register to
24 * construct more accurate stack traces.
26 static struct list_head unwinder_list;
27 static struct unwinder stack_reader = {
28 .name = "stack-reader",
29 .dump = stack_reader_dump,
30 .rating = 50,
31 .list = {
32 .next = &unwinder_list,
33 .prev = &unwinder_list,
38 * "curr_unwinder" points to the stack unwinder currently in use. This
39 * is the unwinder with the highest rating.
41 * "unwinder_list" is a linked-list of all available unwinders, sorted
42 * by rating.
44 * All modifications of "curr_unwinder" and "unwinder_list" must be
45 * performed whilst holding "unwinder_lock".
47 static struct unwinder *curr_unwinder = &stack_reader;
49 static struct list_head unwinder_list = {
50 .next = &stack_reader.list,
51 .prev = &stack_reader.list,
54 static DEFINE_SPINLOCK(unwinder_lock);
56 /**
57 * select_unwinder - Select the best registered stack unwinder.
59 * Private function. Must hold unwinder_lock when called.
61 * Select the stack unwinder with the best rating. This is useful for
62 * setting up curr_unwinder.
64 static struct unwinder *select_unwinder(void)
66 struct unwinder *best;
68 if (list_empty(&unwinder_list))
69 return NULL;
71 best = list_entry(unwinder_list.next, struct unwinder, list);
72 if (best == curr_unwinder)
73 return NULL;
75 return best;
79 * Enqueue the stack unwinder sorted by rating.
81 static int unwinder_enqueue(struct unwinder *ops)
83 struct list_head *tmp, *entry = &unwinder_list;
85 list_for_each(tmp, &unwinder_list) {
86 struct unwinder *o;
88 o = list_entry(tmp, struct unwinder, list);
89 if (o == ops)
90 return -EBUSY;
91 /* Keep track of the place, where to insert */
92 if (o->rating >= ops->rating)
93 entry = tmp;
95 list_add(&ops->list, entry);
97 return 0;
101 * unwinder_register - Used to install new stack unwinder
102 * @u: unwinder to be registered
104 * Install the new stack unwinder on the unwinder list, which is sorted
105 * by rating.
107 * Returns -EBUSY if registration fails, zero otherwise.
109 int unwinder_register(struct unwinder *u)
111 unsigned long flags;
112 int ret;
114 spin_lock_irqsave(&unwinder_lock, flags);
115 ret = unwinder_enqueue(u);
116 if (!ret)
117 curr_unwinder = select_unwinder();
118 spin_unlock_irqrestore(&unwinder_lock, flags);
120 return ret;
123 int unwinder_faulted = 0;
126 * Unwind the call stack and pass information to the stacktrace_ops
127 * functions. Also handle the case where we need to switch to a new
128 * stack dumper because the current one faulted unexpectedly.
130 void unwind_stack(struct task_struct *task, struct pt_regs *regs,
131 unsigned long *sp, const struct stacktrace_ops *ops,
132 void *data)
134 unsigned long flags;
137 * The problem with unwinders with high ratings is that they are
138 * inherently more complicated than the simple ones with lower
139 * ratings. We are therefore more likely to fault in the
140 * complicated ones, e.g. hitting BUG()s. If we fault in the
141 * code for the current stack unwinder we try to downgrade to
142 * one with a lower rating.
144 * Hopefully this will give us a semi-reliable stacktrace so we
145 * can diagnose why curr_unwinder->dump() faulted.
147 if (unwinder_faulted) {
148 spin_lock_irqsave(&unwinder_lock, flags);
150 /* Make sure no one beat us to changing the unwinder */
151 if (unwinder_faulted && !list_is_singular(&unwinder_list)) {
152 list_del(&curr_unwinder->list);
153 curr_unwinder = select_unwinder();
155 unwinder_faulted = 0;
158 spin_unlock_irqrestore(&unwinder_lock, flags);
161 curr_unwinder->dump(task, regs, sp, ops, data);
165 * Trap handler for UWINDER_BUG() statements. We must switch to the
166 * unwinder with the next highest rating.
168 BUILD_TRAP_HANDLER(unwinder)
170 insn_size_t insn;
171 TRAP_HANDLER_DECL;
173 /* Rewind */
174 regs->pc -= instruction_size(ctrl_inw(regs->pc - 4));
175 insn = *(insn_size_t *)instruction_pointer(regs);
177 /* Switch unwinders when unwind_stack() is called */
178 unwinder_faulted = 1;
180 #ifdef CONFIG_BUG
181 handle_BUG(regs);
182 #endif