gpio: of: Break out OF-only code
[linux/fpc-iii.git] / kernel / trace / ftrace.c
blobeca34503f178ece3f25a469ed3d73f186fd98c9e
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * Infrastructure for profiling code inserted by 'gcc -pg'.
5 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
6 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
8 * Originally ported from the -rt patch by:
9 * Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
11 * Based on code in the latency_tracer, that is:
13 * Copyright (C) 2004-2006 Ingo Molnar
14 * Copyright (C) 2004 Nadia Yvette Chambers
17 #include <linux/stop_machine.h>
18 #include <linux/clocksource.h>
19 #include <linux/sched/task.h>
20 #include <linux/kallsyms.h>
21 #include <linux/seq_file.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>
36 #include <linux/kprobes.h>
38 #include <trace/events/sched.h>
40 #include <asm/sections.h>
41 #include <asm/setup.h>
43 #include "ftrace_internal.h"
44 #include "trace_output.h"
45 #include "trace_stat.h"
47 #define FTRACE_WARN_ON(cond) \
48 ({ \
49 int ___r = cond; \
50 if (WARN_ON(___r)) \
51 ftrace_kill(); \
52 ___r; \
55 #define FTRACE_WARN_ON_ONCE(cond) \
56 ({ \
57 int ___r = cond; \
58 if (WARN_ON_ONCE(___r)) \
59 ftrace_kill(); \
60 ___r; \
63 /* hash bits for specific function selection */
64 #define FTRACE_HASH_BITS 7
65 #define FTRACE_FUNC_HASHSIZE (1 << FTRACE_HASH_BITS)
66 #define FTRACE_HASH_DEFAULT_BITS 10
67 #define FTRACE_HASH_MAX_BITS 12
69 #ifdef CONFIG_DYNAMIC_FTRACE
70 #define INIT_OPS_HASH(opsname) \
71 .func_hash = &opsname.local_hash, \
72 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
73 #else
74 #define INIT_OPS_HASH(opsname)
75 #endif
77 enum {
78 FTRACE_MODIFY_ENABLE_FL = (1 << 0),
79 FTRACE_MODIFY_MAY_SLEEP_FL = (1 << 1),
82 struct ftrace_ops ftrace_list_end __read_mostly = {
83 .func = ftrace_stub,
84 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_STUB,
85 INIT_OPS_HASH(ftrace_list_end)
88 /* ftrace_enabled is a method to turn ftrace on or off */
89 int ftrace_enabled __read_mostly;
90 static int last_ftrace_enabled;
92 /* Current function tracing op */
93 struct ftrace_ops *function_trace_op __read_mostly = &ftrace_list_end;
94 /* What to set function_trace_op to */
95 static struct ftrace_ops *set_function_trace_op;
97 static bool ftrace_pids_enabled(struct ftrace_ops *ops)
99 struct trace_array *tr;
101 if (!(ops->flags & FTRACE_OPS_FL_PID) || !ops->private)
102 return false;
104 tr = ops->private;
106 return tr->function_pids != NULL;
109 static void ftrace_update_trampoline(struct ftrace_ops *ops);
112 * ftrace_disabled is set when an anomaly is discovered.
113 * ftrace_disabled is much stronger than ftrace_enabled.
115 static int ftrace_disabled __read_mostly;
117 DEFINE_MUTEX(ftrace_lock);
119 struct ftrace_ops __rcu *ftrace_ops_list __read_mostly = &ftrace_list_end;
120 ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
121 struct ftrace_ops global_ops;
123 #if ARCH_SUPPORTS_FTRACE_OPS
124 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
125 struct ftrace_ops *op, struct pt_regs *regs);
126 #else
127 /* See comment below, where ftrace_ops_list_func is defined */
128 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip);
129 #define ftrace_ops_list_func ((ftrace_func_t)ftrace_ops_no_ops)
130 #endif
132 static inline void ftrace_ops_init(struct ftrace_ops *ops)
134 #ifdef CONFIG_DYNAMIC_FTRACE
135 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED)) {
136 mutex_init(&ops->local_hash.regex_lock);
137 ops->func_hash = &ops->local_hash;
138 ops->flags |= FTRACE_OPS_FL_INITIALIZED;
140 #endif
143 static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip,
144 struct ftrace_ops *op, struct pt_regs *regs)
146 struct trace_array *tr = op->private;
148 if (tr && this_cpu_read(tr->trace_buffer.data->ftrace_ignore_pid))
149 return;
151 op->saved_func(ip, parent_ip, op, regs);
154 static void ftrace_sync(struct work_struct *work)
157 * This function is just a stub to implement a hard force
158 * of synchronize_rcu(). This requires synchronizing
159 * tasks even in userspace and idle.
161 * Yes, function tracing is rude.
165 static void ftrace_sync_ipi(void *data)
167 /* Probably not needed, but do it anyway */
168 smp_rmb();
171 static ftrace_func_t ftrace_ops_get_list_func(struct ftrace_ops *ops)
174 * If this is a dynamic, RCU, or per CPU ops, or we force list func,
175 * then it needs to call the list anyway.
177 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_RCU) ||
178 FTRACE_FORCE_LIST_FUNC)
179 return ftrace_ops_list_func;
181 return ftrace_ops_get_func(ops);
184 static void update_ftrace_function(void)
186 ftrace_func_t func;
189 * Prepare the ftrace_ops that the arch callback will use.
190 * If there's only one ftrace_ops registered, the ftrace_ops_list
191 * will point to the ops we want.
193 set_function_trace_op = rcu_dereference_protected(ftrace_ops_list,
194 lockdep_is_held(&ftrace_lock));
196 /* If there's no ftrace_ops registered, just call the stub function */
197 if (set_function_trace_op == &ftrace_list_end) {
198 func = ftrace_stub;
201 * If we are at the end of the list and this ops is
202 * recursion safe and not dynamic and the arch supports passing ops,
203 * then have the mcount trampoline call the function directly.
205 } else if (rcu_dereference_protected(ftrace_ops_list->next,
206 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
207 func = ftrace_ops_get_list_func(ftrace_ops_list);
209 } else {
210 /* Just use the default ftrace_ops */
211 set_function_trace_op = &ftrace_list_end;
212 func = ftrace_ops_list_func;
215 update_function_graph_func();
217 /* If there's no change, then do nothing more here */
218 if (ftrace_trace_function == func)
219 return;
222 * If we are using the list function, it doesn't care
223 * about the function_trace_ops.
225 if (func == ftrace_ops_list_func) {
226 ftrace_trace_function = func;
228 * Don't even bother setting function_trace_ops,
229 * it would be racy to do so anyway.
231 return;
234 #ifndef CONFIG_DYNAMIC_FTRACE
236 * For static tracing, we need to be a bit more careful.
237 * The function change takes affect immediately. Thus,
238 * we need to coorditate the setting of the function_trace_ops
239 * with the setting of the ftrace_trace_function.
241 * Set the function to the list ops, which will call the
242 * function we want, albeit indirectly, but it handles the
243 * ftrace_ops and doesn't depend on function_trace_op.
245 ftrace_trace_function = ftrace_ops_list_func;
247 * Make sure all CPUs see this. Yes this is slow, but static
248 * tracing is slow and nasty to have enabled.
250 schedule_on_each_cpu(ftrace_sync);
251 /* Now all cpus are using the list ops. */
252 function_trace_op = set_function_trace_op;
253 /* Make sure the function_trace_op is visible on all CPUs */
254 smp_wmb();
255 /* Nasty way to force a rmb on all cpus */
256 smp_call_function(ftrace_sync_ipi, NULL, 1);
257 /* OK, we are all set to update the ftrace_trace_function now! */
258 #endif /* !CONFIG_DYNAMIC_FTRACE */
260 ftrace_trace_function = func;
263 static void add_ftrace_ops(struct ftrace_ops __rcu **list,
264 struct ftrace_ops *ops)
266 rcu_assign_pointer(ops->next, *list);
269 * We are entering ops into the list but another
270 * CPU might be walking that list. We need to make sure
271 * the ops->next pointer is valid before another CPU sees
272 * the ops pointer included into the list.
274 rcu_assign_pointer(*list, ops);
277 static int remove_ftrace_ops(struct ftrace_ops __rcu **list,
278 struct ftrace_ops *ops)
280 struct ftrace_ops **p;
283 * If we are removing the last function, then simply point
284 * to the ftrace_stub.
286 if (rcu_dereference_protected(*list,
287 lockdep_is_held(&ftrace_lock)) == ops &&
288 rcu_dereference_protected(ops->next,
289 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
290 *list = &ftrace_list_end;
291 return 0;
294 for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
295 if (*p == ops)
296 break;
298 if (*p != ops)
299 return -1;
301 *p = (*p)->next;
302 return 0;
305 static void ftrace_update_trampoline(struct ftrace_ops *ops);
307 int __register_ftrace_function(struct ftrace_ops *ops)
309 if (ops->flags & FTRACE_OPS_FL_DELETED)
310 return -EINVAL;
312 if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
313 return -EBUSY;
315 #ifndef CONFIG_DYNAMIC_FTRACE_WITH_REGS
317 * If the ftrace_ops specifies SAVE_REGS, then it only can be used
318 * if the arch supports it, or SAVE_REGS_IF_SUPPORTED is also set.
319 * Setting SAVE_REGS_IF_SUPPORTED makes SAVE_REGS irrelevant.
321 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS &&
322 !(ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED))
323 return -EINVAL;
325 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED)
326 ops->flags |= FTRACE_OPS_FL_SAVE_REGS;
327 #endif
329 if (!core_kernel_data((unsigned long)ops))
330 ops->flags |= FTRACE_OPS_FL_DYNAMIC;
332 add_ftrace_ops(&ftrace_ops_list, ops);
334 /* Always save the function, and reset at unregistering */
335 ops->saved_func = ops->func;
337 if (ftrace_pids_enabled(ops))
338 ops->func = ftrace_pid_func;
340 ftrace_update_trampoline(ops);
342 if (ftrace_enabled)
343 update_ftrace_function();
345 return 0;
348 int __unregister_ftrace_function(struct ftrace_ops *ops)
350 int ret;
352 if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
353 return -EBUSY;
355 ret = remove_ftrace_ops(&ftrace_ops_list, ops);
357 if (ret < 0)
358 return ret;
360 if (ftrace_enabled)
361 update_ftrace_function();
363 ops->func = ops->saved_func;
365 return 0;
368 static void ftrace_update_pid_func(void)
370 struct ftrace_ops *op;
372 /* Only do something if we are tracing something */
373 if (ftrace_trace_function == ftrace_stub)
374 return;
376 do_for_each_ftrace_op(op, ftrace_ops_list) {
377 if (op->flags & FTRACE_OPS_FL_PID) {
378 op->func = ftrace_pids_enabled(op) ?
379 ftrace_pid_func : op->saved_func;
380 ftrace_update_trampoline(op);
382 } while_for_each_ftrace_op(op);
384 update_ftrace_function();
387 #ifdef CONFIG_FUNCTION_PROFILER
388 struct ftrace_profile {
389 struct hlist_node node;
390 unsigned long ip;
391 unsigned long counter;
392 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
393 unsigned long long time;
394 unsigned long long time_squared;
395 #endif
398 struct ftrace_profile_page {
399 struct ftrace_profile_page *next;
400 unsigned long index;
401 struct ftrace_profile records[];
404 struct ftrace_profile_stat {
405 atomic_t disabled;
406 struct hlist_head *hash;
407 struct ftrace_profile_page *pages;
408 struct ftrace_profile_page *start;
409 struct tracer_stat stat;
412 #define PROFILE_RECORDS_SIZE \
413 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
415 #define PROFILES_PER_PAGE \
416 (PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
418 static int ftrace_profile_enabled __read_mostly;
420 /* ftrace_profile_lock - synchronize the enable and disable of the profiler */
421 static DEFINE_MUTEX(ftrace_profile_lock);
423 static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
425 #define FTRACE_PROFILE_HASH_BITS 10
426 #define FTRACE_PROFILE_HASH_SIZE (1 << FTRACE_PROFILE_HASH_BITS)
428 static void *
429 function_stat_next(void *v, int idx)
431 struct ftrace_profile *rec = v;
432 struct ftrace_profile_page *pg;
434 pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
436 again:
437 if (idx != 0)
438 rec++;
440 if ((void *)rec >= (void *)&pg->records[pg->index]) {
441 pg = pg->next;
442 if (!pg)
443 return NULL;
444 rec = &pg->records[0];
445 if (!rec->counter)
446 goto again;
449 return rec;
452 static void *function_stat_start(struct tracer_stat *trace)
454 struct ftrace_profile_stat *stat =
455 container_of(trace, struct ftrace_profile_stat, stat);
457 if (!stat || !stat->start)
458 return NULL;
460 return function_stat_next(&stat->start->records[0], 0);
463 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
464 /* function graph compares on total time */
465 static int function_stat_cmp(void *p1, void *p2)
467 struct ftrace_profile *a = p1;
468 struct ftrace_profile *b = p2;
470 if (a->time < b->time)
471 return -1;
472 if (a->time > b->time)
473 return 1;
474 else
475 return 0;
477 #else
478 /* not function graph compares against hits */
479 static int function_stat_cmp(void *p1, void *p2)
481 struct ftrace_profile *a = p1;
482 struct ftrace_profile *b = p2;
484 if (a->counter < b->counter)
485 return -1;
486 if (a->counter > b->counter)
487 return 1;
488 else
489 return 0;
491 #endif
493 static int function_stat_headers(struct seq_file *m)
495 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
496 seq_puts(m, " Function "
497 "Hit Time Avg s^2\n"
498 " -------- "
499 "--- ---- --- ---\n");
500 #else
501 seq_puts(m, " Function Hit\n"
502 " -------- ---\n");
503 #endif
504 return 0;
507 static int function_stat_show(struct seq_file *m, void *v)
509 struct ftrace_profile *rec = v;
510 char str[KSYM_SYMBOL_LEN];
511 int ret = 0;
512 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
513 static struct trace_seq s;
514 unsigned long long avg;
515 unsigned long long stddev;
516 #endif
517 mutex_lock(&ftrace_profile_lock);
519 /* we raced with function_profile_reset() */
520 if (unlikely(rec->counter == 0)) {
521 ret = -EBUSY;
522 goto out;
525 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
526 avg = rec->time;
527 do_div(avg, rec->counter);
528 if (tracing_thresh && (avg < tracing_thresh))
529 goto out;
530 #endif
532 kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
533 seq_printf(m, " %-30.30s %10lu", str, rec->counter);
535 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
536 seq_puts(m, " ");
538 /* Sample standard deviation (s^2) */
539 if (rec->counter <= 1)
540 stddev = 0;
541 else {
543 * Apply Welford's method:
544 * s^2 = 1 / (n * (n-1)) * (n * \Sum (x_i)^2 - (\Sum x_i)^2)
546 stddev = rec->counter * rec->time_squared -
547 rec->time * rec->time;
550 * Divide only 1000 for ns^2 -> us^2 conversion.
551 * trace_print_graph_duration will divide 1000 again.
553 do_div(stddev, rec->counter * (rec->counter - 1) * 1000);
556 trace_seq_init(&s);
557 trace_print_graph_duration(rec->time, &s);
558 trace_seq_puts(&s, " ");
559 trace_print_graph_duration(avg, &s);
560 trace_seq_puts(&s, " ");
561 trace_print_graph_duration(stddev, &s);
562 trace_print_seq(m, &s);
563 #endif
564 seq_putc(m, '\n');
565 out:
566 mutex_unlock(&ftrace_profile_lock);
568 return ret;
571 static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
573 struct ftrace_profile_page *pg;
575 pg = stat->pages = stat->start;
577 while (pg) {
578 memset(pg->records, 0, PROFILE_RECORDS_SIZE);
579 pg->index = 0;
580 pg = pg->next;
583 memset(stat->hash, 0,
584 FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
587 int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
589 struct ftrace_profile_page *pg;
590 int functions;
591 int pages;
592 int i;
594 /* If we already allocated, do nothing */
595 if (stat->pages)
596 return 0;
598 stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
599 if (!stat->pages)
600 return -ENOMEM;
602 #ifdef CONFIG_DYNAMIC_FTRACE
603 functions = ftrace_update_tot_cnt;
604 #else
606 * We do not know the number of functions that exist because
607 * dynamic tracing is what counts them. With past experience
608 * we have around 20K functions. That should be more than enough.
609 * It is highly unlikely we will execute every function in
610 * the kernel.
612 functions = 20000;
613 #endif
615 pg = stat->start = stat->pages;
617 pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);
619 for (i = 1; i < pages; i++) {
620 pg->next = (void *)get_zeroed_page(GFP_KERNEL);
621 if (!pg->next)
622 goto out_free;
623 pg = pg->next;
626 return 0;
628 out_free:
629 pg = stat->start;
630 while (pg) {
631 unsigned long tmp = (unsigned long)pg;
633 pg = pg->next;
634 free_page(tmp);
637 stat->pages = NULL;
638 stat->start = NULL;
640 return -ENOMEM;
643 static int ftrace_profile_init_cpu(int cpu)
645 struct ftrace_profile_stat *stat;
646 int size;
648 stat = &per_cpu(ftrace_profile_stats, cpu);
650 if (stat->hash) {
651 /* If the profile is already created, simply reset it */
652 ftrace_profile_reset(stat);
653 return 0;
657 * We are profiling all functions, but usually only a few thousand
658 * functions are hit. We'll make a hash of 1024 items.
660 size = FTRACE_PROFILE_HASH_SIZE;
662 stat->hash = kcalloc(size, sizeof(struct hlist_head), GFP_KERNEL);
664 if (!stat->hash)
665 return -ENOMEM;
667 /* Preallocate the function profiling pages */
668 if (ftrace_profile_pages_init(stat) < 0) {
669 kfree(stat->hash);
670 stat->hash = NULL;
671 return -ENOMEM;
674 return 0;
677 static int ftrace_profile_init(void)
679 int cpu;
680 int ret = 0;
682 for_each_possible_cpu(cpu) {
683 ret = ftrace_profile_init_cpu(cpu);
684 if (ret)
685 break;
688 return ret;
691 /* interrupts must be disabled */
692 static struct ftrace_profile *
693 ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
695 struct ftrace_profile *rec;
696 struct hlist_head *hhd;
697 unsigned long key;
699 key = hash_long(ip, FTRACE_PROFILE_HASH_BITS);
700 hhd = &stat->hash[key];
702 if (hlist_empty(hhd))
703 return NULL;
705 hlist_for_each_entry_rcu_notrace(rec, hhd, node) {
706 if (rec->ip == ip)
707 return rec;
710 return NULL;
713 static void ftrace_add_profile(struct ftrace_profile_stat *stat,
714 struct ftrace_profile *rec)
716 unsigned long key;
718 key = hash_long(rec->ip, FTRACE_PROFILE_HASH_BITS);
719 hlist_add_head_rcu(&rec->node, &stat->hash[key]);
723 * The memory is already allocated, this simply finds a new record to use.
725 static struct ftrace_profile *
726 ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
728 struct ftrace_profile *rec = NULL;
730 /* prevent recursion (from NMIs) */
731 if (atomic_inc_return(&stat->disabled) != 1)
732 goto out;
735 * Try to find the function again since an NMI
736 * could have added it
738 rec = ftrace_find_profiled_func(stat, ip);
739 if (rec)
740 goto out;
742 if (stat->pages->index == PROFILES_PER_PAGE) {
743 if (!stat->pages->next)
744 goto out;
745 stat->pages = stat->pages->next;
748 rec = &stat->pages->records[stat->pages->index++];
749 rec->ip = ip;
750 ftrace_add_profile(stat, rec);
752 out:
753 atomic_dec(&stat->disabled);
755 return rec;
758 static void
759 function_profile_call(unsigned long ip, unsigned long parent_ip,
760 struct ftrace_ops *ops, struct pt_regs *regs)
762 struct ftrace_profile_stat *stat;
763 struct ftrace_profile *rec;
764 unsigned long flags;
766 if (!ftrace_profile_enabled)
767 return;
769 local_irq_save(flags);
771 stat = this_cpu_ptr(&ftrace_profile_stats);
772 if (!stat->hash || !ftrace_profile_enabled)
773 goto out;
775 rec = ftrace_find_profiled_func(stat, ip);
776 if (!rec) {
777 rec = ftrace_profile_alloc(stat, ip);
778 if (!rec)
779 goto out;
782 rec->counter++;
783 out:
784 local_irq_restore(flags);
787 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
788 static bool fgraph_graph_time = true;
790 void ftrace_graph_graph_time_control(bool enable)
792 fgraph_graph_time = enable;
795 static int profile_graph_entry(struct ftrace_graph_ent *trace)
797 struct ftrace_ret_stack *ret_stack;
799 function_profile_call(trace->func, 0, NULL, NULL);
801 /* If function graph is shutting down, ret_stack can be NULL */
802 if (!current->ret_stack)
803 return 0;
805 ret_stack = ftrace_graph_get_ret_stack(current, 0);
806 if (ret_stack)
807 ret_stack->subtime = 0;
809 return 1;
812 static void profile_graph_return(struct ftrace_graph_ret *trace)
814 struct ftrace_ret_stack *ret_stack;
815 struct ftrace_profile_stat *stat;
816 unsigned long long calltime;
817 struct ftrace_profile *rec;
818 unsigned long flags;
820 local_irq_save(flags);
821 stat = this_cpu_ptr(&ftrace_profile_stats);
822 if (!stat->hash || !ftrace_profile_enabled)
823 goto out;
825 /* If the calltime was zero'd ignore it */
826 if (!trace->calltime)
827 goto out;
829 calltime = trace->rettime - trace->calltime;
831 if (!fgraph_graph_time) {
833 /* Append this call time to the parent time to subtract */
834 ret_stack = ftrace_graph_get_ret_stack(current, 1);
835 if (ret_stack)
836 ret_stack->subtime += calltime;
838 ret_stack = ftrace_graph_get_ret_stack(current, 0);
839 if (ret_stack && ret_stack->subtime < calltime)
840 calltime -= ret_stack->subtime;
841 else
842 calltime = 0;
845 rec = ftrace_find_profiled_func(stat, trace->func);
846 if (rec) {
847 rec->time += calltime;
848 rec->time_squared += calltime * calltime;
851 out:
852 local_irq_restore(flags);
855 static struct fgraph_ops fprofiler_ops = {
856 .entryfunc = &profile_graph_entry,
857 .retfunc = &profile_graph_return,
860 static int register_ftrace_profiler(void)
862 return register_ftrace_graph(&fprofiler_ops);
865 static void unregister_ftrace_profiler(void)
867 unregister_ftrace_graph(&fprofiler_ops);
869 #else
870 static struct ftrace_ops ftrace_profile_ops __read_mostly = {
871 .func = function_profile_call,
872 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
873 INIT_OPS_HASH(ftrace_profile_ops)
876 static int register_ftrace_profiler(void)
878 return register_ftrace_function(&ftrace_profile_ops);
881 static void unregister_ftrace_profiler(void)
883 unregister_ftrace_function(&ftrace_profile_ops);
885 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
887 static ssize_t
888 ftrace_profile_write(struct file *filp, const char __user *ubuf,
889 size_t cnt, loff_t *ppos)
891 unsigned long val;
892 int ret;
894 ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
895 if (ret)
896 return ret;
898 val = !!val;
900 mutex_lock(&ftrace_profile_lock);
901 if (ftrace_profile_enabled ^ val) {
902 if (val) {
903 ret = ftrace_profile_init();
904 if (ret < 0) {
905 cnt = ret;
906 goto out;
909 ret = register_ftrace_profiler();
910 if (ret < 0) {
911 cnt = ret;
912 goto out;
914 ftrace_profile_enabled = 1;
915 } else {
916 ftrace_profile_enabled = 0;
918 * unregister_ftrace_profiler calls stop_machine
919 * so this acts like an synchronize_rcu.
921 unregister_ftrace_profiler();
924 out:
925 mutex_unlock(&ftrace_profile_lock);
927 *ppos += cnt;
929 return cnt;
932 static ssize_t
933 ftrace_profile_read(struct file *filp, char __user *ubuf,
934 size_t cnt, loff_t *ppos)
936 char buf[64]; /* big enough to hold a number */
937 int r;
939 r = sprintf(buf, "%u\n", ftrace_profile_enabled);
940 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
943 static const struct file_operations ftrace_profile_fops = {
944 .open = tracing_open_generic,
945 .read = ftrace_profile_read,
946 .write = ftrace_profile_write,
947 .llseek = default_llseek,
950 /* used to initialize the real stat files */
951 static struct tracer_stat function_stats __initdata = {
952 .name = "functions",
953 .stat_start = function_stat_start,
954 .stat_next = function_stat_next,
955 .stat_cmp = function_stat_cmp,
956 .stat_headers = function_stat_headers,
957 .stat_show = function_stat_show
960 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
962 struct ftrace_profile_stat *stat;
963 struct dentry *entry;
964 char *name;
965 int ret;
966 int cpu;
968 for_each_possible_cpu(cpu) {
969 stat = &per_cpu(ftrace_profile_stats, cpu);
971 name = kasprintf(GFP_KERNEL, "function%d", cpu);
972 if (!name) {
974 * The files created are permanent, if something happens
975 * we still do not free memory.
977 WARN(1,
978 "Could not allocate stat file for cpu %d\n",
979 cpu);
980 return;
982 stat->stat = function_stats;
983 stat->stat.name = name;
984 ret = register_stat_tracer(&stat->stat);
985 if (ret) {
986 WARN(1,
987 "Could not register function stat for cpu %d\n",
988 cpu);
989 kfree(name);
990 return;
994 entry = tracefs_create_file("function_profile_enabled", 0644,
995 d_tracer, NULL, &ftrace_profile_fops);
996 if (!entry)
997 pr_warn("Could not create tracefs 'function_profile_enabled' entry\n");
1000 #else /* CONFIG_FUNCTION_PROFILER */
1001 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1004 #endif /* CONFIG_FUNCTION_PROFILER */
1006 #ifdef CONFIG_DYNAMIC_FTRACE
1008 static struct ftrace_ops *removed_ops;
1011 * Set when doing a global update, like enabling all recs or disabling them.
1012 * It is not set when just updating a single ftrace_ops.
1014 static bool update_all_ops;
1016 #ifndef CONFIG_FTRACE_MCOUNT_RECORD
1017 # error Dynamic ftrace depends on MCOUNT_RECORD
1018 #endif
1020 struct ftrace_func_entry {
1021 struct hlist_node hlist;
1022 unsigned long ip;
1025 struct ftrace_func_probe {
1026 struct ftrace_probe_ops *probe_ops;
1027 struct ftrace_ops ops;
1028 struct trace_array *tr;
1029 struct list_head list;
1030 void *data;
1031 int ref;
1035 * We make these constant because no one should touch them,
1036 * but they are used as the default "empty hash", to avoid allocating
1037 * it all the time. These are in a read only section such that if
1038 * anyone does try to modify it, it will cause an exception.
1040 static const struct hlist_head empty_buckets[1];
1041 static const struct ftrace_hash empty_hash = {
1042 .buckets = (struct hlist_head *)empty_buckets,
1044 #define EMPTY_HASH ((struct ftrace_hash *)&empty_hash)
1046 struct ftrace_ops global_ops = {
1047 .func = ftrace_stub,
1048 .local_hash.notrace_hash = EMPTY_HASH,
1049 .local_hash.filter_hash = EMPTY_HASH,
1050 INIT_OPS_HASH(global_ops)
1051 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
1052 FTRACE_OPS_FL_INITIALIZED |
1053 FTRACE_OPS_FL_PID,
1057 * Used by the stack undwinder to know about dynamic ftrace trampolines.
1059 struct ftrace_ops *ftrace_ops_trampoline(unsigned long addr)
1061 struct ftrace_ops *op = NULL;
1064 * Some of the ops may be dynamically allocated,
1065 * they are freed after a synchronize_rcu().
1067 preempt_disable_notrace();
1069 do_for_each_ftrace_op(op, ftrace_ops_list) {
1071 * This is to check for dynamically allocated trampolines.
1072 * Trampolines that are in kernel text will have
1073 * core_kernel_text() return true.
1075 if (op->trampoline && op->trampoline_size)
1076 if (addr >= op->trampoline &&
1077 addr < op->trampoline + op->trampoline_size) {
1078 preempt_enable_notrace();
1079 return op;
1081 } while_for_each_ftrace_op(op);
1082 preempt_enable_notrace();
1084 return NULL;
1088 * This is used by __kernel_text_address() to return true if the
1089 * address is on a dynamically allocated trampoline that would
1090 * not return true for either core_kernel_text() or
1091 * is_module_text_address().
1093 bool is_ftrace_trampoline(unsigned long addr)
1095 return ftrace_ops_trampoline(addr) != NULL;
1098 struct ftrace_page {
1099 struct ftrace_page *next;
1100 struct dyn_ftrace *records;
1101 int index;
1102 int size;
1105 #define ENTRY_SIZE sizeof(struct dyn_ftrace)
1106 #define ENTRIES_PER_PAGE (PAGE_SIZE / ENTRY_SIZE)
1108 /* estimate from running different kernels */
1109 #define NR_TO_INIT 10000
1111 static struct ftrace_page *ftrace_pages_start;
1112 static struct ftrace_page *ftrace_pages;
1114 static __always_inline unsigned long
1115 ftrace_hash_key(struct ftrace_hash *hash, unsigned long ip)
1117 if (hash->size_bits > 0)
1118 return hash_long(ip, hash->size_bits);
1120 return 0;
1123 /* Only use this function if ftrace_hash_empty() has already been tested */
1124 static __always_inline struct ftrace_func_entry *
1125 __ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1127 unsigned long key;
1128 struct ftrace_func_entry *entry;
1129 struct hlist_head *hhd;
1131 key = ftrace_hash_key(hash, ip);
1132 hhd = &hash->buckets[key];
1134 hlist_for_each_entry_rcu_notrace(entry, hhd, hlist) {
1135 if (entry->ip == ip)
1136 return entry;
1138 return NULL;
1142 * ftrace_lookup_ip - Test to see if an ip exists in an ftrace_hash
1143 * @hash: The hash to look at
1144 * @ip: The instruction pointer to test
1146 * Search a given @hash to see if a given instruction pointer (@ip)
1147 * exists in it.
1149 * Returns the entry that holds the @ip if found. NULL otherwise.
1151 struct ftrace_func_entry *
1152 ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1154 if (ftrace_hash_empty(hash))
1155 return NULL;
1157 return __ftrace_lookup_ip(hash, ip);
1160 static void __add_hash_entry(struct ftrace_hash *hash,
1161 struct ftrace_func_entry *entry)
1163 struct hlist_head *hhd;
1164 unsigned long key;
1166 key = ftrace_hash_key(hash, entry->ip);
1167 hhd = &hash->buckets[key];
1168 hlist_add_head(&entry->hlist, hhd);
1169 hash->count++;
1172 static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
1174 struct ftrace_func_entry *entry;
1176 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
1177 if (!entry)
1178 return -ENOMEM;
1180 entry->ip = ip;
1181 __add_hash_entry(hash, entry);
1183 return 0;
1186 static void
1187 free_hash_entry(struct ftrace_hash *hash,
1188 struct ftrace_func_entry *entry)
1190 hlist_del(&entry->hlist);
1191 kfree(entry);
1192 hash->count--;
1195 static void
1196 remove_hash_entry(struct ftrace_hash *hash,
1197 struct ftrace_func_entry *entry)
1199 hlist_del_rcu(&entry->hlist);
1200 hash->count--;
1203 static void ftrace_hash_clear(struct ftrace_hash *hash)
1205 struct hlist_head *hhd;
1206 struct hlist_node *tn;
1207 struct ftrace_func_entry *entry;
1208 int size = 1 << hash->size_bits;
1209 int i;
1211 if (!hash->count)
1212 return;
1214 for (i = 0; i < size; i++) {
1215 hhd = &hash->buckets[i];
1216 hlist_for_each_entry_safe(entry, tn, hhd, hlist)
1217 free_hash_entry(hash, entry);
1219 FTRACE_WARN_ON(hash->count);
1222 static void free_ftrace_mod(struct ftrace_mod_load *ftrace_mod)
1224 list_del(&ftrace_mod->list);
1225 kfree(ftrace_mod->module);
1226 kfree(ftrace_mod->func);
1227 kfree(ftrace_mod);
1230 static void clear_ftrace_mod_list(struct list_head *head)
1232 struct ftrace_mod_load *p, *n;
1234 /* stack tracer isn't supported yet */
1235 if (!head)
1236 return;
1238 mutex_lock(&ftrace_lock);
1239 list_for_each_entry_safe(p, n, head, list)
1240 free_ftrace_mod(p);
1241 mutex_unlock(&ftrace_lock);
1244 static void free_ftrace_hash(struct ftrace_hash *hash)
1246 if (!hash || hash == EMPTY_HASH)
1247 return;
1248 ftrace_hash_clear(hash);
1249 kfree(hash->buckets);
1250 kfree(hash);
1253 static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
1255 struct ftrace_hash *hash;
1257 hash = container_of(rcu, struct ftrace_hash, rcu);
1258 free_ftrace_hash(hash);
1261 static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
1263 if (!hash || hash == EMPTY_HASH)
1264 return;
1265 call_rcu(&hash->rcu, __free_ftrace_hash_rcu);
1268 void ftrace_free_filter(struct ftrace_ops *ops)
1270 ftrace_ops_init(ops);
1271 free_ftrace_hash(ops->func_hash->filter_hash);
1272 free_ftrace_hash(ops->func_hash->notrace_hash);
1275 static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
1277 struct ftrace_hash *hash;
1278 int size;
1280 hash = kzalloc(sizeof(*hash), GFP_KERNEL);
1281 if (!hash)
1282 return NULL;
1284 size = 1 << size_bits;
1285 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL);
1287 if (!hash->buckets) {
1288 kfree(hash);
1289 return NULL;
1292 hash->size_bits = size_bits;
1294 return hash;
1298 static int ftrace_add_mod(struct trace_array *tr,
1299 const char *func, const char *module,
1300 int enable)
1302 struct ftrace_mod_load *ftrace_mod;
1303 struct list_head *mod_head = enable ? &tr->mod_trace : &tr->mod_notrace;
1305 ftrace_mod = kzalloc(sizeof(*ftrace_mod), GFP_KERNEL);
1306 if (!ftrace_mod)
1307 return -ENOMEM;
1309 ftrace_mod->func = kstrdup(func, GFP_KERNEL);
1310 ftrace_mod->module = kstrdup(module, GFP_KERNEL);
1311 ftrace_mod->enable = enable;
1313 if (!ftrace_mod->func || !ftrace_mod->module)
1314 goto out_free;
1316 list_add(&ftrace_mod->list, mod_head);
1318 return 0;
1320 out_free:
1321 free_ftrace_mod(ftrace_mod);
1323 return -ENOMEM;
1326 static struct ftrace_hash *
1327 alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
1329 struct ftrace_func_entry *entry;
1330 struct ftrace_hash *new_hash;
1331 int size;
1332 int ret;
1333 int i;
1335 new_hash = alloc_ftrace_hash(size_bits);
1336 if (!new_hash)
1337 return NULL;
1339 if (hash)
1340 new_hash->flags = hash->flags;
1342 /* Empty hash? */
1343 if (ftrace_hash_empty(hash))
1344 return new_hash;
1346 size = 1 << hash->size_bits;
1347 for (i = 0; i < size; i++) {
1348 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
1349 ret = add_hash_entry(new_hash, entry->ip);
1350 if (ret < 0)
1351 goto free_hash;
1355 FTRACE_WARN_ON(new_hash->count != hash->count);
1357 return new_hash;
1359 free_hash:
1360 free_ftrace_hash(new_hash);
1361 return NULL;
1364 static void
1365 ftrace_hash_rec_disable_modify(struct ftrace_ops *ops, int filter_hash);
1366 static void
1367 ftrace_hash_rec_enable_modify(struct ftrace_ops *ops, int filter_hash);
1369 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1370 struct ftrace_hash *new_hash);
1372 static struct ftrace_hash *
1373 __ftrace_hash_move(struct ftrace_hash *src)
1375 struct ftrace_func_entry *entry;
1376 struct hlist_node *tn;
1377 struct hlist_head *hhd;
1378 struct ftrace_hash *new_hash;
1379 int size = src->count;
1380 int bits = 0;
1381 int i;
1384 * If the new source is empty, just return the empty_hash.
1386 if (ftrace_hash_empty(src))
1387 return EMPTY_HASH;
1390 * Make the hash size about 1/2 the # found
1392 for (size /= 2; size; size >>= 1)
1393 bits++;
1395 /* Don't allocate too much */
1396 if (bits > FTRACE_HASH_MAX_BITS)
1397 bits = FTRACE_HASH_MAX_BITS;
1399 new_hash = alloc_ftrace_hash(bits);
1400 if (!new_hash)
1401 return NULL;
1403 new_hash->flags = src->flags;
1405 size = 1 << src->size_bits;
1406 for (i = 0; i < size; i++) {
1407 hhd = &src->buckets[i];
1408 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1409 remove_hash_entry(src, entry);
1410 __add_hash_entry(new_hash, entry);
1414 return new_hash;
1417 static int
1418 ftrace_hash_move(struct ftrace_ops *ops, int enable,
1419 struct ftrace_hash **dst, struct ftrace_hash *src)
1421 struct ftrace_hash *new_hash;
1422 int ret;
1424 /* Reject setting notrace hash on IPMODIFY ftrace_ops */
1425 if (ops->flags & FTRACE_OPS_FL_IPMODIFY && !enable)
1426 return -EINVAL;
1428 new_hash = __ftrace_hash_move(src);
1429 if (!new_hash)
1430 return -ENOMEM;
1432 /* Make sure this can be applied if it is IPMODIFY ftrace_ops */
1433 if (enable) {
1434 /* IPMODIFY should be updated only when filter_hash updating */
1435 ret = ftrace_hash_ipmodify_update(ops, new_hash);
1436 if (ret < 0) {
1437 free_ftrace_hash(new_hash);
1438 return ret;
1443 * Remove the current set, update the hash and add
1444 * them back.
1446 ftrace_hash_rec_disable_modify(ops, enable);
1448 rcu_assign_pointer(*dst, new_hash);
1450 ftrace_hash_rec_enable_modify(ops, enable);
1452 return 0;
1455 static bool hash_contains_ip(unsigned long ip,
1456 struct ftrace_ops_hash *hash)
1459 * The function record is a match if it exists in the filter
1460 * hash and not in the notrace hash. Note, an emty hash is
1461 * considered a match for the filter hash, but an empty
1462 * notrace hash is considered not in the notrace hash.
1464 return (ftrace_hash_empty(hash->filter_hash) ||
1465 __ftrace_lookup_ip(hash->filter_hash, ip)) &&
1466 (ftrace_hash_empty(hash->notrace_hash) ||
1467 !__ftrace_lookup_ip(hash->notrace_hash, ip));
1471 * Test the hashes for this ops to see if we want to call
1472 * the ops->func or not.
1474 * It's a match if the ip is in the ops->filter_hash or
1475 * the filter_hash does not exist or is empty,
1476 * AND
1477 * the ip is not in the ops->notrace_hash.
1479 * This needs to be called with preemption disabled as
1480 * the hashes are freed with call_rcu().
1483 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1485 struct ftrace_ops_hash hash;
1486 int ret;
1488 #ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1490 * There's a small race when adding ops that the ftrace handler
1491 * that wants regs, may be called without them. We can not
1492 * allow that handler to be called if regs is NULL.
1494 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1495 return 0;
1496 #endif
1498 rcu_assign_pointer(hash.filter_hash, ops->func_hash->filter_hash);
1499 rcu_assign_pointer(hash.notrace_hash, ops->func_hash->notrace_hash);
1501 if (hash_contains_ip(ip, &hash))
1502 ret = 1;
1503 else
1504 ret = 0;
1506 return ret;
1510 * This is a double for. Do not use 'break' to break out of the loop,
1511 * you must use a goto.
1513 #define do_for_each_ftrace_rec(pg, rec) \
1514 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1515 int _____i; \
1516 for (_____i = 0; _____i < pg->index; _____i++) { \
1517 rec = &pg->records[_____i];
1519 #define while_for_each_ftrace_rec() \
1524 static int ftrace_cmp_recs(const void *a, const void *b)
1526 const struct dyn_ftrace *key = a;
1527 const struct dyn_ftrace *rec = b;
1529 if (key->flags < rec->ip)
1530 return -1;
1531 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1532 return 1;
1533 return 0;
1537 * ftrace_location_range - return the first address of a traced location
1538 * if it touches the given ip range
1539 * @start: start of range to search.
1540 * @end: end of range to search (inclusive). @end points to the last byte
1541 * to check.
1543 * Returns rec->ip if the related ftrace location is a least partly within
1544 * the given address range. That is, the first address of the instruction
1545 * that is either a NOP or call to the function tracer. It checks the ftrace
1546 * internal tables to determine if the address belongs or not.
1548 unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1550 struct ftrace_page *pg;
1551 struct dyn_ftrace *rec;
1552 struct dyn_ftrace key;
1554 key.ip = start;
1555 key.flags = end; /* overload flags, as it is unsigned long */
1557 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1558 if (end < pg->records[0].ip ||
1559 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1560 continue;
1561 rec = bsearch(&key, pg->records, pg->index,
1562 sizeof(struct dyn_ftrace),
1563 ftrace_cmp_recs);
1564 if (rec)
1565 return rec->ip;
1568 return 0;
1572 * ftrace_location - return true if the ip giving is a traced location
1573 * @ip: the instruction pointer to check
1575 * Returns rec->ip if @ip given is a pointer to a ftrace location.
1576 * That is, the instruction that is either a NOP or call to
1577 * the function tracer. It checks the ftrace internal tables to
1578 * determine if the address belongs or not.
1580 unsigned long ftrace_location(unsigned long ip)
1582 return ftrace_location_range(ip, ip);
1586 * ftrace_text_reserved - return true if range contains an ftrace location
1587 * @start: start of range to search
1588 * @end: end of range to search (inclusive). @end points to the last byte to check.
1590 * Returns 1 if @start and @end contains a ftrace location.
1591 * That is, the instruction that is either a NOP or call to
1592 * the function tracer. It checks the ftrace internal tables to
1593 * determine if the address belongs or not.
1595 int ftrace_text_reserved(const void *start, const void *end)
1597 unsigned long ret;
1599 ret = ftrace_location_range((unsigned long)start,
1600 (unsigned long)end);
1602 return (int)!!ret;
1605 /* Test if ops registered to this rec needs regs */
1606 static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1608 struct ftrace_ops *ops;
1609 bool keep_regs = false;
1611 for (ops = ftrace_ops_list;
1612 ops != &ftrace_list_end; ops = ops->next) {
1613 /* pass rec in as regs to have non-NULL val */
1614 if (ftrace_ops_test(ops, rec->ip, rec)) {
1615 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1616 keep_regs = true;
1617 break;
1622 return keep_regs;
1625 static struct ftrace_ops *
1626 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec);
1627 static struct ftrace_ops *
1628 ftrace_find_tramp_ops_next(struct dyn_ftrace *rec, struct ftrace_ops *ops);
1630 static bool __ftrace_hash_rec_update(struct ftrace_ops *ops,
1631 int filter_hash,
1632 bool inc)
1634 struct ftrace_hash *hash;
1635 struct ftrace_hash *other_hash;
1636 struct ftrace_page *pg;
1637 struct dyn_ftrace *rec;
1638 bool update = false;
1639 int count = 0;
1640 int all = false;
1642 /* Only update if the ops has been registered */
1643 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1644 return false;
1647 * In the filter_hash case:
1648 * If the count is zero, we update all records.
1649 * Otherwise we just update the items in the hash.
1651 * In the notrace_hash case:
1652 * We enable the update in the hash.
1653 * As disabling notrace means enabling the tracing,
1654 * and enabling notrace means disabling, the inc variable
1655 * gets inversed.
1657 if (filter_hash) {
1658 hash = ops->func_hash->filter_hash;
1659 other_hash = ops->func_hash->notrace_hash;
1660 if (ftrace_hash_empty(hash))
1661 all = true;
1662 } else {
1663 inc = !inc;
1664 hash = ops->func_hash->notrace_hash;
1665 other_hash = ops->func_hash->filter_hash;
1667 * If the notrace hash has no items,
1668 * then there's nothing to do.
1670 if (ftrace_hash_empty(hash))
1671 return false;
1674 do_for_each_ftrace_rec(pg, rec) {
1675 int in_other_hash = 0;
1676 int in_hash = 0;
1677 int match = 0;
1679 if (rec->flags & FTRACE_FL_DISABLED)
1680 continue;
1682 if (all) {
1684 * Only the filter_hash affects all records.
1685 * Update if the record is not in the notrace hash.
1687 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1688 match = 1;
1689 } else {
1690 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1691 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1694 * If filter_hash is set, we want to match all functions
1695 * that are in the hash but not in the other hash.
1697 * If filter_hash is not set, then we are decrementing.
1698 * That means we match anything that is in the hash
1699 * and also in the other_hash. That is, we need to turn
1700 * off functions in the other hash because they are disabled
1701 * by this hash.
1703 if (filter_hash && in_hash && !in_other_hash)
1704 match = 1;
1705 else if (!filter_hash && in_hash &&
1706 (in_other_hash || ftrace_hash_empty(other_hash)))
1707 match = 1;
1709 if (!match)
1710 continue;
1712 if (inc) {
1713 rec->flags++;
1714 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1715 return false;
1718 * If there's only a single callback registered to a
1719 * function, and the ops has a trampoline registered
1720 * for it, then we can call it directly.
1722 if (ftrace_rec_count(rec) == 1 && ops->trampoline)
1723 rec->flags |= FTRACE_FL_TRAMP;
1724 else
1726 * If we are adding another function callback
1727 * to this function, and the previous had a
1728 * custom trampoline in use, then we need to go
1729 * back to the default trampoline.
1731 rec->flags &= ~FTRACE_FL_TRAMP;
1734 * If any ops wants regs saved for this function
1735 * then all ops will get saved regs.
1737 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1738 rec->flags |= FTRACE_FL_REGS;
1739 } else {
1740 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1741 return false;
1742 rec->flags--;
1745 * If the rec had REGS enabled and the ops that is
1746 * being removed had REGS set, then see if there is
1747 * still any ops for this record that wants regs.
1748 * If not, we can stop recording them.
1750 if (ftrace_rec_count(rec) > 0 &&
1751 rec->flags & FTRACE_FL_REGS &&
1752 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1753 if (!test_rec_ops_needs_regs(rec))
1754 rec->flags &= ~FTRACE_FL_REGS;
1758 * The TRAMP needs to be set only if rec count
1759 * is decremented to one, and the ops that is
1760 * left has a trampoline. As TRAMP can only be
1761 * enabled if there is only a single ops attached
1762 * to it.
1764 if (ftrace_rec_count(rec) == 1 &&
1765 ftrace_find_tramp_ops_any(rec))
1766 rec->flags |= FTRACE_FL_TRAMP;
1767 else
1768 rec->flags &= ~FTRACE_FL_TRAMP;
1771 * flags will be cleared in ftrace_check_record()
1772 * if rec count is zero.
1775 count++;
1777 /* Must match FTRACE_UPDATE_CALLS in ftrace_modify_all_code() */
1778 update |= ftrace_test_record(rec, true) != FTRACE_UPDATE_IGNORE;
1780 /* Shortcut, if we handled all records, we are done. */
1781 if (!all && count == hash->count)
1782 return update;
1783 } while_for_each_ftrace_rec();
1785 return update;
1788 static bool ftrace_hash_rec_disable(struct ftrace_ops *ops,
1789 int filter_hash)
1791 return __ftrace_hash_rec_update(ops, filter_hash, 0);
1794 static bool ftrace_hash_rec_enable(struct ftrace_ops *ops,
1795 int filter_hash)
1797 return __ftrace_hash_rec_update(ops, filter_hash, 1);
1800 static void ftrace_hash_rec_update_modify(struct ftrace_ops *ops,
1801 int filter_hash, int inc)
1803 struct ftrace_ops *op;
1805 __ftrace_hash_rec_update(ops, filter_hash, inc);
1807 if (ops->func_hash != &global_ops.local_hash)
1808 return;
1811 * If the ops shares the global_ops hash, then we need to update
1812 * all ops that are enabled and use this hash.
1814 do_for_each_ftrace_op(op, ftrace_ops_list) {
1815 /* Already done */
1816 if (op == ops)
1817 continue;
1818 if (op->func_hash == &global_ops.local_hash)
1819 __ftrace_hash_rec_update(op, filter_hash, inc);
1820 } while_for_each_ftrace_op(op);
1823 static void ftrace_hash_rec_disable_modify(struct ftrace_ops *ops,
1824 int filter_hash)
1826 ftrace_hash_rec_update_modify(ops, filter_hash, 0);
1829 static void ftrace_hash_rec_enable_modify(struct ftrace_ops *ops,
1830 int filter_hash)
1832 ftrace_hash_rec_update_modify(ops, filter_hash, 1);
1836 * Try to update IPMODIFY flag on each ftrace_rec. Return 0 if it is OK
1837 * or no-needed to update, -EBUSY if it detects a conflict of the flag
1838 * on a ftrace_rec, and -EINVAL if the new_hash tries to trace all recs.
1839 * Note that old_hash and new_hash has below meanings
1840 * - If the hash is NULL, it hits all recs (if IPMODIFY is set, this is rejected)
1841 * - If the hash is EMPTY_HASH, it hits nothing
1842 * - Anything else hits the recs which match the hash entries.
1844 static int __ftrace_hash_update_ipmodify(struct ftrace_ops *ops,
1845 struct ftrace_hash *old_hash,
1846 struct ftrace_hash *new_hash)
1848 struct ftrace_page *pg;
1849 struct dyn_ftrace *rec, *end = NULL;
1850 int in_old, in_new;
1852 /* Only update if the ops has been registered */
1853 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1854 return 0;
1856 if (!(ops->flags & FTRACE_OPS_FL_IPMODIFY))
1857 return 0;
1860 * Since the IPMODIFY is a very address sensitive action, we do not
1861 * allow ftrace_ops to set all functions to new hash.
1863 if (!new_hash || !old_hash)
1864 return -EINVAL;
1866 /* Update rec->flags */
1867 do_for_each_ftrace_rec(pg, rec) {
1869 if (rec->flags & FTRACE_FL_DISABLED)
1870 continue;
1872 /* We need to update only differences of filter_hash */
1873 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1874 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1875 if (in_old == in_new)
1876 continue;
1878 if (in_new) {
1879 /* New entries must ensure no others are using it */
1880 if (rec->flags & FTRACE_FL_IPMODIFY)
1881 goto rollback;
1882 rec->flags |= FTRACE_FL_IPMODIFY;
1883 } else /* Removed entry */
1884 rec->flags &= ~FTRACE_FL_IPMODIFY;
1885 } while_for_each_ftrace_rec();
1887 return 0;
1889 rollback:
1890 end = rec;
1892 /* Roll back what we did above */
1893 do_for_each_ftrace_rec(pg, rec) {
1895 if (rec->flags & FTRACE_FL_DISABLED)
1896 continue;
1898 if (rec == end)
1899 goto err_out;
1901 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1902 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1903 if (in_old == in_new)
1904 continue;
1906 if (in_new)
1907 rec->flags &= ~FTRACE_FL_IPMODIFY;
1908 else
1909 rec->flags |= FTRACE_FL_IPMODIFY;
1910 } while_for_each_ftrace_rec();
1912 err_out:
1913 return -EBUSY;
1916 static int ftrace_hash_ipmodify_enable(struct ftrace_ops *ops)
1918 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1920 if (ftrace_hash_empty(hash))
1921 hash = NULL;
1923 return __ftrace_hash_update_ipmodify(ops, EMPTY_HASH, hash);
1926 /* Disabling always succeeds */
1927 static void ftrace_hash_ipmodify_disable(struct ftrace_ops *ops)
1929 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1931 if (ftrace_hash_empty(hash))
1932 hash = NULL;
1934 __ftrace_hash_update_ipmodify(ops, hash, EMPTY_HASH);
1937 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1938 struct ftrace_hash *new_hash)
1940 struct ftrace_hash *old_hash = ops->func_hash->filter_hash;
1942 if (ftrace_hash_empty(old_hash))
1943 old_hash = NULL;
1945 if (ftrace_hash_empty(new_hash))
1946 new_hash = NULL;
1948 return __ftrace_hash_update_ipmodify(ops, old_hash, new_hash);
1951 static void print_ip_ins(const char *fmt, const unsigned char *p)
1953 int i;
1955 printk(KERN_CONT "%s", fmt);
1957 for (i = 0; i < MCOUNT_INSN_SIZE; i++)
1958 printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
1961 enum ftrace_bug_type ftrace_bug_type;
1962 const void *ftrace_expected;
1964 static void print_bug_type(void)
1966 switch (ftrace_bug_type) {
1967 case FTRACE_BUG_UNKNOWN:
1968 break;
1969 case FTRACE_BUG_INIT:
1970 pr_info("Initializing ftrace call sites\n");
1971 break;
1972 case FTRACE_BUG_NOP:
1973 pr_info("Setting ftrace call site to NOP\n");
1974 break;
1975 case FTRACE_BUG_CALL:
1976 pr_info("Setting ftrace call site to call ftrace function\n");
1977 break;
1978 case FTRACE_BUG_UPDATE:
1979 pr_info("Updating ftrace call site to call a different ftrace function\n");
1980 break;
1985 * ftrace_bug - report and shutdown function tracer
1986 * @failed: The failed type (EFAULT, EINVAL, EPERM)
1987 * @rec: The record that failed
1989 * The arch code that enables or disables the function tracing
1990 * can call ftrace_bug() when it has detected a problem in
1991 * modifying the code. @failed should be one of either:
1992 * EFAULT - if the problem happens on reading the @ip address
1993 * EINVAL - if what is read at @ip is not what was expected
1994 * EPERM - if the problem happens on writing to the @ip address
1996 void ftrace_bug(int failed, struct dyn_ftrace *rec)
1998 unsigned long ip = rec ? rec->ip : 0;
2000 switch (failed) {
2001 case -EFAULT:
2002 FTRACE_WARN_ON_ONCE(1);
2003 pr_info("ftrace faulted on modifying ");
2004 print_ip_sym(ip);
2005 break;
2006 case -EINVAL:
2007 FTRACE_WARN_ON_ONCE(1);
2008 pr_info("ftrace failed to modify ");
2009 print_ip_sym(ip);
2010 print_ip_ins(" actual: ", (unsigned char *)ip);
2011 pr_cont("\n");
2012 if (ftrace_expected) {
2013 print_ip_ins(" expected: ", ftrace_expected);
2014 pr_cont("\n");
2016 break;
2017 case -EPERM:
2018 FTRACE_WARN_ON_ONCE(1);
2019 pr_info("ftrace faulted on writing ");
2020 print_ip_sym(ip);
2021 break;
2022 default:
2023 FTRACE_WARN_ON_ONCE(1);
2024 pr_info("ftrace faulted on unknown error ");
2025 print_ip_sym(ip);
2027 print_bug_type();
2028 if (rec) {
2029 struct ftrace_ops *ops = NULL;
2031 pr_info("ftrace record flags: %lx\n", rec->flags);
2032 pr_cont(" (%ld)%s", ftrace_rec_count(rec),
2033 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2034 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2035 ops = ftrace_find_tramp_ops_any(rec);
2036 if (ops) {
2037 do {
2038 pr_cont("\ttramp: %pS (%pS)",
2039 (void *)ops->trampoline,
2040 (void *)ops->func);
2041 ops = ftrace_find_tramp_ops_next(rec, ops);
2042 } while (ops);
2043 } else
2044 pr_cont("\ttramp: ERROR!");
2047 ip = ftrace_get_addr_curr(rec);
2048 pr_cont("\n expected tramp: %lx\n", ip);
2052 static int ftrace_check_record(struct dyn_ftrace *rec, bool enable, bool update)
2054 unsigned long flag = 0UL;
2056 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2058 if (rec->flags & FTRACE_FL_DISABLED)
2059 return FTRACE_UPDATE_IGNORE;
2062 * If we are updating calls:
2064 * If the record has a ref count, then we need to enable it
2065 * because someone is using it.
2067 * Otherwise we make sure its disabled.
2069 * If we are disabling calls, then disable all records that
2070 * are enabled.
2072 if (enable && ftrace_rec_count(rec))
2073 flag = FTRACE_FL_ENABLED;
2076 * If enabling and the REGS flag does not match the REGS_EN, or
2077 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
2078 * this record. Set flags to fail the compare against ENABLED.
2080 if (flag) {
2081 if (!(rec->flags & FTRACE_FL_REGS) !=
2082 !(rec->flags & FTRACE_FL_REGS_EN))
2083 flag |= FTRACE_FL_REGS;
2085 if (!(rec->flags & FTRACE_FL_TRAMP) !=
2086 !(rec->flags & FTRACE_FL_TRAMP_EN))
2087 flag |= FTRACE_FL_TRAMP;
2090 /* If the state of this record hasn't changed, then do nothing */
2091 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
2092 return FTRACE_UPDATE_IGNORE;
2094 if (flag) {
2095 /* Save off if rec is being enabled (for return value) */
2096 flag ^= rec->flags & FTRACE_FL_ENABLED;
2098 if (update) {
2099 rec->flags |= FTRACE_FL_ENABLED;
2100 if (flag & FTRACE_FL_REGS) {
2101 if (rec->flags & FTRACE_FL_REGS)
2102 rec->flags |= FTRACE_FL_REGS_EN;
2103 else
2104 rec->flags &= ~FTRACE_FL_REGS_EN;
2106 if (flag & FTRACE_FL_TRAMP) {
2107 if (rec->flags & FTRACE_FL_TRAMP)
2108 rec->flags |= FTRACE_FL_TRAMP_EN;
2109 else
2110 rec->flags &= ~FTRACE_FL_TRAMP_EN;
2115 * If this record is being updated from a nop, then
2116 * return UPDATE_MAKE_CALL.
2117 * Otherwise,
2118 * return UPDATE_MODIFY_CALL to tell the caller to convert
2119 * from the save regs, to a non-save regs function or
2120 * vice versa, or from a trampoline call.
2122 if (flag & FTRACE_FL_ENABLED) {
2123 ftrace_bug_type = FTRACE_BUG_CALL;
2124 return FTRACE_UPDATE_MAKE_CALL;
2127 ftrace_bug_type = FTRACE_BUG_UPDATE;
2128 return FTRACE_UPDATE_MODIFY_CALL;
2131 if (update) {
2132 /* If there's no more users, clear all flags */
2133 if (!ftrace_rec_count(rec))
2134 rec->flags = 0;
2135 else
2137 * Just disable the record, but keep the ops TRAMP
2138 * and REGS states. The _EN flags must be disabled though.
2140 rec->flags &= ~(FTRACE_FL_ENABLED | FTRACE_FL_TRAMP_EN |
2141 FTRACE_FL_REGS_EN);
2144 ftrace_bug_type = FTRACE_BUG_NOP;
2145 return FTRACE_UPDATE_MAKE_NOP;
2149 * ftrace_update_record, set a record that now is tracing or not
2150 * @rec: the record to update
2151 * @enable: set to true if the record is tracing, false to force disable
2153 * The records that represent all functions that can be traced need
2154 * to be updated when tracing has been enabled.
2156 int ftrace_update_record(struct dyn_ftrace *rec, bool enable)
2158 return ftrace_check_record(rec, enable, true);
2162 * ftrace_test_record, check if the record has been enabled or not
2163 * @rec: the record to test
2164 * @enable: set to true to check if enabled, false if it is disabled
2166 * The arch code may need to test if a record is already set to
2167 * tracing to determine how to modify the function code that it
2168 * represents.
2170 int ftrace_test_record(struct dyn_ftrace *rec, bool enable)
2172 return ftrace_check_record(rec, enable, false);
2175 static struct ftrace_ops *
2176 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec)
2178 struct ftrace_ops *op;
2179 unsigned long ip = rec->ip;
2181 do_for_each_ftrace_op(op, ftrace_ops_list) {
2183 if (!op->trampoline)
2184 continue;
2186 if (hash_contains_ip(ip, op->func_hash))
2187 return op;
2188 } while_for_each_ftrace_op(op);
2190 return NULL;
2193 static struct ftrace_ops *
2194 ftrace_find_tramp_ops_next(struct dyn_ftrace *rec,
2195 struct ftrace_ops *op)
2197 unsigned long ip = rec->ip;
2199 while_for_each_ftrace_op(op) {
2201 if (!op->trampoline)
2202 continue;
2204 if (hash_contains_ip(ip, op->func_hash))
2205 return op;
2208 return NULL;
2211 static struct ftrace_ops *
2212 ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
2214 struct ftrace_ops *op;
2215 unsigned long ip = rec->ip;
2218 * Need to check removed ops first.
2219 * If they are being removed, and this rec has a tramp,
2220 * and this rec is in the ops list, then it would be the
2221 * one with the tramp.
2223 if (removed_ops) {
2224 if (hash_contains_ip(ip, &removed_ops->old_hash))
2225 return removed_ops;
2229 * Need to find the current trampoline for a rec.
2230 * Now, a trampoline is only attached to a rec if there
2231 * was a single 'ops' attached to it. But this can be called
2232 * when we are adding another op to the rec or removing the
2233 * current one. Thus, if the op is being added, we can
2234 * ignore it because it hasn't attached itself to the rec
2235 * yet.
2237 * If an ops is being modified (hooking to different functions)
2238 * then we don't care about the new functions that are being
2239 * added, just the old ones (that are probably being removed).
2241 * If we are adding an ops to a function that already is using
2242 * a trampoline, it needs to be removed (trampolines are only
2243 * for single ops connected), then an ops that is not being
2244 * modified also needs to be checked.
2246 do_for_each_ftrace_op(op, ftrace_ops_list) {
2248 if (!op->trampoline)
2249 continue;
2252 * If the ops is being added, it hasn't gotten to
2253 * the point to be removed from this tree yet.
2255 if (op->flags & FTRACE_OPS_FL_ADDING)
2256 continue;
2260 * If the ops is being modified and is in the old
2261 * hash, then it is probably being removed from this
2262 * function.
2264 if ((op->flags & FTRACE_OPS_FL_MODIFYING) &&
2265 hash_contains_ip(ip, &op->old_hash))
2266 return op;
2268 * If the ops is not being added or modified, and it's
2269 * in its normal filter hash, then this must be the one
2270 * we want!
2272 if (!(op->flags & FTRACE_OPS_FL_MODIFYING) &&
2273 hash_contains_ip(ip, op->func_hash))
2274 return op;
2276 } while_for_each_ftrace_op(op);
2278 return NULL;
2281 static struct ftrace_ops *
2282 ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
2284 struct ftrace_ops *op;
2285 unsigned long ip = rec->ip;
2287 do_for_each_ftrace_op(op, ftrace_ops_list) {
2288 /* pass rec in as regs to have non-NULL val */
2289 if (hash_contains_ip(ip, op->func_hash))
2290 return op;
2291 } while_for_each_ftrace_op(op);
2293 return NULL;
2297 * ftrace_get_addr_new - Get the call address to set to
2298 * @rec: The ftrace record descriptor
2300 * If the record has the FTRACE_FL_REGS set, that means that it
2301 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
2302 * is not not set, then it wants to convert to the normal callback.
2304 * Returns the address of the trampoline to set to
2306 unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
2308 struct ftrace_ops *ops;
2310 /* Trampolines take precedence over regs */
2311 if (rec->flags & FTRACE_FL_TRAMP) {
2312 ops = ftrace_find_tramp_ops_new(rec);
2313 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
2314 pr_warn("Bad trampoline accounting at: %p (%pS) (%lx)\n",
2315 (void *)rec->ip, (void *)rec->ip, rec->flags);
2316 /* Ftrace is shutting down, return anything */
2317 return (unsigned long)FTRACE_ADDR;
2319 return ops->trampoline;
2322 if (rec->flags & FTRACE_FL_REGS)
2323 return (unsigned long)FTRACE_REGS_ADDR;
2324 else
2325 return (unsigned long)FTRACE_ADDR;
2329 * ftrace_get_addr_curr - Get the call address that is already there
2330 * @rec: The ftrace record descriptor
2332 * The FTRACE_FL_REGS_EN is set when the record already points to
2333 * a function that saves all the regs. Basically the '_EN' version
2334 * represents the current state of the function.
2336 * Returns the address of the trampoline that is currently being called
2338 unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
2340 struct ftrace_ops *ops;
2342 /* Trampolines take precedence over regs */
2343 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2344 ops = ftrace_find_tramp_ops_curr(rec);
2345 if (FTRACE_WARN_ON(!ops)) {
2346 pr_warn("Bad trampoline accounting at: %p (%pS)\n",
2347 (void *)rec->ip, (void *)rec->ip);
2348 /* Ftrace is shutting down, return anything */
2349 return (unsigned long)FTRACE_ADDR;
2351 return ops->trampoline;
2354 if (rec->flags & FTRACE_FL_REGS_EN)
2355 return (unsigned long)FTRACE_REGS_ADDR;
2356 else
2357 return (unsigned long)FTRACE_ADDR;
2360 static int
2361 __ftrace_replace_code(struct dyn_ftrace *rec, bool enable)
2363 unsigned long ftrace_old_addr;
2364 unsigned long ftrace_addr;
2365 int ret;
2367 ftrace_addr = ftrace_get_addr_new(rec);
2369 /* This needs to be done before we call ftrace_update_record */
2370 ftrace_old_addr = ftrace_get_addr_curr(rec);
2372 ret = ftrace_update_record(rec, enable);
2374 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2376 switch (ret) {
2377 case FTRACE_UPDATE_IGNORE:
2378 return 0;
2380 case FTRACE_UPDATE_MAKE_CALL:
2381 ftrace_bug_type = FTRACE_BUG_CALL;
2382 return ftrace_make_call(rec, ftrace_addr);
2384 case FTRACE_UPDATE_MAKE_NOP:
2385 ftrace_bug_type = FTRACE_BUG_NOP;
2386 return ftrace_make_nop(NULL, rec, ftrace_old_addr);
2388 case FTRACE_UPDATE_MODIFY_CALL:
2389 ftrace_bug_type = FTRACE_BUG_UPDATE;
2390 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
2393 return -1; /* unknown ftrace bug */
2396 void __weak ftrace_replace_code(int mod_flags)
2398 struct dyn_ftrace *rec;
2399 struct ftrace_page *pg;
2400 bool enable = mod_flags & FTRACE_MODIFY_ENABLE_FL;
2401 int schedulable = mod_flags & FTRACE_MODIFY_MAY_SLEEP_FL;
2402 int failed;
2404 if (unlikely(ftrace_disabled))
2405 return;
2407 do_for_each_ftrace_rec(pg, rec) {
2409 if (rec->flags & FTRACE_FL_DISABLED)
2410 continue;
2412 failed = __ftrace_replace_code(rec, enable);
2413 if (failed) {
2414 ftrace_bug(failed, rec);
2415 /* Stop processing */
2416 return;
2418 if (schedulable)
2419 cond_resched();
2420 } while_for_each_ftrace_rec();
2423 struct ftrace_rec_iter {
2424 struct ftrace_page *pg;
2425 int index;
2429 * ftrace_rec_iter_start, start up iterating over traced functions
2431 * Returns an iterator handle that is used to iterate over all
2432 * the records that represent address locations where functions
2433 * are traced.
2435 * May return NULL if no records are available.
2437 struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2440 * We only use a single iterator.
2441 * Protected by the ftrace_lock mutex.
2443 static struct ftrace_rec_iter ftrace_rec_iter;
2444 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2446 iter->pg = ftrace_pages_start;
2447 iter->index = 0;
2449 /* Could have empty pages */
2450 while (iter->pg && !iter->pg->index)
2451 iter->pg = iter->pg->next;
2453 if (!iter->pg)
2454 return NULL;
2456 return iter;
2460 * ftrace_rec_iter_next, get the next record to process.
2461 * @iter: The handle to the iterator.
2463 * Returns the next iterator after the given iterator @iter.
2465 struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2467 iter->index++;
2469 if (iter->index >= iter->pg->index) {
2470 iter->pg = iter->pg->next;
2471 iter->index = 0;
2473 /* Could have empty pages */
2474 while (iter->pg && !iter->pg->index)
2475 iter->pg = iter->pg->next;
2478 if (!iter->pg)
2479 return NULL;
2481 return iter;
2485 * ftrace_rec_iter_record, get the record at the iterator location
2486 * @iter: The current iterator location
2488 * Returns the record that the current @iter is at.
2490 struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2492 return &iter->pg->records[iter->index];
2495 static int
2496 ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
2498 int ret;
2500 if (unlikely(ftrace_disabled))
2501 return 0;
2503 ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
2504 if (ret) {
2505 ftrace_bug_type = FTRACE_BUG_INIT;
2506 ftrace_bug(ret, rec);
2507 return 0;
2509 return 1;
2513 * archs can override this function if they must do something
2514 * before the modifying code is performed.
2516 int __weak ftrace_arch_code_modify_prepare(void)
2518 return 0;
2522 * archs can override this function if they must do something
2523 * after the modifying code is performed.
2525 int __weak ftrace_arch_code_modify_post_process(void)
2527 return 0;
2530 void ftrace_modify_all_code(int command)
2532 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2533 int mod_flags = 0;
2534 int err = 0;
2536 if (command & FTRACE_MAY_SLEEP)
2537 mod_flags = FTRACE_MODIFY_MAY_SLEEP_FL;
2540 * If the ftrace_caller calls a ftrace_ops func directly,
2541 * we need to make sure that it only traces functions it
2542 * expects to trace. When doing the switch of functions,
2543 * we need to update to the ftrace_ops_list_func first
2544 * before the transition between old and new calls are set,
2545 * as the ftrace_ops_list_func will check the ops hashes
2546 * to make sure the ops are having the right functions
2547 * traced.
2549 if (update) {
2550 err = ftrace_update_ftrace_func(ftrace_ops_list_func);
2551 if (FTRACE_WARN_ON(err))
2552 return;
2555 if (command & FTRACE_UPDATE_CALLS)
2556 ftrace_replace_code(mod_flags | FTRACE_MODIFY_ENABLE_FL);
2557 else if (command & FTRACE_DISABLE_CALLS)
2558 ftrace_replace_code(mod_flags);
2560 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2561 function_trace_op = set_function_trace_op;
2562 smp_wmb();
2563 /* If irqs are disabled, we are in stop machine */
2564 if (!irqs_disabled())
2565 smp_call_function(ftrace_sync_ipi, NULL, 1);
2566 err = ftrace_update_ftrace_func(ftrace_trace_function);
2567 if (FTRACE_WARN_ON(err))
2568 return;
2571 if (command & FTRACE_START_FUNC_RET)
2572 err = ftrace_enable_ftrace_graph_caller();
2573 else if (command & FTRACE_STOP_FUNC_RET)
2574 err = ftrace_disable_ftrace_graph_caller();
2575 FTRACE_WARN_ON(err);
2578 static int __ftrace_modify_code(void *data)
2580 int *command = data;
2582 ftrace_modify_all_code(*command);
2584 return 0;
2588 * ftrace_run_stop_machine, go back to the stop machine method
2589 * @command: The command to tell ftrace what to do
2591 * If an arch needs to fall back to the stop machine method, the
2592 * it can call this function.
2594 void ftrace_run_stop_machine(int command)
2596 stop_machine(__ftrace_modify_code, &command, NULL);
2600 * arch_ftrace_update_code, modify the code to trace or not trace
2601 * @command: The command that needs to be done
2603 * Archs can override this function if it does not need to
2604 * run stop_machine() to modify code.
2606 void __weak arch_ftrace_update_code(int command)
2608 ftrace_run_stop_machine(command);
2611 static void ftrace_run_update_code(int command)
2613 int ret;
2615 ret = ftrace_arch_code_modify_prepare();
2616 FTRACE_WARN_ON(ret);
2617 if (ret)
2618 return;
2621 * By default we use stop_machine() to modify the code.
2622 * But archs can do what ever they want as long as it
2623 * is safe. The stop_machine() is the safest, but also
2624 * produces the most overhead.
2626 arch_ftrace_update_code(command);
2628 ret = ftrace_arch_code_modify_post_process();
2629 FTRACE_WARN_ON(ret);
2632 static void ftrace_run_modify_code(struct ftrace_ops *ops, int command,
2633 struct ftrace_ops_hash *old_hash)
2635 ops->flags |= FTRACE_OPS_FL_MODIFYING;
2636 ops->old_hash.filter_hash = old_hash->filter_hash;
2637 ops->old_hash.notrace_hash = old_hash->notrace_hash;
2638 ftrace_run_update_code(command);
2639 ops->old_hash.filter_hash = NULL;
2640 ops->old_hash.notrace_hash = NULL;
2641 ops->flags &= ~FTRACE_OPS_FL_MODIFYING;
2644 static ftrace_func_t saved_ftrace_func;
2645 static int ftrace_start_up;
2647 void __weak arch_ftrace_trampoline_free(struct ftrace_ops *ops)
2651 static void ftrace_startup_enable(int command)
2653 if (saved_ftrace_func != ftrace_trace_function) {
2654 saved_ftrace_func = ftrace_trace_function;
2655 command |= FTRACE_UPDATE_TRACE_FUNC;
2658 if (!command || !ftrace_enabled)
2659 return;
2661 ftrace_run_update_code(command);
2664 static void ftrace_startup_all(int command)
2666 update_all_ops = true;
2667 ftrace_startup_enable(command);
2668 update_all_ops = false;
2671 int ftrace_startup(struct ftrace_ops *ops, int command)
2673 int ret;
2675 if (unlikely(ftrace_disabled))
2676 return -ENODEV;
2678 ret = __register_ftrace_function(ops);
2679 if (ret)
2680 return ret;
2682 ftrace_start_up++;
2685 * Note that ftrace probes uses this to start up
2686 * and modify functions it will probe. But we still
2687 * set the ADDING flag for modification, as probes
2688 * do not have trampolines. If they add them in the
2689 * future, then the probes will need to distinguish
2690 * between adding and updating probes.
2692 ops->flags |= FTRACE_OPS_FL_ENABLED | FTRACE_OPS_FL_ADDING;
2694 ret = ftrace_hash_ipmodify_enable(ops);
2695 if (ret < 0) {
2696 /* Rollback registration process */
2697 __unregister_ftrace_function(ops);
2698 ftrace_start_up--;
2699 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2700 return ret;
2703 if (ftrace_hash_rec_enable(ops, 1))
2704 command |= FTRACE_UPDATE_CALLS;
2706 ftrace_startup_enable(command);
2708 ops->flags &= ~FTRACE_OPS_FL_ADDING;
2710 return 0;
2713 int ftrace_shutdown(struct ftrace_ops *ops, int command)
2715 int ret;
2717 if (unlikely(ftrace_disabled))
2718 return -ENODEV;
2720 ret = __unregister_ftrace_function(ops);
2721 if (ret)
2722 return ret;
2724 ftrace_start_up--;
2726 * Just warn in case of unbalance, no need to kill ftrace, it's not
2727 * critical but the ftrace_call callers may be never nopped again after
2728 * further ftrace uses.
2730 WARN_ON_ONCE(ftrace_start_up < 0);
2732 /* Disabling ipmodify never fails */
2733 ftrace_hash_ipmodify_disable(ops);
2735 if (ftrace_hash_rec_disable(ops, 1))
2736 command |= FTRACE_UPDATE_CALLS;
2738 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2740 if (saved_ftrace_func != ftrace_trace_function) {
2741 saved_ftrace_func = ftrace_trace_function;
2742 command |= FTRACE_UPDATE_TRACE_FUNC;
2745 if (!command || !ftrace_enabled) {
2747 * If these are dynamic or per_cpu ops, they still
2748 * need their data freed. Since, function tracing is
2749 * not currently active, we can just free them
2750 * without synchronizing all CPUs.
2752 if (ops->flags & FTRACE_OPS_FL_DYNAMIC)
2753 goto free_ops;
2755 return 0;
2759 * If the ops uses a trampoline, then it needs to be
2760 * tested first on update.
2762 ops->flags |= FTRACE_OPS_FL_REMOVING;
2763 removed_ops = ops;
2765 /* The trampoline logic checks the old hashes */
2766 ops->old_hash.filter_hash = ops->func_hash->filter_hash;
2767 ops->old_hash.notrace_hash = ops->func_hash->notrace_hash;
2769 ftrace_run_update_code(command);
2772 * If there's no more ops registered with ftrace, run a
2773 * sanity check to make sure all rec flags are cleared.
2775 if (rcu_dereference_protected(ftrace_ops_list,
2776 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
2777 struct ftrace_page *pg;
2778 struct dyn_ftrace *rec;
2780 do_for_each_ftrace_rec(pg, rec) {
2781 if (FTRACE_WARN_ON_ONCE(rec->flags & ~FTRACE_FL_DISABLED))
2782 pr_warn(" %pS flags:%lx\n",
2783 (void *)rec->ip, rec->flags);
2784 } while_for_each_ftrace_rec();
2787 ops->old_hash.filter_hash = NULL;
2788 ops->old_hash.notrace_hash = NULL;
2790 removed_ops = NULL;
2791 ops->flags &= ~FTRACE_OPS_FL_REMOVING;
2794 * Dynamic ops may be freed, we must make sure that all
2795 * callers are done before leaving this function.
2796 * The same goes for freeing the per_cpu data of the per_cpu
2797 * ops.
2799 if (ops->flags & FTRACE_OPS_FL_DYNAMIC) {
2801 * We need to do a hard force of sched synchronization.
2802 * This is because we use preempt_disable() to do RCU, but
2803 * the function tracers can be called where RCU is not watching
2804 * (like before user_exit()). We can not rely on the RCU
2805 * infrastructure to do the synchronization, thus we must do it
2806 * ourselves.
2808 schedule_on_each_cpu(ftrace_sync);
2811 * When the kernel is preeptive, tasks can be preempted
2812 * while on a ftrace trampoline. Just scheduling a task on
2813 * a CPU is not good enough to flush them. Calling
2814 * synchornize_rcu_tasks() will wait for those tasks to
2815 * execute and either schedule voluntarily or enter user space.
2817 if (IS_ENABLED(CONFIG_PREEMPT))
2818 synchronize_rcu_tasks();
2820 free_ops:
2821 arch_ftrace_trampoline_free(ops);
2824 return 0;
2827 static void ftrace_startup_sysctl(void)
2829 int command;
2831 if (unlikely(ftrace_disabled))
2832 return;
2834 /* Force update next time */
2835 saved_ftrace_func = NULL;
2836 /* ftrace_start_up is true if we want ftrace running */
2837 if (ftrace_start_up) {
2838 command = FTRACE_UPDATE_CALLS;
2839 if (ftrace_graph_active)
2840 command |= FTRACE_START_FUNC_RET;
2841 ftrace_startup_enable(command);
2845 static void ftrace_shutdown_sysctl(void)
2847 int command;
2849 if (unlikely(ftrace_disabled))
2850 return;
2852 /* ftrace_start_up is true if ftrace is running */
2853 if (ftrace_start_up) {
2854 command = FTRACE_DISABLE_CALLS;
2855 if (ftrace_graph_active)
2856 command |= FTRACE_STOP_FUNC_RET;
2857 ftrace_run_update_code(command);
2861 static u64 ftrace_update_time;
2862 unsigned long ftrace_update_tot_cnt;
2864 static inline int ops_traces_mod(struct ftrace_ops *ops)
2867 * Filter_hash being empty will default to trace module.
2868 * But notrace hash requires a test of individual module functions.
2870 return ftrace_hash_empty(ops->func_hash->filter_hash) &&
2871 ftrace_hash_empty(ops->func_hash->notrace_hash);
2875 * Check if the current ops references the record.
2877 * If the ops traces all functions, then it was already accounted for.
2878 * If the ops does not trace the current record function, skip it.
2879 * If the ops ignores the function via notrace filter, skip it.
2881 static inline bool
2882 ops_references_rec(struct ftrace_ops *ops, struct dyn_ftrace *rec)
2884 /* If ops isn't enabled, ignore it */
2885 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
2886 return false;
2888 /* If ops traces all then it includes this function */
2889 if (ops_traces_mod(ops))
2890 return true;
2892 /* The function must be in the filter */
2893 if (!ftrace_hash_empty(ops->func_hash->filter_hash) &&
2894 !__ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))
2895 return false;
2897 /* If in notrace hash, we ignore it too */
2898 if (ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip))
2899 return false;
2901 return true;
2904 static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
2906 struct ftrace_page *pg;
2907 struct dyn_ftrace *p;
2908 u64 start, stop;
2909 unsigned long update_cnt = 0;
2910 unsigned long rec_flags = 0;
2911 int i;
2913 start = ftrace_now(raw_smp_processor_id());
2916 * When a module is loaded, this function is called to convert
2917 * the calls to mcount in its text to nops, and also to create
2918 * an entry in the ftrace data. Now, if ftrace is activated
2919 * after this call, but before the module sets its text to
2920 * read-only, the modification of enabling ftrace can fail if
2921 * the read-only is done while ftrace is converting the calls.
2922 * To prevent this, the module's records are set as disabled
2923 * and will be enabled after the call to set the module's text
2924 * to read-only.
2926 if (mod)
2927 rec_flags |= FTRACE_FL_DISABLED;
2929 for (pg = new_pgs; pg; pg = pg->next) {
2931 for (i = 0; i < pg->index; i++) {
2933 /* If something went wrong, bail without enabling anything */
2934 if (unlikely(ftrace_disabled))
2935 return -1;
2937 p = &pg->records[i];
2938 p->flags = rec_flags;
2941 * Do the initial record conversion from mcount jump
2942 * to the NOP instructions.
2944 if (!__is_defined(CC_USING_NOP_MCOUNT) &&
2945 !ftrace_code_disable(mod, p))
2946 break;
2948 update_cnt++;
2952 stop = ftrace_now(raw_smp_processor_id());
2953 ftrace_update_time = stop - start;
2954 ftrace_update_tot_cnt += update_cnt;
2956 return 0;
2959 static int ftrace_allocate_records(struct ftrace_page *pg, int count)
2961 int order;
2962 int cnt;
2964 if (WARN_ON(!count))
2965 return -EINVAL;
2967 order = get_count_order(DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
2970 * We want to fill as much as possible. No more than a page
2971 * may be empty.
2973 while ((PAGE_SIZE << order) / ENTRY_SIZE >= count + ENTRIES_PER_PAGE)
2974 order--;
2976 again:
2977 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
2979 if (!pg->records) {
2980 /* if we can't allocate this size, try something smaller */
2981 if (!order)
2982 return -ENOMEM;
2983 order >>= 1;
2984 goto again;
2987 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
2988 pg->size = cnt;
2990 if (cnt > count)
2991 cnt = count;
2993 return cnt;
2996 static struct ftrace_page *
2997 ftrace_allocate_pages(unsigned long num_to_init)
2999 struct ftrace_page *start_pg;
3000 struct ftrace_page *pg;
3001 int order;
3002 int cnt;
3004 if (!num_to_init)
3005 return NULL;
3007 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
3008 if (!pg)
3009 return NULL;
3012 * Try to allocate as much as possible in one continues
3013 * location that fills in all of the space. We want to
3014 * waste as little space as possible.
3016 for (;;) {
3017 cnt = ftrace_allocate_records(pg, num_to_init);
3018 if (cnt < 0)
3019 goto free_pages;
3021 num_to_init -= cnt;
3022 if (!num_to_init)
3023 break;
3025 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
3026 if (!pg->next)
3027 goto free_pages;
3029 pg = pg->next;
3032 return start_pg;
3034 free_pages:
3035 pg = start_pg;
3036 while (pg) {
3037 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
3038 free_pages((unsigned long)pg->records, order);
3039 start_pg = pg->next;
3040 kfree(pg);
3041 pg = start_pg;
3043 pr_info("ftrace: FAILED to allocate memory for functions\n");
3044 return NULL;
3047 #define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
3049 struct ftrace_iterator {
3050 loff_t pos;
3051 loff_t func_pos;
3052 loff_t mod_pos;
3053 struct ftrace_page *pg;
3054 struct dyn_ftrace *func;
3055 struct ftrace_func_probe *probe;
3056 struct ftrace_func_entry *probe_entry;
3057 struct trace_parser parser;
3058 struct ftrace_hash *hash;
3059 struct ftrace_ops *ops;
3060 struct trace_array *tr;
3061 struct list_head *mod_list;
3062 int pidx;
3063 int idx;
3064 unsigned flags;
3067 static void *
3068 t_probe_next(struct seq_file *m, loff_t *pos)
3070 struct ftrace_iterator *iter = m->private;
3071 struct trace_array *tr = iter->ops->private;
3072 struct list_head *func_probes;
3073 struct ftrace_hash *hash;
3074 struct list_head *next;
3075 struct hlist_node *hnd = NULL;
3076 struct hlist_head *hhd;
3077 int size;
3079 (*pos)++;
3080 iter->pos = *pos;
3082 if (!tr)
3083 return NULL;
3085 func_probes = &tr->func_probes;
3086 if (list_empty(func_probes))
3087 return NULL;
3089 if (!iter->probe) {
3090 next = func_probes->next;
3091 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3094 if (iter->probe_entry)
3095 hnd = &iter->probe_entry->hlist;
3097 hash = iter->probe->ops.func_hash->filter_hash;
3098 size = 1 << hash->size_bits;
3100 retry:
3101 if (iter->pidx >= size) {
3102 if (iter->probe->list.next == func_probes)
3103 return NULL;
3104 next = iter->probe->list.next;
3105 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3106 hash = iter->probe->ops.func_hash->filter_hash;
3107 size = 1 << hash->size_bits;
3108 iter->pidx = 0;
3111 hhd = &hash->buckets[iter->pidx];
3113 if (hlist_empty(hhd)) {
3114 iter->pidx++;
3115 hnd = NULL;
3116 goto retry;
3119 if (!hnd)
3120 hnd = hhd->first;
3121 else {
3122 hnd = hnd->next;
3123 if (!hnd) {
3124 iter->pidx++;
3125 goto retry;
3129 if (WARN_ON_ONCE(!hnd))
3130 return NULL;
3132 iter->probe_entry = hlist_entry(hnd, struct ftrace_func_entry, hlist);
3134 return iter;
3137 static void *t_probe_start(struct seq_file *m, loff_t *pos)
3139 struct ftrace_iterator *iter = m->private;
3140 void *p = NULL;
3141 loff_t l;
3143 if (!(iter->flags & FTRACE_ITER_DO_PROBES))
3144 return NULL;
3146 if (iter->mod_pos > *pos)
3147 return NULL;
3149 iter->probe = NULL;
3150 iter->probe_entry = NULL;
3151 iter->pidx = 0;
3152 for (l = 0; l <= (*pos - iter->mod_pos); ) {
3153 p = t_probe_next(m, &l);
3154 if (!p)
3155 break;
3157 if (!p)
3158 return NULL;
3160 /* Only set this if we have an item */
3161 iter->flags |= FTRACE_ITER_PROBE;
3163 return iter;
3166 static int
3167 t_probe_show(struct seq_file *m, struct ftrace_iterator *iter)
3169 struct ftrace_func_entry *probe_entry;
3170 struct ftrace_probe_ops *probe_ops;
3171 struct ftrace_func_probe *probe;
3173 probe = iter->probe;
3174 probe_entry = iter->probe_entry;
3176 if (WARN_ON_ONCE(!probe || !probe_entry))
3177 return -EIO;
3179 probe_ops = probe->probe_ops;
3181 if (probe_ops->print)
3182 return probe_ops->print(m, probe_entry->ip, probe_ops, probe->data);
3184 seq_printf(m, "%ps:%ps\n", (void *)probe_entry->ip,
3185 (void *)probe_ops->func);
3187 return 0;
3190 static void *
3191 t_mod_next(struct seq_file *m, loff_t *pos)
3193 struct ftrace_iterator *iter = m->private;
3194 struct trace_array *tr = iter->tr;
3196 (*pos)++;
3197 iter->pos = *pos;
3199 iter->mod_list = iter->mod_list->next;
3201 if (iter->mod_list == &tr->mod_trace ||
3202 iter->mod_list == &tr->mod_notrace) {
3203 iter->flags &= ~FTRACE_ITER_MOD;
3204 return NULL;
3207 iter->mod_pos = *pos;
3209 return iter;
3212 static void *t_mod_start(struct seq_file *m, loff_t *pos)
3214 struct ftrace_iterator *iter = m->private;
3215 void *p = NULL;
3216 loff_t l;
3218 if (iter->func_pos > *pos)
3219 return NULL;
3221 iter->mod_pos = iter->func_pos;
3223 /* probes are only available if tr is set */
3224 if (!iter->tr)
3225 return NULL;
3227 for (l = 0; l <= (*pos - iter->func_pos); ) {
3228 p = t_mod_next(m, &l);
3229 if (!p)
3230 break;
3232 if (!p) {
3233 iter->flags &= ~FTRACE_ITER_MOD;
3234 return t_probe_start(m, pos);
3237 /* Only set this if we have an item */
3238 iter->flags |= FTRACE_ITER_MOD;
3240 return iter;
3243 static int
3244 t_mod_show(struct seq_file *m, struct ftrace_iterator *iter)
3246 struct ftrace_mod_load *ftrace_mod;
3247 struct trace_array *tr = iter->tr;
3249 if (WARN_ON_ONCE(!iter->mod_list) ||
3250 iter->mod_list == &tr->mod_trace ||
3251 iter->mod_list == &tr->mod_notrace)
3252 return -EIO;
3254 ftrace_mod = list_entry(iter->mod_list, struct ftrace_mod_load, list);
3256 if (ftrace_mod->func)
3257 seq_printf(m, "%s", ftrace_mod->func);
3258 else
3259 seq_putc(m, '*');
3261 seq_printf(m, ":mod:%s\n", ftrace_mod->module);
3263 return 0;
3266 static void *
3267 t_func_next(struct seq_file *m, loff_t *pos)
3269 struct ftrace_iterator *iter = m->private;
3270 struct dyn_ftrace *rec = NULL;
3272 (*pos)++;
3274 retry:
3275 if (iter->idx >= iter->pg->index) {
3276 if (iter->pg->next) {
3277 iter->pg = iter->pg->next;
3278 iter->idx = 0;
3279 goto retry;
3281 } else {
3282 rec = &iter->pg->records[iter->idx++];
3283 if (((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3284 !ftrace_lookup_ip(iter->hash, rec->ip)) ||
3286 ((iter->flags & FTRACE_ITER_ENABLED) &&
3287 !(rec->flags & FTRACE_FL_ENABLED))) {
3289 rec = NULL;
3290 goto retry;
3294 if (!rec)
3295 return NULL;
3297 iter->pos = iter->func_pos = *pos;
3298 iter->func = rec;
3300 return iter;
3303 static void *
3304 t_next(struct seq_file *m, void *v, loff_t *pos)
3306 struct ftrace_iterator *iter = m->private;
3307 loff_t l = *pos; /* t_probe_start() must use original pos */
3308 void *ret;
3310 if (unlikely(ftrace_disabled))
3311 return NULL;
3313 if (iter->flags & FTRACE_ITER_PROBE)
3314 return t_probe_next(m, pos);
3316 if (iter->flags & FTRACE_ITER_MOD)
3317 return t_mod_next(m, pos);
3319 if (iter->flags & FTRACE_ITER_PRINTALL) {
3320 /* next must increment pos, and t_probe_start does not */
3321 (*pos)++;
3322 return t_mod_start(m, &l);
3325 ret = t_func_next(m, pos);
3327 if (!ret)
3328 return t_mod_start(m, &l);
3330 return ret;
3333 static void reset_iter_read(struct ftrace_iterator *iter)
3335 iter->pos = 0;
3336 iter->func_pos = 0;
3337 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_PROBE | FTRACE_ITER_MOD);
3340 static void *t_start(struct seq_file *m, loff_t *pos)
3342 struct ftrace_iterator *iter = m->private;
3343 void *p = NULL;
3344 loff_t l;
3346 mutex_lock(&ftrace_lock);
3348 if (unlikely(ftrace_disabled))
3349 return NULL;
3352 * If an lseek was done, then reset and start from beginning.
3354 if (*pos < iter->pos)
3355 reset_iter_read(iter);
3358 * For set_ftrace_filter reading, if we have the filter
3359 * off, we can short cut and just print out that all
3360 * functions are enabled.
3362 if ((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3363 ftrace_hash_empty(iter->hash)) {
3364 iter->func_pos = 1; /* Account for the message */
3365 if (*pos > 0)
3366 return t_mod_start(m, pos);
3367 iter->flags |= FTRACE_ITER_PRINTALL;
3368 /* reset in case of seek/pread */
3369 iter->flags &= ~FTRACE_ITER_PROBE;
3370 return iter;
3373 if (iter->flags & FTRACE_ITER_MOD)
3374 return t_mod_start(m, pos);
3377 * Unfortunately, we need to restart at ftrace_pages_start
3378 * every time we let go of the ftrace_mutex. This is because
3379 * those pointers can change without the lock.
3381 iter->pg = ftrace_pages_start;
3382 iter->idx = 0;
3383 for (l = 0; l <= *pos; ) {
3384 p = t_func_next(m, &l);
3385 if (!p)
3386 break;
3389 if (!p)
3390 return t_mod_start(m, pos);
3392 return iter;
3395 static void t_stop(struct seq_file *m, void *p)
3397 mutex_unlock(&ftrace_lock);
3400 void * __weak
3401 arch_ftrace_trampoline_func(struct ftrace_ops *ops, struct dyn_ftrace *rec)
3403 return NULL;
3406 static void add_trampoline_func(struct seq_file *m, struct ftrace_ops *ops,
3407 struct dyn_ftrace *rec)
3409 void *ptr;
3411 ptr = arch_ftrace_trampoline_func(ops, rec);
3412 if (ptr)
3413 seq_printf(m, " ->%pS", ptr);
3416 static int t_show(struct seq_file *m, void *v)
3418 struct ftrace_iterator *iter = m->private;
3419 struct dyn_ftrace *rec;
3421 if (iter->flags & FTRACE_ITER_PROBE)
3422 return t_probe_show(m, iter);
3424 if (iter->flags & FTRACE_ITER_MOD)
3425 return t_mod_show(m, iter);
3427 if (iter->flags & FTRACE_ITER_PRINTALL) {
3428 if (iter->flags & FTRACE_ITER_NOTRACE)
3429 seq_puts(m, "#### no functions disabled ####\n");
3430 else
3431 seq_puts(m, "#### all functions enabled ####\n");
3432 return 0;
3435 rec = iter->func;
3437 if (!rec)
3438 return 0;
3440 seq_printf(m, "%ps", (void *)rec->ip);
3441 if (iter->flags & FTRACE_ITER_ENABLED) {
3442 struct ftrace_ops *ops;
3444 seq_printf(m, " (%ld)%s%s",
3445 ftrace_rec_count(rec),
3446 rec->flags & FTRACE_FL_REGS ? " R" : " ",
3447 rec->flags & FTRACE_FL_IPMODIFY ? " I" : " ");
3448 if (rec->flags & FTRACE_FL_TRAMP_EN) {
3449 ops = ftrace_find_tramp_ops_any(rec);
3450 if (ops) {
3451 do {
3452 seq_printf(m, "\ttramp: %pS (%pS)",
3453 (void *)ops->trampoline,
3454 (void *)ops->func);
3455 add_trampoline_func(m, ops, rec);
3456 ops = ftrace_find_tramp_ops_next(rec, ops);
3457 } while (ops);
3458 } else
3459 seq_puts(m, "\ttramp: ERROR!");
3460 } else {
3461 add_trampoline_func(m, NULL, rec);
3465 seq_putc(m, '\n');
3467 return 0;
3470 static const struct seq_operations show_ftrace_seq_ops = {
3471 .start = t_start,
3472 .next = t_next,
3473 .stop = t_stop,
3474 .show = t_show,
3477 static int
3478 ftrace_avail_open(struct inode *inode, struct file *file)
3480 struct ftrace_iterator *iter;
3482 if (unlikely(ftrace_disabled))
3483 return -ENODEV;
3485 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3486 if (!iter)
3487 return -ENOMEM;
3489 iter->pg = ftrace_pages_start;
3490 iter->ops = &global_ops;
3492 return 0;
3495 static int
3496 ftrace_enabled_open(struct inode *inode, struct file *file)
3498 struct ftrace_iterator *iter;
3500 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3501 if (!iter)
3502 return -ENOMEM;
3504 iter->pg = ftrace_pages_start;
3505 iter->flags = FTRACE_ITER_ENABLED;
3506 iter->ops = &global_ops;
3508 return 0;
3512 * ftrace_regex_open - initialize function tracer filter files
3513 * @ops: The ftrace_ops that hold the hash filters
3514 * @flag: The type of filter to process
3515 * @inode: The inode, usually passed in to your open routine
3516 * @file: The file, usually passed in to your open routine
3518 * ftrace_regex_open() initializes the filter files for the
3519 * @ops. Depending on @flag it may process the filter hash or
3520 * the notrace hash of @ops. With this called from the open
3521 * routine, you can use ftrace_filter_write() for the write
3522 * routine if @flag has FTRACE_ITER_FILTER set, or
3523 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
3524 * tracing_lseek() should be used as the lseek routine, and
3525 * release must call ftrace_regex_release().
3528 ftrace_regex_open(struct ftrace_ops *ops, int flag,
3529 struct inode *inode, struct file *file)
3531 struct ftrace_iterator *iter;
3532 struct ftrace_hash *hash;
3533 struct list_head *mod_head;
3534 struct trace_array *tr = ops->private;
3535 int ret = 0;
3537 ftrace_ops_init(ops);
3539 if (unlikely(ftrace_disabled))
3540 return -ENODEV;
3542 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
3543 if (!iter)
3544 return -ENOMEM;
3546 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
3547 kfree(iter);
3548 return -ENOMEM;
3551 iter->ops = ops;
3552 iter->flags = flag;
3553 iter->tr = tr;
3555 mutex_lock(&ops->func_hash->regex_lock);
3557 if (flag & FTRACE_ITER_NOTRACE) {
3558 hash = ops->func_hash->notrace_hash;
3559 mod_head = tr ? &tr->mod_notrace : NULL;
3560 } else {
3561 hash = ops->func_hash->filter_hash;
3562 mod_head = tr ? &tr->mod_trace : NULL;
3565 iter->mod_list = mod_head;
3567 if (file->f_mode & FMODE_WRITE) {
3568 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3570 if (file->f_flags & O_TRUNC) {
3571 iter->hash = alloc_ftrace_hash(size_bits);
3572 clear_ftrace_mod_list(mod_head);
3573 } else {
3574 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3577 if (!iter->hash) {
3578 trace_parser_put(&iter->parser);
3579 kfree(iter);
3580 ret = -ENOMEM;
3581 goto out_unlock;
3583 } else
3584 iter->hash = hash;
3586 if (file->f_mode & FMODE_READ) {
3587 iter->pg = ftrace_pages_start;
3589 ret = seq_open(file, &show_ftrace_seq_ops);
3590 if (!ret) {
3591 struct seq_file *m = file->private_data;
3592 m->private = iter;
3593 } else {
3594 /* Failed */
3595 free_ftrace_hash(iter->hash);
3596 trace_parser_put(&iter->parser);
3597 kfree(iter);
3599 } else
3600 file->private_data = iter;
3602 out_unlock:
3603 mutex_unlock(&ops->func_hash->regex_lock);
3605 return ret;
3608 static int
3609 ftrace_filter_open(struct inode *inode, struct file *file)
3611 struct ftrace_ops *ops = inode->i_private;
3613 return ftrace_regex_open(ops,
3614 FTRACE_ITER_FILTER | FTRACE_ITER_DO_PROBES,
3615 inode, file);
3618 static int
3619 ftrace_notrace_open(struct inode *inode, struct file *file)
3621 struct ftrace_ops *ops = inode->i_private;
3623 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3624 inode, file);
3627 /* Type for quick search ftrace basic regexes (globs) from filter_parse_regex */
3628 struct ftrace_glob {
3629 char *search;
3630 unsigned len;
3631 int type;
3635 * If symbols in an architecture don't correspond exactly to the user-visible
3636 * name of what they represent, it is possible to define this function to
3637 * perform the necessary adjustments.
3639 char * __weak arch_ftrace_match_adjust(char *str, const char *search)
3641 return str;
3644 static int ftrace_match(char *str, struct ftrace_glob *g)
3646 int matched = 0;
3647 int slen;
3649 str = arch_ftrace_match_adjust(str, g->search);
3651 switch (g->type) {
3652 case MATCH_FULL:
3653 if (strcmp(str, g->search) == 0)
3654 matched = 1;
3655 break;
3656 case MATCH_FRONT_ONLY:
3657 if (strncmp(str, g->search, g->len) == 0)
3658 matched = 1;
3659 break;
3660 case MATCH_MIDDLE_ONLY:
3661 if (strstr(str, g->search))
3662 matched = 1;
3663 break;
3664 case MATCH_END_ONLY:
3665 slen = strlen(str);
3666 if (slen >= g->len &&
3667 memcmp(str + slen - g->len, g->search, g->len) == 0)
3668 matched = 1;
3669 break;
3670 case MATCH_GLOB:
3671 if (glob_match(g->search, str))
3672 matched = 1;
3673 break;
3676 return matched;
3679 static int
3680 enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter)
3682 struct ftrace_func_entry *entry;
3683 int ret = 0;
3685 entry = ftrace_lookup_ip(hash, rec->ip);
3686 if (clear_filter) {
3687 /* Do nothing if it doesn't exist */
3688 if (!entry)
3689 return 0;
3691 free_hash_entry(hash, entry);
3692 } else {
3693 /* Do nothing if it exists */
3694 if (entry)
3695 return 0;
3697 ret = add_hash_entry(hash, rec->ip);
3699 return ret;
3702 static int
3703 add_rec_by_index(struct ftrace_hash *hash, struct ftrace_glob *func_g,
3704 int clear_filter)
3706 long index = simple_strtoul(func_g->search, NULL, 0);
3707 struct ftrace_page *pg;
3708 struct dyn_ftrace *rec;
3710 /* The index starts at 1 */
3711 if (--index < 0)
3712 return 0;
3714 do_for_each_ftrace_rec(pg, rec) {
3715 if (pg->index <= index) {
3716 index -= pg->index;
3717 /* this is a double loop, break goes to the next page */
3718 break;
3720 rec = &pg->records[index];
3721 enter_record(hash, rec, clear_filter);
3722 return 1;
3723 } while_for_each_ftrace_rec();
3724 return 0;
3727 static int
3728 ftrace_match_record(struct dyn_ftrace *rec, struct ftrace_glob *func_g,
3729 struct ftrace_glob *mod_g, int exclude_mod)
3731 char str[KSYM_SYMBOL_LEN];
3732 char *modname;
3734 kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);
3736 if (mod_g) {
3737 int mod_matches = (modname) ? ftrace_match(modname, mod_g) : 0;
3739 /* blank module name to match all modules */
3740 if (!mod_g->len) {
3741 /* blank module globbing: modname xor exclude_mod */
3742 if (!exclude_mod != !modname)
3743 goto func_match;
3744 return 0;
3748 * exclude_mod is set to trace everything but the given
3749 * module. If it is set and the module matches, then
3750 * return 0. If it is not set, and the module doesn't match
3751 * also return 0. Otherwise, check the function to see if
3752 * that matches.
3754 if (!mod_matches == !exclude_mod)
3755 return 0;
3756 func_match:
3757 /* blank search means to match all funcs in the mod */
3758 if (!func_g->len)
3759 return 1;
3762 return ftrace_match(str, func_g);
3765 static int
3766 match_records(struct ftrace_hash *hash, char *func, int len, char *mod)
3768 struct ftrace_page *pg;
3769 struct dyn_ftrace *rec;
3770 struct ftrace_glob func_g = { .type = MATCH_FULL };
3771 struct ftrace_glob mod_g = { .type = MATCH_FULL };
3772 struct ftrace_glob *mod_match = (mod) ? &mod_g : NULL;
3773 int exclude_mod = 0;
3774 int found = 0;
3775 int ret;
3776 int clear_filter = 0;
3778 if (func) {
3779 func_g.type = filter_parse_regex(func, len, &func_g.search,
3780 &clear_filter);
3781 func_g.len = strlen(func_g.search);
3784 if (mod) {
3785 mod_g.type = filter_parse_regex(mod, strlen(mod),
3786 &mod_g.search, &exclude_mod);
3787 mod_g.len = strlen(mod_g.search);
3790 mutex_lock(&ftrace_lock);
3792 if (unlikely(ftrace_disabled))
3793 goto out_unlock;
3795 if (func_g.type == MATCH_INDEX) {
3796 found = add_rec_by_index(hash, &func_g, clear_filter);
3797 goto out_unlock;
3800 do_for_each_ftrace_rec(pg, rec) {
3802 if (rec->flags & FTRACE_FL_DISABLED)
3803 continue;
3805 if (ftrace_match_record(rec, &func_g, mod_match, exclude_mod)) {
3806 ret = enter_record(hash, rec, clear_filter);
3807 if (ret < 0) {
3808 found = ret;
3809 goto out_unlock;
3811 found = 1;
3813 } while_for_each_ftrace_rec();
3814 out_unlock:
3815 mutex_unlock(&ftrace_lock);
3817 return found;
3820 static int
3821 ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
3823 return match_records(hash, buff, len, NULL);
3826 static void ftrace_ops_update_code(struct ftrace_ops *ops,
3827 struct ftrace_ops_hash *old_hash)
3829 struct ftrace_ops *op;
3831 if (!ftrace_enabled)
3832 return;
3834 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
3835 ftrace_run_modify_code(ops, FTRACE_UPDATE_CALLS, old_hash);
3836 return;
3840 * If this is the shared global_ops filter, then we need to
3841 * check if there is another ops that shares it, is enabled.
3842 * If so, we still need to run the modify code.
3844 if (ops->func_hash != &global_ops.local_hash)
3845 return;
3847 do_for_each_ftrace_op(op, ftrace_ops_list) {
3848 if (op->func_hash == &global_ops.local_hash &&
3849 op->flags & FTRACE_OPS_FL_ENABLED) {
3850 ftrace_run_modify_code(op, FTRACE_UPDATE_CALLS, old_hash);
3851 /* Only need to do this once */
3852 return;
3854 } while_for_each_ftrace_op(op);
3857 static int ftrace_hash_move_and_update_ops(struct ftrace_ops *ops,
3858 struct ftrace_hash **orig_hash,
3859 struct ftrace_hash *hash,
3860 int enable)
3862 struct ftrace_ops_hash old_hash_ops;
3863 struct ftrace_hash *old_hash;
3864 int ret;
3866 old_hash = *orig_hash;
3867 old_hash_ops.filter_hash = ops->func_hash->filter_hash;
3868 old_hash_ops.notrace_hash = ops->func_hash->notrace_hash;
3869 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
3870 if (!ret) {
3871 ftrace_ops_update_code(ops, &old_hash_ops);
3872 free_ftrace_hash_rcu(old_hash);
3874 return ret;
3877 static bool module_exists(const char *module)
3879 /* All modules have the symbol __this_module */
3880 static const char this_mod[] = "__this_module";
3881 char modname[MAX_PARAM_PREFIX_LEN + sizeof(this_mod) + 2];
3882 unsigned long val;
3883 int n;
3885 n = snprintf(modname, sizeof(modname), "%s:%s", module, this_mod);
3887 if (n > sizeof(modname) - 1)
3888 return false;
3890 val = module_kallsyms_lookup_name(modname);
3891 return val != 0;
3894 static int cache_mod(struct trace_array *tr,
3895 const char *func, char *module, int enable)
3897 struct ftrace_mod_load *ftrace_mod, *n;
3898 struct list_head *head = enable ? &tr->mod_trace : &tr->mod_notrace;
3899 int ret;
3901 mutex_lock(&ftrace_lock);
3903 /* We do not cache inverse filters */
3904 if (func[0] == '!') {
3905 func++;
3906 ret = -EINVAL;
3908 /* Look to remove this hash */
3909 list_for_each_entry_safe(ftrace_mod, n, head, list) {
3910 if (strcmp(ftrace_mod->module, module) != 0)
3911 continue;
3913 /* no func matches all */
3914 if (strcmp(func, "*") == 0 ||
3915 (ftrace_mod->func &&
3916 strcmp(ftrace_mod->func, func) == 0)) {
3917 ret = 0;
3918 free_ftrace_mod(ftrace_mod);
3919 continue;
3922 goto out;
3925 ret = -EINVAL;
3926 /* We only care about modules that have not been loaded yet */
3927 if (module_exists(module))
3928 goto out;
3930 /* Save this string off, and execute it when the module is loaded */
3931 ret = ftrace_add_mod(tr, func, module, enable);
3932 out:
3933 mutex_unlock(&ftrace_lock);
3935 return ret;
3938 static int
3939 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
3940 int reset, int enable);
3942 #ifdef CONFIG_MODULES
3943 static void process_mod_list(struct list_head *head, struct ftrace_ops *ops,
3944 char *mod, bool enable)
3946 struct ftrace_mod_load *ftrace_mod, *n;
3947 struct ftrace_hash **orig_hash, *new_hash;
3948 LIST_HEAD(process_mods);
3949 char *func;
3950 int ret;
3952 mutex_lock(&ops->func_hash->regex_lock);
3954 if (enable)
3955 orig_hash = &ops->func_hash->filter_hash;
3956 else
3957 orig_hash = &ops->func_hash->notrace_hash;
3959 new_hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS,
3960 *orig_hash);
3961 if (!new_hash)
3962 goto out; /* warn? */
3964 mutex_lock(&ftrace_lock);
3966 list_for_each_entry_safe(ftrace_mod, n, head, list) {
3968 if (strcmp(ftrace_mod->module, mod) != 0)
3969 continue;
3971 if (ftrace_mod->func)
3972 func = kstrdup(ftrace_mod->func, GFP_KERNEL);
3973 else
3974 func = kstrdup("*", GFP_KERNEL);
3976 if (!func) /* warn? */
3977 continue;
3979 list_del(&ftrace_mod->list);
3980 list_add(&ftrace_mod->list, &process_mods);
3982 /* Use the newly allocated func, as it may be "*" */
3983 kfree(ftrace_mod->func);
3984 ftrace_mod->func = func;
3987 mutex_unlock(&ftrace_lock);
3989 list_for_each_entry_safe(ftrace_mod, n, &process_mods, list) {
3991 func = ftrace_mod->func;
3993 /* Grabs ftrace_lock, which is why we have this extra step */
3994 match_records(new_hash, func, strlen(func), mod);
3995 free_ftrace_mod(ftrace_mod);
3998 if (enable && list_empty(head))
3999 new_hash->flags &= ~FTRACE_HASH_FL_MOD;
4001 mutex_lock(&ftrace_lock);
4003 ret = ftrace_hash_move_and_update_ops(ops, orig_hash,
4004 new_hash, enable);
4005 mutex_unlock(&ftrace_lock);
4007 out:
4008 mutex_unlock(&ops->func_hash->regex_lock);
4010 free_ftrace_hash(new_hash);
4013 static void process_cached_mods(const char *mod_name)
4015 struct trace_array *tr;
4016 char *mod;
4018 mod = kstrdup(mod_name, GFP_KERNEL);
4019 if (!mod)
4020 return;
4022 mutex_lock(&trace_types_lock);
4023 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
4024 if (!list_empty(&tr->mod_trace))
4025 process_mod_list(&tr->mod_trace, tr->ops, mod, true);
4026 if (!list_empty(&tr->mod_notrace))
4027 process_mod_list(&tr->mod_notrace, tr->ops, mod, false);
4029 mutex_unlock(&trace_types_lock);
4031 kfree(mod);
4033 #endif
4036 * We register the module command as a template to show others how
4037 * to register the a command as well.
4040 static int
4041 ftrace_mod_callback(struct trace_array *tr, struct ftrace_hash *hash,
4042 char *func_orig, char *cmd, char *module, int enable)
4044 char *func;
4045 int ret;
4047 /* match_records() modifies func, and we need the original */
4048 func = kstrdup(func_orig, GFP_KERNEL);
4049 if (!func)
4050 return -ENOMEM;
4053 * cmd == 'mod' because we only registered this func
4054 * for the 'mod' ftrace_func_command.
4055 * But if you register one func with multiple commands,
4056 * you can tell which command was used by the cmd
4057 * parameter.
4059 ret = match_records(hash, func, strlen(func), module);
4060 kfree(func);
4062 if (!ret)
4063 return cache_mod(tr, func_orig, module, enable);
4064 if (ret < 0)
4065 return ret;
4066 return 0;
4069 static struct ftrace_func_command ftrace_mod_cmd = {
4070 .name = "mod",
4071 .func = ftrace_mod_callback,
4074 static int __init ftrace_mod_cmd_init(void)
4076 return register_ftrace_command(&ftrace_mod_cmd);
4078 core_initcall(ftrace_mod_cmd_init);
4080 static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
4081 struct ftrace_ops *op, struct pt_regs *pt_regs)
4083 struct ftrace_probe_ops *probe_ops;
4084 struct ftrace_func_probe *probe;
4086 probe = container_of(op, struct ftrace_func_probe, ops);
4087 probe_ops = probe->probe_ops;
4090 * Disable preemption for these calls to prevent a RCU grace
4091 * period. This syncs the hash iteration and freeing of items
4092 * on the hash. rcu_read_lock is too dangerous here.
4094 preempt_disable_notrace();
4095 probe_ops->func(ip, parent_ip, probe->tr, probe_ops, probe->data);
4096 preempt_enable_notrace();
4099 struct ftrace_func_map {
4100 struct ftrace_func_entry entry;
4101 void *data;
4104 struct ftrace_func_mapper {
4105 struct ftrace_hash hash;
4109 * allocate_ftrace_func_mapper - allocate a new ftrace_func_mapper
4111 * Returns a ftrace_func_mapper descriptor that can be used to map ips to data.
4113 struct ftrace_func_mapper *allocate_ftrace_func_mapper(void)
4115 struct ftrace_hash *hash;
4118 * The mapper is simply a ftrace_hash, but since the entries
4119 * in the hash are not ftrace_func_entry type, we define it
4120 * as a separate structure.
4122 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4123 return (struct ftrace_func_mapper *)hash;
4127 * ftrace_func_mapper_find_ip - Find some data mapped to an ip
4128 * @mapper: The mapper that has the ip maps
4129 * @ip: the instruction pointer to find the data for
4131 * Returns the data mapped to @ip if found otherwise NULL. The return
4132 * is actually the address of the mapper data pointer. The address is
4133 * returned for use cases where the data is no bigger than a long, and
4134 * the user can use the data pointer as its data instead of having to
4135 * allocate more memory for the reference.
4137 void **ftrace_func_mapper_find_ip(struct ftrace_func_mapper *mapper,
4138 unsigned long ip)
4140 struct ftrace_func_entry *entry;
4141 struct ftrace_func_map *map;
4143 entry = ftrace_lookup_ip(&mapper->hash, ip);
4144 if (!entry)
4145 return NULL;
4147 map = (struct ftrace_func_map *)entry;
4148 return &map->data;
4152 * ftrace_func_mapper_add_ip - Map some data to an ip
4153 * @mapper: The mapper that has the ip maps
4154 * @ip: The instruction pointer address to map @data to
4155 * @data: The data to map to @ip
4157 * Returns 0 on succes otherwise an error.
4159 int ftrace_func_mapper_add_ip(struct ftrace_func_mapper *mapper,
4160 unsigned long ip, void *data)
4162 struct ftrace_func_entry *entry;
4163 struct ftrace_func_map *map;
4165 entry = ftrace_lookup_ip(&mapper->hash, ip);
4166 if (entry)
4167 return -EBUSY;
4169 map = kmalloc(sizeof(*map), GFP_KERNEL);
4170 if (!map)
4171 return -ENOMEM;
4173 map->entry.ip = ip;
4174 map->data = data;
4176 __add_hash_entry(&mapper->hash, &map->entry);
4178 return 0;
4182 * ftrace_func_mapper_remove_ip - Remove an ip from the mapping
4183 * @mapper: The mapper that has the ip maps
4184 * @ip: The instruction pointer address to remove the data from
4186 * Returns the data if it is found, otherwise NULL.
4187 * Note, if the data pointer is used as the data itself, (see
4188 * ftrace_func_mapper_find_ip(), then the return value may be meaningless,
4189 * if the data pointer was set to zero.
4191 void *ftrace_func_mapper_remove_ip(struct ftrace_func_mapper *mapper,
4192 unsigned long ip)
4194 struct ftrace_func_entry *entry;
4195 struct ftrace_func_map *map;
4196 void *data;
4198 entry = ftrace_lookup_ip(&mapper->hash, ip);
4199 if (!entry)
4200 return NULL;
4202 map = (struct ftrace_func_map *)entry;
4203 data = map->data;
4205 remove_hash_entry(&mapper->hash, entry);
4206 kfree(entry);
4208 return data;
4212 * free_ftrace_func_mapper - free a mapping of ips and data
4213 * @mapper: The mapper that has the ip maps
4214 * @free_func: A function to be called on each data item.
4216 * This is used to free the function mapper. The @free_func is optional
4217 * and can be used if the data needs to be freed as well.
4219 void free_ftrace_func_mapper(struct ftrace_func_mapper *mapper,
4220 ftrace_mapper_func free_func)
4222 struct ftrace_func_entry *entry;
4223 struct ftrace_func_map *map;
4224 struct hlist_head *hhd;
4225 int size, i;
4227 if (!mapper)
4228 return;
4230 if (free_func && mapper->hash.count) {
4231 size = 1 << mapper->hash.size_bits;
4232 for (i = 0; i < size; i++) {
4233 hhd = &mapper->hash.buckets[i];
4234 hlist_for_each_entry(entry, hhd, hlist) {
4235 map = (struct ftrace_func_map *)entry;
4236 free_func(map);
4240 free_ftrace_hash(&mapper->hash);
4243 static void release_probe(struct ftrace_func_probe *probe)
4245 struct ftrace_probe_ops *probe_ops;
4247 mutex_lock(&ftrace_lock);
4249 WARN_ON(probe->ref <= 0);
4251 /* Subtract the ref that was used to protect this instance */
4252 probe->ref--;
4254 if (!probe->ref) {
4255 probe_ops = probe->probe_ops;
4257 * Sending zero as ip tells probe_ops to free
4258 * the probe->data itself
4260 if (probe_ops->free)
4261 probe_ops->free(probe_ops, probe->tr, 0, probe->data);
4262 list_del(&probe->list);
4263 kfree(probe);
4265 mutex_unlock(&ftrace_lock);
4268 static void acquire_probe_locked(struct ftrace_func_probe *probe)
4271 * Add one ref to keep it from being freed when releasing the
4272 * ftrace_lock mutex.
4274 probe->ref++;
4278 register_ftrace_function_probe(char *glob, struct trace_array *tr,
4279 struct ftrace_probe_ops *probe_ops,
4280 void *data)
4282 struct ftrace_func_entry *entry;
4283 struct ftrace_func_probe *probe;
4284 struct ftrace_hash **orig_hash;
4285 struct ftrace_hash *old_hash;
4286 struct ftrace_hash *hash;
4287 int count = 0;
4288 int size;
4289 int ret;
4290 int i;
4292 if (WARN_ON(!tr))
4293 return -EINVAL;
4295 /* We do not support '!' for function probes */
4296 if (WARN_ON(glob[0] == '!'))
4297 return -EINVAL;
4300 mutex_lock(&ftrace_lock);
4301 /* Check if the probe_ops is already registered */
4302 list_for_each_entry(probe, &tr->func_probes, list) {
4303 if (probe->probe_ops == probe_ops)
4304 break;
4306 if (&probe->list == &tr->func_probes) {
4307 probe = kzalloc(sizeof(*probe), GFP_KERNEL);
4308 if (!probe) {
4309 mutex_unlock(&ftrace_lock);
4310 return -ENOMEM;
4312 probe->probe_ops = probe_ops;
4313 probe->ops.func = function_trace_probe_call;
4314 probe->tr = tr;
4315 ftrace_ops_init(&probe->ops);
4316 list_add(&probe->list, &tr->func_probes);
4319 acquire_probe_locked(probe);
4321 mutex_unlock(&ftrace_lock);
4323 mutex_lock(&probe->ops.func_hash->regex_lock);
4325 orig_hash = &probe->ops.func_hash->filter_hash;
4326 old_hash = *orig_hash;
4327 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4329 ret = ftrace_match_records(hash, glob, strlen(glob));
4331 /* Nothing found? */
4332 if (!ret)
4333 ret = -EINVAL;
4335 if (ret < 0)
4336 goto out;
4338 size = 1 << hash->size_bits;
4339 for (i = 0; i < size; i++) {
4340 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4341 if (ftrace_lookup_ip(old_hash, entry->ip))
4342 continue;
4344 * The caller might want to do something special
4345 * for each function we find. We call the callback
4346 * to give the caller an opportunity to do so.
4348 if (probe_ops->init) {
4349 ret = probe_ops->init(probe_ops, tr,
4350 entry->ip, data,
4351 &probe->data);
4352 if (ret < 0) {
4353 if (probe_ops->free && count)
4354 probe_ops->free(probe_ops, tr,
4355 0, probe->data);
4356 probe->data = NULL;
4357 goto out;
4360 count++;
4364 mutex_lock(&ftrace_lock);
4366 if (!count) {
4367 /* Nothing was added? */
4368 ret = -EINVAL;
4369 goto out_unlock;
4372 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4373 hash, 1);
4374 if (ret < 0)
4375 goto err_unlock;
4377 /* One ref for each new function traced */
4378 probe->ref += count;
4380 if (!(probe->ops.flags & FTRACE_OPS_FL_ENABLED))
4381 ret = ftrace_startup(&probe->ops, 0);
4383 out_unlock:
4384 mutex_unlock(&ftrace_lock);
4386 if (!ret)
4387 ret = count;
4388 out:
4389 mutex_unlock(&probe->ops.func_hash->regex_lock);
4390 free_ftrace_hash(hash);
4392 release_probe(probe);
4394 return ret;
4396 err_unlock:
4397 if (!probe_ops->free || !count)
4398 goto out_unlock;
4400 /* Failed to do the move, need to call the free functions */
4401 for (i = 0; i < size; i++) {
4402 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4403 if (ftrace_lookup_ip(old_hash, entry->ip))
4404 continue;
4405 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4408 goto out_unlock;
4412 unregister_ftrace_function_probe_func(char *glob, struct trace_array *tr,
4413 struct ftrace_probe_ops *probe_ops)
4415 struct ftrace_ops_hash old_hash_ops;
4416 struct ftrace_func_entry *entry;
4417 struct ftrace_func_probe *probe;
4418 struct ftrace_glob func_g;
4419 struct ftrace_hash **orig_hash;
4420 struct ftrace_hash *old_hash;
4421 struct ftrace_hash *hash = NULL;
4422 struct hlist_node *tmp;
4423 struct hlist_head hhd;
4424 char str[KSYM_SYMBOL_LEN];
4425 int count = 0;
4426 int i, ret = -ENODEV;
4427 int size;
4429 if (!glob || !strlen(glob) || !strcmp(glob, "*"))
4430 func_g.search = NULL;
4431 else {
4432 int not;
4434 func_g.type = filter_parse_regex(glob, strlen(glob),
4435 &func_g.search, &not);
4436 func_g.len = strlen(func_g.search);
4438 /* we do not support '!' for function probes */
4439 if (WARN_ON(not))
4440 return -EINVAL;
4443 mutex_lock(&ftrace_lock);
4444 /* Check if the probe_ops is already registered */
4445 list_for_each_entry(probe, &tr->func_probes, list) {
4446 if (probe->probe_ops == probe_ops)
4447 break;
4449 if (&probe->list == &tr->func_probes)
4450 goto err_unlock_ftrace;
4452 ret = -EINVAL;
4453 if (!(probe->ops.flags & FTRACE_OPS_FL_INITIALIZED))
4454 goto err_unlock_ftrace;
4456 acquire_probe_locked(probe);
4458 mutex_unlock(&ftrace_lock);
4460 mutex_lock(&probe->ops.func_hash->regex_lock);
4462 orig_hash = &probe->ops.func_hash->filter_hash;
4463 old_hash = *orig_hash;
4465 if (ftrace_hash_empty(old_hash))
4466 goto out_unlock;
4468 old_hash_ops.filter_hash = old_hash;
4469 /* Probes only have filters */
4470 old_hash_ops.notrace_hash = NULL;
4472 ret = -ENOMEM;
4473 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4474 if (!hash)
4475 goto out_unlock;
4477 INIT_HLIST_HEAD(&hhd);
4479 size = 1 << hash->size_bits;
4480 for (i = 0; i < size; i++) {
4481 hlist_for_each_entry_safe(entry, tmp, &hash->buckets[i], hlist) {
4483 if (func_g.search) {
4484 kallsyms_lookup(entry->ip, NULL, NULL,
4485 NULL, str);
4486 if (!ftrace_match(str, &func_g))
4487 continue;
4489 count++;
4490 remove_hash_entry(hash, entry);
4491 hlist_add_head(&entry->hlist, &hhd);
4495 /* Nothing found? */
4496 if (!count) {
4497 ret = -EINVAL;
4498 goto out_unlock;
4501 mutex_lock(&ftrace_lock);
4503 WARN_ON(probe->ref < count);
4505 probe->ref -= count;
4507 if (ftrace_hash_empty(hash))
4508 ftrace_shutdown(&probe->ops, 0);
4510 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4511 hash, 1);
4513 /* still need to update the function call sites */
4514 if (ftrace_enabled && !ftrace_hash_empty(hash))
4515 ftrace_run_modify_code(&probe->ops, FTRACE_UPDATE_CALLS,
4516 &old_hash_ops);
4517 synchronize_rcu();
4519 hlist_for_each_entry_safe(entry, tmp, &hhd, hlist) {
4520 hlist_del(&entry->hlist);
4521 if (probe_ops->free)
4522 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4523 kfree(entry);
4525 mutex_unlock(&ftrace_lock);
4527 out_unlock:
4528 mutex_unlock(&probe->ops.func_hash->regex_lock);
4529 free_ftrace_hash(hash);
4531 release_probe(probe);
4533 return ret;
4535 err_unlock_ftrace:
4536 mutex_unlock(&ftrace_lock);
4537 return ret;
4540 void clear_ftrace_function_probes(struct trace_array *tr)
4542 struct ftrace_func_probe *probe, *n;
4544 list_for_each_entry_safe(probe, n, &tr->func_probes, list)
4545 unregister_ftrace_function_probe_func(NULL, tr, probe->probe_ops);
4548 static LIST_HEAD(ftrace_commands);
4549 static DEFINE_MUTEX(ftrace_cmd_mutex);
4552 * Currently we only register ftrace commands from __init, so mark this
4553 * __init too.
4555 __init int register_ftrace_command(struct ftrace_func_command *cmd)
4557 struct ftrace_func_command *p;
4558 int ret = 0;
4560 mutex_lock(&ftrace_cmd_mutex);
4561 list_for_each_entry(p, &ftrace_commands, list) {
4562 if (strcmp(cmd->name, p->name) == 0) {
4563 ret = -EBUSY;
4564 goto out_unlock;
4567 list_add(&cmd->list, &ftrace_commands);
4568 out_unlock:
4569 mutex_unlock(&ftrace_cmd_mutex);
4571 return ret;
4575 * Currently we only unregister ftrace commands from __init, so mark
4576 * this __init too.
4578 __init int unregister_ftrace_command(struct ftrace_func_command *cmd)
4580 struct ftrace_func_command *p, *n;
4581 int ret = -ENODEV;
4583 mutex_lock(&ftrace_cmd_mutex);
4584 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
4585 if (strcmp(cmd->name, p->name) == 0) {
4586 ret = 0;
4587 list_del_init(&p->list);
4588 goto out_unlock;
4591 out_unlock:
4592 mutex_unlock(&ftrace_cmd_mutex);
4594 return ret;
4597 static int ftrace_process_regex(struct ftrace_iterator *iter,
4598 char *buff, int len, int enable)
4600 struct ftrace_hash *hash = iter->hash;
4601 struct trace_array *tr = iter->ops->private;
4602 char *func, *command, *next = buff;
4603 struct ftrace_func_command *p;
4604 int ret = -EINVAL;
4606 func = strsep(&next, ":");
4608 if (!next) {
4609 ret = ftrace_match_records(hash, func, len);
4610 if (!ret)
4611 ret = -EINVAL;
4612 if (ret < 0)
4613 return ret;
4614 return 0;
4617 /* command found */
4619 command = strsep(&next, ":");
4621 mutex_lock(&ftrace_cmd_mutex);
4622 list_for_each_entry(p, &ftrace_commands, list) {
4623 if (strcmp(p->name, command) == 0) {
4624 ret = p->func(tr, hash, func, command, next, enable);
4625 goto out_unlock;
4628 out_unlock:
4629 mutex_unlock(&ftrace_cmd_mutex);
4631 return ret;
4634 static ssize_t
4635 ftrace_regex_write(struct file *file, const char __user *ubuf,
4636 size_t cnt, loff_t *ppos, int enable)
4638 struct ftrace_iterator *iter;
4639 struct trace_parser *parser;
4640 ssize_t ret, read;
4642 if (!cnt)
4643 return 0;
4645 if (file->f_mode & FMODE_READ) {
4646 struct seq_file *m = file->private_data;
4647 iter = m->private;
4648 } else
4649 iter = file->private_data;
4651 if (unlikely(ftrace_disabled))
4652 return -ENODEV;
4654 /* iter->hash is a local copy, so we don't need regex_lock */
4656 parser = &iter->parser;
4657 read = trace_get_user(parser, ubuf, cnt, ppos);
4659 if (read >= 0 && trace_parser_loaded(parser) &&
4660 !trace_parser_cont(parser)) {
4661 ret = ftrace_process_regex(iter, parser->buffer,
4662 parser->idx, enable);
4663 trace_parser_clear(parser);
4664 if (ret < 0)
4665 goto out;
4668 ret = read;
4669 out:
4670 return ret;
4673 ssize_t
4674 ftrace_filter_write(struct file *file, const char __user *ubuf,
4675 size_t cnt, loff_t *ppos)
4677 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
4680 ssize_t
4681 ftrace_notrace_write(struct file *file, const char __user *ubuf,
4682 size_t cnt, loff_t *ppos)
4684 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
4687 static int
4688 ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
4690 struct ftrace_func_entry *entry;
4692 if (!ftrace_location(ip))
4693 return -EINVAL;
4695 if (remove) {
4696 entry = ftrace_lookup_ip(hash, ip);
4697 if (!entry)
4698 return -ENOENT;
4699 free_hash_entry(hash, entry);
4700 return 0;
4703 return add_hash_entry(hash, ip);
4706 static int
4707 ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
4708 unsigned long ip, int remove, int reset, int enable)
4710 struct ftrace_hash **orig_hash;
4711 struct ftrace_hash *hash;
4712 int ret;
4714 if (unlikely(ftrace_disabled))
4715 return -ENODEV;
4717 mutex_lock(&ops->func_hash->regex_lock);
4719 if (enable)
4720 orig_hash = &ops->func_hash->filter_hash;
4721 else
4722 orig_hash = &ops->func_hash->notrace_hash;
4724 if (reset)
4725 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4726 else
4727 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
4729 if (!hash) {
4730 ret = -ENOMEM;
4731 goto out_regex_unlock;
4734 if (buf && !ftrace_match_records(hash, buf, len)) {
4735 ret = -EINVAL;
4736 goto out_regex_unlock;
4738 if (ip) {
4739 ret = ftrace_match_addr(hash, ip, remove);
4740 if (ret < 0)
4741 goto out_regex_unlock;
4744 mutex_lock(&ftrace_lock);
4745 ret = ftrace_hash_move_and_update_ops(ops, orig_hash, hash, enable);
4746 mutex_unlock(&ftrace_lock);
4748 out_regex_unlock:
4749 mutex_unlock(&ops->func_hash->regex_lock);
4751 free_ftrace_hash(hash);
4752 return ret;
4755 static int
4756 ftrace_set_addr(struct ftrace_ops *ops, unsigned long ip, int remove,
4757 int reset, int enable)
4759 return ftrace_set_hash(ops, NULL, 0, ip, remove, reset, enable);
4763 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
4764 * @ops - the ops to set the filter with
4765 * @ip - the address to add to or remove from the filter.
4766 * @remove - non zero to remove the ip from the filter
4767 * @reset - non zero to reset all filters before applying this filter.
4769 * Filters denote which functions should be enabled when tracing is enabled
4770 * If @ip is NULL, it failes to update filter.
4772 int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
4773 int remove, int reset)
4775 ftrace_ops_init(ops);
4776 return ftrace_set_addr(ops, ip, remove, reset, 1);
4778 EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
4781 * ftrace_ops_set_global_filter - setup ops to use global filters
4782 * @ops - the ops which will use the global filters
4784 * ftrace users who need global function trace filtering should call this.
4785 * It can set the global filter only if ops were not initialized before.
4787 void ftrace_ops_set_global_filter(struct ftrace_ops *ops)
4789 if (ops->flags & FTRACE_OPS_FL_INITIALIZED)
4790 return;
4792 ftrace_ops_init(ops);
4793 ops->func_hash = &global_ops.local_hash;
4795 EXPORT_SYMBOL_GPL(ftrace_ops_set_global_filter);
4797 static int
4798 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
4799 int reset, int enable)
4801 return ftrace_set_hash(ops, buf, len, 0, 0, reset, enable);
4805 * ftrace_set_filter - set a function to filter on in ftrace
4806 * @ops - the ops to set the filter with
4807 * @buf - the string that holds the function filter text.
4808 * @len - the length of the string.
4809 * @reset - non zero to reset all filters before applying this filter.
4811 * Filters denote which functions should be enabled when tracing is enabled.
4812 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4814 int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
4815 int len, int reset)
4817 ftrace_ops_init(ops);
4818 return ftrace_set_regex(ops, buf, len, reset, 1);
4820 EXPORT_SYMBOL_GPL(ftrace_set_filter);
4823 * ftrace_set_notrace - set a function to not trace in ftrace
4824 * @ops - the ops to set the notrace filter with
4825 * @buf - the string that holds the function notrace text.
4826 * @len - the length of the string.
4827 * @reset - non zero to reset all filters before applying this filter.
4829 * Notrace Filters denote which functions should not be enabled when tracing
4830 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4831 * for tracing.
4833 int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
4834 int len, int reset)
4836 ftrace_ops_init(ops);
4837 return ftrace_set_regex(ops, buf, len, reset, 0);
4839 EXPORT_SYMBOL_GPL(ftrace_set_notrace);
4841 * ftrace_set_global_filter - set a function to filter on with global tracers
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 void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
4851 ftrace_set_regex(&global_ops, buf, len, reset, 1);
4853 EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
4856 * ftrace_set_global_notrace - set a function to not trace with global tracers
4857 * @buf - the string that holds the function notrace text.
4858 * @len - the length of the string.
4859 * @reset - non zero to reset all filters before applying this filter.
4861 * Notrace Filters denote which functions should not be enabled when tracing
4862 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4863 * for tracing.
4865 void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
4867 ftrace_set_regex(&global_ops, buf, len, reset, 0);
4869 EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
4872 * command line interface to allow users to set filters on boot up.
4874 #define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
4875 static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4876 static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
4878 /* Used by function selftest to not test if filter is set */
4879 bool ftrace_filter_param __initdata;
4881 static int __init set_ftrace_notrace(char *str)
4883 ftrace_filter_param = true;
4884 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
4885 return 1;
4887 __setup("ftrace_notrace=", set_ftrace_notrace);
4889 static int __init set_ftrace_filter(char *str)
4891 ftrace_filter_param = true;
4892 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
4893 return 1;
4895 __setup("ftrace_filter=", set_ftrace_filter);
4897 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4898 static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
4899 static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4900 static int ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer);
4902 static int __init set_graph_function(char *str)
4904 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
4905 return 1;
4907 __setup("ftrace_graph_filter=", set_graph_function);
4909 static int __init set_graph_notrace_function(char *str)
4911 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
4912 return 1;
4914 __setup("ftrace_graph_notrace=", set_graph_notrace_function);
4916 static int __init set_graph_max_depth_function(char *str)
4918 if (!str)
4919 return 0;
4920 fgraph_max_depth = simple_strtoul(str, NULL, 0);
4921 return 1;
4923 __setup("ftrace_graph_max_depth=", set_graph_max_depth_function);
4925 static void __init set_ftrace_early_graph(char *buf, int enable)
4927 int ret;
4928 char *func;
4929 struct ftrace_hash *hash;
4931 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4932 if (WARN_ON(!hash))
4933 return;
4935 while (buf) {
4936 func = strsep(&buf, ",");
4937 /* we allow only one expression at a time */
4938 ret = ftrace_graph_set_hash(hash, func);
4939 if (ret)
4940 printk(KERN_DEBUG "ftrace: function %s not "
4941 "traceable\n", func);
4944 if (enable)
4945 ftrace_graph_hash = hash;
4946 else
4947 ftrace_graph_notrace_hash = hash;
4949 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4951 void __init
4952 ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
4954 char *func;
4956 ftrace_ops_init(ops);
4958 while (buf) {
4959 func = strsep(&buf, ",");
4960 ftrace_set_regex(ops, func, strlen(func), 0, enable);
4964 static void __init set_ftrace_early_filters(void)
4966 if (ftrace_filter_buf[0])
4967 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
4968 if (ftrace_notrace_buf[0])
4969 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
4970 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4971 if (ftrace_graph_buf[0])
4972 set_ftrace_early_graph(ftrace_graph_buf, 1);
4973 if (ftrace_graph_notrace_buf[0])
4974 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
4975 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4978 int ftrace_regex_release(struct inode *inode, struct file *file)
4980 struct seq_file *m = (struct seq_file *)file->private_data;
4981 struct ftrace_iterator *iter;
4982 struct ftrace_hash **orig_hash;
4983 struct trace_parser *parser;
4984 int filter_hash;
4985 int ret;
4987 if (file->f_mode & FMODE_READ) {
4988 iter = m->private;
4989 seq_release(inode, file);
4990 } else
4991 iter = file->private_data;
4993 parser = &iter->parser;
4994 if (trace_parser_loaded(parser)) {
4995 ftrace_match_records(iter->hash, parser->buffer, parser->idx);
4998 trace_parser_put(parser);
5000 mutex_lock(&iter->ops->func_hash->regex_lock);
5002 if (file->f_mode & FMODE_WRITE) {
5003 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
5005 if (filter_hash) {
5006 orig_hash = &iter->ops->func_hash->filter_hash;
5007 if (iter->tr && !list_empty(&iter->tr->mod_trace))
5008 iter->hash->flags |= FTRACE_HASH_FL_MOD;
5009 } else
5010 orig_hash = &iter->ops->func_hash->notrace_hash;
5012 mutex_lock(&ftrace_lock);
5013 ret = ftrace_hash_move_and_update_ops(iter->ops, orig_hash,
5014 iter->hash, filter_hash);
5015 mutex_unlock(&ftrace_lock);
5016 } else {
5017 /* For read only, the hash is the ops hash */
5018 iter->hash = NULL;
5021 mutex_unlock(&iter->ops->func_hash->regex_lock);
5022 free_ftrace_hash(iter->hash);
5023 kfree(iter);
5025 return 0;
5028 static const struct file_operations ftrace_avail_fops = {
5029 .open = ftrace_avail_open,
5030 .read = seq_read,
5031 .llseek = seq_lseek,
5032 .release = seq_release_private,
5035 static const struct file_operations ftrace_enabled_fops = {
5036 .open = ftrace_enabled_open,
5037 .read = seq_read,
5038 .llseek = seq_lseek,
5039 .release = seq_release_private,
5042 static const struct file_operations ftrace_filter_fops = {
5043 .open = ftrace_filter_open,
5044 .read = seq_read,
5045 .write = ftrace_filter_write,
5046 .llseek = tracing_lseek,
5047 .release = ftrace_regex_release,
5050 static const struct file_operations ftrace_notrace_fops = {
5051 .open = ftrace_notrace_open,
5052 .read = seq_read,
5053 .write = ftrace_notrace_write,
5054 .llseek = tracing_lseek,
5055 .release = ftrace_regex_release,
5058 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5060 static DEFINE_MUTEX(graph_lock);
5062 struct ftrace_hash *ftrace_graph_hash = EMPTY_HASH;
5063 struct ftrace_hash *ftrace_graph_notrace_hash = EMPTY_HASH;
5065 enum graph_filter_type {
5066 GRAPH_FILTER_NOTRACE = 0,
5067 GRAPH_FILTER_FUNCTION,
5070 #define FTRACE_GRAPH_EMPTY ((void *)1)
5072 struct ftrace_graph_data {
5073 struct ftrace_hash *hash;
5074 struct ftrace_func_entry *entry;
5075 int idx; /* for hash table iteration */
5076 enum graph_filter_type type;
5077 struct ftrace_hash *new_hash;
5078 const struct seq_operations *seq_ops;
5079 struct trace_parser parser;
5082 static void *
5083 __g_next(struct seq_file *m, loff_t *pos)
5085 struct ftrace_graph_data *fgd = m->private;
5086 struct ftrace_func_entry *entry = fgd->entry;
5087 struct hlist_head *head;
5088 int i, idx = fgd->idx;
5090 if (*pos >= fgd->hash->count)
5091 return NULL;
5093 if (entry) {
5094 hlist_for_each_entry_continue(entry, hlist) {
5095 fgd->entry = entry;
5096 return entry;
5099 idx++;
5102 for (i = idx; i < 1 << fgd->hash->size_bits; i++) {
5103 head = &fgd->hash->buckets[i];
5104 hlist_for_each_entry(entry, head, hlist) {
5105 fgd->entry = entry;
5106 fgd->idx = i;
5107 return entry;
5110 return NULL;
5113 static void *
5114 g_next(struct seq_file *m, void *v, loff_t *pos)
5116 (*pos)++;
5117 return __g_next(m, pos);
5120 static void *g_start(struct seq_file *m, loff_t *pos)
5122 struct ftrace_graph_data *fgd = m->private;
5124 mutex_lock(&graph_lock);
5126 if (fgd->type == GRAPH_FILTER_FUNCTION)
5127 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
5128 lockdep_is_held(&graph_lock));
5129 else
5130 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5131 lockdep_is_held(&graph_lock));
5133 /* Nothing, tell g_show to print all functions are enabled */
5134 if (ftrace_hash_empty(fgd->hash) && !*pos)
5135 return FTRACE_GRAPH_EMPTY;
5137 fgd->idx = 0;
5138 fgd->entry = NULL;
5139 return __g_next(m, pos);
5142 static void g_stop(struct seq_file *m, void *p)
5144 mutex_unlock(&graph_lock);
5147 static int g_show(struct seq_file *m, void *v)
5149 struct ftrace_func_entry *entry = v;
5151 if (!entry)
5152 return 0;
5154 if (entry == FTRACE_GRAPH_EMPTY) {
5155 struct ftrace_graph_data *fgd = m->private;
5157 if (fgd->type == GRAPH_FILTER_FUNCTION)
5158 seq_puts(m, "#### all functions enabled ####\n");
5159 else
5160 seq_puts(m, "#### no functions disabled ####\n");
5161 return 0;
5164 seq_printf(m, "%ps\n", (void *)entry->ip);
5166 return 0;
5169 static const struct seq_operations ftrace_graph_seq_ops = {
5170 .start = g_start,
5171 .next = g_next,
5172 .stop = g_stop,
5173 .show = g_show,
5176 static int
5177 __ftrace_graph_open(struct inode *inode, struct file *file,
5178 struct ftrace_graph_data *fgd)
5180 int ret = 0;
5181 struct ftrace_hash *new_hash = NULL;
5183 if (file->f_mode & FMODE_WRITE) {
5184 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
5186 if (trace_parser_get_init(&fgd->parser, FTRACE_BUFF_MAX))
5187 return -ENOMEM;
5189 if (file->f_flags & O_TRUNC)
5190 new_hash = alloc_ftrace_hash(size_bits);
5191 else
5192 new_hash = alloc_and_copy_ftrace_hash(size_bits,
5193 fgd->hash);
5194 if (!new_hash) {
5195 ret = -ENOMEM;
5196 goto out;
5200 if (file->f_mode & FMODE_READ) {
5201 ret = seq_open(file, &ftrace_graph_seq_ops);
5202 if (!ret) {
5203 struct seq_file *m = file->private_data;
5204 m->private = fgd;
5205 } else {
5206 /* Failed */
5207 free_ftrace_hash(new_hash);
5208 new_hash = NULL;
5210 } else
5211 file->private_data = fgd;
5213 out:
5214 if (ret < 0 && file->f_mode & FMODE_WRITE)
5215 trace_parser_put(&fgd->parser);
5217 fgd->new_hash = new_hash;
5220 * All uses of fgd->hash must be taken with the graph_lock
5221 * held. The graph_lock is going to be released, so force
5222 * fgd->hash to be reinitialized when it is taken again.
5224 fgd->hash = NULL;
5226 return ret;
5229 static int
5230 ftrace_graph_open(struct inode *inode, struct file *file)
5232 struct ftrace_graph_data *fgd;
5233 int ret;
5235 if (unlikely(ftrace_disabled))
5236 return -ENODEV;
5238 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
5239 if (fgd == NULL)
5240 return -ENOMEM;
5242 mutex_lock(&graph_lock);
5244 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
5245 lockdep_is_held(&graph_lock));
5246 fgd->type = GRAPH_FILTER_FUNCTION;
5247 fgd->seq_ops = &ftrace_graph_seq_ops;
5249 ret = __ftrace_graph_open(inode, file, fgd);
5250 if (ret < 0)
5251 kfree(fgd);
5253 mutex_unlock(&graph_lock);
5254 return ret;
5257 static int
5258 ftrace_graph_notrace_open(struct inode *inode, struct file *file)
5260 struct ftrace_graph_data *fgd;
5261 int ret;
5263 if (unlikely(ftrace_disabled))
5264 return -ENODEV;
5266 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
5267 if (fgd == NULL)
5268 return -ENOMEM;
5270 mutex_lock(&graph_lock);
5272 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5273 lockdep_is_held(&graph_lock));
5274 fgd->type = GRAPH_FILTER_NOTRACE;
5275 fgd->seq_ops = &ftrace_graph_seq_ops;
5277 ret = __ftrace_graph_open(inode, file, fgd);
5278 if (ret < 0)
5279 kfree(fgd);
5281 mutex_unlock(&graph_lock);
5282 return ret;
5285 static int
5286 ftrace_graph_release(struct inode *inode, struct file *file)
5288 struct ftrace_graph_data *fgd;
5289 struct ftrace_hash *old_hash, *new_hash;
5290 struct trace_parser *parser;
5291 int ret = 0;
5293 if (file->f_mode & FMODE_READ) {
5294 struct seq_file *m = file->private_data;
5296 fgd = m->private;
5297 seq_release(inode, file);
5298 } else {
5299 fgd = file->private_data;
5303 if (file->f_mode & FMODE_WRITE) {
5305 parser = &fgd->parser;
5307 if (trace_parser_loaded((parser))) {
5308 ret = ftrace_graph_set_hash(fgd->new_hash,
5309 parser->buffer);
5312 trace_parser_put(parser);
5314 new_hash = __ftrace_hash_move(fgd->new_hash);
5315 if (!new_hash) {
5316 ret = -ENOMEM;
5317 goto out;
5320 mutex_lock(&graph_lock);
5322 if (fgd->type == GRAPH_FILTER_FUNCTION) {
5323 old_hash = rcu_dereference_protected(ftrace_graph_hash,
5324 lockdep_is_held(&graph_lock));
5325 rcu_assign_pointer(ftrace_graph_hash, new_hash);
5326 } else {
5327 old_hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5328 lockdep_is_held(&graph_lock));
5329 rcu_assign_pointer(ftrace_graph_notrace_hash, new_hash);
5332 mutex_unlock(&graph_lock);
5334 /* Wait till all users are no longer using the old hash */
5335 synchronize_rcu();
5337 free_ftrace_hash(old_hash);
5340 out:
5341 free_ftrace_hash(fgd->new_hash);
5342 kfree(fgd);
5344 return ret;
5347 static int
5348 ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer)
5350 struct ftrace_glob func_g;
5351 struct dyn_ftrace *rec;
5352 struct ftrace_page *pg;
5353 struct ftrace_func_entry *entry;
5354 int fail = 1;
5355 int not;
5357 /* decode regex */
5358 func_g.type = filter_parse_regex(buffer, strlen(buffer),
5359 &func_g.search, &not);
5361 func_g.len = strlen(func_g.search);
5363 mutex_lock(&ftrace_lock);
5365 if (unlikely(ftrace_disabled)) {
5366 mutex_unlock(&ftrace_lock);
5367 return -ENODEV;
5370 do_for_each_ftrace_rec(pg, rec) {
5372 if (rec->flags & FTRACE_FL_DISABLED)
5373 continue;
5375 if (ftrace_match_record(rec, &func_g, NULL, 0)) {
5376 entry = ftrace_lookup_ip(hash, rec->ip);
5378 if (!not) {
5379 fail = 0;
5381 if (entry)
5382 continue;
5383 if (add_hash_entry(hash, rec->ip) < 0)
5384 goto out;
5385 } else {
5386 if (entry) {
5387 free_hash_entry(hash, entry);
5388 fail = 0;
5392 } while_for_each_ftrace_rec();
5393 out:
5394 mutex_unlock(&ftrace_lock);
5396 if (fail)
5397 return -EINVAL;
5399 return 0;
5402 static ssize_t
5403 ftrace_graph_write(struct file *file, const char __user *ubuf,
5404 size_t cnt, loff_t *ppos)
5406 ssize_t read, ret = 0;
5407 struct ftrace_graph_data *fgd = file->private_data;
5408 struct trace_parser *parser;
5410 if (!cnt)
5411 return 0;
5413 /* Read mode uses seq functions */
5414 if (file->f_mode & FMODE_READ) {
5415 struct seq_file *m = file->private_data;
5416 fgd = m->private;
5419 parser = &fgd->parser;
5421 read = trace_get_user(parser, ubuf, cnt, ppos);
5423 if (read >= 0 && trace_parser_loaded(parser) &&
5424 !trace_parser_cont(parser)) {
5426 ret = ftrace_graph_set_hash(fgd->new_hash,
5427 parser->buffer);
5428 trace_parser_clear(parser);
5431 if (!ret)
5432 ret = read;
5434 return ret;
5437 static const struct file_operations ftrace_graph_fops = {
5438 .open = ftrace_graph_open,
5439 .read = seq_read,
5440 .write = ftrace_graph_write,
5441 .llseek = tracing_lseek,
5442 .release = ftrace_graph_release,
5445 static const struct file_operations ftrace_graph_notrace_fops = {
5446 .open = ftrace_graph_notrace_open,
5447 .read = seq_read,
5448 .write = ftrace_graph_write,
5449 .llseek = tracing_lseek,
5450 .release = ftrace_graph_release,
5452 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5454 void ftrace_create_filter_files(struct ftrace_ops *ops,
5455 struct dentry *parent)
5458 trace_create_file("set_ftrace_filter", 0644, parent,
5459 ops, &ftrace_filter_fops);
5461 trace_create_file("set_ftrace_notrace", 0644, parent,
5462 ops, &ftrace_notrace_fops);
5466 * The name "destroy_filter_files" is really a misnomer. Although
5467 * in the future, it may actually delete the files, but this is
5468 * really intended to make sure the ops passed in are disabled
5469 * and that when this function returns, the caller is free to
5470 * free the ops.
5472 * The "destroy" name is only to match the "create" name that this
5473 * should be paired with.
5475 void ftrace_destroy_filter_files(struct ftrace_ops *ops)
5477 mutex_lock(&ftrace_lock);
5478 if (ops->flags & FTRACE_OPS_FL_ENABLED)
5479 ftrace_shutdown(ops, 0);
5480 ops->flags |= FTRACE_OPS_FL_DELETED;
5481 ftrace_free_filter(ops);
5482 mutex_unlock(&ftrace_lock);
5485 static __init int ftrace_init_dyn_tracefs(struct dentry *d_tracer)
5488 trace_create_file("available_filter_functions", 0444,
5489 d_tracer, NULL, &ftrace_avail_fops);
5491 trace_create_file("enabled_functions", 0444,
5492 d_tracer, NULL, &ftrace_enabled_fops);
5494 ftrace_create_filter_files(&global_ops, d_tracer);
5496 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5497 trace_create_file("set_graph_function", 0644, d_tracer,
5498 NULL,
5499 &ftrace_graph_fops);
5500 trace_create_file("set_graph_notrace", 0644, d_tracer,
5501 NULL,
5502 &ftrace_graph_notrace_fops);
5503 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5505 return 0;
5508 static int ftrace_cmp_ips(const void *a, const void *b)
5510 const unsigned long *ipa = a;
5511 const unsigned long *ipb = b;
5513 if (*ipa > *ipb)
5514 return 1;
5515 if (*ipa < *ipb)
5516 return -1;
5517 return 0;
5520 static int ftrace_process_locs(struct module *mod,
5521 unsigned long *start,
5522 unsigned long *end)
5524 struct ftrace_page *start_pg;
5525 struct ftrace_page *pg;
5526 struct dyn_ftrace *rec;
5527 unsigned long count;
5528 unsigned long *p;
5529 unsigned long addr;
5530 unsigned long flags = 0; /* Shut up gcc */
5531 int ret = -ENOMEM;
5533 count = end - start;
5535 if (!count)
5536 return 0;
5538 sort(start, count, sizeof(*start),
5539 ftrace_cmp_ips, NULL);
5541 start_pg = ftrace_allocate_pages(count);
5542 if (!start_pg)
5543 return -ENOMEM;
5545 mutex_lock(&ftrace_lock);
5548 * Core and each module needs their own pages, as
5549 * modules will free them when they are removed.
5550 * Force a new page to be allocated for modules.
5552 if (!mod) {
5553 WARN_ON(ftrace_pages || ftrace_pages_start);
5554 /* First initialization */
5555 ftrace_pages = ftrace_pages_start = start_pg;
5556 } else {
5557 if (!ftrace_pages)
5558 goto out;
5560 if (WARN_ON(ftrace_pages->next)) {
5561 /* Hmm, we have free pages? */
5562 while (ftrace_pages->next)
5563 ftrace_pages = ftrace_pages->next;
5566 ftrace_pages->next = start_pg;
5569 p = start;
5570 pg = start_pg;
5571 while (p < end) {
5572 addr = ftrace_call_adjust(*p++);
5574 * Some architecture linkers will pad between
5575 * the different mcount_loc sections of different
5576 * object files to satisfy alignments.
5577 * Skip any NULL pointers.
5579 if (!addr)
5580 continue;
5582 if (pg->index == pg->size) {
5583 /* We should have allocated enough */
5584 if (WARN_ON(!pg->next))
5585 break;
5586 pg = pg->next;
5589 rec = &pg->records[pg->index++];
5590 rec->ip = addr;
5593 /* We should have used all pages */
5594 WARN_ON(pg->next);
5596 /* Assign the last page to ftrace_pages */
5597 ftrace_pages = pg;
5600 * We only need to disable interrupts on start up
5601 * because we are modifying code that an interrupt
5602 * may execute, and the modification is not atomic.
5603 * But for modules, nothing runs the code we modify
5604 * until we are finished with it, and there's no
5605 * reason to cause large interrupt latencies while we do it.
5607 if (!mod)
5608 local_irq_save(flags);
5609 ftrace_update_code(mod, start_pg);
5610 if (!mod)
5611 local_irq_restore(flags);
5612 ret = 0;
5613 out:
5614 mutex_unlock(&ftrace_lock);
5616 return ret;
5619 struct ftrace_mod_func {
5620 struct list_head list;
5621 char *name;
5622 unsigned long ip;
5623 unsigned int size;
5626 struct ftrace_mod_map {
5627 struct rcu_head rcu;
5628 struct list_head list;
5629 struct module *mod;
5630 unsigned long start_addr;
5631 unsigned long end_addr;
5632 struct list_head funcs;
5633 unsigned int num_funcs;
5636 #ifdef CONFIG_MODULES
5638 #define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
5640 static LIST_HEAD(ftrace_mod_maps);
5642 static int referenced_filters(struct dyn_ftrace *rec)
5644 struct ftrace_ops *ops;
5645 int cnt = 0;
5647 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
5648 if (ops_references_rec(ops, rec))
5649 cnt++;
5652 return cnt;
5655 static void
5656 clear_mod_from_hash(struct ftrace_page *pg, struct ftrace_hash *hash)
5658 struct ftrace_func_entry *entry;
5659 struct dyn_ftrace *rec;
5660 int i;
5662 if (ftrace_hash_empty(hash))
5663 return;
5665 for (i = 0; i < pg->index; i++) {
5666 rec = &pg->records[i];
5667 entry = __ftrace_lookup_ip(hash, rec->ip);
5669 * Do not allow this rec to match again.
5670 * Yeah, it may waste some memory, but will be removed
5671 * if/when the hash is modified again.
5673 if (entry)
5674 entry->ip = 0;
5678 /* Clear any records from hashs */
5679 static void clear_mod_from_hashes(struct ftrace_page *pg)
5681 struct trace_array *tr;
5683 mutex_lock(&trace_types_lock);
5684 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
5685 if (!tr->ops || !tr->ops->func_hash)
5686 continue;
5687 mutex_lock(&tr->ops->func_hash->regex_lock);
5688 clear_mod_from_hash(pg, tr->ops->func_hash->filter_hash);
5689 clear_mod_from_hash(pg, tr->ops->func_hash->notrace_hash);
5690 mutex_unlock(&tr->ops->func_hash->regex_lock);
5692 mutex_unlock(&trace_types_lock);
5695 static void ftrace_free_mod_map(struct rcu_head *rcu)
5697 struct ftrace_mod_map *mod_map = container_of(rcu, struct ftrace_mod_map, rcu);
5698 struct ftrace_mod_func *mod_func;
5699 struct ftrace_mod_func *n;
5701 /* All the contents of mod_map are now not visible to readers */
5702 list_for_each_entry_safe(mod_func, n, &mod_map->funcs, list) {
5703 kfree(mod_func->name);
5704 list_del(&mod_func->list);
5705 kfree(mod_func);
5708 kfree(mod_map);
5711 void ftrace_release_mod(struct module *mod)
5713 struct ftrace_mod_map *mod_map;
5714 struct ftrace_mod_map *n;
5715 struct dyn_ftrace *rec;
5716 struct ftrace_page **last_pg;
5717 struct ftrace_page *tmp_page = NULL;
5718 struct ftrace_page *pg;
5719 int order;
5721 mutex_lock(&ftrace_lock);
5723 if (ftrace_disabled)
5724 goto out_unlock;
5726 list_for_each_entry_safe(mod_map, n, &ftrace_mod_maps, list) {
5727 if (mod_map->mod == mod) {
5728 list_del_rcu(&mod_map->list);
5729 call_rcu(&mod_map->rcu, ftrace_free_mod_map);
5730 break;
5735 * Each module has its own ftrace_pages, remove
5736 * them from the list.
5738 last_pg = &ftrace_pages_start;
5739 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
5740 rec = &pg->records[0];
5741 if (within_module_core(rec->ip, mod) ||
5742 within_module_init(rec->ip, mod)) {
5744 * As core pages are first, the first
5745 * page should never be a module page.
5747 if (WARN_ON(pg == ftrace_pages_start))
5748 goto out_unlock;
5750 /* Check if we are deleting the last page */
5751 if (pg == ftrace_pages)
5752 ftrace_pages = next_to_ftrace_page(last_pg);
5754 ftrace_update_tot_cnt -= pg->index;
5755 *last_pg = pg->next;
5757 pg->next = tmp_page;
5758 tmp_page = pg;
5759 } else
5760 last_pg = &pg->next;
5762 out_unlock:
5763 mutex_unlock(&ftrace_lock);
5765 for (pg = tmp_page; pg; pg = tmp_page) {
5767 /* Needs to be called outside of ftrace_lock */
5768 clear_mod_from_hashes(pg);
5770 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
5771 free_pages((unsigned long)pg->records, order);
5772 tmp_page = pg->next;
5773 kfree(pg);
5777 void ftrace_module_enable(struct module *mod)
5779 struct dyn_ftrace *rec;
5780 struct ftrace_page *pg;
5782 mutex_lock(&ftrace_lock);
5784 if (ftrace_disabled)
5785 goto out_unlock;
5788 * If the tracing is enabled, go ahead and enable the record.
5790 * The reason not to enable the record immediately is the
5791 * inherent check of ftrace_make_nop/ftrace_make_call for
5792 * correct previous instructions. Making first the NOP
5793 * conversion puts the module to the correct state, thus
5794 * passing the ftrace_make_call check.
5796 * We also delay this to after the module code already set the
5797 * text to read-only, as we now need to set it back to read-write
5798 * so that we can modify the text.
5800 if (ftrace_start_up)
5801 ftrace_arch_code_modify_prepare();
5803 do_for_each_ftrace_rec(pg, rec) {
5804 int cnt;
5806 * do_for_each_ftrace_rec() is a double loop.
5807 * module text shares the pg. If a record is
5808 * not part of this module, then skip this pg,
5809 * which the "break" will do.
5811 if (!within_module_core(rec->ip, mod) &&
5812 !within_module_init(rec->ip, mod))
5813 break;
5815 cnt = 0;
5818 * When adding a module, we need to check if tracers are
5819 * currently enabled and if they are, and can trace this record,
5820 * we need to enable the module functions as well as update the
5821 * reference counts for those function records.
5823 if (ftrace_start_up)
5824 cnt += referenced_filters(rec);
5826 /* This clears FTRACE_FL_DISABLED */
5827 rec->flags = cnt;
5829 if (ftrace_start_up && cnt) {
5830 int failed = __ftrace_replace_code(rec, 1);
5831 if (failed) {
5832 ftrace_bug(failed, rec);
5833 goto out_loop;
5837 } while_for_each_ftrace_rec();
5839 out_loop:
5840 if (ftrace_start_up)
5841 ftrace_arch_code_modify_post_process();
5843 out_unlock:
5844 mutex_unlock(&ftrace_lock);
5846 process_cached_mods(mod->name);
5849 void ftrace_module_init(struct module *mod)
5851 if (ftrace_disabled || !mod->num_ftrace_callsites)
5852 return;
5854 ftrace_process_locs(mod, mod->ftrace_callsites,
5855 mod->ftrace_callsites + mod->num_ftrace_callsites);
5858 static void save_ftrace_mod_rec(struct ftrace_mod_map *mod_map,
5859 struct dyn_ftrace *rec)
5861 struct ftrace_mod_func *mod_func;
5862 unsigned long symsize;
5863 unsigned long offset;
5864 char str[KSYM_SYMBOL_LEN];
5865 char *modname;
5866 const char *ret;
5868 ret = kallsyms_lookup(rec->ip, &symsize, &offset, &modname, str);
5869 if (!ret)
5870 return;
5872 mod_func = kmalloc(sizeof(*mod_func), GFP_KERNEL);
5873 if (!mod_func)
5874 return;
5876 mod_func->name = kstrdup(str, GFP_KERNEL);
5877 if (!mod_func->name) {
5878 kfree(mod_func);
5879 return;
5882 mod_func->ip = rec->ip - offset;
5883 mod_func->size = symsize;
5885 mod_map->num_funcs++;
5887 list_add_rcu(&mod_func->list, &mod_map->funcs);
5890 static struct ftrace_mod_map *
5891 allocate_ftrace_mod_map(struct module *mod,
5892 unsigned long start, unsigned long end)
5894 struct ftrace_mod_map *mod_map;
5896 mod_map = kmalloc(sizeof(*mod_map), GFP_KERNEL);
5897 if (!mod_map)
5898 return NULL;
5900 mod_map->mod = mod;
5901 mod_map->start_addr = start;
5902 mod_map->end_addr = end;
5903 mod_map->num_funcs = 0;
5905 INIT_LIST_HEAD_RCU(&mod_map->funcs);
5907 list_add_rcu(&mod_map->list, &ftrace_mod_maps);
5909 return mod_map;
5912 static const char *
5913 ftrace_func_address_lookup(struct ftrace_mod_map *mod_map,
5914 unsigned long addr, unsigned long *size,
5915 unsigned long *off, char *sym)
5917 struct ftrace_mod_func *found_func = NULL;
5918 struct ftrace_mod_func *mod_func;
5920 list_for_each_entry_rcu(mod_func, &mod_map->funcs, list) {
5921 if (addr >= mod_func->ip &&
5922 addr < mod_func->ip + mod_func->size) {
5923 found_func = mod_func;
5924 break;
5928 if (found_func) {
5929 if (size)
5930 *size = found_func->size;
5931 if (off)
5932 *off = addr - found_func->ip;
5933 if (sym)
5934 strlcpy(sym, found_func->name, KSYM_NAME_LEN);
5936 return found_func->name;
5939 return NULL;
5942 const char *
5943 ftrace_mod_address_lookup(unsigned long addr, unsigned long *size,
5944 unsigned long *off, char **modname, char *sym)
5946 struct ftrace_mod_map *mod_map;
5947 const char *ret = NULL;
5949 /* mod_map is freed via call_rcu() */
5950 preempt_disable();
5951 list_for_each_entry_rcu(mod_map, &ftrace_mod_maps, list) {
5952 ret = ftrace_func_address_lookup(mod_map, addr, size, off, sym);
5953 if (ret) {
5954 if (modname)
5955 *modname = mod_map->mod->name;
5956 break;
5959 preempt_enable();
5961 return ret;
5964 int ftrace_mod_get_kallsym(unsigned int symnum, unsigned long *value,
5965 char *type, char *name,
5966 char *module_name, int *exported)
5968 struct ftrace_mod_map *mod_map;
5969 struct ftrace_mod_func *mod_func;
5971 preempt_disable();
5972 list_for_each_entry_rcu(mod_map, &ftrace_mod_maps, list) {
5974 if (symnum >= mod_map->num_funcs) {
5975 symnum -= mod_map->num_funcs;
5976 continue;
5979 list_for_each_entry_rcu(mod_func, &mod_map->funcs, list) {
5980 if (symnum > 1) {
5981 symnum--;
5982 continue;
5985 *value = mod_func->ip;
5986 *type = 'T';
5987 strlcpy(name, mod_func->name, KSYM_NAME_LEN);
5988 strlcpy(module_name, mod_map->mod->name, MODULE_NAME_LEN);
5989 *exported = 1;
5990 preempt_enable();
5991 return 0;
5993 WARN_ON(1);
5994 break;
5996 preempt_enable();
5997 return -ERANGE;
6000 #else
6001 static void save_ftrace_mod_rec(struct ftrace_mod_map *mod_map,
6002 struct dyn_ftrace *rec) { }
6003 static inline struct ftrace_mod_map *
6004 allocate_ftrace_mod_map(struct module *mod,
6005 unsigned long start, unsigned long end)
6007 return NULL;
6009 #endif /* CONFIG_MODULES */
6011 struct ftrace_init_func {
6012 struct list_head list;
6013 unsigned long ip;
6016 /* Clear any init ips from hashes */
6017 static void
6018 clear_func_from_hash(struct ftrace_init_func *func, struct ftrace_hash *hash)
6020 struct ftrace_func_entry *entry;
6022 if (ftrace_hash_empty(hash))
6023 return;
6025 entry = __ftrace_lookup_ip(hash, func->ip);
6028 * Do not allow this rec to match again.
6029 * Yeah, it may waste some memory, but will be removed
6030 * if/when the hash is modified again.
6032 if (entry)
6033 entry->ip = 0;
6036 static void
6037 clear_func_from_hashes(struct ftrace_init_func *func)
6039 struct trace_array *tr;
6041 mutex_lock(&trace_types_lock);
6042 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
6043 if (!tr->ops || !tr->ops->func_hash)
6044 continue;
6045 mutex_lock(&tr->ops->func_hash->regex_lock);
6046 clear_func_from_hash(func, tr->ops->func_hash->filter_hash);
6047 clear_func_from_hash(func, tr->ops->func_hash->notrace_hash);
6048 mutex_unlock(&tr->ops->func_hash->regex_lock);
6050 mutex_unlock(&trace_types_lock);
6053 static void add_to_clear_hash_list(struct list_head *clear_list,
6054 struct dyn_ftrace *rec)
6056 struct ftrace_init_func *func;
6058 func = kmalloc(sizeof(*func), GFP_KERNEL);
6059 if (!func) {
6060 WARN_ONCE(1, "alloc failure, ftrace filter could be stale\n");
6061 return;
6064 func->ip = rec->ip;
6065 list_add(&func->list, clear_list);
6068 void ftrace_free_mem(struct module *mod, void *start_ptr, void *end_ptr)
6070 unsigned long start = (unsigned long)(start_ptr);
6071 unsigned long end = (unsigned long)(end_ptr);
6072 struct ftrace_page **last_pg = &ftrace_pages_start;
6073 struct ftrace_page *pg;
6074 struct dyn_ftrace *rec;
6075 struct dyn_ftrace key;
6076 struct ftrace_mod_map *mod_map = NULL;
6077 struct ftrace_init_func *func, *func_next;
6078 struct list_head clear_hash;
6079 int order;
6081 INIT_LIST_HEAD(&clear_hash);
6083 key.ip = start;
6084 key.flags = end; /* overload flags, as it is unsigned long */
6086 mutex_lock(&ftrace_lock);
6089 * If we are freeing module init memory, then check if
6090 * any tracer is active. If so, we need to save a mapping of
6091 * the module functions being freed with the address.
6093 if (mod && ftrace_ops_list != &ftrace_list_end)
6094 mod_map = allocate_ftrace_mod_map(mod, start, end);
6096 for (pg = ftrace_pages_start; pg; last_pg = &pg->next, pg = *last_pg) {
6097 if (end < pg->records[0].ip ||
6098 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
6099 continue;
6100 again:
6101 rec = bsearch(&key, pg->records, pg->index,
6102 sizeof(struct dyn_ftrace),
6103 ftrace_cmp_recs);
6104 if (!rec)
6105 continue;
6107 /* rec will be cleared from hashes after ftrace_lock unlock */
6108 add_to_clear_hash_list(&clear_hash, rec);
6110 if (mod_map)
6111 save_ftrace_mod_rec(mod_map, rec);
6113 pg->index--;
6114 ftrace_update_tot_cnt--;
6115 if (!pg->index) {
6116 *last_pg = pg->next;
6117 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
6118 free_pages((unsigned long)pg->records, order);
6119 kfree(pg);
6120 pg = container_of(last_pg, struct ftrace_page, next);
6121 if (!(*last_pg))
6122 ftrace_pages = pg;
6123 continue;
6125 memmove(rec, rec + 1,
6126 (pg->index - (rec - pg->records)) * sizeof(*rec));
6127 /* More than one function may be in this block */
6128 goto again;
6130 mutex_unlock(&ftrace_lock);
6132 list_for_each_entry_safe(func, func_next, &clear_hash, list) {
6133 clear_func_from_hashes(func);
6134 kfree(func);
6138 void __init ftrace_free_init_mem(void)
6140 void *start = (void *)(&__init_begin);
6141 void *end = (void *)(&__init_end);
6143 ftrace_free_mem(NULL, start, end);
6146 void __init ftrace_init(void)
6148 extern unsigned long __start_mcount_loc[];
6149 extern unsigned long __stop_mcount_loc[];
6150 unsigned long count, flags;
6151 int ret;
6153 local_irq_save(flags);
6154 ret = ftrace_dyn_arch_init();
6155 local_irq_restore(flags);
6156 if (ret)
6157 goto failed;
6159 count = __stop_mcount_loc - __start_mcount_loc;
6160 if (!count) {
6161 pr_info("ftrace: No functions to be traced?\n");
6162 goto failed;
6165 pr_info("ftrace: allocating %ld entries in %ld pages\n",
6166 count, count / ENTRIES_PER_PAGE + 1);
6168 last_ftrace_enabled = ftrace_enabled = 1;
6170 ret = ftrace_process_locs(NULL,
6171 __start_mcount_loc,
6172 __stop_mcount_loc);
6174 set_ftrace_early_filters();
6176 return;
6177 failed:
6178 ftrace_disabled = 1;
6181 /* Do nothing if arch does not support this */
6182 void __weak arch_ftrace_update_trampoline(struct ftrace_ops *ops)
6186 static void ftrace_update_trampoline(struct ftrace_ops *ops)
6188 arch_ftrace_update_trampoline(ops);
6191 void ftrace_init_trace_array(struct trace_array *tr)
6193 INIT_LIST_HEAD(&tr->func_probes);
6194 INIT_LIST_HEAD(&tr->mod_trace);
6195 INIT_LIST_HEAD(&tr->mod_notrace);
6197 #else
6199 struct ftrace_ops global_ops = {
6200 .func = ftrace_stub,
6201 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
6202 FTRACE_OPS_FL_INITIALIZED |
6203 FTRACE_OPS_FL_PID,
6206 static int __init ftrace_nodyn_init(void)
6208 ftrace_enabled = 1;
6209 return 0;
6211 core_initcall(ftrace_nodyn_init);
6213 static inline int ftrace_init_dyn_tracefs(struct dentry *d_tracer) { return 0; }
6214 static inline void ftrace_startup_enable(int command) { }
6215 static inline void ftrace_startup_all(int command) { }
6217 # define ftrace_startup_sysctl() do { } while (0)
6218 # define ftrace_shutdown_sysctl() do { } while (0)
6220 static void ftrace_update_trampoline(struct ftrace_ops *ops)
6224 #endif /* CONFIG_DYNAMIC_FTRACE */
6226 __init void ftrace_init_global_array_ops(struct trace_array *tr)
6228 tr->ops = &global_ops;
6229 tr->ops->private = tr;
6230 ftrace_init_trace_array(tr);
6233 void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
6235 /* If we filter on pids, update to use the pid function */
6236 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
6237 if (WARN_ON(tr->ops->func != ftrace_stub))
6238 printk("ftrace ops had %pS for function\n",
6239 tr->ops->func);
6241 tr->ops->func = func;
6242 tr->ops->private = tr;
6245 void ftrace_reset_array_ops(struct trace_array *tr)
6247 tr->ops->func = ftrace_stub;
6250 static nokprobe_inline void
6251 __ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
6252 struct ftrace_ops *ignored, struct pt_regs *regs)
6254 struct ftrace_ops *op;
6255 int bit;
6257 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
6258 if (bit < 0)
6259 return;
6262 * Some of the ops may be dynamically allocated,
6263 * they must be freed after a synchronize_rcu().
6265 preempt_disable_notrace();
6267 do_for_each_ftrace_op(op, ftrace_ops_list) {
6268 /* Stub functions don't need to be called nor tested */
6269 if (op->flags & FTRACE_OPS_FL_STUB)
6270 continue;
6272 * Check the following for each ops before calling their func:
6273 * if RCU flag is set, then rcu_is_watching() must be true
6274 * if PER_CPU is set, then ftrace_function_local_disable()
6275 * must be false
6276 * Otherwise test if the ip matches the ops filter
6278 * If any of the above fails then the op->func() is not executed.
6280 if ((!(op->flags & FTRACE_OPS_FL_RCU) || rcu_is_watching()) &&
6281 ftrace_ops_test(op, ip, regs)) {
6282 if (FTRACE_WARN_ON(!op->func)) {
6283 pr_warn("op=%p %pS\n", op, op);
6284 goto out;
6286 op->func(ip, parent_ip, op, regs);
6288 } while_for_each_ftrace_op(op);
6289 out:
6290 preempt_enable_notrace();
6291 trace_clear_recursion(bit);
6295 * Some archs only support passing ip and parent_ip. Even though
6296 * the list function ignores the op parameter, we do not want any
6297 * C side effects, where a function is called without the caller
6298 * sending a third parameter.
6299 * Archs are to support both the regs and ftrace_ops at the same time.
6300 * If they support ftrace_ops, it is assumed they support regs.
6301 * If call backs want to use regs, they must either check for regs
6302 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
6303 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
6304 * An architecture can pass partial regs with ftrace_ops and still
6305 * set the ARCH_SUPPORTS_FTRACE_OPS.
6307 #if ARCH_SUPPORTS_FTRACE_OPS
6308 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
6309 struct ftrace_ops *op, struct pt_regs *regs)
6311 __ftrace_ops_list_func(ip, parent_ip, NULL, regs);
6313 NOKPROBE_SYMBOL(ftrace_ops_list_func);
6314 #else
6315 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip)
6317 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
6319 NOKPROBE_SYMBOL(ftrace_ops_no_ops);
6320 #endif
6323 * If there's only one function registered but it does not support
6324 * recursion, needs RCU protection and/or requires per cpu handling, then
6325 * this function will be called by the mcount trampoline.
6327 static void ftrace_ops_assist_func(unsigned long ip, unsigned long parent_ip,
6328 struct ftrace_ops *op, struct pt_regs *regs)
6330 int bit;
6332 if ((op->flags & FTRACE_OPS_FL_RCU) && !rcu_is_watching())
6333 return;
6335 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
6336 if (bit < 0)
6337 return;
6339 preempt_disable_notrace();
6341 op->func(ip, parent_ip, op, regs);
6343 preempt_enable_notrace();
6344 trace_clear_recursion(bit);
6346 NOKPROBE_SYMBOL(ftrace_ops_assist_func);
6349 * ftrace_ops_get_func - get the function a trampoline should call
6350 * @ops: the ops to get the function for
6352 * Normally the mcount trampoline will call the ops->func, but there
6353 * are times that it should not. For example, if the ops does not
6354 * have its own recursion protection, then it should call the
6355 * ftrace_ops_assist_func() instead.
6357 * Returns the function that the trampoline should call for @ops.
6359 ftrace_func_t ftrace_ops_get_func(struct ftrace_ops *ops)
6362 * If the function does not handle recursion, needs to be RCU safe,
6363 * or does per cpu logic, then we need to call the assist handler.
6365 if (!(ops->flags & FTRACE_OPS_FL_RECURSION_SAFE) ||
6366 ops->flags & FTRACE_OPS_FL_RCU)
6367 return ftrace_ops_assist_func;
6369 return ops->func;
6372 static void
6373 ftrace_filter_pid_sched_switch_probe(void *data, bool preempt,
6374 struct task_struct *prev, struct task_struct *next)
6376 struct trace_array *tr = data;
6377 struct trace_pid_list *pid_list;
6379 pid_list = rcu_dereference_sched(tr->function_pids);
6381 this_cpu_write(tr->trace_buffer.data->ftrace_ignore_pid,
6382 trace_ignore_this_task(pid_list, next));
6385 static void
6386 ftrace_pid_follow_sched_process_fork(void *data,
6387 struct task_struct *self,
6388 struct task_struct *task)
6390 struct trace_pid_list *pid_list;
6391 struct trace_array *tr = data;
6393 pid_list = rcu_dereference_sched(tr->function_pids);
6394 trace_filter_add_remove_task(pid_list, self, task);
6397 static void
6398 ftrace_pid_follow_sched_process_exit(void *data, struct task_struct *task)
6400 struct trace_pid_list *pid_list;
6401 struct trace_array *tr = data;
6403 pid_list = rcu_dereference_sched(tr->function_pids);
6404 trace_filter_add_remove_task(pid_list, NULL, task);
6407 void ftrace_pid_follow_fork(struct trace_array *tr, bool enable)
6409 if (enable) {
6410 register_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
6411 tr);
6412 register_trace_sched_process_exit(ftrace_pid_follow_sched_process_exit,
6413 tr);
6414 } else {
6415 unregister_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
6416 tr);
6417 unregister_trace_sched_process_exit(ftrace_pid_follow_sched_process_exit,
6418 tr);
6422 static void clear_ftrace_pids(struct trace_array *tr)
6424 struct trace_pid_list *pid_list;
6425 int cpu;
6427 pid_list = rcu_dereference_protected(tr->function_pids,
6428 lockdep_is_held(&ftrace_lock));
6429 if (!pid_list)
6430 return;
6432 unregister_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
6434 for_each_possible_cpu(cpu)
6435 per_cpu_ptr(tr->trace_buffer.data, cpu)->ftrace_ignore_pid = false;
6437 rcu_assign_pointer(tr->function_pids, NULL);
6439 /* Wait till all users are no longer using pid filtering */
6440 synchronize_rcu();
6442 trace_free_pid_list(pid_list);
6445 void ftrace_clear_pids(struct trace_array *tr)
6447 mutex_lock(&ftrace_lock);
6449 clear_ftrace_pids(tr);
6451 mutex_unlock(&ftrace_lock);
6454 static void ftrace_pid_reset(struct trace_array *tr)
6456 mutex_lock(&ftrace_lock);
6457 clear_ftrace_pids(tr);
6459 ftrace_update_pid_func();
6460 ftrace_startup_all(0);
6462 mutex_unlock(&ftrace_lock);
6465 /* Greater than any max PID */
6466 #define FTRACE_NO_PIDS (void *)(PID_MAX_LIMIT + 1)
6468 static void *fpid_start(struct seq_file *m, loff_t *pos)
6469 __acquires(RCU)
6471 struct trace_pid_list *pid_list;
6472 struct trace_array *tr = m->private;
6474 mutex_lock(&ftrace_lock);
6475 rcu_read_lock_sched();
6477 pid_list = rcu_dereference_sched(tr->function_pids);
6479 if (!pid_list)
6480 return !(*pos) ? FTRACE_NO_PIDS : NULL;
6482 return trace_pid_start(pid_list, pos);
6485 static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
6487 struct trace_array *tr = m->private;
6488 struct trace_pid_list *pid_list = rcu_dereference_sched(tr->function_pids);
6490 if (v == FTRACE_NO_PIDS)
6491 return NULL;
6493 return trace_pid_next(pid_list, v, pos);
6496 static void fpid_stop(struct seq_file *m, void *p)
6497 __releases(RCU)
6499 rcu_read_unlock_sched();
6500 mutex_unlock(&ftrace_lock);
6503 static int fpid_show(struct seq_file *m, void *v)
6505 if (v == FTRACE_NO_PIDS) {
6506 seq_puts(m, "no pid\n");
6507 return 0;
6510 return trace_pid_show(m, v);
6513 static const struct seq_operations ftrace_pid_sops = {
6514 .start = fpid_start,
6515 .next = fpid_next,
6516 .stop = fpid_stop,
6517 .show = fpid_show,
6520 static int
6521 ftrace_pid_open(struct inode *inode, struct file *file)
6523 struct trace_array *tr = inode->i_private;
6524 struct seq_file *m;
6525 int ret = 0;
6527 if (trace_array_get(tr) < 0)
6528 return -ENODEV;
6530 if ((file->f_mode & FMODE_WRITE) &&
6531 (file->f_flags & O_TRUNC))
6532 ftrace_pid_reset(tr);
6534 ret = seq_open(file, &ftrace_pid_sops);
6535 if (ret < 0) {
6536 trace_array_put(tr);
6537 } else {
6538 m = file->private_data;
6539 /* copy tr over to seq ops */
6540 m->private = tr;
6543 return ret;
6546 static void ignore_task_cpu(void *data)
6548 struct trace_array *tr = data;
6549 struct trace_pid_list *pid_list;
6552 * This function is called by on_each_cpu() while the
6553 * event_mutex is held.
6555 pid_list = rcu_dereference_protected(tr->function_pids,
6556 mutex_is_locked(&ftrace_lock));
6558 this_cpu_write(tr->trace_buffer.data->ftrace_ignore_pid,
6559 trace_ignore_this_task(pid_list, current));
6562 static ssize_t
6563 ftrace_pid_write(struct file *filp, const char __user *ubuf,
6564 size_t cnt, loff_t *ppos)
6566 struct seq_file *m = filp->private_data;
6567 struct trace_array *tr = m->private;
6568 struct trace_pid_list *filtered_pids = NULL;
6569 struct trace_pid_list *pid_list;
6570 ssize_t ret;
6572 if (!cnt)
6573 return 0;
6575 mutex_lock(&ftrace_lock);
6577 filtered_pids = rcu_dereference_protected(tr->function_pids,
6578 lockdep_is_held(&ftrace_lock));
6580 ret = trace_pid_write(filtered_pids, &pid_list, ubuf, cnt);
6581 if (ret < 0)
6582 goto out;
6584 rcu_assign_pointer(tr->function_pids, pid_list);
6586 if (filtered_pids) {
6587 synchronize_rcu();
6588 trace_free_pid_list(filtered_pids);
6589 } else if (pid_list) {
6590 /* Register a probe to set whether to ignore the tracing of a task */
6591 register_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
6595 * Ignoring of pids is done at task switch. But we have to
6596 * check for those tasks that are currently running.
6597 * Always do this in case a pid was appended or removed.
6599 on_each_cpu(ignore_task_cpu, tr, 1);
6601 ftrace_update_pid_func();
6602 ftrace_startup_all(0);
6603 out:
6604 mutex_unlock(&ftrace_lock);
6606 if (ret > 0)
6607 *ppos += ret;
6609 return ret;
6612 static int
6613 ftrace_pid_release(struct inode *inode, struct file *file)
6615 struct trace_array *tr = inode->i_private;
6617 trace_array_put(tr);
6619 return seq_release(inode, file);
6622 static const struct file_operations ftrace_pid_fops = {
6623 .open = ftrace_pid_open,
6624 .write = ftrace_pid_write,
6625 .read = seq_read,
6626 .llseek = tracing_lseek,
6627 .release = ftrace_pid_release,
6630 void ftrace_init_tracefs(struct trace_array *tr, struct dentry *d_tracer)
6632 trace_create_file("set_ftrace_pid", 0644, d_tracer,
6633 tr, &ftrace_pid_fops);
6636 void __init ftrace_init_tracefs_toplevel(struct trace_array *tr,
6637 struct dentry *d_tracer)
6639 /* Only the top level directory has the dyn_tracefs and profile */
6640 WARN_ON(!(tr->flags & TRACE_ARRAY_FL_GLOBAL));
6642 ftrace_init_dyn_tracefs(d_tracer);
6643 ftrace_profile_tracefs(d_tracer);
6647 * ftrace_kill - kill ftrace
6649 * This function should be used by panic code. It stops ftrace
6650 * but in a not so nice way. If you need to simply kill ftrace
6651 * from a non-atomic section, use ftrace_kill.
6653 void ftrace_kill(void)
6655 ftrace_disabled = 1;
6656 ftrace_enabled = 0;
6657 ftrace_trace_function = ftrace_stub;
6661 * Test if ftrace is dead or not.
6663 int ftrace_is_dead(void)
6665 return ftrace_disabled;
6669 * register_ftrace_function - register a function for profiling
6670 * @ops - ops structure that holds the function for profiling.
6672 * Register a function to be called by all functions in the
6673 * kernel.
6675 * Note: @ops->func and all the functions it calls must be labeled
6676 * with "notrace", otherwise it will go into a
6677 * recursive loop.
6679 int register_ftrace_function(struct ftrace_ops *ops)
6681 int ret = -1;
6683 ftrace_ops_init(ops);
6685 mutex_lock(&ftrace_lock);
6687 ret = ftrace_startup(ops, 0);
6689 mutex_unlock(&ftrace_lock);
6691 return ret;
6693 EXPORT_SYMBOL_GPL(register_ftrace_function);
6696 * unregister_ftrace_function - unregister a function for profiling.
6697 * @ops - ops structure that holds the function to unregister
6699 * Unregister a function that was added to be called by ftrace profiling.
6701 int unregister_ftrace_function(struct ftrace_ops *ops)
6703 int ret;
6705 mutex_lock(&ftrace_lock);
6706 ret = ftrace_shutdown(ops, 0);
6707 mutex_unlock(&ftrace_lock);
6709 return ret;
6711 EXPORT_SYMBOL_GPL(unregister_ftrace_function);
6714 ftrace_enable_sysctl(struct ctl_table *table, int write,
6715 void __user *buffer, size_t *lenp,
6716 loff_t *ppos)
6718 int ret = -ENODEV;
6720 mutex_lock(&ftrace_lock);
6722 if (unlikely(ftrace_disabled))
6723 goto out;
6725 ret = proc_dointvec(table, write, buffer, lenp, ppos);
6727 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
6728 goto out;
6730 last_ftrace_enabled = !!ftrace_enabled;
6732 if (ftrace_enabled) {
6734 /* we are starting ftrace again */
6735 if (rcu_dereference_protected(ftrace_ops_list,
6736 lockdep_is_held(&ftrace_lock)) != &ftrace_list_end)
6737 update_ftrace_function();
6739 ftrace_startup_sysctl();
6741 } else {
6742 /* stopping ftrace calls (just send to ftrace_stub) */
6743 ftrace_trace_function = ftrace_stub;
6745 ftrace_shutdown_sysctl();
6748 out:
6749 mutex_unlock(&ftrace_lock);
6750 return ret;