ftrace.c 85.8 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 61
#define FTRACE_HASH_DEFAULT_BITS 10
#define FTRACE_HASH_MAX_BITS 12
62

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

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

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

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

83
static DEFINE_MUTEX(ftrace_lock);
84

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

90 91
static struct ftrace_ops *ftrace_global_list __read_mostly = &ftrace_list_end;
static struct ftrace_ops *ftrace_ops_list __read_mostly = &ftrace_list_end;
92
ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
93
ftrace_func_t __ftrace_trace_function __read_mostly = ftrace_stub;
94
ftrace_func_t ftrace_pid_function __read_mostly = ftrace_stub;
95
static struct ftrace_ops global_ops;
96

97 98 99
static void
ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip);

100
/*
101
 * Traverse the ftrace_global_list, invoking all entries.  The reason that we
102 103 104
 * 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
105
 * concurrent insertions into the ftrace_global_list.
106 107 108
 *
 * Silly Alpha and silly pointer-speculation compiler optimizations!
 */
109 110
static void ftrace_global_list_func(unsigned long ip,
				    unsigned long parent_ip)
111
{
112
	struct ftrace_ops *op = rcu_dereference_raw(ftrace_global_list); /*see above*/
113 114 115

	while (op != &ftrace_list_end) {
		op->func(ip, parent_ip);
116
		op = rcu_dereference_raw(op->next); /*see above*/
117 118 119
	};
}

120 121
static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip)
{
122
	if (!test_tsk_trace_trace(current))
123 124 125 126 127 128 129 130 131 132 133 134
		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;
}

135
/**
136
 * clear_ftrace_function - reset the ftrace function
137
 *
138 139
 * This NULLs the ftrace function and in essence stops
 * tracing.  There may be lag
140
 */
141
void clear_ftrace_function(void)
142
{
143
	ftrace_trace_function = ftrace_stub;
144
	__ftrace_trace_function = ftrace_stub;
145
	ftrace_pid_function = ftrace_stub;
146 147
}

148 149 150 151 152 153 154 155 156 157 158 159 160 161
#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

162
static void update_global_ops(void)
163 164 165 166 167 168 169 170
{
	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.
	 */
171 172 173
	if (ftrace_global_list == &ftrace_list_end ||
	    ftrace_global_list->next == &ftrace_list_end)
		func = ftrace_global_list->func;
174
	else
175
		func = ftrace_global_list_func;
176 177 178 179 180 181

	/* 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;
	}
182 183 184 185 186 187 188 189 190 191

	global_ops.func = func;
}

static void update_ftrace_function(void)
{
	ftrace_func_t func;

	update_global_ops();

192 193 194 195 196
	/*
	 * If we are at the end of the list and this ops is
	 * not dynamic, then have the mcount trampoline call
	 * the function directly
	 */
197
	if (ftrace_ops_list == &ftrace_list_end ||
198 199
	    (ftrace_ops_list->next == &ftrace_list_end &&
	     !(ftrace_ops_list->flags & FTRACE_OPS_FL_DYNAMIC)))
200 201 202
		func = ftrace_ops_list->func;
	else
		func = ftrace_ops_list_func;
203

204 205 206 207 208 209 210 211
#ifdef CONFIG_HAVE_FUNCTION_TRACE_MCOUNT_TEST
	ftrace_trace_function = func;
#else
	__ftrace_trace_function = func;
	ftrace_trace_function = ftrace_test_stop_func;
#endif
}

212
static void add_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
213
{
214
	ops->next = *list;
215
	/*
216
	 * We are entering ops into the list but another
217 218
	 * CPU might be walking that list. We need to make sure
	 * the ops->next pointer is valid before another CPU sees
219
	 * the ops pointer included into the list.
220
	 */
221
	rcu_assign_pointer(*list, ops);
222 223
}

224
static int remove_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
225 226 227 228
{
	struct ftrace_ops **p;

	/*
229 230
	 * If we are removing the last function, then simply point
	 * to the ftrace_stub.
231
	 */
232 233
	if (*list == ops && ops->next == &ftrace_list_end) {
		*list = &ftrace_list_end;
S
Steven Rostedt 已提交
234
		return 0;
235 236
	}

237
	for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
238 239 240
		if (*p == ops)
			break;

S
Steven Rostedt 已提交
241 242
	if (*p != ops)
		return -1;
243 244

	*p = (*p)->next;
245 246
	return 0;
}
247

248 249 250 251 252 253 254 255
static int __register_ftrace_function(struct ftrace_ops *ops)
{
	if (ftrace_disabled)
		return -ENODEV;

	if (FTRACE_WARN_ON(ops == &global_ops))
		return -EINVAL;

256 257 258
	if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
		return -EBUSY;

259 260 261
	if (!core_kernel_data((unsigned long)ops))
		ops->flags |= FTRACE_OPS_FL_DYNAMIC;

262 263 264 265 266 267 268 269 270
	if (ops->flags & FTRACE_OPS_FL_GLOBAL) {
		int first = ftrace_global_list == &ftrace_list_end;
		add_ftrace_ops(&ftrace_global_list, ops);
		ops->flags |= FTRACE_OPS_FL_ENABLED;
		if (first)
			add_ftrace_ops(&ftrace_ops_list, &global_ops);
	} else
		add_ftrace_ops(&ftrace_ops_list, ops);

271 272 273 274 275 276 277 278 279 280 281 282 283
	if (ftrace_enabled)
		update_ftrace_function();

	return 0;
}

static int __unregister_ftrace_function(struct ftrace_ops *ops)
{
	int ret;

	if (ftrace_disabled)
		return -ENODEV;

284 285 286
	if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
		return -EBUSY;

287 288 289
	if (FTRACE_WARN_ON(ops == &global_ops))
		return -EINVAL;

290 291 292 293 294 295 296 297 298
	if (ops->flags & FTRACE_OPS_FL_GLOBAL) {
		ret = remove_ftrace_ops(&ftrace_global_list, ops);
		if (!ret && ftrace_global_list == &ftrace_list_end)
			ret = remove_ftrace_ops(&ftrace_ops_list, &global_ops);
		if (!ret)
			ops->flags &= ~FTRACE_OPS_FL_ENABLED;
	} else
		ret = remove_ftrace_ops(&ftrace_ops_list, ops);

299 300
	if (ret < 0)
		return ret;
301

302 303
	if (ftrace_enabled)
		update_ftrace_function();
304

305 306 307 308 309 310 311
	/*
	 * Dynamic ops may be freed, we must make sure that all
	 * callers are done before leaving this function.
	 */
	if (ops->flags & FTRACE_OPS_FL_DYNAMIC)
		synchronize_sched();

S
Steven Rostedt 已提交
312
	return 0;
313 314
}

315 316
static void ftrace_update_pid_func(void)
{
317
	/* Only do something if we are tracing something */
318
	if (ftrace_trace_function == ftrace_stub)
319
		return;
320

321
	update_ftrace_function();
322 323
}

324 325 326 327 328
#ifdef CONFIG_FUNCTION_PROFILER
struct ftrace_profile {
	struct hlist_node		node;
	unsigned long			ip;
	unsigned long			counter;
329 330
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
	unsigned long long		time;
331
	unsigned long long		time_squared;
332
#endif
333 334
};

335 336 337 338
struct ftrace_profile_page {
	struct ftrace_profile_page	*next;
	unsigned long			index;
	struct ftrace_profile		records[];
339 340
};

341 342 343 344 345 346 347 348
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;
};

349 350
#define PROFILE_RECORDS_SIZE						\
	(PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
351

352 353
#define PROFILES_PER_PAGE					\
	(PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
354

355 356 357 358
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 已提交
359 360
static DEFINE_MUTEX(ftrace_profile_lock);

361
static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
362 363 364

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

S
Steven Rostedt 已提交
365 366 367
static void *
function_stat_next(void *v, int idx)
{
368 369
	struct ftrace_profile *rec = v;
	struct ftrace_profile_page *pg;
S
Steven Rostedt 已提交
370

371
	pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
S
Steven Rostedt 已提交
372 373

 again:
L
Li Zefan 已提交
374 375 376
	if (idx != 0)
		rec++;

S
Steven Rostedt 已提交
377 378 379 380 381
	if ((void *)rec >= (void *)&pg->records[pg->index]) {
		pg = pg->next;
		if (!pg)
			return NULL;
		rec = &pg->records[0];
382 383
		if (!rec->counter)
			goto again;
S
Steven Rostedt 已提交
384 385 386 387 388 389 390
	}

	return rec;
}

static void *function_stat_start(struct tracer_stat *trace)
{
391 392 393 394 395 396 397
	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 已提交
398 399
}

400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415
#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 已提交
416 417
static int function_stat_cmp(void *p1, void *p2)
{
418 419
	struct ftrace_profile *a = p1;
	struct ftrace_profile *b = p2;
S
Steven Rostedt 已提交
420 421 422 423 424 425 426 427

	if (a->counter < b->counter)
		return -1;
	if (a->counter > b->counter)
		return 1;
	else
		return 0;
}
428
#endif
S
Steven Rostedt 已提交
429 430 431

static int function_stat_headers(struct seq_file *m)
{
432
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
433
	seq_printf(m, "  Function                               "
434
		   "Hit    Time            Avg             s^2\n"
435
		      "  --------                               "
436
		   "---    ----            ---             ---\n");
437
#else
S
Steven Rostedt 已提交
438 439
	seq_printf(m, "  Function                               Hit\n"
		      "  --------                               ---\n");
440
#endif
S
Steven Rostedt 已提交
441 442 443 444 445
	return 0;
}

static int function_stat_show(struct seq_file *m, void *v)
{
446
	struct ftrace_profile *rec = v;
S
Steven Rostedt 已提交
447
	char str[KSYM_SYMBOL_LEN];
448
	int ret = 0;
449
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
450 451
	static struct trace_seq s;
	unsigned long long avg;
452
	unsigned long long stddev;
453
#endif
454 455 456 457 458 459 460
	mutex_lock(&ftrace_profile_lock);

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

	kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
463 464 465 466
	seq_printf(m, "  %-30.30s  %10lu", str, rec->counter);

#ifdef CONFIG_FUNCTION_GRAPH_TRACER
	seq_printf(m, "    ");
467 468 469
	avg = rec->time;
	do_div(avg, rec->counter);

470 471 472 473 474 475 476 477 478 479 480 481
	/* 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);
	}

482 483 484 485
	trace_seq_init(&s);
	trace_print_graph_duration(rec->time, &s);
	trace_seq_puts(&s, "    ");
	trace_print_graph_duration(avg, &s);
486 487
	trace_seq_puts(&s, "    ");
	trace_print_graph_duration(stddev, &s);
488 489 490
	trace_print_seq(m, &s);
#endif
	seq_putc(m, '\n');
491 492
out:
	mutex_unlock(&ftrace_profile_lock);
S
Steven Rostedt 已提交
493

494
	return ret;
S
Steven Rostedt 已提交
495 496
}

497
static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
S
Steven Rostedt 已提交
498
{
499
	struct ftrace_profile_page *pg;
S
Steven Rostedt 已提交
500

501
	pg = stat->pages = stat->start;
S
Steven Rostedt 已提交
502

503 504 505 506
	while (pg) {
		memset(pg->records, 0, PROFILE_RECORDS_SIZE);
		pg->index = 0;
		pg = pg->next;
S
Steven Rostedt 已提交
507 508
	}

509
	memset(stat->hash, 0,
510 511
	       FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
}
S
Steven Rostedt 已提交
512

513
int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
514 515
{
	struct ftrace_profile_page *pg;
516 517
	int functions;
	int pages;
518
	int i;
S
Steven Rostedt 已提交
519

520
	/* If we already allocated, do nothing */
521
	if (stat->pages)
522
		return 0;
S
Steven Rostedt 已提交
523

524 525
	stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
	if (!stat->pages)
526
		return -ENOMEM;
S
Steven Rostedt 已提交
527

528 529 530 531 532 533 534 535 536 537 538 539 540
#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

541
	pg = stat->start = stat->pages;
S
Steven Rostedt 已提交
542

543 544 545
	pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);

	for (i = 0; i < pages; i++) {
546 547
		pg->next = (void *)get_zeroed_page(GFP_KERNEL);
		if (!pg->next)
548
			goto out_free;
549 550 551 552
		pg = pg->next;
	}

	return 0;
553 554 555 556 557 558 559 560 561 562 563 564 565 566 567

 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 已提交
568 569
}

570
static int ftrace_profile_init_cpu(int cpu)
S
Steven Rostedt 已提交
571
{
572
	struct ftrace_profile_stat *stat;
573
	int size;
S
Steven Rostedt 已提交
574

575 576 577
	stat = &per_cpu(ftrace_profile_stats, cpu);

	if (stat->hash) {
578
		/* If the profile is already created, simply reset it */
579
		ftrace_profile_reset(stat);
580 581
		return 0;
	}
S
Steven Rostedt 已提交
582

583 584 585 586 587
	/*
	 * 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 已提交
588

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

591
	if (!stat->hash)
592 593
		return -ENOMEM;

594 595
	if (!ftrace_profile_bits) {
		size--;
596

597 598 599
		for (; size; size >>= 1)
			ftrace_profile_bits++;
	}
600

601
	/* Preallocate the function profiling pages */
602 603 604
	if (ftrace_profile_pages_init(stat) < 0) {
		kfree(stat->hash);
		stat->hash = NULL;
605 606 607 608
		return -ENOMEM;
	}

	return 0;
S
Steven Rostedt 已提交
609 610
}

611 612 613 614 615 616 617 618 619 620 621 622 623 624
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;
}

625
/* interrupts must be disabled */
626 627
static struct ftrace_profile *
ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
S
Steven Rostedt 已提交
628
{
629
	struct ftrace_profile *rec;
S
Steven Rostedt 已提交
630 631 632 633 634
	struct hlist_head *hhd;
	struct hlist_node *n;
	unsigned long key;

	key = hash_long(ip, ftrace_profile_bits);
635
	hhd = &stat->hash[key];
S
Steven Rostedt 已提交
636 637 638 639 640 641

	if (hlist_empty(hhd))
		return NULL;

	hlist_for_each_entry_rcu(rec, n, hhd, node) {
		if (rec->ip == ip)
642 643 644 645 646 647
			return rec;
	}

	return NULL;
}

648 649
static void ftrace_add_profile(struct ftrace_profile_stat *stat,
			       struct ftrace_profile *rec)
650 651 652 653
{
	unsigned long key;

	key = hash_long(rec->ip, ftrace_profile_bits);
654
	hlist_add_head_rcu(&rec->node, &stat->hash[key]);
655 656
}

657 658 659
/*
 * The memory is already allocated, this simply finds a new record to use.
 */
660
static struct ftrace_profile *
661
ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
662 663 664
{
	struct ftrace_profile *rec = NULL;

665
	/* prevent recursion (from NMIs) */
666
	if (atomic_inc_return(&stat->disabled) != 1)
667 668 669
		goto out;

	/*
670 671
	 * Try to find the function again since an NMI
	 * could have added it
672
	 */
673
	rec = ftrace_find_profiled_func(stat, ip);
674
	if (rec)
675
		goto out;
676

677 678 679 680
	if (stat->pages->index == PROFILES_PER_PAGE) {
		if (!stat->pages->next)
			goto out;
		stat->pages = stat->pages->next;
S
Steven Rostedt 已提交
681
	}
682

683
	rec = &stat->pages->records[stat->pages->index++];
684
	rec->ip = ip;
685
	ftrace_add_profile(stat, rec);
686

S
Steven Rostedt 已提交
687
 out:
688
	atomic_dec(&stat->disabled);
S
Steven Rostedt 已提交
689 690 691 692 693 694 695

	return rec;
}

static void
function_profile_call(unsigned long ip, unsigned long parent_ip)
{
696
	struct ftrace_profile_stat *stat;
697
	struct ftrace_profile *rec;
S
Steven Rostedt 已提交
698 699 700 701 702 703
	unsigned long flags;

	if (!ftrace_profile_enabled)
		return;

	local_irq_save(flags);
704 705

	stat = &__get_cpu_var(ftrace_profile_stats);
706
	if (!stat->hash || !ftrace_profile_enabled)
707 708 709
		goto out;

	rec = ftrace_find_profiled_func(stat, ip);
710
	if (!rec) {
711
		rec = ftrace_profile_alloc(stat, ip);
712 713 714
		if (!rec)
			goto out;
	}
S
Steven Rostedt 已提交
715 716 717 718 719 720

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

721 722 723 724 725 726 727 728 729
#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)
{
730
	struct ftrace_profile_stat *stat;
731
	unsigned long long calltime;
732
	struct ftrace_profile *rec;
733
	unsigned long flags;
734 735

	local_irq_save(flags);
736
	stat = &__get_cpu_var(ftrace_profile_stats);
737
	if (!stat->hash || !ftrace_profile_enabled)
738 739
		goto out;

740 741 742 743
	/* If the calltime was zero'd ignore it */
	if (!trace->calltime)
		goto out;

744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760
	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;
	}

761
	rec = ftrace_find_profiled_func(stat, trace->func);
762
	if (rec) {
763
		rec->time += calltime;
764 765
		rec->time_squared += calltime * calltime;
	}
766

767
 out:
768 769 770 771 772 773 774 775 776 777 778 779 780 781
	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 已提交
782 783
static struct ftrace_ops ftrace_profile_ops __read_mostly =
{
784
	.func		= function_profile_call,
S
Steven Rostedt 已提交
785 786
};

787 788 789 790 791 792 793 794 795 796 797
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 已提交
798 799 800 801 802
static ssize_t
ftrace_profile_write(struct file *filp, const char __user *ubuf,
		     size_t cnt, loff_t *ppos)
{
	unsigned long val;
803
	char buf[64];		/* big enough to hold a number */
S
Steven Rostedt 已提交
804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822
	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) {
823 824 825 826 827 828
			ret = ftrace_profile_init();
			if (ret < 0) {
				cnt = ret;
				goto out;
			}

829 830 831 832 833
			ret = register_ftrace_profiler();
			if (ret < 0) {
				cnt = ret;
				goto out;
			}
S
Steven Rostedt 已提交
834 835 836
			ftrace_profile_enabled = 1;
		} else {
			ftrace_profile_enabled = 0;
837 838 839 840
			/*
			 * unregister_ftrace_profiler calls stop_machine
			 * so this acts like an synchronize_sched.
			 */
841
			unregister_ftrace_profiler();
S
Steven Rostedt 已提交
842 843
		}
	}
844
 out:
S
Steven Rostedt 已提交
845 846
	mutex_unlock(&ftrace_profile_lock);

847
	*ppos += cnt;
S
Steven Rostedt 已提交
848 849 850 851

	return cnt;
}

852 853 854 855
static ssize_t
ftrace_profile_read(struct file *filp, char __user *ubuf,
		     size_t cnt, loff_t *ppos)
{
856
	char buf[64];		/* big enough to hold a number */
857 858 859 860 861 862
	int r;

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

S
Steven Rostedt 已提交
863 864 865 866
static const struct file_operations ftrace_profile_fops = {
	.open		= tracing_open_generic,
	.read		= ftrace_profile_read,
	.write		= ftrace_profile_write,
867
	.llseek		= default_llseek,
S
Steven Rostedt 已提交
868 869
};

870 871
/* used to initialize the real stat files */
static struct tracer_stat function_stats __initdata = {
872 873 874 875 876 877
	.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
878 879
};

880
static __init void ftrace_profile_debugfs(struct dentry *d_tracer)
S
Steven Rostedt 已提交
881
{
882
	struct ftrace_profile_stat *stat;
S
Steven Rostedt 已提交
883
	struct dentry *entry;
884
	char *name;
S
Steven Rostedt 已提交
885
	int ret;
886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913
	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 已提交
914 915 916 917 918 919 920 921 922 923
	}

	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 */
924
static __init void ftrace_profile_debugfs(struct dentry *d_tracer)
S
Steven Rostedt 已提交
925 926 927 928
{
}
#endif /* CONFIG_FUNCTION_PROFILER */

929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951
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),
952 953
	FTRACE_START_FUNC_RET		= (1 << 3),
	FTRACE_STOP_FUNC_RET		= (1 << 4),
954
};
955 956 957 958 959 960 961 962 963
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;
964
	struct rcu_head		rcu;
965 966
};

967 968 969 970 971 972 973 974 975
/*
 * We make these constant because no one should touch them,
 * but they are used as the default "empty hash", to avoid allocating
 * it all the time. These are in a read only section such that if
 * anyone does try to modify it, it will cause an exception.
 */
static const struct hlist_head empty_buckets[1];
static const struct ftrace_hash empty_hash = {
	.buckets = (struct hlist_head *)empty_buckets,
976
};
977
#define EMPTY_HASH	((struct ftrace_hash *)&empty_hash)
978

979
static struct ftrace_ops global_ops = {
980
	.func			= ftrace_stub,
981 982
	.notrace_hash		= EMPTY_HASH,
	.filter_hash		= EMPTY_HASH,
983 984
};

985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005
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;

1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030
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;
}

1031 1032
static void __add_hash_entry(struct ftrace_hash *hash,
			     struct ftrace_func_entry *entry)
1033 1034 1035 1036 1037
{
	struct hlist_head *hhd;
	unsigned long key;

	if (hash->size_bits)
1038
		key = hash_long(entry->ip, hash->size_bits);
1039 1040 1041 1042 1043 1044
	else
		key = 0;

	hhd = &hash->buckets[key];
	hlist_add_head(&entry->hlist, hhd);
	hash->count++;
1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
}

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

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

	entry->ip = ip;
	__add_hash_entry(hash, entry);
1057 1058 1059 1060 1061

	return 0;
}

static void
1062
free_hash_entry(struct ftrace_hash *hash,
1063 1064 1065 1066 1067 1068 1069
		  struct ftrace_func_entry *entry)
{
	hlist_del(&entry->hlist);
	kfree(entry);
	hash->count--;
}

1070 1071 1072 1073 1074 1075 1076 1077
static void
remove_hash_entry(struct ftrace_hash *hash,
		  struct ftrace_func_entry *entry)
{
	hlist_del(&entry->hlist);
	hash->count--;
}

1078 1079 1080 1081 1082 1083 1084 1085
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;

1086 1087 1088
	if (!hash->count)
		return;

1089 1090 1091
	for (i = 0; i < size; i++) {
		hhd = &hash->buckets[i];
		hlist_for_each_entry_safe(entry, tp, tn, hhd, hlist)
1092
			free_hash_entry(hash, entry);
1093 1094 1095 1096
	}
	FTRACE_WARN_ON(hash->count);
}

1097 1098 1099 1100 1101 1102 1103 1104 1105
static void free_ftrace_hash(struct ftrace_hash *hash)
{
	if (!hash || hash == EMPTY_HASH)
		return;
	ftrace_hash_clear(hash);
	kfree(hash->buckets);
	kfree(hash);
}

1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120
static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
{
	struct ftrace_hash *hash;

	hash = container_of(rcu, struct ftrace_hash, rcu);
	free_ftrace_hash(hash);
}

static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
{
	if (!hash || hash == EMPTY_HASH)
		return;
	call_rcu_sched(&hash->rcu, __free_ftrace_hash_rcu);
}

1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
{
	struct ftrace_hash *hash;
	int size;

	hash = kzalloc(sizeof(*hash), GFP_KERNEL);
	if (!hash)
		return NULL;

	size = 1 << size_bits;
	hash->buckets = kzalloc(sizeof(*hash->buckets) * size, GFP_KERNEL);

	if (!hash->buckets) {
		kfree(hash);
		return NULL;
	}

	hash->size_bits = size_bits;

	return hash;
}

static struct ftrace_hash *
alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
{
	struct ftrace_func_entry *entry;
	struct ftrace_hash *new_hash;
	struct hlist_node *tp;
	int size;
	int ret;
	int i;

	new_hash = alloc_ftrace_hash(size_bits);
	if (!new_hash)
		return NULL;

	/* Empty hash? */
	if (!hash || !hash->count)
		return new_hash;

	size = 1 << hash->size_bits;
	for (i = 0; i < size; i++) {
		hlist_for_each_entry(entry, tp, &hash->buckets[i], hlist) {
			ret = add_hash_entry(new_hash, entry->ip);
			if (ret < 0)
				goto free_hash;
		}
	}

	FTRACE_WARN_ON(new_hash->count != hash->count);

	return new_hash;

 free_hash:
	free_ftrace_hash(new_hash);
	return NULL;
}

static int
ftrace_hash_move(struct ftrace_hash **dst, struct ftrace_hash *src)
{
	struct ftrace_func_entry *entry;
	struct hlist_node *tp, *tn;
	struct hlist_head *hhd;
1185 1186
	struct ftrace_hash *old_hash;
	struct ftrace_hash *new_hash;
1187 1188 1189 1190 1191 1192 1193 1194 1195 1196
	unsigned long key;
	int size = src->count;
	int bits = 0;
	int i;

	/*
	 * If the new source is empty, just free dst and assign it
	 * the empty_hash.
	 */
	if (!src->count) {
1197 1198
		free_ftrace_hash_rcu(*dst);
		rcu_assign_pointer(*dst, EMPTY_HASH);
1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211
		return 0;
	}

	/*
	 * Make the hash size about 1/2 the # found
	 */
	for (size /= 2; size; size >>= 1)
		bits++;

	/* Don't allocate too much */
	if (bits > FTRACE_HASH_MAX_BITS)
		bits = FTRACE_HASH_MAX_BITS;

1212 1213 1214
	new_hash = alloc_ftrace_hash(bits);
	if (!new_hash)
		return -ENOMEM;
1215 1216 1217 1218 1219 1220 1221 1222 1223 1224

	size = 1 << src->size_bits;
	for (i = 0; i < size; i++) {
		hhd = &src->buckets[i];
		hlist_for_each_entry_safe(entry, tp, tn, hhd, hlist) {
			if (bits > 0)
				key = hash_long(entry->ip, bits);
			else
				key = 0;
			remove_hash_entry(src, entry);
1225
			__add_hash_entry(new_hash, entry);
1226 1227 1228
		}
	}

1229 1230 1231 1232
	old_hash = *dst;
	rcu_assign_pointer(*dst, new_hash);
	free_ftrace_hash_rcu(old_hash);

1233 1234 1235
	return 0;
}

1236 1237 1238 1239 1240 1241 1242 1243
/*
 * Test the hashes for this ops to see if we want to call
 * the ops->func or not.
 *
 * It's a match if the ip is in the ops->filter_hash or
 * the filter_hash does not exist or is empty,
 *  AND
 * the ip is not in the ops->notrace_hash.
1244 1245 1246
 *
 * This needs to be called with preemption disabled as
 * the hashes are freed with call_rcu_sched().
1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268
 */
static int
ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip)
{
	struct ftrace_hash *filter_hash;
	struct ftrace_hash *notrace_hash;
	int ret;

	filter_hash = rcu_dereference_raw(ops->filter_hash);
	notrace_hash = rcu_dereference_raw(ops->notrace_hash);

	if ((!filter_hash || !filter_hash->count ||
	     ftrace_lookup_ip(filter_hash, ip)) &&
	    (!notrace_hash || !notrace_hash->count ||
	     !ftrace_lookup_ip(notrace_hash, ip)))
		ret = 1;
	else
		ret = 0;

	return ret;
}

1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282
/*
 * 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()		\
		}				\
	}

1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311
static void __ftrace_hash_rec_update(struct ftrace_ops *ops,
				     int filter_hash,
				     bool inc)
{
	struct ftrace_hash *hash;
	struct ftrace_hash *other_hash;
	struct ftrace_page *pg;
	struct dyn_ftrace *rec;
	int count = 0;
	int all = 0;

	/* Only update if the ops has been registered */
	if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
		return;

	/*
	 * In the filter_hash case:
	 *   If the count is zero, we update all records.
	 *   Otherwise we just update the items in the hash.
	 *
	 * In the notrace_hash case:
	 *   We enable the update in the hash.
	 *   As disabling notrace means enabling the tracing,
	 *   and enabling notrace means disabling, the inc variable
	 *   gets inversed.
	 */
	if (filter_hash) {
		hash = ops->filter_hash;
		other_hash = ops->notrace_hash;
1312
		if (!hash || !hash->count)
1313 1314 1315 1316 1317 1318 1319 1320 1321
			all = 1;
	} else {
		inc = !inc;
		hash = ops->notrace_hash;
		other_hash = ops->filter_hash;
		/*
		 * If the notrace hash has no items,
		 * then there's nothing to do.
		 */
1322
		if (hash && !hash->count)
1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335
			return;
	}

	do_for_each_ftrace_rec(pg, rec) {
		int in_other_hash = 0;
		int in_hash = 0;
		int match = 0;

		if (all) {
			/*
			 * Only the filter_hash affects all records.
			 * Update if the record is not in the notrace hash.
			 */
1336
			if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1337 1338
				match = 1;
		} else {
1339 1340
			in_hash = hash && !!ftrace_lookup_ip(hash, rec->ip);
			in_other_hash = other_hash && !!ftrace_lookup_ip(other_hash, rec->ip);
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381

			/*
			 *
			 */
			if (filter_hash && in_hash && !in_other_hash)
				match = 1;
			else if (!filter_hash && in_hash &&
				 (in_other_hash || !other_hash->count))
				match = 1;
		}
		if (!match)
			continue;

		if (inc) {
			rec->flags++;
			if (FTRACE_WARN_ON((rec->flags & ~FTRACE_FL_MASK) == FTRACE_REF_MAX))
				return;
		} else {
			if (FTRACE_WARN_ON((rec->flags & ~FTRACE_FL_MASK) == 0))
				return;
			rec->flags--;
		}
		count++;
		/* Shortcut, if we handled all records, we are done. */
		if (!all && count == hash->count)
			return;
	} while_for_each_ftrace_rec();
}

static void ftrace_hash_rec_disable(struct ftrace_ops *ops,
				    int filter_hash)
{
	__ftrace_hash_rec_update(ops, filter_hash, 0);
}

static void ftrace_hash_rec_enable(struct ftrace_ops *ops,
				   int filter_hash)
{
	__ftrace_hash_rec_update(ops, filter_hash, 1);
}

I
Ingo Molnar 已提交
1382
static void ftrace_free_rec(struct dyn_ftrace *rec)
1383
{
1384
	rec->freelist = ftrace_free_records;
1385 1386 1387 1388
	ftrace_free_records = rec;
	rec->flags |= FTRACE_FL_FREE;
}

I
Ingo Molnar 已提交
1389
static struct dyn_ftrace *ftrace_alloc_dyn_node(unsigned long ip)
1390
{
1391 1392 1393 1394 1395 1396 1397
	struct dyn_ftrace *rec;

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

		if (unlikely(!(rec->flags & FTRACE_FL_FREE))) {
1398
			FTRACE_WARN_ON_ONCE(1);
1399 1400 1401 1402
			ftrace_free_records = NULL;
			return NULL;
		}

1403
		ftrace_free_records = rec->freelist;
1404 1405 1406 1407
		memset(rec, 0, sizeof(*rec));
		return rec;
	}

1408
	if (ftrace_pages->index == ENTRIES_PER_PAGE) {
S
Steven Rostedt 已提交
1409 1410 1411 1412 1413 1414 1415
		if (!ftrace_pages->next) {
			/* allocate another page */
			ftrace_pages->next =
				(void *)get_zeroed_page(GFP_KERNEL);
			if (!ftrace_pages->next)
				return NULL;
		}
1416 1417 1418 1419 1420 1421
		ftrace_pages = ftrace_pages->next;
	}

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

S
Steven Rostedt 已提交
1422
static struct dyn_ftrace *
1423
ftrace_record_ip(unsigned long ip)
1424
{
S
Steven Rostedt 已提交
1425
	struct dyn_ftrace *rec;
1426

1427
	if (ftrace_disabled)
S
Steven Rostedt 已提交
1428
		return NULL;
1429

S
Steven Rostedt 已提交
1430 1431 1432
	rec = ftrace_alloc_dyn_node(ip);
	if (!rec)
		return NULL;
1433

S
Steven Rostedt 已提交
1434
	rec->ip = ip;
1435
	rec->newlist = ftrace_new_addrs;
1436
	ftrace_new_addrs = rec;
1437

S
Steven Rostedt 已提交
1438
	return rec;
1439 1440
}

1441 1442 1443 1444 1445 1446 1447 1448 1449 1450
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]);
}

1451
static void ftrace_bug(int failed, unsigned long ip)
1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477
{
	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);
	}
}

1478

1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493
/* 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;
}


1494
static int
1495
__ftrace_replace_code(struct dyn_ftrace *rec, int enable)
1496
{
1497
	unsigned long ftrace_addr;
1498
	unsigned long flag = 0UL;
1499

1500
	ftrace_addr = (unsigned long)FTRACE_ADDR;
1501

S
Steven Rostedt 已提交
1502
	/*
1503
	 * If we are enabling tracing:
S
Steven Rostedt 已提交
1504
	 *
1505 1506
	 *   If the record has a ref count, then we need to enable it
	 *   because someone is using it.
S
Steven Rostedt 已提交
1507
	 *
1508 1509 1510 1511
	 *   Otherwise we make sure its disabled.
	 *
	 * If we are disabling tracing, then disable all records that
	 * are enabled.
S
Steven Rostedt 已提交
1512
	 */
1513 1514
	if (enable && (rec->flags & ~FTRACE_FL_MASK))
		flag = FTRACE_FL_ENABLED;
S
Steven Rostedt 已提交
1515

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

1520 1521 1522
	if (flag) {
		rec->flags |= FTRACE_FL_ENABLED;
		return ftrace_make_call(rec, ftrace_addr);
1523 1524
	}

1525 1526
	rec->flags &= ~FTRACE_FL_ENABLED;
	return ftrace_make_nop(NULL, rec, ftrace_addr);
1527 1528
}

I
Ingo Molnar 已提交
1529
static void ftrace_replace_code(int enable)
1530 1531 1532
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;
S
Steven Rostedt 已提交
1533
	int failed;
1534

1535 1536 1537
	if (unlikely(ftrace_disabled))
		return;

1538
	do_for_each_ftrace_rec(pg, rec) {
1539 1540
		/* Skip over free records */
		if (rec->flags & FTRACE_FL_FREE)
1541 1542 1543
			continue;

		failed = __ftrace_replace_code(rec, enable);
1544
		if (failed) {
1545 1546 1547
			ftrace_bug(failed, rec->ip);
			/* Stop processing */
			return;
1548
		}
1549
	} while_for_each_ftrace_rec();
1550 1551
}

1552
static int
1553
ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
1554 1555
{
	unsigned long ip;
1556
	int ret;
1557 1558 1559

	ip = rec->ip;

1560 1561 1562
	if (unlikely(ftrace_disabled))
		return 0;

1563
	ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
1564
	if (ret) {
1565
		ftrace_bug(ret, ip);
1566
		return 0;
1567
	}
1568
	return 1;
1569 1570
}

1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588
/*
 * 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 已提交
1589
static int __ftrace_modify_code(void *data)
1590
{
1591 1592
	int *command = data;

1593
	if (*command & FTRACE_ENABLE_CALLS)
1594
		ftrace_replace_code(1);
1595
	else if (*command & FTRACE_DISABLE_CALLS)
1596 1597 1598 1599 1600
		ftrace_replace_code(0);

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

1601 1602 1603 1604 1605
	if (*command & FTRACE_START_FUNC_RET)
		ftrace_enable_ftrace_graph_caller();
	else if (*command & FTRACE_STOP_FUNC_RET)
		ftrace_disable_ftrace_graph_caller();

1606
	return 0;
1607 1608
}

I
Ingo Molnar 已提交
1609
static void ftrace_run_update_code(int command)
1610
{
1611 1612 1613 1614 1615 1616 1617
	int ret;

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

R
Rusty Russell 已提交
1618
	stop_machine(__ftrace_modify_code, &command, NULL);
1619 1620 1621

	ret = ftrace_arch_code_modify_post_process();
	FTRACE_WARN_ON(ret);
1622 1623
}

1624
static ftrace_func_t saved_ftrace_func;
1625
static int ftrace_start_up;
1626
static int global_start_up;
1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639

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);
}
1640

1641
static void ftrace_startup(struct ftrace_ops *ops, int command)
1642
{
1643 1644
	bool hash_enable = true;

1645 1646 1647
	if (unlikely(ftrace_disabled))
		return;

1648
	ftrace_start_up++;
S
Steven Rostedt 已提交
1649
	command |= FTRACE_ENABLE_CALLS;
1650

1651 1652 1653 1654 1655 1656 1657 1658 1659
	/* ops marked global share the filter hashes */
	if (ops->flags & FTRACE_OPS_FL_GLOBAL) {
		ops = &global_ops;
		/* Don't update hash if global is already set */
		if (global_start_up)
			hash_enable = false;
		global_start_up++;
	}

1660
	ops->flags |= FTRACE_OPS_FL_ENABLED;
1661
	if (hash_enable)
1662 1663
		ftrace_hash_rec_enable(ops, 1);

1664
	ftrace_startup_enable(command);
1665 1666
}

1667
static void ftrace_shutdown(struct ftrace_ops *ops, int command)
1668
{
1669 1670
	bool hash_disable = true;

1671 1672 1673
	if (unlikely(ftrace_disabled))
		return;

1674
	ftrace_start_up--;
1675 1676 1677 1678 1679 1680 1681
	/*
	 * 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);

1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693
	if (ops->flags & FTRACE_OPS_FL_GLOBAL) {
		ops = &global_ops;
		global_start_up--;
		WARN_ON_ONCE(global_start_up < 0);
		/* Don't update hash if global still has users */
		if (global_start_up) {
			WARN_ON_ONCE(!ftrace_start_up);
			hash_disable = false;
		}
	}

	if (hash_disable)
1694 1695
		ftrace_hash_rec_disable(ops, 1);

1696
	if (ops != &global_ops || !global_start_up)
1697
		ops->flags &= ~FTRACE_OPS_FL_ENABLED;
1698 1699 1700

	if (!ftrace_start_up)
		command |= FTRACE_DISABLE_CALLS;
1701

1702 1703 1704 1705
	if (saved_ftrace_func != ftrace_trace_function) {
		saved_ftrace_func = ftrace_trace_function;
		command |= FTRACE_UPDATE_TRACE_FUNC;
	}
1706

1707
	if (!command || !ftrace_enabled)
S
Steven Rostedt 已提交
1708
		return;
1709 1710

	ftrace_run_update_code(command);
1711 1712
}

I
Ingo Molnar 已提交
1713
static void ftrace_startup_sysctl(void)
1714
{
1715 1716 1717
	if (unlikely(ftrace_disabled))
		return;

1718 1719
	/* Force update next time */
	saved_ftrace_func = NULL;
1720 1721
	/* ftrace_start_up is true if we want ftrace running */
	if (ftrace_start_up)
1722
		ftrace_run_update_code(FTRACE_ENABLE_CALLS);
1723 1724
}

I
Ingo Molnar 已提交
1725
static void ftrace_shutdown_sysctl(void)
1726
{
1727 1728 1729
	if (unlikely(ftrace_disabled))
		return;

1730 1731
	/* ftrace_start_up is true if ftrace is running */
	if (ftrace_start_up)
1732
		ftrace_run_update_code(FTRACE_DISABLE_CALLS);
1733 1734
}

1735 1736 1737 1738
static cycle_t		ftrace_update_time;
static unsigned long	ftrace_update_cnt;
unsigned long		ftrace_update_tot_cnt;

1739
static int ftrace_update_code(struct module *mod)
1740
{
1741
	struct dyn_ftrace *p;
1742
	cycle_t start, stop;
1743

I
Ingo Molnar 已提交
1744
	start = ftrace_now(raw_smp_processor_id());
1745 1746
	ftrace_update_cnt = 0;

1747
	while (ftrace_new_addrs) {
1748

S
Steven Rostedt 已提交
1749 1750 1751
		/* If something went wrong, bail without enabling anything */
		if (unlikely(ftrace_disabled))
			return -1;
1752

1753
		p = ftrace_new_addrs;
1754
		ftrace_new_addrs = p->newlist;
1755
		p->flags = 0L;
1756

1757
		/*
L
Lucas De Marchi 已提交
1758
		 * Do the initial record conversion from mcount jump
1759 1760 1761
		 * to the NOP instructions.
		 */
		if (!ftrace_code_disable(mod, p)) {
S
Steven Rostedt 已提交
1762
			ftrace_free_rec(p);
1763 1764
			/* Game over */
			break;
1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784
		}

		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);
			}
		}
1785 1786
	}

I
Ingo Molnar 已提交
1787
	stop = ftrace_now(raw_smp_processor_id());
1788 1789 1790
	ftrace_update_time = stop - start;
	ftrace_update_tot_cnt += ftrace_update_cnt;

1791 1792 1793
	return 0;
}

1794
static int __init ftrace_dyn_table_alloc(unsigned long num_to_init)
1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820
{
	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;

1821
	cnt = num_to_init / ENTRIES_PER_PAGE;
S
Steven Rostedt 已提交
1822
	pr_info("ftrace: allocating %ld entries in %d pages\n",
1823
		num_to_init, cnt + 1);
1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837

	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;
}

1838 1839
enum {
	FTRACE_ITER_FILTER	= (1 << 0),
1840
	FTRACE_ITER_NOTRACE	= (1 << 1),
S
Steven Rostedt 已提交
1841 1842
	FTRACE_ITER_PRINTALL	= (1 << 2),
	FTRACE_ITER_HASH	= (1 << 3),
1843
	FTRACE_ITER_ENABLED	= (1 << 4),
1844 1845 1846 1847 1848
};

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

struct ftrace_iterator {
1849
	loff_t				pos;
1850 1851 1852 1853 1854
	loff_t				func_pos;
	struct ftrace_page		*pg;
	struct dyn_ftrace		*func;
	struct ftrace_func_probe	*probe;
	struct trace_parser		parser;
1855
	struct ftrace_hash		*hash;
1856
	struct ftrace_ops		*ops;
1857 1858 1859
	int				hidx;
	int				idx;
	unsigned			flags;
1860 1861
};

1862
static void *
1863
t_hash_next(struct seq_file *m, loff_t *pos)
1864 1865
{
	struct ftrace_iterator *iter = m->private;
1866
	struct hlist_node *hnd = NULL;
1867 1868 1869
	struct hlist_head *hhd;

	(*pos)++;
1870
	iter->pos = *pos;
1871

1872 1873
	if (iter->probe)
		hnd = &iter->probe->node;
1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895
 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;
		}
	}

1896 1897 1898 1899 1900 1901
	if (WARN_ON_ONCE(!hnd))
		return NULL;

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

	return iter;
1902 1903 1904 1905 1906 1907
}

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

1910 1911
	if (iter->func_pos > *pos)
		return NULL;
1912

L
Li Zefan 已提交
1913
	iter->hidx = 0;
1914
	for (l = 0; l <= (*pos - iter->func_pos); ) {
1915
		p = t_hash_next(m, &l);
L
Li Zefan 已提交
1916 1917 1918
		if (!p)
			break;
	}
1919 1920 1921
	if (!p)
		return NULL;

1922 1923 1924
	/* Only set this if we have an item */
	iter->flags |= FTRACE_ITER_HASH;

1925
	return iter;
1926 1927
}

1928 1929
static int
t_hash_show(struct seq_file *m, struct ftrace_iterator *iter)
1930
{
S
Steven Rostedt 已提交
1931
	struct ftrace_func_probe *rec;
1932

1933 1934 1935
	rec = iter->probe;
	if (WARN_ON_ONCE(!rec))
		return -EIO;
1936

1937 1938 1939
	if (rec->ops->print)
		return rec->ops->print(m, rec->ip, rec->ops, rec->data);

1940
	seq_printf(m, "%ps:%ps", (void *)rec->ip, (void *)rec->ops->func);
1941 1942 1943 1944 1945 1946 1947 1948

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

	return 0;
}

I
Ingo Molnar 已提交
1949
static void *
1950 1951 1952
t_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct ftrace_iterator *iter = m->private;
1953
	struct ftrace_ops *ops = &global_ops;
1954 1955
	struct dyn_ftrace *rec = NULL;

1956 1957 1958
	if (unlikely(ftrace_disabled))
		return NULL;

1959
	if (iter->flags & FTRACE_ITER_HASH)
1960
		return t_hash_next(m, pos);
1961

1962
	(*pos)++;
1963
	iter->pos = iter->func_pos = *pos;
1964

1965
	if (iter->flags & FTRACE_ITER_PRINTALL)
1966
		return t_hash_start(m, pos);
1967

1968 1969 1970 1971 1972 1973 1974 1975 1976
 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++];
1977 1978
		if ((rec->flags & FTRACE_FL_FREE) ||

S
Steven Rostedt 已提交
1979
		    ((iter->flags & FTRACE_ITER_FILTER) &&
1980
		     !(ftrace_lookup_ip(ops->filter_hash, rec->ip))) ||
S
Steven Rostedt 已提交
1981

1982
		    ((iter->flags & FTRACE_ITER_NOTRACE) &&
1983 1984 1985 1986 1987
		     !ftrace_lookup_ip(ops->notrace_hash, rec->ip)) ||

		    ((iter->flags & FTRACE_ITER_ENABLED) &&
		     !(rec->flags & ~FTRACE_FL_MASK))) {

1988 1989 1990 1991 1992
			rec = NULL;
			goto retry;
		}
	}

1993
	if (!rec)
1994
		return t_hash_start(m, pos);
1995 1996 1997 1998

	iter->func = rec;

	return iter;
1999 2000
}

2001 2002 2003 2004 2005
static void reset_iter_read(struct ftrace_iterator *iter)
{
	iter->pos = 0;
	iter->func_pos = 0;
	iter->flags &= ~(FTRACE_ITER_PRINTALL & FTRACE_ITER_HASH);
2006 2007 2008 2009 2010
}

static void *t_start(struct seq_file *m, loff_t *pos)
{
	struct ftrace_iterator *iter = m->private;
2011
	struct ftrace_ops *ops = &global_ops;
2012
	void *p = NULL;
2013
	loff_t l;
2014

2015
	mutex_lock(&ftrace_lock);
2016 2017 2018 2019

	if (unlikely(ftrace_disabled))
		return NULL;

2020 2021 2022 2023 2024 2025
	/*
	 * If an lseek was done, then reset and start from beginning.
	 */
	if (*pos < iter->pos)
		reset_iter_read(iter);

2026 2027 2028 2029 2030
	/*
	 * For set_ftrace_filter reading, if we have the filter
	 * off, we can short cut and just print out that all
	 * functions are enabled.
	 */
2031
	if (iter->flags & FTRACE_ITER_FILTER && !ops->filter_hash->count) {
2032
		if (*pos > 0)
2033
			return t_hash_start(m, pos);
2034
		iter->flags |= FTRACE_ITER_PRINTALL;
2035 2036
		/* reset in case of seek/pread */
		iter->flags &= ~FTRACE_ITER_HASH;
2037 2038 2039
		return iter;
	}

2040 2041 2042
	if (iter->flags & FTRACE_ITER_HASH)
		return t_hash_start(m, pos);

2043 2044 2045 2046 2047
	/*
	 * 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.
	 */
2048 2049 2050 2051 2052 2053
	iter->pg = ftrace_pages_start;
	iter->idx = 0;
	for (l = 0; l <= *pos; ) {
		p = t_next(m, p, &l);
		if (!p)
			break;
2054
	}
2055

2056 2057 2058
	if (!p) {
		if (iter->flags & FTRACE_ITER_FILTER)
			return t_hash_start(m, pos);
2059

2060 2061 2062 2063
		return NULL;
	}

	return iter;
2064 2065 2066 2067
}

static void t_stop(struct seq_file *m, void *p)
{
2068
	mutex_unlock(&ftrace_lock);
2069 2070 2071 2072
}

static int t_show(struct seq_file *m, void *v)
{
2073
	struct ftrace_iterator *iter = m->private;
2074
	struct dyn_ftrace *rec;
2075

2076
	if (iter->flags & FTRACE_ITER_HASH)
2077
		return t_hash_show(m, iter);
2078

2079 2080 2081 2082 2083
	if (iter->flags & FTRACE_ITER_PRINTALL) {
		seq_printf(m, "#### all functions enabled ####\n");
		return 0;
	}

2084 2085
	rec = iter->func;

2086 2087 2088
	if (!rec)
		return 0;

2089 2090 2091 2092 2093
	seq_printf(m, "%ps", (void *)rec->ip);
	if (iter->flags & FTRACE_ITER_ENABLED)
		seq_printf(m, " (%ld)",
			   rec->flags & ~FTRACE_FL_MASK);
	seq_printf(m, "\n");
2094 2095 2096 2097

	return 0;
}

J
James Morris 已提交
2098
static const struct seq_operations show_ftrace_seq_ops = {
2099 2100 2101 2102 2103 2104
	.start = t_start,
	.next = t_next,
	.stop = t_stop,
	.show = t_show,
};

I
Ingo Molnar 已提交
2105
static int
2106 2107 2108 2109 2110
ftrace_avail_open(struct inode *inode, struct file *file)
{
	struct ftrace_iterator *iter;
	int ret;

2111 2112 2113
	if (unlikely(ftrace_disabled))
		return -ENODEV;

2114 2115 2116 2117 2118 2119 2120 2121 2122
	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 已提交
2123

2124
		m->private = iter;
I
Ingo Molnar 已提交
2125
	} else {
2126
		kfree(iter);
I
Ingo Molnar 已提交
2127
	}
2128 2129 2130 2131

	return ret;
}

2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159
static int
ftrace_enabled_open(struct inode *inode, struct file *file)
{
	struct ftrace_iterator *iter;
	int ret;

	if (unlikely(ftrace_disabled))
		return -ENODEV;

	iter = kzalloc(sizeof(*iter), GFP_KERNEL);
	if (!iter)
		return -ENOMEM;

	iter->pg = ftrace_pages_start;
	iter->flags = FTRACE_ITER_ENABLED;

	ret = seq_open(file, &show_ftrace_seq_ops);
	if (!ret) {
		struct seq_file *m = file->private_data;

		m->private = iter;
	} else {
		kfree(iter);
	}

	return ret;
}

2160
static void ftrace_filter_reset(struct ftrace_hash *hash)
2161
{
2162
	mutex_lock(&ftrace_lock);
2163
	ftrace_hash_clear(hash);
2164
	mutex_unlock(&ftrace_lock);
2165 2166
}

I
Ingo Molnar 已提交
2167
static int
2168
ftrace_regex_open(struct ftrace_ops *ops, int flag,
2169
		  struct inode *inode, struct file *file)
2170 2171
{
	struct ftrace_iterator *iter;
2172
	struct ftrace_hash *hash;
2173 2174
	int ret = 0;

2175 2176 2177
	if (unlikely(ftrace_disabled))
		return -ENODEV;

2178 2179 2180 2181
	iter = kzalloc(sizeof(*iter), GFP_KERNEL);
	if (!iter)
		return -ENOMEM;

2182 2183 2184 2185 2186
	if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
		kfree(iter);
		return -ENOMEM;
	}

2187 2188 2189 2190 2191
	if (flag & FTRACE_ITER_NOTRACE)
		hash = ops->notrace_hash;
	else
		hash = ops->filter_hash;

2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205
	iter->ops = ops;
	iter->flags = flag;

	if (file->f_mode & FMODE_WRITE) {
		mutex_lock(&ftrace_lock);
		iter->hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, hash);
		mutex_unlock(&ftrace_lock);

		if (!iter->hash) {
			trace_parser_put(&iter->parser);
			kfree(iter);
			return -ENOMEM;
		}
	}
2206

2207
	mutex_lock(&ftrace_regex_lock);
2208

2209
	if ((file->f_mode & FMODE_WRITE) &&
2210
	    (file->f_flags & O_TRUNC))
2211
		ftrace_filter_reset(iter->hash);
2212 2213 2214 2215 2216 2217 2218 2219

	if (file->f_mode & FMODE_READ) {
		iter->pg = ftrace_pages_start;

		ret = seq_open(file, &show_ftrace_seq_ops);
		if (!ret) {
			struct seq_file *m = file->private_data;
			m->private = iter;
2220
		} else {
2221 2222
			/* Failed */
			free_ftrace_hash(iter->hash);
2223
			trace_parser_put(&iter->parser);
2224
			kfree(iter);
2225
		}
2226 2227
	} else
		file->private_data = iter;
2228
	mutex_unlock(&ftrace_regex_lock);
2229 2230 2231 2232

	return ret;
}

2233 2234 2235
static int
ftrace_filter_open(struct inode *inode, struct file *file)
{
2236
	return ftrace_regex_open(&global_ops, FTRACE_ITER_FILTER,
2237
				 inode, file);
2238 2239 2240 2241 2242
}

static int
ftrace_notrace_open(struct inode *inode, struct file *file)
{
2243
	return ftrace_regex_open(&global_ops, FTRACE_ITER_NOTRACE,
2244
				 inode, file);
2245 2246
}

I
Ingo Molnar 已提交
2247
static loff_t
2248
ftrace_regex_lseek(struct file *file, loff_t offset, int origin)
2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259
{
	loff_t ret;

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

	return ret;
}

2260
static int ftrace_match(char *str, char *regex, int len, int type)
2261 2262
{
	int matched = 0;
2263
	int slen;
2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278

	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:
2279 2280
		slen = strlen(str);
		if (slen >= len && memcmp(str + slen - len, regex, len) == 0)
2281 2282 2283 2284 2285 2286 2287
			matched = 1;
		break;
	}

	return matched;
}

2288
static int
2289
enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int not)
2290
{
2291 2292 2293
	struct ftrace_func_entry *entry;
	int ret = 0;

2294 2295 2296 2297 2298
	entry = ftrace_lookup_ip(hash, rec->ip);
	if (not) {
		/* Do nothing if it doesn't exist */
		if (!entry)
			return 0;
2299

2300
		free_hash_entry(hash, entry);
2301 2302 2303 2304
	} else {
		/* Do nothing if it exists */
		if (entry)
			return 0;
2305

2306
		ret = add_hash_entry(hash, rec->ip);
2307 2308
	}
	return ret;
2309 2310
}

2311
static int
2312 2313
ftrace_match_record(struct dyn_ftrace *rec, char *mod,
		    char *regex, int len, int type)
2314 2315
{
	char str[KSYM_SYMBOL_LEN];
2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328
	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;
	}
2329 2330 2331 2332

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

2333 2334 2335
static int
match_records(struct ftrace_hash *hash, char *buff,
	      int len, char *mod, int not)
2336
{
2337
	unsigned search_len = 0;
2338 2339
	struct ftrace_page *pg;
	struct dyn_ftrace *rec;
2340 2341
	int type = MATCH_FULL;
	char *search = buff;
2342
	int found = 0;
2343
	int ret;
2344

2345 2346 2347 2348
	if (len) {
		type = filter_parse_regex(buff, len, &search, &not);
		search_len = strlen(search);
	}
2349

2350
	mutex_lock(&ftrace_lock);
2351

2352 2353
	if (unlikely(ftrace_disabled))
		goto out_unlock;
2354

2355 2356
	do_for_each_ftrace_rec(pg, rec) {

2357
		if (ftrace_match_record(rec, mod, search, search_len, type)) {
2358
			ret = enter_record(hash, rec, not);
2359 2360 2361 2362
			if (ret < 0) {
				found = ret;
				goto out_unlock;
			}
2363
			found = 1;
2364 2365
		}
	} while_for_each_ftrace_rec();
2366
 out_unlock:
2367
	mutex_unlock(&ftrace_lock);
2368 2369

	return found;
2370 2371
}

2372
static int
2373
ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
2374
{
2375
	return match_records(hash, buff, len, NULL, 0);
2376 2377
}

2378 2379
static int
ftrace_match_module_records(struct ftrace_hash *hash, char *buff, char *mod)
2380 2381
{
	int not = 0;
S
Steven Rostedt 已提交
2382

2383 2384 2385 2386 2387 2388 2389 2390 2391 2392
	/* 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;
	}

2393
	return match_records(hash, buff, strlen(buff), mod, not);
2394 2395
}

2396 2397 2398 2399 2400 2401 2402 2403
/*
 * 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)
{
2404
	struct ftrace_ops *ops = &global_ops;
2405
	struct ftrace_hash *hash;
2406
	char *mod;
2407
	int ret = -EINVAL;
2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418

	/*
	 * 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)
2419
		return ret;
2420 2421 2422

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

2425
	if (enable)
2426
		hash = ops->filter_hash;
2427
	else
2428
		hash = ops->notrace_hash;
2429 2430

	ret = ftrace_match_module_records(hash, func, mod);
2431 2432 2433 2434 2435 2436
	if (!ret)
		ret = -EINVAL;
	if (ret < 0)
		return ret;

	return 0;
2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449
}

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);

2450
static void
S
Steven Rostedt 已提交
2451
function_trace_probe_call(unsigned long ip, unsigned long parent_ip)
2452
{
S
Steven Rostedt 已提交
2453
	struct ftrace_func_probe *entry;
2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469
	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.
	 */
2470
	preempt_disable_notrace();
2471 2472 2473 2474
	hlist_for_each_entry_rcu(entry, n, hhd, node) {
		if (entry->ip == ip)
			entry->ops->func(ip, parent_ip, &entry->data);
	}
2475
	preempt_enable_notrace();
2476 2477
}

S
Steven Rostedt 已提交
2478
static struct ftrace_ops trace_probe_ops __read_mostly =
2479
{
2480
	.func		= function_trace_probe_call,
2481 2482
};

S
Steven Rostedt 已提交
2483
static int ftrace_probe_registered;
2484

S
Steven Rostedt 已提交
2485
static void __enable_ftrace_function_probe(void)
2486
{
2487
	int ret;
2488 2489
	int i;

S
Steven Rostedt 已提交
2490
	if (ftrace_probe_registered)
2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501
		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;

2502 2503 2504 2505
	ret = __register_ftrace_function(&trace_probe_ops);
	if (!ret)
		ftrace_startup(&trace_probe_ops, 0);

S
Steven Rostedt 已提交
2506
	ftrace_probe_registered = 1;
2507 2508
}

S
Steven Rostedt 已提交
2509
static void __disable_ftrace_function_probe(void)
2510
{
2511
	int ret;
2512 2513
	int i;

S
Steven Rostedt 已提交
2514
	if (!ftrace_probe_registered)
2515 2516 2517 2518 2519 2520 2521 2522 2523
		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 */
2524 2525 2526 2527
	ret = __unregister_ftrace_function(&trace_probe_ops);
	if (!ret)
		ftrace_shutdown(&trace_probe_ops, 0);

S
Steven Rostedt 已提交
2528
	ftrace_probe_registered = 0;
2529 2530 2531 2532 2533
}


static void ftrace_free_entry_rcu(struct rcu_head *rhp)
{
S
Steven Rostedt 已提交
2534 2535
	struct ftrace_func_probe *entry =
		container_of(rhp, struct ftrace_func_probe, rcu);
2536 2537 2538 2539 2540 2541 2542 2543

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


int
S
Steven Rostedt 已提交
2544
register_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
2545 2546
			      void *data)
{
S
Steven Rostedt 已提交
2547
	struct ftrace_func_probe *entry;
2548 2549 2550
	struct ftrace_page *pg;
	struct dyn_ftrace *rec;
	int type, len, not;
S
Steven Rostedt 已提交
2551
	unsigned long key;
2552 2553 2554
	int count = 0;
	char *search;

2555
	type = filter_parse_regex(glob, strlen(glob), &search, &not);
2556 2557
	len = strlen(search);

S
Steven Rostedt 已提交
2558
	/* we do not support '!' for function probes */
2559 2560 2561 2562 2563
	if (WARN_ON(not))
		return -EINVAL;

	mutex_lock(&ftrace_lock);

2564 2565
	if (unlikely(ftrace_disabled))
		goto out_unlock;
2566

2567
	do_for_each_ftrace_rec(pg, rec) {
2568

2569
		if (!ftrace_match_record(rec, NULL, search, len, type))
2570 2571 2572 2573
			continue;

		entry = kmalloc(sizeof(*entry), GFP_KERNEL);
		if (!entry) {
S
Steven Rostedt 已提交
2574
			/* If we did not process any, then return error */
2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603
			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 已提交
2604
	__enable_ftrace_function_probe();
2605 2606 2607 2608 2609 2610 2611 2612

 out_unlock:
	mutex_unlock(&ftrace_lock);

	return count;
}

enum {
S
Steven Rostedt 已提交
2613 2614
	PROBE_TEST_FUNC		= 1,
	PROBE_TEST_DATA		= 2
2615 2616 2617
};

static void
S
Steven Rostedt 已提交
2618
__unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
2619 2620
				  void *data, int flags)
{
S
Steven Rostedt 已提交
2621
	struct ftrace_func_probe *entry;
2622 2623 2624 2625 2626 2627
	struct hlist_node *n, *tmp;
	char str[KSYM_SYMBOL_LEN];
	int type = MATCH_FULL;
	int i, len = 0;
	char *search;

2628
	if (glob && (strcmp(glob, "*") == 0 || !strlen(glob)))
2629
		glob = NULL;
2630
	else if (glob) {
2631 2632
		int not;

2633
		type = filter_parse_regex(glob, strlen(glob), &search, &not);
2634 2635
		len = strlen(search);

S
Steven Rostedt 已提交
2636
		/* we do not support '!' for function probes */
2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647
		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 已提交
2648
			if ((flags & PROBE_TEST_FUNC) && entry->ops != ops)
2649 2650
				continue;

S
Steven Rostedt 已提交
2651
			if ((flags & PROBE_TEST_DATA) && entry->data != data)
2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665
				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 已提交
2666
	__disable_ftrace_function_probe();
2667 2668 2669 2670
	mutex_unlock(&ftrace_lock);
}

void
S
Steven Rostedt 已提交
2671
unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
2672 2673
				void *data)
{
S
Steven Rostedt 已提交
2674 2675
	__unregister_ftrace_function_probe(glob, ops, data,
					  PROBE_TEST_FUNC | PROBE_TEST_DATA);
2676 2677 2678
}

void
S
Steven Rostedt 已提交
2679
unregister_ftrace_function_probe_func(char *glob, struct ftrace_probe_ops *ops)
2680
{
S
Steven Rostedt 已提交
2681
	__unregister_ftrace_function_probe(glob, ops, NULL, PROBE_TEST_FUNC);
2682 2683
}

S
Steven Rostedt 已提交
2684
void unregister_ftrace_function_probe_all(char *glob)
2685
{
S
Steven Rostedt 已提交
2686
	__unregister_ftrace_function_probe(glob, NULL, NULL, 0);
2687 2688
}

2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729
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;
}

2730 2731
static int ftrace_process_regex(struct ftrace_hash *hash,
				char *buff, int len, int enable)
2732
{
2733
	char *func, *command, *next = buff;
S
Steven Rostedt 已提交
2734
	struct ftrace_func_command *p;
2735
	int ret;
2736 2737 2738 2739

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

	if (!next) {
2740
		ret = ftrace_match_records(hash, func, len);
2741 2742 2743 2744 2745
		if (!ret)
			ret = -EINVAL;
		if (ret < 0)
			return ret;
		return 0;
2746 2747
	}

2748
	/* command found */
2749 2750 2751

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

2752 2753 2754 2755 2756 2757
	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;
		}
2758
	}
2759 2760
 out_unlock:
	mutex_unlock(&ftrace_cmd_mutex);
2761

2762
	return ret;
2763 2764
}

I
Ingo Molnar 已提交
2765
static ssize_t
2766 2767
ftrace_regex_write(struct file *file, const char __user *ubuf,
		   size_t cnt, loff_t *ppos, int enable)
2768 2769
{
	struct ftrace_iterator *iter;
2770 2771
	struct trace_parser *parser;
	ssize_t ret, read;
2772

2773
	if (!cnt)
2774 2775
		return 0;

2776
	mutex_lock(&ftrace_regex_lock);
2777

2778 2779 2780 2781
	ret = -ENODEV;
	if (unlikely(ftrace_disabled))
		goto out_unlock;

2782 2783 2784 2785 2786 2787
	if (file->f_mode & FMODE_READ) {
		struct seq_file *m = file->private_data;
		iter = m->private;
	} else
		iter = file->private_data;

2788 2789
	parser = &iter->parser;
	read = trace_get_user(parser, ubuf, cnt, ppos);
2790

2791
	if (read >= 0 && trace_parser_loaded(parser) &&
2792
	    !trace_parser_cont(parser)) {
2793
		ret = ftrace_process_regex(iter->hash, parser->buffer,
2794
					   parser->idx, enable);
2795
		trace_parser_clear(parser);
2796
		if (ret)
2797
			goto out_unlock;
2798
	}
2799 2800

	ret = read;
2801
out_unlock:
2802
	mutex_unlock(&ftrace_regex_lock);
2803

2804 2805 2806
	return ret;
}

2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820
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);
}

2821
static int
2822 2823
ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
		 int reset, int enable)
2824
{
2825
	struct ftrace_hash **orig_hash;
2826
	struct ftrace_hash *hash;
2827
	int ret;
2828

2829
	if (unlikely(ftrace_disabled))
2830
		return -ENODEV;
2831

2832
	if (enable)
2833
		orig_hash = &ops->filter_hash;
2834
	else
2835 2836 2837 2838 2839
		orig_hash = &ops->notrace_hash;

	hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
	if (!hash)
		return -ENOMEM;
2840

2841 2842
	mutex_lock(&ftrace_regex_lock);
	if (reset)
2843
		ftrace_filter_reset(hash);
2844
	if (buf)
2845
		ftrace_match_records(hash, buf, len);
2846 2847 2848 2849 2850

	mutex_lock(&ftrace_lock);
	ret = ftrace_hash_move(orig_hash, hash);
	mutex_unlock(&ftrace_lock);

2851
	mutex_unlock(&ftrace_regex_lock);
2852 2853 2854

	free_ftrace_hash(hash);
	return ret;
2855 2856
}

2857 2858 2859 2860 2861 2862 2863 2864 2865
/**
 * 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 已提交
2866
void ftrace_set_filter(unsigned char *buf, int len, int reset)
2867
{
2868
	ftrace_set_regex(&global_ops, buf, len, reset, 1);
2869
}
2870

2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882
/**
 * 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)
{
2883
	ftrace_set_regex(&global_ops, buf, len, reset, 0);
2884 2885
}

2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906
/*
 * 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);

2907
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
2908
static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
2909 2910
static int ftrace_set_func(unsigned long *array, int *idx, char *buffer);

2911 2912
static int __init set_graph_function(char *str)
{
2913
	strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934
	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 */

2935 2936
static void __init
set_ftrace_early_filter(struct ftrace_ops *ops, char *buf, int enable)
2937 2938 2939 2940 2941
{
	char *func;

	while (buf) {
		func = strsep(&buf, ",");
2942
		ftrace_set_regex(ops, func, strlen(func), 0, enable);
2943 2944 2945 2946 2947 2948
	}
}

static void __init set_ftrace_early_filters(void)
{
	if (ftrace_filter_buf[0])
2949
		set_ftrace_early_filter(&global_ops, ftrace_filter_buf, 1);
2950
	if (ftrace_notrace_buf[0])
2951
		set_ftrace_early_filter(&global_ops, ftrace_notrace_buf, 0);
2952 2953 2954 2955
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
	if (ftrace_graph_buf[0])
		set_ftrace_early_graph(ftrace_graph_buf);
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
2956 2957
}

I
Ingo Molnar 已提交
2958
static int
2959
ftrace_regex_release(struct inode *inode, struct file *file)
2960 2961 2962
{
	struct seq_file *m = (struct seq_file *)file->private_data;
	struct ftrace_iterator *iter;
2963
	struct ftrace_hash **orig_hash;
2964
	struct trace_parser *parser;
2965
	int filter_hash;
2966
	int ret;
2967

2968
	mutex_lock(&ftrace_regex_lock);
2969 2970 2971 2972 2973 2974 2975
	if (file->f_mode & FMODE_READ) {
		iter = m->private;

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

2976 2977 2978
	parser = &iter->parser;
	if (trace_parser_loaded(parser)) {
		parser->buffer[parser->idx] = 0;
2979
		ftrace_match_records(iter->hash, parser->buffer, parser->idx);
2980 2981
	}

2982 2983
	trace_parser_put(parser);

2984
	if (file->f_mode & FMODE_WRITE) {
2985 2986 2987
		filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);

		if (filter_hash)
2988
			orig_hash = &iter->ops->filter_hash;
2989 2990
		else
			orig_hash = &iter->ops->notrace_hash;
2991

2992
		mutex_lock(&ftrace_lock);
2993 2994 2995 2996 2997
		/*
		 * Remove the current set, update the hash and add
		 * them back.
		 */
		ftrace_hash_rec_disable(iter->ops, filter_hash);
2998
		ret = ftrace_hash_move(orig_hash, iter->hash);
2999 3000 3001 3002 3003 3004
		if (!ret) {
			ftrace_hash_rec_enable(iter->ops, filter_hash);
			if (iter->ops->flags & FTRACE_OPS_FL_ENABLED
			    && ftrace_enabled)
				ftrace_run_update_code(FTRACE_ENABLE_CALLS);
		}
3005 3006
		mutex_unlock(&ftrace_lock);
	}
3007 3008
	free_ftrace_hash(iter->hash);
	kfree(iter);
3009

3010
	mutex_unlock(&ftrace_regex_lock);
3011 3012 3013
	return 0;
}

3014
static const struct file_operations ftrace_avail_fops = {
3015 3016 3017
	.open = ftrace_avail_open,
	.read = seq_read,
	.llseek = seq_lseek,
L
Li Zefan 已提交
3018
	.release = seq_release_private,
3019 3020
};

3021 3022 3023 3024 3025 3026 3027
static const struct file_operations ftrace_enabled_fops = {
	.open = ftrace_enabled_open,
	.read = seq_read,
	.llseek = seq_lseek,
	.release = seq_release_private,
};

3028
static const struct file_operations ftrace_filter_fops = {
3029
	.open = ftrace_filter_open,
L
Lai Jiangshan 已提交
3030
	.read = seq_read,
3031
	.write = ftrace_filter_write,
3032
	.llseek = ftrace_regex_lseek,
3033
	.release = ftrace_regex_release,
3034 3035
};

3036
static const struct file_operations ftrace_notrace_fops = {
3037
	.open = ftrace_notrace_open,
L
Lai Jiangshan 已提交
3038
	.read = seq_read,
3039 3040
	.write = ftrace_notrace_write,
	.llseek = ftrace_regex_lseek,
3041
	.release = ftrace_regex_release,
3042 3043
};

3044 3045 3046 3047 3048
#ifdef CONFIG_FUNCTION_GRAPH_TRACER

static DEFINE_MUTEX(graph_lock);

int ftrace_graph_count;
3049
int ftrace_graph_filter_enabled;
3050 3051 3052
unsigned long ftrace_graph_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;

static void *
3053
__g_next(struct seq_file *m, loff_t *pos)
3054
{
3055
	if (*pos >= ftrace_graph_count)
3056
		return NULL;
3057
	return &ftrace_graph_funcs[*pos];
3058
}
3059

3060 3061 3062 3063 3064
static void *
g_next(struct seq_file *m, void *v, loff_t *pos)
{
	(*pos)++;
	return __g_next(m, pos);
3065 3066 3067 3068 3069 3070
}

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

3071
	/* Nothing, tell g_show to print all functions are enabled */
3072
	if (!ftrace_graph_filter_enabled && !*pos)
3073 3074
		return (void *)1;

3075
	return __g_next(m, pos);
3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089
}

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;

3090 3091 3092 3093 3094
	if (ptr == (unsigned long *)1) {
		seq_printf(m, "#### all functions enabled ####\n");
		return 0;
	}

3095
	seq_printf(m, "%ps\n", (void *)*ptr);
3096 3097 3098 3099

	return 0;
}

J
James Morris 已提交
3100
static const struct seq_operations ftrace_graph_seq_ops = {
3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116
	.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) &&
3117
	    (file->f_flags & O_TRUNC)) {
3118
		ftrace_graph_filter_enabled = 0;
3119 3120 3121
		ftrace_graph_count = 0;
		memset(ftrace_graph_funcs, 0, sizeof(ftrace_graph_funcs));
	}
3122
	mutex_unlock(&graph_lock);
3123

3124
	if (file->f_mode & FMODE_READ)
3125 3126 3127 3128 3129
		ret = seq_open(file, &ftrace_graph_seq_ops);

	return ret;
}

3130 3131 3132 3133 3134 3135 3136 3137
static int
ftrace_graph_release(struct inode *inode, struct file *file)
{
	if (file->f_mode & FMODE_READ)
		seq_release(inode, file);
	return 0;
}

3138
static int
3139
ftrace_set_func(unsigned long *array, int *idx, char *buffer)
3140 3141 3142
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;
3143
	int search_len;
3144
	int fail = 1;
3145 3146 3147 3148
	int type, not;
	char *search;
	bool exists;
	int i;
3149

3150
	/* decode regex */
3151
	type = filter_parse_regex(buffer, strlen(buffer), &search, &not);
3152 3153
	if (!not && *idx >= FTRACE_GRAPH_MAX_FUNCS)
		return -EBUSY;
3154 3155 3156

	search_len = strlen(search);

3157
	mutex_lock(&ftrace_lock);
3158 3159 3160 3161 3162 3163

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

3164 3165
	do_for_each_ftrace_rec(pg, rec) {

3166
		if (rec->flags & FTRACE_FL_FREE)
3167 3168
			continue;

3169
		if (ftrace_match_record(rec, NULL, search, search_len, type)) {
3170
			/* if it is in the array */
3171
			exists = false;
3172
			for (i = 0; i < *idx; i++) {
3173 3174
				if (array[i] == rec->ip) {
					exists = true;
3175 3176
					break;
				}
3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192
			}

			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;
				}
			}
3193
		}
3194
	} while_for_each_ftrace_rec();
3195
out:
3196
	mutex_unlock(&ftrace_lock);
3197

3198 3199 3200 3201 3202
	if (fail)
		return -EINVAL;

	ftrace_graph_filter_enabled = 1;
	return 0;
3203 3204 3205 3206 3207 3208
}

static ssize_t
ftrace_graph_write(struct file *file, const char __user *ubuf,
		   size_t cnt, loff_t *ppos)
{
3209
	struct trace_parser parser;
3210
	ssize_t read, ret;
3211

3212
	if (!cnt)
3213 3214 3215 3216
		return 0;

	mutex_lock(&graph_lock);

3217 3218
	if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX)) {
		ret = -ENOMEM;
3219
		goto out_unlock;
3220 3221
	}

3222
	read = trace_get_user(&parser, ubuf, cnt, ppos);
3223

3224
	if (read >= 0 && trace_parser_loaded((&parser))) {
3225 3226 3227
		parser.buffer[parser.idx] = 0;

		/* we allow only one expression at a time */
3228
		ret = ftrace_set_func(ftrace_graph_funcs, &ftrace_graph_count,
3229
					parser.buffer);
3230
		if (ret)
3231
			goto out_free;
3232 3233 3234
	}

	ret = read;
3235 3236

out_free:
3237
	trace_parser_put(&parser);
3238
out_unlock:
3239 3240 3241 3242 3243 3244
	mutex_unlock(&graph_lock);

	return ret;
}

static const struct file_operations ftrace_graph_fops = {
3245 3246 3247 3248
	.open		= ftrace_graph_open,
	.read		= seq_read,
	.write		= ftrace_graph_write,
	.release	= ftrace_graph_release,
3249
	.llseek		= seq_lseek,
3250 3251 3252
};
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */

3253
static __init int ftrace_init_dyn_debugfs(struct dentry *d_tracer)
3254 3255
{

3256 3257
	trace_create_file("available_filter_functions", 0444,
			d_tracer, NULL, &ftrace_avail_fops);
3258

3259 3260 3261
	trace_create_file("enabled_functions", 0444,
			d_tracer, NULL, &ftrace_enabled_fops);

3262 3263
	trace_create_file("set_ftrace_filter", 0644, d_tracer,
			NULL, &ftrace_filter_fops);
3264

3265
	trace_create_file("set_ftrace_notrace", 0644, d_tracer,
3266
				    NULL, &ftrace_notrace_fops);
3267

3268
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
3269
	trace_create_file("set_graph_function", 0444, d_tracer,
3270 3271 3272 3273
				    NULL,
				    &ftrace_graph_fops);
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */

3274 3275 3276
	return 0;
}

3277
static int ftrace_process_locs(struct module *mod,
3278
			       unsigned long *start,
3279 3280 3281 3282 3283
			       unsigned long *end)
{
	unsigned long *p;
	unsigned long addr;

S
Steven Rostedt 已提交
3284
	mutex_lock(&ftrace_lock);
3285 3286 3287
	p = start;
	while (p < end) {
		addr = ftrace_call_adjust(*p++);
3288 3289 3290 3291 3292 3293 3294 3295
		/*
		 * 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;
3296 3297 3298
		ftrace_record_ip(addr);
	}

3299
	ftrace_update_code(mod);
S
Steven Rostedt 已提交
3300
	mutex_unlock(&ftrace_lock);
3301 3302 3303 3304

	return 0;
}

3305
#ifdef CONFIG_MODULES
3306
void ftrace_release_mod(struct module *mod)
3307 3308 3309 3310
{
	struct dyn_ftrace *rec;
	struct ftrace_page *pg;

3311 3312
	mutex_lock(&ftrace_lock);

3313
	if (ftrace_disabled)
3314
		goto out_unlock;
3315 3316

	do_for_each_ftrace_rec(pg, rec) {
3317
		if (within_module_core(rec->ip, mod)) {
3318 3319 3320 3321 3322 3323 3324 3325
			/*
			 * 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();
3326
 out_unlock:
3327 3328 3329 3330 3331
	mutex_unlock(&ftrace_lock);
}

static void ftrace_init_module(struct module *mod,
			       unsigned long *start, unsigned long *end)
3332
{
3333
	if (ftrace_disabled || start == end)
3334
		return;
3335
	ftrace_process_locs(mod, start, end);
3336 3337
}

3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349
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:
3350
		ftrace_release_mod(mod);
3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368
		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,
};

3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395
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;

3396
	ret = ftrace_process_locs(NULL,
3397
				  __start_mcount_loc,
3398 3399
				  __stop_mcount_loc);

3400
	ret = register_module_notifier(&ftrace_module_nb);
3401
	if (ret)
3402 3403
		pr_warning("Failed to register trace ftrace module notifier\n");

3404 3405
	set_ftrace_early_filters();

3406 3407 3408 3409 3410
	return;
 failed:
	ftrace_disabled = 1;
}

3411
#else
3412

3413
static struct ftrace_ops global_ops = {
3414 3415 3416
	.func			= ftrace_stub,
};

3417 3418 3419 3420 3421 3422 3423
static int __init ftrace_nodyn_init(void)
{
	ftrace_enabled = 1;
	return 0;
}
device_initcall(ftrace_nodyn_init);

3424 3425
static inline int ftrace_init_dyn_debugfs(struct dentry *d_tracer) { return 0; }
static inline void ftrace_startup_enable(int command) { }
3426
/* Keep as macros so we do not need to define the commands */
3427 3428
# define ftrace_startup(ops, command)	do { } while (0)
# define ftrace_shutdown(ops, command)	do { } while (0)
I
Ingo Molnar 已提交
3429 3430
# define ftrace_startup_sysctl()	do { } while (0)
# define ftrace_shutdown_sysctl()	do { } while (0)
3431 3432 3433 3434 3435 3436 3437

static inline int
ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip)
{
	return 1;
}

3438 3439
#endif /* CONFIG_DYNAMIC_FTRACE */

3440 3441 3442
static void
ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip)
{
3443
	struct ftrace_ops *op;
3444

3445 3446 3447 3448 3449 3450
	/*
	 * Some of the ops may be dynamically allocated,
	 * they must be freed after a synchronize_sched().
	 */
	preempt_disable_notrace();
	op = rcu_dereference_raw(ftrace_ops_list);
3451 3452 3453 3454 3455
	while (op != &ftrace_list_end) {
		if (ftrace_ops_test(op, ip))
			op->func(ip, parent_ip);
		op = rcu_dereference_raw(op->next);
	};
3456
	preempt_enable_notrace();
3457 3458
}

3459
static void clear_ftrace_swapper(void)
S
Steven Rostedt 已提交
3460 3461
{
	struct task_struct *p;
3462
	int cpu;
S
Steven Rostedt 已提交
3463

3464 3465 3466
	get_online_cpus();
	for_each_online_cpu(cpu) {
		p = idle_task(cpu);
S
Steven Rostedt 已提交
3467
		clear_tsk_trace_trace(p);
3468 3469 3470
	}
	put_online_cpus();
}
S
Steven Rostedt 已提交
3471

3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482
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 已提交
3483 3484
}

3485 3486 3487 3488
static void clear_ftrace_pid(struct pid *pid)
{
	struct task_struct *p;

3489
	rcu_read_lock();
3490 3491 3492
	do_each_pid_task(pid, PIDTYPE_PID, p) {
		clear_tsk_trace_trace(p);
	} while_each_pid_task(pid, PIDTYPE_PID, p);
3493 3494
	rcu_read_unlock();

3495 3496 3497 3498
	put_pid(pid);
}

static void set_ftrace_pid(struct pid *pid)
S
Steven Rostedt 已提交
3499 3500 3501
{
	struct task_struct *p;

3502
	rcu_read_lock();
S
Steven Rostedt 已提交
3503 3504 3505
	do_each_pid_task(pid, PIDTYPE_PID, p) {
		set_tsk_trace_trace(p);
	} while_each_pid_task(pid, PIDTYPE_PID, p);
3506
	rcu_read_unlock();
S
Steven Rostedt 已提交
3507 3508
}

3509
static void clear_ftrace_pid_task(struct pid *pid)
3510
{
3511
	if (pid == ftrace_swapper_pid)
3512 3513
		clear_ftrace_swapper();
	else
3514
		clear_ftrace_pid(pid);
3515 3516 3517 3518 3519 3520 3521 3522 3523 3524
}

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

3525
static int ftrace_pid_add(int p)
3526
{
S
Steven Rostedt 已提交
3527
	struct pid *pid;
3528 3529
	struct ftrace_pid *fpid;
	int ret = -EINVAL;
3530

3531
	mutex_lock(&ftrace_lock);
3532

3533 3534 3535 3536
	if (!p)
		pid = ftrace_swapper_pid;
	else
		pid = find_get_pid(p);
3537

3538 3539
	if (!pid)
		goto out;
3540

3541
	ret = 0;
3542

3543 3544 3545
	list_for_each_entry(fpid, &ftrace_pids, list)
		if (fpid->pid == pid)
			goto out_put;
S
Steven Rostedt 已提交
3546

3547
	ret = -ENOMEM;
3548

3549 3550 3551
	fpid = kmalloc(sizeof(*fpid), GFP_KERNEL);
	if (!fpid)
		goto out_put;
3552

3553 3554
	list_add(&fpid->list, &ftrace_pids);
	fpid->pid = pid;
3555

3556
	set_ftrace_pid_task(pid);
S
Steven Rostedt 已提交
3557

3558 3559 3560 3561 3562 3563 3564 3565 3566
	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 已提交
3567

3568 3569 3570 3571 3572 3573 3574 3575
out:
	mutex_unlock(&ftrace_lock);
	return ret;
}

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

3577 3578 3579 3580 3581 3582 3583 3584
	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);
3585 3586 3587 3588 3589
	}

	ftrace_update_pid_func();
	ftrace_startup_enable(0);

S
Steven Rostedt 已提交
3590
	mutex_unlock(&ftrace_lock);
3591
}
3592

3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654
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;
}

3655 3656 3657 3658
static ssize_t
ftrace_pid_write(struct file *filp, const char __user *ubuf,
		   size_t cnt, loff_t *ppos)
{
3659
	char buf[64], *tmp;
3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670
	long val;
	int ret;

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

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

	buf[cnt] = 0;

3671 3672 3673 3674
	/*
	 * Allow "echo > set_ftrace_pid" or "echo -n '' > set_ftrace_pid"
	 * to clean the filter quietly.
	 */
3675 3676
	tmp = strstrip(buf);
	if (strlen(tmp) == 0)
3677 3678
		return 1;

3679
	ret = strict_strtol(tmp, 10, &val);
3680 3681 3682
	if (ret < 0)
		return ret;

3683
	ret = ftrace_pid_add(val);
3684

3685 3686
	return ret ? ret : cnt;
}
3687

3688 3689 3690 3691 3692
static int
ftrace_pid_release(struct inode *inode, struct file *file)
{
	if (file->f_mode & FMODE_READ)
		seq_release(inode, file);
3693

3694
	return 0;
3695 3696
}

3697
static const struct file_operations ftrace_pid_fops = {
3698 3699 3700 3701 3702
	.open		= ftrace_pid_open,
	.write		= ftrace_pid_write,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= ftrace_pid_release,
3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714
};

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);

3715 3716
	trace_create_file("set_ftrace_pid", 0644, d_tracer,
			    NULL, &ftrace_pid_fops);
3717 3718 3719

	ftrace_profile_debugfs(d_tracer);

3720 3721 3722 3723
	return 0;
}
fs_initcall(ftrace_init_debugfs);

S
Steven Rostedt 已提交
3724
/**
3725
 * ftrace_kill - kill ftrace
S
Steven Rostedt 已提交
3726 3727 3728 3729 3730
 *
 * 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.
 */
3731
void ftrace_kill(void)
S
Steven Rostedt 已提交
3732 3733 3734 3735 3736 3737
{
	ftrace_disabled = 1;
	ftrace_enabled = 0;
	clear_ftrace_function();
}

3738
/**
3739 3740
 * register_ftrace_function - register a function for profiling
 * @ops - ops structure that holds the function for profiling.
3741
 *
3742 3743 3744 3745 3746 3747
 * 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.
3748
 */
3749
int register_ftrace_function(struct ftrace_ops *ops)
3750
{
3751
	int ret = -1;
3752

S
Steven Rostedt 已提交
3753
	mutex_lock(&ftrace_lock);
3754

3755 3756 3757
	if (unlikely(ftrace_disabled))
		goto out_unlock;

3758
	ret = __register_ftrace_function(ops);
3759 3760 3761
	if (!ret)
		ftrace_startup(ops, 0);

3762

3763
 out_unlock:
S
Steven Rostedt 已提交
3764
	mutex_unlock(&ftrace_lock);
3765
	return ret;
3766
}
3767
EXPORT_SYMBOL_GPL(register_ftrace_function);
3768 3769

/**
3770
 * unregister_ftrace_function - unregister a function for profiling.
3771 3772 3773 3774 3775 3776 3777 3778
 * @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 已提交
3779
	mutex_lock(&ftrace_lock);
3780
	ret = __unregister_ftrace_function(ops);
3781 3782
	if (!ret)
		ftrace_shutdown(ops, 0);
S
Steven Rostedt 已提交
3783
	mutex_unlock(&ftrace_lock);
3784 3785 3786

	return ret;
}
3787
EXPORT_SYMBOL_GPL(unregister_ftrace_function);
3788

I
Ingo Molnar 已提交
3789
int
3790
ftrace_enable_sysctl(struct ctl_table *table, int write,
3791
		     void __user *buffer, size_t *lenp,
3792 3793
		     loff_t *ppos)
{
3794
	int ret = -ENODEV;
3795

S
Steven Rostedt 已提交
3796
	mutex_lock(&ftrace_lock);
3797

3798 3799 3800 3801
	if (unlikely(ftrace_disabled))
		goto out;

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

3803
	if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
3804 3805
		goto out;

3806
	last_ftrace_enabled = !!ftrace_enabled;
3807 3808 3809 3810 3811 3812

	if (ftrace_enabled) {

		ftrace_startup_sysctl();

		/* we are starting ftrace again */
3813 3814 3815
		if (ftrace_ops_list != &ftrace_list_end) {
			if (ftrace_ops_list->next == &ftrace_list_end)
				ftrace_trace_function = ftrace_ops_list->func;
3816
			else
3817
				ftrace_trace_function = ftrace_ops_list_func;
3818 3819 3820 3821 3822 3823 3824 3825 3826 3827
		}

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

		ftrace_shutdown_sysctl();
	}

 out:
S
Steven Rostedt 已提交
3828
	mutex_unlock(&ftrace_lock);
3829
	return ret;
3830
}
3831

3832
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
3833

3834
static int ftrace_graph_active;
3835
static struct notifier_block ftrace_suspend_notifier;
3836

3837 3838 3839 3840 3841
int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
{
	return 0;
}

3842 3843 3844
/* The callbacks that hook a function */
trace_func_graph_ret_t ftrace_graph_return =
			(trace_func_graph_ret_t)ftrace_stub;
3845
trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875

/* 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) {
3876
			atomic_set(&t->tracing_graph_pause, 0);
3877
			atomic_set(&t->trace_overrun, 0);
3878 3879 3880 3881
			t->curr_ret_stack = -1;
			/* Make sure the tasks see the -1 first: */
			smp_wmb();
			t->ret_stack = ret_stack_list[start++];
3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892
		}
	} 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;
}

3893
static void
3894 3895
ftrace_graph_probe_sched_switch(void *ignore,
			struct task_struct *prev, struct task_struct *next)
3896 3897 3898 3899
{
	unsigned long long timestamp;
	int index;

3900 3901 3902 3903 3904 3905 3906
	/*
	 * 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;

3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924
	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;
}

3925
/* Allocate a return stack for each task */
3926
static int start_graph_tracing(void)
3927 3928
{
	struct ftrace_ret_stack **ret_stack_list;
3929
	int ret, cpu;
3930 3931 3932 3933 3934 3935 3936 3937

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

	if (!ret_stack_list)
		return -ENOMEM;

3938
	/* The cpu_boot init_task->ret_stack will never be freed */
3939 3940
	for_each_online_cpu(cpu) {
		if (!idle_task(cpu)->ret_stack)
3941
			ftrace_graph_init_idle_task(idle_task(cpu), cpu);
3942
	}
3943

3944 3945 3946 3947
	do {
		ret = alloc_retstack_tasklist(ret_stack_list);
	} while (ret == -EAGAIN);

3948
	if (!ret) {
3949
		ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
3950 3951 3952 3953 3954
		if (ret)
			pr_info("ftrace_graph: Couldn't activate tracepoint"
				" probe to kernel_sched_switch\n");
	}

3955 3956 3957 3958
	kfree(ret_stack_list);
	return ret;
}

3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979
/*
 * 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;
}

3980 3981
int register_ftrace_graph(trace_func_graph_ret_t retfunc,
			trace_func_graph_ent_t entryfunc)
3982
{
3983 3984
	int ret = 0;

S
Steven Rostedt 已提交
3985
	mutex_lock(&ftrace_lock);
3986

3987
	/* we currently allow only one tracer registered at a time */
3988
	if (ftrace_graph_active) {
3989 3990 3991 3992
		ret = -EBUSY;
		goto out;
	}

3993 3994 3995
	ftrace_suspend_notifier.notifier_call = ftrace_suspend_notifier_call;
	register_pm_notifier(&ftrace_suspend_notifier);

3996
	ftrace_graph_active++;
3997
	ret = start_graph_tracing();
3998
	if (ret) {
3999
		ftrace_graph_active--;
4000 4001
		goto out;
	}
4002

4003 4004
	ftrace_graph_return = retfunc;
	ftrace_graph_entry = entryfunc;
4005

4006
	ftrace_startup(&global_ops, FTRACE_START_FUNC_RET);
4007 4008

out:
S
Steven Rostedt 已提交
4009
	mutex_unlock(&ftrace_lock);
4010
	return ret;
4011 4012
}

4013
void unregister_ftrace_graph(void)
4014
{
S
Steven Rostedt 已提交
4015
	mutex_lock(&ftrace_lock);
4016

4017
	if (unlikely(!ftrace_graph_active))
4018 4019
		goto out;

4020
	ftrace_graph_active--;
4021
	ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
4022
	ftrace_graph_entry = ftrace_graph_entry_stub;
4023
	ftrace_shutdown(&global_ops, FTRACE_STOP_FUNC_RET);
4024
	unregister_pm_notifier(&ftrace_suspend_notifier);
4025
	unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
4026

4027
 out:
S
Steven Rostedt 已提交
4028
	mutex_unlock(&ftrace_lock);
4029
}
4030

4031 4032 4033 4034 4035 4036 4037 4038
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 已提交
4039
	/* make curr_ret_stack visible before we add the ret_stack */
4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073
	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);
	}
}

4074
/* Allocate a return stack for newly created task */
4075
void ftrace_graph_init_task(struct task_struct *t)
4076
{
4077 4078
	/* Make sure we do not use the parent ret_stack */
	t->ret_stack = NULL;
4079
	t->curr_ret_stack = -1;
4080

4081
	if (ftrace_graph_active) {
4082 4083 4084
		struct ftrace_ret_stack *ret_stack;

		ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
4085 4086
				* sizeof(struct ftrace_ret_stack),
				GFP_KERNEL);
4087
		if (!ret_stack)
4088
			return;
4089
		graph_init_task(t, ret_stack);
4090
	}
4091 4092
}

4093
void ftrace_graph_exit_task(struct task_struct *t)
4094
{
4095 4096
	struct ftrace_ret_stack	*ret_stack = t->ret_stack;

4097
	t->ret_stack = NULL;
4098 4099 4100 4101
	/* NULL must become visible to IRQs before we free it: */
	barrier();

	kfree(ret_stack);
4102
}
S
Steven Rostedt 已提交
4103 4104 4105 4106 4107

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