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