trace_stack.c 10.2 KB
Newer Older
S
Steven Rostedt 已提交
1 2 3 4 5 6 7 8 9 10 11 12
/*
 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
 *
 */
#include <linux/stacktrace.h>
#include <linux/kallsyms.h>
#include <linux/seq_file.h>
#include <linux/spinlock.h>
#include <linux/uaccess.h>
#include <linux/debugfs.h>
#include <linux/ftrace.h>
#include <linux/module.h>
13
#include <linux/sysctl.h>
S
Steven Rostedt 已提交
14 15
#include <linux/init.h>
#include <linux/fs.h>
16
#include <linux/magic.h>
17 18 19

#include <asm/setup.h>

S
Steven Rostedt 已提交
20 21 22 23
#include "trace.h"

#define STACK_TRACE_ENTRIES 500

24
#ifdef CC_USING_FENTRY
25
# define fentry		1
26
#else
27
# define fentry		0
28 29
#endif

S
Steven Rostedt 已提交
30 31 32 33
static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES+1] =
	 { [0 ... (STACK_TRACE_ENTRIES)] = ULONG_MAX };
static unsigned stack_dump_index[STACK_TRACE_ENTRIES];

34 35 36 37 38
/*
 * Reserve one entry for the passed in ip. This will allow
 * us to remove most or all of the stack size overhead
 * added by the stack tracer itself.
 */
S
Steven Rostedt 已提交
39
static struct stack_trace max_stack_trace = {
40 41
	.max_entries		= STACK_TRACE_ENTRIES - 1,
	.entries		= &stack_dump_trace[1],
S
Steven Rostedt 已提交
42 43 44
};

static unsigned long max_stack_size;
45
static arch_spinlock_t max_stack_lock =
46
	(arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED;
S
Steven Rostedt 已提交
47 48

static DEFINE_PER_CPU(int, trace_active);
49 50 51 52
static DEFINE_MUTEX(stack_sysctl_mutex);

int stack_tracer_enabled;
static int last_stack_tracer_enabled;
S
Steven Rostedt 已提交
53

54
static inline void
55
check_stack(unsigned long ip, unsigned long *stack)
S
Steven Rostedt 已提交
56
{
S
Steven Rostedt 已提交
57 58
	unsigned long this_size, flags;
	unsigned long *p, *top, *start;
59 60
	static int tracer_frame;
	int frame_size = ACCESS_ONCE(tracer_frame);
S
Steven Rostedt 已提交
61
	int i;
S
Steven Rostedt 已提交
62

63
	this_size = ((unsigned long)stack) & (THREAD_SIZE-1);
S
Steven Rostedt 已提交
64
	this_size = THREAD_SIZE - this_size;
65 66
	/* Remove the frame of the tracer */
	this_size -= frame_size;
S
Steven Rostedt 已提交
67 68 69 70

	if (this_size <= max_stack_size)
		return;

71
	/* we do not handle interrupt stacks yet */
72
	if (!object_is_on_stack(stack))
73 74
		return;

75
	local_irq_save(flags);
76
	arch_spin_lock(&max_stack_lock);
S
Steven Rostedt 已提交
77

78 79 80 81
	/* In case another CPU set the tracer_frame on us */
	if (unlikely(!frame_size))
		this_size -= tracer_frame;

S
Steven Rostedt 已提交
82 83 84 85 86 87
	/* a race could have already updated it */
	if (this_size <= max_stack_size)
		goto out;

	max_stack_size = this_size;

88 89 90 91 92 93
	max_stack_trace.nr_entries = 0;

	if (using_ftrace_ops_list_func())
		max_stack_trace.skip = 4;
	else
		max_stack_trace.skip = 3;
S
Steven Rostedt 已提交
94 95 96

	save_stack_trace(&max_stack_trace);

97
	/*
98 99 100
	 * Add the passed in ip from the function tracer.
	 * Searching for this on the stack will skip over
	 * most of the overhead from the stack tracer itself.
101
	 */
102 103
	stack_dump_trace[0] = ip;
	max_stack_trace.nr_entries++;
104

S
Steven Rostedt 已提交
105 106 107 108
	/*
	 * Now find where in the stack these are.
	 */
	i = 0;
109
	start = stack;
S
Steven Rostedt 已提交
110 111 112 113 114 115 116 117 118 119 120
	top = (unsigned long *)
		(((unsigned long)start & ~(THREAD_SIZE-1)) + THREAD_SIZE);

	/*
	 * Loop through all the entries. One of the entries may
	 * for some reason be missed on the stack, so we may
	 * have to account for them. If they are all there, this
	 * loop will only happen once. This code only takes place
	 * on a new max, so it is far from a fast path.
	 */
	while (i < max_stack_trace.nr_entries) {
S
Steven Rostedt 已提交
121
		int found = 0;
S
Steven Rostedt 已提交
122 123 124 125 126 127 128 129

		stack_dump_index[i] = this_size;
		p = start;

		for (; p < top && i < max_stack_trace.nr_entries; p++) {
			if (*p == stack_dump_trace[i]) {
				this_size = stack_dump_index[i++] =
					(top - p) * sizeof(unsigned long);
S
Steven Rostedt 已提交
130
				found = 1;
S
Steven Rostedt 已提交
131 132
				/* Start the search from here */
				start = p + 1;
133 134 135 136 137 138 139 140 141 142 143 144
				/*
				 * We do not want to show the overhead
				 * of the stack tracer stack in the
				 * max stack. If we haven't figured
				 * out what that is, then figure it out
				 * now.
				 */
				if (unlikely(!tracer_frame) && i == 1) {
					tracer_frame = (p - stack) *
						sizeof(unsigned long);
					max_stack_size -= tracer_frame;
				}
S
Steven Rostedt 已提交
145 146 147
			}
		}

S
Steven Rostedt 已提交
148 149
		if (!found)
			i++;
S
Steven Rostedt 已提交
150 151
	}

152 153
	BUG_ON(current != &init_task &&
		*(end_of_stack(current)) != STACK_END_MAGIC);
S
Steven Rostedt 已提交
154
 out:
155
	arch_spin_unlock(&max_stack_lock);
156
	local_irq_restore(flags);
S
Steven Rostedt 已提交
157 158 159
}

static void
160 161
stack_trace_call(unsigned long ip, unsigned long parent_ip,
		 struct ftrace_ops *op, struct pt_regs *pt_regs)
S
Steven Rostedt 已提交
162
{
163
	unsigned long stack;
164
	int cpu;
S
Steven Rostedt 已提交
165

166
	preempt_disable_notrace();
S
Steven Rostedt 已提交
167 168 169 170 171 172

	cpu = raw_smp_processor_id();
	/* no atomic needed, we only modify this variable by this cpu */
	if (per_cpu(trace_active, cpu)++ != 0)
		goto out;

173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
	/*
	 * When fentry is used, the traced function does not get
	 * its stack frame set up, and we lose the parent.
	 * The ip is pretty useless because the function tracer
	 * was called before that function set up its stack frame.
	 * In this case, we use the parent ip.
	 *
	 * By adding the return address of either the parent ip
	 * or the current ip we can disregard most of the stack usage
	 * caused by the stack tracer itself.
	 *
	 * The function tracer always reports the address of where the
	 * mcount call was, but the stack will hold the return address.
	 */
	if (fentry)
		ip = parent_ip;
	else
		ip += MCOUNT_INSN_SIZE;

	check_stack(ip, &stack);
S
Steven Rostedt 已提交
193 194 195 196

 out:
	per_cpu(trace_active, cpu)--;
	/* prevent recursion in schedule */
197
	preempt_enable_notrace();
S
Steven Rostedt 已提交
198 199 200 201 202
}

static struct ftrace_ops trace_ops __read_mostly =
{
	.func = stack_trace_call,
203
	.flags = FTRACE_OPS_FL_RECURSION_SAFE,
S
Steven Rostedt 已提交
204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226
};

static ssize_t
stack_max_size_read(struct file *filp, char __user *ubuf,
		    size_t count, loff_t *ppos)
{
	unsigned long *ptr = filp->private_data;
	char buf[64];
	int r;

	r = snprintf(buf, sizeof(buf), "%ld\n", *ptr);
	if (r > sizeof(buf))
		r = sizeof(buf);
	return simple_read_from_buffer(ubuf, count, ppos, buf, r);
}

static ssize_t
stack_max_size_write(struct file *filp, const char __user *ubuf,
		     size_t count, loff_t *ppos)
{
	long *ptr = filp->private_data;
	unsigned long val, flags;
	int ret;
227
	int cpu;
S
Steven Rostedt 已提交
228

229 230
	ret = kstrtoul_from_user(ubuf, count, 10, &val);
	if (ret)
S
Steven Rostedt 已提交
231 232
		return ret;

233
	local_irq_save(flags);
234 235 236 237 238 239 240 241 242

	/*
	 * In case we trace inside arch_spin_lock() or after (NMI),
	 * we will cause circular lock, so we also need to increase
	 * the percpu trace_active here.
	 */
	cpu = smp_processor_id();
	per_cpu(trace_active, cpu)++;

243
	arch_spin_lock(&max_stack_lock);
S
Steven Rostedt 已提交
244
	*ptr = val;
245
	arch_spin_unlock(&max_stack_lock);
246 247

	per_cpu(trace_active, cpu)--;
248
	local_irq_restore(flags);
S
Steven Rostedt 已提交
249 250 251 252

	return count;
}

253
static const struct file_operations stack_max_size_fops = {
S
Steven Rostedt 已提交
254 255 256
	.open		= tracing_open_generic,
	.read		= stack_max_size_read,
	.write		= stack_max_size_write,
257
	.llseek		= default_llseek,
S
Steven Rostedt 已提交
258 259 260
};

static void *
L
Li Zefan 已提交
261
__next(struct seq_file *m, loff_t *pos)
S
Steven Rostedt 已提交
262
{
L
Li Zefan 已提交
263
	long n = *pos - 1;
S
Steven Rostedt 已提交
264

L
Li Zefan 已提交
265
	if (n >= max_stack_trace.nr_entries || stack_dump_trace[n] == ULONG_MAX)
S
Steven Rostedt 已提交
266 267
		return NULL;

L
Li Zefan 已提交
268
	m->private = (void *)n;
S
Steven Rostedt 已提交
269
	return &m->private;
S
Steven Rostedt 已提交
270 271
}

L
Li Zefan 已提交
272 273
static void *
t_next(struct seq_file *m, void *v, loff_t *pos)
S
Steven Rostedt 已提交
274
{
L
Li Zefan 已提交
275 276 277
	(*pos)++;
	return __next(m, pos);
}
S
Steven Rostedt 已提交
278

L
Li Zefan 已提交
279 280
static void *t_start(struct seq_file *m, loff_t *pos)
{
281 282
	int cpu;

S
Steven Rostedt 已提交
283
	local_irq_disable();
284 285 286 287

	cpu = smp_processor_id();
	per_cpu(trace_active, cpu)++;

288
	arch_spin_lock(&max_stack_lock);
S
Steven Rostedt 已提交
289

290 291 292
	if (*pos == 0)
		return SEQ_START_TOKEN;

L
Li Zefan 已提交
293
	return __next(m, pos);
S
Steven Rostedt 已提交
294 295 296 297
}

static void t_stop(struct seq_file *m, void *p)
{
298 299
	int cpu;

300
	arch_spin_unlock(&max_stack_lock);
301 302 303 304

	cpu = smp_processor_id();
	per_cpu(trace_active, cpu)--;

S
Steven Rostedt 已提交
305 306 307
	local_irq_enable();
}

S
Steven Rostedt 已提交
308
static int trace_lookup_stack(struct seq_file *m, long i)
S
Steven Rostedt 已提交
309
{
S
Steven Rostedt 已提交
310
	unsigned long addr = stack_dump_trace[i];
S
Steven Rostedt 已提交
311

312
	return seq_printf(m, "%pS\n", (void *)addr);
S
Steven Rostedt 已提交
313 314
}

315 316 317 318 319 320 321 322 323 324 325
static void print_disabled(struct seq_file *m)
{
	seq_puts(m, "#\n"
		 "#  Stack tracer disabled\n"
		 "#\n"
		 "# To enable the stack tracer, either add 'stacktrace' to the\n"
		 "# kernel command line\n"
		 "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
		 "#\n");
}

S
Steven Rostedt 已提交
326 327
static int t_show(struct seq_file *m, void *v)
{
328
	long i;
S
Steven Rostedt 已提交
329 330
	int size;

331
	if (v == SEQ_START_TOKEN) {
332
		seq_printf(m, "        Depth    Size   Location"
S
Steven Rostedt 已提交
333
			   "    (%d entries)\n"
334
			   "        -----    ----   --------\n",
335
			   max_stack_trace.nr_entries - 1);
336 337 338 339

		if (!stack_tracer_enabled && !max_stack_size)
			print_disabled(m);

S
Steven Rostedt 已提交
340 341
		return 0;
	}
S
Steven Rostedt 已提交
342

343 344
	i = *(long *)v;

S
Steven Rostedt 已提交
345 346
	if (i >= max_stack_trace.nr_entries ||
	    stack_dump_trace[i] == ULONG_MAX)
S
Steven Rostedt 已提交
347 348
		return 0;

S
Steven Rostedt 已提交
349 350 351 352 353 354 355 356 357
	if (i+1 == max_stack_trace.nr_entries ||
	    stack_dump_trace[i+1] == ULONG_MAX)
		size = stack_dump_index[i];
	else
		size = stack_dump_index[i] - stack_dump_index[i+1];

	seq_printf(m, "%3ld) %8d   %5d   ", i, stack_dump_index[i], size);

	trace_lookup_stack(m, i);
S
Steven Rostedt 已提交
358 359 360 361

	return 0;
}

362
static const struct seq_operations stack_trace_seq_ops = {
S
Steven Rostedt 已提交
363 364 365 366 367 368 369 370
	.start		= t_start,
	.next		= t_next,
	.stop		= t_stop,
	.show		= t_show,
};

static int stack_trace_open(struct inode *inode, struct file *file)
{
L
Li Zefan 已提交
371
	return seq_open(file, &stack_trace_seq_ops);
S
Steven Rostedt 已提交
372 373
}

374
static const struct file_operations stack_trace_fops = {
S
Steven Rostedt 已提交
375 376 377
	.open		= stack_trace_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
L
Li Zefan 已提交
378
	.release	= seq_release,
S
Steven Rostedt 已提交
379 380
};

381 382 383 384 385 386 387 388 389 390 391
static int
stack_trace_filter_open(struct inode *inode, struct file *file)
{
	return ftrace_regex_open(&trace_ops, FTRACE_ITER_FILTER,
				 inode, file);
}

static const struct file_operations stack_trace_filter_fops = {
	.open = stack_trace_filter_open,
	.read = seq_read,
	.write = ftrace_filter_write,
392
	.llseek = tracing_lseek,
393 394 395
	.release = ftrace_regex_release,
};

396 397
int
stack_trace_sysctl(struct ctl_table *table, int write,
398
		   void __user *buffer, size_t *lenp,
399 400 401 402 403 404
		   loff_t *ppos)
{
	int ret;

	mutex_lock(&stack_sysctl_mutex);

405
	ret = proc_dointvec(table, write, buffer, lenp, ppos);
406 407

	if (ret || !write ||
408
	    (last_stack_tracer_enabled == !!stack_tracer_enabled))
409 410
		goto out;

411
	last_stack_tracer_enabled = !!stack_tracer_enabled;
412 413 414 415 416 417 418 419 420 421 422

	if (stack_tracer_enabled)
		register_ftrace_function(&trace_ops);
	else
		unregister_ftrace_function(&trace_ops);

 out:
	mutex_unlock(&stack_sysctl_mutex);
	return ret;
}

423 424
static char stack_trace_filter_buf[COMMAND_LINE_SIZE+1] __initdata;

425 426
static __init int enable_stacktrace(char *str)
{
427 428 429
	if (strncmp(str, "_filter=", 8) == 0)
		strncpy(stack_trace_filter_buf, str+8, COMMAND_LINE_SIZE);

430 431
	stack_tracer_enabled = 1;
	last_stack_tracer_enabled = 1;
432 433 434 435
	return 1;
}
__setup("stacktrace", enable_stacktrace);

S
Steven Rostedt 已提交
436 437 438 439 440
static __init int stack_trace_init(void)
{
	struct dentry *d_tracer;

	d_tracer = tracing_init_dentry();
441 442
	if (!d_tracer)
		return 0;
S
Steven Rostedt 已提交
443

444 445
	trace_create_file("stack_max_size", 0644, d_tracer,
			&max_stack_size, &stack_max_size_fops);
S
Steven Rostedt 已提交
446

447 448
	trace_create_file("stack_trace", 0444, d_tracer,
			NULL, &stack_trace_fops);
S
Steven Rostedt 已提交
449

450 451 452
	trace_create_file("stack_trace_filter", 0444, d_tracer,
			NULL, &stack_trace_filter_fops);

453 454 455
	if (stack_trace_filter_buf[0])
		ftrace_set_early_filter(&trace_ops, stack_trace_filter_buf, 1);

456
	if (stack_tracer_enabled)
457
		register_ftrace_function(&trace_ops);
S
Steven Rostedt 已提交
458 459 460 461 462

	return 0;
}

device_initcall(stack_trace_init);