]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - kernel/trace/trace_stack.c
License cleanup: add SPDX GPL-2.0 license identifier to files with no license
[mirror_ubuntu-bionic-kernel.git] / kernel / trace / trace_stack.c
CommitLineData
b2441318 1// SPDX-License-Identifier: GPL-2.0
e5a81b62
SR
2/*
3 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
4 *
5 */
68db0cf1 6#include <linux/sched/task_stack.h>
e5a81b62
SR
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>
e5a81b62
SR
12#include <linux/ftrace.h>
13#include <linux/module.h>
f38f1d2a 14#include <linux/sysctl.h>
e5a81b62 15#include <linux/init.h>
762e1207
SR
16
17#include <asm/setup.h>
18
e5a81b62
SR
19#include "trace.h"
20
1b6cced6
SR
21static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES+1] =
22 { [0 ... (STACK_TRACE_ENTRIES)] = ULONG_MAX };
bb99d8cc 23unsigned stack_trace_index[STACK_TRACE_ENTRIES];
1b6cced6 24
4df29712
SRRH
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 */
bb99d8cc 30struct stack_trace stack_trace_max = {
4df29712 31 .max_entries = STACK_TRACE_ENTRIES - 1,
72ac426a 32 .entries = &stack_dump_trace[0],
e5a81b62
SR
33};
34
bb99d8cc 35unsigned long stack_trace_max_size;
d332736d 36arch_spinlock_t stack_trace_max_lock =
edc35bd7 37 (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED;
e5a81b62 38
8aaf1ee7 39DEFINE_PER_CPU(int, disable_stack_tracer);
f38f1d2a
SR
40static DEFINE_MUTEX(stack_sysctl_mutex);
41
42int stack_tracer_enabled;
43static int last_stack_tracer_enabled;
e5a81b62 44
bb99d8cc 45void stack_trace_print(void)
e3172181
MK
46{
47 long i;
48 int size;
49
50 pr_emerg(" Depth Size Location (%d entries)\n"
51 " ----- ---- --------\n",
bb99d8cc 52 stack_trace_max.nr_entries);
e3172181 53
bb99d8cc 54 for (i = 0; i < stack_trace_max.nr_entries; i++) {
e3172181
MK
55 if (stack_dump_trace[i] == ULONG_MAX)
56 break;
bb99d8cc 57 if (i+1 == stack_trace_max.nr_entries ||
e3172181 58 stack_dump_trace[i+1] == ULONG_MAX)
bb99d8cc 59 size = stack_trace_index[i];
e3172181 60 else
bb99d8cc 61 size = stack_trace_index[i] - stack_trace_index[i+1];
e3172181 62
bb99d8cc 63 pr_emerg("%3ld) %8d %5d %pS\n", i, stack_trace_index[i],
e3172181
MK
64 size, (void *)stack_dump_trace[i]);
65 }
66}
67
bb99d8cc 68/*
505d3085 69 * When arch-specific code overrides this function, the following
d332736d 70 * data should be filled up, assuming stack_trace_max_lock is held to
bb99d8cc
AT
71 * prevent concurrent updates.
72 * stack_trace_index[]
73 * stack_trace_max
74 * stack_trace_max_size
75 */
76void __weak
d4ecbfc4 77check_stack(unsigned long ip, unsigned long *stack)
e5a81b62 78{
e3172181 79 unsigned long this_size, flags; unsigned long *p, *top, *start;
4df29712
SRRH
80 static int tracer_frame;
81 int frame_size = ACCESS_ONCE(tracer_frame);
72ac426a 82 int i, x;
e5a81b62 83
87889501 84 this_size = ((unsigned long)stack) & (THREAD_SIZE-1);
e5a81b62 85 this_size = THREAD_SIZE - this_size;
4df29712
SRRH
86 /* Remove the frame of the tracer */
87 this_size -= frame_size;
e5a81b62 88
bb99d8cc 89 if (this_size <= stack_trace_max_size)
e5a81b62
SR
90 return;
91
81520a1b 92 /* we do not handle interrupt stacks yet */
87889501 93 if (!object_is_on_stack(stack))
81520a1b
SR
94 return;
95
1904be1b
SRRH
96 /* Can't do this from NMI context (can cause deadlocks) */
97 if (in_nmi())
98 return;
99
a5e25883 100 local_irq_save(flags);
d332736d 101 arch_spin_lock(&stack_trace_max_lock);
e5a81b62 102
4df29712
SRRH
103 /* In case another CPU set the tracer_frame on us */
104 if (unlikely(!frame_size))
105 this_size -= tracer_frame;
106
e5a81b62 107 /* a race could have already updated it */
bb99d8cc 108 if (this_size <= stack_trace_max_size)
e5a81b62
SR
109 goto out;
110
bb99d8cc 111 stack_trace_max_size = this_size;
e5a81b62 112
bb99d8cc
AT
113 stack_trace_max.nr_entries = 0;
114 stack_trace_max.skip = 3;
e5a81b62 115
bb99d8cc 116 save_stack_trace(&stack_trace_max);
e5a81b62 117
72ac426a 118 /* Skip over the overhead of the stack tracer itself */
bb99d8cc 119 for (i = 0; i < stack_trace_max.nr_entries; i++) {
72ac426a
SRRH
120 if (stack_dump_trace[i] == ip)
121 break;
122 }
d4ecbfc4 123
6ccd8371
SR
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
1b6cced6
SR
131 /*
132 * Now find where in the stack these are.
133 */
72ac426a 134 x = 0;
87889501 135 start = stack;
1b6cced6
SR
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 */
bb99d8cc 146 while (i < stack_trace_max.nr_entries) {
0a37119d 147 int found = 0;
1b6cced6 148
bb99d8cc 149 stack_trace_index[x] = this_size;
1b6cced6
SR
150 p = start;
151
bb99d8cc 152 for (; p < top && i < stack_trace_max.nr_entries; p++) {
72ac426a
SRRH
153 if (stack_dump_trace[i] == ULONG_MAX)
154 break;
6e22c836
YS
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]) {
72ac426a 160 stack_dump_trace[x] = stack_dump_trace[i++];
bb99d8cc 161 this_size = stack_trace_index[x++] =
1b6cced6 162 (top - p) * sizeof(unsigned long);
0a37119d 163 found = 1;
1b6cced6
SR
164 /* Start the search from here */
165 start = p + 1;
4df29712
SRRH
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 */
72ac426a 173 if (unlikely(!tracer_frame)) {
4df29712
SRRH
174 tracer_frame = (p - stack) *
175 sizeof(unsigned long);
bb99d8cc 176 stack_trace_max_size -= tracer_frame;
4df29712 177 }
1b6cced6
SR
178 }
179 }
180
0a37119d
SR
181 if (!found)
182 i++;
1b6cced6
SR
183 }
184
bb99d8cc 185 stack_trace_max.nr_entries = x;
72ac426a
SRRH
186 for (; x < i; x++)
187 stack_dump_trace[x] = ULONG_MAX;
188
a70857e4 189 if (task_stack_end_corrupted(current)) {
bb99d8cc 190 stack_trace_print();
e3172181
MK
191 BUG();
192 }
193
e5a81b62 194 out:
d332736d 195 arch_spin_unlock(&stack_trace_max_lock);
a5e25883 196 local_irq_restore(flags);
e5a81b62
SR
197}
198
199static void
a1e2e31d
SR
200stack_trace_call(unsigned long ip, unsigned long parent_ip,
201 struct ftrace_ops *op, struct pt_regs *pt_regs)
e5a81b62 202{
87889501 203 unsigned long stack;
e5a81b62 204
5168ae50 205 preempt_disable_notrace();
e5a81b62 206
e5a81b62 207 /* no atomic needed, we only modify this variable by this cpu */
8aaf1ee7
SRV
208 __this_cpu_inc(disable_stack_tracer);
209 if (__this_cpu_read(disable_stack_tracer) != 1)
e5a81b62
SR
210 goto out;
211
72ac426a 212 ip += MCOUNT_INSN_SIZE;
4df29712
SRRH
213
214 check_stack(ip, &stack);
e5a81b62
SR
215
216 out:
8aaf1ee7 217 __this_cpu_dec(disable_stack_tracer);
e5a81b62 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
SR
248 int ret;
249
22fe9b54
PH
250 ret = kstrtoul_from_user(ubuf, count, 10, &val);
251 if (ret)
e5a81b62
SR
252 return ret;
253
a5e25883 254 local_irq_save(flags);
4f48f8b7
LJ
255
256 /*
257 * In case we trace inside arch_spin_lock() or after (NMI),
258 * we will cause circular lock, so we also need to increase
8aaf1ee7 259 * the percpu disable_stack_tracer here.
4f48f8b7 260 */
8aaf1ee7 261 __this_cpu_inc(disable_stack_tracer);
4f48f8b7 262
d332736d 263 arch_spin_lock(&stack_trace_max_lock);
e5a81b62 264 *ptr = val;
d332736d 265 arch_spin_unlock(&stack_trace_max_lock);
4f48f8b7 266
8aaf1ee7 267 __this_cpu_dec(disable_stack_tracer);
a5e25883 268 local_irq_restore(flags);
e5a81b62
SR
269
270 return count;
271}
272
f38f1d2a 273static const struct file_operations stack_max_size_fops = {
e5a81b62
SR
274 .open = tracing_open_generic,
275 .read = stack_max_size_read,
276 .write = stack_max_size_write,
6038f373 277 .llseek = default_llseek,
e5a81b62
SR
278};
279
280static void *
2fc5f0cf 281__next(struct seq_file *m, loff_t *pos)
e5a81b62 282{
2fc5f0cf 283 long n = *pos - 1;
e5a81b62 284
bb99d8cc 285 if (n > stack_trace_max.nr_entries || stack_dump_trace[n] == ULONG_MAX)
e5a81b62
SR
286 return NULL;
287
2fc5f0cf 288 m->private = (void *)n;
1b6cced6 289 return &m->private;
e5a81b62
SR
290}
291
2fc5f0cf
LZ
292static void *
293t_next(struct seq_file *m, void *v, loff_t *pos)
e5a81b62 294{
2fc5f0cf
LZ
295 (*pos)++;
296 return __next(m, pos);
297}
e5a81b62 298
2fc5f0cf
LZ
299static void *t_start(struct seq_file *m, loff_t *pos)
300{
e5a81b62 301 local_irq_disable();
4f48f8b7 302
8aaf1ee7 303 __this_cpu_inc(disable_stack_tracer);
4f48f8b7 304
d332736d 305 arch_spin_lock(&stack_trace_max_lock);
e5a81b62 306
522a110b
LW
307 if (*pos == 0)
308 return SEQ_START_TOKEN;
309
2fc5f0cf 310 return __next(m, pos);
e5a81b62
SR
311}
312
313static void t_stop(struct seq_file *m, void *p)
314{
d332736d 315 arch_spin_unlock(&stack_trace_max_lock);
4f48f8b7 316
8aaf1ee7 317 __this_cpu_dec(disable_stack_tracer);
4f48f8b7 318
e5a81b62
SR
319 local_irq_enable();
320}
321
962e3707 322static void trace_lookup_stack(struct seq_file *m, long i)
e5a81b62 323{
1b6cced6 324 unsigned long addr = stack_dump_trace[i];
e5a81b62 325
962e3707 326 seq_printf(m, "%pS\n", (void *)addr);
e5a81b62
SR
327}
328
e447e1df
SR
329static void print_disabled(struct seq_file *m)
330{
331 seq_puts(m, "#\n"
332 "# Stack tracer disabled\n"
333 "#\n"
334 "# To enable the stack tracer, either add 'stacktrace' to the\n"
335 "# kernel command line\n"
336 "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
337 "#\n");
338}
339
e5a81b62
SR
340static int t_show(struct seq_file *m, void *v)
341{
522a110b 342 long i;
1b6cced6
SR
343 int size;
344
522a110b 345 if (v == SEQ_START_TOKEN) {
eb1871f3 346 seq_printf(m, " Depth Size Location"
1b6cced6 347 " (%d entries)\n"
eb1871f3 348 " ----- ---- --------\n",
bb99d8cc 349 stack_trace_max.nr_entries);
e447e1df 350
bb99d8cc 351 if (!stack_tracer_enabled && !stack_trace_max_size)
e447e1df
SR
352 print_disabled(m);
353
1b6cced6
SR
354 return 0;
355 }
e5a81b62 356
522a110b
LW
357 i = *(long *)v;
358
bb99d8cc 359 if (i >= stack_trace_max.nr_entries ||
1b6cced6 360 stack_dump_trace[i] == ULONG_MAX)
e5a81b62
SR
361 return 0;
362
bb99d8cc 363 if (i+1 == stack_trace_max.nr_entries ||
1b6cced6 364 stack_dump_trace[i+1] == ULONG_MAX)
bb99d8cc 365 size = stack_trace_index[i];
1b6cced6 366 else
bb99d8cc 367 size = stack_trace_index[i] - stack_trace_index[i+1];
1b6cced6 368
bb99d8cc 369 seq_printf(m, "%3ld) %8d %5d ", i, stack_trace_index[i], size);
1b6cced6
SR
370
371 trace_lookup_stack(m, i);
e5a81b62
SR
372
373 return 0;
374}
375
f38f1d2a 376static const struct seq_operations stack_trace_seq_ops = {
e5a81b62
SR
377 .start = t_start,
378 .next = t_next,
379 .stop = t_stop,
380 .show = t_show,
381};
382
383static int stack_trace_open(struct inode *inode, struct file *file)
384{
d8cc1ab7 385 return seq_open(file, &stack_trace_seq_ops);
e5a81b62
SR
386}
387
f38f1d2a 388static const struct file_operations stack_trace_fops = {
e5a81b62
SR
389 .open = stack_trace_open,
390 .read = seq_read,
391 .llseek = seq_lseek,
d8cc1ab7 392 .release = seq_release,
e5a81b62
SR
393};
394
bbd1d27d
SRV
395#ifdef CONFIG_DYNAMIC_FTRACE
396
d2d45c7a
SR
397static int
398stack_trace_filter_open(struct inode *inode, struct file *file)
399{
0f179765
SRV
400 struct ftrace_ops *ops = inode->i_private;
401
402 return ftrace_regex_open(ops, FTRACE_ITER_FILTER,
d2d45c7a
SR
403 inode, file);
404}
405
406static const struct file_operations stack_trace_filter_fops = {
407 .open = stack_trace_filter_open,
408 .read = seq_read,
409 .write = ftrace_filter_write,
098c879e 410 .llseek = tracing_lseek,
d2d45c7a
SR
411 .release = ftrace_regex_release,
412};
413
bbd1d27d
SRV
414#endif /* CONFIG_DYNAMIC_FTRACE */
415
f38f1d2a
SR
416int
417stack_trace_sysctl(struct ctl_table *table, int write,
8d65af78 418 void __user *buffer, size_t *lenp,
f38f1d2a
SR
419 loff_t *ppos)
420{
421 int ret;
422
423 mutex_lock(&stack_sysctl_mutex);
424
8d65af78 425 ret = proc_dointvec(table, write, buffer, lenp, ppos);
f38f1d2a
SR
426
427 if (ret || !write ||
a32c7765 428 (last_stack_tracer_enabled == !!stack_tracer_enabled))
f38f1d2a
SR
429 goto out;
430
a32c7765 431 last_stack_tracer_enabled = !!stack_tracer_enabled;
f38f1d2a
SR
432
433 if (stack_tracer_enabled)
434 register_ftrace_function(&trace_ops);
435 else
436 unregister_ftrace_function(&trace_ops);
437
438 out:
439 mutex_unlock(&stack_sysctl_mutex);
440 return ret;
441}
442
762e1207
SR
443static char stack_trace_filter_buf[COMMAND_LINE_SIZE+1] __initdata;
444
f38f1d2a
SR
445static __init int enable_stacktrace(char *str)
446{
762e1207
SR
447 if (strncmp(str, "_filter=", 8) == 0)
448 strncpy(stack_trace_filter_buf, str+8, COMMAND_LINE_SIZE);
449
e05a43b7
SR
450 stack_tracer_enabled = 1;
451 last_stack_tracer_enabled = 1;
f38f1d2a
SR
452 return 1;
453}
454__setup("stacktrace", enable_stacktrace);
455
e5a81b62
SR
456static __init int stack_trace_init(void)
457{
458 struct dentry *d_tracer;
e5a81b62
SR
459
460 d_tracer = tracing_init_dentry();
14a5ae40 461 if (IS_ERR(d_tracer))
ed6f1c99 462 return 0;
e5a81b62 463
5452af66 464 trace_create_file("stack_max_size", 0644, d_tracer,
bb99d8cc 465 &stack_trace_max_size, &stack_max_size_fops);
e5a81b62 466
5452af66
FW
467 trace_create_file("stack_trace", 0444, d_tracer,
468 NULL, &stack_trace_fops);
e5a81b62 469
bbd1d27d 470#ifdef CONFIG_DYNAMIC_FTRACE
d2d45c7a 471 trace_create_file("stack_trace_filter", 0444, d_tracer,
0f179765 472 &trace_ops, &stack_trace_filter_fops);
bbd1d27d 473#endif
d2d45c7a 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);