tracing: Fix stack tracer with fentry use
[linux-2.6-block.git] / kernel / trace / trace_stack.c
CommitLineData
e5a81b62
SR
1/*
2 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
3 *
4 */
5#include <linux/stacktrace.h>
6#include <linux/kallsyms.h>
7#include <linux/seq_file.h>
8#include <linux/spinlock.h>
9#include <linux/uaccess.h>
10#include <linux/debugfs.h>
11#include <linux/ftrace.h>
12#include <linux/module.h>
f38f1d2a 13#include <linux/sysctl.h>
e5a81b62
SR
14#include <linux/init.h>
15#include <linux/fs.h>
762e1207
SR
16
17#include <asm/setup.h>
18
e5a81b62
SR
19#include "trace.h"
20
21#define STACK_TRACE_ENTRIES 500
22
d4ecbfc4
SRRH
23/*
24 * If fentry is used, then the function being traced will
25 * jump to fentry directly before it sets up its stack frame.
26 * We need to ignore that one and record the parent. Since
27 * the stack frame for the traced function wasn't set up yet,
28 * the stack_trace wont see the parent. That needs to be added
29 * manually to stack_dump_trace[] as the first element.
30 */
31#ifdef CC_USING_FENTRY
32# define add_func 1
33#else
34# define add_func 0
35#endif
36
1b6cced6
SR
37static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES+1] =
38 { [0 ... (STACK_TRACE_ENTRIES)] = ULONG_MAX };
39static unsigned stack_dump_index[STACK_TRACE_ENTRIES];
40
e5a81b62 41static struct stack_trace max_stack_trace = {
d4ecbfc4
SRRH
42 .max_entries = STACK_TRACE_ENTRIES - add_func,
43 .entries = &stack_dump_trace[add_func],
e5a81b62
SR
44};
45
46static unsigned long max_stack_size;
445c8951 47static arch_spinlock_t max_stack_lock =
edc35bd7 48 (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED;
e5a81b62 49
e5a81b62 50static DEFINE_PER_CPU(int, trace_active);
f38f1d2a
SR
51static DEFINE_MUTEX(stack_sysctl_mutex);
52
53int stack_tracer_enabled;
54static int last_stack_tracer_enabled;
e5a81b62 55
87889501 56static inline void
d4ecbfc4 57check_stack(unsigned long ip, unsigned long *stack)
e5a81b62 58{
1b6cced6
SR
59 unsigned long this_size, flags;
60 unsigned long *p, *top, *start;
61 int i;
e5a81b62 62
87889501 63 this_size = ((unsigned long)stack) & (THREAD_SIZE-1);
e5a81b62
SR
64 this_size = THREAD_SIZE - this_size;
65
66 if (this_size <= max_stack_size)
67 return;
68
81520a1b 69 /* we do not handle interrupt stacks yet */
87889501 70 if (!object_is_on_stack(stack))
81520a1b
SR
71 return;
72
a5e25883 73 local_irq_save(flags);
0199c4e6 74 arch_spin_lock(&max_stack_lock);
e5a81b62
SR
75
76 /* a race could have already updated it */
77 if (this_size <= max_stack_size)
78 goto out;
79
80 max_stack_size = this_size;
81
82 max_stack_trace.nr_entries = 0;
1b6cced6 83 max_stack_trace.skip = 3;
e5a81b62
SR
84
85 save_stack_trace(&max_stack_trace);
86
d4ecbfc4
SRRH
87 /*
88 * When fentry is used, the traced function does not get
89 * its stack frame set up, and we lose the parent.
90 * Add that one in manally. We set up save_stack_trace()
91 * to not touch the first element in this case.
92 */
93 if (add_func) {
94 stack_dump_trace[0] = ip;
95 max_stack_trace.nr_entries++;
96 }
97
1b6cced6
SR
98 /*
99 * Now find where in the stack these are.
100 */
101 i = 0;
87889501 102 start = stack;
1b6cced6
SR
103 top = (unsigned long *)
104 (((unsigned long)start & ~(THREAD_SIZE-1)) + THREAD_SIZE);
105
106 /*
107 * Loop through all the entries. One of the entries may
108 * for some reason be missed on the stack, so we may
109 * have to account for them. If they are all there, this
110 * loop will only happen once. This code only takes place
111 * on a new max, so it is far from a fast path.
112 */
113 while (i < max_stack_trace.nr_entries) {
0a37119d 114 int found = 0;
1b6cced6
SR
115
116 stack_dump_index[i] = this_size;
117 p = start;
118
119 for (; p < top && i < max_stack_trace.nr_entries; p++) {
120 if (*p == stack_dump_trace[i]) {
121 this_size = stack_dump_index[i++] =
122 (top - p) * sizeof(unsigned long);
0a37119d 123 found = 1;
1b6cced6
SR
124 /* Start the search from here */
125 start = p + 1;
126 }
127 }
128
0a37119d
SR
129 if (!found)
130 i++;
1b6cced6
SR
131 }
132
e5a81b62 133 out:
0199c4e6 134 arch_spin_unlock(&max_stack_lock);
a5e25883 135 local_irq_restore(flags);
e5a81b62
SR
136}
137
138static void
a1e2e31d
SR
139stack_trace_call(unsigned long ip, unsigned long parent_ip,
140 struct ftrace_ops *op, struct pt_regs *pt_regs)
e5a81b62 141{
87889501 142 unsigned long stack;
5168ae50 143 int cpu;
e5a81b62 144
5168ae50 145 preempt_disable_notrace();
e5a81b62
SR
146
147 cpu = raw_smp_processor_id();
148 /* no atomic needed, we only modify this variable by this cpu */
149 if (per_cpu(trace_active, cpu)++ != 0)
150 goto out;
151
d4ecbfc4 152 check_stack(parent_ip, &stack);
e5a81b62
SR
153
154 out:
155 per_cpu(trace_active, cpu)--;
156 /* prevent recursion in schedule */
5168ae50 157 preempt_enable_notrace();
e5a81b62
SR
158}
159
160static struct ftrace_ops trace_ops __read_mostly =
161{
162 .func = stack_trace_call,
4740974a 163 .flags = FTRACE_OPS_FL_RECURSION_SAFE,
e5a81b62
SR
164};
165
166static ssize_t
167stack_max_size_read(struct file *filp, char __user *ubuf,
168 size_t count, loff_t *ppos)
169{
170 unsigned long *ptr = filp->private_data;
171 char buf[64];
172 int r;
173
174 r = snprintf(buf, sizeof(buf), "%ld\n", *ptr);
175 if (r > sizeof(buf))
176 r = sizeof(buf);
177 return simple_read_from_buffer(ubuf, count, ppos, buf, r);
178}
179
180static ssize_t
181stack_max_size_write(struct file *filp, const char __user *ubuf,
182 size_t count, loff_t *ppos)
183{
184 long *ptr = filp->private_data;
185 unsigned long val, flags;
e5a81b62 186 int ret;
4f48f8b7 187 int cpu;
e5a81b62 188
22fe9b54
PH
189 ret = kstrtoul_from_user(ubuf, count, 10, &val);
190 if (ret)
e5a81b62
SR
191 return ret;
192
a5e25883 193 local_irq_save(flags);
4f48f8b7
LJ
194
195 /*
196 * In case we trace inside arch_spin_lock() or after (NMI),
197 * we will cause circular lock, so we also need to increase
198 * the percpu trace_active here.
199 */
200 cpu = smp_processor_id();
201 per_cpu(trace_active, cpu)++;
202
0199c4e6 203 arch_spin_lock(&max_stack_lock);
e5a81b62 204 *ptr = val;
0199c4e6 205 arch_spin_unlock(&max_stack_lock);
4f48f8b7
LJ
206
207 per_cpu(trace_active, cpu)--;
a5e25883 208 local_irq_restore(flags);
e5a81b62
SR
209
210 return count;
211}
212
f38f1d2a 213static const struct file_operations stack_max_size_fops = {
e5a81b62
SR
214 .open = tracing_open_generic,
215 .read = stack_max_size_read,
216 .write = stack_max_size_write,
6038f373 217 .llseek = default_llseek,
e5a81b62
SR
218};
219
220static void *
2fc5f0cf 221__next(struct seq_file *m, loff_t *pos)
e5a81b62 222{
2fc5f0cf 223 long n = *pos - 1;
e5a81b62 224
2fc5f0cf 225 if (n >= max_stack_trace.nr_entries || stack_dump_trace[n] == ULONG_MAX)
e5a81b62
SR
226 return NULL;
227
2fc5f0cf 228 m->private = (void *)n;
1b6cced6 229 return &m->private;
e5a81b62
SR
230}
231
2fc5f0cf
LZ
232static void *
233t_next(struct seq_file *m, void *v, loff_t *pos)
e5a81b62 234{
2fc5f0cf
LZ
235 (*pos)++;
236 return __next(m, pos);
237}
e5a81b62 238
2fc5f0cf
LZ
239static void *t_start(struct seq_file *m, loff_t *pos)
240{
4f48f8b7
LJ
241 int cpu;
242
e5a81b62 243 local_irq_disable();
4f48f8b7
LJ
244
245 cpu = smp_processor_id();
246 per_cpu(trace_active, cpu)++;
247
0199c4e6 248 arch_spin_lock(&max_stack_lock);
e5a81b62 249
522a110b
LW
250 if (*pos == 0)
251 return SEQ_START_TOKEN;
252
2fc5f0cf 253 return __next(m, pos);
e5a81b62
SR
254}
255
256static void t_stop(struct seq_file *m, void *p)
257{
4f48f8b7
LJ
258 int cpu;
259
0199c4e6 260 arch_spin_unlock(&max_stack_lock);
4f48f8b7
LJ
261
262 cpu = smp_processor_id();
263 per_cpu(trace_active, cpu)--;
264
e5a81b62
SR
265 local_irq_enable();
266}
267
1b6cced6 268static int trace_lookup_stack(struct seq_file *m, long i)
e5a81b62 269{
1b6cced6 270 unsigned long addr = stack_dump_trace[i];
e5a81b62 271
151772db 272 return seq_printf(m, "%pS\n", (void *)addr);
e5a81b62
SR
273}
274
e447e1df
SR
275static void print_disabled(struct seq_file *m)
276{
277 seq_puts(m, "#\n"
278 "# Stack tracer disabled\n"
279 "#\n"
280 "# To enable the stack tracer, either add 'stacktrace' to the\n"
281 "# kernel command line\n"
282 "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
283 "#\n");
284}
285
e5a81b62
SR
286static int t_show(struct seq_file *m, void *v)
287{
522a110b 288 long i;
1b6cced6
SR
289 int size;
290
522a110b 291 if (v == SEQ_START_TOKEN) {
eb1871f3 292 seq_printf(m, " Depth Size Location"
1b6cced6 293 " (%d entries)\n"
eb1871f3 294 " ----- ---- --------\n",
083a63b4 295 max_stack_trace.nr_entries - 1);
e447e1df
SR
296
297 if (!stack_tracer_enabled && !max_stack_size)
298 print_disabled(m);
299
1b6cced6
SR
300 return 0;
301 }
e5a81b62 302
522a110b
LW
303 i = *(long *)v;
304
1b6cced6
SR
305 if (i >= max_stack_trace.nr_entries ||
306 stack_dump_trace[i] == ULONG_MAX)
e5a81b62
SR
307 return 0;
308
1b6cced6
SR
309 if (i+1 == max_stack_trace.nr_entries ||
310 stack_dump_trace[i+1] == ULONG_MAX)
311 size = stack_dump_index[i];
312 else
313 size = stack_dump_index[i] - stack_dump_index[i+1];
314
315 seq_printf(m, "%3ld) %8d %5d ", i, stack_dump_index[i], size);
316
317 trace_lookup_stack(m, i);
e5a81b62
SR
318
319 return 0;
320}
321
f38f1d2a 322static const struct seq_operations stack_trace_seq_ops = {
e5a81b62
SR
323 .start = t_start,
324 .next = t_next,
325 .stop = t_stop,
326 .show = t_show,
327};
328
329static int stack_trace_open(struct inode *inode, struct file *file)
330{
d8cc1ab7 331 return seq_open(file, &stack_trace_seq_ops);
e5a81b62
SR
332}
333
f38f1d2a 334static const struct file_operations stack_trace_fops = {
e5a81b62
SR
335 .open = stack_trace_open,
336 .read = seq_read,
337 .llseek = seq_lseek,
d8cc1ab7 338 .release = seq_release,
e5a81b62
SR
339};
340
d2d45c7a
SR
341static int
342stack_trace_filter_open(struct inode *inode, struct file *file)
343{
344 return ftrace_regex_open(&trace_ops, FTRACE_ITER_FILTER,
345 inode, file);
346}
347
348static const struct file_operations stack_trace_filter_fops = {
349 .open = stack_trace_filter_open,
350 .read = seq_read,
351 .write = ftrace_filter_write,
352 .llseek = ftrace_regex_lseek,
353 .release = ftrace_regex_release,
354};
355
f38f1d2a
SR
356int
357stack_trace_sysctl(struct ctl_table *table, int write,
8d65af78 358 void __user *buffer, size_t *lenp,
f38f1d2a
SR
359 loff_t *ppos)
360{
361 int ret;
362
363 mutex_lock(&stack_sysctl_mutex);
364
8d65af78 365 ret = proc_dointvec(table, write, buffer, lenp, ppos);
f38f1d2a
SR
366
367 if (ret || !write ||
a32c7765 368 (last_stack_tracer_enabled == !!stack_tracer_enabled))
f38f1d2a
SR
369 goto out;
370
a32c7765 371 last_stack_tracer_enabled = !!stack_tracer_enabled;
f38f1d2a
SR
372
373 if (stack_tracer_enabled)
374 register_ftrace_function(&trace_ops);
375 else
376 unregister_ftrace_function(&trace_ops);
377
378 out:
379 mutex_unlock(&stack_sysctl_mutex);
380 return ret;
381}
382
762e1207
SR
383static char stack_trace_filter_buf[COMMAND_LINE_SIZE+1] __initdata;
384
f38f1d2a
SR
385static __init int enable_stacktrace(char *str)
386{
762e1207
SR
387 if (strncmp(str, "_filter=", 8) == 0)
388 strncpy(stack_trace_filter_buf, str+8, COMMAND_LINE_SIZE);
389
e05a43b7
SR
390 stack_tracer_enabled = 1;
391 last_stack_tracer_enabled = 1;
f38f1d2a
SR
392 return 1;
393}
394__setup("stacktrace", enable_stacktrace);
395
e5a81b62
SR
396static __init int stack_trace_init(void)
397{
398 struct dentry *d_tracer;
e5a81b62
SR
399
400 d_tracer = tracing_init_dentry();
401
5452af66
FW
402 trace_create_file("stack_max_size", 0644, d_tracer,
403 &max_stack_size, &stack_max_size_fops);
e5a81b62 404
5452af66
FW
405 trace_create_file("stack_trace", 0444, d_tracer,
406 NULL, &stack_trace_fops);
e5a81b62 407
d2d45c7a
SR
408 trace_create_file("stack_trace_filter", 0444, d_tracer,
409 NULL, &stack_trace_filter_fops);
410
762e1207
SR
411 if (stack_trace_filter_buf[0])
412 ftrace_set_early_filter(&trace_ops, stack_trace_filter_buf, 1);
413
e05a43b7 414 if (stack_tracer_enabled)
f38f1d2a 415 register_ftrace_function(&trace_ops);
e5a81b62
SR
416
417 return 0;
418}
419
420device_initcall(stack_trace_init);