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