Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
4 *
5 */
6#include <linux/sched/task_stack.h>
7#include <linux/stacktrace.h>
8#include <linux/security.h>
9#include <linux/kallsyms.h>
10#include <linux/seq_file.h>
11#include <linux/spinlock.h>
12#include <linux/uaccess.h>
13#include <linux/ftrace.h>
14#include <linux/module.h>
15#include <linux/sysctl.h>
16#include <linux/init.h>
17
18#include <asm/setup.h>
19
20#include "trace.h"
21
22#define STACK_TRACE_ENTRIES 500
23
24static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES];
25static unsigned stack_trace_index[STACK_TRACE_ENTRIES];
26
27static unsigned int stack_trace_nr_entries;
28static unsigned long stack_trace_max_size;
29static arch_spinlock_t stack_trace_max_lock =
30 (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED;
31
32DEFINE_PER_CPU(int, disable_stack_tracer);
33static DEFINE_MUTEX(stack_sysctl_mutex);
34
35int stack_tracer_enabled;
36
37static void print_max_stack(void)
38{
39 long i;
40 int size;
41
42 pr_emerg(" Depth Size Location (%d entries)\n"
43 " ----- ---- --------\n",
44 stack_trace_nr_entries);
45
46 for (i = 0; i < stack_trace_nr_entries; i++) {
47 if (i + 1 == stack_trace_nr_entries)
48 size = stack_trace_index[i];
49 else
50 size = stack_trace_index[i] - stack_trace_index[i+1];
51
52 pr_emerg("%3ld) %8d %5d %pS\n", i, stack_trace_index[i],
53 size, (void *)stack_dump_trace[i]);
54 }
55}
56
57/*
58 * The stack tracer looks for a maximum stack at each call from a function. It
59 * registers a callback from ftrace, and in that callback it examines the stack
60 * size. It determines the stack size from the variable passed in, which is the
61 * address of a local variable in the stack_trace_call() callback function.
62 * The stack size is calculated by the address of the local variable to the top
63 * of the current stack. If that size is smaller than the currently saved max
64 * stack size, nothing more is done.
65 *
66 * If the size of the stack is greater than the maximum recorded size, then the
67 * following algorithm takes place.
68 *
69 * For architectures (like x86) that store the function's return address before
70 * saving the function's local variables, the stack will look something like
71 * this:
72 *
73 * [ top of stack ]
74 * 0: sys call entry frame
75 * 10: return addr to entry code
76 * 11: start of sys_foo frame
77 * 20: return addr to sys_foo
78 * 21: start of kernel_func_bar frame
79 * 30: return addr to kernel_func_bar
80 * 31: [ do trace stack here ]
81 *
82 * The save_stack_trace() is called returning all the functions it finds in the
83 * current stack. Which would be (from the bottom of the stack to the top):
84 *
85 * return addr to kernel_func_bar
86 * return addr to sys_foo
87 * return addr to entry code
88 *
89 * Now to figure out how much each of these functions' local variable size is,
90 * a search of the stack is made to find these values. When a match is made, it
91 * is added to the stack_dump_trace[] array. The offset into the stack is saved
92 * in the stack_trace_index[] array. The above example would show:
93 *
94 * stack_dump_trace[] | stack_trace_index[]
95 * ------------------ + -------------------
96 * return addr to kernel_func_bar | 30
97 * return addr to sys_foo | 20
98 * return addr to entry | 10
99 *
100 * The print_max_stack() function above, uses these values to print the size of
101 * each function's portion of the stack.
102 *
103 * for (i = 0; i < nr_entries; i++) {
104 * size = i == nr_entries - 1 ? stack_trace_index[i] :
105 * stack_trace_index[i] - stack_trace_index[i+1]
106 * print "%d %d %d %s\n", i, stack_trace_index[i], size, stack_dump_trace[i]);
107 * }
108 *
109 * The above shows
110 *
111 * depth size location
112 * ----- ---- --------
113 * 0 30 10 kernel_func_bar
114 * 1 20 10 sys_foo
115 * 2 10 10 entry code
116 *
117 * Now for architectures that might save the return address after the functions
118 * local variables (saving the link register before calling nested functions),
119 * this will cause the stack to look a little different:
120 *
121 * [ top of stack ]
122 * 0: sys call entry frame
123 * 10: start of sys_foo_frame
124 * 19: return addr to entry code << lr saved before calling kernel_func_bar
125 * 20: start of kernel_func_bar frame
126 * 29: return addr to sys_foo_frame << lr saved before calling next function
127 * 30: [ do trace stack here ]
128 *
129 * Although the functions returned by save_stack_trace() may be the same, the
130 * placement in the stack will be different. Using the same algorithm as above
131 * would yield:
132 *
133 * stack_dump_trace[] | stack_trace_index[]
134 * ------------------ + -------------------
135 * return addr to kernel_func_bar | 30
136 * return addr to sys_foo | 29
137 * return addr to entry | 19
138 *
139 * Where the mapping is off by one:
140 *
141 * kernel_func_bar stack frame size is 29 - 19 not 30 - 29!
142 *
143 * To fix this, if the architecture sets ARCH_RET_ADDR_AFTER_LOCAL_VARS the
144 * values in stack_trace_index[] are shifted by one to and the number of
145 * stack trace entries is decremented by one.
146 *
147 * stack_dump_trace[] | stack_trace_index[]
148 * ------------------ + -------------------
149 * return addr to kernel_func_bar | 29
150 * return addr to sys_foo | 19
151 *
152 * Although the entry function is not displayed, the first function (sys_foo)
153 * will still include the stack size of it.
154 */
155static void check_stack(unsigned long ip, unsigned long *stack)
156{
157 unsigned long this_size, flags; unsigned long *p, *top, *start;
158 static int tracer_frame;
159 int frame_size = READ_ONCE(tracer_frame);
160 int i, x;
161
162 this_size = ((unsigned long)stack) & (THREAD_SIZE-1);
163 this_size = THREAD_SIZE - this_size;
164 /* Remove the frame of the tracer */
165 this_size -= frame_size;
166
167 if (this_size <= stack_trace_max_size)
168 return;
169
170 /* we do not handle interrupt stacks yet */
171 if (!object_is_on_stack(stack))
172 return;
173
174 /* Can't do this from NMI context (can cause deadlocks) */
175 if (in_nmi())
176 return;
177
178 local_irq_save(flags);
179 arch_spin_lock(&stack_trace_max_lock);
180
181 /* In case another CPU set the tracer_frame on us */
182 if (unlikely(!frame_size))
183 this_size -= tracer_frame;
184
185 /* a race could have already updated it */
186 if (this_size <= stack_trace_max_size)
187 goto out;
188
189 stack_trace_max_size = this_size;
190
191 stack_trace_nr_entries = stack_trace_save(stack_dump_trace,
192 ARRAY_SIZE(stack_dump_trace) - 1,
193 0);
194
195 /* Skip over the overhead of the stack tracer itself */
196 for (i = 0; i < stack_trace_nr_entries; i++) {
197 if (stack_dump_trace[i] == ip)
198 break;
199 }
200
201 /*
202 * Some archs may not have the passed in ip in the dump.
203 * If that happens, we need to show everything.
204 */
205 if (i == stack_trace_nr_entries)
206 i = 0;
207
208 /*
209 * Now find where in the stack these are.
210 */
211 x = 0;
212 start = stack;
213 top = (unsigned long *)
214 (((unsigned long)start & ~(THREAD_SIZE-1)) + THREAD_SIZE);
215
216 /*
217 * Loop through all the entries. One of the entries may
218 * for some reason be missed on the stack, so we may
219 * have to account for them. If they are all there, this
220 * loop will only happen once. This code only takes place
221 * on a new max, so it is far from a fast path.
222 */
223 while (i < stack_trace_nr_entries) {
224 int found = 0;
225
226 stack_trace_index[x] = this_size;
227 p = start;
228
229 for (; p < top && i < stack_trace_nr_entries; p++) {
230 /*
231 * The READ_ONCE_NOCHECK is used to let KASAN know that
232 * this is not a stack-out-of-bounds error.
233 */
234 if ((READ_ONCE_NOCHECK(*p)) == stack_dump_trace[i]) {
235 stack_dump_trace[x] = stack_dump_trace[i++];
236 this_size = stack_trace_index[x++] =
237 (top - p) * sizeof(unsigned long);
238 found = 1;
239 /* Start the search from here */
240 start = p + 1;
241 /*
242 * We do not want to show the overhead
243 * of the stack tracer stack in the
244 * max stack. If we haven't figured
245 * out what that is, then figure it out
246 * now.
247 */
248 if (unlikely(!tracer_frame)) {
249 tracer_frame = (p - stack) *
250 sizeof(unsigned long);
251 stack_trace_max_size -= tracer_frame;
252 }
253 }
254 }
255
256 if (!found)
257 i++;
258 }
259
260#ifdef ARCH_FTRACE_SHIFT_STACK_TRACER
261 /*
262 * Some archs will store the link register before calling
263 * nested functions. This means the saved return address
264 * comes after the local storage, and we need to shift
265 * for that.
266 */
267 if (x > 1) {
268 memmove(&stack_trace_index[0], &stack_trace_index[1],
269 sizeof(stack_trace_index[0]) * (x - 1));
270 x--;
271 }
272#endif
273
274 stack_trace_nr_entries = x;
275
276 if (task_stack_end_corrupted(current)) {
277 print_max_stack();
278 BUG();
279 }
280
281 out:
282 arch_spin_unlock(&stack_trace_max_lock);
283 local_irq_restore(flags);
284}
285
286static void
287stack_trace_call(unsigned long ip, unsigned long parent_ip,
288 struct ftrace_ops *op, struct pt_regs *pt_regs)
289{
290 unsigned long stack;
291
292 preempt_disable_notrace();
293
294 /* no atomic needed, we only modify this variable by this cpu */
295 __this_cpu_inc(disable_stack_tracer);
296 if (__this_cpu_read(disable_stack_tracer) != 1)
297 goto out;
298
299 /* If rcu is not watching, then save stack trace can fail */
300 if (!rcu_is_watching())
301 goto out;
302
303 ip += MCOUNT_INSN_SIZE;
304
305 check_stack(ip, &stack);
306
307 out:
308 __this_cpu_dec(disable_stack_tracer);
309 /* prevent recursion in schedule */
310 preempt_enable_notrace();
311}
312
313static struct ftrace_ops trace_ops __read_mostly =
314{
315 .func = stack_trace_call,
316 .flags = FTRACE_OPS_FL_RECURSION_SAFE,
317};
318
319static ssize_t
320stack_max_size_read(struct file *filp, char __user *ubuf,
321 size_t count, loff_t *ppos)
322{
323 unsigned long *ptr = filp->private_data;
324 char buf[64];
325 int r;
326
327 r = snprintf(buf, sizeof(buf), "%ld\n", *ptr);
328 if (r > sizeof(buf))
329 r = sizeof(buf);
330 return simple_read_from_buffer(ubuf, count, ppos, buf, r);
331}
332
333static ssize_t
334stack_max_size_write(struct file *filp, const char __user *ubuf,
335 size_t count, loff_t *ppos)
336{
337 long *ptr = filp->private_data;
338 unsigned long val, flags;
339 int ret;
340
341 ret = kstrtoul_from_user(ubuf, count, 10, &val);
342 if (ret)
343 return ret;
344
345 local_irq_save(flags);
346
347 /*
348 * In case we trace inside arch_spin_lock() or after (NMI),
349 * we will cause circular lock, so we also need to increase
350 * the percpu disable_stack_tracer here.
351 */
352 __this_cpu_inc(disable_stack_tracer);
353
354 arch_spin_lock(&stack_trace_max_lock);
355 *ptr = val;
356 arch_spin_unlock(&stack_trace_max_lock);
357
358 __this_cpu_dec(disable_stack_tracer);
359 local_irq_restore(flags);
360
361 return count;
362}
363
364static const struct file_operations stack_max_size_fops = {
365 .open = tracing_open_generic,
366 .read = stack_max_size_read,
367 .write = stack_max_size_write,
368 .llseek = default_llseek,
369};
370
371static void *
372__next(struct seq_file *m, loff_t *pos)
373{
374 long n = *pos - 1;
375
376 if (n >= stack_trace_nr_entries)
377 return NULL;
378
379 m->private = (void *)n;
380 return &m->private;
381}
382
383static void *
384t_next(struct seq_file *m, void *v, loff_t *pos)
385{
386 (*pos)++;
387 return __next(m, pos);
388}
389
390static void *t_start(struct seq_file *m, loff_t *pos)
391{
392 local_irq_disable();
393
394 __this_cpu_inc(disable_stack_tracer);
395
396 arch_spin_lock(&stack_trace_max_lock);
397
398 if (*pos == 0)
399 return SEQ_START_TOKEN;
400
401 return __next(m, pos);
402}
403
404static void t_stop(struct seq_file *m, void *p)
405{
406 arch_spin_unlock(&stack_trace_max_lock);
407
408 __this_cpu_dec(disable_stack_tracer);
409
410 local_irq_enable();
411}
412
413static void trace_lookup_stack(struct seq_file *m, long i)
414{
415 unsigned long addr = stack_dump_trace[i];
416
417 seq_printf(m, "%pS\n", (void *)addr);
418}
419
420static void print_disabled(struct seq_file *m)
421{
422 seq_puts(m, "#\n"
423 "# Stack tracer disabled\n"
424 "#\n"
425 "# To enable the stack tracer, either add 'stacktrace' to the\n"
426 "# kernel command line\n"
427 "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
428 "#\n");
429}
430
431static int t_show(struct seq_file *m, void *v)
432{
433 long i;
434 int size;
435
436 if (v == SEQ_START_TOKEN) {
437 seq_printf(m, " Depth Size Location"
438 " (%d entries)\n"
439 " ----- ---- --------\n",
440 stack_trace_nr_entries);
441
442 if (!stack_tracer_enabled && !stack_trace_max_size)
443 print_disabled(m);
444
445 return 0;
446 }
447
448 i = *(long *)v;
449
450 if (i >= stack_trace_nr_entries)
451 return 0;
452
453 if (i + 1 == stack_trace_nr_entries)
454 size = stack_trace_index[i];
455 else
456 size = stack_trace_index[i] - stack_trace_index[i+1];
457
458 seq_printf(m, "%3ld) %8d %5d ", i, stack_trace_index[i], size);
459
460 trace_lookup_stack(m, i);
461
462 return 0;
463}
464
465static const struct seq_operations stack_trace_seq_ops = {
466 .start = t_start,
467 .next = t_next,
468 .stop = t_stop,
469 .show = t_show,
470};
471
472static int stack_trace_open(struct inode *inode, struct file *file)
473{
474 int ret;
475
476 ret = security_locked_down(LOCKDOWN_TRACEFS);
477 if (ret)
478 return ret;
479
480 return seq_open(file, &stack_trace_seq_ops);
481}
482
483static const struct file_operations stack_trace_fops = {
484 .open = stack_trace_open,
485 .read = seq_read,
486 .llseek = seq_lseek,
487 .release = seq_release,
488};
489
490#ifdef CONFIG_DYNAMIC_FTRACE
491
492static int
493stack_trace_filter_open(struct inode *inode, struct file *file)
494{
495 struct ftrace_ops *ops = inode->i_private;
496
497 /* Checks for tracefs lockdown */
498 return ftrace_regex_open(ops, FTRACE_ITER_FILTER,
499 inode, file);
500}
501
502static const struct file_operations stack_trace_filter_fops = {
503 .open = stack_trace_filter_open,
504 .read = seq_read,
505 .write = ftrace_filter_write,
506 .llseek = tracing_lseek,
507 .release = ftrace_regex_release,
508};
509
510#endif /* CONFIG_DYNAMIC_FTRACE */
511
512int
513stack_trace_sysctl(struct ctl_table *table, int write,
514 void __user *buffer, size_t *lenp,
515 loff_t *ppos)
516{
517 int was_enabled;
518 int ret;
519
520 mutex_lock(&stack_sysctl_mutex);
521 was_enabled = !!stack_tracer_enabled;
522
523 ret = proc_dointvec(table, write, buffer, lenp, ppos);
524
525 if (ret || !write || (was_enabled == !!stack_tracer_enabled))
526 goto out;
527
528 if (stack_tracer_enabled)
529 register_ftrace_function(&trace_ops);
530 else
531 unregister_ftrace_function(&trace_ops);
532 out:
533 mutex_unlock(&stack_sysctl_mutex);
534 return ret;
535}
536
537static char stack_trace_filter_buf[COMMAND_LINE_SIZE+1] __initdata;
538
539static __init int enable_stacktrace(char *str)
540{
541 int len;
542
543 if ((len = str_has_prefix(str, "_filter=")))
544 strncpy(stack_trace_filter_buf, str + len, COMMAND_LINE_SIZE);
545
546 stack_tracer_enabled = 1;
547 return 1;
548}
549__setup("stacktrace", enable_stacktrace);
550
551static __init int stack_trace_init(void)
552{
553 struct dentry *d_tracer;
554
555 d_tracer = tracing_init_dentry();
556 if (IS_ERR(d_tracer))
557 return 0;
558
559 trace_create_file("stack_max_size", 0644, d_tracer,
560 &stack_trace_max_size, &stack_max_size_fops);
561
562 trace_create_file("stack_trace", 0444, d_tracer,
563 NULL, &stack_trace_fops);
564
565#ifdef CONFIG_DYNAMIC_FTRACE
566 trace_create_file("stack_trace_filter", 0644, d_tracer,
567 &trace_ops, &stack_trace_filter_fops);
568#endif
569
570 if (stack_trace_filter_buf[0])
571 ftrace_set_early_filter(&trace_ops, stack_trace_filter_buf, 1);
572
573 if (stack_tracer_enabled)
574 register_ftrace_function(&trace_ops);
575
576 return 0;
577}
578
579device_initcall(stack_trace_init);
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>
13#include <linux/sysctl.h>
14#include <linux/init.h>
15#include <linux/fs.h>
16
17#include <asm/setup.h>
18
19#include "trace.h"
20
21#define STACK_TRACE_ENTRIES 500
22
23static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES+1] =
24 { [0 ... (STACK_TRACE_ENTRIES)] = ULONG_MAX };
25static unsigned stack_dump_index[STACK_TRACE_ENTRIES];
26
27static struct stack_trace max_stack_trace = {
28 .max_entries = STACK_TRACE_ENTRIES,
29 .entries = stack_dump_trace,
30};
31
32static unsigned long max_stack_size;
33static arch_spinlock_t max_stack_lock =
34 (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED;
35
36static int stack_trace_disabled __read_mostly;
37static DEFINE_PER_CPU(int, trace_active);
38static DEFINE_MUTEX(stack_sysctl_mutex);
39
40int stack_tracer_enabled;
41static int last_stack_tracer_enabled;
42
43static inline void check_stack(void)
44{
45 unsigned long this_size, flags;
46 unsigned long *p, *top, *start;
47 int i;
48
49 this_size = ((unsigned long)&this_size) & (THREAD_SIZE-1);
50 this_size = THREAD_SIZE - this_size;
51
52 if (this_size <= max_stack_size)
53 return;
54
55 /* we do not handle interrupt stacks yet */
56 if (!object_is_on_stack(&this_size))
57 return;
58
59 local_irq_save(flags);
60 arch_spin_lock(&max_stack_lock);
61
62 /* a race could have already updated it */
63 if (this_size <= max_stack_size)
64 goto out;
65
66 max_stack_size = this_size;
67
68 max_stack_trace.nr_entries = 0;
69 max_stack_trace.skip = 3;
70
71 save_stack_trace(&max_stack_trace);
72
73 /*
74 * Now find where in the stack these are.
75 */
76 i = 0;
77 start = &this_size;
78 top = (unsigned long *)
79 (((unsigned long)start & ~(THREAD_SIZE-1)) + THREAD_SIZE);
80
81 /*
82 * Loop through all the entries. One of the entries may
83 * for some reason be missed on the stack, so we may
84 * have to account for them. If they are all there, this
85 * loop will only happen once. This code only takes place
86 * on a new max, so it is far from a fast path.
87 */
88 while (i < max_stack_trace.nr_entries) {
89 int found = 0;
90
91 stack_dump_index[i] = this_size;
92 p = start;
93
94 for (; p < top && i < max_stack_trace.nr_entries; p++) {
95 if (*p == stack_dump_trace[i]) {
96 this_size = stack_dump_index[i++] =
97 (top - p) * sizeof(unsigned long);
98 found = 1;
99 /* Start the search from here */
100 start = p + 1;
101 }
102 }
103
104 if (!found)
105 i++;
106 }
107
108 out:
109 arch_spin_unlock(&max_stack_lock);
110 local_irq_restore(flags);
111}
112
113static void
114stack_trace_call(unsigned long ip, unsigned long parent_ip)
115{
116 int cpu;
117
118 if (unlikely(!ftrace_enabled || stack_trace_disabled))
119 return;
120
121 preempt_disable_notrace();
122
123 cpu = raw_smp_processor_id();
124 /* no atomic needed, we only modify this variable by this cpu */
125 if (per_cpu(trace_active, cpu)++ != 0)
126 goto out;
127
128 check_stack();
129
130 out:
131 per_cpu(trace_active, cpu)--;
132 /* prevent recursion in schedule */
133 preempt_enable_notrace();
134}
135
136static struct ftrace_ops trace_ops __read_mostly =
137{
138 .func = stack_trace_call,
139};
140
141static ssize_t
142stack_max_size_read(struct file *filp, char __user *ubuf,
143 size_t count, loff_t *ppos)
144{
145 unsigned long *ptr = filp->private_data;
146 char buf[64];
147 int r;
148
149 r = snprintf(buf, sizeof(buf), "%ld\n", *ptr);
150 if (r > sizeof(buf))
151 r = sizeof(buf);
152 return simple_read_from_buffer(ubuf, count, ppos, buf, r);
153}
154
155static ssize_t
156stack_max_size_write(struct file *filp, const char __user *ubuf,
157 size_t count, loff_t *ppos)
158{
159 long *ptr = filp->private_data;
160 unsigned long val, flags;
161 int ret;
162 int cpu;
163
164 ret = kstrtoul_from_user(ubuf, count, 10, &val);
165 if (ret)
166 return ret;
167
168 local_irq_save(flags);
169
170 /*
171 * In case we trace inside arch_spin_lock() or after (NMI),
172 * we will cause circular lock, so we also need to increase
173 * the percpu trace_active here.
174 */
175 cpu = smp_processor_id();
176 per_cpu(trace_active, cpu)++;
177
178 arch_spin_lock(&max_stack_lock);
179 *ptr = val;
180 arch_spin_unlock(&max_stack_lock);
181
182 per_cpu(trace_active, cpu)--;
183 local_irq_restore(flags);
184
185 return count;
186}
187
188static const struct file_operations stack_max_size_fops = {
189 .open = tracing_open_generic,
190 .read = stack_max_size_read,
191 .write = stack_max_size_write,
192 .llseek = default_llseek,
193};
194
195static void *
196__next(struct seq_file *m, loff_t *pos)
197{
198 long n = *pos - 1;
199
200 if (n >= max_stack_trace.nr_entries || stack_dump_trace[n] == ULONG_MAX)
201 return NULL;
202
203 m->private = (void *)n;
204 return &m->private;
205}
206
207static void *
208t_next(struct seq_file *m, void *v, loff_t *pos)
209{
210 (*pos)++;
211 return __next(m, pos);
212}
213
214static void *t_start(struct seq_file *m, loff_t *pos)
215{
216 int cpu;
217
218 local_irq_disable();
219
220 cpu = smp_processor_id();
221 per_cpu(trace_active, cpu)++;
222
223 arch_spin_lock(&max_stack_lock);
224
225 if (*pos == 0)
226 return SEQ_START_TOKEN;
227
228 return __next(m, pos);
229}
230
231static void t_stop(struct seq_file *m, void *p)
232{
233 int cpu;
234
235 arch_spin_unlock(&max_stack_lock);
236
237 cpu = smp_processor_id();
238 per_cpu(trace_active, cpu)--;
239
240 local_irq_enable();
241}
242
243static int trace_lookup_stack(struct seq_file *m, long i)
244{
245 unsigned long addr = stack_dump_trace[i];
246
247 return seq_printf(m, "%pS\n", (void *)addr);
248}
249
250static void print_disabled(struct seq_file *m)
251{
252 seq_puts(m, "#\n"
253 "# Stack tracer disabled\n"
254 "#\n"
255 "# To enable the stack tracer, either add 'stacktrace' to the\n"
256 "# kernel command line\n"
257 "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
258 "#\n");
259}
260
261static int t_show(struct seq_file *m, void *v)
262{
263 long i;
264 int size;
265
266 if (v == SEQ_START_TOKEN) {
267 seq_printf(m, " Depth Size Location"
268 " (%d entries)\n"
269 " ----- ---- --------\n",
270 max_stack_trace.nr_entries - 1);
271
272 if (!stack_tracer_enabled && !max_stack_size)
273 print_disabled(m);
274
275 return 0;
276 }
277
278 i = *(long *)v;
279
280 if (i >= max_stack_trace.nr_entries ||
281 stack_dump_trace[i] == ULONG_MAX)
282 return 0;
283
284 if (i+1 == max_stack_trace.nr_entries ||
285 stack_dump_trace[i+1] == ULONG_MAX)
286 size = stack_dump_index[i];
287 else
288 size = stack_dump_index[i] - stack_dump_index[i+1];
289
290 seq_printf(m, "%3ld) %8d %5d ", i, stack_dump_index[i], size);
291
292 trace_lookup_stack(m, i);
293
294 return 0;
295}
296
297static const struct seq_operations stack_trace_seq_ops = {
298 .start = t_start,
299 .next = t_next,
300 .stop = t_stop,
301 .show = t_show,
302};
303
304static int stack_trace_open(struct inode *inode, struct file *file)
305{
306 return seq_open(file, &stack_trace_seq_ops);
307}
308
309static const struct file_operations stack_trace_fops = {
310 .open = stack_trace_open,
311 .read = seq_read,
312 .llseek = seq_lseek,
313 .release = seq_release,
314};
315
316static int
317stack_trace_filter_open(struct inode *inode, struct file *file)
318{
319 return ftrace_regex_open(&trace_ops, FTRACE_ITER_FILTER,
320 inode, file);
321}
322
323static const struct file_operations stack_trace_filter_fops = {
324 .open = stack_trace_filter_open,
325 .read = seq_read,
326 .write = ftrace_filter_write,
327 .llseek = ftrace_regex_lseek,
328 .release = ftrace_regex_release,
329};
330
331int
332stack_trace_sysctl(struct ctl_table *table, int write,
333 void __user *buffer, size_t *lenp,
334 loff_t *ppos)
335{
336 int ret;
337
338 mutex_lock(&stack_sysctl_mutex);
339
340 ret = proc_dointvec(table, write, buffer, lenp, ppos);
341
342 if (ret || !write ||
343 (last_stack_tracer_enabled == !!stack_tracer_enabled))
344 goto out;
345
346 last_stack_tracer_enabled = !!stack_tracer_enabled;
347
348 if (stack_tracer_enabled)
349 register_ftrace_function(&trace_ops);
350 else
351 unregister_ftrace_function(&trace_ops);
352
353 out:
354 mutex_unlock(&stack_sysctl_mutex);
355 return ret;
356}
357
358static char stack_trace_filter_buf[COMMAND_LINE_SIZE+1] __initdata;
359
360static __init int enable_stacktrace(char *str)
361{
362 if (strncmp(str, "_filter=", 8) == 0)
363 strncpy(stack_trace_filter_buf, str+8, COMMAND_LINE_SIZE);
364
365 stack_tracer_enabled = 1;
366 last_stack_tracer_enabled = 1;
367 return 1;
368}
369__setup("stacktrace", enable_stacktrace);
370
371static __init int stack_trace_init(void)
372{
373 struct dentry *d_tracer;
374
375 d_tracer = tracing_init_dentry();
376
377 trace_create_file("stack_max_size", 0644, d_tracer,
378 &max_stack_size, &stack_max_size_fops);
379
380 trace_create_file("stack_trace", 0444, d_tracer,
381 NULL, &stack_trace_fops);
382
383 trace_create_file("stack_trace_filter", 0444, d_tracer,
384 NULL, &stack_trace_filter_fops);
385
386 if (stack_trace_filter_buf[0])
387 ftrace_set_early_filter(&trace_ops, stack_trace_filter_buf, 1);
388
389 if (stack_tracer_enabled)
390 register_ftrace_function(&trace_ops);
391
392 return 0;
393}
394
395device_initcall(stack_trace_init);