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