ftrace.c 73.9 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
/*
 * Infrastructure for profiling code inserted by 'gcc -pg'.
 *
 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
 *
 * Originally ported from the -rt patch by:
 *   Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
 *
 * Based on code in the latency_tracer, that is:
 *
 *  Copyright (C) 2004-2006 Ingo Molnar
 *  Copyright (C) 2004 William Lee Irwin III
 */

16 17 18
#include <linux/stop_machine.h>
#include <linux/clocksource.h>
#include <linux/kallsyms.h>
19
#include <linux/seq_file.h>
20
#include <linux/suspend.h>
21
#include <linux/debugfs.h>
22
#include <linux/hardirq.h>
I
Ingo Molnar 已提交
23
#include <linux/kthread.h>
24
#include <linux/uaccess.h>
I
Ingo Molnar 已提交
25
#include <linux/ftrace.h>
26
#include <linux/sysctl.h>
27
#include <linux/slab.h>
28
#include <linux/ctype.h>
29
#include <linux/list.h>
30
#include <linux/hash.h>
31
#include <linux/rcupdate.h>
32

33
#include <trace/events/sched.h>
34

35
#include <asm/ftrace.h>
36
#include <asm/setup.h>
37

38
#include "trace_output.h"
S
Steven Rostedt 已提交
39
#include "trace_stat.h"
40

41
#define FTRACE_WARN_ON(cond)			\
42 43 44
	({					\
		int ___r = cond;		\
		if (WARN_ON(___r))		\
45
			ftrace_kill();		\
46 47
		___r;				\
	})
48 49

#define FTRACE_WARN_ON_ONCE(cond)		\
50 51 52
	({					\
		int ___r = cond;		\
		if (WARN_ON_ONCE(___r))		\
53
			ftrace_kill();		\
54 55
		___r;				\
	})
56

57 58 59
/* hash bits for specific function selection */
#define FTRACE_HASH_BITS 7
#define FTRACE_FUNC_HASHSIZE (1 << FTRACE_HASH_BITS)
60
#define FTRACE_HASH_MAX_BITS 10
61

62 63
/* ftrace_enabled is a method to turn ftrace on or off */
int ftrace_enabled __read_mostly;
64
static int last_ftrace_enabled;
65

66 67 68
/* Quick disabling of function tracer. */
int function_trace_stop;

69 70 71 72 73 74 75
/* List for set_ftrace_pid's pids. */
LIST_HEAD(ftrace_pids);
struct ftrace_pid {
	struct list_head list;
	struct pid *pid;
};

76 77 78 79 80 81
/*
 * ftrace_disabled is set when an anomaly is discovered.
 * ftrace_disabled is much stronger than ftrace_enabled.
 */
static int ftrace_disabled __read_mostly;

82
static DEFINE_MUTEX(ftrace_lock);
83

84 85
static struct ftrace_ops ftrace_list_end __read_mostly =
{
86
	.func		= ftrace_stub,
87 88 89 90
};

static struct ftrace_ops *ftrace_list __read_mostly = &ftrace_list_end;
ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
91
ftrace_func_t __ftrace_trace_function __read_mostly = ftrace_stub;
92
ftrace_func_t ftrace_pid_function __read_mostly = ftrace_stub;
93

94 95 96 97 98 99 100 101 102
/*
 * Traverse the ftrace_list, invoking all entries.  The reason that we
 * can use rcu_dereference_raw() is that elements removed from this list
 * are simply leaked, so there is no need to interact with a grace-period
 * mechanism.  The rcu_dereference_raw() calls are needed to handle
 * concurrent insertions into the ftrace_list.
 *
 * Silly Alpha and silly pointer-speculation compiler optimizations!
 */
I
Ingo Molnar 已提交
103
static void ftrace_list_func(unsigned long ip, unsigned long parent_ip)
104
{
105
	struct ftrace_ops *op = rcu_dereference_raw(ftrace_list); /*see above*/
106 107 108

	while (op != &ftrace_list_end) {
		op->func(ip, parent_ip);
109
		op = rcu_dereference_raw(op->next); /*see above*/
110 111 112
	};
}

113 114
static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip)
{
115
	if (!test_tsk_trace_trace(current))
116 117 118 119 120 121 122 123 124 125 126 127
		return;

	ftrace_pid_function(ip, parent_ip);
}

static void set_ftrace_pid_function(ftrace_func_t func)
{
	/* do not set ftrace_pid_function to itself! */
	if (func != ftrace_pid_func)
		ftrace_pid_function = func;
}

128
/**
129
 * clear_ftrace_function - reset the ftrace function
130
 *
131 132
 * This NULLs the ftrace function and in essence stops
 * tracing.  There may be lag
133
 */
134
void clear_ftrace_function(void)
135
{
136
	ftrace_trace_function = ftrace_stub;
137
	__ftrace_trace_function = ftrace_stub;
138
	ftrace_pid_function = ftrace_stub;
139 140
}

141 142 143 144 145 146 147 148 149 150 151 152 153 154
#ifndef CONFIG_HAVE_FUNCTION_TRACE_MCOUNT_TEST
/*
 * For those archs that do not test ftrace_trace_stop in their
 * mcount call site, we need to do it from C.
 */
static void ftrace_test_stop_func(unsigned long ip, unsigned long parent_ip)
{
	if (function_trace_stop)
		return;

	__ftrace_trace_function(ip, parent_ip);
}
#endif

155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
static void update_ftrace_function(void)
{
	ftrace_func_t func;

	/*
	 * If there's only one function registered, then call that
	 * function directly. Otherwise, we need to iterate over the
	 * registered callers.
	 */
	if (ftrace_list == &ftrace_list_end ||
	    ftrace_list->next == &ftrace_list_end)
		func = ftrace_list->func;
	else
		func = ftrace_list_func;

	/* If we filter on pids, update to use the pid function */
	if (!list_empty(&ftrace_pids)) {
		set_ftrace_pid_function(func);
		func = ftrace_pid_func;
	}
#ifdef CONFIG_HAVE_FUNCTION_TRACE_MCOUNT_TEST
	ftrace_trace_function = func;
#else
	__ftrace_trace_function = func;
	ftrace_trace_function = ftrace_test_stop_func;
#endif
}

I
Ingo Molnar 已提交
183
static int __register_ftrace_function(struct ftrace_ops *ops)
184
{
185 186 187 188 189 190 191
	ops->next = ftrace_list;
	/*
	 * We are entering ops into the ftrace_list but another
	 * CPU might be walking that list. We need to make sure
	 * the ops->next pointer is valid before another CPU sees
	 * the ops pointer included into the ftrace_list.
	 */
192
	rcu_assign_pointer(ftrace_list, ops);
193

194 195
	if (ftrace_enabled)
		update_ftrace_function();
196

197 198 199
	return 0;
}

I
Ingo Molnar 已提交
200
static int __unregister_ftrace_function(struct ftrace_ops *ops)
201 202 203 204
{
	struct ftrace_ops **p;

	/*
205 206
	 * If we are removing the last function, then simply point
	 * to the ftrace_stub.
207 208 209 210
	 */
	if (ftrace_list == ops && ops->next == &ftrace_list_end) {
		ftrace_trace_function = ftrace_stub;
		ftrace_list = &ftrace_list_end;
S
Steven Rostedt 已提交
211
		return 0;
212 213 214 215 216 217
	}

	for (p = &ftrace_list; *p != &ftrace_list_end; p = &(*p)->next)
		if (*p == ops)
			break;

S
Steven Rostedt 已提交
218 219
	if (*p != ops)
		return -1;
220 221 222

	*p = (*p)->next;

223 224
	if (ftrace_enabled)
		update_ftrace_function();
225

S
Steven Rostedt 已提交
226
	return 0;
227 228
}

229 230
static void ftrace_update_pid_func(void)
{
231
	/* Only do something if we are tracing something */
232
	if (ftrace_trace_function == ftrace_stub)
233
		return;
234

235
	update_ftrace_function();
236 237
}

238 239 240 241 242
#ifdef CONFIG_FUNCTION_PROFILER
struct ftrace_profile {
	struct hlist_node		node;
	unsigned long			ip;
	unsigned long			counter;
243 244
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
	unsigned long long		time;
245
	unsigned long long		time_squared;
246
#endif
247 248
};

249 250 251 252
struct ftrace_profile_page {
	struct ftrace_profile_page	*next;
	unsigned long			index;
	struct ftrace_profile		records[];
253 254
};

255 256 257 258 259 260 261 262
struct ftrace_profile_stat {
	atomic_t			disabled;
	struct hlist_head		*hash;
	struct ftrace_profile_page	*pages;
	struct ftrace_profile_page	*start;
	struct tracer_stat		stat;
};

263 264
#define PROFILE_RECORDS_SIZE						\
	(PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
265

266 267
#define PROFILES_PER_PAGE					\
	(PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
268

269 270 271 272
static int ftrace_profile_bits __read_mostly;
static int ftrace_profile_enabled __read_mostly;

/* ftrace_profile_lock - synchronize the enable and disable of the profiler */
S
Steven Rostedt 已提交
273 274
static DEFINE_MUTEX(ftrace_profile_lock);

275
static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
276 277 278

#define FTRACE_PROFILE_HASH_SIZE 1024 /* must be power of 2 */

S
Steven Rostedt 已提交
279 280 281
static void *
function_stat_next(void *v, int idx)
{
282 283
	struct ftrace_profile *rec = v;
	struct ftrace_profile_page *pg;
S
Steven Rostedt 已提交
284

285
	pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
S
Steven Rostedt 已提交
286 287

 again:
L
Li Zefan 已提交
288 289 290
	if (idx != 0)
		rec++;

S
Steven Rostedt 已提交
291 292 293 294 295
	if ((void *)rec >= (void *)&pg->records[pg->index]) {
		pg = pg->next;
		if (!pg)
			return NULL;
		rec = &pg->records[0];
296 297
		if (!rec->counter)
			goto again;
S
Steven Rostedt 已提交
298 299 300 301 302 303 304
	}

	return rec;
}

static void *function_stat_start(struct tracer_stat *trace)
{
305 306 307 308 309 310 311
	struct ftrace_profile_stat *stat =
		container_of(trace, struct ftrace_profile_stat, stat);

	if (!stat || !stat->start)
		return NULL;

	return function_stat_next(&stat->start->records[0], 0);
S
Steven Rostedt 已提交
312 313
}

314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
/* function graph compares on total time */
static int function_stat_cmp(void *p1, void *p2)
{
	struct ftrace_profile *a = p1;
	struct ftrace_profile *b = p2;

	if (a->time < b->time)
		return -1;
	if (a->time > b->time)
		return 1;
	else
		return 0;
}
#else
/* not function graph compares against hits */
S
Steven Rostedt 已提交
330 331
static int function_stat_cmp(void *p1, void *p2)
{
332 333
	struct ftrace_profile *a = p1;
	struct ftrace_profile *b = p2;
S
Steven Rostedt 已提交
334 335 336 337 338 339 340 341

	if (a->counter < b->counter)
		return -1;
	if (a->counter > b->counter)
		return 1;
	else
		return 0;
}
342
#endif
S
Steven Rostedt 已提交
343 344 345

static int function_stat_headers(struct seq_file *m)
{
346
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
347
	seq_printf(m, "  Function                               "
348
		   "Hit    Time            Avg             s^2\n"
349
		      "  --------                               "
350
		   "---    ----            ---             ---\n");
351
#else
S
Steven Rostedt 已提交
352 353
	seq_printf(m, "  Function                               Hit\n"
		      "  --------                               ---\n");
354
#endif
S
Steven Rostedt 已提交
355 356 357 358 359
	return 0;
}

static int function_stat_show(struct seq_file *m, void *v)
{
360
	struct ftrace_profile *rec = v;
S
Steven Rostedt 已提交
361
	char str[KSYM_SYMBOL_LEN];
362
	int ret = 0;
363
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
364 365
	static struct trace_seq s;
	unsigned long long avg;
366
	unsigned long long stddev;
367
#endif
368 369 370 371 372 373 374
	mutex_lock(&ftrace_profile_lock);

	/* we raced with function_profile_reset() */
	if (unlikely(rec->counter == 0)) {
		ret = -EBUSY;
		goto out;
	}
S
Steven Rostedt 已提交
375 376

	kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
377 378 379 380
	seq_printf(m, "  %-30.30s  %10lu", str, rec->counter);

#ifdef CONFIG_FUNCTION_GRAPH_TRACER
	seq_printf(m, "    ");
381 382 383
	avg = rec->time;
	do_div(avg, rec->counter);

384 385 386 387 388 389 390 391 392 393 394 395
	/* Sample standard deviation (s^2) */
	if (rec->counter <= 1)
		stddev = 0;
	else {
		stddev = rec->time_squared - rec->counter * avg * avg;
		/*
		 * Divide only 1000 for ns^2 -> us^2 conversion.
		 * trace_print_graph_duration will divide 1000 again.
		 */
		do_div(stddev, (rec->counter - 1) * 1000);
	}

396 397 398 399
	trace_seq_init(&s);
	trace_print_graph_duration(rec->time, &s);
	trace_seq_puts(&s, "    ");
	trace_print_graph_duration(avg, &s);
400 401
	trace_seq_puts(&s, "    ");
	trace_print_graph_duration(stddev, &s);
402 403 404
	trace_print_seq(m, &s);
#endif
	seq_putc(m, '\n');
405 406
out:
	mutex_unlock(&ftrace_profile_lock);
S
Steven Rostedt 已提交
407

408
	return ret;
S
Steven Rostedt 已提交
409 410
}

411
static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
S
Steven Rostedt 已提交
412
{
413
	struct ftrace_profile_page *pg;
S
Steven Rostedt 已提交
414

415
	pg = stat->pages = stat->start;
S
Steven Rostedt 已提交
416

417 418 419 420
	while (pg) {
		memset(pg->records, 0, PROFILE_RECORDS_SIZE);
		pg->index = 0;
		pg = pg->next;
S
Steven Rostedt 已提交
421 422
	}

423
	memset(stat->hash, 0,
424 425
	       FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
}
S
Steven Rostedt 已提交
426

427
int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
428 429
{
	struct ftrace_profile_page *pg;
430 431
	int functions;
	int pages;
432
	int i;
S
Steven Rostedt 已提交
433

434
	/* If we already allocated, do nothing */
435
	if (stat->pages)
436
		return 0;
S
Steven Rostedt 已提交
437

438 439
	stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
	if (!stat->pages)
440
		return -ENOMEM;
S
Steven Rostedt 已提交
441

442 443 444 445 446 447 448 449 450 451 452 453 454
#ifdef CONFIG_DYNAMIC_FTRACE
	functions = ftrace_update_tot_cnt;
#else
	/*
	 * We do not know the number of functions that exist because
	 * dynamic tracing is what counts them. With past experience
	 * we have around 20K functions. That should be more than enough.
	 * It is highly unlikely we will execute every function in
	 * the kernel.
	 */
	functions = 20000;
#endif

455
	pg = stat->start = stat->pages;
S
Steven Rostedt 已提交
456

457 458 459
	pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);

	for (i = 0; i < pages; i++) {
460 461
		pg->next = (void *)get_zeroed_page(GFP_KERNEL);
		if (!pg->next)
462
			goto out_free;
463 464 465 466
		pg = pg->next;
	}

	return 0;
467 468 469 470 471 472 473 474 475 476 477 478 479 480 481

 out_free:
	pg = stat->start;
	while (pg) {
		unsigned long tmp = (unsigned long)pg;

		pg = pg->next;
		free_page(tmp);
	}

	free_page((unsigned long)stat->pages);
	stat->pages = NULL;
	stat->start = NULL;

	return -ENOMEM;
S
Steven Rostedt 已提交
482 483
}

484
static int ftrace_profile_init_cpu(int cpu)
S
Steven Rostedt 已提交
485
{
486
	struct ftrace_profile_stat *stat;
487
	int size;
S
Steven Rostedt 已提交
488

489 490 491
	stat = &per_cpu(ftrace_profile_stats, cpu);

	if (stat->hash) {
492
		/* If the profile is already created, simply reset it */
493
		ftrace_profile_reset(stat);
494 495
		return 0;
	}
S
Steven Rostedt 已提交
496

497 498 499 500 501
	/*
	 * We are profiling all functions, but usually only a few thousand
	 * functions are hit. We'll make a hash of 1024 items.
	 */
	size = FTRACE_PROFILE_HASH_SIZE;
S
Steven Rostedt 已提交
502

503
	stat->hash = kzalloc(sizeof(struct hlist_head) * size, GFP_KERNEL);
504

505
	if (!stat->hash)
506 507
		return -ENOMEM;

508 509
	if (!ftrace_profile_bits) {
		size--;
510

511 512 513
		for (; size; size >>= 1)
			ftrace_profile_bits++;
	}
514

515
	/* Preallocate the function profiling pages */
516 517 518
	if (ftrace_profile_pages_init(stat) < 0) {
		kfree(stat->hash);
		stat->hash = NULL;
519 520 521 522
		return -ENOMEM;
	}

	return 0;
S
Steven Rostedt 已提交
523 524
}

525 526 527 528 529 530 531 532 533 534 535 536 537 538
static int ftrace_profile_init(void)
{
	int cpu;
	int ret = 0;

	for_each_online_cpu(cpu) {
		ret = ftrace_profile_init_cpu(cpu);
		if (ret)
			break;
	}

	return ret;
}

539
/* interrupts must be disabled */
540 541
static struct ftrace_profile *
ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
S
Steven Rostedt 已提交
542
{
543
	struct ftrace_profile *rec;
S
Steven Rostedt 已提交
544 545 546 547 548
	struct hlist_head *hhd;
	struct hlist_node *n;
	unsigned long key;

	key = hash_long(ip, ftrace_profile_bits);
549
	hhd = &stat->hash[key];
S
Steven Rostedt 已提交
550 551 552 553 554 555

	if (hlist_empty(hhd))
		return NULL;

	hlist_for_each_entry_rcu(rec, n, hhd, node) {
		if (rec->ip == ip)
556 557 558 559 560 561
			return rec;
	}

	return NULL;
}

562 563
static void ftrace_add_profile(struct ftrace_profile_stat *stat,
			       struct ftrace_profile *rec)
564 565 566 567
{
	unsigned long key;

	key = hash_long(rec->ip, ftrace_profile_bits);
568
	hlist_add_head_rcu(&rec->node, &stat->hash[key]);
569 570
}

571 572 573
/*
 * The memory is already allocated, this simply finds a new record to use.
 */
574
static struct ftrace_profile *
575
ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
576 577 578
{
	struct ftrace_profile *rec = NULL;

579
	/* prevent recursion (from NMIs) */
580
	if (atomic_inc_return(&stat->disabled) != 1)
581 582 583
		goto out;

	/*
584 585
	 * Try to find the function again since an NMI
	 * could have added it
586
	 */
587
	rec = ftrace_find_profiled_func(stat, ip);
588
	if (rec)
589
		goto out;
590

591 592 593 594
	if (stat->pages->index == PROFILES_PER_PAGE) {
		if (!stat->pages->next)
			goto out;
		stat->pages = stat->pages->next;
S
Steven Rostedt 已提交
595
	}
596

597
	rec = &stat->pages->records[stat->pages->index++];
598
	rec->ip = ip;
599
	ftrace_add_profile(stat, rec);
600

S
Steven Rostedt 已提交
601
 out:
602
	atomic_dec(&stat->disabled);
S
Steven Rostedt 已提交
603 604 605 606 607 608 609

	return rec;
}

static void
function_profile_call(unsigned long ip, unsigned long parent_ip)
{
610
	struct ftrace_profile_stat *stat;
611
	struct ftrace_profile *rec;
S
Steven Rostedt 已提交
612 613 614 615 616 617
	unsigned long flags;

	if (!ftrace_profile_enabled)
		return;

	local_irq_save(flags);
618 619

	stat = &__get_cpu_var(ftrace_profile_stats);
620
	if (!stat->hash || !ftrace_profile_enabled)
621 622 623
		goto out;

	rec = ftrace_find_profiled_func(stat, ip);
624
	if (!rec) {
625
		rec = ftrace_profile_alloc(stat, ip);
626 627 628
		if (!rec)
			goto out;
	}
S
Steven Rostedt 已提交
629 630 631 632 633 634

	rec->counter++;
 out:
	local_irq_restore(flags);
}

635 636 637 638 639 640 641 642 643
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
static int profile_graph_entry(struct ftrace_graph_ent *trace)
{
	function_profile_call(trace->func, 0);
	return 1;
}

static void profile_graph_return(struct ftrace_graph_ret *trace)
{
644
	struct ftrace_profile_stat *stat;
645
	unsigned long long calltime;
646
	struct ftrace_profile *rec;
647
	unsigned long flags;
648 649

	local_irq_save(flags);
650
	stat = &__get_cpu_var(ftrace_profile_stats);
651
	if (!stat->hash || !ftrace_profile_enabled)
652 653
		goto out;

654 655 656 657
	/* If the calltime was zero'd ignore it */
	if (!trace->calltime)
		goto out;

658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674
	calltime = trace->rettime - trace->calltime;

	if (!(trace_flags & TRACE_ITER_GRAPH_TIME)) {
		int index;

		index = trace->depth;

		/* Append this call time to the parent time to subtract */
		if (index)
			current->ret_stack[index - 1].subtime += calltime;

		if (current->ret_stack[index].subtime < calltime)
			calltime -= current->ret_stack[index].subtime;
		else
			calltime = 0;
	}

675
	rec = ftrace_find_profiled_func(stat, trace->func);
676
	if (rec) {
677
		rec->time += calltime;
678 679
		rec->time_squared += calltime * calltime;
	}
680

681
 out:
682 683 684 685 686 687 688 689 690 691 692 693 694 695
	local_irq_restore(flags);
}

static int register_ftrace_profiler(void)
{
	return register_ftrace_graph(&profile_graph_return,
				     &profile_graph_entry);
}

static void unregister_ftrace_profiler(void)
{
	unregister_ftrace_graph();
}
#else
S
Steven Rostedt 已提交
696 697
static struct ftrace_ops ftrace_profile_ops __read_mostly =
{
698
	.func		= function_profile_call,
S
Steven Rostedt 已提交
699 700
};

701 702 703 704 705 706 707 708 709 710 711
static int register_ftrace_profiler(void)
{
	return register_ftrace_function(&ftrace_profile_ops);
}

static void unregister_ftrace_profiler(void)
{
	unregister_ftrace_function(&ftrace_profile_ops);
}
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */

S
Steven Rostedt 已提交
712 713 714 715 716
static ssize_t
ftrace_profile_write(struct file *filp, const char __user *ubuf,
		     size_t cnt, loff_t *ppos)
{
	unsigned long val;
717
	char buf[64];		/* big enough to hold a number */
S
Steven Rostedt 已提交
718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736
	int ret;

	if (cnt >= sizeof(buf))
		return -EINVAL;

	if (copy_from_user(&buf, ubuf, cnt))
		return -EFAULT;

	buf[cnt] = 0;

	ret = strict_strtoul(buf, 10, &val);
	if (ret < 0)
		return ret;

	val = !!val;

	mutex_lock(&ftrace_profile_lock);
	if (ftrace_profile_enabled ^ val) {
		if (val) {
737 738 739 740 741 742
			ret = ftrace_profile_init();
			if (ret < 0) {
				cnt = ret;
				goto out;
			}

743 744 745 746 747
			ret = register_ftrace_profiler();
			if (ret < 0) {
				cnt = ret;
				goto out;
			}
S
Steven Rostedt 已提交
748 749 750
			ftrace_profile_enabled = 1;
		} else {
			ftrace_profile_enabled = 0;
751 752 753 754
			/*
			 * unregister_ftrace_profiler calls stop_machine
			 * so this acts like an synchronize_sched.
			 */
755
			unregister_ftrace_profiler();
S
Steven Rostedt 已提交
756 757
		}
	}
758
 out:
S
Steven Rostedt 已提交
759 760
	mutex_unlock(&ftrace_profile_lock);

761
	*ppos += cnt;
S
Steven Rostedt 已提交
762 763 764 765

	return cnt;
}

766 767 768 769
static ssize_t
ftrace_profile_read(struct file *filp, char __user *ubuf,
		     size_t cnt, loff_t *ppos)
{
770
	char buf[64];		/* big enough to hold a number */
771 772 773 774 775 776
	int r;

	r = sprintf(buf, "%u\n", ftrace_profile_enabled);
	return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
}

S
Steven Rostedt 已提交
777 778 779 780
static const struct file_operations ftrace_profile_fops = {
	.open		= tracing_open_generic,
	.read		= ftrace_profile_read,
	.write		= ftrace_profile_write,
781
	.llseek		= default_llseek,
S
Steven Rostedt 已提交
782 783
};

784 785
/* used to initialize the real stat files */
static struct tracer_stat function_stats __initdata = {
786 787 788 789 790 791
	.name		= "functions",
	.stat_start	= function_stat_start,
	.stat_next	= function_stat_next,
	.stat_cmp	= function_stat_cmp,
	.stat_headers	= function_stat_headers,
	.stat_show	= function_stat_show
792 793
};

794
static __init void ftrace_profile_debugfs(struct dentry *d_tracer)
S
Steven Rostedt 已提交
795
{
796
	struct ftrace_profile_stat *stat;
S
Steven Rostedt 已提交
797
	struct dentry *entry;
798
	char *name;
S
Steven Rostedt 已提交
799
	int ret;
800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827
	int cpu;

	for_each_possible_cpu(cpu) {
		stat = &per_cpu(ftrace_profile_stats, cpu);

		/* allocate enough for function name + cpu number */
		name = kmalloc(32, GFP_KERNEL);
		if (!name) {
			/*
			 * The files created are permanent, if something happens
			 * we still do not free memory.
			 */
			WARN(1,
			     "Could not allocate stat file for cpu %d\n",
			     cpu);
			return;
		}
		stat->stat = function_stats;
		snprintf(name, 32, "function%d", cpu);
		stat->stat.name = name;
		ret = register_stat_tracer(&stat->stat);
		if (ret) {
			WARN(1,
			     "Could not register function stat for cpu %d\n",
			     cpu);
			kfree(name);
			return;
		}
S
Steven Rostedt 已提交
828 829 830 831 832 833 834 835 836 837
	}

	entry = debugfs_create_file("function_profile_enabled", 0644,
				    d_tracer, NULL, &ftrace_profile_fops);
	if (!entry)
		pr_warning("Could not create debugfs "
			   "'function_profile_enabled' entry\n");
}

#else /* CONFIG_FUNCTION_PROFILER */
838
static __init void ftrace_profile_debugfs(struct dentry *d_tracer)
S
Steven Rostedt 已提交
839 840 841 842
{
}
#endif /* CONFIG_FUNCTION_PROFILER */

843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865
static struct pid * const ftrace_swapper_pid = &init_struct_pid;

#ifdef CONFIG_DYNAMIC_FTRACE

#ifndef CONFIG_FTRACE_MCOUNT_RECORD
# error Dynamic ftrace depends on MCOUNT_RECORD
#endif

static struct hlist_head ftrace_func_hash[FTRACE_FUNC_HASHSIZE] __read_mostly;

struct ftrace_func_probe {
	struct hlist_node	node;
	struct ftrace_probe_ops	*ops;
	unsigned long		flags;
	unsigned long		ip;
	void			*data;
	struct rcu_head		rcu;
};

enum {
	FTRACE_ENABLE_CALLS		= (1 << 0),
	FTRACE_DISABLE_CALLS		= (1 << 1),
	FTRACE_UPDATE_TRACE_FUNC	= (1 << 2),
866 867
	FTRACE_START_FUNC_RET		= (1 << 3),
	FTRACE_STOP_FUNC_RET		= (1 << 4),
868
};
869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884
struct ftrace_func_entry {
	struct hlist_node hlist;
	unsigned long ip;
};

struct ftrace_hash {
	unsigned long		size_bits;
	struct hlist_head	*buckets;
	unsigned long		count;
};

static struct hlist_head notrace_buckets[1 << FTRACE_HASH_MAX_BITS];
static struct ftrace_hash notrace_hash = {
	.size_bits = FTRACE_HASH_MAX_BITS,
	.buckets = notrace_buckets,
};
885

886 887 888 889 890
static struct hlist_head filter_buckets[1 << FTRACE_HASH_MAX_BITS];
static struct ftrace_hash filter_hash = {
	.size_bits = FTRACE_HASH_MAX_BITS,
	.buckets = filter_buckets,
};
891

892 893 894 895 896 897
struct ftrace_ops global_ops = {
	.func			= ftrace_stub,
	.notrace_hash		= &notrace_hash,
	.filter_hash		= &filter_hash,
};

898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918
static struct dyn_ftrace *ftrace_new_addrs;

static DEFINE_MUTEX(ftrace_regex_lock);

struct ftrace_page {
	struct ftrace_page	*next;
	int			index;
	struct dyn_ftrace	records[];
};

#define ENTRIES_PER_PAGE \
  ((PAGE_SIZE - sizeof(struct ftrace_page)) / sizeof(struct dyn_ftrace))

/* estimate from running different kernels */
#define NR_TO_INIT		10000

static struct ftrace_page	*ftrace_pages_start;
static struct ftrace_page	*ftrace_pages;

static struct dyn_ftrace *ftrace_free_records;

919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991
static struct ftrace_func_entry *
ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
{
	unsigned long key;
	struct ftrace_func_entry *entry;
	struct hlist_head *hhd;
	struct hlist_node *n;

	if (!hash->count)
		return NULL;

	if (hash->size_bits > 0)
		key = hash_long(ip, hash->size_bits);
	else
		key = 0;

	hhd = &hash->buckets[key];

	hlist_for_each_entry_rcu(entry, n, hhd, hlist) {
		if (entry->ip == ip)
			return entry;
	}
	return NULL;
}

static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
{
	struct ftrace_func_entry *entry;
	struct hlist_head *hhd;
	unsigned long key;

	entry = kmalloc(sizeof(*entry), GFP_KERNEL);
	if (!entry)
		return -ENOMEM;

	if (hash->size_bits)
		key = hash_long(ip, hash->size_bits);
	else
		key = 0;

	entry->ip = ip;
	hhd = &hash->buckets[key];
	hlist_add_head(&entry->hlist, hhd);
	hash->count++;

	return 0;
}

static void
remove_hash_entry(struct ftrace_hash *hash,
		  struct ftrace_func_entry *entry)
{
	hlist_del(&entry->hlist);
	kfree(entry);
	hash->count--;
}

static void ftrace_hash_clear(struct ftrace_hash *hash)
{
	struct hlist_head *hhd;
	struct hlist_node *tp, *tn;
	struct ftrace_func_entry *entry;
	int size = 1 << hash->size_bits;
	int i;

	for (i = 0; i < size; i++) {
		hhd = &hash->buckets[i];
		hlist_for_each_entry_safe(entry, tp, tn, hhd, hlist)
			remove_hash_entry(hash, entry);
	}
	FTRACE_WARN_ON(hash->count);
}

992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005
/*
 * This is a double for. Do not use 'break' to break out of the loop,
 * you must use a goto.
 */
#define do_for_each_ftrace_rec(pg, rec)					\
	for (pg = ftrace_pages_start; pg; pg = pg->next) {		\
		int _____i;						\
		for (_____i = 0; _____i < pg->index; _____i++) {	\
			rec = &pg->records[_____i];

#define while_for_each_ftrace_rec()		\
		}				\
	}

I
Ingo Molnar 已提交
1006
static void ftrace_free_rec(struct dyn_ftrace *rec)
1007
{
1008
	rec->freelist = ftrace_free_records;
1009 1010 1011 1012
	ftrace_free_records = rec;
	rec->flags |= FTRACE_FL_FREE;
}

I
Ingo Molnar 已提交
1013
static struct dyn_ftrace *ftrace_alloc_dyn_node(unsigned long ip)
1014
{
1015 1016 1017 1018 1019 1020 1021
	struct dyn_ftrace *rec;

	/* First check for freed records */
	if (ftrace_free_records) {
		rec = ftrace_free_records;

		if (unlikely(!(rec->flags & FTRACE_FL_FREE))) {
1022
			FTRACE_WARN_ON_ONCE(1);
1023 1024 1025 1026
			ftrace_free_records = NULL;
			return NULL;
		}

1027
		ftrace_free_records = rec->freelist;
1028 1029 1030 1031
		memset(rec, 0, sizeof(*rec));
		return rec;
	}

1032
	if (ftrace_pages->index == ENTRIES_PER_PAGE) {
S
Steven Rostedt 已提交
1033 1034 1035 1036 1037 1038 1039
		if (!ftrace_pages->next) {
			/* allocate another page */
			ftrace_pages->next =
				(void *)get_zeroed_page(GFP_KERNEL);
			if (!ftrace_pages->next)
				return NULL;
		}
1040 1041 1042 1043 1044 1045
		ftrace_pages = ftrace_pages->next;
	}

	return &ftrace_pages->records[ftrace_pages->index++];
}

S
Steven Rostedt 已提交
1046
static struct dyn_ftrace *
1047
ftrace_record_ip(unsigned long ip)
1048
{
S
Steven Rostedt 已提交
1049
	struct dyn_ftrace *rec;
1050

1051
	if (ftrace_disabled)
S
Steven Rostedt 已提交
1052
		return NULL;
1053

S
Steven Rostedt 已提交
1054 1055 1056
	rec = ftrace_alloc_dyn_node(ip);
	if (!rec)
		return NULL;
1057

S
Steven Rostedt 已提交
1058
	rec->ip = ip;
1059
	rec->newlist = ftrace_new_addrs;
1060
	ftrace_new_addrs = rec;
1061

S
Steven Rostedt 已提交
1062
	return rec;
1063 1064
}

1065 1066 1067 1068 1069 1070 1071 1072 1073 1074
static void print_ip_ins(const char *fmt, unsigned char *p)
{
	int i;

	printk(KERN_CONT "%s", fmt);

	for (i = 0; i < MCOUNT_INSN_SIZE; i++)
		printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
}

1075
static void ftrace_bug(int failed, unsigned long ip)
1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101
{
	switch (failed) {
	case -EFAULT:
		FTRACE_WARN_ON_ONCE(1);
		pr_info("ftrace faulted on modifying ");
		print_ip_sym(ip);
		break;
	case -EINVAL:
		FTRACE_WARN_ON_ONCE(1);
		pr_info("ftrace failed to modify ");
		print_ip_sym(ip);
		print_ip_ins(" actual: ", (unsigned char *)ip);
		printk(KERN_CONT "\n");
		break;
	case -EPERM:
		FTRACE_WARN_ON_ONCE(1);
		pr_info("ftrace faulted on writing ");
		print_ip_sym(ip);
		break;
	default:
		FTRACE_WARN_ON_ONCE(1);
		pr_info("ftrace faulted on unknown error ");
		print_ip_sym(ip);
	}
}

1102

1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117
/* Return 1 if the address range is reserved for ftrace */
int ftrace_text_reserved(void *start, void *end)
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;

	do_for_each_ftrace_rec(pg, rec) {
		if (rec->ip <= (unsigned long)end &&
		    rec->ip + MCOUNT_INSN_SIZE > (unsigned long)start)
			return 1;
	} while_for_each_ftrace_rec();
	return 0;
}


1118
static int
1119
__ftrace_replace_code(struct dyn_ftrace *rec, int enable)
1120
{
1121
	struct ftrace_ops *ops = &global_ops;
1122
	unsigned long ftrace_addr;
1123
	unsigned long flag = 0UL;
1124

1125
	ftrace_addr = (unsigned long)FTRACE_ADDR;
1126

S
Steven Rostedt 已提交
1127
	/*
1128 1129
	 * If this record is not to be traced or we want to disable it,
	 * then disable it.
S
Steven Rostedt 已提交
1130
	 *
1131
	 * If we want to enable it and filtering is off, then enable it.
S
Steven Rostedt 已提交
1132
	 *
1133 1134
	 * If we want to enable it and filtering is on, enable it only if
	 * it's filtered
S
Steven Rostedt 已提交
1135
	 */
1136 1137 1138
	if (enable && !ftrace_lookup_ip(ops->notrace_hash, rec->ip)) {
		if (!ops->filter_hash->count ||
		    ftrace_lookup_ip(ops->filter_hash, rec->ip))
1139 1140
			flag = FTRACE_FL_ENABLED;
	}
S
Steven Rostedt 已提交
1141

1142 1143 1144
	/* If the state of this record hasn't changed, then do nothing */
	if ((rec->flags & FTRACE_FL_ENABLED) == flag)
		return 0;
S
Steven Rostedt 已提交
1145

1146 1147 1148
	if (flag) {
		rec->flags |= FTRACE_FL_ENABLED;
		return ftrace_make_call(rec, ftrace_addr);
1149 1150
	}

1151 1152
	rec->flags &= ~FTRACE_FL_ENABLED;
	return ftrace_make_nop(NULL, rec, ftrace_addr);
1153 1154
}

I
Ingo Molnar 已提交
1155
static void ftrace_replace_code(int enable)
1156 1157 1158
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;
S
Steven Rostedt 已提交
1159
	int failed;
1160

1161 1162 1163
	if (unlikely(ftrace_disabled))
		return;

1164
	do_for_each_ftrace_rec(pg, rec) {
1165 1166
		/* Skip over free records */
		if (rec->flags & FTRACE_FL_FREE)
1167 1168 1169
			continue;

		failed = __ftrace_replace_code(rec, enable);
1170
		if (failed) {
1171 1172 1173
			ftrace_bug(failed, rec->ip);
			/* Stop processing */
			return;
1174
		}
1175
	} while_for_each_ftrace_rec();
1176 1177
}

1178
static int
1179
ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
1180 1181
{
	unsigned long ip;
1182
	int ret;
1183 1184 1185

	ip = rec->ip;

1186 1187 1188
	if (unlikely(ftrace_disabled))
		return 0;

1189
	ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
1190
	if (ret) {
1191
		ftrace_bug(ret, ip);
1192
		return 0;
1193
	}
1194
	return 1;
1195 1196
}

1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214
/*
 * archs can override this function if they must do something
 * before the modifying code is performed.
 */
int __weak ftrace_arch_code_modify_prepare(void)
{
	return 0;
}

/*
 * archs can override this function if they must do something
 * after the modifying code is performed.
 */
int __weak ftrace_arch_code_modify_post_process(void)
{
	return 0;
}

I
Ingo Molnar 已提交
1215
static int __ftrace_modify_code(void *data)
1216
{
1217 1218
	int *command = data;

1219
	if (*command & FTRACE_ENABLE_CALLS)
1220
		ftrace_replace_code(1);
1221
	else if (*command & FTRACE_DISABLE_CALLS)
1222 1223 1224 1225 1226
		ftrace_replace_code(0);

	if (*command & FTRACE_UPDATE_TRACE_FUNC)
		ftrace_update_ftrace_func(ftrace_trace_function);

1227 1228 1229 1230 1231
	if (*command & FTRACE_START_FUNC_RET)
		ftrace_enable_ftrace_graph_caller();
	else if (*command & FTRACE_STOP_FUNC_RET)
		ftrace_disable_ftrace_graph_caller();

1232
	return 0;
1233 1234
}

I
Ingo Molnar 已提交
1235
static void ftrace_run_update_code(int command)
1236
{
1237 1238 1239 1240 1241 1242 1243
	int ret;

	ret = ftrace_arch_code_modify_prepare();
	FTRACE_WARN_ON(ret);
	if (ret)
		return;

R
Rusty Russell 已提交
1244
	stop_machine(__ftrace_modify_code, &command, NULL);
1245 1246 1247

	ret = ftrace_arch_code_modify_post_process();
	FTRACE_WARN_ON(ret);
1248 1249
}

1250
static ftrace_func_t saved_ftrace_func;
1251
static int ftrace_start_up;
1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264

static void ftrace_startup_enable(int command)
{
	if (saved_ftrace_func != ftrace_trace_function) {
		saved_ftrace_func = ftrace_trace_function;
		command |= FTRACE_UPDATE_TRACE_FUNC;
	}

	if (!command || !ftrace_enabled)
		return;

	ftrace_run_update_code(command);
}
1265

1266
static void ftrace_startup(int command)
1267
{
1268 1269 1270
	if (unlikely(ftrace_disabled))
		return;

1271
	ftrace_start_up++;
S
Steven Rostedt 已提交
1272
	command |= FTRACE_ENABLE_CALLS;
1273

1274
	ftrace_startup_enable(command);
1275 1276
}

1277
static void ftrace_shutdown(int command)
1278
{
1279 1280 1281
	if (unlikely(ftrace_disabled))
		return;

1282
	ftrace_start_up--;
1283 1284 1285 1286 1287 1288 1289
	/*
	 * Just warn in case of unbalance, no need to kill ftrace, it's not
	 * critical but the ftrace_call callers may be never nopped again after
	 * further ftrace uses.
	 */
	WARN_ON_ONCE(ftrace_start_up < 0);

1290
	if (!ftrace_start_up)
1291
		command |= FTRACE_DISABLE_CALLS;
1292

1293 1294 1295 1296
	if (saved_ftrace_func != ftrace_trace_function) {
		saved_ftrace_func = ftrace_trace_function;
		command |= FTRACE_UPDATE_TRACE_FUNC;
	}
1297

1298
	if (!command || !ftrace_enabled)
S
Steven Rostedt 已提交
1299
		return;
1300 1301

	ftrace_run_update_code(command);
1302 1303
}

I
Ingo Molnar 已提交
1304
static void ftrace_startup_sysctl(void)
1305
{
1306 1307 1308
	if (unlikely(ftrace_disabled))
		return;

1309 1310
	/* Force update next time */
	saved_ftrace_func = NULL;
1311 1312
	/* ftrace_start_up is true if we want ftrace running */
	if (ftrace_start_up)
1313
		ftrace_run_update_code(FTRACE_ENABLE_CALLS);
1314 1315
}

I
Ingo Molnar 已提交
1316
static void ftrace_shutdown_sysctl(void)
1317
{
1318 1319 1320
	if (unlikely(ftrace_disabled))
		return;

1321 1322
	/* ftrace_start_up is true if ftrace is running */
	if (ftrace_start_up)
1323
		ftrace_run_update_code(FTRACE_DISABLE_CALLS);
1324 1325
}

1326 1327 1328 1329
static cycle_t		ftrace_update_time;
static unsigned long	ftrace_update_cnt;
unsigned long		ftrace_update_tot_cnt;

1330
static int ftrace_update_code(struct module *mod)
1331
{
1332
	struct dyn_ftrace *p;
1333
	cycle_t start, stop;
1334

I
Ingo Molnar 已提交
1335
	start = ftrace_now(raw_smp_processor_id());
1336 1337
	ftrace_update_cnt = 0;

1338
	while (ftrace_new_addrs) {
1339

S
Steven Rostedt 已提交
1340 1341 1342
		/* If something went wrong, bail without enabling anything */
		if (unlikely(ftrace_disabled))
			return -1;
1343

1344
		p = ftrace_new_addrs;
1345
		ftrace_new_addrs = p->newlist;
1346
		p->flags = 0L;
1347

1348
		/*
L
Lucas De Marchi 已提交
1349
		 * Do the initial record conversion from mcount jump
1350 1351 1352
		 * to the NOP instructions.
		 */
		if (!ftrace_code_disable(mod, p)) {
S
Steven Rostedt 已提交
1353
			ftrace_free_rec(p);
1354 1355
			/* Game over */
			break;
1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375
		}

		ftrace_update_cnt++;

		/*
		 * If the tracing is enabled, go ahead and enable the record.
		 *
		 * The reason not to enable the record immediatelly is the
		 * inherent check of ftrace_make_nop/ftrace_make_call for
		 * correct previous instructions.  Making first the NOP
		 * conversion puts the module to the correct state, thus
		 * passing the ftrace_make_call check.
		 */
		if (ftrace_start_up) {
			int failed = __ftrace_replace_code(p, 1);
			if (failed) {
				ftrace_bug(failed, p->ip);
				ftrace_free_rec(p);
			}
		}
1376 1377
	}

I
Ingo Molnar 已提交
1378
	stop = ftrace_now(raw_smp_processor_id());
1379 1380 1381
	ftrace_update_time = stop - start;
	ftrace_update_tot_cnt += ftrace_update_cnt;

1382 1383 1384
	return 0;
}

1385
static int __init ftrace_dyn_table_alloc(unsigned long num_to_init)
1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411
{
	struct ftrace_page *pg;
	int cnt;
	int i;

	/* allocate a few pages */
	ftrace_pages_start = (void *)get_zeroed_page(GFP_KERNEL);
	if (!ftrace_pages_start)
		return -1;

	/*
	 * Allocate a few more pages.
	 *
	 * TODO: have some parser search vmlinux before
	 *   final linking to find all calls to ftrace.
	 *   Then we can:
	 *    a) know how many pages to allocate.
	 *     and/or
	 *    b) set up the table then.
	 *
	 *  The dynamic code is still necessary for
	 *  modules.
	 */

	pg = ftrace_pages = ftrace_pages_start;

1412
	cnt = num_to_init / ENTRIES_PER_PAGE;
S
Steven Rostedt 已提交
1413
	pr_info("ftrace: allocating %ld entries in %d pages\n",
1414
		num_to_init, cnt + 1);
1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428

	for (i = 0; i < cnt; i++) {
		pg->next = (void *)get_zeroed_page(GFP_KERNEL);

		/* If we fail, we'll try later anyway */
		if (!pg->next)
			break;

		pg = pg->next;
	}

	return 0;
}

1429 1430
enum {
	FTRACE_ITER_FILTER	= (1 << 0),
1431
	FTRACE_ITER_NOTRACE	= (1 << 1),
S
Steven Rostedt 已提交
1432 1433
	FTRACE_ITER_PRINTALL	= (1 << 2),
	FTRACE_ITER_HASH	= (1 << 3),
1434 1435 1436 1437 1438
};

#define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */

struct ftrace_iterator {
1439
	loff_t				pos;
1440 1441 1442 1443 1444
	loff_t				func_pos;
	struct ftrace_page		*pg;
	struct dyn_ftrace		*func;
	struct ftrace_func_probe	*probe;
	struct trace_parser		parser;
1445
	struct ftrace_hash		*hash;
1446 1447 1448
	int				hidx;
	int				idx;
	unsigned			flags;
1449 1450
};

1451
static void *
1452
t_hash_next(struct seq_file *m, loff_t *pos)
1453 1454
{
	struct ftrace_iterator *iter = m->private;
1455
	struct hlist_node *hnd = NULL;
1456 1457 1458
	struct hlist_head *hhd;

	(*pos)++;
1459
	iter->pos = *pos;
1460

1461 1462
	if (iter->probe)
		hnd = &iter->probe->node;
1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484
 retry:
	if (iter->hidx >= FTRACE_FUNC_HASHSIZE)
		return NULL;

	hhd = &ftrace_func_hash[iter->hidx];

	if (hlist_empty(hhd)) {
		iter->hidx++;
		hnd = NULL;
		goto retry;
	}

	if (!hnd)
		hnd = hhd->first;
	else {
		hnd = hnd->next;
		if (!hnd) {
			iter->hidx++;
			goto retry;
		}
	}

1485 1486 1487 1488 1489 1490
	if (WARN_ON_ONCE(!hnd))
		return NULL;

	iter->probe = hlist_entry(hnd, struct ftrace_func_probe, node);

	return iter;
1491 1492 1493 1494 1495 1496
}

static void *t_hash_start(struct seq_file *m, loff_t *pos)
{
	struct ftrace_iterator *iter = m->private;
	void *p = NULL;
L
Li Zefan 已提交
1497 1498
	loff_t l;

1499 1500
	if (iter->func_pos > *pos)
		return NULL;
1501

L
Li Zefan 已提交
1502
	iter->hidx = 0;
1503
	for (l = 0; l <= (*pos - iter->func_pos); ) {
1504
		p = t_hash_next(m, &l);
L
Li Zefan 已提交
1505 1506 1507
		if (!p)
			break;
	}
1508 1509 1510
	if (!p)
		return NULL;

1511 1512 1513
	/* Only set this if we have an item */
	iter->flags |= FTRACE_ITER_HASH;

1514
	return iter;
1515 1516
}

1517 1518
static int
t_hash_show(struct seq_file *m, struct ftrace_iterator *iter)
1519
{
S
Steven Rostedt 已提交
1520
	struct ftrace_func_probe *rec;
1521

1522 1523 1524
	rec = iter->probe;
	if (WARN_ON_ONCE(!rec))
		return -EIO;
1525

1526 1527 1528
	if (rec->ops->print)
		return rec->ops->print(m, rec->ip, rec->ops, rec->data);

1529
	seq_printf(m, "%ps:%ps", (void *)rec->ip, (void *)rec->ops->func);
1530 1531 1532 1533 1534 1535 1536 1537

	if (rec->data)
		seq_printf(m, ":%p", rec->data);
	seq_putc(m, '\n');

	return 0;
}

I
Ingo Molnar 已提交
1538
static void *
1539 1540 1541
t_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct ftrace_iterator *iter = m->private;
1542
	struct ftrace_ops *ops = &global_ops;
1543 1544
	struct dyn_ftrace *rec = NULL;

1545 1546 1547
	if (unlikely(ftrace_disabled))
		return NULL;

1548
	if (iter->flags & FTRACE_ITER_HASH)
1549
		return t_hash_next(m, pos);
1550

1551
	(*pos)++;
1552
	iter->pos = iter->func_pos = *pos;
1553

1554
	if (iter->flags & FTRACE_ITER_PRINTALL)
1555
		return t_hash_start(m, pos);
1556

1557 1558 1559 1560 1561 1562 1563 1564 1565
 retry:
	if (iter->idx >= iter->pg->index) {
		if (iter->pg->next) {
			iter->pg = iter->pg->next;
			iter->idx = 0;
			goto retry;
		}
	} else {
		rec = &iter->pg->records[iter->idx++];
1566 1567
		if ((rec->flags & FTRACE_FL_FREE) ||

S
Steven Rostedt 已提交
1568
		    ((iter->flags & FTRACE_ITER_FILTER) &&
1569
		     !(ftrace_lookup_ip(ops->filter_hash, rec->ip))) ||
S
Steven Rostedt 已提交
1570

1571
		    ((iter->flags & FTRACE_ITER_NOTRACE) &&
1572
		     !ftrace_lookup_ip(ops->notrace_hash, rec->ip))) {
1573 1574 1575 1576 1577
			rec = NULL;
			goto retry;
		}
	}

1578
	if (!rec)
1579
		return t_hash_start(m, pos);
1580 1581 1582 1583

	iter->func = rec;

	return iter;
1584 1585
}

1586 1587 1588 1589 1590
static void reset_iter_read(struct ftrace_iterator *iter)
{
	iter->pos = 0;
	iter->func_pos = 0;
	iter->flags &= ~(FTRACE_ITER_PRINTALL & FTRACE_ITER_HASH);
1591 1592 1593 1594 1595
}

static void *t_start(struct seq_file *m, loff_t *pos)
{
	struct ftrace_iterator *iter = m->private;
1596
	struct ftrace_ops *ops = &global_ops;
1597
	void *p = NULL;
1598
	loff_t l;
1599

1600
	mutex_lock(&ftrace_lock);
1601 1602 1603 1604

	if (unlikely(ftrace_disabled))
		return NULL;

1605 1606 1607 1608 1609 1610
	/*
	 * If an lseek was done, then reset and start from beginning.
	 */
	if (*pos < iter->pos)
		reset_iter_read(iter);

1611 1612 1613 1614 1615
	/*
	 * For set_ftrace_filter reading, if we have the filter
	 * off, we can short cut and just print out that all
	 * functions are enabled.
	 */
1616
	if (iter->flags & FTRACE_ITER_FILTER && !ops->filter_hash->count) {
1617
		if (*pos > 0)
1618
			return t_hash_start(m, pos);
1619
		iter->flags |= FTRACE_ITER_PRINTALL;
1620 1621
		/* reset in case of seek/pread */
		iter->flags &= ~FTRACE_ITER_HASH;
1622 1623 1624
		return iter;
	}

1625 1626 1627
	if (iter->flags & FTRACE_ITER_HASH)
		return t_hash_start(m, pos);

1628 1629 1630 1631 1632
	/*
	 * Unfortunately, we need to restart at ftrace_pages_start
	 * every time we let go of the ftrace_mutex. This is because
	 * those pointers can change without the lock.
	 */
1633 1634 1635 1636 1637 1638
	iter->pg = ftrace_pages_start;
	iter->idx = 0;
	for (l = 0; l <= *pos; ) {
		p = t_next(m, p, &l);
		if (!p)
			break;
1639
	}
1640

1641 1642 1643
	if (!p) {
		if (iter->flags & FTRACE_ITER_FILTER)
			return t_hash_start(m, pos);
1644

1645 1646 1647 1648
		return NULL;
	}

	return iter;
1649 1650 1651 1652
}

static void t_stop(struct seq_file *m, void *p)
{
1653
	mutex_unlock(&ftrace_lock);
1654 1655 1656 1657
}

static int t_show(struct seq_file *m, void *v)
{
1658
	struct ftrace_iterator *iter = m->private;
1659
	struct dyn_ftrace *rec;
1660

1661
	if (iter->flags & FTRACE_ITER_HASH)
1662
		return t_hash_show(m, iter);
1663

1664 1665 1666 1667 1668
	if (iter->flags & FTRACE_ITER_PRINTALL) {
		seq_printf(m, "#### all functions enabled ####\n");
		return 0;
	}

1669 1670
	rec = iter->func;

1671 1672 1673
	if (!rec)
		return 0;

1674
	seq_printf(m, "%ps\n", (void *)rec->ip);
1675 1676 1677 1678

	return 0;
}

J
James Morris 已提交
1679
static const struct seq_operations show_ftrace_seq_ops = {
1680 1681 1682 1683 1684 1685
	.start = t_start,
	.next = t_next,
	.stop = t_stop,
	.show = t_show,
};

I
Ingo Molnar 已提交
1686
static int
1687 1688 1689 1690 1691
ftrace_avail_open(struct inode *inode, struct file *file)
{
	struct ftrace_iterator *iter;
	int ret;

1692 1693 1694
	if (unlikely(ftrace_disabled))
		return -ENODEV;

1695 1696 1697 1698 1699 1700 1701 1702 1703
	iter = kzalloc(sizeof(*iter), GFP_KERNEL);
	if (!iter)
		return -ENOMEM;

	iter->pg = ftrace_pages_start;

	ret = seq_open(file, &show_ftrace_seq_ops);
	if (!ret) {
		struct seq_file *m = file->private_data;
I
Ingo Molnar 已提交
1704

1705
		m->private = iter;
I
Ingo Molnar 已提交
1706
	} else {
1707
		kfree(iter);
I
Ingo Molnar 已提交
1708
	}
1709 1710 1711 1712

	return ret;
}

1713
static void ftrace_filter_reset(struct ftrace_hash *hash)
1714
{
1715
	mutex_lock(&ftrace_lock);
1716
	ftrace_hash_clear(hash);
1717
	mutex_unlock(&ftrace_lock);
1718 1719
}

I
Ingo Molnar 已提交
1720
static int
1721
ftrace_regex_open(struct ftrace_ops *ops, int flag,
1722
		  struct inode *inode, struct file *file)
1723 1724
{
	struct ftrace_iterator *iter;
1725
	struct ftrace_hash *hash;
1726 1727
	int ret = 0;

1728 1729 1730
	if (unlikely(ftrace_disabled))
		return -ENODEV;

1731 1732 1733 1734
	iter = kzalloc(sizeof(*iter), GFP_KERNEL);
	if (!iter)
		return -ENOMEM;

1735 1736 1737 1738 1739
	if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
		kfree(iter);
		return -ENOMEM;
	}

1740 1741 1742 1743 1744
	if (flag & FTRACE_ITER_NOTRACE)
		hash = ops->notrace_hash;
	else
		hash = ops->filter_hash;

1745 1746
	iter->hash = hash;

1747
	mutex_lock(&ftrace_regex_lock);
1748
	if ((file->f_mode & FMODE_WRITE) &&
1749
	    (file->f_flags & O_TRUNC))
1750
		ftrace_filter_reset(hash);
1751 1752 1753

	if (file->f_mode & FMODE_READ) {
		iter->pg = ftrace_pages_start;
1754
		iter->flags = flag;
1755 1756 1757 1758 1759

		ret = seq_open(file, &show_ftrace_seq_ops);
		if (!ret) {
			struct seq_file *m = file->private_data;
			m->private = iter;
1760 1761
		} else {
			trace_parser_put(&iter->parser);
1762
			kfree(iter);
1763
		}
1764 1765
	} else
		file->private_data = iter;
1766
	mutex_unlock(&ftrace_regex_lock);
1767 1768 1769 1770

	return ret;
}

1771 1772 1773
static int
ftrace_filter_open(struct inode *inode, struct file *file)
{
1774
	return ftrace_regex_open(&global_ops, FTRACE_ITER_FILTER,
1775
				 inode, file);
1776 1777 1778 1779 1780
}

static int
ftrace_notrace_open(struct inode *inode, struct file *file)
{
1781
	return ftrace_regex_open(&global_ops, FTRACE_ITER_NOTRACE,
1782
				 inode, file);
1783 1784
}

I
Ingo Molnar 已提交
1785
static loff_t
1786
ftrace_regex_lseek(struct file *file, loff_t offset, int origin)
1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797
{
	loff_t ret;

	if (file->f_mode & FMODE_READ)
		ret = seq_lseek(file, offset, origin);
	else
		file->f_pos = ret = 1;

	return ret;
}

1798
static int ftrace_match(char *str, char *regex, int len, int type)
1799 1800
{
	int matched = 0;
1801
	int slen;
1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816

	switch (type) {
	case MATCH_FULL:
		if (strcmp(str, regex) == 0)
			matched = 1;
		break;
	case MATCH_FRONT_ONLY:
		if (strncmp(str, regex, len) == 0)
			matched = 1;
		break;
	case MATCH_MIDDLE_ONLY:
		if (strstr(str, regex))
			matched = 1;
		break;
	case MATCH_END_ONLY:
1817 1818
		slen = strlen(str);
		if (slen >= len && memcmp(str + slen - len, regex, len) == 0)
1819 1820 1821 1822 1823 1824 1825
			matched = 1;
		break;
	}

	return matched;
}

1826
static int
1827
enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int not)
1828
{
1829 1830 1831
	struct ftrace_func_entry *entry;
	int ret = 0;

1832 1833 1834 1835 1836
	entry = ftrace_lookup_ip(hash, rec->ip);
	if (not) {
		/* Do nothing if it doesn't exist */
		if (!entry)
			return 0;
1837

1838 1839 1840 1841 1842
		remove_hash_entry(hash, entry);
	} else {
		/* Do nothing if it exists */
		if (entry)
			return 0;
1843

1844
		ret = add_hash_entry(hash, rec->ip);
1845 1846
	}
	return ret;
1847 1848
}

1849
static int
1850 1851
ftrace_match_record(struct dyn_ftrace *rec, char *mod,
		    char *regex, int len, int type)
1852 1853
{
	char str[KSYM_SYMBOL_LEN];
1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866
	char *modname;

	kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);

	if (mod) {
		/* module lookup requires matching the module */
		if (!modname || strcmp(modname, mod))
			return 0;

		/* blank search means to match all funcs in the mod */
		if (!len)
			return 1;
	}
1867 1868 1869 1870

	return ftrace_match(str, regex, len, type);
}

1871 1872 1873
static int
match_records(struct ftrace_hash *hash, char *buff,
	      int len, char *mod, int not)
1874
{
1875
	unsigned search_len = 0;
1876 1877
	struct ftrace_page *pg;
	struct dyn_ftrace *rec;
1878 1879
	int type = MATCH_FULL;
	char *search = buff;
1880
	int found = 0;
1881
	int ret;
1882

1883 1884 1885 1886
	if (len) {
		type = filter_parse_regex(buff, len, &search, &not);
		search_len = strlen(search);
	}
1887

1888
	mutex_lock(&ftrace_lock);
1889

1890 1891
	if (unlikely(ftrace_disabled))
		goto out_unlock;
1892

1893 1894
	do_for_each_ftrace_rec(pg, rec) {

1895
		if (ftrace_match_record(rec, mod, search, search_len, type)) {
1896
			ret = enter_record(hash, rec, not);
1897 1898 1899 1900
			if (ret < 0) {
				found = ret;
				goto out_unlock;
			}
1901
			found = 1;
1902 1903
		}
	} while_for_each_ftrace_rec();
1904
 out_unlock:
1905
	mutex_unlock(&ftrace_lock);
1906 1907

	return found;
1908 1909
}

1910
static int
1911
ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
1912
{
1913
	return match_records(hash, buff, len, NULL, 0);
1914 1915
}

1916 1917
static int
ftrace_match_module_records(struct ftrace_hash *hash, char *buff, char *mod)
1918 1919
{
	int not = 0;
S
Steven Rostedt 已提交
1920

1921 1922 1923 1924 1925 1926 1927 1928 1929 1930
	/* blank or '*' mean the same */
	if (strcmp(buff, "*") == 0)
		buff[0] = 0;

	/* handle the case of 'dont filter this module' */
	if (strcmp(buff, "!") == 0 || strcmp(buff, "!*") == 0) {
		buff[0] = 0;
		not = 1;
	}

1931
	return match_records(hash, buff, strlen(buff), mod, not);
1932 1933
}

1934 1935 1936 1937 1938 1939 1940 1941
/*
 * We register the module command as a template to show others how
 * to register the a command as well.
 */

static int
ftrace_mod_callback(char *func, char *cmd, char *param, int enable)
{
1942
	struct ftrace_ops *ops = &global_ops;
1943
	struct ftrace_hash *hash;
1944
	char *mod;
1945
	int ret = -EINVAL;
1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956

	/*
	 * cmd == 'mod' because we only registered this func
	 * for the 'mod' ftrace_func_command.
	 * But if you register one func with multiple commands,
	 * you can tell which command was used by the cmd
	 * parameter.
	 */

	/* we must have a module name */
	if (!param)
1957
		return ret;
1958 1959 1960

	mod = strsep(&param, ":");
	if (!strlen(mod))
1961
		return ret;
1962

1963
	if (enable)
1964
		hash = ops->filter_hash;
1965
	else
1966
		hash = ops->notrace_hash;
1967 1968

	ret = ftrace_match_module_records(hash, func, mod);
1969 1970 1971 1972 1973 1974
	if (!ret)
		ret = -EINVAL;
	if (ret < 0)
		return ret;

	return 0;
1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987
}

static struct ftrace_func_command ftrace_mod_cmd = {
	.name			= "mod",
	.func			= ftrace_mod_callback,
};

static int __init ftrace_mod_cmd_init(void)
{
	return register_ftrace_command(&ftrace_mod_cmd);
}
device_initcall(ftrace_mod_cmd_init);

1988
static void
S
Steven Rostedt 已提交
1989
function_trace_probe_call(unsigned long ip, unsigned long parent_ip)
1990
{
S
Steven Rostedt 已提交
1991
	struct ftrace_func_probe *entry;
1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007
	struct hlist_head *hhd;
	struct hlist_node *n;
	unsigned long key;

	key = hash_long(ip, FTRACE_HASH_BITS);

	hhd = &ftrace_func_hash[key];

	if (hlist_empty(hhd))
		return;

	/*
	 * Disable preemption for these calls to prevent a RCU grace
	 * period. This syncs the hash iteration and freeing of items
	 * on the hash. rcu_read_lock is too dangerous here.
	 */
2008
	preempt_disable_notrace();
2009 2010 2011 2012
	hlist_for_each_entry_rcu(entry, n, hhd, node) {
		if (entry->ip == ip)
			entry->ops->func(ip, parent_ip, &entry->data);
	}
2013
	preempt_enable_notrace();
2014 2015
}

S
Steven Rostedt 已提交
2016
static struct ftrace_ops trace_probe_ops __read_mostly =
2017
{
2018
	.func		= function_trace_probe_call,
2019 2020
};

S
Steven Rostedt 已提交
2021
static int ftrace_probe_registered;
2022

S
Steven Rostedt 已提交
2023
static void __enable_ftrace_function_probe(void)
2024 2025 2026
{
	int i;

S
Steven Rostedt 已提交
2027
	if (ftrace_probe_registered)
2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038
		return;

	for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
		struct hlist_head *hhd = &ftrace_func_hash[i];
		if (hhd->first)
			break;
	}
	/* Nothing registered? */
	if (i == FTRACE_FUNC_HASHSIZE)
		return;

S
Steven Rostedt 已提交
2039
	__register_ftrace_function(&trace_probe_ops);
2040
	ftrace_startup(0);
S
Steven Rostedt 已提交
2041
	ftrace_probe_registered = 1;
2042 2043
}

S
Steven Rostedt 已提交
2044
static void __disable_ftrace_function_probe(void)
2045 2046 2047
{
	int i;

S
Steven Rostedt 已提交
2048
	if (!ftrace_probe_registered)
2049 2050 2051 2052 2053 2054 2055 2056 2057
		return;

	for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
		struct hlist_head *hhd = &ftrace_func_hash[i];
		if (hhd->first)
			return;
	}

	/* no more funcs left */
S
Steven Rostedt 已提交
2058
	__unregister_ftrace_function(&trace_probe_ops);
2059
	ftrace_shutdown(0);
S
Steven Rostedt 已提交
2060
	ftrace_probe_registered = 0;
2061 2062 2063 2064 2065
}


static void ftrace_free_entry_rcu(struct rcu_head *rhp)
{
S
Steven Rostedt 已提交
2066 2067
	struct ftrace_func_probe *entry =
		container_of(rhp, struct ftrace_func_probe, rcu);
2068 2069 2070 2071 2072 2073 2074 2075

	if (entry->ops->free)
		entry->ops->free(&entry->data);
	kfree(entry);
}


int
S
Steven Rostedt 已提交
2076
register_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
2077 2078
			      void *data)
{
S
Steven Rostedt 已提交
2079
	struct ftrace_func_probe *entry;
2080 2081 2082
	struct ftrace_page *pg;
	struct dyn_ftrace *rec;
	int type, len, not;
S
Steven Rostedt 已提交
2083
	unsigned long key;
2084 2085 2086
	int count = 0;
	char *search;

2087
	type = filter_parse_regex(glob, strlen(glob), &search, &not);
2088 2089
	len = strlen(search);

S
Steven Rostedt 已提交
2090
	/* we do not support '!' for function probes */
2091 2092 2093 2094 2095
	if (WARN_ON(not))
		return -EINVAL;

	mutex_lock(&ftrace_lock);

2096 2097
	if (unlikely(ftrace_disabled))
		goto out_unlock;
2098

2099
	do_for_each_ftrace_rec(pg, rec) {
2100

2101
		if (!ftrace_match_record(rec, NULL, search, len, type))
2102 2103 2104 2105
			continue;

		entry = kmalloc(sizeof(*entry), GFP_KERNEL);
		if (!entry) {
S
Steven Rostedt 已提交
2106
			/* If we did not process any, then return error */
2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135
			if (!count)
				count = -ENOMEM;
			goto out_unlock;
		}

		count++;

		entry->data = data;

		/*
		 * The caller might want to do something special
		 * for each function we find. We call the callback
		 * to give the caller an opportunity to do so.
		 */
		if (ops->callback) {
			if (ops->callback(rec->ip, &entry->data) < 0) {
				/* caller does not like this func */
				kfree(entry);
				continue;
			}
		}

		entry->ops = ops;
		entry->ip = rec->ip;

		key = hash_long(entry->ip, FTRACE_HASH_BITS);
		hlist_add_head_rcu(&entry->node, &ftrace_func_hash[key]);

	} while_for_each_ftrace_rec();
S
Steven Rostedt 已提交
2136
	__enable_ftrace_function_probe();
2137 2138 2139 2140 2141 2142 2143 2144

 out_unlock:
	mutex_unlock(&ftrace_lock);

	return count;
}

enum {
S
Steven Rostedt 已提交
2145 2146
	PROBE_TEST_FUNC		= 1,
	PROBE_TEST_DATA		= 2
2147 2148 2149
};

static void
S
Steven Rostedt 已提交
2150
__unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
2151 2152
				  void *data, int flags)
{
S
Steven Rostedt 已提交
2153
	struct ftrace_func_probe *entry;
2154 2155 2156 2157 2158 2159
	struct hlist_node *n, *tmp;
	char str[KSYM_SYMBOL_LEN];
	int type = MATCH_FULL;
	int i, len = 0;
	char *search;

2160
	if (glob && (strcmp(glob, "*") == 0 || !strlen(glob)))
2161
		glob = NULL;
2162
	else if (glob) {
2163 2164
		int not;

2165
		type = filter_parse_regex(glob, strlen(glob), &search, &not);
2166 2167
		len = strlen(search);

S
Steven Rostedt 已提交
2168
		/* we do not support '!' for function probes */
2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179
		if (WARN_ON(not))
			return;
	}

	mutex_lock(&ftrace_lock);
	for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
		struct hlist_head *hhd = &ftrace_func_hash[i];

		hlist_for_each_entry_safe(entry, n, tmp, hhd, node) {

			/* break up if statements for readability */
S
Steven Rostedt 已提交
2180
			if ((flags & PROBE_TEST_FUNC) && entry->ops != ops)
2181 2182
				continue;

S
Steven Rostedt 已提交
2183
			if ((flags & PROBE_TEST_DATA) && entry->data != data)
2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197
				continue;

			/* do this last, since it is the most expensive */
			if (glob) {
				kallsyms_lookup(entry->ip, NULL, NULL,
						NULL, str);
				if (!ftrace_match(str, glob, len, type))
					continue;
			}

			hlist_del(&entry->node);
			call_rcu(&entry->rcu, ftrace_free_entry_rcu);
		}
	}
S
Steven Rostedt 已提交
2198
	__disable_ftrace_function_probe();
2199 2200 2201 2202
	mutex_unlock(&ftrace_lock);
}

void
S
Steven Rostedt 已提交
2203
unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
2204 2205
				void *data)
{
S
Steven Rostedt 已提交
2206 2207
	__unregister_ftrace_function_probe(glob, ops, data,
					  PROBE_TEST_FUNC | PROBE_TEST_DATA);
2208 2209 2210
}

void
S
Steven Rostedt 已提交
2211
unregister_ftrace_function_probe_func(char *glob, struct ftrace_probe_ops *ops)
2212
{
S
Steven Rostedt 已提交
2213
	__unregister_ftrace_function_probe(glob, ops, NULL, PROBE_TEST_FUNC);
2214 2215
}

S
Steven Rostedt 已提交
2216
void unregister_ftrace_function_probe_all(char *glob)
2217
{
S
Steven Rostedt 已提交
2218
	__unregister_ftrace_function_probe(glob, NULL, NULL, 0);
2219 2220
}

2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261
static LIST_HEAD(ftrace_commands);
static DEFINE_MUTEX(ftrace_cmd_mutex);

int register_ftrace_command(struct ftrace_func_command *cmd)
{
	struct ftrace_func_command *p;
	int ret = 0;

	mutex_lock(&ftrace_cmd_mutex);
	list_for_each_entry(p, &ftrace_commands, list) {
		if (strcmp(cmd->name, p->name) == 0) {
			ret = -EBUSY;
			goto out_unlock;
		}
	}
	list_add(&cmd->list, &ftrace_commands);
 out_unlock:
	mutex_unlock(&ftrace_cmd_mutex);

	return ret;
}

int unregister_ftrace_command(struct ftrace_func_command *cmd)
{
	struct ftrace_func_command *p, *n;
	int ret = -ENODEV;

	mutex_lock(&ftrace_cmd_mutex);
	list_for_each_entry_safe(p, n, &ftrace_commands, list) {
		if (strcmp(cmd->name, p->name) == 0) {
			ret = 0;
			list_del_init(&p->list);
			goto out_unlock;
		}
	}
 out_unlock:
	mutex_unlock(&ftrace_cmd_mutex);

	return ret;
}

2262 2263
static int ftrace_process_regex(char *buff, int len, int enable)
{
2264
	char *func, *command, *next = buff;
2265
	struct ftrace_ops *ops = &global_ops;
S
Steven Rostedt 已提交
2266
	struct ftrace_func_command *p;
2267
	struct ftrace_hash *hash;
2268
	int ret;
2269

2270
	if (enable)
2271
		hash = ops->filter_hash;
2272
	else
2273
		hash = ops->notrace_hash;
2274

2275 2276 2277
	func = strsep(&next, ":");

	if (!next) {
2278
		ret = ftrace_match_records(hash, func, len);
2279 2280 2281 2282 2283
		if (!ret)
			ret = -EINVAL;
		if (ret < 0)
			return ret;
		return 0;
2284 2285
	}

2286
	/* command found */
2287 2288 2289

	command = strsep(&next, ":");

2290 2291 2292 2293 2294 2295
	mutex_lock(&ftrace_cmd_mutex);
	list_for_each_entry(p, &ftrace_commands, list) {
		if (strcmp(p->name, command) == 0) {
			ret = p->func(func, command, next, enable);
			goto out_unlock;
		}
2296
	}
2297 2298
 out_unlock:
	mutex_unlock(&ftrace_cmd_mutex);
2299

2300
	return ret;
2301 2302
}

I
Ingo Molnar 已提交
2303
static ssize_t
2304 2305
ftrace_regex_write(struct file *file, const char __user *ubuf,
		   size_t cnt, loff_t *ppos, int enable)
2306 2307
{
	struct ftrace_iterator *iter;
2308 2309
	struct trace_parser *parser;
	ssize_t ret, read;
2310

2311
	if (!cnt)
2312 2313
		return 0;

2314
	mutex_lock(&ftrace_regex_lock);
2315

2316 2317 2318 2319
	ret = -ENODEV;
	if (unlikely(ftrace_disabled))
		goto out_unlock;

2320 2321 2322 2323 2324 2325
	if (file->f_mode & FMODE_READ) {
		struct seq_file *m = file->private_data;
		iter = m->private;
	} else
		iter = file->private_data;

2326 2327
	parser = &iter->parser;
	read = trace_get_user(parser, ubuf, cnt, ppos);
2328

2329
	if (read >= 0 && trace_parser_loaded(parser) &&
2330 2331 2332
	    !trace_parser_cont(parser)) {
		ret = ftrace_process_regex(parser->buffer,
					   parser->idx, enable);
2333
		trace_parser_clear(parser);
2334
		if (ret)
2335
			goto out_unlock;
2336
	}
2337 2338

	ret = read;
2339
out_unlock:
2340
	mutex_unlock(&ftrace_regex_lock);
2341

2342 2343 2344
	return ret;
}

2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359
static ssize_t
ftrace_filter_write(struct file *file, const char __user *ubuf,
		    size_t cnt, loff_t *ppos)
{
	return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
}

static ssize_t
ftrace_notrace_write(struct file *file, const char __user *ubuf,
		     size_t cnt, loff_t *ppos)
{
	return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
}

static void
2360 2361
ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
		 int reset, int enable)
2362
{
2363 2364
	struct ftrace_hash *hash;

2365 2366 2367
	if (unlikely(ftrace_disabled))
		return;

2368 2369 2370 2371 2372
	if (enable)
		hash = ops->filter_hash;
	else
		hash = ops->notrace_hash;

2373 2374
	mutex_lock(&ftrace_regex_lock);
	if (reset)
2375
		ftrace_filter_reset(hash);
2376
	if (buf)
2377
		ftrace_match_records(hash, buf, len);
2378 2379 2380
	mutex_unlock(&ftrace_regex_lock);
}

2381 2382 2383 2384 2385 2386 2387 2388 2389
/**
 * ftrace_set_filter - set a function to filter on in ftrace
 * @buf - the string that holds the function filter text.
 * @len - the length of the string.
 * @reset - non zero to reset all filters before applying this filter.
 *
 * Filters denote which functions should be enabled when tracing is enabled.
 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
 */
I
Ingo Molnar 已提交
2390
void ftrace_set_filter(unsigned char *buf, int len, int reset)
2391
{
2392
	ftrace_set_regex(&global_ops, buf, len, reset, 1);
2393
}
2394

2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406
/**
 * ftrace_set_notrace - set a function to not trace in ftrace
 * @buf - the string that holds the function notrace text.
 * @len - the length of the string.
 * @reset - non zero to reset all filters before applying this filter.
 *
 * Notrace Filters denote which functions should not be enabled when tracing
 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
 * for tracing.
 */
void ftrace_set_notrace(unsigned char *buf, int len, int reset)
{
2407
	ftrace_set_regex(&global_ops, buf, len, reset, 0);
2408 2409
}

2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430
/*
 * command line interface to allow users to set filters on boot up.
 */
#define FTRACE_FILTER_SIZE		COMMAND_LINE_SIZE
static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;

static int __init set_ftrace_notrace(char *str)
{
	strncpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
	return 1;
}
__setup("ftrace_notrace=", set_ftrace_notrace);

static int __init set_ftrace_filter(char *str)
{
	strncpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
	return 1;
}
__setup("ftrace_filter=", set_ftrace_filter);

2431
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
2432
static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
2433 2434
static int ftrace_set_func(unsigned long *array, int *idx, char *buffer);

2435 2436
static int __init set_graph_function(char *str)
{
2437
	strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458
	return 1;
}
__setup("ftrace_graph_filter=", set_graph_function);

static void __init set_ftrace_early_graph(char *buf)
{
	int ret;
	char *func;

	while (buf) {
		func = strsep(&buf, ",");
		/* we allow only one expression at a time */
		ret = ftrace_set_func(ftrace_graph_funcs, &ftrace_graph_count,
				      func);
		if (ret)
			printk(KERN_DEBUG "ftrace: function %s not "
					  "traceable\n", func);
	}
}
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */

2459 2460
static void __init
set_ftrace_early_filter(struct ftrace_ops *ops, char *buf, int enable)
2461 2462 2463 2464 2465
{
	char *func;

	while (buf) {
		func = strsep(&buf, ",");
2466
		ftrace_set_regex(ops, func, strlen(func), 0, enable);
2467 2468 2469 2470 2471 2472
	}
}

static void __init set_ftrace_early_filters(void)
{
	if (ftrace_filter_buf[0])
2473
		set_ftrace_early_filter(&global_ops, ftrace_filter_buf, 1);
2474
	if (ftrace_notrace_buf[0])
2475
		set_ftrace_early_filter(&global_ops, ftrace_notrace_buf, 0);
2476 2477 2478 2479
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
	if (ftrace_graph_buf[0])
		set_ftrace_early_graph(ftrace_graph_buf);
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
2480 2481
}

I
Ingo Molnar 已提交
2482
static int
2483
ftrace_regex_release(struct inode *inode, struct file *file)
2484 2485 2486
{
	struct seq_file *m = (struct seq_file *)file->private_data;
	struct ftrace_iterator *iter;
2487
	struct trace_parser *parser;
2488

2489
	mutex_lock(&ftrace_regex_lock);
2490 2491 2492 2493 2494 2495 2496
	if (file->f_mode & FMODE_READ) {
		iter = m->private;

		seq_release(inode, file);
	} else
		iter = file->private_data;

2497 2498 2499
	parser = &iter->parser;
	if (trace_parser_loaded(parser)) {
		parser->buffer[parser->idx] = 0;
2500
		ftrace_match_records(iter->hash, parser->buffer, parser->idx);
2501 2502
	}

2503
	trace_parser_put(parser);
2504
	kfree(iter);
2505

2506 2507 2508 2509 2510 2511 2512
	if (file->f_mode & FMODE_WRITE) {
		mutex_lock(&ftrace_lock);
		if (ftrace_start_up && ftrace_enabled)
			ftrace_run_update_code(FTRACE_ENABLE_CALLS);
		mutex_unlock(&ftrace_lock);
	}

2513
	mutex_unlock(&ftrace_regex_lock);
2514 2515 2516
	return 0;
}

2517
static const struct file_operations ftrace_avail_fops = {
2518 2519 2520
	.open = ftrace_avail_open,
	.read = seq_read,
	.llseek = seq_lseek,
L
Li Zefan 已提交
2521
	.release = seq_release_private,
2522 2523
};

2524
static const struct file_operations ftrace_filter_fops = {
2525
	.open = ftrace_filter_open,
L
Lai Jiangshan 已提交
2526
	.read = seq_read,
2527
	.write = ftrace_filter_write,
2528
	.llseek = ftrace_regex_lseek,
2529
	.release = ftrace_regex_release,
2530 2531
};

2532
static const struct file_operations ftrace_notrace_fops = {
2533
	.open = ftrace_notrace_open,
L
Lai Jiangshan 已提交
2534
	.read = seq_read,
2535 2536
	.write = ftrace_notrace_write,
	.llseek = ftrace_regex_lseek,
2537
	.release = ftrace_regex_release,
2538 2539
};

2540 2541 2542 2543 2544
#ifdef CONFIG_FUNCTION_GRAPH_TRACER

static DEFINE_MUTEX(graph_lock);

int ftrace_graph_count;
2545
int ftrace_graph_filter_enabled;
2546 2547 2548
unsigned long ftrace_graph_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;

static void *
2549
__g_next(struct seq_file *m, loff_t *pos)
2550
{
2551
	if (*pos >= ftrace_graph_count)
2552
		return NULL;
2553
	return &ftrace_graph_funcs[*pos];
2554
}
2555

2556 2557 2558 2559 2560
static void *
g_next(struct seq_file *m, void *v, loff_t *pos)
{
	(*pos)++;
	return __g_next(m, pos);
2561 2562 2563 2564 2565 2566
}

static void *g_start(struct seq_file *m, loff_t *pos)
{
	mutex_lock(&graph_lock);

2567
	/* Nothing, tell g_show to print all functions are enabled */
2568
	if (!ftrace_graph_filter_enabled && !*pos)
2569 2570
		return (void *)1;

2571
	return __g_next(m, pos);
2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585
}

static void g_stop(struct seq_file *m, void *p)
{
	mutex_unlock(&graph_lock);
}

static int g_show(struct seq_file *m, void *v)
{
	unsigned long *ptr = v;

	if (!ptr)
		return 0;

2586 2587 2588 2589 2590
	if (ptr == (unsigned long *)1) {
		seq_printf(m, "#### all functions enabled ####\n");
		return 0;
	}

2591
	seq_printf(m, "%ps\n", (void *)*ptr);
2592 2593 2594 2595

	return 0;
}

J
James Morris 已提交
2596
static const struct seq_operations ftrace_graph_seq_ops = {
2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612
	.start = g_start,
	.next = g_next,
	.stop = g_stop,
	.show = g_show,
};

static int
ftrace_graph_open(struct inode *inode, struct file *file)
{
	int ret = 0;

	if (unlikely(ftrace_disabled))
		return -ENODEV;

	mutex_lock(&graph_lock);
	if ((file->f_mode & FMODE_WRITE) &&
2613
	    (file->f_flags & O_TRUNC)) {
2614
		ftrace_graph_filter_enabled = 0;
2615 2616 2617
		ftrace_graph_count = 0;
		memset(ftrace_graph_funcs, 0, sizeof(ftrace_graph_funcs));
	}
2618
	mutex_unlock(&graph_lock);
2619

2620
	if (file->f_mode & FMODE_READ)
2621 2622 2623 2624 2625
		ret = seq_open(file, &ftrace_graph_seq_ops);

	return ret;
}

2626 2627 2628 2629 2630 2631 2632 2633
static int
ftrace_graph_release(struct inode *inode, struct file *file)
{
	if (file->f_mode & FMODE_READ)
		seq_release(inode, file);
	return 0;
}

2634
static int
2635
ftrace_set_func(unsigned long *array, int *idx, char *buffer)
2636 2637 2638
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;
2639
	int search_len;
2640
	int fail = 1;
2641 2642 2643 2644
	int type, not;
	char *search;
	bool exists;
	int i;
2645

2646
	/* decode regex */
2647
	type = filter_parse_regex(buffer, strlen(buffer), &search, &not);
2648 2649
	if (!not && *idx >= FTRACE_GRAPH_MAX_FUNCS)
		return -EBUSY;
2650 2651 2652

	search_len = strlen(search);

2653
	mutex_lock(&ftrace_lock);
2654 2655 2656 2657 2658 2659

	if (unlikely(ftrace_disabled)) {
		mutex_unlock(&ftrace_lock);
		return -ENODEV;
	}

2660 2661
	do_for_each_ftrace_rec(pg, rec) {

2662
		if (rec->flags & FTRACE_FL_FREE)
2663 2664
			continue;

2665
		if (ftrace_match_record(rec, NULL, search, search_len, type)) {
2666
			/* if it is in the array */
2667
			exists = false;
2668
			for (i = 0; i < *idx; i++) {
2669 2670
				if (array[i] == rec->ip) {
					exists = true;
2671 2672
					break;
				}
2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688
			}

			if (!not) {
				fail = 0;
				if (!exists) {
					array[(*idx)++] = rec->ip;
					if (*idx >= FTRACE_GRAPH_MAX_FUNCS)
						goto out;
				}
			} else {
				if (exists) {
					array[i] = array[--(*idx)];
					array[*idx] = 0;
					fail = 0;
				}
			}
2689
		}
2690
	} while_for_each_ftrace_rec();
2691
out:
2692
	mutex_unlock(&ftrace_lock);
2693

2694 2695 2696 2697 2698
	if (fail)
		return -EINVAL;

	ftrace_graph_filter_enabled = 1;
	return 0;
2699 2700 2701 2702 2703 2704
}

static ssize_t
ftrace_graph_write(struct file *file, const char __user *ubuf,
		   size_t cnt, loff_t *ppos)
{
2705
	struct trace_parser parser;
2706
	ssize_t read, ret;
2707

2708
	if (!cnt)
2709 2710 2711 2712
		return 0;

	mutex_lock(&graph_lock);

2713 2714
	if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX)) {
		ret = -ENOMEM;
2715
		goto out_unlock;
2716 2717
	}

2718
	read = trace_get_user(&parser, ubuf, cnt, ppos);
2719

2720
	if (read >= 0 && trace_parser_loaded((&parser))) {
2721 2722 2723
		parser.buffer[parser.idx] = 0;

		/* we allow only one expression at a time */
2724
		ret = ftrace_set_func(ftrace_graph_funcs, &ftrace_graph_count,
2725
					parser.buffer);
2726
		if (ret)
2727
			goto out_free;
2728 2729 2730
	}

	ret = read;
2731 2732

out_free:
2733
	trace_parser_put(&parser);
2734
out_unlock:
2735 2736 2737 2738 2739 2740
	mutex_unlock(&graph_lock);

	return ret;
}

static const struct file_operations ftrace_graph_fops = {
2741 2742 2743 2744
	.open		= ftrace_graph_open,
	.read		= seq_read,
	.write		= ftrace_graph_write,
	.release	= ftrace_graph_release,
2745
	.llseek		= seq_lseek,
2746 2747 2748
};
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */

2749
static __init int ftrace_init_dyn_debugfs(struct dentry *d_tracer)
2750 2751
{

2752 2753
	trace_create_file("available_filter_functions", 0444,
			d_tracer, NULL, &ftrace_avail_fops);
2754

2755 2756
	trace_create_file("set_ftrace_filter", 0644, d_tracer,
			NULL, &ftrace_filter_fops);
2757

2758
	trace_create_file("set_ftrace_notrace", 0644, d_tracer,
2759
				    NULL, &ftrace_notrace_fops);
2760

2761
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
2762
	trace_create_file("set_graph_function", 0444, d_tracer,
2763 2764 2765 2766
				    NULL,
				    &ftrace_graph_fops);
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */

2767 2768 2769
	return 0;
}

2770
static int ftrace_process_locs(struct module *mod,
2771
			       unsigned long *start,
2772 2773 2774 2775 2776
			       unsigned long *end)
{
	unsigned long *p;
	unsigned long addr;

S
Steven Rostedt 已提交
2777
	mutex_lock(&ftrace_lock);
2778 2779 2780
	p = start;
	while (p < end) {
		addr = ftrace_call_adjust(*p++);
2781 2782 2783 2784 2785 2786 2787 2788
		/*
		 * Some architecture linkers will pad between
		 * the different mcount_loc sections of different
		 * object files to satisfy alignments.
		 * Skip any NULL pointers.
		 */
		if (!addr)
			continue;
2789 2790 2791
		ftrace_record_ip(addr);
	}

2792
	ftrace_update_code(mod);
S
Steven Rostedt 已提交
2793
	mutex_unlock(&ftrace_lock);
2794 2795 2796 2797

	return 0;
}

2798
#ifdef CONFIG_MODULES
2799
void ftrace_release_mod(struct module *mod)
2800 2801 2802 2803
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;

2804 2805
	mutex_lock(&ftrace_lock);

2806
	if (ftrace_disabled)
2807
		goto out_unlock;
2808 2809

	do_for_each_ftrace_rec(pg, rec) {
2810
		if (within_module_core(rec->ip, mod)) {
2811 2812 2813 2814 2815 2816 2817 2818
			/*
			 * rec->ip is changed in ftrace_free_rec()
			 * It should not between s and e if record was freed.
			 */
			FTRACE_WARN_ON(rec->flags & FTRACE_FL_FREE);
			ftrace_free_rec(rec);
		}
	} while_for_each_ftrace_rec();
2819
 out_unlock:
2820 2821 2822 2823 2824
	mutex_unlock(&ftrace_lock);
}

static void ftrace_init_module(struct module *mod,
			       unsigned long *start, unsigned long *end)
2825
{
2826
	if (ftrace_disabled || start == end)
2827
		return;
2828
	ftrace_process_locs(mod, start, end);
2829 2830
}

2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842
static int ftrace_module_notify(struct notifier_block *self,
				unsigned long val, void *data)
{
	struct module *mod = data;

	switch (val) {
	case MODULE_STATE_COMING:
		ftrace_init_module(mod, mod->ftrace_callsites,
				   mod->ftrace_callsites +
				   mod->num_ftrace_callsites);
		break;
	case MODULE_STATE_GOING:
2843
		ftrace_release_mod(mod);
2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861
		break;
	}

	return 0;
}
#else
static int ftrace_module_notify(struct notifier_block *self,
				unsigned long val, void *data)
{
	return 0;
}
#endif /* CONFIG_MODULES */

struct notifier_block ftrace_module_nb = {
	.notifier_call = ftrace_module_notify,
	.priority = 0,
};

2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888
extern unsigned long __start_mcount_loc[];
extern unsigned long __stop_mcount_loc[];

void __init ftrace_init(void)
{
	unsigned long count, addr, flags;
	int ret;

	/* Keep the ftrace pointer to the stub */
	addr = (unsigned long)ftrace_stub;

	local_irq_save(flags);
	ftrace_dyn_arch_init(&addr);
	local_irq_restore(flags);

	/* ftrace_dyn_arch_init places the return code in addr */
	if (addr)
		goto failed;

	count = __stop_mcount_loc - __start_mcount_loc;

	ret = ftrace_dyn_table_alloc(count);
	if (ret)
		goto failed;

	last_ftrace_enabled = ftrace_enabled = 1;

2889
	ret = ftrace_process_locs(NULL,
2890
				  __start_mcount_loc,
2891 2892
				  __stop_mcount_loc);

2893
	ret = register_module_notifier(&ftrace_module_nb);
2894
	if (ret)
2895 2896
		pr_warning("Failed to register trace ftrace module notifier\n");

2897 2898
	set_ftrace_early_filters();

2899 2900 2901 2902 2903
	return;
 failed:
	ftrace_disabled = 1;
}

2904
#else
2905 2906 2907 2908 2909 2910 2911 2912

static int __init ftrace_nodyn_init(void)
{
	ftrace_enabled = 1;
	return 0;
}
device_initcall(ftrace_nodyn_init);

2913 2914
static inline int ftrace_init_dyn_debugfs(struct dentry *d_tracer) { return 0; }
static inline void ftrace_startup_enable(int command) { }
2915 2916 2917
/* Keep as macros so we do not need to define the commands */
# define ftrace_startup(command)	do { } while (0)
# define ftrace_shutdown(command)	do { } while (0)
I
Ingo Molnar 已提交
2918 2919
# define ftrace_startup_sysctl()	do { } while (0)
# define ftrace_shutdown_sysctl()	do { } while (0)
2920 2921
#endif /* CONFIG_DYNAMIC_FTRACE */

2922
static void clear_ftrace_swapper(void)
S
Steven Rostedt 已提交
2923 2924
{
	struct task_struct *p;
2925
	int cpu;
S
Steven Rostedt 已提交
2926

2927 2928 2929
	get_online_cpus();
	for_each_online_cpu(cpu) {
		p = idle_task(cpu);
S
Steven Rostedt 已提交
2930
		clear_tsk_trace_trace(p);
2931 2932 2933
	}
	put_online_cpus();
}
S
Steven Rostedt 已提交
2934

2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945
static void set_ftrace_swapper(void)
{
	struct task_struct *p;
	int cpu;

	get_online_cpus();
	for_each_online_cpu(cpu) {
		p = idle_task(cpu);
		set_tsk_trace_trace(p);
	}
	put_online_cpus();
S
Steven Rostedt 已提交
2946 2947
}

2948 2949 2950 2951
static void clear_ftrace_pid(struct pid *pid)
{
	struct task_struct *p;

2952
	rcu_read_lock();
2953 2954 2955
	do_each_pid_task(pid, PIDTYPE_PID, p) {
		clear_tsk_trace_trace(p);
	} while_each_pid_task(pid, PIDTYPE_PID, p);
2956 2957
	rcu_read_unlock();

2958 2959 2960 2961
	put_pid(pid);
}

static void set_ftrace_pid(struct pid *pid)
S
Steven Rostedt 已提交
2962 2963 2964
{
	struct task_struct *p;

2965
	rcu_read_lock();
S
Steven Rostedt 已提交
2966 2967 2968
	do_each_pid_task(pid, PIDTYPE_PID, p) {
		set_tsk_trace_trace(p);
	} while_each_pid_task(pid, PIDTYPE_PID, p);
2969
	rcu_read_unlock();
S
Steven Rostedt 已提交
2970 2971
}

2972
static void clear_ftrace_pid_task(struct pid *pid)
2973
{
2974
	if (pid == ftrace_swapper_pid)
2975 2976
		clear_ftrace_swapper();
	else
2977
		clear_ftrace_pid(pid);
2978 2979 2980 2981 2982 2983 2984 2985 2986 2987
}

static void set_ftrace_pid_task(struct pid *pid)
{
	if (pid == ftrace_swapper_pid)
		set_ftrace_swapper();
	else
		set_ftrace_pid(pid);
}

2988
static int ftrace_pid_add(int p)
2989
{
S
Steven Rostedt 已提交
2990
	struct pid *pid;
2991 2992
	struct ftrace_pid *fpid;
	int ret = -EINVAL;
2993

2994
	mutex_lock(&ftrace_lock);
2995

2996 2997 2998 2999
	if (!p)
		pid = ftrace_swapper_pid;
	else
		pid = find_get_pid(p);
3000

3001 3002
	if (!pid)
		goto out;
3003

3004
	ret = 0;
3005

3006 3007 3008
	list_for_each_entry(fpid, &ftrace_pids, list)
		if (fpid->pid == pid)
			goto out_put;
S
Steven Rostedt 已提交
3009

3010
	ret = -ENOMEM;
3011

3012 3013 3014
	fpid = kmalloc(sizeof(*fpid), GFP_KERNEL);
	if (!fpid)
		goto out_put;
3015

3016 3017
	list_add(&fpid->list, &ftrace_pids);
	fpid->pid = pid;
3018

3019
	set_ftrace_pid_task(pid);
S
Steven Rostedt 已提交
3020

3021 3022 3023 3024 3025 3026 3027 3028 3029
	ftrace_update_pid_func();
	ftrace_startup_enable(0);

	mutex_unlock(&ftrace_lock);
	return 0;

out_put:
	if (pid != ftrace_swapper_pid)
		put_pid(pid);
S
Steven Rostedt 已提交
3030

3031 3032 3033 3034 3035 3036 3037 3038
out:
	mutex_unlock(&ftrace_lock);
	return ret;
}

static void ftrace_pid_reset(void)
{
	struct ftrace_pid *fpid, *safe;
S
Steven Rostedt 已提交
3039

3040 3041 3042 3043 3044 3045 3046 3047
	mutex_lock(&ftrace_lock);
	list_for_each_entry_safe(fpid, safe, &ftrace_pids, list) {
		struct pid *pid = fpid->pid;

		clear_ftrace_pid_task(pid);

		list_del(&fpid->list);
		kfree(fpid);
3048 3049 3050 3051 3052
	}

	ftrace_update_pid_func();
	ftrace_startup_enable(0);

S
Steven Rostedt 已提交
3053
	mutex_unlock(&ftrace_lock);
3054
}
3055

3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117
static void *fpid_start(struct seq_file *m, loff_t *pos)
{
	mutex_lock(&ftrace_lock);

	if (list_empty(&ftrace_pids) && (!*pos))
		return (void *) 1;

	return seq_list_start(&ftrace_pids, *pos);
}

static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
{
	if (v == (void *)1)
		return NULL;

	return seq_list_next(v, &ftrace_pids, pos);
}

static void fpid_stop(struct seq_file *m, void *p)
{
	mutex_unlock(&ftrace_lock);
}

static int fpid_show(struct seq_file *m, void *v)
{
	const struct ftrace_pid *fpid = list_entry(v, struct ftrace_pid, list);

	if (v == (void *)1) {
		seq_printf(m, "no pid\n");
		return 0;
	}

	if (fpid->pid == ftrace_swapper_pid)
		seq_printf(m, "swapper tasks\n");
	else
		seq_printf(m, "%u\n", pid_vnr(fpid->pid));

	return 0;
}

static const struct seq_operations ftrace_pid_sops = {
	.start = fpid_start,
	.next = fpid_next,
	.stop = fpid_stop,
	.show = fpid_show,
};

static int
ftrace_pid_open(struct inode *inode, struct file *file)
{
	int ret = 0;

	if ((file->f_mode & FMODE_WRITE) &&
	    (file->f_flags & O_TRUNC))
		ftrace_pid_reset();

	if (file->f_mode & FMODE_READ)
		ret = seq_open(file, &ftrace_pid_sops);

	return ret;
}

3118 3119 3120 3121
static ssize_t
ftrace_pid_write(struct file *filp, const char __user *ubuf,
		   size_t cnt, loff_t *ppos)
{
3122
	char buf[64], *tmp;
3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133
	long val;
	int ret;

	if (cnt >= sizeof(buf))
		return -EINVAL;

	if (copy_from_user(&buf, ubuf, cnt))
		return -EFAULT;

	buf[cnt] = 0;

3134 3135 3136 3137
	/*
	 * Allow "echo > set_ftrace_pid" or "echo -n '' > set_ftrace_pid"
	 * to clean the filter quietly.
	 */
3138 3139
	tmp = strstrip(buf);
	if (strlen(tmp) == 0)
3140 3141
		return 1;

3142
	ret = strict_strtol(tmp, 10, &val);
3143 3144 3145
	if (ret < 0)
		return ret;

3146
	ret = ftrace_pid_add(val);
3147

3148 3149
	return ret ? ret : cnt;
}
3150

3151 3152 3153 3154 3155
static int
ftrace_pid_release(struct inode *inode, struct file *file)
{
	if (file->f_mode & FMODE_READ)
		seq_release(inode, file);
3156

3157
	return 0;
3158 3159
}

3160
static const struct file_operations ftrace_pid_fops = {
3161 3162 3163 3164 3165
	.open		= ftrace_pid_open,
	.write		= ftrace_pid_write,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= ftrace_pid_release,
3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177
};

static __init int ftrace_init_debugfs(void)
{
	struct dentry *d_tracer;

	d_tracer = tracing_init_dentry();
	if (!d_tracer)
		return 0;

	ftrace_init_dyn_debugfs(d_tracer);

3178 3179
	trace_create_file("set_ftrace_pid", 0644, d_tracer,
			    NULL, &ftrace_pid_fops);
3180 3181 3182

	ftrace_profile_debugfs(d_tracer);

3183 3184 3185 3186
	return 0;
}
fs_initcall(ftrace_init_debugfs);

S
Steven Rostedt 已提交
3187
/**
3188
 * ftrace_kill - kill ftrace
S
Steven Rostedt 已提交
3189 3190 3191 3192 3193
 *
 * This function should be used by panic code. It stops ftrace
 * but in a not so nice way. If you need to simply kill ftrace
 * from a non-atomic section, use ftrace_kill.
 */
3194
void ftrace_kill(void)
S
Steven Rostedt 已提交
3195 3196 3197 3198 3199 3200
{
	ftrace_disabled = 1;
	ftrace_enabled = 0;
	clear_ftrace_function();
}

3201
/**
3202 3203
 * register_ftrace_function - register a function for profiling
 * @ops - ops structure that holds the function for profiling.
3204
 *
3205 3206 3207 3208 3209 3210
 * Register a function to be called by all functions in the
 * kernel.
 *
 * Note: @ops->func and all the functions it calls must be labeled
 *       with "notrace", otherwise it will go into a
 *       recursive loop.
3211
 */
3212
int register_ftrace_function(struct ftrace_ops *ops)
3213
{
3214
	int ret = -1;
3215

S
Steven Rostedt 已提交
3216
	mutex_lock(&ftrace_lock);
3217

3218 3219 3220
	if (unlikely(ftrace_disabled))
		goto out_unlock;

3221
	ret = __register_ftrace_function(ops);
3222
	ftrace_startup(0);
3223

3224
 out_unlock:
S
Steven Rostedt 已提交
3225
	mutex_unlock(&ftrace_lock);
3226
	return ret;
3227 3228 3229
}

/**
3230
 * unregister_ftrace_function - unregister a function for profiling.
3231 3232 3233 3234 3235 3236 3237 3238
 * @ops - ops structure that holds the function to unregister
 *
 * Unregister a function that was added to be called by ftrace profiling.
 */
int unregister_ftrace_function(struct ftrace_ops *ops)
{
	int ret;

S
Steven Rostedt 已提交
3239
	mutex_lock(&ftrace_lock);
3240
	ret = __unregister_ftrace_function(ops);
3241
	ftrace_shutdown(0);
S
Steven Rostedt 已提交
3242
	mutex_unlock(&ftrace_lock);
3243 3244 3245 3246

	return ret;
}

I
Ingo Molnar 已提交
3247
int
3248
ftrace_enable_sysctl(struct ctl_table *table, int write,
3249
		     void __user *buffer, size_t *lenp,
3250 3251
		     loff_t *ppos)
{
3252
	int ret = -ENODEV;
3253

S
Steven Rostedt 已提交
3254
	mutex_lock(&ftrace_lock);
3255

3256 3257 3258 3259
	if (unlikely(ftrace_disabled))
		goto out;

	ret = proc_dointvec(table, write, buffer, lenp, ppos);
3260

3261
	if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
3262 3263
		goto out;

3264
	last_ftrace_enabled = !!ftrace_enabled;
3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285

	if (ftrace_enabled) {

		ftrace_startup_sysctl();

		/* we are starting ftrace again */
		if (ftrace_list != &ftrace_list_end) {
			if (ftrace_list->next == &ftrace_list_end)
				ftrace_trace_function = ftrace_list->func;
			else
				ftrace_trace_function = ftrace_list_func;
		}

	} else {
		/* stopping ftrace calls (just send to ftrace_stub) */
		ftrace_trace_function = ftrace_stub;

		ftrace_shutdown_sysctl();
	}

 out:
S
Steven Rostedt 已提交
3286
	mutex_unlock(&ftrace_lock);
3287
	return ret;
3288
}
3289

3290
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
3291

3292
static int ftrace_graph_active;
3293
static struct notifier_block ftrace_suspend_notifier;
3294

3295 3296 3297 3298 3299
int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
{
	return 0;
}

3300 3301 3302
/* The callbacks that hook a function */
trace_func_graph_ret_t ftrace_graph_return =
			(trace_func_graph_ret_t)ftrace_stub;
3303
trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333

/* Try to assign a return stack array on FTRACE_RETSTACK_ALLOC_SIZE tasks. */
static int alloc_retstack_tasklist(struct ftrace_ret_stack **ret_stack_list)
{
	int i;
	int ret = 0;
	unsigned long flags;
	int start = 0, end = FTRACE_RETSTACK_ALLOC_SIZE;
	struct task_struct *g, *t;

	for (i = 0; i < FTRACE_RETSTACK_ALLOC_SIZE; i++) {
		ret_stack_list[i] = kmalloc(FTRACE_RETFUNC_DEPTH
					* sizeof(struct ftrace_ret_stack),
					GFP_KERNEL);
		if (!ret_stack_list[i]) {
			start = 0;
			end = i;
			ret = -ENOMEM;
			goto free;
		}
	}

	read_lock_irqsave(&tasklist_lock, flags);
	do_each_thread(g, t) {
		if (start == end) {
			ret = -EAGAIN;
			goto unlock;
		}

		if (t->ret_stack == NULL) {
3334
			atomic_set(&t->tracing_graph_pause, 0);
3335
			atomic_set(&t->trace_overrun, 0);
3336 3337 3338 3339
			t->curr_ret_stack = -1;
			/* Make sure the tasks see the -1 first: */
			smp_wmb();
			t->ret_stack = ret_stack_list[start++];
3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350
		}
	} while_each_thread(g, t);

unlock:
	read_unlock_irqrestore(&tasklist_lock, flags);
free:
	for (i = start; i < end; i++)
		kfree(ret_stack_list[i]);
	return ret;
}

3351
static void
3352 3353
ftrace_graph_probe_sched_switch(void *ignore,
			struct task_struct *prev, struct task_struct *next)
3354 3355 3356 3357
{
	unsigned long long timestamp;
	int index;

3358 3359 3360 3361 3362 3363 3364
	/*
	 * Does the user want to count the time a function was asleep.
	 * If so, do not update the time stamps.
	 */
	if (trace_flags & TRACE_ITER_SLEEP_TIME)
		return;

3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382
	timestamp = trace_clock_local();

	prev->ftrace_timestamp = timestamp;

	/* only process tasks that we timestamped */
	if (!next->ftrace_timestamp)
		return;

	/*
	 * Update all the counters in next to make up for the
	 * time next was sleeping.
	 */
	timestamp -= next->ftrace_timestamp;

	for (index = next->curr_ret_stack; index >= 0; index--)
		next->ret_stack[index].calltime += timestamp;
}

3383
/* Allocate a return stack for each task */
3384
static int start_graph_tracing(void)
3385 3386
{
	struct ftrace_ret_stack **ret_stack_list;
3387
	int ret, cpu;
3388 3389 3390 3391 3392 3393 3394 3395

	ret_stack_list = kmalloc(FTRACE_RETSTACK_ALLOC_SIZE *
				sizeof(struct ftrace_ret_stack *),
				GFP_KERNEL);

	if (!ret_stack_list)
		return -ENOMEM;

3396
	/* The cpu_boot init_task->ret_stack will never be freed */
3397 3398
	for_each_online_cpu(cpu) {
		if (!idle_task(cpu)->ret_stack)
3399
			ftrace_graph_init_idle_task(idle_task(cpu), cpu);
3400
	}
3401

3402 3403 3404 3405
	do {
		ret = alloc_retstack_tasklist(ret_stack_list);
	} while (ret == -EAGAIN);

3406
	if (!ret) {
3407
		ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
3408 3409 3410 3411 3412
		if (ret)
			pr_info("ftrace_graph: Couldn't activate tracepoint"
				" probe to kernel_sched_switch\n");
	}

3413 3414 3415 3416
	kfree(ret_stack_list);
	return ret;
}

3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437
/*
 * Hibernation protection.
 * The state of the current task is too much unstable during
 * suspend/restore to disk. We want to protect against that.
 */
static int
ftrace_suspend_notifier_call(struct notifier_block *bl, unsigned long state,
							void *unused)
{
	switch (state) {
	case PM_HIBERNATION_PREPARE:
		pause_graph_tracing();
		break;

	case PM_POST_HIBERNATION:
		unpause_graph_tracing();
		break;
	}
	return NOTIFY_DONE;
}

3438 3439
int register_ftrace_graph(trace_func_graph_ret_t retfunc,
			trace_func_graph_ent_t entryfunc)
3440
{
3441 3442
	int ret = 0;

S
Steven Rostedt 已提交
3443
	mutex_lock(&ftrace_lock);
3444

3445
	/* we currently allow only one tracer registered at a time */
3446
	if (ftrace_graph_active) {
3447 3448 3449 3450
		ret = -EBUSY;
		goto out;
	}

3451 3452 3453
	ftrace_suspend_notifier.notifier_call = ftrace_suspend_notifier_call;
	register_pm_notifier(&ftrace_suspend_notifier);

3454
	ftrace_graph_active++;
3455
	ret = start_graph_tracing();
3456
	if (ret) {
3457
		ftrace_graph_active--;
3458 3459
		goto out;
	}
3460

3461 3462
	ftrace_graph_return = retfunc;
	ftrace_graph_entry = entryfunc;
3463

3464
	ftrace_startup(FTRACE_START_FUNC_RET);
3465 3466

out:
S
Steven Rostedt 已提交
3467
	mutex_unlock(&ftrace_lock);
3468
	return ret;
3469 3470
}

3471
void unregister_ftrace_graph(void)
3472
{
S
Steven Rostedt 已提交
3473
	mutex_lock(&ftrace_lock);
3474

3475
	if (unlikely(!ftrace_graph_active))
3476 3477
		goto out;

3478
	ftrace_graph_active--;
3479
	ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
3480
	ftrace_graph_entry = ftrace_graph_entry_stub;
3481
	ftrace_shutdown(FTRACE_STOP_FUNC_RET);
3482
	unregister_pm_notifier(&ftrace_suspend_notifier);
3483
	unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
3484

3485
 out:
S
Steven Rostedt 已提交
3486
	mutex_unlock(&ftrace_lock);
3487
}
3488

3489 3490 3491 3492 3493 3494 3495 3496
static DEFINE_PER_CPU(struct ftrace_ret_stack *, idle_ret_stack);

static void
graph_init_task(struct task_struct *t, struct ftrace_ret_stack *ret_stack)
{
	atomic_set(&t->tracing_graph_pause, 0);
	atomic_set(&t->trace_overrun, 0);
	t->ftrace_timestamp = 0;
L
Lucas De Marchi 已提交
3497
	/* make curr_ret_stack visible before we add the ret_stack */
3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531
	smp_wmb();
	t->ret_stack = ret_stack;
}

/*
 * Allocate a return stack for the idle task. May be the first
 * time through, or it may be done by CPU hotplug online.
 */
void ftrace_graph_init_idle_task(struct task_struct *t, int cpu)
{
	t->curr_ret_stack = -1;
	/*
	 * The idle task has no parent, it either has its own
	 * stack or no stack at all.
	 */
	if (t->ret_stack)
		WARN_ON(t->ret_stack != per_cpu(idle_ret_stack, cpu));

	if (ftrace_graph_active) {
		struct ftrace_ret_stack *ret_stack;

		ret_stack = per_cpu(idle_ret_stack, cpu);
		if (!ret_stack) {
			ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
					    * sizeof(struct ftrace_ret_stack),
					    GFP_KERNEL);
			if (!ret_stack)
				return;
			per_cpu(idle_ret_stack, cpu) = ret_stack;
		}
		graph_init_task(t, ret_stack);
	}
}

3532
/* Allocate a return stack for newly created task */
3533
void ftrace_graph_init_task(struct task_struct *t)
3534
{
3535 3536
	/* Make sure we do not use the parent ret_stack */
	t->ret_stack = NULL;
3537
	t->curr_ret_stack = -1;
3538

3539
	if (ftrace_graph_active) {
3540 3541 3542
		struct ftrace_ret_stack *ret_stack;

		ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
3543 3544
				* sizeof(struct ftrace_ret_stack),
				GFP_KERNEL);
3545
		if (!ret_stack)
3546
			return;
3547
		graph_init_task(t, ret_stack);
3548
	}
3549 3550
}

3551
void ftrace_graph_exit_task(struct task_struct *t)
3552
{
3553 3554
	struct ftrace_ret_stack	*ret_stack = t->ret_stack;

3555
	t->ret_stack = NULL;
3556 3557 3558 3559
	/* NULL must become visible to IRQs before we free it: */
	barrier();

	kfree(ret_stack);
3560
}
S
Steven Rostedt 已提交
3561 3562 3563 3564 3565

void ftrace_graph_stop(void)
{
	ftrace_stop();
}
3566
#endif