Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Infrastructure for profiling code inserted by 'gcc -pg'.
4 *
5 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
6 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
7 *
8 * Originally ported from the -rt patch by:
9 * Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
10 *
11 * Based on code in the latency_tracer, that is:
12 *
13 * Copyright (C) 2004-2006 Ingo Molnar
14 * Copyright (C) 2004 Nadia Yvette Chambers
15 */
16
17#include <linux/stop_machine.h>
18#include <linux/clocksource.h>
19#include <linux/sched/task.h>
20#include <linux/kallsyms.h>
21#include <linux/security.h>
22#include <linux/seq_file.h>
23#include <linux/tracefs.h>
24#include <linux/hardirq.h>
25#include <linux/kthread.h>
26#include <linux/uaccess.h>
27#include <linux/bsearch.h>
28#include <linux/module.h>
29#include <linux/ftrace.h>
30#include <linux/sysctl.h>
31#include <linux/slab.h>
32#include <linux/ctype.h>
33#include <linux/sort.h>
34#include <linux/list.h>
35#include <linux/hash.h>
36#include <linux/rcupdate.h>
37#include <linux/kprobes.h>
38
39#include <trace/events/sched.h>
40
41#include <asm/sections.h>
42#include <asm/setup.h>
43
44#include "ftrace_internal.h"
45#include "trace_output.h"
46#include "trace_stat.h"
47
48#define FTRACE_INVALID_FUNCTION "__ftrace_invalid_address__"
49
50#define FTRACE_WARN_ON(cond) \
51 ({ \
52 int ___r = cond; \
53 if (WARN_ON(___r)) \
54 ftrace_kill(); \
55 ___r; \
56 })
57
58#define FTRACE_WARN_ON_ONCE(cond) \
59 ({ \
60 int ___r = cond; \
61 if (WARN_ON_ONCE(___r)) \
62 ftrace_kill(); \
63 ___r; \
64 })
65
66/* hash bits for specific function selection */
67#define FTRACE_HASH_DEFAULT_BITS 10
68#define FTRACE_HASH_MAX_BITS 12
69
70#ifdef CONFIG_DYNAMIC_FTRACE
71#define INIT_OPS_HASH(opsname) \
72 .func_hash = &opsname.local_hash, \
73 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
74#else
75#define INIT_OPS_HASH(opsname)
76#endif
77
78enum {
79 FTRACE_MODIFY_ENABLE_FL = (1 << 0),
80 FTRACE_MODIFY_MAY_SLEEP_FL = (1 << 1),
81};
82
83struct ftrace_ops ftrace_list_end __read_mostly = {
84 .func = ftrace_stub,
85 .flags = FTRACE_OPS_FL_STUB,
86 INIT_OPS_HASH(ftrace_list_end)
87};
88
89/* ftrace_enabled is a method to turn ftrace on or off */
90int ftrace_enabled __read_mostly;
91static int __maybe_unused last_ftrace_enabled;
92
93/* Current function tracing op */
94struct ftrace_ops *function_trace_op __read_mostly = &ftrace_list_end;
95/* What to set function_trace_op to */
96static struct ftrace_ops *set_function_trace_op;
97
98static bool ftrace_pids_enabled(struct ftrace_ops *ops)
99{
100 struct trace_array *tr;
101
102 if (!(ops->flags & FTRACE_OPS_FL_PID) || !ops->private)
103 return false;
104
105 tr = ops->private;
106
107 return tr->function_pids != NULL || tr->function_no_pids != NULL;
108}
109
110static void ftrace_update_trampoline(struct ftrace_ops *ops);
111
112/*
113 * ftrace_disabled is set when an anomaly is discovered.
114 * ftrace_disabled is much stronger than ftrace_enabled.
115 */
116static int ftrace_disabled __read_mostly;
117
118DEFINE_MUTEX(ftrace_lock);
119
120struct ftrace_ops __rcu *ftrace_ops_list __read_mostly = &ftrace_list_end;
121ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
122struct ftrace_ops global_ops;
123
124/* Defined by vmlinux.lds.h see the comment above arch_ftrace_ops_list_func for details */
125void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
126 struct ftrace_ops *op, struct ftrace_regs *fregs);
127
128static inline void ftrace_ops_init(struct ftrace_ops *ops)
129{
130#ifdef CONFIG_DYNAMIC_FTRACE
131 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED)) {
132 mutex_init(&ops->local_hash.regex_lock);
133 ops->func_hash = &ops->local_hash;
134 ops->flags |= FTRACE_OPS_FL_INITIALIZED;
135 }
136#endif
137}
138
139static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip,
140 struct ftrace_ops *op, struct ftrace_regs *fregs)
141{
142 struct trace_array *tr = op->private;
143 int pid;
144
145 if (tr) {
146 pid = this_cpu_read(tr->array_buffer.data->ftrace_ignore_pid);
147 if (pid == FTRACE_PID_IGNORE)
148 return;
149 if (pid != FTRACE_PID_TRACE &&
150 pid != current->pid)
151 return;
152 }
153
154 op->saved_func(ip, parent_ip, op, fregs);
155}
156
157static void ftrace_sync_ipi(void *data)
158{
159 /* Probably not needed, but do it anyway */
160 smp_rmb();
161}
162
163static ftrace_func_t ftrace_ops_get_list_func(struct ftrace_ops *ops)
164{
165 /*
166 * If this is a dynamic or RCU ops, or we force list func,
167 * then it needs to call the list anyway.
168 */
169 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_RCU) ||
170 FTRACE_FORCE_LIST_FUNC)
171 return ftrace_ops_list_func;
172
173 return ftrace_ops_get_func(ops);
174}
175
176static void update_ftrace_function(void)
177{
178 ftrace_func_t func;
179
180 /*
181 * Prepare the ftrace_ops that the arch callback will use.
182 * If there's only one ftrace_ops registered, the ftrace_ops_list
183 * will point to the ops we want.
184 */
185 set_function_trace_op = rcu_dereference_protected(ftrace_ops_list,
186 lockdep_is_held(&ftrace_lock));
187
188 /* If there's no ftrace_ops registered, just call the stub function */
189 if (set_function_trace_op == &ftrace_list_end) {
190 func = ftrace_stub;
191
192 /*
193 * If we are at the end of the list and this ops is
194 * recursion safe and not dynamic and the arch supports passing ops,
195 * then have the mcount trampoline call the function directly.
196 */
197 } else if (rcu_dereference_protected(ftrace_ops_list->next,
198 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
199 func = ftrace_ops_get_list_func(ftrace_ops_list);
200
201 } else {
202 /* Just use the default ftrace_ops */
203 set_function_trace_op = &ftrace_list_end;
204 func = ftrace_ops_list_func;
205 }
206
207 update_function_graph_func();
208
209 /* If there's no change, then do nothing more here */
210 if (ftrace_trace_function == func)
211 return;
212
213 /*
214 * If we are using the list function, it doesn't care
215 * about the function_trace_ops.
216 */
217 if (func == ftrace_ops_list_func) {
218 ftrace_trace_function = func;
219 /*
220 * Don't even bother setting function_trace_ops,
221 * it would be racy to do so anyway.
222 */
223 return;
224 }
225
226#ifndef CONFIG_DYNAMIC_FTRACE
227 /*
228 * For static tracing, we need to be a bit more careful.
229 * The function change takes affect immediately. Thus,
230 * we need to coordinate the setting of the function_trace_ops
231 * with the setting of the ftrace_trace_function.
232 *
233 * Set the function to the list ops, which will call the
234 * function we want, albeit indirectly, but it handles the
235 * ftrace_ops and doesn't depend on function_trace_op.
236 */
237 ftrace_trace_function = ftrace_ops_list_func;
238 /*
239 * Make sure all CPUs see this. Yes this is slow, but static
240 * tracing is slow and nasty to have enabled.
241 */
242 synchronize_rcu_tasks_rude();
243 /* Now all cpus are using the list ops. */
244 function_trace_op = set_function_trace_op;
245 /* Make sure the function_trace_op is visible on all CPUs */
246 smp_wmb();
247 /* Nasty way to force a rmb on all cpus */
248 smp_call_function(ftrace_sync_ipi, NULL, 1);
249 /* OK, we are all set to update the ftrace_trace_function now! */
250#endif /* !CONFIG_DYNAMIC_FTRACE */
251
252 ftrace_trace_function = func;
253}
254
255static void add_ftrace_ops(struct ftrace_ops __rcu **list,
256 struct ftrace_ops *ops)
257{
258 rcu_assign_pointer(ops->next, *list);
259
260 /*
261 * We are entering ops into the list but another
262 * CPU might be walking that list. We need to make sure
263 * the ops->next pointer is valid before another CPU sees
264 * the ops pointer included into the list.
265 */
266 rcu_assign_pointer(*list, ops);
267}
268
269static int remove_ftrace_ops(struct ftrace_ops __rcu **list,
270 struct ftrace_ops *ops)
271{
272 struct ftrace_ops **p;
273
274 /*
275 * If we are removing the last function, then simply point
276 * to the ftrace_stub.
277 */
278 if (rcu_dereference_protected(*list,
279 lockdep_is_held(&ftrace_lock)) == ops &&
280 rcu_dereference_protected(ops->next,
281 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
282 *list = &ftrace_list_end;
283 return 0;
284 }
285
286 for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
287 if (*p == ops)
288 break;
289
290 if (*p != ops)
291 return -1;
292
293 *p = (*p)->next;
294 return 0;
295}
296
297static void ftrace_update_trampoline(struct ftrace_ops *ops);
298
299int __register_ftrace_function(struct ftrace_ops *ops)
300{
301 if (ops->flags & FTRACE_OPS_FL_DELETED)
302 return -EINVAL;
303
304 if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
305 return -EBUSY;
306
307#ifndef CONFIG_DYNAMIC_FTRACE_WITH_REGS
308 /*
309 * If the ftrace_ops specifies SAVE_REGS, then it only can be used
310 * if the arch supports it, or SAVE_REGS_IF_SUPPORTED is also set.
311 * Setting SAVE_REGS_IF_SUPPORTED makes SAVE_REGS irrelevant.
312 */
313 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS &&
314 !(ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED))
315 return -EINVAL;
316
317 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED)
318 ops->flags |= FTRACE_OPS_FL_SAVE_REGS;
319#endif
320 if (!ftrace_enabled && (ops->flags & FTRACE_OPS_FL_PERMANENT))
321 return -EBUSY;
322
323 if (!is_kernel_core_data((unsigned long)ops))
324 ops->flags |= FTRACE_OPS_FL_DYNAMIC;
325
326 add_ftrace_ops(&ftrace_ops_list, ops);
327
328 /* Always save the function, and reset at unregistering */
329 ops->saved_func = ops->func;
330
331 if (ftrace_pids_enabled(ops))
332 ops->func = ftrace_pid_func;
333
334 ftrace_update_trampoline(ops);
335
336 if (ftrace_enabled)
337 update_ftrace_function();
338
339 return 0;
340}
341
342int __unregister_ftrace_function(struct ftrace_ops *ops)
343{
344 int ret;
345
346 if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
347 return -EBUSY;
348
349 ret = remove_ftrace_ops(&ftrace_ops_list, ops);
350
351 if (ret < 0)
352 return ret;
353
354 if (ftrace_enabled)
355 update_ftrace_function();
356
357 ops->func = ops->saved_func;
358
359 return 0;
360}
361
362static void ftrace_update_pid_func(void)
363{
364 struct ftrace_ops *op;
365
366 /* Only do something if we are tracing something */
367 if (ftrace_trace_function == ftrace_stub)
368 return;
369
370 do_for_each_ftrace_op(op, ftrace_ops_list) {
371 if (op->flags & FTRACE_OPS_FL_PID) {
372 op->func = ftrace_pids_enabled(op) ?
373 ftrace_pid_func : op->saved_func;
374 ftrace_update_trampoline(op);
375 }
376 } while_for_each_ftrace_op(op);
377
378 update_ftrace_function();
379}
380
381#ifdef CONFIG_FUNCTION_PROFILER
382struct ftrace_profile {
383 struct hlist_node node;
384 unsigned long ip;
385 unsigned long counter;
386#ifdef CONFIG_FUNCTION_GRAPH_TRACER
387 unsigned long long time;
388 unsigned long long time_squared;
389#endif
390};
391
392struct ftrace_profile_page {
393 struct ftrace_profile_page *next;
394 unsigned long index;
395 struct ftrace_profile records[];
396};
397
398struct ftrace_profile_stat {
399 atomic_t disabled;
400 struct hlist_head *hash;
401 struct ftrace_profile_page *pages;
402 struct ftrace_profile_page *start;
403 struct tracer_stat stat;
404};
405
406#define PROFILE_RECORDS_SIZE \
407 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
408
409#define PROFILES_PER_PAGE \
410 (PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
411
412static int ftrace_profile_enabled __read_mostly;
413
414/* ftrace_profile_lock - synchronize the enable and disable of the profiler */
415static DEFINE_MUTEX(ftrace_profile_lock);
416
417static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
418
419#define FTRACE_PROFILE_HASH_BITS 10
420#define FTRACE_PROFILE_HASH_SIZE (1 << FTRACE_PROFILE_HASH_BITS)
421
422static void *
423function_stat_next(void *v, int idx)
424{
425 struct ftrace_profile *rec = v;
426 struct ftrace_profile_page *pg;
427
428 pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
429
430 again:
431 if (idx != 0)
432 rec++;
433
434 if ((void *)rec >= (void *)&pg->records[pg->index]) {
435 pg = pg->next;
436 if (!pg)
437 return NULL;
438 rec = &pg->records[0];
439 if (!rec->counter)
440 goto again;
441 }
442
443 return rec;
444}
445
446static void *function_stat_start(struct tracer_stat *trace)
447{
448 struct ftrace_profile_stat *stat =
449 container_of(trace, struct ftrace_profile_stat, stat);
450
451 if (!stat || !stat->start)
452 return NULL;
453
454 return function_stat_next(&stat->start->records[0], 0);
455}
456
457#ifdef CONFIG_FUNCTION_GRAPH_TRACER
458/* function graph compares on total time */
459static int function_stat_cmp(const void *p1, const void *p2)
460{
461 const struct ftrace_profile *a = p1;
462 const struct ftrace_profile *b = p2;
463
464 if (a->time < b->time)
465 return -1;
466 if (a->time > b->time)
467 return 1;
468 else
469 return 0;
470}
471#else
472/* not function graph compares against hits */
473static int function_stat_cmp(const void *p1, const void *p2)
474{
475 const struct ftrace_profile *a = p1;
476 const struct ftrace_profile *b = p2;
477
478 if (a->counter < b->counter)
479 return -1;
480 if (a->counter > b->counter)
481 return 1;
482 else
483 return 0;
484}
485#endif
486
487static int function_stat_headers(struct seq_file *m)
488{
489#ifdef CONFIG_FUNCTION_GRAPH_TRACER
490 seq_puts(m, " Function "
491 "Hit Time Avg s^2\n"
492 " -------- "
493 "--- ---- --- ---\n");
494#else
495 seq_puts(m, " Function Hit\n"
496 " -------- ---\n");
497#endif
498 return 0;
499}
500
501static int function_stat_show(struct seq_file *m, void *v)
502{
503 struct ftrace_profile *rec = v;
504 char str[KSYM_SYMBOL_LEN];
505 int ret = 0;
506#ifdef CONFIG_FUNCTION_GRAPH_TRACER
507 static struct trace_seq s;
508 unsigned long long avg;
509 unsigned long long stddev;
510#endif
511 mutex_lock(&ftrace_profile_lock);
512
513 /* we raced with function_profile_reset() */
514 if (unlikely(rec->counter == 0)) {
515 ret = -EBUSY;
516 goto out;
517 }
518
519#ifdef CONFIG_FUNCTION_GRAPH_TRACER
520 avg = div64_ul(rec->time, rec->counter);
521 if (tracing_thresh && (avg < tracing_thresh))
522 goto out;
523#endif
524
525 kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
526 seq_printf(m, " %-30.30s %10lu", str, rec->counter);
527
528#ifdef CONFIG_FUNCTION_GRAPH_TRACER
529 seq_puts(m, " ");
530
531 /* Sample standard deviation (s^2) */
532 if (rec->counter <= 1)
533 stddev = 0;
534 else {
535 /*
536 * Apply Welford's method:
537 * s^2 = 1 / (n * (n-1)) * (n * \Sum (x_i)^2 - (\Sum x_i)^2)
538 */
539 stddev = rec->counter * rec->time_squared -
540 rec->time * rec->time;
541
542 /*
543 * Divide only 1000 for ns^2 -> us^2 conversion.
544 * trace_print_graph_duration will divide 1000 again.
545 */
546 stddev = div64_ul(stddev,
547 rec->counter * (rec->counter - 1) * 1000);
548 }
549
550 trace_seq_init(&s);
551 trace_print_graph_duration(rec->time, &s);
552 trace_seq_puts(&s, " ");
553 trace_print_graph_duration(avg, &s);
554 trace_seq_puts(&s, " ");
555 trace_print_graph_duration(stddev, &s);
556 trace_print_seq(m, &s);
557#endif
558 seq_putc(m, '\n');
559out:
560 mutex_unlock(&ftrace_profile_lock);
561
562 return ret;
563}
564
565static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
566{
567 struct ftrace_profile_page *pg;
568
569 pg = stat->pages = stat->start;
570
571 while (pg) {
572 memset(pg->records, 0, PROFILE_RECORDS_SIZE);
573 pg->index = 0;
574 pg = pg->next;
575 }
576
577 memset(stat->hash, 0,
578 FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
579}
580
581static int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
582{
583 struct ftrace_profile_page *pg;
584 int functions;
585 int pages;
586 int i;
587
588 /* If we already allocated, do nothing */
589 if (stat->pages)
590 return 0;
591
592 stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
593 if (!stat->pages)
594 return -ENOMEM;
595
596#ifdef CONFIG_DYNAMIC_FTRACE
597 functions = ftrace_update_tot_cnt;
598#else
599 /*
600 * We do not know the number of functions that exist because
601 * dynamic tracing is what counts them. With past experience
602 * we have around 20K functions. That should be more than enough.
603 * It is highly unlikely we will execute every function in
604 * the kernel.
605 */
606 functions = 20000;
607#endif
608
609 pg = stat->start = stat->pages;
610
611 pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);
612
613 for (i = 1; i < pages; i++) {
614 pg->next = (void *)get_zeroed_page(GFP_KERNEL);
615 if (!pg->next)
616 goto out_free;
617 pg = pg->next;
618 }
619
620 return 0;
621
622 out_free:
623 pg = stat->start;
624 while (pg) {
625 unsigned long tmp = (unsigned long)pg;
626
627 pg = pg->next;
628 free_page(tmp);
629 }
630
631 stat->pages = NULL;
632 stat->start = NULL;
633
634 return -ENOMEM;
635}
636
637static int ftrace_profile_init_cpu(int cpu)
638{
639 struct ftrace_profile_stat *stat;
640 int size;
641
642 stat = &per_cpu(ftrace_profile_stats, cpu);
643
644 if (stat->hash) {
645 /* If the profile is already created, simply reset it */
646 ftrace_profile_reset(stat);
647 return 0;
648 }
649
650 /*
651 * We are profiling all functions, but usually only a few thousand
652 * functions are hit. We'll make a hash of 1024 items.
653 */
654 size = FTRACE_PROFILE_HASH_SIZE;
655
656 stat->hash = kcalloc(size, sizeof(struct hlist_head), GFP_KERNEL);
657
658 if (!stat->hash)
659 return -ENOMEM;
660
661 /* Preallocate the function profiling pages */
662 if (ftrace_profile_pages_init(stat) < 0) {
663 kfree(stat->hash);
664 stat->hash = NULL;
665 return -ENOMEM;
666 }
667
668 return 0;
669}
670
671static int ftrace_profile_init(void)
672{
673 int cpu;
674 int ret = 0;
675
676 for_each_possible_cpu(cpu) {
677 ret = ftrace_profile_init_cpu(cpu);
678 if (ret)
679 break;
680 }
681
682 return ret;
683}
684
685/* interrupts must be disabled */
686static struct ftrace_profile *
687ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
688{
689 struct ftrace_profile *rec;
690 struct hlist_head *hhd;
691 unsigned long key;
692
693 key = hash_long(ip, FTRACE_PROFILE_HASH_BITS);
694 hhd = &stat->hash[key];
695
696 if (hlist_empty(hhd))
697 return NULL;
698
699 hlist_for_each_entry_rcu_notrace(rec, hhd, node) {
700 if (rec->ip == ip)
701 return rec;
702 }
703
704 return NULL;
705}
706
707static void ftrace_add_profile(struct ftrace_profile_stat *stat,
708 struct ftrace_profile *rec)
709{
710 unsigned long key;
711
712 key = hash_long(rec->ip, FTRACE_PROFILE_HASH_BITS);
713 hlist_add_head_rcu(&rec->node, &stat->hash[key]);
714}
715
716/*
717 * The memory is already allocated, this simply finds a new record to use.
718 */
719static struct ftrace_profile *
720ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
721{
722 struct ftrace_profile *rec = NULL;
723
724 /* prevent recursion (from NMIs) */
725 if (atomic_inc_return(&stat->disabled) != 1)
726 goto out;
727
728 /*
729 * Try to find the function again since an NMI
730 * could have added it
731 */
732 rec = ftrace_find_profiled_func(stat, ip);
733 if (rec)
734 goto out;
735
736 if (stat->pages->index == PROFILES_PER_PAGE) {
737 if (!stat->pages->next)
738 goto out;
739 stat->pages = stat->pages->next;
740 }
741
742 rec = &stat->pages->records[stat->pages->index++];
743 rec->ip = ip;
744 ftrace_add_profile(stat, rec);
745
746 out:
747 atomic_dec(&stat->disabled);
748
749 return rec;
750}
751
752static void
753function_profile_call(unsigned long ip, unsigned long parent_ip,
754 struct ftrace_ops *ops, struct ftrace_regs *fregs)
755{
756 struct ftrace_profile_stat *stat;
757 struct ftrace_profile *rec;
758 unsigned long flags;
759
760 if (!ftrace_profile_enabled)
761 return;
762
763 local_irq_save(flags);
764
765 stat = this_cpu_ptr(&ftrace_profile_stats);
766 if (!stat->hash || !ftrace_profile_enabled)
767 goto out;
768
769 rec = ftrace_find_profiled_func(stat, ip);
770 if (!rec) {
771 rec = ftrace_profile_alloc(stat, ip);
772 if (!rec)
773 goto out;
774 }
775
776 rec->counter++;
777 out:
778 local_irq_restore(flags);
779}
780
781#ifdef CONFIG_FUNCTION_GRAPH_TRACER
782static bool fgraph_graph_time = true;
783
784void ftrace_graph_graph_time_control(bool enable)
785{
786 fgraph_graph_time = enable;
787}
788
789static int profile_graph_entry(struct ftrace_graph_ent *trace)
790{
791 struct ftrace_ret_stack *ret_stack;
792
793 function_profile_call(trace->func, 0, NULL, NULL);
794
795 /* If function graph is shutting down, ret_stack can be NULL */
796 if (!current->ret_stack)
797 return 0;
798
799 ret_stack = ftrace_graph_get_ret_stack(current, 0);
800 if (ret_stack)
801 ret_stack->subtime = 0;
802
803 return 1;
804}
805
806static void profile_graph_return(struct ftrace_graph_ret *trace)
807{
808 struct ftrace_ret_stack *ret_stack;
809 struct ftrace_profile_stat *stat;
810 unsigned long long calltime;
811 struct ftrace_profile *rec;
812 unsigned long flags;
813
814 local_irq_save(flags);
815 stat = this_cpu_ptr(&ftrace_profile_stats);
816 if (!stat->hash || !ftrace_profile_enabled)
817 goto out;
818
819 /* If the calltime was zero'd ignore it */
820 if (!trace->calltime)
821 goto out;
822
823 calltime = trace->rettime - trace->calltime;
824
825 if (!fgraph_graph_time) {
826
827 /* Append this call time to the parent time to subtract */
828 ret_stack = ftrace_graph_get_ret_stack(current, 1);
829 if (ret_stack)
830 ret_stack->subtime += calltime;
831
832 ret_stack = ftrace_graph_get_ret_stack(current, 0);
833 if (ret_stack && ret_stack->subtime < calltime)
834 calltime -= ret_stack->subtime;
835 else
836 calltime = 0;
837 }
838
839 rec = ftrace_find_profiled_func(stat, trace->func);
840 if (rec) {
841 rec->time += calltime;
842 rec->time_squared += calltime * calltime;
843 }
844
845 out:
846 local_irq_restore(flags);
847}
848
849static struct fgraph_ops fprofiler_ops = {
850 .entryfunc = &profile_graph_entry,
851 .retfunc = &profile_graph_return,
852};
853
854static int register_ftrace_profiler(void)
855{
856 return register_ftrace_graph(&fprofiler_ops);
857}
858
859static void unregister_ftrace_profiler(void)
860{
861 unregister_ftrace_graph(&fprofiler_ops);
862}
863#else
864static struct ftrace_ops ftrace_profile_ops __read_mostly = {
865 .func = function_profile_call,
866 .flags = FTRACE_OPS_FL_INITIALIZED,
867 INIT_OPS_HASH(ftrace_profile_ops)
868};
869
870static int register_ftrace_profiler(void)
871{
872 return register_ftrace_function(&ftrace_profile_ops);
873}
874
875static void unregister_ftrace_profiler(void)
876{
877 unregister_ftrace_function(&ftrace_profile_ops);
878}
879#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
880
881static ssize_t
882ftrace_profile_write(struct file *filp, const char __user *ubuf,
883 size_t cnt, loff_t *ppos)
884{
885 unsigned long val;
886 int ret;
887
888 ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
889 if (ret)
890 return ret;
891
892 val = !!val;
893
894 mutex_lock(&ftrace_profile_lock);
895 if (ftrace_profile_enabled ^ val) {
896 if (val) {
897 ret = ftrace_profile_init();
898 if (ret < 0) {
899 cnt = ret;
900 goto out;
901 }
902
903 ret = register_ftrace_profiler();
904 if (ret < 0) {
905 cnt = ret;
906 goto out;
907 }
908 ftrace_profile_enabled = 1;
909 } else {
910 ftrace_profile_enabled = 0;
911 /*
912 * unregister_ftrace_profiler calls stop_machine
913 * so this acts like an synchronize_rcu.
914 */
915 unregister_ftrace_profiler();
916 }
917 }
918 out:
919 mutex_unlock(&ftrace_profile_lock);
920
921 *ppos += cnt;
922
923 return cnt;
924}
925
926static ssize_t
927ftrace_profile_read(struct file *filp, char __user *ubuf,
928 size_t cnt, loff_t *ppos)
929{
930 char buf[64]; /* big enough to hold a number */
931 int r;
932
933 r = sprintf(buf, "%u\n", ftrace_profile_enabled);
934 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
935}
936
937static const struct file_operations ftrace_profile_fops = {
938 .open = tracing_open_generic,
939 .read = ftrace_profile_read,
940 .write = ftrace_profile_write,
941 .llseek = default_llseek,
942};
943
944/* used to initialize the real stat files */
945static struct tracer_stat function_stats __initdata = {
946 .name = "functions",
947 .stat_start = function_stat_start,
948 .stat_next = function_stat_next,
949 .stat_cmp = function_stat_cmp,
950 .stat_headers = function_stat_headers,
951 .stat_show = function_stat_show
952};
953
954static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
955{
956 struct ftrace_profile_stat *stat;
957 char *name;
958 int ret;
959 int cpu;
960
961 for_each_possible_cpu(cpu) {
962 stat = &per_cpu(ftrace_profile_stats, cpu);
963
964 name = kasprintf(GFP_KERNEL, "function%d", cpu);
965 if (!name) {
966 /*
967 * The files created are permanent, if something happens
968 * we still do not free memory.
969 */
970 WARN(1,
971 "Could not allocate stat file for cpu %d\n",
972 cpu);
973 return;
974 }
975 stat->stat = function_stats;
976 stat->stat.name = name;
977 ret = register_stat_tracer(&stat->stat);
978 if (ret) {
979 WARN(1,
980 "Could not register function stat for cpu %d\n",
981 cpu);
982 kfree(name);
983 return;
984 }
985 }
986
987 trace_create_file("function_profile_enabled",
988 TRACE_MODE_WRITE, d_tracer, NULL,
989 &ftrace_profile_fops);
990}
991
992#else /* CONFIG_FUNCTION_PROFILER */
993static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
994{
995}
996#endif /* CONFIG_FUNCTION_PROFILER */
997
998#ifdef CONFIG_DYNAMIC_FTRACE
999
1000static struct ftrace_ops *removed_ops;
1001
1002/*
1003 * Set when doing a global update, like enabling all recs or disabling them.
1004 * It is not set when just updating a single ftrace_ops.
1005 */
1006static bool update_all_ops;
1007
1008#ifndef CONFIG_FTRACE_MCOUNT_RECORD
1009# error Dynamic ftrace depends on MCOUNT_RECORD
1010#endif
1011
1012struct ftrace_func_probe {
1013 struct ftrace_probe_ops *probe_ops;
1014 struct ftrace_ops ops;
1015 struct trace_array *tr;
1016 struct list_head list;
1017 void *data;
1018 int ref;
1019};
1020
1021/*
1022 * We make these constant because no one should touch them,
1023 * but they are used as the default "empty hash", to avoid allocating
1024 * it all the time. These are in a read only section such that if
1025 * anyone does try to modify it, it will cause an exception.
1026 */
1027static const struct hlist_head empty_buckets[1];
1028static const struct ftrace_hash empty_hash = {
1029 .buckets = (struct hlist_head *)empty_buckets,
1030};
1031#define EMPTY_HASH ((struct ftrace_hash *)&empty_hash)
1032
1033struct ftrace_ops global_ops = {
1034 .func = ftrace_stub,
1035 .local_hash.notrace_hash = EMPTY_HASH,
1036 .local_hash.filter_hash = EMPTY_HASH,
1037 INIT_OPS_HASH(global_ops)
1038 .flags = FTRACE_OPS_FL_INITIALIZED |
1039 FTRACE_OPS_FL_PID,
1040};
1041
1042/*
1043 * Used by the stack unwinder to know about dynamic ftrace trampolines.
1044 */
1045struct ftrace_ops *ftrace_ops_trampoline(unsigned long addr)
1046{
1047 struct ftrace_ops *op = NULL;
1048
1049 /*
1050 * Some of the ops may be dynamically allocated,
1051 * they are freed after a synchronize_rcu().
1052 */
1053 preempt_disable_notrace();
1054
1055 do_for_each_ftrace_op(op, ftrace_ops_list) {
1056 /*
1057 * This is to check for dynamically allocated trampolines.
1058 * Trampolines that are in kernel text will have
1059 * core_kernel_text() return true.
1060 */
1061 if (op->trampoline && op->trampoline_size)
1062 if (addr >= op->trampoline &&
1063 addr < op->trampoline + op->trampoline_size) {
1064 preempt_enable_notrace();
1065 return op;
1066 }
1067 } while_for_each_ftrace_op(op);
1068 preempt_enable_notrace();
1069
1070 return NULL;
1071}
1072
1073/*
1074 * This is used by __kernel_text_address() to return true if the
1075 * address is on a dynamically allocated trampoline that would
1076 * not return true for either core_kernel_text() or
1077 * is_module_text_address().
1078 */
1079bool is_ftrace_trampoline(unsigned long addr)
1080{
1081 return ftrace_ops_trampoline(addr) != NULL;
1082}
1083
1084struct ftrace_page {
1085 struct ftrace_page *next;
1086 struct dyn_ftrace *records;
1087 int index;
1088 int order;
1089};
1090
1091#define ENTRY_SIZE sizeof(struct dyn_ftrace)
1092#define ENTRIES_PER_PAGE (PAGE_SIZE / ENTRY_SIZE)
1093
1094static struct ftrace_page *ftrace_pages_start;
1095static struct ftrace_page *ftrace_pages;
1096
1097static __always_inline unsigned long
1098ftrace_hash_key(struct ftrace_hash *hash, unsigned long ip)
1099{
1100 if (hash->size_bits > 0)
1101 return hash_long(ip, hash->size_bits);
1102
1103 return 0;
1104}
1105
1106/* Only use this function if ftrace_hash_empty() has already been tested */
1107static __always_inline struct ftrace_func_entry *
1108__ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1109{
1110 unsigned long key;
1111 struct ftrace_func_entry *entry;
1112 struct hlist_head *hhd;
1113
1114 key = ftrace_hash_key(hash, ip);
1115 hhd = &hash->buckets[key];
1116
1117 hlist_for_each_entry_rcu_notrace(entry, hhd, hlist) {
1118 if (entry->ip == ip)
1119 return entry;
1120 }
1121 return NULL;
1122}
1123
1124/**
1125 * ftrace_lookup_ip - Test to see if an ip exists in an ftrace_hash
1126 * @hash: The hash to look at
1127 * @ip: The instruction pointer to test
1128 *
1129 * Search a given @hash to see if a given instruction pointer (@ip)
1130 * exists in it.
1131 *
1132 * Returns the entry that holds the @ip if found. NULL otherwise.
1133 */
1134struct ftrace_func_entry *
1135ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1136{
1137 if (ftrace_hash_empty(hash))
1138 return NULL;
1139
1140 return __ftrace_lookup_ip(hash, ip);
1141}
1142
1143static void __add_hash_entry(struct ftrace_hash *hash,
1144 struct ftrace_func_entry *entry)
1145{
1146 struct hlist_head *hhd;
1147 unsigned long key;
1148
1149 key = ftrace_hash_key(hash, entry->ip);
1150 hhd = &hash->buckets[key];
1151 hlist_add_head(&entry->hlist, hhd);
1152 hash->count++;
1153}
1154
1155static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
1156{
1157 struct ftrace_func_entry *entry;
1158
1159 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
1160 if (!entry)
1161 return -ENOMEM;
1162
1163 entry->ip = ip;
1164 __add_hash_entry(hash, entry);
1165
1166 return 0;
1167}
1168
1169static void
1170free_hash_entry(struct ftrace_hash *hash,
1171 struct ftrace_func_entry *entry)
1172{
1173 hlist_del(&entry->hlist);
1174 kfree(entry);
1175 hash->count--;
1176}
1177
1178static void
1179remove_hash_entry(struct ftrace_hash *hash,
1180 struct ftrace_func_entry *entry)
1181{
1182 hlist_del_rcu(&entry->hlist);
1183 hash->count--;
1184}
1185
1186static void ftrace_hash_clear(struct ftrace_hash *hash)
1187{
1188 struct hlist_head *hhd;
1189 struct hlist_node *tn;
1190 struct ftrace_func_entry *entry;
1191 int size = 1 << hash->size_bits;
1192 int i;
1193
1194 if (!hash->count)
1195 return;
1196
1197 for (i = 0; i < size; i++) {
1198 hhd = &hash->buckets[i];
1199 hlist_for_each_entry_safe(entry, tn, hhd, hlist)
1200 free_hash_entry(hash, entry);
1201 }
1202 FTRACE_WARN_ON(hash->count);
1203}
1204
1205static void free_ftrace_mod(struct ftrace_mod_load *ftrace_mod)
1206{
1207 list_del(&ftrace_mod->list);
1208 kfree(ftrace_mod->module);
1209 kfree(ftrace_mod->func);
1210 kfree(ftrace_mod);
1211}
1212
1213static void clear_ftrace_mod_list(struct list_head *head)
1214{
1215 struct ftrace_mod_load *p, *n;
1216
1217 /* stack tracer isn't supported yet */
1218 if (!head)
1219 return;
1220
1221 mutex_lock(&ftrace_lock);
1222 list_for_each_entry_safe(p, n, head, list)
1223 free_ftrace_mod(p);
1224 mutex_unlock(&ftrace_lock);
1225}
1226
1227static void free_ftrace_hash(struct ftrace_hash *hash)
1228{
1229 if (!hash || hash == EMPTY_HASH)
1230 return;
1231 ftrace_hash_clear(hash);
1232 kfree(hash->buckets);
1233 kfree(hash);
1234}
1235
1236static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
1237{
1238 struct ftrace_hash *hash;
1239
1240 hash = container_of(rcu, struct ftrace_hash, rcu);
1241 free_ftrace_hash(hash);
1242}
1243
1244static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
1245{
1246 if (!hash || hash == EMPTY_HASH)
1247 return;
1248 call_rcu(&hash->rcu, __free_ftrace_hash_rcu);
1249}
1250
1251/**
1252 * ftrace_free_filter - remove all filters for an ftrace_ops
1253 * @ops - the ops to remove the filters from
1254 */
1255void ftrace_free_filter(struct ftrace_ops *ops)
1256{
1257 ftrace_ops_init(ops);
1258 free_ftrace_hash(ops->func_hash->filter_hash);
1259 free_ftrace_hash(ops->func_hash->notrace_hash);
1260}
1261EXPORT_SYMBOL_GPL(ftrace_free_filter);
1262
1263static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
1264{
1265 struct ftrace_hash *hash;
1266 int size;
1267
1268 hash = kzalloc(sizeof(*hash), GFP_KERNEL);
1269 if (!hash)
1270 return NULL;
1271
1272 size = 1 << size_bits;
1273 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL);
1274
1275 if (!hash->buckets) {
1276 kfree(hash);
1277 return NULL;
1278 }
1279
1280 hash->size_bits = size_bits;
1281
1282 return hash;
1283}
1284
1285
1286static int ftrace_add_mod(struct trace_array *tr,
1287 const char *func, const char *module,
1288 int enable)
1289{
1290 struct ftrace_mod_load *ftrace_mod;
1291 struct list_head *mod_head = enable ? &tr->mod_trace : &tr->mod_notrace;
1292
1293 ftrace_mod = kzalloc(sizeof(*ftrace_mod), GFP_KERNEL);
1294 if (!ftrace_mod)
1295 return -ENOMEM;
1296
1297 INIT_LIST_HEAD(&ftrace_mod->list);
1298 ftrace_mod->func = kstrdup(func, GFP_KERNEL);
1299 ftrace_mod->module = kstrdup(module, GFP_KERNEL);
1300 ftrace_mod->enable = enable;
1301
1302 if (!ftrace_mod->func || !ftrace_mod->module)
1303 goto out_free;
1304
1305 list_add(&ftrace_mod->list, mod_head);
1306
1307 return 0;
1308
1309 out_free:
1310 free_ftrace_mod(ftrace_mod);
1311
1312 return -ENOMEM;
1313}
1314
1315static struct ftrace_hash *
1316alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
1317{
1318 struct ftrace_func_entry *entry;
1319 struct ftrace_hash *new_hash;
1320 int size;
1321 int ret;
1322 int i;
1323
1324 new_hash = alloc_ftrace_hash(size_bits);
1325 if (!new_hash)
1326 return NULL;
1327
1328 if (hash)
1329 new_hash->flags = hash->flags;
1330
1331 /* Empty hash? */
1332 if (ftrace_hash_empty(hash))
1333 return new_hash;
1334
1335 size = 1 << hash->size_bits;
1336 for (i = 0; i < size; i++) {
1337 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
1338 ret = add_hash_entry(new_hash, entry->ip);
1339 if (ret < 0)
1340 goto free_hash;
1341 }
1342 }
1343
1344 FTRACE_WARN_ON(new_hash->count != hash->count);
1345
1346 return new_hash;
1347
1348 free_hash:
1349 free_ftrace_hash(new_hash);
1350 return NULL;
1351}
1352
1353static void
1354ftrace_hash_rec_disable_modify(struct ftrace_ops *ops, int filter_hash);
1355static void
1356ftrace_hash_rec_enable_modify(struct ftrace_ops *ops, int filter_hash);
1357
1358static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1359 struct ftrace_hash *new_hash);
1360
1361static struct ftrace_hash *dup_hash(struct ftrace_hash *src, int size)
1362{
1363 struct ftrace_func_entry *entry;
1364 struct ftrace_hash *new_hash;
1365 struct hlist_head *hhd;
1366 struct hlist_node *tn;
1367 int bits = 0;
1368 int i;
1369
1370 /*
1371 * Use around half the size (max bit of it), but
1372 * a minimum of 2 is fine (as size of 0 or 1 both give 1 for bits).
1373 */
1374 bits = fls(size / 2);
1375
1376 /* Don't allocate too much */
1377 if (bits > FTRACE_HASH_MAX_BITS)
1378 bits = FTRACE_HASH_MAX_BITS;
1379
1380 new_hash = alloc_ftrace_hash(bits);
1381 if (!new_hash)
1382 return NULL;
1383
1384 new_hash->flags = src->flags;
1385
1386 size = 1 << src->size_bits;
1387 for (i = 0; i < size; i++) {
1388 hhd = &src->buckets[i];
1389 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1390 remove_hash_entry(src, entry);
1391 __add_hash_entry(new_hash, entry);
1392 }
1393 }
1394 return new_hash;
1395}
1396
1397static struct ftrace_hash *
1398__ftrace_hash_move(struct ftrace_hash *src)
1399{
1400 int size = src->count;
1401
1402 /*
1403 * If the new source is empty, just return the empty_hash.
1404 */
1405 if (ftrace_hash_empty(src))
1406 return EMPTY_HASH;
1407
1408 return dup_hash(src, size);
1409}
1410
1411static int
1412ftrace_hash_move(struct ftrace_ops *ops, int enable,
1413 struct ftrace_hash **dst, struct ftrace_hash *src)
1414{
1415 struct ftrace_hash *new_hash;
1416 int ret;
1417
1418 /* Reject setting notrace hash on IPMODIFY ftrace_ops */
1419 if (ops->flags & FTRACE_OPS_FL_IPMODIFY && !enable)
1420 return -EINVAL;
1421
1422 new_hash = __ftrace_hash_move(src);
1423 if (!new_hash)
1424 return -ENOMEM;
1425
1426 /* Make sure this can be applied if it is IPMODIFY ftrace_ops */
1427 if (enable) {
1428 /* IPMODIFY should be updated only when filter_hash updating */
1429 ret = ftrace_hash_ipmodify_update(ops, new_hash);
1430 if (ret < 0) {
1431 free_ftrace_hash(new_hash);
1432 return ret;
1433 }
1434 }
1435
1436 /*
1437 * Remove the current set, update the hash and add
1438 * them back.
1439 */
1440 ftrace_hash_rec_disable_modify(ops, enable);
1441
1442 rcu_assign_pointer(*dst, new_hash);
1443
1444 ftrace_hash_rec_enable_modify(ops, enable);
1445
1446 return 0;
1447}
1448
1449static bool hash_contains_ip(unsigned long ip,
1450 struct ftrace_ops_hash *hash)
1451{
1452 /*
1453 * The function record is a match if it exists in the filter
1454 * hash and not in the notrace hash. Note, an empty hash is
1455 * considered a match for the filter hash, but an empty
1456 * notrace hash is considered not in the notrace hash.
1457 */
1458 return (ftrace_hash_empty(hash->filter_hash) ||
1459 __ftrace_lookup_ip(hash->filter_hash, ip)) &&
1460 (ftrace_hash_empty(hash->notrace_hash) ||
1461 !__ftrace_lookup_ip(hash->notrace_hash, ip));
1462}
1463
1464/*
1465 * Test the hashes for this ops to see if we want to call
1466 * the ops->func or not.
1467 *
1468 * It's a match if the ip is in the ops->filter_hash or
1469 * the filter_hash does not exist or is empty,
1470 * AND
1471 * the ip is not in the ops->notrace_hash.
1472 *
1473 * This needs to be called with preemption disabled as
1474 * the hashes are freed with call_rcu().
1475 */
1476int
1477ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1478{
1479 struct ftrace_ops_hash hash;
1480 int ret;
1481
1482#ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1483 /*
1484 * There's a small race when adding ops that the ftrace handler
1485 * that wants regs, may be called without them. We can not
1486 * allow that handler to be called if regs is NULL.
1487 */
1488 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1489 return 0;
1490#endif
1491
1492 rcu_assign_pointer(hash.filter_hash, ops->func_hash->filter_hash);
1493 rcu_assign_pointer(hash.notrace_hash, ops->func_hash->notrace_hash);
1494
1495 if (hash_contains_ip(ip, &hash))
1496 ret = 1;
1497 else
1498 ret = 0;
1499
1500 return ret;
1501}
1502
1503/*
1504 * This is a double for. Do not use 'break' to break out of the loop,
1505 * you must use a goto.
1506 */
1507#define do_for_each_ftrace_rec(pg, rec) \
1508 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1509 int _____i; \
1510 for (_____i = 0; _____i < pg->index; _____i++) { \
1511 rec = &pg->records[_____i];
1512
1513#define while_for_each_ftrace_rec() \
1514 } \
1515 }
1516
1517
1518static int ftrace_cmp_recs(const void *a, const void *b)
1519{
1520 const struct dyn_ftrace *key = a;
1521 const struct dyn_ftrace *rec = b;
1522
1523 if (key->flags < rec->ip)
1524 return -1;
1525 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1526 return 1;
1527 return 0;
1528}
1529
1530static struct dyn_ftrace *lookup_rec(unsigned long start, unsigned long end)
1531{
1532 struct ftrace_page *pg;
1533 struct dyn_ftrace *rec = NULL;
1534 struct dyn_ftrace key;
1535
1536 key.ip = start;
1537 key.flags = end; /* overload flags, as it is unsigned long */
1538
1539 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1540 if (end < pg->records[0].ip ||
1541 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1542 continue;
1543 rec = bsearch(&key, pg->records, pg->index,
1544 sizeof(struct dyn_ftrace),
1545 ftrace_cmp_recs);
1546 if (rec)
1547 break;
1548 }
1549 return rec;
1550}
1551
1552/**
1553 * ftrace_location_range - return the first address of a traced location
1554 * if it touches the given ip range
1555 * @start: start of range to search.
1556 * @end: end of range to search (inclusive). @end points to the last byte
1557 * to check.
1558 *
1559 * Returns rec->ip if the related ftrace location is a least partly within
1560 * the given address range. That is, the first address of the instruction
1561 * that is either a NOP or call to the function tracer. It checks the ftrace
1562 * internal tables to determine if the address belongs or not.
1563 */
1564unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1565{
1566 struct dyn_ftrace *rec;
1567
1568 rec = lookup_rec(start, end);
1569 if (rec)
1570 return rec->ip;
1571
1572 return 0;
1573}
1574
1575/**
1576 * ftrace_location - return the ftrace location
1577 * @ip: the instruction pointer to check
1578 *
1579 * If @ip matches the ftrace location, return @ip.
1580 * If @ip matches sym+0, return sym's ftrace location.
1581 * Otherwise, return 0.
1582 */
1583unsigned long ftrace_location(unsigned long ip)
1584{
1585 struct dyn_ftrace *rec;
1586 unsigned long offset;
1587 unsigned long size;
1588
1589 rec = lookup_rec(ip, ip);
1590 if (!rec) {
1591 if (!kallsyms_lookup_size_offset(ip, &size, &offset))
1592 goto out;
1593
1594 /* map sym+0 to __fentry__ */
1595 if (!offset)
1596 rec = lookup_rec(ip, ip + size - 1);
1597 }
1598
1599 if (rec)
1600 return rec->ip;
1601
1602out:
1603 return 0;
1604}
1605
1606/**
1607 * ftrace_text_reserved - return true if range contains an ftrace location
1608 * @start: start of range to search
1609 * @end: end of range to search (inclusive). @end points to the last byte to check.
1610 *
1611 * Returns 1 if @start and @end contains a ftrace location.
1612 * That is, the instruction that is either a NOP or call to
1613 * the function tracer. It checks the ftrace internal tables to
1614 * determine if the address belongs or not.
1615 */
1616int ftrace_text_reserved(const void *start, const void *end)
1617{
1618 unsigned long ret;
1619
1620 ret = ftrace_location_range((unsigned long)start,
1621 (unsigned long)end);
1622
1623 return (int)!!ret;
1624}
1625
1626/* Test if ops registered to this rec needs regs */
1627static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1628{
1629 struct ftrace_ops *ops;
1630 bool keep_regs = false;
1631
1632 for (ops = ftrace_ops_list;
1633 ops != &ftrace_list_end; ops = ops->next) {
1634 /* pass rec in as regs to have non-NULL val */
1635 if (ftrace_ops_test(ops, rec->ip, rec)) {
1636 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1637 keep_regs = true;
1638 break;
1639 }
1640 }
1641 }
1642
1643 return keep_regs;
1644}
1645
1646static struct ftrace_ops *
1647ftrace_find_tramp_ops_any(struct dyn_ftrace *rec);
1648static struct ftrace_ops *
1649ftrace_find_tramp_ops_any_other(struct dyn_ftrace *rec, struct ftrace_ops *op_exclude);
1650static struct ftrace_ops *
1651ftrace_find_tramp_ops_next(struct dyn_ftrace *rec, struct ftrace_ops *ops);
1652
1653static bool skip_record(struct dyn_ftrace *rec)
1654{
1655 /*
1656 * At boot up, weak functions are set to disable. Function tracing
1657 * can be enabled before they are, and they still need to be disabled now.
1658 * If the record is disabled, still continue if it is marked as already
1659 * enabled (this is needed to keep the accounting working).
1660 */
1661 return rec->flags & FTRACE_FL_DISABLED &&
1662 !(rec->flags & FTRACE_FL_ENABLED);
1663}
1664
1665static bool __ftrace_hash_rec_update(struct ftrace_ops *ops,
1666 int filter_hash,
1667 bool inc)
1668{
1669 struct ftrace_hash *hash;
1670 struct ftrace_hash *other_hash;
1671 struct ftrace_page *pg;
1672 struct dyn_ftrace *rec;
1673 bool update = false;
1674 int count = 0;
1675 int all = false;
1676
1677 /* Only update if the ops has been registered */
1678 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1679 return false;
1680
1681 /*
1682 * In the filter_hash case:
1683 * If the count is zero, we update all records.
1684 * Otherwise we just update the items in the hash.
1685 *
1686 * In the notrace_hash case:
1687 * We enable the update in the hash.
1688 * As disabling notrace means enabling the tracing,
1689 * and enabling notrace means disabling, the inc variable
1690 * gets inversed.
1691 */
1692 if (filter_hash) {
1693 hash = ops->func_hash->filter_hash;
1694 other_hash = ops->func_hash->notrace_hash;
1695 if (ftrace_hash_empty(hash))
1696 all = true;
1697 } else {
1698 inc = !inc;
1699 hash = ops->func_hash->notrace_hash;
1700 other_hash = ops->func_hash->filter_hash;
1701 /*
1702 * If the notrace hash has no items,
1703 * then there's nothing to do.
1704 */
1705 if (ftrace_hash_empty(hash))
1706 return false;
1707 }
1708
1709 do_for_each_ftrace_rec(pg, rec) {
1710 int in_other_hash = 0;
1711 int in_hash = 0;
1712 int match = 0;
1713
1714 if (skip_record(rec))
1715 continue;
1716
1717 if (all) {
1718 /*
1719 * Only the filter_hash affects all records.
1720 * Update if the record is not in the notrace hash.
1721 */
1722 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1723 match = 1;
1724 } else {
1725 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1726 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1727
1728 /*
1729 * If filter_hash is set, we want to match all functions
1730 * that are in the hash but not in the other hash.
1731 *
1732 * If filter_hash is not set, then we are decrementing.
1733 * That means we match anything that is in the hash
1734 * and also in the other_hash. That is, we need to turn
1735 * off functions in the other hash because they are disabled
1736 * by this hash.
1737 */
1738 if (filter_hash && in_hash && !in_other_hash)
1739 match = 1;
1740 else if (!filter_hash && in_hash &&
1741 (in_other_hash || ftrace_hash_empty(other_hash)))
1742 match = 1;
1743 }
1744 if (!match)
1745 continue;
1746
1747 if (inc) {
1748 rec->flags++;
1749 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1750 return false;
1751
1752 if (ops->flags & FTRACE_OPS_FL_DIRECT)
1753 rec->flags |= FTRACE_FL_DIRECT;
1754
1755 /*
1756 * If there's only a single callback registered to a
1757 * function, and the ops has a trampoline registered
1758 * for it, then we can call it directly.
1759 */
1760 if (ftrace_rec_count(rec) == 1 && ops->trampoline)
1761 rec->flags |= FTRACE_FL_TRAMP;
1762 else
1763 /*
1764 * If we are adding another function callback
1765 * to this function, and the previous had a
1766 * custom trampoline in use, then we need to go
1767 * back to the default trampoline.
1768 */
1769 rec->flags &= ~FTRACE_FL_TRAMP;
1770
1771 /*
1772 * If any ops wants regs saved for this function
1773 * then all ops will get saved regs.
1774 */
1775 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1776 rec->flags |= FTRACE_FL_REGS;
1777 } else {
1778 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1779 return false;
1780 rec->flags--;
1781
1782 /*
1783 * Only the internal direct_ops should have the
1784 * DIRECT flag set. Thus, if it is removing a
1785 * function, then that function should no longer
1786 * be direct.
1787 */
1788 if (ops->flags & FTRACE_OPS_FL_DIRECT)
1789 rec->flags &= ~FTRACE_FL_DIRECT;
1790
1791 /*
1792 * If the rec had REGS enabled and the ops that is
1793 * being removed had REGS set, then see if there is
1794 * still any ops for this record that wants regs.
1795 * If not, we can stop recording them.
1796 */
1797 if (ftrace_rec_count(rec) > 0 &&
1798 rec->flags & FTRACE_FL_REGS &&
1799 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1800 if (!test_rec_ops_needs_regs(rec))
1801 rec->flags &= ~FTRACE_FL_REGS;
1802 }
1803
1804 /*
1805 * The TRAMP needs to be set only if rec count
1806 * is decremented to one, and the ops that is
1807 * left has a trampoline. As TRAMP can only be
1808 * enabled if there is only a single ops attached
1809 * to it.
1810 */
1811 if (ftrace_rec_count(rec) == 1 &&
1812 ftrace_find_tramp_ops_any_other(rec, ops))
1813 rec->flags |= FTRACE_FL_TRAMP;
1814 else
1815 rec->flags &= ~FTRACE_FL_TRAMP;
1816
1817 /*
1818 * flags will be cleared in ftrace_check_record()
1819 * if rec count is zero.
1820 */
1821 }
1822 count++;
1823
1824 /* Must match FTRACE_UPDATE_CALLS in ftrace_modify_all_code() */
1825 update |= ftrace_test_record(rec, true) != FTRACE_UPDATE_IGNORE;
1826
1827 /* Shortcut, if we handled all records, we are done. */
1828 if (!all && count == hash->count)
1829 return update;
1830 } while_for_each_ftrace_rec();
1831
1832 return update;
1833}
1834
1835static bool ftrace_hash_rec_disable(struct ftrace_ops *ops,
1836 int filter_hash)
1837{
1838 return __ftrace_hash_rec_update(ops, filter_hash, 0);
1839}
1840
1841static bool ftrace_hash_rec_enable(struct ftrace_ops *ops,
1842 int filter_hash)
1843{
1844 return __ftrace_hash_rec_update(ops, filter_hash, 1);
1845}
1846
1847static void ftrace_hash_rec_update_modify(struct ftrace_ops *ops,
1848 int filter_hash, int inc)
1849{
1850 struct ftrace_ops *op;
1851
1852 __ftrace_hash_rec_update(ops, filter_hash, inc);
1853
1854 if (ops->func_hash != &global_ops.local_hash)
1855 return;
1856
1857 /*
1858 * If the ops shares the global_ops hash, then we need to update
1859 * all ops that are enabled and use this hash.
1860 */
1861 do_for_each_ftrace_op(op, ftrace_ops_list) {
1862 /* Already done */
1863 if (op == ops)
1864 continue;
1865 if (op->func_hash == &global_ops.local_hash)
1866 __ftrace_hash_rec_update(op, filter_hash, inc);
1867 } while_for_each_ftrace_op(op);
1868}
1869
1870static void ftrace_hash_rec_disable_modify(struct ftrace_ops *ops,
1871 int filter_hash)
1872{
1873 ftrace_hash_rec_update_modify(ops, filter_hash, 0);
1874}
1875
1876static void ftrace_hash_rec_enable_modify(struct ftrace_ops *ops,
1877 int filter_hash)
1878{
1879 ftrace_hash_rec_update_modify(ops, filter_hash, 1);
1880}
1881
1882/*
1883 * Try to update IPMODIFY flag on each ftrace_rec. Return 0 if it is OK
1884 * or no-needed to update, -EBUSY if it detects a conflict of the flag
1885 * on a ftrace_rec, and -EINVAL if the new_hash tries to trace all recs.
1886 * Note that old_hash and new_hash has below meanings
1887 * - If the hash is NULL, it hits all recs (if IPMODIFY is set, this is rejected)
1888 * - If the hash is EMPTY_HASH, it hits nothing
1889 * - Anything else hits the recs which match the hash entries.
1890 *
1891 * DIRECT ops does not have IPMODIFY flag, but we still need to check it
1892 * against functions with FTRACE_FL_IPMODIFY. If there is any overlap, call
1893 * ops_func(SHARE_IPMODIFY_SELF) to make sure current ops can share with
1894 * IPMODIFY. If ops_func(SHARE_IPMODIFY_SELF) returns non-zero, propagate
1895 * the return value to the caller and eventually to the owner of the DIRECT
1896 * ops.
1897 */
1898static int __ftrace_hash_update_ipmodify(struct ftrace_ops *ops,
1899 struct ftrace_hash *old_hash,
1900 struct ftrace_hash *new_hash)
1901{
1902 struct ftrace_page *pg;
1903 struct dyn_ftrace *rec, *end = NULL;
1904 int in_old, in_new;
1905 bool is_ipmodify, is_direct;
1906
1907 /* Only update if the ops has been registered */
1908 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1909 return 0;
1910
1911 is_ipmodify = ops->flags & FTRACE_OPS_FL_IPMODIFY;
1912 is_direct = ops->flags & FTRACE_OPS_FL_DIRECT;
1913
1914 /* neither IPMODIFY nor DIRECT, skip */
1915 if (!is_ipmodify && !is_direct)
1916 return 0;
1917
1918 if (WARN_ON_ONCE(is_ipmodify && is_direct))
1919 return 0;
1920
1921 /*
1922 * Since the IPMODIFY and DIRECT are very address sensitive
1923 * actions, we do not allow ftrace_ops to set all functions to new
1924 * hash.
1925 */
1926 if (!new_hash || !old_hash)
1927 return -EINVAL;
1928
1929 /* Update rec->flags */
1930 do_for_each_ftrace_rec(pg, rec) {
1931
1932 if (rec->flags & FTRACE_FL_DISABLED)
1933 continue;
1934
1935 /* We need to update only differences of filter_hash */
1936 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1937 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1938 if (in_old == in_new)
1939 continue;
1940
1941 if (in_new) {
1942 if (rec->flags & FTRACE_FL_IPMODIFY) {
1943 int ret;
1944
1945 /* Cannot have two ipmodify on same rec */
1946 if (is_ipmodify)
1947 goto rollback;
1948
1949 FTRACE_WARN_ON(rec->flags & FTRACE_FL_DIRECT);
1950
1951 /*
1952 * Another ops with IPMODIFY is already
1953 * attached. We are now attaching a direct
1954 * ops. Run SHARE_IPMODIFY_SELF, to check
1955 * whether sharing is supported.
1956 */
1957 if (!ops->ops_func)
1958 return -EBUSY;
1959 ret = ops->ops_func(ops, FTRACE_OPS_CMD_ENABLE_SHARE_IPMODIFY_SELF);
1960 if (ret)
1961 return ret;
1962 } else if (is_ipmodify) {
1963 rec->flags |= FTRACE_FL_IPMODIFY;
1964 }
1965 } else if (is_ipmodify) {
1966 rec->flags &= ~FTRACE_FL_IPMODIFY;
1967 }
1968 } while_for_each_ftrace_rec();
1969
1970 return 0;
1971
1972rollback:
1973 end = rec;
1974
1975 /* Roll back what we did above */
1976 do_for_each_ftrace_rec(pg, rec) {
1977
1978 if (rec->flags & FTRACE_FL_DISABLED)
1979 continue;
1980
1981 if (rec == end)
1982 goto err_out;
1983
1984 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1985 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1986 if (in_old == in_new)
1987 continue;
1988
1989 if (in_new)
1990 rec->flags &= ~FTRACE_FL_IPMODIFY;
1991 else
1992 rec->flags |= FTRACE_FL_IPMODIFY;
1993 } while_for_each_ftrace_rec();
1994
1995err_out:
1996 return -EBUSY;
1997}
1998
1999static int ftrace_hash_ipmodify_enable(struct ftrace_ops *ops)
2000{
2001 struct ftrace_hash *hash = ops->func_hash->filter_hash;
2002
2003 if (ftrace_hash_empty(hash))
2004 hash = NULL;
2005
2006 return __ftrace_hash_update_ipmodify(ops, EMPTY_HASH, hash);
2007}
2008
2009/* Disabling always succeeds */
2010static void ftrace_hash_ipmodify_disable(struct ftrace_ops *ops)
2011{
2012 struct ftrace_hash *hash = ops->func_hash->filter_hash;
2013
2014 if (ftrace_hash_empty(hash))
2015 hash = NULL;
2016
2017 __ftrace_hash_update_ipmodify(ops, hash, EMPTY_HASH);
2018}
2019
2020static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
2021 struct ftrace_hash *new_hash)
2022{
2023 struct ftrace_hash *old_hash = ops->func_hash->filter_hash;
2024
2025 if (ftrace_hash_empty(old_hash))
2026 old_hash = NULL;
2027
2028 if (ftrace_hash_empty(new_hash))
2029 new_hash = NULL;
2030
2031 return __ftrace_hash_update_ipmodify(ops, old_hash, new_hash);
2032}
2033
2034static void print_ip_ins(const char *fmt, const unsigned char *p)
2035{
2036 char ins[MCOUNT_INSN_SIZE];
2037
2038 if (copy_from_kernel_nofault(ins, p, MCOUNT_INSN_SIZE)) {
2039 printk(KERN_CONT "%s[FAULT] %px\n", fmt, p);
2040 return;
2041 }
2042
2043 printk(KERN_CONT "%s", fmt);
2044 pr_cont("%*phC", MCOUNT_INSN_SIZE, ins);
2045}
2046
2047enum ftrace_bug_type ftrace_bug_type;
2048const void *ftrace_expected;
2049
2050static void print_bug_type(void)
2051{
2052 switch (ftrace_bug_type) {
2053 case FTRACE_BUG_UNKNOWN:
2054 break;
2055 case FTRACE_BUG_INIT:
2056 pr_info("Initializing ftrace call sites\n");
2057 break;
2058 case FTRACE_BUG_NOP:
2059 pr_info("Setting ftrace call site to NOP\n");
2060 break;
2061 case FTRACE_BUG_CALL:
2062 pr_info("Setting ftrace call site to call ftrace function\n");
2063 break;
2064 case FTRACE_BUG_UPDATE:
2065 pr_info("Updating ftrace call site to call a different ftrace function\n");
2066 break;
2067 }
2068}
2069
2070/**
2071 * ftrace_bug - report and shutdown function tracer
2072 * @failed: The failed type (EFAULT, EINVAL, EPERM)
2073 * @rec: The record that failed
2074 *
2075 * The arch code that enables or disables the function tracing
2076 * can call ftrace_bug() when it has detected a problem in
2077 * modifying the code. @failed should be one of either:
2078 * EFAULT - if the problem happens on reading the @ip address
2079 * EINVAL - if what is read at @ip is not what was expected
2080 * EPERM - if the problem happens on writing to the @ip address
2081 */
2082void ftrace_bug(int failed, struct dyn_ftrace *rec)
2083{
2084 unsigned long ip = rec ? rec->ip : 0;
2085
2086 pr_info("------------[ ftrace bug ]------------\n");
2087
2088 switch (failed) {
2089 case -EFAULT:
2090 pr_info("ftrace faulted on modifying ");
2091 print_ip_sym(KERN_INFO, ip);
2092 break;
2093 case -EINVAL:
2094 pr_info("ftrace failed to modify ");
2095 print_ip_sym(KERN_INFO, ip);
2096 print_ip_ins(" actual: ", (unsigned char *)ip);
2097 pr_cont("\n");
2098 if (ftrace_expected) {
2099 print_ip_ins(" expected: ", ftrace_expected);
2100 pr_cont("\n");
2101 }
2102 break;
2103 case -EPERM:
2104 pr_info("ftrace faulted on writing ");
2105 print_ip_sym(KERN_INFO, ip);
2106 break;
2107 default:
2108 pr_info("ftrace faulted on unknown error ");
2109 print_ip_sym(KERN_INFO, ip);
2110 }
2111 print_bug_type();
2112 if (rec) {
2113 struct ftrace_ops *ops = NULL;
2114
2115 pr_info("ftrace record flags: %lx\n", rec->flags);
2116 pr_cont(" (%ld)%s", ftrace_rec_count(rec),
2117 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2118 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2119 ops = ftrace_find_tramp_ops_any(rec);
2120 if (ops) {
2121 do {
2122 pr_cont("\ttramp: %pS (%pS)",
2123 (void *)ops->trampoline,
2124 (void *)ops->func);
2125 ops = ftrace_find_tramp_ops_next(rec, ops);
2126 } while (ops);
2127 } else
2128 pr_cont("\ttramp: ERROR!");
2129
2130 }
2131 ip = ftrace_get_addr_curr(rec);
2132 pr_cont("\n expected tramp: %lx\n", ip);
2133 }
2134
2135 FTRACE_WARN_ON_ONCE(1);
2136}
2137
2138static int ftrace_check_record(struct dyn_ftrace *rec, bool enable, bool update)
2139{
2140 unsigned long flag = 0UL;
2141
2142 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2143
2144 if (skip_record(rec))
2145 return FTRACE_UPDATE_IGNORE;
2146
2147 /*
2148 * If we are updating calls:
2149 *
2150 * If the record has a ref count, then we need to enable it
2151 * because someone is using it.
2152 *
2153 * Otherwise we make sure its disabled.
2154 *
2155 * If we are disabling calls, then disable all records that
2156 * are enabled.
2157 */
2158 if (enable && ftrace_rec_count(rec))
2159 flag = FTRACE_FL_ENABLED;
2160
2161 /*
2162 * If enabling and the REGS flag does not match the REGS_EN, or
2163 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
2164 * this record. Set flags to fail the compare against ENABLED.
2165 * Same for direct calls.
2166 */
2167 if (flag) {
2168 if (!(rec->flags & FTRACE_FL_REGS) !=
2169 !(rec->flags & FTRACE_FL_REGS_EN))
2170 flag |= FTRACE_FL_REGS;
2171
2172 if (!(rec->flags & FTRACE_FL_TRAMP) !=
2173 !(rec->flags & FTRACE_FL_TRAMP_EN))
2174 flag |= FTRACE_FL_TRAMP;
2175
2176 /*
2177 * Direct calls are special, as count matters.
2178 * We must test the record for direct, if the
2179 * DIRECT and DIRECT_EN do not match, but only
2180 * if the count is 1. That's because, if the
2181 * count is something other than one, we do not
2182 * want the direct enabled (it will be done via the
2183 * direct helper). But if DIRECT_EN is set, and
2184 * the count is not one, we need to clear it.
2185 */
2186 if (ftrace_rec_count(rec) == 1) {
2187 if (!(rec->flags & FTRACE_FL_DIRECT) !=
2188 !(rec->flags & FTRACE_FL_DIRECT_EN))
2189 flag |= FTRACE_FL_DIRECT;
2190 } else if (rec->flags & FTRACE_FL_DIRECT_EN) {
2191 flag |= FTRACE_FL_DIRECT;
2192 }
2193 }
2194
2195 /* If the state of this record hasn't changed, then do nothing */
2196 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
2197 return FTRACE_UPDATE_IGNORE;
2198
2199 if (flag) {
2200 /* Save off if rec is being enabled (for return value) */
2201 flag ^= rec->flags & FTRACE_FL_ENABLED;
2202
2203 if (update) {
2204 rec->flags |= FTRACE_FL_ENABLED;
2205 if (flag & FTRACE_FL_REGS) {
2206 if (rec->flags & FTRACE_FL_REGS)
2207 rec->flags |= FTRACE_FL_REGS_EN;
2208 else
2209 rec->flags &= ~FTRACE_FL_REGS_EN;
2210 }
2211 if (flag & FTRACE_FL_TRAMP) {
2212 if (rec->flags & FTRACE_FL_TRAMP)
2213 rec->flags |= FTRACE_FL_TRAMP_EN;
2214 else
2215 rec->flags &= ~FTRACE_FL_TRAMP_EN;
2216 }
2217
2218 if (flag & FTRACE_FL_DIRECT) {
2219 /*
2220 * If there's only one user (direct_ops helper)
2221 * then we can call the direct function
2222 * directly (no ftrace trampoline).
2223 */
2224 if (ftrace_rec_count(rec) == 1) {
2225 if (rec->flags & FTRACE_FL_DIRECT)
2226 rec->flags |= FTRACE_FL_DIRECT_EN;
2227 else
2228 rec->flags &= ~FTRACE_FL_DIRECT_EN;
2229 } else {
2230 /*
2231 * Can only call directly if there's
2232 * only one callback to the function.
2233 */
2234 rec->flags &= ~FTRACE_FL_DIRECT_EN;
2235 }
2236 }
2237 }
2238
2239 /*
2240 * If this record is being updated from a nop, then
2241 * return UPDATE_MAKE_CALL.
2242 * Otherwise,
2243 * return UPDATE_MODIFY_CALL to tell the caller to convert
2244 * from the save regs, to a non-save regs function or
2245 * vice versa, or from a trampoline call.
2246 */
2247 if (flag & FTRACE_FL_ENABLED) {
2248 ftrace_bug_type = FTRACE_BUG_CALL;
2249 return FTRACE_UPDATE_MAKE_CALL;
2250 }
2251
2252 ftrace_bug_type = FTRACE_BUG_UPDATE;
2253 return FTRACE_UPDATE_MODIFY_CALL;
2254 }
2255
2256 if (update) {
2257 /* If there's no more users, clear all flags */
2258 if (!ftrace_rec_count(rec))
2259 rec->flags &= FTRACE_FL_DISABLED;
2260 else
2261 /*
2262 * Just disable the record, but keep the ops TRAMP
2263 * and REGS states. The _EN flags must be disabled though.
2264 */
2265 rec->flags &= ~(FTRACE_FL_ENABLED | FTRACE_FL_TRAMP_EN |
2266 FTRACE_FL_REGS_EN | FTRACE_FL_DIRECT_EN);
2267 }
2268
2269 ftrace_bug_type = FTRACE_BUG_NOP;
2270 return FTRACE_UPDATE_MAKE_NOP;
2271}
2272
2273/**
2274 * ftrace_update_record - set a record that now is tracing or not
2275 * @rec: the record to update
2276 * @enable: set to true if the record is tracing, false to force disable
2277 *
2278 * The records that represent all functions that can be traced need
2279 * to be updated when tracing has been enabled.
2280 */
2281int ftrace_update_record(struct dyn_ftrace *rec, bool enable)
2282{
2283 return ftrace_check_record(rec, enable, true);
2284}
2285
2286/**
2287 * ftrace_test_record - check if the record has been enabled or not
2288 * @rec: the record to test
2289 * @enable: set to true to check if enabled, false if it is disabled
2290 *
2291 * The arch code may need to test if a record is already set to
2292 * tracing to determine how to modify the function code that it
2293 * represents.
2294 */
2295int ftrace_test_record(struct dyn_ftrace *rec, bool enable)
2296{
2297 return ftrace_check_record(rec, enable, false);
2298}
2299
2300static struct ftrace_ops *
2301ftrace_find_tramp_ops_any(struct dyn_ftrace *rec)
2302{
2303 struct ftrace_ops *op;
2304 unsigned long ip = rec->ip;
2305
2306 do_for_each_ftrace_op(op, ftrace_ops_list) {
2307
2308 if (!op->trampoline)
2309 continue;
2310
2311 if (hash_contains_ip(ip, op->func_hash))
2312 return op;
2313 } while_for_each_ftrace_op(op);
2314
2315 return NULL;
2316}
2317
2318static struct ftrace_ops *
2319ftrace_find_tramp_ops_any_other(struct dyn_ftrace *rec, struct ftrace_ops *op_exclude)
2320{
2321 struct ftrace_ops *op;
2322 unsigned long ip = rec->ip;
2323
2324 do_for_each_ftrace_op(op, ftrace_ops_list) {
2325
2326 if (op == op_exclude || !op->trampoline)
2327 continue;
2328
2329 if (hash_contains_ip(ip, op->func_hash))
2330 return op;
2331 } while_for_each_ftrace_op(op);
2332
2333 return NULL;
2334}
2335
2336static struct ftrace_ops *
2337ftrace_find_tramp_ops_next(struct dyn_ftrace *rec,
2338 struct ftrace_ops *op)
2339{
2340 unsigned long ip = rec->ip;
2341
2342 while_for_each_ftrace_op(op) {
2343
2344 if (!op->trampoline)
2345 continue;
2346
2347 if (hash_contains_ip(ip, op->func_hash))
2348 return op;
2349 }
2350
2351 return NULL;
2352}
2353
2354static struct ftrace_ops *
2355ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
2356{
2357 struct ftrace_ops *op;
2358 unsigned long ip = rec->ip;
2359
2360 /*
2361 * Need to check removed ops first.
2362 * If they are being removed, and this rec has a tramp,
2363 * and this rec is in the ops list, then it would be the
2364 * one with the tramp.
2365 */
2366 if (removed_ops) {
2367 if (hash_contains_ip(ip, &removed_ops->old_hash))
2368 return removed_ops;
2369 }
2370
2371 /*
2372 * Need to find the current trampoline for a rec.
2373 * Now, a trampoline is only attached to a rec if there
2374 * was a single 'ops' attached to it. But this can be called
2375 * when we are adding another op to the rec or removing the
2376 * current one. Thus, if the op is being added, we can
2377 * ignore it because it hasn't attached itself to the rec
2378 * yet.
2379 *
2380 * If an ops is being modified (hooking to different functions)
2381 * then we don't care about the new functions that are being
2382 * added, just the old ones (that are probably being removed).
2383 *
2384 * If we are adding an ops to a function that already is using
2385 * a trampoline, it needs to be removed (trampolines are only
2386 * for single ops connected), then an ops that is not being
2387 * modified also needs to be checked.
2388 */
2389 do_for_each_ftrace_op(op, ftrace_ops_list) {
2390
2391 if (!op->trampoline)
2392 continue;
2393
2394 /*
2395 * If the ops is being added, it hasn't gotten to
2396 * the point to be removed from this tree yet.
2397 */
2398 if (op->flags & FTRACE_OPS_FL_ADDING)
2399 continue;
2400
2401
2402 /*
2403 * If the ops is being modified and is in the old
2404 * hash, then it is probably being removed from this
2405 * function.
2406 */
2407 if ((op->flags & FTRACE_OPS_FL_MODIFYING) &&
2408 hash_contains_ip(ip, &op->old_hash))
2409 return op;
2410 /*
2411 * If the ops is not being added or modified, and it's
2412 * in its normal filter hash, then this must be the one
2413 * we want!
2414 */
2415 if (!(op->flags & FTRACE_OPS_FL_MODIFYING) &&
2416 hash_contains_ip(ip, op->func_hash))
2417 return op;
2418
2419 } while_for_each_ftrace_op(op);
2420
2421 return NULL;
2422}
2423
2424static struct ftrace_ops *
2425ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
2426{
2427 struct ftrace_ops *op;
2428 unsigned long ip = rec->ip;
2429
2430 do_for_each_ftrace_op(op, ftrace_ops_list) {
2431 /* pass rec in as regs to have non-NULL val */
2432 if (hash_contains_ip(ip, op->func_hash))
2433 return op;
2434 } while_for_each_ftrace_op(op);
2435
2436 return NULL;
2437}
2438
2439#ifdef CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS
2440/* Protected by rcu_tasks for reading, and direct_mutex for writing */
2441static struct ftrace_hash *direct_functions = EMPTY_HASH;
2442static DEFINE_MUTEX(direct_mutex);
2443int ftrace_direct_func_count;
2444
2445/*
2446 * Search the direct_functions hash to see if the given instruction pointer
2447 * has a direct caller attached to it.
2448 */
2449unsigned long ftrace_find_rec_direct(unsigned long ip)
2450{
2451 struct ftrace_func_entry *entry;
2452
2453 entry = __ftrace_lookup_ip(direct_functions, ip);
2454 if (!entry)
2455 return 0;
2456
2457 return entry->direct;
2458}
2459
2460static struct ftrace_func_entry*
2461ftrace_add_rec_direct(unsigned long ip, unsigned long addr,
2462 struct ftrace_hash **free_hash)
2463{
2464 struct ftrace_func_entry *entry;
2465
2466 if (ftrace_hash_empty(direct_functions) ||
2467 direct_functions->count > 2 * (1 << direct_functions->size_bits)) {
2468 struct ftrace_hash *new_hash;
2469 int size = ftrace_hash_empty(direct_functions) ? 0 :
2470 direct_functions->count + 1;
2471
2472 if (size < 32)
2473 size = 32;
2474
2475 new_hash = dup_hash(direct_functions, size);
2476 if (!new_hash)
2477 return NULL;
2478
2479 *free_hash = direct_functions;
2480 direct_functions = new_hash;
2481 }
2482
2483 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
2484 if (!entry)
2485 return NULL;
2486
2487 entry->ip = ip;
2488 entry->direct = addr;
2489 __add_hash_entry(direct_functions, entry);
2490 return entry;
2491}
2492
2493static void call_direct_funcs(unsigned long ip, unsigned long pip,
2494 struct ftrace_ops *ops, struct ftrace_regs *fregs)
2495{
2496 unsigned long addr;
2497
2498 addr = ftrace_find_rec_direct(ip);
2499 if (!addr)
2500 return;
2501
2502 arch_ftrace_set_direct_caller(fregs, addr);
2503}
2504
2505struct ftrace_ops direct_ops = {
2506 .func = call_direct_funcs,
2507 .flags = FTRACE_OPS_FL_DIRECT | FTRACE_OPS_FL_SAVE_REGS
2508 | FTRACE_OPS_FL_PERMANENT,
2509 /*
2510 * By declaring the main trampoline as this trampoline
2511 * it will never have one allocated for it. Allocated
2512 * trampolines should not call direct functions.
2513 * The direct_ops should only be called by the builtin
2514 * ftrace_regs_caller trampoline.
2515 */
2516 .trampoline = FTRACE_REGS_ADDR,
2517};
2518#endif /* CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS */
2519
2520/**
2521 * ftrace_get_addr_new - Get the call address to set to
2522 * @rec: The ftrace record descriptor
2523 *
2524 * If the record has the FTRACE_FL_REGS set, that means that it
2525 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
2526 * is not set, then it wants to convert to the normal callback.
2527 *
2528 * Returns the address of the trampoline to set to
2529 */
2530unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
2531{
2532 struct ftrace_ops *ops;
2533 unsigned long addr;
2534
2535 if ((rec->flags & FTRACE_FL_DIRECT) &&
2536 (ftrace_rec_count(rec) == 1)) {
2537 addr = ftrace_find_rec_direct(rec->ip);
2538 if (addr)
2539 return addr;
2540 WARN_ON_ONCE(1);
2541 }
2542
2543 /* Trampolines take precedence over regs */
2544 if (rec->flags & FTRACE_FL_TRAMP) {
2545 ops = ftrace_find_tramp_ops_new(rec);
2546 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
2547 pr_warn("Bad trampoline accounting at: %p (%pS) (%lx)\n",
2548 (void *)rec->ip, (void *)rec->ip, rec->flags);
2549 /* Ftrace is shutting down, return anything */
2550 return (unsigned long)FTRACE_ADDR;
2551 }
2552 return ops->trampoline;
2553 }
2554
2555 if (rec->flags & FTRACE_FL_REGS)
2556 return (unsigned long)FTRACE_REGS_ADDR;
2557 else
2558 return (unsigned long)FTRACE_ADDR;
2559}
2560
2561/**
2562 * ftrace_get_addr_curr - Get the call address that is already there
2563 * @rec: The ftrace record descriptor
2564 *
2565 * The FTRACE_FL_REGS_EN is set when the record already points to
2566 * a function that saves all the regs. Basically the '_EN' version
2567 * represents the current state of the function.
2568 *
2569 * Returns the address of the trampoline that is currently being called
2570 */
2571unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
2572{
2573 struct ftrace_ops *ops;
2574 unsigned long addr;
2575
2576 /* Direct calls take precedence over trampolines */
2577 if (rec->flags & FTRACE_FL_DIRECT_EN) {
2578 addr = ftrace_find_rec_direct(rec->ip);
2579 if (addr)
2580 return addr;
2581 WARN_ON_ONCE(1);
2582 }
2583
2584 /* Trampolines take precedence over regs */
2585 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2586 ops = ftrace_find_tramp_ops_curr(rec);
2587 if (FTRACE_WARN_ON(!ops)) {
2588 pr_warn("Bad trampoline accounting at: %p (%pS)\n",
2589 (void *)rec->ip, (void *)rec->ip);
2590 /* Ftrace is shutting down, return anything */
2591 return (unsigned long)FTRACE_ADDR;
2592 }
2593 return ops->trampoline;
2594 }
2595
2596 if (rec->flags & FTRACE_FL_REGS_EN)
2597 return (unsigned long)FTRACE_REGS_ADDR;
2598 else
2599 return (unsigned long)FTRACE_ADDR;
2600}
2601
2602static int
2603__ftrace_replace_code(struct dyn_ftrace *rec, bool enable)
2604{
2605 unsigned long ftrace_old_addr;
2606 unsigned long ftrace_addr;
2607 int ret;
2608
2609 ftrace_addr = ftrace_get_addr_new(rec);
2610
2611 /* This needs to be done before we call ftrace_update_record */
2612 ftrace_old_addr = ftrace_get_addr_curr(rec);
2613
2614 ret = ftrace_update_record(rec, enable);
2615
2616 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2617
2618 switch (ret) {
2619 case FTRACE_UPDATE_IGNORE:
2620 return 0;
2621
2622 case FTRACE_UPDATE_MAKE_CALL:
2623 ftrace_bug_type = FTRACE_BUG_CALL;
2624 return ftrace_make_call(rec, ftrace_addr);
2625
2626 case FTRACE_UPDATE_MAKE_NOP:
2627 ftrace_bug_type = FTRACE_BUG_NOP;
2628 return ftrace_make_nop(NULL, rec, ftrace_old_addr);
2629
2630 case FTRACE_UPDATE_MODIFY_CALL:
2631 ftrace_bug_type = FTRACE_BUG_UPDATE;
2632 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
2633 }
2634
2635 return -1; /* unknown ftrace bug */
2636}
2637
2638void __weak ftrace_replace_code(int mod_flags)
2639{
2640 struct dyn_ftrace *rec;
2641 struct ftrace_page *pg;
2642 bool enable = mod_flags & FTRACE_MODIFY_ENABLE_FL;
2643 int schedulable = mod_flags & FTRACE_MODIFY_MAY_SLEEP_FL;
2644 int failed;
2645
2646 if (unlikely(ftrace_disabled))
2647 return;
2648
2649 do_for_each_ftrace_rec(pg, rec) {
2650
2651 if (skip_record(rec))
2652 continue;
2653
2654 failed = __ftrace_replace_code(rec, enable);
2655 if (failed) {
2656 ftrace_bug(failed, rec);
2657 /* Stop processing */
2658 return;
2659 }
2660 if (schedulable)
2661 cond_resched();
2662 } while_for_each_ftrace_rec();
2663}
2664
2665struct ftrace_rec_iter {
2666 struct ftrace_page *pg;
2667 int index;
2668};
2669
2670/**
2671 * ftrace_rec_iter_start - start up iterating over traced functions
2672 *
2673 * Returns an iterator handle that is used to iterate over all
2674 * the records that represent address locations where functions
2675 * are traced.
2676 *
2677 * May return NULL if no records are available.
2678 */
2679struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2680{
2681 /*
2682 * We only use a single iterator.
2683 * Protected by the ftrace_lock mutex.
2684 */
2685 static struct ftrace_rec_iter ftrace_rec_iter;
2686 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2687
2688 iter->pg = ftrace_pages_start;
2689 iter->index = 0;
2690
2691 /* Could have empty pages */
2692 while (iter->pg && !iter->pg->index)
2693 iter->pg = iter->pg->next;
2694
2695 if (!iter->pg)
2696 return NULL;
2697
2698 return iter;
2699}
2700
2701/**
2702 * ftrace_rec_iter_next - get the next record to process.
2703 * @iter: The handle to the iterator.
2704 *
2705 * Returns the next iterator after the given iterator @iter.
2706 */
2707struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2708{
2709 iter->index++;
2710
2711 if (iter->index >= iter->pg->index) {
2712 iter->pg = iter->pg->next;
2713 iter->index = 0;
2714
2715 /* Could have empty pages */
2716 while (iter->pg && !iter->pg->index)
2717 iter->pg = iter->pg->next;
2718 }
2719
2720 if (!iter->pg)
2721 return NULL;
2722
2723 return iter;
2724}
2725
2726/**
2727 * ftrace_rec_iter_record - get the record at the iterator location
2728 * @iter: The current iterator location
2729 *
2730 * Returns the record that the current @iter is at.
2731 */
2732struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2733{
2734 return &iter->pg->records[iter->index];
2735}
2736
2737static int
2738ftrace_nop_initialize(struct module *mod, struct dyn_ftrace *rec)
2739{
2740 int ret;
2741
2742 if (unlikely(ftrace_disabled))
2743 return 0;
2744
2745 ret = ftrace_init_nop(mod, rec);
2746 if (ret) {
2747 ftrace_bug_type = FTRACE_BUG_INIT;
2748 ftrace_bug(ret, rec);
2749 return 0;
2750 }
2751 return 1;
2752}
2753
2754/*
2755 * archs can override this function if they must do something
2756 * before the modifying code is performed.
2757 */
2758void __weak ftrace_arch_code_modify_prepare(void)
2759{
2760}
2761
2762/*
2763 * archs can override this function if they must do something
2764 * after the modifying code is performed.
2765 */
2766void __weak ftrace_arch_code_modify_post_process(void)
2767{
2768}
2769
2770static int update_ftrace_func(ftrace_func_t func)
2771{
2772 static ftrace_func_t save_func;
2773
2774 /* Avoid updating if it hasn't changed */
2775 if (func == save_func)
2776 return 0;
2777
2778 save_func = func;
2779
2780 return ftrace_update_ftrace_func(func);
2781}
2782
2783void ftrace_modify_all_code(int command)
2784{
2785 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2786 int mod_flags = 0;
2787 int err = 0;
2788
2789 if (command & FTRACE_MAY_SLEEP)
2790 mod_flags = FTRACE_MODIFY_MAY_SLEEP_FL;
2791
2792 /*
2793 * If the ftrace_caller calls a ftrace_ops func directly,
2794 * we need to make sure that it only traces functions it
2795 * expects to trace. When doing the switch of functions,
2796 * we need to update to the ftrace_ops_list_func first
2797 * before the transition between old and new calls are set,
2798 * as the ftrace_ops_list_func will check the ops hashes
2799 * to make sure the ops are having the right functions
2800 * traced.
2801 */
2802 if (update) {
2803 err = update_ftrace_func(ftrace_ops_list_func);
2804 if (FTRACE_WARN_ON(err))
2805 return;
2806 }
2807
2808 if (command & FTRACE_UPDATE_CALLS)
2809 ftrace_replace_code(mod_flags | FTRACE_MODIFY_ENABLE_FL);
2810 else if (command & FTRACE_DISABLE_CALLS)
2811 ftrace_replace_code(mod_flags);
2812
2813 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2814 function_trace_op = set_function_trace_op;
2815 smp_wmb();
2816 /* If irqs are disabled, we are in stop machine */
2817 if (!irqs_disabled())
2818 smp_call_function(ftrace_sync_ipi, NULL, 1);
2819 err = update_ftrace_func(ftrace_trace_function);
2820 if (FTRACE_WARN_ON(err))
2821 return;
2822 }
2823
2824 if (command & FTRACE_START_FUNC_RET)
2825 err = ftrace_enable_ftrace_graph_caller();
2826 else if (command & FTRACE_STOP_FUNC_RET)
2827 err = ftrace_disable_ftrace_graph_caller();
2828 FTRACE_WARN_ON(err);
2829}
2830
2831static int __ftrace_modify_code(void *data)
2832{
2833 int *command = data;
2834
2835 ftrace_modify_all_code(*command);
2836
2837 return 0;
2838}
2839
2840/**
2841 * ftrace_run_stop_machine - go back to the stop machine method
2842 * @command: The command to tell ftrace what to do
2843 *
2844 * If an arch needs to fall back to the stop machine method, the
2845 * it can call this function.
2846 */
2847void ftrace_run_stop_machine(int command)
2848{
2849 stop_machine(__ftrace_modify_code, &command, NULL);
2850}
2851
2852/**
2853 * arch_ftrace_update_code - modify the code to trace or not trace
2854 * @command: The command that needs to be done
2855 *
2856 * Archs can override this function if it does not need to
2857 * run stop_machine() to modify code.
2858 */
2859void __weak arch_ftrace_update_code(int command)
2860{
2861 ftrace_run_stop_machine(command);
2862}
2863
2864static void ftrace_run_update_code(int command)
2865{
2866 ftrace_arch_code_modify_prepare();
2867
2868 /*
2869 * By default we use stop_machine() to modify the code.
2870 * But archs can do what ever they want as long as it
2871 * is safe. The stop_machine() is the safest, but also
2872 * produces the most overhead.
2873 */
2874 arch_ftrace_update_code(command);
2875
2876 ftrace_arch_code_modify_post_process();
2877}
2878
2879static void ftrace_run_modify_code(struct ftrace_ops *ops, int command,
2880 struct ftrace_ops_hash *old_hash)
2881{
2882 ops->flags |= FTRACE_OPS_FL_MODIFYING;
2883 ops->old_hash.filter_hash = old_hash->filter_hash;
2884 ops->old_hash.notrace_hash = old_hash->notrace_hash;
2885 ftrace_run_update_code(command);
2886 ops->old_hash.filter_hash = NULL;
2887 ops->old_hash.notrace_hash = NULL;
2888 ops->flags &= ~FTRACE_OPS_FL_MODIFYING;
2889}
2890
2891static ftrace_func_t saved_ftrace_func;
2892static int ftrace_start_up;
2893
2894void __weak arch_ftrace_trampoline_free(struct ftrace_ops *ops)
2895{
2896}
2897
2898/* List of trace_ops that have allocated trampolines */
2899static LIST_HEAD(ftrace_ops_trampoline_list);
2900
2901static void ftrace_add_trampoline_to_kallsyms(struct ftrace_ops *ops)
2902{
2903 lockdep_assert_held(&ftrace_lock);
2904 list_add_rcu(&ops->list, &ftrace_ops_trampoline_list);
2905}
2906
2907static void ftrace_remove_trampoline_from_kallsyms(struct ftrace_ops *ops)
2908{
2909 lockdep_assert_held(&ftrace_lock);
2910 list_del_rcu(&ops->list);
2911 synchronize_rcu();
2912}
2913
2914/*
2915 * "__builtin__ftrace" is used as a module name in /proc/kallsyms for symbols
2916 * for pages allocated for ftrace purposes, even though "__builtin__ftrace" is
2917 * not a module.
2918 */
2919#define FTRACE_TRAMPOLINE_MOD "__builtin__ftrace"
2920#define FTRACE_TRAMPOLINE_SYM "ftrace_trampoline"
2921
2922static void ftrace_trampoline_free(struct ftrace_ops *ops)
2923{
2924 if (ops && (ops->flags & FTRACE_OPS_FL_ALLOC_TRAMP) &&
2925 ops->trampoline) {
2926 /*
2927 * Record the text poke event before the ksymbol unregister
2928 * event.
2929 */
2930 perf_event_text_poke((void *)ops->trampoline,
2931 (void *)ops->trampoline,
2932 ops->trampoline_size, NULL, 0);
2933 perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL,
2934 ops->trampoline, ops->trampoline_size,
2935 true, FTRACE_TRAMPOLINE_SYM);
2936 /* Remove from kallsyms after the perf events */
2937 ftrace_remove_trampoline_from_kallsyms(ops);
2938 }
2939
2940 arch_ftrace_trampoline_free(ops);
2941}
2942
2943static void ftrace_startup_enable(int command)
2944{
2945 if (saved_ftrace_func != ftrace_trace_function) {
2946 saved_ftrace_func = ftrace_trace_function;
2947 command |= FTRACE_UPDATE_TRACE_FUNC;
2948 }
2949
2950 if (!command || !ftrace_enabled)
2951 return;
2952
2953 ftrace_run_update_code(command);
2954}
2955
2956static void ftrace_startup_all(int command)
2957{
2958 update_all_ops = true;
2959 ftrace_startup_enable(command);
2960 update_all_ops = false;
2961}
2962
2963int ftrace_startup(struct ftrace_ops *ops, int command)
2964{
2965 int ret;
2966
2967 if (unlikely(ftrace_disabled))
2968 return -ENODEV;
2969
2970 ret = __register_ftrace_function(ops);
2971 if (ret)
2972 return ret;
2973
2974 ftrace_start_up++;
2975
2976 /*
2977 * Note that ftrace probes uses this to start up
2978 * and modify functions it will probe. But we still
2979 * set the ADDING flag for modification, as probes
2980 * do not have trampolines. If they add them in the
2981 * future, then the probes will need to distinguish
2982 * between adding and updating probes.
2983 */
2984 ops->flags |= FTRACE_OPS_FL_ENABLED | FTRACE_OPS_FL_ADDING;
2985
2986 ret = ftrace_hash_ipmodify_enable(ops);
2987 if (ret < 0) {
2988 /* Rollback registration process */
2989 __unregister_ftrace_function(ops);
2990 ftrace_start_up--;
2991 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2992 if (ops->flags & FTRACE_OPS_FL_DYNAMIC)
2993 ftrace_trampoline_free(ops);
2994 return ret;
2995 }
2996
2997 if (ftrace_hash_rec_enable(ops, 1))
2998 command |= FTRACE_UPDATE_CALLS;
2999
3000 ftrace_startup_enable(command);
3001
3002 /*
3003 * If ftrace is in an undefined state, we just remove ops from list
3004 * to prevent the NULL pointer, instead of totally rolling it back and
3005 * free trampoline, because those actions could cause further damage.
3006 */
3007 if (unlikely(ftrace_disabled)) {
3008 __unregister_ftrace_function(ops);
3009 return -ENODEV;
3010 }
3011
3012 ops->flags &= ~FTRACE_OPS_FL_ADDING;
3013
3014 return 0;
3015}
3016
3017int ftrace_shutdown(struct ftrace_ops *ops, int command)
3018{
3019 int ret;
3020
3021 if (unlikely(ftrace_disabled))
3022 return -ENODEV;
3023
3024 ret = __unregister_ftrace_function(ops);
3025 if (ret)
3026 return ret;
3027
3028 ftrace_start_up--;
3029 /*
3030 * Just warn in case of unbalance, no need to kill ftrace, it's not
3031 * critical but the ftrace_call callers may be never nopped again after
3032 * further ftrace uses.
3033 */
3034 WARN_ON_ONCE(ftrace_start_up < 0);
3035
3036 /* Disabling ipmodify never fails */
3037 ftrace_hash_ipmodify_disable(ops);
3038
3039 if (ftrace_hash_rec_disable(ops, 1))
3040 command |= FTRACE_UPDATE_CALLS;
3041
3042 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
3043
3044 if (saved_ftrace_func != ftrace_trace_function) {
3045 saved_ftrace_func = ftrace_trace_function;
3046 command |= FTRACE_UPDATE_TRACE_FUNC;
3047 }
3048
3049 if (!command || !ftrace_enabled)
3050 goto out;
3051
3052 /*
3053 * If the ops uses a trampoline, then it needs to be
3054 * tested first on update.
3055 */
3056 ops->flags |= FTRACE_OPS_FL_REMOVING;
3057 removed_ops = ops;
3058
3059 /* The trampoline logic checks the old hashes */
3060 ops->old_hash.filter_hash = ops->func_hash->filter_hash;
3061 ops->old_hash.notrace_hash = ops->func_hash->notrace_hash;
3062
3063 ftrace_run_update_code(command);
3064
3065 /*
3066 * If there's no more ops registered with ftrace, run a
3067 * sanity check to make sure all rec flags are cleared.
3068 */
3069 if (rcu_dereference_protected(ftrace_ops_list,
3070 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
3071 struct ftrace_page *pg;
3072 struct dyn_ftrace *rec;
3073
3074 do_for_each_ftrace_rec(pg, rec) {
3075 if (FTRACE_WARN_ON_ONCE(rec->flags & ~FTRACE_FL_DISABLED))
3076 pr_warn(" %pS flags:%lx\n",
3077 (void *)rec->ip, rec->flags);
3078 } while_for_each_ftrace_rec();
3079 }
3080
3081 ops->old_hash.filter_hash = NULL;
3082 ops->old_hash.notrace_hash = NULL;
3083
3084 removed_ops = NULL;
3085 ops->flags &= ~FTRACE_OPS_FL_REMOVING;
3086
3087out:
3088 /*
3089 * Dynamic ops may be freed, we must make sure that all
3090 * callers are done before leaving this function.
3091 */
3092 if (ops->flags & FTRACE_OPS_FL_DYNAMIC) {
3093 /*
3094 * We need to do a hard force of sched synchronization.
3095 * This is because we use preempt_disable() to do RCU, but
3096 * the function tracers can be called where RCU is not watching
3097 * (like before user_exit()). We can not rely on the RCU
3098 * infrastructure to do the synchronization, thus we must do it
3099 * ourselves.
3100 */
3101 synchronize_rcu_tasks_rude();
3102
3103 /*
3104 * When the kernel is preemptive, tasks can be preempted
3105 * while on a ftrace trampoline. Just scheduling a task on
3106 * a CPU is not good enough to flush them. Calling
3107 * synchronize_rcu_tasks() will wait for those tasks to
3108 * execute and either schedule voluntarily or enter user space.
3109 */
3110 if (IS_ENABLED(CONFIG_PREEMPTION))
3111 synchronize_rcu_tasks();
3112
3113 ftrace_trampoline_free(ops);
3114 }
3115
3116 return 0;
3117}
3118
3119static u64 ftrace_update_time;
3120unsigned long ftrace_update_tot_cnt;
3121unsigned long ftrace_number_of_pages;
3122unsigned long ftrace_number_of_groups;
3123
3124static inline int ops_traces_mod(struct ftrace_ops *ops)
3125{
3126 /*
3127 * Filter_hash being empty will default to trace module.
3128 * But notrace hash requires a test of individual module functions.
3129 */
3130 return ftrace_hash_empty(ops->func_hash->filter_hash) &&
3131 ftrace_hash_empty(ops->func_hash->notrace_hash);
3132}
3133
3134static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
3135{
3136 bool init_nop = ftrace_need_init_nop();
3137 struct ftrace_page *pg;
3138 struct dyn_ftrace *p;
3139 u64 start, stop;
3140 unsigned long update_cnt = 0;
3141 unsigned long rec_flags = 0;
3142 int i;
3143
3144 start = ftrace_now(raw_smp_processor_id());
3145
3146 /*
3147 * When a module is loaded, this function is called to convert
3148 * the calls to mcount in its text to nops, and also to create
3149 * an entry in the ftrace data. Now, if ftrace is activated
3150 * after this call, but before the module sets its text to
3151 * read-only, the modification of enabling ftrace can fail if
3152 * the read-only is done while ftrace is converting the calls.
3153 * To prevent this, the module's records are set as disabled
3154 * and will be enabled after the call to set the module's text
3155 * to read-only.
3156 */
3157 if (mod)
3158 rec_flags |= FTRACE_FL_DISABLED;
3159
3160 for (pg = new_pgs; pg; pg = pg->next) {
3161
3162 for (i = 0; i < pg->index; i++) {
3163
3164 /* If something went wrong, bail without enabling anything */
3165 if (unlikely(ftrace_disabled))
3166 return -1;
3167
3168 p = &pg->records[i];
3169 p->flags = rec_flags;
3170
3171 /*
3172 * Do the initial record conversion from mcount jump
3173 * to the NOP instructions.
3174 */
3175 if (init_nop && !ftrace_nop_initialize(mod, p))
3176 break;
3177
3178 update_cnt++;
3179 }
3180 }
3181
3182 stop = ftrace_now(raw_smp_processor_id());
3183 ftrace_update_time = stop - start;
3184 ftrace_update_tot_cnt += update_cnt;
3185
3186 return 0;
3187}
3188
3189static int ftrace_allocate_records(struct ftrace_page *pg, int count)
3190{
3191 int order;
3192 int pages;
3193 int cnt;
3194
3195 if (WARN_ON(!count))
3196 return -EINVAL;
3197
3198 /* We want to fill as much as possible, with no empty pages */
3199 pages = DIV_ROUND_UP(count, ENTRIES_PER_PAGE);
3200 order = fls(pages) - 1;
3201
3202 again:
3203 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
3204
3205 if (!pg->records) {
3206 /* if we can't allocate this size, try something smaller */
3207 if (!order)
3208 return -ENOMEM;
3209 order--;
3210 goto again;
3211 }
3212
3213 ftrace_number_of_pages += 1 << order;
3214 ftrace_number_of_groups++;
3215
3216 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
3217 pg->order = order;
3218
3219 if (cnt > count)
3220 cnt = count;
3221
3222 return cnt;
3223}
3224
3225static struct ftrace_page *
3226ftrace_allocate_pages(unsigned long num_to_init)
3227{
3228 struct ftrace_page *start_pg;
3229 struct ftrace_page *pg;
3230 int cnt;
3231
3232 if (!num_to_init)
3233 return NULL;
3234
3235 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
3236 if (!pg)
3237 return NULL;
3238
3239 /*
3240 * Try to allocate as much as possible in one continues
3241 * location that fills in all of the space. We want to
3242 * waste as little space as possible.
3243 */
3244 for (;;) {
3245 cnt = ftrace_allocate_records(pg, num_to_init);
3246 if (cnt < 0)
3247 goto free_pages;
3248
3249 num_to_init -= cnt;
3250 if (!num_to_init)
3251 break;
3252
3253 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
3254 if (!pg->next)
3255 goto free_pages;
3256
3257 pg = pg->next;
3258 }
3259
3260 return start_pg;
3261
3262 free_pages:
3263 pg = start_pg;
3264 while (pg) {
3265 if (pg->records) {
3266 free_pages((unsigned long)pg->records, pg->order);
3267 ftrace_number_of_pages -= 1 << pg->order;
3268 }
3269 start_pg = pg->next;
3270 kfree(pg);
3271 pg = start_pg;
3272 ftrace_number_of_groups--;
3273 }
3274 pr_info("ftrace: FAILED to allocate memory for functions\n");
3275 return NULL;
3276}
3277
3278#define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
3279
3280struct ftrace_iterator {
3281 loff_t pos;
3282 loff_t func_pos;
3283 loff_t mod_pos;
3284 struct ftrace_page *pg;
3285 struct dyn_ftrace *func;
3286 struct ftrace_func_probe *probe;
3287 struct ftrace_func_entry *probe_entry;
3288 struct trace_parser parser;
3289 struct ftrace_hash *hash;
3290 struct ftrace_ops *ops;
3291 struct trace_array *tr;
3292 struct list_head *mod_list;
3293 int pidx;
3294 int idx;
3295 unsigned flags;
3296};
3297
3298static void *
3299t_probe_next(struct seq_file *m, loff_t *pos)
3300{
3301 struct ftrace_iterator *iter = m->private;
3302 struct trace_array *tr = iter->ops->private;
3303 struct list_head *func_probes;
3304 struct ftrace_hash *hash;
3305 struct list_head *next;
3306 struct hlist_node *hnd = NULL;
3307 struct hlist_head *hhd;
3308 int size;
3309
3310 (*pos)++;
3311 iter->pos = *pos;
3312
3313 if (!tr)
3314 return NULL;
3315
3316 func_probes = &tr->func_probes;
3317 if (list_empty(func_probes))
3318 return NULL;
3319
3320 if (!iter->probe) {
3321 next = func_probes->next;
3322 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3323 }
3324
3325 if (iter->probe_entry)
3326 hnd = &iter->probe_entry->hlist;
3327
3328 hash = iter->probe->ops.func_hash->filter_hash;
3329
3330 /*
3331 * A probe being registered may temporarily have an empty hash
3332 * and it's at the end of the func_probes list.
3333 */
3334 if (!hash || hash == EMPTY_HASH)
3335 return NULL;
3336
3337 size = 1 << hash->size_bits;
3338
3339 retry:
3340 if (iter->pidx >= size) {
3341 if (iter->probe->list.next == func_probes)
3342 return NULL;
3343 next = iter->probe->list.next;
3344 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3345 hash = iter->probe->ops.func_hash->filter_hash;
3346 size = 1 << hash->size_bits;
3347 iter->pidx = 0;
3348 }
3349
3350 hhd = &hash->buckets[iter->pidx];
3351
3352 if (hlist_empty(hhd)) {
3353 iter->pidx++;
3354 hnd = NULL;
3355 goto retry;
3356 }
3357
3358 if (!hnd)
3359 hnd = hhd->first;
3360 else {
3361 hnd = hnd->next;
3362 if (!hnd) {
3363 iter->pidx++;
3364 goto retry;
3365 }
3366 }
3367
3368 if (WARN_ON_ONCE(!hnd))
3369 return NULL;
3370
3371 iter->probe_entry = hlist_entry(hnd, struct ftrace_func_entry, hlist);
3372
3373 return iter;
3374}
3375
3376static void *t_probe_start(struct seq_file *m, loff_t *pos)
3377{
3378 struct ftrace_iterator *iter = m->private;
3379 void *p = NULL;
3380 loff_t l;
3381
3382 if (!(iter->flags & FTRACE_ITER_DO_PROBES))
3383 return NULL;
3384
3385 if (iter->mod_pos > *pos)
3386 return NULL;
3387
3388 iter->probe = NULL;
3389 iter->probe_entry = NULL;
3390 iter->pidx = 0;
3391 for (l = 0; l <= (*pos - iter->mod_pos); ) {
3392 p = t_probe_next(m, &l);
3393 if (!p)
3394 break;
3395 }
3396 if (!p)
3397 return NULL;
3398
3399 /* Only set this if we have an item */
3400 iter->flags |= FTRACE_ITER_PROBE;
3401
3402 return iter;
3403}
3404
3405static int
3406t_probe_show(struct seq_file *m, struct ftrace_iterator *iter)
3407{
3408 struct ftrace_func_entry *probe_entry;
3409 struct ftrace_probe_ops *probe_ops;
3410 struct ftrace_func_probe *probe;
3411
3412 probe = iter->probe;
3413 probe_entry = iter->probe_entry;
3414
3415 if (WARN_ON_ONCE(!probe || !probe_entry))
3416 return -EIO;
3417
3418 probe_ops = probe->probe_ops;
3419
3420 if (probe_ops->print)
3421 return probe_ops->print(m, probe_entry->ip, probe_ops, probe->data);
3422
3423 seq_printf(m, "%ps:%ps\n", (void *)probe_entry->ip,
3424 (void *)probe_ops->func);
3425
3426 return 0;
3427}
3428
3429static void *
3430t_mod_next(struct seq_file *m, loff_t *pos)
3431{
3432 struct ftrace_iterator *iter = m->private;
3433 struct trace_array *tr = iter->tr;
3434
3435 (*pos)++;
3436 iter->pos = *pos;
3437
3438 iter->mod_list = iter->mod_list->next;
3439
3440 if (iter->mod_list == &tr->mod_trace ||
3441 iter->mod_list == &tr->mod_notrace) {
3442 iter->flags &= ~FTRACE_ITER_MOD;
3443 return NULL;
3444 }
3445
3446 iter->mod_pos = *pos;
3447
3448 return iter;
3449}
3450
3451static void *t_mod_start(struct seq_file *m, loff_t *pos)
3452{
3453 struct ftrace_iterator *iter = m->private;
3454 void *p = NULL;
3455 loff_t l;
3456
3457 if (iter->func_pos > *pos)
3458 return NULL;
3459
3460 iter->mod_pos = iter->func_pos;
3461
3462 /* probes are only available if tr is set */
3463 if (!iter->tr)
3464 return NULL;
3465
3466 for (l = 0; l <= (*pos - iter->func_pos); ) {
3467 p = t_mod_next(m, &l);
3468 if (!p)
3469 break;
3470 }
3471 if (!p) {
3472 iter->flags &= ~FTRACE_ITER_MOD;
3473 return t_probe_start(m, pos);
3474 }
3475
3476 /* Only set this if we have an item */
3477 iter->flags |= FTRACE_ITER_MOD;
3478
3479 return iter;
3480}
3481
3482static int
3483t_mod_show(struct seq_file *m, struct ftrace_iterator *iter)
3484{
3485 struct ftrace_mod_load *ftrace_mod;
3486 struct trace_array *tr = iter->tr;
3487
3488 if (WARN_ON_ONCE(!iter->mod_list) ||
3489 iter->mod_list == &tr->mod_trace ||
3490 iter->mod_list == &tr->mod_notrace)
3491 return -EIO;
3492
3493 ftrace_mod = list_entry(iter->mod_list, struct ftrace_mod_load, list);
3494
3495 if (ftrace_mod->func)
3496 seq_printf(m, "%s", ftrace_mod->func);
3497 else
3498 seq_putc(m, '*');
3499
3500 seq_printf(m, ":mod:%s\n", ftrace_mod->module);
3501
3502 return 0;
3503}
3504
3505static void *
3506t_func_next(struct seq_file *m, loff_t *pos)
3507{
3508 struct ftrace_iterator *iter = m->private;
3509 struct dyn_ftrace *rec = NULL;
3510
3511 (*pos)++;
3512
3513 retry:
3514 if (iter->idx >= iter->pg->index) {
3515 if (iter->pg->next) {
3516 iter->pg = iter->pg->next;
3517 iter->idx = 0;
3518 goto retry;
3519 }
3520 } else {
3521 rec = &iter->pg->records[iter->idx++];
3522 if (((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3523 !ftrace_lookup_ip(iter->hash, rec->ip)) ||
3524
3525 ((iter->flags & FTRACE_ITER_ENABLED) &&
3526 !(rec->flags & FTRACE_FL_ENABLED))) {
3527
3528 rec = NULL;
3529 goto retry;
3530 }
3531 }
3532
3533 if (!rec)
3534 return NULL;
3535
3536 iter->pos = iter->func_pos = *pos;
3537 iter->func = rec;
3538
3539 return iter;
3540}
3541
3542static void *
3543t_next(struct seq_file *m, void *v, loff_t *pos)
3544{
3545 struct ftrace_iterator *iter = m->private;
3546 loff_t l = *pos; /* t_probe_start() must use original pos */
3547 void *ret;
3548
3549 if (unlikely(ftrace_disabled))
3550 return NULL;
3551
3552 if (iter->flags & FTRACE_ITER_PROBE)
3553 return t_probe_next(m, pos);
3554
3555 if (iter->flags & FTRACE_ITER_MOD)
3556 return t_mod_next(m, pos);
3557
3558 if (iter->flags & FTRACE_ITER_PRINTALL) {
3559 /* next must increment pos, and t_probe_start does not */
3560 (*pos)++;
3561 return t_mod_start(m, &l);
3562 }
3563
3564 ret = t_func_next(m, pos);
3565
3566 if (!ret)
3567 return t_mod_start(m, &l);
3568
3569 return ret;
3570}
3571
3572static void reset_iter_read(struct ftrace_iterator *iter)
3573{
3574 iter->pos = 0;
3575 iter->func_pos = 0;
3576 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_PROBE | FTRACE_ITER_MOD);
3577}
3578
3579static void *t_start(struct seq_file *m, loff_t *pos)
3580{
3581 struct ftrace_iterator *iter = m->private;
3582 void *p = NULL;
3583 loff_t l;
3584
3585 mutex_lock(&ftrace_lock);
3586
3587 if (unlikely(ftrace_disabled))
3588 return NULL;
3589
3590 /*
3591 * If an lseek was done, then reset and start from beginning.
3592 */
3593 if (*pos < iter->pos)
3594 reset_iter_read(iter);
3595
3596 /*
3597 * For set_ftrace_filter reading, if we have the filter
3598 * off, we can short cut and just print out that all
3599 * functions are enabled.
3600 */
3601 if ((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3602 ftrace_hash_empty(iter->hash)) {
3603 iter->func_pos = 1; /* Account for the message */
3604 if (*pos > 0)
3605 return t_mod_start(m, pos);
3606 iter->flags |= FTRACE_ITER_PRINTALL;
3607 /* reset in case of seek/pread */
3608 iter->flags &= ~FTRACE_ITER_PROBE;
3609 return iter;
3610 }
3611
3612 if (iter->flags & FTRACE_ITER_MOD)
3613 return t_mod_start(m, pos);
3614
3615 /*
3616 * Unfortunately, we need to restart at ftrace_pages_start
3617 * every time we let go of the ftrace_mutex. This is because
3618 * those pointers can change without the lock.
3619 */
3620 iter->pg = ftrace_pages_start;
3621 iter->idx = 0;
3622 for (l = 0; l <= *pos; ) {
3623 p = t_func_next(m, &l);
3624 if (!p)
3625 break;
3626 }
3627
3628 if (!p)
3629 return t_mod_start(m, pos);
3630
3631 return iter;
3632}
3633
3634static void t_stop(struct seq_file *m, void *p)
3635{
3636 mutex_unlock(&ftrace_lock);
3637}
3638
3639void * __weak
3640arch_ftrace_trampoline_func(struct ftrace_ops *ops, struct dyn_ftrace *rec)
3641{
3642 return NULL;
3643}
3644
3645static void add_trampoline_func(struct seq_file *m, struct ftrace_ops *ops,
3646 struct dyn_ftrace *rec)
3647{
3648 void *ptr;
3649
3650 ptr = arch_ftrace_trampoline_func(ops, rec);
3651 if (ptr)
3652 seq_printf(m, " ->%pS", ptr);
3653}
3654
3655#ifdef FTRACE_MCOUNT_MAX_OFFSET
3656/*
3657 * Weak functions can still have an mcount/fentry that is saved in
3658 * the __mcount_loc section. These can be detected by having a
3659 * symbol offset of greater than FTRACE_MCOUNT_MAX_OFFSET, as the
3660 * symbol found by kallsyms is not the function that the mcount/fentry
3661 * is part of. The offset is much greater in these cases.
3662 *
3663 * Test the record to make sure that the ip points to a valid kallsyms
3664 * and if not, mark it disabled.
3665 */
3666static int test_for_valid_rec(struct dyn_ftrace *rec)
3667{
3668 char str[KSYM_SYMBOL_LEN];
3669 unsigned long offset;
3670 const char *ret;
3671
3672 ret = kallsyms_lookup(rec->ip, NULL, &offset, NULL, str);
3673
3674 /* Weak functions can cause invalid addresses */
3675 if (!ret || offset > FTRACE_MCOUNT_MAX_OFFSET) {
3676 rec->flags |= FTRACE_FL_DISABLED;
3677 return 0;
3678 }
3679 return 1;
3680}
3681
3682static struct workqueue_struct *ftrace_check_wq __initdata;
3683static struct work_struct ftrace_check_work __initdata;
3684
3685/*
3686 * Scan all the mcount/fentry entries to make sure they are valid.
3687 */
3688static __init void ftrace_check_work_func(struct work_struct *work)
3689{
3690 struct ftrace_page *pg;
3691 struct dyn_ftrace *rec;
3692
3693 mutex_lock(&ftrace_lock);
3694 do_for_each_ftrace_rec(pg, rec) {
3695 test_for_valid_rec(rec);
3696 } while_for_each_ftrace_rec();
3697 mutex_unlock(&ftrace_lock);
3698}
3699
3700static int __init ftrace_check_for_weak_functions(void)
3701{
3702 INIT_WORK(&ftrace_check_work, ftrace_check_work_func);
3703
3704 ftrace_check_wq = alloc_workqueue("ftrace_check_wq", WQ_UNBOUND, 0);
3705
3706 queue_work(ftrace_check_wq, &ftrace_check_work);
3707 return 0;
3708}
3709
3710static int __init ftrace_check_sync(void)
3711{
3712 /* Make sure the ftrace_check updates are finished */
3713 if (ftrace_check_wq)
3714 destroy_workqueue(ftrace_check_wq);
3715 return 0;
3716}
3717
3718late_initcall_sync(ftrace_check_sync);
3719subsys_initcall(ftrace_check_for_weak_functions);
3720
3721static int print_rec(struct seq_file *m, unsigned long ip)
3722{
3723 unsigned long offset;
3724 char str[KSYM_SYMBOL_LEN];
3725 char *modname;
3726 const char *ret;
3727
3728 ret = kallsyms_lookup(ip, NULL, &offset, &modname, str);
3729 /* Weak functions can cause invalid addresses */
3730 if (!ret || offset > FTRACE_MCOUNT_MAX_OFFSET) {
3731 snprintf(str, KSYM_SYMBOL_LEN, "%s_%ld",
3732 FTRACE_INVALID_FUNCTION, offset);
3733 ret = NULL;
3734 }
3735
3736 seq_puts(m, str);
3737 if (modname)
3738 seq_printf(m, " [%s]", modname);
3739 return ret == NULL ? -1 : 0;
3740}
3741#else
3742static inline int test_for_valid_rec(struct dyn_ftrace *rec)
3743{
3744 return 1;
3745}
3746
3747static inline int print_rec(struct seq_file *m, unsigned long ip)
3748{
3749 seq_printf(m, "%ps", (void *)ip);
3750 return 0;
3751}
3752#endif
3753
3754static int t_show(struct seq_file *m, void *v)
3755{
3756 struct ftrace_iterator *iter = m->private;
3757 struct dyn_ftrace *rec;
3758
3759 if (iter->flags & FTRACE_ITER_PROBE)
3760 return t_probe_show(m, iter);
3761
3762 if (iter->flags & FTRACE_ITER_MOD)
3763 return t_mod_show(m, iter);
3764
3765 if (iter->flags & FTRACE_ITER_PRINTALL) {
3766 if (iter->flags & FTRACE_ITER_NOTRACE)
3767 seq_puts(m, "#### no functions disabled ####\n");
3768 else
3769 seq_puts(m, "#### all functions enabled ####\n");
3770 return 0;
3771 }
3772
3773 rec = iter->func;
3774
3775 if (!rec)
3776 return 0;
3777
3778 if (print_rec(m, rec->ip)) {
3779 /* This should only happen when a rec is disabled */
3780 WARN_ON_ONCE(!(rec->flags & FTRACE_FL_DISABLED));
3781 seq_putc(m, '\n');
3782 return 0;
3783 }
3784
3785 if (iter->flags & FTRACE_ITER_ENABLED) {
3786 struct ftrace_ops *ops;
3787
3788 seq_printf(m, " (%ld)%s%s%s",
3789 ftrace_rec_count(rec),
3790 rec->flags & FTRACE_FL_REGS ? " R" : " ",
3791 rec->flags & FTRACE_FL_IPMODIFY ? " I" : " ",
3792 rec->flags & FTRACE_FL_DIRECT ? " D" : " ");
3793 if (rec->flags & FTRACE_FL_TRAMP_EN) {
3794 ops = ftrace_find_tramp_ops_any(rec);
3795 if (ops) {
3796 do {
3797 seq_printf(m, "\ttramp: %pS (%pS)",
3798 (void *)ops->trampoline,
3799 (void *)ops->func);
3800 add_trampoline_func(m, ops, rec);
3801 ops = ftrace_find_tramp_ops_next(rec, ops);
3802 } while (ops);
3803 } else
3804 seq_puts(m, "\ttramp: ERROR!");
3805 } else {
3806 add_trampoline_func(m, NULL, rec);
3807 }
3808 if (rec->flags & FTRACE_FL_DIRECT) {
3809 unsigned long direct;
3810
3811 direct = ftrace_find_rec_direct(rec->ip);
3812 if (direct)
3813 seq_printf(m, "\n\tdirect-->%pS", (void *)direct);
3814 }
3815 }
3816
3817 seq_putc(m, '\n');
3818
3819 return 0;
3820}
3821
3822static const struct seq_operations show_ftrace_seq_ops = {
3823 .start = t_start,
3824 .next = t_next,
3825 .stop = t_stop,
3826 .show = t_show,
3827};
3828
3829static int
3830ftrace_avail_open(struct inode *inode, struct file *file)
3831{
3832 struct ftrace_iterator *iter;
3833 int ret;
3834
3835 ret = security_locked_down(LOCKDOWN_TRACEFS);
3836 if (ret)
3837 return ret;
3838
3839 if (unlikely(ftrace_disabled))
3840 return -ENODEV;
3841
3842 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3843 if (!iter)
3844 return -ENOMEM;
3845
3846 iter->pg = ftrace_pages_start;
3847 iter->ops = &global_ops;
3848
3849 return 0;
3850}
3851
3852static int
3853ftrace_enabled_open(struct inode *inode, struct file *file)
3854{
3855 struct ftrace_iterator *iter;
3856
3857 /*
3858 * This shows us what functions are currently being
3859 * traced and by what. Not sure if we want lockdown
3860 * to hide such critical information for an admin.
3861 * Although, perhaps it can show information we don't
3862 * want people to see, but if something is tracing
3863 * something, we probably want to know about it.
3864 */
3865
3866 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3867 if (!iter)
3868 return -ENOMEM;
3869
3870 iter->pg = ftrace_pages_start;
3871 iter->flags = FTRACE_ITER_ENABLED;
3872 iter->ops = &global_ops;
3873
3874 return 0;
3875}
3876
3877/**
3878 * ftrace_regex_open - initialize function tracer filter files
3879 * @ops: The ftrace_ops that hold the hash filters
3880 * @flag: The type of filter to process
3881 * @inode: The inode, usually passed in to your open routine
3882 * @file: The file, usually passed in to your open routine
3883 *
3884 * ftrace_regex_open() initializes the filter files for the
3885 * @ops. Depending on @flag it may process the filter hash or
3886 * the notrace hash of @ops. With this called from the open
3887 * routine, you can use ftrace_filter_write() for the write
3888 * routine if @flag has FTRACE_ITER_FILTER set, or
3889 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
3890 * tracing_lseek() should be used as the lseek routine, and
3891 * release must call ftrace_regex_release().
3892 */
3893int
3894ftrace_regex_open(struct ftrace_ops *ops, int flag,
3895 struct inode *inode, struct file *file)
3896{
3897 struct ftrace_iterator *iter;
3898 struct ftrace_hash *hash;
3899 struct list_head *mod_head;
3900 struct trace_array *tr = ops->private;
3901 int ret = -ENOMEM;
3902
3903 ftrace_ops_init(ops);
3904
3905 if (unlikely(ftrace_disabled))
3906 return -ENODEV;
3907
3908 if (tracing_check_open_get_tr(tr))
3909 return -ENODEV;
3910
3911 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
3912 if (!iter)
3913 goto out;
3914
3915 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX))
3916 goto out;
3917
3918 iter->ops = ops;
3919 iter->flags = flag;
3920 iter->tr = tr;
3921
3922 mutex_lock(&ops->func_hash->regex_lock);
3923
3924 if (flag & FTRACE_ITER_NOTRACE) {
3925 hash = ops->func_hash->notrace_hash;
3926 mod_head = tr ? &tr->mod_notrace : NULL;
3927 } else {
3928 hash = ops->func_hash->filter_hash;
3929 mod_head = tr ? &tr->mod_trace : NULL;
3930 }
3931
3932 iter->mod_list = mod_head;
3933
3934 if (file->f_mode & FMODE_WRITE) {
3935 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3936
3937 if (file->f_flags & O_TRUNC) {
3938 iter->hash = alloc_ftrace_hash(size_bits);
3939 clear_ftrace_mod_list(mod_head);
3940 } else {
3941 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3942 }
3943
3944 if (!iter->hash) {
3945 trace_parser_put(&iter->parser);
3946 goto out_unlock;
3947 }
3948 } else
3949 iter->hash = hash;
3950
3951 ret = 0;
3952
3953 if (file->f_mode & FMODE_READ) {
3954 iter->pg = ftrace_pages_start;
3955
3956 ret = seq_open(file, &show_ftrace_seq_ops);
3957 if (!ret) {
3958 struct seq_file *m = file->private_data;
3959 m->private = iter;
3960 } else {
3961 /* Failed */
3962 free_ftrace_hash(iter->hash);
3963 trace_parser_put(&iter->parser);
3964 }
3965 } else
3966 file->private_data = iter;
3967
3968 out_unlock:
3969 mutex_unlock(&ops->func_hash->regex_lock);
3970
3971 out:
3972 if (ret) {
3973 kfree(iter);
3974 if (tr)
3975 trace_array_put(tr);
3976 }
3977
3978 return ret;
3979}
3980
3981static int
3982ftrace_filter_open(struct inode *inode, struct file *file)
3983{
3984 struct ftrace_ops *ops = inode->i_private;
3985
3986 /* Checks for tracefs lockdown */
3987 return ftrace_regex_open(ops,
3988 FTRACE_ITER_FILTER | FTRACE_ITER_DO_PROBES,
3989 inode, file);
3990}
3991
3992static int
3993ftrace_notrace_open(struct inode *inode, struct file *file)
3994{
3995 struct ftrace_ops *ops = inode->i_private;
3996
3997 /* Checks for tracefs lockdown */
3998 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3999 inode, file);
4000}
4001
4002/* Type for quick search ftrace basic regexes (globs) from filter_parse_regex */
4003struct ftrace_glob {
4004 char *search;
4005 unsigned len;
4006 int type;
4007};
4008
4009/*
4010 * If symbols in an architecture don't correspond exactly to the user-visible
4011 * name of what they represent, it is possible to define this function to
4012 * perform the necessary adjustments.
4013*/
4014char * __weak arch_ftrace_match_adjust(char *str, const char *search)
4015{
4016 return str;
4017}
4018
4019static int ftrace_match(char *str, struct ftrace_glob *g)
4020{
4021 int matched = 0;
4022 int slen;
4023
4024 str = arch_ftrace_match_adjust(str, g->search);
4025
4026 switch (g->type) {
4027 case MATCH_FULL:
4028 if (strcmp(str, g->search) == 0)
4029 matched = 1;
4030 break;
4031 case MATCH_FRONT_ONLY:
4032 if (strncmp(str, g->search, g->len) == 0)
4033 matched = 1;
4034 break;
4035 case MATCH_MIDDLE_ONLY:
4036 if (strstr(str, g->search))
4037 matched = 1;
4038 break;
4039 case MATCH_END_ONLY:
4040 slen = strlen(str);
4041 if (slen >= g->len &&
4042 memcmp(str + slen - g->len, g->search, g->len) == 0)
4043 matched = 1;
4044 break;
4045 case MATCH_GLOB:
4046 if (glob_match(g->search, str))
4047 matched = 1;
4048 break;
4049 }
4050
4051 return matched;
4052}
4053
4054static int
4055enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter)
4056{
4057 struct ftrace_func_entry *entry;
4058 int ret = 0;
4059
4060 entry = ftrace_lookup_ip(hash, rec->ip);
4061 if (clear_filter) {
4062 /* Do nothing if it doesn't exist */
4063 if (!entry)
4064 return 0;
4065
4066 free_hash_entry(hash, entry);
4067 } else {
4068 /* Do nothing if it exists */
4069 if (entry)
4070 return 0;
4071
4072 ret = add_hash_entry(hash, rec->ip);
4073 }
4074 return ret;
4075}
4076
4077static int
4078add_rec_by_index(struct ftrace_hash *hash, struct ftrace_glob *func_g,
4079 int clear_filter)
4080{
4081 long index = simple_strtoul(func_g->search, NULL, 0);
4082 struct ftrace_page *pg;
4083 struct dyn_ftrace *rec;
4084
4085 /* The index starts at 1 */
4086 if (--index < 0)
4087 return 0;
4088
4089 do_for_each_ftrace_rec(pg, rec) {
4090 if (pg->index <= index) {
4091 index -= pg->index;
4092 /* this is a double loop, break goes to the next page */
4093 break;
4094 }
4095 rec = &pg->records[index];
4096 enter_record(hash, rec, clear_filter);
4097 return 1;
4098 } while_for_each_ftrace_rec();
4099 return 0;
4100}
4101
4102#ifdef FTRACE_MCOUNT_MAX_OFFSET
4103static int lookup_ip(unsigned long ip, char **modname, char *str)
4104{
4105 unsigned long offset;
4106
4107 kallsyms_lookup(ip, NULL, &offset, modname, str);
4108 if (offset > FTRACE_MCOUNT_MAX_OFFSET)
4109 return -1;
4110 return 0;
4111}
4112#else
4113static int lookup_ip(unsigned long ip, char **modname, char *str)
4114{
4115 kallsyms_lookup(ip, NULL, NULL, modname, str);
4116 return 0;
4117}
4118#endif
4119
4120static int
4121ftrace_match_record(struct dyn_ftrace *rec, struct ftrace_glob *func_g,
4122 struct ftrace_glob *mod_g, int exclude_mod)
4123{
4124 char str[KSYM_SYMBOL_LEN];
4125 char *modname;
4126
4127 if (lookup_ip(rec->ip, &modname, str)) {
4128 /* This should only happen when a rec is disabled */
4129 WARN_ON_ONCE(system_state == SYSTEM_RUNNING &&
4130 !(rec->flags & FTRACE_FL_DISABLED));
4131 return 0;
4132 }
4133
4134 if (mod_g) {
4135 int mod_matches = (modname) ? ftrace_match(modname, mod_g) : 0;
4136
4137 /* blank module name to match all modules */
4138 if (!mod_g->len) {
4139 /* blank module globbing: modname xor exclude_mod */
4140 if (!exclude_mod != !modname)
4141 goto func_match;
4142 return 0;
4143 }
4144
4145 /*
4146 * exclude_mod is set to trace everything but the given
4147 * module. If it is set and the module matches, then
4148 * return 0. If it is not set, and the module doesn't match
4149 * also return 0. Otherwise, check the function to see if
4150 * that matches.
4151 */
4152 if (!mod_matches == !exclude_mod)
4153 return 0;
4154func_match:
4155 /* blank search means to match all funcs in the mod */
4156 if (!func_g->len)
4157 return 1;
4158 }
4159
4160 return ftrace_match(str, func_g);
4161}
4162
4163static int
4164match_records(struct ftrace_hash *hash, char *func, int len, char *mod)
4165{
4166 struct ftrace_page *pg;
4167 struct dyn_ftrace *rec;
4168 struct ftrace_glob func_g = { .type = MATCH_FULL };
4169 struct ftrace_glob mod_g = { .type = MATCH_FULL };
4170 struct ftrace_glob *mod_match = (mod) ? &mod_g : NULL;
4171 int exclude_mod = 0;
4172 int found = 0;
4173 int ret;
4174 int clear_filter = 0;
4175
4176 if (func) {
4177 func_g.type = filter_parse_regex(func, len, &func_g.search,
4178 &clear_filter);
4179 func_g.len = strlen(func_g.search);
4180 }
4181
4182 if (mod) {
4183 mod_g.type = filter_parse_regex(mod, strlen(mod),
4184 &mod_g.search, &exclude_mod);
4185 mod_g.len = strlen(mod_g.search);
4186 }
4187
4188 mutex_lock(&ftrace_lock);
4189
4190 if (unlikely(ftrace_disabled))
4191 goto out_unlock;
4192
4193 if (func_g.type == MATCH_INDEX) {
4194 found = add_rec_by_index(hash, &func_g, clear_filter);
4195 goto out_unlock;
4196 }
4197
4198 do_for_each_ftrace_rec(pg, rec) {
4199
4200 if (rec->flags & FTRACE_FL_DISABLED)
4201 continue;
4202
4203 if (ftrace_match_record(rec, &func_g, mod_match, exclude_mod)) {
4204 ret = enter_record(hash, rec, clear_filter);
4205 if (ret < 0) {
4206 found = ret;
4207 goto out_unlock;
4208 }
4209 found = 1;
4210 }
4211 cond_resched();
4212 } while_for_each_ftrace_rec();
4213 out_unlock:
4214 mutex_unlock(&ftrace_lock);
4215
4216 return found;
4217}
4218
4219static int
4220ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
4221{
4222 return match_records(hash, buff, len, NULL);
4223}
4224
4225static void ftrace_ops_update_code(struct ftrace_ops *ops,
4226 struct ftrace_ops_hash *old_hash)
4227{
4228 struct ftrace_ops *op;
4229
4230 if (!ftrace_enabled)
4231 return;
4232
4233 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
4234 ftrace_run_modify_code(ops, FTRACE_UPDATE_CALLS, old_hash);
4235 return;
4236 }
4237
4238 /*
4239 * If this is the shared global_ops filter, then we need to
4240 * check if there is another ops that shares it, is enabled.
4241 * If so, we still need to run the modify code.
4242 */
4243 if (ops->func_hash != &global_ops.local_hash)
4244 return;
4245
4246 do_for_each_ftrace_op(op, ftrace_ops_list) {
4247 if (op->func_hash == &global_ops.local_hash &&
4248 op->flags & FTRACE_OPS_FL_ENABLED) {
4249 ftrace_run_modify_code(op, FTRACE_UPDATE_CALLS, old_hash);
4250 /* Only need to do this once */
4251 return;
4252 }
4253 } while_for_each_ftrace_op(op);
4254}
4255
4256static int ftrace_hash_move_and_update_ops(struct ftrace_ops *ops,
4257 struct ftrace_hash **orig_hash,
4258 struct ftrace_hash *hash,
4259 int enable)
4260{
4261 struct ftrace_ops_hash old_hash_ops;
4262 struct ftrace_hash *old_hash;
4263 int ret;
4264
4265 old_hash = *orig_hash;
4266 old_hash_ops.filter_hash = ops->func_hash->filter_hash;
4267 old_hash_ops.notrace_hash = ops->func_hash->notrace_hash;
4268 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
4269 if (!ret) {
4270 ftrace_ops_update_code(ops, &old_hash_ops);
4271 free_ftrace_hash_rcu(old_hash);
4272 }
4273 return ret;
4274}
4275
4276static bool module_exists(const char *module)
4277{
4278 /* All modules have the symbol __this_module */
4279 static const char this_mod[] = "__this_module";
4280 char modname[MAX_PARAM_PREFIX_LEN + sizeof(this_mod) + 2];
4281 unsigned long val;
4282 int n;
4283
4284 n = snprintf(modname, sizeof(modname), "%s:%s", module, this_mod);
4285
4286 if (n > sizeof(modname) - 1)
4287 return false;
4288
4289 val = module_kallsyms_lookup_name(modname);
4290 return val != 0;
4291}
4292
4293static int cache_mod(struct trace_array *tr,
4294 const char *func, char *module, int enable)
4295{
4296 struct ftrace_mod_load *ftrace_mod, *n;
4297 struct list_head *head = enable ? &tr->mod_trace : &tr->mod_notrace;
4298 int ret;
4299
4300 mutex_lock(&ftrace_lock);
4301
4302 /* We do not cache inverse filters */
4303 if (func[0] == '!') {
4304 func++;
4305 ret = -EINVAL;
4306
4307 /* Look to remove this hash */
4308 list_for_each_entry_safe(ftrace_mod, n, head, list) {
4309 if (strcmp(ftrace_mod->module, module) != 0)
4310 continue;
4311
4312 /* no func matches all */
4313 if (strcmp(func, "*") == 0 ||
4314 (ftrace_mod->func &&
4315 strcmp(ftrace_mod->func, func) == 0)) {
4316 ret = 0;
4317 free_ftrace_mod(ftrace_mod);
4318 continue;
4319 }
4320 }
4321 goto out;
4322 }
4323
4324 ret = -EINVAL;
4325 /* We only care about modules that have not been loaded yet */
4326 if (module_exists(module))
4327 goto out;
4328
4329 /* Save this string off, and execute it when the module is loaded */
4330 ret = ftrace_add_mod(tr, func, module, enable);
4331 out:
4332 mutex_unlock(&ftrace_lock);
4333
4334 return ret;
4335}
4336
4337static int
4338ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
4339 int reset, int enable);
4340
4341#ifdef CONFIG_MODULES
4342static void process_mod_list(struct list_head *head, struct ftrace_ops *ops,
4343 char *mod, bool enable)
4344{
4345 struct ftrace_mod_load *ftrace_mod, *n;
4346 struct ftrace_hash **orig_hash, *new_hash;
4347 LIST_HEAD(process_mods);
4348 char *func;
4349
4350 mutex_lock(&ops->func_hash->regex_lock);
4351
4352 if (enable)
4353 orig_hash = &ops->func_hash->filter_hash;
4354 else
4355 orig_hash = &ops->func_hash->notrace_hash;
4356
4357 new_hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS,
4358 *orig_hash);
4359 if (!new_hash)
4360 goto out; /* warn? */
4361
4362 mutex_lock(&ftrace_lock);
4363
4364 list_for_each_entry_safe(ftrace_mod, n, head, list) {
4365
4366 if (strcmp(ftrace_mod->module, mod) != 0)
4367 continue;
4368
4369 if (ftrace_mod->func)
4370 func = kstrdup(ftrace_mod->func, GFP_KERNEL);
4371 else
4372 func = kstrdup("*", GFP_KERNEL);
4373
4374 if (!func) /* warn? */
4375 continue;
4376
4377 list_move(&ftrace_mod->list, &process_mods);
4378
4379 /* Use the newly allocated func, as it may be "*" */
4380 kfree(ftrace_mod->func);
4381 ftrace_mod->func = func;
4382 }
4383
4384 mutex_unlock(&ftrace_lock);
4385
4386 list_for_each_entry_safe(ftrace_mod, n, &process_mods, list) {
4387
4388 func = ftrace_mod->func;
4389
4390 /* Grabs ftrace_lock, which is why we have this extra step */
4391 match_records(new_hash, func, strlen(func), mod);
4392 free_ftrace_mod(ftrace_mod);
4393 }
4394
4395 if (enable && list_empty(head))
4396 new_hash->flags &= ~FTRACE_HASH_FL_MOD;
4397
4398 mutex_lock(&ftrace_lock);
4399
4400 ftrace_hash_move_and_update_ops(ops, orig_hash,
4401 new_hash, enable);
4402 mutex_unlock(&ftrace_lock);
4403
4404 out:
4405 mutex_unlock(&ops->func_hash->regex_lock);
4406
4407 free_ftrace_hash(new_hash);
4408}
4409
4410static void process_cached_mods(const char *mod_name)
4411{
4412 struct trace_array *tr;
4413 char *mod;
4414
4415 mod = kstrdup(mod_name, GFP_KERNEL);
4416 if (!mod)
4417 return;
4418
4419 mutex_lock(&trace_types_lock);
4420 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
4421 if (!list_empty(&tr->mod_trace))
4422 process_mod_list(&tr->mod_trace, tr->ops, mod, true);
4423 if (!list_empty(&tr->mod_notrace))
4424 process_mod_list(&tr->mod_notrace, tr->ops, mod, false);
4425 }
4426 mutex_unlock(&trace_types_lock);
4427
4428 kfree(mod);
4429}
4430#endif
4431
4432/*
4433 * We register the module command as a template to show others how
4434 * to register the a command as well.
4435 */
4436
4437static int
4438ftrace_mod_callback(struct trace_array *tr, struct ftrace_hash *hash,
4439 char *func_orig, char *cmd, char *module, int enable)
4440{
4441 char *func;
4442 int ret;
4443
4444 /* match_records() modifies func, and we need the original */
4445 func = kstrdup(func_orig, GFP_KERNEL);
4446 if (!func)
4447 return -ENOMEM;
4448
4449 /*
4450 * cmd == 'mod' because we only registered this func
4451 * for the 'mod' ftrace_func_command.
4452 * But if you register one func with multiple commands,
4453 * you can tell which command was used by the cmd
4454 * parameter.
4455 */
4456 ret = match_records(hash, func, strlen(func), module);
4457 kfree(func);
4458
4459 if (!ret)
4460 return cache_mod(tr, func_orig, module, enable);
4461 if (ret < 0)
4462 return ret;
4463 return 0;
4464}
4465
4466static struct ftrace_func_command ftrace_mod_cmd = {
4467 .name = "mod",
4468 .func = ftrace_mod_callback,
4469};
4470
4471static int __init ftrace_mod_cmd_init(void)
4472{
4473 return register_ftrace_command(&ftrace_mod_cmd);
4474}
4475core_initcall(ftrace_mod_cmd_init);
4476
4477static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
4478 struct ftrace_ops *op, struct ftrace_regs *fregs)
4479{
4480 struct ftrace_probe_ops *probe_ops;
4481 struct ftrace_func_probe *probe;
4482
4483 probe = container_of(op, struct ftrace_func_probe, ops);
4484 probe_ops = probe->probe_ops;
4485
4486 /*
4487 * Disable preemption for these calls to prevent a RCU grace
4488 * period. This syncs the hash iteration and freeing of items
4489 * on the hash. rcu_read_lock is too dangerous here.
4490 */
4491 preempt_disable_notrace();
4492 probe_ops->func(ip, parent_ip, probe->tr, probe_ops, probe->data);
4493 preempt_enable_notrace();
4494}
4495
4496struct ftrace_func_map {
4497 struct ftrace_func_entry entry;
4498 void *data;
4499};
4500
4501struct ftrace_func_mapper {
4502 struct ftrace_hash hash;
4503};
4504
4505/**
4506 * allocate_ftrace_func_mapper - allocate a new ftrace_func_mapper
4507 *
4508 * Returns a ftrace_func_mapper descriptor that can be used to map ips to data.
4509 */
4510struct ftrace_func_mapper *allocate_ftrace_func_mapper(void)
4511{
4512 struct ftrace_hash *hash;
4513
4514 /*
4515 * The mapper is simply a ftrace_hash, but since the entries
4516 * in the hash are not ftrace_func_entry type, we define it
4517 * as a separate structure.
4518 */
4519 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4520 return (struct ftrace_func_mapper *)hash;
4521}
4522
4523/**
4524 * ftrace_func_mapper_find_ip - Find some data mapped to an ip
4525 * @mapper: The mapper that has the ip maps
4526 * @ip: the instruction pointer to find the data for
4527 *
4528 * Returns the data mapped to @ip if found otherwise NULL. The return
4529 * is actually the address of the mapper data pointer. The address is
4530 * returned for use cases where the data is no bigger than a long, and
4531 * the user can use the data pointer as its data instead of having to
4532 * allocate more memory for the reference.
4533 */
4534void **ftrace_func_mapper_find_ip(struct ftrace_func_mapper *mapper,
4535 unsigned long ip)
4536{
4537 struct ftrace_func_entry *entry;
4538 struct ftrace_func_map *map;
4539
4540 entry = ftrace_lookup_ip(&mapper->hash, ip);
4541 if (!entry)
4542 return NULL;
4543
4544 map = (struct ftrace_func_map *)entry;
4545 return &map->data;
4546}
4547
4548/**
4549 * ftrace_func_mapper_add_ip - Map some data to an ip
4550 * @mapper: The mapper that has the ip maps
4551 * @ip: The instruction pointer address to map @data to
4552 * @data: The data to map to @ip
4553 *
4554 * Returns 0 on success otherwise an error.
4555 */
4556int ftrace_func_mapper_add_ip(struct ftrace_func_mapper *mapper,
4557 unsigned long ip, void *data)
4558{
4559 struct ftrace_func_entry *entry;
4560 struct ftrace_func_map *map;
4561
4562 entry = ftrace_lookup_ip(&mapper->hash, ip);
4563 if (entry)
4564 return -EBUSY;
4565
4566 map = kmalloc(sizeof(*map), GFP_KERNEL);
4567 if (!map)
4568 return -ENOMEM;
4569
4570 map->entry.ip = ip;
4571 map->data = data;
4572
4573 __add_hash_entry(&mapper->hash, &map->entry);
4574
4575 return 0;
4576}
4577
4578/**
4579 * ftrace_func_mapper_remove_ip - Remove an ip from the mapping
4580 * @mapper: The mapper that has the ip maps
4581 * @ip: The instruction pointer address to remove the data from
4582 *
4583 * Returns the data if it is found, otherwise NULL.
4584 * Note, if the data pointer is used as the data itself, (see
4585 * ftrace_func_mapper_find_ip(), then the return value may be meaningless,
4586 * if the data pointer was set to zero.
4587 */
4588void *ftrace_func_mapper_remove_ip(struct ftrace_func_mapper *mapper,
4589 unsigned long ip)
4590{
4591 struct ftrace_func_entry *entry;
4592 struct ftrace_func_map *map;
4593 void *data;
4594
4595 entry = ftrace_lookup_ip(&mapper->hash, ip);
4596 if (!entry)
4597 return NULL;
4598
4599 map = (struct ftrace_func_map *)entry;
4600 data = map->data;
4601
4602 remove_hash_entry(&mapper->hash, entry);
4603 kfree(entry);
4604
4605 return data;
4606}
4607
4608/**
4609 * free_ftrace_func_mapper - free a mapping of ips and data
4610 * @mapper: The mapper that has the ip maps
4611 * @free_func: A function to be called on each data item.
4612 *
4613 * This is used to free the function mapper. The @free_func is optional
4614 * and can be used if the data needs to be freed as well.
4615 */
4616void free_ftrace_func_mapper(struct ftrace_func_mapper *mapper,
4617 ftrace_mapper_func free_func)
4618{
4619 struct ftrace_func_entry *entry;
4620 struct ftrace_func_map *map;
4621 struct hlist_head *hhd;
4622 int size, i;
4623
4624 if (!mapper)
4625 return;
4626
4627 if (free_func && mapper->hash.count) {
4628 size = 1 << mapper->hash.size_bits;
4629 for (i = 0; i < size; i++) {
4630 hhd = &mapper->hash.buckets[i];
4631 hlist_for_each_entry(entry, hhd, hlist) {
4632 map = (struct ftrace_func_map *)entry;
4633 free_func(map);
4634 }
4635 }
4636 }
4637 free_ftrace_hash(&mapper->hash);
4638}
4639
4640static void release_probe(struct ftrace_func_probe *probe)
4641{
4642 struct ftrace_probe_ops *probe_ops;
4643
4644 mutex_lock(&ftrace_lock);
4645
4646 WARN_ON(probe->ref <= 0);
4647
4648 /* Subtract the ref that was used to protect this instance */
4649 probe->ref--;
4650
4651 if (!probe->ref) {
4652 probe_ops = probe->probe_ops;
4653 /*
4654 * Sending zero as ip tells probe_ops to free
4655 * the probe->data itself
4656 */
4657 if (probe_ops->free)
4658 probe_ops->free(probe_ops, probe->tr, 0, probe->data);
4659 list_del(&probe->list);
4660 kfree(probe);
4661 }
4662 mutex_unlock(&ftrace_lock);
4663}
4664
4665static void acquire_probe_locked(struct ftrace_func_probe *probe)
4666{
4667 /*
4668 * Add one ref to keep it from being freed when releasing the
4669 * ftrace_lock mutex.
4670 */
4671 probe->ref++;
4672}
4673
4674int
4675register_ftrace_function_probe(char *glob, struct trace_array *tr,
4676 struct ftrace_probe_ops *probe_ops,
4677 void *data)
4678{
4679 struct ftrace_func_probe *probe = NULL, *iter;
4680 struct ftrace_func_entry *entry;
4681 struct ftrace_hash **orig_hash;
4682 struct ftrace_hash *old_hash;
4683 struct ftrace_hash *hash;
4684 int count = 0;
4685 int size;
4686 int ret;
4687 int i;
4688
4689 if (WARN_ON(!tr))
4690 return -EINVAL;
4691
4692 /* We do not support '!' for function probes */
4693 if (WARN_ON(glob[0] == '!'))
4694 return -EINVAL;
4695
4696
4697 mutex_lock(&ftrace_lock);
4698 /* Check if the probe_ops is already registered */
4699 list_for_each_entry(iter, &tr->func_probes, list) {
4700 if (iter->probe_ops == probe_ops) {
4701 probe = iter;
4702 break;
4703 }
4704 }
4705 if (!probe) {
4706 probe = kzalloc(sizeof(*probe), GFP_KERNEL);
4707 if (!probe) {
4708 mutex_unlock(&ftrace_lock);
4709 return -ENOMEM;
4710 }
4711 probe->probe_ops = probe_ops;
4712 probe->ops.func = function_trace_probe_call;
4713 probe->tr = tr;
4714 ftrace_ops_init(&probe->ops);
4715 list_add(&probe->list, &tr->func_probes);
4716 }
4717
4718 acquire_probe_locked(probe);
4719
4720 mutex_unlock(&ftrace_lock);
4721
4722 /*
4723 * Note, there's a small window here that the func_hash->filter_hash
4724 * may be NULL or empty. Need to be careful when reading the loop.
4725 */
4726 mutex_lock(&probe->ops.func_hash->regex_lock);
4727
4728 orig_hash = &probe->ops.func_hash->filter_hash;
4729 old_hash = *orig_hash;
4730 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4731
4732 if (!hash) {
4733 ret = -ENOMEM;
4734 goto out;
4735 }
4736
4737 ret = ftrace_match_records(hash, glob, strlen(glob));
4738
4739 /* Nothing found? */
4740 if (!ret)
4741 ret = -EINVAL;
4742
4743 if (ret < 0)
4744 goto out;
4745
4746 size = 1 << hash->size_bits;
4747 for (i = 0; i < size; i++) {
4748 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4749 if (ftrace_lookup_ip(old_hash, entry->ip))
4750 continue;
4751 /*
4752 * The caller might want to do something special
4753 * for each function we find. We call the callback
4754 * to give the caller an opportunity to do so.
4755 */
4756 if (probe_ops->init) {
4757 ret = probe_ops->init(probe_ops, tr,
4758 entry->ip, data,
4759 &probe->data);
4760 if (ret < 0) {
4761 if (probe_ops->free && count)
4762 probe_ops->free(probe_ops, tr,
4763 0, probe->data);
4764 probe->data = NULL;
4765 goto out;
4766 }
4767 }
4768 count++;
4769 }
4770 }
4771
4772 mutex_lock(&ftrace_lock);
4773
4774 if (!count) {
4775 /* Nothing was added? */
4776 ret = -EINVAL;
4777 goto out_unlock;
4778 }
4779
4780 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4781 hash, 1);
4782 if (ret < 0)
4783 goto err_unlock;
4784
4785 /* One ref for each new function traced */
4786 probe->ref += count;
4787
4788 if (!(probe->ops.flags & FTRACE_OPS_FL_ENABLED))
4789 ret = ftrace_startup(&probe->ops, 0);
4790
4791 out_unlock:
4792 mutex_unlock(&ftrace_lock);
4793
4794 if (!ret)
4795 ret = count;
4796 out:
4797 mutex_unlock(&probe->ops.func_hash->regex_lock);
4798 free_ftrace_hash(hash);
4799
4800 release_probe(probe);
4801
4802 return ret;
4803
4804 err_unlock:
4805 if (!probe_ops->free || !count)
4806 goto out_unlock;
4807
4808 /* Failed to do the move, need to call the free functions */
4809 for (i = 0; i < size; i++) {
4810 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4811 if (ftrace_lookup_ip(old_hash, entry->ip))
4812 continue;
4813 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4814 }
4815 }
4816 goto out_unlock;
4817}
4818
4819int
4820unregister_ftrace_function_probe_func(char *glob, struct trace_array *tr,
4821 struct ftrace_probe_ops *probe_ops)
4822{
4823 struct ftrace_func_probe *probe = NULL, *iter;
4824 struct ftrace_ops_hash old_hash_ops;
4825 struct ftrace_func_entry *entry;
4826 struct ftrace_glob func_g;
4827 struct ftrace_hash **orig_hash;
4828 struct ftrace_hash *old_hash;
4829 struct ftrace_hash *hash = NULL;
4830 struct hlist_node *tmp;
4831 struct hlist_head hhd;
4832 char str[KSYM_SYMBOL_LEN];
4833 int count = 0;
4834 int i, ret = -ENODEV;
4835 int size;
4836
4837 if (!glob || !strlen(glob) || !strcmp(glob, "*"))
4838 func_g.search = NULL;
4839 else {
4840 int not;
4841
4842 func_g.type = filter_parse_regex(glob, strlen(glob),
4843 &func_g.search, ¬);
4844 func_g.len = strlen(func_g.search);
4845
4846 /* we do not support '!' for function probes */
4847 if (WARN_ON(not))
4848 return -EINVAL;
4849 }
4850
4851 mutex_lock(&ftrace_lock);
4852 /* Check if the probe_ops is already registered */
4853 list_for_each_entry(iter, &tr->func_probes, list) {
4854 if (iter->probe_ops == probe_ops) {
4855 probe = iter;
4856 break;
4857 }
4858 }
4859 if (!probe)
4860 goto err_unlock_ftrace;
4861
4862 ret = -EINVAL;
4863 if (!(probe->ops.flags & FTRACE_OPS_FL_INITIALIZED))
4864 goto err_unlock_ftrace;
4865
4866 acquire_probe_locked(probe);
4867
4868 mutex_unlock(&ftrace_lock);
4869
4870 mutex_lock(&probe->ops.func_hash->regex_lock);
4871
4872 orig_hash = &probe->ops.func_hash->filter_hash;
4873 old_hash = *orig_hash;
4874
4875 if (ftrace_hash_empty(old_hash))
4876 goto out_unlock;
4877
4878 old_hash_ops.filter_hash = old_hash;
4879 /* Probes only have filters */
4880 old_hash_ops.notrace_hash = NULL;
4881
4882 ret = -ENOMEM;
4883 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4884 if (!hash)
4885 goto out_unlock;
4886
4887 INIT_HLIST_HEAD(&hhd);
4888
4889 size = 1 << hash->size_bits;
4890 for (i = 0; i < size; i++) {
4891 hlist_for_each_entry_safe(entry, tmp, &hash->buckets[i], hlist) {
4892
4893 if (func_g.search) {
4894 kallsyms_lookup(entry->ip, NULL, NULL,
4895 NULL, str);
4896 if (!ftrace_match(str, &func_g))
4897 continue;
4898 }
4899 count++;
4900 remove_hash_entry(hash, entry);
4901 hlist_add_head(&entry->hlist, &hhd);
4902 }
4903 }
4904
4905 /* Nothing found? */
4906 if (!count) {
4907 ret = -EINVAL;
4908 goto out_unlock;
4909 }
4910
4911 mutex_lock(&ftrace_lock);
4912
4913 WARN_ON(probe->ref < count);
4914
4915 probe->ref -= count;
4916
4917 if (ftrace_hash_empty(hash))
4918 ftrace_shutdown(&probe->ops, 0);
4919
4920 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4921 hash, 1);
4922
4923 /* still need to update the function call sites */
4924 if (ftrace_enabled && !ftrace_hash_empty(hash))
4925 ftrace_run_modify_code(&probe->ops, FTRACE_UPDATE_CALLS,
4926 &old_hash_ops);
4927 synchronize_rcu();
4928
4929 hlist_for_each_entry_safe(entry, tmp, &hhd, hlist) {
4930 hlist_del(&entry->hlist);
4931 if (probe_ops->free)
4932 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4933 kfree(entry);
4934 }
4935 mutex_unlock(&ftrace_lock);
4936
4937 out_unlock:
4938 mutex_unlock(&probe->ops.func_hash->regex_lock);
4939 free_ftrace_hash(hash);
4940
4941 release_probe(probe);
4942
4943 return ret;
4944
4945 err_unlock_ftrace:
4946 mutex_unlock(&ftrace_lock);
4947 return ret;
4948}
4949
4950void clear_ftrace_function_probes(struct trace_array *tr)
4951{
4952 struct ftrace_func_probe *probe, *n;
4953
4954 list_for_each_entry_safe(probe, n, &tr->func_probes, list)
4955 unregister_ftrace_function_probe_func(NULL, tr, probe->probe_ops);
4956}
4957
4958static LIST_HEAD(ftrace_commands);
4959static DEFINE_MUTEX(ftrace_cmd_mutex);
4960
4961/*
4962 * Currently we only register ftrace commands from __init, so mark this
4963 * __init too.
4964 */
4965__init int register_ftrace_command(struct ftrace_func_command *cmd)
4966{
4967 struct ftrace_func_command *p;
4968 int ret = 0;
4969
4970 mutex_lock(&ftrace_cmd_mutex);
4971 list_for_each_entry(p, &ftrace_commands, list) {
4972 if (strcmp(cmd->name, p->name) == 0) {
4973 ret = -EBUSY;
4974 goto out_unlock;
4975 }
4976 }
4977 list_add(&cmd->list, &ftrace_commands);
4978 out_unlock:
4979 mutex_unlock(&ftrace_cmd_mutex);
4980
4981 return ret;
4982}
4983
4984/*
4985 * Currently we only unregister ftrace commands from __init, so mark
4986 * this __init too.
4987 */
4988__init int unregister_ftrace_command(struct ftrace_func_command *cmd)
4989{
4990 struct ftrace_func_command *p, *n;
4991 int ret = -ENODEV;
4992
4993 mutex_lock(&ftrace_cmd_mutex);
4994 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
4995 if (strcmp(cmd->name, p->name) == 0) {
4996 ret = 0;
4997 list_del_init(&p->list);
4998 goto out_unlock;
4999 }
5000 }
5001 out_unlock:
5002 mutex_unlock(&ftrace_cmd_mutex);
5003
5004 return ret;
5005}
5006
5007static int ftrace_process_regex(struct ftrace_iterator *iter,
5008 char *buff, int len, int enable)
5009{
5010 struct ftrace_hash *hash = iter->hash;
5011 struct trace_array *tr = iter->ops->private;
5012 char *func, *command, *next = buff;
5013 struct ftrace_func_command *p;
5014 int ret = -EINVAL;
5015
5016 func = strsep(&next, ":");
5017
5018 if (!next) {
5019 ret = ftrace_match_records(hash, func, len);
5020 if (!ret)
5021 ret = -EINVAL;
5022 if (ret < 0)
5023 return ret;
5024 return 0;
5025 }
5026
5027 /* command found */
5028
5029 command = strsep(&next, ":");
5030
5031 mutex_lock(&ftrace_cmd_mutex);
5032 list_for_each_entry(p, &ftrace_commands, list) {
5033 if (strcmp(p->name, command) == 0) {
5034 ret = p->func(tr, hash, func, command, next, enable);
5035 goto out_unlock;
5036 }
5037 }
5038 out_unlock:
5039 mutex_unlock(&ftrace_cmd_mutex);
5040
5041 return ret;
5042}
5043
5044static ssize_t
5045ftrace_regex_write(struct file *file, const char __user *ubuf,
5046 size_t cnt, loff_t *ppos, int enable)
5047{
5048 struct ftrace_iterator *iter;
5049 struct trace_parser *parser;
5050 ssize_t ret, read;
5051
5052 if (!cnt)
5053 return 0;
5054
5055 if (file->f_mode & FMODE_READ) {
5056 struct seq_file *m = file->private_data;
5057 iter = m->private;
5058 } else
5059 iter = file->private_data;
5060
5061 if (unlikely(ftrace_disabled))
5062 return -ENODEV;
5063
5064 /* iter->hash is a local copy, so we don't need regex_lock */
5065
5066 parser = &iter->parser;
5067 read = trace_get_user(parser, ubuf, cnt, ppos);
5068
5069 if (read >= 0 && trace_parser_loaded(parser) &&
5070 !trace_parser_cont(parser)) {
5071 ret = ftrace_process_regex(iter, parser->buffer,
5072 parser->idx, enable);
5073 trace_parser_clear(parser);
5074 if (ret < 0)
5075 goto out;
5076 }
5077
5078 ret = read;
5079 out:
5080 return ret;
5081}
5082
5083ssize_t
5084ftrace_filter_write(struct file *file, const char __user *ubuf,
5085 size_t cnt, loff_t *ppos)
5086{
5087 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
5088}
5089
5090ssize_t
5091ftrace_notrace_write(struct file *file, const char __user *ubuf,
5092 size_t cnt, loff_t *ppos)
5093{
5094 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
5095}
5096
5097static int
5098__ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
5099{
5100 struct ftrace_func_entry *entry;
5101
5102 ip = ftrace_location(ip);
5103 if (!ip)
5104 return -EINVAL;
5105
5106 if (remove) {
5107 entry = ftrace_lookup_ip(hash, ip);
5108 if (!entry)
5109 return -ENOENT;
5110 free_hash_entry(hash, entry);
5111 return 0;
5112 }
5113
5114 return add_hash_entry(hash, ip);
5115}
5116
5117static int
5118ftrace_match_addr(struct ftrace_hash *hash, unsigned long *ips,
5119 unsigned int cnt, int remove)
5120{
5121 unsigned int i;
5122 int err;
5123
5124 for (i = 0; i < cnt; i++) {
5125 err = __ftrace_match_addr(hash, ips[i], remove);
5126 if (err) {
5127 /*
5128 * This expects the @hash is a temporary hash and if this
5129 * fails the caller must free the @hash.
5130 */
5131 return err;
5132 }
5133 }
5134 return 0;
5135}
5136
5137static int
5138ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
5139 unsigned long *ips, unsigned int cnt,
5140 int remove, int reset, int enable)
5141{
5142 struct ftrace_hash **orig_hash;
5143 struct ftrace_hash *hash;
5144 int ret;
5145
5146 if (unlikely(ftrace_disabled))
5147 return -ENODEV;
5148
5149 mutex_lock(&ops->func_hash->regex_lock);
5150
5151 if (enable)
5152 orig_hash = &ops->func_hash->filter_hash;
5153 else
5154 orig_hash = &ops->func_hash->notrace_hash;
5155
5156 if (reset)
5157 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
5158 else
5159 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
5160
5161 if (!hash) {
5162 ret = -ENOMEM;
5163 goto out_regex_unlock;
5164 }
5165
5166 if (buf && !ftrace_match_records(hash, buf, len)) {
5167 ret = -EINVAL;
5168 goto out_regex_unlock;
5169 }
5170 if (ips) {
5171 ret = ftrace_match_addr(hash, ips, cnt, remove);
5172 if (ret < 0)
5173 goto out_regex_unlock;
5174 }
5175
5176 mutex_lock(&ftrace_lock);
5177 ret = ftrace_hash_move_and_update_ops(ops, orig_hash, hash, enable);
5178 mutex_unlock(&ftrace_lock);
5179
5180 out_regex_unlock:
5181 mutex_unlock(&ops->func_hash->regex_lock);
5182
5183 free_ftrace_hash(hash);
5184 return ret;
5185}
5186
5187static int
5188ftrace_set_addr(struct ftrace_ops *ops, unsigned long *ips, unsigned int cnt,
5189 int remove, int reset, int enable)
5190{
5191 return ftrace_set_hash(ops, NULL, 0, ips, cnt, remove, reset, enable);
5192}
5193
5194#ifdef CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS
5195
5196struct ftrace_direct_func {
5197 struct list_head next;
5198 unsigned long addr;
5199 int count;
5200};
5201
5202static LIST_HEAD(ftrace_direct_funcs);
5203
5204/**
5205 * ftrace_find_direct_func - test an address if it is a registered direct caller
5206 * @addr: The address of a registered direct caller
5207 *
5208 * This searches to see if a ftrace direct caller has been registered
5209 * at a specific address, and if so, it returns a descriptor for it.
5210 *
5211 * This can be used by architecture code to see if an address is
5212 * a direct caller (trampoline) attached to a fentry/mcount location.
5213 * This is useful for the function_graph tracer, as it may need to
5214 * do adjustments if it traced a location that also has a direct
5215 * trampoline attached to it.
5216 */
5217struct ftrace_direct_func *ftrace_find_direct_func(unsigned long addr)
5218{
5219 struct ftrace_direct_func *entry;
5220 bool found = false;
5221
5222 /* May be called by fgraph trampoline (protected by rcu tasks) */
5223 list_for_each_entry_rcu(entry, &ftrace_direct_funcs, next) {
5224 if (entry->addr == addr) {
5225 found = true;
5226 break;
5227 }
5228 }
5229 if (found)
5230 return entry;
5231
5232 return NULL;
5233}
5234
5235static struct ftrace_direct_func *ftrace_alloc_direct_func(unsigned long addr)
5236{
5237 struct ftrace_direct_func *direct;
5238
5239 direct = kmalloc(sizeof(*direct), GFP_KERNEL);
5240 if (!direct)
5241 return NULL;
5242 direct->addr = addr;
5243 direct->count = 0;
5244 list_add_rcu(&direct->next, &ftrace_direct_funcs);
5245 ftrace_direct_func_count++;
5246 return direct;
5247}
5248
5249static int register_ftrace_function_nolock(struct ftrace_ops *ops);
5250
5251/**
5252 * register_ftrace_direct - Call a custom trampoline directly
5253 * @ip: The address of the nop at the beginning of a function
5254 * @addr: The address of the trampoline to call at @ip
5255 *
5256 * This is used to connect a direct call from the nop location (@ip)
5257 * at the start of ftrace traced functions. The location that it calls
5258 * (@addr) must be able to handle a direct call, and save the parameters
5259 * of the function being traced, and restore them (or inject new ones
5260 * if needed), before returning.
5261 *
5262 * Returns:
5263 * 0 on success
5264 * -EBUSY - Another direct function is already attached (there can be only one)
5265 * -ENODEV - @ip does not point to a ftrace nop location (or not supported)
5266 * -ENOMEM - There was an allocation failure.
5267 */
5268int register_ftrace_direct(unsigned long ip, unsigned long addr)
5269{
5270 struct ftrace_direct_func *direct;
5271 struct ftrace_func_entry *entry;
5272 struct ftrace_hash *free_hash = NULL;
5273 struct dyn_ftrace *rec;
5274 int ret = -ENODEV;
5275
5276 mutex_lock(&direct_mutex);
5277
5278 ip = ftrace_location(ip);
5279 if (!ip)
5280 goto out_unlock;
5281
5282 /* See if there's a direct function at @ip already */
5283 ret = -EBUSY;
5284 if (ftrace_find_rec_direct(ip))
5285 goto out_unlock;
5286
5287 ret = -ENODEV;
5288 rec = lookup_rec(ip, ip);
5289 if (!rec)
5290 goto out_unlock;
5291
5292 /*
5293 * Check if the rec says it has a direct call but we didn't
5294 * find one earlier?
5295 */
5296 if (WARN_ON(rec->flags & FTRACE_FL_DIRECT))
5297 goto out_unlock;
5298
5299 /* Make sure the ip points to the exact record */
5300 if (ip != rec->ip) {
5301 ip = rec->ip;
5302 /* Need to check this ip for a direct. */
5303 if (ftrace_find_rec_direct(ip))
5304 goto out_unlock;
5305 }
5306
5307 ret = -ENOMEM;
5308 direct = ftrace_find_direct_func(addr);
5309 if (!direct) {
5310 direct = ftrace_alloc_direct_func(addr);
5311 if (!direct)
5312 goto out_unlock;
5313 }
5314
5315 entry = ftrace_add_rec_direct(ip, addr, &free_hash);
5316 if (!entry)
5317 goto out_unlock;
5318
5319 ret = ftrace_set_filter_ip(&direct_ops, ip, 0, 0);
5320
5321 if (!ret && !(direct_ops.flags & FTRACE_OPS_FL_ENABLED)) {
5322 ret = register_ftrace_function_nolock(&direct_ops);
5323 if (ret)
5324 ftrace_set_filter_ip(&direct_ops, ip, 1, 0);
5325 }
5326
5327 if (ret) {
5328 remove_hash_entry(direct_functions, entry);
5329 kfree(entry);
5330 if (!direct->count) {
5331 list_del_rcu(&direct->next);
5332 synchronize_rcu_tasks();
5333 kfree(direct);
5334 if (free_hash)
5335 free_ftrace_hash(free_hash);
5336 free_hash = NULL;
5337 ftrace_direct_func_count--;
5338 }
5339 } else {
5340 direct->count++;
5341 }
5342 out_unlock:
5343 mutex_unlock(&direct_mutex);
5344
5345 if (free_hash) {
5346 synchronize_rcu_tasks();
5347 free_ftrace_hash(free_hash);
5348 }
5349
5350 return ret;
5351}
5352EXPORT_SYMBOL_GPL(register_ftrace_direct);
5353
5354static struct ftrace_func_entry *find_direct_entry(unsigned long *ip,
5355 struct dyn_ftrace **recp)
5356{
5357 struct ftrace_func_entry *entry;
5358 struct dyn_ftrace *rec;
5359
5360 rec = lookup_rec(*ip, *ip);
5361 if (!rec)
5362 return NULL;
5363
5364 entry = __ftrace_lookup_ip(direct_functions, rec->ip);
5365 if (!entry) {
5366 WARN_ON(rec->flags & FTRACE_FL_DIRECT);
5367 return NULL;
5368 }
5369
5370 WARN_ON(!(rec->flags & FTRACE_FL_DIRECT));
5371
5372 /* Passed in ip just needs to be on the call site */
5373 *ip = rec->ip;
5374
5375 if (recp)
5376 *recp = rec;
5377
5378 return entry;
5379}
5380
5381int unregister_ftrace_direct(unsigned long ip, unsigned long addr)
5382{
5383 struct ftrace_direct_func *direct;
5384 struct ftrace_func_entry *entry;
5385 struct ftrace_hash *hash;
5386 int ret = -ENODEV;
5387
5388 mutex_lock(&direct_mutex);
5389
5390 ip = ftrace_location(ip);
5391 if (!ip)
5392 goto out_unlock;
5393
5394 entry = find_direct_entry(&ip, NULL);
5395 if (!entry)
5396 goto out_unlock;
5397
5398 hash = direct_ops.func_hash->filter_hash;
5399 if (hash->count == 1)
5400 unregister_ftrace_function(&direct_ops);
5401
5402 ret = ftrace_set_filter_ip(&direct_ops, ip, 1, 0);
5403
5404 WARN_ON(ret);
5405
5406 remove_hash_entry(direct_functions, entry);
5407
5408 direct = ftrace_find_direct_func(addr);
5409 if (!WARN_ON(!direct)) {
5410 /* This is the good path (see the ! before WARN) */
5411 direct->count--;
5412 WARN_ON(direct->count < 0);
5413 if (!direct->count) {
5414 list_del_rcu(&direct->next);
5415 synchronize_rcu_tasks();
5416 kfree(direct);
5417 kfree(entry);
5418 ftrace_direct_func_count--;
5419 }
5420 }
5421 out_unlock:
5422 mutex_unlock(&direct_mutex);
5423
5424 return ret;
5425}
5426EXPORT_SYMBOL_GPL(unregister_ftrace_direct);
5427
5428static struct ftrace_ops stub_ops = {
5429 .func = ftrace_stub,
5430};
5431
5432/**
5433 * ftrace_modify_direct_caller - modify ftrace nop directly
5434 * @entry: The ftrace hash entry of the direct helper for @rec
5435 * @rec: The record representing the function site to patch
5436 * @old_addr: The location that the site at @rec->ip currently calls
5437 * @new_addr: The location that the site at @rec->ip should call
5438 *
5439 * An architecture may overwrite this function to optimize the
5440 * changing of the direct callback on an ftrace nop location.
5441 * This is called with the ftrace_lock mutex held, and no other
5442 * ftrace callbacks are on the associated record (@rec). Thus,
5443 * it is safe to modify the ftrace record, where it should be
5444 * currently calling @old_addr directly, to call @new_addr.
5445 *
5446 * This is called with direct_mutex locked.
5447 *
5448 * Safety checks should be made to make sure that the code at
5449 * @rec->ip is currently calling @old_addr. And this must
5450 * also update entry->direct to @new_addr.
5451 */
5452int __weak ftrace_modify_direct_caller(struct ftrace_func_entry *entry,
5453 struct dyn_ftrace *rec,
5454 unsigned long old_addr,
5455 unsigned long new_addr)
5456{
5457 unsigned long ip = rec->ip;
5458 int ret;
5459
5460 lockdep_assert_held(&direct_mutex);
5461
5462 /*
5463 * The ftrace_lock was used to determine if the record
5464 * had more than one registered user to it. If it did,
5465 * we needed to prevent that from changing to do the quick
5466 * switch. But if it did not (only a direct caller was attached)
5467 * then this function is called. But this function can deal
5468 * with attached callers to the rec that we care about, and
5469 * since this function uses standard ftrace calls that take
5470 * the ftrace_lock mutex, we need to release it.
5471 */
5472 mutex_unlock(&ftrace_lock);
5473
5474 /*
5475 * By setting a stub function at the same address, we force
5476 * the code to call the iterator and the direct_ops helper.
5477 * This means that @ip does not call the direct call, and
5478 * we can simply modify it.
5479 */
5480 ret = ftrace_set_filter_ip(&stub_ops, ip, 0, 0);
5481 if (ret)
5482 goto out_lock;
5483
5484 ret = register_ftrace_function_nolock(&stub_ops);
5485 if (ret) {
5486 ftrace_set_filter_ip(&stub_ops, ip, 1, 0);
5487 goto out_lock;
5488 }
5489
5490 entry->direct = new_addr;
5491
5492 /*
5493 * By removing the stub, we put back the direct call, calling
5494 * the @new_addr.
5495 */
5496 unregister_ftrace_function(&stub_ops);
5497 ftrace_set_filter_ip(&stub_ops, ip, 1, 0);
5498
5499 out_lock:
5500 mutex_lock(&ftrace_lock);
5501
5502 return ret;
5503}
5504
5505/**
5506 * modify_ftrace_direct - Modify an existing direct call to call something else
5507 * @ip: The instruction pointer to modify
5508 * @old_addr: The address that the current @ip calls directly
5509 * @new_addr: The address that the @ip should call
5510 *
5511 * This modifies a ftrace direct caller at an instruction pointer without
5512 * having to disable it first. The direct call will switch over to the
5513 * @new_addr without missing anything.
5514 *
5515 * Returns: zero on success. Non zero on error, which includes:
5516 * -ENODEV : the @ip given has no direct caller attached
5517 * -EINVAL : the @old_addr does not match the current direct caller
5518 */
5519int modify_ftrace_direct(unsigned long ip,
5520 unsigned long old_addr, unsigned long new_addr)
5521{
5522 struct ftrace_direct_func *direct, *new_direct = NULL;
5523 struct ftrace_func_entry *entry;
5524 struct dyn_ftrace *rec;
5525 int ret = -ENODEV;
5526
5527 mutex_lock(&direct_mutex);
5528
5529 mutex_lock(&ftrace_lock);
5530
5531 ip = ftrace_location(ip);
5532 if (!ip)
5533 goto out_unlock;
5534
5535 entry = find_direct_entry(&ip, &rec);
5536 if (!entry)
5537 goto out_unlock;
5538
5539 ret = -EINVAL;
5540 if (entry->direct != old_addr)
5541 goto out_unlock;
5542
5543 direct = ftrace_find_direct_func(old_addr);
5544 if (WARN_ON(!direct))
5545 goto out_unlock;
5546 if (direct->count > 1) {
5547 ret = -ENOMEM;
5548 new_direct = ftrace_alloc_direct_func(new_addr);
5549 if (!new_direct)
5550 goto out_unlock;
5551 direct->count--;
5552 new_direct->count++;
5553 } else {
5554 direct->addr = new_addr;
5555 }
5556
5557 /*
5558 * If there's no other ftrace callback on the rec->ip location,
5559 * then it can be changed directly by the architecture.
5560 * If there is another caller, then we just need to change the
5561 * direct caller helper to point to @new_addr.
5562 */
5563 if (ftrace_rec_count(rec) == 1) {
5564 ret = ftrace_modify_direct_caller(entry, rec, old_addr, new_addr);
5565 } else {
5566 entry->direct = new_addr;
5567 ret = 0;
5568 }
5569
5570 if (unlikely(ret && new_direct)) {
5571 direct->count++;
5572 list_del_rcu(&new_direct->next);
5573 synchronize_rcu_tasks();
5574 kfree(new_direct);
5575 ftrace_direct_func_count--;
5576 }
5577
5578 out_unlock:
5579 mutex_unlock(&ftrace_lock);
5580 mutex_unlock(&direct_mutex);
5581 return ret;
5582}
5583EXPORT_SYMBOL_GPL(modify_ftrace_direct);
5584
5585#define MULTI_FLAGS (FTRACE_OPS_FL_DIRECT | FTRACE_OPS_FL_SAVE_REGS)
5586
5587static int check_direct_multi(struct ftrace_ops *ops)
5588{
5589 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED))
5590 return -EINVAL;
5591 if ((ops->flags & MULTI_FLAGS) != MULTI_FLAGS)
5592 return -EINVAL;
5593 return 0;
5594}
5595
5596static void remove_direct_functions_hash(struct ftrace_hash *hash, unsigned long addr)
5597{
5598 struct ftrace_func_entry *entry, *del;
5599 int size, i;
5600
5601 size = 1 << hash->size_bits;
5602 for (i = 0; i < size; i++) {
5603 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
5604 del = __ftrace_lookup_ip(direct_functions, entry->ip);
5605 if (del && del->direct == addr) {
5606 remove_hash_entry(direct_functions, del);
5607 kfree(del);
5608 }
5609 }
5610 }
5611}
5612
5613/**
5614 * register_ftrace_direct_multi - Call a custom trampoline directly
5615 * for multiple functions registered in @ops
5616 * @ops: The address of the struct ftrace_ops object
5617 * @addr: The address of the trampoline to call at @ops functions
5618 *
5619 * This is used to connect a direct calls to @addr from the nop locations
5620 * of the functions registered in @ops (with by ftrace_set_filter_ip
5621 * function).
5622 *
5623 * The location that it calls (@addr) must be able to handle a direct call,
5624 * and save the parameters of the function being traced, and restore them
5625 * (or inject new ones if needed), before returning.
5626 *
5627 * Returns:
5628 * 0 on success
5629 * -EINVAL - The @ops object was already registered with this call or
5630 * when there are no functions in @ops object.
5631 * -EBUSY - Another direct function is already attached (there can be only one)
5632 * -ENODEV - @ip does not point to a ftrace nop location (or not supported)
5633 * -ENOMEM - There was an allocation failure.
5634 */
5635int register_ftrace_direct_multi(struct ftrace_ops *ops, unsigned long addr)
5636{
5637 struct ftrace_hash *hash, *free_hash = NULL;
5638 struct ftrace_func_entry *entry, *new;
5639 int err = -EBUSY, size, i;
5640
5641 if (ops->func || ops->trampoline)
5642 return -EINVAL;
5643 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED))
5644 return -EINVAL;
5645 if (ops->flags & FTRACE_OPS_FL_ENABLED)
5646 return -EINVAL;
5647
5648 hash = ops->func_hash->filter_hash;
5649 if (ftrace_hash_empty(hash))
5650 return -EINVAL;
5651
5652 mutex_lock(&direct_mutex);
5653
5654 /* Make sure requested entries are not already registered.. */
5655 size = 1 << hash->size_bits;
5656 for (i = 0; i < size; i++) {
5657 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
5658 if (ftrace_find_rec_direct(entry->ip))
5659 goto out_unlock;
5660 }
5661 }
5662
5663 /* ... and insert them to direct_functions hash. */
5664 err = -ENOMEM;
5665 for (i = 0; i < size; i++) {
5666 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
5667 new = ftrace_add_rec_direct(entry->ip, addr, &free_hash);
5668 if (!new)
5669 goto out_remove;
5670 entry->direct = addr;
5671 }
5672 }
5673
5674 ops->func = call_direct_funcs;
5675 ops->flags = MULTI_FLAGS;
5676 ops->trampoline = FTRACE_REGS_ADDR;
5677
5678 err = register_ftrace_function_nolock(ops);
5679
5680 out_remove:
5681 if (err)
5682 remove_direct_functions_hash(hash, addr);
5683
5684 out_unlock:
5685 mutex_unlock(&direct_mutex);
5686
5687 if (free_hash) {
5688 synchronize_rcu_tasks();
5689 free_ftrace_hash(free_hash);
5690 }
5691 return err;
5692}
5693EXPORT_SYMBOL_GPL(register_ftrace_direct_multi);
5694
5695/**
5696 * unregister_ftrace_direct_multi - Remove calls to custom trampoline
5697 * previously registered by register_ftrace_direct_multi for @ops object.
5698 * @ops: The address of the struct ftrace_ops object
5699 *
5700 * This is used to remove a direct calls to @addr from the nop locations
5701 * of the functions registered in @ops (with by ftrace_set_filter_ip
5702 * function).
5703 *
5704 * Returns:
5705 * 0 on success
5706 * -EINVAL - The @ops object was not properly registered.
5707 */
5708int unregister_ftrace_direct_multi(struct ftrace_ops *ops, unsigned long addr)
5709{
5710 struct ftrace_hash *hash = ops->func_hash->filter_hash;
5711 int err;
5712
5713 if (check_direct_multi(ops))
5714 return -EINVAL;
5715 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
5716 return -EINVAL;
5717
5718 mutex_lock(&direct_mutex);
5719 err = unregister_ftrace_function(ops);
5720 remove_direct_functions_hash(hash, addr);
5721 mutex_unlock(&direct_mutex);
5722
5723 /* cleanup for possible another register call */
5724 ops->func = NULL;
5725 ops->trampoline = 0;
5726 return err;
5727}
5728EXPORT_SYMBOL_GPL(unregister_ftrace_direct_multi);
5729
5730static int
5731__modify_ftrace_direct_multi(struct ftrace_ops *ops, unsigned long addr)
5732{
5733 struct ftrace_hash *hash;
5734 struct ftrace_func_entry *entry, *iter;
5735 static struct ftrace_ops tmp_ops = {
5736 .func = ftrace_stub,
5737 .flags = FTRACE_OPS_FL_STUB,
5738 };
5739 int i, size;
5740 int err;
5741
5742 lockdep_assert_held_once(&direct_mutex);
5743
5744 /* Enable the tmp_ops to have the same functions as the direct ops */
5745 ftrace_ops_init(&tmp_ops);
5746 tmp_ops.func_hash = ops->func_hash;
5747
5748 err = register_ftrace_function_nolock(&tmp_ops);
5749 if (err)
5750 return err;
5751
5752 /*
5753 * Now the ftrace_ops_list_func() is called to do the direct callers.
5754 * We can safely change the direct functions attached to each entry.
5755 */
5756 mutex_lock(&ftrace_lock);
5757
5758 hash = ops->func_hash->filter_hash;
5759 size = 1 << hash->size_bits;
5760 for (i = 0; i < size; i++) {
5761 hlist_for_each_entry(iter, &hash->buckets[i], hlist) {
5762 entry = __ftrace_lookup_ip(direct_functions, iter->ip);
5763 if (!entry)
5764 continue;
5765 entry->direct = addr;
5766 }
5767 }
5768
5769 mutex_unlock(&ftrace_lock);
5770
5771 /* Removing the tmp_ops will add the updated direct callers to the functions */
5772 unregister_ftrace_function(&tmp_ops);
5773
5774 return err;
5775}
5776
5777/**
5778 * modify_ftrace_direct_multi_nolock - Modify an existing direct 'multi' call
5779 * to call something else
5780 * @ops: The address of the struct ftrace_ops object
5781 * @addr: The address of the new trampoline to call at @ops functions
5782 *
5783 * This is used to unregister currently registered direct caller and
5784 * register new one @addr on functions registered in @ops object.
5785 *
5786 * Note there's window between ftrace_shutdown and ftrace_startup calls
5787 * where there will be no callbacks called.
5788 *
5789 * Caller should already have direct_mutex locked, so we don't lock
5790 * direct_mutex here.
5791 *
5792 * Returns: zero on success. Non zero on error, which includes:
5793 * -EINVAL - The @ops object was not properly registered.
5794 */
5795int modify_ftrace_direct_multi_nolock(struct ftrace_ops *ops, unsigned long addr)
5796{
5797 if (check_direct_multi(ops))
5798 return -EINVAL;
5799 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
5800 return -EINVAL;
5801
5802 return __modify_ftrace_direct_multi(ops, addr);
5803}
5804EXPORT_SYMBOL_GPL(modify_ftrace_direct_multi_nolock);
5805
5806/**
5807 * modify_ftrace_direct_multi - Modify an existing direct 'multi' call
5808 * to call something else
5809 * @ops: The address of the struct ftrace_ops object
5810 * @addr: The address of the new trampoline to call at @ops functions
5811 *
5812 * This is used to unregister currently registered direct caller and
5813 * register new one @addr on functions registered in @ops object.
5814 *
5815 * Note there's window between ftrace_shutdown and ftrace_startup calls
5816 * where there will be no callbacks called.
5817 *
5818 * Returns: zero on success. Non zero on error, which includes:
5819 * -EINVAL - The @ops object was not properly registered.
5820 */
5821int modify_ftrace_direct_multi(struct ftrace_ops *ops, unsigned long addr)
5822{
5823 int err;
5824
5825 if (check_direct_multi(ops))
5826 return -EINVAL;
5827 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
5828 return -EINVAL;
5829
5830 mutex_lock(&direct_mutex);
5831 err = __modify_ftrace_direct_multi(ops, addr);
5832 mutex_unlock(&direct_mutex);
5833 return err;
5834}
5835EXPORT_SYMBOL_GPL(modify_ftrace_direct_multi);
5836#endif /* CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS */
5837
5838/**
5839 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
5840 * @ops - the ops to set the filter with
5841 * @ip - the address to add to or remove from the filter.
5842 * @remove - non zero to remove the ip from the filter
5843 * @reset - non zero to reset all filters before applying this filter.
5844 *
5845 * Filters denote which functions should be enabled when tracing is enabled
5846 * If @ip is NULL, it fails to update filter.
5847 *
5848 * This can allocate memory which must be freed before @ops can be freed,
5849 * either by removing each filtered addr or by using
5850 * ftrace_free_filter(@ops).
5851 */
5852int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
5853 int remove, int reset)
5854{
5855 ftrace_ops_init(ops);
5856 return ftrace_set_addr(ops, &ip, 1, remove, reset, 1);
5857}
5858EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
5859
5860/**
5861 * ftrace_set_filter_ips - set functions to filter on in ftrace by addresses
5862 * @ops - the ops to set the filter with
5863 * @ips - the array of addresses to add to or remove from the filter.
5864 * @cnt - the number of addresses in @ips
5865 * @remove - non zero to remove ips from the filter
5866 * @reset - non zero to reset all filters before applying this filter.
5867 *
5868 * Filters denote which functions should be enabled when tracing is enabled
5869 * If @ips array or any ip specified within is NULL , it fails to update filter.
5870 *
5871 * This can allocate memory which must be freed before @ops can be freed,
5872 * either by removing each filtered addr or by using
5873 * ftrace_free_filter(@ops).
5874*/
5875int ftrace_set_filter_ips(struct ftrace_ops *ops, unsigned long *ips,
5876 unsigned int cnt, int remove, int reset)
5877{
5878 ftrace_ops_init(ops);
5879 return ftrace_set_addr(ops, ips, cnt, remove, reset, 1);
5880}
5881EXPORT_SYMBOL_GPL(ftrace_set_filter_ips);
5882
5883/**
5884 * ftrace_ops_set_global_filter - setup ops to use global filters
5885 * @ops - the ops which will use the global filters
5886 *
5887 * ftrace users who need global function trace filtering should call this.
5888 * It can set the global filter only if ops were not initialized before.
5889 */
5890void ftrace_ops_set_global_filter(struct ftrace_ops *ops)
5891{
5892 if (ops->flags & FTRACE_OPS_FL_INITIALIZED)
5893 return;
5894
5895 ftrace_ops_init(ops);
5896 ops->func_hash = &global_ops.local_hash;
5897}
5898EXPORT_SYMBOL_GPL(ftrace_ops_set_global_filter);
5899
5900static int
5901ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
5902 int reset, int enable)
5903{
5904 return ftrace_set_hash(ops, buf, len, NULL, 0, 0, reset, enable);
5905}
5906
5907/**
5908 * ftrace_set_filter - set a function to filter on in ftrace
5909 * @ops - the ops to set the filter with
5910 * @buf - the string that holds the function filter text.
5911 * @len - the length of the string.
5912 * @reset - non zero to reset all filters before applying this filter.
5913 *
5914 * Filters denote which functions should be enabled when tracing is enabled.
5915 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
5916 *
5917 * This can allocate memory which must be freed before @ops can be freed,
5918 * either by removing each filtered addr or by using
5919 * ftrace_free_filter(@ops).
5920 */
5921int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
5922 int len, int reset)
5923{
5924 ftrace_ops_init(ops);
5925 return ftrace_set_regex(ops, buf, len, reset, 1);
5926}
5927EXPORT_SYMBOL_GPL(ftrace_set_filter);
5928
5929/**
5930 * ftrace_set_notrace - set a function to not trace in ftrace
5931 * @ops - the ops to set the notrace filter with
5932 * @buf - the string that holds the function notrace text.
5933 * @len - the length of the string.
5934 * @reset - non zero to reset all filters before applying this filter.
5935 *
5936 * Notrace Filters denote which functions should not be enabled when tracing
5937 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
5938 * for tracing.
5939 *
5940 * This can allocate memory which must be freed before @ops can be freed,
5941 * either by removing each filtered addr or by using
5942 * ftrace_free_filter(@ops).
5943 */
5944int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
5945 int len, int reset)
5946{
5947 ftrace_ops_init(ops);
5948 return ftrace_set_regex(ops, buf, len, reset, 0);
5949}
5950EXPORT_SYMBOL_GPL(ftrace_set_notrace);
5951/**
5952 * ftrace_set_global_filter - set a function to filter on with global tracers
5953 * @buf - the string that holds the function filter text.
5954 * @len - the length of the string.
5955 * @reset - non zero to reset all filters before applying this filter.
5956 *
5957 * Filters denote which functions should be enabled when tracing is enabled.
5958 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
5959 */
5960void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
5961{
5962 ftrace_set_regex(&global_ops, buf, len, reset, 1);
5963}
5964EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
5965
5966/**
5967 * ftrace_set_global_notrace - set a function to not trace with global tracers
5968 * @buf - the string that holds the function notrace text.
5969 * @len - the length of the string.
5970 * @reset - non zero to reset all filters before applying this filter.
5971 *
5972 * Notrace Filters denote which functions should not be enabled when tracing
5973 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
5974 * for tracing.
5975 */
5976void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
5977{
5978 ftrace_set_regex(&global_ops, buf, len, reset, 0);
5979}
5980EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
5981
5982/*
5983 * command line interface to allow users to set filters on boot up.
5984 */
5985#define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
5986static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
5987static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
5988
5989/* Used by function selftest to not test if filter is set */
5990bool ftrace_filter_param __initdata;
5991
5992static int __init set_ftrace_notrace(char *str)
5993{
5994 ftrace_filter_param = true;
5995 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
5996 return 1;
5997}
5998__setup("ftrace_notrace=", set_ftrace_notrace);
5999
6000static int __init set_ftrace_filter(char *str)
6001{
6002 ftrace_filter_param = true;
6003 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
6004 return 1;
6005}
6006__setup("ftrace_filter=", set_ftrace_filter);
6007
6008#ifdef CONFIG_FUNCTION_GRAPH_TRACER
6009static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
6010static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
6011static int ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer);
6012
6013static int __init set_graph_function(char *str)
6014{
6015 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
6016 return 1;
6017}
6018__setup("ftrace_graph_filter=", set_graph_function);
6019
6020static int __init set_graph_notrace_function(char *str)
6021{
6022 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
6023 return 1;
6024}
6025__setup("ftrace_graph_notrace=", set_graph_notrace_function);
6026
6027static int __init set_graph_max_depth_function(char *str)
6028{
6029 if (!str)
6030 return 0;
6031 fgraph_max_depth = simple_strtoul(str, NULL, 0);
6032 return 1;
6033}
6034__setup("ftrace_graph_max_depth=", set_graph_max_depth_function);
6035
6036static void __init set_ftrace_early_graph(char *buf, int enable)
6037{
6038 int ret;
6039 char *func;
6040 struct ftrace_hash *hash;
6041
6042 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
6043 if (MEM_FAIL(!hash, "Failed to allocate hash\n"))
6044 return;
6045
6046 while (buf) {
6047 func = strsep(&buf, ",");
6048 /* we allow only one expression at a time */
6049 ret = ftrace_graph_set_hash(hash, func);
6050 if (ret)
6051 printk(KERN_DEBUG "ftrace: function %s not "
6052 "traceable\n", func);
6053 }
6054
6055 if (enable)
6056 ftrace_graph_hash = hash;
6057 else
6058 ftrace_graph_notrace_hash = hash;
6059}
6060#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
6061
6062void __init
6063ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
6064{
6065 char *func;
6066
6067 ftrace_ops_init(ops);
6068
6069 while (buf) {
6070 func = strsep(&buf, ",");
6071 ftrace_set_regex(ops, func, strlen(func), 0, enable);
6072 }
6073}
6074
6075static void __init set_ftrace_early_filters(void)
6076{
6077 if (ftrace_filter_buf[0])
6078 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
6079 if (ftrace_notrace_buf[0])
6080 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
6081#ifdef CONFIG_FUNCTION_GRAPH_TRACER
6082 if (ftrace_graph_buf[0])
6083 set_ftrace_early_graph(ftrace_graph_buf, 1);
6084 if (ftrace_graph_notrace_buf[0])
6085 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
6086#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
6087}
6088
6089int ftrace_regex_release(struct inode *inode, struct file *file)
6090{
6091 struct seq_file *m = (struct seq_file *)file->private_data;
6092 struct ftrace_iterator *iter;
6093 struct ftrace_hash **orig_hash;
6094 struct trace_parser *parser;
6095 int filter_hash;
6096
6097 if (file->f_mode & FMODE_READ) {
6098 iter = m->private;
6099 seq_release(inode, file);
6100 } else
6101 iter = file->private_data;
6102
6103 parser = &iter->parser;
6104 if (trace_parser_loaded(parser)) {
6105 int enable = !(iter->flags & FTRACE_ITER_NOTRACE);
6106
6107 ftrace_process_regex(iter, parser->buffer,
6108 parser->idx, enable);
6109 }
6110
6111 trace_parser_put(parser);
6112
6113 mutex_lock(&iter->ops->func_hash->regex_lock);
6114
6115 if (file->f_mode & FMODE_WRITE) {
6116 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
6117
6118 if (filter_hash) {
6119 orig_hash = &iter->ops->func_hash->filter_hash;
6120 if (iter->tr) {
6121 if (list_empty(&iter->tr->mod_trace))
6122 iter->hash->flags &= ~FTRACE_HASH_FL_MOD;
6123 else
6124 iter->hash->flags |= FTRACE_HASH_FL_MOD;
6125 }
6126 } else
6127 orig_hash = &iter->ops->func_hash->notrace_hash;
6128
6129 mutex_lock(&ftrace_lock);
6130 ftrace_hash_move_and_update_ops(iter->ops, orig_hash,
6131 iter->hash, filter_hash);
6132 mutex_unlock(&ftrace_lock);
6133 } else {
6134 /* For read only, the hash is the ops hash */
6135 iter->hash = NULL;
6136 }
6137
6138 mutex_unlock(&iter->ops->func_hash->regex_lock);
6139 free_ftrace_hash(iter->hash);
6140 if (iter->tr)
6141 trace_array_put(iter->tr);
6142 kfree(iter);
6143
6144 return 0;
6145}
6146
6147static const struct file_operations ftrace_avail_fops = {
6148 .open = ftrace_avail_open,
6149 .read = seq_read,
6150 .llseek = seq_lseek,
6151 .release = seq_release_private,
6152};
6153
6154static const struct file_operations ftrace_enabled_fops = {
6155 .open = ftrace_enabled_open,
6156 .read = seq_read,
6157 .llseek = seq_lseek,
6158 .release = seq_release_private,
6159};
6160
6161static const struct file_operations ftrace_filter_fops = {
6162 .open = ftrace_filter_open,
6163 .read = seq_read,
6164 .write = ftrace_filter_write,
6165 .llseek = tracing_lseek,
6166 .release = ftrace_regex_release,
6167};
6168
6169static const struct file_operations ftrace_notrace_fops = {
6170 .open = ftrace_notrace_open,
6171 .read = seq_read,
6172 .write = ftrace_notrace_write,
6173 .llseek = tracing_lseek,
6174 .release = ftrace_regex_release,
6175};
6176
6177#ifdef CONFIG_FUNCTION_GRAPH_TRACER
6178
6179static DEFINE_MUTEX(graph_lock);
6180
6181struct ftrace_hash __rcu *ftrace_graph_hash = EMPTY_HASH;
6182struct ftrace_hash __rcu *ftrace_graph_notrace_hash = EMPTY_HASH;
6183
6184enum graph_filter_type {
6185 GRAPH_FILTER_NOTRACE = 0,
6186 GRAPH_FILTER_FUNCTION,
6187};
6188
6189#define FTRACE_GRAPH_EMPTY ((void *)1)
6190
6191struct ftrace_graph_data {
6192 struct ftrace_hash *hash;
6193 struct ftrace_func_entry *entry;
6194 int idx; /* for hash table iteration */
6195 enum graph_filter_type type;
6196 struct ftrace_hash *new_hash;
6197 const struct seq_operations *seq_ops;
6198 struct trace_parser parser;
6199};
6200
6201static void *
6202__g_next(struct seq_file *m, loff_t *pos)
6203{
6204 struct ftrace_graph_data *fgd = m->private;
6205 struct ftrace_func_entry *entry = fgd->entry;
6206 struct hlist_head *head;
6207 int i, idx = fgd->idx;
6208
6209 if (*pos >= fgd->hash->count)
6210 return NULL;
6211
6212 if (entry) {
6213 hlist_for_each_entry_continue(entry, hlist) {
6214 fgd->entry = entry;
6215 return entry;
6216 }
6217
6218 idx++;
6219 }
6220
6221 for (i = idx; i < 1 << fgd->hash->size_bits; i++) {
6222 head = &fgd->hash->buckets[i];
6223 hlist_for_each_entry(entry, head, hlist) {
6224 fgd->entry = entry;
6225 fgd->idx = i;
6226 return entry;
6227 }
6228 }
6229 return NULL;
6230}
6231
6232static void *
6233g_next(struct seq_file *m, void *v, loff_t *pos)
6234{
6235 (*pos)++;
6236 return __g_next(m, pos);
6237}
6238
6239static void *g_start(struct seq_file *m, loff_t *pos)
6240{
6241 struct ftrace_graph_data *fgd = m->private;
6242
6243 mutex_lock(&graph_lock);
6244
6245 if (fgd->type == GRAPH_FILTER_FUNCTION)
6246 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
6247 lockdep_is_held(&graph_lock));
6248 else
6249 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
6250 lockdep_is_held(&graph_lock));
6251
6252 /* Nothing, tell g_show to print all functions are enabled */
6253 if (ftrace_hash_empty(fgd->hash) && !*pos)
6254 return FTRACE_GRAPH_EMPTY;
6255
6256 fgd->idx = 0;
6257 fgd->entry = NULL;
6258 return __g_next(m, pos);
6259}
6260
6261static void g_stop(struct seq_file *m, void *p)
6262{
6263 mutex_unlock(&graph_lock);
6264}
6265
6266static int g_show(struct seq_file *m, void *v)
6267{
6268 struct ftrace_func_entry *entry = v;
6269
6270 if (!entry)
6271 return 0;
6272
6273 if (entry == FTRACE_GRAPH_EMPTY) {
6274 struct ftrace_graph_data *fgd = m->private;
6275
6276 if (fgd->type == GRAPH_FILTER_FUNCTION)
6277 seq_puts(m, "#### all functions enabled ####\n");
6278 else
6279 seq_puts(m, "#### no functions disabled ####\n");
6280 return 0;
6281 }
6282
6283 seq_printf(m, "%ps\n", (void *)entry->ip);
6284
6285 return 0;
6286}
6287
6288static const struct seq_operations ftrace_graph_seq_ops = {
6289 .start = g_start,
6290 .next = g_next,
6291 .stop = g_stop,
6292 .show = g_show,
6293};
6294
6295static int
6296__ftrace_graph_open(struct inode *inode, struct file *file,
6297 struct ftrace_graph_data *fgd)
6298{
6299 int ret;
6300 struct ftrace_hash *new_hash = NULL;
6301
6302 ret = security_locked_down(LOCKDOWN_TRACEFS);
6303 if (ret)
6304 return ret;
6305
6306 if (file->f_mode & FMODE_WRITE) {
6307 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
6308
6309 if (trace_parser_get_init(&fgd->parser, FTRACE_BUFF_MAX))
6310 return -ENOMEM;
6311
6312 if (file->f_flags & O_TRUNC)
6313 new_hash = alloc_ftrace_hash(size_bits);
6314 else
6315 new_hash = alloc_and_copy_ftrace_hash(size_bits,
6316 fgd->hash);
6317 if (!new_hash) {
6318 ret = -ENOMEM;
6319 goto out;
6320 }
6321 }
6322
6323 if (file->f_mode & FMODE_READ) {
6324 ret = seq_open(file, &ftrace_graph_seq_ops);
6325 if (!ret) {
6326 struct seq_file *m = file->private_data;
6327 m->private = fgd;
6328 } else {
6329 /* Failed */
6330 free_ftrace_hash(new_hash);
6331 new_hash = NULL;
6332 }
6333 } else
6334 file->private_data = fgd;
6335
6336out:
6337 if (ret < 0 && file->f_mode & FMODE_WRITE)
6338 trace_parser_put(&fgd->parser);
6339
6340 fgd->new_hash = new_hash;
6341
6342 /*
6343 * All uses of fgd->hash must be taken with the graph_lock
6344 * held. The graph_lock is going to be released, so force
6345 * fgd->hash to be reinitialized when it is taken again.
6346 */
6347 fgd->hash = NULL;
6348
6349 return ret;
6350}
6351
6352static int
6353ftrace_graph_open(struct inode *inode, struct file *file)
6354{
6355 struct ftrace_graph_data *fgd;
6356 int ret;
6357
6358 if (unlikely(ftrace_disabled))
6359 return -ENODEV;
6360
6361 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
6362 if (fgd == NULL)
6363 return -ENOMEM;
6364
6365 mutex_lock(&graph_lock);
6366
6367 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
6368 lockdep_is_held(&graph_lock));
6369 fgd->type = GRAPH_FILTER_FUNCTION;
6370 fgd->seq_ops = &ftrace_graph_seq_ops;
6371
6372 ret = __ftrace_graph_open(inode, file, fgd);
6373 if (ret < 0)
6374 kfree(fgd);
6375
6376 mutex_unlock(&graph_lock);
6377 return ret;
6378}
6379
6380static int
6381ftrace_graph_notrace_open(struct inode *inode, struct file *file)
6382{
6383 struct ftrace_graph_data *fgd;
6384 int ret;
6385
6386 if (unlikely(ftrace_disabled))
6387 return -ENODEV;
6388
6389 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
6390 if (fgd == NULL)
6391 return -ENOMEM;
6392
6393 mutex_lock(&graph_lock);
6394
6395 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
6396 lockdep_is_held(&graph_lock));
6397 fgd->type = GRAPH_FILTER_NOTRACE;
6398 fgd->seq_ops = &ftrace_graph_seq_ops;
6399
6400 ret = __ftrace_graph_open(inode, file, fgd);
6401 if (ret < 0)
6402 kfree(fgd);
6403
6404 mutex_unlock(&graph_lock);
6405 return ret;
6406}
6407
6408static int
6409ftrace_graph_release(struct inode *inode, struct file *file)
6410{
6411 struct ftrace_graph_data *fgd;
6412 struct ftrace_hash *old_hash, *new_hash;
6413 struct trace_parser *parser;
6414 int ret = 0;
6415
6416 if (file->f_mode & FMODE_READ) {
6417 struct seq_file *m = file->private_data;
6418
6419 fgd = m->private;
6420 seq_release(inode, file);
6421 } else {
6422 fgd = file->private_data;
6423 }
6424
6425
6426 if (file->f_mode & FMODE_WRITE) {
6427
6428 parser = &fgd->parser;
6429
6430 if (trace_parser_loaded((parser))) {
6431 ret = ftrace_graph_set_hash(fgd->new_hash,
6432 parser->buffer);
6433 }
6434
6435 trace_parser_put(parser);
6436
6437 new_hash = __ftrace_hash_move(fgd->new_hash);
6438 if (!new_hash) {
6439 ret = -ENOMEM;
6440 goto out;
6441 }
6442
6443 mutex_lock(&graph_lock);
6444
6445 if (fgd->type == GRAPH_FILTER_FUNCTION) {
6446 old_hash = rcu_dereference_protected(ftrace_graph_hash,
6447 lockdep_is_held(&graph_lock));
6448 rcu_assign_pointer(ftrace_graph_hash, new_hash);
6449 } else {
6450 old_hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
6451 lockdep_is_held(&graph_lock));
6452 rcu_assign_pointer(ftrace_graph_notrace_hash, new_hash);
6453 }
6454
6455 mutex_unlock(&graph_lock);
6456
6457 /*
6458 * We need to do a hard force of sched synchronization.
6459 * This is because we use preempt_disable() to do RCU, but
6460 * the function tracers can be called where RCU is not watching
6461 * (like before user_exit()). We can not rely on the RCU
6462 * infrastructure to do the synchronization, thus we must do it
6463 * ourselves.
6464 */
6465 if (old_hash != EMPTY_HASH)
6466 synchronize_rcu_tasks_rude();
6467
6468 free_ftrace_hash(old_hash);
6469 }
6470
6471 out:
6472 free_ftrace_hash(fgd->new_hash);
6473 kfree(fgd);
6474
6475 return ret;
6476}
6477
6478static int
6479ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer)
6480{
6481 struct ftrace_glob func_g;
6482 struct dyn_ftrace *rec;
6483 struct ftrace_page *pg;
6484 struct ftrace_func_entry *entry;
6485 int fail = 1;
6486 int not;
6487
6488 /* decode regex */
6489 func_g.type = filter_parse_regex(buffer, strlen(buffer),
6490 &func_g.search, ¬);
6491
6492 func_g.len = strlen(func_g.search);
6493
6494 mutex_lock(&ftrace_lock);
6495
6496 if (unlikely(ftrace_disabled)) {
6497 mutex_unlock(&ftrace_lock);
6498 return -ENODEV;
6499 }
6500
6501 do_for_each_ftrace_rec(pg, rec) {
6502
6503 if (rec->flags & FTRACE_FL_DISABLED)
6504 continue;
6505
6506 if (ftrace_match_record(rec, &func_g, NULL, 0)) {
6507 entry = ftrace_lookup_ip(hash, rec->ip);
6508
6509 if (!not) {
6510 fail = 0;
6511
6512 if (entry)
6513 continue;
6514 if (add_hash_entry(hash, rec->ip) < 0)
6515 goto out;
6516 } else {
6517 if (entry) {
6518 free_hash_entry(hash, entry);
6519 fail = 0;
6520 }
6521 }
6522 }
6523 } while_for_each_ftrace_rec();
6524out:
6525 mutex_unlock(&ftrace_lock);
6526
6527 if (fail)
6528 return -EINVAL;
6529
6530 return 0;
6531}
6532
6533static ssize_t
6534ftrace_graph_write(struct file *file, const char __user *ubuf,
6535 size_t cnt, loff_t *ppos)
6536{
6537 ssize_t read, ret = 0;
6538 struct ftrace_graph_data *fgd = file->private_data;
6539 struct trace_parser *parser;
6540
6541 if (!cnt)
6542 return 0;
6543
6544 /* Read mode uses seq functions */
6545 if (file->f_mode & FMODE_READ) {
6546 struct seq_file *m = file->private_data;
6547 fgd = m->private;
6548 }
6549
6550 parser = &fgd->parser;
6551
6552 read = trace_get_user(parser, ubuf, cnt, ppos);
6553
6554 if (read >= 0 && trace_parser_loaded(parser) &&
6555 !trace_parser_cont(parser)) {
6556
6557 ret = ftrace_graph_set_hash(fgd->new_hash,
6558 parser->buffer);
6559 trace_parser_clear(parser);
6560 }
6561
6562 if (!ret)
6563 ret = read;
6564
6565 return ret;
6566}
6567
6568static const struct file_operations ftrace_graph_fops = {
6569 .open = ftrace_graph_open,
6570 .read = seq_read,
6571 .write = ftrace_graph_write,
6572 .llseek = tracing_lseek,
6573 .release = ftrace_graph_release,
6574};
6575
6576static const struct file_operations ftrace_graph_notrace_fops = {
6577 .open = ftrace_graph_notrace_open,
6578 .read = seq_read,
6579 .write = ftrace_graph_write,
6580 .llseek = tracing_lseek,
6581 .release = ftrace_graph_release,
6582};
6583#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
6584
6585void ftrace_create_filter_files(struct ftrace_ops *ops,
6586 struct dentry *parent)
6587{
6588
6589 trace_create_file("set_ftrace_filter", TRACE_MODE_WRITE, parent,
6590 ops, &ftrace_filter_fops);
6591
6592 trace_create_file("set_ftrace_notrace", TRACE_MODE_WRITE, parent,
6593 ops, &ftrace_notrace_fops);
6594}
6595
6596/*
6597 * The name "destroy_filter_files" is really a misnomer. Although
6598 * in the future, it may actually delete the files, but this is
6599 * really intended to make sure the ops passed in are disabled
6600 * and that when this function returns, the caller is free to
6601 * free the ops.
6602 *
6603 * The "destroy" name is only to match the "create" name that this
6604 * should be paired with.
6605 */
6606void ftrace_destroy_filter_files(struct ftrace_ops *ops)
6607{
6608 mutex_lock(&ftrace_lock);
6609 if (ops->flags & FTRACE_OPS_FL_ENABLED)
6610 ftrace_shutdown(ops, 0);
6611 ops->flags |= FTRACE_OPS_FL_DELETED;
6612 ftrace_free_filter(ops);
6613 mutex_unlock(&ftrace_lock);
6614}
6615
6616static __init int ftrace_init_dyn_tracefs(struct dentry *d_tracer)
6617{
6618
6619 trace_create_file("available_filter_functions", TRACE_MODE_READ,
6620 d_tracer, NULL, &ftrace_avail_fops);
6621
6622 trace_create_file("enabled_functions", TRACE_MODE_READ,
6623 d_tracer, NULL, &ftrace_enabled_fops);
6624
6625 ftrace_create_filter_files(&global_ops, d_tracer);
6626
6627#ifdef CONFIG_FUNCTION_GRAPH_TRACER
6628 trace_create_file("set_graph_function", TRACE_MODE_WRITE, d_tracer,
6629 NULL,
6630 &ftrace_graph_fops);
6631 trace_create_file("set_graph_notrace", TRACE_MODE_WRITE, d_tracer,
6632 NULL,
6633 &ftrace_graph_notrace_fops);
6634#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
6635
6636 return 0;
6637}
6638
6639static int ftrace_cmp_ips(const void *a, const void *b)
6640{
6641 const unsigned long *ipa = a;
6642 const unsigned long *ipb = b;
6643
6644 if (*ipa > *ipb)
6645 return 1;
6646 if (*ipa < *ipb)
6647 return -1;
6648 return 0;
6649}
6650
6651#ifdef CONFIG_FTRACE_SORT_STARTUP_TEST
6652static void test_is_sorted(unsigned long *start, unsigned long count)
6653{
6654 int i;
6655
6656 for (i = 1; i < count; i++) {
6657 if (WARN(start[i - 1] > start[i],
6658 "[%d] %pS at %lx is not sorted with %pS at %lx\n", i,
6659 (void *)start[i - 1], start[i - 1],
6660 (void *)start[i], start[i]))
6661 break;
6662 }
6663 if (i == count)
6664 pr_info("ftrace section at %px sorted properly\n", start);
6665}
6666#else
6667static void test_is_sorted(unsigned long *start, unsigned long count)
6668{
6669}
6670#endif
6671
6672static int ftrace_process_locs(struct module *mod,
6673 unsigned long *start,
6674 unsigned long *end)
6675{
6676 struct ftrace_page *start_pg;
6677 struct ftrace_page *pg;
6678 struct dyn_ftrace *rec;
6679 unsigned long count;
6680 unsigned long *p;
6681 unsigned long addr;
6682 unsigned long flags = 0; /* Shut up gcc */
6683 int ret = -ENOMEM;
6684
6685 count = end - start;
6686
6687 if (!count)
6688 return 0;
6689
6690 /*
6691 * Sorting mcount in vmlinux at build time depend on
6692 * CONFIG_BUILDTIME_MCOUNT_SORT, while mcount loc in
6693 * modules can not be sorted at build time.
6694 */
6695 if (!IS_ENABLED(CONFIG_BUILDTIME_MCOUNT_SORT) || mod) {
6696 sort(start, count, sizeof(*start),
6697 ftrace_cmp_ips, NULL);
6698 } else {
6699 test_is_sorted(start, count);
6700 }
6701
6702 start_pg = ftrace_allocate_pages(count);
6703 if (!start_pg)
6704 return -ENOMEM;
6705
6706 mutex_lock(&ftrace_lock);
6707
6708 /*
6709 * Core and each module needs their own pages, as
6710 * modules will free them when they are removed.
6711 * Force a new page to be allocated for modules.
6712 */
6713 if (!mod) {
6714 WARN_ON(ftrace_pages || ftrace_pages_start);
6715 /* First initialization */
6716 ftrace_pages = ftrace_pages_start = start_pg;
6717 } else {
6718 if (!ftrace_pages)
6719 goto out;
6720
6721 if (WARN_ON(ftrace_pages->next)) {
6722 /* Hmm, we have free pages? */
6723 while (ftrace_pages->next)
6724 ftrace_pages = ftrace_pages->next;
6725 }
6726
6727 ftrace_pages->next = start_pg;
6728 }
6729
6730 p = start;
6731 pg = start_pg;
6732 while (p < end) {
6733 unsigned long end_offset;
6734 addr = ftrace_call_adjust(*p++);
6735 /*
6736 * Some architecture linkers will pad between
6737 * the different mcount_loc sections of different
6738 * object files to satisfy alignments.
6739 * Skip any NULL pointers.
6740 */
6741 if (!addr)
6742 continue;
6743
6744 end_offset = (pg->index+1) * sizeof(pg->records[0]);
6745 if (end_offset > PAGE_SIZE << pg->order) {
6746 /* We should have allocated enough */
6747 if (WARN_ON(!pg->next))
6748 break;
6749 pg = pg->next;
6750 }
6751
6752 rec = &pg->records[pg->index++];
6753 rec->ip = addr;
6754 }
6755
6756 /* We should have used all pages */
6757 WARN_ON(pg->next);
6758
6759 /* Assign the last page to ftrace_pages */
6760 ftrace_pages = pg;
6761
6762 /*
6763 * We only need to disable interrupts on start up
6764 * because we are modifying code that an interrupt
6765 * may execute, and the modification is not atomic.
6766 * But for modules, nothing runs the code we modify
6767 * until we are finished with it, and there's no
6768 * reason to cause large interrupt latencies while we do it.
6769 */
6770 if (!mod)
6771 local_irq_save(flags);
6772 ftrace_update_code(mod, start_pg);
6773 if (!mod)
6774 local_irq_restore(flags);
6775 ret = 0;
6776 out:
6777 mutex_unlock(&ftrace_lock);
6778
6779 return ret;
6780}
6781
6782struct ftrace_mod_func {
6783 struct list_head list;
6784 char *name;
6785 unsigned long ip;
6786 unsigned int size;
6787};
6788
6789struct ftrace_mod_map {
6790 struct rcu_head rcu;
6791 struct list_head list;
6792 struct module *mod;
6793 unsigned long start_addr;
6794 unsigned long end_addr;
6795 struct list_head funcs;
6796 unsigned int num_funcs;
6797};
6798
6799static int ftrace_get_trampoline_kallsym(unsigned int symnum,
6800 unsigned long *value, char *type,
6801 char *name, char *module_name,
6802 int *exported)
6803{
6804 struct ftrace_ops *op;
6805
6806 list_for_each_entry_rcu(op, &ftrace_ops_trampoline_list, list) {
6807 if (!op->trampoline || symnum--)
6808 continue;
6809 *value = op->trampoline;
6810 *type = 't';
6811 strlcpy(name, FTRACE_TRAMPOLINE_SYM, KSYM_NAME_LEN);
6812 strlcpy(module_name, FTRACE_TRAMPOLINE_MOD, MODULE_NAME_LEN);
6813 *exported = 0;
6814 return 0;
6815 }
6816
6817 return -ERANGE;
6818}
6819
6820#if defined(CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS) || defined(CONFIG_MODULES)
6821/*
6822 * Check if the current ops references the given ip.
6823 *
6824 * If the ops traces all functions, then it was already accounted for.
6825 * If the ops does not trace the current record function, skip it.
6826 * If the ops ignores the function via notrace filter, skip it.
6827 */
6828static bool
6829ops_references_ip(struct ftrace_ops *ops, unsigned long ip)
6830{
6831 /* If ops isn't enabled, ignore it */
6832 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
6833 return false;
6834
6835 /* If ops traces all then it includes this function */
6836 if (ops_traces_mod(ops))
6837 return true;
6838
6839 /* The function must be in the filter */
6840 if (!ftrace_hash_empty(ops->func_hash->filter_hash) &&
6841 !__ftrace_lookup_ip(ops->func_hash->filter_hash, ip))
6842 return false;
6843
6844 /* If in notrace hash, we ignore it too */
6845 if (ftrace_lookup_ip(ops->func_hash->notrace_hash, ip))
6846 return false;
6847
6848 return true;
6849}
6850#endif
6851
6852#ifdef CONFIG_MODULES
6853
6854#define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
6855
6856static LIST_HEAD(ftrace_mod_maps);
6857
6858static int referenced_filters(struct dyn_ftrace *rec)
6859{
6860 struct ftrace_ops *ops;
6861 int cnt = 0;
6862
6863 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
6864 if (ops_references_ip(ops, rec->ip)) {
6865 if (WARN_ON_ONCE(ops->flags & FTRACE_OPS_FL_DIRECT))
6866 continue;
6867 if (WARN_ON_ONCE(ops->flags & FTRACE_OPS_FL_IPMODIFY))
6868 continue;
6869 cnt++;
6870 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
6871 rec->flags |= FTRACE_FL_REGS;
6872 if (cnt == 1 && ops->trampoline)
6873 rec->flags |= FTRACE_FL_TRAMP;
6874 else
6875 rec->flags &= ~FTRACE_FL_TRAMP;
6876 }
6877 }
6878
6879 return cnt;
6880}
6881
6882static void
6883clear_mod_from_hash(struct ftrace_page *pg, struct ftrace_hash *hash)
6884{
6885 struct ftrace_func_entry *entry;
6886 struct dyn_ftrace *rec;
6887 int i;
6888
6889 if (ftrace_hash_empty(hash))
6890 return;
6891
6892 for (i = 0; i < pg->index; i++) {
6893 rec = &pg->records[i];
6894 entry = __ftrace_lookup_ip(hash, rec->ip);
6895 /*
6896 * Do not allow this rec to match again.
6897 * Yeah, it may waste some memory, but will be removed
6898 * if/when the hash is modified again.
6899 */
6900 if (entry)
6901 entry->ip = 0;
6902 }
6903}
6904
6905/* Clear any records from hashes */
6906static void clear_mod_from_hashes(struct ftrace_page *pg)
6907{
6908 struct trace_array *tr;
6909
6910 mutex_lock(&trace_types_lock);
6911 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
6912 if (!tr->ops || !tr->ops->func_hash)
6913 continue;
6914 mutex_lock(&tr->ops->func_hash->regex_lock);
6915 clear_mod_from_hash(pg, tr->ops->func_hash->filter_hash);
6916 clear_mod_from_hash(pg, tr->ops->func_hash->notrace_hash);
6917 mutex_unlock(&tr->ops->func_hash->regex_lock);
6918 }
6919 mutex_unlock(&trace_types_lock);
6920}
6921
6922static void ftrace_free_mod_map(struct rcu_head *rcu)
6923{
6924 struct ftrace_mod_map *mod_map = container_of(rcu, struct ftrace_mod_map, rcu);
6925 struct ftrace_mod_func *mod_func;
6926 struct ftrace_mod_func *n;
6927
6928 /* All the contents of mod_map are now not visible to readers */
6929 list_for_each_entry_safe(mod_func, n, &mod_map->funcs, list) {
6930 kfree(mod_func->name);
6931 list_del(&mod_func->list);
6932 kfree(mod_func);
6933 }
6934
6935 kfree(mod_map);
6936}
6937
6938void ftrace_release_mod(struct module *mod)
6939{
6940 struct ftrace_mod_map *mod_map;
6941 struct ftrace_mod_map *n;
6942 struct dyn_ftrace *rec;
6943 struct ftrace_page **last_pg;
6944 struct ftrace_page *tmp_page = NULL;
6945 struct ftrace_page *pg;
6946
6947 mutex_lock(&ftrace_lock);
6948
6949 if (ftrace_disabled)
6950 goto out_unlock;
6951
6952 list_for_each_entry_safe(mod_map, n, &ftrace_mod_maps, list) {
6953 if (mod_map->mod == mod) {
6954 list_del_rcu(&mod_map->list);
6955 call_rcu(&mod_map->rcu, ftrace_free_mod_map);
6956 break;
6957 }
6958 }
6959
6960 /*
6961 * Each module has its own ftrace_pages, remove
6962 * them from the list.
6963 */
6964 last_pg = &ftrace_pages_start;
6965 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
6966 rec = &pg->records[0];
6967 if (within_module_core(rec->ip, mod) ||
6968 within_module_init(rec->ip, mod)) {
6969 /*
6970 * As core pages are first, the first
6971 * page should never be a module page.
6972 */
6973 if (WARN_ON(pg == ftrace_pages_start))
6974 goto out_unlock;
6975
6976 /* Check if we are deleting the last page */
6977 if (pg == ftrace_pages)
6978 ftrace_pages = next_to_ftrace_page(last_pg);
6979
6980 ftrace_update_tot_cnt -= pg->index;
6981 *last_pg = pg->next;
6982
6983 pg->next = tmp_page;
6984 tmp_page = pg;
6985 } else
6986 last_pg = &pg->next;
6987 }
6988 out_unlock:
6989 mutex_unlock(&ftrace_lock);
6990
6991 for (pg = tmp_page; pg; pg = tmp_page) {
6992
6993 /* Needs to be called outside of ftrace_lock */
6994 clear_mod_from_hashes(pg);
6995
6996 if (pg->records) {
6997 free_pages((unsigned long)pg->records, pg->order);
6998 ftrace_number_of_pages -= 1 << pg->order;
6999 }
7000 tmp_page = pg->next;
7001 kfree(pg);
7002 ftrace_number_of_groups--;
7003 }
7004}
7005
7006void ftrace_module_enable(struct module *mod)
7007{
7008 struct dyn_ftrace *rec;
7009 struct ftrace_page *pg;
7010
7011 mutex_lock(&ftrace_lock);
7012
7013 if (ftrace_disabled)
7014 goto out_unlock;
7015
7016 /*
7017 * If the tracing is enabled, go ahead and enable the record.
7018 *
7019 * The reason not to enable the record immediately is the
7020 * inherent check of ftrace_make_nop/ftrace_make_call for
7021 * correct previous instructions. Making first the NOP
7022 * conversion puts the module to the correct state, thus
7023 * passing the ftrace_make_call check.
7024 *
7025 * We also delay this to after the module code already set the
7026 * text to read-only, as we now need to set it back to read-write
7027 * so that we can modify the text.
7028 */
7029 if (ftrace_start_up)
7030 ftrace_arch_code_modify_prepare();
7031
7032 do_for_each_ftrace_rec(pg, rec) {
7033 int cnt;
7034 /*
7035 * do_for_each_ftrace_rec() is a double loop.
7036 * module text shares the pg. If a record is
7037 * not part of this module, then skip this pg,
7038 * which the "break" will do.
7039 */
7040 if (!within_module_core(rec->ip, mod) &&
7041 !within_module_init(rec->ip, mod))
7042 break;
7043
7044 /* Weak functions should still be ignored */
7045 if (!test_for_valid_rec(rec)) {
7046 /* Clear all other flags. Should not be enabled anyway */
7047 rec->flags = FTRACE_FL_DISABLED;
7048 continue;
7049 }
7050
7051 cnt = 0;
7052
7053 /*
7054 * When adding a module, we need to check if tracers are
7055 * currently enabled and if they are, and can trace this record,
7056 * we need to enable the module functions as well as update the
7057 * reference counts for those function records.
7058 */
7059 if (ftrace_start_up)
7060 cnt += referenced_filters(rec);
7061
7062 rec->flags &= ~FTRACE_FL_DISABLED;
7063 rec->flags += cnt;
7064
7065 if (ftrace_start_up && cnt) {
7066 int failed = __ftrace_replace_code(rec, 1);
7067 if (failed) {
7068 ftrace_bug(failed, rec);
7069 goto out_loop;
7070 }
7071 }
7072
7073 } while_for_each_ftrace_rec();
7074
7075 out_loop:
7076 if (ftrace_start_up)
7077 ftrace_arch_code_modify_post_process();
7078
7079 out_unlock:
7080 mutex_unlock(&ftrace_lock);
7081
7082 process_cached_mods(mod->name);
7083}
7084
7085void ftrace_module_init(struct module *mod)
7086{
7087 int ret;
7088
7089 if (ftrace_disabled || !mod->num_ftrace_callsites)
7090 return;
7091
7092 ret = ftrace_process_locs(mod, mod->ftrace_callsites,
7093 mod->ftrace_callsites + mod->num_ftrace_callsites);
7094 if (ret)
7095 pr_warn("ftrace: failed to allocate entries for module '%s' functions\n",
7096 mod->name);
7097}
7098
7099static void save_ftrace_mod_rec(struct ftrace_mod_map *mod_map,
7100 struct dyn_ftrace *rec)
7101{
7102 struct ftrace_mod_func *mod_func;
7103 unsigned long symsize;
7104 unsigned long offset;
7105 char str[KSYM_SYMBOL_LEN];
7106 char *modname;
7107 const char *ret;
7108
7109 ret = kallsyms_lookup(rec->ip, &symsize, &offset, &modname, str);
7110 if (!ret)
7111 return;
7112
7113 mod_func = kmalloc(sizeof(*mod_func), GFP_KERNEL);
7114 if (!mod_func)
7115 return;
7116
7117 mod_func->name = kstrdup(str, GFP_KERNEL);
7118 if (!mod_func->name) {
7119 kfree(mod_func);
7120 return;
7121 }
7122
7123 mod_func->ip = rec->ip - offset;
7124 mod_func->size = symsize;
7125
7126 mod_map->num_funcs++;
7127
7128 list_add_rcu(&mod_func->list, &mod_map->funcs);
7129}
7130
7131static struct ftrace_mod_map *
7132allocate_ftrace_mod_map(struct module *mod,
7133 unsigned long start, unsigned long end)
7134{
7135 struct ftrace_mod_map *mod_map;
7136
7137 mod_map = kmalloc(sizeof(*mod_map), GFP_KERNEL);
7138 if (!mod_map)
7139 return NULL;
7140
7141 mod_map->mod = mod;
7142 mod_map->start_addr = start;
7143 mod_map->end_addr = end;
7144 mod_map->num_funcs = 0;
7145
7146 INIT_LIST_HEAD_RCU(&mod_map->funcs);
7147
7148 list_add_rcu(&mod_map->list, &ftrace_mod_maps);
7149
7150 return mod_map;
7151}
7152
7153static const char *
7154ftrace_func_address_lookup(struct ftrace_mod_map *mod_map,
7155 unsigned long addr, unsigned long *size,
7156 unsigned long *off, char *sym)
7157{
7158 struct ftrace_mod_func *found_func = NULL;
7159 struct ftrace_mod_func *mod_func;
7160
7161 list_for_each_entry_rcu(mod_func, &mod_map->funcs, list) {
7162 if (addr >= mod_func->ip &&
7163 addr < mod_func->ip + mod_func->size) {
7164 found_func = mod_func;
7165 break;
7166 }
7167 }
7168
7169 if (found_func) {
7170 if (size)
7171 *size = found_func->size;
7172 if (off)
7173 *off = addr - found_func->ip;
7174 if (sym)
7175 strlcpy(sym, found_func->name, KSYM_NAME_LEN);
7176
7177 return found_func->name;
7178 }
7179
7180 return NULL;
7181}
7182
7183const char *
7184ftrace_mod_address_lookup(unsigned long addr, unsigned long *size,
7185 unsigned long *off, char **modname, char *sym)
7186{
7187 struct ftrace_mod_map *mod_map;
7188 const char *ret = NULL;
7189
7190 /* mod_map is freed via call_rcu() */
7191 preempt_disable();
7192 list_for_each_entry_rcu(mod_map, &ftrace_mod_maps, list) {
7193 ret = ftrace_func_address_lookup(mod_map, addr, size, off, sym);
7194 if (ret) {
7195 if (modname)
7196 *modname = mod_map->mod->name;
7197 break;
7198 }
7199 }
7200 preempt_enable();
7201
7202 return ret;
7203}
7204
7205int ftrace_mod_get_kallsym(unsigned int symnum, unsigned long *value,
7206 char *type, char *name,
7207 char *module_name, int *exported)
7208{
7209 struct ftrace_mod_map *mod_map;
7210 struct ftrace_mod_func *mod_func;
7211 int ret;
7212
7213 preempt_disable();
7214 list_for_each_entry_rcu(mod_map, &ftrace_mod_maps, list) {
7215
7216 if (symnum >= mod_map->num_funcs) {
7217 symnum -= mod_map->num_funcs;
7218 continue;
7219 }
7220
7221 list_for_each_entry_rcu(mod_func, &mod_map->funcs, list) {
7222 if (symnum > 1) {
7223 symnum--;
7224 continue;
7225 }
7226
7227 *value = mod_func->ip;
7228 *type = 'T';
7229 strlcpy(name, mod_func->name, KSYM_NAME_LEN);
7230 strlcpy(module_name, mod_map->mod->name, MODULE_NAME_LEN);
7231 *exported = 1;
7232 preempt_enable();
7233 return 0;
7234 }
7235 WARN_ON(1);
7236 break;
7237 }
7238 ret = ftrace_get_trampoline_kallsym(symnum, value, type, name,
7239 module_name, exported);
7240 preempt_enable();
7241 return ret;
7242}
7243
7244#else
7245static void save_ftrace_mod_rec(struct ftrace_mod_map *mod_map,
7246 struct dyn_ftrace *rec) { }
7247static inline struct ftrace_mod_map *
7248allocate_ftrace_mod_map(struct module *mod,
7249 unsigned long start, unsigned long end)
7250{
7251 return NULL;
7252}
7253int ftrace_mod_get_kallsym(unsigned int symnum, unsigned long *value,
7254 char *type, char *name, char *module_name,
7255 int *exported)
7256{
7257 int ret;
7258
7259 preempt_disable();
7260 ret = ftrace_get_trampoline_kallsym(symnum, value, type, name,
7261 module_name, exported);
7262 preempt_enable();
7263 return ret;
7264}
7265#endif /* CONFIG_MODULES */
7266
7267struct ftrace_init_func {
7268 struct list_head list;
7269 unsigned long ip;
7270};
7271
7272/* Clear any init ips from hashes */
7273static void
7274clear_func_from_hash(struct ftrace_init_func *func, struct ftrace_hash *hash)
7275{
7276 struct ftrace_func_entry *entry;
7277
7278 entry = ftrace_lookup_ip(hash, func->ip);
7279 /*
7280 * Do not allow this rec to match again.
7281 * Yeah, it may waste some memory, but will be removed
7282 * if/when the hash is modified again.
7283 */
7284 if (entry)
7285 entry->ip = 0;
7286}
7287
7288static void
7289clear_func_from_hashes(struct ftrace_init_func *func)
7290{
7291 struct trace_array *tr;
7292
7293 mutex_lock(&trace_types_lock);
7294 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
7295 if (!tr->ops || !tr->ops->func_hash)
7296 continue;
7297 mutex_lock(&tr->ops->func_hash->regex_lock);
7298 clear_func_from_hash(func, tr->ops->func_hash->filter_hash);
7299 clear_func_from_hash(func, tr->ops->func_hash->notrace_hash);
7300 mutex_unlock(&tr->ops->func_hash->regex_lock);
7301 }
7302 mutex_unlock(&trace_types_lock);
7303}
7304
7305static void add_to_clear_hash_list(struct list_head *clear_list,
7306 struct dyn_ftrace *rec)
7307{
7308 struct ftrace_init_func *func;
7309
7310 func = kmalloc(sizeof(*func), GFP_KERNEL);
7311 if (!func) {
7312 MEM_FAIL(1, "alloc failure, ftrace filter could be stale\n");
7313 return;
7314 }
7315
7316 func->ip = rec->ip;
7317 list_add(&func->list, clear_list);
7318}
7319
7320void ftrace_free_mem(struct module *mod, void *start_ptr, void *end_ptr)
7321{
7322 unsigned long start = (unsigned long)(start_ptr);
7323 unsigned long end = (unsigned long)(end_ptr);
7324 struct ftrace_page **last_pg = &ftrace_pages_start;
7325 struct ftrace_page *pg;
7326 struct dyn_ftrace *rec;
7327 struct dyn_ftrace key;
7328 struct ftrace_mod_map *mod_map = NULL;
7329 struct ftrace_init_func *func, *func_next;
7330 struct list_head clear_hash;
7331
7332 INIT_LIST_HEAD(&clear_hash);
7333
7334 key.ip = start;
7335 key.flags = end; /* overload flags, as it is unsigned long */
7336
7337 mutex_lock(&ftrace_lock);
7338
7339 /*
7340 * If we are freeing module init memory, then check if
7341 * any tracer is active. If so, we need to save a mapping of
7342 * the module functions being freed with the address.
7343 */
7344 if (mod && ftrace_ops_list != &ftrace_list_end)
7345 mod_map = allocate_ftrace_mod_map(mod, start, end);
7346
7347 for (pg = ftrace_pages_start; pg; last_pg = &pg->next, pg = *last_pg) {
7348 if (end < pg->records[0].ip ||
7349 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
7350 continue;
7351 again:
7352 rec = bsearch(&key, pg->records, pg->index,
7353 sizeof(struct dyn_ftrace),
7354 ftrace_cmp_recs);
7355 if (!rec)
7356 continue;
7357
7358 /* rec will be cleared from hashes after ftrace_lock unlock */
7359 add_to_clear_hash_list(&clear_hash, rec);
7360
7361 if (mod_map)
7362 save_ftrace_mod_rec(mod_map, rec);
7363
7364 pg->index--;
7365 ftrace_update_tot_cnt--;
7366 if (!pg->index) {
7367 *last_pg = pg->next;
7368 if (pg->records) {
7369 free_pages((unsigned long)pg->records, pg->order);
7370 ftrace_number_of_pages -= 1 << pg->order;
7371 }
7372 ftrace_number_of_groups--;
7373 kfree(pg);
7374 pg = container_of(last_pg, struct ftrace_page, next);
7375 if (!(*last_pg))
7376 ftrace_pages = pg;
7377 continue;
7378 }
7379 memmove(rec, rec + 1,
7380 (pg->index - (rec - pg->records)) * sizeof(*rec));
7381 /* More than one function may be in this block */
7382 goto again;
7383 }
7384 mutex_unlock(&ftrace_lock);
7385
7386 list_for_each_entry_safe(func, func_next, &clear_hash, list) {
7387 clear_func_from_hashes(func);
7388 kfree(func);
7389 }
7390}
7391
7392void __init ftrace_free_init_mem(void)
7393{
7394 void *start = (void *)(&__init_begin);
7395 void *end = (void *)(&__init_end);
7396
7397 ftrace_boot_snapshot();
7398
7399 ftrace_free_mem(NULL, start, end);
7400}
7401
7402int __init __weak ftrace_dyn_arch_init(void)
7403{
7404 return 0;
7405}
7406
7407void __init ftrace_init(void)
7408{
7409 extern unsigned long __start_mcount_loc[];
7410 extern unsigned long __stop_mcount_loc[];
7411 unsigned long count, flags;
7412 int ret;
7413
7414 local_irq_save(flags);
7415 ret = ftrace_dyn_arch_init();
7416 local_irq_restore(flags);
7417 if (ret)
7418 goto failed;
7419
7420 count = __stop_mcount_loc - __start_mcount_loc;
7421 if (!count) {
7422 pr_info("ftrace: No functions to be traced?\n");
7423 goto failed;
7424 }
7425
7426 pr_info("ftrace: allocating %ld entries in %ld pages\n",
7427 count, DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
7428
7429 ret = ftrace_process_locs(NULL,
7430 __start_mcount_loc,
7431 __stop_mcount_loc);
7432 if (ret) {
7433 pr_warn("ftrace: failed to allocate entries for functions\n");
7434 goto failed;
7435 }
7436
7437 pr_info("ftrace: allocated %ld pages with %ld groups\n",
7438 ftrace_number_of_pages, ftrace_number_of_groups);
7439
7440 last_ftrace_enabled = ftrace_enabled = 1;
7441
7442 set_ftrace_early_filters();
7443
7444 return;
7445 failed:
7446 ftrace_disabled = 1;
7447}
7448
7449/* Do nothing if arch does not support this */
7450void __weak arch_ftrace_update_trampoline(struct ftrace_ops *ops)
7451{
7452}
7453
7454static void ftrace_update_trampoline(struct ftrace_ops *ops)
7455{
7456 unsigned long trampoline = ops->trampoline;
7457
7458 arch_ftrace_update_trampoline(ops);
7459 if (ops->trampoline && ops->trampoline != trampoline &&
7460 (ops->flags & FTRACE_OPS_FL_ALLOC_TRAMP)) {
7461 /* Add to kallsyms before the perf events */
7462 ftrace_add_trampoline_to_kallsyms(ops);
7463 perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL,
7464 ops->trampoline, ops->trampoline_size, false,
7465 FTRACE_TRAMPOLINE_SYM);
7466 /*
7467 * Record the perf text poke event after the ksymbol register
7468 * event.
7469 */
7470 perf_event_text_poke((void *)ops->trampoline, NULL, 0,
7471 (void *)ops->trampoline,
7472 ops->trampoline_size);
7473 }
7474}
7475
7476void ftrace_init_trace_array(struct trace_array *tr)
7477{
7478 INIT_LIST_HEAD(&tr->func_probes);
7479 INIT_LIST_HEAD(&tr->mod_trace);
7480 INIT_LIST_HEAD(&tr->mod_notrace);
7481}
7482#else
7483
7484struct ftrace_ops global_ops = {
7485 .func = ftrace_stub,
7486 .flags = FTRACE_OPS_FL_INITIALIZED |
7487 FTRACE_OPS_FL_PID,
7488};
7489
7490static int __init ftrace_nodyn_init(void)
7491{
7492 ftrace_enabled = 1;
7493 return 0;
7494}
7495core_initcall(ftrace_nodyn_init);
7496
7497static inline int ftrace_init_dyn_tracefs(struct dentry *d_tracer) { return 0; }
7498static inline void ftrace_startup_all(int command) { }
7499
7500static void ftrace_update_trampoline(struct ftrace_ops *ops)
7501{
7502}
7503
7504#endif /* CONFIG_DYNAMIC_FTRACE */
7505
7506__init void ftrace_init_global_array_ops(struct trace_array *tr)
7507{
7508 tr->ops = &global_ops;
7509 tr->ops->private = tr;
7510 ftrace_init_trace_array(tr);
7511}
7512
7513void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
7514{
7515 /* If we filter on pids, update to use the pid function */
7516 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
7517 if (WARN_ON(tr->ops->func != ftrace_stub))
7518 printk("ftrace ops had %pS for function\n",
7519 tr->ops->func);
7520 }
7521 tr->ops->func = func;
7522 tr->ops->private = tr;
7523}
7524
7525void ftrace_reset_array_ops(struct trace_array *tr)
7526{
7527 tr->ops->func = ftrace_stub;
7528}
7529
7530static nokprobe_inline void
7531__ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
7532 struct ftrace_ops *ignored, struct ftrace_regs *fregs)
7533{
7534 struct pt_regs *regs = ftrace_get_regs(fregs);
7535 struct ftrace_ops *op;
7536 int bit;
7537
7538 /*
7539 * The ftrace_test_and_set_recursion() will disable preemption,
7540 * which is required since some of the ops may be dynamically
7541 * allocated, they must be freed after a synchronize_rcu().
7542 */
7543 bit = trace_test_and_set_recursion(ip, parent_ip, TRACE_LIST_START);
7544 if (bit < 0)
7545 return;
7546
7547 do_for_each_ftrace_op(op, ftrace_ops_list) {
7548 /* Stub functions don't need to be called nor tested */
7549 if (op->flags & FTRACE_OPS_FL_STUB)
7550 continue;
7551 /*
7552 * Check the following for each ops before calling their func:
7553 * if RCU flag is set, then rcu_is_watching() must be true
7554 * Otherwise test if the ip matches the ops filter
7555 *
7556 * If any of the above fails then the op->func() is not executed.
7557 */
7558 if ((!(op->flags & FTRACE_OPS_FL_RCU) || rcu_is_watching()) &&
7559 ftrace_ops_test(op, ip, regs)) {
7560 if (FTRACE_WARN_ON(!op->func)) {
7561 pr_warn("op=%p %pS\n", op, op);
7562 goto out;
7563 }
7564 op->func(ip, parent_ip, op, fregs);
7565 }
7566 } while_for_each_ftrace_op(op);
7567out:
7568 trace_clear_recursion(bit);
7569}
7570
7571/*
7572 * Some archs only support passing ip and parent_ip. Even though
7573 * the list function ignores the op parameter, we do not want any
7574 * C side effects, where a function is called without the caller
7575 * sending a third parameter.
7576 * Archs are to support both the regs and ftrace_ops at the same time.
7577 * If they support ftrace_ops, it is assumed they support regs.
7578 * If call backs want to use regs, they must either check for regs
7579 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
7580 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
7581 * An architecture can pass partial regs with ftrace_ops and still
7582 * set the ARCH_SUPPORTS_FTRACE_OPS.
7583 *
7584 * In vmlinux.lds.h, ftrace_ops_list_func() is defined to be
7585 * arch_ftrace_ops_list_func.
7586 */
7587#if ARCH_SUPPORTS_FTRACE_OPS
7588void arch_ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
7589 struct ftrace_ops *op, struct ftrace_regs *fregs)
7590{
7591 __ftrace_ops_list_func(ip, parent_ip, NULL, fregs);
7592}
7593#else
7594void arch_ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip)
7595{
7596 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
7597}
7598#endif
7599NOKPROBE_SYMBOL(arch_ftrace_ops_list_func);
7600
7601/*
7602 * If there's only one function registered but it does not support
7603 * recursion, needs RCU protection, then this function will be called
7604 * by the mcount trampoline.
7605 */
7606static void ftrace_ops_assist_func(unsigned long ip, unsigned long parent_ip,
7607 struct ftrace_ops *op, struct ftrace_regs *fregs)
7608{
7609 int bit;
7610
7611 bit = trace_test_and_set_recursion(ip, parent_ip, TRACE_LIST_START);
7612 if (bit < 0)
7613 return;
7614
7615 if (!(op->flags & FTRACE_OPS_FL_RCU) || rcu_is_watching())
7616 op->func(ip, parent_ip, op, fregs);
7617
7618 trace_clear_recursion(bit);
7619}
7620NOKPROBE_SYMBOL(ftrace_ops_assist_func);
7621
7622/**
7623 * ftrace_ops_get_func - get the function a trampoline should call
7624 * @ops: the ops to get the function for
7625 *
7626 * Normally the mcount trampoline will call the ops->func, but there
7627 * are times that it should not. For example, if the ops does not
7628 * have its own recursion protection, then it should call the
7629 * ftrace_ops_assist_func() instead.
7630 *
7631 * Returns the function that the trampoline should call for @ops.
7632 */
7633ftrace_func_t ftrace_ops_get_func(struct ftrace_ops *ops)
7634{
7635 /*
7636 * If the function does not handle recursion or needs to be RCU safe,
7637 * then we need to call the assist handler.
7638 */
7639 if (ops->flags & (FTRACE_OPS_FL_RECURSION |
7640 FTRACE_OPS_FL_RCU))
7641 return ftrace_ops_assist_func;
7642
7643 return ops->func;
7644}
7645
7646static void
7647ftrace_filter_pid_sched_switch_probe(void *data, bool preempt,
7648 struct task_struct *prev,
7649 struct task_struct *next,
7650 unsigned int prev_state)
7651{
7652 struct trace_array *tr = data;
7653 struct trace_pid_list *pid_list;
7654 struct trace_pid_list *no_pid_list;
7655
7656 pid_list = rcu_dereference_sched(tr->function_pids);
7657 no_pid_list = rcu_dereference_sched(tr->function_no_pids);
7658
7659 if (trace_ignore_this_task(pid_list, no_pid_list, next))
7660 this_cpu_write(tr->array_buffer.data->ftrace_ignore_pid,
7661 FTRACE_PID_IGNORE);
7662 else
7663 this_cpu_write(tr->array_buffer.data->ftrace_ignore_pid,
7664 next->pid);
7665}
7666
7667static void
7668ftrace_pid_follow_sched_process_fork(void *data,
7669 struct task_struct *self,
7670 struct task_struct *task)
7671{
7672 struct trace_pid_list *pid_list;
7673 struct trace_array *tr = data;
7674
7675 pid_list = rcu_dereference_sched(tr->function_pids);
7676 trace_filter_add_remove_task(pid_list, self, task);
7677
7678 pid_list = rcu_dereference_sched(tr->function_no_pids);
7679 trace_filter_add_remove_task(pid_list, self, task);
7680}
7681
7682static void
7683ftrace_pid_follow_sched_process_exit(void *data, struct task_struct *task)
7684{
7685 struct trace_pid_list *pid_list;
7686 struct trace_array *tr = data;
7687
7688 pid_list = rcu_dereference_sched(tr->function_pids);
7689 trace_filter_add_remove_task(pid_list, NULL, task);
7690
7691 pid_list = rcu_dereference_sched(tr->function_no_pids);
7692 trace_filter_add_remove_task(pid_list, NULL, task);
7693}
7694
7695void ftrace_pid_follow_fork(struct trace_array *tr, bool enable)
7696{
7697 if (enable) {
7698 register_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
7699 tr);
7700 register_trace_sched_process_free(ftrace_pid_follow_sched_process_exit,
7701 tr);
7702 } else {
7703 unregister_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
7704 tr);
7705 unregister_trace_sched_process_free(ftrace_pid_follow_sched_process_exit,
7706 tr);
7707 }
7708}
7709
7710static void clear_ftrace_pids(struct trace_array *tr, int type)
7711{
7712 struct trace_pid_list *pid_list;
7713 struct trace_pid_list *no_pid_list;
7714 int cpu;
7715
7716 pid_list = rcu_dereference_protected(tr->function_pids,
7717 lockdep_is_held(&ftrace_lock));
7718 no_pid_list = rcu_dereference_protected(tr->function_no_pids,
7719 lockdep_is_held(&ftrace_lock));
7720
7721 /* Make sure there's something to do */
7722 if (!pid_type_enabled(type, pid_list, no_pid_list))
7723 return;
7724
7725 /* See if the pids still need to be checked after this */
7726 if (!still_need_pid_events(type, pid_list, no_pid_list)) {
7727 unregister_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
7728 for_each_possible_cpu(cpu)
7729 per_cpu_ptr(tr->array_buffer.data, cpu)->ftrace_ignore_pid = FTRACE_PID_TRACE;
7730 }
7731
7732 if (type & TRACE_PIDS)
7733 rcu_assign_pointer(tr->function_pids, NULL);
7734
7735 if (type & TRACE_NO_PIDS)
7736 rcu_assign_pointer(tr->function_no_pids, NULL);
7737
7738 /* Wait till all users are no longer using pid filtering */
7739 synchronize_rcu();
7740
7741 if ((type & TRACE_PIDS) && pid_list)
7742 trace_pid_list_free(pid_list);
7743
7744 if ((type & TRACE_NO_PIDS) && no_pid_list)
7745 trace_pid_list_free(no_pid_list);
7746}
7747
7748void ftrace_clear_pids(struct trace_array *tr)
7749{
7750 mutex_lock(&ftrace_lock);
7751
7752 clear_ftrace_pids(tr, TRACE_PIDS | TRACE_NO_PIDS);
7753
7754 mutex_unlock(&ftrace_lock);
7755}
7756
7757static void ftrace_pid_reset(struct trace_array *tr, int type)
7758{
7759 mutex_lock(&ftrace_lock);
7760 clear_ftrace_pids(tr, type);
7761
7762 ftrace_update_pid_func();
7763 ftrace_startup_all(0);
7764
7765 mutex_unlock(&ftrace_lock);
7766}
7767
7768/* Greater than any max PID */
7769#define FTRACE_NO_PIDS (void *)(PID_MAX_LIMIT + 1)
7770
7771static void *fpid_start(struct seq_file *m, loff_t *pos)
7772 __acquires(RCU)
7773{
7774 struct trace_pid_list *pid_list;
7775 struct trace_array *tr = m->private;
7776
7777 mutex_lock(&ftrace_lock);
7778 rcu_read_lock_sched();
7779
7780 pid_list = rcu_dereference_sched(tr->function_pids);
7781
7782 if (!pid_list)
7783 return !(*pos) ? FTRACE_NO_PIDS : NULL;
7784
7785 return trace_pid_start(pid_list, pos);
7786}
7787
7788static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
7789{
7790 struct trace_array *tr = m->private;
7791 struct trace_pid_list *pid_list = rcu_dereference_sched(tr->function_pids);
7792
7793 if (v == FTRACE_NO_PIDS) {
7794 (*pos)++;
7795 return NULL;
7796 }
7797 return trace_pid_next(pid_list, v, pos);
7798}
7799
7800static void fpid_stop(struct seq_file *m, void *p)
7801 __releases(RCU)
7802{
7803 rcu_read_unlock_sched();
7804 mutex_unlock(&ftrace_lock);
7805}
7806
7807static int fpid_show(struct seq_file *m, void *v)
7808{
7809 if (v == FTRACE_NO_PIDS) {
7810 seq_puts(m, "no pid\n");
7811 return 0;
7812 }
7813
7814 return trace_pid_show(m, v);
7815}
7816
7817static const struct seq_operations ftrace_pid_sops = {
7818 .start = fpid_start,
7819 .next = fpid_next,
7820 .stop = fpid_stop,
7821 .show = fpid_show,
7822};
7823
7824static void *fnpid_start(struct seq_file *m, loff_t *pos)
7825 __acquires(RCU)
7826{
7827 struct trace_pid_list *pid_list;
7828 struct trace_array *tr = m->private;
7829
7830 mutex_lock(&ftrace_lock);
7831 rcu_read_lock_sched();
7832
7833 pid_list = rcu_dereference_sched(tr->function_no_pids);
7834
7835 if (!pid_list)
7836 return !(*pos) ? FTRACE_NO_PIDS : NULL;
7837
7838 return trace_pid_start(pid_list, pos);
7839}
7840
7841static void *fnpid_next(struct seq_file *m, void *v, loff_t *pos)
7842{
7843 struct trace_array *tr = m->private;
7844 struct trace_pid_list *pid_list = rcu_dereference_sched(tr->function_no_pids);
7845
7846 if (v == FTRACE_NO_PIDS) {
7847 (*pos)++;
7848 return NULL;
7849 }
7850 return trace_pid_next(pid_list, v, pos);
7851}
7852
7853static const struct seq_operations ftrace_no_pid_sops = {
7854 .start = fnpid_start,
7855 .next = fnpid_next,
7856 .stop = fpid_stop,
7857 .show = fpid_show,
7858};
7859
7860static int pid_open(struct inode *inode, struct file *file, int type)
7861{
7862 const struct seq_operations *seq_ops;
7863 struct trace_array *tr = inode->i_private;
7864 struct seq_file *m;
7865 int ret = 0;
7866
7867 ret = tracing_check_open_get_tr(tr);
7868 if (ret)
7869 return ret;
7870
7871 if ((file->f_mode & FMODE_WRITE) &&
7872 (file->f_flags & O_TRUNC))
7873 ftrace_pid_reset(tr, type);
7874
7875 switch (type) {
7876 case TRACE_PIDS:
7877 seq_ops = &ftrace_pid_sops;
7878 break;
7879 case TRACE_NO_PIDS:
7880 seq_ops = &ftrace_no_pid_sops;
7881 break;
7882 default:
7883 trace_array_put(tr);
7884 WARN_ON_ONCE(1);
7885 return -EINVAL;
7886 }
7887
7888 ret = seq_open(file, seq_ops);
7889 if (ret < 0) {
7890 trace_array_put(tr);
7891 } else {
7892 m = file->private_data;
7893 /* copy tr over to seq ops */
7894 m->private = tr;
7895 }
7896
7897 return ret;
7898}
7899
7900static int
7901ftrace_pid_open(struct inode *inode, struct file *file)
7902{
7903 return pid_open(inode, file, TRACE_PIDS);
7904}
7905
7906static int
7907ftrace_no_pid_open(struct inode *inode, struct file *file)
7908{
7909 return pid_open(inode, file, TRACE_NO_PIDS);
7910}
7911
7912static void ignore_task_cpu(void *data)
7913{
7914 struct trace_array *tr = data;
7915 struct trace_pid_list *pid_list;
7916 struct trace_pid_list *no_pid_list;
7917
7918 /*
7919 * This function is called by on_each_cpu() while the
7920 * event_mutex is held.
7921 */
7922 pid_list = rcu_dereference_protected(tr->function_pids,
7923 mutex_is_locked(&ftrace_lock));
7924 no_pid_list = rcu_dereference_protected(tr->function_no_pids,
7925 mutex_is_locked(&ftrace_lock));
7926
7927 if (trace_ignore_this_task(pid_list, no_pid_list, current))
7928 this_cpu_write(tr->array_buffer.data->ftrace_ignore_pid,
7929 FTRACE_PID_IGNORE);
7930 else
7931 this_cpu_write(tr->array_buffer.data->ftrace_ignore_pid,
7932 current->pid);
7933}
7934
7935static ssize_t
7936pid_write(struct file *filp, const char __user *ubuf,
7937 size_t cnt, loff_t *ppos, int type)
7938{
7939 struct seq_file *m = filp->private_data;
7940 struct trace_array *tr = m->private;
7941 struct trace_pid_list *filtered_pids;
7942 struct trace_pid_list *other_pids;
7943 struct trace_pid_list *pid_list;
7944 ssize_t ret;
7945
7946 if (!cnt)
7947 return 0;
7948
7949 mutex_lock(&ftrace_lock);
7950
7951 switch (type) {
7952 case TRACE_PIDS:
7953 filtered_pids = rcu_dereference_protected(tr->function_pids,
7954 lockdep_is_held(&ftrace_lock));
7955 other_pids = rcu_dereference_protected(tr->function_no_pids,
7956 lockdep_is_held(&ftrace_lock));
7957 break;
7958 case TRACE_NO_PIDS:
7959 filtered_pids = rcu_dereference_protected(tr->function_no_pids,
7960 lockdep_is_held(&ftrace_lock));
7961 other_pids = rcu_dereference_protected(tr->function_pids,
7962 lockdep_is_held(&ftrace_lock));
7963 break;
7964 default:
7965 ret = -EINVAL;
7966 WARN_ON_ONCE(1);
7967 goto out;
7968 }
7969
7970 ret = trace_pid_write(filtered_pids, &pid_list, ubuf, cnt);
7971 if (ret < 0)
7972 goto out;
7973
7974 switch (type) {
7975 case TRACE_PIDS:
7976 rcu_assign_pointer(tr->function_pids, pid_list);
7977 break;
7978 case TRACE_NO_PIDS:
7979 rcu_assign_pointer(tr->function_no_pids, pid_list);
7980 break;
7981 }
7982
7983
7984 if (filtered_pids) {
7985 synchronize_rcu();
7986 trace_pid_list_free(filtered_pids);
7987 } else if (pid_list && !other_pids) {
7988 /* Register a probe to set whether to ignore the tracing of a task */
7989 register_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
7990 }
7991
7992 /*
7993 * Ignoring of pids is done at task switch. But we have to
7994 * check for those tasks that are currently running.
7995 * Always do this in case a pid was appended or removed.
7996 */
7997 on_each_cpu(ignore_task_cpu, tr, 1);
7998
7999 ftrace_update_pid_func();
8000 ftrace_startup_all(0);
8001 out:
8002 mutex_unlock(&ftrace_lock);
8003
8004 if (ret > 0)
8005 *ppos += ret;
8006
8007 return ret;
8008}
8009
8010static ssize_t
8011ftrace_pid_write(struct file *filp, const char __user *ubuf,
8012 size_t cnt, loff_t *ppos)
8013{
8014 return pid_write(filp, ubuf, cnt, ppos, TRACE_PIDS);
8015}
8016
8017static ssize_t
8018ftrace_no_pid_write(struct file *filp, const char __user *ubuf,
8019 size_t cnt, loff_t *ppos)
8020{
8021 return pid_write(filp, ubuf, cnt, ppos, TRACE_NO_PIDS);
8022}
8023
8024static int
8025ftrace_pid_release(struct inode *inode, struct file *file)
8026{
8027 struct trace_array *tr = inode->i_private;
8028
8029 trace_array_put(tr);
8030
8031 return seq_release(inode, file);
8032}
8033
8034static const struct file_operations ftrace_pid_fops = {
8035 .open = ftrace_pid_open,
8036 .write = ftrace_pid_write,
8037 .read = seq_read,
8038 .llseek = tracing_lseek,
8039 .release = ftrace_pid_release,
8040};
8041
8042static const struct file_operations ftrace_no_pid_fops = {
8043 .open = ftrace_no_pid_open,
8044 .write = ftrace_no_pid_write,
8045 .read = seq_read,
8046 .llseek = tracing_lseek,
8047 .release = ftrace_pid_release,
8048};
8049
8050void ftrace_init_tracefs(struct trace_array *tr, struct dentry *d_tracer)
8051{
8052 trace_create_file("set_ftrace_pid", TRACE_MODE_WRITE, d_tracer,
8053 tr, &ftrace_pid_fops);
8054 trace_create_file("set_ftrace_notrace_pid", TRACE_MODE_WRITE,
8055 d_tracer, tr, &ftrace_no_pid_fops);
8056}
8057
8058void __init ftrace_init_tracefs_toplevel(struct trace_array *tr,
8059 struct dentry *d_tracer)
8060{
8061 /* Only the top level directory has the dyn_tracefs and profile */
8062 WARN_ON(!(tr->flags & TRACE_ARRAY_FL_GLOBAL));
8063
8064 ftrace_init_dyn_tracefs(d_tracer);
8065 ftrace_profile_tracefs(d_tracer);
8066}
8067
8068/**
8069 * ftrace_kill - kill ftrace
8070 *
8071 * This function should be used by panic code. It stops ftrace
8072 * but in a not so nice way. If you need to simply kill ftrace
8073 * from a non-atomic section, use ftrace_kill.
8074 */
8075void ftrace_kill(void)
8076{
8077 ftrace_disabled = 1;
8078 ftrace_enabled = 0;
8079 ftrace_trace_function = ftrace_stub;
8080}
8081
8082/**
8083 * ftrace_is_dead - Test if ftrace is dead or not.
8084 *
8085 * Returns 1 if ftrace is "dead", zero otherwise.
8086 */
8087int ftrace_is_dead(void)
8088{
8089 return ftrace_disabled;
8090}
8091
8092#ifdef CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS
8093/*
8094 * When registering ftrace_ops with IPMODIFY, it is necessary to make sure
8095 * it doesn't conflict with any direct ftrace_ops. If there is existing
8096 * direct ftrace_ops on a kernel function being patched, call
8097 * FTRACE_OPS_CMD_ENABLE_SHARE_IPMODIFY_PEER on it to enable sharing.
8098 *
8099 * @ops: ftrace_ops being registered.
8100 *
8101 * Returns:
8102 * 0 on success;
8103 * Negative on failure.
8104 */
8105static int prepare_direct_functions_for_ipmodify(struct ftrace_ops *ops)
8106{
8107 struct ftrace_func_entry *entry;
8108 struct ftrace_hash *hash;
8109 struct ftrace_ops *op;
8110 int size, i, ret;
8111
8112 lockdep_assert_held_once(&direct_mutex);
8113
8114 if (!(ops->flags & FTRACE_OPS_FL_IPMODIFY))
8115 return 0;
8116
8117 hash = ops->func_hash->filter_hash;
8118 size = 1 << hash->size_bits;
8119 for (i = 0; i < size; i++) {
8120 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
8121 unsigned long ip = entry->ip;
8122 bool found_op = false;
8123
8124 mutex_lock(&ftrace_lock);
8125 do_for_each_ftrace_op(op, ftrace_ops_list) {
8126 if (!(op->flags & FTRACE_OPS_FL_DIRECT))
8127 continue;
8128 if (ops_references_ip(op, ip)) {
8129 found_op = true;
8130 break;
8131 }
8132 } while_for_each_ftrace_op(op);
8133 mutex_unlock(&ftrace_lock);
8134
8135 if (found_op) {
8136 if (!op->ops_func)
8137 return -EBUSY;
8138
8139 ret = op->ops_func(op, FTRACE_OPS_CMD_ENABLE_SHARE_IPMODIFY_PEER);
8140 if (ret)
8141 return ret;
8142 }
8143 }
8144 }
8145
8146 return 0;
8147}
8148
8149/*
8150 * Similar to prepare_direct_functions_for_ipmodify, clean up after ops
8151 * with IPMODIFY is unregistered. The cleanup is optional for most DIRECT
8152 * ops.
8153 */
8154static void cleanup_direct_functions_after_ipmodify(struct ftrace_ops *ops)
8155{
8156 struct ftrace_func_entry *entry;
8157 struct ftrace_hash *hash;
8158 struct ftrace_ops *op;
8159 int size, i;
8160
8161 if (!(ops->flags & FTRACE_OPS_FL_IPMODIFY))
8162 return;
8163
8164 mutex_lock(&direct_mutex);
8165
8166 hash = ops->func_hash->filter_hash;
8167 size = 1 << hash->size_bits;
8168 for (i = 0; i < size; i++) {
8169 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
8170 unsigned long ip = entry->ip;
8171 bool found_op = false;
8172
8173 mutex_lock(&ftrace_lock);
8174 do_for_each_ftrace_op(op, ftrace_ops_list) {
8175 if (!(op->flags & FTRACE_OPS_FL_DIRECT))
8176 continue;
8177 if (ops_references_ip(op, ip)) {
8178 found_op = true;
8179 break;
8180 }
8181 } while_for_each_ftrace_op(op);
8182 mutex_unlock(&ftrace_lock);
8183
8184 /* The cleanup is optional, ignore any errors */
8185 if (found_op && op->ops_func)
8186 op->ops_func(op, FTRACE_OPS_CMD_DISABLE_SHARE_IPMODIFY_PEER);
8187 }
8188 }
8189 mutex_unlock(&direct_mutex);
8190}
8191
8192#define lock_direct_mutex() mutex_lock(&direct_mutex)
8193#define unlock_direct_mutex() mutex_unlock(&direct_mutex)
8194
8195#else /* CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS */
8196
8197static int prepare_direct_functions_for_ipmodify(struct ftrace_ops *ops)
8198{
8199 return 0;
8200}
8201
8202static void cleanup_direct_functions_after_ipmodify(struct ftrace_ops *ops)
8203{
8204}
8205
8206#define lock_direct_mutex() do { } while (0)
8207#define unlock_direct_mutex() do { } while (0)
8208
8209#endif /* CONFIG_DYNAMIC_FTRACE_WITH_DIRECT_CALLS */
8210
8211/*
8212 * Similar to register_ftrace_function, except we don't lock direct_mutex.
8213 */
8214static int register_ftrace_function_nolock(struct ftrace_ops *ops)
8215{
8216 int ret;
8217
8218 ftrace_ops_init(ops);
8219
8220 mutex_lock(&ftrace_lock);
8221
8222 ret = ftrace_startup(ops, 0);
8223
8224 mutex_unlock(&ftrace_lock);
8225
8226 return ret;
8227}
8228
8229/**
8230 * register_ftrace_function - register a function for profiling
8231 * @ops: ops structure that holds the function for profiling.
8232 *
8233 * Register a function to be called by all functions in the
8234 * kernel.
8235 *
8236 * Note: @ops->func and all the functions it calls must be labeled
8237 * with "notrace", otherwise it will go into a
8238 * recursive loop.
8239 */
8240int register_ftrace_function(struct ftrace_ops *ops)
8241{
8242 int ret;
8243
8244 lock_direct_mutex();
8245 ret = prepare_direct_functions_for_ipmodify(ops);
8246 if (ret < 0)
8247 goto out_unlock;
8248
8249 ret = register_ftrace_function_nolock(ops);
8250
8251out_unlock:
8252 unlock_direct_mutex();
8253 return ret;
8254}
8255EXPORT_SYMBOL_GPL(register_ftrace_function);
8256
8257/**
8258 * unregister_ftrace_function - unregister a function for profiling.
8259 * @ops: ops structure that holds the function to unregister
8260 *
8261 * Unregister a function that was added to be called by ftrace profiling.
8262 */
8263int unregister_ftrace_function(struct ftrace_ops *ops)
8264{
8265 int ret;
8266
8267 mutex_lock(&ftrace_lock);
8268 ret = ftrace_shutdown(ops, 0);
8269 mutex_unlock(&ftrace_lock);
8270
8271 cleanup_direct_functions_after_ipmodify(ops);
8272 return ret;
8273}
8274EXPORT_SYMBOL_GPL(unregister_ftrace_function);
8275
8276static int symbols_cmp(const void *a, const void *b)
8277{
8278 const char **str_a = (const char **) a;
8279 const char **str_b = (const char **) b;
8280
8281 return strcmp(*str_a, *str_b);
8282}
8283
8284struct kallsyms_data {
8285 unsigned long *addrs;
8286 const char **syms;
8287 size_t cnt;
8288 size_t found;
8289};
8290
8291/* This function gets called for all kernel and module symbols
8292 * and returns 1 in case we resolved all the requested symbols,
8293 * 0 otherwise.
8294 */
8295static int kallsyms_callback(void *data, const char *name,
8296 struct module *mod, unsigned long addr)
8297{
8298 struct kallsyms_data *args = data;
8299 const char **sym;
8300 int idx;
8301
8302 sym = bsearch(&name, args->syms, args->cnt, sizeof(*args->syms), symbols_cmp);
8303 if (!sym)
8304 return 0;
8305
8306 idx = sym - args->syms;
8307 if (args->addrs[idx])
8308 return 0;
8309
8310 if (!ftrace_location(addr))
8311 return 0;
8312
8313 args->addrs[idx] = addr;
8314 args->found++;
8315 return args->found == args->cnt ? 1 : 0;
8316}
8317
8318/**
8319 * ftrace_lookup_symbols - Lookup addresses for array of symbols
8320 *
8321 * @sorted_syms: array of symbols pointers symbols to resolve,
8322 * must be alphabetically sorted
8323 * @cnt: number of symbols/addresses in @syms/@addrs arrays
8324 * @addrs: array for storing resulting addresses
8325 *
8326 * This function looks up addresses for array of symbols provided in
8327 * @syms array (must be alphabetically sorted) and stores them in
8328 * @addrs array, which needs to be big enough to store at least @cnt
8329 * addresses.
8330 *
8331 * This function returns 0 if all provided symbols are found,
8332 * -ESRCH otherwise.
8333 */
8334int ftrace_lookup_symbols(const char **sorted_syms, size_t cnt, unsigned long *addrs)
8335{
8336 struct kallsyms_data args;
8337 int found_all;
8338
8339 memset(addrs, 0, sizeof(*addrs) * cnt);
8340 args.addrs = addrs;
8341 args.syms = sorted_syms;
8342 args.cnt = cnt;
8343 args.found = 0;
8344
8345 found_all = kallsyms_on_each_symbol(kallsyms_callback, &args);
8346 if (found_all)
8347 return 0;
8348 found_all = module_kallsyms_on_each_symbol(kallsyms_callback, &args);
8349 return found_all ? 0 : -ESRCH;
8350}
8351
8352#ifdef CONFIG_SYSCTL
8353
8354#ifdef CONFIG_DYNAMIC_FTRACE
8355static void ftrace_startup_sysctl(void)
8356{
8357 int command;
8358
8359 if (unlikely(ftrace_disabled))
8360 return;
8361
8362 /* Force update next time */
8363 saved_ftrace_func = NULL;
8364 /* ftrace_start_up is true if we want ftrace running */
8365 if (ftrace_start_up) {
8366 command = FTRACE_UPDATE_CALLS;
8367 if (ftrace_graph_active)
8368 command |= FTRACE_START_FUNC_RET;
8369 ftrace_startup_enable(command);
8370 }
8371}
8372
8373static void ftrace_shutdown_sysctl(void)
8374{
8375 int command;
8376
8377 if (unlikely(ftrace_disabled))
8378 return;
8379
8380 /* ftrace_start_up is true if ftrace is running */
8381 if (ftrace_start_up) {
8382 command = FTRACE_DISABLE_CALLS;
8383 if (ftrace_graph_active)
8384 command |= FTRACE_STOP_FUNC_RET;
8385 ftrace_run_update_code(command);
8386 }
8387}
8388#else
8389# define ftrace_startup_sysctl() do { } while (0)
8390# define ftrace_shutdown_sysctl() do { } while (0)
8391#endif /* CONFIG_DYNAMIC_FTRACE */
8392
8393static bool is_permanent_ops_registered(void)
8394{
8395 struct ftrace_ops *op;
8396
8397 do_for_each_ftrace_op(op, ftrace_ops_list) {
8398 if (op->flags & FTRACE_OPS_FL_PERMANENT)
8399 return true;
8400 } while_for_each_ftrace_op(op);
8401
8402 return false;
8403}
8404
8405static int
8406ftrace_enable_sysctl(struct ctl_table *table, int write,
8407 void *buffer, size_t *lenp, loff_t *ppos)
8408{
8409 int ret = -ENODEV;
8410
8411 mutex_lock(&ftrace_lock);
8412
8413 if (unlikely(ftrace_disabled))
8414 goto out;
8415
8416 ret = proc_dointvec(table, write, buffer, lenp, ppos);
8417
8418 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
8419 goto out;
8420
8421 if (ftrace_enabled) {
8422
8423 /* we are starting ftrace again */
8424 if (rcu_dereference_protected(ftrace_ops_list,
8425 lockdep_is_held(&ftrace_lock)) != &ftrace_list_end)
8426 update_ftrace_function();
8427
8428 ftrace_startup_sysctl();
8429
8430 } else {
8431 if (is_permanent_ops_registered()) {
8432 ftrace_enabled = true;
8433 ret = -EBUSY;
8434 goto out;
8435 }
8436
8437 /* stopping ftrace calls (just send to ftrace_stub) */
8438 ftrace_trace_function = ftrace_stub;
8439
8440 ftrace_shutdown_sysctl();
8441 }
8442
8443 last_ftrace_enabled = !!ftrace_enabled;
8444 out:
8445 mutex_unlock(&ftrace_lock);
8446 return ret;
8447}
8448
8449static struct ctl_table ftrace_sysctls[] = {
8450 {
8451 .procname = "ftrace_enabled",
8452 .data = &ftrace_enabled,
8453 .maxlen = sizeof(int),
8454 .mode = 0644,
8455 .proc_handler = ftrace_enable_sysctl,
8456 },
8457 {}
8458};
8459
8460static int __init ftrace_sysctl_init(void)
8461{
8462 register_sysctl_init("kernel", ftrace_sysctls);
8463 return 0;
8464}
8465late_initcall(ftrace_sysctl_init);
8466#endif
1/*
2 * Infrastructure for profiling code inserted by 'gcc -pg'.
3 *
4 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
5 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
6 *
7 * Originally ported from the -rt patch by:
8 * Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
9 *
10 * Based on code in the latency_tracer, that is:
11 *
12 * Copyright (C) 2004-2006 Ingo Molnar
13 * Copyright (C) 2004 Nadia Yvette Chambers
14 */
15
16#include <linux/stop_machine.h>
17#include <linux/clocksource.h>
18#include <linux/sched/task.h>
19#include <linux/kallsyms.h>
20#include <linux/seq_file.h>
21#include <linux/suspend.h>
22#include <linux/tracefs.h>
23#include <linux/hardirq.h>
24#include <linux/kthread.h>
25#include <linux/uaccess.h>
26#include <linux/bsearch.h>
27#include <linux/module.h>
28#include <linux/ftrace.h>
29#include <linux/sysctl.h>
30#include <linux/slab.h>
31#include <linux/ctype.h>
32#include <linux/sort.h>
33#include <linux/list.h>
34#include <linux/hash.h>
35#include <linux/rcupdate.h>
36
37#include <trace/events/sched.h>
38
39#include <asm/sections.h>
40#include <asm/setup.h>
41
42#include "trace_output.h"
43#include "trace_stat.h"
44
45#define FTRACE_WARN_ON(cond) \
46 ({ \
47 int ___r = cond; \
48 if (WARN_ON(___r)) \
49 ftrace_kill(); \
50 ___r; \
51 })
52
53#define FTRACE_WARN_ON_ONCE(cond) \
54 ({ \
55 int ___r = cond; \
56 if (WARN_ON_ONCE(___r)) \
57 ftrace_kill(); \
58 ___r; \
59 })
60
61/* hash bits for specific function selection */
62#define FTRACE_HASH_BITS 7
63#define FTRACE_FUNC_HASHSIZE (1 << FTRACE_HASH_BITS)
64#define FTRACE_HASH_DEFAULT_BITS 10
65#define FTRACE_HASH_MAX_BITS 12
66
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
78
79static 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)
83};
84
85/* ftrace_enabled is a method to turn ftrace on or off */
86int ftrace_enabled __read_mostly;
87static int last_ftrace_enabled;
88
89/* Current function tracing op */
90struct ftrace_ops *function_trace_op __read_mostly = &ftrace_list_end;
91/* What to set function_trace_op to */
92static struct ftrace_ops *set_function_trace_op;
93
94static bool ftrace_pids_enabled(struct ftrace_ops *ops)
95{
96 struct trace_array *tr;
97
98 if (!(ops->flags & FTRACE_OPS_FL_PID) || !ops->private)
99 return false;
100
101 tr = ops->private;
102
103 return tr->function_pids != NULL;
104}
105
106static void ftrace_update_trampoline(struct ftrace_ops *ops);
107
108/*
109 * ftrace_disabled is set when an anomaly is discovered.
110 * ftrace_disabled is much stronger than ftrace_enabled.
111 */
112static int ftrace_disabled __read_mostly;
113
114static DEFINE_MUTEX(ftrace_lock);
115
116static struct ftrace_ops __rcu *ftrace_ops_list __read_mostly = &ftrace_list_end;
117ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
118static struct ftrace_ops global_ops;
119
120#if ARCH_SUPPORTS_FTRACE_OPS
121static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
122 struct ftrace_ops *op, struct pt_regs *regs);
123#else
124/* See comment below, where ftrace_ops_list_func is defined */
125static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip);
126#define ftrace_ops_list_func ((ftrace_func_t)ftrace_ops_no_ops)
127#endif
128
129/*
130 * Traverse the ftrace_global_list, invoking all entries. The reason that we
131 * can use rcu_dereference_raw_notrace() is that elements removed from this list
132 * are simply leaked, so there is no need to interact with a grace-period
133 * mechanism. The rcu_dereference_raw_notrace() calls are needed to handle
134 * concurrent insertions into the ftrace_global_list.
135 *
136 * Silly Alpha and silly pointer-speculation compiler optimizations!
137 */
138#define do_for_each_ftrace_op(op, list) \
139 op = rcu_dereference_raw_notrace(list); \
140 do
141
142/*
143 * Optimized for just a single item in the list (as that is the normal case).
144 */
145#define while_for_each_ftrace_op(op) \
146 while (likely(op = rcu_dereference_raw_notrace((op)->next)) && \
147 unlikely((op) != &ftrace_list_end))
148
149static inline void ftrace_ops_init(struct ftrace_ops *ops)
150{
151#ifdef CONFIG_DYNAMIC_FTRACE
152 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED)) {
153 mutex_init(&ops->local_hash.regex_lock);
154 ops->func_hash = &ops->local_hash;
155 ops->flags |= FTRACE_OPS_FL_INITIALIZED;
156 }
157#endif
158}
159
160/**
161 * ftrace_nr_registered_ops - return number of ops registered
162 *
163 * Returns the number of ftrace_ops registered and tracing functions
164 */
165int ftrace_nr_registered_ops(void)
166{
167 struct ftrace_ops *ops;
168 int cnt = 0;
169
170 mutex_lock(&ftrace_lock);
171
172 for (ops = rcu_dereference_protected(ftrace_ops_list,
173 lockdep_is_held(&ftrace_lock));
174 ops != &ftrace_list_end;
175 ops = rcu_dereference_protected(ops->next,
176 lockdep_is_held(&ftrace_lock)))
177 cnt++;
178
179 mutex_unlock(&ftrace_lock);
180
181 return cnt;
182}
183
184static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip,
185 struct ftrace_ops *op, struct pt_regs *regs)
186{
187 struct trace_array *tr = op->private;
188
189 if (tr && this_cpu_read(tr->trace_buffer.data->ftrace_ignore_pid))
190 return;
191
192 op->saved_func(ip, parent_ip, op, regs);
193}
194
195/**
196 * clear_ftrace_function - reset the ftrace function
197 *
198 * This NULLs the ftrace function and in essence stops
199 * tracing. There may be lag
200 */
201void clear_ftrace_function(void)
202{
203 ftrace_trace_function = ftrace_stub;
204}
205
206static void ftrace_sync(struct work_struct *work)
207{
208 /*
209 * This function is just a stub to implement a hard force
210 * of synchronize_sched(). This requires synchronizing
211 * tasks even in userspace and idle.
212 *
213 * Yes, function tracing is rude.
214 */
215}
216
217static void ftrace_sync_ipi(void *data)
218{
219 /* Probably not needed, but do it anyway */
220 smp_rmb();
221}
222
223#ifdef CONFIG_FUNCTION_GRAPH_TRACER
224static void update_function_graph_func(void);
225
226/* Both enabled by default (can be cleared by function_graph tracer flags */
227static bool fgraph_sleep_time = true;
228static bool fgraph_graph_time = true;
229
230#else
231static inline void update_function_graph_func(void) { }
232#endif
233
234
235static ftrace_func_t ftrace_ops_get_list_func(struct ftrace_ops *ops)
236{
237 /*
238 * If this is a dynamic, RCU, or per CPU ops, or we force list func,
239 * then it needs to call the list anyway.
240 */
241 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_RCU) ||
242 FTRACE_FORCE_LIST_FUNC)
243 return ftrace_ops_list_func;
244
245 return ftrace_ops_get_func(ops);
246}
247
248static void update_ftrace_function(void)
249{
250 ftrace_func_t func;
251
252 /*
253 * Prepare the ftrace_ops that the arch callback will use.
254 * If there's only one ftrace_ops registered, the ftrace_ops_list
255 * will point to the ops we want.
256 */
257 set_function_trace_op = rcu_dereference_protected(ftrace_ops_list,
258 lockdep_is_held(&ftrace_lock));
259
260 /* If there's no ftrace_ops registered, just call the stub function */
261 if (set_function_trace_op == &ftrace_list_end) {
262 func = ftrace_stub;
263
264 /*
265 * If we are at the end of the list and this ops is
266 * recursion safe and not dynamic and the arch supports passing ops,
267 * then have the mcount trampoline call the function directly.
268 */
269 } else if (rcu_dereference_protected(ftrace_ops_list->next,
270 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
271 func = ftrace_ops_get_list_func(ftrace_ops_list);
272
273 } else {
274 /* Just use the default ftrace_ops */
275 set_function_trace_op = &ftrace_list_end;
276 func = ftrace_ops_list_func;
277 }
278
279 update_function_graph_func();
280
281 /* If there's no change, then do nothing more here */
282 if (ftrace_trace_function == func)
283 return;
284
285 /*
286 * If we are using the list function, it doesn't care
287 * about the function_trace_ops.
288 */
289 if (func == ftrace_ops_list_func) {
290 ftrace_trace_function = func;
291 /*
292 * Don't even bother setting function_trace_ops,
293 * it would be racy to do so anyway.
294 */
295 return;
296 }
297
298#ifndef CONFIG_DYNAMIC_FTRACE
299 /*
300 * For static tracing, we need to be a bit more careful.
301 * The function change takes affect immediately. Thus,
302 * we need to coorditate the setting of the function_trace_ops
303 * with the setting of the ftrace_trace_function.
304 *
305 * Set the function to the list ops, which will call the
306 * function we want, albeit indirectly, but it handles the
307 * ftrace_ops and doesn't depend on function_trace_op.
308 */
309 ftrace_trace_function = ftrace_ops_list_func;
310 /*
311 * Make sure all CPUs see this. Yes this is slow, but static
312 * tracing is slow and nasty to have enabled.
313 */
314 schedule_on_each_cpu(ftrace_sync);
315 /* Now all cpus are using the list ops. */
316 function_trace_op = set_function_trace_op;
317 /* Make sure the function_trace_op is visible on all CPUs */
318 smp_wmb();
319 /* Nasty way to force a rmb on all cpus */
320 smp_call_function(ftrace_sync_ipi, NULL, 1);
321 /* OK, we are all set to update the ftrace_trace_function now! */
322#endif /* !CONFIG_DYNAMIC_FTRACE */
323
324 ftrace_trace_function = func;
325}
326
327int using_ftrace_ops_list_func(void)
328{
329 return ftrace_trace_function == ftrace_ops_list_func;
330}
331
332static void add_ftrace_ops(struct ftrace_ops __rcu **list,
333 struct ftrace_ops *ops)
334{
335 rcu_assign_pointer(ops->next, *list);
336
337 /*
338 * We are entering ops into the list but another
339 * CPU might be walking that list. We need to make sure
340 * the ops->next pointer is valid before another CPU sees
341 * the ops pointer included into the list.
342 */
343 rcu_assign_pointer(*list, ops);
344}
345
346static int remove_ftrace_ops(struct ftrace_ops __rcu **list,
347 struct ftrace_ops *ops)
348{
349 struct ftrace_ops **p;
350
351 /*
352 * If we are removing the last function, then simply point
353 * to the ftrace_stub.
354 */
355 if (rcu_dereference_protected(*list,
356 lockdep_is_held(&ftrace_lock)) == ops &&
357 rcu_dereference_protected(ops->next,
358 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
359 *list = &ftrace_list_end;
360 return 0;
361 }
362
363 for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
364 if (*p == ops)
365 break;
366
367 if (*p != ops)
368 return -1;
369
370 *p = (*p)->next;
371 return 0;
372}
373
374static void ftrace_update_trampoline(struct ftrace_ops *ops);
375
376static int __register_ftrace_function(struct ftrace_ops *ops)
377{
378 if (ops->flags & FTRACE_OPS_FL_DELETED)
379 return -EINVAL;
380
381 if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
382 return -EBUSY;
383
384#ifndef CONFIG_DYNAMIC_FTRACE_WITH_REGS
385 /*
386 * If the ftrace_ops specifies SAVE_REGS, then it only can be used
387 * if the arch supports it, or SAVE_REGS_IF_SUPPORTED is also set.
388 * Setting SAVE_REGS_IF_SUPPORTED makes SAVE_REGS irrelevant.
389 */
390 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS &&
391 !(ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED))
392 return -EINVAL;
393
394 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED)
395 ops->flags |= FTRACE_OPS_FL_SAVE_REGS;
396#endif
397
398 if (!core_kernel_data((unsigned long)ops))
399 ops->flags |= FTRACE_OPS_FL_DYNAMIC;
400
401 add_ftrace_ops(&ftrace_ops_list, ops);
402
403 /* Always save the function, and reset at unregistering */
404 ops->saved_func = ops->func;
405
406 if (ftrace_pids_enabled(ops))
407 ops->func = ftrace_pid_func;
408
409 ftrace_update_trampoline(ops);
410
411 if (ftrace_enabled)
412 update_ftrace_function();
413
414 return 0;
415}
416
417static int __unregister_ftrace_function(struct ftrace_ops *ops)
418{
419 int ret;
420
421 if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
422 return -EBUSY;
423
424 ret = remove_ftrace_ops(&ftrace_ops_list, ops);
425
426 if (ret < 0)
427 return ret;
428
429 if (ftrace_enabled)
430 update_ftrace_function();
431
432 ops->func = ops->saved_func;
433
434 return 0;
435}
436
437static void ftrace_update_pid_func(void)
438{
439 struct ftrace_ops *op;
440
441 /* Only do something if we are tracing something */
442 if (ftrace_trace_function == ftrace_stub)
443 return;
444
445 do_for_each_ftrace_op(op, ftrace_ops_list) {
446 if (op->flags & FTRACE_OPS_FL_PID) {
447 op->func = ftrace_pids_enabled(op) ?
448 ftrace_pid_func : op->saved_func;
449 ftrace_update_trampoline(op);
450 }
451 } while_for_each_ftrace_op(op);
452
453 update_ftrace_function();
454}
455
456#ifdef CONFIG_FUNCTION_PROFILER
457struct ftrace_profile {
458 struct hlist_node node;
459 unsigned long ip;
460 unsigned long counter;
461#ifdef CONFIG_FUNCTION_GRAPH_TRACER
462 unsigned long long time;
463 unsigned long long time_squared;
464#endif
465};
466
467struct ftrace_profile_page {
468 struct ftrace_profile_page *next;
469 unsigned long index;
470 struct ftrace_profile records[];
471};
472
473struct ftrace_profile_stat {
474 atomic_t disabled;
475 struct hlist_head *hash;
476 struct ftrace_profile_page *pages;
477 struct ftrace_profile_page *start;
478 struct tracer_stat stat;
479};
480
481#define PROFILE_RECORDS_SIZE \
482 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
483
484#define PROFILES_PER_PAGE \
485 (PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
486
487static int ftrace_profile_enabled __read_mostly;
488
489/* ftrace_profile_lock - synchronize the enable and disable of the profiler */
490static DEFINE_MUTEX(ftrace_profile_lock);
491
492static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
493
494#define FTRACE_PROFILE_HASH_BITS 10
495#define FTRACE_PROFILE_HASH_SIZE (1 << FTRACE_PROFILE_HASH_BITS)
496
497static void *
498function_stat_next(void *v, int idx)
499{
500 struct ftrace_profile *rec = v;
501 struct ftrace_profile_page *pg;
502
503 pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
504
505 again:
506 if (idx != 0)
507 rec++;
508
509 if ((void *)rec >= (void *)&pg->records[pg->index]) {
510 pg = pg->next;
511 if (!pg)
512 return NULL;
513 rec = &pg->records[0];
514 if (!rec->counter)
515 goto again;
516 }
517
518 return rec;
519}
520
521static void *function_stat_start(struct tracer_stat *trace)
522{
523 struct ftrace_profile_stat *stat =
524 container_of(trace, struct ftrace_profile_stat, stat);
525
526 if (!stat || !stat->start)
527 return NULL;
528
529 return function_stat_next(&stat->start->records[0], 0);
530}
531
532#ifdef CONFIG_FUNCTION_GRAPH_TRACER
533/* function graph compares on total time */
534static int function_stat_cmp(void *p1, void *p2)
535{
536 struct ftrace_profile *a = p1;
537 struct ftrace_profile *b = p2;
538
539 if (a->time < b->time)
540 return -1;
541 if (a->time > b->time)
542 return 1;
543 else
544 return 0;
545}
546#else
547/* not function graph compares against hits */
548static int function_stat_cmp(void *p1, void *p2)
549{
550 struct ftrace_profile *a = p1;
551 struct ftrace_profile *b = p2;
552
553 if (a->counter < b->counter)
554 return -1;
555 if (a->counter > b->counter)
556 return 1;
557 else
558 return 0;
559}
560#endif
561
562static int function_stat_headers(struct seq_file *m)
563{
564#ifdef CONFIG_FUNCTION_GRAPH_TRACER
565 seq_puts(m, " Function "
566 "Hit Time Avg s^2\n"
567 " -------- "
568 "--- ---- --- ---\n");
569#else
570 seq_puts(m, " Function Hit\n"
571 " -------- ---\n");
572#endif
573 return 0;
574}
575
576static int function_stat_show(struct seq_file *m, void *v)
577{
578 struct ftrace_profile *rec = v;
579 char str[KSYM_SYMBOL_LEN];
580 int ret = 0;
581#ifdef CONFIG_FUNCTION_GRAPH_TRACER
582 static struct trace_seq s;
583 unsigned long long avg;
584 unsigned long long stddev;
585#endif
586 mutex_lock(&ftrace_profile_lock);
587
588 /* we raced with function_profile_reset() */
589 if (unlikely(rec->counter == 0)) {
590 ret = -EBUSY;
591 goto out;
592 }
593
594#ifdef CONFIG_FUNCTION_GRAPH_TRACER
595 avg = rec->time;
596 do_div(avg, rec->counter);
597 if (tracing_thresh && (avg < tracing_thresh))
598 goto out;
599#endif
600
601 kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
602 seq_printf(m, " %-30.30s %10lu", str, rec->counter);
603
604#ifdef CONFIG_FUNCTION_GRAPH_TRACER
605 seq_puts(m, " ");
606
607 /* Sample standard deviation (s^2) */
608 if (rec->counter <= 1)
609 stddev = 0;
610 else {
611 /*
612 * Apply Welford's method:
613 * s^2 = 1 / (n * (n-1)) * (n * \Sum (x_i)^2 - (\Sum x_i)^2)
614 */
615 stddev = rec->counter * rec->time_squared -
616 rec->time * rec->time;
617
618 /*
619 * Divide only 1000 for ns^2 -> us^2 conversion.
620 * trace_print_graph_duration will divide 1000 again.
621 */
622 do_div(stddev, rec->counter * (rec->counter - 1) * 1000);
623 }
624
625 trace_seq_init(&s);
626 trace_print_graph_duration(rec->time, &s);
627 trace_seq_puts(&s, " ");
628 trace_print_graph_duration(avg, &s);
629 trace_seq_puts(&s, " ");
630 trace_print_graph_duration(stddev, &s);
631 trace_print_seq(m, &s);
632#endif
633 seq_putc(m, '\n');
634out:
635 mutex_unlock(&ftrace_profile_lock);
636
637 return ret;
638}
639
640static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
641{
642 struct ftrace_profile_page *pg;
643
644 pg = stat->pages = stat->start;
645
646 while (pg) {
647 memset(pg->records, 0, PROFILE_RECORDS_SIZE);
648 pg->index = 0;
649 pg = pg->next;
650 }
651
652 memset(stat->hash, 0,
653 FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
654}
655
656int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
657{
658 struct ftrace_profile_page *pg;
659 int functions;
660 int pages;
661 int i;
662
663 /* If we already allocated, do nothing */
664 if (stat->pages)
665 return 0;
666
667 stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
668 if (!stat->pages)
669 return -ENOMEM;
670
671#ifdef CONFIG_DYNAMIC_FTRACE
672 functions = ftrace_update_tot_cnt;
673#else
674 /*
675 * We do not know the number of functions that exist because
676 * dynamic tracing is what counts them. With past experience
677 * we have around 20K functions. That should be more than enough.
678 * It is highly unlikely we will execute every function in
679 * the kernel.
680 */
681 functions = 20000;
682#endif
683
684 pg = stat->start = stat->pages;
685
686 pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);
687
688 for (i = 1; i < pages; i++) {
689 pg->next = (void *)get_zeroed_page(GFP_KERNEL);
690 if (!pg->next)
691 goto out_free;
692 pg = pg->next;
693 }
694
695 return 0;
696
697 out_free:
698 pg = stat->start;
699 while (pg) {
700 unsigned long tmp = (unsigned long)pg;
701
702 pg = pg->next;
703 free_page(tmp);
704 }
705
706 stat->pages = NULL;
707 stat->start = NULL;
708
709 return -ENOMEM;
710}
711
712static int ftrace_profile_init_cpu(int cpu)
713{
714 struct ftrace_profile_stat *stat;
715 int size;
716
717 stat = &per_cpu(ftrace_profile_stats, cpu);
718
719 if (stat->hash) {
720 /* If the profile is already created, simply reset it */
721 ftrace_profile_reset(stat);
722 return 0;
723 }
724
725 /*
726 * We are profiling all functions, but usually only a few thousand
727 * functions are hit. We'll make a hash of 1024 items.
728 */
729 size = FTRACE_PROFILE_HASH_SIZE;
730
731 stat->hash = kzalloc(sizeof(struct hlist_head) * size, GFP_KERNEL);
732
733 if (!stat->hash)
734 return -ENOMEM;
735
736 /* Preallocate the function profiling pages */
737 if (ftrace_profile_pages_init(stat) < 0) {
738 kfree(stat->hash);
739 stat->hash = NULL;
740 return -ENOMEM;
741 }
742
743 return 0;
744}
745
746static int ftrace_profile_init(void)
747{
748 int cpu;
749 int ret = 0;
750
751 for_each_possible_cpu(cpu) {
752 ret = ftrace_profile_init_cpu(cpu);
753 if (ret)
754 break;
755 }
756
757 return ret;
758}
759
760/* interrupts must be disabled */
761static struct ftrace_profile *
762ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
763{
764 struct ftrace_profile *rec;
765 struct hlist_head *hhd;
766 unsigned long key;
767
768 key = hash_long(ip, FTRACE_PROFILE_HASH_BITS);
769 hhd = &stat->hash[key];
770
771 if (hlist_empty(hhd))
772 return NULL;
773
774 hlist_for_each_entry_rcu_notrace(rec, hhd, node) {
775 if (rec->ip == ip)
776 return rec;
777 }
778
779 return NULL;
780}
781
782static void ftrace_add_profile(struct ftrace_profile_stat *stat,
783 struct ftrace_profile *rec)
784{
785 unsigned long key;
786
787 key = hash_long(rec->ip, FTRACE_PROFILE_HASH_BITS);
788 hlist_add_head_rcu(&rec->node, &stat->hash[key]);
789}
790
791/*
792 * The memory is already allocated, this simply finds a new record to use.
793 */
794static struct ftrace_profile *
795ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
796{
797 struct ftrace_profile *rec = NULL;
798
799 /* prevent recursion (from NMIs) */
800 if (atomic_inc_return(&stat->disabled) != 1)
801 goto out;
802
803 /*
804 * Try to find the function again since an NMI
805 * could have added it
806 */
807 rec = ftrace_find_profiled_func(stat, ip);
808 if (rec)
809 goto out;
810
811 if (stat->pages->index == PROFILES_PER_PAGE) {
812 if (!stat->pages->next)
813 goto out;
814 stat->pages = stat->pages->next;
815 }
816
817 rec = &stat->pages->records[stat->pages->index++];
818 rec->ip = ip;
819 ftrace_add_profile(stat, rec);
820
821 out:
822 atomic_dec(&stat->disabled);
823
824 return rec;
825}
826
827static void
828function_profile_call(unsigned long ip, unsigned long parent_ip,
829 struct ftrace_ops *ops, struct pt_regs *regs)
830{
831 struct ftrace_profile_stat *stat;
832 struct ftrace_profile *rec;
833 unsigned long flags;
834
835 if (!ftrace_profile_enabled)
836 return;
837
838 local_irq_save(flags);
839
840 stat = this_cpu_ptr(&ftrace_profile_stats);
841 if (!stat->hash || !ftrace_profile_enabled)
842 goto out;
843
844 rec = ftrace_find_profiled_func(stat, ip);
845 if (!rec) {
846 rec = ftrace_profile_alloc(stat, ip);
847 if (!rec)
848 goto out;
849 }
850
851 rec->counter++;
852 out:
853 local_irq_restore(flags);
854}
855
856#ifdef CONFIG_FUNCTION_GRAPH_TRACER
857static int profile_graph_entry(struct ftrace_graph_ent *trace)
858{
859 int index = trace->depth;
860
861 function_profile_call(trace->func, 0, NULL, NULL);
862
863 /* If function graph is shutting down, ret_stack can be NULL */
864 if (!current->ret_stack)
865 return 0;
866
867 if (index >= 0 && index < FTRACE_RETFUNC_DEPTH)
868 current->ret_stack[index].subtime = 0;
869
870 return 1;
871}
872
873static void profile_graph_return(struct ftrace_graph_ret *trace)
874{
875 struct ftrace_profile_stat *stat;
876 unsigned long long calltime;
877 struct ftrace_profile *rec;
878 unsigned long flags;
879
880 local_irq_save(flags);
881 stat = this_cpu_ptr(&ftrace_profile_stats);
882 if (!stat->hash || !ftrace_profile_enabled)
883 goto out;
884
885 /* If the calltime was zero'd ignore it */
886 if (!trace->calltime)
887 goto out;
888
889 calltime = trace->rettime - trace->calltime;
890
891 if (!fgraph_graph_time) {
892 int index;
893
894 index = trace->depth;
895
896 /* Append this call time to the parent time to subtract */
897 if (index)
898 current->ret_stack[index - 1].subtime += calltime;
899
900 if (current->ret_stack[index].subtime < calltime)
901 calltime -= current->ret_stack[index].subtime;
902 else
903 calltime = 0;
904 }
905
906 rec = ftrace_find_profiled_func(stat, trace->func);
907 if (rec) {
908 rec->time += calltime;
909 rec->time_squared += calltime * calltime;
910 }
911
912 out:
913 local_irq_restore(flags);
914}
915
916static int register_ftrace_profiler(void)
917{
918 return register_ftrace_graph(&profile_graph_return,
919 &profile_graph_entry);
920}
921
922static void unregister_ftrace_profiler(void)
923{
924 unregister_ftrace_graph();
925}
926#else
927static struct ftrace_ops ftrace_profile_ops __read_mostly = {
928 .func = function_profile_call,
929 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
930 INIT_OPS_HASH(ftrace_profile_ops)
931};
932
933static int register_ftrace_profiler(void)
934{
935 return register_ftrace_function(&ftrace_profile_ops);
936}
937
938static void unregister_ftrace_profiler(void)
939{
940 unregister_ftrace_function(&ftrace_profile_ops);
941}
942#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
943
944static ssize_t
945ftrace_profile_write(struct file *filp, const char __user *ubuf,
946 size_t cnt, loff_t *ppos)
947{
948 unsigned long val;
949 int ret;
950
951 ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
952 if (ret)
953 return ret;
954
955 val = !!val;
956
957 mutex_lock(&ftrace_profile_lock);
958 if (ftrace_profile_enabled ^ val) {
959 if (val) {
960 ret = ftrace_profile_init();
961 if (ret < 0) {
962 cnt = ret;
963 goto out;
964 }
965
966 ret = register_ftrace_profiler();
967 if (ret < 0) {
968 cnt = ret;
969 goto out;
970 }
971 ftrace_profile_enabled = 1;
972 } else {
973 ftrace_profile_enabled = 0;
974 /*
975 * unregister_ftrace_profiler calls stop_machine
976 * so this acts like an synchronize_sched.
977 */
978 unregister_ftrace_profiler();
979 }
980 }
981 out:
982 mutex_unlock(&ftrace_profile_lock);
983
984 *ppos += cnt;
985
986 return cnt;
987}
988
989static ssize_t
990ftrace_profile_read(struct file *filp, char __user *ubuf,
991 size_t cnt, loff_t *ppos)
992{
993 char buf[64]; /* big enough to hold a number */
994 int r;
995
996 r = sprintf(buf, "%u\n", ftrace_profile_enabled);
997 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
998}
999
1000static const struct file_operations ftrace_profile_fops = {
1001 .open = tracing_open_generic,
1002 .read = ftrace_profile_read,
1003 .write = ftrace_profile_write,
1004 .llseek = default_llseek,
1005};
1006
1007/* used to initialize the real stat files */
1008static struct tracer_stat function_stats __initdata = {
1009 .name = "functions",
1010 .stat_start = function_stat_start,
1011 .stat_next = function_stat_next,
1012 .stat_cmp = function_stat_cmp,
1013 .stat_headers = function_stat_headers,
1014 .stat_show = function_stat_show
1015};
1016
1017static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1018{
1019 struct ftrace_profile_stat *stat;
1020 struct dentry *entry;
1021 char *name;
1022 int ret;
1023 int cpu;
1024
1025 for_each_possible_cpu(cpu) {
1026 stat = &per_cpu(ftrace_profile_stats, cpu);
1027
1028 name = kasprintf(GFP_KERNEL, "function%d", cpu);
1029 if (!name) {
1030 /*
1031 * The files created are permanent, if something happens
1032 * we still do not free memory.
1033 */
1034 WARN(1,
1035 "Could not allocate stat file for cpu %d\n",
1036 cpu);
1037 return;
1038 }
1039 stat->stat = function_stats;
1040 stat->stat.name = name;
1041 ret = register_stat_tracer(&stat->stat);
1042 if (ret) {
1043 WARN(1,
1044 "Could not register function stat for cpu %d\n",
1045 cpu);
1046 kfree(name);
1047 return;
1048 }
1049 }
1050
1051 entry = tracefs_create_file("function_profile_enabled", 0644,
1052 d_tracer, NULL, &ftrace_profile_fops);
1053 if (!entry)
1054 pr_warn("Could not create tracefs 'function_profile_enabled' entry\n");
1055}
1056
1057#else /* CONFIG_FUNCTION_PROFILER */
1058static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1059{
1060}
1061#endif /* CONFIG_FUNCTION_PROFILER */
1062
1063static struct pid * const ftrace_swapper_pid = &init_struct_pid;
1064
1065#ifdef CONFIG_FUNCTION_GRAPH_TRACER
1066static int ftrace_graph_active;
1067#else
1068# define ftrace_graph_active 0
1069#endif
1070
1071#ifdef CONFIG_DYNAMIC_FTRACE
1072
1073static struct ftrace_ops *removed_ops;
1074
1075/*
1076 * Set when doing a global update, like enabling all recs or disabling them.
1077 * It is not set when just updating a single ftrace_ops.
1078 */
1079static bool update_all_ops;
1080
1081#ifndef CONFIG_FTRACE_MCOUNT_RECORD
1082# error Dynamic ftrace depends on MCOUNT_RECORD
1083#endif
1084
1085struct ftrace_func_entry {
1086 struct hlist_node hlist;
1087 unsigned long ip;
1088};
1089
1090struct ftrace_func_probe {
1091 struct ftrace_probe_ops *probe_ops;
1092 struct ftrace_ops ops;
1093 struct trace_array *tr;
1094 struct list_head list;
1095 void *data;
1096 int ref;
1097};
1098
1099/*
1100 * We make these constant because no one should touch them,
1101 * but they are used as the default "empty hash", to avoid allocating
1102 * it all the time. These are in a read only section such that if
1103 * anyone does try to modify it, it will cause an exception.
1104 */
1105static const struct hlist_head empty_buckets[1];
1106static const struct ftrace_hash empty_hash = {
1107 .buckets = (struct hlist_head *)empty_buckets,
1108};
1109#define EMPTY_HASH ((struct ftrace_hash *)&empty_hash)
1110
1111static struct ftrace_ops global_ops = {
1112 .func = ftrace_stub,
1113 .local_hash.notrace_hash = EMPTY_HASH,
1114 .local_hash.filter_hash = EMPTY_HASH,
1115 INIT_OPS_HASH(global_ops)
1116 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
1117 FTRACE_OPS_FL_INITIALIZED |
1118 FTRACE_OPS_FL_PID,
1119};
1120
1121/*
1122 * Used by the stack undwinder to know about dynamic ftrace trampolines.
1123 */
1124struct ftrace_ops *ftrace_ops_trampoline(unsigned long addr)
1125{
1126 struct ftrace_ops *op = NULL;
1127
1128 /*
1129 * Some of the ops may be dynamically allocated,
1130 * they are freed after a synchronize_sched().
1131 */
1132 preempt_disable_notrace();
1133
1134 do_for_each_ftrace_op(op, ftrace_ops_list) {
1135 /*
1136 * This is to check for dynamically allocated trampolines.
1137 * Trampolines that are in kernel text will have
1138 * core_kernel_text() return true.
1139 */
1140 if (op->trampoline && op->trampoline_size)
1141 if (addr >= op->trampoline &&
1142 addr < op->trampoline + op->trampoline_size) {
1143 preempt_enable_notrace();
1144 return op;
1145 }
1146 } while_for_each_ftrace_op(op);
1147 preempt_enable_notrace();
1148
1149 return NULL;
1150}
1151
1152/*
1153 * This is used by __kernel_text_address() to return true if the
1154 * address is on a dynamically allocated trampoline that would
1155 * not return true for either core_kernel_text() or
1156 * is_module_text_address().
1157 */
1158bool is_ftrace_trampoline(unsigned long addr)
1159{
1160 return ftrace_ops_trampoline(addr) != NULL;
1161}
1162
1163struct ftrace_page {
1164 struct ftrace_page *next;
1165 struct dyn_ftrace *records;
1166 int index;
1167 int size;
1168};
1169
1170#define ENTRY_SIZE sizeof(struct dyn_ftrace)
1171#define ENTRIES_PER_PAGE (PAGE_SIZE / ENTRY_SIZE)
1172
1173/* estimate from running different kernels */
1174#define NR_TO_INIT 10000
1175
1176static struct ftrace_page *ftrace_pages_start;
1177static struct ftrace_page *ftrace_pages;
1178
1179static __always_inline unsigned long
1180ftrace_hash_key(struct ftrace_hash *hash, unsigned long ip)
1181{
1182 if (hash->size_bits > 0)
1183 return hash_long(ip, hash->size_bits);
1184
1185 return 0;
1186}
1187
1188/* Only use this function if ftrace_hash_empty() has already been tested */
1189static __always_inline struct ftrace_func_entry *
1190__ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1191{
1192 unsigned long key;
1193 struct ftrace_func_entry *entry;
1194 struct hlist_head *hhd;
1195
1196 key = ftrace_hash_key(hash, ip);
1197 hhd = &hash->buckets[key];
1198
1199 hlist_for_each_entry_rcu_notrace(entry, hhd, hlist) {
1200 if (entry->ip == ip)
1201 return entry;
1202 }
1203 return NULL;
1204}
1205
1206/**
1207 * ftrace_lookup_ip - Test to see if an ip exists in an ftrace_hash
1208 * @hash: The hash to look at
1209 * @ip: The instruction pointer to test
1210 *
1211 * Search a given @hash to see if a given instruction pointer (@ip)
1212 * exists in it.
1213 *
1214 * Returns the entry that holds the @ip if found. NULL otherwise.
1215 */
1216struct ftrace_func_entry *
1217ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1218{
1219 if (ftrace_hash_empty(hash))
1220 return NULL;
1221
1222 return __ftrace_lookup_ip(hash, ip);
1223}
1224
1225static void __add_hash_entry(struct ftrace_hash *hash,
1226 struct ftrace_func_entry *entry)
1227{
1228 struct hlist_head *hhd;
1229 unsigned long key;
1230
1231 key = ftrace_hash_key(hash, entry->ip);
1232 hhd = &hash->buckets[key];
1233 hlist_add_head(&entry->hlist, hhd);
1234 hash->count++;
1235}
1236
1237static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
1238{
1239 struct ftrace_func_entry *entry;
1240
1241 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
1242 if (!entry)
1243 return -ENOMEM;
1244
1245 entry->ip = ip;
1246 __add_hash_entry(hash, entry);
1247
1248 return 0;
1249}
1250
1251static void
1252free_hash_entry(struct ftrace_hash *hash,
1253 struct ftrace_func_entry *entry)
1254{
1255 hlist_del(&entry->hlist);
1256 kfree(entry);
1257 hash->count--;
1258}
1259
1260static void
1261remove_hash_entry(struct ftrace_hash *hash,
1262 struct ftrace_func_entry *entry)
1263{
1264 hlist_del_rcu(&entry->hlist);
1265 hash->count--;
1266}
1267
1268static void ftrace_hash_clear(struct ftrace_hash *hash)
1269{
1270 struct hlist_head *hhd;
1271 struct hlist_node *tn;
1272 struct ftrace_func_entry *entry;
1273 int size = 1 << hash->size_bits;
1274 int i;
1275
1276 if (!hash->count)
1277 return;
1278
1279 for (i = 0; i < size; i++) {
1280 hhd = &hash->buckets[i];
1281 hlist_for_each_entry_safe(entry, tn, hhd, hlist)
1282 free_hash_entry(hash, entry);
1283 }
1284 FTRACE_WARN_ON(hash->count);
1285}
1286
1287static void free_ftrace_mod(struct ftrace_mod_load *ftrace_mod)
1288{
1289 list_del(&ftrace_mod->list);
1290 kfree(ftrace_mod->module);
1291 kfree(ftrace_mod->func);
1292 kfree(ftrace_mod);
1293}
1294
1295static void clear_ftrace_mod_list(struct list_head *head)
1296{
1297 struct ftrace_mod_load *p, *n;
1298
1299 /* stack tracer isn't supported yet */
1300 if (!head)
1301 return;
1302
1303 mutex_lock(&ftrace_lock);
1304 list_for_each_entry_safe(p, n, head, list)
1305 free_ftrace_mod(p);
1306 mutex_unlock(&ftrace_lock);
1307}
1308
1309static void free_ftrace_hash(struct ftrace_hash *hash)
1310{
1311 if (!hash || hash == EMPTY_HASH)
1312 return;
1313 ftrace_hash_clear(hash);
1314 kfree(hash->buckets);
1315 kfree(hash);
1316}
1317
1318static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
1319{
1320 struct ftrace_hash *hash;
1321
1322 hash = container_of(rcu, struct ftrace_hash, rcu);
1323 free_ftrace_hash(hash);
1324}
1325
1326static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
1327{
1328 if (!hash || hash == EMPTY_HASH)
1329 return;
1330 call_rcu_sched(&hash->rcu, __free_ftrace_hash_rcu);
1331}
1332
1333void ftrace_free_filter(struct ftrace_ops *ops)
1334{
1335 ftrace_ops_init(ops);
1336 free_ftrace_hash(ops->func_hash->filter_hash);
1337 free_ftrace_hash(ops->func_hash->notrace_hash);
1338}
1339
1340static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
1341{
1342 struct ftrace_hash *hash;
1343 int size;
1344
1345 hash = kzalloc(sizeof(*hash), GFP_KERNEL);
1346 if (!hash)
1347 return NULL;
1348
1349 size = 1 << size_bits;
1350 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL);
1351
1352 if (!hash->buckets) {
1353 kfree(hash);
1354 return NULL;
1355 }
1356
1357 hash->size_bits = size_bits;
1358
1359 return hash;
1360}
1361
1362
1363static int ftrace_add_mod(struct trace_array *tr,
1364 const char *func, const char *module,
1365 int enable)
1366{
1367 struct ftrace_mod_load *ftrace_mod;
1368 struct list_head *mod_head = enable ? &tr->mod_trace : &tr->mod_notrace;
1369
1370 ftrace_mod = kzalloc(sizeof(*ftrace_mod), GFP_KERNEL);
1371 if (!ftrace_mod)
1372 return -ENOMEM;
1373
1374 ftrace_mod->func = kstrdup(func, GFP_KERNEL);
1375 ftrace_mod->module = kstrdup(module, GFP_KERNEL);
1376 ftrace_mod->enable = enable;
1377
1378 if (!ftrace_mod->func || !ftrace_mod->module)
1379 goto out_free;
1380
1381 list_add(&ftrace_mod->list, mod_head);
1382
1383 return 0;
1384
1385 out_free:
1386 free_ftrace_mod(ftrace_mod);
1387
1388 return -ENOMEM;
1389}
1390
1391static struct ftrace_hash *
1392alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
1393{
1394 struct ftrace_func_entry *entry;
1395 struct ftrace_hash *new_hash;
1396 int size;
1397 int ret;
1398 int i;
1399
1400 new_hash = alloc_ftrace_hash(size_bits);
1401 if (!new_hash)
1402 return NULL;
1403
1404 if (hash)
1405 new_hash->flags = hash->flags;
1406
1407 /* Empty hash? */
1408 if (ftrace_hash_empty(hash))
1409 return new_hash;
1410
1411 size = 1 << hash->size_bits;
1412 for (i = 0; i < size; i++) {
1413 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
1414 ret = add_hash_entry(new_hash, entry->ip);
1415 if (ret < 0)
1416 goto free_hash;
1417 }
1418 }
1419
1420 FTRACE_WARN_ON(new_hash->count != hash->count);
1421
1422 return new_hash;
1423
1424 free_hash:
1425 free_ftrace_hash(new_hash);
1426 return NULL;
1427}
1428
1429static void
1430ftrace_hash_rec_disable_modify(struct ftrace_ops *ops, int filter_hash);
1431static void
1432ftrace_hash_rec_enable_modify(struct ftrace_ops *ops, int filter_hash);
1433
1434static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1435 struct ftrace_hash *new_hash);
1436
1437static struct ftrace_hash *
1438__ftrace_hash_move(struct ftrace_hash *src)
1439{
1440 struct ftrace_func_entry *entry;
1441 struct hlist_node *tn;
1442 struct hlist_head *hhd;
1443 struct ftrace_hash *new_hash;
1444 int size = src->count;
1445 int bits = 0;
1446 int i;
1447
1448 /*
1449 * If the new source is empty, just return the empty_hash.
1450 */
1451 if (ftrace_hash_empty(src))
1452 return EMPTY_HASH;
1453
1454 /*
1455 * Make the hash size about 1/2 the # found
1456 */
1457 for (size /= 2; size; size >>= 1)
1458 bits++;
1459
1460 /* Don't allocate too much */
1461 if (bits > FTRACE_HASH_MAX_BITS)
1462 bits = FTRACE_HASH_MAX_BITS;
1463
1464 new_hash = alloc_ftrace_hash(bits);
1465 if (!new_hash)
1466 return NULL;
1467
1468 new_hash->flags = src->flags;
1469
1470 size = 1 << src->size_bits;
1471 for (i = 0; i < size; i++) {
1472 hhd = &src->buckets[i];
1473 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1474 remove_hash_entry(src, entry);
1475 __add_hash_entry(new_hash, entry);
1476 }
1477 }
1478
1479 return new_hash;
1480}
1481
1482static int
1483ftrace_hash_move(struct ftrace_ops *ops, int enable,
1484 struct ftrace_hash **dst, struct ftrace_hash *src)
1485{
1486 struct ftrace_hash *new_hash;
1487 int ret;
1488
1489 /* Reject setting notrace hash on IPMODIFY ftrace_ops */
1490 if (ops->flags & FTRACE_OPS_FL_IPMODIFY && !enable)
1491 return -EINVAL;
1492
1493 new_hash = __ftrace_hash_move(src);
1494 if (!new_hash)
1495 return -ENOMEM;
1496
1497 /* Make sure this can be applied if it is IPMODIFY ftrace_ops */
1498 if (enable) {
1499 /* IPMODIFY should be updated only when filter_hash updating */
1500 ret = ftrace_hash_ipmodify_update(ops, new_hash);
1501 if (ret < 0) {
1502 free_ftrace_hash(new_hash);
1503 return ret;
1504 }
1505 }
1506
1507 /*
1508 * Remove the current set, update the hash and add
1509 * them back.
1510 */
1511 ftrace_hash_rec_disable_modify(ops, enable);
1512
1513 rcu_assign_pointer(*dst, new_hash);
1514
1515 ftrace_hash_rec_enable_modify(ops, enable);
1516
1517 return 0;
1518}
1519
1520static bool hash_contains_ip(unsigned long ip,
1521 struct ftrace_ops_hash *hash)
1522{
1523 /*
1524 * The function record is a match if it exists in the filter
1525 * hash and not in the notrace hash. Note, an emty hash is
1526 * considered a match for the filter hash, but an empty
1527 * notrace hash is considered not in the notrace hash.
1528 */
1529 return (ftrace_hash_empty(hash->filter_hash) ||
1530 __ftrace_lookup_ip(hash->filter_hash, ip)) &&
1531 (ftrace_hash_empty(hash->notrace_hash) ||
1532 !__ftrace_lookup_ip(hash->notrace_hash, ip));
1533}
1534
1535/*
1536 * Test the hashes for this ops to see if we want to call
1537 * the ops->func or not.
1538 *
1539 * It's a match if the ip is in the ops->filter_hash or
1540 * the filter_hash does not exist or is empty,
1541 * AND
1542 * the ip is not in the ops->notrace_hash.
1543 *
1544 * This needs to be called with preemption disabled as
1545 * the hashes are freed with call_rcu_sched().
1546 */
1547static int
1548ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1549{
1550 struct ftrace_ops_hash hash;
1551 int ret;
1552
1553#ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1554 /*
1555 * There's a small race when adding ops that the ftrace handler
1556 * that wants regs, may be called without them. We can not
1557 * allow that handler to be called if regs is NULL.
1558 */
1559 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1560 return 0;
1561#endif
1562
1563 rcu_assign_pointer(hash.filter_hash, ops->func_hash->filter_hash);
1564 rcu_assign_pointer(hash.notrace_hash, ops->func_hash->notrace_hash);
1565
1566 if (hash_contains_ip(ip, &hash))
1567 ret = 1;
1568 else
1569 ret = 0;
1570
1571 return ret;
1572}
1573
1574/*
1575 * This is a double for. Do not use 'break' to break out of the loop,
1576 * you must use a goto.
1577 */
1578#define do_for_each_ftrace_rec(pg, rec) \
1579 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1580 int _____i; \
1581 for (_____i = 0; _____i < pg->index; _____i++) { \
1582 rec = &pg->records[_____i];
1583
1584#define while_for_each_ftrace_rec() \
1585 } \
1586 }
1587
1588
1589static int ftrace_cmp_recs(const void *a, const void *b)
1590{
1591 const struct dyn_ftrace *key = a;
1592 const struct dyn_ftrace *rec = b;
1593
1594 if (key->flags < rec->ip)
1595 return -1;
1596 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1597 return 1;
1598 return 0;
1599}
1600
1601/**
1602 * ftrace_location_range - return the first address of a traced location
1603 * if it touches the given ip range
1604 * @start: start of range to search.
1605 * @end: end of range to search (inclusive). @end points to the last byte
1606 * to check.
1607 *
1608 * Returns rec->ip if the related ftrace location is a least partly within
1609 * the given address range. That is, the first address of the instruction
1610 * that is either a NOP or call to the function tracer. It checks the ftrace
1611 * internal tables to determine if the address belongs or not.
1612 */
1613unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1614{
1615 struct ftrace_page *pg;
1616 struct dyn_ftrace *rec;
1617 struct dyn_ftrace key;
1618
1619 key.ip = start;
1620 key.flags = end; /* overload flags, as it is unsigned long */
1621
1622 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1623 if (end < pg->records[0].ip ||
1624 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1625 continue;
1626 rec = bsearch(&key, pg->records, pg->index,
1627 sizeof(struct dyn_ftrace),
1628 ftrace_cmp_recs);
1629 if (rec)
1630 return rec->ip;
1631 }
1632
1633 return 0;
1634}
1635
1636/**
1637 * ftrace_location - return true if the ip giving is a traced location
1638 * @ip: the instruction pointer to check
1639 *
1640 * Returns rec->ip if @ip given is a pointer to a ftrace location.
1641 * That is, the instruction that is either a NOP or call to
1642 * the function tracer. It checks the ftrace internal tables to
1643 * determine if the address belongs or not.
1644 */
1645unsigned long ftrace_location(unsigned long ip)
1646{
1647 return ftrace_location_range(ip, ip);
1648}
1649
1650/**
1651 * ftrace_text_reserved - return true if range contains an ftrace location
1652 * @start: start of range to search
1653 * @end: end of range to search (inclusive). @end points to the last byte to check.
1654 *
1655 * Returns 1 if @start and @end contains a ftrace location.
1656 * That is, the instruction that is either a NOP or call to
1657 * the function tracer. It checks the ftrace internal tables to
1658 * determine if the address belongs or not.
1659 */
1660int ftrace_text_reserved(const void *start, const void *end)
1661{
1662 unsigned long ret;
1663
1664 ret = ftrace_location_range((unsigned long)start,
1665 (unsigned long)end);
1666
1667 return (int)!!ret;
1668}
1669
1670/* Test if ops registered to this rec needs regs */
1671static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1672{
1673 struct ftrace_ops *ops;
1674 bool keep_regs = false;
1675
1676 for (ops = ftrace_ops_list;
1677 ops != &ftrace_list_end; ops = ops->next) {
1678 /* pass rec in as regs to have non-NULL val */
1679 if (ftrace_ops_test(ops, rec->ip, rec)) {
1680 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1681 keep_regs = true;
1682 break;
1683 }
1684 }
1685 }
1686
1687 return keep_regs;
1688}
1689
1690static bool __ftrace_hash_rec_update(struct ftrace_ops *ops,
1691 int filter_hash,
1692 bool inc)
1693{
1694 struct ftrace_hash *hash;
1695 struct ftrace_hash *other_hash;
1696 struct ftrace_page *pg;
1697 struct dyn_ftrace *rec;
1698 bool update = false;
1699 int count = 0;
1700 int all = false;
1701
1702 /* Only update if the ops has been registered */
1703 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1704 return false;
1705
1706 /*
1707 * In the filter_hash case:
1708 * If the count is zero, we update all records.
1709 * Otherwise we just update the items in the hash.
1710 *
1711 * In the notrace_hash case:
1712 * We enable the update in the hash.
1713 * As disabling notrace means enabling the tracing,
1714 * and enabling notrace means disabling, the inc variable
1715 * gets inversed.
1716 */
1717 if (filter_hash) {
1718 hash = ops->func_hash->filter_hash;
1719 other_hash = ops->func_hash->notrace_hash;
1720 if (ftrace_hash_empty(hash))
1721 all = true;
1722 } else {
1723 inc = !inc;
1724 hash = ops->func_hash->notrace_hash;
1725 other_hash = ops->func_hash->filter_hash;
1726 /*
1727 * If the notrace hash has no items,
1728 * then there's nothing to do.
1729 */
1730 if (ftrace_hash_empty(hash))
1731 return false;
1732 }
1733
1734 do_for_each_ftrace_rec(pg, rec) {
1735 int in_other_hash = 0;
1736 int in_hash = 0;
1737 int match = 0;
1738
1739 if (rec->flags & FTRACE_FL_DISABLED)
1740 continue;
1741
1742 if (all) {
1743 /*
1744 * Only the filter_hash affects all records.
1745 * Update if the record is not in the notrace hash.
1746 */
1747 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1748 match = 1;
1749 } else {
1750 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1751 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1752
1753 /*
1754 * If filter_hash is set, we want to match all functions
1755 * that are in the hash but not in the other hash.
1756 *
1757 * If filter_hash is not set, then we are decrementing.
1758 * That means we match anything that is in the hash
1759 * and also in the other_hash. That is, we need to turn
1760 * off functions in the other hash because they are disabled
1761 * by this hash.
1762 */
1763 if (filter_hash && in_hash && !in_other_hash)
1764 match = 1;
1765 else if (!filter_hash && in_hash &&
1766 (in_other_hash || ftrace_hash_empty(other_hash)))
1767 match = 1;
1768 }
1769 if (!match)
1770 continue;
1771
1772 if (inc) {
1773 rec->flags++;
1774 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1775 return false;
1776
1777 /*
1778 * If there's only a single callback registered to a
1779 * function, and the ops has a trampoline registered
1780 * for it, then we can call it directly.
1781 */
1782 if (ftrace_rec_count(rec) == 1 && ops->trampoline)
1783 rec->flags |= FTRACE_FL_TRAMP;
1784 else
1785 /*
1786 * If we are adding another function callback
1787 * to this function, and the previous had a
1788 * custom trampoline in use, then we need to go
1789 * back to the default trampoline.
1790 */
1791 rec->flags &= ~FTRACE_FL_TRAMP;
1792
1793 /*
1794 * If any ops wants regs saved for this function
1795 * then all ops will get saved regs.
1796 */
1797 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1798 rec->flags |= FTRACE_FL_REGS;
1799 } else {
1800 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1801 return false;
1802 rec->flags--;
1803
1804 /*
1805 * If the rec had REGS enabled and the ops that is
1806 * being removed had REGS set, then see if there is
1807 * still any ops for this record that wants regs.
1808 * If not, we can stop recording them.
1809 */
1810 if (ftrace_rec_count(rec) > 0 &&
1811 rec->flags & FTRACE_FL_REGS &&
1812 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1813 if (!test_rec_ops_needs_regs(rec))
1814 rec->flags &= ~FTRACE_FL_REGS;
1815 }
1816
1817 /*
1818 * If the rec had TRAMP enabled, then it needs to
1819 * be cleared. As TRAMP can only be enabled iff
1820 * there is only a single ops attached to it.
1821 * In otherwords, always disable it on decrementing.
1822 * In the future, we may set it if rec count is
1823 * decremented to one, and the ops that is left
1824 * has a trampoline.
1825 */
1826 rec->flags &= ~FTRACE_FL_TRAMP;
1827
1828 /*
1829 * flags will be cleared in ftrace_check_record()
1830 * if rec count is zero.
1831 */
1832 }
1833 count++;
1834
1835 /* Must match FTRACE_UPDATE_CALLS in ftrace_modify_all_code() */
1836 update |= ftrace_test_record(rec, 1) != FTRACE_UPDATE_IGNORE;
1837
1838 /* Shortcut, if we handled all records, we are done. */
1839 if (!all && count == hash->count)
1840 return update;
1841 } while_for_each_ftrace_rec();
1842
1843 return update;
1844}
1845
1846static bool ftrace_hash_rec_disable(struct ftrace_ops *ops,
1847 int filter_hash)
1848{
1849 return __ftrace_hash_rec_update(ops, filter_hash, 0);
1850}
1851
1852static bool ftrace_hash_rec_enable(struct ftrace_ops *ops,
1853 int filter_hash)
1854{
1855 return __ftrace_hash_rec_update(ops, filter_hash, 1);
1856}
1857
1858static void ftrace_hash_rec_update_modify(struct ftrace_ops *ops,
1859 int filter_hash, int inc)
1860{
1861 struct ftrace_ops *op;
1862
1863 __ftrace_hash_rec_update(ops, filter_hash, inc);
1864
1865 if (ops->func_hash != &global_ops.local_hash)
1866 return;
1867
1868 /*
1869 * If the ops shares the global_ops hash, then we need to update
1870 * all ops that are enabled and use this hash.
1871 */
1872 do_for_each_ftrace_op(op, ftrace_ops_list) {
1873 /* Already done */
1874 if (op == ops)
1875 continue;
1876 if (op->func_hash == &global_ops.local_hash)
1877 __ftrace_hash_rec_update(op, filter_hash, inc);
1878 } while_for_each_ftrace_op(op);
1879}
1880
1881static void ftrace_hash_rec_disable_modify(struct ftrace_ops *ops,
1882 int filter_hash)
1883{
1884 ftrace_hash_rec_update_modify(ops, filter_hash, 0);
1885}
1886
1887static void ftrace_hash_rec_enable_modify(struct ftrace_ops *ops,
1888 int filter_hash)
1889{
1890 ftrace_hash_rec_update_modify(ops, filter_hash, 1);
1891}
1892
1893/*
1894 * Try to update IPMODIFY flag on each ftrace_rec. Return 0 if it is OK
1895 * or no-needed to update, -EBUSY if it detects a conflict of the flag
1896 * on a ftrace_rec, and -EINVAL if the new_hash tries to trace all recs.
1897 * Note that old_hash and new_hash has below meanings
1898 * - If the hash is NULL, it hits all recs (if IPMODIFY is set, this is rejected)
1899 * - If the hash is EMPTY_HASH, it hits nothing
1900 * - Anything else hits the recs which match the hash entries.
1901 */
1902static int __ftrace_hash_update_ipmodify(struct ftrace_ops *ops,
1903 struct ftrace_hash *old_hash,
1904 struct ftrace_hash *new_hash)
1905{
1906 struct ftrace_page *pg;
1907 struct dyn_ftrace *rec, *end = NULL;
1908 int in_old, in_new;
1909
1910 /* Only update if the ops has been registered */
1911 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1912 return 0;
1913
1914 if (!(ops->flags & FTRACE_OPS_FL_IPMODIFY))
1915 return 0;
1916
1917 /*
1918 * Since the IPMODIFY is a very address sensitive action, we do not
1919 * allow ftrace_ops to set all functions to new hash.
1920 */
1921 if (!new_hash || !old_hash)
1922 return -EINVAL;
1923
1924 /* Update rec->flags */
1925 do_for_each_ftrace_rec(pg, rec) {
1926
1927 if (rec->flags & FTRACE_FL_DISABLED)
1928 continue;
1929
1930 /* We need to update only differences of filter_hash */
1931 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1932 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1933 if (in_old == in_new)
1934 continue;
1935
1936 if (in_new) {
1937 /* New entries must ensure no others are using it */
1938 if (rec->flags & FTRACE_FL_IPMODIFY)
1939 goto rollback;
1940 rec->flags |= FTRACE_FL_IPMODIFY;
1941 } else /* Removed entry */
1942 rec->flags &= ~FTRACE_FL_IPMODIFY;
1943 } while_for_each_ftrace_rec();
1944
1945 return 0;
1946
1947rollback:
1948 end = rec;
1949
1950 /* Roll back what we did above */
1951 do_for_each_ftrace_rec(pg, rec) {
1952
1953 if (rec->flags & FTRACE_FL_DISABLED)
1954 continue;
1955
1956 if (rec == end)
1957 goto err_out;
1958
1959 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1960 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1961 if (in_old == in_new)
1962 continue;
1963
1964 if (in_new)
1965 rec->flags &= ~FTRACE_FL_IPMODIFY;
1966 else
1967 rec->flags |= FTRACE_FL_IPMODIFY;
1968 } while_for_each_ftrace_rec();
1969
1970err_out:
1971 return -EBUSY;
1972}
1973
1974static int ftrace_hash_ipmodify_enable(struct ftrace_ops *ops)
1975{
1976 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1977
1978 if (ftrace_hash_empty(hash))
1979 hash = NULL;
1980
1981 return __ftrace_hash_update_ipmodify(ops, EMPTY_HASH, hash);
1982}
1983
1984/* Disabling always succeeds */
1985static void ftrace_hash_ipmodify_disable(struct ftrace_ops *ops)
1986{
1987 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1988
1989 if (ftrace_hash_empty(hash))
1990 hash = NULL;
1991
1992 __ftrace_hash_update_ipmodify(ops, hash, EMPTY_HASH);
1993}
1994
1995static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1996 struct ftrace_hash *new_hash)
1997{
1998 struct ftrace_hash *old_hash = ops->func_hash->filter_hash;
1999
2000 if (ftrace_hash_empty(old_hash))
2001 old_hash = NULL;
2002
2003 if (ftrace_hash_empty(new_hash))
2004 new_hash = NULL;
2005
2006 return __ftrace_hash_update_ipmodify(ops, old_hash, new_hash);
2007}
2008
2009static void print_ip_ins(const char *fmt, const unsigned char *p)
2010{
2011 int i;
2012
2013 printk(KERN_CONT "%s", fmt);
2014
2015 for (i = 0; i < MCOUNT_INSN_SIZE; i++)
2016 printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
2017}
2018
2019static struct ftrace_ops *
2020ftrace_find_tramp_ops_any(struct dyn_ftrace *rec);
2021static struct ftrace_ops *
2022ftrace_find_tramp_ops_next(struct dyn_ftrace *rec, struct ftrace_ops *ops);
2023
2024enum ftrace_bug_type ftrace_bug_type;
2025const void *ftrace_expected;
2026
2027static void print_bug_type(void)
2028{
2029 switch (ftrace_bug_type) {
2030 case FTRACE_BUG_UNKNOWN:
2031 break;
2032 case FTRACE_BUG_INIT:
2033 pr_info("Initializing ftrace call sites\n");
2034 break;
2035 case FTRACE_BUG_NOP:
2036 pr_info("Setting ftrace call site to NOP\n");
2037 break;
2038 case FTRACE_BUG_CALL:
2039 pr_info("Setting ftrace call site to call ftrace function\n");
2040 break;
2041 case FTRACE_BUG_UPDATE:
2042 pr_info("Updating ftrace call site to call a different ftrace function\n");
2043 break;
2044 }
2045}
2046
2047/**
2048 * ftrace_bug - report and shutdown function tracer
2049 * @failed: The failed type (EFAULT, EINVAL, EPERM)
2050 * @rec: The record that failed
2051 *
2052 * The arch code that enables or disables the function tracing
2053 * can call ftrace_bug() when it has detected a problem in
2054 * modifying the code. @failed should be one of either:
2055 * EFAULT - if the problem happens on reading the @ip address
2056 * EINVAL - if what is read at @ip is not what was expected
2057 * EPERM - if the problem happens on writting to the @ip address
2058 */
2059void ftrace_bug(int failed, struct dyn_ftrace *rec)
2060{
2061 unsigned long ip = rec ? rec->ip : 0;
2062
2063 switch (failed) {
2064 case -EFAULT:
2065 FTRACE_WARN_ON_ONCE(1);
2066 pr_info("ftrace faulted on modifying ");
2067 print_ip_sym(ip);
2068 break;
2069 case -EINVAL:
2070 FTRACE_WARN_ON_ONCE(1);
2071 pr_info("ftrace failed to modify ");
2072 print_ip_sym(ip);
2073 print_ip_ins(" actual: ", (unsigned char *)ip);
2074 pr_cont("\n");
2075 if (ftrace_expected) {
2076 print_ip_ins(" expected: ", ftrace_expected);
2077 pr_cont("\n");
2078 }
2079 break;
2080 case -EPERM:
2081 FTRACE_WARN_ON_ONCE(1);
2082 pr_info("ftrace faulted on writing ");
2083 print_ip_sym(ip);
2084 break;
2085 default:
2086 FTRACE_WARN_ON_ONCE(1);
2087 pr_info("ftrace faulted on unknown error ");
2088 print_ip_sym(ip);
2089 }
2090 print_bug_type();
2091 if (rec) {
2092 struct ftrace_ops *ops = NULL;
2093
2094 pr_info("ftrace record flags: %lx\n", rec->flags);
2095 pr_cont(" (%ld)%s", ftrace_rec_count(rec),
2096 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2097 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2098 ops = ftrace_find_tramp_ops_any(rec);
2099 if (ops) {
2100 do {
2101 pr_cont("\ttramp: %pS (%pS)",
2102 (void *)ops->trampoline,
2103 (void *)ops->func);
2104 ops = ftrace_find_tramp_ops_next(rec, ops);
2105 } while (ops);
2106 } else
2107 pr_cont("\ttramp: ERROR!");
2108
2109 }
2110 ip = ftrace_get_addr_curr(rec);
2111 pr_cont("\n expected tramp: %lx\n", ip);
2112 }
2113}
2114
2115static int ftrace_check_record(struct dyn_ftrace *rec, int enable, int update)
2116{
2117 unsigned long flag = 0UL;
2118
2119 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2120
2121 if (rec->flags & FTRACE_FL_DISABLED)
2122 return FTRACE_UPDATE_IGNORE;
2123
2124 /*
2125 * If we are updating calls:
2126 *
2127 * If the record has a ref count, then we need to enable it
2128 * because someone is using it.
2129 *
2130 * Otherwise we make sure its disabled.
2131 *
2132 * If we are disabling calls, then disable all records that
2133 * are enabled.
2134 */
2135 if (enable && ftrace_rec_count(rec))
2136 flag = FTRACE_FL_ENABLED;
2137
2138 /*
2139 * If enabling and the REGS flag does not match the REGS_EN, or
2140 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
2141 * this record. Set flags to fail the compare against ENABLED.
2142 */
2143 if (flag) {
2144 if (!(rec->flags & FTRACE_FL_REGS) !=
2145 !(rec->flags & FTRACE_FL_REGS_EN))
2146 flag |= FTRACE_FL_REGS;
2147
2148 if (!(rec->flags & FTRACE_FL_TRAMP) !=
2149 !(rec->flags & FTRACE_FL_TRAMP_EN))
2150 flag |= FTRACE_FL_TRAMP;
2151 }
2152
2153 /* If the state of this record hasn't changed, then do nothing */
2154 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
2155 return FTRACE_UPDATE_IGNORE;
2156
2157 if (flag) {
2158 /* Save off if rec is being enabled (for return value) */
2159 flag ^= rec->flags & FTRACE_FL_ENABLED;
2160
2161 if (update) {
2162 rec->flags |= FTRACE_FL_ENABLED;
2163 if (flag & FTRACE_FL_REGS) {
2164 if (rec->flags & FTRACE_FL_REGS)
2165 rec->flags |= FTRACE_FL_REGS_EN;
2166 else
2167 rec->flags &= ~FTRACE_FL_REGS_EN;
2168 }
2169 if (flag & FTRACE_FL_TRAMP) {
2170 if (rec->flags & FTRACE_FL_TRAMP)
2171 rec->flags |= FTRACE_FL_TRAMP_EN;
2172 else
2173 rec->flags &= ~FTRACE_FL_TRAMP_EN;
2174 }
2175 }
2176
2177 /*
2178 * If this record is being updated from a nop, then
2179 * return UPDATE_MAKE_CALL.
2180 * Otherwise,
2181 * return UPDATE_MODIFY_CALL to tell the caller to convert
2182 * from the save regs, to a non-save regs function or
2183 * vice versa, or from a trampoline call.
2184 */
2185 if (flag & FTRACE_FL_ENABLED) {
2186 ftrace_bug_type = FTRACE_BUG_CALL;
2187 return FTRACE_UPDATE_MAKE_CALL;
2188 }
2189
2190 ftrace_bug_type = FTRACE_BUG_UPDATE;
2191 return FTRACE_UPDATE_MODIFY_CALL;
2192 }
2193
2194 if (update) {
2195 /* If there's no more users, clear all flags */
2196 if (!ftrace_rec_count(rec))
2197 rec->flags = 0;
2198 else
2199 /*
2200 * Just disable the record, but keep the ops TRAMP
2201 * and REGS states. The _EN flags must be disabled though.
2202 */
2203 rec->flags &= ~(FTRACE_FL_ENABLED | FTRACE_FL_TRAMP_EN |
2204 FTRACE_FL_REGS_EN);
2205 }
2206
2207 ftrace_bug_type = FTRACE_BUG_NOP;
2208 return FTRACE_UPDATE_MAKE_NOP;
2209}
2210
2211/**
2212 * ftrace_update_record, set a record that now is tracing or not
2213 * @rec: the record to update
2214 * @enable: set to 1 if the record is tracing, zero to force disable
2215 *
2216 * The records that represent all functions that can be traced need
2217 * to be updated when tracing has been enabled.
2218 */
2219int ftrace_update_record(struct dyn_ftrace *rec, int enable)
2220{
2221 return ftrace_check_record(rec, enable, 1);
2222}
2223
2224/**
2225 * ftrace_test_record, check if the record has been enabled or not
2226 * @rec: the record to test
2227 * @enable: set to 1 to check if enabled, 0 if it is disabled
2228 *
2229 * The arch code may need to test if a record is already set to
2230 * tracing to determine how to modify the function code that it
2231 * represents.
2232 */
2233int ftrace_test_record(struct dyn_ftrace *rec, int enable)
2234{
2235 return ftrace_check_record(rec, enable, 0);
2236}
2237
2238static struct ftrace_ops *
2239ftrace_find_tramp_ops_any(struct dyn_ftrace *rec)
2240{
2241 struct ftrace_ops *op;
2242 unsigned long ip = rec->ip;
2243
2244 do_for_each_ftrace_op(op, ftrace_ops_list) {
2245
2246 if (!op->trampoline)
2247 continue;
2248
2249 if (hash_contains_ip(ip, op->func_hash))
2250 return op;
2251 } while_for_each_ftrace_op(op);
2252
2253 return NULL;
2254}
2255
2256static struct ftrace_ops *
2257ftrace_find_tramp_ops_next(struct dyn_ftrace *rec,
2258 struct ftrace_ops *op)
2259{
2260 unsigned long ip = rec->ip;
2261
2262 while_for_each_ftrace_op(op) {
2263
2264 if (!op->trampoline)
2265 continue;
2266
2267 if (hash_contains_ip(ip, op->func_hash))
2268 return op;
2269 }
2270
2271 return NULL;
2272}
2273
2274static struct ftrace_ops *
2275ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
2276{
2277 struct ftrace_ops *op;
2278 unsigned long ip = rec->ip;
2279
2280 /*
2281 * Need to check removed ops first.
2282 * If they are being removed, and this rec has a tramp,
2283 * and this rec is in the ops list, then it would be the
2284 * one with the tramp.
2285 */
2286 if (removed_ops) {
2287 if (hash_contains_ip(ip, &removed_ops->old_hash))
2288 return removed_ops;
2289 }
2290
2291 /*
2292 * Need to find the current trampoline for a rec.
2293 * Now, a trampoline is only attached to a rec if there
2294 * was a single 'ops' attached to it. But this can be called
2295 * when we are adding another op to the rec or removing the
2296 * current one. Thus, if the op is being added, we can
2297 * ignore it because it hasn't attached itself to the rec
2298 * yet.
2299 *
2300 * If an ops is being modified (hooking to different functions)
2301 * then we don't care about the new functions that are being
2302 * added, just the old ones (that are probably being removed).
2303 *
2304 * If we are adding an ops to a function that already is using
2305 * a trampoline, it needs to be removed (trampolines are only
2306 * for single ops connected), then an ops that is not being
2307 * modified also needs to be checked.
2308 */
2309 do_for_each_ftrace_op(op, ftrace_ops_list) {
2310
2311 if (!op->trampoline)
2312 continue;
2313
2314 /*
2315 * If the ops is being added, it hasn't gotten to
2316 * the point to be removed from this tree yet.
2317 */
2318 if (op->flags & FTRACE_OPS_FL_ADDING)
2319 continue;
2320
2321
2322 /*
2323 * If the ops is being modified and is in the old
2324 * hash, then it is probably being removed from this
2325 * function.
2326 */
2327 if ((op->flags & FTRACE_OPS_FL_MODIFYING) &&
2328 hash_contains_ip(ip, &op->old_hash))
2329 return op;
2330 /*
2331 * If the ops is not being added or modified, and it's
2332 * in its normal filter hash, then this must be the one
2333 * we want!
2334 */
2335 if (!(op->flags & FTRACE_OPS_FL_MODIFYING) &&
2336 hash_contains_ip(ip, op->func_hash))
2337 return op;
2338
2339 } while_for_each_ftrace_op(op);
2340
2341 return NULL;
2342}
2343
2344static struct ftrace_ops *
2345ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
2346{
2347 struct ftrace_ops *op;
2348 unsigned long ip = rec->ip;
2349
2350 do_for_each_ftrace_op(op, ftrace_ops_list) {
2351 /* pass rec in as regs to have non-NULL val */
2352 if (hash_contains_ip(ip, op->func_hash))
2353 return op;
2354 } while_for_each_ftrace_op(op);
2355
2356 return NULL;
2357}
2358
2359/**
2360 * ftrace_get_addr_new - Get the call address to set to
2361 * @rec: The ftrace record descriptor
2362 *
2363 * If the record has the FTRACE_FL_REGS set, that means that it
2364 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
2365 * is not not set, then it wants to convert to the normal callback.
2366 *
2367 * Returns the address of the trampoline to set to
2368 */
2369unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
2370{
2371 struct ftrace_ops *ops;
2372
2373 /* Trampolines take precedence over regs */
2374 if (rec->flags & FTRACE_FL_TRAMP) {
2375 ops = ftrace_find_tramp_ops_new(rec);
2376 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
2377 pr_warn("Bad trampoline accounting at: %p (%pS) (%lx)\n",
2378 (void *)rec->ip, (void *)rec->ip, rec->flags);
2379 /* Ftrace is shutting down, return anything */
2380 return (unsigned long)FTRACE_ADDR;
2381 }
2382 return ops->trampoline;
2383 }
2384
2385 if (rec->flags & FTRACE_FL_REGS)
2386 return (unsigned long)FTRACE_REGS_ADDR;
2387 else
2388 return (unsigned long)FTRACE_ADDR;
2389}
2390
2391/**
2392 * ftrace_get_addr_curr - Get the call address that is already there
2393 * @rec: The ftrace record descriptor
2394 *
2395 * The FTRACE_FL_REGS_EN is set when the record already points to
2396 * a function that saves all the regs. Basically the '_EN' version
2397 * represents the current state of the function.
2398 *
2399 * Returns the address of the trampoline that is currently being called
2400 */
2401unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
2402{
2403 struct ftrace_ops *ops;
2404
2405 /* Trampolines take precedence over regs */
2406 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2407 ops = ftrace_find_tramp_ops_curr(rec);
2408 if (FTRACE_WARN_ON(!ops)) {
2409 pr_warn("Bad trampoline accounting at: %p (%pS)\n",
2410 (void *)rec->ip, (void *)rec->ip);
2411 /* Ftrace is shutting down, return anything */
2412 return (unsigned long)FTRACE_ADDR;
2413 }
2414 return ops->trampoline;
2415 }
2416
2417 if (rec->flags & FTRACE_FL_REGS_EN)
2418 return (unsigned long)FTRACE_REGS_ADDR;
2419 else
2420 return (unsigned long)FTRACE_ADDR;
2421}
2422
2423static int
2424__ftrace_replace_code(struct dyn_ftrace *rec, int enable)
2425{
2426 unsigned long ftrace_old_addr;
2427 unsigned long ftrace_addr;
2428 int ret;
2429
2430 ftrace_addr = ftrace_get_addr_new(rec);
2431
2432 /* This needs to be done before we call ftrace_update_record */
2433 ftrace_old_addr = ftrace_get_addr_curr(rec);
2434
2435 ret = ftrace_update_record(rec, enable);
2436
2437 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2438
2439 switch (ret) {
2440 case FTRACE_UPDATE_IGNORE:
2441 return 0;
2442
2443 case FTRACE_UPDATE_MAKE_CALL:
2444 ftrace_bug_type = FTRACE_BUG_CALL;
2445 return ftrace_make_call(rec, ftrace_addr);
2446
2447 case FTRACE_UPDATE_MAKE_NOP:
2448 ftrace_bug_type = FTRACE_BUG_NOP;
2449 return ftrace_make_nop(NULL, rec, ftrace_old_addr);
2450
2451 case FTRACE_UPDATE_MODIFY_CALL:
2452 ftrace_bug_type = FTRACE_BUG_UPDATE;
2453 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
2454 }
2455
2456 return -1; /* unknow ftrace bug */
2457}
2458
2459void __weak ftrace_replace_code(int enable)
2460{
2461 struct dyn_ftrace *rec;
2462 struct ftrace_page *pg;
2463 int failed;
2464
2465 if (unlikely(ftrace_disabled))
2466 return;
2467
2468 do_for_each_ftrace_rec(pg, rec) {
2469
2470 if (rec->flags & FTRACE_FL_DISABLED)
2471 continue;
2472
2473 failed = __ftrace_replace_code(rec, enable);
2474 if (failed) {
2475 ftrace_bug(failed, rec);
2476 /* Stop processing */
2477 return;
2478 }
2479 } while_for_each_ftrace_rec();
2480}
2481
2482struct ftrace_rec_iter {
2483 struct ftrace_page *pg;
2484 int index;
2485};
2486
2487/**
2488 * ftrace_rec_iter_start, start up iterating over traced functions
2489 *
2490 * Returns an iterator handle that is used to iterate over all
2491 * the records that represent address locations where functions
2492 * are traced.
2493 *
2494 * May return NULL if no records are available.
2495 */
2496struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2497{
2498 /*
2499 * We only use a single iterator.
2500 * Protected by the ftrace_lock mutex.
2501 */
2502 static struct ftrace_rec_iter ftrace_rec_iter;
2503 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2504
2505 iter->pg = ftrace_pages_start;
2506 iter->index = 0;
2507
2508 /* Could have empty pages */
2509 while (iter->pg && !iter->pg->index)
2510 iter->pg = iter->pg->next;
2511
2512 if (!iter->pg)
2513 return NULL;
2514
2515 return iter;
2516}
2517
2518/**
2519 * ftrace_rec_iter_next, get the next record to process.
2520 * @iter: The handle to the iterator.
2521 *
2522 * Returns the next iterator after the given iterator @iter.
2523 */
2524struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2525{
2526 iter->index++;
2527
2528 if (iter->index >= iter->pg->index) {
2529 iter->pg = iter->pg->next;
2530 iter->index = 0;
2531
2532 /* Could have empty pages */
2533 while (iter->pg && !iter->pg->index)
2534 iter->pg = iter->pg->next;
2535 }
2536
2537 if (!iter->pg)
2538 return NULL;
2539
2540 return iter;
2541}
2542
2543/**
2544 * ftrace_rec_iter_record, get the record at the iterator location
2545 * @iter: The current iterator location
2546 *
2547 * Returns the record that the current @iter is at.
2548 */
2549struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2550{
2551 return &iter->pg->records[iter->index];
2552}
2553
2554static int
2555ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
2556{
2557 int ret;
2558
2559 if (unlikely(ftrace_disabled))
2560 return 0;
2561
2562 ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
2563 if (ret) {
2564 ftrace_bug_type = FTRACE_BUG_INIT;
2565 ftrace_bug(ret, rec);
2566 return 0;
2567 }
2568 return 1;
2569}
2570
2571/*
2572 * archs can override this function if they must do something
2573 * before the modifying code is performed.
2574 */
2575int __weak ftrace_arch_code_modify_prepare(void)
2576{
2577 return 0;
2578}
2579
2580/*
2581 * archs can override this function if they must do something
2582 * after the modifying code is performed.
2583 */
2584int __weak ftrace_arch_code_modify_post_process(void)
2585{
2586 return 0;
2587}
2588
2589void ftrace_modify_all_code(int command)
2590{
2591 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2592 int err = 0;
2593
2594 /*
2595 * If the ftrace_caller calls a ftrace_ops func directly,
2596 * we need to make sure that it only traces functions it
2597 * expects to trace. When doing the switch of functions,
2598 * we need to update to the ftrace_ops_list_func first
2599 * before the transition between old and new calls are set,
2600 * as the ftrace_ops_list_func will check the ops hashes
2601 * to make sure the ops are having the right functions
2602 * traced.
2603 */
2604 if (update) {
2605 err = ftrace_update_ftrace_func(ftrace_ops_list_func);
2606 if (FTRACE_WARN_ON(err))
2607 return;
2608 }
2609
2610 if (command & FTRACE_UPDATE_CALLS)
2611 ftrace_replace_code(1);
2612 else if (command & FTRACE_DISABLE_CALLS)
2613 ftrace_replace_code(0);
2614
2615 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2616 function_trace_op = set_function_trace_op;
2617 smp_wmb();
2618 /* If irqs are disabled, we are in stop machine */
2619 if (!irqs_disabled())
2620 smp_call_function(ftrace_sync_ipi, NULL, 1);
2621 err = ftrace_update_ftrace_func(ftrace_trace_function);
2622 if (FTRACE_WARN_ON(err))
2623 return;
2624 }
2625
2626 if (command & FTRACE_START_FUNC_RET)
2627 err = ftrace_enable_ftrace_graph_caller();
2628 else if (command & FTRACE_STOP_FUNC_RET)
2629 err = ftrace_disable_ftrace_graph_caller();
2630 FTRACE_WARN_ON(err);
2631}
2632
2633static int __ftrace_modify_code(void *data)
2634{
2635 int *command = data;
2636
2637 ftrace_modify_all_code(*command);
2638
2639 return 0;
2640}
2641
2642/**
2643 * ftrace_run_stop_machine, go back to the stop machine method
2644 * @command: The command to tell ftrace what to do
2645 *
2646 * If an arch needs to fall back to the stop machine method, the
2647 * it can call this function.
2648 */
2649void ftrace_run_stop_machine(int command)
2650{
2651 stop_machine(__ftrace_modify_code, &command, NULL);
2652}
2653
2654/**
2655 * arch_ftrace_update_code, modify the code to trace or not trace
2656 * @command: The command that needs to be done
2657 *
2658 * Archs can override this function if it does not need to
2659 * run stop_machine() to modify code.
2660 */
2661void __weak arch_ftrace_update_code(int command)
2662{
2663 ftrace_run_stop_machine(command);
2664}
2665
2666static void ftrace_run_update_code(int command)
2667{
2668 int ret;
2669
2670 ret = ftrace_arch_code_modify_prepare();
2671 FTRACE_WARN_ON(ret);
2672 if (ret)
2673 return;
2674
2675 /*
2676 * By default we use stop_machine() to modify the code.
2677 * But archs can do what ever they want as long as it
2678 * is safe. The stop_machine() is the safest, but also
2679 * produces the most overhead.
2680 */
2681 arch_ftrace_update_code(command);
2682
2683 ret = ftrace_arch_code_modify_post_process();
2684 FTRACE_WARN_ON(ret);
2685}
2686
2687static void ftrace_run_modify_code(struct ftrace_ops *ops, int command,
2688 struct ftrace_ops_hash *old_hash)
2689{
2690 ops->flags |= FTRACE_OPS_FL_MODIFYING;
2691 ops->old_hash.filter_hash = old_hash->filter_hash;
2692 ops->old_hash.notrace_hash = old_hash->notrace_hash;
2693 ftrace_run_update_code(command);
2694 ops->old_hash.filter_hash = NULL;
2695 ops->old_hash.notrace_hash = NULL;
2696 ops->flags &= ~FTRACE_OPS_FL_MODIFYING;
2697}
2698
2699static ftrace_func_t saved_ftrace_func;
2700static int ftrace_start_up;
2701
2702void __weak arch_ftrace_trampoline_free(struct ftrace_ops *ops)
2703{
2704}
2705
2706static void ftrace_startup_enable(int command)
2707{
2708 if (saved_ftrace_func != ftrace_trace_function) {
2709 saved_ftrace_func = ftrace_trace_function;
2710 command |= FTRACE_UPDATE_TRACE_FUNC;
2711 }
2712
2713 if (!command || !ftrace_enabled)
2714 return;
2715
2716 ftrace_run_update_code(command);
2717}
2718
2719static void ftrace_startup_all(int command)
2720{
2721 update_all_ops = true;
2722 ftrace_startup_enable(command);
2723 update_all_ops = false;
2724}
2725
2726static int ftrace_startup(struct ftrace_ops *ops, int command)
2727{
2728 int ret;
2729
2730 if (unlikely(ftrace_disabled))
2731 return -ENODEV;
2732
2733 ret = __register_ftrace_function(ops);
2734 if (ret)
2735 return ret;
2736
2737 ftrace_start_up++;
2738
2739 /*
2740 * Note that ftrace probes uses this to start up
2741 * and modify functions it will probe. But we still
2742 * set the ADDING flag for modification, as probes
2743 * do not have trampolines. If they add them in the
2744 * future, then the probes will need to distinguish
2745 * between adding and updating probes.
2746 */
2747 ops->flags |= FTRACE_OPS_FL_ENABLED | FTRACE_OPS_FL_ADDING;
2748
2749 ret = ftrace_hash_ipmodify_enable(ops);
2750 if (ret < 0) {
2751 /* Rollback registration process */
2752 __unregister_ftrace_function(ops);
2753 ftrace_start_up--;
2754 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2755 return ret;
2756 }
2757
2758 if (ftrace_hash_rec_enable(ops, 1))
2759 command |= FTRACE_UPDATE_CALLS;
2760
2761 ftrace_startup_enable(command);
2762
2763 ops->flags &= ~FTRACE_OPS_FL_ADDING;
2764
2765 return 0;
2766}
2767
2768static int ftrace_shutdown(struct ftrace_ops *ops, int command)
2769{
2770 int ret;
2771
2772 if (unlikely(ftrace_disabled))
2773 return -ENODEV;
2774
2775 ret = __unregister_ftrace_function(ops);
2776 if (ret)
2777 return ret;
2778
2779 ftrace_start_up--;
2780 /*
2781 * Just warn in case of unbalance, no need to kill ftrace, it's not
2782 * critical but the ftrace_call callers may be never nopped again after
2783 * further ftrace uses.
2784 */
2785 WARN_ON_ONCE(ftrace_start_up < 0);
2786
2787 /* Disabling ipmodify never fails */
2788 ftrace_hash_ipmodify_disable(ops);
2789
2790 if (ftrace_hash_rec_disable(ops, 1))
2791 command |= FTRACE_UPDATE_CALLS;
2792
2793 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2794
2795 if (saved_ftrace_func != ftrace_trace_function) {
2796 saved_ftrace_func = ftrace_trace_function;
2797 command |= FTRACE_UPDATE_TRACE_FUNC;
2798 }
2799
2800 if (!command || !ftrace_enabled) {
2801 /*
2802 * If these are dynamic or per_cpu ops, they still
2803 * need their data freed. Since, function tracing is
2804 * not currently active, we can just free them
2805 * without synchronizing all CPUs.
2806 */
2807 if (ops->flags & FTRACE_OPS_FL_DYNAMIC)
2808 goto free_ops;
2809
2810 return 0;
2811 }
2812
2813 /*
2814 * If the ops uses a trampoline, then it needs to be
2815 * tested first on update.
2816 */
2817 ops->flags |= FTRACE_OPS_FL_REMOVING;
2818 removed_ops = ops;
2819
2820 /* The trampoline logic checks the old hashes */
2821 ops->old_hash.filter_hash = ops->func_hash->filter_hash;
2822 ops->old_hash.notrace_hash = ops->func_hash->notrace_hash;
2823
2824 ftrace_run_update_code(command);
2825
2826 /*
2827 * If there's no more ops registered with ftrace, run a
2828 * sanity check to make sure all rec flags are cleared.
2829 */
2830 if (rcu_dereference_protected(ftrace_ops_list,
2831 lockdep_is_held(&ftrace_lock)) == &ftrace_list_end) {
2832 struct ftrace_page *pg;
2833 struct dyn_ftrace *rec;
2834
2835 do_for_each_ftrace_rec(pg, rec) {
2836 if (FTRACE_WARN_ON_ONCE(rec->flags & ~FTRACE_FL_DISABLED))
2837 pr_warn(" %pS flags:%lx\n",
2838 (void *)rec->ip, rec->flags);
2839 } while_for_each_ftrace_rec();
2840 }
2841
2842 ops->old_hash.filter_hash = NULL;
2843 ops->old_hash.notrace_hash = NULL;
2844
2845 removed_ops = NULL;
2846 ops->flags &= ~FTRACE_OPS_FL_REMOVING;
2847
2848 /*
2849 * Dynamic ops may be freed, we must make sure that all
2850 * callers are done before leaving this function.
2851 * The same goes for freeing the per_cpu data of the per_cpu
2852 * ops.
2853 */
2854 if (ops->flags & FTRACE_OPS_FL_DYNAMIC) {
2855 /*
2856 * We need to do a hard force of sched synchronization.
2857 * This is because we use preempt_disable() to do RCU, but
2858 * the function tracers can be called where RCU is not watching
2859 * (like before user_exit()). We can not rely on the RCU
2860 * infrastructure to do the synchronization, thus we must do it
2861 * ourselves.
2862 */
2863 schedule_on_each_cpu(ftrace_sync);
2864
2865 /*
2866 * When the kernel is preeptive, tasks can be preempted
2867 * while on a ftrace trampoline. Just scheduling a task on
2868 * a CPU is not good enough to flush them. Calling
2869 * synchornize_rcu_tasks() will wait for those tasks to
2870 * execute and either schedule voluntarily or enter user space.
2871 */
2872 if (IS_ENABLED(CONFIG_PREEMPT))
2873 synchronize_rcu_tasks();
2874
2875 free_ops:
2876 arch_ftrace_trampoline_free(ops);
2877 }
2878
2879 return 0;
2880}
2881
2882static void ftrace_startup_sysctl(void)
2883{
2884 int command;
2885
2886 if (unlikely(ftrace_disabled))
2887 return;
2888
2889 /* Force update next time */
2890 saved_ftrace_func = NULL;
2891 /* ftrace_start_up is true if we want ftrace running */
2892 if (ftrace_start_up) {
2893 command = FTRACE_UPDATE_CALLS;
2894 if (ftrace_graph_active)
2895 command |= FTRACE_START_FUNC_RET;
2896 ftrace_startup_enable(command);
2897 }
2898}
2899
2900static void ftrace_shutdown_sysctl(void)
2901{
2902 int command;
2903
2904 if (unlikely(ftrace_disabled))
2905 return;
2906
2907 /* ftrace_start_up is true if ftrace is running */
2908 if (ftrace_start_up) {
2909 command = FTRACE_DISABLE_CALLS;
2910 if (ftrace_graph_active)
2911 command |= FTRACE_STOP_FUNC_RET;
2912 ftrace_run_update_code(command);
2913 }
2914}
2915
2916static u64 ftrace_update_time;
2917unsigned long ftrace_update_tot_cnt;
2918
2919static inline int ops_traces_mod(struct ftrace_ops *ops)
2920{
2921 /*
2922 * Filter_hash being empty will default to trace module.
2923 * But notrace hash requires a test of individual module functions.
2924 */
2925 return ftrace_hash_empty(ops->func_hash->filter_hash) &&
2926 ftrace_hash_empty(ops->func_hash->notrace_hash);
2927}
2928
2929/*
2930 * Check if the current ops references the record.
2931 *
2932 * If the ops traces all functions, then it was already accounted for.
2933 * If the ops does not trace the current record function, skip it.
2934 * If the ops ignores the function via notrace filter, skip it.
2935 */
2936static inline bool
2937ops_references_rec(struct ftrace_ops *ops, struct dyn_ftrace *rec)
2938{
2939 /* If ops isn't enabled, ignore it */
2940 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
2941 return 0;
2942
2943 /* If ops traces all then it includes this function */
2944 if (ops_traces_mod(ops))
2945 return 1;
2946
2947 /* The function must be in the filter */
2948 if (!ftrace_hash_empty(ops->func_hash->filter_hash) &&
2949 !__ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))
2950 return 0;
2951
2952 /* If in notrace hash, we ignore it too */
2953 if (ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip))
2954 return 0;
2955
2956 return 1;
2957}
2958
2959static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
2960{
2961 struct ftrace_page *pg;
2962 struct dyn_ftrace *p;
2963 u64 start, stop;
2964 unsigned long update_cnt = 0;
2965 unsigned long rec_flags = 0;
2966 int i;
2967
2968 start = ftrace_now(raw_smp_processor_id());
2969
2970 /*
2971 * When a module is loaded, this function is called to convert
2972 * the calls to mcount in its text to nops, and also to create
2973 * an entry in the ftrace data. Now, if ftrace is activated
2974 * after this call, but before the module sets its text to
2975 * read-only, the modification of enabling ftrace can fail if
2976 * the read-only is done while ftrace is converting the calls.
2977 * To prevent this, the module's records are set as disabled
2978 * and will be enabled after the call to set the module's text
2979 * to read-only.
2980 */
2981 if (mod)
2982 rec_flags |= FTRACE_FL_DISABLED;
2983
2984 for (pg = new_pgs; pg; pg = pg->next) {
2985
2986 for (i = 0; i < pg->index; i++) {
2987
2988 /* If something went wrong, bail without enabling anything */
2989 if (unlikely(ftrace_disabled))
2990 return -1;
2991
2992 p = &pg->records[i];
2993 p->flags = rec_flags;
2994
2995 /*
2996 * Do the initial record conversion from mcount jump
2997 * to the NOP instructions.
2998 */
2999 if (!ftrace_code_disable(mod, p))
3000 break;
3001
3002 update_cnt++;
3003 }
3004 }
3005
3006 stop = ftrace_now(raw_smp_processor_id());
3007 ftrace_update_time = stop - start;
3008 ftrace_update_tot_cnt += update_cnt;
3009
3010 return 0;
3011}
3012
3013static int ftrace_allocate_records(struct ftrace_page *pg, int count)
3014{
3015 int order;
3016 int cnt;
3017
3018 if (WARN_ON(!count))
3019 return -EINVAL;
3020
3021 order = get_count_order(DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
3022
3023 /*
3024 * We want to fill as much as possible. No more than a page
3025 * may be empty.
3026 */
3027 while ((PAGE_SIZE << order) / ENTRY_SIZE >= count + ENTRIES_PER_PAGE)
3028 order--;
3029
3030 again:
3031 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
3032
3033 if (!pg->records) {
3034 /* if we can't allocate this size, try something smaller */
3035 if (!order)
3036 return -ENOMEM;
3037 order >>= 1;
3038 goto again;
3039 }
3040
3041 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
3042 pg->size = cnt;
3043
3044 if (cnt > count)
3045 cnt = count;
3046
3047 return cnt;
3048}
3049
3050static struct ftrace_page *
3051ftrace_allocate_pages(unsigned long num_to_init)
3052{
3053 struct ftrace_page *start_pg;
3054 struct ftrace_page *pg;
3055 int order;
3056 int cnt;
3057
3058 if (!num_to_init)
3059 return 0;
3060
3061 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
3062 if (!pg)
3063 return NULL;
3064
3065 /*
3066 * Try to allocate as much as possible in one continues
3067 * location that fills in all of the space. We want to
3068 * waste as little space as possible.
3069 */
3070 for (;;) {
3071 cnt = ftrace_allocate_records(pg, num_to_init);
3072 if (cnt < 0)
3073 goto free_pages;
3074
3075 num_to_init -= cnt;
3076 if (!num_to_init)
3077 break;
3078
3079 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
3080 if (!pg->next)
3081 goto free_pages;
3082
3083 pg = pg->next;
3084 }
3085
3086 return start_pg;
3087
3088 free_pages:
3089 pg = start_pg;
3090 while (pg) {
3091 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
3092 free_pages((unsigned long)pg->records, order);
3093 start_pg = pg->next;
3094 kfree(pg);
3095 pg = start_pg;
3096 }
3097 pr_info("ftrace: FAILED to allocate memory for functions\n");
3098 return NULL;
3099}
3100
3101#define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
3102
3103struct ftrace_iterator {
3104 loff_t pos;
3105 loff_t func_pos;
3106 loff_t mod_pos;
3107 struct ftrace_page *pg;
3108 struct dyn_ftrace *func;
3109 struct ftrace_func_probe *probe;
3110 struct ftrace_func_entry *probe_entry;
3111 struct trace_parser parser;
3112 struct ftrace_hash *hash;
3113 struct ftrace_ops *ops;
3114 struct trace_array *tr;
3115 struct list_head *mod_list;
3116 int pidx;
3117 int idx;
3118 unsigned flags;
3119};
3120
3121static void *
3122t_probe_next(struct seq_file *m, loff_t *pos)
3123{
3124 struct ftrace_iterator *iter = m->private;
3125 struct trace_array *tr = iter->ops->private;
3126 struct list_head *func_probes;
3127 struct ftrace_hash *hash;
3128 struct list_head *next;
3129 struct hlist_node *hnd = NULL;
3130 struct hlist_head *hhd;
3131 int size;
3132
3133 (*pos)++;
3134 iter->pos = *pos;
3135
3136 if (!tr)
3137 return NULL;
3138
3139 func_probes = &tr->func_probes;
3140 if (list_empty(func_probes))
3141 return NULL;
3142
3143 if (!iter->probe) {
3144 next = func_probes->next;
3145 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3146 }
3147
3148 if (iter->probe_entry)
3149 hnd = &iter->probe_entry->hlist;
3150
3151 hash = iter->probe->ops.func_hash->filter_hash;
3152 size = 1 << hash->size_bits;
3153
3154 retry:
3155 if (iter->pidx >= size) {
3156 if (iter->probe->list.next == func_probes)
3157 return NULL;
3158 next = iter->probe->list.next;
3159 iter->probe = list_entry(next, struct ftrace_func_probe, list);
3160 hash = iter->probe->ops.func_hash->filter_hash;
3161 size = 1 << hash->size_bits;
3162 iter->pidx = 0;
3163 }
3164
3165 hhd = &hash->buckets[iter->pidx];
3166
3167 if (hlist_empty(hhd)) {
3168 iter->pidx++;
3169 hnd = NULL;
3170 goto retry;
3171 }
3172
3173 if (!hnd)
3174 hnd = hhd->first;
3175 else {
3176 hnd = hnd->next;
3177 if (!hnd) {
3178 iter->pidx++;
3179 goto retry;
3180 }
3181 }
3182
3183 if (WARN_ON_ONCE(!hnd))
3184 return NULL;
3185
3186 iter->probe_entry = hlist_entry(hnd, struct ftrace_func_entry, hlist);
3187
3188 return iter;
3189}
3190
3191static void *t_probe_start(struct seq_file *m, loff_t *pos)
3192{
3193 struct ftrace_iterator *iter = m->private;
3194 void *p = NULL;
3195 loff_t l;
3196
3197 if (!(iter->flags & FTRACE_ITER_DO_PROBES))
3198 return NULL;
3199
3200 if (iter->mod_pos > *pos)
3201 return NULL;
3202
3203 iter->probe = NULL;
3204 iter->probe_entry = NULL;
3205 iter->pidx = 0;
3206 for (l = 0; l <= (*pos - iter->mod_pos); ) {
3207 p = t_probe_next(m, &l);
3208 if (!p)
3209 break;
3210 }
3211 if (!p)
3212 return NULL;
3213
3214 /* Only set this if we have an item */
3215 iter->flags |= FTRACE_ITER_PROBE;
3216
3217 return iter;
3218}
3219
3220static int
3221t_probe_show(struct seq_file *m, struct ftrace_iterator *iter)
3222{
3223 struct ftrace_func_entry *probe_entry;
3224 struct ftrace_probe_ops *probe_ops;
3225 struct ftrace_func_probe *probe;
3226
3227 probe = iter->probe;
3228 probe_entry = iter->probe_entry;
3229
3230 if (WARN_ON_ONCE(!probe || !probe_entry))
3231 return -EIO;
3232
3233 probe_ops = probe->probe_ops;
3234
3235 if (probe_ops->print)
3236 return probe_ops->print(m, probe_entry->ip, probe_ops, probe->data);
3237
3238 seq_printf(m, "%ps:%ps\n", (void *)probe_entry->ip,
3239 (void *)probe_ops->func);
3240
3241 return 0;
3242}
3243
3244static void *
3245t_mod_next(struct seq_file *m, loff_t *pos)
3246{
3247 struct ftrace_iterator *iter = m->private;
3248 struct trace_array *tr = iter->tr;
3249
3250 (*pos)++;
3251 iter->pos = *pos;
3252
3253 iter->mod_list = iter->mod_list->next;
3254
3255 if (iter->mod_list == &tr->mod_trace ||
3256 iter->mod_list == &tr->mod_notrace) {
3257 iter->flags &= ~FTRACE_ITER_MOD;
3258 return NULL;
3259 }
3260
3261 iter->mod_pos = *pos;
3262
3263 return iter;
3264}
3265
3266static void *t_mod_start(struct seq_file *m, loff_t *pos)
3267{
3268 struct ftrace_iterator *iter = m->private;
3269 void *p = NULL;
3270 loff_t l;
3271
3272 if (iter->func_pos > *pos)
3273 return NULL;
3274
3275 iter->mod_pos = iter->func_pos;
3276
3277 /* probes are only available if tr is set */
3278 if (!iter->tr)
3279 return NULL;
3280
3281 for (l = 0; l <= (*pos - iter->func_pos); ) {
3282 p = t_mod_next(m, &l);
3283 if (!p)
3284 break;
3285 }
3286 if (!p) {
3287 iter->flags &= ~FTRACE_ITER_MOD;
3288 return t_probe_start(m, pos);
3289 }
3290
3291 /* Only set this if we have an item */
3292 iter->flags |= FTRACE_ITER_MOD;
3293
3294 return iter;
3295}
3296
3297static int
3298t_mod_show(struct seq_file *m, struct ftrace_iterator *iter)
3299{
3300 struct ftrace_mod_load *ftrace_mod;
3301 struct trace_array *tr = iter->tr;
3302
3303 if (WARN_ON_ONCE(!iter->mod_list) ||
3304 iter->mod_list == &tr->mod_trace ||
3305 iter->mod_list == &tr->mod_notrace)
3306 return -EIO;
3307
3308 ftrace_mod = list_entry(iter->mod_list, struct ftrace_mod_load, list);
3309
3310 if (ftrace_mod->func)
3311 seq_printf(m, "%s", ftrace_mod->func);
3312 else
3313 seq_putc(m, '*');
3314
3315 seq_printf(m, ":mod:%s\n", ftrace_mod->module);
3316
3317 return 0;
3318}
3319
3320static void *
3321t_func_next(struct seq_file *m, loff_t *pos)
3322{
3323 struct ftrace_iterator *iter = m->private;
3324 struct dyn_ftrace *rec = NULL;
3325
3326 (*pos)++;
3327
3328 retry:
3329 if (iter->idx >= iter->pg->index) {
3330 if (iter->pg->next) {
3331 iter->pg = iter->pg->next;
3332 iter->idx = 0;
3333 goto retry;
3334 }
3335 } else {
3336 rec = &iter->pg->records[iter->idx++];
3337 if (((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3338 !ftrace_lookup_ip(iter->hash, rec->ip)) ||
3339
3340 ((iter->flags & FTRACE_ITER_ENABLED) &&
3341 !(rec->flags & FTRACE_FL_ENABLED))) {
3342
3343 rec = NULL;
3344 goto retry;
3345 }
3346 }
3347
3348 if (!rec)
3349 return NULL;
3350
3351 iter->pos = iter->func_pos = *pos;
3352 iter->func = rec;
3353
3354 return iter;
3355}
3356
3357static void *
3358t_next(struct seq_file *m, void *v, loff_t *pos)
3359{
3360 struct ftrace_iterator *iter = m->private;
3361 loff_t l = *pos; /* t_probe_start() must use original pos */
3362 void *ret;
3363
3364 if (unlikely(ftrace_disabled))
3365 return NULL;
3366
3367 if (iter->flags & FTRACE_ITER_PROBE)
3368 return t_probe_next(m, pos);
3369
3370 if (iter->flags & FTRACE_ITER_MOD)
3371 return t_mod_next(m, pos);
3372
3373 if (iter->flags & FTRACE_ITER_PRINTALL) {
3374 /* next must increment pos, and t_probe_start does not */
3375 (*pos)++;
3376 return t_mod_start(m, &l);
3377 }
3378
3379 ret = t_func_next(m, pos);
3380
3381 if (!ret)
3382 return t_mod_start(m, &l);
3383
3384 return ret;
3385}
3386
3387static void reset_iter_read(struct ftrace_iterator *iter)
3388{
3389 iter->pos = 0;
3390 iter->func_pos = 0;
3391 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_PROBE | FTRACE_ITER_MOD);
3392}
3393
3394static void *t_start(struct seq_file *m, loff_t *pos)
3395{
3396 struct ftrace_iterator *iter = m->private;
3397 void *p = NULL;
3398 loff_t l;
3399
3400 mutex_lock(&ftrace_lock);
3401
3402 if (unlikely(ftrace_disabled))
3403 return NULL;
3404
3405 /*
3406 * If an lseek was done, then reset and start from beginning.
3407 */
3408 if (*pos < iter->pos)
3409 reset_iter_read(iter);
3410
3411 /*
3412 * For set_ftrace_filter reading, if we have the filter
3413 * off, we can short cut and just print out that all
3414 * functions are enabled.
3415 */
3416 if ((iter->flags & (FTRACE_ITER_FILTER | FTRACE_ITER_NOTRACE)) &&
3417 ftrace_hash_empty(iter->hash)) {
3418 iter->func_pos = 1; /* Account for the message */
3419 if (*pos > 0)
3420 return t_mod_start(m, pos);
3421 iter->flags |= FTRACE_ITER_PRINTALL;
3422 /* reset in case of seek/pread */
3423 iter->flags &= ~FTRACE_ITER_PROBE;
3424 return iter;
3425 }
3426
3427 if (iter->flags & FTRACE_ITER_MOD)
3428 return t_mod_start(m, pos);
3429
3430 /*
3431 * Unfortunately, we need to restart at ftrace_pages_start
3432 * every time we let go of the ftrace_mutex. This is because
3433 * those pointers can change without the lock.
3434 */
3435 iter->pg = ftrace_pages_start;
3436 iter->idx = 0;
3437 for (l = 0; l <= *pos; ) {
3438 p = t_func_next(m, &l);
3439 if (!p)
3440 break;
3441 }
3442
3443 if (!p)
3444 return t_mod_start(m, pos);
3445
3446 return iter;
3447}
3448
3449static void t_stop(struct seq_file *m, void *p)
3450{
3451 mutex_unlock(&ftrace_lock);
3452}
3453
3454void * __weak
3455arch_ftrace_trampoline_func(struct ftrace_ops *ops, struct dyn_ftrace *rec)
3456{
3457 return NULL;
3458}
3459
3460static void add_trampoline_func(struct seq_file *m, struct ftrace_ops *ops,
3461 struct dyn_ftrace *rec)
3462{
3463 void *ptr;
3464
3465 ptr = arch_ftrace_trampoline_func(ops, rec);
3466 if (ptr)
3467 seq_printf(m, " ->%pS", ptr);
3468}
3469
3470static int t_show(struct seq_file *m, void *v)
3471{
3472 struct ftrace_iterator *iter = m->private;
3473 struct dyn_ftrace *rec;
3474
3475 if (iter->flags & FTRACE_ITER_PROBE)
3476 return t_probe_show(m, iter);
3477
3478 if (iter->flags & FTRACE_ITER_MOD)
3479 return t_mod_show(m, iter);
3480
3481 if (iter->flags & FTRACE_ITER_PRINTALL) {
3482 if (iter->flags & FTRACE_ITER_NOTRACE)
3483 seq_puts(m, "#### no functions disabled ####\n");
3484 else
3485 seq_puts(m, "#### all functions enabled ####\n");
3486 return 0;
3487 }
3488
3489 rec = iter->func;
3490
3491 if (!rec)
3492 return 0;
3493
3494 seq_printf(m, "%ps", (void *)rec->ip);
3495 if (iter->flags & FTRACE_ITER_ENABLED) {
3496 struct ftrace_ops *ops;
3497
3498 seq_printf(m, " (%ld)%s%s",
3499 ftrace_rec_count(rec),
3500 rec->flags & FTRACE_FL_REGS ? " R" : " ",
3501 rec->flags & FTRACE_FL_IPMODIFY ? " I" : " ");
3502 if (rec->flags & FTRACE_FL_TRAMP_EN) {
3503 ops = ftrace_find_tramp_ops_any(rec);
3504 if (ops) {
3505 do {
3506 seq_printf(m, "\ttramp: %pS (%pS)",
3507 (void *)ops->trampoline,
3508 (void *)ops->func);
3509 add_trampoline_func(m, ops, rec);
3510 ops = ftrace_find_tramp_ops_next(rec, ops);
3511 } while (ops);
3512 } else
3513 seq_puts(m, "\ttramp: ERROR!");
3514 } else {
3515 add_trampoline_func(m, NULL, rec);
3516 }
3517 }
3518
3519 seq_putc(m, '\n');
3520
3521 return 0;
3522}
3523
3524static const struct seq_operations show_ftrace_seq_ops = {
3525 .start = t_start,
3526 .next = t_next,
3527 .stop = t_stop,
3528 .show = t_show,
3529};
3530
3531static int
3532ftrace_avail_open(struct inode *inode, struct file *file)
3533{
3534 struct ftrace_iterator *iter;
3535
3536 if (unlikely(ftrace_disabled))
3537 return -ENODEV;
3538
3539 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3540 if (!iter)
3541 return -ENOMEM;
3542
3543 iter->pg = ftrace_pages_start;
3544 iter->ops = &global_ops;
3545
3546 return 0;
3547}
3548
3549static int
3550ftrace_enabled_open(struct inode *inode, struct file *file)
3551{
3552 struct ftrace_iterator *iter;
3553
3554 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3555 if (!iter)
3556 return -ENOMEM;
3557
3558 iter->pg = ftrace_pages_start;
3559 iter->flags = FTRACE_ITER_ENABLED;
3560 iter->ops = &global_ops;
3561
3562 return 0;
3563}
3564
3565/**
3566 * ftrace_regex_open - initialize function tracer filter files
3567 * @ops: The ftrace_ops that hold the hash filters
3568 * @flag: The type of filter to process
3569 * @inode: The inode, usually passed in to your open routine
3570 * @file: The file, usually passed in to your open routine
3571 *
3572 * ftrace_regex_open() initializes the filter files for the
3573 * @ops. Depending on @flag it may process the filter hash or
3574 * the notrace hash of @ops. With this called from the open
3575 * routine, you can use ftrace_filter_write() for the write
3576 * routine if @flag has FTRACE_ITER_FILTER set, or
3577 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
3578 * tracing_lseek() should be used as the lseek routine, and
3579 * release must call ftrace_regex_release().
3580 */
3581int
3582ftrace_regex_open(struct ftrace_ops *ops, int flag,
3583 struct inode *inode, struct file *file)
3584{
3585 struct ftrace_iterator *iter;
3586 struct ftrace_hash *hash;
3587 struct list_head *mod_head;
3588 struct trace_array *tr = ops->private;
3589 int ret = 0;
3590
3591 ftrace_ops_init(ops);
3592
3593 if (unlikely(ftrace_disabled))
3594 return -ENODEV;
3595
3596 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
3597 if (!iter)
3598 return -ENOMEM;
3599
3600 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
3601 kfree(iter);
3602 return -ENOMEM;
3603 }
3604
3605 iter->ops = ops;
3606 iter->flags = flag;
3607 iter->tr = tr;
3608
3609 mutex_lock(&ops->func_hash->regex_lock);
3610
3611 if (flag & FTRACE_ITER_NOTRACE) {
3612 hash = ops->func_hash->notrace_hash;
3613 mod_head = tr ? &tr->mod_notrace : NULL;
3614 } else {
3615 hash = ops->func_hash->filter_hash;
3616 mod_head = tr ? &tr->mod_trace : NULL;
3617 }
3618
3619 iter->mod_list = mod_head;
3620
3621 if (file->f_mode & FMODE_WRITE) {
3622 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3623
3624 if (file->f_flags & O_TRUNC) {
3625 iter->hash = alloc_ftrace_hash(size_bits);
3626 clear_ftrace_mod_list(mod_head);
3627 } else {
3628 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3629 }
3630
3631 if (!iter->hash) {
3632 trace_parser_put(&iter->parser);
3633 kfree(iter);
3634 ret = -ENOMEM;
3635 goto out_unlock;
3636 }
3637 } else
3638 iter->hash = hash;
3639
3640 if (file->f_mode & FMODE_READ) {
3641 iter->pg = ftrace_pages_start;
3642
3643 ret = seq_open(file, &show_ftrace_seq_ops);
3644 if (!ret) {
3645 struct seq_file *m = file->private_data;
3646 m->private = iter;
3647 } else {
3648 /* Failed */
3649 free_ftrace_hash(iter->hash);
3650 trace_parser_put(&iter->parser);
3651 kfree(iter);
3652 }
3653 } else
3654 file->private_data = iter;
3655
3656 out_unlock:
3657 mutex_unlock(&ops->func_hash->regex_lock);
3658
3659 return ret;
3660}
3661
3662static int
3663ftrace_filter_open(struct inode *inode, struct file *file)
3664{
3665 struct ftrace_ops *ops = inode->i_private;
3666
3667 return ftrace_regex_open(ops,
3668 FTRACE_ITER_FILTER | FTRACE_ITER_DO_PROBES,
3669 inode, file);
3670}
3671
3672static int
3673ftrace_notrace_open(struct inode *inode, struct file *file)
3674{
3675 struct ftrace_ops *ops = inode->i_private;
3676
3677 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3678 inode, file);
3679}
3680
3681/* Type for quick search ftrace basic regexes (globs) from filter_parse_regex */
3682struct ftrace_glob {
3683 char *search;
3684 unsigned len;
3685 int type;
3686};
3687
3688/*
3689 * If symbols in an architecture don't correspond exactly to the user-visible
3690 * name of what they represent, it is possible to define this function to
3691 * perform the necessary adjustments.
3692*/
3693char * __weak arch_ftrace_match_adjust(char *str, const char *search)
3694{
3695 return str;
3696}
3697
3698static int ftrace_match(char *str, struct ftrace_glob *g)
3699{
3700 int matched = 0;
3701 int slen;
3702
3703 str = arch_ftrace_match_adjust(str, g->search);
3704
3705 switch (g->type) {
3706 case MATCH_FULL:
3707 if (strcmp(str, g->search) == 0)
3708 matched = 1;
3709 break;
3710 case MATCH_FRONT_ONLY:
3711 if (strncmp(str, g->search, g->len) == 0)
3712 matched = 1;
3713 break;
3714 case MATCH_MIDDLE_ONLY:
3715 if (strstr(str, g->search))
3716 matched = 1;
3717 break;
3718 case MATCH_END_ONLY:
3719 slen = strlen(str);
3720 if (slen >= g->len &&
3721 memcmp(str + slen - g->len, g->search, g->len) == 0)
3722 matched = 1;
3723 break;
3724 case MATCH_GLOB:
3725 if (glob_match(g->search, str))
3726 matched = 1;
3727 break;
3728 }
3729
3730 return matched;
3731}
3732
3733static int
3734enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter)
3735{
3736 struct ftrace_func_entry *entry;
3737 int ret = 0;
3738
3739 entry = ftrace_lookup_ip(hash, rec->ip);
3740 if (clear_filter) {
3741 /* Do nothing if it doesn't exist */
3742 if (!entry)
3743 return 0;
3744
3745 free_hash_entry(hash, entry);
3746 } else {
3747 /* Do nothing if it exists */
3748 if (entry)
3749 return 0;
3750
3751 ret = add_hash_entry(hash, rec->ip);
3752 }
3753 return ret;
3754}
3755
3756static int
3757ftrace_match_record(struct dyn_ftrace *rec, struct ftrace_glob *func_g,
3758 struct ftrace_glob *mod_g, int exclude_mod)
3759{
3760 char str[KSYM_SYMBOL_LEN];
3761 char *modname;
3762
3763 kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);
3764
3765 if (mod_g) {
3766 int mod_matches = (modname) ? ftrace_match(modname, mod_g) : 0;
3767
3768 /* blank module name to match all modules */
3769 if (!mod_g->len) {
3770 /* blank module globbing: modname xor exclude_mod */
3771 if (!exclude_mod != !modname)
3772 goto func_match;
3773 return 0;
3774 }
3775
3776 /*
3777 * exclude_mod is set to trace everything but the given
3778 * module. If it is set and the module matches, then
3779 * return 0. If it is not set, and the module doesn't match
3780 * also return 0. Otherwise, check the function to see if
3781 * that matches.
3782 */
3783 if (!mod_matches == !exclude_mod)
3784 return 0;
3785func_match:
3786 /* blank search means to match all funcs in the mod */
3787 if (!func_g->len)
3788 return 1;
3789 }
3790
3791 return ftrace_match(str, func_g);
3792}
3793
3794static int
3795match_records(struct ftrace_hash *hash, char *func, int len, char *mod)
3796{
3797 struct ftrace_page *pg;
3798 struct dyn_ftrace *rec;
3799 struct ftrace_glob func_g = { .type = MATCH_FULL };
3800 struct ftrace_glob mod_g = { .type = MATCH_FULL };
3801 struct ftrace_glob *mod_match = (mod) ? &mod_g : NULL;
3802 int exclude_mod = 0;
3803 int found = 0;
3804 int ret;
3805 int clear_filter = 0;
3806
3807 if (func) {
3808 func_g.type = filter_parse_regex(func, len, &func_g.search,
3809 &clear_filter);
3810 func_g.len = strlen(func_g.search);
3811 }
3812
3813 if (mod) {
3814 mod_g.type = filter_parse_regex(mod, strlen(mod),
3815 &mod_g.search, &exclude_mod);
3816 mod_g.len = strlen(mod_g.search);
3817 }
3818
3819 mutex_lock(&ftrace_lock);
3820
3821 if (unlikely(ftrace_disabled))
3822 goto out_unlock;
3823
3824 do_for_each_ftrace_rec(pg, rec) {
3825
3826 if (rec->flags & FTRACE_FL_DISABLED)
3827 continue;
3828
3829 if (ftrace_match_record(rec, &func_g, mod_match, exclude_mod)) {
3830 ret = enter_record(hash, rec, clear_filter);
3831 if (ret < 0) {
3832 found = ret;
3833 goto out_unlock;
3834 }
3835 found = 1;
3836 }
3837 } while_for_each_ftrace_rec();
3838 out_unlock:
3839 mutex_unlock(&ftrace_lock);
3840
3841 return found;
3842}
3843
3844static int
3845ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
3846{
3847 return match_records(hash, buff, len, NULL);
3848}
3849
3850static void ftrace_ops_update_code(struct ftrace_ops *ops,
3851 struct ftrace_ops_hash *old_hash)
3852{
3853 struct ftrace_ops *op;
3854
3855 if (!ftrace_enabled)
3856 return;
3857
3858 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
3859 ftrace_run_modify_code(ops, FTRACE_UPDATE_CALLS, old_hash);
3860 return;
3861 }
3862
3863 /*
3864 * If this is the shared global_ops filter, then we need to
3865 * check if there is another ops that shares it, is enabled.
3866 * If so, we still need to run the modify code.
3867 */
3868 if (ops->func_hash != &global_ops.local_hash)
3869 return;
3870
3871 do_for_each_ftrace_op(op, ftrace_ops_list) {
3872 if (op->func_hash == &global_ops.local_hash &&
3873 op->flags & FTRACE_OPS_FL_ENABLED) {
3874 ftrace_run_modify_code(op, FTRACE_UPDATE_CALLS, old_hash);
3875 /* Only need to do this once */
3876 return;
3877 }
3878 } while_for_each_ftrace_op(op);
3879}
3880
3881static int ftrace_hash_move_and_update_ops(struct ftrace_ops *ops,
3882 struct ftrace_hash **orig_hash,
3883 struct ftrace_hash *hash,
3884 int enable)
3885{
3886 struct ftrace_ops_hash old_hash_ops;
3887 struct ftrace_hash *old_hash;
3888 int ret;
3889
3890 old_hash = *orig_hash;
3891 old_hash_ops.filter_hash = ops->func_hash->filter_hash;
3892 old_hash_ops.notrace_hash = ops->func_hash->notrace_hash;
3893 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
3894 if (!ret) {
3895 ftrace_ops_update_code(ops, &old_hash_ops);
3896 free_ftrace_hash_rcu(old_hash);
3897 }
3898 return ret;
3899}
3900
3901static bool module_exists(const char *module)
3902{
3903 /* All modules have the symbol __this_module */
3904 const char this_mod[] = "__this_module";
3905 char modname[MAX_PARAM_PREFIX_LEN + sizeof(this_mod) + 2];
3906 unsigned long val;
3907 int n;
3908
3909 n = snprintf(modname, sizeof(modname), "%s:%s", module, this_mod);
3910
3911 if (n > sizeof(modname) - 1)
3912 return false;
3913
3914 val = module_kallsyms_lookup_name(modname);
3915 return val != 0;
3916}
3917
3918static int cache_mod(struct trace_array *tr,
3919 const char *func, char *module, int enable)
3920{
3921 struct ftrace_mod_load *ftrace_mod, *n;
3922 struct list_head *head = enable ? &tr->mod_trace : &tr->mod_notrace;
3923 int ret;
3924
3925 mutex_lock(&ftrace_lock);
3926
3927 /* We do not cache inverse filters */
3928 if (func[0] == '!') {
3929 func++;
3930 ret = -EINVAL;
3931
3932 /* Look to remove this hash */
3933 list_for_each_entry_safe(ftrace_mod, n, head, list) {
3934 if (strcmp(ftrace_mod->module, module) != 0)
3935 continue;
3936
3937 /* no func matches all */
3938 if (strcmp(func, "*") == 0 ||
3939 (ftrace_mod->func &&
3940 strcmp(ftrace_mod->func, func) == 0)) {
3941 ret = 0;
3942 free_ftrace_mod(ftrace_mod);
3943 continue;
3944 }
3945 }
3946 goto out;
3947 }
3948
3949 ret = -EINVAL;
3950 /* We only care about modules that have not been loaded yet */
3951 if (module_exists(module))
3952 goto out;
3953
3954 /* Save this string off, and execute it when the module is loaded */
3955 ret = ftrace_add_mod(tr, func, module, enable);
3956 out:
3957 mutex_unlock(&ftrace_lock);
3958
3959 return ret;
3960}
3961
3962static int
3963ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
3964 int reset, int enable);
3965
3966#ifdef CONFIG_MODULES
3967static void process_mod_list(struct list_head *head, struct ftrace_ops *ops,
3968 char *mod, bool enable)
3969{
3970 struct ftrace_mod_load *ftrace_mod, *n;
3971 struct ftrace_hash **orig_hash, *new_hash;
3972 LIST_HEAD(process_mods);
3973 char *func;
3974 int ret;
3975
3976 mutex_lock(&ops->func_hash->regex_lock);
3977
3978 if (enable)
3979 orig_hash = &ops->func_hash->filter_hash;
3980 else
3981 orig_hash = &ops->func_hash->notrace_hash;
3982
3983 new_hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS,
3984 *orig_hash);
3985 if (!new_hash)
3986 goto out; /* warn? */
3987
3988 mutex_lock(&ftrace_lock);
3989
3990 list_for_each_entry_safe(ftrace_mod, n, head, list) {
3991
3992 if (strcmp(ftrace_mod->module, mod) != 0)
3993 continue;
3994
3995 if (ftrace_mod->func)
3996 func = kstrdup(ftrace_mod->func, GFP_KERNEL);
3997 else
3998 func = kstrdup("*", GFP_KERNEL);
3999
4000 if (!func) /* warn? */
4001 continue;
4002
4003 list_del(&ftrace_mod->list);
4004 list_add(&ftrace_mod->list, &process_mods);
4005
4006 /* Use the newly allocated func, as it may be "*" */
4007 kfree(ftrace_mod->func);
4008 ftrace_mod->func = func;
4009 }
4010
4011 mutex_unlock(&ftrace_lock);
4012
4013 list_for_each_entry_safe(ftrace_mod, n, &process_mods, list) {
4014
4015 func = ftrace_mod->func;
4016
4017 /* Grabs ftrace_lock, which is why we have this extra step */
4018 match_records(new_hash, func, strlen(func), mod);
4019 free_ftrace_mod(ftrace_mod);
4020 }
4021
4022 if (enable && list_empty(head))
4023 new_hash->flags &= ~FTRACE_HASH_FL_MOD;
4024
4025 mutex_lock(&ftrace_lock);
4026
4027 ret = ftrace_hash_move_and_update_ops(ops, orig_hash,
4028 new_hash, enable);
4029 mutex_unlock(&ftrace_lock);
4030
4031 out:
4032 mutex_unlock(&ops->func_hash->regex_lock);
4033
4034 free_ftrace_hash(new_hash);
4035}
4036
4037static void process_cached_mods(const char *mod_name)
4038{
4039 struct trace_array *tr;
4040 char *mod;
4041
4042 mod = kstrdup(mod_name, GFP_KERNEL);
4043 if (!mod)
4044 return;
4045
4046 mutex_lock(&trace_types_lock);
4047 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
4048 if (!list_empty(&tr->mod_trace))
4049 process_mod_list(&tr->mod_trace, tr->ops, mod, true);
4050 if (!list_empty(&tr->mod_notrace))
4051 process_mod_list(&tr->mod_notrace, tr->ops, mod, false);
4052 }
4053 mutex_unlock(&trace_types_lock);
4054
4055 kfree(mod);
4056}
4057#endif
4058
4059/*
4060 * We register the module command as a template to show others how
4061 * to register the a command as well.
4062 */
4063
4064static int
4065ftrace_mod_callback(struct trace_array *tr, struct ftrace_hash *hash,
4066 char *func_orig, char *cmd, char *module, int enable)
4067{
4068 char *func;
4069 int ret;
4070
4071 /* match_records() modifies func, and we need the original */
4072 func = kstrdup(func_orig, GFP_KERNEL);
4073 if (!func)
4074 return -ENOMEM;
4075
4076 /*
4077 * cmd == 'mod' because we only registered this func
4078 * for the 'mod' ftrace_func_command.
4079 * But if you register one func with multiple commands,
4080 * you can tell which command was used by the cmd
4081 * parameter.
4082 */
4083 ret = match_records(hash, func, strlen(func), module);
4084 kfree(func);
4085
4086 if (!ret)
4087 return cache_mod(tr, func_orig, module, enable);
4088 if (ret < 0)
4089 return ret;
4090 return 0;
4091}
4092
4093static struct ftrace_func_command ftrace_mod_cmd = {
4094 .name = "mod",
4095 .func = ftrace_mod_callback,
4096};
4097
4098static int __init ftrace_mod_cmd_init(void)
4099{
4100 return register_ftrace_command(&ftrace_mod_cmd);
4101}
4102core_initcall(ftrace_mod_cmd_init);
4103
4104static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
4105 struct ftrace_ops *op, struct pt_regs *pt_regs)
4106{
4107 struct ftrace_probe_ops *probe_ops;
4108 struct ftrace_func_probe *probe;
4109
4110 probe = container_of(op, struct ftrace_func_probe, ops);
4111 probe_ops = probe->probe_ops;
4112
4113 /*
4114 * Disable preemption for these calls to prevent a RCU grace
4115 * period. This syncs the hash iteration and freeing of items
4116 * on the hash. rcu_read_lock is too dangerous here.
4117 */
4118 preempt_disable_notrace();
4119 probe_ops->func(ip, parent_ip, probe->tr, probe_ops, probe->data);
4120 preempt_enable_notrace();
4121}
4122
4123struct ftrace_func_map {
4124 struct ftrace_func_entry entry;
4125 void *data;
4126};
4127
4128struct ftrace_func_mapper {
4129 struct ftrace_hash hash;
4130};
4131
4132/**
4133 * allocate_ftrace_func_mapper - allocate a new ftrace_func_mapper
4134 *
4135 * Returns a ftrace_func_mapper descriptor that can be used to map ips to data.
4136 */
4137struct ftrace_func_mapper *allocate_ftrace_func_mapper(void)
4138{
4139 struct ftrace_hash *hash;
4140
4141 /*
4142 * The mapper is simply a ftrace_hash, but since the entries
4143 * in the hash are not ftrace_func_entry type, we define it
4144 * as a separate structure.
4145 */
4146 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4147 return (struct ftrace_func_mapper *)hash;
4148}
4149
4150/**
4151 * ftrace_func_mapper_find_ip - Find some data mapped to an ip
4152 * @mapper: The mapper that has the ip maps
4153 * @ip: the instruction pointer to find the data for
4154 *
4155 * Returns the data mapped to @ip if found otherwise NULL. The return
4156 * is actually the address of the mapper data pointer. The address is
4157 * returned for use cases where the data is no bigger than a long, and
4158 * the user can use the data pointer as its data instead of having to
4159 * allocate more memory for the reference.
4160 */
4161void **ftrace_func_mapper_find_ip(struct ftrace_func_mapper *mapper,
4162 unsigned long ip)
4163{
4164 struct ftrace_func_entry *entry;
4165 struct ftrace_func_map *map;
4166
4167 entry = ftrace_lookup_ip(&mapper->hash, ip);
4168 if (!entry)
4169 return NULL;
4170
4171 map = (struct ftrace_func_map *)entry;
4172 return &map->data;
4173}
4174
4175/**
4176 * ftrace_func_mapper_add_ip - Map some data to an ip
4177 * @mapper: The mapper that has the ip maps
4178 * @ip: The instruction pointer address to map @data to
4179 * @data: The data to map to @ip
4180 *
4181 * Returns 0 on succes otherwise an error.
4182 */
4183int ftrace_func_mapper_add_ip(struct ftrace_func_mapper *mapper,
4184 unsigned long ip, void *data)
4185{
4186 struct ftrace_func_entry *entry;
4187 struct ftrace_func_map *map;
4188
4189 entry = ftrace_lookup_ip(&mapper->hash, ip);
4190 if (entry)
4191 return -EBUSY;
4192
4193 map = kmalloc(sizeof(*map), GFP_KERNEL);
4194 if (!map)
4195 return -ENOMEM;
4196
4197 map->entry.ip = ip;
4198 map->data = data;
4199
4200 __add_hash_entry(&mapper->hash, &map->entry);
4201
4202 return 0;
4203}
4204
4205/**
4206 * ftrace_func_mapper_remove_ip - Remove an ip from the mapping
4207 * @mapper: The mapper that has the ip maps
4208 * @ip: The instruction pointer address to remove the data from
4209 *
4210 * Returns the data if it is found, otherwise NULL.
4211 * Note, if the data pointer is used as the data itself, (see
4212 * ftrace_func_mapper_find_ip(), then the return value may be meaningless,
4213 * if the data pointer was set to zero.
4214 */
4215void *ftrace_func_mapper_remove_ip(struct ftrace_func_mapper *mapper,
4216 unsigned long ip)
4217{
4218 struct ftrace_func_entry *entry;
4219 struct ftrace_func_map *map;
4220 void *data;
4221
4222 entry = ftrace_lookup_ip(&mapper->hash, ip);
4223 if (!entry)
4224 return NULL;
4225
4226 map = (struct ftrace_func_map *)entry;
4227 data = map->data;
4228
4229 remove_hash_entry(&mapper->hash, entry);
4230 kfree(entry);
4231
4232 return data;
4233}
4234
4235/**
4236 * free_ftrace_func_mapper - free a mapping of ips and data
4237 * @mapper: The mapper that has the ip maps
4238 * @free_func: A function to be called on each data item.
4239 *
4240 * This is used to free the function mapper. The @free_func is optional
4241 * and can be used if the data needs to be freed as well.
4242 */
4243void free_ftrace_func_mapper(struct ftrace_func_mapper *mapper,
4244 ftrace_mapper_func free_func)
4245{
4246 struct ftrace_func_entry *entry;
4247 struct ftrace_func_map *map;
4248 struct hlist_head *hhd;
4249 int size = 1 << mapper->hash.size_bits;
4250 int i;
4251
4252 if (free_func && mapper->hash.count) {
4253 for (i = 0; i < size; i++) {
4254 hhd = &mapper->hash.buckets[i];
4255 hlist_for_each_entry(entry, hhd, hlist) {
4256 map = (struct ftrace_func_map *)entry;
4257 free_func(map);
4258 }
4259 }
4260 }
4261 free_ftrace_hash(&mapper->hash);
4262}
4263
4264static void release_probe(struct ftrace_func_probe *probe)
4265{
4266 struct ftrace_probe_ops *probe_ops;
4267
4268 mutex_lock(&ftrace_lock);
4269
4270 WARN_ON(probe->ref <= 0);
4271
4272 /* Subtract the ref that was used to protect this instance */
4273 probe->ref--;
4274
4275 if (!probe->ref) {
4276 probe_ops = probe->probe_ops;
4277 /*
4278 * Sending zero as ip tells probe_ops to free
4279 * the probe->data itself
4280 */
4281 if (probe_ops->free)
4282 probe_ops->free(probe_ops, probe->tr, 0, probe->data);
4283 list_del(&probe->list);
4284 kfree(probe);
4285 }
4286 mutex_unlock(&ftrace_lock);
4287}
4288
4289static void acquire_probe_locked(struct ftrace_func_probe *probe)
4290{
4291 /*
4292 * Add one ref to keep it from being freed when releasing the
4293 * ftrace_lock mutex.
4294 */
4295 probe->ref++;
4296}
4297
4298int
4299register_ftrace_function_probe(char *glob, struct trace_array *tr,
4300 struct ftrace_probe_ops *probe_ops,
4301 void *data)
4302{
4303 struct ftrace_func_entry *entry;
4304 struct ftrace_func_probe *probe;
4305 struct ftrace_hash **orig_hash;
4306 struct ftrace_hash *old_hash;
4307 struct ftrace_hash *hash;
4308 int count = 0;
4309 int size;
4310 int ret;
4311 int i;
4312
4313 if (WARN_ON(!tr))
4314 return -EINVAL;
4315
4316 /* We do not support '!' for function probes */
4317 if (WARN_ON(glob[0] == '!'))
4318 return -EINVAL;
4319
4320
4321 mutex_lock(&ftrace_lock);
4322 /* Check if the probe_ops is already registered */
4323 list_for_each_entry(probe, &tr->func_probes, list) {
4324 if (probe->probe_ops == probe_ops)
4325 break;
4326 }
4327 if (&probe->list == &tr->func_probes) {
4328 probe = kzalloc(sizeof(*probe), GFP_KERNEL);
4329 if (!probe) {
4330 mutex_unlock(&ftrace_lock);
4331 return -ENOMEM;
4332 }
4333 probe->probe_ops = probe_ops;
4334 probe->ops.func = function_trace_probe_call;
4335 probe->tr = tr;
4336 ftrace_ops_init(&probe->ops);
4337 list_add(&probe->list, &tr->func_probes);
4338 }
4339
4340 acquire_probe_locked(probe);
4341
4342 mutex_unlock(&ftrace_lock);
4343
4344 mutex_lock(&probe->ops.func_hash->regex_lock);
4345
4346 orig_hash = &probe->ops.func_hash->filter_hash;
4347 old_hash = *orig_hash;
4348 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4349
4350 ret = ftrace_match_records(hash, glob, strlen(glob));
4351
4352 /* Nothing found? */
4353 if (!ret)
4354 ret = -EINVAL;
4355
4356 if (ret < 0)
4357 goto out;
4358
4359 size = 1 << hash->size_bits;
4360 for (i = 0; i < size; i++) {
4361 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4362 if (ftrace_lookup_ip(old_hash, entry->ip))
4363 continue;
4364 /*
4365 * The caller might want to do something special
4366 * for each function we find. We call the callback
4367 * to give the caller an opportunity to do so.
4368 */
4369 if (probe_ops->init) {
4370 ret = probe_ops->init(probe_ops, tr,
4371 entry->ip, data,
4372 &probe->data);
4373 if (ret < 0) {
4374 if (probe_ops->free && count)
4375 probe_ops->free(probe_ops, tr,
4376 0, probe->data);
4377 probe->data = NULL;
4378 goto out;
4379 }
4380 }
4381 count++;
4382 }
4383 }
4384
4385 mutex_lock(&ftrace_lock);
4386
4387 if (!count) {
4388 /* Nothing was added? */
4389 ret = -EINVAL;
4390 goto out_unlock;
4391 }
4392
4393 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4394 hash, 1);
4395 if (ret < 0)
4396 goto err_unlock;
4397
4398 /* One ref for each new function traced */
4399 probe->ref += count;
4400
4401 if (!(probe->ops.flags & FTRACE_OPS_FL_ENABLED))
4402 ret = ftrace_startup(&probe->ops, 0);
4403
4404 out_unlock:
4405 mutex_unlock(&ftrace_lock);
4406
4407 if (!ret)
4408 ret = count;
4409 out:
4410 mutex_unlock(&probe->ops.func_hash->regex_lock);
4411 free_ftrace_hash(hash);
4412
4413 release_probe(probe);
4414
4415 return ret;
4416
4417 err_unlock:
4418 if (!probe_ops->free || !count)
4419 goto out_unlock;
4420
4421 /* Failed to do the move, need to call the free functions */
4422 for (i = 0; i < size; i++) {
4423 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
4424 if (ftrace_lookup_ip(old_hash, entry->ip))
4425 continue;
4426 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4427 }
4428 }
4429 goto out_unlock;
4430}
4431
4432int
4433unregister_ftrace_function_probe_func(char *glob, struct trace_array *tr,
4434 struct ftrace_probe_ops *probe_ops)
4435{
4436 struct ftrace_ops_hash old_hash_ops;
4437 struct ftrace_func_entry *entry;
4438 struct ftrace_func_probe *probe;
4439 struct ftrace_glob func_g;
4440 struct ftrace_hash **orig_hash;
4441 struct ftrace_hash *old_hash;
4442 struct ftrace_hash *hash = NULL;
4443 struct hlist_node *tmp;
4444 struct hlist_head hhd;
4445 char str[KSYM_SYMBOL_LEN];
4446 int count = 0;
4447 int i, ret = -ENODEV;
4448 int size;
4449
4450 if (!glob || !strlen(glob) || !strcmp(glob, "*"))
4451 func_g.search = NULL;
4452 else {
4453 int not;
4454
4455 func_g.type = filter_parse_regex(glob, strlen(glob),
4456 &func_g.search, ¬);
4457 func_g.len = strlen(func_g.search);
4458
4459 /* we do not support '!' for function probes */
4460 if (WARN_ON(not))
4461 return -EINVAL;
4462 }
4463
4464 mutex_lock(&ftrace_lock);
4465 /* Check if the probe_ops is already registered */
4466 list_for_each_entry(probe, &tr->func_probes, list) {
4467 if (probe->probe_ops == probe_ops)
4468 break;
4469 }
4470 if (&probe->list == &tr->func_probes)
4471 goto err_unlock_ftrace;
4472
4473 ret = -EINVAL;
4474 if (!(probe->ops.flags & FTRACE_OPS_FL_INITIALIZED))
4475 goto err_unlock_ftrace;
4476
4477 acquire_probe_locked(probe);
4478
4479 mutex_unlock(&ftrace_lock);
4480
4481 mutex_lock(&probe->ops.func_hash->regex_lock);
4482
4483 orig_hash = &probe->ops.func_hash->filter_hash;
4484 old_hash = *orig_hash;
4485
4486 if (ftrace_hash_empty(old_hash))
4487 goto out_unlock;
4488
4489 old_hash_ops.filter_hash = old_hash;
4490 /* Probes only have filters */
4491 old_hash_ops.notrace_hash = NULL;
4492
4493 ret = -ENOMEM;
4494 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
4495 if (!hash)
4496 goto out_unlock;
4497
4498 INIT_HLIST_HEAD(&hhd);
4499
4500 size = 1 << hash->size_bits;
4501 for (i = 0; i < size; i++) {
4502 hlist_for_each_entry_safe(entry, tmp, &hash->buckets[i], hlist) {
4503
4504 if (func_g.search) {
4505 kallsyms_lookup(entry->ip, NULL, NULL,
4506 NULL, str);
4507 if (!ftrace_match(str, &func_g))
4508 continue;
4509 }
4510 count++;
4511 remove_hash_entry(hash, entry);
4512 hlist_add_head(&entry->hlist, &hhd);
4513 }
4514 }
4515
4516 /* Nothing found? */
4517 if (!count) {
4518 ret = -EINVAL;
4519 goto out_unlock;
4520 }
4521
4522 mutex_lock(&ftrace_lock);
4523
4524 WARN_ON(probe->ref < count);
4525
4526 probe->ref -= count;
4527
4528 if (ftrace_hash_empty(hash))
4529 ftrace_shutdown(&probe->ops, 0);
4530
4531 ret = ftrace_hash_move_and_update_ops(&probe->ops, orig_hash,
4532 hash, 1);
4533
4534 /* still need to update the function call sites */
4535 if (ftrace_enabled && !ftrace_hash_empty(hash))
4536 ftrace_run_modify_code(&probe->ops, FTRACE_UPDATE_CALLS,
4537 &old_hash_ops);
4538 synchronize_sched();
4539
4540 hlist_for_each_entry_safe(entry, tmp, &hhd, hlist) {
4541 hlist_del(&entry->hlist);
4542 if (probe_ops->free)
4543 probe_ops->free(probe_ops, tr, entry->ip, probe->data);
4544 kfree(entry);
4545 }
4546 mutex_unlock(&ftrace_lock);
4547
4548 out_unlock:
4549 mutex_unlock(&probe->ops.func_hash->regex_lock);
4550 free_ftrace_hash(hash);
4551
4552 release_probe(probe);
4553
4554 return ret;
4555
4556 err_unlock_ftrace:
4557 mutex_unlock(&ftrace_lock);
4558 return ret;
4559}
4560
4561void clear_ftrace_function_probes(struct trace_array *tr)
4562{
4563 struct ftrace_func_probe *probe, *n;
4564
4565 list_for_each_entry_safe(probe, n, &tr->func_probes, list)
4566 unregister_ftrace_function_probe_func(NULL, tr, probe->probe_ops);
4567}
4568
4569static LIST_HEAD(ftrace_commands);
4570static DEFINE_MUTEX(ftrace_cmd_mutex);
4571
4572/*
4573 * Currently we only register ftrace commands from __init, so mark this
4574 * __init too.
4575 */
4576__init int register_ftrace_command(struct ftrace_func_command *cmd)
4577{
4578 struct ftrace_func_command *p;
4579 int ret = 0;
4580
4581 mutex_lock(&ftrace_cmd_mutex);
4582 list_for_each_entry(p, &ftrace_commands, list) {
4583 if (strcmp(cmd->name, p->name) == 0) {
4584 ret = -EBUSY;
4585 goto out_unlock;
4586 }
4587 }
4588 list_add(&cmd->list, &ftrace_commands);
4589 out_unlock:
4590 mutex_unlock(&ftrace_cmd_mutex);
4591
4592 return ret;
4593}
4594
4595/*
4596 * Currently we only unregister ftrace commands from __init, so mark
4597 * this __init too.
4598 */
4599__init int unregister_ftrace_command(struct ftrace_func_command *cmd)
4600{
4601 struct ftrace_func_command *p, *n;
4602 int ret = -ENODEV;
4603
4604 mutex_lock(&ftrace_cmd_mutex);
4605 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
4606 if (strcmp(cmd->name, p->name) == 0) {
4607 ret = 0;
4608 list_del_init(&p->list);
4609 goto out_unlock;
4610 }
4611 }
4612 out_unlock:
4613 mutex_unlock(&ftrace_cmd_mutex);
4614
4615 return ret;
4616}
4617
4618static int ftrace_process_regex(struct ftrace_iterator *iter,
4619 char *buff, int len, int enable)
4620{
4621 struct ftrace_hash *hash = iter->hash;
4622 struct trace_array *tr = iter->ops->private;
4623 char *func, *command, *next = buff;
4624 struct ftrace_func_command *p;
4625 int ret = -EINVAL;
4626
4627 func = strsep(&next, ":");
4628
4629 if (!next) {
4630 ret = ftrace_match_records(hash, func, len);
4631 if (!ret)
4632 ret = -EINVAL;
4633 if (ret < 0)
4634 return ret;
4635 return 0;
4636 }
4637
4638 /* command found */
4639
4640 command = strsep(&next, ":");
4641
4642 mutex_lock(&ftrace_cmd_mutex);
4643 list_for_each_entry(p, &ftrace_commands, list) {
4644 if (strcmp(p->name, command) == 0) {
4645 ret = p->func(tr, hash, func, command, next, enable);
4646 goto out_unlock;
4647 }
4648 }
4649 out_unlock:
4650 mutex_unlock(&ftrace_cmd_mutex);
4651
4652 return ret;
4653}
4654
4655static ssize_t
4656ftrace_regex_write(struct file *file, const char __user *ubuf,
4657 size_t cnt, loff_t *ppos, int enable)
4658{
4659 struct ftrace_iterator *iter;
4660 struct trace_parser *parser;
4661 ssize_t ret, read;
4662
4663 if (!cnt)
4664 return 0;
4665
4666 if (file->f_mode & FMODE_READ) {
4667 struct seq_file *m = file->private_data;
4668 iter = m->private;
4669 } else
4670 iter = file->private_data;
4671
4672 if (unlikely(ftrace_disabled))
4673 return -ENODEV;
4674
4675 /* iter->hash is a local copy, so we don't need regex_lock */
4676
4677 parser = &iter->parser;
4678 read = trace_get_user(parser, ubuf, cnt, ppos);
4679
4680 if (read >= 0 && trace_parser_loaded(parser) &&
4681 !trace_parser_cont(parser)) {
4682 ret = ftrace_process_regex(iter, parser->buffer,
4683 parser->idx, enable);
4684 trace_parser_clear(parser);
4685 if (ret < 0)
4686 goto out;
4687 }
4688
4689 ret = read;
4690 out:
4691 return ret;
4692}
4693
4694ssize_t
4695ftrace_filter_write(struct file *file, const char __user *ubuf,
4696 size_t cnt, loff_t *ppos)
4697{
4698 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
4699}
4700
4701ssize_t
4702ftrace_notrace_write(struct file *file, const char __user *ubuf,
4703 size_t cnt, loff_t *ppos)
4704{
4705 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
4706}
4707
4708static int
4709ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
4710{
4711 struct ftrace_func_entry *entry;
4712
4713 if (!ftrace_location(ip))
4714 return -EINVAL;
4715
4716 if (remove) {
4717 entry = ftrace_lookup_ip(hash, ip);
4718 if (!entry)
4719 return -ENOENT;
4720 free_hash_entry(hash, entry);
4721 return 0;
4722 }
4723
4724 return add_hash_entry(hash, ip);
4725}
4726
4727static int
4728ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
4729 unsigned long ip, int remove, int reset, int enable)
4730{
4731 struct ftrace_hash **orig_hash;
4732 struct ftrace_hash *hash;
4733 int ret;
4734
4735 if (unlikely(ftrace_disabled))
4736 return -ENODEV;
4737
4738 mutex_lock(&ops->func_hash->regex_lock);
4739
4740 if (enable)
4741 orig_hash = &ops->func_hash->filter_hash;
4742 else
4743 orig_hash = &ops->func_hash->notrace_hash;
4744
4745 if (reset)
4746 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4747 else
4748 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
4749
4750 if (!hash) {
4751 ret = -ENOMEM;
4752 goto out_regex_unlock;
4753 }
4754
4755 if (buf && !ftrace_match_records(hash, buf, len)) {
4756 ret = -EINVAL;
4757 goto out_regex_unlock;
4758 }
4759 if (ip) {
4760 ret = ftrace_match_addr(hash, ip, remove);
4761 if (ret < 0)
4762 goto out_regex_unlock;
4763 }
4764
4765 mutex_lock(&ftrace_lock);
4766 ret = ftrace_hash_move_and_update_ops(ops, orig_hash, hash, enable);
4767 mutex_unlock(&ftrace_lock);
4768
4769 out_regex_unlock:
4770 mutex_unlock(&ops->func_hash->regex_lock);
4771
4772 free_ftrace_hash(hash);
4773 return ret;
4774}
4775
4776static int
4777ftrace_set_addr(struct ftrace_ops *ops, unsigned long ip, int remove,
4778 int reset, int enable)
4779{
4780 return ftrace_set_hash(ops, 0, 0, ip, remove, reset, enable);
4781}
4782
4783/**
4784 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
4785 * @ops - the ops to set the filter with
4786 * @ip - the address to add to or remove from the filter.
4787 * @remove - non zero to remove the ip from the filter
4788 * @reset - non zero to reset all filters before applying this filter.
4789 *
4790 * Filters denote which functions should be enabled when tracing is enabled
4791 * If @ip is NULL, it failes to update filter.
4792 */
4793int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
4794 int remove, int reset)
4795{
4796 ftrace_ops_init(ops);
4797 return ftrace_set_addr(ops, ip, remove, reset, 1);
4798}
4799EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
4800
4801/**
4802 * ftrace_ops_set_global_filter - setup ops to use global filters
4803 * @ops - the ops which will use the global filters
4804 *
4805 * ftrace users who need global function trace filtering should call this.
4806 * It can set the global filter only if ops were not initialized before.
4807 */
4808void ftrace_ops_set_global_filter(struct ftrace_ops *ops)
4809{
4810 if (ops->flags & FTRACE_OPS_FL_INITIALIZED)
4811 return;
4812
4813 ftrace_ops_init(ops);
4814 ops->func_hash = &global_ops.local_hash;
4815}
4816EXPORT_SYMBOL_GPL(ftrace_ops_set_global_filter);
4817
4818static int
4819ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
4820 int reset, int enable)
4821{
4822 return ftrace_set_hash(ops, buf, len, 0, 0, reset, enable);
4823}
4824
4825/**
4826 * ftrace_set_filter - set a function to filter on in ftrace
4827 * @ops - the ops to set the filter with
4828 * @buf - the string that holds the function filter text.
4829 * @len - the length of the string.
4830 * @reset - non zero to reset all filters before applying this filter.
4831 *
4832 * Filters denote which functions should be enabled when tracing is enabled.
4833 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4834 */
4835int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
4836 int len, int reset)
4837{
4838 ftrace_ops_init(ops);
4839 return ftrace_set_regex(ops, buf, len, reset, 1);
4840}
4841EXPORT_SYMBOL_GPL(ftrace_set_filter);
4842
4843/**
4844 * ftrace_set_notrace - set a function to not trace in ftrace
4845 * @ops - the ops to set the notrace filter with
4846 * @buf - the string that holds the function notrace text.
4847 * @len - the length of the string.
4848 * @reset - non zero to reset all filters before applying this filter.
4849 *
4850 * Notrace Filters denote which functions should not be enabled when tracing
4851 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4852 * for tracing.
4853 */
4854int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
4855 int len, int reset)
4856{
4857 ftrace_ops_init(ops);
4858 return ftrace_set_regex(ops, buf, len, reset, 0);
4859}
4860EXPORT_SYMBOL_GPL(ftrace_set_notrace);
4861/**
4862 * ftrace_set_global_filter - set a function to filter on with global tracers
4863 * @buf - the string that holds the function filter text.
4864 * @len - the length of the string.
4865 * @reset - non zero to reset all filters before applying this filter.
4866 *
4867 * Filters denote which functions should be enabled when tracing is enabled.
4868 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4869 */
4870void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
4871{
4872 ftrace_set_regex(&global_ops, buf, len, reset, 1);
4873}
4874EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
4875
4876/**
4877 * ftrace_set_global_notrace - set a function to not trace with global tracers
4878 * @buf - the string that holds the function notrace text.
4879 * @len - the length of the string.
4880 * @reset - non zero to reset all filters before applying this filter.
4881 *
4882 * Notrace Filters denote which functions should not be enabled when tracing
4883 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4884 * for tracing.
4885 */
4886void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
4887{
4888 ftrace_set_regex(&global_ops, buf, len, reset, 0);
4889}
4890EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
4891
4892/*
4893 * command line interface to allow users to set filters on boot up.
4894 */
4895#define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
4896static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4897static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
4898
4899/* Used by function selftest to not test if filter is set */
4900bool ftrace_filter_param __initdata;
4901
4902static int __init set_ftrace_notrace(char *str)
4903{
4904 ftrace_filter_param = true;
4905 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
4906 return 1;
4907}
4908__setup("ftrace_notrace=", set_ftrace_notrace);
4909
4910static int __init set_ftrace_filter(char *str)
4911{
4912 ftrace_filter_param = true;
4913 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
4914 return 1;
4915}
4916__setup("ftrace_filter=", set_ftrace_filter);
4917
4918#ifdef CONFIG_FUNCTION_GRAPH_TRACER
4919static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
4920static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4921static int ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer);
4922
4923static int __init set_graph_function(char *str)
4924{
4925 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
4926 return 1;
4927}
4928__setup("ftrace_graph_filter=", set_graph_function);
4929
4930static int __init set_graph_notrace_function(char *str)
4931{
4932 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
4933 return 1;
4934}
4935__setup("ftrace_graph_notrace=", set_graph_notrace_function);
4936
4937static int __init set_graph_max_depth_function(char *str)
4938{
4939 if (!str)
4940 return 0;
4941 fgraph_max_depth = simple_strtoul(str, NULL, 0);
4942 return 1;
4943}
4944__setup("ftrace_graph_max_depth=", set_graph_max_depth_function);
4945
4946static void __init set_ftrace_early_graph(char *buf, int enable)
4947{
4948 int ret;
4949 char *func;
4950 struct ftrace_hash *hash;
4951
4952 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4953 if (WARN_ON(!hash))
4954 return;
4955
4956 while (buf) {
4957 func = strsep(&buf, ",");
4958 /* we allow only one expression at a time */
4959 ret = ftrace_graph_set_hash(hash, func);
4960 if (ret)
4961 printk(KERN_DEBUG "ftrace: function %s not "
4962 "traceable\n", func);
4963 }
4964
4965 if (enable)
4966 ftrace_graph_hash = hash;
4967 else
4968 ftrace_graph_notrace_hash = hash;
4969}
4970#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4971
4972void __init
4973ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
4974{
4975 char *func;
4976
4977 ftrace_ops_init(ops);
4978
4979 while (buf) {
4980 func = strsep(&buf, ",");
4981 ftrace_set_regex(ops, func, strlen(func), 0, enable);
4982 }
4983}
4984
4985static void __init set_ftrace_early_filters(void)
4986{
4987 if (ftrace_filter_buf[0])
4988 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
4989 if (ftrace_notrace_buf[0])
4990 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
4991#ifdef CONFIG_FUNCTION_GRAPH_TRACER
4992 if (ftrace_graph_buf[0])
4993 set_ftrace_early_graph(ftrace_graph_buf, 1);
4994 if (ftrace_graph_notrace_buf[0])
4995 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
4996#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4997}
4998
4999int ftrace_regex_release(struct inode *inode, struct file *file)
5000{
5001 struct seq_file *m = (struct seq_file *)file->private_data;
5002 struct ftrace_iterator *iter;
5003 struct ftrace_hash **orig_hash;
5004 struct trace_parser *parser;
5005 int filter_hash;
5006 int ret;
5007
5008 if (file->f_mode & FMODE_READ) {
5009 iter = m->private;
5010 seq_release(inode, file);
5011 } else
5012 iter = file->private_data;
5013
5014 parser = &iter->parser;
5015 if (trace_parser_loaded(parser)) {
5016 ftrace_match_records(iter->hash, parser->buffer, parser->idx);
5017 }
5018
5019 trace_parser_put(parser);
5020
5021 mutex_lock(&iter->ops->func_hash->regex_lock);
5022
5023 if (file->f_mode & FMODE_WRITE) {
5024 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
5025
5026 if (filter_hash) {
5027 orig_hash = &iter->ops->func_hash->filter_hash;
5028 if (iter->tr && !list_empty(&iter->tr->mod_trace))
5029 iter->hash->flags |= FTRACE_HASH_FL_MOD;
5030 } else
5031 orig_hash = &iter->ops->func_hash->notrace_hash;
5032
5033 mutex_lock(&ftrace_lock);
5034 ret = ftrace_hash_move_and_update_ops(iter->ops, orig_hash,
5035 iter->hash, filter_hash);
5036 mutex_unlock(&ftrace_lock);
5037 } else {
5038 /* For read only, the hash is the ops hash */
5039 iter->hash = NULL;
5040 }
5041
5042 mutex_unlock(&iter->ops->func_hash->regex_lock);
5043 free_ftrace_hash(iter->hash);
5044 kfree(iter);
5045
5046 return 0;
5047}
5048
5049static const struct file_operations ftrace_avail_fops = {
5050 .open = ftrace_avail_open,
5051 .read = seq_read,
5052 .llseek = seq_lseek,
5053 .release = seq_release_private,
5054};
5055
5056static const struct file_operations ftrace_enabled_fops = {
5057 .open = ftrace_enabled_open,
5058 .read = seq_read,
5059 .llseek = seq_lseek,
5060 .release = seq_release_private,
5061};
5062
5063static const struct file_operations ftrace_filter_fops = {
5064 .open = ftrace_filter_open,
5065 .read = seq_read,
5066 .write = ftrace_filter_write,
5067 .llseek = tracing_lseek,
5068 .release = ftrace_regex_release,
5069};
5070
5071static const struct file_operations ftrace_notrace_fops = {
5072 .open = ftrace_notrace_open,
5073 .read = seq_read,
5074 .write = ftrace_notrace_write,
5075 .llseek = tracing_lseek,
5076 .release = ftrace_regex_release,
5077};
5078
5079#ifdef CONFIG_FUNCTION_GRAPH_TRACER
5080
5081static DEFINE_MUTEX(graph_lock);
5082
5083struct ftrace_hash *ftrace_graph_hash = EMPTY_HASH;
5084struct ftrace_hash *ftrace_graph_notrace_hash = EMPTY_HASH;
5085
5086enum graph_filter_type {
5087 GRAPH_FILTER_NOTRACE = 0,
5088 GRAPH_FILTER_FUNCTION,
5089};
5090
5091#define FTRACE_GRAPH_EMPTY ((void *)1)
5092
5093struct ftrace_graph_data {
5094 struct ftrace_hash *hash;
5095 struct ftrace_func_entry *entry;
5096 int idx; /* for hash table iteration */
5097 enum graph_filter_type type;
5098 struct ftrace_hash *new_hash;
5099 const struct seq_operations *seq_ops;
5100 struct trace_parser parser;
5101};
5102
5103static void *
5104__g_next(struct seq_file *m, loff_t *pos)
5105{
5106 struct ftrace_graph_data *fgd = m->private;
5107 struct ftrace_func_entry *entry = fgd->entry;
5108 struct hlist_head *head;
5109 int i, idx = fgd->idx;
5110
5111 if (*pos >= fgd->hash->count)
5112 return NULL;
5113
5114 if (entry) {
5115 hlist_for_each_entry_continue(entry, hlist) {
5116 fgd->entry = entry;
5117 return entry;
5118 }
5119
5120 idx++;
5121 }
5122
5123 for (i = idx; i < 1 << fgd->hash->size_bits; i++) {
5124 head = &fgd->hash->buckets[i];
5125 hlist_for_each_entry(entry, head, hlist) {
5126 fgd->entry = entry;
5127 fgd->idx = i;
5128 return entry;
5129 }
5130 }
5131 return NULL;
5132}
5133
5134static void *
5135g_next(struct seq_file *m, void *v, loff_t *pos)
5136{
5137 (*pos)++;
5138 return __g_next(m, pos);
5139}
5140
5141static void *g_start(struct seq_file *m, loff_t *pos)
5142{
5143 struct ftrace_graph_data *fgd = m->private;
5144
5145 mutex_lock(&graph_lock);
5146
5147 if (fgd->type == GRAPH_FILTER_FUNCTION)
5148 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
5149 lockdep_is_held(&graph_lock));
5150 else
5151 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5152 lockdep_is_held(&graph_lock));
5153
5154 /* Nothing, tell g_show to print all functions are enabled */
5155 if (ftrace_hash_empty(fgd->hash) && !*pos)
5156 return FTRACE_GRAPH_EMPTY;
5157
5158 fgd->idx = 0;
5159 fgd->entry = NULL;
5160 return __g_next(m, pos);
5161}
5162
5163static void g_stop(struct seq_file *m, void *p)
5164{
5165 mutex_unlock(&graph_lock);
5166}
5167
5168static int g_show(struct seq_file *m, void *v)
5169{
5170 struct ftrace_func_entry *entry = v;
5171
5172 if (!entry)
5173 return 0;
5174
5175 if (entry == FTRACE_GRAPH_EMPTY) {
5176 struct ftrace_graph_data *fgd = m->private;
5177
5178 if (fgd->type == GRAPH_FILTER_FUNCTION)
5179 seq_puts(m, "#### all functions enabled ####\n");
5180 else
5181 seq_puts(m, "#### no functions disabled ####\n");
5182 return 0;
5183 }
5184
5185 seq_printf(m, "%ps\n", (void *)entry->ip);
5186
5187 return 0;
5188}
5189
5190static const struct seq_operations ftrace_graph_seq_ops = {
5191 .start = g_start,
5192 .next = g_next,
5193 .stop = g_stop,
5194 .show = g_show,
5195};
5196
5197static int
5198__ftrace_graph_open(struct inode *inode, struct file *file,
5199 struct ftrace_graph_data *fgd)
5200{
5201 int ret = 0;
5202 struct ftrace_hash *new_hash = NULL;
5203
5204 if (file->f_mode & FMODE_WRITE) {
5205 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
5206
5207 if (trace_parser_get_init(&fgd->parser, FTRACE_BUFF_MAX))
5208 return -ENOMEM;
5209
5210 if (file->f_flags & O_TRUNC)
5211 new_hash = alloc_ftrace_hash(size_bits);
5212 else
5213 new_hash = alloc_and_copy_ftrace_hash(size_bits,
5214 fgd->hash);
5215 if (!new_hash) {
5216 ret = -ENOMEM;
5217 goto out;
5218 }
5219 }
5220
5221 if (file->f_mode & FMODE_READ) {
5222 ret = seq_open(file, &ftrace_graph_seq_ops);
5223 if (!ret) {
5224 struct seq_file *m = file->private_data;
5225 m->private = fgd;
5226 } else {
5227 /* Failed */
5228 free_ftrace_hash(new_hash);
5229 new_hash = NULL;
5230 }
5231 } else
5232 file->private_data = fgd;
5233
5234out:
5235 if (ret < 0 && file->f_mode & FMODE_WRITE)
5236 trace_parser_put(&fgd->parser);
5237
5238 fgd->new_hash = new_hash;
5239
5240 /*
5241 * All uses of fgd->hash must be taken with the graph_lock
5242 * held. The graph_lock is going to be released, so force
5243 * fgd->hash to be reinitialized when it is taken again.
5244 */
5245 fgd->hash = NULL;
5246
5247 return ret;
5248}
5249
5250static int
5251ftrace_graph_open(struct inode *inode, struct file *file)
5252{
5253 struct ftrace_graph_data *fgd;
5254 int ret;
5255
5256 if (unlikely(ftrace_disabled))
5257 return -ENODEV;
5258
5259 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
5260 if (fgd == NULL)
5261 return -ENOMEM;
5262
5263 mutex_lock(&graph_lock);
5264
5265 fgd->hash = rcu_dereference_protected(ftrace_graph_hash,
5266 lockdep_is_held(&graph_lock));
5267 fgd->type = GRAPH_FILTER_FUNCTION;
5268 fgd->seq_ops = &ftrace_graph_seq_ops;
5269
5270 ret = __ftrace_graph_open(inode, file, fgd);
5271 if (ret < 0)
5272 kfree(fgd);
5273
5274 mutex_unlock(&graph_lock);
5275 return ret;
5276}
5277
5278static int
5279ftrace_graph_notrace_open(struct inode *inode, struct file *file)
5280{
5281 struct ftrace_graph_data *fgd;
5282 int ret;
5283
5284 if (unlikely(ftrace_disabled))
5285 return -ENODEV;
5286
5287 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
5288 if (fgd == NULL)
5289 return -ENOMEM;
5290
5291 mutex_lock(&graph_lock);
5292
5293 fgd->hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5294 lockdep_is_held(&graph_lock));
5295 fgd->type = GRAPH_FILTER_NOTRACE;
5296 fgd->seq_ops = &ftrace_graph_seq_ops;
5297
5298 ret = __ftrace_graph_open(inode, file, fgd);
5299 if (ret < 0)
5300 kfree(fgd);
5301
5302 mutex_unlock(&graph_lock);
5303 return ret;
5304}
5305
5306static int
5307ftrace_graph_release(struct inode *inode, struct file *file)
5308{
5309 struct ftrace_graph_data *fgd;
5310 struct ftrace_hash *old_hash, *new_hash;
5311 struct trace_parser *parser;
5312 int ret = 0;
5313
5314 if (file->f_mode & FMODE_READ) {
5315 struct seq_file *m = file->private_data;
5316
5317 fgd = m->private;
5318 seq_release(inode, file);
5319 } else {
5320 fgd = file->private_data;
5321 }
5322
5323
5324 if (file->f_mode & FMODE_WRITE) {
5325
5326 parser = &fgd->parser;
5327
5328 if (trace_parser_loaded((parser))) {
5329 ret = ftrace_graph_set_hash(fgd->new_hash,
5330 parser->buffer);
5331 }
5332
5333 trace_parser_put(parser);
5334
5335 new_hash = __ftrace_hash_move(fgd->new_hash);
5336 if (!new_hash) {
5337 ret = -ENOMEM;
5338 goto out;
5339 }
5340
5341 mutex_lock(&graph_lock);
5342
5343 if (fgd->type == GRAPH_FILTER_FUNCTION) {
5344 old_hash = rcu_dereference_protected(ftrace_graph_hash,
5345 lockdep_is_held(&graph_lock));
5346 rcu_assign_pointer(ftrace_graph_hash, new_hash);
5347 } else {
5348 old_hash = rcu_dereference_protected(ftrace_graph_notrace_hash,
5349 lockdep_is_held(&graph_lock));
5350 rcu_assign_pointer(ftrace_graph_notrace_hash, new_hash);
5351 }
5352
5353 mutex_unlock(&graph_lock);
5354
5355 /* Wait till all users are no longer using the old hash */
5356 synchronize_sched();
5357
5358 free_ftrace_hash(old_hash);
5359 }
5360
5361 out:
5362 free_ftrace_hash(fgd->new_hash);
5363 kfree(fgd);
5364
5365 return ret;
5366}
5367
5368static int
5369ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer)
5370{
5371 struct ftrace_glob func_g;
5372 struct dyn_ftrace *rec;
5373 struct ftrace_page *pg;
5374 struct ftrace_func_entry *entry;
5375 int fail = 1;
5376 int not;
5377
5378 /* decode regex */
5379 func_g.type = filter_parse_regex(buffer, strlen(buffer),
5380 &func_g.search, ¬);
5381
5382 func_g.len = strlen(func_g.search);
5383
5384 mutex_lock(&ftrace_lock);
5385
5386 if (unlikely(ftrace_disabled)) {
5387 mutex_unlock(&ftrace_lock);
5388 return -ENODEV;
5389 }
5390
5391 do_for_each_ftrace_rec(pg, rec) {
5392
5393 if (rec->flags & FTRACE_FL_DISABLED)
5394 continue;
5395
5396 if (ftrace_match_record(rec, &func_g, NULL, 0)) {
5397 entry = ftrace_lookup_ip(hash, rec->ip);
5398
5399 if (!not) {
5400 fail = 0;
5401
5402 if (entry)
5403 continue;
5404 if (add_hash_entry(hash, rec->ip) < 0)
5405 goto out;
5406 } else {
5407 if (entry) {
5408 free_hash_entry(hash, entry);
5409 fail = 0;
5410 }
5411 }
5412 }
5413 } while_for_each_ftrace_rec();
5414out:
5415 mutex_unlock(&ftrace_lock);
5416
5417 if (fail)
5418 return -EINVAL;
5419
5420 return 0;
5421}
5422
5423static ssize_t
5424ftrace_graph_write(struct file *file, const char __user *ubuf,
5425 size_t cnt, loff_t *ppos)
5426{
5427 ssize_t read, ret = 0;
5428 struct ftrace_graph_data *fgd = file->private_data;
5429 struct trace_parser *parser;
5430
5431 if (!cnt)
5432 return 0;
5433
5434 /* Read mode uses seq functions */
5435 if (file->f_mode & FMODE_READ) {
5436 struct seq_file *m = file->private_data;
5437 fgd = m->private;
5438 }
5439
5440 parser = &fgd->parser;
5441
5442 read = trace_get_user(parser, ubuf, cnt, ppos);
5443
5444 if (read >= 0 && trace_parser_loaded(parser) &&
5445 !trace_parser_cont(parser)) {
5446
5447 ret = ftrace_graph_set_hash(fgd->new_hash,
5448 parser->buffer);
5449 trace_parser_clear(parser);
5450 }
5451
5452 if (!ret)
5453 ret = read;
5454
5455 return ret;
5456}
5457
5458static const struct file_operations ftrace_graph_fops = {
5459 .open = ftrace_graph_open,
5460 .read = seq_read,
5461 .write = ftrace_graph_write,
5462 .llseek = tracing_lseek,
5463 .release = ftrace_graph_release,
5464};
5465
5466static const struct file_operations ftrace_graph_notrace_fops = {
5467 .open = ftrace_graph_notrace_open,
5468 .read = seq_read,
5469 .write = ftrace_graph_write,
5470 .llseek = tracing_lseek,
5471 .release = ftrace_graph_release,
5472};
5473#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5474
5475void ftrace_create_filter_files(struct ftrace_ops *ops,
5476 struct dentry *parent)
5477{
5478
5479 trace_create_file("set_ftrace_filter", 0644, parent,
5480 ops, &ftrace_filter_fops);
5481
5482 trace_create_file("set_ftrace_notrace", 0644, parent,
5483 ops, &ftrace_notrace_fops);
5484}
5485
5486/*
5487 * The name "destroy_filter_files" is really a misnomer. Although
5488 * in the future, it may actualy delete the files, but this is
5489 * really intended to make sure the ops passed in are disabled
5490 * and that when this function returns, the caller is free to
5491 * free the ops.
5492 *
5493 * The "destroy" name is only to match the "create" name that this
5494 * should be paired with.
5495 */
5496void ftrace_destroy_filter_files(struct ftrace_ops *ops)
5497{
5498 mutex_lock(&ftrace_lock);
5499 if (ops->flags & FTRACE_OPS_FL_ENABLED)
5500 ftrace_shutdown(ops, 0);
5501 ops->flags |= FTRACE_OPS_FL_DELETED;
5502 mutex_unlock(&ftrace_lock);
5503}
5504
5505static __init int ftrace_init_dyn_tracefs(struct dentry *d_tracer)
5506{
5507
5508 trace_create_file("available_filter_functions", 0444,
5509 d_tracer, NULL, &ftrace_avail_fops);
5510
5511 trace_create_file("enabled_functions", 0444,
5512 d_tracer, NULL, &ftrace_enabled_fops);
5513
5514 ftrace_create_filter_files(&global_ops, d_tracer);
5515
5516#ifdef CONFIG_FUNCTION_GRAPH_TRACER
5517 trace_create_file("set_graph_function", 0644, d_tracer,
5518 NULL,
5519 &ftrace_graph_fops);
5520 trace_create_file("set_graph_notrace", 0644, d_tracer,
5521 NULL,
5522 &ftrace_graph_notrace_fops);
5523#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
5524
5525 return 0;
5526}
5527
5528static int ftrace_cmp_ips(const void *a, const void *b)
5529{
5530 const unsigned long *ipa = a;
5531 const unsigned long *ipb = b;
5532
5533 if (*ipa > *ipb)
5534 return 1;
5535 if (*ipa < *ipb)
5536 return -1;
5537 return 0;
5538}
5539
5540static int ftrace_process_locs(struct module *mod,
5541 unsigned long *start,
5542 unsigned long *end)
5543{
5544 struct ftrace_page *start_pg;
5545 struct ftrace_page *pg;
5546 struct dyn_ftrace *rec;
5547 unsigned long count;
5548 unsigned long *p;
5549 unsigned long addr;
5550 unsigned long flags = 0; /* Shut up gcc */
5551 int ret = -ENOMEM;
5552
5553 count = end - start;
5554
5555 if (!count)
5556 return 0;
5557
5558 sort(start, count, sizeof(*start),
5559 ftrace_cmp_ips, NULL);
5560
5561 start_pg = ftrace_allocate_pages(count);
5562 if (!start_pg)
5563 return -ENOMEM;
5564
5565 mutex_lock(&ftrace_lock);
5566
5567 /*
5568 * Core and each module needs their own pages, as
5569 * modules will free them when they are removed.
5570 * Force a new page to be allocated for modules.
5571 */
5572 if (!mod) {
5573 WARN_ON(ftrace_pages || ftrace_pages_start);
5574 /* First initialization */
5575 ftrace_pages = ftrace_pages_start = start_pg;
5576 } else {
5577 if (!ftrace_pages)
5578 goto out;
5579
5580 if (WARN_ON(ftrace_pages->next)) {
5581 /* Hmm, we have free pages? */
5582 while (ftrace_pages->next)
5583 ftrace_pages = ftrace_pages->next;
5584 }
5585
5586 ftrace_pages->next = start_pg;
5587 }
5588
5589 p = start;
5590 pg = start_pg;
5591 while (p < end) {
5592 addr = ftrace_call_adjust(*p++);
5593 /*
5594 * Some architecture linkers will pad between
5595 * the different mcount_loc sections of different
5596 * object files to satisfy alignments.
5597 * Skip any NULL pointers.
5598 */
5599 if (!addr)
5600 continue;
5601
5602 if (pg->index == pg->size) {
5603 /* We should have allocated enough */
5604 if (WARN_ON(!pg->next))
5605 break;
5606 pg = pg->next;
5607 }
5608
5609 rec = &pg->records[pg->index++];
5610 rec->ip = addr;
5611 }
5612
5613 /* We should have used all pages */
5614 WARN_ON(pg->next);
5615
5616 /* Assign the last page to ftrace_pages */
5617 ftrace_pages = pg;
5618
5619 /*
5620 * We only need to disable interrupts on start up
5621 * because we are modifying code that an interrupt
5622 * may execute, and the modification is not atomic.
5623 * But for modules, nothing runs the code we modify
5624 * until we are finished with it, and there's no
5625 * reason to cause large interrupt latencies while we do it.
5626 */
5627 if (!mod)
5628 local_irq_save(flags);
5629 ftrace_update_code(mod, start_pg);
5630 if (!mod)
5631 local_irq_restore(flags);
5632 ret = 0;
5633 out:
5634 mutex_unlock(&ftrace_lock);
5635
5636 return ret;
5637}
5638
5639struct ftrace_mod_func {
5640 struct list_head list;
5641 char *name;
5642 unsigned long ip;
5643 unsigned int size;
5644};
5645
5646struct ftrace_mod_map {
5647 struct rcu_head rcu;
5648 struct list_head list;
5649 struct module *mod;
5650 unsigned long start_addr;
5651 unsigned long end_addr;
5652 struct list_head funcs;
5653 unsigned int num_funcs;
5654};
5655
5656#ifdef CONFIG_MODULES
5657
5658#define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
5659
5660static LIST_HEAD(ftrace_mod_maps);
5661
5662static int referenced_filters(struct dyn_ftrace *rec)
5663{
5664 struct ftrace_ops *ops;
5665 int cnt = 0;
5666
5667 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
5668 if (ops_references_rec(ops, rec))
5669 cnt++;
5670 }
5671
5672 return cnt;
5673}
5674
5675static void
5676clear_mod_from_hash(struct ftrace_page *pg, struct ftrace_hash *hash)
5677{
5678 struct ftrace_func_entry *entry;
5679 struct dyn_ftrace *rec;
5680 int i;
5681
5682 if (ftrace_hash_empty(hash))
5683 return;
5684
5685 for (i = 0; i < pg->index; i++) {
5686 rec = &pg->records[i];
5687 entry = __ftrace_lookup_ip(hash, rec->ip);
5688 /*
5689 * Do not allow this rec to match again.
5690 * Yeah, it may waste some memory, but will be removed
5691 * if/when the hash is modified again.
5692 */
5693 if (entry)
5694 entry->ip = 0;
5695 }
5696}
5697
5698/* Clear any records from hashs */
5699static void clear_mod_from_hashes(struct ftrace_page *pg)
5700{
5701 struct trace_array *tr;
5702
5703 mutex_lock(&trace_types_lock);
5704 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
5705 if (!tr->ops || !tr->ops->func_hash)
5706 continue;
5707 mutex_lock(&tr->ops->func_hash->regex_lock);
5708 clear_mod_from_hash(pg, tr->ops->func_hash->filter_hash);
5709 clear_mod_from_hash(pg, tr->ops->func_hash->notrace_hash);
5710 mutex_unlock(&tr->ops->func_hash->regex_lock);
5711 }
5712 mutex_unlock(&trace_types_lock);
5713}
5714
5715static void ftrace_free_mod_map(struct rcu_head *rcu)
5716{
5717 struct ftrace_mod_map *mod_map = container_of(rcu, struct ftrace_mod_map, rcu);
5718 struct ftrace_mod_func *mod_func;
5719 struct ftrace_mod_func *n;
5720
5721 /* All the contents of mod_map are now not visible to readers */
5722 list_for_each_entry_safe(mod_func, n, &mod_map->funcs, list) {
5723 kfree(mod_func->name);
5724 list_del(&mod_func->list);
5725 kfree(mod_func);
5726 }
5727
5728 kfree(mod_map);
5729}
5730
5731void ftrace_release_mod(struct module *mod)
5732{
5733 struct ftrace_mod_map *mod_map;
5734 struct ftrace_mod_map *n;
5735 struct dyn_ftrace *rec;
5736 struct ftrace_page **last_pg;
5737 struct ftrace_page *tmp_page = NULL;
5738 struct ftrace_page *pg;
5739 int order;
5740
5741 mutex_lock(&ftrace_lock);
5742
5743 if (ftrace_disabled)
5744 goto out_unlock;
5745
5746 list_for_each_entry_safe(mod_map, n, &ftrace_mod_maps, list) {
5747 if (mod_map->mod == mod) {
5748 list_del_rcu(&mod_map->list);
5749 call_rcu_sched(&mod_map->rcu, ftrace_free_mod_map);
5750 break;
5751 }
5752 }
5753
5754 /*
5755 * Each module has its own ftrace_pages, remove
5756 * them from the list.
5757 */
5758 last_pg = &ftrace_pages_start;
5759 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
5760 rec = &pg->records[0];
5761 if (within_module_core(rec->ip, mod) ||
5762 within_module_init(rec->ip, mod)) {
5763 /*
5764 * As core pages are first, the first
5765 * page should never be a module page.
5766 */
5767 if (WARN_ON(pg == ftrace_pages_start))
5768 goto out_unlock;
5769
5770 /* Check if we are deleting the last page */
5771 if (pg == ftrace_pages)
5772 ftrace_pages = next_to_ftrace_page(last_pg);
5773
5774 ftrace_update_tot_cnt -= pg->index;
5775 *last_pg = pg->next;
5776
5777 pg->next = tmp_page;
5778 tmp_page = pg;
5779 } else
5780 last_pg = &pg->next;
5781 }
5782 out_unlock:
5783 mutex_unlock(&ftrace_lock);
5784
5785 for (pg = tmp_page; pg; pg = tmp_page) {
5786
5787 /* Needs to be called outside of ftrace_lock */
5788 clear_mod_from_hashes(pg);
5789
5790 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
5791 free_pages((unsigned long)pg->records, order);
5792 tmp_page = pg->next;
5793 kfree(pg);
5794 }
5795}
5796
5797void ftrace_module_enable(struct module *mod)
5798{
5799 struct dyn_ftrace *rec;
5800 struct ftrace_page *pg;
5801
5802 mutex_lock(&ftrace_lock);
5803
5804 if (ftrace_disabled)
5805 goto out_unlock;
5806
5807 /*
5808 * If the tracing is enabled, go ahead and enable the record.
5809 *
5810 * The reason not to enable the record immediatelly is the
5811 * inherent check of ftrace_make_nop/ftrace_make_call for
5812 * correct previous instructions. Making first the NOP
5813 * conversion puts the module to the correct state, thus
5814 * passing the ftrace_make_call check.
5815 *
5816 * We also delay this to after the module code already set the
5817 * text to read-only, as we now need to set it back to read-write
5818 * so that we can modify the text.
5819 */
5820 if (ftrace_start_up)
5821 ftrace_arch_code_modify_prepare();
5822
5823 do_for_each_ftrace_rec(pg, rec) {
5824 int cnt;
5825 /*
5826 * do_for_each_ftrace_rec() is a double loop.
5827 * module text shares the pg. If a record is
5828 * not part of this module, then skip this pg,
5829 * which the "break" will do.
5830 */
5831 if (!within_module_core(rec->ip, mod) &&
5832 !within_module_init(rec->ip, mod))
5833 break;
5834
5835 cnt = 0;
5836
5837 /*
5838 * When adding a module, we need to check if tracers are
5839 * currently enabled and if they are, and can trace this record,
5840 * we need to enable the module functions as well as update the
5841 * reference counts for those function records.
5842 */
5843 if (ftrace_start_up)
5844 cnt += referenced_filters(rec);
5845
5846 /* This clears FTRACE_FL_DISABLED */
5847 rec->flags = cnt;
5848
5849 if (ftrace_start_up && cnt) {
5850 int failed = __ftrace_replace_code(rec, 1);
5851 if (failed) {
5852 ftrace_bug(failed, rec);
5853 goto out_loop;
5854 }
5855 }
5856
5857 } while_for_each_ftrace_rec();
5858
5859 out_loop:
5860 if (ftrace_start_up)
5861 ftrace_arch_code_modify_post_process();
5862
5863 out_unlock:
5864 mutex_unlock(&ftrace_lock);
5865
5866 process_cached_mods(mod->name);
5867}
5868
5869void ftrace_module_init(struct module *mod)
5870{
5871 if (ftrace_disabled || !mod->num_ftrace_callsites)
5872 return;
5873
5874 ftrace_process_locs(mod, mod->ftrace_callsites,
5875 mod->ftrace_callsites + mod->num_ftrace_callsites);
5876}
5877
5878static void save_ftrace_mod_rec(struct ftrace_mod_map *mod_map,
5879 struct dyn_ftrace *rec)
5880{
5881 struct ftrace_mod_func *mod_func;
5882 unsigned long symsize;
5883 unsigned long offset;
5884 char str[KSYM_SYMBOL_LEN];
5885 char *modname;
5886 const char *ret;
5887
5888 ret = kallsyms_lookup(rec->ip, &symsize, &offset, &modname, str);
5889 if (!ret)
5890 return;
5891
5892 mod_func = kmalloc(sizeof(*mod_func), GFP_KERNEL);
5893 if (!mod_func)
5894 return;
5895
5896 mod_func->name = kstrdup(str, GFP_KERNEL);
5897 if (!mod_func->name) {
5898 kfree(mod_func);
5899 return;
5900 }
5901
5902 mod_func->ip = rec->ip - offset;
5903 mod_func->size = symsize;
5904
5905 mod_map->num_funcs++;
5906
5907 list_add_rcu(&mod_func->list, &mod_map->funcs);
5908}
5909
5910static struct ftrace_mod_map *
5911allocate_ftrace_mod_map(struct module *mod,
5912 unsigned long start, unsigned long end)
5913{
5914 struct ftrace_mod_map *mod_map;
5915
5916 mod_map = kmalloc(sizeof(*mod_map), GFP_KERNEL);
5917 if (!mod_map)
5918 return NULL;
5919
5920 mod_map->mod = mod;
5921 mod_map->start_addr = start;
5922 mod_map->end_addr = end;
5923 mod_map->num_funcs = 0;
5924
5925 INIT_LIST_HEAD_RCU(&mod_map->funcs);
5926
5927 list_add_rcu(&mod_map->list, &ftrace_mod_maps);
5928
5929 return mod_map;
5930}
5931
5932static const char *
5933ftrace_func_address_lookup(struct ftrace_mod_map *mod_map,
5934 unsigned long addr, unsigned long *size,
5935 unsigned long *off, char *sym)
5936{
5937 struct ftrace_mod_func *found_func = NULL;
5938 struct ftrace_mod_func *mod_func;
5939
5940 list_for_each_entry_rcu(mod_func, &mod_map->funcs, list) {
5941 if (addr >= mod_func->ip &&
5942 addr < mod_func->ip + mod_func->size) {
5943 found_func = mod_func;
5944 break;
5945 }
5946 }
5947
5948 if (found_func) {
5949 if (size)
5950 *size = found_func->size;
5951 if (off)
5952 *off = addr - found_func->ip;
5953 if (sym)
5954 strlcpy(sym, found_func->name, KSYM_NAME_LEN);
5955
5956 return found_func->name;
5957 }
5958
5959 return NULL;
5960}
5961
5962const char *
5963ftrace_mod_address_lookup(unsigned long addr, unsigned long *size,
5964 unsigned long *off, char **modname, char *sym)
5965{
5966 struct ftrace_mod_map *mod_map;
5967 const char *ret = NULL;
5968
5969 /* mod_map is freed via call_rcu_sched() */
5970 preempt_disable();
5971 list_for_each_entry_rcu(mod_map, &ftrace_mod_maps, list) {
5972 ret = ftrace_func_address_lookup(mod_map, addr, size, off, sym);
5973 if (ret) {
5974 if (modname)
5975 *modname = mod_map->mod->name;
5976 break;
5977 }
5978 }
5979 preempt_enable();
5980
5981 return ret;
5982}
5983
5984int ftrace_mod_get_kallsym(unsigned int symnum, unsigned long *value,
5985 char *type, char *name,
5986 char *module_name, int *exported)
5987{
5988 struct ftrace_mod_map *mod_map;
5989 struct ftrace_mod_func *mod_func;
5990
5991 preempt_disable();
5992 list_for_each_entry_rcu(mod_map, &ftrace_mod_maps, list) {
5993
5994 if (symnum >= mod_map->num_funcs) {
5995 symnum -= mod_map->num_funcs;
5996 continue;
5997 }
5998
5999 list_for_each_entry_rcu(mod_func, &mod_map->funcs, list) {
6000 if (symnum > 1) {
6001 symnum--;
6002 continue;
6003 }
6004
6005 *value = mod_func->ip;
6006 *type = 'T';
6007 strlcpy(name, mod_func->name, KSYM_NAME_LEN);
6008 strlcpy(module_name, mod_map->mod->name, MODULE_NAME_LEN);
6009 *exported = 1;
6010 preempt_enable();
6011 return 0;
6012 }
6013 WARN_ON(1);
6014 break;
6015 }
6016 preempt_enable();
6017 return -ERANGE;
6018}
6019
6020#else
6021static void save_ftrace_mod_rec(struct ftrace_mod_map *mod_map,
6022 struct dyn_ftrace *rec) { }
6023static inline struct ftrace_mod_map *
6024allocate_ftrace_mod_map(struct module *mod,
6025 unsigned long start, unsigned long end)
6026{
6027 return NULL;
6028}
6029#endif /* CONFIG_MODULES */
6030
6031struct ftrace_init_func {
6032 struct list_head list;
6033 unsigned long ip;
6034};
6035
6036/* Clear any init ips from hashes */
6037static void
6038clear_func_from_hash(struct ftrace_init_func *func, struct ftrace_hash *hash)
6039{
6040 struct ftrace_func_entry *entry;
6041
6042 if (ftrace_hash_empty(hash))
6043 return;
6044
6045 entry = __ftrace_lookup_ip(hash, func->ip);
6046
6047 /*
6048 * Do not allow this rec to match again.
6049 * Yeah, it may waste some memory, but will be removed
6050 * if/when the hash is modified again.
6051 */
6052 if (entry)
6053 entry->ip = 0;
6054}
6055
6056static void
6057clear_func_from_hashes(struct ftrace_init_func *func)
6058{
6059 struct trace_array *tr;
6060
6061 mutex_lock(&trace_types_lock);
6062 list_for_each_entry(tr, &ftrace_trace_arrays, list) {
6063 if (!tr->ops || !tr->ops->func_hash)
6064 continue;
6065 mutex_lock(&tr->ops->func_hash->regex_lock);
6066 clear_func_from_hash(func, tr->ops->func_hash->filter_hash);
6067 clear_func_from_hash(func, tr->ops->func_hash->notrace_hash);
6068 mutex_unlock(&tr->ops->func_hash->regex_lock);
6069 }
6070 mutex_unlock(&trace_types_lock);
6071}
6072
6073static void add_to_clear_hash_list(struct list_head *clear_list,
6074 struct dyn_ftrace *rec)
6075{
6076 struct ftrace_init_func *func;
6077
6078 func = kmalloc(sizeof(*func), GFP_KERNEL);
6079 if (!func) {
6080 WARN_ONCE(1, "alloc failure, ftrace filter could be stale\n");
6081 return;
6082 }
6083
6084 func->ip = rec->ip;
6085 list_add(&func->list, clear_list);
6086}
6087
6088void ftrace_free_mem(struct module *mod, void *start_ptr, void *end_ptr)
6089{
6090 unsigned long start = (unsigned long)(start_ptr);
6091 unsigned long end = (unsigned long)(end_ptr);
6092 struct ftrace_page **last_pg = &ftrace_pages_start;
6093 struct ftrace_page *pg;
6094 struct dyn_ftrace *rec;
6095 struct dyn_ftrace key;
6096 struct ftrace_mod_map *mod_map = NULL;
6097 struct ftrace_init_func *func, *func_next;
6098 struct list_head clear_hash;
6099 int order;
6100
6101 INIT_LIST_HEAD(&clear_hash);
6102
6103 key.ip = start;
6104 key.flags = end; /* overload flags, as it is unsigned long */
6105
6106 mutex_lock(&ftrace_lock);
6107
6108 /*
6109 * If we are freeing module init memory, then check if
6110 * any tracer is active. If so, we need to save a mapping of
6111 * the module functions being freed with the address.
6112 */
6113 if (mod && ftrace_ops_list != &ftrace_list_end)
6114 mod_map = allocate_ftrace_mod_map(mod, start, end);
6115
6116 for (pg = ftrace_pages_start; pg; last_pg = &pg->next, pg = *last_pg) {
6117 if (end < pg->records[0].ip ||
6118 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
6119 continue;
6120 again:
6121 rec = bsearch(&key, pg->records, pg->index,
6122 sizeof(struct dyn_ftrace),
6123 ftrace_cmp_recs);
6124 if (!rec)
6125 continue;
6126
6127 /* rec will be cleared from hashes after ftrace_lock unlock */
6128 add_to_clear_hash_list(&clear_hash, rec);
6129
6130 if (mod_map)
6131 save_ftrace_mod_rec(mod_map, rec);
6132
6133 pg->index--;
6134 ftrace_update_tot_cnt--;
6135 if (!pg->index) {
6136 *last_pg = pg->next;
6137 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
6138 free_pages((unsigned long)pg->records, order);
6139 kfree(pg);
6140 pg = container_of(last_pg, struct ftrace_page, next);
6141 if (!(*last_pg))
6142 ftrace_pages = pg;
6143 continue;
6144 }
6145 memmove(rec, rec + 1,
6146 (pg->index - (rec - pg->records)) * sizeof(*rec));
6147 /* More than one function may be in this block */
6148 goto again;
6149 }
6150 mutex_unlock(&ftrace_lock);
6151
6152 list_for_each_entry_safe(func, func_next, &clear_hash, list) {
6153 clear_func_from_hashes(func);
6154 kfree(func);
6155 }
6156}
6157
6158void __init ftrace_free_init_mem(void)
6159{
6160 void *start = (void *)(&__init_begin);
6161 void *end = (void *)(&__init_end);
6162
6163 ftrace_free_mem(NULL, start, end);
6164}
6165
6166void __init ftrace_init(void)
6167{
6168 extern unsigned long __start_mcount_loc[];
6169 extern unsigned long __stop_mcount_loc[];
6170 unsigned long count, flags;
6171 int ret;
6172
6173 local_irq_save(flags);
6174 ret = ftrace_dyn_arch_init();
6175 local_irq_restore(flags);
6176 if (ret)
6177 goto failed;
6178
6179 count = __stop_mcount_loc - __start_mcount_loc;
6180 if (!count) {
6181 pr_info("ftrace: No functions to be traced?\n");
6182 goto failed;
6183 }
6184
6185 pr_info("ftrace: allocating %ld entries in %ld pages\n",
6186 count, count / ENTRIES_PER_PAGE + 1);
6187
6188 last_ftrace_enabled = ftrace_enabled = 1;
6189
6190 ret = ftrace_process_locs(NULL,
6191 __start_mcount_loc,
6192 __stop_mcount_loc);
6193
6194 set_ftrace_early_filters();
6195
6196 return;
6197 failed:
6198 ftrace_disabled = 1;
6199}
6200
6201/* Do nothing if arch does not support this */
6202void __weak arch_ftrace_update_trampoline(struct ftrace_ops *ops)
6203{
6204}
6205
6206static void ftrace_update_trampoline(struct ftrace_ops *ops)
6207{
6208 arch_ftrace_update_trampoline(ops);
6209}
6210
6211void ftrace_init_trace_array(struct trace_array *tr)
6212{
6213 INIT_LIST_HEAD(&tr->func_probes);
6214 INIT_LIST_HEAD(&tr->mod_trace);
6215 INIT_LIST_HEAD(&tr->mod_notrace);
6216}
6217#else
6218
6219static struct ftrace_ops global_ops = {
6220 .func = ftrace_stub,
6221 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
6222 FTRACE_OPS_FL_INITIALIZED |
6223 FTRACE_OPS_FL_PID,
6224};
6225
6226static int __init ftrace_nodyn_init(void)
6227{
6228 ftrace_enabled = 1;
6229 return 0;
6230}
6231core_initcall(ftrace_nodyn_init);
6232
6233static inline int ftrace_init_dyn_tracefs(struct dentry *d_tracer) { return 0; }
6234static inline void ftrace_startup_enable(int command) { }
6235static inline void ftrace_startup_all(int command) { }
6236/* Keep as macros so we do not need to define the commands */
6237# define ftrace_startup(ops, command) \
6238 ({ \
6239 int ___ret = __register_ftrace_function(ops); \
6240 if (!___ret) \
6241 (ops)->flags |= FTRACE_OPS_FL_ENABLED; \
6242 ___ret; \
6243 })
6244# define ftrace_shutdown(ops, command) \
6245 ({ \
6246 int ___ret = __unregister_ftrace_function(ops); \
6247 if (!___ret) \
6248 (ops)->flags &= ~FTRACE_OPS_FL_ENABLED; \
6249 ___ret; \
6250 })
6251
6252# define ftrace_startup_sysctl() do { } while (0)
6253# define ftrace_shutdown_sysctl() do { } while (0)
6254
6255static inline int
6256ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
6257{
6258 return 1;
6259}
6260
6261static void ftrace_update_trampoline(struct ftrace_ops *ops)
6262{
6263}
6264
6265#endif /* CONFIG_DYNAMIC_FTRACE */
6266
6267__init void ftrace_init_global_array_ops(struct trace_array *tr)
6268{
6269 tr->ops = &global_ops;
6270 tr->ops->private = tr;
6271 ftrace_init_trace_array(tr);
6272}
6273
6274void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
6275{
6276 /* If we filter on pids, update to use the pid function */
6277 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
6278 if (WARN_ON(tr->ops->func != ftrace_stub))
6279 printk("ftrace ops had %pS for function\n",
6280 tr->ops->func);
6281 }
6282 tr->ops->func = func;
6283 tr->ops->private = tr;
6284}
6285
6286void ftrace_reset_array_ops(struct trace_array *tr)
6287{
6288 tr->ops->func = ftrace_stub;
6289}
6290
6291static inline void
6292__ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
6293 struct ftrace_ops *ignored, struct pt_regs *regs)
6294{
6295 struct ftrace_ops *op;
6296 int bit;
6297
6298 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
6299 if (bit < 0)
6300 return;
6301
6302 /*
6303 * Some of the ops may be dynamically allocated,
6304 * they must be freed after a synchronize_sched().
6305 */
6306 preempt_disable_notrace();
6307
6308 do_for_each_ftrace_op(op, ftrace_ops_list) {
6309 /*
6310 * Check the following for each ops before calling their func:
6311 * if RCU flag is set, then rcu_is_watching() must be true
6312 * if PER_CPU is set, then ftrace_function_local_disable()
6313 * must be false
6314 * Otherwise test if the ip matches the ops filter
6315 *
6316 * If any of the above fails then the op->func() is not executed.
6317 */
6318 if ((!(op->flags & FTRACE_OPS_FL_RCU) || rcu_is_watching()) &&
6319 ftrace_ops_test(op, ip, regs)) {
6320 if (FTRACE_WARN_ON(!op->func)) {
6321 pr_warn("op=%p %pS\n", op, op);
6322 goto out;
6323 }
6324 op->func(ip, parent_ip, op, regs);
6325 }
6326 } while_for_each_ftrace_op(op);
6327out:
6328 preempt_enable_notrace();
6329 trace_clear_recursion(bit);
6330}
6331
6332/*
6333 * Some archs only support passing ip and parent_ip. Even though
6334 * the list function ignores the op parameter, we do not want any
6335 * C side effects, where a function is called without the caller
6336 * sending a third parameter.
6337 * Archs are to support both the regs and ftrace_ops at the same time.
6338 * If they support ftrace_ops, it is assumed they support regs.
6339 * If call backs want to use regs, they must either check for regs
6340 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
6341 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
6342 * An architecture can pass partial regs with ftrace_ops and still
6343 * set the ARCH_SUPPORTS_FTRACE_OPS.
6344 */
6345#if ARCH_SUPPORTS_FTRACE_OPS
6346static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
6347 struct ftrace_ops *op, struct pt_regs *regs)
6348{
6349 __ftrace_ops_list_func(ip, parent_ip, NULL, regs);
6350}
6351#else
6352static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip)
6353{
6354 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
6355}
6356#endif
6357
6358/*
6359 * If there's only one function registered but it does not support
6360 * recursion, needs RCU protection and/or requires per cpu handling, then
6361 * this function will be called by the mcount trampoline.
6362 */
6363static void ftrace_ops_assist_func(unsigned long ip, unsigned long parent_ip,
6364 struct ftrace_ops *op, struct pt_regs *regs)
6365{
6366 int bit;
6367
6368 if ((op->flags & FTRACE_OPS_FL_RCU) && !rcu_is_watching())
6369 return;
6370
6371 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
6372 if (bit < 0)
6373 return;
6374
6375 preempt_disable_notrace();
6376
6377 op->func(ip, parent_ip, op, regs);
6378
6379 preempt_enable_notrace();
6380 trace_clear_recursion(bit);
6381}
6382
6383/**
6384 * ftrace_ops_get_func - get the function a trampoline should call
6385 * @ops: the ops to get the function for
6386 *
6387 * Normally the mcount trampoline will call the ops->func, but there
6388 * are times that it should not. For example, if the ops does not
6389 * have its own recursion protection, then it should call the
6390 * ftrace_ops_assist_func() instead.
6391 *
6392 * Returns the function that the trampoline should call for @ops.
6393 */
6394ftrace_func_t ftrace_ops_get_func(struct ftrace_ops *ops)
6395{
6396 /*
6397 * If the function does not handle recursion, needs to be RCU safe,
6398 * or does per cpu logic, then we need to call the assist handler.
6399 */
6400 if (!(ops->flags & FTRACE_OPS_FL_RECURSION_SAFE) ||
6401 ops->flags & FTRACE_OPS_FL_RCU)
6402 return ftrace_ops_assist_func;
6403
6404 return ops->func;
6405}
6406
6407static void
6408ftrace_filter_pid_sched_switch_probe(void *data, bool preempt,
6409 struct task_struct *prev, struct task_struct *next)
6410{
6411 struct trace_array *tr = data;
6412 struct trace_pid_list *pid_list;
6413
6414 pid_list = rcu_dereference_sched(tr->function_pids);
6415
6416 this_cpu_write(tr->trace_buffer.data->ftrace_ignore_pid,
6417 trace_ignore_this_task(pid_list, next));
6418}
6419
6420static void
6421ftrace_pid_follow_sched_process_fork(void *data,
6422 struct task_struct *self,
6423 struct task_struct *task)
6424{
6425 struct trace_pid_list *pid_list;
6426 struct trace_array *tr = data;
6427
6428 pid_list = rcu_dereference_sched(tr->function_pids);
6429 trace_filter_add_remove_task(pid_list, self, task);
6430}
6431
6432static void
6433ftrace_pid_follow_sched_process_exit(void *data, struct task_struct *task)
6434{
6435 struct trace_pid_list *pid_list;
6436 struct trace_array *tr = data;
6437
6438 pid_list = rcu_dereference_sched(tr->function_pids);
6439 trace_filter_add_remove_task(pid_list, NULL, task);
6440}
6441
6442void ftrace_pid_follow_fork(struct trace_array *tr, bool enable)
6443{
6444 if (enable) {
6445 register_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
6446 tr);
6447 register_trace_sched_process_exit(ftrace_pid_follow_sched_process_exit,
6448 tr);
6449 } else {
6450 unregister_trace_sched_process_fork(ftrace_pid_follow_sched_process_fork,
6451 tr);
6452 unregister_trace_sched_process_exit(ftrace_pid_follow_sched_process_exit,
6453 tr);
6454 }
6455}
6456
6457static void clear_ftrace_pids(struct trace_array *tr)
6458{
6459 struct trace_pid_list *pid_list;
6460 int cpu;
6461
6462 pid_list = rcu_dereference_protected(tr->function_pids,
6463 lockdep_is_held(&ftrace_lock));
6464 if (!pid_list)
6465 return;
6466
6467 unregister_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
6468
6469 for_each_possible_cpu(cpu)
6470 per_cpu_ptr(tr->trace_buffer.data, cpu)->ftrace_ignore_pid = false;
6471
6472 rcu_assign_pointer(tr->function_pids, NULL);
6473
6474 /* Wait till all users are no longer using pid filtering */
6475 synchronize_sched();
6476
6477 trace_free_pid_list(pid_list);
6478}
6479
6480void ftrace_clear_pids(struct trace_array *tr)
6481{
6482 mutex_lock(&ftrace_lock);
6483
6484 clear_ftrace_pids(tr);
6485
6486 mutex_unlock(&ftrace_lock);
6487}
6488
6489static void ftrace_pid_reset(struct trace_array *tr)
6490{
6491 mutex_lock(&ftrace_lock);
6492 clear_ftrace_pids(tr);
6493
6494 ftrace_update_pid_func();
6495 ftrace_startup_all(0);
6496
6497 mutex_unlock(&ftrace_lock);
6498}
6499
6500/* Greater than any max PID */
6501#define FTRACE_NO_PIDS (void *)(PID_MAX_LIMIT + 1)
6502
6503static void *fpid_start(struct seq_file *m, loff_t *pos)
6504 __acquires(RCU)
6505{
6506 struct trace_pid_list *pid_list;
6507 struct trace_array *tr = m->private;
6508
6509 mutex_lock(&ftrace_lock);
6510 rcu_read_lock_sched();
6511
6512 pid_list = rcu_dereference_sched(tr->function_pids);
6513
6514 if (!pid_list)
6515 return !(*pos) ? FTRACE_NO_PIDS : NULL;
6516
6517 return trace_pid_start(pid_list, pos);
6518}
6519
6520static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
6521{
6522 struct trace_array *tr = m->private;
6523 struct trace_pid_list *pid_list = rcu_dereference_sched(tr->function_pids);
6524
6525 if (v == FTRACE_NO_PIDS)
6526 return NULL;
6527
6528 return trace_pid_next(pid_list, v, pos);
6529}
6530
6531static void fpid_stop(struct seq_file *m, void *p)
6532 __releases(RCU)
6533{
6534 rcu_read_unlock_sched();
6535 mutex_unlock(&ftrace_lock);
6536}
6537
6538static int fpid_show(struct seq_file *m, void *v)
6539{
6540 if (v == FTRACE_NO_PIDS) {
6541 seq_puts(m, "no pid\n");
6542 return 0;
6543 }
6544
6545 return trace_pid_show(m, v);
6546}
6547
6548static const struct seq_operations ftrace_pid_sops = {
6549 .start = fpid_start,
6550 .next = fpid_next,
6551 .stop = fpid_stop,
6552 .show = fpid_show,
6553};
6554
6555static int
6556ftrace_pid_open(struct inode *inode, struct file *file)
6557{
6558 struct trace_array *tr = inode->i_private;
6559 struct seq_file *m;
6560 int ret = 0;
6561
6562 if (trace_array_get(tr) < 0)
6563 return -ENODEV;
6564
6565 if ((file->f_mode & FMODE_WRITE) &&
6566 (file->f_flags & O_TRUNC))
6567 ftrace_pid_reset(tr);
6568
6569 ret = seq_open(file, &ftrace_pid_sops);
6570 if (ret < 0) {
6571 trace_array_put(tr);
6572 } else {
6573 m = file->private_data;
6574 /* copy tr over to seq ops */
6575 m->private = tr;
6576 }
6577
6578 return ret;
6579}
6580
6581static void ignore_task_cpu(void *data)
6582{
6583 struct trace_array *tr = data;
6584 struct trace_pid_list *pid_list;
6585
6586 /*
6587 * This function is called by on_each_cpu() while the
6588 * event_mutex is held.
6589 */
6590 pid_list = rcu_dereference_protected(tr->function_pids,
6591 mutex_is_locked(&ftrace_lock));
6592
6593 this_cpu_write(tr->trace_buffer.data->ftrace_ignore_pid,
6594 trace_ignore_this_task(pid_list, current));
6595}
6596
6597static ssize_t
6598ftrace_pid_write(struct file *filp, const char __user *ubuf,
6599 size_t cnt, loff_t *ppos)
6600{
6601 struct seq_file *m = filp->private_data;
6602 struct trace_array *tr = m->private;
6603 struct trace_pid_list *filtered_pids = NULL;
6604 struct trace_pid_list *pid_list;
6605 ssize_t ret;
6606
6607 if (!cnt)
6608 return 0;
6609
6610 mutex_lock(&ftrace_lock);
6611
6612 filtered_pids = rcu_dereference_protected(tr->function_pids,
6613 lockdep_is_held(&ftrace_lock));
6614
6615 ret = trace_pid_write(filtered_pids, &pid_list, ubuf, cnt);
6616 if (ret < 0)
6617 goto out;
6618
6619 rcu_assign_pointer(tr->function_pids, pid_list);
6620
6621 if (filtered_pids) {
6622 synchronize_sched();
6623 trace_free_pid_list(filtered_pids);
6624 } else if (pid_list) {
6625 /* Register a probe to set whether to ignore the tracing of a task */
6626 register_trace_sched_switch(ftrace_filter_pid_sched_switch_probe, tr);
6627 }
6628
6629 /*
6630 * Ignoring of pids is done at task switch. But we have to
6631 * check for those tasks that are currently running.
6632 * Always do this in case a pid was appended or removed.
6633 */
6634 on_each_cpu(ignore_task_cpu, tr, 1);
6635
6636 ftrace_update_pid_func();
6637 ftrace_startup_all(0);
6638 out:
6639 mutex_unlock(&ftrace_lock);
6640
6641 if (ret > 0)
6642 *ppos += ret;
6643
6644 return ret;
6645}
6646
6647static int
6648ftrace_pid_release(struct inode *inode, struct file *file)
6649{
6650 struct trace_array *tr = inode->i_private;
6651
6652 trace_array_put(tr);
6653
6654 return seq_release(inode, file);
6655}
6656
6657static const struct file_operations ftrace_pid_fops = {
6658 .open = ftrace_pid_open,
6659 .write = ftrace_pid_write,
6660 .read = seq_read,
6661 .llseek = tracing_lseek,
6662 .release = ftrace_pid_release,
6663};
6664
6665void ftrace_init_tracefs(struct trace_array *tr, struct dentry *d_tracer)
6666{
6667 trace_create_file("set_ftrace_pid", 0644, d_tracer,
6668 tr, &ftrace_pid_fops);
6669}
6670
6671void __init ftrace_init_tracefs_toplevel(struct trace_array *tr,
6672 struct dentry *d_tracer)
6673{
6674 /* Only the top level directory has the dyn_tracefs and profile */
6675 WARN_ON(!(tr->flags & TRACE_ARRAY_FL_GLOBAL));
6676
6677 ftrace_init_dyn_tracefs(d_tracer);
6678 ftrace_profile_tracefs(d_tracer);
6679}
6680
6681/**
6682 * ftrace_kill - kill ftrace
6683 *
6684 * This function should be used by panic code. It stops ftrace
6685 * but in a not so nice way. If you need to simply kill ftrace
6686 * from a non-atomic section, use ftrace_kill.
6687 */
6688void ftrace_kill(void)
6689{
6690 ftrace_disabled = 1;
6691 ftrace_enabled = 0;
6692 clear_ftrace_function();
6693}
6694
6695/**
6696 * Test if ftrace is dead or not.
6697 */
6698int ftrace_is_dead(void)
6699{
6700 return ftrace_disabled;
6701}
6702
6703/**
6704 * register_ftrace_function - register a function for profiling
6705 * @ops - ops structure that holds the function for profiling.
6706 *
6707 * Register a function to be called by all functions in the
6708 * kernel.
6709 *
6710 * Note: @ops->func and all the functions it calls must be labeled
6711 * with "notrace", otherwise it will go into a
6712 * recursive loop.
6713 */
6714int register_ftrace_function(struct ftrace_ops *ops)
6715{
6716 int ret = -1;
6717
6718 ftrace_ops_init(ops);
6719
6720 mutex_lock(&ftrace_lock);
6721
6722 ret = ftrace_startup(ops, 0);
6723
6724 mutex_unlock(&ftrace_lock);
6725
6726 return ret;
6727}
6728EXPORT_SYMBOL_GPL(register_ftrace_function);
6729
6730/**
6731 * unregister_ftrace_function - unregister a function for profiling.
6732 * @ops - ops structure that holds the function to unregister
6733 *
6734 * Unregister a function that was added to be called by ftrace profiling.
6735 */
6736int unregister_ftrace_function(struct ftrace_ops *ops)
6737{
6738 int ret;
6739
6740 mutex_lock(&ftrace_lock);
6741 ret = ftrace_shutdown(ops, 0);
6742 mutex_unlock(&ftrace_lock);
6743
6744 return ret;
6745}
6746EXPORT_SYMBOL_GPL(unregister_ftrace_function);
6747
6748int
6749ftrace_enable_sysctl(struct ctl_table *table, int write,
6750 void __user *buffer, size_t *lenp,
6751 loff_t *ppos)
6752{
6753 int ret = -ENODEV;
6754
6755 mutex_lock(&ftrace_lock);
6756
6757 if (unlikely(ftrace_disabled))
6758 goto out;
6759
6760 ret = proc_dointvec(table, write, buffer, lenp, ppos);
6761
6762 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
6763 goto out;
6764
6765 last_ftrace_enabled = !!ftrace_enabled;
6766
6767 if (ftrace_enabled) {
6768
6769 /* we are starting ftrace again */
6770 if (rcu_dereference_protected(ftrace_ops_list,
6771 lockdep_is_held(&ftrace_lock)) != &ftrace_list_end)
6772 update_ftrace_function();
6773
6774 ftrace_startup_sysctl();
6775
6776 } else {
6777 /* stopping ftrace calls (just send to ftrace_stub) */
6778 ftrace_trace_function = ftrace_stub;
6779
6780 ftrace_shutdown_sysctl();
6781 }
6782
6783 out:
6784 mutex_unlock(&ftrace_lock);
6785 return ret;
6786}
6787
6788#ifdef CONFIG_FUNCTION_GRAPH_TRACER
6789
6790static struct ftrace_ops graph_ops = {
6791 .func = ftrace_stub,
6792 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
6793 FTRACE_OPS_FL_INITIALIZED |
6794 FTRACE_OPS_FL_PID |
6795 FTRACE_OPS_FL_STUB,
6796#ifdef FTRACE_GRAPH_TRAMP_ADDR
6797 .trampoline = FTRACE_GRAPH_TRAMP_ADDR,
6798 /* trampoline_size is only needed for dynamically allocated tramps */
6799#endif
6800 ASSIGN_OPS_HASH(graph_ops, &global_ops.local_hash)
6801};
6802
6803void ftrace_graph_sleep_time_control(bool enable)
6804{
6805 fgraph_sleep_time = enable;
6806}
6807
6808void ftrace_graph_graph_time_control(bool enable)
6809{
6810 fgraph_graph_time = enable;
6811}
6812
6813int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
6814{
6815 return 0;
6816}
6817
6818/* The callbacks that hook a function */
6819trace_func_graph_ret_t ftrace_graph_return =
6820 (trace_func_graph_ret_t)ftrace_stub;
6821trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
6822static trace_func_graph_ent_t __ftrace_graph_entry = ftrace_graph_entry_stub;
6823
6824/* Try to assign a return stack array on FTRACE_RETSTACK_ALLOC_SIZE tasks. */
6825static int alloc_retstack_tasklist(struct ftrace_ret_stack **ret_stack_list)
6826{
6827 int i;
6828 int ret = 0;
6829 int start = 0, end = FTRACE_RETSTACK_ALLOC_SIZE;
6830 struct task_struct *g, *t;
6831
6832 for (i = 0; i < FTRACE_RETSTACK_ALLOC_SIZE; i++) {
6833 ret_stack_list[i] = kmalloc(FTRACE_RETFUNC_DEPTH
6834 * sizeof(struct ftrace_ret_stack),
6835 GFP_KERNEL);
6836 if (!ret_stack_list[i]) {
6837 start = 0;
6838 end = i;
6839 ret = -ENOMEM;
6840 goto free;
6841 }
6842 }
6843
6844 read_lock(&tasklist_lock);
6845 do_each_thread(g, t) {
6846 if (start == end) {
6847 ret = -EAGAIN;
6848 goto unlock;
6849 }
6850
6851 if (t->ret_stack == NULL) {
6852 atomic_set(&t->tracing_graph_pause, 0);
6853 atomic_set(&t->trace_overrun, 0);
6854 t->curr_ret_stack = -1;
6855 /* Make sure the tasks see the -1 first: */
6856 smp_wmb();
6857 t->ret_stack = ret_stack_list[start++];
6858 }
6859 } while_each_thread(g, t);
6860
6861unlock:
6862 read_unlock(&tasklist_lock);
6863free:
6864 for (i = start; i < end; i++)
6865 kfree(ret_stack_list[i]);
6866 return ret;
6867}
6868
6869static void
6870ftrace_graph_probe_sched_switch(void *ignore, bool preempt,
6871 struct task_struct *prev, struct task_struct *next)
6872{
6873 unsigned long long timestamp;
6874 int index;
6875
6876 /*
6877 * Does the user want to count the time a function was asleep.
6878 * If so, do not update the time stamps.
6879 */
6880 if (fgraph_sleep_time)
6881 return;
6882
6883 timestamp = trace_clock_local();
6884
6885 prev->ftrace_timestamp = timestamp;
6886
6887 /* only process tasks that we timestamped */
6888 if (!next->ftrace_timestamp)
6889 return;
6890
6891 /*
6892 * Update all the counters in next to make up for the
6893 * time next was sleeping.
6894 */
6895 timestamp -= next->ftrace_timestamp;
6896
6897 for (index = next->curr_ret_stack; index >= 0; index--)
6898 next->ret_stack[index].calltime += timestamp;
6899}
6900
6901/* Allocate a return stack for each task */
6902static int start_graph_tracing(void)
6903{
6904 struct ftrace_ret_stack **ret_stack_list;
6905 int ret, cpu;
6906
6907 ret_stack_list = kmalloc(FTRACE_RETSTACK_ALLOC_SIZE *
6908 sizeof(struct ftrace_ret_stack *),
6909 GFP_KERNEL);
6910
6911 if (!ret_stack_list)
6912 return -ENOMEM;
6913
6914 /* The cpu_boot init_task->ret_stack will never be freed */
6915 for_each_online_cpu(cpu) {
6916 if (!idle_task(cpu)->ret_stack)
6917 ftrace_graph_init_idle_task(idle_task(cpu), cpu);
6918 }
6919
6920 do {
6921 ret = alloc_retstack_tasklist(ret_stack_list);
6922 } while (ret == -EAGAIN);
6923
6924 if (!ret) {
6925 ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
6926 if (ret)
6927 pr_info("ftrace_graph: Couldn't activate tracepoint"
6928 " probe to kernel_sched_switch\n");
6929 }
6930
6931 kfree(ret_stack_list);
6932 return ret;
6933}
6934
6935/*
6936 * Hibernation protection.
6937 * The state of the current task is too much unstable during
6938 * suspend/restore to disk. We want to protect against that.
6939 */
6940static int
6941ftrace_suspend_notifier_call(struct notifier_block *bl, unsigned long state,
6942 void *unused)
6943{
6944 switch (state) {
6945 case PM_HIBERNATION_PREPARE:
6946 pause_graph_tracing();
6947 break;
6948
6949 case PM_POST_HIBERNATION:
6950 unpause_graph_tracing();
6951 break;
6952 }
6953 return NOTIFY_DONE;
6954}
6955
6956static int ftrace_graph_entry_test(struct ftrace_graph_ent *trace)
6957{
6958 if (!ftrace_ops_test(&global_ops, trace->func, NULL))
6959 return 0;
6960 return __ftrace_graph_entry(trace);
6961}
6962
6963/*
6964 * The function graph tracer should only trace the functions defined
6965 * by set_ftrace_filter and set_ftrace_notrace. If another function
6966 * tracer ops is registered, the graph tracer requires testing the
6967 * function against the global ops, and not just trace any function
6968 * that any ftrace_ops registered.
6969 */
6970static void update_function_graph_func(void)
6971{
6972 struct ftrace_ops *op;
6973 bool do_test = false;
6974
6975 /*
6976 * The graph and global ops share the same set of functions
6977 * to test. If any other ops is on the list, then
6978 * the graph tracing needs to test if its the function
6979 * it should call.
6980 */
6981 do_for_each_ftrace_op(op, ftrace_ops_list) {
6982 if (op != &global_ops && op != &graph_ops &&
6983 op != &ftrace_list_end) {
6984 do_test = true;
6985 /* in double loop, break out with goto */
6986 goto out;
6987 }
6988 } while_for_each_ftrace_op(op);
6989 out:
6990 if (do_test)
6991 ftrace_graph_entry = ftrace_graph_entry_test;
6992 else
6993 ftrace_graph_entry = __ftrace_graph_entry;
6994}
6995
6996static struct notifier_block ftrace_suspend_notifier = {
6997 .notifier_call = ftrace_suspend_notifier_call,
6998};
6999
7000int register_ftrace_graph(trace_func_graph_ret_t retfunc,
7001 trace_func_graph_ent_t entryfunc)
7002{
7003 int ret = 0;
7004
7005 mutex_lock(&ftrace_lock);
7006
7007 /* we currently allow only one tracer registered at a time */
7008 if (ftrace_graph_active) {
7009 ret = -EBUSY;
7010 goto out;
7011 }
7012
7013 register_pm_notifier(&ftrace_suspend_notifier);
7014
7015 ftrace_graph_active++;
7016 ret = start_graph_tracing();
7017 if (ret) {
7018 ftrace_graph_active--;
7019 goto out;
7020 }
7021
7022 ftrace_graph_return = retfunc;
7023
7024 /*
7025 * Update the indirect function to the entryfunc, and the
7026 * function that gets called to the entry_test first. Then
7027 * call the update fgraph entry function to determine if
7028 * the entryfunc should be called directly or not.
7029 */
7030 __ftrace_graph_entry = entryfunc;
7031 ftrace_graph_entry = ftrace_graph_entry_test;
7032 update_function_graph_func();
7033
7034 ret = ftrace_startup(&graph_ops, FTRACE_START_FUNC_RET);
7035out:
7036 mutex_unlock(&ftrace_lock);
7037 return ret;
7038}
7039
7040void unregister_ftrace_graph(void)
7041{
7042 mutex_lock(&ftrace_lock);
7043
7044 if (unlikely(!ftrace_graph_active))
7045 goto out;
7046
7047 ftrace_graph_active--;
7048 ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
7049 ftrace_graph_entry = ftrace_graph_entry_stub;
7050 __ftrace_graph_entry = ftrace_graph_entry_stub;
7051 ftrace_shutdown(&graph_ops, FTRACE_STOP_FUNC_RET);
7052 unregister_pm_notifier(&ftrace_suspend_notifier);
7053 unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
7054
7055 out:
7056 mutex_unlock(&ftrace_lock);
7057}
7058
7059static DEFINE_PER_CPU(struct ftrace_ret_stack *, idle_ret_stack);
7060
7061static void
7062graph_init_task(struct task_struct *t, struct ftrace_ret_stack *ret_stack)
7063{
7064 atomic_set(&t->tracing_graph_pause, 0);
7065 atomic_set(&t->trace_overrun, 0);
7066 t->ftrace_timestamp = 0;
7067 /* make curr_ret_stack visible before we add the ret_stack */
7068 smp_wmb();
7069 t->ret_stack = ret_stack;
7070}
7071
7072/*
7073 * Allocate a return stack for the idle task. May be the first
7074 * time through, or it may be done by CPU hotplug online.
7075 */
7076void ftrace_graph_init_idle_task(struct task_struct *t, int cpu)
7077{
7078 t->curr_ret_stack = -1;
7079 /*
7080 * The idle task has no parent, it either has its own
7081 * stack or no stack at all.
7082 */
7083 if (t->ret_stack)
7084 WARN_ON(t->ret_stack != per_cpu(idle_ret_stack, cpu));
7085
7086 if (ftrace_graph_active) {
7087 struct ftrace_ret_stack *ret_stack;
7088
7089 ret_stack = per_cpu(idle_ret_stack, cpu);
7090 if (!ret_stack) {
7091 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
7092 * sizeof(struct ftrace_ret_stack),
7093 GFP_KERNEL);
7094 if (!ret_stack)
7095 return;
7096 per_cpu(idle_ret_stack, cpu) = ret_stack;
7097 }
7098 graph_init_task(t, ret_stack);
7099 }
7100}
7101
7102/* Allocate a return stack for newly created task */
7103void ftrace_graph_init_task(struct task_struct *t)
7104{
7105 /* Make sure we do not use the parent ret_stack */
7106 t->ret_stack = NULL;
7107 t->curr_ret_stack = -1;
7108
7109 if (ftrace_graph_active) {
7110 struct ftrace_ret_stack *ret_stack;
7111
7112 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
7113 * sizeof(struct ftrace_ret_stack),
7114 GFP_KERNEL);
7115 if (!ret_stack)
7116 return;
7117 graph_init_task(t, ret_stack);
7118 }
7119}
7120
7121void ftrace_graph_exit_task(struct task_struct *t)
7122{
7123 struct ftrace_ret_stack *ret_stack = t->ret_stack;
7124
7125 t->ret_stack = NULL;
7126 /* NULL must become visible to IRQs before we free it: */
7127 barrier();
7128
7129 kfree(ret_stack);
7130}
7131#endif