irqdomain: Allow domain lookup with DOMAIN_BUS_WIRED token
[linux/fpc-iii.git] / kernel / trace / ftrace.c
blob3f743b147247034e6a794f7cf47176a2c6a44ece
1 /*
2 * Infrastructure for profiling code inserted by 'gcc -pg'.
4 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
5 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
7 * Originally ported from the -rt patch by:
8 * Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
10 * Based on code in the latency_tracer, that is:
12 * Copyright (C) 2004-2006 Ingo Molnar
13 * Copyright (C) 2004 Nadia Yvette Chambers
16 #include <linux/stop_machine.h>
17 #include <linux/clocksource.h>
18 #include <linux/kallsyms.h>
19 #include <linux/seq_file.h>
20 #include <linux/suspend.h>
21 #include <linux/tracefs.h>
22 #include <linux/hardirq.h>
23 #include <linux/kthread.h>
24 #include <linux/uaccess.h>
25 #include <linux/bsearch.h>
26 #include <linux/module.h>
27 #include <linux/ftrace.h>
28 #include <linux/sysctl.h>
29 #include <linux/slab.h>
30 #include <linux/ctype.h>
31 #include <linux/sort.h>
32 #include <linux/list.h>
33 #include <linux/hash.h>
34 #include <linux/rcupdate.h>
36 #include <trace/events/sched.h>
38 #include <asm/setup.h>
40 #include "trace_output.h"
41 #include "trace_stat.h"
43 #define FTRACE_WARN_ON(cond) \
44 ({ \
45 int ___r = cond; \
46 if (WARN_ON(___r)) \
47 ftrace_kill(); \
48 ___r; \
51 #define FTRACE_WARN_ON_ONCE(cond) \
52 ({ \
53 int ___r = cond; \
54 if (WARN_ON_ONCE(___r)) \
55 ftrace_kill(); \
56 ___r; \
59 /* hash bits for specific function selection */
60 #define FTRACE_HASH_BITS 7
61 #define FTRACE_FUNC_HASHSIZE (1 << FTRACE_HASH_BITS)
62 #define FTRACE_HASH_DEFAULT_BITS 10
63 #define FTRACE_HASH_MAX_BITS 12
65 #define FL_GLOBAL_CONTROL_MASK (FTRACE_OPS_FL_CONTROL)
67 #ifdef CONFIG_DYNAMIC_FTRACE
68 #define INIT_OPS_HASH(opsname) \
69 .func_hash = &opsname.local_hash, \
70 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
71 #define ASSIGN_OPS_HASH(opsname, val) \
72 .func_hash = val, \
73 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
74 #else
75 #define INIT_OPS_HASH(opsname)
76 #define ASSIGN_OPS_HASH(opsname, val)
77 #endif
79 static struct ftrace_ops ftrace_list_end __read_mostly = {
80 .func = ftrace_stub,
81 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_STUB,
82 INIT_OPS_HASH(ftrace_list_end)
85 /* ftrace_enabled is a method to turn ftrace on or off */
86 int ftrace_enabled __read_mostly;
87 static int last_ftrace_enabled;
89 /* Current function tracing op */
90 struct ftrace_ops *function_trace_op __read_mostly = &ftrace_list_end;
91 /* What to set function_trace_op to */
92 static struct ftrace_ops *set_function_trace_op;
94 /* List for set_ftrace_pid's pids. */
95 LIST_HEAD(ftrace_pids);
96 struct ftrace_pid {
97 struct list_head list;
98 struct pid *pid;
101 static bool ftrace_pids_enabled(void)
103 return !list_empty(&ftrace_pids);
106 static void ftrace_update_trampoline(struct ftrace_ops *ops);
109 * ftrace_disabled is set when an anomaly is discovered.
110 * ftrace_disabled is much stronger than ftrace_enabled.
112 static int ftrace_disabled __read_mostly;
114 static DEFINE_MUTEX(ftrace_lock);
116 static struct ftrace_ops *ftrace_control_list __read_mostly = &ftrace_list_end;
117 static struct ftrace_ops *ftrace_ops_list __read_mostly = &ftrace_list_end;
118 ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
119 static struct ftrace_ops global_ops;
120 static struct ftrace_ops control_ops;
122 static void ftrace_ops_recurs_func(unsigned long ip, unsigned long parent_ip,
123 struct ftrace_ops *op, struct pt_regs *regs);
125 #if ARCH_SUPPORTS_FTRACE_OPS
126 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
127 struct ftrace_ops *op, struct pt_regs *regs);
128 #else
129 /* See comment below, where ftrace_ops_list_func is defined */
130 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip);
131 #define ftrace_ops_list_func ((ftrace_func_t)ftrace_ops_no_ops)
132 #endif
135 * Traverse the ftrace_global_list, invoking all entries. The reason that we
136 * can use rcu_dereference_raw_notrace() is that elements removed from this list
137 * are simply leaked, so there is no need to interact with a grace-period
138 * mechanism. The rcu_dereference_raw_notrace() calls are needed to handle
139 * concurrent insertions into the ftrace_global_list.
141 * Silly Alpha and silly pointer-speculation compiler optimizations!
143 #define do_for_each_ftrace_op(op, list) \
144 op = rcu_dereference_raw_notrace(list); \
148 * Optimized for just a single item in the list (as that is the normal case).
150 #define while_for_each_ftrace_op(op) \
151 while (likely(op = rcu_dereference_raw_notrace((op)->next)) && \
152 unlikely((op) != &ftrace_list_end))
154 static inline void ftrace_ops_init(struct ftrace_ops *ops)
156 #ifdef CONFIG_DYNAMIC_FTRACE
157 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED)) {
158 mutex_init(&ops->local_hash.regex_lock);
159 ops->func_hash = &ops->local_hash;
160 ops->flags |= FTRACE_OPS_FL_INITIALIZED;
162 #endif
166 * ftrace_nr_registered_ops - return number of ops registered
168 * Returns the number of ftrace_ops registered and tracing functions
170 int ftrace_nr_registered_ops(void)
172 struct ftrace_ops *ops;
173 int cnt = 0;
175 mutex_lock(&ftrace_lock);
177 for (ops = ftrace_ops_list;
178 ops != &ftrace_list_end; ops = ops->next)
179 cnt++;
181 mutex_unlock(&ftrace_lock);
183 return cnt;
186 static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip,
187 struct ftrace_ops *op, struct pt_regs *regs)
189 if (!test_tsk_trace_trace(current))
190 return;
192 op->saved_func(ip, parent_ip, op, regs);
196 * clear_ftrace_function - reset the ftrace function
198 * This NULLs the ftrace function and in essence stops
199 * tracing. There may be lag
201 void clear_ftrace_function(void)
203 ftrace_trace_function = ftrace_stub;
206 static void control_ops_disable_all(struct ftrace_ops *ops)
208 int cpu;
210 for_each_possible_cpu(cpu)
211 *per_cpu_ptr(ops->disabled, cpu) = 1;
214 static int control_ops_alloc(struct ftrace_ops *ops)
216 int __percpu *disabled;
218 disabled = alloc_percpu(int);
219 if (!disabled)
220 return -ENOMEM;
222 ops->disabled = disabled;
223 control_ops_disable_all(ops);
224 return 0;
227 static void ftrace_sync(struct work_struct *work)
230 * This function is just a stub to implement a hard force
231 * of synchronize_sched(). This requires synchronizing
232 * tasks even in userspace and idle.
234 * Yes, function tracing is rude.
238 static void ftrace_sync_ipi(void *data)
240 /* Probably not needed, but do it anyway */
241 smp_rmb();
244 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
245 static void update_function_graph_func(void);
247 /* Both enabled by default (can be cleared by function_graph tracer flags */
248 static bool fgraph_sleep_time = true;
249 static bool fgraph_graph_time = true;
251 #else
252 static inline void update_function_graph_func(void) { }
253 #endif
256 static ftrace_func_t ftrace_ops_get_list_func(struct ftrace_ops *ops)
259 * If this is a dynamic ops or we force list func,
260 * then it needs to call the list anyway.
262 if (ops->flags & FTRACE_OPS_FL_DYNAMIC || FTRACE_FORCE_LIST_FUNC)
263 return ftrace_ops_list_func;
265 return ftrace_ops_get_func(ops);
268 static void update_ftrace_function(void)
270 ftrace_func_t func;
273 * Prepare the ftrace_ops that the arch callback will use.
274 * If there's only one ftrace_ops registered, the ftrace_ops_list
275 * will point to the ops we want.
277 set_function_trace_op = ftrace_ops_list;
279 /* If there's no ftrace_ops registered, just call the stub function */
280 if (ftrace_ops_list == &ftrace_list_end) {
281 func = ftrace_stub;
284 * If we are at the end of the list and this ops is
285 * recursion safe and not dynamic and the arch supports passing ops,
286 * then have the mcount trampoline call the function directly.
288 } else if (ftrace_ops_list->next == &ftrace_list_end) {
289 func = ftrace_ops_get_list_func(ftrace_ops_list);
291 } else {
292 /* Just use the default ftrace_ops */
293 set_function_trace_op = &ftrace_list_end;
294 func = ftrace_ops_list_func;
297 update_function_graph_func();
299 /* If there's no change, then do nothing more here */
300 if (ftrace_trace_function == func)
301 return;
304 * If we are using the list function, it doesn't care
305 * about the function_trace_ops.
307 if (func == ftrace_ops_list_func) {
308 ftrace_trace_function = func;
310 * Don't even bother setting function_trace_ops,
311 * it would be racy to do so anyway.
313 return;
316 #ifndef CONFIG_DYNAMIC_FTRACE
318 * For static tracing, we need to be a bit more careful.
319 * The function change takes affect immediately. Thus,
320 * we need to coorditate the setting of the function_trace_ops
321 * with the setting of the ftrace_trace_function.
323 * Set the function to the list ops, which will call the
324 * function we want, albeit indirectly, but it handles the
325 * ftrace_ops and doesn't depend on function_trace_op.
327 ftrace_trace_function = ftrace_ops_list_func;
329 * Make sure all CPUs see this. Yes this is slow, but static
330 * tracing is slow and nasty to have enabled.
332 schedule_on_each_cpu(ftrace_sync);
333 /* Now all cpus are using the list ops. */
334 function_trace_op = set_function_trace_op;
335 /* Make sure the function_trace_op is visible on all CPUs */
336 smp_wmb();
337 /* Nasty way to force a rmb on all cpus */
338 smp_call_function(ftrace_sync_ipi, NULL, 1);
339 /* OK, we are all set to update the ftrace_trace_function now! */
340 #endif /* !CONFIG_DYNAMIC_FTRACE */
342 ftrace_trace_function = func;
345 int using_ftrace_ops_list_func(void)
347 return ftrace_trace_function == ftrace_ops_list_func;
350 static void add_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
352 ops->next = *list;
354 * We are entering ops into the list but another
355 * CPU might be walking that list. We need to make sure
356 * the ops->next pointer is valid before another CPU sees
357 * the ops pointer included into the list.
359 rcu_assign_pointer(*list, ops);
362 static int remove_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
364 struct ftrace_ops **p;
367 * If we are removing the last function, then simply point
368 * to the ftrace_stub.
370 if (*list == ops && ops->next == &ftrace_list_end) {
371 *list = &ftrace_list_end;
372 return 0;
375 for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
376 if (*p == ops)
377 break;
379 if (*p != ops)
380 return -1;
382 *p = (*p)->next;
383 return 0;
386 static void add_ftrace_list_ops(struct ftrace_ops **list,
387 struct ftrace_ops *main_ops,
388 struct ftrace_ops *ops)
390 int first = *list == &ftrace_list_end;
391 add_ftrace_ops(list, ops);
392 if (first)
393 add_ftrace_ops(&ftrace_ops_list, main_ops);
396 static int remove_ftrace_list_ops(struct ftrace_ops **list,
397 struct ftrace_ops *main_ops,
398 struct ftrace_ops *ops)
400 int ret = remove_ftrace_ops(list, ops);
401 if (!ret && *list == &ftrace_list_end)
402 ret = remove_ftrace_ops(&ftrace_ops_list, main_ops);
403 return ret;
406 static void ftrace_update_trampoline(struct ftrace_ops *ops);
408 static int __register_ftrace_function(struct ftrace_ops *ops)
410 if (ops->flags & FTRACE_OPS_FL_DELETED)
411 return -EINVAL;
413 if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
414 return -EBUSY;
416 #ifndef CONFIG_DYNAMIC_FTRACE_WITH_REGS
418 * If the ftrace_ops specifies SAVE_REGS, then it only can be used
419 * if the arch supports it, or SAVE_REGS_IF_SUPPORTED is also set.
420 * Setting SAVE_REGS_IF_SUPPORTED makes SAVE_REGS irrelevant.
422 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS &&
423 !(ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED))
424 return -EINVAL;
426 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED)
427 ops->flags |= FTRACE_OPS_FL_SAVE_REGS;
428 #endif
430 if (!core_kernel_data((unsigned long)ops))
431 ops->flags |= FTRACE_OPS_FL_DYNAMIC;
433 if (ops->flags & FTRACE_OPS_FL_CONTROL) {
434 if (control_ops_alloc(ops))
435 return -ENOMEM;
436 add_ftrace_list_ops(&ftrace_control_list, &control_ops, ops);
437 /* The control_ops needs the trampoline update */
438 ops = &control_ops;
439 } else
440 add_ftrace_ops(&ftrace_ops_list, ops);
442 /* Always save the function, and reset at unregistering */
443 ops->saved_func = ops->func;
445 if (ops->flags & FTRACE_OPS_FL_PID && ftrace_pids_enabled())
446 ops->func = ftrace_pid_func;
448 ftrace_update_trampoline(ops);
450 if (ftrace_enabled)
451 update_ftrace_function();
453 return 0;
456 static int __unregister_ftrace_function(struct ftrace_ops *ops)
458 int ret;
460 if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
461 return -EBUSY;
463 if (ops->flags & FTRACE_OPS_FL_CONTROL) {
464 ret = remove_ftrace_list_ops(&ftrace_control_list,
465 &control_ops, ops);
466 } else
467 ret = remove_ftrace_ops(&ftrace_ops_list, ops);
469 if (ret < 0)
470 return ret;
472 if (ftrace_enabled)
473 update_ftrace_function();
475 ops->func = ops->saved_func;
477 return 0;
480 static void ftrace_update_pid_func(void)
482 bool enabled = ftrace_pids_enabled();
483 struct ftrace_ops *op;
485 /* Only do something if we are tracing something */
486 if (ftrace_trace_function == ftrace_stub)
487 return;
489 do_for_each_ftrace_op(op, ftrace_ops_list) {
490 if (op->flags & FTRACE_OPS_FL_PID) {
491 op->func = enabled ? ftrace_pid_func :
492 op->saved_func;
493 ftrace_update_trampoline(op);
495 } while_for_each_ftrace_op(op);
497 update_ftrace_function();
500 #ifdef CONFIG_FUNCTION_PROFILER
501 struct ftrace_profile {
502 struct hlist_node node;
503 unsigned long ip;
504 unsigned long counter;
505 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
506 unsigned long long time;
507 unsigned long long time_squared;
508 #endif
511 struct ftrace_profile_page {
512 struct ftrace_profile_page *next;
513 unsigned long index;
514 struct ftrace_profile records[];
517 struct ftrace_profile_stat {
518 atomic_t disabled;
519 struct hlist_head *hash;
520 struct ftrace_profile_page *pages;
521 struct ftrace_profile_page *start;
522 struct tracer_stat stat;
525 #define PROFILE_RECORDS_SIZE \
526 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
528 #define PROFILES_PER_PAGE \
529 (PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
531 static int ftrace_profile_enabled __read_mostly;
533 /* ftrace_profile_lock - synchronize the enable and disable of the profiler */
534 static DEFINE_MUTEX(ftrace_profile_lock);
536 static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
538 #define FTRACE_PROFILE_HASH_BITS 10
539 #define FTRACE_PROFILE_HASH_SIZE (1 << FTRACE_PROFILE_HASH_BITS)
541 static void *
542 function_stat_next(void *v, int idx)
544 struct ftrace_profile *rec = v;
545 struct ftrace_profile_page *pg;
547 pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
549 again:
550 if (idx != 0)
551 rec++;
553 if ((void *)rec >= (void *)&pg->records[pg->index]) {
554 pg = pg->next;
555 if (!pg)
556 return NULL;
557 rec = &pg->records[0];
558 if (!rec->counter)
559 goto again;
562 return rec;
565 static void *function_stat_start(struct tracer_stat *trace)
567 struct ftrace_profile_stat *stat =
568 container_of(trace, struct ftrace_profile_stat, stat);
570 if (!stat || !stat->start)
571 return NULL;
573 return function_stat_next(&stat->start->records[0], 0);
576 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
577 /* function graph compares on total time */
578 static int function_stat_cmp(void *p1, void *p2)
580 struct ftrace_profile *a = p1;
581 struct ftrace_profile *b = p2;
583 if (a->time < b->time)
584 return -1;
585 if (a->time > b->time)
586 return 1;
587 else
588 return 0;
590 #else
591 /* not function graph compares against hits */
592 static int function_stat_cmp(void *p1, void *p2)
594 struct ftrace_profile *a = p1;
595 struct ftrace_profile *b = p2;
597 if (a->counter < b->counter)
598 return -1;
599 if (a->counter > b->counter)
600 return 1;
601 else
602 return 0;
604 #endif
606 static int function_stat_headers(struct seq_file *m)
608 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
609 seq_puts(m, " Function "
610 "Hit Time Avg s^2\n"
611 " -------- "
612 "--- ---- --- ---\n");
613 #else
614 seq_puts(m, " Function Hit\n"
615 " -------- ---\n");
616 #endif
617 return 0;
620 static int function_stat_show(struct seq_file *m, void *v)
622 struct ftrace_profile *rec = v;
623 char str[KSYM_SYMBOL_LEN];
624 int ret = 0;
625 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
626 static struct trace_seq s;
627 unsigned long long avg;
628 unsigned long long stddev;
629 #endif
630 mutex_lock(&ftrace_profile_lock);
632 /* we raced with function_profile_reset() */
633 if (unlikely(rec->counter == 0)) {
634 ret = -EBUSY;
635 goto out;
638 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
639 avg = rec->time;
640 do_div(avg, rec->counter);
641 if (tracing_thresh && (avg < tracing_thresh))
642 goto out;
643 #endif
645 kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
646 seq_printf(m, " %-30.30s %10lu", str, rec->counter);
648 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
649 seq_puts(m, " ");
651 /* Sample standard deviation (s^2) */
652 if (rec->counter <= 1)
653 stddev = 0;
654 else {
656 * Apply Welford's method:
657 * s^2 = 1 / (n * (n-1)) * (n * \Sum (x_i)^2 - (\Sum x_i)^2)
659 stddev = rec->counter * rec->time_squared -
660 rec->time * rec->time;
663 * Divide only 1000 for ns^2 -> us^2 conversion.
664 * trace_print_graph_duration will divide 1000 again.
666 do_div(stddev, rec->counter * (rec->counter - 1) * 1000);
669 trace_seq_init(&s);
670 trace_print_graph_duration(rec->time, &s);
671 trace_seq_puts(&s, " ");
672 trace_print_graph_duration(avg, &s);
673 trace_seq_puts(&s, " ");
674 trace_print_graph_duration(stddev, &s);
675 trace_print_seq(m, &s);
676 #endif
677 seq_putc(m, '\n');
678 out:
679 mutex_unlock(&ftrace_profile_lock);
681 return ret;
684 static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
686 struct ftrace_profile_page *pg;
688 pg = stat->pages = stat->start;
690 while (pg) {
691 memset(pg->records, 0, PROFILE_RECORDS_SIZE);
692 pg->index = 0;
693 pg = pg->next;
696 memset(stat->hash, 0,
697 FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
700 int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
702 struct ftrace_profile_page *pg;
703 int functions;
704 int pages;
705 int i;
707 /* If we already allocated, do nothing */
708 if (stat->pages)
709 return 0;
711 stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
712 if (!stat->pages)
713 return -ENOMEM;
715 #ifdef CONFIG_DYNAMIC_FTRACE
716 functions = ftrace_update_tot_cnt;
717 #else
719 * We do not know the number of functions that exist because
720 * dynamic tracing is what counts them. With past experience
721 * we have around 20K functions. That should be more than enough.
722 * It is highly unlikely we will execute every function in
723 * the kernel.
725 functions = 20000;
726 #endif
728 pg = stat->start = stat->pages;
730 pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);
732 for (i = 1; i < pages; i++) {
733 pg->next = (void *)get_zeroed_page(GFP_KERNEL);
734 if (!pg->next)
735 goto out_free;
736 pg = pg->next;
739 return 0;
741 out_free:
742 pg = stat->start;
743 while (pg) {
744 unsigned long tmp = (unsigned long)pg;
746 pg = pg->next;
747 free_page(tmp);
750 stat->pages = NULL;
751 stat->start = NULL;
753 return -ENOMEM;
756 static int ftrace_profile_init_cpu(int cpu)
758 struct ftrace_profile_stat *stat;
759 int size;
761 stat = &per_cpu(ftrace_profile_stats, cpu);
763 if (stat->hash) {
764 /* If the profile is already created, simply reset it */
765 ftrace_profile_reset(stat);
766 return 0;
770 * We are profiling all functions, but usually only a few thousand
771 * functions are hit. We'll make a hash of 1024 items.
773 size = FTRACE_PROFILE_HASH_SIZE;
775 stat->hash = kzalloc(sizeof(struct hlist_head) * size, GFP_KERNEL);
777 if (!stat->hash)
778 return -ENOMEM;
780 /* Preallocate the function profiling pages */
781 if (ftrace_profile_pages_init(stat) < 0) {
782 kfree(stat->hash);
783 stat->hash = NULL;
784 return -ENOMEM;
787 return 0;
790 static int ftrace_profile_init(void)
792 int cpu;
793 int ret = 0;
795 for_each_possible_cpu(cpu) {
796 ret = ftrace_profile_init_cpu(cpu);
797 if (ret)
798 break;
801 return ret;
804 /* interrupts must be disabled */
805 static struct ftrace_profile *
806 ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
808 struct ftrace_profile *rec;
809 struct hlist_head *hhd;
810 unsigned long key;
812 key = hash_long(ip, FTRACE_PROFILE_HASH_BITS);
813 hhd = &stat->hash[key];
815 if (hlist_empty(hhd))
816 return NULL;
818 hlist_for_each_entry_rcu_notrace(rec, hhd, node) {
819 if (rec->ip == ip)
820 return rec;
823 return NULL;
826 static void ftrace_add_profile(struct ftrace_profile_stat *stat,
827 struct ftrace_profile *rec)
829 unsigned long key;
831 key = hash_long(rec->ip, FTRACE_PROFILE_HASH_BITS);
832 hlist_add_head_rcu(&rec->node, &stat->hash[key]);
836 * The memory is already allocated, this simply finds a new record to use.
838 static struct ftrace_profile *
839 ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
841 struct ftrace_profile *rec = NULL;
843 /* prevent recursion (from NMIs) */
844 if (atomic_inc_return(&stat->disabled) != 1)
845 goto out;
848 * Try to find the function again since an NMI
849 * could have added it
851 rec = ftrace_find_profiled_func(stat, ip);
852 if (rec)
853 goto out;
855 if (stat->pages->index == PROFILES_PER_PAGE) {
856 if (!stat->pages->next)
857 goto out;
858 stat->pages = stat->pages->next;
861 rec = &stat->pages->records[stat->pages->index++];
862 rec->ip = ip;
863 ftrace_add_profile(stat, rec);
865 out:
866 atomic_dec(&stat->disabled);
868 return rec;
871 static void
872 function_profile_call(unsigned long ip, unsigned long parent_ip,
873 struct ftrace_ops *ops, struct pt_regs *regs)
875 struct ftrace_profile_stat *stat;
876 struct ftrace_profile *rec;
877 unsigned long flags;
879 if (!ftrace_profile_enabled)
880 return;
882 local_irq_save(flags);
884 stat = this_cpu_ptr(&ftrace_profile_stats);
885 if (!stat->hash || !ftrace_profile_enabled)
886 goto out;
888 rec = ftrace_find_profiled_func(stat, ip);
889 if (!rec) {
890 rec = ftrace_profile_alloc(stat, ip);
891 if (!rec)
892 goto out;
895 rec->counter++;
896 out:
897 local_irq_restore(flags);
900 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
901 static int profile_graph_entry(struct ftrace_graph_ent *trace)
903 function_profile_call(trace->func, 0, NULL, NULL);
904 return 1;
907 static void profile_graph_return(struct ftrace_graph_ret *trace)
909 struct ftrace_profile_stat *stat;
910 unsigned long long calltime;
911 struct ftrace_profile *rec;
912 unsigned long flags;
914 local_irq_save(flags);
915 stat = this_cpu_ptr(&ftrace_profile_stats);
916 if (!stat->hash || !ftrace_profile_enabled)
917 goto out;
919 /* If the calltime was zero'd ignore it */
920 if (!trace->calltime)
921 goto out;
923 calltime = trace->rettime - trace->calltime;
925 if (!fgraph_graph_time) {
926 int index;
928 index = trace->depth;
930 /* Append this call time to the parent time to subtract */
931 if (index)
932 current->ret_stack[index - 1].subtime += calltime;
934 if (current->ret_stack[index].subtime < calltime)
935 calltime -= current->ret_stack[index].subtime;
936 else
937 calltime = 0;
940 rec = ftrace_find_profiled_func(stat, trace->func);
941 if (rec) {
942 rec->time += calltime;
943 rec->time_squared += calltime * calltime;
946 out:
947 local_irq_restore(flags);
950 static int register_ftrace_profiler(void)
952 return register_ftrace_graph(&profile_graph_return,
953 &profile_graph_entry);
956 static void unregister_ftrace_profiler(void)
958 unregister_ftrace_graph();
960 #else
961 static struct ftrace_ops ftrace_profile_ops __read_mostly = {
962 .func = function_profile_call,
963 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
964 INIT_OPS_HASH(ftrace_profile_ops)
967 static int register_ftrace_profiler(void)
969 return register_ftrace_function(&ftrace_profile_ops);
972 static void unregister_ftrace_profiler(void)
974 unregister_ftrace_function(&ftrace_profile_ops);
976 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
978 static ssize_t
979 ftrace_profile_write(struct file *filp, const char __user *ubuf,
980 size_t cnt, loff_t *ppos)
982 unsigned long val;
983 int ret;
985 ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
986 if (ret)
987 return ret;
989 val = !!val;
991 mutex_lock(&ftrace_profile_lock);
992 if (ftrace_profile_enabled ^ val) {
993 if (val) {
994 ret = ftrace_profile_init();
995 if (ret < 0) {
996 cnt = ret;
997 goto out;
1000 ret = register_ftrace_profiler();
1001 if (ret < 0) {
1002 cnt = ret;
1003 goto out;
1005 ftrace_profile_enabled = 1;
1006 } else {
1007 ftrace_profile_enabled = 0;
1009 * unregister_ftrace_profiler calls stop_machine
1010 * so this acts like an synchronize_sched.
1012 unregister_ftrace_profiler();
1015 out:
1016 mutex_unlock(&ftrace_profile_lock);
1018 *ppos += cnt;
1020 return cnt;
1023 static ssize_t
1024 ftrace_profile_read(struct file *filp, char __user *ubuf,
1025 size_t cnt, loff_t *ppos)
1027 char buf[64]; /* big enough to hold a number */
1028 int r;
1030 r = sprintf(buf, "%u\n", ftrace_profile_enabled);
1031 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
1034 static const struct file_operations ftrace_profile_fops = {
1035 .open = tracing_open_generic,
1036 .read = ftrace_profile_read,
1037 .write = ftrace_profile_write,
1038 .llseek = default_llseek,
1041 /* used to initialize the real stat files */
1042 static struct tracer_stat function_stats __initdata = {
1043 .name = "functions",
1044 .stat_start = function_stat_start,
1045 .stat_next = function_stat_next,
1046 .stat_cmp = function_stat_cmp,
1047 .stat_headers = function_stat_headers,
1048 .stat_show = function_stat_show
1051 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1053 struct ftrace_profile_stat *stat;
1054 struct dentry *entry;
1055 char *name;
1056 int ret;
1057 int cpu;
1059 for_each_possible_cpu(cpu) {
1060 stat = &per_cpu(ftrace_profile_stats, cpu);
1062 /* allocate enough for function name + cpu number */
1063 name = kmalloc(32, GFP_KERNEL);
1064 if (!name) {
1066 * The files created are permanent, if something happens
1067 * we still do not free memory.
1069 WARN(1,
1070 "Could not allocate stat file for cpu %d\n",
1071 cpu);
1072 return;
1074 stat->stat = function_stats;
1075 snprintf(name, 32, "function%d", cpu);
1076 stat->stat.name = name;
1077 ret = register_stat_tracer(&stat->stat);
1078 if (ret) {
1079 WARN(1,
1080 "Could not register function stat for cpu %d\n",
1081 cpu);
1082 kfree(name);
1083 return;
1087 entry = tracefs_create_file("function_profile_enabled", 0644,
1088 d_tracer, NULL, &ftrace_profile_fops);
1089 if (!entry)
1090 pr_warning("Could not create tracefs "
1091 "'function_profile_enabled' entry\n");
1094 #else /* CONFIG_FUNCTION_PROFILER */
1095 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1098 #endif /* CONFIG_FUNCTION_PROFILER */
1100 static struct pid * const ftrace_swapper_pid = &init_struct_pid;
1102 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
1103 static int ftrace_graph_active;
1104 #else
1105 # define ftrace_graph_active 0
1106 #endif
1108 #ifdef CONFIG_DYNAMIC_FTRACE
1110 static struct ftrace_ops *removed_ops;
1113 * Set when doing a global update, like enabling all recs or disabling them.
1114 * It is not set when just updating a single ftrace_ops.
1116 static bool update_all_ops;
1118 #ifndef CONFIG_FTRACE_MCOUNT_RECORD
1119 # error Dynamic ftrace depends on MCOUNT_RECORD
1120 #endif
1122 static struct hlist_head ftrace_func_hash[FTRACE_FUNC_HASHSIZE] __read_mostly;
1124 struct ftrace_func_probe {
1125 struct hlist_node node;
1126 struct ftrace_probe_ops *ops;
1127 unsigned long flags;
1128 unsigned long ip;
1129 void *data;
1130 struct list_head free_list;
1133 struct ftrace_func_entry {
1134 struct hlist_node hlist;
1135 unsigned long ip;
1138 struct ftrace_hash {
1139 unsigned long size_bits;
1140 struct hlist_head *buckets;
1141 unsigned long count;
1142 struct rcu_head rcu;
1146 * We make these constant because no one should touch them,
1147 * but they are used as the default "empty hash", to avoid allocating
1148 * it all the time. These are in a read only section such that if
1149 * anyone does try to modify it, it will cause an exception.
1151 static const struct hlist_head empty_buckets[1];
1152 static const struct ftrace_hash empty_hash = {
1153 .buckets = (struct hlist_head *)empty_buckets,
1155 #define EMPTY_HASH ((struct ftrace_hash *)&empty_hash)
1157 static struct ftrace_ops global_ops = {
1158 .func = ftrace_stub,
1159 .local_hash.notrace_hash = EMPTY_HASH,
1160 .local_hash.filter_hash = EMPTY_HASH,
1161 INIT_OPS_HASH(global_ops)
1162 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
1163 FTRACE_OPS_FL_INITIALIZED |
1164 FTRACE_OPS_FL_PID,
1168 * This is used by __kernel_text_address() to return true if the
1169 * address is on a dynamically allocated trampoline that would
1170 * not return true for either core_kernel_text() or
1171 * is_module_text_address().
1173 bool is_ftrace_trampoline(unsigned long addr)
1175 struct ftrace_ops *op;
1176 bool ret = false;
1179 * Some of the ops may be dynamically allocated,
1180 * they are freed after a synchronize_sched().
1182 preempt_disable_notrace();
1184 do_for_each_ftrace_op(op, ftrace_ops_list) {
1186 * This is to check for dynamically allocated trampolines.
1187 * Trampolines that are in kernel text will have
1188 * core_kernel_text() return true.
1190 if (op->trampoline && op->trampoline_size)
1191 if (addr >= op->trampoline &&
1192 addr < op->trampoline + op->trampoline_size) {
1193 ret = true;
1194 goto out;
1196 } while_for_each_ftrace_op(op);
1198 out:
1199 preempt_enable_notrace();
1201 return ret;
1204 struct ftrace_page {
1205 struct ftrace_page *next;
1206 struct dyn_ftrace *records;
1207 int index;
1208 int size;
1211 #define ENTRY_SIZE sizeof(struct dyn_ftrace)
1212 #define ENTRIES_PER_PAGE (PAGE_SIZE / ENTRY_SIZE)
1214 /* estimate from running different kernels */
1215 #define NR_TO_INIT 10000
1217 static struct ftrace_page *ftrace_pages_start;
1218 static struct ftrace_page *ftrace_pages;
1220 static bool __always_inline ftrace_hash_empty(struct ftrace_hash *hash)
1222 return !hash || !hash->count;
1225 static struct ftrace_func_entry *
1226 ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1228 unsigned long key;
1229 struct ftrace_func_entry *entry;
1230 struct hlist_head *hhd;
1232 if (ftrace_hash_empty(hash))
1233 return NULL;
1235 if (hash->size_bits > 0)
1236 key = hash_long(ip, hash->size_bits);
1237 else
1238 key = 0;
1240 hhd = &hash->buckets[key];
1242 hlist_for_each_entry_rcu_notrace(entry, hhd, hlist) {
1243 if (entry->ip == ip)
1244 return entry;
1246 return NULL;
1249 static void __add_hash_entry(struct ftrace_hash *hash,
1250 struct ftrace_func_entry *entry)
1252 struct hlist_head *hhd;
1253 unsigned long key;
1255 if (hash->size_bits)
1256 key = hash_long(entry->ip, hash->size_bits);
1257 else
1258 key = 0;
1260 hhd = &hash->buckets[key];
1261 hlist_add_head(&entry->hlist, hhd);
1262 hash->count++;
1265 static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
1267 struct ftrace_func_entry *entry;
1269 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
1270 if (!entry)
1271 return -ENOMEM;
1273 entry->ip = ip;
1274 __add_hash_entry(hash, entry);
1276 return 0;
1279 static void
1280 free_hash_entry(struct ftrace_hash *hash,
1281 struct ftrace_func_entry *entry)
1283 hlist_del(&entry->hlist);
1284 kfree(entry);
1285 hash->count--;
1288 static void
1289 remove_hash_entry(struct ftrace_hash *hash,
1290 struct ftrace_func_entry *entry)
1292 hlist_del(&entry->hlist);
1293 hash->count--;
1296 static void ftrace_hash_clear(struct ftrace_hash *hash)
1298 struct hlist_head *hhd;
1299 struct hlist_node *tn;
1300 struct ftrace_func_entry *entry;
1301 int size = 1 << hash->size_bits;
1302 int i;
1304 if (!hash->count)
1305 return;
1307 for (i = 0; i < size; i++) {
1308 hhd = &hash->buckets[i];
1309 hlist_for_each_entry_safe(entry, tn, hhd, hlist)
1310 free_hash_entry(hash, entry);
1312 FTRACE_WARN_ON(hash->count);
1315 static void free_ftrace_hash(struct ftrace_hash *hash)
1317 if (!hash || hash == EMPTY_HASH)
1318 return;
1319 ftrace_hash_clear(hash);
1320 kfree(hash->buckets);
1321 kfree(hash);
1324 static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
1326 struct ftrace_hash *hash;
1328 hash = container_of(rcu, struct ftrace_hash, rcu);
1329 free_ftrace_hash(hash);
1332 static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
1334 if (!hash || hash == EMPTY_HASH)
1335 return;
1336 call_rcu_sched(&hash->rcu, __free_ftrace_hash_rcu);
1339 void ftrace_free_filter(struct ftrace_ops *ops)
1341 ftrace_ops_init(ops);
1342 free_ftrace_hash(ops->func_hash->filter_hash);
1343 free_ftrace_hash(ops->func_hash->notrace_hash);
1346 static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
1348 struct ftrace_hash *hash;
1349 int size;
1351 hash = kzalloc(sizeof(*hash), GFP_KERNEL);
1352 if (!hash)
1353 return NULL;
1355 size = 1 << size_bits;
1356 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL);
1358 if (!hash->buckets) {
1359 kfree(hash);
1360 return NULL;
1363 hash->size_bits = size_bits;
1365 return hash;
1368 static struct ftrace_hash *
1369 alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
1371 struct ftrace_func_entry *entry;
1372 struct ftrace_hash *new_hash;
1373 int size;
1374 int ret;
1375 int i;
1377 new_hash = alloc_ftrace_hash(size_bits);
1378 if (!new_hash)
1379 return NULL;
1381 /* Empty hash? */
1382 if (ftrace_hash_empty(hash))
1383 return new_hash;
1385 size = 1 << hash->size_bits;
1386 for (i = 0; i < size; i++) {
1387 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
1388 ret = add_hash_entry(new_hash, entry->ip);
1389 if (ret < 0)
1390 goto free_hash;
1394 FTRACE_WARN_ON(new_hash->count != hash->count);
1396 return new_hash;
1398 free_hash:
1399 free_ftrace_hash(new_hash);
1400 return NULL;
1403 static void
1404 ftrace_hash_rec_disable_modify(struct ftrace_ops *ops, int filter_hash);
1405 static void
1406 ftrace_hash_rec_enable_modify(struct ftrace_ops *ops, int filter_hash);
1408 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1409 struct ftrace_hash *new_hash);
1411 static int
1412 ftrace_hash_move(struct ftrace_ops *ops, int enable,
1413 struct ftrace_hash **dst, struct ftrace_hash *src)
1415 struct ftrace_func_entry *entry;
1416 struct hlist_node *tn;
1417 struct hlist_head *hhd;
1418 struct ftrace_hash *new_hash;
1419 int size = src->count;
1420 int bits = 0;
1421 int ret;
1422 int i;
1424 /* Reject setting notrace hash on IPMODIFY ftrace_ops */
1425 if (ops->flags & FTRACE_OPS_FL_IPMODIFY && !enable)
1426 return -EINVAL;
1429 * If the new source is empty, just free dst and assign it
1430 * the empty_hash.
1432 if (!src->count) {
1433 new_hash = EMPTY_HASH;
1434 goto update;
1438 * Make the hash size about 1/2 the # found
1440 for (size /= 2; size; size >>= 1)
1441 bits++;
1443 /* Don't allocate too much */
1444 if (bits > FTRACE_HASH_MAX_BITS)
1445 bits = FTRACE_HASH_MAX_BITS;
1447 new_hash = alloc_ftrace_hash(bits);
1448 if (!new_hash)
1449 return -ENOMEM;
1451 size = 1 << src->size_bits;
1452 for (i = 0; i < size; i++) {
1453 hhd = &src->buckets[i];
1454 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1455 remove_hash_entry(src, entry);
1456 __add_hash_entry(new_hash, entry);
1460 update:
1461 /* Make sure this can be applied if it is IPMODIFY ftrace_ops */
1462 if (enable) {
1463 /* IPMODIFY should be updated only when filter_hash updating */
1464 ret = ftrace_hash_ipmodify_update(ops, new_hash);
1465 if (ret < 0) {
1466 free_ftrace_hash(new_hash);
1467 return ret;
1472 * Remove the current set, update the hash and add
1473 * them back.
1475 ftrace_hash_rec_disable_modify(ops, enable);
1477 rcu_assign_pointer(*dst, new_hash);
1479 ftrace_hash_rec_enable_modify(ops, enable);
1481 return 0;
1484 static bool hash_contains_ip(unsigned long ip,
1485 struct ftrace_ops_hash *hash)
1488 * The function record is a match if it exists in the filter
1489 * hash and not in the notrace hash. Note, an emty hash is
1490 * considered a match for the filter hash, but an empty
1491 * notrace hash is considered not in the notrace hash.
1493 return (ftrace_hash_empty(hash->filter_hash) ||
1494 ftrace_lookup_ip(hash->filter_hash, ip)) &&
1495 (ftrace_hash_empty(hash->notrace_hash) ||
1496 !ftrace_lookup_ip(hash->notrace_hash, ip));
1500 * Test the hashes for this ops to see if we want to call
1501 * the ops->func or not.
1503 * It's a match if the ip is in the ops->filter_hash or
1504 * the filter_hash does not exist or is empty,
1505 * AND
1506 * the ip is not in the ops->notrace_hash.
1508 * This needs to be called with preemption disabled as
1509 * the hashes are freed with call_rcu_sched().
1511 static int
1512 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1514 struct ftrace_ops_hash hash;
1515 int ret;
1517 #ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1519 * There's a small race when adding ops that the ftrace handler
1520 * that wants regs, may be called without them. We can not
1521 * allow that handler to be called if regs is NULL.
1523 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1524 return 0;
1525 #endif
1527 hash.filter_hash = rcu_dereference_raw_notrace(ops->func_hash->filter_hash);
1528 hash.notrace_hash = rcu_dereference_raw_notrace(ops->func_hash->notrace_hash);
1530 if (hash_contains_ip(ip, &hash))
1531 ret = 1;
1532 else
1533 ret = 0;
1535 return ret;
1539 * This is a double for. Do not use 'break' to break out of the loop,
1540 * you must use a goto.
1542 #define do_for_each_ftrace_rec(pg, rec) \
1543 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1544 int _____i; \
1545 for (_____i = 0; _____i < pg->index; _____i++) { \
1546 rec = &pg->records[_____i];
1548 #define while_for_each_ftrace_rec() \
1553 static int ftrace_cmp_recs(const void *a, const void *b)
1555 const struct dyn_ftrace *key = a;
1556 const struct dyn_ftrace *rec = b;
1558 if (key->flags < rec->ip)
1559 return -1;
1560 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1561 return 1;
1562 return 0;
1565 static unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1567 struct ftrace_page *pg;
1568 struct dyn_ftrace *rec;
1569 struct dyn_ftrace key;
1571 key.ip = start;
1572 key.flags = end; /* overload flags, as it is unsigned long */
1574 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1575 if (end < pg->records[0].ip ||
1576 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1577 continue;
1578 rec = bsearch(&key, pg->records, pg->index,
1579 sizeof(struct dyn_ftrace),
1580 ftrace_cmp_recs);
1581 if (rec)
1582 return rec->ip;
1585 return 0;
1589 * ftrace_location - return true if the ip giving is a traced location
1590 * @ip: the instruction pointer to check
1592 * Returns rec->ip if @ip given is a pointer to a ftrace location.
1593 * That is, the instruction that is either a NOP or call to
1594 * the function tracer. It checks the ftrace internal tables to
1595 * determine if the address belongs or not.
1597 unsigned long ftrace_location(unsigned long ip)
1599 return ftrace_location_range(ip, ip);
1603 * ftrace_text_reserved - return true if range contains an ftrace location
1604 * @start: start of range to search
1605 * @end: end of range to search (inclusive). @end points to the last byte to check.
1607 * Returns 1 if @start and @end contains a ftrace location.
1608 * That is, the instruction that is either a NOP or call to
1609 * the function tracer. It checks the ftrace internal tables to
1610 * determine if the address belongs or not.
1612 int ftrace_text_reserved(const void *start, const void *end)
1614 unsigned long ret;
1616 ret = ftrace_location_range((unsigned long)start,
1617 (unsigned long)end);
1619 return (int)!!ret;
1622 /* Test if ops registered to this rec needs regs */
1623 static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1625 struct ftrace_ops *ops;
1626 bool keep_regs = false;
1628 for (ops = ftrace_ops_list;
1629 ops != &ftrace_list_end; ops = ops->next) {
1630 /* pass rec in as regs to have non-NULL val */
1631 if (ftrace_ops_test(ops, rec->ip, rec)) {
1632 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1633 keep_regs = true;
1634 break;
1639 return keep_regs;
1642 static void __ftrace_hash_rec_update(struct ftrace_ops *ops,
1643 int filter_hash,
1644 bool inc)
1646 struct ftrace_hash *hash;
1647 struct ftrace_hash *other_hash;
1648 struct ftrace_page *pg;
1649 struct dyn_ftrace *rec;
1650 int count = 0;
1651 int all = 0;
1653 /* Only update if the ops has been registered */
1654 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1655 return;
1658 * In the filter_hash case:
1659 * If the count is zero, we update all records.
1660 * Otherwise we just update the items in the hash.
1662 * In the notrace_hash case:
1663 * We enable the update in the hash.
1664 * As disabling notrace means enabling the tracing,
1665 * and enabling notrace means disabling, the inc variable
1666 * gets inversed.
1668 if (filter_hash) {
1669 hash = ops->func_hash->filter_hash;
1670 other_hash = ops->func_hash->notrace_hash;
1671 if (ftrace_hash_empty(hash))
1672 all = 1;
1673 } else {
1674 inc = !inc;
1675 hash = ops->func_hash->notrace_hash;
1676 other_hash = ops->func_hash->filter_hash;
1678 * If the notrace hash has no items,
1679 * then there's nothing to do.
1681 if (ftrace_hash_empty(hash))
1682 return;
1685 do_for_each_ftrace_rec(pg, rec) {
1686 int in_other_hash = 0;
1687 int in_hash = 0;
1688 int match = 0;
1690 if (all) {
1692 * Only the filter_hash affects all records.
1693 * Update if the record is not in the notrace hash.
1695 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1696 match = 1;
1697 } else {
1698 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1699 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1702 * If filter_hash is set, we want to match all functions
1703 * that are in the hash but not in the other hash.
1705 * If filter_hash is not set, then we are decrementing.
1706 * That means we match anything that is in the hash
1707 * and also in the other_hash. That is, we need to turn
1708 * off functions in the other hash because they are disabled
1709 * by this hash.
1711 if (filter_hash && in_hash && !in_other_hash)
1712 match = 1;
1713 else if (!filter_hash && in_hash &&
1714 (in_other_hash || ftrace_hash_empty(other_hash)))
1715 match = 1;
1717 if (!match)
1718 continue;
1720 if (inc) {
1721 rec->flags++;
1722 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1723 return;
1726 * If there's only a single callback registered to a
1727 * function, and the ops has a trampoline registered
1728 * for it, then we can call it directly.
1730 if (ftrace_rec_count(rec) == 1 && ops->trampoline)
1731 rec->flags |= FTRACE_FL_TRAMP;
1732 else
1734 * If we are adding another function callback
1735 * to this function, and the previous had a
1736 * custom trampoline in use, then we need to go
1737 * back to the default trampoline.
1739 rec->flags &= ~FTRACE_FL_TRAMP;
1742 * If any ops wants regs saved for this function
1743 * then all ops will get saved regs.
1745 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1746 rec->flags |= FTRACE_FL_REGS;
1747 } else {
1748 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1749 return;
1750 rec->flags--;
1753 * If the rec had REGS enabled and the ops that is
1754 * being removed had REGS set, then see if there is
1755 * still any ops for this record that wants regs.
1756 * If not, we can stop recording them.
1758 if (ftrace_rec_count(rec) > 0 &&
1759 rec->flags & FTRACE_FL_REGS &&
1760 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1761 if (!test_rec_ops_needs_regs(rec))
1762 rec->flags &= ~FTRACE_FL_REGS;
1766 * If the rec had TRAMP enabled, then it needs to
1767 * be cleared. As TRAMP can only be enabled iff
1768 * there is only a single ops attached to it.
1769 * In otherwords, always disable it on decrementing.
1770 * In the future, we may set it if rec count is
1771 * decremented to one, and the ops that is left
1772 * has a trampoline.
1774 rec->flags &= ~FTRACE_FL_TRAMP;
1777 * flags will be cleared in ftrace_check_record()
1778 * if rec count is zero.
1781 count++;
1782 /* Shortcut, if we handled all records, we are done. */
1783 if (!all && count == hash->count)
1784 return;
1785 } while_for_each_ftrace_rec();
1788 static void ftrace_hash_rec_disable(struct ftrace_ops *ops,
1789 int filter_hash)
1791 __ftrace_hash_rec_update(ops, filter_hash, 0);
1794 static void ftrace_hash_rec_enable(struct ftrace_ops *ops,
1795 int filter_hash)
1797 __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) {
1868 /* We need to update only differences of filter_hash */
1869 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1870 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1871 if (in_old == in_new)
1872 continue;
1874 if (in_new) {
1875 /* New entries must ensure no others are using it */
1876 if (rec->flags & FTRACE_FL_IPMODIFY)
1877 goto rollback;
1878 rec->flags |= FTRACE_FL_IPMODIFY;
1879 } else /* Removed entry */
1880 rec->flags &= ~FTRACE_FL_IPMODIFY;
1881 } while_for_each_ftrace_rec();
1883 return 0;
1885 rollback:
1886 end = rec;
1888 /* Roll back what we did above */
1889 do_for_each_ftrace_rec(pg, rec) {
1890 if (rec == end)
1891 goto err_out;
1893 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1894 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1895 if (in_old == in_new)
1896 continue;
1898 if (in_new)
1899 rec->flags &= ~FTRACE_FL_IPMODIFY;
1900 else
1901 rec->flags |= FTRACE_FL_IPMODIFY;
1902 } while_for_each_ftrace_rec();
1904 err_out:
1905 return -EBUSY;
1908 static int ftrace_hash_ipmodify_enable(struct ftrace_ops *ops)
1910 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1912 if (ftrace_hash_empty(hash))
1913 hash = NULL;
1915 return __ftrace_hash_update_ipmodify(ops, EMPTY_HASH, hash);
1918 /* Disabling always succeeds */
1919 static void ftrace_hash_ipmodify_disable(struct ftrace_ops *ops)
1921 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1923 if (ftrace_hash_empty(hash))
1924 hash = NULL;
1926 __ftrace_hash_update_ipmodify(ops, hash, EMPTY_HASH);
1929 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1930 struct ftrace_hash *new_hash)
1932 struct ftrace_hash *old_hash = ops->func_hash->filter_hash;
1934 if (ftrace_hash_empty(old_hash))
1935 old_hash = NULL;
1937 if (ftrace_hash_empty(new_hash))
1938 new_hash = NULL;
1940 return __ftrace_hash_update_ipmodify(ops, old_hash, new_hash);
1943 static void print_ip_ins(const char *fmt, unsigned char *p)
1945 int i;
1947 printk(KERN_CONT "%s", fmt);
1949 for (i = 0; i < MCOUNT_INSN_SIZE; i++)
1950 printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
1953 static struct ftrace_ops *
1954 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec);
1957 * ftrace_bug - report and shutdown function tracer
1958 * @failed: The failed type (EFAULT, EINVAL, EPERM)
1959 * @rec: The record that failed
1961 * The arch code that enables or disables the function tracing
1962 * can call ftrace_bug() when it has detected a problem in
1963 * modifying the code. @failed should be one of either:
1964 * EFAULT - if the problem happens on reading the @ip address
1965 * EINVAL - if what is read at @ip is not what was expected
1966 * EPERM - if the problem happens on writting to the @ip address
1968 void ftrace_bug(int failed, struct dyn_ftrace *rec)
1970 unsigned long ip = rec ? rec->ip : 0;
1972 switch (failed) {
1973 case -EFAULT:
1974 FTRACE_WARN_ON_ONCE(1);
1975 pr_info("ftrace faulted on modifying ");
1976 print_ip_sym(ip);
1977 break;
1978 case -EINVAL:
1979 FTRACE_WARN_ON_ONCE(1);
1980 pr_info("ftrace failed to modify ");
1981 print_ip_sym(ip);
1982 print_ip_ins(" actual: ", (unsigned char *)ip);
1983 pr_cont("\n");
1984 break;
1985 case -EPERM:
1986 FTRACE_WARN_ON_ONCE(1);
1987 pr_info("ftrace faulted on writing ");
1988 print_ip_sym(ip);
1989 break;
1990 default:
1991 FTRACE_WARN_ON_ONCE(1);
1992 pr_info("ftrace faulted on unknown error ");
1993 print_ip_sym(ip);
1995 if (rec) {
1996 struct ftrace_ops *ops = NULL;
1998 pr_info("ftrace record flags: %lx\n", rec->flags);
1999 pr_cont(" (%ld)%s", ftrace_rec_count(rec),
2000 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2001 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2002 ops = ftrace_find_tramp_ops_any(rec);
2003 if (ops)
2004 pr_cont("\ttramp: %pS",
2005 (void *)ops->trampoline);
2006 else
2007 pr_cont("\ttramp: ERROR!");
2010 ip = ftrace_get_addr_curr(rec);
2011 pr_cont(" expected tramp: %lx\n", ip);
2015 static int ftrace_check_record(struct dyn_ftrace *rec, int enable, int update)
2017 unsigned long flag = 0UL;
2020 * If we are updating calls:
2022 * If the record has a ref count, then we need to enable it
2023 * because someone is using it.
2025 * Otherwise we make sure its disabled.
2027 * If we are disabling calls, then disable all records that
2028 * are enabled.
2030 if (enable && ftrace_rec_count(rec))
2031 flag = FTRACE_FL_ENABLED;
2034 * If enabling and the REGS flag does not match the REGS_EN, or
2035 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
2036 * this record. Set flags to fail the compare against ENABLED.
2038 if (flag) {
2039 if (!(rec->flags & FTRACE_FL_REGS) !=
2040 !(rec->flags & FTRACE_FL_REGS_EN))
2041 flag |= FTRACE_FL_REGS;
2043 if (!(rec->flags & FTRACE_FL_TRAMP) !=
2044 !(rec->flags & FTRACE_FL_TRAMP_EN))
2045 flag |= FTRACE_FL_TRAMP;
2048 /* If the state of this record hasn't changed, then do nothing */
2049 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
2050 return FTRACE_UPDATE_IGNORE;
2052 if (flag) {
2053 /* Save off if rec is being enabled (for return value) */
2054 flag ^= rec->flags & FTRACE_FL_ENABLED;
2056 if (update) {
2057 rec->flags |= FTRACE_FL_ENABLED;
2058 if (flag & FTRACE_FL_REGS) {
2059 if (rec->flags & FTRACE_FL_REGS)
2060 rec->flags |= FTRACE_FL_REGS_EN;
2061 else
2062 rec->flags &= ~FTRACE_FL_REGS_EN;
2064 if (flag & FTRACE_FL_TRAMP) {
2065 if (rec->flags & FTRACE_FL_TRAMP)
2066 rec->flags |= FTRACE_FL_TRAMP_EN;
2067 else
2068 rec->flags &= ~FTRACE_FL_TRAMP_EN;
2073 * If this record is being updated from a nop, then
2074 * return UPDATE_MAKE_CALL.
2075 * Otherwise,
2076 * return UPDATE_MODIFY_CALL to tell the caller to convert
2077 * from the save regs, to a non-save regs function or
2078 * vice versa, or from a trampoline call.
2080 if (flag & FTRACE_FL_ENABLED)
2081 return FTRACE_UPDATE_MAKE_CALL;
2083 return FTRACE_UPDATE_MODIFY_CALL;
2086 if (update) {
2087 /* If there's no more users, clear all flags */
2088 if (!ftrace_rec_count(rec))
2089 rec->flags = 0;
2090 else
2092 * Just disable the record, but keep the ops TRAMP
2093 * and REGS states. The _EN flags must be disabled though.
2095 rec->flags &= ~(FTRACE_FL_ENABLED | FTRACE_FL_TRAMP_EN |
2096 FTRACE_FL_REGS_EN);
2099 return FTRACE_UPDATE_MAKE_NOP;
2103 * ftrace_update_record, set a record that now is tracing or not
2104 * @rec: the record to update
2105 * @enable: set to 1 if the record is tracing, zero to force disable
2107 * The records that represent all functions that can be traced need
2108 * to be updated when tracing has been enabled.
2110 int ftrace_update_record(struct dyn_ftrace *rec, int enable)
2112 return ftrace_check_record(rec, enable, 1);
2116 * ftrace_test_record, check if the record has been enabled or not
2117 * @rec: the record to test
2118 * @enable: set to 1 to check if enabled, 0 if it is disabled
2120 * The arch code may need to test if a record is already set to
2121 * tracing to determine how to modify the function code that it
2122 * represents.
2124 int ftrace_test_record(struct dyn_ftrace *rec, int enable)
2126 return ftrace_check_record(rec, enable, 0);
2129 static struct ftrace_ops *
2130 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec)
2132 struct ftrace_ops *op;
2133 unsigned long ip = rec->ip;
2135 do_for_each_ftrace_op(op, ftrace_ops_list) {
2137 if (!op->trampoline)
2138 continue;
2140 if (hash_contains_ip(ip, op->func_hash))
2141 return op;
2142 } while_for_each_ftrace_op(op);
2144 return NULL;
2147 static struct ftrace_ops *
2148 ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
2150 struct ftrace_ops *op;
2151 unsigned long ip = rec->ip;
2154 * Need to check removed ops first.
2155 * If they are being removed, and this rec has a tramp,
2156 * and this rec is in the ops list, then it would be the
2157 * one with the tramp.
2159 if (removed_ops) {
2160 if (hash_contains_ip(ip, &removed_ops->old_hash))
2161 return removed_ops;
2165 * Need to find the current trampoline for a rec.
2166 * Now, a trampoline is only attached to a rec if there
2167 * was a single 'ops' attached to it. But this can be called
2168 * when we are adding another op to the rec or removing the
2169 * current one. Thus, if the op is being added, we can
2170 * ignore it because it hasn't attached itself to the rec
2171 * yet.
2173 * If an ops is being modified (hooking to different functions)
2174 * then we don't care about the new functions that are being
2175 * added, just the old ones (that are probably being removed).
2177 * If we are adding an ops to a function that already is using
2178 * a trampoline, it needs to be removed (trampolines are only
2179 * for single ops connected), then an ops that is not being
2180 * modified also needs to be checked.
2182 do_for_each_ftrace_op(op, ftrace_ops_list) {
2184 if (!op->trampoline)
2185 continue;
2188 * If the ops is being added, it hasn't gotten to
2189 * the point to be removed from this tree yet.
2191 if (op->flags & FTRACE_OPS_FL_ADDING)
2192 continue;
2196 * If the ops is being modified and is in the old
2197 * hash, then it is probably being removed from this
2198 * function.
2200 if ((op->flags & FTRACE_OPS_FL_MODIFYING) &&
2201 hash_contains_ip(ip, &op->old_hash))
2202 return op;
2204 * If the ops is not being added or modified, and it's
2205 * in its normal filter hash, then this must be the one
2206 * we want!
2208 if (!(op->flags & FTRACE_OPS_FL_MODIFYING) &&
2209 hash_contains_ip(ip, op->func_hash))
2210 return op;
2212 } while_for_each_ftrace_op(op);
2214 return NULL;
2217 static struct ftrace_ops *
2218 ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
2220 struct ftrace_ops *op;
2221 unsigned long ip = rec->ip;
2223 do_for_each_ftrace_op(op, ftrace_ops_list) {
2224 /* pass rec in as regs to have non-NULL val */
2225 if (hash_contains_ip(ip, op->func_hash))
2226 return op;
2227 } while_for_each_ftrace_op(op);
2229 return NULL;
2233 * ftrace_get_addr_new - Get the call address to set to
2234 * @rec: The ftrace record descriptor
2236 * If the record has the FTRACE_FL_REGS set, that means that it
2237 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
2238 * is not not set, then it wants to convert to the normal callback.
2240 * Returns the address of the trampoline to set to
2242 unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
2244 struct ftrace_ops *ops;
2246 /* Trampolines take precedence over regs */
2247 if (rec->flags & FTRACE_FL_TRAMP) {
2248 ops = ftrace_find_tramp_ops_new(rec);
2249 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
2250 pr_warn("Bad trampoline accounting at: %p (%pS) (%lx)\n",
2251 (void *)rec->ip, (void *)rec->ip, rec->flags);
2252 /* Ftrace is shutting down, return anything */
2253 return (unsigned long)FTRACE_ADDR;
2255 return ops->trampoline;
2258 if (rec->flags & FTRACE_FL_REGS)
2259 return (unsigned long)FTRACE_REGS_ADDR;
2260 else
2261 return (unsigned long)FTRACE_ADDR;
2265 * ftrace_get_addr_curr - Get the call address that is already there
2266 * @rec: The ftrace record descriptor
2268 * The FTRACE_FL_REGS_EN is set when the record already points to
2269 * a function that saves all the regs. Basically the '_EN' version
2270 * represents the current state of the function.
2272 * Returns the address of the trampoline that is currently being called
2274 unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
2276 struct ftrace_ops *ops;
2278 /* Trampolines take precedence over regs */
2279 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2280 ops = ftrace_find_tramp_ops_curr(rec);
2281 if (FTRACE_WARN_ON(!ops)) {
2282 pr_warning("Bad trampoline accounting at: %p (%pS)\n",
2283 (void *)rec->ip, (void *)rec->ip);
2284 /* Ftrace is shutting down, return anything */
2285 return (unsigned long)FTRACE_ADDR;
2287 return ops->trampoline;
2290 if (rec->flags & FTRACE_FL_REGS_EN)
2291 return (unsigned long)FTRACE_REGS_ADDR;
2292 else
2293 return (unsigned long)FTRACE_ADDR;
2296 static int
2297 __ftrace_replace_code(struct dyn_ftrace *rec, int enable)
2299 unsigned long ftrace_old_addr;
2300 unsigned long ftrace_addr;
2301 int ret;
2303 ftrace_addr = ftrace_get_addr_new(rec);
2305 /* This needs to be done before we call ftrace_update_record */
2306 ftrace_old_addr = ftrace_get_addr_curr(rec);
2308 ret = ftrace_update_record(rec, enable);
2310 switch (ret) {
2311 case FTRACE_UPDATE_IGNORE:
2312 return 0;
2314 case FTRACE_UPDATE_MAKE_CALL:
2315 return ftrace_make_call(rec, ftrace_addr);
2317 case FTRACE_UPDATE_MAKE_NOP:
2318 return ftrace_make_nop(NULL, rec, ftrace_old_addr);
2320 case FTRACE_UPDATE_MODIFY_CALL:
2321 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
2324 return -1; /* unknow ftrace bug */
2327 void __weak ftrace_replace_code(int enable)
2329 struct dyn_ftrace *rec;
2330 struct ftrace_page *pg;
2331 int failed;
2333 if (unlikely(ftrace_disabled))
2334 return;
2336 do_for_each_ftrace_rec(pg, rec) {
2337 failed = __ftrace_replace_code(rec, enable);
2338 if (failed) {
2339 ftrace_bug(failed, rec);
2340 /* Stop processing */
2341 return;
2343 } while_for_each_ftrace_rec();
2346 struct ftrace_rec_iter {
2347 struct ftrace_page *pg;
2348 int index;
2352 * ftrace_rec_iter_start, start up iterating over traced functions
2354 * Returns an iterator handle that is used to iterate over all
2355 * the records that represent address locations where functions
2356 * are traced.
2358 * May return NULL if no records are available.
2360 struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2363 * We only use a single iterator.
2364 * Protected by the ftrace_lock mutex.
2366 static struct ftrace_rec_iter ftrace_rec_iter;
2367 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2369 iter->pg = ftrace_pages_start;
2370 iter->index = 0;
2372 /* Could have empty pages */
2373 while (iter->pg && !iter->pg->index)
2374 iter->pg = iter->pg->next;
2376 if (!iter->pg)
2377 return NULL;
2379 return iter;
2383 * ftrace_rec_iter_next, get the next record to process.
2384 * @iter: The handle to the iterator.
2386 * Returns the next iterator after the given iterator @iter.
2388 struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2390 iter->index++;
2392 if (iter->index >= iter->pg->index) {
2393 iter->pg = iter->pg->next;
2394 iter->index = 0;
2396 /* Could have empty pages */
2397 while (iter->pg && !iter->pg->index)
2398 iter->pg = iter->pg->next;
2401 if (!iter->pg)
2402 return NULL;
2404 return iter;
2408 * ftrace_rec_iter_record, get the record at the iterator location
2409 * @iter: The current iterator location
2411 * Returns the record that the current @iter is at.
2413 struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2415 return &iter->pg->records[iter->index];
2418 static int
2419 ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
2421 int ret;
2423 if (unlikely(ftrace_disabled))
2424 return 0;
2426 ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
2427 if (ret) {
2428 ftrace_bug(ret, rec);
2429 return 0;
2431 return 1;
2435 * archs can override this function if they must do something
2436 * before the modifying code is performed.
2438 int __weak ftrace_arch_code_modify_prepare(void)
2440 return 0;
2444 * archs can override this function if they must do something
2445 * after the modifying code is performed.
2447 int __weak ftrace_arch_code_modify_post_process(void)
2449 return 0;
2452 void ftrace_modify_all_code(int command)
2454 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2455 int err = 0;
2458 * If the ftrace_caller calls a ftrace_ops func directly,
2459 * we need to make sure that it only traces functions it
2460 * expects to trace. When doing the switch of functions,
2461 * we need to update to the ftrace_ops_list_func first
2462 * before the transition between old and new calls are set,
2463 * as the ftrace_ops_list_func will check the ops hashes
2464 * to make sure the ops are having the right functions
2465 * traced.
2467 if (update) {
2468 err = ftrace_update_ftrace_func(ftrace_ops_list_func);
2469 if (FTRACE_WARN_ON(err))
2470 return;
2473 if (command & FTRACE_UPDATE_CALLS)
2474 ftrace_replace_code(1);
2475 else if (command & FTRACE_DISABLE_CALLS)
2476 ftrace_replace_code(0);
2478 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2479 function_trace_op = set_function_trace_op;
2480 smp_wmb();
2481 /* If irqs are disabled, we are in stop machine */
2482 if (!irqs_disabled())
2483 smp_call_function(ftrace_sync_ipi, NULL, 1);
2484 err = ftrace_update_ftrace_func(ftrace_trace_function);
2485 if (FTRACE_WARN_ON(err))
2486 return;
2489 if (command & FTRACE_START_FUNC_RET)
2490 err = ftrace_enable_ftrace_graph_caller();
2491 else if (command & FTRACE_STOP_FUNC_RET)
2492 err = ftrace_disable_ftrace_graph_caller();
2493 FTRACE_WARN_ON(err);
2496 static int __ftrace_modify_code(void *data)
2498 int *command = data;
2500 ftrace_modify_all_code(*command);
2502 return 0;
2506 * ftrace_run_stop_machine, go back to the stop machine method
2507 * @command: The command to tell ftrace what to do
2509 * If an arch needs to fall back to the stop machine method, the
2510 * it can call this function.
2512 void ftrace_run_stop_machine(int command)
2514 stop_machine(__ftrace_modify_code, &command, NULL);
2518 * arch_ftrace_update_code, modify the code to trace or not trace
2519 * @command: The command that needs to be done
2521 * Archs can override this function if it does not need to
2522 * run stop_machine() to modify code.
2524 void __weak arch_ftrace_update_code(int command)
2526 ftrace_run_stop_machine(command);
2529 static void ftrace_run_update_code(int command)
2531 int ret;
2533 ret = ftrace_arch_code_modify_prepare();
2534 FTRACE_WARN_ON(ret);
2535 if (ret)
2536 return;
2539 * By default we use stop_machine() to modify the code.
2540 * But archs can do what ever they want as long as it
2541 * is safe. The stop_machine() is the safest, but also
2542 * produces the most overhead.
2544 arch_ftrace_update_code(command);
2546 ret = ftrace_arch_code_modify_post_process();
2547 FTRACE_WARN_ON(ret);
2550 static void ftrace_run_modify_code(struct ftrace_ops *ops, int command,
2551 struct ftrace_ops_hash *old_hash)
2553 ops->flags |= FTRACE_OPS_FL_MODIFYING;
2554 ops->old_hash.filter_hash = old_hash->filter_hash;
2555 ops->old_hash.notrace_hash = old_hash->notrace_hash;
2556 ftrace_run_update_code(command);
2557 ops->old_hash.filter_hash = NULL;
2558 ops->old_hash.notrace_hash = NULL;
2559 ops->flags &= ~FTRACE_OPS_FL_MODIFYING;
2562 static ftrace_func_t saved_ftrace_func;
2563 static int ftrace_start_up;
2565 void __weak arch_ftrace_trampoline_free(struct ftrace_ops *ops)
2569 static void control_ops_free(struct ftrace_ops *ops)
2571 free_percpu(ops->disabled);
2574 static void ftrace_startup_enable(int command)
2576 if (saved_ftrace_func != ftrace_trace_function) {
2577 saved_ftrace_func = ftrace_trace_function;
2578 command |= FTRACE_UPDATE_TRACE_FUNC;
2581 if (!command || !ftrace_enabled)
2582 return;
2584 ftrace_run_update_code(command);
2587 static void ftrace_startup_all(int command)
2589 update_all_ops = true;
2590 ftrace_startup_enable(command);
2591 update_all_ops = false;
2594 static int ftrace_startup(struct ftrace_ops *ops, int command)
2596 int ret;
2598 if (unlikely(ftrace_disabled))
2599 return -ENODEV;
2601 ret = __register_ftrace_function(ops);
2602 if (ret)
2603 return ret;
2605 ftrace_start_up++;
2606 command |= FTRACE_UPDATE_CALLS;
2609 * Note that ftrace probes uses this to start up
2610 * and modify functions it will probe. But we still
2611 * set the ADDING flag for modification, as probes
2612 * do not have trampolines. If they add them in the
2613 * future, then the probes will need to distinguish
2614 * between adding and updating probes.
2616 ops->flags |= FTRACE_OPS_FL_ENABLED | FTRACE_OPS_FL_ADDING;
2618 ret = ftrace_hash_ipmodify_enable(ops);
2619 if (ret < 0) {
2620 /* Rollback registration process */
2621 __unregister_ftrace_function(ops);
2622 ftrace_start_up--;
2623 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2624 return ret;
2627 ftrace_hash_rec_enable(ops, 1);
2629 ftrace_startup_enable(command);
2631 ops->flags &= ~FTRACE_OPS_FL_ADDING;
2633 return 0;
2636 static int ftrace_shutdown(struct ftrace_ops *ops, int command)
2638 int ret;
2640 if (unlikely(ftrace_disabled))
2641 return -ENODEV;
2643 ret = __unregister_ftrace_function(ops);
2644 if (ret)
2645 return ret;
2647 ftrace_start_up--;
2649 * Just warn in case of unbalance, no need to kill ftrace, it's not
2650 * critical but the ftrace_call callers may be never nopped again after
2651 * further ftrace uses.
2653 WARN_ON_ONCE(ftrace_start_up < 0);
2655 /* Disabling ipmodify never fails */
2656 ftrace_hash_ipmodify_disable(ops);
2657 ftrace_hash_rec_disable(ops, 1);
2659 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2661 command |= FTRACE_UPDATE_CALLS;
2663 if (saved_ftrace_func != ftrace_trace_function) {
2664 saved_ftrace_func = ftrace_trace_function;
2665 command |= FTRACE_UPDATE_TRACE_FUNC;
2668 if (!command || !ftrace_enabled) {
2670 * If these are control ops, they still need their
2671 * per_cpu field freed. Since, function tracing is
2672 * not currently active, we can just free them
2673 * without synchronizing all CPUs.
2675 if (ops->flags & FTRACE_OPS_FL_CONTROL)
2676 control_ops_free(ops);
2677 return 0;
2681 * If the ops uses a trampoline, then it needs to be
2682 * tested first on update.
2684 ops->flags |= FTRACE_OPS_FL_REMOVING;
2685 removed_ops = ops;
2687 /* The trampoline logic checks the old hashes */
2688 ops->old_hash.filter_hash = ops->func_hash->filter_hash;
2689 ops->old_hash.notrace_hash = ops->func_hash->notrace_hash;
2691 ftrace_run_update_code(command);
2694 * If there's no more ops registered with ftrace, run a
2695 * sanity check to make sure all rec flags are cleared.
2697 if (ftrace_ops_list == &ftrace_list_end) {
2698 struct ftrace_page *pg;
2699 struct dyn_ftrace *rec;
2701 do_for_each_ftrace_rec(pg, rec) {
2702 if (FTRACE_WARN_ON_ONCE(rec->flags))
2703 pr_warn(" %pS flags:%lx\n",
2704 (void *)rec->ip, rec->flags);
2705 } while_for_each_ftrace_rec();
2708 ops->old_hash.filter_hash = NULL;
2709 ops->old_hash.notrace_hash = NULL;
2711 removed_ops = NULL;
2712 ops->flags &= ~FTRACE_OPS_FL_REMOVING;
2715 * Dynamic ops may be freed, we must make sure that all
2716 * callers are done before leaving this function.
2717 * The same goes for freeing the per_cpu data of the control
2718 * ops.
2720 * Again, normal synchronize_sched() is not good enough.
2721 * We need to do a hard force of sched synchronization.
2722 * This is because we use preempt_disable() to do RCU, but
2723 * the function tracers can be called where RCU is not watching
2724 * (like before user_exit()). We can not rely on the RCU
2725 * infrastructure to do the synchronization, thus we must do it
2726 * ourselves.
2728 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_CONTROL)) {
2729 schedule_on_each_cpu(ftrace_sync);
2731 arch_ftrace_trampoline_free(ops);
2733 if (ops->flags & FTRACE_OPS_FL_CONTROL)
2734 control_ops_free(ops);
2737 return 0;
2740 static void ftrace_startup_sysctl(void)
2742 int command;
2744 if (unlikely(ftrace_disabled))
2745 return;
2747 /* Force update next time */
2748 saved_ftrace_func = NULL;
2749 /* ftrace_start_up is true if we want ftrace running */
2750 if (ftrace_start_up) {
2751 command = FTRACE_UPDATE_CALLS;
2752 if (ftrace_graph_active)
2753 command |= FTRACE_START_FUNC_RET;
2754 ftrace_startup_enable(command);
2758 static void ftrace_shutdown_sysctl(void)
2760 int command;
2762 if (unlikely(ftrace_disabled))
2763 return;
2765 /* ftrace_start_up is true if ftrace is running */
2766 if (ftrace_start_up) {
2767 command = FTRACE_DISABLE_CALLS;
2768 if (ftrace_graph_active)
2769 command |= FTRACE_STOP_FUNC_RET;
2770 ftrace_run_update_code(command);
2774 static cycle_t ftrace_update_time;
2775 unsigned long ftrace_update_tot_cnt;
2777 static inline int ops_traces_mod(struct ftrace_ops *ops)
2780 * Filter_hash being empty will default to trace module.
2781 * But notrace hash requires a test of individual module functions.
2783 return ftrace_hash_empty(ops->func_hash->filter_hash) &&
2784 ftrace_hash_empty(ops->func_hash->notrace_hash);
2788 * Check if the current ops references the record.
2790 * If the ops traces all functions, then it was already accounted for.
2791 * If the ops does not trace the current record function, skip it.
2792 * If the ops ignores the function via notrace filter, skip it.
2794 static inline bool
2795 ops_references_rec(struct ftrace_ops *ops, struct dyn_ftrace *rec)
2797 /* If ops isn't enabled, ignore it */
2798 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
2799 return 0;
2801 /* If ops traces all mods, we already accounted for it */
2802 if (ops_traces_mod(ops))
2803 return 0;
2805 /* The function must be in the filter */
2806 if (!ftrace_hash_empty(ops->func_hash->filter_hash) &&
2807 !ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))
2808 return 0;
2810 /* If in notrace hash, we ignore it too */
2811 if (ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip))
2812 return 0;
2814 return 1;
2817 static int referenced_filters(struct dyn_ftrace *rec)
2819 struct ftrace_ops *ops;
2820 int cnt = 0;
2822 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
2823 if (ops_references_rec(ops, rec))
2824 cnt++;
2827 return cnt;
2830 static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
2832 struct ftrace_page *pg;
2833 struct dyn_ftrace *p;
2834 cycle_t start, stop;
2835 unsigned long update_cnt = 0;
2836 unsigned long ref = 0;
2837 bool test = false;
2838 int i;
2841 * When adding a module, we need to check if tracers are
2842 * currently enabled and if they are set to trace all functions.
2843 * If they are, we need to enable the module functions as well
2844 * as update the reference counts for those function records.
2846 if (mod) {
2847 struct ftrace_ops *ops;
2849 for (ops = ftrace_ops_list;
2850 ops != &ftrace_list_end; ops = ops->next) {
2851 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
2852 if (ops_traces_mod(ops))
2853 ref++;
2854 else
2855 test = true;
2860 start = ftrace_now(raw_smp_processor_id());
2862 for (pg = new_pgs; pg; pg = pg->next) {
2864 for (i = 0; i < pg->index; i++) {
2865 int cnt = ref;
2867 /* If something went wrong, bail without enabling anything */
2868 if (unlikely(ftrace_disabled))
2869 return -1;
2871 p = &pg->records[i];
2872 if (test)
2873 cnt += referenced_filters(p);
2874 p->flags = cnt;
2877 * Do the initial record conversion from mcount jump
2878 * to the NOP instructions.
2880 if (!ftrace_code_disable(mod, p))
2881 break;
2883 update_cnt++;
2886 * If the tracing is enabled, go ahead and enable the record.
2888 * The reason not to enable the record immediatelly is the
2889 * inherent check of ftrace_make_nop/ftrace_make_call for
2890 * correct previous instructions. Making first the NOP
2891 * conversion puts the module to the correct state, thus
2892 * passing the ftrace_make_call check.
2894 if (ftrace_start_up && cnt) {
2895 int failed = __ftrace_replace_code(p, 1);
2896 if (failed)
2897 ftrace_bug(failed, p);
2902 stop = ftrace_now(raw_smp_processor_id());
2903 ftrace_update_time = stop - start;
2904 ftrace_update_tot_cnt += update_cnt;
2906 return 0;
2909 static int ftrace_allocate_records(struct ftrace_page *pg, int count)
2911 int order;
2912 int cnt;
2914 if (WARN_ON(!count))
2915 return -EINVAL;
2917 order = get_count_order(DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
2920 * We want to fill as much as possible. No more than a page
2921 * may be empty.
2923 while ((PAGE_SIZE << order) / ENTRY_SIZE >= count + ENTRIES_PER_PAGE)
2924 order--;
2926 again:
2927 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
2929 if (!pg->records) {
2930 /* if we can't allocate this size, try something smaller */
2931 if (!order)
2932 return -ENOMEM;
2933 order >>= 1;
2934 goto again;
2937 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
2938 pg->size = cnt;
2940 if (cnt > count)
2941 cnt = count;
2943 return cnt;
2946 static struct ftrace_page *
2947 ftrace_allocate_pages(unsigned long num_to_init)
2949 struct ftrace_page *start_pg;
2950 struct ftrace_page *pg;
2951 int order;
2952 int cnt;
2954 if (!num_to_init)
2955 return 0;
2957 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
2958 if (!pg)
2959 return NULL;
2962 * Try to allocate as much as possible in one continues
2963 * location that fills in all of the space. We want to
2964 * waste as little space as possible.
2966 for (;;) {
2967 cnt = ftrace_allocate_records(pg, num_to_init);
2968 if (cnt < 0)
2969 goto free_pages;
2971 num_to_init -= cnt;
2972 if (!num_to_init)
2973 break;
2975 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
2976 if (!pg->next)
2977 goto free_pages;
2979 pg = pg->next;
2982 return start_pg;
2984 free_pages:
2985 pg = start_pg;
2986 while (pg) {
2987 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
2988 free_pages((unsigned long)pg->records, order);
2989 start_pg = pg->next;
2990 kfree(pg);
2991 pg = start_pg;
2993 pr_info("ftrace: FAILED to allocate memory for functions\n");
2994 return NULL;
2997 #define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
2999 struct ftrace_iterator {
3000 loff_t pos;
3001 loff_t func_pos;
3002 struct ftrace_page *pg;
3003 struct dyn_ftrace *func;
3004 struct ftrace_func_probe *probe;
3005 struct trace_parser parser;
3006 struct ftrace_hash *hash;
3007 struct ftrace_ops *ops;
3008 int hidx;
3009 int idx;
3010 unsigned flags;
3013 static void *
3014 t_hash_next(struct seq_file *m, loff_t *pos)
3016 struct ftrace_iterator *iter = m->private;
3017 struct hlist_node *hnd = NULL;
3018 struct hlist_head *hhd;
3020 (*pos)++;
3021 iter->pos = *pos;
3023 if (iter->probe)
3024 hnd = &iter->probe->node;
3025 retry:
3026 if (iter->hidx >= FTRACE_FUNC_HASHSIZE)
3027 return NULL;
3029 hhd = &ftrace_func_hash[iter->hidx];
3031 if (hlist_empty(hhd)) {
3032 iter->hidx++;
3033 hnd = NULL;
3034 goto retry;
3037 if (!hnd)
3038 hnd = hhd->first;
3039 else {
3040 hnd = hnd->next;
3041 if (!hnd) {
3042 iter->hidx++;
3043 goto retry;
3047 if (WARN_ON_ONCE(!hnd))
3048 return NULL;
3050 iter->probe = hlist_entry(hnd, struct ftrace_func_probe, node);
3052 return iter;
3055 static void *t_hash_start(struct seq_file *m, loff_t *pos)
3057 struct ftrace_iterator *iter = m->private;
3058 void *p = NULL;
3059 loff_t l;
3061 if (!(iter->flags & FTRACE_ITER_DO_HASH))
3062 return NULL;
3064 if (iter->func_pos > *pos)
3065 return NULL;
3067 iter->hidx = 0;
3068 for (l = 0; l <= (*pos - iter->func_pos); ) {
3069 p = t_hash_next(m, &l);
3070 if (!p)
3071 break;
3073 if (!p)
3074 return NULL;
3076 /* Only set this if we have an item */
3077 iter->flags |= FTRACE_ITER_HASH;
3079 return iter;
3082 static int
3083 t_hash_show(struct seq_file *m, struct ftrace_iterator *iter)
3085 struct ftrace_func_probe *rec;
3087 rec = iter->probe;
3088 if (WARN_ON_ONCE(!rec))
3089 return -EIO;
3091 if (rec->ops->print)
3092 return rec->ops->print(m, rec->ip, rec->ops, rec->data);
3094 seq_printf(m, "%ps:%ps", (void *)rec->ip, (void *)rec->ops->func);
3096 if (rec->data)
3097 seq_printf(m, ":%p", rec->data);
3098 seq_putc(m, '\n');
3100 return 0;
3103 static void *
3104 t_next(struct seq_file *m, void *v, loff_t *pos)
3106 struct ftrace_iterator *iter = m->private;
3107 struct ftrace_ops *ops = iter->ops;
3108 struct dyn_ftrace *rec = NULL;
3110 if (unlikely(ftrace_disabled))
3111 return NULL;
3113 if (iter->flags & FTRACE_ITER_HASH)
3114 return t_hash_next(m, pos);
3116 (*pos)++;
3117 iter->pos = iter->func_pos = *pos;
3119 if (iter->flags & FTRACE_ITER_PRINTALL)
3120 return t_hash_start(m, pos);
3122 retry:
3123 if (iter->idx >= iter->pg->index) {
3124 if (iter->pg->next) {
3125 iter->pg = iter->pg->next;
3126 iter->idx = 0;
3127 goto retry;
3129 } else {
3130 rec = &iter->pg->records[iter->idx++];
3131 if (((iter->flags & FTRACE_ITER_FILTER) &&
3132 !(ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))) ||
3134 ((iter->flags & FTRACE_ITER_NOTRACE) &&
3135 !ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip)) ||
3137 ((iter->flags & FTRACE_ITER_ENABLED) &&
3138 !(rec->flags & FTRACE_FL_ENABLED))) {
3140 rec = NULL;
3141 goto retry;
3145 if (!rec)
3146 return t_hash_start(m, pos);
3148 iter->func = rec;
3150 return iter;
3153 static void reset_iter_read(struct ftrace_iterator *iter)
3155 iter->pos = 0;
3156 iter->func_pos = 0;
3157 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_HASH);
3160 static void *t_start(struct seq_file *m, loff_t *pos)
3162 struct ftrace_iterator *iter = m->private;
3163 struct ftrace_ops *ops = iter->ops;
3164 void *p = NULL;
3165 loff_t l;
3167 mutex_lock(&ftrace_lock);
3169 if (unlikely(ftrace_disabled))
3170 return NULL;
3173 * If an lseek was done, then reset and start from beginning.
3175 if (*pos < iter->pos)
3176 reset_iter_read(iter);
3179 * For set_ftrace_filter reading, if we have the filter
3180 * off, we can short cut and just print out that all
3181 * functions are enabled.
3183 if ((iter->flags & FTRACE_ITER_FILTER &&
3184 ftrace_hash_empty(ops->func_hash->filter_hash)) ||
3185 (iter->flags & FTRACE_ITER_NOTRACE &&
3186 ftrace_hash_empty(ops->func_hash->notrace_hash))) {
3187 if (*pos > 0)
3188 return t_hash_start(m, pos);
3189 iter->flags |= FTRACE_ITER_PRINTALL;
3190 /* reset in case of seek/pread */
3191 iter->flags &= ~FTRACE_ITER_HASH;
3192 return iter;
3195 if (iter->flags & FTRACE_ITER_HASH)
3196 return t_hash_start(m, pos);
3199 * Unfortunately, we need to restart at ftrace_pages_start
3200 * every time we let go of the ftrace_mutex. This is because
3201 * those pointers can change without the lock.
3203 iter->pg = ftrace_pages_start;
3204 iter->idx = 0;
3205 for (l = 0; l <= *pos; ) {
3206 p = t_next(m, p, &l);
3207 if (!p)
3208 break;
3211 if (!p)
3212 return t_hash_start(m, pos);
3214 return iter;
3217 static void t_stop(struct seq_file *m, void *p)
3219 mutex_unlock(&ftrace_lock);
3222 void * __weak
3223 arch_ftrace_trampoline_func(struct ftrace_ops *ops, struct dyn_ftrace *rec)
3225 return NULL;
3228 static void add_trampoline_func(struct seq_file *m, struct ftrace_ops *ops,
3229 struct dyn_ftrace *rec)
3231 void *ptr;
3233 ptr = arch_ftrace_trampoline_func(ops, rec);
3234 if (ptr)
3235 seq_printf(m, " ->%pS", ptr);
3238 static int t_show(struct seq_file *m, void *v)
3240 struct ftrace_iterator *iter = m->private;
3241 struct dyn_ftrace *rec;
3243 if (iter->flags & FTRACE_ITER_HASH)
3244 return t_hash_show(m, iter);
3246 if (iter->flags & FTRACE_ITER_PRINTALL) {
3247 if (iter->flags & FTRACE_ITER_NOTRACE)
3248 seq_puts(m, "#### no functions disabled ####\n");
3249 else
3250 seq_puts(m, "#### all functions enabled ####\n");
3251 return 0;
3254 rec = iter->func;
3256 if (!rec)
3257 return 0;
3259 seq_printf(m, "%ps", (void *)rec->ip);
3260 if (iter->flags & FTRACE_ITER_ENABLED) {
3261 struct ftrace_ops *ops = NULL;
3263 seq_printf(m, " (%ld)%s%s",
3264 ftrace_rec_count(rec),
3265 rec->flags & FTRACE_FL_REGS ? " R" : " ",
3266 rec->flags & FTRACE_FL_IPMODIFY ? " I" : " ");
3267 if (rec->flags & FTRACE_FL_TRAMP_EN) {
3268 ops = ftrace_find_tramp_ops_any(rec);
3269 if (ops)
3270 seq_printf(m, "\ttramp: %pS",
3271 (void *)ops->trampoline);
3272 else
3273 seq_puts(m, "\ttramp: ERROR!");
3276 add_trampoline_func(m, ops, rec);
3279 seq_putc(m, '\n');
3281 return 0;
3284 static const struct seq_operations show_ftrace_seq_ops = {
3285 .start = t_start,
3286 .next = t_next,
3287 .stop = t_stop,
3288 .show = t_show,
3291 static int
3292 ftrace_avail_open(struct inode *inode, struct file *file)
3294 struct ftrace_iterator *iter;
3296 if (unlikely(ftrace_disabled))
3297 return -ENODEV;
3299 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3300 if (iter) {
3301 iter->pg = ftrace_pages_start;
3302 iter->ops = &global_ops;
3305 return iter ? 0 : -ENOMEM;
3308 static int
3309 ftrace_enabled_open(struct inode *inode, struct file *file)
3311 struct ftrace_iterator *iter;
3313 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3314 if (iter) {
3315 iter->pg = ftrace_pages_start;
3316 iter->flags = FTRACE_ITER_ENABLED;
3317 iter->ops = &global_ops;
3320 return iter ? 0 : -ENOMEM;
3324 * ftrace_regex_open - initialize function tracer filter files
3325 * @ops: The ftrace_ops that hold the hash filters
3326 * @flag: The type of filter to process
3327 * @inode: The inode, usually passed in to your open routine
3328 * @file: The file, usually passed in to your open routine
3330 * ftrace_regex_open() initializes the filter files for the
3331 * @ops. Depending on @flag it may process the filter hash or
3332 * the notrace hash of @ops. With this called from the open
3333 * routine, you can use ftrace_filter_write() for the write
3334 * routine if @flag has FTRACE_ITER_FILTER set, or
3335 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
3336 * tracing_lseek() should be used as the lseek routine, and
3337 * release must call ftrace_regex_release().
3340 ftrace_regex_open(struct ftrace_ops *ops, int flag,
3341 struct inode *inode, struct file *file)
3343 struct ftrace_iterator *iter;
3344 struct ftrace_hash *hash;
3345 int ret = 0;
3347 ftrace_ops_init(ops);
3349 if (unlikely(ftrace_disabled))
3350 return -ENODEV;
3352 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
3353 if (!iter)
3354 return -ENOMEM;
3356 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
3357 kfree(iter);
3358 return -ENOMEM;
3361 iter->ops = ops;
3362 iter->flags = flag;
3364 mutex_lock(&ops->func_hash->regex_lock);
3366 if (flag & FTRACE_ITER_NOTRACE)
3367 hash = ops->func_hash->notrace_hash;
3368 else
3369 hash = ops->func_hash->filter_hash;
3371 if (file->f_mode & FMODE_WRITE) {
3372 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3374 if (file->f_flags & O_TRUNC)
3375 iter->hash = alloc_ftrace_hash(size_bits);
3376 else
3377 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3379 if (!iter->hash) {
3380 trace_parser_put(&iter->parser);
3381 kfree(iter);
3382 ret = -ENOMEM;
3383 goto out_unlock;
3387 if (file->f_mode & FMODE_READ) {
3388 iter->pg = ftrace_pages_start;
3390 ret = seq_open(file, &show_ftrace_seq_ops);
3391 if (!ret) {
3392 struct seq_file *m = file->private_data;
3393 m->private = iter;
3394 } else {
3395 /* Failed */
3396 free_ftrace_hash(iter->hash);
3397 trace_parser_put(&iter->parser);
3398 kfree(iter);
3400 } else
3401 file->private_data = iter;
3403 out_unlock:
3404 mutex_unlock(&ops->func_hash->regex_lock);
3406 return ret;
3409 static int
3410 ftrace_filter_open(struct inode *inode, struct file *file)
3412 struct ftrace_ops *ops = inode->i_private;
3414 return ftrace_regex_open(ops,
3415 FTRACE_ITER_FILTER | FTRACE_ITER_DO_HASH,
3416 inode, file);
3419 static int
3420 ftrace_notrace_open(struct inode *inode, struct file *file)
3422 struct ftrace_ops *ops = inode->i_private;
3424 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3425 inode, file);
3428 /* Type for quick search ftrace basic regexes (globs) from filter_parse_regex */
3429 struct ftrace_glob {
3430 char *search;
3431 unsigned len;
3432 int type;
3435 static int ftrace_match(char *str, struct ftrace_glob *g)
3437 int matched = 0;
3438 int slen;
3440 switch (g->type) {
3441 case MATCH_FULL:
3442 if (strcmp(str, g->search) == 0)
3443 matched = 1;
3444 break;
3445 case MATCH_FRONT_ONLY:
3446 if (strncmp(str, g->search, g->len) == 0)
3447 matched = 1;
3448 break;
3449 case MATCH_MIDDLE_ONLY:
3450 if (strstr(str, g->search))
3451 matched = 1;
3452 break;
3453 case MATCH_END_ONLY:
3454 slen = strlen(str);
3455 if (slen >= g->len &&
3456 memcmp(str + slen - g->len, g->search, g->len) == 0)
3457 matched = 1;
3458 break;
3461 return matched;
3464 static int
3465 enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter)
3467 struct ftrace_func_entry *entry;
3468 int ret = 0;
3470 entry = ftrace_lookup_ip(hash, rec->ip);
3471 if (clear_filter) {
3472 /* Do nothing if it doesn't exist */
3473 if (!entry)
3474 return 0;
3476 free_hash_entry(hash, entry);
3477 } else {
3478 /* Do nothing if it exists */
3479 if (entry)
3480 return 0;
3482 ret = add_hash_entry(hash, rec->ip);
3484 return ret;
3487 static int
3488 ftrace_match_record(struct dyn_ftrace *rec, struct ftrace_glob *func_g,
3489 struct ftrace_glob *mod_g, int exclude_mod)
3491 char str[KSYM_SYMBOL_LEN];
3492 char *modname;
3494 kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);
3496 if (mod_g) {
3497 int mod_matches = (modname) ? ftrace_match(modname, mod_g) : 0;
3499 /* blank module name to match all modules */
3500 if (!mod_g->len) {
3501 /* blank module globbing: modname xor exclude_mod */
3502 if ((!exclude_mod) != (!modname))
3503 goto func_match;
3504 return 0;
3507 /* not matching the module */
3508 if (!modname || !mod_matches) {
3509 if (exclude_mod)
3510 goto func_match;
3511 else
3512 return 0;
3515 if (mod_matches && exclude_mod)
3516 return 0;
3518 func_match:
3519 /* blank search means to match all funcs in the mod */
3520 if (!func_g->len)
3521 return 1;
3524 return ftrace_match(str, func_g);
3527 static int
3528 match_records(struct ftrace_hash *hash, char *func, int len, char *mod)
3530 struct ftrace_page *pg;
3531 struct dyn_ftrace *rec;
3532 struct ftrace_glob func_g = { .type = MATCH_FULL };
3533 struct ftrace_glob mod_g = { .type = MATCH_FULL };
3534 struct ftrace_glob *mod_match = (mod) ? &mod_g : NULL;
3535 int exclude_mod = 0;
3536 int found = 0;
3537 int ret;
3538 int clear_filter;
3540 if (func) {
3541 func_g.type = filter_parse_regex(func, len, &func_g.search,
3542 &clear_filter);
3543 func_g.len = strlen(func_g.search);
3546 if (mod) {
3547 mod_g.type = filter_parse_regex(mod, strlen(mod),
3548 &mod_g.search, &exclude_mod);
3549 mod_g.len = strlen(mod_g.search);
3552 mutex_lock(&ftrace_lock);
3554 if (unlikely(ftrace_disabled))
3555 goto out_unlock;
3557 do_for_each_ftrace_rec(pg, rec) {
3558 if (ftrace_match_record(rec, &func_g, mod_match, exclude_mod)) {
3559 ret = enter_record(hash, rec, clear_filter);
3560 if (ret < 0) {
3561 found = ret;
3562 goto out_unlock;
3564 found = 1;
3566 } while_for_each_ftrace_rec();
3567 out_unlock:
3568 mutex_unlock(&ftrace_lock);
3570 return found;
3573 static int
3574 ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
3576 return match_records(hash, buff, len, NULL);
3581 * We register the module command as a template to show others how
3582 * to register the a command as well.
3585 static int
3586 ftrace_mod_callback(struct ftrace_hash *hash,
3587 char *func, char *cmd, char *module, int enable)
3589 int ret;
3592 * cmd == 'mod' because we only registered this func
3593 * for the 'mod' ftrace_func_command.
3594 * But if you register one func with multiple commands,
3595 * you can tell which command was used by the cmd
3596 * parameter.
3598 ret = match_records(hash, func, strlen(func), module);
3599 if (!ret)
3600 return -EINVAL;
3601 if (ret < 0)
3602 return ret;
3603 return 0;
3606 static struct ftrace_func_command ftrace_mod_cmd = {
3607 .name = "mod",
3608 .func = ftrace_mod_callback,
3611 static int __init ftrace_mod_cmd_init(void)
3613 return register_ftrace_command(&ftrace_mod_cmd);
3615 core_initcall(ftrace_mod_cmd_init);
3617 static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
3618 struct ftrace_ops *op, struct pt_regs *pt_regs)
3620 struct ftrace_func_probe *entry;
3621 struct hlist_head *hhd;
3622 unsigned long key;
3624 key = hash_long(ip, FTRACE_HASH_BITS);
3626 hhd = &ftrace_func_hash[key];
3628 if (hlist_empty(hhd))
3629 return;
3632 * Disable preemption for these calls to prevent a RCU grace
3633 * period. This syncs the hash iteration and freeing of items
3634 * on the hash. rcu_read_lock is too dangerous here.
3636 preempt_disable_notrace();
3637 hlist_for_each_entry_rcu_notrace(entry, hhd, node) {
3638 if (entry->ip == ip)
3639 entry->ops->func(ip, parent_ip, &entry->data);
3641 preempt_enable_notrace();
3644 static struct ftrace_ops trace_probe_ops __read_mostly =
3646 .func = function_trace_probe_call,
3647 .flags = FTRACE_OPS_FL_INITIALIZED,
3648 INIT_OPS_HASH(trace_probe_ops)
3651 static int ftrace_probe_registered;
3653 static void __enable_ftrace_function_probe(struct ftrace_ops_hash *old_hash)
3655 int ret;
3656 int i;
3658 if (ftrace_probe_registered) {
3659 /* still need to update the function call sites */
3660 if (ftrace_enabled)
3661 ftrace_run_modify_code(&trace_probe_ops, FTRACE_UPDATE_CALLS,
3662 old_hash);
3663 return;
3666 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3667 struct hlist_head *hhd = &ftrace_func_hash[i];
3668 if (hhd->first)
3669 break;
3671 /* Nothing registered? */
3672 if (i == FTRACE_FUNC_HASHSIZE)
3673 return;
3675 ret = ftrace_startup(&trace_probe_ops, 0);
3677 ftrace_probe_registered = 1;
3680 static void __disable_ftrace_function_probe(void)
3682 int i;
3684 if (!ftrace_probe_registered)
3685 return;
3687 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3688 struct hlist_head *hhd = &ftrace_func_hash[i];
3689 if (hhd->first)
3690 return;
3693 /* no more funcs left */
3694 ftrace_shutdown(&trace_probe_ops, 0);
3696 ftrace_probe_registered = 0;
3700 static void ftrace_free_entry(struct ftrace_func_probe *entry)
3702 if (entry->ops->free)
3703 entry->ops->free(entry->ops, entry->ip, &entry->data);
3704 kfree(entry);
3708 register_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3709 void *data)
3711 struct ftrace_ops_hash old_hash_ops;
3712 struct ftrace_func_probe *entry;
3713 struct ftrace_glob func_g;
3714 struct ftrace_hash **orig_hash = &trace_probe_ops.func_hash->filter_hash;
3715 struct ftrace_hash *old_hash = *orig_hash;
3716 struct ftrace_hash *hash;
3717 struct ftrace_page *pg;
3718 struct dyn_ftrace *rec;
3719 int not;
3720 unsigned long key;
3721 int count = 0;
3722 int ret;
3724 func_g.type = filter_parse_regex(glob, strlen(glob),
3725 &func_g.search, &not);
3726 func_g.len = strlen(func_g.search);
3728 /* we do not support '!' for function probes */
3729 if (WARN_ON(not))
3730 return -EINVAL;
3732 mutex_lock(&trace_probe_ops.func_hash->regex_lock);
3734 old_hash_ops.filter_hash = old_hash;
3735 /* Probes only have filters */
3736 old_hash_ops.notrace_hash = NULL;
3738 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
3739 if (!hash) {
3740 count = -ENOMEM;
3741 goto out;
3744 if (unlikely(ftrace_disabled)) {
3745 count = -ENODEV;
3746 goto out;
3749 mutex_lock(&ftrace_lock);
3751 do_for_each_ftrace_rec(pg, rec) {
3753 if (!ftrace_match_record(rec, &func_g, NULL, 0))
3754 continue;
3756 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
3757 if (!entry) {
3758 /* If we did not process any, then return error */
3759 if (!count)
3760 count = -ENOMEM;
3761 goto out_unlock;
3764 count++;
3766 entry->data = data;
3769 * The caller might want to do something special
3770 * for each function we find. We call the callback
3771 * to give the caller an opportunity to do so.
3773 if (ops->init) {
3774 if (ops->init(ops, rec->ip, &entry->data) < 0) {
3775 /* caller does not like this func */
3776 kfree(entry);
3777 continue;
3781 ret = enter_record(hash, rec, 0);
3782 if (ret < 0) {
3783 kfree(entry);
3784 count = ret;
3785 goto out_unlock;
3788 entry->ops = ops;
3789 entry->ip = rec->ip;
3791 key = hash_long(entry->ip, FTRACE_HASH_BITS);
3792 hlist_add_head_rcu(&entry->node, &ftrace_func_hash[key]);
3794 } while_for_each_ftrace_rec();
3796 ret = ftrace_hash_move(&trace_probe_ops, 1, orig_hash, hash);
3798 __enable_ftrace_function_probe(&old_hash_ops);
3800 if (!ret)
3801 free_ftrace_hash_rcu(old_hash);
3802 else
3803 count = ret;
3805 out_unlock:
3806 mutex_unlock(&ftrace_lock);
3807 out:
3808 mutex_unlock(&trace_probe_ops.func_hash->regex_lock);
3809 free_ftrace_hash(hash);
3811 return count;
3814 enum {
3815 PROBE_TEST_FUNC = 1,
3816 PROBE_TEST_DATA = 2
3819 static void
3820 __unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3821 void *data, int flags)
3823 struct ftrace_func_entry *rec_entry;
3824 struct ftrace_func_probe *entry;
3825 struct ftrace_func_probe *p;
3826 struct ftrace_glob func_g;
3827 struct ftrace_hash **orig_hash = &trace_probe_ops.func_hash->filter_hash;
3828 struct ftrace_hash *old_hash = *orig_hash;
3829 struct list_head free_list;
3830 struct ftrace_hash *hash;
3831 struct hlist_node *tmp;
3832 char str[KSYM_SYMBOL_LEN];
3833 int i, ret;
3835 if (glob && (strcmp(glob, "*") == 0 || !strlen(glob)))
3836 func_g.search = NULL;
3837 else if (glob) {
3838 int not;
3840 func_g.type = filter_parse_regex(glob, strlen(glob),
3841 &func_g.search, &not);
3842 func_g.len = strlen(func_g.search);
3843 func_g.search = glob;
3845 /* we do not support '!' for function probes */
3846 if (WARN_ON(not))
3847 return;
3850 mutex_lock(&trace_probe_ops.func_hash->regex_lock);
3852 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
3853 if (!hash)
3854 /* Hmm, should report this somehow */
3855 goto out_unlock;
3857 INIT_LIST_HEAD(&free_list);
3859 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3860 struct hlist_head *hhd = &ftrace_func_hash[i];
3862 hlist_for_each_entry_safe(entry, tmp, hhd, node) {
3864 /* break up if statements for readability */
3865 if ((flags & PROBE_TEST_FUNC) && entry->ops != ops)
3866 continue;
3868 if ((flags & PROBE_TEST_DATA) && entry->data != data)
3869 continue;
3871 /* do this last, since it is the most expensive */
3872 if (func_g.search) {
3873 kallsyms_lookup(entry->ip, NULL, NULL,
3874 NULL, str);
3875 if (!ftrace_match(str, &func_g))
3876 continue;
3879 rec_entry = ftrace_lookup_ip(hash, entry->ip);
3880 /* It is possible more than one entry had this ip */
3881 if (rec_entry)
3882 free_hash_entry(hash, rec_entry);
3884 hlist_del_rcu(&entry->node);
3885 list_add(&entry->free_list, &free_list);
3888 mutex_lock(&ftrace_lock);
3889 __disable_ftrace_function_probe();
3891 * Remove after the disable is called. Otherwise, if the last
3892 * probe is removed, a null hash means *all enabled*.
3894 ret = ftrace_hash_move(&trace_probe_ops, 1, orig_hash, hash);
3895 synchronize_sched();
3896 if (!ret)
3897 free_ftrace_hash_rcu(old_hash);
3899 list_for_each_entry_safe(entry, p, &free_list, free_list) {
3900 list_del(&entry->free_list);
3901 ftrace_free_entry(entry);
3903 mutex_unlock(&ftrace_lock);
3905 out_unlock:
3906 mutex_unlock(&trace_probe_ops.func_hash->regex_lock);
3907 free_ftrace_hash(hash);
3910 void
3911 unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3912 void *data)
3914 __unregister_ftrace_function_probe(glob, ops, data,
3915 PROBE_TEST_FUNC | PROBE_TEST_DATA);
3918 void
3919 unregister_ftrace_function_probe_func(char *glob, struct ftrace_probe_ops *ops)
3921 __unregister_ftrace_function_probe(glob, ops, NULL, PROBE_TEST_FUNC);
3924 void unregister_ftrace_function_probe_all(char *glob)
3926 __unregister_ftrace_function_probe(glob, NULL, NULL, 0);
3929 static LIST_HEAD(ftrace_commands);
3930 static DEFINE_MUTEX(ftrace_cmd_mutex);
3933 * Currently we only register ftrace commands from __init, so mark this
3934 * __init too.
3936 __init int register_ftrace_command(struct ftrace_func_command *cmd)
3938 struct ftrace_func_command *p;
3939 int ret = 0;
3941 mutex_lock(&ftrace_cmd_mutex);
3942 list_for_each_entry(p, &ftrace_commands, list) {
3943 if (strcmp(cmd->name, p->name) == 0) {
3944 ret = -EBUSY;
3945 goto out_unlock;
3948 list_add(&cmd->list, &ftrace_commands);
3949 out_unlock:
3950 mutex_unlock(&ftrace_cmd_mutex);
3952 return ret;
3956 * Currently we only unregister ftrace commands from __init, so mark
3957 * this __init too.
3959 __init int unregister_ftrace_command(struct ftrace_func_command *cmd)
3961 struct ftrace_func_command *p, *n;
3962 int ret = -ENODEV;
3964 mutex_lock(&ftrace_cmd_mutex);
3965 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
3966 if (strcmp(cmd->name, p->name) == 0) {
3967 ret = 0;
3968 list_del_init(&p->list);
3969 goto out_unlock;
3972 out_unlock:
3973 mutex_unlock(&ftrace_cmd_mutex);
3975 return ret;
3978 static int ftrace_process_regex(struct ftrace_hash *hash,
3979 char *buff, int len, int enable)
3981 char *func, *command, *next = buff;
3982 struct ftrace_func_command *p;
3983 int ret = -EINVAL;
3985 func = strsep(&next, ":");
3987 if (!next) {
3988 ret = ftrace_match_records(hash, func, len);
3989 if (!ret)
3990 ret = -EINVAL;
3991 if (ret < 0)
3992 return ret;
3993 return 0;
3996 /* command found */
3998 command = strsep(&next, ":");
4000 mutex_lock(&ftrace_cmd_mutex);
4001 list_for_each_entry(p, &ftrace_commands, list) {
4002 if (strcmp(p->name, command) == 0) {
4003 ret = p->func(hash, func, command, next, enable);
4004 goto out_unlock;
4007 out_unlock:
4008 mutex_unlock(&ftrace_cmd_mutex);
4010 return ret;
4013 static ssize_t
4014 ftrace_regex_write(struct file *file, const char __user *ubuf,
4015 size_t cnt, loff_t *ppos, int enable)
4017 struct ftrace_iterator *iter;
4018 struct trace_parser *parser;
4019 ssize_t ret, read;
4021 if (!cnt)
4022 return 0;
4024 if (file->f_mode & FMODE_READ) {
4025 struct seq_file *m = file->private_data;
4026 iter = m->private;
4027 } else
4028 iter = file->private_data;
4030 if (unlikely(ftrace_disabled))
4031 return -ENODEV;
4033 /* iter->hash is a local copy, so we don't need regex_lock */
4035 parser = &iter->parser;
4036 read = trace_get_user(parser, ubuf, cnt, ppos);
4038 if (read >= 0 && trace_parser_loaded(parser) &&
4039 !trace_parser_cont(parser)) {
4040 ret = ftrace_process_regex(iter->hash, parser->buffer,
4041 parser->idx, enable);
4042 trace_parser_clear(parser);
4043 if (ret < 0)
4044 goto out;
4047 ret = read;
4048 out:
4049 return ret;
4052 ssize_t
4053 ftrace_filter_write(struct file *file, const char __user *ubuf,
4054 size_t cnt, loff_t *ppos)
4056 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
4059 ssize_t
4060 ftrace_notrace_write(struct file *file, const char __user *ubuf,
4061 size_t cnt, loff_t *ppos)
4063 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
4066 static int
4067 ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
4069 struct ftrace_func_entry *entry;
4071 if (!ftrace_location(ip))
4072 return -EINVAL;
4074 if (remove) {
4075 entry = ftrace_lookup_ip(hash, ip);
4076 if (!entry)
4077 return -ENOENT;
4078 free_hash_entry(hash, entry);
4079 return 0;
4082 return add_hash_entry(hash, ip);
4085 static void ftrace_ops_update_code(struct ftrace_ops *ops,
4086 struct ftrace_ops_hash *old_hash)
4088 struct ftrace_ops *op;
4090 if (!ftrace_enabled)
4091 return;
4093 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
4094 ftrace_run_modify_code(ops, FTRACE_UPDATE_CALLS, old_hash);
4095 return;
4099 * If this is the shared global_ops filter, then we need to
4100 * check if there is another ops that shares it, is enabled.
4101 * If so, we still need to run the modify code.
4103 if (ops->func_hash != &global_ops.local_hash)
4104 return;
4106 do_for_each_ftrace_op(op, ftrace_ops_list) {
4107 if (op->func_hash == &global_ops.local_hash &&
4108 op->flags & FTRACE_OPS_FL_ENABLED) {
4109 ftrace_run_modify_code(op, FTRACE_UPDATE_CALLS, old_hash);
4110 /* Only need to do this once */
4111 return;
4113 } while_for_each_ftrace_op(op);
4116 static int
4117 ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
4118 unsigned long ip, int remove, int reset, int enable)
4120 struct ftrace_hash **orig_hash;
4121 struct ftrace_ops_hash old_hash_ops;
4122 struct ftrace_hash *old_hash;
4123 struct ftrace_hash *hash;
4124 int ret;
4126 if (unlikely(ftrace_disabled))
4127 return -ENODEV;
4129 mutex_lock(&ops->func_hash->regex_lock);
4131 if (enable)
4132 orig_hash = &ops->func_hash->filter_hash;
4133 else
4134 orig_hash = &ops->func_hash->notrace_hash;
4136 if (reset)
4137 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4138 else
4139 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
4141 if (!hash) {
4142 ret = -ENOMEM;
4143 goto out_regex_unlock;
4146 if (buf && !ftrace_match_records(hash, buf, len)) {
4147 ret = -EINVAL;
4148 goto out_regex_unlock;
4150 if (ip) {
4151 ret = ftrace_match_addr(hash, ip, remove);
4152 if (ret < 0)
4153 goto out_regex_unlock;
4156 mutex_lock(&ftrace_lock);
4157 old_hash = *orig_hash;
4158 old_hash_ops.filter_hash = ops->func_hash->filter_hash;
4159 old_hash_ops.notrace_hash = ops->func_hash->notrace_hash;
4160 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
4161 if (!ret) {
4162 ftrace_ops_update_code(ops, &old_hash_ops);
4163 free_ftrace_hash_rcu(old_hash);
4165 mutex_unlock(&ftrace_lock);
4167 out_regex_unlock:
4168 mutex_unlock(&ops->func_hash->regex_lock);
4170 free_ftrace_hash(hash);
4171 return ret;
4174 static int
4175 ftrace_set_addr(struct ftrace_ops *ops, unsigned long ip, int remove,
4176 int reset, int enable)
4178 return ftrace_set_hash(ops, 0, 0, ip, remove, reset, enable);
4182 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
4183 * @ops - the ops to set the filter with
4184 * @ip - the address to add to or remove from the filter.
4185 * @remove - non zero to remove the ip from the filter
4186 * @reset - non zero to reset all filters before applying this filter.
4188 * Filters denote which functions should be enabled when tracing is enabled
4189 * If @ip is NULL, it failes to update filter.
4191 int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
4192 int remove, int reset)
4194 ftrace_ops_init(ops);
4195 return ftrace_set_addr(ops, ip, remove, reset, 1);
4197 EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
4199 static int
4200 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
4201 int reset, int enable)
4203 return ftrace_set_hash(ops, buf, len, 0, 0, reset, enable);
4207 * ftrace_set_filter - set a function to filter on in ftrace
4208 * @ops - the ops to set the filter with
4209 * @buf - the string that holds the function filter text.
4210 * @len - the length of the string.
4211 * @reset - non zero to reset all filters before applying this filter.
4213 * Filters denote which functions should be enabled when tracing is enabled.
4214 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4216 int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
4217 int len, int reset)
4219 ftrace_ops_init(ops);
4220 return ftrace_set_regex(ops, buf, len, reset, 1);
4222 EXPORT_SYMBOL_GPL(ftrace_set_filter);
4225 * ftrace_set_notrace - set a function to not trace in ftrace
4226 * @ops - the ops to set the notrace filter with
4227 * @buf - the string that holds the function notrace text.
4228 * @len - the length of the string.
4229 * @reset - non zero to reset all filters before applying this filter.
4231 * Notrace Filters denote which functions should not be enabled when tracing
4232 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4233 * for tracing.
4235 int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
4236 int len, int reset)
4238 ftrace_ops_init(ops);
4239 return ftrace_set_regex(ops, buf, len, reset, 0);
4241 EXPORT_SYMBOL_GPL(ftrace_set_notrace);
4243 * ftrace_set_global_filter - set a function to filter on with global tracers
4244 * @buf - the string that holds the function filter text.
4245 * @len - the length of the string.
4246 * @reset - non zero to reset all filters before applying this filter.
4248 * Filters denote which functions should be enabled when tracing is enabled.
4249 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4251 void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
4253 ftrace_set_regex(&global_ops, buf, len, reset, 1);
4255 EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
4258 * ftrace_set_global_notrace - set a function to not trace with global tracers
4259 * @buf - the string that holds the function notrace text.
4260 * @len - the length of the string.
4261 * @reset - non zero to reset all filters before applying this filter.
4263 * Notrace Filters denote which functions should not be enabled when tracing
4264 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4265 * for tracing.
4267 void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
4269 ftrace_set_regex(&global_ops, buf, len, reset, 0);
4271 EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
4274 * command line interface to allow users to set filters on boot up.
4276 #define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
4277 static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4278 static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
4280 /* Used by function selftest to not test if filter is set */
4281 bool ftrace_filter_param __initdata;
4283 static int __init set_ftrace_notrace(char *str)
4285 ftrace_filter_param = true;
4286 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
4287 return 1;
4289 __setup("ftrace_notrace=", set_ftrace_notrace);
4291 static int __init set_ftrace_filter(char *str)
4293 ftrace_filter_param = true;
4294 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
4295 return 1;
4297 __setup("ftrace_filter=", set_ftrace_filter);
4299 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4300 static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
4301 static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4302 static int ftrace_set_func(unsigned long *array, int *idx, int size, char *buffer);
4304 static unsigned long save_global_trampoline;
4305 static unsigned long save_global_flags;
4307 static int __init set_graph_function(char *str)
4309 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
4310 return 1;
4312 __setup("ftrace_graph_filter=", set_graph_function);
4314 static int __init set_graph_notrace_function(char *str)
4316 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
4317 return 1;
4319 __setup("ftrace_graph_notrace=", set_graph_notrace_function);
4321 static void __init set_ftrace_early_graph(char *buf, int enable)
4323 int ret;
4324 char *func;
4325 unsigned long *table = ftrace_graph_funcs;
4326 int *count = &ftrace_graph_count;
4328 if (!enable) {
4329 table = ftrace_graph_notrace_funcs;
4330 count = &ftrace_graph_notrace_count;
4333 while (buf) {
4334 func = strsep(&buf, ",");
4335 /* we allow only one expression at a time */
4336 ret = ftrace_set_func(table, count, FTRACE_GRAPH_MAX_FUNCS, func);
4337 if (ret)
4338 printk(KERN_DEBUG "ftrace: function %s not "
4339 "traceable\n", func);
4342 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4344 void __init
4345 ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
4347 char *func;
4349 ftrace_ops_init(ops);
4351 while (buf) {
4352 func = strsep(&buf, ",");
4353 ftrace_set_regex(ops, func, strlen(func), 0, enable);
4357 static void __init set_ftrace_early_filters(void)
4359 if (ftrace_filter_buf[0])
4360 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
4361 if (ftrace_notrace_buf[0])
4362 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
4363 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4364 if (ftrace_graph_buf[0])
4365 set_ftrace_early_graph(ftrace_graph_buf, 1);
4366 if (ftrace_graph_notrace_buf[0])
4367 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
4368 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4371 int ftrace_regex_release(struct inode *inode, struct file *file)
4373 struct seq_file *m = (struct seq_file *)file->private_data;
4374 struct ftrace_ops_hash old_hash_ops;
4375 struct ftrace_iterator *iter;
4376 struct ftrace_hash **orig_hash;
4377 struct ftrace_hash *old_hash;
4378 struct trace_parser *parser;
4379 int filter_hash;
4380 int ret;
4382 if (file->f_mode & FMODE_READ) {
4383 iter = m->private;
4384 seq_release(inode, file);
4385 } else
4386 iter = file->private_data;
4388 parser = &iter->parser;
4389 if (trace_parser_loaded(parser)) {
4390 parser->buffer[parser->idx] = 0;
4391 ftrace_match_records(iter->hash, parser->buffer, parser->idx);
4394 trace_parser_put(parser);
4396 mutex_lock(&iter->ops->func_hash->regex_lock);
4398 if (file->f_mode & FMODE_WRITE) {
4399 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
4401 if (filter_hash)
4402 orig_hash = &iter->ops->func_hash->filter_hash;
4403 else
4404 orig_hash = &iter->ops->func_hash->notrace_hash;
4406 mutex_lock(&ftrace_lock);
4407 old_hash = *orig_hash;
4408 old_hash_ops.filter_hash = iter->ops->func_hash->filter_hash;
4409 old_hash_ops.notrace_hash = iter->ops->func_hash->notrace_hash;
4410 ret = ftrace_hash_move(iter->ops, filter_hash,
4411 orig_hash, iter->hash);
4412 if (!ret) {
4413 ftrace_ops_update_code(iter->ops, &old_hash_ops);
4414 free_ftrace_hash_rcu(old_hash);
4416 mutex_unlock(&ftrace_lock);
4419 mutex_unlock(&iter->ops->func_hash->regex_lock);
4420 free_ftrace_hash(iter->hash);
4421 kfree(iter);
4423 return 0;
4426 static const struct file_operations ftrace_avail_fops = {
4427 .open = ftrace_avail_open,
4428 .read = seq_read,
4429 .llseek = seq_lseek,
4430 .release = seq_release_private,
4433 static const struct file_operations ftrace_enabled_fops = {
4434 .open = ftrace_enabled_open,
4435 .read = seq_read,
4436 .llseek = seq_lseek,
4437 .release = seq_release_private,
4440 static const struct file_operations ftrace_filter_fops = {
4441 .open = ftrace_filter_open,
4442 .read = seq_read,
4443 .write = ftrace_filter_write,
4444 .llseek = tracing_lseek,
4445 .release = ftrace_regex_release,
4448 static const struct file_operations ftrace_notrace_fops = {
4449 .open = ftrace_notrace_open,
4450 .read = seq_read,
4451 .write = ftrace_notrace_write,
4452 .llseek = tracing_lseek,
4453 .release = ftrace_regex_release,
4456 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4458 static DEFINE_MUTEX(graph_lock);
4460 int ftrace_graph_count;
4461 int ftrace_graph_notrace_count;
4462 unsigned long ftrace_graph_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;
4463 unsigned long ftrace_graph_notrace_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;
4465 struct ftrace_graph_data {
4466 unsigned long *table;
4467 size_t size;
4468 int *count;
4469 const struct seq_operations *seq_ops;
4472 static void *
4473 __g_next(struct seq_file *m, loff_t *pos)
4475 struct ftrace_graph_data *fgd = m->private;
4477 if (*pos >= *fgd->count)
4478 return NULL;
4479 return &fgd->table[*pos];
4482 static void *
4483 g_next(struct seq_file *m, void *v, loff_t *pos)
4485 (*pos)++;
4486 return __g_next(m, pos);
4489 static void *g_start(struct seq_file *m, loff_t *pos)
4491 struct ftrace_graph_data *fgd = m->private;
4493 mutex_lock(&graph_lock);
4495 /* Nothing, tell g_show to print all functions are enabled */
4496 if (!*fgd->count && !*pos)
4497 return (void *)1;
4499 return __g_next(m, pos);
4502 static void g_stop(struct seq_file *m, void *p)
4504 mutex_unlock(&graph_lock);
4507 static int g_show(struct seq_file *m, void *v)
4509 unsigned long *ptr = v;
4511 if (!ptr)
4512 return 0;
4514 if (ptr == (unsigned long *)1) {
4515 struct ftrace_graph_data *fgd = m->private;
4517 if (fgd->table == ftrace_graph_funcs)
4518 seq_puts(m, "#### all functions enabled ####\n");
4519 else
4520 seq_puts(m, "#### no functions disabled ####\n");
4521 return 0;
4524 seq_printf(m, "%ps\n", (void *)*ptr);
4526 return 0;
4529 static const struct seq_operations ftrace_graph_seq_ops = {
4530 .start = g_start,
4531 .next = g_next,
4532 .stop = g_stop,
4533 .show = g_show,
4536 static int
4537 __ftrace_graph_open(struct inode *inode, struct file *file,
4538 struct ftrace_graph_data *fgd)
4540 int ret = 0;
4542 mutex_lock(&graph_lock);
4543 if ((file->f_mode & FMODE_WRITE) &&
4544 (file->f_flags & O_TRUNC)) {
4545 *fgd->count = 0;
4546 memset(fgd->table, 0, fgd->size * sizeof(*fgd->table));
4548 mutex_unlock(&graph_lock);
4550 if (file->f_mode & FMODE_READ) {
4551 ret = seq_open(file, fgd->seq_ops);
4552 if (!ret) {
4553 struct seq_file *m = file->private_data;
4554 m->private = fgd;
4556 } else
4557 file->private_data = fgd;
4559 return ret;
4562 static int
4563 ftrace_graph_open(struct inode *inode, struct file *file)
4565 struct ftrace_graph_data *fgd;
4567 if (unlikely(ftrace_disabled))
4568 return -ENODEV;
4570 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
4571 if (fgd == NULL)
4572 return -ENOMEM;
4574 fgd->table = ftrace_graph_funcs;
4575 fgd->size = FTRACE_GRAPH_MAX_FUNCS;
4576 fgd->count = &ftrace_graph_count;
4577 fgd->seq_ops = &ftrace_graph_seq_ops;
4579 return __ftrace_graph_open(inode, file, fgd);
4582 static int
4583 ftrace_graph_notrace_open(struct inode *inode, struct file *file)
4585 struct ftrace_graph_data *fgd;
4587 if (unlikely(ftrace_disabled))
4588 return -ENODEV;
4590 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
4591 if (fgd == NULL)
4592 return -ENOMEM;
4594 fgd->table = ftrace_graph_notrace_funcs;
4595 fgd->size = FTRACE_GRAPH_MAX_FUNCS;
4596 fgd->count = &ftrace_graph_notrace_count;
4597 fgd->seq_ops = &ftrace_graph_seq_ops;
4599 return __ftrace_graph_open(inode, file, fgd);
4602 static int
4603 ftrace_graph_release(struct inode *inode, struct file *file)
4605 if (file->f_mode & FMODE_READ) {
4606 struct seq_file *m = file->private_data;
4608 kfree(m->private);
4609 seq_release(inode, file);
4610 } else {
4611 kfree(file->private_data);
4614 return 0;
4617 static int
4618 ftrace_set_func(unsigned long *array, int *idx, int size, char *buffer)
4620 struct ftrace_glob func_g;
4621 struct dyn_ftrace *rec;
4622 struct ftrace_page *pg;
4623 int fail = 1;
4624 int not;
4625 bool exists;
4626 int i;
4628 /* decode regex */
4629 func_g.type = filter_parse_regex(buffer, strlen(buffer),
4630 &func_g.search, &not);
4631 if (!not && *idx >= size)
4632 return -EBUSY;
4634 func_g.len = strlen(func_g.search);
4636 mutex_lock(&ftrace_lock);
4638 if (unlikely(ftrace_disabled)) {
4639 mutex_unlock(&ftrace_lock);
4640 return -ENODEV;
4643 do_for_each_ftrace_rec(pg, rec) {
4645 if (ftrace_match_record(rec, &func_g, NULL, 0)) {
4646 /* if it is in the array */
4647 exists = false;
4648 for (i = 0; i < *idx; i++) {
4649 if (array[i] == rec->ip) {
4650 exists = true;
4651 break;
4655 if (!not) {
4656 fail = 0;
4657 if (!exists) {
4658 array[(*idx)++] = rec->ip;
4659 if (*idx >= size)
4660 goto out;
4662 } else {
4663 if (exists) {
4664 array[i] = array[--(*idx)];
4665 array[*idx] = 0;
4666 fail = 0;
4670 } while_for_each_ftrace_rec();
4671 out:
4672 mutex_unlock(&ftrace_lock);
4674 if (fail)
4675 return -EINVAL;
4677 return 0;
4680 static ssize_t
4681 ftrace_graph_write(struct file *file, const char __user *ubuf,
4682 size_t cnt, loff_t *ppos)
4684 struct trace_parser parser;
4685 ssize_t read, ret = 0;
4686 struct ftrace_graph_data *fgd = file->private_data;
4688 if (!cnt)
4689 return 0;
4691 if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX))
4692 return -ENOMEM;
4694 read = trace_get_user(&parser, ubuf, cnt, ppos);
4696 if (read >= 0 && trace_parser_loaded((&parser))) {
4697 parser.buffer[parser.idx] = 0;
4699 mutex_lock(&graph_lock);
4701 /* we allow only one expression at a time */
4702 ret = ftrace_set_func(fgd->table, fgd->count, fgd->size,
4703 parser.buffer);
4705 mutex_unlock(&graph_lock);
4708 if (!ret)
4709 ret = read;
4711 trace_parser_put(&parser);
4713 return ret;
4716 static const struct file_operations ftrace_graph_fops = {
4717 .open = ftrace_graph_open,
4718 .read = seq_read,
4719 .write = ftrace_graph_write,
4720 .llseek = tracing_lseek,
4721 .release = ftrace_graph_release,
4724 static const struct file_operations ftrace_graph_notrace_fops = {
4725 .open = ftrace_graph_notrace_open,
4726 .read = seq_read,
4727 .write = ftrace_graph_write,
4728 .llseek = tracing_lseek,
4729 .release = ftrace_graph_release,
4731 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4733 void ftrace_create_filter_files(struct ftrace_ops *ops,
4734 struct dentry *parent)
4737 trace_create_file("set_ftrace_filter", 0644, parent,
4738 ops, &ftrace_filter_fops);
4740 trace_create_file("set_ftrace_notrace", 0644, parent,
4741 ops, &ftrace_notrace_fops);
4745 * The name "destroy_filter_files" is really a misnomer. Although
4746 * in the future, it may actualy delete the files, but this is
4747 * really intended to make sure the ops passed in are disabled
4748 * and that when this function returns, the caller is free to
4749 * free the ops.
4751 * The "destroy" name is only to match the "create" name that this
4752 * should be paired with.
4754 void ftrace_destroy_filter_files(struct ftrace_ops *ops)
4756 mutex_lock(&ftrace_lock);
4757 if (ops->flags & FTRACE_OPS_FL_ENABLED)
4758 ftrace_shutdown(ops, 0);
4759 ops->flags |= FTRACE_OPS_FL_DELETED;
4760 mutex_unlock(&ftrace_lock);
4763 static __init int ftrace_init_dyn_tracefs(struct dentry *d_tracer)
4766 trace_create_file("available_filter_functions", 0444,
4767 d_tracer, NULL, &ftrace_avail_fops);
4769 trace_create_file("enabled_functions", 0444,
4770 d_tracer, NULL, &ftrace_enabled_fops);
4772 ftrace_create_filter_files(&global_ops, d_tracer);
4774 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4775 trace_create_file("set_graph_function", 0444, d_tracer,
4776 NULL,
4777 &ftrace_graph_fops);
4778 trace_create_file("set_graph_notrace", 0444, d_tracer,
4779 NULL,
4780 &ftrace_graph_notrace_fops);
4781 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4783 return 0;
4786 static int ftrace_cmp_ips(const void *a, const void *b)
4788 const unsigned long *ipa = a;
4789 const unsigned long *ipb = b;
4791 if (*ipa > *ipb)
4792 return 1;
4793 if (*ipa < *ipb)
4794 return -1;
4795 return 0;
4798 static int ftrace_process_locs(struct module *mod,
4799 unsigned long *start,
4800 unsigned long *end)
4802 struct ftrace_page *start_pg;
4803 struct ftrace_page *pg;
4804 struct dyn_ftrace *rec;
4805 unsigned long count;
4806 unsigned long *p;
4807 unsigned long addr;
4808 unsigned long flags = 0; /* Shut up gcc */
4809 int ret = -ENOMEM;
4811 count = end - start;
4813 if (!count)
4814 return 0;
4816 sort(start, count, sizeof(*start),
4817 ftrace_cmp_ips, NULL);
4819 start_pg = ftrace_allocate_pages(count);
4820 if (!start_pg)
4821 return -ENOMEM;
4823 mutex_lock(&ftrace_lock);
4826 * Core and each module needs their own pages, as
4827 * modules will free them when they are removed.
4828 * Force a new page to be allocated for modules.
4830 if (!mod) {
4831 WARN_ON(ftrace_pages || ftrace_pages_start);
4832 /* First initialization */
4833 ftrace_pages = ftrace_pages_start = start_pg;
4834 } else {
4835 if (!ftrace_pages)
4836 goto out;
4838 if (WARN_ON(ftrace_pages->next)) {
4839 /* Hmm, we have free pages? */
4840 while (ftrace_pages->next)
4841 ftrace_pages = ftrace_pages->next;
4844 ftrace_pages->next = start_pg;
4847 p = start;
4848 pg = start_pg;
4849 while (p < end) {
4850 addr = ftrace_call_adjust(*p++);
4852 * Some architecture linkers will pad between
4853 * the different mcount_loc sections of different
4854 * object files to satisfy alignments.
4855 * Skip any NULL pointers.
4857 if (!addr)
4858 continue;
4860 if (pg->index == pg->size) {
4861 /* We should have allocated enough */
4862 if (WARN_ON(!pg->next))
4863 break;
4864 pg = pg->next;
4867 rec = &pg->records[pg->index++];
4868 rec->ip = addr;
4871 /* We should have used all pages */
4872 WARN_ON(pg->next);
4874 /* Assign the last page to ftrace_pages */
4875 ftrace_pages = pg;
4878 * We only need to disable interrupts on start up
4879 * because we are modifying code that an interrupt
4880 * may execute, and the modification is not atomic.
4881 * But for modules, nothing runs the code we modify
4882 * until we are finished with it, and there's no
4883 * reason to cause large interrupt latencies while we do it.
4885 if (!mod)
4886 local_irq_save(flags);
4887 ftrace_update_code(mod, start_pg);
4888 if (!mod)
4889 local_irq_restore(flags);
4890 ret = 0;
4891 out:
4892 mutex_unlock(&ftrace_lock);
4894 return ret;
4897 #ifdef CONFIG_MODULES
4899 #define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
4901 void ftrace_release_mod(struct module *mod)
4903 struct dyn_ftrace *rec;
4904 struct ftrace_page **last_pg;
4905 struct ftrace_page *pg;
4906 int order;
4908 mutex_lock(&ftrace_lock);
4910 if (ftrace_disabled)
4911 goto out_unlock;
4914 * Each module has its own ftrace_pages, remove
4915 * them from the list.
4917 last_pg = &ftrace_pages_start;
4918 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
4919 rec = &pg->records[0];
4920 if (within_module_core(rec->ip, mod)) {
4922 * As core pages are first, the first
4923 * page should never be a module page.
4925 if (WARN_ON(pg == ftrace_pages_start))
4926 goto out_unlock;
4928 /* Check if we are deleting the last page */
4929 if (pg == ftrace_pages)
4930 ftrace_pages = next_to_ftrace_page(last_pg);
4932 *last_pg = pg->next;
4933 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
4934 free_pages((unsigned long)pg->records, order);
4935 kfree(pg);
4936 } else
4937 last_pg = &pg->next;
4939 out_unlock:
4940 mutex_unlock(&ftrace_lock);
4943 static void ftrace_init_module(struct module *mod,
4944 unsigned long *start, unsigned long *end)
4946 if (ftrace_disabled || start == end)
4947 return;
4948 ftrace_process_locs(mod, start, end);
4951 void ftrace_module_init(struct module *mod)
4953 ftrace_init_module(mod, mod->ftrace_callsites,
4954 mod->ftrace_callsites +
4955 mod->num_ftrace_callsites);
4958 static int ftrace_module_notify_exit(struct notifier_block *self,
4959 unsigned long val, void *data)
4961 struct module *mod = data;
4963 if (val == MODULE_STATE_GOING)
4964 ftrace_release_mod(mod);
4966 return 0;
4968 #else
4969 static int ftrace_module_notify_exit(struct notifier_block *self,
4970 unsigned long val, void *data)
4972 return 0;
4974 #endif /* CONFIG_MODULES */
4976 struct notifier_block ftrace_module_exit_nb = {
4977 .notifier_call = ftrace_module_notify_exit,
4978 .priority = INT_MIN, /* Run after anything that can remove kprobes */
4981 void __init ftrace_init(void)
4983 extern unsigned long __start_mcount_loc[];
4984 extern unsigned long __stop_mcount_loc[];
4985 unsigned long count, flags;
4986 int ret;
4988 local_irq_save(flags);
4989 ret = ftrace_dyn_arch_init();
4990 local_irq_restore(flags);
4991 if (ret)
4992 goto failed;
4994 count = __stop_mcount_loc - __start_mcount_loc;
4995 if (!count) {
4996 pr_info("ftrace: No functions to be traced?\n");
4997 goto failed;
5000 pr_info("ftrace: allocating %ld entries in %ld pages\n",
5001 count, count / ENTRIES_PER_PAGE + 1);
5003 last_ftrace_enabled = ftrace_enabled = 1;
5005 ret = ftrace_process_locs(NULL,
5006 __start_mcount_loc,
5007 __stop_mcount_loc);
5009 ret = register_module_notifier(&ftrace_module_exit_nb);
5010 if (ret)
5011 pr_warning("Failed to register trace ftrace module exit notifier\n");
5013 set_ftrace_early_filters();
5015 return;
5016 failed:
5017 ftrace_disabled = 1;
5020 /* Do nothing if arch does not support this */
5021 void __weak arch_ftrace_update_trampoline(struct ftrace_ops *ops)
5025 static void ftrace_update_trampoline(struct ftrace_ops *ops)
5029 * Currently there's no safe way to free a trampoline when the kernel
5030 * is configured with PREEMPT. That is because a task could be preempted
5031 * when it jumped to the trampoline, it may be preempted for a long time
5032 * depending on the system load, and currently there's no way to know
5033 * when it will be off the trampoline. If the trampoline is freed
5034 * too early, when the task runs again, it will be executing on freed
5035 * memory and crash.
5037 #ifdef CONFIG_PREEMPT
5038 /* Currently, only non dynamic ops can have a trampoline */
5039 if (ops->flags & FTRACE_OPS_FL_DYNAMIC)
5040 return;
5041 #endif
5043 arch_ftrace_update_trampoline(ops);
5046 #else
5048 static struct ftrace_ops global_ops = {
5049 .func = ftrace_stub,
5050 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
5051 FTRACE_OPS_FL_INITIALIZED |
5052 FTRACE_OPS_FL_PID,
5055 static int __init ftrace_nodyn_init(void)
5057 ftrace_enabled = 1;
5058 return 0;
5060 core_initcall(ftrace_nodyn_init);
5062 static inline int ftrace_init_dyn_tracefs(struct dentry *d_tracer) { return 0; }
5063 static inline void ftrace_startup_enable(int command) { }
5064 static inline void ftrace_startup_all(int command) { }
5065 /* Keep as macros so we do not need to define the commands */
5066 # define ftrace_startup(ops, command) \
5067 ({ \
5068 int ___ret = __register_ftrace_function(ops); \
5069 if (!___ret) \
5070 (ops)->flags |= FTRACE_OPS_FL_ENABLED; \
5071 ___ret; \
5073 # define ftrace_shutdown(ops, command) \
5074 ({ \
5075 int ___ret = __unregister_ftrace_function(ops); \
5076 if (!___ret) \
5077 (ops)->flags &= ~FTRACE_OPS_FL_ENABLED; \
5078 ___ret; \
5081 # define ftrace_startup_sysctl() do { } while (0)
5082 # define ftrace_shutdown_sysctl() do { } while (0)
5084 static inline int
5085 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
5087 return 1;
5090 static void ftrace_update_trampoline(struct ftrace_ops *ops)
5094 #endif /* CONFIG_DYNAMIC_FTRACE */
5096 __init void ftrace_init_global_array_ops(struct trace_array *tr)
5098 tr->ops = &global_ops;
5099 tr->ops->private = tr;
5102 void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
5104 /* If we filter on pids, update to use the pid function */
5105 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
5106 if (WARN_ON(tr->ops->func != ftrace_stub))
5107 printk("ftrace ops had %pS for function\n",
5108 tr->ops->func);
5110 tr->ops->func = func;
5111 tr->ops->private = tr;
5114 void ftrace_reset_array_ops(struct trace_array *tr)
5116 tr->ops->func = ftrace_stub;
5119 static void
5120 ftrace_ops_control_func(unsigned long ip, unsigned long parent_ip,
5121 struct ftrace_ops *op, struct pt_regs *regs)
5123 if (unlikely(trace_recursion_test(TRACE_CONTROL_BIT)))
5124 return;
5127 * Some of the ops may be dynamically allocated,
5128 * they must be freed after a synchronize_sched().
5130 preempt_disable_notrace();
5131 trace_recursion_set(TRACE_CONTROL_BIT);
5134 * Control funcs (perf) uses RCU. Only trace if
5135 * RCU is currently active.
5137 if (!rcu_is_watching())
5138 goto out;
5140 do_for_each_ftrace_op(op, ftrace_control_list) {
5141 if (!(op->flags & FTRACE_OPS_FL_STUB) &&
5142 !ftrace_function_local_disabled(op) &&
5143 ftrace_ops_test(op, ip, regs))
5144 op->func(ip, parent_ip, op, regs);
5145 } while_for_each_ftrace_op(op);
5146 out:
5147 trace_recursion_clear(TRACE_CONTROL_BIT);
5148 preempt_enable_notrace();
5151 static struct ftrace_ops control_ops = {
5152 .func = ftrace_ops_control_func,
5153 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
5154 INIT_OPS_HASH(control_ops)
5157 static inline void
5158 __ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
5159 struct ftrace_ops *ignored, struct pt_regs *regs)
5161 struct ftrace_ops *op;
5162 int bit;
5164 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
5165 if (bit < 0)
5166 return;
5169 * Some of the ops may be dynamically allocated,
5170 * they must be freed after a synchronize_sched().
5172 preempt_disable_notrace();
5173 do_for_each_ftrace_op(op, ftrace_ops_list) {
5174 if (ftrace_ops_test(op, ip, regs)) {
5175 if (FTRACE_WARN_ON(!op->func)) {
5176 pr_warn("op=%p %pS\n", op, op);
5177 goto out;
5179 op->func(ip, parent_ip, op, regs);
5181 } while_for_each_ftrace_op(op);
5182 out:
5183 preempt_enable_notrace();
5184 trace_clear_recursion(bit);
5188 * Some archs only support passing ip and parent_ip. Even though
5189 * the list function ignores the op parameter, we do not want any
5190 * C side effects, where a function is called without the caller
5191 * sending a third parameter.
5192 * Archs are to support both the regs and ftrace_ops at the same time.
5193 * If they support ftrace_ops, it is assumed they support regs.
5194 * If call backs want to use regs, they must either check for regs
5195 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
5196 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
5197 * An architecture can pass partial regs with ftrace_ops and still
5198 * set the ARCH_SUPPORT_FTARCE_OPS.
5200 #if ARCH_SUPPORTS_FTRACE_OPS
5201 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
5202 struct ftrace_ops *op, struct pt_regs *regs)
5204 __ftrace_ops_list_func(ip, parent_ip, NULL, regs);
5206 #else
5207 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip)
5209 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
5211 #endif
5214 * If there's only one function registered but it does not support
5215 * recursion, this function will be called by the mcount trampoline.
5216 * This function will handle recursion protection.
5218 static void ftrace_ops_recurs_func(unsigned long ip, unsigned long parent_ip,
5219 struct ftrace_ops *op, struct pt_regs *regs)
5221 int bit;
5223 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
5224 if (bit < 0)
5225 return;
5227 op->func(ip, parent_ip, op, regs);
5229 trace_clear_recursion(bit);
5233 * ftrace_ops_get_func - get the function a trampoline should call
5234 * @ops: the ops to get the function for
5236 * Normally the mcount trampoline will call the ops->func, but there
5237 * are times that it should not. For example, if the ops does not
5238 * have its own recursion protection, then it should call the
5239 * ftrace_ops_recurs_func() instead.
5241 * Returns the function that the trampoline should call for @ops.
5243 ftrace_func_t ftrace_ops_get_func(struct ftrace_ops *ops)
5246 * If the func handles its own recursion, call it directly.
5247 * Otherwise call the recursion protected function that
5248 * will call the ftrace ops function.
5250 if (!(ops->flags & FTRACE_OPS_FL_RECURSION_SAFE))
5251 return ftrace_ops_recurs_func;
5253 return ops->func;
5256 static void clear_ftrace_swapper(void)
5258 struct task_struct *p;
5259 int cpu;
5261 get_online_cpus();
5262 for_each_online_cpu(cpu) {
5263 p = idle_task(cpu);
5264 clear_tsk_trace_trace(p);
5266 put_online_cpus();
5269 static void set_ftrace_swapper(void)
5271 struct task_struct *p;
5272 int cpu;
5274 get_online_cpus();
5275 for_each_online_cpu(cpu) {
5276 p = idle_task(cpu);
5277 set_tsk_trace_trace(p);
5279 put_online_cpus();
5282 static void clear_ftrace_pid(struct pid *pid)
5284 struct task_struct *p;
5286 rcu_read_lock();
5287 do_each_pid_task(pid, PIDTYPE_PID, p) {
5288 clear_tsk_trace_trace(p);
5289 } while_each_pid_task(pid, PIDTYPE_PID, p);
5290 rcu_read_unlock();
5292 put_pid(pid);
5295 static void set_ftrace_pid(struct pid *pid)
5297 struct task_struct *p;
5299 rcu_read_lock();
5300 do_each_pid_task(pid, PIDTYPE_PID, p) {
5301 set_tsk_trace_trace(p);
5302 } while_each_pid_task(pid, PIDTYPE_PID, p);
5303 rcu_read_unlock();
5306 static void clear_ftrace_pid_task(struct pid *pid)
5308 if (pid == ftrace_swapper_pid)
5309 clear_ftrace_swapper();
5310 else
5311 clear_ftrace_pid(pid);
5314 static void set_ftrace_pid_task(struct pid *pid)
5316 if (pid == ftrace_swapper_pid)
5317 set_ftrace_swapper();
5318 else
5319 set_ftrace_pid(pid);
5322 static int ftrace_pid_add(int p)
5324 struct pid *pid;
5325 struct ftrace_pid *fpid;
5326 int ret = -EINVAL;
5328 mutex_lock(&ftrace_lock);
5330 if (!p)
5331 pid = ftrace_swapper_pid;
5332 else
5333 pid = find_get_pid(p);
5335 if (!pid)
5336 goto out;
5338 ret = 0;
5340 list_for_each_entry(fpid, &ftrace_pids, list)
5341 if (fpid->pid == pid)
5342 goto out_put;
5344 ret = -ENOMEM;
5346 fpid = kmalloc(sizeof(*fpid), GFP_KERNEL);
5347 if (!fpid)
5348 goto out_put;
5350 list_add(&fpid->list, &ftrace_pids);
5351 fpid->pid = pid;
5353 set_ftrace_pid_task(pid);
5355 ftrace_update_pid_func();
5357 ftrace_startup_all(0);
5359 mutex_unlock(&ftrace_lock);
5360 return 0;
5362 out_put:
5363 if (pid != ftrace_swapper_pid)
5364 put_pid(pid);
5366 out:
5367 mutex_unlock(&ftrace_lock);
5368 return ret;
5371 static void ftrace_pid_reset(void)
5373 struct ftrace_pid *fpid, *safe;
5375 mutex_lock(&ftrace_lock);
5376 list_for_each_entry_safe(fpid, safe, &ftrace_pids, list) {
5377 struct pid *pid = fpid->pid;
5379 clear_ftrace_pid_task(pid);
5381 list_del(&fpid->list);
5382 kfree(fpid);
5385 ftrace_update_pid_func();
5386 ftrace_startup_all(0);
5388 mutex_unlock(&ftrace_lock);
5391 static void *fpid_start(struct seq_file *m, loff_t *pos)
5393 mutex_lock(&ftrace_lock);
5395 if (!ftrace_pids_enabled() && (!*pos))
5396 return (void *) 1;
5398 return seq_list_start(&ftrace_pids, *pos);
5401 static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
5403 if (v == (void *)1)
5404 return NULL;
5406 return seq_list_next(v, &ftrace_pids, pos);
5409 static void fpid_stop(struct seq_file *m, void *p)
5411 mutex_unlock(&ftrace_lock);
5414 static int fpid_show(struct seq_file *m, void *v)
5416 const struct ftrace_pid *fpid = list_entry(v, struct ftrace_pid, list);
5418 if (v == (void *)1) {
5419 seq_puts(m, "no pid\n");
5420 return 0;
5423 if (fpid->pid == ftrace_swapper_pid)
5424 seq_puts(m, "swapper tasks\n");
5425 else
5426 seq_printf(m, "%u\n", pid_vnr(fpid->pid));
5428 return 0;
5431 static const struct seq_operations ftrace_pid_sops = {
5432 .start = fpid_start,
5433 .next = fpid_next,
5434 .stop = fpid_stop,
5435 .show = fpid_show,
5438 static int
5439 ftrace_pid_open(struct inode *inode, struct file *file)
5441 int ret = 0;
5443 if ((file->f_mode & FMODE_WRITE) &&
5444 (file->f_flags & O_TRUNC))
5445 ftrace_pid_reset();
5447 if (file->f_mode & FMODE_READ)
5448 ret = seq_open(file, &ftrace_pid_sops);
5450 return ret;
5453 static ssize_t
5454 ftrace_pid_write(struct file *filp, const char __user *ubuf,
5455 size_t cnt, loff_t *ppos)
5457 char buf[64], *tmp;
5458 long val;
5459 int ret;
5461 if (cnt >= sizeof(buf))
5462 return -EINVAL;
5464 if (copy_from_user(&buf, ubuf, cnt))
5465 return -EFAULT;
5467 buf[cnt] = 0;
5470 * Allow "echo > set_ftrace_pid" or "echo -n '' > set_ftrace_pid"
5471 * to clean the filter quietly.
5473 tmp = strstrip(buf);
5474 if (strlen(tmp) == 0)
5475 return 1;
5477 ret = kstrtol(tmp, 10, &val);
5478 if (ret < 0)
5479 return ret;
5481 ret = ftrace_pid_add(val);
5483 return ret ? ret : cnt;
5486 static int
5487 ftrace_pid_release(struct inode *inode, struct file *file)
5489 if (file->f_mode & FMODE_READ)
5490 seq_release(inode, file);
5492 return 0;
5495 static const struct file_operations ftrace_pid_fops = {
5496 .open = ftrace_pid_open,
5497 .write = ftrace_pid_write,
5498 .read = seq_read,
5499 .llseek = tracing_lseek,
5500 .release = ftrace_pid_release,
5503 static __init int ftrace_init_tracefs(void)
5505 struct dentry *d_tracer;
5507 d_tracer = tracing_init_dentry();
5508 if (IS_ERR(d_tracer))
5509 return 0;
5511 ftrace_init_dyn_tracefs(d_tracer);
5513 trace_create_file("set_ftrace_pid", 0644, d_tracer,
5514 NULL, &ftrace_pid_fops);
5516 ftrace_profile_tracefs(d_tracer);
5518 return 0;
5520 fs_initcall(ftrace_init_tracefs);
5523 * ftrace_kill - kill ftrace
5525 * This function should be used by panic code. It stops ftrace
5526 * but in a not so nice way. If you need to simply kill ftrace
5527 * from a non-atomic section, use ftrace_kill.
5529 void ftrace_kill(void)
5531 ftrace_disabled = 1;
5532 ftrace_enabled = 0;
5533 clear_ftrace_function();
5537 * Test if ftrace is dead or not.
5539 int ftrace_is_dead(void)
5541 return ftrace_disabled;
5545 * register_ftrace_function - register a function for profiling
5546 * @ops - ops structure that holds the function for profiling.
5548 * Register a function to be called by all functions in the
5549 * kernel.
5551 * Note: @ops->func and all the functions it calls must be labeled
5552 * with "notrace", otherwise it will go into a
5553 * recursive loop.
5555 int register_ftrace_function(struct ftrace_ops *ops)
5557 int ret = -1;
5559 ftrace_ops_init(ops);
5561 mutex_lock(&ftrace_lock);
5563 ret = ftrace_startup(ops, 0);
5565 mutex_unlock(&ftrace_lock);
5567 return ret;
5569 EXPORT_SYMBOL_GPL(register_ftrace_function);
5572 * unregister_ftrace_function - unregister a function for profiling.
5573 * @ops - ops structure that holds the function to unregister
5575 * Unregister a function that was added to be called by ftrace profiling.
5577 int unregister_ftrace_function(struct ftrace_ops *ops)
5579 int ret;
5581 mutex_lock(&ftrace_lock);
5582 ret = ftrace_shutdown(ops, 0);
5583 mutex_unlock(&ftrace_lock);
5585 return ret;
5587 EXPORT_SYMBOL_GPL(unregister_ftrace_function);
5590 ftrace_enable_sysctl(struct ctl_table *table, int write,
5591 void __user *buffer, size_t *lenp,
5592 loff_t *ppos)
5594 int ret = -ENODEV;
5596 mutex_lock(&ftrace_lock);
5598 if (unlikely(ftrace_disabled))
5599 goto out;
5601 ret = proc_dointvec(table, write, buffer, lenp, ppos);
5603 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
5604 goto out;
5606 last_ftrace_enabled = !!ftrace_enabled;
5608 if (ftrace_enabled) {
5610 /* we are starting ftrace again */
5611 if (ftrace_ops_list != &ftrace_list_end)
5612 update_ftrace_function();
5614 ftrace_startup_sysctl();
5616 } else {
5617 /* stopping ftrace calls (just send to ftrace_stub) */
5618 ftrace_trace_function = ftrace_stub;
5620 ftrace_shutdown_sysctl();
5623 out:
5624 mutex_unlock(&ftrace_lock);
5625 return ret;
5628 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5630 static struct ftrace_ops graph_ops = {
5631 .func = ftrace_stub,
5632 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
5633 FTRACE_OPS_FL_INITIALIZED |
5634 FTRACE_OPS_FL_PID |
5635 FTRACE_OPS_FL_STUB,
5636 #ifdef FTRACE_GRAPH_TRAMP_ADDR
5637 .trampoline = FTRACE_GRAPH_TRAMP_ADDR,
5638 /* trampoline_size is only needed for dynamically allocated tramps */
5639 #endif
5640 ASSIGN_OPS_HASH(graph_ops, &global_ops.local_hash)
5643 void ftrace_graph_sleep_time_control(bool enable)
5645 fgraph_sleep_time = enable;
5648 void ftrace_graph_graph_time_control(bool enable)
5650 fgraph_graph_time = enable;
5653 int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
5655 return 0;
5658 /* The callbacks that hook a function */
5659 trace_func_graph_ret_t ftrace_graph_return =
5660 (trace_func_graph_ret_t)ftrace_stub;
5661 trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
5662 static trace_func_graph_ent_t __ftrace_graph_entry = ftrace_graph_entry_stub;
5664 /* Try to assign a return stack array on FTRACE_RETSTACK_ALLOC_SIZE tasks. */
5665 static int alloc_retstack_tasklist(struct ftrace_ret_stack **ret_stack_list)
5667 int i;
5668 int ret = 0;
5669 unsigned long flags;
5670 int start = 0, end = FTRACE_RETSTACK_ALLOC_SIZE;
5671 struct task_struct *g, *t;
5673 for (i = 0; i < FTRACE_RETSTACK_ALLOC_SIZE; i++) {
5674 ret_stack_list[i] = kmalloc(FTRACE_RETFUNC_DEPTH
5675 * sizeof(struct ftrace_ret_stack),
5676 GFP_KERNEL);
5677 if (!ret_stack_list[i]) {
5678 start = 0;
5679 end = i;
5680 ret = -ENOMEM;
5681 goto free;
5685 read_lock_irqsave(&tasklist_lock, flags);
5686 do_each_thread(g, t) {
5687 if (start == end) {
5688 ret = -EAGAIN;
5689 goto unlock;
5692 if (t->ret_stack == NULL) {
5693 atomic_set(&t->tracing_graph_pause, 0);
5694 atomic_set(&t->trace_overrun, 0);
5695 t->curr_ret_stack = -1;
5696 /* Make sure the tasks see the -1 first: */
5697 smp_wmb();
5698 t->ret_stack = ret_stack_list[start++];
5700 } while_each_thread(g, t);
5702 unlock:
5703 read_unlock_irqrestore(&tasklist_lock, flags);
5704 free:
5705 for (i = start; i < end; i++)
5706 kfree(ret_stack_list[i]);
5707 return ret;
5710 static void
5711 ftrace_graph_probe_sched_switch(void *ignore, bool preempt,
5712 struct task_struct *prev, struct task_struct *next)
5714 unsigned long long timestamp;
5715 int index;
5718 * Does the user want to count the time a function was asleep.
5719 * If so, do not update the time stamps.
5721 if (fgraph_sleep_time)
5722 return;
5724 timestamp = trace_clock_local();
5726 prev->ftrace_timestamp = timestamp;
5728 /* only process tasks that we timestamped */
5729 if (!next->ftrace_timestamp)
5730 return;
5733 * Update all the counters in next to make up for the
5734 * time next was sleeping.
5736 timestamp -= next->ftrace_timestamp;
5738 for (index = next->curr_ret_stack; index >= 0; index--)
5739 next->ret_stack[index].calltime += timestamp;
5742 /* Allocate a return stack for each task */
5743 static int start_graph_tracing(void)
5745 struct ftrace_ret_stack **ret_stack_list;
5746 int ret, cpu;
5748 ret_stack_list = kmalloc(FTRACE_RETSTACK_ALLOC_SIZE *
5749 sizeof(struct ftrace_ret_stack *),
5750 GFP_KERNEL);
5752 if (!ret_stack_list)
5753 return -ENOMEM;
5755 /* The cpu_boot init_task->ret_stack will never be freed */
5756 for_each_online_cpu(cpu) {
5757 if (!idle_task(cpu)->ret_stack)
5758 ftrace_graph_init_idle_task(idle_task(cpu), cpu);
5761 do {
5762 ret = alloc_retstack_tasklist(ret_stack_list);
5763 } while (ret == -EAGAIN);
5765 if (!ret) {
5766 ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
5767 if (ret)
5768 pr_info("ftrace_graph: Couldn't activate tracepoint"
5769 " probe to kernel_sched_switch\n");
5772 kfree(ret_stack_list);
5773 return ret;
5777 * Hibernation protection.
5778 * The state of the current task is too much unstable during
5779 * suspend/restore to disk. We want to protect against that.
5781 static int
5782 ftrace_suspend_notifier_call(struct notifier_block *bl, unsigned long state,
5783 void *unused)
5785 switch (state) {
5786 case PM_HIBERNATION_PREPARE:
5787 pause_graph_tracing();
5788 break;
5790 case PM_POST_HIBERNATION:
5791 unpause_graph_tracing();
5792 break;
5794 return NOTIFY_DONE;
5797 static int ftrace_graph_entry_test(struct ftrace_graph_ent *trace)
5799 if (!ftrace_ops_test(&global_ops, trace->func, NULL))
5800 return 0;
5801 return __ftrace_graph_entry(trace);
5805 * The function graph tracer should only trace the functions defined
5806 * by set_ftrace_filter and set_ftrace_notrace. If another function
5807 * tracer ops is registered, the graph tracer requires testing the
5808 * function against the global ops, and not just trace any function
5809 * that any ftrace_ops registered.
5811 static void update_function_graph_func(void)
5813 struct ftrace_ops *op;
5814 bool do_test = false;
5817 * The graph and global ops share the same set of functions
5818 * to test. If any other ops is on the list, then
5819 * the graph tracing needs to test if its the function
5820 * it should call.
5822 do_for_each_ftrace_op(op, ftrace_ops_list) {
5823 if (op != &global_ops && op != &graph_ops &&
5824 op != &ftrace_list_end) {
5825 do_test = true;
5826 /* in double loop, break out with goto */
5827 goto out;
5829 } while_for_each_ftrace_op(op);
5830 out:
5831 if (do_test)
5832 ftrace_graph_entry = ftrace_graph_entry_test;
5833 else
5834 ftrace_graph_entry = __ftrace_graph_entry;
5837 static struct notifier_block ftrace_suspend_notifier = {
5838 .notifier_call = ftrace_suspend_notifier_call,
5841 int register_ftrace_graph(trace_func_graph_ret_t retfunc,
5842 trace_func_graph_ent_t entryfunc)
5844 int ret = 0;
5846 mutex_lock(&ftrace_lock);
5848 /* we currently allow only one tracer registered at a time */
5849 if (ftrace_graph_active) {
5850 ret = -EBUSY;
5851 goto out;
5854 register_pm_notifier(&ftrace_suspend_notifier);
5856 ftrace_graph_active++;
5857 ret = start_graph_tracing();
5858 if (ret) {
5859 ftrace_graph_active--;
5860 goto out;
5863 ftrace_graph_return = retfunc;
5866 * Update the indirect function to the entryfunc, and the
5867 * function that gets called to the entry_test first. Then
5868 * call the update fgraph entry function to determine if
5869 * the entryfunc should be called directly or not.
5871 __ftrace_graph_entry = entryfunc;
5872 ftrace_graph_entry = ftrace_graph_entry_test;
5873 update_function_graph_func();
5875 ret = ftrace_startup(&graph_ops, FTRACE_START_FUNC_RET);
5876 out:
5877 mutex_unlock(&ftrace_lock);
5878 return ret;
5881 void unregister_ftrace_graph(void)
5883 mutex_lock(&ftrace_lock);
5885 if (unlikely(!ftrace_graph_active))
5886 goto out;
5888 ftrace_graph_active--;
5889 ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
5890 ftrace_graph_entry = ftrace_graph_entry_stub;
5891 __ftrace_graph_entry = ftrace_graph_entry_stub;
5892 ftrace_shutdown(&graph_ops, FTRACE_STOP_FUNC_RET);
5893 unregister_pm_notifier(&ftrace_suspend_notifier);
5894 unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
5896 #ifdef CONFIG_DYNAMIC_FTRACE
5898 * Function graph does not allocate the trampoline, but
5899 * other global_ops do. We need to reset the ALLOC_TRAMP flag
5900 * if one was used.
5902 global_ops.trampoline = save_global_trampoline;
5903 if (save_global_flags & FTRACE_OPS_FL_ALLOC_TRAMP)
5904 global_ops.flags |= FTRACE_OPS_FL_ALLOC_TRAMP;
5905 #endif
5907 out:
5908 mutex_unlock(&ftrace_lock);
5911 static DEFINE_PER_CPU(struct ftrace_ret_stack *, idle_ret_stack);
5913 static void
5914 graph_init_task(struct task_struct *t, struct ftrace_ret_stack *ret_stack)
5916 atomic_set(&t->tracing_graph_pause, 0);
5917 atomic_set(&t->trace_overrun, 0);
5918 t->ftrace_timestamp = 0;
5919 /* make curr_ret_stack visible before we add the ret_stack */
5920 smp_wmb();
5921 t->ret_stack = ret_stack;
5925 * Allocate a return stack for the idle task. May be the first
5926 * time through, or it may be done by CPU hotplug online.
5928 void ftrace_graph_init_idle_task(struct task_struct *t, int cpu)
5930 t->curr_ret_stack = -1;
5932 * The idle task has no parent, it either has its own
5933 * stack or no stack at all.
5935 if (t->ret_stack)
5936 WARN_ON(t->ret_stack != per_cpu(idle_ret_stack, cpu));
5938 if (ftrace_graph_active) {
5939 struct ftrace_ret_stack *ret_stack;
5941 ret_stack = per_cpu(idle_ret_stack, cpu);
5942 if (!ret_stack) {
5943 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
5944 * sizeof(struct ftrace_ret_stack),
5945 GFP_KERNEL);
5946 if (!ret_stack)
5947 return;
5948 per_cpu(idle_ret_stack, cpu) = ret_stack;
5950 graph_init_task(t, ret_stack);
5954 /* Allocate a return stack for newly created task */
5955 void ftrace_graph_init_task(struct task_struct *t)
5957 /* Make sure we do not use the parent ret_stack */
5958 t->ret_stack = NULL;
5959 t->curr_ret_stack = -1;
5961 if (ftrace_graph_active) {
5962 struct ftrace_ret_stack *ret_stack;
5964 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
5965 * sizeof(struct ftrace_ret_stack),
5966 GFP_KERNEL);
5967 if (!ret_stack)
5968 return;
5969 graph_init_task(t, ret_stack);
5973 void ftrace_graph_exit_task(struct task_struct *t)
5975 struct ftrace_ret_stack *ret_stack = t->ret_stack;
5977 t->ret_stack = NULL;
5978 /* NULL must become visible to IRQs before we free it: */
5979 barrier();
5981 kfree(ret_stack);
5983 #endif