Merge tag 'chrome-platform-for-linus-4.13' of git://git.kernel.org/pub/scm/linux...
[linux/fpc-iii.git] / kernel / trace / ftrace.c
blob2953d558bbee7055ee919e4d4b116378ffe4a040
1 /*
2 * Infrastructure for profiling code inserted by 'gcc -pg'.
4 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
5 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
7 * Originally ported from the -rt patch by:
8 * Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
10 * Based on code in the latency_tracer, that is:
12 * Copyright (C) 2004-2006 Ingo Molnar
13 * Copyright (C) 2004 Nadia Yvette Chambers
16 #include <linux/stop_machine.h>
17 #include <linux/clocksource.h>
18 #include <linux/sched/task.h>
19 #include <linux/kallsyms.h>
20 #include <linux/seq_file.h>
21 #include <linux/suspend.h>
22 #include <linux/tracefs.h>
23 #include <linux/hardirq.h>
24 #include <linux/kthread.h>
25 #include <linux/uaccess.h>
26 #include <linux/bsearch.h>
27 #include <linux/module.h>
28 #include <linux/ftrace.h>
29 #include <linux/sysctl.h>
30 #include <linux/slab.h>
31 #include <linux/ctype.h>
32 #include <linux/sort.h>
33 #include <linux/list.h>
34 #include <linux/hash.h>
35 #include <linux/rcupdate.h>
37 #include <trace/events/sched.h>
39 #include <asm/sections.h>
40 #include <asm/setup.h>
42 #include "trace_output.h"
43 #include "trace_stat.h"
45 #define FTRACE_WARN_ON(cond) \
46 ({ \
47 int ___r = cond; \
48 if (WARN_ON(___r)) \
49 ftrace_kill(); \
50 ___r; \
53 #define FTRACE_WARN_ON_ONCE(cond) \
54 ({ \
55 int ___r = cond; \
56 if (WARN_ON_ONCE(___r)) \
57 ftrace_kill(); \
58 ___r; \
61 /* hash bits for specific function selection */
62 #define FTRACE_HASH_BITS 7
63 #define FTRACE_FUNC_HASHSIZE (1 << FTRACE_HASH_BITS)
64 #define FTRACE_HASH_DEFAULT_BITS 10
65 #define FTRACE_HASH_MAX_BITS 12
67 #ifdef CONFIG_DYNAMIC_FTRACE
68 #define INIT_OPS_HASH(opsname) \
69 .func_hash = &opsname.local_hash, \
70 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
71 #define ASSIGN_OPS_HASH(opsname, val) \
72 .func_hash = val, \
73 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
74 #else
75 #define INIT_OPS_HASH(opsname)
76 #define ASSIGN_OPS_HASH(opsname, val)
77 #endif
79 static struct ftrace_ops ftrace_list_end __read_mostly = {
80 .func = ftrace_stub,
81 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_STUB,
82 INIT_OPS_HASH(ftrace_list_end)
85 /* ftrace_enabled is a method to turn ftrace on or off */
86 int ftrace_enabled __read_mostly;
87 static int last_ftrace_enabled;
89 /* Current function tracing op */
90 struct ftrace_ops *function_trace_op __read_mostly = &ftrace_list_end;
91 /* What to set function_trace_op to */
92 static struct ftrace_ops *set_function_trace_op;
94 static bool ftrace_pids_enabled(struct ftrace_ops *ops)
96 struct trace_array *tr;
98 if (!(ops->flags & FTRACE_OPS_FL_PID) || !ops->private)
99 return false;
101 tr = ops->private;
103 return tr->function_pids != NULL;
106 static void ftrace_update_trampoline(struct ftrace_ops *ops);
109 * ftrace_disabled is set when an anomaly is discovered.
110 * ftrace_disabled is much stronger than ftrace_enabled.
112 static int ftrace_disabled __read_mostly;
114 static DEFINE_MUTEX(ftrace_lock);
116 static struct ftrace_ops *ftrace_ops_list __read_mostly = &ftrace_list_end;
117 ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
118 static struct ftrace_ops global_ops;
120 #if ARCH_SUPPORTS_FTRACE_OPS
121 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
122 struct ftrace_ops *op, struct pt_regs *regs);
123 #else
124 /* See comment below, where ftrace_ops_list_func is defined */
125 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip);
126 #define ftrace_ops_list_func ((ftrace_func_t)ftrace_ops_no_ops)
127 #endif
130 * Traverse the ftrace_global_list, invoking all entries. The reason that we
131 * can use rcu_dereference_raw_notrace() is that elements removed from this list
132 * are simply leaked, so there is no need to interact with a grace-period
133 * mechanism. The rcu_dereference_raw_notrace() calls are needed to handle
134 * concurrent insertions into the ftrace_global_list.
136 * Silly Alpha and silly pointer-speculation compiler optimizations!
138 #define do_for_each_ftrace_op(op, list) \
139 op = rcu_dereference_raw_notrace(list); \
143 * Optimized for just a single item in the list (as that is the normal case).
145 #define while_for_each_ftrace_op(op) \
146 while (likely(op = rcu_dereference_raw_notrace((op)->next)) && \
147 unlikely((op) != &ftrace_list_end))
149 static inline void ftrace_ops_init(struct ftrace_ops *ops)
151 #ifdef CONFIG_DYNAMIC_FTRACE
152 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED)) {
153 mutex_init(&ops->local_hash.regex_lock);
154 ops->func_hash = &ops->local_hash;
155 ops->flags |= FTRACE_OPS_FL_INITIALIZED;
157 #endif
161 * ftrace_nr_registered_ops - return number of ops registered
163 * Returns the number of ftrace_ops registered and tracing functions
165 int ftrace_nr_registered_ops(void)
167 struct ftrace_ops *ops;
168 int cnt = 0;
170 mutex_lock(&ftrace_lock);
172 for (ops = ftrace_ops_list;
173 ops != &ftrace_list_end; ops = ops->next)
174 cnt++;
176 mutex_unlock(&ftrace_lock);
178 return cnt;
181 static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip,
182 struct ftrace_ops *op, struct pt_regs *regs)
184 struct trace_array *tr = op->private;
186 if (tr && this_cpu_read(tr->trace_buffer.data->ftrace_ignore_pid))
187 return;
189 op->saved_func(ip, parent_ip, op, regs);
193 * clear_ftrace_function - reset the ftrace function
195 * This NULLs the ftrace function and in essence stops
196 * tracing. There may be lag
198 void clear_ftrace_function(void)
200 ftrace_trace_function = ftrace_stub;
203 static void per_cpu_ops_disable_all(struct ftrace_ops *ops)
205 int cpu;
207 for_each_possible_cpu(cpu)
208 *per_cpu_ptr(ops->disabled, cpu) = 1;
211 static int per_cpu_ops_alloc(struct ftrace_ops *ops)
213 int __percpu *disabled;
215 if (WARN_ON_ONCE(!(ops->flags & FTRACE_OPS_FL_PER_CPU)))
216 return -EINVAL;
218 disabled = alloc_percpu(int);
219 if (!disabled)
220 return -ENOMEM;
222 ops->disabled = disabled;
223 per_cpu_ops_disable_all(ops);
224 return 0;
227 static void ftrace_sync(struct work_struct *work)
230 * This function is just a stub to implement a hard force
231 * of synchronize_sched(). This requires synchronizing
232 * tasks even in userspace and idle.
234 * Yes, function tracing is rude.
238 static void ftrace_sync_ipi(void *data)
240 /* Probably not needed, but do it anyway */
241 smp_rmb();
244 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
245 static void update_function_graph_func(void);
247 /* Both enabled by default (can be cleared by function_graph tracer flags */
248 static bool fgraph_sleep_time = true;
249 static bool fgraph_graph_time = true;
251 #else
252 static inline void update_function_graph_func(void) { }
253 #endif
256 static ftrace_func_t ftrace_ops_get_list_func(struct ftrace_ops *ops)
259 * If this is a dynamic, RCU, or per CPU ops, or we force list func,
260 * then it needs to call the list anyway.
262 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_PER_CPU |
263 FTRACE_OPS_FL_RCU) || FTRACE_FORCE_LIST_FUNC)
264 return ftrace_ops_list_func;
266 return ftrace_ops_get_func(ops);
269 static void update_ftrace_function(void)
271 ftrace_func_t func;
274 * Prepare the ftrace_ops that the arch callback will use.
275 * If there's only one ftrace_ops registered, the ftrace_ops_list
276 * will point to the ops we want.
278 set_function_trace_op = ftrace_ops_list;
280 /* If there's no ftrace_ops registered, just call the stub function */
281 if (ftrace_ops_list == &ftrace_list_end) {
282 func = ftrace_stub;
285 * If we are at the end of the list and this ops is
286 * recursion safe and not dynamic and the arch supports passing ops,
287 * then have the mcount trampoline call the function directly.
289 } else if (ftrace_ops_list->next == &ftrace_list_end) {
290 func = ftrace_ops_get_list_func(ftrace_ops_list);
292 } else {
293 /* Just use the default ftrace_ops */
294 set_function_trace_op = &ftrace_list_end;
295 func = ftrace_ops_list_func;
298 update_function_graph_func();
300 /* If there's no change, then do nothing more here */
301 if (ftrace_trace_function == func)
302 return;
305 * If we are using the list function, it doesn't care
306 * about the function_trace_ops.
308 if (func == ftrace_ops_list_func) {
309 ftrace_trace_function = func;
311 * Don't even bother setting function_trace_ops,
312 * it would be racy to do so anyway.
314 return;
317 #ifndef CONFIG_DYNAMIC_FTRACE
319 * For static tracing, we need to be a bit more careful.
320 * The function change takes affect immediately. Thus,
321 * we need to coorditate the setting of the function_trace_ops
322 * with the setting of the ftrace_trace_function.
324 * Set the function to the list ops, which will call the
325 * function we want, albeit indirectly, but it handles the
326 * ftrace_ops and doesn't depend on function_trace_op.
328 ftrace_trace_function = ftrace_ops_list_func;
330 * Make sure all CPUs see this. Yes this is slow, but static
331 * tracing is slow and nasty to have enabled.
333 schedule_on_each_cpu(ftrace_sync);
334 /* Now all cpus are using the list ops. */
335 function_trace_op = set_function_trace_op;
336 /* Make sure the function_trace_op is visible on all CPUs */
337 smp_wmb();
338 /* Nasty way to force a rmb on all cpus */
339 smp_call_function(ftrace_sync_ipi, NULL, 1);
340 /* OK, we are all set to update the ftrace_trace_function now! */
341 #endif /* !CONFIG_DYNAMIC_FTRACE */
343 ftrace_trace_function = func;
346 int using_ftrace_ops_list_func(void)
348 return ftrace_trace_function == ftrace_ops_list_func;
351 static void add_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
353 ops->next = *list;
355 * We are entering ops into the list but another
356 * CPU might be walking that list. We need to make sure
357 * the ops->next pointer is valid before another CPU sees
358 * the ops pointer included into the list.
360 rcu_assign_pointer(*list, ops);
363 static int remove_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
365 struct ftrace_ops **p;
368 * If we are removing the last function, then simply point
369 * to the ftrace_stub.
371 if (*list == ops && ops->next == &ftrace_list_end) {
372 *list = &ftrace_list_end;
373 return 0;
376 for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
377 if (*p == ops)
378 break;
380 if (*p != ops)
381 return -1;
383 *p = (*p)->next;
384 return 0;
387 static void ftrace_update_trampoline(struct ftrace_ops *ops);
389 static int __register_ftrace_function(struct ftrace_ops *ops)
391 if (ops->flags & FTRACE_OPS_FL_DELETED)
392 return -EINVAL;
394 if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
395 return -EBUSY;
397 #ifndef CONFIG_DYNAMIC_FTRACE_WITH_REGS
399 * If the ftrace_ops specifies SAVE_REGS, then it only can be used
400 * if the arch supports it, or SAVE_REGS_IF_SUPPORTED is also set.
401 * Setting SAVE_REGS_IF_SUPPORTED makes SAVE_REGS irrelevant.
403 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS &&
404 !(ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED))
405 return -EINVAL;
407 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED)
408 ops->flags |= FTRACE_OPS_FL_SAVE_REGS;
409 #endif
411 if (!core_kernel_data((unsigned long)ops))
412 ops->flags |= FTRACE_OPS_FL_DYNAMIC;
414 if (ops->flags & FTRACE_OPS_FL_PER_CPU) {
415 if (per_cpu_ops_alloc(ops))
416 return -ENOMEM;
419 add_ftrace_ops(&ftrace_ops_list, ops);
421 /* Always save the function, and reset at unregistering */
422 ops->saved_func = ops->func;
424 if (ftrace_pids_enabled(ops))
425 ops->func = ftrace_pid_func;
427 ftrace_update_trampoline(ops);
429 if (ftrace_enabled)
430 update_ftrace_function();
432 return 0;
435 static int __unregister_ftrace_function(struct ftrace_ops *ops)
437 int ret;
439 if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
440 return -EBUSY;
442 ret = remove_ftrace_ops(&ftrace_ops_list, ops);
444 if (ret < 0)
445 return ret;
447 if (ftrace_enabled)
448 update_ftrace_function();
450 ops->func = ops->saved_func;
452 return 0;
455 static void ftrace_update_pid_func(void)
457 struct ftrace_ops *op;
459 /* Only do something if we are tracing something */
460 if (ftrace_trace_function == ftrace_stub)
461 return;
463 do_for_each_ftrace_op(op, ftrace_ops_list) {
464 if (op->flags & FTRACE_OPS_FL_PID) {
465 op->func = ftrace_pids_enabled(op) ?
466 ftrace_pid_func : op->saved_func;
467 ftrace_update_trampoline(op);
469 } while_for_each_ftrace_op(op);
471 update_ftrace_function();
474 #ifdef CONFIG_FUNCTION_PROFILER
475 struct ftrace_profile {
476 struct hlist_node node;
477 unsigned long ip;
478 unsigned long counter;
479 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
480 unsigned long long time;
481 unsigned long long time_squared;
482 #endif
485 struct ftrace_profile_page {
486 struct ftrace_profile_page *next;
487 unsigned long index;
488 struct ftrace_profile records[];
491 struct ftrace_profile_stat {
492 atomic_t disabled;
493 struct hlist_head *hash;
494 struct ftrace_profile_page *pages;
495 struct ftrace_profile_page *start;
496 struct tracer_stat stat;
499 #define PROFILE_RECORDS_SIZE \
500 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
502 #define PROFILES_PER_PAGE \
503 (PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
505 static int ftrace_profile_enabled __read_mostly;
507 /* ftrace_profile_lock - synchronize the enable and disable of the profiler */
508 static DEFINE_MUTEX(ftrace_profile_lock);
510 static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
512 #define FTRACE_PROFILE_HASH_BITS 10
513 #define FTRACE_PROFILE_HASH_SIZE (1 << FTRACE_PROFILE_HASH_BITS)
515 static void *
516 function_stat_next(void *v, int idx)
518 struct ftrace_profile *rec = v;
519 struct ftrace_profile_page *pg;
521 pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
523 again:
524 if (idx != 0)
525 rec++;
527 if ((void *)rec >= (void *)&pg->records[pg->index]) {
528 pg = pg->next;
529 if (!pg)
530 return NULL;
531 rec = &pg->records[0];
532 if (!rec->counter)
533 goto again;
536 return rec;
539 static void *function_stat_start(struct tracer_stat *trace)
541 struct ftrace_profile_stat *stat =
542 container_of(trace, struct ftrace_profile_stat, stat);
544 if (!stat || !stat->start)
545 return NULL;
547 return function_stat_next(&stat->start->records[0], 0);
550 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
551 /* function graph compares on total time */
552 static int function_stat_cmp(void *p1, void *p2)
554 struct ftrace_profile *a = p1;
555 struct ftrace_profile *b = p2;
557 if (a->time < b->time)
558 return -1;
559 if (a->time > b->time)
560 return 1;
561 else
562 return 0;
564 #else
565 /* not function graph compares against hits */
566 static int function_stat_cmp(void *p1, void *p2)
568 struct ftrace_profile *a = p1;
569 struct ftrace_profile *b = p2;
571 if (a->counter < b->counter)
572 return -1;
573 if (a->counter > b->counter)
574 return 1;
575 else
576 return 0;
578 #endif
580 static int function_stat_headers(struct seq_file *m)
582 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
583 seq_puts(m, " Function "
584 "Hit Time Avg s^2\n"
585 " -------- "
586 "--- ---- --- ---\n");
587 #else
588 seq_puts(m, " Function Hit\n"
589 " -------- ---\n");
590 #endif
591 return 0;
594 static int function_stat_show(struct seq_file *m, void *v)
596 struct ftrace_profile *rec = v;
597 char str[KSYM_SYMBOL_LEN];
598 int ret = 0;
599 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
600 static struct trace_seq s;
601 unsigned long long avg;
602 unsigned long long stddev;
603 #endif
604 mutex_lock(&ftrace_profile_lock);
606 /* we raced with function_profile_reset() */
607 if (unlikely(rec->counter == 0)) {
608 ret = -EBUSY;
609 goto out;
612 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
613 avg = rec->time;
614 do_div(avg, rec->counter);
615 if (tracing_thresh && (avg < tracing_thresh))
616 goto out;
617 #endif
619 kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
620 seq_printf(m, " %-30.30s %10lu", str, rec->counter);
622 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
623 seq_puts(m, " ");
625 /* Sample standard deviation (s^2) */
626 if (rec->counter <= 1)
627 stddev = 0;
628 else {
630 * Apply Welford's method:
631 * s^2 = 1 / (n * (n-1)) * (n * \Sum (x_i)^2 - (\Sum x_i)^2)
633 stddev = rec->counter * rec->time_squared -
634 rec->time * rec->time;
637 * Divide only 1000 for ns^2 -> us^2 conversion.
638 * trace_print_graph_duration will divide 1000 again.
640 do_div(stddev, rec->counter * (rec->counter - 1) * 1000);
643 trace_seq_init(&s);
644 trace_print_graph_duration(rec->time, &s);
645 trace_seq_puts(&s, " ");
646 trace_print_graph_duration(avg, &s);
647 trace_seq_puts(&s, " ");
648 trace_print_graph_duration(stddev, &s);
649 trace_print_seq(m, &s);
650 #endif
651 seq_putc(m, '\n');
652 out:
653 mutex_unlock(&ftrace_profile_lock);
655 return ret;
658 static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
660 struct ftrace_profile_page *pg;
662 pg = stat->pages = stat->start;
664 while (pg) {
665 memset(pg->records, 0, PROFILE_RECORDS_SIZE);
666 pg->index = 0;
667 pg = pg->next;
670 memset(stat->hash, 0,
671 FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
674 int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
676 struct ftrace_profile_page *pg;
677 int functions;
678 int pages;
679 int i;
681 /* If we already allocated, do nothing */
682 if (stat->pages)
683 return 0;
685 stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
686 if (!stat->pages)
687 return -ENOMEM;
689 #ifdef CONFIG_DYNAMIC_FTRACE
690 functions = ftrace_update_tot_cnt;
691 #else
693 * We do not know the number of functions that exist because
694 * dynamic tracing is what counts them. With past experience
695 * we have around 20K functions. That should be more than enough.
696 * It is highly unlikely we will execute every function in
697 * the kernel.
699 functions = 20000;
700 #endif
702 pg = stat->start = stat->pages;
704 pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);
706 for (i = 1; i < pages; i++) {
707 pg->next = (void *)get_zeroed_page(GFP_KERNEL);
708 if (!pg->next)
709 goto out_free;
710 pg = pg->next;
713 return 0;
715 out_free:
716 pg = stat->start;
717 while (pg) {
718 unsigned long tmp = (unsigned long)pg;
720 pg = pg->next;
721 free_page(tmp);
724 stat->pages = NULL;
725 stat->start = NULL;
727 return -ENOMEM;
730 static int ftrace_profile_init_cpu(int cpu)
732 struct ftrace_profile_stat *stat;
733 int size;
735 stat = &per_cpu(ftrace_profile_stats, cpu);
737 if (stat->hash) {
738 /* If the profile is already created, simply reset it */
739 ftrace_profile_reset(stat);
740 return 0;
744 * We are profiling all functions, but usually only a few thousand
745 * functions are hit. We'll make a hash of 1024 items.
747 size = FTRACE_PROFILE_HASH_SIZE;
749 stat->hash = kzalloc(sizeof(struct hlist_head) * size, GFP_KERNEL);
751 if (!stat->hash)
752 return -ENOMEM;
754 /* Preallocate the function profiling pages */
755 if (ftrace_profile_pages_init(stat) < 0) {
756 kfree(stat->hash);
757 stat->hash = NULL;
758 return -ENOMEM;
761 return 0;
764 static int ftrace_profile_init(void)
766 int cpu;
767 int ret = 0;
769 for_each_possible_cpu(cpu) {
770 ret = ftrace_profile_init_cpu(cpu);
771 if (ret)
772 break;
775 return ret;
778 /* interrupts must be disabled */
779 static struct ftrace_profile *
780 ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
782 struct ftrace_profile *rec;
783 struct hlist_head *hhd;
784 unsigned long key;
786 key = hash_long(ip, FTRACE_PROFILE_HASH_BITS);
787 hhd = &stat->hash[key];
789 if (hlist_empty(hhd))
790 return NULL;
792 hlist_for_each_entry_rcu_notrace(rec, hhd, node) {
793 if (rec->ip == ip)
794 return rec;
797 return NULL;
800 static void ftrace_add_profile(struct ftrace_profile_stat *stat,
801 struct ftrace_profile *rec)
803 unsigned long key;
805 key = hash_long(rec->ip, FTRACE_PROFILE_HASH_BITS);
806 hlist_add_head_rcu(&rec->node, &stat->hash[key]);
810 * The memory is already allocated, this simply finds a new record to use.
812 static struct ftrace_profile *
813 ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
815 struct ftrace_profile *rec = NULL;
817 /* prevent recursion (from NMIs) */
818 if (atomic_inc_return(&stat->disabled) != 1)
819 goto out;
822 * Try to find the function again since an NMI
823 * could have added it
825 rec = ftrace_find_profiled_func(stat, ip);
826 if (rec)
827 goto out;
829 if (stat->pages->index == PROFILES_PER_PAGE) {
830 if (!stat->pages->next)
831 goto out;
832 stat->pages = stat->pages->next;
835 rec = &stat->pages->records[stat->pages->index++];
836 rec->ip = ip;
837 ftrace_add_profile(stat, rec);
839 out:
840 atomic_dec(&stat->disabled);
842 return rec;
845 static void
846 function_profile_call(unsigned long ip, unsigned long parent_ip,
847 struct ftrace_ops *ops, struct pt_regs *regs)
849 struct ftrace_profile_stat *stat;
850 struct ftrace_profile *rec;
851 unsigned long flags;
853 if (!ftrace_profile_enabled)
854 return;
856 local_irq_save(flags);
858 stat = this_cpu_ptr(&ftrace_profile_stats);
859 if (!stat->hash || !ftrace_profile_enabled)
860 goto out;
862 rec = ftrace_find_profiled_func(stat, ip);
863 if (!rec) {
864 rec = ftrace_profile_alloc(stat, ip);
865 if (!rec)
866 goto out;
869 rec->counter++;
870 out:
871 local_irq_restore(flags);
874 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
875 static int profile_graph_entry(struct ftrace_graph_ent *trace)
877 int index = trace->depth;
879 function_profile_call(trace->func, 0, NULL, NULL);
881 if (index >= 0 && index < FTRACE_RETFUNC_DEPTH)
882 current->ret_stack[index].subtime = 0;
884 return 1;
887 static void profile_graph_return(struct ftrace_graph_ret *trace)
889 struct ftrace_profile_stat *stat;
890 unsigned long long calltime;
891 struct ftrace_profile *rec;
892 unsigned long flags;
894 local_irq_save(flags);
895 stat = this_cpu_ptr(&ftrace_profile_stats);
896 if (!stat->hash || !ftrace_profile_enabled)
897 goto out;
899 /* If the calltime was zero'd ignore it */
900 if (!trace->calltime)
901 goto out;
903 calltime = trace->rettime - trace->calltime;
905 if (!fgraph_graph_time) {
906 int index;
908 index = trace->depth;
910 /* Append this call time to the parent time to subtract */
911 if (index)
912 current->ret_stack[index - 1].subtime += calltime;
914 if (current->ret_stack[index].subtime < calltime)
915 calltime -= current->ret_stack[index].subtime;
916 else
917 calltime = 0;
920 rec = ftrace_find_profiled_func(stat, trace->func);
921 if (rec) {
922 rec->time += calltime;
923 rec->time_squared += calltime * calltime;
926 out:
927 local_irq_restore(flags);
930 static int register_ftrace_profiler(void)
932 return register_ftrace_graph(&profile_graph_return,
933 &profile_graph_entry);
936 static void unregister_ftrace_profiler(void)
938 unregister_ftrace_graph();
940 #else
941 static struct ftrace_ops ftrace_profile_ops __read_mostly = {
942 .func = function_profile_call,
943 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
944 INIT_OPS_HASH(ftrace_profile_ops)
947 static int register_ftrace_profiler(void)
949 return register_ftrace_function(&ftrace_profile_ops);
952 static void unregister_ftrace_profiler(void)
954 unregister_ftrace_function(&ftrace_profile_ops);
956 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
958 static ssize_t
959 ftrace_profile_write(struct file *filp, const char __user *ubuf,
960 size_t cnt, loff_t *ppos)
962 unsigned long val;
963 int ret;
965 ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
966 if (ret)
967 return ret;
969 val = !!val;
971 mutex_lock(&ftrace_profile_lock);
972 if (ftrace_profile_enabled ^ val) {
973 if (val) {
974 ret = ftrace_profile_init();
975 if (ret < 0) {
976 cnt = ret;
977 goto out;
980 ret = register_ftrace_profiler();
981 if (ret < 0) {
982 cnt = ret;
983 goto out;
985 ftrace_profile_enabled = 1;
986 } else {
987 ftrace_profile_enabled = 0;
989 * unregister_ftrace_profiler calls stop_machine
990 * so this acts like an synchronize_sched.
992 unregister_ftrace_profiler();
995 out:
996 mutex_unlock(&ftrace_profile_lock);
998 *ppos += cnt;
1000 return cnt;
1003 static ssize_t
1004 ftrace_profile_read(struct file *filp, char __user *ubuf,
1005 size_t cnt, loff_t *ppos)
1007 char buf[64]; /* big enough to hold a number */
1008 int r;
1010 r = sprintf(buf, "%u\n", ftrace_profile_enabled);
1011 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
1014 static const struct file_operations ftrace_profile_fops = {
1015 .open = tracing_open_generic,
1016 .read = ftrace_profile_read,
1017 .write = ftrace_profile_write,
1018 .llseek = default_llseek,
1021 /* used to initialize the real stat files */
1022 static struct tracer_stat function_stats __initdata = {
1023 .name = "functions",
1024 .stat_start = function_stat_start,
1025 .stat_next = function_stat_next,
1026 .stat_cmp = function_stat_cmp,
1027 .stat_headers = function_stat_headers,
1028 .stat_show = function_stat_show
1031 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1033 struct ftrace_profile_stat *stat;
1034 struct dentry *entry;
1035 char *name;
1036 int ret;
1037 int cpu;
1039 for_each_possible_cpu(cpu) {
1040 stat = &per_cpu(ftrace_profile_stats, cpu);
1042 name = kasprintf(GFP_KERNEL, "function%d", cpu);
1043 if (!name) {
1045 * The files created are permanent, if something happens
1046 * we still do not free memory.
1048 WARN(1,
1049 "Could not allocate stat file for cpu %d\n",
1050 cpu);
1051 return;
1053 stat->stat = function_stats;
1054 stat->stat.name = name;
1055 ret = register_stat_tracer(&stat->stat);
1056 if (ret) {
1057 WARN(1,
1058 "Could not register function stat for cpu %d\n",
1059 cpu);
1060 kfree(name);
1061 return;
1065 entry = tracefs_create_file("function_profile_enabled", 0644,
1066 d_tracer, NULL, &ftrace_profile_fops);
1067 if (!entry)
1068 pr_warn("Could not create tracefs 'function_profile_enabled' entry\n");
1071 #else /* CONFIG_FUNCTION_PROFILER */
1072 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1075 #endif /* CONFIG_FUNCTION_PROFILER */
1077 static struct pid * const ftrace_swapper_pid = &init_struct_pid;
1079 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
1080 static int ftrace_graph_active;
1081 #else
1082 # define ftrace_graph_active 0
1083 #endif
1085 #ifdef CONFIG_DYNAMIC_FTRACE
1087 static struct ftrace_ops *removed_ops;
1090 * Set when doing a global update, like enabling all recs or disabling them.
1091 * It is not set when just updating a single ftrace_ops.
1093 static bool update_all_ops;
1095 #ifndef CONFIG_FTRACE_MCOUNT_RECORD
1096 # error Dynamic ftrace depends on MCOUNT_RECORD
1097 #endif
1099 struct ftrace_func_entry {
1100 struct hlist_node hlist;
1101 unsigned long ip;
1104 struct ftrace_func_probe {
1105 struct ftrace_probe_ops *probe_ops;
1106 struct ftrace_ops ops;
1107 struct trace_array *tr;
1108 struct list_head list;
1109 void *data;
1110 int ref;
1114 * We make these constant because no one should touch them,
1115 * but they are used as the default "empty hash", to avoid allocating
1116 * it all the time. These are in a read only section such that if
1117 * anyone does try to modify it, it will cause an exception.
1119 static const struct hlist_head empty_buckets[1];
1120 static const struct ftrace_hash empty_hash = {
1121 .buckets = (struct hlist_head *)empty_buckets,
1123 #define EMPTY_HASH ((struct ftrace_hash *)&empty_hash)
1125 static struct ftrace_ops global_ops = {
1126 .func = ftrace_stub,
1127 .local_hash.notrace_hash = EMPTY_HASH,
1128 .local_hash.filter_hash = EMPTY_HASH,
1129 INIT_OPS_HASH(global_ops)
1130 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
1131 FTRACE_OPS_FL_INITIALIZED |
1132 FTRACE_OPS_FL_PID,
1136 * This is used by __kernel_text_address() to return true if the
1137 * address is on a dynamically allocated trampoline that would
1138 * not return true for either core_kernel_text() or
1139 * is_module_text_address().
1141 bool is_ftrace_trampoline(unsigned long addr)
1143 struct ftrace_ops *op;
1144 bool ret = false;
1147 * Some of the ops may be dynamically allocated,
1148 * they are freed after a synchronize_sched().
1150 preempt_disable_notrace();
1152 do_for_each_ftrace_op(op, ftrace_ops_list) {
1154 * This is to check for dynamically allocated trampolines.
1155 * Trampolines that are in kernel text will have
1156 * core_kernel_text() return true.
1158 if (op->trampoline && op->trampoline_size)
1159 if (addr >= op->trampoline &&
1160 addr < op->trampoline + op->trampoline_size) {
1161 ret = true;
1162 goto out;
1164 } while_for_each_ftrace_op(op);
1166 out:
1167 preempt_enable_notrace();
1169 return ret;
1172 struct ftrace_page {
1173 struct ftrace_page *next;
1174 struct dyn_ftrace *records;
1175 int index;
1176 int size;
1179 #define ENTRY_SIZE sizeof(struct dyn_ftrace)
1180 #define ENTRIES_PER_PAGE (PAGE_SIZE / ENTRY_SIZE)
1182 /* estimate from running different kernels */
1183 #define NR_TO_INIT 10000
1185 static struct ftrace_page *ftrace_pages_start;
1186 static struct ftrace_page *ftrace_pages;
1188 static __always_inline unsigned long
1189 ftrace_hash_key(struct ftrace_hash *hash, unsigned long ip)
1191 if (hash->size_bits > 0)
1192 return hash_long(ip, hash->size_bits);
1194 return 0;
1197 /* Only use this function if ftrace_hash_empty() has already been tested */
1198 static __always_inline struct ftrace_func_entry *
1199 __ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1201 unsigned long key;
1202 struct ftrace_func_entry *entry;
1203 struct hlist_head *hhd;
1205 key = ftrace_hash_key(hash, ip);
1206 hhd = &hash->buckets[key];
1208 hlist_for_each_entry_rcu_notrace(entry, hhd, hlist) {
1209 if (entry->ip == ip)
1210 return entry;
1212 return NULL;
1216 * ftrace_lookup_ip - Test to see if an ip exists in an ftrace_hash
1217 * @hash: The hash to look at
1218 * @ip: The instruction pointer to test
1220 * Search a given @hash to see if a given instruction pointer (@ip)
1221 * exists in it.
1223 * Returns the entry that holds the @ip if found. NULL otherwise.
1225 struct ftrace_func_entry *
1226 ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1228 if (ftrace_hash_empty(hash))
1229 return NULL;
1231 return __ftrace_lookup_ip(hash, ip);
1234 static void __add_hash_entry(struct ftrace_hash *hash,
1235 struct ftrace_func_entry *entry)
1237 struct hlist_head *hhd;
1238 unsigned long key;
1240 key = ftrace_hash_key(hash, entry->ip);
1241 hhd = &hash->buckets[key];
1242 hlist_add_head(&entry->hlist, hhd);
1243 hash->count++;
1246 static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
1248 struct ftrace_func_entry *entry;
1250 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
1251 if (!entry)
1252 return -ENOMEM;
1254 entry->ip = ip;
1255 __add_hash_entry(hash, entry);
1257 return 0;
1260 static void
1261 free_hash_entry(struct ftrace_hash *hash,
1262 struct ftrace_func_entry *entry)
1264 hlist_del(&entry->hlist);
1265 kfree(entry);
1266 hash->count--;
1269 static void
1270 remove_hash_entry(struct ftrace_hash *hash,
1271 struct ftrace_func_entry *entry)
1273 hlist_del_rcu(&entry->hlist);
1274 hash->count--;
1277 static void ftrace_hash_clear(struct ftrace_hash *hash)
1279 struct hlist_head *hhd;
1280 struct hlist_node *tn;
1281 struct ftrace_func_entry *entry;
1282 int size = 1 << hash->size_bits;
1283 int i;
1285 if (!hash->count)
1286 return;
1288 for (i = 0; i < size; i++) {
1289 hhd = &hash->buckets[i];
1290 hlist_for_each_entry_safe(entry, tn, hhd, hlist)
1291 free_hash_entry(hash, entry);
1293 FTRACE_WARN_ON(hash->count);
1296 static void free_ftrace_mod(struct ftrace_mod_load *ftrace_mod)
1298 list_del(&ftrace_mod->list);
1299 kfree(ftrace_mod->module);
1300 kfree(ftrace_mod->func);
1301 kfree(ftrace_mod);
1304 static void clear_ftrace_mod_list(struct list_head *head)
1306 struct ftrace_mod_load *p, *n;
1308 /* stack tracer isn't supported yet */
1309 if (!head)
1310 return;
1312 mutex_lock(&ftrace_lock);
1313 list_for_each_entry_safe(p, n, head, list)
1314 free_ftrace_mod(p);
1315 mutex_unlock(&ftrace_lock);
1318 static void free_ftrace_hash(struct ftrace_hash *hash)
1320 if (!hash || hash == EMPTY_HASH)
1321 return;
1322 ftrace_hash_clear(hash);
1323 kfree(hash->buckets);
1324 kfree(hash);
1327 static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
1329 struct ftrace_hash *hash;
1331 hash = container_of(rcu, struct ftrace_hash, rcu);
1332 free_ftrace_hash(hash);
1335 static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
1337 if (!hash || hash == EMPTY_HASH)
1338 return;
1339 call_rcu_sched(&hash->rcu, __free_ftrace_hash_rcu);
1342 void ftrace_free_filter(struct ftrace_ops *ops)
1344 ftrace_ops_init(ops);
1345 free_ftrace_hash(ops->func_hash->filter_hash);
1346 free_ftrace_hash(ops->func_hash->notrace_hash);
1349 static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
1351 struct ftrace_hash *hash;
1352 int size;
1354 hash = kzalloc(sizeof(*hash), GFP_KERNEL);
1355 if (!hash)
1356 return NULL;
1358 size = 1 << size_bits;
1359 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL);
1361 if (!hash->buckets) {
1362 kfree(hash);
1363 return NULL;
1366 hash->size_bits = size_bits;
1368 return hash;
1372 static int ftrace_add_mod(struct trace_array *tr,
1373 const char *func, const char *module,
1374 int enable)
1376 struct ftrace_mod_load *ftrace_mod;
1377 struct list_head *mod_head = enable ? &tr->mod_trace : &tr->mod_notrace;
1379 ftrace_mod = kzalloc(sizeof(*ftrace_mod), GFP_KERNEL);
1380 if (!ftrace_mod)
1381 return -ENOMEM;
1383 ftrace_mod->func = kstrdup(func, GFP_KERNEL);
1384 ftrace_mod->module = kstrdup(module, GFP_KERNEL);
1385 ftrace_mod->enable = enable;
1387 if (!ftrace_mod->func || !ftrace_mod->module)
1388 goto out_free;
1390 list_add(&ftrace_mod->list, mod_head);
1392 return 0;
1394 out_free:
1395 free_ftrace_mod(ftrace_mod);
1397 return -ENOMEM;
1400 static struct ftrace_hash *
1401 alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
1403 struct ftrace_func_entry *entry;
1404 struct ftrace_hash *new_hash;
1405 int size;
1406 int ret;
1407 int i;
1409 new_hash = alloc_ftrace_hash(size_bits);
1410 if (!new_hash)
1411 return NULL;
1413 if (hash)
1414 new_hash->flags = hash->flags;
1416 /* Empty hash? */
1417 if (ftrace_hash_empty(hash))
1418 return new_hash;
1420 size = 1 << hash->size_bits;
1421 for (i = 0; i < size; i++) {
1422 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
1423 ret = add_hash_entry(new_hash, entry->ip);
1424 if (ret < 0)
1425 goto free_hash;
1429 FTRACE_WARN_ON(new_hash->count != hash->count);
1431 return new_hash;
1433 free_hash:
1434 free_ftrace_hash(new_hash);
1435 return NULL;
1438 static void
1439 ftrace_hash_rec_disable_modify(struct ftrace_ops *ops, int filter_hash);
1440 static void
1441 ftrace_hash_rec_enable_modify(struct ftrace_ops *ops, int filter_hash);
1443 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1444 struct ftrace_hash *new_hash);
1446 static struct ftrace_hash *
1447 __ftrace_hash_move(struct ftrace_hash *src)
1449 struct ftrace_func_entry *entry;
1450 struct hlist_node *tn;
1451 struct hlist_head *hhd;
1452 struct ftrace_hash *new_hash;
1453 int size = src->count;
1454 int bits = 0;
1455 int i;
1458 * If the new source is empty, just return the empty_hash.
1460 if (ftrace_hash_empty(src))
1461 return EMPTY_HASH;
1464 * Make the hash size about 1/2 the # found
1466 for (size /= 2; size; size >>= 1)
1467 bits++;
1469 /* Don't allocate too much */
1470 if (bits > FTRACE_HASH_MAX_BITS)
1471 bits = FTRACE_HASH_MAX_BITS;
1473 new_hash = alloc_ftrace_hash(bits);
1474 if (!new_hash)
1475 return NULL;
1477 new_hash->flags = src->flags;
1479 size = 1 << src->size_bits;
1480 for (i = 0; i < size; i++) {
1481 hhd = &src->buckets[i];
1482 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1483 remove_hash_entry(src, entry);
1484 __add_hash_entry(new_hash, entry);
1488 return new_hash;
1491 static int
1492 ftrace_hash_move(struct ftrace_ops *ops, int enable,
1493 struct ftrace_hash **dst, struct ftrace_hash *src)
1495 struct ftrace_hash *new_hash;
1496 int ret;
1498 /* Reject setting notrace hash on IPMODIFY ftrace_ops */
1499 if (ops->flags & FTRACE_OPS_FL_IPMODIFY && !enable)
1500 return -EINVAL;
1502 new_hash = __ftrace_hash_move(src);
1503 if (!new_hash)
1504 return -ENOMEM;
1506 /* Make sure this can be applied if it is IPMODIFY ftrace_ops */
1507 if (enable) {
1508 /* IPMODIFY should be updated only when filter_hash updating */
1509 ret = ftrace_hash_ipmodify_update(ops, new_hash);
1510 if (ret < 0) {
1511 free_ftrace_hash(new_hash);
1512 return ret;
1517 * Remove the current set, update the hash and add
1518 * them back.
1520 ftrace_hash_rec_disable_modify(ops, enable);
1522 rcu_assign_pointer(*dst, new_hash);
1524 ftrace_hash_rec_enable_modify(ops, enable);
1526 return 0;
1529 static bool hash_contains_ip(unsigned long ip,
1530 struct ftrace_ops_hash *hash)
1533 * The function record is a match if it exists in the filter
1534 * hash and not in the notrace hash. Note, an emty hash is
1535 * considered a match for the filter hash, but an empty
1536 * notrace hash is considered not in the notrace hash.
1538 return (ftrace_hash_empty(hash->filter_hash) ||
1539 __ftrace_lookup_ip(hash->filter_hash, ip)) &&
1540 (ftrace_hash_empty(hash->notrace_hash) ||
1541 !__ftrace_lookup_ip(hash->notrace_hash, ip));
1545 * Test the hashes for this ops to see if we want to call
1546 * the ops->func or not.
1548 * It's a match if the ip is in the ops->filter_hash or
1549 * the filter_hash does not exist or is empty,
1550 * AND
1551 * the ip is not in the ops->notrace_hash.
1553 * This needs to be called with preemption disabled as
1554 * the hashes are freed with call_rcu_sched().
1556 static int
1557 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1559 struct ftrace_ops_hash hash;
1560 int ret;
1562 #ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1564 * There's a small race when adding ops that the ftrace handler
1565 * that wants regs, may be called without them. We can not
1566 * allow that handler to be called if regs is NULL.
1568 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1569 return 0;
1570 #endif
1572 hash.filter_hash = rcu_dereference_raw_notrace(ops->func_hash->filter_hash);
1573 hash.notrace_hash = rcu_dereference_raw_notrace(ops->func_hash->notrace_hash);
1575 if (hash_contains_ip(ip, &hash))
1576 ret = 1;
1577 else
1578 ret = 0;
1580 return ret;
1584 * This is a double for. Do not use 'break' to break out of the loop,
1585 * you must use a goto.
1587 #define do_for_each_ftrace_rec(pg, rec) \
1588 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1589 int _____i; \
1590 for (_____i = 0; _____i < pg->index; _____i++) { \
1591 rec = &pg->records[_____i];
1593 #define while_for_each_ftrace_rec() \
1598 static int ftrace_cmp_recs(const void *a, const void *b)
1600 const struct dyn_ftrace *key = a;
1601 const struct dyn_ftrace *rec = b;
1603 if (key->flags < rec->ip)
1604 return -1;
1605 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1606 return 1;
1607 return 0;
1611 * ftrace_location_range - return the first address of a traced location
1612 * if it touches the given ip range
1613 * @start: start of range to search.
1614 * @end: end of range to search (inclusive). @end points to the last byte
1615 * to check.
1617 * Returns rec->ip if the related ftrace location is a least partly within
1618 * the given address range. That is, the first address of the instruction
1619 * that is either a NOP or call to the function tracer. It checks the ftrace
1620 * internal tables to determine if the address belongs or not.
1622 unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1624 struct ftrace_page *pg;
1625 struct dyn_ftrace *rec;
1626 struct dyn_ftrace key;
1628 key.ip = start;
1629 key.flags = end; /* overload flags, as it is unsigned long */
1631 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1632 if (end < pg->records[0].ip ||
1633 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1634 continue;
1635 rec = bsearch(&key, pg->records, pg->index,
1636 sizeof(struct dyn_ftrace),
1637 ftrace_cmp_recs);
1638 if (rec)
1639 return rec->ip;
1642 return 0;
1646 * ftrace_location - return true if the ip giving is a traced location
1647 * @ip: the instruction pointer to check
1649 * Returns rec->ip if @ip given is a pointer to a ftrace location.
1650 * That is, the instruction that is either a NOP or call to
1651 * the function tracer. It checks the ftrace internal tables to
1652 * determine if the address belongs or not.
1654 unsigned long ftrace_location(unsigned long ip)
1656 return ftrace_location_range(ip, ip);
1660 * ftrace_text_reserved - return true if range contains an ftrace location
1661 * @start: start of range to search
1662 * @end: end of range to search (inclusive). @end points to the last byte to check.
1664 * Returns 1 if @start and @end contains a ftrace location.
1665 * That is, the instruction that is either a NOP or call to
1666 * the function tracer. It checks the ftrace internal tables to
1667 * determine if the address belongs or not.
1669 int ftrace_text_reserved(const void *start, const void *end)
1671 unsigned long ret;
1673 ret = ftrace_location_range((unsigned long)start,
1674 (unsigned long)end);
1676 return (int)!!ret;
1679 /* Test if ops registered to this rec needs regs */
1680 static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1682 struct ftrace_ops *ops;
1683 bool keep_regs = false;
1685 for (ops = ftrace_ops_list;
1686 ops != &ftrace_list_end; ops = ops->next) {
1687 /* pass rec in as regs to have non-NULL val */
1688 if (ftrace_ops_test(ops, rec->ip, rec)) {
1689 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1690 keep_regs = true;
1691 break;
1696 return keep_regs;
1699 static bool __ftrace_hash_rec_update(struct ftrace_ops *ops,
1700 int filter_hash,
1701 bool inc)
1703 struct ftrace_hash *hash;
1704 struct ftrace_hash *other_hash;
1705 struct ftrace_page *pg;
1706 struct dyn_ftrace *rec;
1707 bool update = false;
1708 int count = 0;
1709 int all = false;
1711 /* Only update if the ops has been registered */
1712 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1713 return false;
1716 * In the filter_hash case:
1717 * If the count is zero, we update all records.
1718 * Otherwise we just update the items in the hash.
1720 * In the notrace_hash case:
1721 * We enable the update in the hash.
1722 * As disabling notrace means enabling the tracing,
1723 * and enabling notrace means disabling, the inc variable
1724 * gets inversed.
1726 if (filter_hash) {
1727 hash = ops->func_hash->filter_hash;
1728 other_hash = ops->func_hash->notrace_hash;
1729 if (ftrace_hash_empty(hash))
1730 all = true;
1731 } else {
1732 inc = !inc;
1733 hash = ops->func_hash->notrace_hash;
1734 other_hash = ops->func_hash->filter_hash;
1736 * If the notrace hash has no items,
1737 * then there's nothing to do.
1739 if (ftrace_hash_empty(hash))
1740 return false;
1743 do_for_each_ftrace_rec(pg, rec) {
1744 int in_other_hash = 0;
1745 int in_hash = 0;
1746 int match = 0;
1748 if (rec->flags & FTRACE_FL_DISABLED)
1749 continue;
1751 if (all) {
1753 * Only the filter_hash affects all records.
1754 * Update if the record is not in the notrace hash.
1756 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1757 match = 1;
1758 } else {
1759 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1760 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1763 * If filter_hash is set, we want to match all functions
1764 * that are in the hash but not in the other hash.
1766 * If filter_hash is not set, then we are decrementing.
1767 * That means we match anything that is in the hash
1768 * and also in the other_hash. That is, we need to turn
1769 * off functions in the other hash because they are disabled
1770 * by this hash.
1772 if (filter_hash && in_hash && !in_other_hash)
1773 match = 1;
1774 else if (!filter_hash && in_hash &&
1775 (in_other_hash || ftrace_hash_empty(other_hash)))
1776 match = 1;
1778 if (!match)
1779 continue;
1781 if (inc) {
1782 rec->flags++;
1783 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1784 return false;
1787 * If there's only a single callback registered to a
1788 * function, and the ops has a trampoline registered
1789 * for it, then we can call it directly.
1791 if (ftrace_rec_count(rec) == 1 && ops->trampoline)
1792 rec->flags |= FTRACE_FL_TRAMP;
1793 else
1795 * If we are adding another function callback
1796 * to this function, and the previous had a
1797 * custom trampoline in use, then we need to go
1798 * back to the default trampoline.
1800 rec->flags &= ~FTRACE_FL_TRAMP;
1803 * If any ops wants regs saved for this function
1804 * then all ops will get saved regs.
1806 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1807 rec->flags |= FTRACE_FL_REGS;
1808 } else {
1809 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1810 return false;
1811 rec->flags--;
1814 * If the rec had REGS enabled and the ops that is
1815 * being removed had REGS set, then see if there is
1816 * still any ops for this record that wants regs.
1817 * If not, we can stop recording them.
1819 if (ftrace_rec_count(rec) > 0 &&
1820 rec->flags & FTRACE_FL_REGS &&
1821 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1822 if (!test_rec_ops_needs_regs(rec))
1823 rec->flags &= ~FTRACE_FL_REGS;
1827 * If the rec had TRAMP enabled, then it needs to
1828 * be cleared. As TRAMP can only be enabled iff
1829 * there is only a single ops attached to it.
1830 * In otherwords, always disable it on decrementing.
1831 * In the future, we may set it if rec count is
1832 * decremented to one, and the ops that is left
1833 * has a trampoline.
1835 rec->flags &= ~FTRACE_FL_TRAMP;
1838 * flags will be cleared in ftrace_check_record()
1839 * if rec count is zero.
1842 count++;
1844 /* Must match FTRACE_UPDATE_CALLS in ftrace_modify_all_code() */
1845 update |= ftrace_test_record(rec, 1) != FTRACE_UPDATE_IGNORE;
1847 /* Shortcut, if we handled all records, we are done. */
1848 if (!all && count == hash->count)
1849 return update;
1850 } while_for_each_ftrace_rec();
1852 return update;
1855 static bool ftrace_hash_rec_disable(struct ftrace_ops *ops,
1856 int filter_hash)
1858 return __ftrace_hash_rec_update(ops, filter_hash, 0);
1861 static bool ftrace_hash_rec_enable(struct ftrace_ops *ops,
1862 int filter_hash)
1864 return __ftrace_hash_rec_update(ops, filter_hash, 1);
1867 static void ftrace_hash_rec_update_modify(struct ftrace_ops *ops,
1868 int filter_hash, int inc)
1870 struct ftrace_ops *op;
1872 __ftrace_hash_rec_update(ops, filter_hash, inc);
1874 if (ops->func_hash != &global_ops.local_hash)
1875 return;
1878 * If the ops shares the global_ops hash, then we need to update
1879 * all ops that are enabled and use this hash.
1881 do_for_each_ftrace_op(op, ftrace_ops_list) {
1882 /* Already done */
1883 if (op == ops)
1884 continue;
1885 if (op->func_hash == &global_ops.local_hash)
1886 __ftrace_hash_rec_update(op, filter_hash, inc);
1887 } while_for_each_ftrace_op(op);
1890 static void ftrace_hash_rec_disable_modify(struct ftrace_ops *ops,
1891 int filter_hash)
1893 ftrace_hash_rec_update_modify(ops, filter_hash, 0);
1896 static void ftrace_hash_rec_enable_modify(struct ftrace_ops *ops,
1897 int filter_hash)
1899 ftrace_hash_rec_update_modify(ops, filter_hash, 1);
1903 * Try to update IPMODIFY flag on each ftrace_rec. Return 0 if it is OK
1904 * or no-needed to update, -EBUSY if it detects a conflict of the flag
1905 * on a ftrace_rec, and -EINVAL if the new_hash tries to trace all recs.
1906 * Note that old_hash and new_hash has below meanings
1907 * - If the hash is NULL, it hits all recs (if IPMODIFY is set, this is rejected)
1908 * - If the hash is EMPTY_HASH, it hits nothing
1909 * - Anything else hits the recs which match the hash entries.
1911 static int __ftrace_hash_update_ipmodify(struct ftrace_ops *ops,
1912 struct ftrace_hash *old_hash,
1913 struct ftrace_hash *new_hash)
1915 struct ftrace_page *pg;
1916 struct dyn_ftrace *rec, *end = NULL;
1917 int in_old, in_new;
1919 /* Only update if the ops has been registered */
1920 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1921 return 0;
1923 if (!(ops->flags & FTRACE_OPS_FL_IPMODIFY))
1924 return 0;
1927 * Since the IPMODIFY is a very address sensitive action, we do not
1928 * allow ftrace_ops to set all functions to new hash.
1930 if (!new_hash || !old_hash)
1931 return -EINVAL;
1933 /* Update rec->flags */
1934 do_for_each_ftrace_rec(pg, rec) {
1936 if (rec->flags & FTRACE_FL_DISABLED)
1937 continue;
1939 /* We need to update only differences of filter_hash */
1940 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1941 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1942 if (in_old == in_new)
1943 continue;
1945 if (in_new) {
1946 /* New entries must ensure no others are using it */
1947 if (rec->flags & FTRACE_FL_IPMODIFY)
1948 goto rollback;
1949 rec->flags |= FTRACE_FL_IPMODIFY;
1950 } else /* Removed entry */
1951 rec->flags &= ~FTRACE_FL_IPMODIFY;
1952 } while_for_each_ftrace_rec();
1954 return 0;
1956 rollback:
1957 end = rec;
1959 /* Roll back what we did above */
1960 do_for_each_ftrace_rec(pg, rec) {
1962 if (rec->flags & FTRACE_FL_DISABLED)
1963 continue;
1965 if (rec == end)
1966 goto err_out;
1968 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1969 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1970 if (in_old == in_new)
1971 continue;
1973 if (in_new)
1974 rec->flags &= ~FTRACE_FL_IPMODIFY;
1975 else
1976 rec->flags |= FTRACE_FL_IPMODIFY;
1977 } while_for_each_ftrace_rec();
1979 err_out:
1980 return -EBUSY;
1983 static int ftrace_hash_ipmodify_enable(struct ftrace_ops *ops)
1985 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1987 if (ftrace_hash_empty(hash))
1988 hash = NULL;
1990 return __ftrace_hash_update_ipmodify(ops, EMPTY_HASH, hash);
1993 /* Disabling always succeeds */
1994 static void ftrace_hash_ipmodify_disable(struct ftrace_ops *ops)
1996 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1998 if (ftrace_hash_empty(hash))
1999 hash = NULL;
2001 __ftrace_hash_update_ipmodify(ops, hash, EMPTY_HASH);
2004 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
2005 struct ftrace_hash *new_hash)
2007 struct ftrace_hash *old_hash = ops->func_hash->filter_hash;
2009 if (ftrace_hash_empty(old_hash))
2010 old_hash = NULL;
2012 if (ftrace_hash_empty(new_hash))
2013 new_hash = NULL;
2015 return __ftrace_hash_update_ipmodify(ops, old_hash, new_hash);
2018 static void print_ip_ins(const char *fmt, const unsigned char *p)
2020 int i;
2022 printk(KERN_CONT "%s", fmt);
2024 for (i = 0; i < MCOUNT_INSN_SIZE; i++)
2025 printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
2028 static struct ftrace_ops *
2029 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec);
2030 static struct ftrace_ops *
2031 ftrace_find_tramp_ops_next(struct dyn_ftrace *rec, struct ftrace_ops *ops);
2033 enum ftrace_bug_type ftrace_bug_type;
2034 const void *ftrace_expected;
2036 static void print_bug_type(void)
2038 switch (ftrace_bug_type) {
2039 case FTRACE_BUG_UNKNOWN:
2040 break;
2041 case FTRACE_BUG_INIT:
2042 pr_info("Initializing ftrace call sites\n");
2043 break;
2044 case FTRACE_BUG_NOP:
2045 pr_info("Setting ftrace call site to NOP\n");
2046 break;
2047 case FTRACE_BUG_CALL:
2048 pr_info("Setting ftrace call site to call ftrace function\n");
2049 break;
2050 case FTRACE_BUG_UPDATE:
2051 pr_info("Updating ftrace call site to call a different ftrace function\n");
2052 break;
2057 * ftrace_bug - report and shutdown function tracer
2058 * @failed: The failed type (EFAULT, EINVAL, EPERM)
2059 * @rec: The record that failed
2061 * The arch code that enables or disables the function tracing
2062 * can call ftrace_bug() when it has detected a problem in
2063 * modifying the code. @failed should be one of either:
2064 * EFAULT - if the problem happens on reading the @ip address
2065 * EINVAL - if what is read at @ip is not what was expected
2066 * EPERM - if the problem happens on writting to the @ip address
2068 void ftrace_bug(int failed, struct dyn_ftrace *rec)
2070 unsigned long ip = rec ? rec->ip : 0;
2072 switch (failed) {
2073 case -EFAULT:
2074 FTRACE_WARN_ON_ONCE(1);
2075 pr_info("ftrace faulted on modifying ");
2076 print_ip_sym(ip);
2077 break;
2078 case -EINVAL:
2079 FTRACE_WARN_ON_ONCE(1);
2080 pr_info("ftrace failed to modify ");
2081 print_ip_sym(ip);
2082 print_ip_ins(" actual: ", (unsigned char *)ip);
2083 pr_cont("\n");
2084 if (ftrace_expected) {
2085 print_ip_ins(" expected: ", ftrace_expected);
2086 pr_cont("\n");
2088 break;
2089 case -EPERM:
2090 FTRACE_WARN_ON_ONCE(1);
2091 pr_info("ftrace faulted on writing ");
2092 print_ip_sym(ip);
2093 break;
2094 default:
2095 FTRACE_WARN_ON_ONCE(1);
2096 pr_info("ftrace faulted on unknown error ");
2097 print_ip_sym(ip);
2099 print_bug_type();
2100 if (rec) {
2101 struct ftrace_ops *ops = NULL;
2103 pr_info("ftrace record flags: %lx\n", rec->flags);
2104 pr_cont(" (%ld)%s", ftrace_rec_count(rec),
2105 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2106 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2107 ops = ftrace_find_tramp_ops_any(rec);
2108 if (ops) {
2109 do {
2110 pr_cont("\ttramp: %pS (%pS)",
2111 (void *)ops->trampoline,
2112 (void *)ops->func);
2113 ops = ftrace_find_tramp_ops_next(rec, ops);
2114 } while (ops);
2115 } else
2116 pr_cont("\ttramp: ERROR!");
2119 ip = ftrace_get_addr_curr(rec);
2120 pr_cont("\n expected tramp: %lx\n", ip);
2124 static int ftrace_check_record(struct dyn_ftrace *rec, int enable, int update)
2126 unsigned long flag = 0UL;
2128 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2130 if (rec->flags & FTRACE_FL_DISABLED)
2131 return FTRACE_UPDATE_IGNORE;
2134 * If we are updating calls:
2136 * If the record has a ref count, then we need to enable it
2137 * because someone is using it.
2139 * Otherwise we make sure its disabled.
2141 * If we are disabling calls, then disable all records that
2142 * are enabled.
2144 if (enable && ftrace_rec_count(rec))
2145 flag = FTRACE_FL_ENABLED;
2148 * If enabling and the REGS flag does not match the REGS_EN, or
2149 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
2150 * this record. Set flags to fail the compare against ENABLED.
2152 if (flag) {
2153 if (!(rec->flags & FTRACE_FL_REGS) !=
2154 !(rec->flags & FTRACE_FL_REGS_EN))
2155 flag |= FTRACE_FL_REGS;
2157 if (!(rec->flags & FTRACE_FL_TRAMP) !=
2158 !(rec->flags & FTRACE_FL_TRAMP_EN))
2159 flag |= FTRACE_FL_TRAMP;
2162 /* If the state of this record hasn't changed, then do nothing */
2163 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
2164 return FTRACE_UPDATE_IGNORE;
2166 if (flag) {
2167 /* Save off if rec is being enabled (for return value) */
2168 flag ^= rec->flags & FTRACE_FL_ENABLED;
2170 if (update) {
2171 rec->flags |= FTRACE_FL_ENABLED;
2172 if (flag & FTRACE_FL_REGS) {
2173 if (rec->flags & FTRACE_FL_REGS)
2174 rec->flags |= FTRACE_FL_REGS_EN;
2175 else
2176 rec->flags &= ~FTRACE_FL_REGS_EN;
2178 if (flag & FTRACE_FL_TRAMP) {
2179 if (rec->flags & FTRACE_FL_TRAMP)
2180 rec->flags |= FTRACE_FL_TRAMP_EN;
2181 else
2182 rec->flags &= ~FTRACE_FL_TRAMP_EN;
2187 * If this record is being updated from a nop, then
2188 * return UPDATE_MAKE_CALL.
2189 * Otherwise,
2190 * return UPDATE_MODIFY_CALL to tell the caller to convert
2191 * from the save regs, to a non-save regs function or
2192 * vice versa, or from a trampoline call.
2194 if (flag & FTRACE_FL_ENABLED) {
2195 ftrace_bug_type = FTRACE_BUG_CALL;
2196 return FTRACE_UPDATE_MAKE_CALL;
2199 ftrace_bug_type = FTRACE_BUG_UPDATE;
2200 return FTRACE_UPDATE_MODIFY_CALL;
2203 if (update) {
2204 /* If there's no more users, clear all flags */
2205 if (!ftrace_rec_count(rec))
2206 rec->flags = 0;
2207 else
2209 * Just disable the record, but keep the ops TRAMP
2210 * and REGS states. The _EN flags must be disabled though.
2212 rec->flags &= ~(FTRACE_FL_ENABLED | FTRACE_FL_TRAMP_EN |
2213 FTRACE_FL_REGS_EN);
2216 ftrace_bug_type = FTRACE_BUG_NOP;
2217 return FTRACE_UPDATE_MAKE_NOP;
2221 * ftrace_update_record, set a record that now is tracing or not
2222 * @rec: the record to update
2223 * @enable: set to 1 if the record is tracing, zero to force disable
2225 * The records that represent all functions that can be traced need
2226 * to be updated when tracing has been enabled.
2228 int ftrace_update_record(struct dyn_ftrace *rec, int enable)
2230 return ftrace_check_record(rec, enable, 1);
2234 * ftrace_test_record, check if the record has been enabled or not
2235 * @rec: the record to test
2236 * @enable: set to 1 to check if enabled, 0 if it is disabled
2238 * The arch code may need to test if a record is already set to
2239 * tracing to determine how to modify the function code that it
2240 * represents.
2242 int ftrace_test_record(struct dyn_ftrace *rec, int enable)
2244 return ftrace_check_record(rec, enable, 0);
2247 static struct ftrace_ops *
2248 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec)
2250 struct ftrace_ops *op;
2251 unsigned long ip = rec->ip;
2253 do_for_each_ftrace_op(op, ftrace_ops_list) {
2255 if (!op->trampoline)
2256 continue;
2258 if (hash_contains_ip(ip, op->func_hash))
2259 return op;
2260 } while_for_each_ftrace_op(op);
2262 return NULL;
2265 static struct ftrace_ops *
2266 ftrace_find_tramp_ops_next(struct dyn_ftrace *rec,
2267 struct ftrace_ops *op)
2269 unsigned long ip = rec->ip;
2271 while_for_each_ftrace_op(op) {
2273 if (!op->trampoline)
2274 continue;
2276 if (hash_contains_ip(ip, op->func_hash))
2277 return op;
2280 return NULL;
2283 static struct ftrace_ops *
2284 ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
2286 struct ftrace_ops *op;
2287 unsigned long ip = rec->ip;
2290 * Need to check removed ops first.
2291 * If they are being removed, and this rec has a tramp,
2292 * and this rec is in the ops list, then it would be the
2293 * one with the tramp.
2295 if (removed_ops) {
2296 if (hash_contains_ip(ip, &removed_ops->old_hash))
2297 return removed_ops;
2301 * Need to find the current trampoline for a rec.
2302 * Now, a trampoline is only attached to a rec if there
2303 * was a single 'ops' attached to it. But this can be called
2304 * when we are adding another op to the rec or removing the
2305 * current one. Thus, if the op is being added, we can
2306 * ignore it because it hasn't attached itself to the rec
2307 * yet.
2309 * If an ops is being modified (hooking to different functions)
2310 * then we don't care about the new functions that are being
2311 * added, just the old ones (that are probably being removed).
2313 * If we are adding an ops to a function that already is using
2314 * a trampoline, it needs to be removed (trampolines are only
2315 * for single ops connected), then an ops that is not being
2316 * modified also needs to be checked.
2318 do_for_each_ftrace_op(op, ftrace_ops_list) {
2320 if (!op->trampoline)
2321 continue;
2324 * If the ops is being added, it hasn't gotten to
2325 * the point to be removed from this tree yet.
2327 if (op->flags & FTRACE_OPS_FL_ADDING)
2328 continue;
2332 * If the ops is being modified and is in the old
2333 * hash, then it is probably being removed from this
2334 * function.
2336 if ((op->flags & FTRACE_OPS_FL_MODIFYING) &&
2337 hash_contains_ip(ip, &op->old_hash))
2338 return op;
2340 * If the ops is not being added or modified, and it's
2341 * in its normal filter hash, then this must be the one
2342 * we want!
2344 if (!(op->flags & FTRACE_OPS_FL_MODIFYING) &&
2345 hash_contains_ip(ip, op->func_hash))
2346 return op;
2348 } while_for_each_ftrace_op(op);
2350 return NULL;
2353 static struct ftrace_ops *
2354 ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
2356 struct ftrace_ops *op;
2357 unsigned long ip = rec->ip;
2359 do_for_each_ftrace_op(op, ftrace_ops_list) {
2360 /* pass rec in as regs to have non-NULL val */
2361 if (hash_contains_ip(ip, op->func_hash))
2362 return op;
2363 } while_for_each_ftrace_op(op);
2365 return NULL;
2369 * ftrace_get_addr_new - Get the call address to set to
2370 * @rec: The ftrace record descriptor
2372 * If the record has the FTRACE_FL_REGS set, that means that it
2373 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
2374 * is not not set, then it wants to convert to the normal callback.
2376 * Returns the address of the trampoline to set to
2378 unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
2380 struct ftrace_ops *ops;
2382 /* Trampolines take precedence over regs */
2383 if (rec->flags & FTRACE_FL_TRAMP) {
2384 ops = ftrace_find_tramp_ops_new(rec);
2385 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
2386 pr_warn("Bad trampoline accounting at: %p (%pS) (%lx)\n",
2387 (void *)rec->ip, (void *)rec->ip, rec->flags);
2388 /* Ftrace is shutting down, return anything */
2389 return (unsigned long)FTRACE_ADDR;
2391 return ops->trampoline;
2394 if (rec->flags & FTRACE_FL_REGS)
2395 return (unsigned long)FTRACE_REGS_ADDR;
2396 else
2397 return (unsigned long)FTRACE_ADDR;
2401 * ftrace_get_addr_curr - Get the call address that is already there
2402 * @rec: The ftrace record descriptor
2404 * The FTRACE_FL_REGS_EN is set when the record already points to
2405 * a function that saves all the regs. Basically the '_EN' version
2406 * represents the current state of the function.
2408 * Returns the address of the trampoline that is currently being called
2410 unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
2412 struct ftrace_ops *ops;
2414 /* Trampolines take precedence over regs */
2415 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2416 ops = ftrace_find_tramp_ops_curr(rec);
2417 if (FTRACE_WARN_ON(!ops)) {
2418 pr_warn("Bad trampoline accounting at: %p (%pS)\n",
2419 (void *)rec->ip, (void *)rec->ip);
2420 /* Ftrace is shutting down, return anything */
2421 return (unsigned long)FTRACE_ADDR;
2423 return ops->trampoline;
2426 if (rec->flags & FTRACE_FL_REGS_EN)
2427 return (unsigned long)FTRACE_REGS_ADDR;
2428 else
2429 return (unsigned long)FTRACE_ADDR;
2432 static int
2433 __ftrace_replace_code(struct dyn_ftrace *rec, int enable)
2435 unsigned long ftrace_old_addr;
2436 unsigned long ftrace_addr;
2437 int ret;
2439 ftrace_addr = ftrace_get_addr_new(rec);
2441 /* This needs to be done before we call ftrace_update_record */
2442 ftrace_old_addr = ftrace_get_addr_curr(rec);
2444 ret = ftrace_update_record(rec, enable);
2446 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2448 switch (ret) {
2449 case FTRACE_UPDATE_IGNORE:
2450 return 0;
2452 case FTRACE_UPDATE_MAKE_CALL:
2453 ftrace_bug_type = FTRACE_BUG_CALL;
2454 return ftrace_make_call(rec, ftrace_addr);
2456 case FTRACE_UPDATE_MAKE_NOP:
2457 ftrace_bug_type = FTRACE_BUG_NOP;
2458 return ftrace_make_nop(NULL, rec, ftrace_old_addr);
2460 case FTRACE_UPDATE_MODIFY_CALL:
2461 ftrace_bug_type = FTRACE_BUG_UPDATE;
2462 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
2465 return -1; /* unknow ftrace bug */
2468 void __weak ftrace_replace_code(int enable)
2470 struct dyn_ftrace *rec;
2471 struct ftrace_page *pg;
2472 int failed;
2474 if (unlikely(ftrace_disabled))
2475 return;
2477 do_for_each_ftrace_rec(pg, rec) {
2479 if (rec->flags & FTRACE_FL_DISABLED)
2480 continue;
2482 failed = __ftrace_replace_code(rec, enable);
2483 if (failed) {
2484 ftrace_bug(failed, rec);
2485 /* Stop processing */
2486 return;
2488 } while_for_each_ftrace_rec();
2491 struct ftrace_rec_iter {
2492 struct ftrace_page *pg;
2493 int index;
2497 * ftrace_rec_iter_start, start up iterating over traced functions
2499 * Returns an iterator handle that is used to iterate over all
2500 * the records that represent address locations where functions
2501 * are traced.
2503 * May return NULL if no records are available.
2505 struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2508 * We only use a single iterator.
2509 * Protected by the ftrace_lock mutex.
2511 static struct ftrace_rec_iter ftrace_rec_iter;
2512 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2514 iter->pg = ftrace_pages_start;
2515 iter->index = 0;
2517 /* Could have empty pages */
2518 while (iter->pg && !iter->pg->index)
2519 iter->pg = iter->pg->next;
2521 if (!iter->pg)
2522 return NULL;
2524 return iter;
2528 * ftrace_rec_iter_next, get the next record to process.
2529 * @iter: The handle to the iterator.
2531 * Returns the next iterator after the given iterator @iter.
2533 struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2535 iter->index++;
2537 if (iter->index >= iter->pg->index) {
2538 iter->pg = iter->pg->next;
2539 iter->index = 0;
2541 /* Could have empty pages */
2542 while (iter->pg && !iter->pg->index)
2543 iter->pg = iter->pg->next;
2546 if (!iter->pg)
2547 return NULL;
2549 return iter;
2553 * ftrace_rec_iter_record, get the record at the iterator location
2554 * @iter: The current iterator location
2556 * Returns the record that the current @iter is at.
2558 struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2560 return &iter->pg->records[iter->index];
2563 static int
2564 ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
2566 int ret;
2568 if (unlikely(ftrace_disabled))
2569 return 0;
2571 ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
2572 if (ret) {
2573 ftrace_bug_type = FTRACE_BUG_INIT;
2574 ftrace_bug(ret, rec);
2575 return 0;
2577 return 1;
2581 * archs can override this function if they must do something
2582 * before the modifying code is performed.
2584 int __weak ftrace_arch_code_modify_prepare(void)
2586 return 0;
2590 * archs can override this function if they must do something
2591 * after the modifying code is performed.
2593 int __weak ftrace_arch_code_modify_post_process(void)
2595 return 0;
2598 void ftrace_modify_all_code(int command)
2600 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2601 int err = 0;
2604 * If the ftrace_caller calls a ftrace_ops func directly,
2605 * we need to make sure that it only traces functions it
2606 * expects to trace. When doing the switch of functions,
2607 * we need to update to the ftrace_ops_list_func first
2608 * before the transition between old and new calls are set,
2609 * as the ftrace_ops_list_func will check the ops hashes
2610 * to make sure the ops are having the right functions
2611 * traced.
2613 if (update) {
2614 err = ftrace_update_ftrace_func(ftrace_ops_list_func);
2615 if (FTRACE_WARN_ON(err))
2616 return;
2619 if (command & FTRACE_UPDATE_CALLS)
2620 ftrace_replace_code(1);
2621 else if (command & FTRACE_DISABLE_CALLS)
2622 ftrace_replace_code(0);
2624 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2625 function_trace_op = set_function_trace_op;
2626 smp_wmb();
2627 /* If irqs are disabled, we are in stop machine */
2628 if (!irqs_disabled())
2629 smp_call_function(ftrace_sync_ipi, NULL, 1);
2630 err = ftrace_update_ftrace_func(ftrace_trace_function);
2631 if (FTRACE_WARN_ON(err))
2632 return;
2635 if (command & FTRACE_START_FUNC_RET)
2636 err = ftrace_enable_ftrace_graph_caller();
2637 else if (command & FTRACE_STOP_FUNC_RET)
2638 err = ftrace_disable_ftrace_graph_caller();
2639 FTRACE_WARN_ON(err);
2642 static int __ftrace_modify_code(void *data)
2644 int *command = data;
2646 ftrace_modify_all_code(*command);
2648 return 0;
2652 * ftrace_run_stop_machine, go back to the stop machine method
2653 * @command: The command to tell ftrace what to do
2655 * If an arch needs to fall back to the stop machine method, the
2656 * it can call this function.
2658 void ftrace_run_stop_machine(int command)
2660 stop_machine(__ftrace_modify_code, &command, NULL);
2664 * arch_ftrace_update_code, modify the code to trace or not trace
2665 * @command: The command that needs to be done
2667 * Archs can override this function if it does not need to
2668 * run stop_machine() to modify code.
2670 void __weak arch_ftrace_update_code(int command)
2672 ftrace_run_stop_machine(command);
2675 static void ftrace_run_update_code(int command)
2677 int ret;
2679 ret = ftrace_arch_code_modify_prepare();
2680 FTRACE_WARN_ON(ret);
2681 if (ret)
2682 return;
2685 * By default we use stop_machine() to modify the code.
2686 * But archs can do what ever they want as long as it
2687 * is safe. The stop_machine() is the safest, but also
2688 * produces the most overhead.
2690 arch_ftrace_update_code(command);
2692 ret = ftrace_arch_code_modify_post_process();
2693 FTRACE_WARN_ON(ret);
2696 static void ftrace_run_modify_code(struct ftrace_ops *ops, int command,
2697 struct ftrace_ops_hash *old_hash)
2699 ops->flags |= FTRACE_OPS_FL_MODIFYING;
2700 ops->old_hash.filter_hash = old_hash->filter_hash;
2701 ops->old_hash.notrace_hash = old_hash->notrace_hash;
2702 ftrace_run_update_code(command);
2703 ops->old_hash.filter_hash = NULL;
2704 ops->old_hash.notrace_hash = NULL;
2705 ops->flags &= ~FTRACE_OPS_FL_MODIFYING;
2708 static ftrace_func_t saved_ftrace_func;
2709 static int ftrace_start_up;
2711 void __weak arch_ftrace_trampoline_free(struct ftrace_ops *ops)
2715 static void per_cpu_ops_free(struct ftrace_ops *ops)
2717 free_percpu(ops->disabled);
2720 static void ftrace_startup_enable(int command)
2722 if (saved_ftrace_func != ftrace_trace_function) {
2723 saved_ftrace_func = ftrace_trace_function;
2724 command |= FTRACE_UPDATE_TRACE_FUNC;
2727 if (!command || !ftrace_enabled)
2728 return;
2730 ftrace_run_update_code(command);
2733 static void ftrace_startup_all(int command)
2735 update_all_ops = true;
2736 ftrace_startup_enable(command);
2737 update_all_ops = false;
2740 static int ftrace_startup(struct ftrace_ops *ops, int command)
2742 int ret;
2744 if (unlikely(ftrace_disabled))
2745 return -ENODEV;
2747 ret = __register_ftrace_function(ops);
2748 if (ret)
2749 return ret;
2751 ftrace_start_up++;
2754 * Note that ftrace probes uses this to start up
2755 * and modify functions it will probe. But we still
2756 * set the ADDING flag for modification, as probes
2757 * do not have trampolines. If they add them in the
2758 * future, then the probes will need to distinguish
2759 * between adding and updating probes.
2761 ops->flags |= FTRACE_OPS_FL_ENABLED | FTRACE_OPS_FL_ADDING;
2763 ret = ftrace_hash_ipmodify_enable(ops);
2764 if (ret < 0) {
2765 /* Rollback registration process */
2766 __unregister_ftrace_function(ops);
2767 ftrace_start_up--;
2768 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2769 return ret;
2772 if (ftrace_hash_rec_enable(ops, 1))
2773 command |= FTRACE_UPDATE_CALLS;
2775 ftrace_startup_enable(command);
2777 ops->flags &= ~FTRACE_OPS_FL_ADDING;
2779 return 0;
2782 static int ftrace_shutdown(struct ftrace_ops *ops, int command)
2784 int ret;
2786 if (unlikely(ftrace_disabled))
2787 return -ENODEV;
2789 ret = __unregister_ftrace_function(ops);
2790 if (ret)
2791 return ret;
2793 ftrace_start_up--;
2795 * Just warn in case of unbalance, no need to kill ftrace, it's not
2796 * critical but the ftrace_call callers may be never nopped again after
2797 * further ftrace uses.
2799 WARN_ON_ONCE(ftrace_start_up < 0);
2801 /* Disabling ipmodify never fails */
2802 ftrace_hash_ipmodify_disable(ops);
2804 if (ftrace_hash_rec_disable(ops, 1))
2805 command |= FTRACE_UPDATE_CALLS;
2807 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2809 if (saved_ftrace_func != ftrace_trace_function) {
2810 saved_ftrace_func = ftrace_trace_function;
2811 command |= FTRACE_UPDATE_TRACE_FUNC;
2814 if (!command || !ftrace_enabled) {
2816 * If these are per_cpu ops, they still need their
2817 * per_cpu field freed. Since, function tracing is
2818 * not currently active, we can just free them
2819 * without synchronizing all CPUs.
2821 if (ops->flags & FTRACE_OPS_FL_PER_CPU)
2822 per_cpu_ops_free(ops);
2823 return 0;
2827 * If the ops uses a trampoline, then it needs to be
2828 * tested first on update.
2830 ops->flags |= FTRACE_OPS_FL_REMOVING;
2831 removed_ops = ops;
2833 /* The trampoline logic checks the old hashes */
2834 ops->old_hash.filter_hash = ops->func_hash->filter_hash;
2835 ops->old_hash.notrace_hash = ops->func_hash->notrace_hash;
2837 ftrace_run_update_code(command);
2840 * If there's no more ops registered with ftrace, run a
2841 * sanity check to make sure all rec flags are cleared.
2843 if (ftrace_ops_list == &ftrace_list_end) {
2844 struct ftrace_page *pg;
2845 struct dyn_ftrace *rec;
2847 do_for_each_ftrace_rec(pg, rec) {
2848 if (FTRACE_WARN_ON_ONCE(rec->flags & ~FTRACE_FL_DISABLED))
2849 pr_warn(" %pS flags:%lx\n",
2850 (void *)rec->ip, rec->flags);
2851 } while_for_each_ftrace_rec();
2854 ops->old_hash.filter_hash = NULL;
2855 ops->old_hash.notrace_hash = NULL;
2857 removed_ops = NULL;
2858 ops->flags &= ~FTRACE_OPS_FL_REMOVING;
2861 * Dynamic ops may be freed, we must make sure that all
2862 * callers are done before leaving this function.
2863 * The same goes for freeing the per_cpu data of the per_cpu
2864 * ops.
2866 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_PER_CPU)) {
2868 * We need to do a hard force of sched synchronization.
2869 * This is because we use preempt_disable() to do RCU, but
2870 * the function tracers can be called where RCU is not watching
2871 * (like before user_exit()). We can not rely on the RCU
2872 * infrastructure to do the synchronization, thus we must do it
2873 * ourselves.
2875 schedule_on_each_cpu(ftrace_sync);
2878 * When the kernel is preeptive, tasks can be preempted
2879 * while on a ftrace trampoline. Just scheduling a task on
2880 * a CPU is not good enough to flush them. Calling
2881 * synchornize_rcu_tasks() will wait for those tasks to
2882 * execute and either schedule voluntarily or enter user space.
2884 if (IS_ENABLED(CONFIG_PREEMPT))
2885 synchronize_rcu_tasks();
2887 arch_ftrace_trampoline_free(ops);
2889 if (ops->flags & FTRACE_OPS_FL_PER_CPU)
2890 per_cpu_ops_free(ops);
2893 return 0;
2896 static void ftrace_startup_sysctl(void)
2898 int command;
2900 if (unlikely(ftrace_disabled))
2901 return;
2903 /* Force update next time */
2904 saved_ftrace_func = NULL;
2905 /* ftrace_start_up is true if we want ftrace running */
2906 if (ftrace_start_up) {
2907 command = FTRACE_UPDATE_CALLS;
2908 if (ftrace_graph_active)
2909 command |= FTRACE_START_FUNC_RET;
2910 ftrace_startup_enable(command);
2914 static void ftrace_shutdown_sysctl(void)
2916 int command;
2918 if (unlikely(ftrace_disabled))
2919 return;
2921 /* ftrace_start_up is true if ftrace is running */
2922 if (ftrace_start_up) {
2923 command = FTRACE_DISABLE_CALLS;
2924 if (ftrace_graph_active)
2925 command |= FTRACE_STOP_FUNC_RET;
2926 ftrace_run_update_code(command);
2930 static u64 ftrace_update_time;
2931 unsigned long ftrace_update_tot_cnt;
2933 static inline int ops_traces_mod(struct ftrace_ops *ops)
2936 * Filter_hash being empty will default to trace module.
2937 * But notrace hash requires a test of individual module functions.
2939 return ftrace_hash_empty(ops->func_hash->filter_hash) &&
2940 ftrace_hash_empty(ops->func_hash->notrace_hash);
2944 * Check if the current ops references the record.
2946 * If the ops traces all functions, then it was already accounted for.
2947 * If the ops does not trace the current record function, skip it.
2948 * If the ops ignores the function via notrace filter, skip it.
2950 static inline bool
2951 ops_references_rec(struct ftrace_ops *ops, struct dyn_ftrace *rec)
2953 /* If ops isn't enabled, ignore it */
2954 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
2955 return 0;
2957 /* If ops traces all then it includes this function */
2958 if (ops_traces_mod(ops))
2959 return 1;
2961 /* The function must be in the filter */
2962 if (!ftrace_hash_empty(ops->func_hash->filter_hash) &&
2963 !__ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))
2964 return 0;
2966 /* If in notrace hash, we ignore it too */
2967 if (ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip))
2968 return 0;
2970 return 1;
2973 static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
2975 struct ftrace_page *pg;
2976 struct dyn_ftrace *p;
2977 u64 start, stop;
2978 unsigned long update_cnt = 0;
2979 unsigned long rec_flags = 0;
2980 int i;
2982 start = ftrace_now(raw_smp_processor_id());
2985 * When a module is loaded, this function is called to convert
2986 * the calls to mcount in its text to nops, and also to create
2987 * an entry in the ftrace data. Now, if ftrace is activated
2988 * after this call, but before the module sets its text to
2989 * read-only, the modification of enabling ftrace can fail if
2990 * the read-only is done while ftrace is converting the calls.
2991 * To prevent this, the module's records are set as disabled
2992 * and will be enabled after the call to set the module's text
2993 * to read-only.
2995 if (mod)
2996 rec_flags |= FTRACE_FL_DISABLED;
2998 for (pg = new_pgs; pg; pg = pg->next) {
3000 for (i = 0; i < pg->index; i++) {
3002 /* If something went wrong, bail without enabling anything */
3003 if (unlikely(ftrace_disabled))
3004 return -1;
3006 p = &pg->records[i];
3007 p->flags = rec_flags;
3010 * Do the initial record conversion from mcount jump
3011 * to the NOP instructions.
3013 if (!ftrace_code_disable(mod, p))
3014 break;
3016 update_cnt++;
3020 stop = ftrace_now(raw_smp_processor_id());
3021 ftrace_update_time = stop - start;
3022 ftrace_update_tot_cnt += update_cnt;
3024 return 0;
3027 static int ftrace_allocate_records(struct ftrace_page *pg, int count)
3029 int order;
3030 int cnt;
3032 if (WARN_ON(!count))
3033 return -EINVAL;
3035 order = get_count_order(DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
3038 * We want to fill as much as possible. No more than a page
3039 * may be empty.
3041 while ((PAGE_SIZE << order) / ENTRY_SIZE >= count + ENTRIES_PER_PAGE)
3042 order--;
3044 again:
3045 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
3047 if (!pg->records) {
3048 /* if we can't allocate this size, try something smaller */
3049 if (!order)
3050 return -ENOMEM;
3051 order >>= 1;
3052 goto again;
3055 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
3056 pg->size = cnt;
3058 if (cnt > count)
3059 cnt = count;
3061 return cnt;
3064 static struct ftrace_page *
3065 ftrace_allocate_pages(unsigned long num_to_init)
3067 struct ftrace_page *start_pg;
3068 struct ftrace_page *pg;
3069 int order;
3070 int cnt;
3072 if (!num_to_init)
3073 return 0;
3075 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
3076 if (!pg)
3077 return NULL;
3080 * Try to allocate as much as possible in one continues
3081 * location that fills in all of the space. We want to
3082 * waste as little space as possible.
3084 for (;;) {
3085 cnt = ftrace_allocate_records(pg, num_to_init);
3086 if (cnt < 0)
3087 goto free_pages;
3089 num_to_init -= cnt;
3090 if (!num_to_init)
3091 break;
3093 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
3094 if (!pg->next)
3095 goto free_pages;
3097 pg = pg->next;
3100 return start_pg;
3102 free_pages:
3103 pg = start_pg;
3104 while (pg) {
3105 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
3106 free_pages((unsigned long)pg->records, order);
3107 start_pg = pg->next;
3108 kfree(pg);
3109 pg = start_pg;
3111 pr_info("ftrace: FAILED to allocate memory for functions\n");
3112 return NULL;
3115 #define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
3117 struct ftrace_iterator {
3118 loff_t pos;
3119 loff_t func_pos;
3120 loff_t mod_pos;
3121 struct ftrace_page *pg;
3122 struct dyn_ftrace *func;
3123 struct ftrace_func_probe *probe;
3124 struct ftrace_func_entry *probe_entry;
3125 struct trace_parser parser;
3126 struct ftrace_hash *hash;
3127 struct ftrace_ops *ops;
3128 struct trace_array *tr;
3129 struct list_head *mod_list;
3130 int pidx;
3131 int idx;
3132 unsigned flags;
3135 static void *
3136 t_probe_next(struct seq_file *m, loff_t *pos)
3138 struct ftrace_iterator *iter = m->private;
3139 struct trace_array *tr = iter->ops->private;
3140 struct list_head *func_probes;
3141 struct ftrace_hash *hash;
3142 struct list_head *next;
3143 struct hlist_node *hnd = NULL;
3144 struct hlist_head *hhd;
3145 int size;
3147 (*pos)++;
3148 iter->pos = *pos;
3150 if (!tr)
3151 return NULL;
3153 func_probes = &tr->func_probes;
3154 if (list_empty(func_probes))
3155 return NULL;
3157 if (!iter->probe) {
3158 next = func_probes->next;
3159 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3162 if (iter->probe_entry)
3163 hnd = &iter->probe_entry->hlist;
3165 hash = iter->probe->ops.func_hash->filter_hash;
3166 size = 1 << hash->size_bits;
3168 retry:
3169 if (iter->pidx >= size) {
3170 if (iter->probe->list.next == func_probes)
3171 return NULL;
3172 next = iter->probe->list.next;
3173 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3174 hash = iter->probe->ops.func_hash->filter_hash;
3175 size = 1 << hash->size_bits;
3176 iter->pidx = 0;
3179 hhd = &hash->buckets[iter->pidx];
3181 if (hlist_empty(hhd)) {
3182 iter->pidx++;
3183 hnd = NULL;
3184 goto retry;
3187 if (!hnd)
3188 hnd = hhd->first;
3189 else {
3190 hnd = hnd->next;
3191 if (!hnd) {
3192 iter->pidx++;
3193 goto retry;
3197 if (WARN_ON_ONCE(!hnd))
3198 return NULL;
3200 iter->probe_entry = hlist_entry(hnd, struct ftrace_func_entry, hlist);
3202 return iter;
3205 static void *t_probe_start(struct seq_file *m, loff_t *pos)
3207 struct ftrace_iterator *iter = m->private;
3208 void *p = NULL;
3209 loff_t l;
3211 if (!(iter->flags & FTRACE_ITER_DO_PROBES))
3212 return NULL;
3214 if (iter->mod_pos > *pos)
3215 return NULL;
3217 iter->probe = NULL;
3218 iter->probe_entry = NULL;
3219 iter->pidx = 0;
3220 for (l = 0; l <= (*pos - iter->mod_pos); ) {
3221 p = t_probe_next(m, &l);
3222 if (!p)
3223 break;
3225 if (!p)
3226 return NULL;
3228 /* Only set this if we have an item */
3229 iter->flags |= FTRACE_ITER_PROBE;
3231 return iter;
3234 static int
3235 t_probe_show(struct seq_file *m, struct ftrace_iterator *iter)
3237 struct ftrace_func_entry *probe_entry;
3238 struct ftrace_probe_ops *probe_ops;
3239 struct ftrace_func_probe *probe;
3241 probe = iter->probe;
3242 probe_entry = iter->probe_entry;
3244 if (WARN_ON_ONCE(!probe || !probe_entry))
3245 return -EIO;
3247 probe_ops = probe->probe_ops;
3249 if (probe_ops->print)
3250 return probe_ops->print(m, probe_entry->ip, probe_ops, probe->data);
3252 seq_printf(m, "%ps:%ps\n", (void *)probe_entry->ip,
3253 (void *)probe_ops->func);
3255 return 0;
3258 static void *
3259 t_mod_next(struct seq_file *m, loff_t *pos)
3261 struct ftrace_iterator *iter = m->private;
3262 struct trace_array *tr = iter->tr;
3264 (*pos)++;
3265 iter->pos = *pos;
3267 iter->mod_list = iter->mod_list->next;
3269 if (iter->mod_list == &tr->mod_trace ||
3270 iter->mod_list == &tr->mod_notrace) {
3271 iter->flags &= ~FTRACE_ITER_MOD;
3272 return NULL;
3275 iter->mod_pos = *pos;
3277 return iter;
3280 static void *t_mod_start(struct seq_file *m, loff_t *pos)
3282 struct ftrace_iterator *iter = m->private;
3283 void *p = NULL;
3284 loff_t l;
3286 if (iter->func_pos > *pos)
3287 return NULL;
3289 iter->mod_pos = iter->func_pos;
3291 /* probes are only available if tr is set */
3292 if (!iter->tr)
3293 return NULL;
3295 for (l = 0; l <= (*pos - iter->func_pos); ) {
3296 p = t_mod_next(m, &l);
3297 if (!p)
3298 break;
3300 if (!p) {
3301 iter->flags &= ~FTRACE_ITER_MOD;
3302 return t_probe_start(m, pos);
3305 /* Only set this if we have an item */
3306 iter->flags |= FTRACE_ITER_MOD;
3308 return iter;
3311 static int
3312 t_mod_show(struct seq_file *m, struct ftrace_iterator *iter)
3314 struct ftrace_mod_load *ftrace_mod;
3315 struct trace_array *tr = iter->tr;
3317 if (WARN_ON_ONCE(!iter->mod_list) ||
3318 iter->mod_list == &tr->mod_trace ||
3319 iter->mod_list == &tr->mod_notrace)
3320 return -EIO;
3322 ftrace_mod = list_entry(iter->mod_list, struct ftrace_mod_load, list);
3324 if (ftrace_mod->func)
3325 seq_printf(m, "%s", ftrace_mod->func);
3326 else
3327 seq_putc(m, '*');
3329 seq_printf(m, ":mod:%s\n", ftrace_mod->module);
3331 return 0;
3334 static void *
3335 t_func_next(struct seq_file *m, loff_t *pos)
3337 struct ftrace_iterator *iter = m->private;
3338 struct dyn_ftrace *rec = NULL;
3340 (*pos)++;
3342 retry:
3343 if (iter->idx >= iter->pg->index) {
3344 if (iter->pg->next) {
3345 iter->pg = iter->pg->next;
3346 iter->idx = 0;
3347 goto retry;
3349 } else {
3350 rec = &iter->pg->records[iter->idx++];
3351 if (((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3352 !ftrace_lookup_ip(iter->hash, rec->ip)) ||
3354 ((iter->flags & FTRACE_ITER_ENABLED) &&
3355 !(rec->flags & FTRACE_FL_ENABLED))) {
3357 rec = NULL;
3358 goto retry;
3362 if (!rec)
3363 return NULL;
3365 iter->pos = iter->func_pos = *pos;
3366 iter->func = rec;
3368 return iter;
3371 static void *
3372 t_next(struct seq_file *m, void *v, loff_t *pos)
3374 struct ftrace_iterator *iter = m->private;
3375 loff_t l = *pos; /* t_probe_start() must use original pos */
3376 void *ret;
3378 if (unlikely(ftrace_disabled))
3379 return NULL;
3381 if (iter->flags & FTRACE_ITER_PROBE)
3382 return t_probe_next(m, pos);
3384 if (iter->flags & FTRACE_ITER_MOD)
3385 return t_mod_next(m, pos);
3387 if (iter->flags & FTRACE_ITER_PRINTALL) {
3388 /* next must increment pos, and t_probe_start does not */
3389 (*pos)++;
3390 return t_mod_start(m, &l);
3393 ret = t_func_next(m, pos);
3395 if (!ret)
3396 return t_mod_start(m, &l);
3398 return ret;
3401 static void reset_iter_read(struct ftrace_iterator *iter)
3403 iter->pos = 0;
3404 iter->func_pos = 0;
3405 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_PROBE | FTRACE_ITER_MOD);
3408 static void *t_start(struct seq_file *m, loff_t *pos)
3410 struct ftrace_iterator *iter = m->private;
3411 void *p = NULL;
3412 loff_t l;
3414 mutex_lock(&ftrace_lock);
3416 if (unlikely(ftrace_disabled))
3417 return NULL;
3420 * If an lseek was done, then reset and start from beginning.
3422 if (*pos < iter->pos)
3423 reset_iter_read(iter);
3426 * For set_ftrace_filter reading, if we have the filter
3427 * off, we can short cut and just print out that all
3428 * functions are enabled.
3430 if ((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3431 ftrace_hash_empty(iter->hash)) {
3432 iter->func_pos = 1; /* Account for the message */
3433 if (*pos > 0)
3434 return t_mod_start(m, pos);
3435 iter->flags |= FTRACE_ITER_PRINTALL;
3436 /* reset in case of seek/pread */
3437 iter->flags &= ~FTRACE_ITER_PROBE;
3438 return iter;
3441 if (iter->flags & FTRACE_ITER_MOD)
3442 return t_mod_start(m, pos);
3445 * Unfortunately, we need to restart at ftrace_pages_start
3446 * every time we let go of the ftrace_mutex. This is because
3447 * those pointers can change without the lock.
3449 iter->pg = ftrace_pages_start;
3450 iter->idx = 0;
3451 for (l = 0; l <= *pos; ) {
3452 p = t_func_next(m, &l);
3453 if (!p)
3454 break;
3457 if (!p)
3458 return t_mod_start(m, pos);
3460 return iter;
3463 static void t_stop(struct seq_file *m, void *p)
3465 mutex_unlock(&ftrace_lock);
3468 void * __weak
3469 arch_ftrace_trampoline_func(struct ftrace_ops *ops, struct dyn_ftrace *rec)
3471 return NULL;
3474 static void add_trampoline_func(struct seq_file *m, struct ftrace_ops *ops,
3475 struct dyn_ftrace *rec)
3477 void *ptr;
3479 ptr = arch_ftrace_trampoline_func(ops, rec);
3480 if (ptr)
3481 seq_printf(m, " ->%pS", ptr);
3484 static int t_show(struct seq_file *m, void *v)
3486 struct ftrace_iterator *iter = m->private;
3487 struct dyn_ftrace *rec;
3489 if (iter->flags & FTRACE_ITER_PROBE)
3490 return t_probe_show(m, iter);
3492 if (iter->flags & FTRACE_ITER_MOD)
3493 return t_mod_show(m, iter);
3495 if (iter->flags & FTRACE_ITER_PRINTALL) {
3496 if (iter->flags & FTRACE_ITER_NOTRACE)
3497 seq_puts(m, "#### no functions disabled ####\n");
3498 else
3499 seq_puts(m, "#### all functions enabled ####\n");
3500 return 0;
3503 rec = iter->func;
3505 if (!rec)
3506 return 0;
3508 seq_printf(m, "%ps", (void *)rec->ip);
3509 if (iter->flags & FTRACE_ITER_ENABLED) {
3510 struct ftrace_ops *ops;
3512 seq_printf(m, " (%ld)%s%s",
3513 ftrace_rec_count(rec),
3514 rec->flags & FTRACE_FL_REGS ? " R" : " ",
3515 rec->flags & FTRACE_FL_IPMODIFY ? " I" : " ");
3516 if (rec->flags & FTRACE_FL_TRAMP_EN) {
3517 ops = ftrace_find_tramp_ops_any(rec);
3518 if (ops) {
3519 do {
3520 seq_printf(m, "\ttramp: %pS (%pS)",
3521 (void *)ops->trampoline,
3522 (void *)ops->func);
3523 add_trampoline_func(m, ops, rec);
3524 ops = ftrace_find_tramp_ops_next(rec, ops);
3525 } while (ops);
3526 } else
3527 seq_puts(m, "\ttramp: ERROR!");
3528 } else {
3529 add_trampoline_func(m, NULL, rec);
3533 seq_putc(m, '\n');
3535 return 0;
3538 static const struct seq_operations show_ftrace_seq_ops = {
3539 .start = t_start,
3540 .next = t_next,
3541 .stop = t_stop,
3542 .show = t_show,
3545 static int
3546 ftrace_avail_open(struct inode *inode, struct file *file)
3548 struct ftrace_iterator *iter;
3550 if (unlikely(ftrace_disabled))
3551 return -ENODEV;
3553 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3554 if (!iter)
3555 return -ENOMEM;
3557 iter->pg = ftrace_pages_start;
3558 iter->ops = &global_ops;
3560 return 0;
3563 static int
3564 ftrace_enabled_open(struct inode *inode, struct file *file)
3566 struct ftrace_iterator *iter;
3568 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3569 if (!iter)
3570 return -ENOMEM;
3572 iter->pg = ftrace_pages_start;
3573 iter->flags = FTRACE_ITER_ENABLED;
3574 iter->ops = &global_ops;
3576 return 0;
3580 * ftrace_regex_open - initialize function tracer filter files
3581 * @ops: The ftrace_ops that hold the hash filters
3582 * @flag: The type of filter to process
3583 * @inode: The inode, usually passed in to your open routine
3584 * @file: The file, usually passed in to your open routine
3586 * ftrace_regex_open() initializes the filter files for the
3587 * @ops. Depending on @flag it may process the filter hash or
3588 * the notrace hash of @ops. With this called from the open
3589 * routine, you can use ftrace_filter_write() for the write
3590 * routine if @flag has FTRACE_ITER_FILTER set, or
3591 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
3592 * tracing_lseek() should be used as the lseek routine, and
3593 * release must call ftrace_regex_release().
3596 ftrace_regex_open(struct ftrace_ops *ops, int flag,
3597 struct inode *inode, struct file *file)
3599 struct ftrace_iterator *iter;
3600 struct ftrace_hash *hash;
3601 struct list_head *mod_head;
3602 struct trace_array *tr = ops->private;
3603 int ret = 0;
3605 ftrace_ops_init(ops);
3607 if (unlikely(ftrace_disabled))
3608 return -ENODEV;
3610 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
3611 if (!iter)
3612 return -ENOMEM;
3614 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
3615 kfree(iter);
3616 return -ENOMEM;
3619 iter->ops = ops;
3620 iter->flags = flag;
3621 iter->tr = tr;
3623 mutex_lock(&ops->func_hash->regex_lock);
3625 if (flag & FTRACE_ITER_NOTRACE) {
3626 hash = ops->func_hash->notrace_hash;
3627 mod_head = tr ? &tr->mod_notrace : NULL;
3628 } else {
3629 hash = ops->func_hash->filter_hash;
3630 mod_head = tr ? &tr->mod_trace : NULL;
3633 iter->mod_list = mod_head;
3635 if (file->f_mode & FMODE_WRITE) {
3636 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3638 if (file->f_flags & O_TRUNC) {
3639 iter->hash = alloc_ftrace_hash(size_bits);
3640 clear_ftrace_mod_list(mod_head);
3641 } else {
3642 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3645 if (!iter->hash) {
3646 trace_parser_put(&iter->parser);
3647 kfree(iter);
3648 ret = -ENOMEM;
3649 goto out_unlock;
3651 } else
3652 iter->hash = hash;
3654 if (file->f_mode & FMODE_READ) {
3655 iter->pg = ftrace_pages_start;
3657 ret = seq_open(file, &show_ftrace_seq_ops);
3658 if (!ret) {
3659 struct seq_file *m = file->private_data;
3660 m->private = iter;
3661 } else {
3662 /* Failed */
3663 free_ftrace_hash(iter->hash);
3664 trace_parser_put(&iter->parser);
3665 kfree(iter);
3667 } else
3668 file->private_data = iter;
3670 out_unlock:
3671 mutex_unlock(&ops->func_hash->regex_lock);
3673 return ret;
3676 static int
3677 ftrace_filter_open(struct inode *inode, struct file *file)
3679 struct ftrace_ops *ops = inode->i_private;
3681 return ftrace_regex_open(ops,
3682 FTRACE_ITER_FILTER | FTRACE_ITER_DO_PROBES,
3683 inode, file);
3686 static int
3687 ftrace_notrace_open(struct inode *inode, struct file *file)
3689 struct ftrace_ops *ops = inode->i_private;
3691 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3692 inode, file);
3695 /* Type for quick search ftrace basic regexes (globs) from filter_parse_regex */
3696 struct ftrace_glob {
3697 char *search;
3698 unsigned len;
3699 int type;
3703 * If symbols in an architecture don't correspond exactly to the user-visible
3704 * name of what they represent, it is possible to define this function to
3705 * perform the necessary adjustments.
3707 char * __weak arch_ftrace_match_adjust(char *str, const char *search)
3709 return str;
3712 static int ftrace_match(char *str, struct ftrace_glob *g)
3714 int matched = 0;
3715 int slen;
3717 str = arch_ftrace_match_adjust(str, g->search);
3719 switch (g->type) {
3720 case MATCH_FULL:
3721 if (strcmp(str, g->search) == 0)
3722 matched = 1;
3723 break;
3724 case MATCH_FRONT_ONLY:
3725 if (strncmp(str, g->search, g->len) == 0)
3726 matched = 1;
3727 break;
3728 case MATCH_MIDDLE_ONLY:
3729 if (strstr(str, g->search))
3730 matched = 1;
3731 break;
3732 case MATCH_END_ONLY:
3733 slen = strlen(str);
3734 if (slen >= g->len &&
3735 memcmp(str + slen - g->len, g->search, g->len) == 0)
3736 matched = 1;
3737 break;
3738 case MATCH_GLOB:
3739 if (glob_match(g->search, str))
3740 matched = 1;
3741 break;
3744 return matched;
3747 static int
3748 enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter)
3750 struct ftrace_func_entry *entry;
3751 int ret = 0;
3753 entry = ftrace_lookup_ip(hash, rec->ip);
3754 if (clear_filter) {
3755 /* Do nothing if it doesn't exist */
3756 if (!entry)
3757 return 0;
3759 free_hash_entry(hash, entry);
3760 } else {
3761 /* Do nothing if it exists */
3762 if (entry)
3763 return 0;
3765 ret = add_hash_entry(hash, rec->ip);
3767 return ret;
3770 static int
3771 ftrace_match_record(struct dyn_ftrace *rec, struct ftrace_glob *func_g,
3772 struct ftrace_glob *mod_g, int exclude_mod)
3774 char str[KSYM_SYMBOL_LEN];
3775 char *modname;
3777 kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);
3779 if (mod_g) {
3780 int mod_matches = (modname) ? ftrace_match(modname, mod_g) : 0;
3782 /* blank module name to match all modules */
3783 if (!mod_g->len) {
3784 /* blank module globbing: modname xor exclude_mod */
3785 if (!exclude_mod != !modname)
3786 goto func_match;
3787 return 0;
3791 * exclude_mod is set to trace everything but the given
3792 * module. If it is set and the module matches, then
3793 * return 0. If it is not set, and the module doesn't match
3794 * also return 0. Otherwise, check the function to see if
3795 * that matches.
3797 if (!mod_matches == !exclude_mod)
3798 return 0;
3799 func_match:
3800 /* blank search means to match all funcs in the mod */
3801 if (!func_g->len)
3802 return 1;
3805 return ftrace_match(str, func_g);
3808 static int
3809 match_records(struct ftrace_hash *hash, char *func, int len, char *mod)
3811 struct ftrace_page *pg;
3812 struct dyn_ftrace *rec;
3813 struct ftrace_glob func_g = { .type = MATCH_FULL };
3814 struct ftrace_glob mod_g = { .type = MATCH_FULL };
3815 struct ftrace_glob *mod_match = (mod) ? &mod_g : NULL;
3816 int exclude_mod = 0;
3817 int found = 0;
3818 int ret;
3819 int clear_filter;
3821 if (func) {
3822 func_g.type = filter_parse_regex(func, len, &func_g.search,
3823 &clear_filter);
3824 func_g.len = strlen(func_g.search);
3827 if (mod) {
3828 mod_g.type = filter_parse_regex(mod, strlen(mod),
3829 &mod_g.search, &exclude_mod);
3830 mod_g.len = strlen(mod_g.search);
3833 mutex_lock(&ftrace_lock);
3835 if (unlikely(ftrace_disabled))
3836 goto out_unlock;
3838 do_for_each_ftrace_rec(pg, rec) {
3840 if (rec->flags & FTRACE_FL_DISABLED)
3841 continue;
3843 if (ftrace_match_record(rec, &func_g, mod_match, exclude_mod)) {
3844 ret = enter_record(hash, rec, clear_filter);
3845 if (ret < 0) {
3846 found = ret;
3847 goto out_unlock;
3849 found = 1;
3851 } while_for_each_ftrace_rec();
3852 out_unlock:
3853 mutex_unlock(&ftrace_lock);
3855 return found;
3858 static int
3859 ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
3861 return match_records(hash, buff, len, NULL);
3864 static void ftrace_ops_update_code(struct ftrace_ops *ops,
3865 struct ftrace_ops_hash *old_hash)
3867 struct ftrace_ops *op;
3869 if (!ftrace_enabled)
3870 return;
3872 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
3873 ftrace_run_modify_code(ops, FTRACE_UPDATE_CALLS, old_hash);
3874 return;
3878 * If this is the shared global_ops filter, then we need to
3879 * check if there is another ops that shares it, is enabled.
3880 * If so, we still need to run the modify code.
3882 if (ops->func_hash != &global_ops.local_hash)
3883 return;
3885 do_for_each_ftrace_op(op, ftrace_ops_list) {
3886 if (op->func_hash == &global_ops.local_hash &&
3887 op->flags & FTRACE_OPS_FL_ENABLED) {
3888 ftrace_run_modify_code(op, FTRACE_UPDATE_CALLS, old_hash);
3889 /* Only need to do this once */
3890 return;
3892 } while_for_each_ftrace_op(op);
3895 static int ftrace_hash_move_and_update_ops(struct ftrace_ops *ops,
3896 struct ftrace_hash **orig_hash,
3897 struct ftrace_hash *hash,
3898 int enable)
3900 struct ftrace_ops_hash old_hash_ops;
3901 struct ftrace_hash *old_hash;
3902 int ret;
3904 old_hash = *orig_hash;
3905 old_hash_ops.filter_hash = ops->func_hash->filter_hash;
3906 old_hash_ops.notrace_hash = ops->func_hash->notrace_hash;
3907 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
3908 if (!ret) {
3909 ftrace_ops_update_code(ops, &old_hash_ops);
3910 free_ftrace_hash_rcu(old_hash);
3912 return ret;
3915 static bool module_exists(const char *module)
3917 /* All modules have the symbol __this_module */
3918 const char this_mod[] = "__this_module";
3919 const int modname_size = MAX_PARAM_PREFIX_LEN + sizeof(this_mod) + 1;
3920 char modname[modname_size + 1];
3921 unsigned long val;
3922 int n;
3924 n = snprintf(modname, modname_size + 1, "%s:%s", module, this_mod);
3926 if (n > modname_size)
3927 return false;
3929 val = module_kallsyms_lookup_name(modname);
3930 return val != 0;
3933 static int cache_mod(struct trace_array *tr,
3934 const char *func, char *module, int enable)
3936 struct ftrace_mod_load *ftrace_mod, *n;
3937 struct list_head *head = enable ? &tr->mod_trace : &tr->mod_notrace;
3938 int ret;
3940 mutex_lock(&ftrace_lock);
3942 /* We do not cache inverse filters */
3943 if (func[0] == '!') {
3944 func++;
3945 ret = -EINVAL;
3947 /* Look to remove this hash */
3948 list_for_each_entry_safe(ftrace_mod, n, head, list) {
3949 if (strcmp(ftrace_mod->module, module) != 0)
3950 continue;
3952 /* no func matches all */
3953 if (!func || strcmp(func, "*") == 0 ||
3954 (ftrace_mod->func &&
3955 strcmp(ftrace_mod->func, func) == 0)) {
3956 ret = 0;
3957 free_ftrace_mod(ftrace_mod);
3958 continue;
3961 goto out;
3964 ret = -EINVAL;
3965 /* We only care about modules that have not been loaded yet */
3966 if (module_exists(module))
3967 goto out;
3969 /* Save this string off, and execute it when the module is loaded */
3970 ret = ftrace_add_mod(tr, func, module, enable);
3971 out:
3972 mutex_unlock(&ftrace_lock);
3974 return ret;
3977 static int
3978 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
3979 int reset, int enable);
3981 static void process_mod_list(struct list_head *head, struct ftrace_ops *ops,
3982 char *mod, bool enable)
3984 struct ftrace_mod_load *ftrace_mod, *n;
3985 struct ftrace_hash **orig_hash, *new_hash;
3986 LIST_HEAD(process_mods);
3987 char *func;
3988 int ret;
3990 mutex_lock(&ops->func_hash->regex_lock);
3992 if (enable)
3993 orig_hash = &ops->func_hash->filter_hash;
3994 else
3995 orig_hash = &ops->func_hash->notrace_hash;
3997 new_hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS,
3998 *orig_hash);
3999 if (!new_hash)
4000 goto out; /* warn? */
4002 mutex_lock(&ftrace_lock);
4004 list_for_each_entry_safe(ftrace_mod, n, head, list) {
4006 if (strcmp(ftrace_mod->module, mod) != 0)
4007 continue;
4009 if (ftrace_mod->func)
4010 func = kstrdup(ftrace_mod->func, GFP_KERNEL);
4011 else
4012 func = kstrdup("*", GFP_KERNEL);
4014 if (!func) /* warn? */
4015 continue;
4017 list_del(&ftrace_mod->list);
4018 list_add(&ftrace_mod->list, &process_mods);
4020 /* Use the newly allocated func, as it may be "*" */
4021 kfree(ftrace_mod->func);
4022 ftrace_mod->func = func;
4025 mutex_unlock(&ftrace_lock);
4027 list_for_each_entry_safe(ftrace_mod, n, &process_mods, list) {
4029 func = ftrace_mod->func;
4031 /* Grabs ftrace_lock, which is why we have this extra step */
4032 match_records(new_hash, func, strlen(func), mod);
4033 free_ftrace_mod(ftrace_mod);
4036 if (enable && list_empty(head))
4037 new_hash->flags &= ~FTRACE_HASH_FL_MOD;
4039 mutex_lock(&ftrace_lock);
4041 ret = ftrace_hash_move_and_update_ops(ops, orig_hash,
4042 new_hash, enable);
4043 mutex_unlock(&ftrace_lock);
4045 out:
4046 mutex_unlock(&ops->func_hash->regex_lock);
4048 free_ftrace_hash(new_hash);
4051 static void process_cached_mods(const char *mod_name)
4053 struct trace_array *tr;
4054 char *mod;
4056 mod = kstrdup(mod_name, GFP_KERNEL);
4057 if (!mod)
4058 return;
4060 mutex_lock(&trace_types_lock);
4061 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
4062 if (!list_empty(&tr->mod_trace))
4063 process_mod_list(&tr->mod_trace, tr->ops, mod, true);
4064 if (!list_empty(&tr->mod_notrace))
4065 process_mod_list(&tr->mod_notrace, tr->ops, mod, false);
4067 mutex_unlock(&trace_types_lock);
4069 kfree(mod);
4073 * We register the module command as a template to show others how
4074 * to register the a command as well.
4077 static int
4078 ftrace_mod_callback(struct trace_array *tr, struct ftrace_hash *hash,
4079 char *func_orig, char *cmd, char *module, int enable)
4081 char *func;
4082 int ret;
4084 /* match_records() modifies func, and we need the original */
4085 func = kstrdup(func_orig, GFP_KERNEL);
4086 if (!func)
4087 return -ENOMEM;
4090 * cmd == 'mod' because we only registered this func
4091 * for the 'mod' ftrace_func_command.
4092 * But if you register one func with multiple commands,
4093 * you can tell which command was used by the cmd
4094 * parameter.
4096 ret = match_records(hash, func, strlen(func), module);
4097 kfree(func);
4099 if (!ret)
4100 return cache_mod(tr, func_orig, module, enable);
4101 if (ret < 0)
4102 return ret;
4103 return 0;
4106 static struct ftrace_func_command ftrace_mod_cmd = {
4107 .name = "mod",
4108 .func = ftrace_mod_callback,
4111 static int __init ftrace_mod_cmd_init(void)
4113 return register_ftrace_command(&ftrace_mod_cmd);
4115 core_initcall(ftrace_mod_cmd_init);
4117 static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
4118 struct ftrace_ops *op, struct pt_regs *pt_regs)
4120 struct ftrace_probe_ops *probe_ops;
4121 struct ftrace_func_probe *probe;
4123 probe = container_of(op, struct ftrace_func_probe, ops);
4124 probe_ops = probe->probe_ops;
4127 * Disable preemption for these calls to prevent a RCU grace
4128 * period. This syncs the hash iteration and freeing of items
4129 * on the hash. rcu_read_lock is too dangerous here.
4131 preempt_disable_notrace();
4132 probe_ops->func(ip, parent_ip, probe->tr, probe_ops, probe->data);
4133 preempt_enable_notrace();
4136 struct ftrace_func_map {
4137 struct ftrace_func_entry entry;
4138 void *data;
4141 struct ftrace_func_mapper {
4142 struct ftrace_hash hash;
4146 * allocate_ftrace_func_mapper - allocate a new ftrace_func_mapper
4148 * Returns a ftrace_func_mapper descriptor that can be used to map ips to data.
4150 struct ftrace_func_mapper *allocate_ftrace_func_mapper(void)
4152 struct ftrace_hash *hash;
4155 * The mapper is simply a ftrace_hash, but since the entries
4156 * in the hash are not ftrace_func_entry type, we define it
4157 * as a separate structure.
4159 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4160 return (struct ftrace_func_mapper *)hash;
4164 * ftrace_func_mapper_find_ip - Find some data mapped to an ip
4165 * @mapper: The mapper that has the ip maps
4166 * @ip: the instruction pointer to find the data for
4168 * Returns the data mapped to @ip if found otherwise NULL. The return
4169 * is actually the address of the mapper data pointer. The address is
4170 * returned for use cases where the data is no bigger than a long, and
4171 * the user can use the data pointer as its data instead of having to
4172 * allocate more memory for the reference.
4174 void **ftrace_func_mapper_find_ip(struct ftrace_func_mapper *mapper,
4175 unsigned long ip)
4177 struct ftrace_func_entry *entry;
4178 struct ftrace_func_map *map;
4180 entry = ftrace_lookup_ip(&mapper->hash, ip);
4181 if (!entry)
4182 return NULL;
4184 map = (struct ftrace_func_map *)entry;
4185 return &map->data;
4189 * ftrace_func_mapper_add_ip - Map some data to an ip
4190 * @mapper: The mapper that has the ip maps
4191 * @ip: The instruction pointer address to map @data to
4192 * @data: The data to map to @ip
4194 * Returns 0 on succes otherwise an error.
4196 int ftrace_func_mapper_add_ip(struct ftrace_func_mapper *mapper,
4197 unsigned long ip, void *data)
4199 struct ftrace_func_entry *entry;
4200 struct ftrace_func_map *map;
4202 entry = ftrace_lookup_ip(&mapper->hash, ip);
4203 if (entry)
4204 return -EBUSY;
4206 map = kmalloc(sizeof(*map), GFP_KERNEL);
4207 if (!map)
4208 return -ENOMEM;
4210 map->entry.ip = ip;
4211 map->data = data;
4213 __add_hash_entry(&mapper->hash, &map->entry);
4215 return 0;
4219 * ftrace_func_mapper_remove_ip - Remove an ip from the mapping
4220 * @mapper: The mapper that has the ip maps
4221 * @ip: The instruction pointer address to remove the data from
4223 * Returns the data if it is found, otherwise NULL.
4224 * Note, if the data pointer is used as the data itself, (see
4225 * ftrace_func_mapper_find_ip(), then the return value may be meaningless,
4226 * if the data pointer was set to zero.
4228 void *ftrace_func_mapper_remove_ip(struct ftrace_func_mapper *mapper,
4229 unsigned long ip)
4231 struct ftrace_func_entry *entry;
4232 struct ftrace_func_map *map;
4233 void *data;
4235 entry = ftrace_lookup_ip(&mapper->hash, ip);
4236 if (!entry)
4237 return NULL;
4239 map = (struct ftrace_func_map *)entry;
4240 data = map->data;
4242 remove_hash_entry(&mapper->hash, entry);
4243 kfree(entry);
4245 return data;
4249 * free_ftrace_func_mapper - free a mapping of ips and data
4250 * @mapper: The mapper that has the ip maps
4251 * @free_func: A function to be called on each data item.
4253 * This is used to free the function mapper. The @free_func is optional
4254 * and can be used if the data needs to be freed as well.
4256 void free_ftrace_func_mapper(struct ftrace_func_mapper *mapper,
4257 ftrace_mapper_func free_func)
4259 struct ftrace_func_entry *entry;
4260 struct ftrace_func_map *map;
4261 struct hlist_head *hhd;
4262 int size = 1 << mapper->hash.size_bits;
4263 int i;
4265 if (free_func && mapper->hash.count) {
4266 for (i = 0; i < size; i++) {
4267 hhd = &mapper->hash.buckets[i];
4268 hlist_for_each_entry(entry, hhd, hlist) {
4269 map = (struct ftrace_func_map *)entry;
4270 free_func(map);
4274 free_ftrace_hash(&mapper->hash);
4277 static void release_probe(struct ftrace_func_probe *probe)
4279 struct ftrace_probe_ops *probe_ops;
4281 mutex_lock(&ftrace_lock);
4283 WARN_ON(probe->ref <= 0);
4285 /* Subtract the ref that was used to protect this instance */
4286 probe->ref--;
4288 if (!probe->ref) {
4289 probe_ops = probe->probe_ops;
4291 * Sending zero as ip tells probe_ops to free
4292 * the probe->data itself
4294 if (probe_ops->free)
4295 probe_ops->free(probe_ops, probe->tr, 0, probe->data);
4296 list_del(&probe->list);
4297 kfree(probe);
4299 mutex_unlock(&ftrace_lock);
4302 static void acquire_probe_locked(struct ftrace_func_probe *probe)
4305 * Add one ref to keep it from being freed when releasing the
4306 * ftrace_lock mutex.
4308 probe->ref++;
4312 register_ftrace_function_probe(char *glob, struct trace_array *tr,
4313 struct ftrace_probe_ops *probe_ops,
4314 void *data)
4316 struct ftrace_func_entry *entry;
4317 struct ftrace_func_probe *probe;
4318 struct ftrace_hash **orig_hash;
4319 struct ftrace_hash *old_hash;
4320 struct ftrace_hash *hash;
4321 int count = 0;
4322 int size;
4323 int ret;
4324 int i;
4326 if (WARN_ON(!tr))
4327 return -EINVAL;
4329 /* We do not support '!' for function probes */
4330 if (WARN_ON(glob[0] == '!'))
4331 return -EINVAL;
4334 mutex_lock(&ftrace_lock);
4335 /* Check if the probe_ops is already registered */
4336 list_for_each_entry(probe, &tr->func_probes, list) {
4337 if (probe->probe_ops == probe_ops)
4338 break;
4340 if (&probe->list == &tr->func_probes) {
4341 probe = kzalloc(sizeof(*probe), GFP_KERNEL);
4342 if (!probe) {
4343 mutex_unlock(&ftrace_lock);
4344 return -ENOMEM;
4346 probe->probe_ops = probe_ops;
4347 probe->ops.func = function_trace_probe_call;
4348 probe->tr = tr;
4349 ftrace_ops_init(&probe->ops);
4350 list_add(&probe->list, &tr->func_probes);
4353 acquire_probe_locked(probe);
4355 mutex_unlock(&ftrace_lock);
4357 mutex_lock(&probe->ops.func_hash->regex_lock);
4359 orig_hash = &probe->ops.func_hash->filter_hash;
4360 old_hash = *orig_hash;
4361 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4363 ret = ftrace_match_records(hash, glob, strlen(glob));
4365 /* Nothing found? */
4366 if (!ret)
4367 ret = -EINVAL;
4369 if (ret < 0)
4370 goto out;
4372 size = 1 << hash->size_bits;
4373 for (i = 0; i < size; i++) {
4374 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4375 if (ftrace_lookup_ip(old_hash, entry->ip))
4376 continue;
4378 * The caller might want to do something special
4379 * for each function we find. We call the callback
4380 * to give the caller an opportunity to do so.
4382 if (probe_ops->init) {
4383 ret = probe_ops->init(probe_ops, tr,
4384 entry->ip, data,
4385 &probe->data);
4386 if (ret < 0) {
4387 if (probe_ops->free && count)
4388 probe_ops->free(probe_ops, tr,
4389 0, probe->data);
4390 probe->data = NULL;
4391 goto out;
4394 count++;
4398 mutex_lock(&ftrace_lock);
4400 if (!count) {
4401 /* Nothing was added? */
4402 ret = -EINVAL;
4403 goto out_unlock;
4406 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4407 hash, 1);
4408 if (ret < 0)
4409 goto err_unlock;
4411 /* One ref for each new function traced */
4412 probe->ref += count;
4414 if (!(probe->ops.flags & FTRACE_OPS_FL_ENABLED))
4415 ret = ftrace_startup(&probe->ops, 0);
4417 out_unlock:
4418 mutex_unlock(&ftrace_lock);
4420 if (!ret)
4421 ret = count;
4422 out:
4423 mutex_unlock(&probe->ops.func_hash->regex_lock);
4424 free_ftrace_hash(hash);
4426 release_probe(probe);
4428 return ret;
4430 err_unlock:
4431 if (!probe_ops->free || !count)
4432 goto out_unlock;
4434 /* Failed to do the move, need to call the free functions */
4435 for (i = 0; i < size; i++) {
4436 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4437 if (ftrace_lookup_ip(old_hash, entry->ip))
4438 continue;
4439 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4442 goto out_unlock;
4446 unregister_ftrace_function_probe_func(char *glob, struct trace_array *tr,
4447 struct ftrace_probe_ops *probe_ops)
4449 struct ftrace_ops_hash old_hash_ops;
4450 struct ftrace_func_entry *entry;
4451 struct ftrace_func_probe *probe;
4452 struct ftrace_glob func_g;
4453 struct ftrace_hash **orig_hash;
4454 struct ftrace_hash *old_hash;
4455 struct ftrace_hash *hash = NULL;
4456 struct hlist_node *tmp;
4457 struct hlist_head hhd;
4458 char str[KSYM_SYMBOL_LEN];
4459 int count = 0;
4460 int i, ret = -ENODEV;
4461 int size;
4463 if (!glob || !strlen(glob) || !strcmp(glob, "*"))
4464 func_g.search = NULL;
4465 else {
4466 int not;
4468 func_g.type = filter_parse_regex(glob, strlen(glob),
4469 &func_g.search, &not);
4470 func_g.len = strlen(func_g.search);
4471 func_g.search = glob;
4473 /* we do not support '!' for function probes */
4474 if (WARN_ON(not))
4475 return -EINVAL;
4478 mutex_lock(&ftrace_lock);
4479 /* Check if the probe_ops is already registered */
4480 list_for_each_entry(probe, &tr->func_probes, list) {
4481 if (probe->probe_ops == probe_ops)
4482 break;
4484 if (&probe->list == &tr->func_probes)
4485 goto err_unlock_ftrace;
4487 ret = -EINVAL;
4488 if (!(probe->ops.flags & FTRACE_OPS_FL_INITIALIZED))
4489 goto err_unlock_ftrace;
4491 acquire_probe_locked(probe);
4493 mutex_unlock(&ftrace_lock);
4495 mutex_lock(&probe->ops.func_hash->regex_lock);
4497 orig_hash = &probe->ops.func_hash->filter_hash;
4498 old_hash = *orig_hash;
4500 if (ftrace_hash_empty(old_hash))
4501 goto out_unlock;
4503 old_hash_ops.filter_hash = old_hash;
4504 /* Probes only have filters */
4505 old_hash_ops.notrace_hash = NULL;
4507 ret = -ENOMEM;
4508 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4509 if (!hash)
4510 goto out_unlock;
4512 INIT_HLIST_HEAD(&hhd);
4514 size = 1 << hash->size_bits;
4515 for (i = 0; i < size; i++) {
4516 hlist_for_each_entry_safe(entry, tmp, &hash->buckets[i], hlist) {
4518 if (func_g.search) {
4519 kallsyms_lookup(entry->ip, NULL, NULL,
4520 NULL, str);
4521 if (!ftrace_match(str, &func_g))
4522 continue;
4524 count++;
4525 remove_hash_entry(hash, entry);
4526 hlist_add_head(&entry->hlist, &hhd);
4530 /* Nothing found? */
4531 if (!count) {
4532 ret = -EINVAL;
4533 goto out_unlock;
4536 mutex_lock(&ftrace_lock);
4538 WARN_ON(probe->ref < count);
4540 probe->ref -= count;
4542 if (ftrace_hash_empty(hash))
4543 ftrace_shutdown(&probe->ops, 0);
4545 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4546 hash, 1);
4548 /* still need to update the function call sites */
4549 if (ftrace_enabled && !ftrace_hash_empty(hash))
4550 ftrace_run_modify_code(&probe->ops, FTRACE_UPDATE_CALLS,
4551 &old_hash_ops);
4552 synchronize_sched();
4554 hlist_for_each_entry_safe(entry, tmp, &hhd, hlist) {
4555 hlist_del(&entry->hlist);
4556 if (probe_ops->free)
4557 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4558 kfree(entry);
4560 mutex_unlock(&ftrace_lock);
4562 out_unlock:
4563 mutex_unlock(&probe->ops.func_hash->regex_lock);
4564 free_ftrace_hash(hash);
4566 release_probe(probe);
4568 return ret;
4570 err_unlock_ftrace:
4571 mutex_unlock(&ftrace_lock);
4572 return ret;
4575 void clear_ftrace_function_probes(struct trace_array *tr)
4577 struct ftrace_func_probe *probe, *n;
4579 list_for_each_entry_safe(probe, n, &tr->func_probes, list)
4580 unregister_ftrace_function_probe_func(NULL, tr, probe->probe_ops);
4583 static LIST_HEAD(ftrace_commands);
4584 static DEFINE_MUTEX(ftrace_cmd_mutex);
4587 * Currently we only register ftrace commands from __init, so mark this
4588 * __init too.
4590 __init int register_ftrace_command(struct ftrace_func_command *cmd)
4592 struct ftrace_func_command *p;
4593 int ret = 0;
4595 mutex_lock(&ftrace_cmd_mutex);
4596 list_for_each_entry(p, &ftrace_commands, list) {
4597 if (strcmp(cmd->name, p->name) == 0) {
4598 ret = -EBUSY;
4599 goto out_unlock;
4602 list_add(&cmd->list, &ftrace_commands);
4603 out_unlock:
4604 mutex_unlock(&ftrace_cmd_mutex);
4606 return ret;
4610 * Currently we only unregister ftrace commands from __init, so mark
4611 * this __init too.
4613 __init int unregister_ftrace_command(struct ftrace_func_command *cmd)
4615 struct ftrace_func_command *p, *n;
4616 int ret = -ENODEV;
4618 mutex_lock(&ftrace_cmd_mutex);
4619 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
4620 if (strcmp(cmd->name, p->name) == 0) {
4621 ret = 0;
4622 list_del_init(&p->list);
4623 goto out_unlock;
4626 out_unlock:
4627 mutex_unlock(&ftrace_cmd_mutex);
4629 return ret;
4632 static int ftrace_process_regex(struct ftrace_iterator *iter,
4633 char *buff, int len, int enable)
4635 struct ftrace_hash *hash = iter->hash;
4636 struct trace_array *tr = iter->ops->private;
4637 char *func, *command, *next = buff;
4638 struct ftrace_func_command *p;
4639 int ret = -EINVAL;
4641 func = strsep(&next, ":");
4643 if (!next) {
4644 ret = ftrace_match_records(hash, func, len);
4645 if (!ret)
4646 ret = -EINVAL;
4647 if (ret < 0)
4648 return ret;
4649 return 0;
4652 /* command found */
4654 command = strsep(&next, ":");
4656 mutex_lock(&ftrace_cmd_mutex);
4657 list_for_each_entry(p, &ftrace_commands, list) {
4658 if (strcmp(p->name, command) == 0) {
4659 ret = p->func(tr, hash, func, command, next, enable);
4660 goto out_unlock;
4663 out_unlock:
4664 mutex_unlock(&ftrace_cmd_mutex);
4666 return ret;
4669 static ssize_t
4670 ftrace_regex_write(struct file *file, const char __user *ubuf,
4671 size_t cnt, loff_t *ppos, int enable)
4673 struct ftrace_iterator *iter;
4674 struct trace_parser *parser;
4675 ssize_t ret, read;
4677 if (!cnt)
4678 return 0;
4680 if (file->f_mode & FMODE_READ) {
4681 struct seq_file *m = file->private_data;
4682 iter = m->private;
4683 } else
4684 iter = file->private_data;
4686 if (unlikely(ftrace_disabled))
4687 return -ENODEV;
4689 /* iter->hash is a local copy, so we don't need regex_lock */
4691 parser = &iter->parser;
4692 read = trace_get_user(parser, ubuf, cnt, ppos);
4694 if (read >= 0 && trace_parser_loaded(parser) &&
4695 !trace_parser_cont(parser)) {
4696 ret = ftrace_process_regex(iter, parser->buffer,
4697 parser->idx, enable);
4698 trace_parser_clear(parser);
4699 if (ret < 0)
4700 goto out;
4703 ret = read;
4704 out:
4705 return ret;
4708 ssize_t
4709 ftrace_filter_write(struct file *file, const char __user *ubuf,
4710 size_t cnt, loff_t *ppos)
4712 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
4715 ssize_t
4716 ftrace_notrace_write(struct file *file, const char __user *ubuf,
4717 size_t cnt, loff_t *ppos)
4719 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
4722 static int
4723 ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
4725 struct ftrace_func_entry *entry;
4727 if (!ftrace_location(ip))
4728 return -EINVAL;
4730 if (remove) {
4731 entry = ftrace_lookup_ip(hash, ip);
4732 if (!entry)
4733 return -ENOENT;
4734 free_hash_entry(hash, entry);
4735 return 0;
4738 return add_hash_entry(hash, ip);
4741 static int
4742 ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
4743 unsigned long ip, int remove, int reset, int enable)
4745 struct ftrace_hash **orig_hash;
4746 struct ftrace_hash *hash;
4747 int ret;
4749 if (unlikely(ftrace_disabled))
4750 return -ENODEV;
4752 mutex_lock(&ops->func_hash->regex_lock);
4754 if (enable)
4755 orig_hash = &ops->func_hash->filter_hash;
4756 else
4757 orig_hash = &ops->func_hash->notrace_hash;
4759 if (reset)
4760 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4761 else
4762 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
4764 if (!hash) {
4765 ret = -ENOMEM;
4766 goto out_regex_unlock;
4769 if (buf && !ftrace_match_records(hash, buf, len)) {
4770 ret = -EINVAL;
4771 goto out_regex_unlock;
4773 if (ip) {
4774 ret = ftrace_match_addr(hash, ip, remove);
4775 if (ret < 0)
4776 goto out_regex_unlock;
4779 mutex_lock(&ftrace_lock);
4780 ret = ftrace_hash_move_and_update_ops(ops, orig_hash, hash, enable);
4781 mutex_unlock(&ftrace_lock);
4783 out_regex_unlock:
4784 mutex_unlock(&ops->func_hash->regex_lock);
4786 free_ftrace_hash(hash);
4787 return ret;
4790 static int
4791 ftrace_set_addr(struct ftrace_ops *ops, unsigned long ip, int remove,
4792 int reset, int enable)
4794 return ftrace_set_hash(ops, 0, 0, ip, remove, reset, enable);
4798 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
4799 * @ops - the ops to set the filter with
4800 * @ip - the address to add to or remove from the filter.
4801 * @remove - non zero to remove the ip from the filter
4802 * @reset - non zero to reset all filters before applying this filter.
4804 * Filters denote which functions should be enabled when tracing is enabled
4805 * If @ip is NULL, it failes to update filter.
4807 int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
4808 int remove, int reset)
4810 ftrace_ops_init(ops);
4811 return ftrace_set_addr(ops, ip, remove, reset, 1);
4813 EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
4816 * ftrace_ops_set_global_filter - setup ops to use global filters
4817 * @ops - the ops which will use the global filters
4819 * ftrace users who need global function trace filtering should call this.
4820 * It can set the global filter only if ops were not initialized before.
4822 void ftrace_ops_set_global_filter(struct ftrace_ops *ops)
4824 if (ops->flags & FTRACE_OPS_FL_INITIALIZED)
4825 return;
4827 ftrace_ops_init(ops);
4828 ops->func_hash = &global_ops.local_hash;
4830 EXPORT_SYMBOL_GPL(ftrace_ops_set_global_filter);
4832 static int
4833 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
4834 int reset, int enable)
4836 return ftrace_set_hash(ops, buf, len, 0, 0, reset, enable);
4840 * ftrace_set_filter - set a function to filter on in ftrace
4841 * @ops - the ops to set the filter with
4842 * @buf - the string that holds the function filter text.
4843 * @len - the length of the string.
4844 * @reset - non zero to reset all filters before applying this filter.
4846 * Filters denote which functions should be enabled when tracing is enabled.
4847 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4849 int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
4850 int len, int reset)
4852 ftrace_ops_init(ops);
4853 return ftrace_set_regex(ops, buf, len, reset, 1);
4855 EXPORT_SYMBOL_GPL(ftrace_set_filter);
4858 * ftrace_set_notrace - set a function to not trace in ftrace
4859 * @ops - the ops to set the notrace filter with
4860 * @buf - the string that holds the function notrace text.
4861 * @len - the length of the string.
4862 * @reset - non zero to reset all filters before applying this filter.
4864 * Notrace Filters denote which functions should not be enabled when tracing
4865 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4866 * for tracing.
4868 int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
4869 int len, int reset)
4871 ftrace_ops_init(ops);
4872 return ftrace_set_regex(ops, buf, len, reset, 0);
4874 EXPORT_SYMBOL_GPL(ftrace_set_notrace);
4876 * ftrace_set_global_filter - set a function to filter on with global tracers
4877 * @buf - the string that holds the function filter text.
4878 * @len - the length of the string.
4879 * @reset - non zero to reset all filters before applying this filter.
4881 * Filters denote which functions should be enabled when tracing is enabled.
4882 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4884 void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
4886 ftrace_set_regex(&global_ops, buf, len, reset, 1);
4888 EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
4891 * ftrace_set_global_notrace - set a function to not trace with global tracers
4892 * @buf - the string that holds the function notrace text.
4893 * @len - the length of the string.
4894 * @reset - non zero to reset all filters before applying this filter.
4896 * Notrace Filters denote which functions should not be enabled when tracing
4897 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4898 * for tracing.
4900 void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
4902 ftrace_set_regex(&global_ops, buf, len, reset, 0);
4904 EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
4907 * command line interface to allow users to set filters on boot up.
4909 #define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
4910 static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4911 static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
4913 /* Used by function selftest to not test if filter is set */
4914 bool ftrace_filter_param __initdata;
4916 static int __init set_ftrace_notrace(char *str)
4918 ftrace_filter_param = true;
4919 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
4920 return 1;
4922 __setup("ftrace_notrace=", set_ftrace_notrace);
4924 static int __init set_ftrace_filter(char *str)
4926 ftrace_filter_param = true;
4927 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
4928 return 1;
4930 __setup("ftrace_filter=", set_ftrace_filter);
4932 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4933 static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
4934 static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4935 static int ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer);
4937 static unsigned long save_global_trampoline;
4938 static unsigned long save_global_flags;
4940 static int __init set_graph_function(char *str)
4942 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
4943 return 1;
4945 __setup("ftrace_graph_filter=", set_graph_function);
4947 static int __init set_graph_notrace_function(char *str)
4949 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
4950 return 1;
4952 __setup("ftrace_graph_notrace=", set_graph_notrace_function);
4954 static int __init set_graph_max_depth_function(char *str)
4956 if (!str)
4957 return 0;
4958 fgraph_max_depth = simple_strtoul(str, NULL, 0);
4959 return 1;
4961 __setup("ftrace_graph_max_depth=", set_graph_max_depth_function);
4963 static void __init set_ftrace_early_graph(char *buf, int enable)
4965 int ret;
4966 char *func;
4967 struct ftrace_hash *hash;
4969 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4970 if (WARN_ON(!hash))
4971 return;
4973 while (buf) {
4974 func = strsep(&buf, ",");
4975 /* we allow only one expression at a time */
4976 ret = ftrace_graph_set_hash(hash, func);
4977 if (ret)
4978 printk(KERN_DEBUG "ftrace: function %s not "
4979 "traceable\n", func);
4982 if (enable)
4983 ftrace_graph_hash = hash;
4984 else
4985 ftrace_graph_notrace_hash = hash;
4987 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4989 void __init
4990 ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
4992 char *func;
4994 ftrace_ops_init(ops);
4996 while (buf) {
4997 func = strsep(&buf, ",");
4998 ftrace_set_regex(ops, func, strlen(func), 0, enable);
5002 static void __init set_ftrace_early_filters(void)
5004 if (ftrace_filter_buf[0])
5005 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
5006 if (ftrace_notrace_buf[0])
5007 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
5008 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5009 if (ftrace_graph_buf[0])
5010 set_ftrace_early_graph(ftrace_graph_buf, 1);
5011 if (ftrace_graph_notrace_buf[0])
5012 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
5013 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5016 int ftrace_regex_release(struct inode *inode, struct file *file)
5018 struct seq_file *m = (struct seq_file *)file->private_data;
5019 struct ftrace_iterator *iter;
5020 struct ftrace_hash **orig_hash;
5021 struct trace_parser *parser;
5022 int filter_hash;
5023 int ret;
5025 if (file->f_mode & FMODE_READ) {
5026 iter = m->private;
5027 seq_release(inode, file);
5028 } else
5029 iter = file->private_data;
5031 parser = &iter->parser;
5032 if (trace_parser_loaded(parser)) {
5033 parser->buffer[parser->idx] = 0;
5034 ftrace_match_records(iter->hash, parser->buffer, parser->idx);
5037 trace_parser_put(parser);
5039 mutex_lock(&iter->ops->func_hash->regex_lock);
5041 if (file->f_mode & FMODE_WRITE) {
5042 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
5044 if (filter_hash) {
5045 orig_hash = &iter->ops->func_hash->filter_hash;
5046 if (iter->tr && !list_empty(&iter->tr->mod_trace))
5047 iter->hash->flags |= FTRACE_HASH_FL_MOD;
5048 } else
5049 orig_hash = &iter->ops->func_hash->notrace_hash;
5051 mutex_lock(&ftrace_lock);
5052 ret = ftrace_hash_move_and_update_ops(iter->ops, orig_hash,
5053 iter->hash, filter_hash);
5054 mutex_unlock(&ftrace_lock);
5055 } else {
5056 /* For read only, the hash is the ops hash */
5057 iter->hash = NULL;
5060 mutex_unlock(&iter->ops->func_hash->regex_lock);
5061 free_ftrace_hash(iter->hash);
5062 kfree(iter);
5064 return 0;
5067 static const struct file_operations ftrace_avail_fops = {
5068 .open = ftrace_avail_open,
5069 .read = seq_read,
5070 .llseek = seq_lseek,
5071 .release = seq_release_private,
5074 static const struct file_operations ftrace_enabled_fops = {
5075 .open = ftrace_enabled_open,
5076 .read = seq_read,
5077 .llseek = seq_lseek,
5078 .release = seq_release_private,
5081 static const struct file_operations ftrace_filter_fops = {
5082 .open = ftrace_filter_open,
5083 .read = seq_read,
5084 .write = ftrace_filter_write,
5085 .llseek = tracing_lseek,
5086 .release = ftrace_regex_release,
5089 static const struct file_operations ftrace_notrace_fops = {
5090 .open = ftrace_notrace_open,
5091 .read = seq_read,
5092 .write = ftrace_notrace_write,
5093 .llseek = tracing_lseek,
5094 .release = ftrace_regex_release,
5097 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5099 static DEFINE_MUTEX(graph_lock);
5101 struct ftrace_hash *ftrace_graph_hash = EMPTY_HASH;
5102 struct ftrace_hash *ftrace_graph_notrace_hash = EMPTY_HASH;
5104 enum graph_filter_type {
5105 GRAPH_FILTER_NOTRACE = 0,
5106 GRAPH_FILTER_FUNCTION,
5109 #define FTRACE_GRAPH_EMPTY ((void *)1)
5111 struct ftrace_graph_data {
5112 struct ftrace_hash *hash;
5113 struct ftrace_func_entry *entry;
5114 int idx; /* for hash table iteration */
5115 enum graph_filter_type type;
5116 struct ftrace_hash *new_hash;
5117 const struct seq_operations *seq_ops;
5118 struct trace_parser parser;
5121 static void *
5122 __g_next(struct seq_file *m, loff_t *pos)
5124 struct ftrace_graph_data *fgd = m->private;
5125 struct ftrace_func_entry *entry = fgd->entry;
5126 struct hlist_head *head;
5127 int i, idx = fgd->idx;
5129 if (*pos >= fgd->hash->count)
5130 return NULL;
5132 if (entry) {
5133 hlist_for_each_entry_continue(entry, hlist) {
5134 fgd->entry = entry;
5135 return entry;
5138 idx++;
5141 for (i = idx; i < 1 << fgd->hash->size_bits; i++) {
5142 head = &fgd->hash->buckets[i];
5143 hlist_for_each_entry(entry, head, hlist) {
5144 fgd->entry = entry;
5145 fgd->idx = i;
5146 return entry;
5149 return NULL;
5152 static void *
5153 g_next(struct seq_file *m, void *v, loff_t *pos)
5155 (*pos)++;
5156 return __g_next(m, pos);
5159 static void *g_start(struct seq_file *m, loff_t *pos)
5161 struct ftrace_graph_data *fgd = m->private;
5163 mutex_lock(&graph_lock);
5165 if (fgd->type == GRAPH_FILTER_FUNCTION)
5166 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
5167 lockdep_is_held(&graph_lock));
5168 else
5169 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5170 lockdep_is_held(&graph_lock));
5172 /* Nothing, tell g_show to print all functions are enabled */
5173 if (ftrace_hash_empty(fgd->hash) && !*pos)
5174 return FTRACE_GRAPH_EMPTY;
5176 fgd->idx = 0;
5177 fgd->entry = NULL;
5178 return __g_next(m, pos);
5181 static void g_stop(struct seq_file *m, void *p)
5183 mutex_unlock(&graph_lock);
5186 static int g_show(struct seq_file *m, void *v)
5188 struct ftrace_func_entry *entry = v;
5190 if (!entry)
5191 return 0;
5193 if (entry == FTRACE_GRAPH_EMPTY) {
5194 struct ftrace_graph_data *fgd = m->private;
5196 if (fgd->type == GRAPH_FILTER_FUNCTION)
5197 seq_puts(m, "#### all functions enabled ####\n");
5198 else
5199 seq_puts(m, "#### no functions disabled ####\n");
5200 return 0;
5203 seq_printf(m, "%ps\n", (void *)entry->ip);
5205 return 0;
5208 static const struct seq_operations ftrace_graph_seq_ops = {
5209 .start = g_start,
5210 .next = g_next,
5211 .stop = g_stop,
5212 .show = g_show,
5215 static int
5216 __ftrace_graph_open(struct inode *inode, struct file *file,
5217 struct ftrace_graph_data *fgd)
5219 int ret = 0;
5220 struct ftrace_hash *new_hash = NULL;
5222 if (file->f_mode & FMODE_WRITE) {
5223 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
5225 if (trace_parser_get_init(&fgd->parser, FTRACE_BUFF_MAX))
5226 return -ENOMEM;
5228 if (file->f_flags & O_TRUNC)
5229 new_hash = alloc_ftrace_hash(size_bits);
5230 else
5231 new_hash = alloc_and_copy_ftrace_hash(size_bits,
5232 fgd->hash);
5233 if (!new_hash) {
5234 ret = -ENOMEM;
5235 goto out;
5239 if (file->f_mode & FMODE_READ) {
5240 ret = seq_open(file, &ftrace_graph_seq_ops);
5241 if (!ret) {
5242 struct seq_file *m = file->private_data;
5243 m->private = fgd;
5244 } else {
5245 /* Failed */
5246 free_ftrace_hash(new_hash);
5247 new_hash = NULL;
5249 } else
5250 file->private_data = fgd;
5252 out:
5253 if (ret < 0 && file->f_mode & FMODE_WRITE)
5254 trace_parser_put(&fgd->parser);
5256 fgd->new_hash = new_hash;
5259 * All uses of fgd->hash must be taken with the graph_lock
5260 * held. The graph_lock is going to be released, so force
5261 * fgd->hash to be reinitialized when it is taken again.
5263 fgd->hash = NULL;
5265 return ret;
5268 static int
5269 ftrace_graph_open(struct inode *inode, struct file *file)
5271 struct ftrace_graph_data *fgd;
5272 int ret;
5274 if (unlikely(ftrace_disabled))
5275 return -ENODEV;
5277 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
5278 if (fgd == NULL)
5279 return -ENOMEM;
5281 mutex_lock(&graph_lock);
5283 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
5284 lockdep_is_held(&graph_lock));
5285 fgd->type = GRAPH_FILTER_FUNCTION;
5286 fgd->seq_ops = &ftrace_graph_seq_ops;
5288 ret = __ftrace_graph_open(inode, file, fgd);
5289 if (ret < 0)
5290 kfree(fgd);
5292 mutex_unlock(&graph_lock);
5293 return ret;
5296 static int
5297 ftrace_graph_notrace_open(struct inode *inode, struct file *file)
5299 struct ftrace_graph_data *fgd;
5300 int ret;
5302 if (unlikely(ftrace_disabled))
5303 return -ENODEV;
5305 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
5306 if (fgd == NULL)
5307 return -ENOMEM;
5309 mutex_lock(&graph_lock);
5311 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5312 lockdep_is_held(&graph_lock));
5313 fgd->type = GRAPH_FILTER_NOTRACE;
5314 fgd->seq_ops = &ftrace_graph_seq_ops;
5316 ret = __ftrace_graph_open(inode, file, fgd);
5317 if (ret < 0)
5318 kfree(fgd);
5320 mutex_unlock(&graph_lock);
5321 return ret;
5324 static int
5325 ftrace_graph_release(struct inode *inode, struct file *file)
5327 struct ftrace_graph_data *fgd;
5328 struct ftrace_hash *old_hash, *new_hash;
5329 struct trace_parser *parser;
5330 int ret = 0;
5332 if (file->f_mode & FMODE_READ) {
5333 struct seq_file *m = file->private_data;
5335 fgd = m->private;
5336 seq_release(inode, file);
5337 } else {
5338 fgd = file->private_data;
5342 if (file->f_mode & FMODE_WRITE) {
5344 parser = &fgd->parser;
5346 if (trace_parser_loaded((parser))) {
5347 parser->buffer[parser->idx] = 0;
5348 ret = ftrace_graph_set_hash(fgd->new_hash,
5349 parser->buffer);
5352 trace_parser_put(parser);
5354 new_hash = __ftrace_hash_move(fgd->new_hash);
5355 if (!new_hash) {
5356 ret = -ENOMEM;
5357 goto out;
5360 mutex_lock(&graph_lock);
5362 if (fgd->type == GRAPH_FILTER_FUNCTION) {
5363 old_hash = rcu_dereference_protected(ftrace_graph_hash,
5364 lockdep_is_held(&graph_lock));
5365 rcu_assign_pointer(ftrace_graph_hash, new_hash);
5366 } else {
5367 old_hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5368 lockdep_is_held(&graph_lock));
5369 rcu_assign_pointer(ftrace_graph_notrace_hash, new_hash);
5372 mutex_unlock(&graph_lock);
5374 /* Wait till all users are no longer using the old hash */
5375 synchronize_sched();
5377 free_ftrace_hash(old_hash);
5380 out:
5381 free_ftrace_hash(fgd->new_hash);
5382 kfree(fgd);
5384 return ret;
5387 static int
5388 ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer)
5390 struct ftrace_glob func_g;
5391 struct dyn_ftrace *rec;
5392 struct ftrace_page *pg;
5393 struct ftrace_func_entry *entry;
5394 int fail = 1;
5395 int not;
5397 /* decode regex */
5398 func_g.type = filter_parse_regex(buffer, strlen(buffer),
5399 &func_g.search, &not);
5401 func_g.len = strlen(func_g.search);
5403 mutex_lock(&ftrace_lock);
5405 if (unlikely(ftrace_disabled)) {
5406 mutex_unlock(&ftrace_lock);
5407 return -ENODEV;
5410 do_for_each_ftrace_rec(pg, rec) {
5412 if (rec->flags & FTRACE_FL_DISABLED)
5413 continue;
5415 if (ftrace_match_record(rec, &func_g, NULL, 0)) {
5416 entry = ftrace_lookup_ip(hash, rec->ip);
5418 if (!not) {
5419 fail = 0;
5421 if (entry)
5422 continue;
5423 if (add_hash_entry(hash, rec->ip) < 0)
5424 goto out;
5425 } else {
5426 if (entry) {
5427 free_hash_entry(hash, entry);
5428 fail = 0;
5432 } while_for_each_ftrace_rec();
5433 out:
5434 mutex_unlock(&ftrace_lock);
5436 if (fail)
5437 return -EINVAL;
5439 return 0;
5442 static ssize_t
5443 ftrace_graph_write(struct file *file, const char __user *ubuf,
5444 size_t cnt, loff_t *ppos)
5446 ssize_t read, ret = 0;
5447 struct ftrace_graph_data *fgd = file->private_data;
5448 struct trace_parser *parser;
5450 if (!cnt)
5451 return 0;
5453 /* Read mode uses seq functions */
5454 if (file->f_mode & FMODE_READ) {
5455 struct seq_file *m = file->private_data;
5456 fgd = m->private;
5459 parser = &fgd->parser;
5461 read = trace_get_user(parser, ubuf, cnt, ppos);
5463 if (read >= 0 && trace_parser_loaded(parser) &&
5464 !trace_parser_cont(parser)) {
5466 ret = ftrace_graph_set_hash(fgd->new_hash,
5467 parser->buffer);
5468 trace_parser_clear(parser);
5471 if (!ret)
5472 ret = read;
5474 return ret;
5477 static const struct file_operations ftrace_graph_fops = {
5478 .open = ftrace_graph_open,
5479 .read = seq_read,
5480 .write = ftrace_graph_write,
5481 .llseek = tracing_lseek,
5482 .release = ftrace_graph_release,
5485 static const struct file_operations ftrace_graph_notrace_fops = {
5486 .open = ftrace_graph_notrace_open,
5487 .read = seq_read,
5488 .write = ftrace_graph_write,
5489 .llseek = tracing_lseek,
5490 .release = ftrace_graph_release,
5492 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5494 void ftrace_create_filter_files(struct ftrace_ops *ops,
5495 struct dentry *parent)
5498 trace_create_file("set_ftrace_filter", 0644, parent,
5499 ops, &ftrace_filter_fops);
5501 trace_create_file("set_ftrace_notrace", 0644, parent,
5502 ops, &ftrace_notrace_fops);
5506 * The name "destroy_filter_files" is really a misnomer. Although
5507 * in the future, it may actualy delete the files, but this is
5508 * really intended to make sure the ops passed in are disabled
5509 * and that when this function returns, the caller is free to
5510 * free the ops.
5512 * The "destroy" name is only to match the "create" name that this
5513 * should be paired with.
5515 void ftrace_destroy_filter_files(struct ftrace_ops *ops)
5517 mutex_lock(&ftrace_lock);
5518 if (ops->flags & FTRACE_OPS_FL_ENABLED)
5519 ftrace_shutdown(ops, 0);
5520 ops->flags |= FTRACE_OPS_FL_DELETED;
5521 mutex_unlock(&ftrace_lock);
5524 static __init int ftrace_init_dyn_tracefs(struct dentry *d_tracer)
5527 trace_create_file("available_filter_functions", 0444,
5528 d_tracer, NULL, &ftrace_avail_fops);
5530 trace_create_file("enabled_functions", 0444,
5531 d_tracer, NULL, &ftrace_enabled_fops);
5533 ftrace_create_filter_files(&global_ops, d_tracer);
5535 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5536 trace_create_file("set_graph_function", 0444, d_tracer,
5537 NULL,
5538 &ftrace_graph_fops);
5539 trace_create_file("set_graph_notrace", 0444, d_tracer,
5540 NULL,
5541 &ftrace_graph_notrace_fops);
5542 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5544 return 0;
5547 static int ftrace_cmp_ips(const void *a, const void *b)
5549 const unsigned long *ipa = a;
5550 const unsigned long *ipb = b;
5552 if (*ipa > *ipb)
5553 return 1;
5554 if (*ipa < *ipb)
5555 return -1;
5556 return 0;
5559 static int ftrace_process_locs(struct module *mod,
5560 unsigned long *start,
5561 unsigned long *end)
5563 struct ftrace_page *start_pg;
5564 struct ftrace_page *pg;
5565 struct dyn_ftrace *rec;
5566 unsigned long count;
5567 unsigned long *p;
5568 unsigned long addr;
5569 unsigned long flags = 0; /* Shut up gcc */
5570 int ret = -ENOMEM;
5572 count = end - start;
5574 if (!count)
5575 return 0;
5577 sort(start, count, sizeof(*start),
5578 ftrace_cmp_ips, NULL);
5580 start_pg = ftrace_allocate_pages(count);
5581 if (!start_pg)
5582 return -ENOMEM;
5584 mutex_lock(&ftrace_lock);
5587 * Core and each module needs their own pages, as
5588 * modules will free them when they are removed.
5589 * Force a new page to be allocated for modules.
5591 if (!mod) {
5592 WARN_ON(ftrace_pages || ftrace_pages_start);
5593 /* First initialization */
5594 ftrace_pages = ftrace_pages_start = start_pg;
5595 } else {
5596 if (!ftrace_pages)
5597 goto out;
5599 if (WARN_ON(ftrace_pages->next)) {
5600 /* Hmm, we have free pages? */
5601 while (ftrace_pages->next)
5602 ftrace_pages = ftrace_pages->next;
5605 ftrace_pages->next = start_pg;
5608 p = start;
5609 pg = start_pg;
5610 while (p < end) {
5611 addr = ftrace_call_adjust(*p++);
5613 * Some architecture linkers will pad between
5614 * the different mcount_loc sections of different
5615 * object files to satisfy alignments.
5616 * Skip any NULL pointers.
5618 if (!addr)
5619 continue;
5621 if (pg->index == pg->size) {
5622 /* We should have allocated enough */
5623 if (WARN_ON(!pg->next))
5624 break;
5625 pg = pg->next;
5628 rec = &pg->records[pg->index++];
5629 rec->ip = addr;
5632 /* We should have used all pages */
5633 WARN_ON(pg->next);
5635 /* Assign the last page to ftrace_pages */
5636 ftrace_pages = pg;
5639 * We only need to disable interrupts on start up
5640 * because we are modifying code that an interrupt
5641 * may execute, and the modification is not atomic.
5642 * But for modules, nothing runs the code we modify
5643 * until we are finished with it, and there's no
5644 * reason to cause large interrupt latencies while we do it.
5646 if (!mod)
5647 local_irq_save(flags);
5648 ftrace_update_code(mod, start_pg);
5649 if (!mod)
5650 local_irq_restore(flags);
5651 ret = 0;
5652 out:
5653 mutex_unlock(&ftrace_lock);
5655 return ret;
5658 #ifdef CONFIG_MODULES
5660 #define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
5662 static int referenced_filters(struct dyn_ftrace *rec)
5664 struct ftrace_ops *ops;
5665 int cnt = 0;
5667 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
5668 if (ops_references_rec(ops, rec))
5669 cnt++;
5672 return cnt;
5675 void ftrace_release_mod(struct module *mod)
5677 struct dyn_ftrace *rec;
5678 struct ftrace_page **last_pg;
5679 struct ftrace_page *pg;
5680 int order;
5682 mutex_lock(&ftrace_lock);
5684 if (ftrace_disabled)
5685 goto out_unlock;
5688 * Each module has its own ftrace_pages, remove
5689 * them from the list.
5691 last_pg = &ftrace_pages_start;
5692 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
5693 rec = &pg->records[0];
5694 if (within_module_core(rec->ip, mod)) {
5696 * As core pages are first, the first
5697 * page should never be a module page.
5699 if (WARN_ON(pg == ftrace_pages_start))
5700 goto out_unlock;
5702 /* Check if we are deleting the last page */
5703 if (pg == ftrace_pages)
5704 ftrace_pages = next_to_ftrace_page(last_pg);
5706 ftrace_update_tot_cnt -= pg->index;
5707 *last_pg = pg->next;
5708 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
5709 free_pages((unsigned long)pg->records, order);
5710 kfree(pg);
5711 } else
5712 last_pg = &pg->next;
5714 out_unlock:
5715 mutex_unlock(&ftrace_lock);
5718 void ftrace_module_enable(struct module *mod)
5720 struct dyn_ftrace *rec;
5721 struct ftrace_page *pg;
5723 mutex_lock(&ftrace_lock);
5725 if (ftrace_disabled)
5726 goto out_unlock;
5729 * If the tracing is enabled, go ahead and enable the record.
5731 * The reason not to enable the record immediatelly is the
5732 * inherent check of ftrace_make_nop/ftrace_make_call for
5733 * correct previous instructions. Making first the NOP
5734 * conversion puts the module to the correct state, thus
5735 * passing the ftrace_make_call check.
5737 * We also delay this to after the module code already set the
5738 * text to read-only, as we now need to set it back to read-write
5739 * so that we can modify the text.
5741 if (ftrace_start_up)
5742 ftrace_arch_code_modify_prepare();
5744 do_for_each_ftrace_rec(pg, rec) {
5745 int cnt;
5747 * do_for_each_ftrace_rec() is a double loop.
5748 * module text shares the pg. If a record is
5749 * not part of this module, then skip this pg,
5750 * which the "break" will do.
5752 if (!within_module_core(rec->ip, mod))
5753 break;
5755 cnt = 0;
5758 * When adding a module, we need to check if tracers are
5759 * currently enabled and if they are, and can trace this record,
5760 * we need to enable the module functions as well as update the
5761 * reference counts for those function records.
5763 if (ftrace_start_up)
5764 cnt += referenced_filters(rec);
5766 /* This clears FTRACE_FL_DISABLED */
5767 rec->flags = cnt;
5769 if (ftrace_start_up && cnt) {
5770 int failed = __ftrace_replace_code(rec, 1);
5771 if (failed) {
5772 ftrace_bug(failed, rec);
5773 goto out_loop;
5777 } while_for_each_ftrace_rec();
5779 out_loop:
5780 if (ftrace_start_up)
5781 ftrace_arch_code_modify_post_process();
5783 out_unlock:
5784 mutex_unlock(&ftrace_lock);
5786 process_cached_mods(mod->name);
5789 void ftrace_module_init(struct module *mod)
5791 if (ftrace_disabled || !mod->num_ftrace_callsites)
5792 return;
5794 ftrace_process_locs(mod, mod->ftrace_callsites,
5795 mod->ftrace_callsites + mod->num_ftrace_callsites);
5797 #endif /* CONFIG_MODULES */
5799 void __init ftrace_free_init_mem(void)
5801 unsigned long start = (unsigned long)(&__init_begin);
5802 unsigned long end = (unsigned long)(&__init_end);
5803 struct ftrace_page **last_pg = &ftrace_pages_start;
5804 struct ftrace_page *pg;
5805 struct dyn_ftrace *rec;
5806 struct dyn_ftrace key;
5807 int order;
5809 key.ip = start;
5810 key.flags = end; /* overload flags, as it is unsigned long */
5812 mutex_lock(&ftrace_lock);
5814 for (pg = ftrace_pages_start; pg; last_pg = &pg->next, pg = *last_pg) {
5815 if (end < pg->records[0].ip ||
5816 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
5817 continue;
5818 again:
5819 rec = bsearch(&key, pg->records, pg->index,
5820 sizeof(struct dyn_ftrace),
5821 ftrace_cmp_recs);
5822 if (!rec)
5823 continue;
5824 pg->index--;
5825 ftrace_update_tot_cnt--;
5826 if (!pg->index) {
5827 *last_pg = pg->next;
5828 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
5829 free_pages((unsigned long)pg->records, order);
5830 kfree(pg);
5831 pg = container_of(last_pg, struct ftrace_page, next);
5832 if (!(*last_pg))
5833 ftrace_pages = pg;
5834 continue;
5836 memmove(rec, rec + 1,
5837 (pg->index - (rec - pg->records)) * sizeof(*rec));
5838 /* More than one function may be in this block */
5839 goto again;
5841 mutex_unlock(&ftrace_lock);
5844 void __init ftrace_init(void)
5846 extern unsigned long __start_mcount_loc[];
5847 extern unsigned long __stop_mcount_loc[];
5848 unsigned long count, flags;
5849 int ret;
5851 local_irq_save(flags);
5852 ret = ftrace_dyn_arch_init();
5853 local_irq_restore(flags);
5854 if (ret)
5855 goto failed;
5857 count = __stop_mcount_loc - __start_mcount_loc;
5858 if (!count) {
5859 pr_info("ftrace: No functions to be traced?\n");
5860 goto failed;
5863 pr_info("ftrace: allocating %ld entries in %ld pages\n",
5864 count, count / ENTRIES_PER_PAGE + 1);
5866 last_ftrace_enabled = ftrace_enabled = 1;
5868 ret = ftrace_process_locs(NULL,
5869 __start_mcount_loc,
5870 __stop_mcount_loc);
5872 set_ftrace_early_filters();
5874 return;
5875 failed:
5876 ftrace_disabled = 1;
5879 /* Do nothing if arch does not support this */
5880 void __weak arch_ftrace_update_trampoline(struct ftrace_ops *ops)
5884 static void ftrace_update_trampoline(struct ftrace_ops *ops)
5886 arch_ftrace_update_trampoline(ops);
5889 void ftrace_init_trace_array(struct trace_array *tr)
5891 INIT_LIST_HEAD(&tr->func_probes);
5892 INIT_LIST_HEAD(&tr->mod_trace);
5893 INIT_LIST_HEAD(&tr->mod_notrace);
5895 #else
5897 static struct ftrace_ops global_ops = {
5898 .func = ftrace_stub,
5899 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
5900 FTRACE_OPS_FL_INITIALIZED |
5901 FTRACE_OPS_FL_PID,
5904 static int __init ftrace_nodyn_init(void)
5906 ftrace_enabled = 1;
5907 return 0;
5909 core_initcall(ftrace_nodyn_init);
5911 static inline int ftrace_init_dyn_tracefs(struct dentry *d_tracer) { return 0; }
5912 static inline void ftrace_startup_enable(int command) { }
5913 static inline void ftrace_startup_all(int command) { }
5914 /* Keep as macros so we do not need to define the commands */
5915 # define ftrace_startup(ops, command) \
5916 ({ \
5917 int ___ret = __register_ftrace_function(ops); \
5918 if (!___ret) \
5919 (ops)->flags |= FTRACE_OPS_FL_ENABLED; \
5920 ___ret; \
5922 # define ftrace_shutdown(ops, command) \
5923 ({ \
5924 int ___ret = __unregister_ftrace_function(ops); \
5925 if (!___ret) \
5926 (ops)->flags &= ~FTRACE_OPS_FL_ENABLED; \
5927 ___ret; \
5930 # define ftrace_startup_sysctl() do { } while (0)
5931 # define ftrace_shutdown_sysctl() do { } while (0)
5933 static inline int
5934 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
5936 return 1;
5939 static void ftrace_update_trampoline(struct ftrace_ops *ops)
5943 #endif /* CONFIG_DYNAMIC_FTRACE */
5945 __init void ftrace_init_global_array_ops(struct trace_array *tr)
5947 tr->ops = &global_ops;
5948 tr->ops->private = tr;
5949 ftrace_init_trace_array(tr);
5952 void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
5954 /* If we filter on pids, update to use the pid function */
5955 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
5956 if (WARN_ON(tr->ops->func != ftrace_stub))
5957 printk("ftrace ops had %pS for function\n",
5958 tr->ops->func);
5960 tr->ops->func = func;
5961 tr->ops->private = tr;
5964 void ftrace_reset_array_ops(struct trace_array *tr)
5966 tr->ops->func = ftrace_stub;
5969 static inline void
5970 __ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
5971 struct ftrace_ops *ignored, struct pt_regs *regs)
5973 struct ftrace_ops *op;
5974 int bit;
5976 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
5977 if (bit < 0)
5978 return;
5981 * Some of the ops may be dynamically allocated,
5982 * they must be freed after a synchronize_sched().
5984 preempt_disable_notrace();
5986 do_for_each_ftrace_op(op, ftrace_ops_list) {
5988 * Check the following for each ops before calling their func:
5989 * if RCU flag is set, then rcu_is_watching() must be true
5990 * if PER_CPU is set, then ftrace_function_local_disable()
5991 * must be false
5992 * Otherwise test if the ip matches the ops filter
5994 * If any of the above fails then the op->func() is not executed.
5996 if ((!(op->flags & FTRACE_OPS_FL_RCU) || rcu_is_watching()) &&
5997 (!(op->flags & FTRACE_OPS_FL_PER_CPU) ||
5998 !ftrace_function_local_disabled(op)) &&
5999 ftrace_ops_test(op, ip, regs)) {
6001 if (FTRACE_WARN_ON(!op->func)) {
6002 pr_warn("op=%p %pS\n", op, op);
6003 goto out;
6005 op->func(ip, parent_ip, op, regs);
6007 } while_for_each_ftrace_op(op);
6008 out:
6009 preempt_enable_notrace();
6010 trace_clear_recursion(bit);
6014 * Some archs only support passing ip and parent_ip. Even though
6015 * the list function ignores the op parameter, we do not want any
6016 * C side effects, where a function is called without the caller
6017 * sending a third parameter.
6018 * Archs are to support both the regs and ftrace_ops at the same time.
6019 * If they support ftrace_ops, it is assumed they support regs.
6020 * If call backs want to use regs, they must either check for regs
6021 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
6022 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
6023 * An architecture can pass partial regs with ftrace_ops and still
6024 * set the ARCH_SUPPORTS_FTRACE_OPS.
6026 #if ARCH_SUPPORTS_FTRACE_OPS
6027 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
6028 struct ftrace_ops *op, struct pt_regs *regs)
6030 __ftrace_ops_list_func(ip, parent_ip, NULL, regs);
6032 #else
6033 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip)
6035 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
6037 #endif
6040 * If there's only one function registered but it does not support
6041 * recursion, needs RCU protection and/or requires per cpu handling, then
6042 * this function will be called by the mcount trampoline.
6044 static void ftrace_ops_assist_func(unsigned long ip, unsigned long parent_ip,
6045 struct ftrace_ops *op, struct pt_regs *regs)
6047 int bit;
6049 if ((op->flags & FTRACE_OPS_FL_RCU) && !rcu_is_watching())
6050 return;
6052 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
6053 if (bit < 0)
6054 return;
6056 preempt_disable_notrace();
6058 if (!(op->flags & FTRACE_OPS_FL_PER_CPU) ||
6059 !ftrace_function_local_disabled(op)) {
6060 op->func(ip, parent_ip, op, regs);
6063 preempt_enable_notrace();
6064 trace_clear_recursion(bit);
6068 * ftrace_ops_get_func - get the function a trampoline should call
6069 * @ops: the ops to get the function for
6071 * Normally the mcount trampoline will call the ops->func, but there
6072 * are times that it should not. For example, if the ops does not
6073 * have its own recursion protection, then it should call the
6074 * ftrace_ops_assist_func() instead.
6076 * Returns the function that the trampoline should call for @ops.
6078 ftrace_func_t ftrace_ops_get_func(struct ftrace_ops *ops)
6081 * If the function does not handle recursion, needs to be RCU safe,
6082 * or does per cpu logic, then we need to call the assist handler.
6084 if (!(ops->flags & FTRACE_OPS_FL_RECURSION_SAFE) ||
6085 ops->flags & (FTRACE_OPS_FL_RCU | FTRACE_OPS_FL_PER_CPU))
6086 return ftrace_ops_assist_func;
6088 return ops->func;
6091 static void
6092 ftrace_filter_pid_sched_switch_probe(void *data, bool preempt,
6093 struct task_struct *prev, struct task_struct *next)
6095 struct trace_array *tr = data;
6096 struct trace_pid_list *pid_list;
6098 pid_list = rcu_dereference_sched(tr->function_pids);
6100 this_cpu_write(tr->trace_buffer.data->ftrace_ignore_pid,
6101 trace_ignore_this_task(pid_list, next));
6104 static void
6105 ftrace_pid_follow_sched_process_fork(void *data,
6106 struct task_struct *self,
6107 struct task_struct *task)
6109 struct trace_pid_list *pid_list;
6110 struct trace_array *tr = data;
6112 pid_list = rcu_dereference_sched(tr->function_pids);
6113 trace_filter_add_remove_task(pid_list, self, task);
6116 static void
6117 ftrace_pid_follow_sched_process_exit(void *data, struct task_struct *task)
6119 struct trace_pid_list *pid_list;
6120 struct trace_array *tr = data;
6122 pid_list = rcu_dereference_sched(tr->function_pids);
6123 trace_filter_add_remove_task(pid_list, NULL, task);
6126 void ftrace_pid_follow_fork(struct trace_array *tr, bool enable)
6128 if (enable) {
6129 register_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
6130 tr);
6131 register_trace_sched_process_exit(ftrace_pid_follow_sched_process_exit,
6132 tr);
6133 } else {
6134 unregister_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
6135 tr);
6136 unregister_trace_sched_process_exit(ftrace_pid_follow_sched_process_exit,
6137 tr);
6141 static void clear_ftrace_pids(struct trace_array *tr)
6143 struct trace_pid_list *pid_list;
6144 int cpu;
6146 pid_list = rcu_dereference_protected(tr->function_pids,
6147 lockdep_is_held(&ftrace_lock));
6148 if (!pid_list)
6149 return;
6151 unregister_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
6153 for_each_possible_cpu(cpu)
6154 per_cpu_ptr(tr->trace_buffer.data, cpu)->ftrace_ignore_pid = false;
6156 rcu_assign_pointer(tr->function_pids, NULL);
6158 /* Wait till all users are no longer using pid filtering */
6159 synchronize_sched();
6161 trace_free_pid_list(pid_list);
6164 void ftrace_clear_pids(struct trace_array *tr)
6166 mutex_lock(&ftrace_lock);
6168 clear_ftrace_pids(tr);
6170 mutex_unlock(&ftrace_lock);
6173 static void ftrace_pid_reset(struct trace_array *tr)
6175 mutex_lock(&ftrace_lock);
6176 clear_ftrace_pids(tr);
6178 ftrace_update_pid_func();
6179 ftrace_startup_all(0);
6181 mutex_unlock(&ftrace_lock);
6184 /* Greater than any max PID */
6185 #define FTRACE_NO_PIDS (void *)(PID_MAX_LIMIT + 1)
6187 static void *fpid_start(struct seq_file *m, loff_t *pos)
6188 __acquires(RCU)
6190 struct trace_pid_list *pid_list;
6191 struct trace_array *tr = m->private;
6193 mutex_lock(&ftrace_lock);
6194 rcu_read_lock_sched();
6196 pid_list = rcu_dereference_sched(tr->function_pids);
6198 if (!pid_list)
6199 return !(*pos) ? FTRACE_NO_PIDS : NULL;
6201 return trace_pid_start(pid_list, pos);
6204 static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
6206 struct trace_array *tr = m->private;
6207 struct trace_pid_list *pid_list = rcu_dereference_sched(tr->function_pids);
6209 if (v == FTRACE_NO_PIDS)
6210 return NULL;
6212 return trace_pid_next(pid_list, v, pos);
6215 static void fpid_stop(struct seq_file *m, void *p)
6216 __releases(RCU)
6218 rcu_read_unlock_sched();
6219 mutex_unlock(&ftrace_lock);
6222 static int fpid_show(struct seq_file *m, void *v)
6224 if (v == FTRACE_NO_PIDS) {
6225 seq_puts(m, "no pid\n");
6226 return 0;
6229 return trace_pid_show(m, v);
6232 static const struct seq_operations ftrace_pid_sops = {
6233 .start = fpid_start,
6234 .next = fpid_next,
6235 .stop = fpid_stop,
6236 .show = fpid_show,
6239 static int
6240 ftrace_pid_open(struct inode *inode, struct file *file)
6242 struct trace_array *tr = inode->i_private;
6243 struct seq_file *m;
6244 int ret = 0;
6246 if (trace_array_get(tr) < 0)
6247 return -ENODEV;
6249 if ((file->f_mode & FMODE_WRITE) &&
6250 (file->f_flags & O_TRUNC))
6251 ftrace_pid_reset(tr);
6253 ret = seq_open(file, &ftrace_pid_sops);
6254 if (ret < 0) {
6255 trace_array_put(tr);
6256 } else {
6257 m = file->private_data;
6258 /* copy tr over to seq ops */
6259 m->private = tr;
6262 return ret;
6265 static void ignore_task_cpu(void *data)
6267 struct trace_array *tr = data;
6268 struct trace_pid_list *pid_list;
6271 * This function is called by on_each_cpu() while the
6272 * event_mutex is held.
6274 pid_list = rcu_dereference_protected(tr->function_pids,
6275 mutex_is_locked(&ftrace_lock));
6277 this_cpu_write(tr->trace_buffer.data->ftrace_ignore_pid,
6278 trace_ignore_this_task(pid_list, current));
6281 static ssize_t
6282 ftrace_pid_write(struct file *filp, const char __user *ubuf,
6283 size_t cnt, loff_t *ppos)
6285 struct seq_file *m = filp->private_data;
6286 struct trace_array *tr = m->private;
6287 struct trace_pid_list *filtered_pids = NULL;
6288 struct trace_pid_list *pid_list;
6289 ssize_t ret;
6291 if (!cnt)
6292 return 0;
6294 mutex_lock(&ftrace_lock);
6296 filtered_pids = rcu_dereference_protected(tr->function_pids,
6297 lockdep_is_held(&ftrace_lock));
6299 ret = trace_pid_write(filtered_pids, &pid_list, ubuf, cnt);
6300 if (ret < 0)
6301 goto out;
6303 rcu_assign_pointer(tr->function_pids, pid_list);
6305 if (filtered_pids) {
6306 synchronize_sched();
6307 trace_free_pid_list(filtered_pids);
6308 } else if (pid_list) {
6309 /* Register a probe to set whether to ignore the tracing of a task */
6310 register_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
6314 * Ignoring of pids is done at task switch. But we have to
6315 * check for those tasks that are currently running.
6316 * Always do this in case a pid was appended or removed.
6318 on_each_cpu(ignore_task_cpu, tr, 1);
6320 ftrace_update_pid_func();
6321 ftrace_startup_all(0);
6322 out:
6323 mutex_unlock(&ftrace_lock);
6325 if (ret > 0)
6326 *ppos += ret;
6328 return ret;
6331 static int
6332 ftrace_pid_release(struct inode *inode, struct file *file)
6334 struct trace_array *tr = inode->i_private;
6336 trace_array_put(tr);
6338 return seq_release(inode, file);
6341 static const struct file_operations ftrace_pid_fops = {
6342 .open = ftrace_pid_open,
6343 .write = ftrace_pid_write,
6344 .read = seq_read,
6345 .llseek = tracing_lseek,
6346 .release = ftrace_pid_release,
6349 void ftrace_init_tracefs(struct trace_array *tr, struct dentry *d_tracer)
6351 trace_create_file("set_ftrace_pid", 0644, d_tracer,
6352 tr, &ftrace_pid_fops);
6355 void __init ftrace_init_tracefs_toplevel(struct trace_array *tr,
6356 struct dentry *d_tracer)
6358 /* Only the top level directory has the dyn_tracefs and profile */
6359 WARN_ON(!(tr->flags & TRACE_ARRAY_FL_GLOBAL));
6361 ftrace_init_dyn_tracefs(d_tracer);
6362 ftrace_profile_tracefs(d_tracer);
6366 * ftrace_kill - kill ftrace
6368 * This function should be used by panic code. It stops ftrace
6369 * but in a not so nice way. If you need to simply kill ftrace
6370 * from a non-atomic section, use ftrace_kill.
6372 void ftrace_kill(void)
6374 ftrace_disabled = 1;
6375 ftrace_enabled = 0;
6376 clear_ftrace_function();
6380 * Test if ftrace is dead or not.
6382 int ftrace_is_dead(void)
6384 return ftrace_disabled;
6388 * register_ftrace_function - register a function for profiling
6389 * @ops - ops structure that holds the function for profiling.
6391 * Register a function to be called by all functions in the
6392 * kernel.
6394 * Note: @ops->func and all the functions it calls must be labeled
6395 * with "notrace", otherwise it will go into a
6396 * recursive loop.
6398 int register_ftrace_function(struct ftrace_ops *ops)
6400 int ret = -1;
6402 ftrace_ops_init(ops);
6404 mutex_lock(&ftrace_lock);
6406 ret = ftrace_startup(ops, 0);
6408 mutex_unlock(&ftrace_lock);
6410 return ret;
6412 EXPORT_SYMBOL_GPL(register_ftrace_function);
6415 * unregister_ftrace_function - unregister a function for profiling.
6416 * @ops - ops structure that holds the function to unregister
6418 * Unregister a function that was added to be called by ftrace profiling.
6420 int unregister_ftrace_function(struct ftrace_ops *ops)
6422 int ret;
6424 mutex_lock(&ftrace_lock);
6425 ret = ftrace_shutdown(ops, 0);
6426 mutex_unlock(&ftrace_lock);
6428 return ret;
6430 EXPORT_SYMBOL_GPL(unregister_ftrace_function);
6433 ftrace_enable_sysctl(struct ctl_table *table, int write,
6434 void __user *buffer, size_t *lenp,
6435 loff_t *ppos)
6437 int ret = -ENODEV;
6439 mutex_lock(&ftrace_lock);
6441 if (unlikely(ftrace_disabled))
6442 goto out;
6444 ret = proc_dointvec(table, write, buffer, lenp, ppos);
6446 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
6447 goto out;
6449 last_ftrace_enabled = !!ftrace_enabled;
6451 if (ftrace_enabled) {
6453 /* we are starting ftrace again */
6454 if (ftrace_ops_list != &ftrace_list_end)
6455 update_ftrace_function();
6457 ftrace_startup_sysctl();
6459 } else {
6460 /* stopping ftrace calls (just send to ftrace_stub) */
6461 ftrace_trace_function = ftrace_stub;
6463 ftrace_shutdown_sysctl();
6466 out:
6467 mutex_unlock(&ftrace_lock);
6468 return ret;
6471 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
6473 static struct ftrace_ops graph_ops = {
6474 .func = ftrace_stub,
6475 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
6476 FTRACE_OPS_FL_INITIALIZED |
6477 FTRACE_OPS_FL_PID |
6478 FTRACE_OPS_FL_STUB,
6479 #ifdef FTRACE_GRAPH_TRAMP_ADDR
6480 .trampoline = FTRACE_GRAPH_TRAMP_ADDR,
6481 /* trampoline_size is only needed for dynamically allocated tramps */
6482 #endif
6483 ASSIGN_OPS_HASH(graph_ops, &global_ops.local_hash)
6486 void ftrace_graph_sleep_time_control(bool enable)
6488 fgraph_sleep_time = enable;
6491 void ftrace_graph_graph_time_control(bool enable)
6493 fgraph_graph_time = enable;
6496 int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
6498 return 0;
6501 /* The callbacks that hook a function */
6502 trace_func_graph_ret_t ftrace_graph_return =
6503 (trace_func_graph_ret_t)ftrace_stub;
6504 trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
6505 static trace_func_graph_ent_t __ftrace_graph_entry = ftrace_graph_entry_stub;
6507 /* Try to assign a return stack array on FTRACE_RETSTACK_ALLOC_SIZE tasks. */
6508 static int alloc_retstack_tasklist(struct ftrace_ret_stack **ret_stack_list)
6510 int i;
6511 int ret = 0;
6512 int start = 0, end = FTRACE_RETSTACK_ALLOC_SIZE;
6513 struct task_struct *g, *t;
6515 for (i = 0; i < FTRACE_RETSTACK_ALLOC_SIZE; i++) {
6516 ret_stack_list[i] = kmalloc(FTRACE_RETFUNC_DEPTH
6517 * sizeof(struct ftrace_ret_stack),
6518 GFP_KERNEL);
6519 if (!ret_stack_list[i]) {
6520 start = 0;
6521 end = i;
6522 ret = -ENOMEM;
6523 goto free;
6527 read_lock(&tasklist_lock);
6528 do_each_thread(g, t) {
6529 if (start == end) {
6530 ret = -EAGAIN;
6531 goto unlock;
6534 if (t->ret_stack == NULL) {
6535 atomic_set(&t->tracing_graph_pause, 0);
6536 atomic_set(&t->trace_overrun, 0);
6537 t->curr_ret_stack = -1;
6538 /* Make sure the tasks see the -1 first: */
6539 smp_wmb();
6540 t->ret_stack = ret_stack_list[start++];
6542 } while_each_thread(g, t);
6544 unlock:
6545 read_unlock(&tasklist_lock);
6546 free:
6547 for (i = start; i < end; i++)
6548 kfree(ret_stack_list[i]);
6549 return ret;
6552 static void
6553 ftrace_graph_probe_sched_switch(void *ignore, bool preempt,
6554 struct task_struct *prev, struct task_struct *next)
6556 unsigned long long timestamp;
6557 int index;
6560 * Does the user want to count the time a function was asleep.
6561 * If so, do not update the time stamps.
6563 if (fgraph_sleep_time)
6564 return;
6566 timestamp = trace_clock_local();
6568 prev->ftrace_timestamp = timestamp;
6570 /* only process tasks that we timestamped */
6571 if (!next->ftrace_timestamp)
6572 return;
6575 * Update all the counters in next to make up for the
6576 * time next was sleeping.
6578 timestamp -= next->ftrace_timestamp;
6580 for (index = next->curr_ret_stack; index >= 0; index--)
6581 next->ret_stack[index].calltime += timestamp;
6584 /* Allocate a return stack for each task */
6585 static int start_graph_tracing(void)
6587 struct ftrace_ret_stack **ret_stack_list;
6588 int ret, cpu;
6590 ret_stack_list = kmalloc(FTRACE_RETSTACK_ALLOC_SIZE *
6591 sizeof(struct ftrace_ret_stack *),
6592 GFP_KERNEL);
6594 if (!ret_stack_list)
6595 return -ENOMEM;
6597 /* The cpu_boot init_task->ret_stack will never be freed */
6598 for_each_online_cpu(cpu) {
6599 if (!idle_task(cpu)->ret_stack)
6600 ftrace_graph_init_idle_task(idle_task(cpu), cpu);
6603 do {
6604 ret = alloc_retstack_tasklist(ret_stack_list);
6605 } while (ret == -EAGAIN);
6607 if (!ret) {
6608 ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
6609 if (ret)
6610 pr_info("ftrace_graph: Couldn't activate tracepoint"
6611 " probe to kernel_sched_switch\n");
6614 kfree(ret_stack_list);
6615 return ret;
6619 * Hibernation protection.
6620 * The state of the current task is too much unstable during
6621 * suspend/restore to disk. We want to protect against that.
6623 static int
6624 ftrace_suspend_notifier_call(struct notifier_block *bl, unsigned long state,
6625 void *unused)
6627 switch (state) {
6628 case PM_HIBERNATION_PREPARE:
6629 pause_graph_tracing();
6630 break;
6632 case PM_POST_HIBERNATION:
6633 unpause_graph_tracing();
6634 break;
6636 return NOTIFY_DONE;
6639 static int ftrace_graph_entry_test(struct ftrace_graph_ent *trace)
6641 if (!ftrace_ops_test(&global_ops, trace->func, NULL))
6642 return 0;
6643 return __ftrace_graph_entry(trace);
6647 * The function graph tracer should only trace the functions defined
6648 * by set_ftrace_filter and set_ftrace_notrace. If another function
6649 * tracer ops is registered, the graph tracer requires testing the
6650 * function against the global ops, and not just trace any function
6651 * that any ftrace_ops registered.
6653 static void update_function_graph_func(void)
6655 struct ftrace_ops *op;
6656 bool do_test = false;
6659 * The graph and global ops share the same set of functions
6660 * to test. If any other ops is on the list, then
6661 * the graph tracing needs to test if its the function
6662 * it should call.
6664 do_for_each_ftrace_op(op, ftrace_ops_list) {
6665 if (op != &global_ops && op != &graph_ops &&
6666 op != &ftrace_list_end) {
6667 do_test = true;
6668 /* in double loop, break out with goto */
6669 goto out;
6671 } while_for_each_ftrace_op(op);
6672 out:
6673 if (do_test)
6674 ftrace_graph_entry = ftrace_graph_entry_test;
6675 else
6676 ftrace_graph_entry = __ftrace_graph_entry;
6679 static struct notifier_block ftrace_suspend_notifier = {
6680 .notifier_call = ftrace_suspend_notifier_call,
6683 int register_ftrace_graph(trace_func_graph_ret_t retfunc,
6684 trace_func_graph_ent_t entryfunc)
6686 int ret = 0;
6688 mutex_lock(&ftrace_lock);
6690 /* we currently allow only one tracer registered at a time */
6691 if (ftrace_graph_active) {
6692 ret = -EBUSY;
6693 goto out;
6696 register_pm_notifier(&ftrace_suspend_notifier);
6698 ftrace_graph_active++;
6699 ret = start_graph_tracing();
6700 if (ret) {
6701 ftrace_graph_active--;
6702 goto out;
6705 ftrace_graph_return = retfunc;
6708 * Update the indirect function to the entryfunc, and the
6709 * function that gets called to the entry_test first. Then
6710 * call the update fgraph entry function to determine if
6711 * the entryfunc should be called directly or not.
6713 __ftrace_graph_entry = entryfunc;
6714 ftrace_graph_entry = ftrace_graph_entry_test;
6715 update_function_graph_func();
6717 ret = ftrace_startup(&graph_ops, FTRACE_START_FUNC_RET);
6718 out:
6719 mutex_unlock(&ftrace_lock);
6720 return ret;
6723 void unregister_ftrace_graph(void)
6725 mutex_lock(&ftrace_lock);
6727 if (unlikely(!ftrace_graph_active))
6728 goto out;
6730 ftrace_graph_active--;
6731 ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
6732 ftrace_graph_entry = ftrace_graph_entry_stub;
6733 __ftrace_graph_entry = ftrace_graph_entry_stub;
6734 ftrace_shutdown(&graph_ops, FTRACE_STOP_FUNC_RET);
6735 unregister_pm_notifier(&ftrace_suspend_notifier);
6736 unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
6738 #ifdef CONFIG_DYNAMIC_FTRACE
6740 * Function graph does not allocate the trampoline, but
6741 * other global_ops do. We need to reset the ALLOC_TRAMP flag
6742 * if one was used.
6744 global_ops.trampoline = save_global_trampoline;
6745 if (save_global_flags & FTRACE_OPS_FL_ALLOC_TRAMP)
6746 global_ops.flags |= FTRACE_OPS_FL_ALLOC_TRAMP;
6747 #endif
6749 out:
6750 mutex_unlock(&ftrace_lock);
6753 static DEFINE_PER_CPU(struct ftrace_ret_stack *, idle_ret_stack);
6755 static void
6756 graph_init_task(struct task_struct *t, struct ftrace_ret_stack *ret_stack)
6758 atomic_set(&t->tracing_graph_pause, 0);
6759 atomic_set(&t->trace_overrun, 0);
6760 t->ftrace_timestamp = 0;
6761 /* make curr_ret_stack visible before we add the ret_stack */
6762 smp_wmb();
6763 t->ret_stack = ret_stack;
6767 * Allocate a return stack for the idle task. May be the first
6768 * time through, or it may be done by CPU hotplug online.
6770 void ftrace_graph_init_idle_task(struct task_struct *t, int cpu)
6772 t->curr_ret_stack = -1;
6774 * The idle task has no parent, it either has its own
6775 * stack or no stack at all.
6777 if (t->ret_stack)
6778 WARN_ON(t->ret_stack != per_cpu(idle_ret_stack, cpu));
6780 if (ftrace_graph_active) {
6781 struct ftrace_ret_stack *ret_stack;
6783 ret_stack = per_cpu(idle_ret_stack, cpu);
6784 if (!ret_stack) {
6785 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
6786 * sizeof(struct ftrace_ret_stack),
6787 GFP_KERNEL);
6788 if (!ret_stack)
6789 return;
6790 per_cpu(idle_ret_stack, cpu) = ret_stack;
6792 graph_init_task(t, ret_stack);
6796 /* Allocate a return stack for newly created task */
6797 void ftrace_graph_init_task(struct task_struct *t)
6799 /* Make sure we do not use the parent ret_stack */
6800 t->ret_stack = NULL;
6801 t->curr_ret_stack = -1;
6803 if (ftrace_graph_active) {
6804 struct ftrace_ret_stack *ret_stack;
6806 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
6807 * sizeof(struct ftrace_ret_stack),
6808 GFP_KERNEL);
6809 if (!ret_stack)
6810 return;
6811 graph_init_task(t, ret_stack);
6815 void ftrace_graph_exit_task(struct task_struct *t)
6817 struct ftrace_ret_stack *ret_stack = t->ret_stack;
6819 t->ret_stack = NULL;
6820 /* NULL must become visible to IRQs before we free it: */
6821 barrier();
6823 kfree(ret_stack);
6825 #endif