]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - kernel/trace/ftrace.c
Merge branch 'stable/for-jens-4.7' of git://git.kernel.org/pub/scm/linux/kernel/git...
[mirror_ubuntu-artful-kernel.git] / kernel / trace / ftrace.c
1 /*
2 * Infrastructure for profiling code inserted by 'gcc -pg'.
3 *
4 * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
5 * Copyright (C) 2004-2008 Ingo Molnar <mingo@redhat.com>
6 *
7 * Originally ported from the -rt patch by:
8 * Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
9 *
10 * Based on code in the latency_tracer, that is:
11 *
12 * Copyright (C) 2004-2006 Ingo Molnar
13 * Copyright (C) 2004 Nadia Yvette Chambers
14 */
15
16 #include <linux/stop_machine.h>
17 #include <linux/clocksource.h>
18 #include <linux/kallsyms.h>
19 #include <linux/seq_file.h>
20 #include <linux/suspend.h>
21 #include <linux/tracefs.h>
22 #include <linux/hardirq.h>
23 #include <linux/kthread.h>
24 #include <linux/uaccess.h>
25 #include <linux/bsearch.h>
26 #include <linux/module.h>
27 #include <linux/ftrace.h>
28 #include <linux/sysctl.h>
29 #include <linux/slab.h>
30 #include <linux/ctype.h>
31 #include <linux/sort.h>
32 #include <linux/list.h>
33 #include <linux/hash.h>
34 #include <linux/rcupdate.h>
35
36 #include <trace/events/sched.h>
37
38 #include <asm/setup.h>
39
40 #include "trace_output.h"
41 #include "trace_stat.h"
42
43 #define FTRACE_WARN_ON(cond) \
44 ({ \
45 int ___r = cond; \
46 if (WARN_ON(___r)) \
47 ftrace_kill(); \
48 ___r; \
49 })
50
51 #define FTRACE_WARN_ON_ONCE(cond) \
52 ({ \
53 int ___r = cond; \
54 if (WARN_ON_ONCE(___r)) \
55 ftrace_kill(); \
56 ___r; \
57 })
58
59 /* hash bits for specific function selection */
60 #define FTRACE_HASH_BITS 7
61 #define FTRACE_FUNC_HASHSIZE (1 << FTRACE_HASH_BITS)
62 #define FTRACE_HASH_DEFAULT_BITS 10
63 #define FTRACE_HASH_MAX_BITS 12
64
65 #ifdef CONFIG_DYNAMIC_FTRACE
66 #define INIT_OPS_HASH(opsname) \
67 .func_hash = &opsname.local_hash, \
68 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
69 #define ASSIGN_OPS_HASH(opsname, val) \
70 .func_hash = val, \
71 .local_hash.regex_lock = __MUTEX_INITIALIZER(opsname.local_hash.regex_lock),
72 #else
73 #define INIT_OPS_HASH(opsname)
74 #define ASSIGN_OPS_HASH(opsname, val)
75 #endif
76
77 static struct ftrace_ops ftrace_list_end __read_mostly = {
78 .func = ftrace_stub,
79 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_STUB,
80 INIT_OPS_HASH(ftrace_list_end)
81 };
82
83 /* ftrace_enabled is a method to turn ftrace on or off */
84 int ftrace_enabled __read_mostly;
85 static int last_ftrace_enabled;
86
87 /* Current function tracing op */
88 struct ftrace_ops *function_trace_op __read_mostly = &ftrace_list_end;
89 /* What to set function_trace_op to */
90 static struct ftrace_ops *set_function_trace_op;
91
92 /* List for set_ftrace_pid's pids. */
93 LIST_HEAD(ftrace_pids);
94 struct ftrace_pid {
95 struct list_head list;
96 struct pid *pid;
97 };
98
99 static bool ftrace_pids_enabled(void)
100 {
101 return !list_empty(&ftrace_pids);
102 }
103
104 static void ftrace_update_trampoline(struct ftrace_ops *ops);
105
106 /*
107 * ftrace_disabled is set when an anomaly is discovered.
108 * ftrace_disabled is much stronger than ftrace_enabled.
109 */
110 static int ftrace_disabled __read_mostly;
111
112 static DEFINE_MUTEX(ftrace_lock);
113
114 static struct ftrace_ops *ftrace_ops_list __read_mostly = &ftrace_list_end;
115 ftrace_func_t ftrace_trace_function __read_mostly = ftrace_stub;
116 static struct ftrace_ops global_ops;
117
118 #if ARCH_SUPPORTS_FTRACE_OPS
119 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
120 struct ftrace_ops *op, struct pt_regs *regs);
121 #else
122 /* See comment below, where ftrace_ops_list_func is defined */
123 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip);
124 #define ftrace_ops_list_func ((ftrace_func_t)ftrace_ops_no_ops)
125 #endif
126
127 /*
128 * Traverse the ftrace_global_list, invoking all entries. The reason that we
129 * can use rcu_dereference_raw_notrace() is that elements removed from this list
130 * are simply leaked, so there is no need to interact with a grace-period
131 * mechanism. The rcu_dereference_raw_notrace() calls are needed to handle
132 * concurrent insertions into the ftrace_global_list.
133 *
134 * Silly Alpha and silly pointer-speculation compiler optimizations!
135 */
136 #define do_for_each_ftrace_op(op, list) \
137 op = rcu_dereference_raw_notrace(list); \
138 do
139
140 /*
141 * Optimized for just a single item in the list (as that is the normal case).
142 */
143 #define while_for_each_ftrace_op(op) \
144 while (likely(op = rcu_dereference_raw_notrace((op)->next)) && \
145 unlikely((op) != &ftrace_list_end))
146
147 static inline void ftrace_ops_init(struct ftrace_ops *ops)
148 {
149 #ifdef CONFIG_DYNAMIC_FTRACE
150 if (!(ops->flags & FTRACE_OPS_FL_INITIALIZED)) {
151 mutex_init(&ops->local_hash.regex_lock);
152 ops->func_hash = &ops->local_hash;
153 ops->flags |= FTRACE_OPS_FL_INITIALIZED;
154 }
155 #endif
156 }
157
158 /**
159 * ftrace_nr_registered_ops - return number of ops registered
160 *
161 * Returns the number of ftrace_ops registered and tracing functions
162 */
163 int ftrace_nr_registered_ops(void)
164 {
165 struct ftrace_ops *ops;
166 int cnt = 0;
167
168 mutex_lock(&ftrace_lock);
169
170 for (ops = ftrace_ops_list;
171 ops != &ftrace_list_end; ops = ops->next)
172 cnt++;
173
174 mutex_unlock(&ftrace_lock);
175
176 return cnt;
177 }
178
179 static void ftrace_pid_func(unsigned long ip, unsigned long parent_ip,
180 struct ftrace_ops *op, struct pt_regs *regs)
181 {
182 if (!test_tsk_trace_trace(current))
183 return;
184
185 op->saved_func(ip, parent_ip, op, regs);
186 }
187
188 /**
189 * clear_ftrace_function - reset the ftrace function
190 *
191 * This NULLs the ftrace function and in essence stops
192 * tracing. There may be lag
193 */
194 void clear_ftrace_function(void)
195 {
196 ftrace_trace_function = ftrace_stub;
197 }
198
199 static void per_cpu_ops_disable_all(struct ftrace_ops *ops)
200 {
201 int cpu;
202
203 for_each_possible_cpu(cpu)
204 *per_cpu_ptr(ops->disabled, cpu) = 1;
205 }
206
207 static int per_cpu_ops_alloc(struct ftrace_ops *ops)
208 {
209 int __percpu *disabled;
210
211 if (WARN_ON_ONCE(!(ops->flags & FTRACE_OPS_FL_PER_CPU)))
212 return -EINVAL;
213
214 disabled = alloc_percpu(int);
215 if (!disabled)
216 return -ENOMEM;
217
218 ops->disabled = disabled;
219 per_cpu_ops_disable_all(ops);
220 return 0;
221 }
222
223 static void ftrace_sync(struct work_struct *work)
224 {
225 /*
226 * This function is just a stub to implement a hard force
227 * of synchronize_sched(). This requires synchronizing
228 * tasks even in userspace and idle.
229 *
230 * Yes, function tracing is rude.
231 */
232 }
233
234 static void ftrace_sync_ipi(void *data)
235 {
236 /* Probably not needed, but do it anyway */
237 smp_rmb();
238 }
239
240 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
241 static void update_function_graph_func(void);
242
243 /* Both enabled by default (can be cleared by function_graph tracer flags */
244 static bool fgraph_sleep_time = true;
245 static bool fgraph_graph_time = true;
246
247 #else
248 static inline void update_function_graph_func(void) { }
249 #endif
250
251
252 static ftrace_func_t ftrace_ops_get_list_func(struct ftrace_ops *ops)
253 {
254 /*
255 * If this is a dynamic, RCU, or per CPU ops, or we force list func,
256 * then it needs to call the list anyway.
257 */
258 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_PER_CPU |
259 FTRACE_OPS_FL_RCU) || FTRACE_FORCE_LIST_FUNC)
260 return ftrace_ops_list_func;
261
262 return ftrace_ops_get_func(ops);
263 }
264
265 static void update_ftrace_function(void)
266 {
267 ftrace_func_t func;
268
269 /*
270 * Prepare the ftrace_ops that the arch callback will use.
271 * If there's only one ftrace_ops registered, the ftrace_ops_list
272 * will point to the ops we want.
273 */
274 set_function_trace_op = ftrace_ops_list;
275
276 /* If there's no ftrace_ops registered, just call the stub function */
277 if (ftrace_ops_list == &ftrace_list_end) {
278 func = ftrace_stub;
279
280 /*
281 * If we are at the end of the list and this ops is
282 * recursion safe and not dynamic and the arch supports passing ops,
283 * then have the mcount trampoline call the function directly.
284 */
285 } else if (ftrace_ops_list->next == &ftrace_list_end) {
286 func = ftrace_ops_get_list_func(ftrace_ops_list);
287
288 } else {
289 /* Just use the default ftrace_ops */
290 set_function_trace_op = &ftrace_list_end;
291 func = ftrace_ops_list_func;
292 }
293
294 update_function_graph_func();
295
296 /* If there's no change, then do nothing more here */
297 if (ftrace_trace_function == func)
298 return;
299
300 /*
301 * If we are using the list function, it doesn't care
302 * about the function_trace_ops.
303 */
304 if (func == ftrace_ops_list_func) {
305 ftrace_trace_function = func;
306 /*
307 * Don't even bother setting function_trace_ops,
308 * it would be racy to do so anyway.
309 */
310 return;
311 }
312
313 #ifndef CONFIG_DYNAMIC_FTRACE
314 /*
315 * For static tracing, we need to be a bit more careful.
316 * The function change takes affect immediately. Thus,
317 * we need to coorditate the setting of the function_trace_ops
318 * with the setting of the ftrace_trace_function.
319 *
320 * Set the function to the list ops, which will call the
321 * function we want, albeit indirectly, but it handles the
322 * ftrace_ops and doesn't depend on function_trace_op.
323 */
324 ftrace_trace_function = ftrace_ops_list_func;
325 /*
326 * Make sure all CPUs see this. Yes this is slow, but static
327 * tracing is slow and nasty to have enabled.
328 */
329 schedule_on_each_cpu(ftrace_sync);
330 /* Now all cpus are using the list ops. */
331 function_trace_op = set_function_trace_op;
332 /* Make sure the function_trace_op is visible on all CPUs */
333 smp_wmb();
334 /* Nasty way to force a rmb on all cpus */
335 smp_call_function(ftrace_sync_ipi, NULL, 1);
336 /* OK, we are all set to update the ftrace_trace_function now! */
337 #endif /* !CONFIG_DYNAMIC_FTRACE */
338
339 ftrace_trace_function = func;
340 }
341
342 int using_ftrace_ops_list_func(void)
343 {
344 return ftrace_trace_function == ftrace_ops_list_func;
345 }
346
347 static void add_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
348 {
349 ops->next = *list;
350 /*
351 * We are entering ops into the list but another
352 * CPU might be walking that list. We need to make sure
353 * the ops->next pointer is valid before another CPU sees
354 * the ops pointer included into the list.
355 */
356 rcu_assign_pointer(*list, ops);
357 }
358
359 static int remove_ftrace_ops(struct ftrace_ops **list, struct ftrace_ops *ops)
360 {
361 struct ftrace_ops **p;
362
363 /*
364 * If we are removing the last function, then simply point
365 * to the ftrace_stub.
366 */
367 if (*list == ops && ops->next == &ftrace_list_end) {
368 *list = &ftrace_list_end;
369 return 0;
370 }
371
372 for (p = list; *p != &ftrace_list_end; p = &(*p)->next)
373 if (*p == ops)
374 break;
375
376 if (*p != ops)
377 return -1;
378
379 *p = (*p)->next;
380 return 0;
381 }
382
383 static void ftrace_update_trampoline(struct ftrace_ops *ops);
384
385 static int __register_ftrace_function(struct ftrace_ops *ops)
386 {
387 if (ops->flags & FTRACE_OPS_FL_DELETED)
388 return -EINVAL;
389
390 if (WARN_ON(ops->flags & FTRACE_OPS_FL_ENABLED))
391 return -EBUSY;
392
393 #ifndef CONFIG_DYNAMIC_FTRACE_WITH_REGS
394 /*
395 * If the ftrace_ops specifies SAVE_REGS, then it only can be used
396 * if the arch supports it, or SAVE_REGS_IF_SUPPORTED is also set.
397 * Setting SAVE_REGS_IF_SUPPORTED makes SAVE_REGS irrelevant.
398 */
399 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS &&
400 !(ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED))
401 return -EINVAL;
402
403 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS_IF_SUPPORTED)
404 ops->flags |= FTRACE_OPS_FL_SAVE_REGS;
405 #endif
406
407 if (!core_kernel_data((unsigned long)ops))
408 ops->flags |= FTRACE_OPS_FL_DYNAMIC;
409
410 if (ops->flags & FTRACE_OPS_FL_PER_CPU) {
411 if (per_cpu_ops_alloc(ops))
412 return -ENOMEM;
413 }
414
415 add_ftrace_ops(&ftrace_ops_list, ops);
416
417 /* Always save the function, and reset at unregistering */
418 ops->saved_func = ops->func;
419
420 if (ops->flags & FTRACE_OPS_FL_PID && ftrace_pids_enabled())
421 ops->func = ftrace_pid_func;
422
423 ftrace_update_trampoline(ops);
424
425 if (ftrace_enabled)
426 update_ftrace_function();
427
428 return 0;
429 }
430
431 static int __unregister_ftrace_function(struct ftrace_ops *ops)
432 {
433 int ret;
434
435 if (WARN_ON(!(ops->flags & FTRACE_OPS_FL_ENABLED)))
436 return -EBUSY;
437
438 ret = remove_ftrace_ops(&ftrace_ops_list, ops);
439
440 if (ret < 0)
441 return ret;
442
443 if (ftrace_enabled)
444 update_ftrace_function();
445
446 ops->func = ops->saved_func;
447
448 return 0;
449 }
450
451 static void ftrace_update_pid_func(void)
452 {
453 bool enabled = ftrace_pids_enabled();
454 struct ftrace_ops *op;
455
456 /* Only do something if we are tracing something */
457 if (ftrace_trace_function == ftrace_stub)
458 return;
459
460 do_for_each_ftrace_op(op, ftrace_ops_list) {
461 if (op->flags & FTRACE_OPS_FL_PID) {
462 op->func = enabled ? ftrace_pid_func :
463 op->saved_func;
464 ftrace_update_trampoline(op);
465 }
466 } while_for_each_ftrace_op(op);
467
468 update_ftrace_function();
469 }
470
471 #ifdef CONFIG_FUNCTION_PROFILER
472 struct ftrace_profile {
473 struct hlist_node node;
474 unsigned long ip;
475 unsigned long counter;
476 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
477 unsigned long long time;
478 unsigned long long time_squared;
479 #endif
480 };
481
482 struct ftrace_profile_page {
483 struct ftrace_profile_page *next;
484 unsigned long index;
485 struct ftrace_profile records[];
486 };
487
488 struct ftrace_profile_stat {
489 atomic_t disabled;
490 struct hlist_head *hash;
491 struct ftrace_profile_page *pages;
492 struct ftrace_profile_page *start;
493 struct tracer_stat stat;
494 };
495
496 #define PROFILE_RECORDS_SIZE \
497 (PAGE_SIZE - offsetof(struct ftrace_profile_page, records))
498
499 #define PROFILES_PER_PAGE \
500 (PROFILE_RECORDS_SIZE / sizeof(struct ftrace_profile))
501
502 static int ftrace_profile_enabled __read_mostly;
503
504 /* ftrace_profile_lock - synchronize the enable and disable of the profiler */
505 static DEFINE_MUTEX(ftrace_profile_lock);
506
507 static DEFINE_PER_CPU(struct ftrace_profile_stat, ftrace_profile_stats);
508
509 #define FTRACE_PROFILE_HASH_BITS 10
510 #define FTRACE_PROFILE_HASH_SIZE (1 << FTRACE_PROFILE_HASH_BITS)
511
512 static void *
513 function_stat_next(void *v, int idx)
514 {
515 struct ftrace_profile *rec = v;
516 struct ftrace_profile_page *pg;
517
518 pg = (struct ftrace_profile_page *)((unsigned long)rec & PAGE_MASK);
519
520 again:
521 if (idx != 0)
522 rec++;
523
524 if ((void *)rec >= (void *)&pg->records[pg->index]) {
525 pg = pg->next;
526 if (!pg)
527 return NULL;
528 rec = &pg->records[0];
529 if (!rec->counter)
530 goto again;
531 }
532
533 return rec;
534 }
535
536 static void *function_stat_start(struct tracer_stat *trace)
537 {
538 struct ftrace_profile_stat *stat =
539 container_of(trace, struct ftrace_profile_stat, stat);
540
541 if (!stat || !stat->start)
542 return NULL;
543
544 return function_stat_next(&stat->start->records[0], 0);
545 }
546
547 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
548 /* function graph compares on total time */
549 static int function_stat_cmp(void *p1, void *p2)
550 {
551 struct ftrace_profile *a = p1;
552 struct ftrace_profile *b = p2;
553
554 if (a->time < b->time)
555 return -1;
556 if (a->time > b->time)
557 return 1;
558 else
559 return 0;
560 }
561 #else
562 /* not function graph compares against hits */
563 static int function_stat_cmp(void *p1, void *p2)
564 {
565 struct ftrace_profile *a = p1;
566 struct ftrace_profile *b = p2;
567
568 if (a->counter < b->counter)
569 return -1;
570 if (a->counter > b->counter)
571 return 1;
572 else
573 return 0;
574 }
575 #endif
576
577 static int function_stat_headers(struct seq_file *m)
578 {
579 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
580 seq_puts(m, " Function "
581 "Hit Time Avg s^2\n"
582 " -------- "
583 "--- ---- --- ---\n");
584 #else
585 seq_puts(m, " Function Hit\n"
586 " -------- ---\n");
587 #endif
588 return 0;
589 }
590
591 static int function_stat_show(struct seq_file *m, void *v)
592 {
593 struct ftrace_profile *rec = v;
594 char str[KSYM_SYMBOL_LEN];
595 int ret = 0;
596 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
597 static struct trace_seq s;
598 unsigned long long avg;
599 unsigned long long stddev;
600 #endif
601 mutex_lock(&ftrace_profile_lock);
602
603 /* we raced with function_profile_reset() */
604 if (unlikely(rec->counter == 0)) {
605 ret = -EBUSY;
606 goto out;
607 }
608
609 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
610 avg = rec->time;
611 do_div(avg, rec->counter);
612 if (tracing_thresh && (avg < tracing_thresh))
613 goto out;
614 #endif
615
616 kallsyms_lookup(rec->ip, NULL, NULL, NULL, str);
617 seq_printf(m, " %-30.30s %10lu", str, rec->counter);
618
619 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
620 seq_puts(m, " ");
621
622 /* Sample standard deviation (s^2) */
623 if (rec->counter <= 1)
624 stddev = 0;
625 else {
626 /*
627 * Apply Welford's method:
628 * s^2 = 1 / (n * (n-1)) * (n * \Sum (x_i)^2 - (\Sum x_i)^2)
629 */
630 stddev = rec->counter * rec->time_squared -
631 rec->time * rec->time;
632
633 /*
634 * Divide only 1000 for ns^2 -> us^2 conversion.
635 * trace_print_graph_duration will divide 1000 again.
636 */
637 do_div(stddev, rec->counter * (rec->counter - 1) * 1000);
638 }
639
640 trace_seq_init(&s);
641 trace_print_graph_duration(rec->time, &s);
642 trace_seq_puts(&s, " ");
643 trace_print_graph_duration(avg, &s);
644 trace_seq_puts(&s, " ");
645 trace_print_graph_duration(stddev, &s);
646 trace_print_seq(m, &s);
647 #endif
648 seq_putc(m, '\n');
649 out:
650 mutex_unlock(&ftrace_profile_lock);
651
652 return ret;
653 }
654
655 static void ftrace_profile_reset(struct ftrace_profile_stat *stat)
656 {
657 struct ftrace_profile_page *pg;
658
659 pg = stat->pages = stat->start;
660
661 while (pg) {
662 memset(pg->records, 0, PROFILE_RECORDS_SIZE);
663 pg->index = 0;
664 pg = pg->next;
665 }
666
667 memset(stat->hash, 0,
668 FTRACE_PROFILE_HASH_SIZE * sizeof(struct hlist_head));
669 }
670
671 int ftrace_profile_pages_init(struct ftrace_profile_stat *stat)
672 {
673 struct ftrace_profile_page *pg;
674 int functions;
675 int pages;
676 int i;
677
678 /* If we already allocated, do nothing */
679 if (stat->pages)
680 return 0;
681
682 stat->pages = (void *)get_zeroed_page(GFP_KERNEL);
683 if (!stat->pages)
684 return -ENOMEM;
685
686 #ifdef CONFIG_DYNAMIC_FTRACE
687 functions = ftrace_update_tot_cnt;
688 #else
689 /*
690 * We do not know the number of functions that exist because
691 * dynamic tracing is what counts them. With past experience
692 * we have around 20K functions. That should be more than enough.
693 * It is highly unlikely we will execute every function in
694 * the kernel.
695 */
696 functions = 20000;
697 #endif
698
699 pg = stat->start = stat->pages;
700
701 pages = DIV_ROUND_UP(functions, PROFILES_PER_PAGE);
702
703 for (i = 1; i < pages; i++) {
704 pg->next = (void *)get_zeroed_page(GFP_KERNEL);
705 if (!pg->next)
706 goto out_free;
707 pg = pg->next;
708 }
709
710 return 0;
711
712 out_free:
713 pg = stat->start;
714 while (pg) {
715 unsigned long tmp = (unsigned long)pg;
716
717 pg = pg->next;
718 free_page(tmp);
719 }
720
721 stat->pages = NULL;
722 stat->start = NULL;
723
724 return -ENOMEM;
725 }
726
727 static int ftrace_profile_init_cpu(int cpu)
728 {
729 struct ftrace_profile_stat *stat;
730 int size;
731
732 stat = &per_cpu(ftrace_profile_stats, cpu);
733
734 if (stat->hash) {
735 /* If the profile is already created, simply reset it */
736 ftrace_profile_reset(stat);
737 return 0;
738 }
739
740 /*
741 * We are profiling all functions, but usually only a few thousand
742 * functions are hit. We'll make a hash of 1024 items.
743 */
744 size = FTRACE_PROFILE_HASH_SIZE;
745
746 stat->hash = kzalloc(sizeof(struct hlist_head) * size, GFP_KERNEL);
747
748 if (!stat->hash)
749 return -ENOMEM;
750
751 /* Preallocate the function profiling pages */
752 if (ftrace_profile_pages_init(stat) < 0) {
753 kfree(stat->hash);
754 stat->hash = NULL;
755 return -ENOMEM;
756 }
757
758 return 0;
759 }
760
761 static int ftrace_profile_init(void)
762 {
763 int cpu;
764 int ret = 0;
765
766 for_each_possible_cpu(cpu) {
767 ret = ftrace_profile_init_cpu(cpu);
768 if (ret)
769 break;
770 }
771
772 return ret;
773 }
774
775 /* interrupts must be disabled */
776 static struct ftrace_profile *
777 ftrace_find_profiled_func(struct ftrace_profile_stat *stat, unsigned long ip)
778 {
779 struct ftrace_profile *rec;
780 struct hlist_head *hhd;
781 unsigned long key;
782
783 key = hash_long(ip, FTRACE_PROFILE_HASH_BITS);
784 hhd = &stat->hash[key];
785
786 if (hlist_empty(hhd))
787 return NULL;
788
789 hlist_for_each_entry_rcu_notrace(rec, hhd, node) {
790 if (rec->ip == ip)
791 return rec;
792 }
793
794 return NULL;
795 }
796
797 static void ftrace_add_profile(struct ftrace_profile_stat *stat,
798 struct ftrace_profile *rec)
799 {
800 unsigned long key;
801
802 key = hash_long(rec->ip, FTRACE_PROFILE_HASH_BITS);
803 hlist_add_head_rcu(&rec->node, &stat->hash[key]);
804 }
805
806 /*
807 * The memory is already allocated, this simply finds a new record to use.
808 */
809 static struct ftrace_profile *
810 ftrace_profile_alloc(struct ftrace_profile_stat *stat, unsigned long ip)
811 {
812 struct ftrace_profile *rec = NULL;
813
814 /* prevent recursion (from NMIs) */
815 if (atomic_inc_return(&stat->disabled) != 1)
816 goto out;
817
818 /*
819 * Try to find the function again since an NMI
820 * could have added it
821 */
822 rec = ftrace_find_profiled_func(stat, ip);
823 if (rec)
824 goto out;
825
826 if (stat->pages->index == PROFILES_PER_PAGE) {
827 if (!stat->pages->next)
828 goto out;
829 stat->pages = stat->pages->next;
830 }
831
832 rec = &stat->pages->records[stat->pages->index++];
833 rec->ip = ip;
834 ftrace_add_profile(stat, rec);
835
836 out:
837 atomic_dec(&stat->disabled);
838
839 return rec;
840 }
841
842 static void
843 function_profile_call(unsigned long ip, unsigned long parent_ip,
844 struct ftrace_ops *ops, struct pt_regs *regs)
845 {
846 struct ftrace_profile_stat *stat;
847 struct ftrace_profile *rec;
848 unsigned long flags;
849
850 if (!ftrace_profile_enabled)
851 return;
852
853 local_irq_save(flags);
854
855 stat = this_cpu_ptr(&ftrace_profile_stats);
856 if (!stat->hash || !ftrace_profile_enabled)
857 goto out;
858
859 rec = ftrace_find_profiled_func(stat, ip);
860 if (!rec) {
861 rec = ftrace_profile_alloc(stat, ip);
862 if (!rec)
863 goto out;
864 }
865
866 rec->counter++;
867 out:
868 local_irq_restore(flags);
869 }
870
871 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
872 static int profile_graph_entry(struct ftrace_graph_ent *trace)
873 {
874 function_profile_call(trace->func, 0, NULL, NULL);
875 return 1;
876 }
877
878 static void profile_graph_return(struct ftrace_graph_ret *trace)
879 {
880 struct ftrace_profile_stat *stat;
881 unsigned long long calltime;
882 struct ftrace_profile *rec;
883 unsigned long flags;
884
885 local_irq_save(flags);
886 stat = this_cpu_ptr(&ftrace_profile_stats);
887 if (!stat->hash || !ftrace_profile_enabled)
888 goto out;
889
890 /* If the calltime was zero'd ignore it */
891 if (!trace->calltime)
892 goto out;
893
894 calltime = trace->rettime - trace->calltime;
895
896 if (!fgraph_graph_time) {
897 int index;
898
899 index = trace->depth;
900
901 /* Append this call time to the parent time to subtract */
902 if (index)
903 current->ret_stack[index - 1].subtime += calltime;
904
905 if (current->ret_stack[index].subtime < calltime)
906 calltime -= current->ret_stack[index].subtime;
907 else
908 calltime = 0;
909 }
910
911 rec = ftrace_find_profiled_func(stat, trace->func);
912 if (rec) {
913 rec->time += calltime;
914 rec->time_squared += calltime * calltime;
915 }
916
917 out:
918 local_irq_restore(flags);
919 }
920
921 static int register_ftrace_profiler(void)
922 {
923 return register_ftrace_graph(&profile_graph_return,
924 &profile_graph_entry);
925 }
926
927 static void unregister_ftrace_profiler(void)
928 {
929 unregister_ftrace_graph();
930 }
931 #else
932 static struct ftrace_ops ftrace_profile_ops __read_mostly = {
933 .func = function_profile_call,
934 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
935 INIT_OPS_HASH(ftrace_profile_ops)
936 };
937
938 static int register_ftrace_profiler(void)
939 {
940 return register_ftrace_function(&ftrace_profile_ops);
941 }
942
943 static void unregister_ftrace_profiler(void)
944 {
945 unregister_ftrace_function(&ftrace_profile_ops);
946 }
947 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
948
949 static ssize_t
950 ftrace_profile_write(struct file *filp, const char __user *ubuf,
951 size_t cnt, loff_t *ppos)
952 {
953 unsigned long val;
954 int ret;
955
956 ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
957 if (ret)
958 return ret;
959
960 val = !!val;
961
962 mutex_lock(&ftrace_profile_lock);
963 if (ftrace_profile_enabled ^ val) {
964 if (val) {
965 ret = ftrace_profile_init();
966 if (ret < 0) {
967 cnt = ret;
968 goto out;
969 }
970
971 ret = register_ftrace_profiler();
972 if (ret < 0) {
973 cnt = ret;
974 goto out;
975 }
976 ftrace_profile_enabled = 1;
977 } else {
978 ftrace_profile_enabled = 0;
979 /*
980 * unregister_ftrace_profiler calls stop_machine
981 * so this acts like an synchronize_sched.
982 */
983 unregister_ftrace_profiler();
984 }
985 }
986 out:
987 mutex_unlock(&ftrace_profile_lock);
988
989 *ppos += cnt;
990
991 return cnt;
992 }
993
994 static ssize_t
995 ftrace_profile_read(struct file *filp, char __user *ubuf,
996 size_t cnt, loff_t *ppos)
997 {
998 char buf[64]; /* big enough to hold a number */
999 int r;
1000
1001 r = sprintf(buf, "%u\n", ftrace_profile_enabled);
1002 return simple_read_from_buffer(ubuf, cnt, ppos, buf, r);
1003 }
1004
1005 static const struct file_operations ftrace_profile_fops = {
1006 .open = tracing_open_generic,
1007 .read = ftrace_profile_read,
1008 .write = ftrace_profile_write,
1009 .llseek = default_llseek,
1010 };
1011
1012 /* used to initialize the real stat files */
1013 static struct tracer_stat function_stats __initdata = {
1014 .name = "functions",
1015 .stat_start = function_stat_start,
1016 .stat_next = function_stat_next,
1017 .stat_cmp = function_stat_cmp,
1018 .stat_headers = function_stat_headers,
1019 .stat_show = function_stat_show
1020 };
1021
1022 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1023 {
1024 struct ftrace_profile_stat *stat;
1025 struct dentry *entry;
1026 char *name;
1027 int ret;
1028 int cpu;
1029
1030 for_each_possible_cpu(cpu) {
1031 stat = &per_cpu(ftrace_profile_stats, cpu);
1032
1033 name = kasprintf(GFP_KERNEL, "function%d", cpu);
1034 if (!name) {
1035 /*
1036 * The files created are permanent, if something happens
1037 * we still do not free memory.
1038 */
1039 WARN(1,
1040 "Could not allocate stat file for cpu %d\n",
1041 cpu);
1042 return;
1043 }
1044 stat->stat = function_stats;
1045 stat->stat.name = name;
1046 ret = register_stat_tracer(&stat->stat);
1047 if (ret) {
1048 WARN(1,
1049 "Could not register function stat for cpu %d\n",
1050 cpu);
1051 kfree(name);
1052 return;
1053 }
1054 }
1055
1056 entry = tracefs_create_file("function_profile_enabled", 0644,
1057 d_tracer, NULL, &ftrace_profile_fops);
1058 if (!entry)
1059 pr_warn("Could not create tracefs 'function_profile_enabled' entry\n");
1060 }
1061
1062 #else /* CONFIG_FUNCTION_PROFILER */
1063 static __init void ftrace_profile_tracefs(struct dentry *d_tracer)
1064 {
1065 }
1066 #endif /* CONFIG_FUNCTION_PROFILER */
1067
1068 static struct pid * const ftrace_swapper_pid = &init_struct_pid;
1069
1070 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
1071 static int ftrace_graph_active;
1072 #else
1073 # define ftrace_graph_active 0
1074 #endif
1075
1076 #ifdef CONFIG_DYNAMIC_FTRACE
1077
1078 static struct ftrace_ops *removed_ops;
1079
1080 /*
1081 * Set when doing a global update, like enabling all recs or disabling them.
1082 * It is not set when just updating a single ftrace_ops.
1083 */
1084 static bool update_all_ops;
1085
1086 #ifndef CONFIG_FTRACE_MCOUNT_RECORD
1087 # error Dynamic ftrace depends on MCOUNT_RECORD
1088 #endif
1089
1090 static struct hlist_head ftrace_func_hash[FTRACE_FUNC_HASHSIZE] __read_mostly;
1091
1092 struct ftrace_func_probe {
1093 struct hlist_node node;
1094 struct ftrace_probe_ops *ops;
1095 unsigned long flags;
1096 unsigned long ip;
1097 void *data;
1098 struct list_head free_list;
1099 };
1100
1101 struct ftrace_func_entry {
1102 struct hlist_node hlist;
1103 unsigned long ip;
1104 };
1105
1106 struct ftrace_hash {
1107 unsigned long size_bits;
1108 struct hlist_head *buckets;
1109 unsigned long count;
1110 struct rcu_head rcu;
1111 };
1112
1113 /*
1114 * We make these constant because no one should touch them,
1115 * but they are used as the default "empty hash", to avoid allocating
1116 * it all the time. These are in a read only section such that if
1117 * anyone does try to modify it, it will cause an exception.
1118 */
1119 static const struct hlist_head empty_buckets[1];
1120 static const struct ftrace_hash empty_hash = {
1121 .buckets = (struct hlist_head *)empty_buckets,
1122 };
1123 #define EMPTY_HASH ((struct ftrace_hash *)&empty_hash)
1124
1125 static struct ftrace_ops global_ops = {
1126 .func = ftrace_stub,
1127 .local_hash.notrace_hash = EMPTY_HASH,
1128 .local_hash.filter_hash = EMPTY_HASH,
1129 INIT_OPS_HASH(global_ops)
1130 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
1131 FTRACE_OPS_FL_INITIALIZED |
1132 FTRACE_OPS_FL_PID,
1133 };
1134
1135 /*
1136 * This is used by __kernel_text_address() to return true if the
1137 * address is on a dynamically allocated trampoline that would
1138 * not return true for either core_kernel_text() or
1139 * is_module_text_address().
1140 */
1141 bool is_ftrace_trampoline(unsigned long addr)
1142 {
1143 struct ftrace_ops *op;
1144 bool ret = false;
1145
1146 /*
1147 * Some of the ops may be dynamically allocated,
1148 * they are freed after a synchronize_sched().
1149 */
1150 preempt_disable_notrace();
1151
1152 do_for_each_ftrace_op(op, ftrace_ops_list) {
1153 /*
1154 * This is to check for dynamically allocated trampolines.
1155 * Trampolines that are in kernel text will have
1156 * core_kernel_text() return true.
1157 */
1158 if (op->trampoline && op->trampoline_size)
1159 if (addr >= op->trampoline &&
1160 addr < op->trampoline + op->trampoline_size) {
1161 ret = true;
1162 goto out;
1163 }
1164 } while_for_each_ftrace_op(op);
1165
1166 out:
1167 preempt_enable_notrace();
1168
1169 return ret;
1170 }
1171
1172 struct ftrace_page {
1173 struct ftrace_page *next;
1174 struct dyn_ftrace *records;
1175 int index;
1176 int size;
1177 };
1178
1179 #define ENTRY_SIZE sizeof(struct dyn_ftrace)
1180 #define ENTRIES_PER_PAGE (PAGE_SIZE / ENTRY_SIZE)
1181
1182 /* estimate from running different kernels */
1183 #define NR_TO_INIT 10000
1184
1185 static struct ftrace_page *ftrace_pages_start;
1186 static struct ftrace_page *ftrace_pages;
1187
1188 static bool __always_inline ftrace_hash_empty(struct ftrace_hash *hash)
1189 {
1190 return !hash || !hash->count;
1191 }
1192
1193 static struct ftrace_func_entry *
1194 ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip)
1195 {
1196 unsigned long key;
1197 struct ftrace_func_entry *entry;
1198 struct hlist_head *hhd;
1199
1200 if (ftrace_hash_empty(hash))
1201 return NULL;
1202
1203 if (hash->size_bits > 0)
1204 key = hash_long(ip, hash->size_bits);
1205 else
1206 key = 0;
1207
1208 hhd = &hash->buckets[key];
1209
1210 hlist_for_each_entry_rcu_notrace(entry, hhd, hlist) {
1211 if (entry->ip == ip)
1212 return entry;
1213 }
1214 return NULL;
1215 }
1216
1217 static void __add_hash_entry(struct ftrace_hash *hash,
1218 struct ftrace_func_entry *entry)
1219 {
1220 struct hlist_head *hhd;
1221 unsigned long key;
1222
1223 if (hash->size_bits)
1224 key = hash_long(entry->ip, hash->size_bits);
1225 else
1226 key = 0;
1227
1228 hhd = &hash->buckets[key];
1229 hlist_add_head(&entry->hlist, hhd);
1230 hash->count++;
1231 }
1232
1233 static int add_hash_entry(struct ftrace_hash *hash, unsigned long ip)
1234 {
1235 struct ftrace_func_entry *entry;
1236
1237 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
1238 if (!entry)
1239 return -ENOMEM;
1240
1241 entry->ip = ip;
1242 __add_hash_entry(hash, entry);
1243
1244 return 0;
1245 }
1246
1247 static void
1248 free_hash_entry(struct ftrace_hash *hash,
1249 struct ftrace_func_entry *entry)
1250 {
1251 hlist_del(&entry->hlist);
1252 kfree(entry);
1253 hash->count--;
1254 }
1255
1256 static void
1257 remove_hash_entry(struct ftrace_hash *hash,
1258 struct ftrace_func_entry *entry)
1259 {
1260 hlist_del(&entry->hlist);
1261 hash->count--;
1262 }
1263
1264 static void ftrace_hash_clear(struct ftrace_hash *hash)
1265 {
1266 struct hlist_head *hhd;
1267 struct hlist_node *tn;
1268 struct ftrace_func_entry *entry;
1269 int size = 1 << hash->size_bits;
1270 int i;
1271
1272 if (!hash->count)
1273 return;
1274
1275 for (i = 0; i < size; i++) {
1276 hhd = &hash->buckets[i];
1277 hlist_for_each_entry_safe(entry, tn, hhd, hlist)
1278 free_hash_entry(hash, entry);
1279 }
1280 FTRACE_WARN_ON(hash->count);
1281 }
1282
1283 static void free_ftrace_hash(struct ftrace_hash *hash)
1284 {
1285 if (!hash || hash == EMPTY_HASH)
1286 return;
1287 ftrace_hash_clear(hash);
1288 kfree(hash->buckets);
1289 kfree(hash);
1290 }
1291
1292 static void __free_ftrace_hash_rcu(struct rcu_head *rcu)
1293 {
1294 struct ftrace_hash *hash;
1295
1296 hash = container_of(rcu, struct ftrace_hash, rcu);
1297 free_ftrace_hash(hash);
1298 }
1299
1300 static void free_ftrace_hash_rcu(struct ftrace_hash *hash)
1301 {
1302 if (!hash || hash == EMPTY_HASH)
1303 return;
1304 call_rcu_sched(&hash->rcu, __free_ftrace_hash_rcu);
1305 }
1306
1307 void ftrace_free_filter(struct ftrace_ops *ops)
1308 {
1309 ftrace_ops_init(ops);
1310 free_ftrace_hash(ops->func_hash->filter_hash);
1311 free_ftrace_hash(ops->func_hash->notrace_hash);
1312 }
1313
1314 static struct ftrace_hash *alloc_ftrace_hash(int size_bits)
1315 {
1316 struct ftrace_hash *hash;
1317 int size;
1318
1319 hash = kzalloc(sizeof(*hash), GFP_KERNEL);
1320 if (!hash)
1321 return NULL;
1322
1323 size = 1 << size_bits;
1324 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL);
1325
1326 if (!hash->buckets) {
1327 kfree(hash);
1328 return NULL;
1329 }
1330
1331 hash->size_bits = size_bits;
1332
1333 return hash;
1334 }
1335
1336 static struct ftrace_hash *
1337 alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash)
1338 {
1339 struct ftrace_func_entry *entry;
1340 struct ftrace_hash *new_hash;
1341 int size;
1342 int ret;
1343 int i;
1344
1345 new_hash = alloc_ftrace_hash(size_bits);
1346 if (!new_hash)
1347 return NULL;
1348
1349 /* Empty hash? */
1350 if (ftrace_hash_empty(hash))
1351 return new_hash;
1352
1353 size = 1 << hash->size_bits;
1354 for (i = 0; i < size; i++) {
1355 hlist_for_each_entry(entry, &hash->buckets[i], hlist) {
1356 ret = add_hash_entry(new_hash, entry->ip);
1357 if (ret < 0)
1358 goto free_hash;
1359 }
1360 }
1361
1362 FTRACE_WARN_ON(new_hash->count != hash->count);
1363
1364 return new_hash;
1365
1366 free_hash:
1367 free_ftrace_hash(new_hash);
1368 return NULL;
1369 }
1370
1371 static void
1372 ftrace_hash_rec_disable_modify(struct ftrace_ops *ops, int filter_hash);
1373 static void
1374 ftrace_hash_rec_enable_modify(struct ftrace_ops *ops, int filter_hash);
1375
1376 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1377 struct ftrace_hash *new_hash);
1378
1379 static int
1380 ftrace_hash_move(struct ftrace_ops *ops, int enable,
1381 struct ftrace_hash **dst, struct ftrace_hash *src)
1382 {
1383 struct ftrace_func_entry *entry;
1384 struct hlist_node *tn;
1385 struct hlist_head *hhd;
1386 struct ftrace_hash *new_hash;
1387 int size = src->count;
1388 int bits = 0;
1389 int ret;
1390 int i;
1391
1392 /* Reject setting notrace hash on IPMODIFY ftrace_ops */
1393 if (ops->flags & FTRACE_OPS_FL_IPMODIFY && !enable)
1394 return -EINVAL;
1395
1396 /*
1397 * If the new source is empty, just free dst and assign it
1398 * the empty_hash.
1399 */
1400 if (!src->count) {
1401 new_hash = EMPTY_HASH;
1402 goto update;
1403 }
1404
1405 /*
1406 * Make the hash size about 1/2 the # found
1407 */
1408 for (size /= 2; size; size >>= 1)
1409 bits++;
1410
1411 /* Don't allocate too much */
1412 if (bits > FTRACE_HASH_MAX_BITS)
1413 bits = FTRACE_HASH_MAX_BITS;
1414
1415 new_hash = alloc_ftrace_hash(bits);
1416 if (!new_hash)
1417 return -ENOMEM;
1418
1419 size = 1 << src->size_bits;
1420 for (i = 0; i < size; i++) {
1421 hhd = &src->buckets[i];
1422 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1423 remove_hash_entry(src, entry);
1424 __add_hash_entry(new_hash, entry);
1425 }
1426 }
1427
1428 update:
1429 /* Make sure this can be applied if it is IPMODIFY ftrace_ops */
1430 if (enable) {
1431 /* IPMODIFY should be updated only when filter_hash updating */
1432 ret = ftrace_hash_ipmodify_update(ops, new_hash);
1433 if (ret < 0) {
1434 free_ftrace_hash(new_hash);
1435 return ret;
1436 }
1437 }
1438
1439 /*
1440 * Remove the current set, update the hash and add
1441 * them back.
1442 */
1443 ftrace_hash_rec_disable_modify(ops, enable);
1444
1445 rcu_assign_pointer(*dst, new_hash);
1446
1447 ftrace_hash_rec_enable_modify(ops, enable);
1448
1449 return 0;
1450 }
1451
1452 static bool hash_contains_ip(unsigned long ip,
1453 struct ftrace_ops_hash *hash)
1454 {
1455 /*
1456 * The function record is a match if it exists in the filter
1457 * hash and not in the notrace hash. Note, an emty hash is
1458 * considered a match for the filter hash, but an empty
1459 * notrace hash is considered not in the notrace hash.
1460 */
1461 return (ftrace_hash_empty(hash->filter_hash) ||
1462 ftrace_lookup_ip(hash->filter_hash, ip)) &&
1463 (ftrace_hash_empty(hash->notrace_hash) ||
1464 !ftrace_lookup_ip(hash->notrace_hash, ip));
1465 }
1466
1467 /*
1468 * Test the hashes for this ops to see if we want to call
1469 * the ops->func or not.
1470 *
1471 * It's a match if the ip is in the ops->filter_hash or
1472 * the filter_hash does not exist or is empty,
1473 * AND
1474 * the ip is not in the ops->notrace_hash.
1475 *
1476 * This needs to be called with preemption disabled as
1477 * the hashes are freed with call_rcu_sched().
1478 */
1479 static int
1480 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1481 {
1482 struct ftrace_ops_hash hash;
1483 int ret;
1484
1485 #ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1486 /*
1487 * There's a small race when adding ops that the ftrace handler
1488 * that wants regs, may be called without them. We can not
1489 * allow that handler to be called if regs is NULL.
1490 */
1491 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1492 return 0;
1493 #endif
1494
1495 hash.filter_hash = rcu_dereference_raw_notrace(ops->func_hash->filter_hash);
1496 hash.notrace_hash = rcu_dereference_raw_notrace(ops->func_hash->notrace_hash);
1497
1498 if (hash_contains_ip(ip, &hash))
1499 ret = 1;
1500 else
1501 ret = 0;
1502
1503 return ret;
1504 }
1505
1506 /*
1507 * This is a double for. Do not use 'break' to break out of the loop,
1508 * you must use a goto.
1509 */
1510 #define do_for_each_ftrace_rec(pg, rec) \
1511 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1512 int _____i; \
1513 for (_____i = 0; _____i < pg->index; _____i++) { \
1514 rec = &pg->records[_____i];
1515
1516 #define while_for_each_ftrace_rec() \
1517 } \
1518 }
1519
1520
1521 static int ftrace_cmp_recs(const void *a, const void *b)
1522 {
1523 const struct dyn_ftrace *key = a;
1524 const struct dyn_ftrace *rec = b;
1525
1526 if (key->flags < rec->ip)
1527 return -1;
1528 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1529 return 1;
1530 return 0;
1531 }
1532
1533 /**
1534 * ftrace_location_range - return the first address of a traced location
1535 * if it touches the given ip range
1536 * @start: start of range to search.
1537 * @end: end of range to search (inclusive). @end points to the last byte
1538 * to check.
1539 *
1540 * Returns rec->ip if the related ftrace location is a least partly within
1541 * the given address range. That is, the first address of the instruction
1542 * that is either a NOP or call to the function tracer. It checks the ftrace
1543 * internal tables to determine if the address belongs or not.
1544 */
1545 unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1546 {
1547 struct ftrace_page *pg;
1548 struct dyn_ftrace *rec;
1549 struct dyn_ftrace key;
1550
1551 key.ip = start;
1552 key.flags = end; /* overload flags, as it is unsigned long */
1553
1554 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1555 if (end < pg->records[0].ip ||
1556 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1557 continue;
1558 rec = bsearch(&key, pg->records, pg->index,
1559 sizeof(struct dyn_ftrace),
1560 ftrace_cmp_recs);
1561 if (rec)
1562 return rec->ip;
1563 }
1564
1565 return 0;
1566 }
1567
1568 /**
1569 * ftrace_location - return true if the ip giving is a traced location
1570 * @ip: the instruction pointer to check
1571 *
1572 * Returns rec->ip if @ip given is a pointer to a ftrace location.
1573 * That is, the instruction that is either a NOP or call to
1574 * the function tracer. It checks the ftrace internal tables to
1575 * determine if the address belongs or not.
1576 */
1577 unsigned long ftrace_location(unsigned long ip)
1578 {
1579 return ftrace_location_range(ip, ip);
1580 }
1581
1582 /**
1583 * ftrace_text_reserved - return true if range contains an ftrace location
1584 * @start: start of range to search
1585 * @end: end of range to search (inclusive). @end points to the last byte to check.
1586 *
1587 * Returns 1 if @start and @end contains a ftrace location.
1588 * That is, the instruction that is either a NOP or call to
1589 * the function tracer. It checks the ftrace internal tables to
1590 * determine if the address belongs or not.
1591 */
1592 int ftrace_text_reserved(const void *start, const void *end)
1593 {
1594 unsigned long ret;
1595
1596 ret = ftrace_location_range((unsigned long)start,
1597 (unsigned long)end);
1598
1599 return (int)!!ret;
1600 }
1601
1602 /* Test if ops registered to this rec needs regs */
1603 static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1604 {
1605 struct ftrace_ops *ops;
1606 bool keep_regs = false;
1607
1608 for (ops = ftrace_ops_list;
1609 ops != &ftrace_list_end; ops = ops->next) {
1610 /* pass rec in as regs to have non-NULL val */
1611 if (ftrace_ops_test(ops, rec->ip, rec)) {
1612 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1613 keep_regs = true;
1614 break;
1615 }
1616 }
1617 }
1618
1619 return keep_regs;
1620 }
1621
1622 static bool __ftrace_hash_rec_update(struct ftrace_ops *ops,
1623 int filter_hash,
1624 bool inc)
1625 {
1626 struct ftrace_hash *hash;
1627 struct ftrace_hash *other_hash;
1628 struct ftrace_page *pg;
1629 struct dyn_ftrace *rec;
1630 bool update = false;
1631 int count = 0;
1632 int all = 0;
1633
1634 /* Only update if the ops has been registered */
1635 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1636 return false;
1637
1638 /*
1639 * In the filter_hash case:
1640 * If the count is zero, we update all records.
1641 * Otherwise we just update the items in the hash.
1642 *
1643 * In the notrace_hash case:
1644 * We enable the update in the hash.
1645 * As disabling notrace means enabling the tracing,
1646 * and enabling notrace means disabling, the inc variable
1647 * gets inversed.
1648 */
1649 if (filter_hash) {
1650 hash = ops->func_hash->filter_hash;
1651 other_hash = ops->func_hash->notrace_hash;
1652 if (ftrace_hash_empty(hash))
1653 all = 1;
1654 } else {
1655 inc = !inc;
1656 hash = ops->func_hash->notrace_hash;
1657 other_hash = ops->func_hash->filter_hash;
1658 /*
1659 * If the notrace hash has no items,
1660 * then there's nothing to do.
1661 */
1662 if (ftrace_hash_empty(hash))
1663 return false;
1664 }
1665
1666 do_for_each_ftrace_rec(pg, rec) {
1667 int in_other_hash = 0;
1668 int in_hash = 0;
1669 int match = 0;
1670
1671 if (rec->flags & FTRACE_FL_DISABLED)
1672 continue;
1673
1674 if (all) {
1675 /*
1676 * Only the filter_hash affects all records.
1677 * Update if the record is not in the notrace hash.
1678 */
1679 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1680 match = 1;
1681 } else {
1682 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1683 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1684
1685 /*
1686 * If filter_hash is set, we want to match all functions
1687 * that are in the hash but not in the other hash.
1688 *
1689 * If filter_hash is not set, then we are decrementing.
1690 * That means we match anything that is in the hash
1691 * and also in the other_hash. That is, we need to turn
1692 * off functions in the other hash because they are disabled
1693 * by this hash.
1694 */
1695 if (filter_hash && in_hash && !in_other_hash)
1696 match = 1;
1697 else if (!filter_hash && in_hash &&
1698 (in_other_hash || ftrace_hash_empty(other_hash)))
1699 match = 1;
1700 }
1701 if (!match)
1702 continue;
1703
1704 if (inc) {
1705 rec->flags++;
1706 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1707 return false;
1708
1709 /*
1710 * If there's only a single callback registered to a
1711 * function, and the ops has a trampoline registered
1712 * for it, then we can call it directly.
1713 */
1714 if (ftrace_rec_count(rec) == 1 && ops->trampoline)
1715 rec->flags |= FTRACE_FL_TRAMP;
1716 else
1717 /*
1718 * If we are adding another function callback
1719 * to this function, and the previous had a
1720 * custom trampoline in use, then we need to go
1721 * back to the default trampoline.
1722 */
1723 rec->flags &= ~FTRACE_FL_TRAMP;
1724
1725 /*
1726 * If any ops wants regs saved for this function
1727 * then all ops will get saved regs.
1728 */
1729 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1730 rec->flags |= FTRACE_FL_REGS;
1731 } else {
1732 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1733 return false;
1734 rec->flags--;
1735
1736 /*
1737 * If the rec had REGS enabled and the ops that is
1738 * being removed had REGS set, then see if there is
1739 * still any ops for this record that wants regs.
1740 * If not, we can stop recording them.
1741 */
1742 if (ftrace_rec_count(rec) > 0 &&
1743 rec->flags & FTRACE_FL_REGS &&
1744 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1745 if (!test_rec_ops_needs_regs(rec))
1746 rec->flags &= ~FTRACE_FL_REGS;
1747 }
1748
1749 /*
1750 * If the rec had TRAMP enabled, then it needs to
1751 * be cleared. As TRAMP can only be enabled iff
1752 * there is only a single ops attached to it.
1753 * In otherwords, always disable it on decrementing.
1754 * In the future, we may set it if rec count is
1755 * decremented to one, and the ops that is left
1756 * has a trampoline.
1757 */
1758 rec->flags &= ~FTRACE_FL_TRAMP;
1759
1760 /*
1761 * flags will be cleared in ftrace_check_record()
1762 * if rec count is zero.
1763 */
1764 }
1765 count++;
1766
1767 /* Must match FTRACE_UPDATE_CALLS in ftrace_modify_all_code() */
1768 update |= ftrace_test_record(rec, 1) != FTRACE_UPDATE_IGNORE;
1769
1770 /* Shortcut, if we handled all records, we are done. */
1771 if (!all && count == hash->count)
1772 return update;
1773 } while_for_each_ftrace_rec();
1774
1775 return update;
1776 }
1777
1778 static bool ftrace_hash_rec_disable(struct ftrace_ops *ops,
1779 int filter_hash)
1780 {
1781 return __ftrace_hash_rec_update(ops, filter_hash, 0);
1782 }
1783
1784 static bool ftrace_hash_rec_enable(struct ftrace_ops *ops,
1785 int filter_hash)
1786 {
1787 return __ftrace_hash_rec_update(ops, filter_hash, 1);
1788 }
1789
1790 static void ftrace_hash_rec_update_modify(struct ftrace_ops *ops,
1791 int filter_hash, int inc)
1792 {
1793 struct ftrace_ops *op;
1794
1795 __ftrace_hash_rec_update(ops, filter_hash, inc);
1796
1797 if (ops->func_hash != &global_ops.local_hash)
1798 return;
1799
1800 /*
1801 * If the ops shares the global_ops hash, then we need to update
1802 * all ops that are enabled and use this hash.
1803 */
1804 do_for_each_ftrace_op(op, ftrace_ops_list) {
1805 /* Already done */
1806 if (op == ops)
1807 continue;
1808 if (op->func_hash == &global_ops.local_hash)
1809 __ftrace_hash_rec_update(op, filter_hash, inc);
1810 } while_for_each_ftrace_op(op);
1811 }
1812
1813 static void ftrace_hash_rec_disable_modify(struct ftrace_ops *ops,
1814 int filter_hash)
1815 {
1816 ftrace_hash_rec_update_modify(ops, filter_hash, 0);
1817 }
1818
1819 static void ftrace_hash_rec_enable_modify(struct ftrace_ops *ops,
1820 int filter_hash)
1821 {
1822 ftrace_hash_rec_update_modify(ops, filter_hash, 1);
1823 }
1824
1825 /*
1826 * Try to update IPMODIFY flag on each ftrace_rec. Return 0 if it is OK
1827 * or no-needed to update, -EBUSY if it detects a conflict of the flag
1828 * on a ftrace_rec, and -EINVAL if the new_hash tries to trace all recs.
1829 * Note that old_hash and new_hash has below meanings
1830 * - If the hash is NULL, it hits all recs (if IPMODIFY is set, this is rejected)
1831 * - If the hash is EMPTY_HASH, it hits nothing
1832 * - Anything else hits the recs which match the hash entries.
1833 */
1834 static int __ftrace_hash_update_ipmodify(struct ftrace_ops *ops,
1835 struct ftrace_hash *old_hash,
1836 struct ftrace_hash *new_hash)
1837 {
1838 struct ftrace_page *pg;
1839 struct dyn_ftrace *rec, *end = NULL;
1840 int in_old, in_new;
1841
1842 /* Only update if the ops has been registered */
1843 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1844 return 0;
1845
1846 if (!(ops->flags & FTRACE_OPS_FL_IPMODIFY))
1847 return 0;
1848
1849 /*
1850 * Since the IPMODIFY is a very address sensitive action, we do not
1851 * allow ftrace_ops to set all functions to new hash.
1852 */
1853 if (!new_hash || !old_hash)
1854 return -EINVAL;
1855
1856 /* Update rec->flags */
1857 do_for_each_ftrace_rec(pg, rec) {
1858 /* We need to update only differences of filter_hash */
1859 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1860 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1861 if (in_old == in_new)
1862 continue;
1863
1864 if (in_new) {
1865 /* New entries must ensure no others are using it */
1866 if (rec->flags & FTRACE_FL_IPMODIFY)
1867 goto rollback;
1868 rec->flags |= FTRACE_FL_IPMODIFY;
1869 } else /* Removed entry */
1870 rec->flags &= ~FTRACE_FL_IPMODIFY;
1871 } while_for_each_ftrace_rec();
1872
1873 return 0;
1874
1875 rollback:
1876 end = rec;
1877
1878 /* Roll back what we did above */
1879 do_for_each_ftrace_rec(pg, rec) {
1880 if (rec == end)
1881 goto err_out;
1882
1883 in_old = !!ftrace_lookup_ip(old_hash, rec->ip);
1884 in_new = !!ftrace_lookup_ip(new_hash, rec->ip);
1885 if (in_old == in_new)
1886 continue;
1887
1888 if (in_new)
1889 rec->flags &= ~FTRACE_FL_IPMODIFY;
1890 else
1891 rec->flags |= FTRACE_FL_IPMODIFY;
1892 } while_for_each_ftrace_rec();
1893
1894 err_out:
1895 return -EBUSY;
1896 }
1897
1898 static int ftrace_hash_ipmodify_enable(struct ftrace_ops *ops)
1899 {
1900 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1901
1902 if (ftrace_hash_empty(hash))
1903 hash = NULL;
1904
1905 return __ftrace_hash_update_ipmodify(ops, EMPTY_HASH, hash);
1906 }
1907
1908 /* Disabling always succeeds */
1909 static void ftrace_hash_ipmodify_disable(struct ftrace_ops *ops)
1910 {
1911 struct ftrace_hash *hash = ops->func_hash->filter_hash;
1912
1913 if (ftrace_hash_empty(hash))
1914 hash = NULL;
1915
1916 __ftrace_hash_update_ipmodify(ops, hash, EMPTY_HASH);
1917 }
1918
1919 static int ftrace_hash_ipmodify_update(struct ftrace_ops *ops,
1920 struct ftrace_hash *new_hash)
1921 {
1922 struct ftrace_hash *old_hash = ops->func_hash->filter_hash;
1923
1924 if (ftrace_hash_empty(old_hash))
1925 old_hash = NULL;
1926
1927 if (ftrace_hash_empty(new_hash))
1928 new_hash = NULL;
1929
1930 return __ftrace_hash_update_ipmodify(ops, old_hash, new_hash);
1931 }
1932
1933 static void print_ip_ins(const char *fmt, const unsigned char *p)
1934 {
1935 int i;
1936
1937 printk(KERN_CONT "%s", fmt);
1938
1939 for (i = 0; i < MCOUNT_INSN_SIZE; i++)
1940 printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
1941 }
1942
1943 static struct ftrace_ops *
1944 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec);
1945 static struct ftrace_ops *
1946 ftrace_find_tramp_ops_next(struct dyn_ftrace *rec, struct ftrace_ops *ops);
1947
1948 enum ftrace_bug_type ftrace_bug_type;
1949 const void *ftrace_expected;
1950
1951 static void print_bug_type(void)
1952 {
1953 switch (ftrace_bug_type) {
1954 case FTRACE_BUG_UNKNOWN:
1955 break;
1956 case FTRACE_BUG_INIT:
1957 pr_info("Initializing ftrace call sites\n");
1958 break;
1959 case FTRACE_BUG_NOP:
1960 pr_info("Setting ftrace call site to NOP\n");
1961 break;
1962 case FTRACE_BUG_CALL:
1963 pr_info("Setting ftrace call site to call ftrace function\n");
1964 break;
1965 case FTRACE_BUG_UPDATE:
1966 pr_info("Updating ftrace call site to call a different ftrace function\n");
1967 break;
1968 }
1969 }
1970
1971 /**
1972 * ftrace_bug - report and shutdown function tracer
1973 * @failed: The failed type (EFAULT, EINVAL, EPERM)
1974 * @rec: The record that failed
1975 *
1976 * The arch code that enables or disables the function tracing
1977 * can call ftrace_bug() when it has detected a problem in
1978 * modifying the code. @failed should be one of either:
1979 * EFAULT - if the problem happens on reading the @ip address
1980 * EINVAL - if what is read at @ip is not what was expected
1981 * EPERM - if the problem happens on writting to the @ip address
1982 */
1983 void ftrace_bug(int failed, struct dyn_ftrace *rec)
1984 {
1985 unsigned long ip = rec ? rec->ip : 0;
1986
1987 switch (failed) {
1988 case -EFAULT:
1989 FTRACE_WARN_ON_ONCE(1);
1990 pr_info("ftrace faulted on modifying ");
1991 print_ip_sym(ip);
1992 break;
1993 case -EINVAL:
1994 FTRACE_WARN_ON_ONCE(1);
1995 pr_info("ftrace failed to modify ");
1996 print_ip_sym(ip);
1997 print_ip_ins(" actual: ", (unsigned char *)ip);
1998 pr_cont("\n");
1999 if (ftrace_expected) {
2000 print_ip_ins(" expected: ", ftrace_expected);
2001 pr_cont("\n");
2002 }
2003 break;
2004 case -EPERM:
2005 FTRACE_WARN_ON_ONCE(1);
2006 pr_info("ftrace faulted on writing ");
2007 print_ip_sym(ip);
2008 break;
2009 default:
2010 FTRACE_WARN_ON_ONCE(1);
2011 pr_info("ftrace faulted on unknown error ");
2012 print_ip_sym(ip);
2013 }
2014 print_bug_type();
2015 if (rec) {
2016 struct ftrace_ops *ops = NULL;
2017
2018 pr_info("ftrace record flags: %lx\n", rec->flags);
2019 pr_cont(" (%ld)%s", ftrace_rec_count(rec),
2020 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2021 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2022 ops = ftrace_find_tramp_ops_any(rec);
2023 if (ops) {
2024 do {
2025 pr_cont("\ttramp: %pS (%pS)",
2026 (void *)ops->trampoline,
2027 (void *)ops->func);
2028 ops = ftrace_find_tramp_ops_next(rec, ops);
2029 } while (ops);
2030 } else
2031 pr_cont("\ttramp: ERROR!");
2032
2033 }
2034 ip = ftrace_get_addr_curr(rec);
2035 pr_cont("\n expected tramp: %lx\n", ip);
2036 }
2037 }
2038
2039 static int ftrace_check_record(struct dyn_ftrace *rec, int enable, int update)
2040 {
2041 unsigned long flag = 0UL;
2042
2043 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2044
2045 if (rec->flags & FTRACE_FL_DISABLED)
2046 return FTRACE_UPDATE_IGNORE;
2047
2048 /*
2049 * If we are updating calls:
2050 *
2051 * If the record has a ref count, then we need to enable it
2052 * because someone is using it.
2053 *
2054 * Otherwise we make sure its disabled.
2055 *
2056 * If we are disabling calls, then disable all records that
2057 * are enabled.
2058 */
2059 if (enable && ftrace_rec_count(rec))
2060 flag = FTRACE_FL_ENABLED;
2061
2062 /*
2063 * If enabling and the REGS flag does not match the REGS_EN, or
2064 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
2065 * this record. Set flags to fail the compare against ENABLED.
2066 */
2067 if (flag) {
2068 if (!(rec->flags & FTRACE_FL_REGS) !=
2069 !(rec->flags & FTRACE_FL_REGS_EN))
2070 flag |= FTRACE_FL_REGS;
2071
2072 if (!(rec->flags & FTRACE_FL_TRAMP) !=
2073 !(rec->flags & FTRACE_FL_TRAMP_EN))
2074 flag |= FTRACE_FL_TRAMP;
2075 }
2076
2077 /* If the state of this record hasn't changed, then do nothing */
2078 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
2079 return FTRACE_UPDATE_IGNORE;
2080
2081 if (flag) {
2082 /* Save off if rec is being enabled (for return value) */
2083 flag ^= rec->flags & FTRACE_FL_ENABLED;
2084
2085 if (update) {
2086 rec->flags |= FTRACE_FL_ENABLED;
2087 if (flag & FTRACE_FL_REGS) {
2088 if (rec->flags & FTRACE_FL_REGS)
2089 rec->flags |= FTRACE_FL_REGS_EN;
2090 else
2091 rec->flags &= ~FTRACE_FL_REGS_EN;
2092 }
2093 if (flag & FTRACE_FL_TRAMP) {
2094 if (rec->flags & FTRACE_FL_TRAMP)
2095 rec->flags |= FTRACE_FL_TRAMP_EN;
2096 else
2097 rec->flags &= ~FTRACE_FL_TRAMP_EN;
2098 }
2099 }
2100
2101 /*
2102 * If this record is being updated from a nop, then
2103 * return UPDATE_MAKE_CALL.
2104 * Otherwise,
2105 * return UPDATE_MODIFY_CALL to tell the caller to convert
2106 * from the save regs, to a non-save regs function or
2107 * vice versa, or from a trampoline call.
2108 */
2109 if (flag & FTRACE_FL_ENABLED) {
2110 ftrace_bug_type = FTRACE_BUG_CALL;
2111 return FTRACE_UPDATE_MAKE_CALL;
2112 }
2113
2114 ftrace_bug_type = FTRACE_BUG_UPDATE;
2115 return FTRACE_UPDATE_MODIFY_CALL;
2116 }
2117
2118 if (update) {
2119 /* If there's no more users, clear all flags */
2120 if (!ftrace_rec_count(rec))
2121 rec->flags = 0;
2122 else
2123 /*
2124 * Just disable the record, but keep the ops TRAMP
2125 * and REGS states. The _EN flags must be disabled though.
2126 */
2127 rec->flags &= ~(FTRACE_FL_ENABLED | FTRACE_FL_TRAMP_EN |
2128 FTRACE_FL_REGS_EN);
2129 }
2130
2131 ftrace_bug_type = FTRACE_BUG_NOP;
2132 return FTRACE_UPDATE_MAKE_NOP;
2133 }
2134
2135 /**
2136 * ftrace_update_record, set a record that now is tracing or not
2137 * @rec: the record to update
2138 * @enable: set to 1 if the record is tracing, zero to force disable
2139 *
2140 * The records that represent all functions that can be traced need
2141 * to be updated when tracing has been enabled.
2142 */
2143 int ftrace_update_record(struct dyn_ftrace *rec, int enable)
2144 {
2145 return ftrace_check_record(rec, enable, 1);
2146 }
2147
2148 /**
2149 * ftrace_test_record, check if the record has been enabled or not
2150 * @rec: the record to test
2151 * @enable: set to 1 to check if enabled, 0 if it is disabled
2152 *
2153 * The arch code may need to test if a record is already set to
2154 * tracing to determine how to modify the function code that it
2155 * represents.
2156 */
2157 int ftrace_test_record(struct dyn_ftrace *rec, int enable)
2158 {
2159 return ftrace_check_record(rec, enable, 0);
2160 }
2161
2162 static struct ftrace_ops *
2163 ftrace_find_tramp_ops_any(struct dyn_ftrace *rec)
2164 {
2165 struct ftrace_ops *op;
2166 unsigned long ip = rec->ip;
2167
2168 do_for_each_ftrace_op(op, ftrace_ops_list) {
2169
2170 if (!op->trampoline)
2171 continue;
2172
2173 if (hash_contains_ip(ip, op->func_hash))
2174 return op;
2175 } while_for_each_ftrace_op(op);
2176
2177 return NULL;
2178 }
2179
2180 static struct ftrace_ops *
2181 ftrace_find_tramp_ops_next(struct dyn_ftrace *rec,
2182 struct ftrace_ops *op)
2183 {
2184 unsigned long ip = rec->ip;
2185
2186 while_for_each_ftrace_op(op) {
2187
2188 if (!op->trampoline)
2189 continue;
2190
2191 if (hash_contains_ip(ip, op->func_hash))
2192 return op;
2193 }
2194
2195 return NULL;
2196 }
2197
2198 static struct ftrace_ops *
2199 ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
2200 {
2201 struct ftrace_ops *op;
2202 unsigned long ip = rec->ip;
2203
2204 /*
2205 * Need to check removed ops first.
2206 * If they are being removed, and this rec has a tramp,
2207 * and this rec is in the ops list, then it would be the
2208 * one with the tramp.
2209 */
2210 if (removed_ops) {
2211 if (hash_contains_ip(ip, &removed_ops->old_hash))
2212 return removed_ops;
2213 }
2214
2215 /*
2216 * Need to find the current trampoline for a rec.
2217 * Now, a trampoline is only attached to a rec if there
2218 * was a single 'ops' attached to it. But this can be called
2219 * when we are adding another op to the rec or removing the
2220 * current one. Thus, if the op is being added, we can
2221 * ignore it because it hasn't attached itself to the rec
2222 * yet.
2223 *
2224 * If an ops is being modified (hooking to different functions)
2225 * then we don't care about the new functions that are being
2226 * added, just the old ones (that are probably being removed).
2227 *
2228 * If we are adding an ops to a function that already is using
2229 * a trampoline, it needs to be removed (trampolines are only
2230 * for single ops connected), then an ops that is not being
2231 * modified also needs to be checked.
2232 */
2233 do_for_each_ftrace_op(op, ftrace_ops_list) {
2234
2235 if (!op->trampoline)
2236 continue;
2237
2238 /*
2239 * If the ops is being added, it hasn't gotten to
2240 * the point to be removed from this tree yet.
2241 */
2242 if (op->flags & FTRACE_OPS_FL_ADDING)
2243 continue;
2244
2245
2246 /*
2247 * If the ops is being modified and is in the old
2248 * hash, then it is probably being removed from this
2249 * function.
2250 */
2251 if ((op->flags & FTRACE_OPS_FL_MODIFYING) &&
2252 hash_contains_ip(ip, &op->old_hash))
2253 return op;
2254 /*
2255 * If the ops is not being added or modified, and it's
2256 * in its normal filter hash, then this must be the one
2257 * we want!
2258 */
2259 if (!(op->flags & FTRACE_OPS_FL_MODIFYING) &&
2260 hash_contains_ip(ip, op->func_hash))
2261 return op;
2262
2263 } while_for_each_ftrace_op(op);
2264
2265 return NULL;
2266 }
2267
2268 static struct ftrace_ops *
2269 ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
2270 {
2271 struct ftrace_ops *op;
2272 unsigned long ip = rec->ip;
2273
2274 do_for_each_ftrace_op(op, ftrace_ops_list) {
2275 /* pass rec in as regs to have non-NULL val */
2276 if (hash_contains_ip(ip, op->func_hash))
2277 return op;
2278 } while_for_each_ftrace_op(op);
2279
2280 return NULL;
2281 }
2282
2283 /**
2284 * ftrace_get_addr_new - Get the call address to set to
2285 * @rec: The ftrace record descriptor
2286 *
2287 * If the record has the FTRACE_FL_REGS set, that means that it
2288 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
2289 * is not not set, then it wants to convert to the normal callback.
2290 *
2291 * Returns the address of the trampoline to set to
2292 */
2293 unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
2294 {
2295 struct ftrace_ops *ops;
2296
2297 /* Trampolines take precedence over regs */
2298 if (rec->flags & FTRACE_FL_TRAMP) {
2299 ops = ftrace_find_tramp_ops_new(rec);
2300 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
2301 pr_warn("Bad trampoline accounting at: %p (%pS) (%lx)\n",
2302 (void *)rec->ip, (void *)rec->ip, rec->flags);
2303 /* Ftrace is shutting down, return anything */
2304 return (unsigned long)FTRACE_ADDR;
2305 }
2306 return ops->trampoline;
2307 }
2308
2309 if (rec->flags & FTRACE_FL_REGS)
2310 return (unsigned long)FTRACE_REGS_ADDR;
2311 else
2312 return (unsigned long)FTRACE_ADDR;
2313 }
2314
2315 /**
2316 * ftrace_get_addr_curr - Get the call address that is already there
2317 * @rec: The ftrace record descriptor
2318 *
2319 * The FTRACE_FL_REGS_EN is set when the record already points to
2320 * a function that saves all the regs. Basically the '_EN' version
2321 * represents the current state of the function.
2322 *
2323 * Returns the address of the trampoline that is currently being called
2324 */
2325 unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
2326 {
2327 struct ftrace_ops *ops;
2328
2329 /* Trampolines take precedence over regs */
2330 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2331 ops = ftrace_find_tramp_ops_curr(rec);
2332 if (FTRACE_WARN_ON(!ops)) {
2333 pr_warn("Bad trampoline accounting at: %p (%pS)\n",
2334 (void *)rec->ip, (void *)rec->ip);
2335 /* Ftrace is shutting down, return anything */
2336 return (unsigned long)FTRACE_ADDR;
2337 }
2338 return ops->trampoline;
2339 }
2340
2341 if (rec->flags & FTRACE_FL_REGS_EN)
2342 return (unsigned long)FTRACE_REGS_ADDR;
2343 else
2344 return (unsigned long)FTRACE_ADDR;
2345 }
2346
2347 static int
2348 __ftrace_replace_code(struct dyn_ftrace *rec, int enable)
2349 {
2350 unsigned long ftrace_old_addr;
2351 unsigned long ftrace_addr;
2352 int ret;
2353
2354 ftrace_addr = ftrace_get_addr_new(rec);
2355
2356 /* This needs to be done before we call ftrace_update_record */
2357 ftrace_old_addr = ftrace_get_addr_curr(rec);
2358
2359 ret = ftrace_update_record(rec, enable);
2360
2361 ftrace_bug_type = FTRACE_BUG_UNKNOWN;
2362
2363 switch (ret) {
2364 case FTRACE_UPDATE_IGNORE:
2365 return 0;
2366
2367 case FTRACE_UPDATE_MAKE_CALL:
2368 ftrace_bug_type = FTRACE_BUG_CALL;
2369 return ftrace_make_call(rec, ftrace_addr);
2370
2371 case FTRACE_UPDATE_MAKE_NOP:
2372 ftrace_bug_type = FTRACE_BUG_NOP;
2373 return ftrace_make_nop(NULL, rec, ftrace_old_addr);
2374
2375 case FTRACE_UPDATE_MODIFY_CALL:
2376 ftrace_bug_type = FTRACE_BUG_UPDATE;
2377 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
2378 }
2379
2380 return -1; /* unknow ftrace bug */
2381 }
2382
2383 void __weak ftrace_replace_code(int enable)
2384 {
2385 struct dyn_ftrace *rec;
2386 struct ftrace_page *pg;
2387 int failed;
2388
2389 if (unlikely(ftrace_disabled))
2390 return;
2391
2392 do_for_each_ftrace_rec(pg, rec) {
2393 failed = __ftrace_replace_code(rec, enable);
2394 if (failed) {
2395 ftrace_bug(failed, rec);
2396 /* Stop processing */
2397 return;
2398 }
2399 } while_for_each_ftrace_rec();
2400 }
2401
2402 struct ftrace_rec_iter {
2403 struct ftrace_page *pg;
2404 int index;
2405 };
2406
2407 /**
2408 * ftrace_rec_iter_start, start up iterating over traced functions
2409 *
2410 * Returns an iterator handle that is used to iterate over all
2411 * the records that represent address locations where functions
2412 * are traced.
2413 *
2414 * May return NULL if no records are available.
2415 */
2416 struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2417 {
2418 /*
2419 * We only use a single iterator.
2420 * Protected by the ftrace_lock mutex.
2421 */
2422 static struct ftrace_rec_iter ftrace_rec_iter;
2423 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2424
2425 iter->pg = ftrace_pages_start;
2426 iter->index = 0;
2427
2428 /* Could have empty pages */
2429 while (iter->pg && !iter->pg->index)
2430 iter->pg = iter->pg->next;
2431
2432 if (!iter->pg)
2433 return NULL;
2434
2435 return iter;
2436 }
2437
2438 /**
2439 * ftrace_rec_iter_next, get the next record to process.
2440 * @iter: The handle to the iterator.
2441 *
2442 * Returns the next iterator after the given iterator @iter.
2443 */
2444 struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2445 {
2446 iter->index++;
2447
2448 if (iter->index >= iter->pg->index) {
2449 iter->pg = iter->pg->next;
2450 iter->index = 0;
2451
2452 /* Could have empty pages */
2453 while (iter->pg && !iter->pg->index)
2454 iter->pg = iter->pg->next;
2455 }
2456
2457 if (!iter->pg)
2458 return NULL;
2459
2460 return iter;
2461 }
2462
2463 /**
2464 * ftrace_rec_iter_record, get the record at the iterator location
2465 * @iter: The current iterator location
2466 *
2467 * Returns the record that the current @iter is at.
2468 */
2469 struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2470 {
2471 return &iter->pg->records[iter->index];
2472 }
2473
2474 static int
2475 ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
2476 {
2477 int ret;
2478
2479 if (unlikely(ftrace_disabled))
2480 return 0;
2481
2482 ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
2483 if (ret) {
2484 ftrace_bug_type = FTRACE_BUG_INIT;
2485 ftrace_bug(ret, rec);
2486 return 0;
2487 }
2488 return 1;
2489 }
2490
2491 /*
2492 * archs can override this function if they must do something
2493 * before the modifying code is performed.
2494 */
2495 int __weak ftrace_arch_code_modify_prepare(void)
2496 {
2497 return 0;
2498 }
2499
2500 /*
2501 * archs can override this function if they must do something
2502 * after the modifying code is performed.
2503 */
2504 int __weak ftrace_arch_code_modify_post_process(void)
2505 {
2506 return 0;
2507 }
2508
2509 void ftrace_modify_all_code(int command)
2510 {
2511 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2512 int err = 0;
2513
2514 /*
2515 * If the ftrace_caller calls a ftrace_ops func directly,
2516 * we need to make sure that it only traces functions it
2517 * expects to trace. When doing the switch of functions,
2518 * we need to update to the ftrace_ops_list_func first
2519 * before the transition between old and new calls are set,
2520 * as the ftrace_ops_list_func will check the ops hashes
2521 * to make sure the ops are having the right functions
2522 * traced.
2523 */
2524 if (update) {
2525 err = ftrace_update_ftrace_func(ftrace_ops_list_func);
2526 if (FTRACE_WARN_ON(err))
2527 return;
2528 }
2529
2530 if (command & FTRACE_UPDATE_CALLS)
2531 ftrace_replace_code(1);
2532 else if (command & FTRACE_DISABLE_CALLS)
2533 ftrace_replace_code(0);
2534
2535 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2536 function_trace_op = set_function_trace_op;
2537 smp_wmb();
2538 /* If irqs are disabled, we are in stop machine */
2539 if (!irqs_disabled())
2540 smp_call_function(ftrace_sync_ipi, NULL, 1);
2541 err = ftrace_update_ftrace_func(ftrace_trace_function);
2542 if (FTRACE_WARN_ON(err))
2543 return;
2544 }
2545
2546 if (command & FTRACE_START_FUNC_RET)
2547 err = ftrace_enable_ftrace_graph_caller();
2548 else if (command & FTRACE_STOP_FUNC_RET)
2549 err = ftrace_disable_ftrace_graph_caller();
2550 FTRACE_WARN_ON(err);
2551 }
2552
2553 static int __ftrace_modify_code(void *data)
2554 {
2555 int *command = data;
2556
2557 ftrace_modify_all_code(*command);
2558
2559 return 0;
2560 }
2561
2562 /**
2563 * ftrace_run_stop_machine, go back to the stop machine method
2564 * @command: The command to tell ftrace what to do
2565 *
2566 * If an arch needs to fall back to the stop machine method, the
2567 * it can call this function.
2568 */
2569 void ftrace_run_stop_machine(int command)
2570 {
2571 stop_machine(__ftrace_modify_code, &command, NULL);
2572 }
2573
2574 /**
2575 * arch_ftrace_update_code, modify the code to trace or not trace
2576 * @command: The command that needs to be done
2577 *
2578 * Archs can override this function if it does not need to
2579 * run stop_machine() to modify code.
2580 */
2581 void __weak arch_ftrace_update_code(int command)
2582 {
2583 ftrace_run_stop_machine(command);
2584 }
2585
2586 static void ftrace_run_update_code(int command)
2587 {
2588 int ret;
2589
2590 ret = ftrace_arch_code_modify_prepare();
2591 FTRACE_WARN_ON(ret);
2592 if (ret)
2593 return;
2594
2595 /*
2596 * By default we use stop_machine() to modify the code.
2597 * But archs can do what ever they want as long as it
2598 * is safe. The stop_machine() is the safest, but also
2599 * produces the most overhead.
2600 */
2601 arch_ftrace_update_code(command);
2602
2603 ret = ftrace_arch_code_modify_post_process();
2604 FTRACE_WARN_ON(ret);
2605 }
2606
2607 static void ftrace_run_modify_code(struct ftrace_ops *ops, int command,
2608 struct ftrace_ops_hash *old_hash)
2609 {
2610 ops->flags |= FTRACE_OPS_FL_MODIFYING;
2611 ops->old_hash.filter_hash = old_hash->filter_hash;
2612 ops->old_hash.notrace_hash = old_hash->notrace_hash;
2613 ftrace_run_update_code(command);
2614 ops->old_hash.filter_hash = NULL;
2615 ops->old_hash.notrace_hash = NULL;
2616 ops->flags &= ~FTRACE_OPS_FL_MODIFYING;
2617 }
2618
2619 static ftrace_func_t saved_ftrace_func;
2620 static int ftrace_start_up;
2621
2622 void __weak arch_ftrace_trampoline_free(struct ftrace_ops *ops)
2623 {
2624 }
2625
2626 static void per_cpu_ops_free(struct ftrace_ops *ops)
2627 {
2628 free_percpu(ops->disabled);
2629 }
2630
2631 static void ftrace_startup_enable(int command)
2632 {
2633 if (saved_ftrace_func != ftrace_trace_function) {
2634 saved_ftrace_func = ftrace_trace_function;
2635 command |= FTRACE_UPDATE_TRACE_FUNC;
2636 }
2637
2638 if (!command || !ftrace_enabled)
2639 return;
2640
2641 ftrace_run_update_code(command);
2642 }
2643
2644 static void ftrace_startup_all(int command)
2645 {
2646 update_all_ops = true;
2647 ftrace_startup_enable(command);
2648 update_all_ops = false;
2649 }
2650
2651 static int ftrace_startup(struct ftrace_ops *ops, int command)
2652 {
2653 int ret;
2654
2655 if (unlikely(ftrace_disabled))
2656 return -ENODEV;
2657
2658 ret = __register_ftrace_function(ops);
2659 if (ret)
2660 return ret;
2661
2662 ftrace_start_up++;
2663
2664 /*
2665 * Note that ftrace probes uses this to start up
2666 * and modify functions it will probe. But we still
2667 * set the ADDING flag for modification, as probes
2668 * do not have trampolines. If they add them in the
2669 * future, then the probes will need to distinguish
2670 * between adding and updating probes.
2671 */
2672 ops->flags |= FTRACE_OPS_FL_ENABLED | FTRACE_OPS_FL_ADDING;
2673
2674 ret = ftrace_hash_ipmodify_enable(ops);
2675 if (ret < 0) {
2676 /* Rollback registration process */
2677 __unregister_ftrace_function(ops);
2678 ftrace_start_up--;
2679 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2680 return ret;
2681 }
2682
2683 if (ftrace_hash_rec_enable(ops, 1))
2684 command |= FTRACE_UPDATE_CALLS;
2685
2686 ftrace_startup_enable(command);
2687
2688 ops->flags &= ~FTRACE_OPS_FL_ADDING;
2689
2690 return 0;
2691 }
2692
2693 static int ftrace_shutdown(struct ftrace_ops *ops, int command)
2694 {
2695 int ret;
2696
2697 if (unlikely(ftrace_disabled))
2698 return -ENODEV;
2699
2700 ret = __unregister_ftrace_function(ops);
2701 if (ret)
2702 return ret;
2703
2704 ftrace_start_up--;
2705 /*
2706 * Just warn in case of unbalance, no need to kill ftrace, it's not
2707 * critical but the ftrace_call callers may be never nopped again after
2708 * further ftrace uses.
2709 */
2710 WARN_ON_ONCE(ftrace_start_up < 0);
2711
2712 /* Disabling ipmodify never fails */
2713 ftrace_hash_ipmodify_disable(ops);
2714
2715 if (ftrace_hash_rec_disable(ops, 1))
2716 command |= FTRACE_UPDATE_CALLS;
2717
2718 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2719
2720 if (saved_ftrace_func != ftrace_trace_function) {
2721 saved_ftrace_func = ftrace_trace_function;
2722 command |= FTRACE_UPDATE_TRACE_FUNC;
2723 }
2724
2725 if (!command || !ftrace_enabled) {
2726 /*
2727 * If these are per_cpu ops, they still need their
2728 * per_cpu field freed. Since, function tracing is
2729 * not currently active, we can just free them
2730 * without synchronizing all CPUs.
2731 */
2732 if (ops->flags & FTRACE_OPS_FL_PER_CPU)
2733 per_cpu_ops_free(ops);
2734 return 0;
2735 }
2736
2737 /*
2738 * If the ops uses a trampoline, then it needs to be
2739 * tested first on update.
2740 */
2741 ops->flags |= FTRACE_OPS_FL_REMOVING;
2742 removed_ops = ops;
2743
2744 /* The trampoline logic checks the old hashes */
2745 ops->old_hash.filter_hash = ops->func_hash->filter_hash;
2746 ops->old_hash.notrace_hash = ops->func_hash->notrace_hash;
2747
2748 ftrace_run_update_code(command);
2749
2750 /*
2751 * If there's no more ops registered with ftrace, run a
2752 * sanity check to make sure all rec flags are cleared.
2753 */
2754 if (ftrace_ops_list == &ftrace_list_end) {
2755 struct ftrace_page *pg;
2756 struct dyn_ftrace *rec;
2757
2758 do_for_each_ftrace_rec(pg, rec) {
2759 if (FTRACE_WARN_ON_ONCE(rec->flags))
2760 pr_warn(" %pS flags:%lx\n",
2761 (void *)rec->ip, rec->flags);
2762 } while_for_each_ftrace_rec();
2763 }
2764
2765 ops->old_hash.filter_hash = NULL;
2766 ops->old_hash.notrace_hash = NULL;
2767
2768 removed_ops = NULL;
2769 ops->flags &= ~FTRACE_OPS_FL_REMOVING;
2770
2771 /*
2772 * Dynamic ops may be freed, we must make sure that all
2773 * callers are done before leaving this function.
2774 * The same goes for freeing the per_cpu data of the per_cpu
2775 * ops.
2776 *
2777 * Again, normal synchronize_sched() is not good enough.
2778 * We need to do a hard force of sched synchronization.
2779 * This is because we use preempt_disable() to do RCU, but
2780 * the function tracers can be called where RCU is not watching
2781 * (like before user_exit()). We can not rely on the RCU
2782 * infrastructure to do the synchronization, thus we must do it
2783 * ourselves.
2784 */
2785 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_PER_CPU)) {
2786 schedule_on_each_cpu(ftrace_sync);
2787
2788 arch_ftrace_trampoline_free(ops);
2789
2790 if (ops->flags & FTRACE_OPS_FL_PER_CPU)
2791 per_cpu_ops_free(ops);
2792 }
2793
2794 return 0;
2795 }
2796
2797 static void ftrace_startup_sysctl(void)
2798 {
2799 int command;
2800
2801 if (unlikely(ftrace_disabled))
2802 return;
2803
2804 /* Force update next time */
2805 saved_ftrace_func = NULL;
2806 /* ftrace_start_up is true if we want ftrace running */
2807 if (ftrace_start_up) {
2808 command = FTRACE_UPDATE_CALLS;
2809 if (ftrace_graph_active)
2810 command |= FTRACE_START_FUNC_RET;
2811 ftrace_startup_enable(command);
2812 }
2813 }
2814
2815 static void ftrace_shutdown_sysctl(void)
2816 {
2817 int command;
2818
2819 if (unlikely(ftrace_disabled))
2820 return;
2821
2822 /* ftrace_start_up is true if ftrace is running */
2823 if (ftrace_start_up) {
2824 command = FTRACE_DISABLE_CALLS;
2825 if (ftrace_graph_active)
2826 command |= FTRACE_STOP_FUNC_RET;
2827 ftrace_run_update_code(command);
2828 }
2829 }
2830
2831 static cycle_t ftrace_update_time;
2832 unsigned long ftrace_update_tot_cnt;
2833
2834 static inline int ops_traces_mod(struct ftrace_ops *ops)
2835 {
2836 /*
2837 * Filter_hash being empty will default to trace module.
2838 * But notrace hash requires a test of individual module functions.
2839 */
2840 return ftrace_hash_empty(ops->func_hash->filter_hash) &&
2841 ftrace_hash_empty(ops->func_hash->notrace_hash);
2842 }
2843
2844 /*
2845 * Check if the current ops references the record.
2846 *
2847 * If the ops traces all functions, then it was already accounted for.
2848 * If the ops does not trace the current record function, skip it.
2849 * If the ops ignores the function via notrace filter, skip it.
2850 */
2851 static inline bool
2852 ops_references_rec(struct ftrace_ops *ops, struct dyn_ftrace *rec)
2853 {
2854 /* If ops isn't enabled, ignore it */
2855 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
2856 return 0;
2857
2858 /* If ops traces all then it includes this function */
2859 if (ops_traces_mod(ops))
2860 return 1;
2861
2862 /* The function must be in the filter */
2863 if (!ftrace_hash_empty(ops->func_hash->filter_hash) &&
2864 !ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))
2865 return 0;
2866
2867 /* If in notrace hash, we ignore it too */
2868 if (ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip))
2869 return 0;
2870
2871 return 1;
2872 }
2873
2874 static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
2875 {
2876 struct ftrace_page *pg;
2877 struct dyn_ftrace *p;
2878 cycle_t start, stop;
2879 unsigned long update_cnt = 0;
2880 unsigned long rec_flags = 0;
2881 int i;
2882
2883 start = ftrace_now(raw_smp_processor_id());
2884
2885 /*
2886 * When a module is loaded, this function is called to convert
2887 * the calls to mcount in its text to nops, and also to create
2888 * an entry in the ftrace data. Now, if ftrace is activated
2889 * after this call, but before the module sets its text to
2890 * read-only, the modification of enabling ftrace can fail if
2891 * the read-only is done while ftrace is converting the calls.
2892 * To prevent this, the module's records are set as disabled
2893 * and will be enabled after the call to set the module's text
2894 * to read-only.
2895 */
2896 if (mod)
2897 rec_flags |= FTRACE_FL_DISABLED;
2898
2899 for (pg = new_pgs; pg; pg = pg->next) {
2900
2901 for (i = 0; i < pg->index; i++) {
2902
2903 /* If something went wrong, bail without enabling anything */
2904 if (unlikely(ftrace_disabled))
2905 return -1;
2906
2907 p = &pg->records[i];
2908 p->flags = rec_flags;
2909
2910 /*
2911 * Do the initial record conversion from mcount jump
2912 * to the NOP instructions.
2913 */
2914 if (!ftrace_code_disable(mod, p))
2915 break;
2916
2917 update_cnt++;
2918 }
2919 }
2920
2921 stop = ftrace_now(raw_smp_processor_id());
2922 ftrace_update_time = stop - start;
2923 ftrace_update_tot_cnt += update_cnt;
2924
2925 return 0;
2926 }
2927
2928 static int ftrace_allocate_records(struct ftrace_page *pg, int count)
2929 {
2930 int order;
2931 int cnt;
2932
2933 if (WARN_ON(!count))
2934 return -EINVAL;
2935
2936 order = get_count_order(DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
2937
2938 /*
2939 * We want to fill as much as possible. No more than a page
2940 * may be empty.
2941 */
2942 while ((PAGE_SIZE << order) / ENTRY_SIZE >= count + ENTRIES_PER_PAGE)
2943 order--;
2944
2945 again:
2946 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
2947
2948 if (!pg->records) {
2949 /* if we can't allocate this size, try something smaller */
2950 if (!order)
2951 return -ENOMEM;
2952 order >>= 1;
2953 goto again;
2954 }
2955
2956 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
2957 pg->size = cnt;
2958
2959 if (cnt > count)
2960 cnt = count;
2961
2962 return cnt;
2963 }
2964
2965 static struct ftrace_page *
2966 ftrace_allocate_pages(unsigned long num_to_init)
2967 {
2968 struct ftrace_page *start_pg;
2969 struct ftrace_page *pg;
2970 int order;
2971 int cnt;
2972
2973 if (!num_to_init)
2974 return 0;
2975
2976 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
2977 if (!pg)
2978 return NULL;
2979
2980 /*
2981 * Try to allocate as much as possible in one continues
2982 * location that fills in all of the space. We want to
2983 * waste as little space as possible.
2984 */
2985 for (;;) {
2986 cnt = ftrace_allocate_records(pg, num_to_init);
2987 if (cnt < 0)
2988 goto free_pages;
2989
2990 num_to_init -= cnt;
2991 if (!num_to_init)
2992 break;
2993
2994 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
2995 if (!pg->next)
2996 goto free_pages;
2997
2998 pg = pg->next;
2999 }
3000
3001 return start_pg;
3002
3003 free_pages:
3004 pg = start_pg;
3005 while (pg) {
3006 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
3007 free_pages((unsigned long)pg->records, order);
3008 start_pg = pg->next;
3009 kfree(pg);
3010 pg = start_pg;
3011 }
3012 pr_info("ftrace: FAILED to allocate memory for functions\n");
3013 return NULL;
3014 }
3015
3016 #define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
3017
3018 struct ftrace_iterator {
3019 loff_t pos;
3020 loff_t func_pos;
3021 struct ftrace_page *pg;
3022 struct dyn_ftrace *func;
3023 struct ftrace_func_probe *probe;
3024 struct trace_parser parser;
3025 struct ftrace_hash *hash;
3026 struct ftrace_ops *ops;
3027 int hidx;
3028 int idx;
3029 unsigned flags;
3030 };
3031
3032 static void *
3033 t_hash_next(struct seq_file *m, loff_t *pos)
3034 {
3035 struct ftrace_iterator *iter = m->private;
3036 struct hlist_node *hnd = NULL;
3037 struct hlist_head *hhd;
3038
3039 (*pos)++;
3040 iter->pos = *pos;
3041
3042 if (iter->probe)
3043 hnd = &iter->probe->node;
3044 retry:
3045 if (iter->hidx >= FTRACE_FUNC_HASHSIZE)
3046 return NULL;
3047
3048 hhd = &ftrace_func_hash[iter->hidx];
3049
3050 if (hlist_empty(hhd)) {
3051 iter->hidx++;
3052 hnd = NULL;
3053 goto retry;
3054 }
3055
3056 if (!hnd)
3057 hnd = hhd->first;
3058 else {
3059 hnd = hnd->next;
3060 if (!hnd) {
3061 iter->hidx++;
3062 goto retry;
3063 }
3064 }
3065
3066 if (WARN_ON_ONCE(!hnd))
3067 return NULL;
3068
3069 iter->probe = hlist_entry(hnd, struct ftrace_func_probe, node);
3070
3071 return iter;
3072 }
3073
3074 static void *t_hash_start(struct seq_file *m, loff_t *pos)
3075 {
3076 struct ftrace_iterator *iter = m->private;
3077 void *p = NULL;
3078 loff_t l;
3079
3080 if (!(iter->flags & FTRACE_ITER_DO_HASH))
3081 return NULL;
3082
3083 if (iter->func_pos > *pos)
3084 return NULL;
3085
3086 iter->hidx = 0;
3087 for (l = 0; l <= (*pos - iter->func_pos); ) {
3088 p = t_hash_next(m, &l);
3089 if (!p)
3090 break;
3091 }
3092 if (!p)
3093 return NULL;
3094
3095 /* Only set this if we have an item */
3096 iter->flags |= FTRACE_ITER_HASH;
3097
3098 return iter;
3099 }
3100
3101 static int
3102 t_hash_show(struct seq_file *m, struct ftrace_iterator *iter)
3103 {
3104 struct ftrace_func_probe *rec;
3105
3106 rec = iter->probe;
3107 if (WARN_ON_ONCE(!rec))
3108 return -EIO;
3109
3110 if (rec->ops->print)
3111 return rec->ops->print(m, rec->ip, rec->ops, rec->data);
3112
3113 seq_printf(m, "%ps:%ps", (void *)rec->ip, (void *)rec->ops->func);
3114
3115 if (rec->data)
3116 seq_printf(m, ":%p", rec->data);
3117 seq_putc(m, '\n');
3118
3119 return 0;
3120 }
3121
3122 static void *
3123 t_next(struct seq_file *m, void *v, loff_t *pos)
3124 {
3125 struct ftrace_iterator *iter = m->private;
3126 struct ftrace_ops *ops = iter->ops;
3127 struct dyn_ftrace *rec = NULL;
3128
3129 if (unlikely(ftrace_disabled))
3130 return NULL;
3131
3132 if (iter->flags & FTRACE_ITER_HASH)
3133 return t_hash_next(m, pos);
3134
3135 (*pos)++;
3136 iter->pos = iter->func_pos = *pos;
3137
3138 if (iter->flags & FTRACE_ITER_PRINTALL)
3139 return t_hash_start(m, pos);
3140
3141 retry:
3142 if (iter->idx >= iter->pg->index) {
3143 if (iter->pg->next) {
3144 iter->pg = iter->pg->next;
3145 iter->idx = 0;
3146 goto retry;
3147 }
3148 } else {
3149 rec = &iter->pg->records[iter->idx++];
3150 if (((iter->flags & FTRACE_ITER_FILTER) &&
3151 !(ftrace_lookup_ip(ops->func_hash->filter_hash, rec->ip))) ||
3152
3153 ((iter->flags & FTRACE_ITER_NOTRACE) &&
3154 !ftrace_lookup_ip(ops->func_hash->notrace_hash, rec->ip)) ||
3155
3156 ((iter->flags & FTRACE_ITER_ENABLED) &&
3157 !(rec->flags & FTRACE_FL_ENABLED))) {
3158
3159 rec = NULL;
3160 goto retry;
3161 }
3162 }
3163
3164 if (!rec)
3165 return t_hash_start(m, pos);
3166
3167 iter->func = rec;
3168
3169 return iter;
3170 }
3171
3172 static void reset_iter_read(struct ftrace_iterator *iter)
3173 {
3174 iter->pos = 0;
3175 iter->func_pos = 0;
3176 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_HASH);
3177 }
3178
3179 static void *t_start(struct seq_file *m, loff_t *pos)
3180 {
3181 struct ftrace_iterator *iter = m->private;
3182 struct ftrace_ops *ops = iter->ops;
3183 void *p = NULL;
3184 loff_t l;
3185
3186 mutex_lock(&ftrace_lock);
3187
3188 if (unlikely(ftrace_disabled))
3189 return NULL;
3190
3191 /*
3192 * If an lseek was done, then reset and start from beginning.
3193 */
3194 if (*pos < iter->pos)
3195 reset_iter_read(iter);
3196
3197 /*
3198 * For set_ftrace_filter reading, if we have the filter
3199 * off, we can short cut and just print out that all
3200 * functions are enabled.
3201 */
3202 if ((iter->flags & FTRACE_ITER_FILTER &&
3203 ftrace_hash_empty(ops->func_hash->filter_hash)) ||
3204 (iter->flags & FTRACE_ITER_NOTRACE &&
3205 ftrace_hash_empty(ops->func_hash->notrace_hash))) {
3206 if (*pos > 0)
3207 return t_hash_start(m, pos);
3208 iter->flags |= FTRACE_ITER_PRINTALL;
3209 /* reset in case of seek/pread */
3210 iter->flags &= ~FTRACE_ITER_HASH;
3211 return iter;
3212 }
3213
3214 if (iter->flags & FTRACE_ITER_HASH)
3215 return t_hash_start(m, pos);
3216
3217 /*
3218 * Unfortunately, we need to restart at ftrace_pages_start
3219 * every time we let go of the ftrace_mutex. This is because
3220 * those pointers can change without the lock.
3221 */
3222 iter->pg = ftrace_pages_start;
3223 iter->idx = 0;
3224 for (l = 0; l <= *pos; ) {
3225 p = t_next(m, p, &l);
3226 if (!p)
3227 break;
3228 }
3229
3230 if (!p)
3231 return t_hash_start(m, pos);
3232
3233 return iter;
3234 }
3235
3236 static void t_stop(struct seq_file *m, void *p)
3237 {
3238 mutex_unlock(&ftrace_lock);
3239 }
3240
3241 void * __weak
3242 arch_ftrace_trampoline_func(struct ftrace_ops *ops, struct dyn_ftrace *rec)
3243 {
3244 return NULL;
3245 }
3246
3247 static void add_trampoline_func(struct seq_file *m, struct ftrace_ops *ops,
3248 struct dyn_ftrace *rec)
3249 {
3250 void *ptr;
3251
3252 ptr = arch_ftrace_trampoline_func(ops, rec);
3253 if (ptr)
3254 seq_printf(m, " ->%pS", ptr);
3255 }
3256
3257 static int t_show(struct seq_file *m, void *v)
3258 {
3259 struct ftrace_iterator *iter = m->private;
3260 struct dyn_ftrace *rec;
3261
3262 if (iter->flags & FTRACE_ITER_HASH)
3263 return t_hash_show(m, iter);
3264
3265 if (iter->flags & FTRACE_ITER_PRINTALL) {
3266 if (iter->flags & FTRACE_ITER_NOTRACE)
3267 seq_puts(m, "#### no functions disabled ####\n");
3268 else
3269 seq_puts(m, "#### all functions enabled ####\n");
3270 return 0;
3271 }
3272
3273 rec = iter->func;
3274
3275 if (!rec)
3276 return 0;
3277
3278 seq_printf(m, "%ps", (void *)rec->ip);
3279 if (iter->flags & FTRACE_ITER_ENABLED) {
3280 struct ftrace_ops *ops;
3281
3282 seq_printf(m, " (%ld)%s%s",
3283 ftrace_rec_count(rec),
3284 rec->flags & FTRACE_FL_REGS ? " R" : " ",
3285 rec->flags & FTRACE_FL_IPMODIFY ? " I" : " ");
3286 if (rec->flags & FTRACE_FL_TRAMP_EN) {
3287 ops = ftrace_find_tramp_ops_any(rec);
3288 if (ops) {
3289 do {
3290 seq_printf(m, "\ttramp: %pS (%pS)",
3291 (void *)ops->trampoline,
3292 (void *)ops->func);
3293 add_trampoline_func(m, ops, rec);
3294 ops = ftrace_find_tramp_ops_next(rec, ops);
3295 } while (ops);
3296 } else
3297 seq_puts(m, "\ttramp: ERROR!");
3298 } else {
3299 add_trampoline_func(m, NULL, rec);
3300 }
3301 }
3302
3303 seq_putc(m, '\n');
3304
3305 return 0;
3306 }
3307
3308 static const struct seq_operations show_ftrace_seq_ops = {
3309 .start = t_start,
3310 .next = t_next,
3311 .stop = t_stop,
3312 .show = t_show,
3313 };
3314
3315 static int
3316 ftrace_avail_open(struct inode *inode, struct file *file)
3317 {
3318 struct ftrace_iterator *iter;
3319
3320 if (unlikely(ftrace_disabled))
3321 return -ENODEV;
3322
3323 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3324 if (iter) {
3325 iter->pg = ftrace_pages_start;
3326 iter->ops = &global_ops;
3327 }
3328
3329 return iter ? 0 : -ENOMEM;
3330 }
3331
3332 static int
3333 ftrace_enabled_open(struct inode *inode, struct file *file)
3334 {
3335 struct ftrace_iterator *iter;
3336
3337 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
3338 if (iter) {
3339 iter->pg = ftrace_pages_start;
3340 iter->flags = FTRACE_ITER_ENABLED;
3341 iter->ops = &global_ops;
3342 }
3343
3344 return iter ? 0 : -ENOMEM;
3345 }
3346
3347 /**
3348 * ftrace_regex_open - initialize function tracer filter files
3349 * @ops: The ftrace_ops that hold the hash filters
3350 * @flag: The type of filter to process
3351 * @inode: The inode, usually passed in to your open routine
3352 * @file: The file, usually passed in to your open routine
3353 *
3354 * ftrace_regex_open() initializes the filter files for the
3355 * @ops. Depending on @flag it may process the filter hash or
3356 * the notrace hash of @ops. With this called from the open
3357 * routine, you can use ftrace_filter_write() for the write
3358 * routine if @flag has FTRACE_ITER_FILTER set, or
3359 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
3360 * tracing_lseek() should be used as the lseek routine, and
3361 * release must call ftrace_regex_release().
3362 */
3363 int
3364 ftrace_regex_open(struct ftrace_ops *ops, int flag,
3365 struct inode *inode, struct file *file)
3366 {
3367 struct ftrace_iterator *iter;
3368 struct ftrace_hash *hash;
3369 int ret = 0;
3370
3371 ftrace_ops_init(ops);
3372
3373 if (unlikely(ftrace_disabled))
3374 return -ENODEV;
3375
3376 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
3377 if (!iter)
3378 return -ENOMEM;
3379
3380 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
3381 kfree(iter);
3382 return -ENOMEM;
3383 }
3384
3385 iter->ops = ops;
3386 iter->flags = flag;
3387
3388 mutex_lock(&ops->func_hash->regex_lock);
3389
3390 if (flag & FTRACE_ITER_NOTRACE)
3391 hash = ops->func_hash->notrace_hash;
3392 else
3393 hash = ops->func_hash->filter_hash;
3394
3395 if (file->f_mode & FMODE_WRITE) {
3396 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3397
3398 if (file->f_flags & O_TRUNC)
3399 iter->hash = alloc_ftrace_hash(size_bits);
3400 else
3401 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3402
3403 if (!iter->hash) {
3404 trace_parser_put(&iter->parser);
3405 kfree(iter);
3406 ret = -ENOMEM;
3407 goto out_unlock;
3408 }
3409 }
3410
3411 if (file->f_mode & FMODE_READ) {
3412 iter->pg = ftrace_pages_start;
3413
3414 ret = seq_open(file, &show_ftrace_seq_ops);
3415 if (!ret) {
3416 struct seq_file *m = file->private_data;
3417 m->private = iter;
3418 } else {
3419 /* Failed */
3420 free_ftrace_hash(iter->hash);
3421 trace_parser_put(&iter->parser);
3422 kfree(iter);
3423 }
3424 } else
3425 file->private_data = iter;
3426
3427 out_unlock:
3428 mutex_unlock(&ops->func_hash->regex_lock);
3429
3430 return ret;
3431 }
3432
3433 static int
3434 ftrace_filter_open(struct inode *inode, struct file *file)
3435 {
3436 struct ftrace_ops *ops = inode->i_private;
3437
3438 return ftrace_regex_open(ops,
3439 FTRACE_ITER_FILTER | FTRACE_ITER_DO_HASH,
3440 inode, file);
3441 }
3442
3443 static int
3444 ftrace_notrace_open(struct inode *inode, struct file *file)
3445 {
3446 struct ftrace_ops *ops = inode->i_private;
3447
3448 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3449 inode, file);
3450 }
3451
3452 /* Type for quick search ftrace basic regexes (globs) from filter_parse_regex */
3453 struct ftrace_glob {
3454 char *search;
3455 unsigned len;
3456 int type;
3457 };
3458
3459 /*
3460 * If symbols in an architecture don't correspond exactly to the user-visible
3461 * name of what they represent, it is possible to define this function to
3462 * perform the necessary adjustments.
3463 */
3464 char * __weak arch_ftrace_match_adjust(char *str, const char *search)
3465 {
3466 return str;
3467 }
3468
3469 static int ftrace_match(char *str, struct ftrace_glob *g)
3470 {
3471 int matched = 0;
3472 int slen;
3473
3474 str = arch_ftrace_match_adjust(str, g->search);
3475
3476 switch (g->type) {
3477 case MATCH_FULL:
3478 if (strcmp(str, g->search) == 0)
3479 matched = 1;
3480 break;
3481 case MATCH_FRONT_ONLY:
3482 if (strncmp(str, g->search, g->len) == 0)
3483 matched = 1;
3484 break;
3485 case MATCH_MIDDLE_ONLY:
3486 if (strstr(str, g->search))
3487 matched = 1;
3488 break;
3489 case MATCH_END_ONLY:
3490 slen = strlen(str);
3491 if (slen >= g->len &&
3492 memcmp(str + slen - g->len, g->search, g->len) == 0)
3493 matched = 1;
3494 break;
3495 }
3496
3497 return matched;
3498 }
3499
3500 static int
3501 enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter)
3502 {
3503 struct ftrace_func_entry *entry;
3504 int ret = 0;
3505
3506 entry = ftrace_lookup_ip(hash, rec->ip);
3507 if (clear_filter) {
3508 /* Do nothing if it doesn't exist */
3509 if (!entry)
3510 return 0;
3511
3512 free_hash_entry(hash, entry);
3513 } else {
3514 /* Do nothing if it exists */
3515 if (entry)
3516 return 0;
3517
3518 ret = add_hash_entry(hash, rec->ip);
3519 }
3520 return ret;
3521 }
3522
3523 static int
3524 ftrace_match_record(struct dyn_ftrace *rec, struct ftrace_glob *func_g,
3525 struct ftrace_glob *mod_g, int exclude_mod)
3526 {
3527 char str[KSYM_SYMBOL_LEN];
3528 char *modname;
3529
3530 kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);
3531
3532 if (mod_g) {
3533 int mod_matches = (modname) ? ftrace_match(modname, mod_g) : 0;
3534
3535 /* blank module name to match all modules */
3536 if (!mod_g->len) {
3537 /* blank module globbing: modname xor exclude_mod */
3538 if ((!exclude_mod) != (!modname))
3539 goto func_match;
3540 return 0;
3541 }
3542
3543 /* not matching the module */
3544 if (!modname || !mod_matches) {
3545 if (exclude_mod)
3546 goto func_match;
3547 else
3548 return 0;
3549 }
3550
3551 if (mod_matches && exclude_mod)
3552 return 0;
3553
3554 func_match:
3555 /* blank search means to match all funcs in the mod */
3556 if (!func_g->len)
3557 return 1;
3558 }
3559
3560 return ftrace_match(str, func_g);
3561 }
3562
3563 static int
3564 match_records(struct ftrace_hash *hash, char *func, int len, char *mod)
3565 {
3566 struct ftrace_page *pg;
3567 struct dyn_ftrace *rec;
3568 struct ftrace_glob func_g = { .type = MATCH_FULL };
3569 struct ftrace_glob mod_g = { .type = MATCH_FULL };
3570 struct ftrace_glob *mod_match = (mod) ? &mod_g : NULL;
3571 int exclude_mod = 0;
3572 int found = 0;
3573 int ret;
3574 int clear_filter;
3575
3576 if (func) {
3577 func_g.type = filter_parse_regex(func, len, &func_g.search,
3578 &clear_filter);
3579 func_g.len = strlen(func_g.search);
3580 }
3581
3582 if (mod) {
3583 mod_g.type = filter_parse_regex(mod, strlen(mod),
3584 &mod_g.search, &exclude_mod);
3585 mod_g.len = strlen(mod_g.search);
3586 }
3587
3588 mutex_lock(&ftrace_lock);
3589
3590 if (unlikely(ftrace_disabled))
3591 goto out_unlock;
3592
3593 do_for_each_ftrace_rec(pg, rec) {
3594 if (ftrace_match_record(rec, &func_g, mod_match, exclude_mod)) {
3595 ret = enter_record(hash, rec, clear_filter);
3596 if (ret < 0) {
3597 found = ret;
3598 goto out_unlock;
3599 }
3600 found = 1;
3601 }
3602 } while_for_each_ftrace_rec();
3603 out_unlock:
3604 mutex_unlock(&ftrace_lock);
3605
3606 return found;
3607 }
3608
3609 static int
3610 ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
3611 {
3612 return match_records(hash, buff, len, NULL);
3613 }
3614
3615
3616 /*
3617 * We register the module command as a template to show others how
3618 * to register the a command as well.
3619 */
3620
3621 static int
3622 ftrace_mod_callback(struct ftrace_hash *hash,
3623 char *func, char *cmd, char *module, int enable)
3624 {
3625 int ret;
3626
3627 /*
3628 * cmd == 'mod' because we only registered this func
3629 * for the 'mod' ftrace_func_command.
3630 * But if you register one func with multiple commands,
3631 * you can tell which command was used by the cmd
3632 * parameter.
3633 */
3634 ret = match_records(hash, func, strlen(func), module);
3635 if (!ret)
3636 return -EINVAL;
3637 if (ret < 0)
3638 return ret;
3639 return 0;
3640 }
3641
3642 static struct ftrace_func_command ftrace_mod_cmd = {
3643 .name = "mod",
3644 .func = ftrace_mod_callback,
3645 };
3646
3647 static int __init ftrace_mod_cmd_init(void)
3648 {
3649 return register_ftrace_command(&ftrace_mod_cmd);
3650 }
3651 core_initcall(ftrace_mod_cmd_init);
3652
3653 static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
3654 struct ftrace_ops *op, struct pt_regs *pt_regs)
3655 {
3656 struct ftrace_func_probe *entry;
3657 struct hlist_head *hhd;
3658 unsigned long key;
3659
3660 key = hash_long(ip, FTRACE_HASH_BITS);
3661
3662 hhd = &ftrace_func_hash[key];
3663
3664 if (hlist_empty(hhd))
3665 return;
3666
3667 /*
3668 * Disable preemption for these calls to prevent a RCU grace
3669 * period. This syncs the hash iteration and freeing of items
3670 * on the hash. rcu_read_lock is too dangerous here.
3671 */
3672 preempt_disable_notrace();
3673 hlist_for_each_entry_rcu_notrace(entry, hhd, node) {
3674 if (entry->ip == ip)
3675 entry->ops->func(ip, parent_ip, &entry->data);
3676 }
3677 preempt_enable_notrace();
3678 }
3679
3680 static struct ftrace_ops trace_probe_ops __read_mostly =
3681 {
3682 .func = function_trace_probe_call,
3683 .flags = FTRACE_OPS_FL_INITIALIZED,
3684 INIT_OPS_HASH(trace_probe_ops)
3685 };
3686
3687 static int ftrace_probe_registered;
3688
3689 static void __enable_ftrace_function_probe(struct ftrace_ops_hash *old_hash)
3690 {
3691 int ret;
3692 int i;
3693
3694 if (ftrace_probe_registered) {
3695 /* still need to update the function call sites */
3696 if (ftrace_enabled)
3697 ftrace_run_modify_code(&trace_probe_ops, FTRACE_UPDATE_CALLS,
3698 old_hash);
3699 return;
3700 }
3701
3702 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3703 struct hlist_head *hhd = &ftrace_func_hash[i];
3704 if (hhd->first)
3705 break;
3706 }
3707 /* Nothing registered? */
3708 if (i == FTRACE_FUNC_HASHSIZE)
3709 return;
3710
3711 ret = ftrace_startup(&trace_probe_ops, 0);
3712
3713 ftrace_probe_registered = 1;
3714 }
3715
3716 static void __disable_ftrace_function_probe(void)
3717 {
3718 int i;
3719
3720 if (!ftrace_probe_registered)
3721 return;
3722
3723 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3724 struct hlist_head *hhd = &ftrace_func_hash[i];
3725 if (hhd->first)
3726 return;
3727 }
3728
3729 /* no more funcs left */
3730 ftrace_shutdown(&trace_probe_ops, 0);
3731
3732 ftrace_probe_registered = 0;
3733 }
3734
3735
3736 static void ftrace_free_entry(struct ftrace_func_probe *entry)
3737 {
3738 if (entry->ops->free)
3739 entry->ops->free(entry->ops, entry->ip, &entry->data);
3740 kfree(entry);
3741 }
3742
3743 int
3744 register_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3745 void *data)
3746 {
3747 struct ftrace_ops_hash old_hash_ops;
3748 struct ftrace_func_probe *entry;
3749 struct ftrace_glob func_g;
3750 struct ftrace_hash **orig_hash = &trace_probe_ops.func_hash->filter_hash;
3751 struct ftrace_hash *old_hash = *orig_hash;
3752 struct ftrace_hash *hash;
3753 struct ftrace_page *pg;
3754 struct dyn_ftrace *rec;
3755 int not;
3756 unsigned long key;
3757 int count = 0;
3758 int ret;
3759
3760 func_g.type = filter_parse_regex(glob, strlen(glob),
3761 &func_g.search, &not);
3762 func_g.len = strlen(func_g.search);
3763
3764 /* we do not support '!' for function probes */
3765 if (WARN_ON(not))
3766 return -EINVAL;
3767
3768 mutex_lock(&trace_probe_ops.func_hash->regex_lock);
3769
3770 old_hash_ops.filter_hash = old_hash;
3771 /* Probes only have filters */
3772 old_hash_ops.notrace_hash = NULL;
3773
3774 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, old_hash);
3775 if (!hash) {
3776 count = -ENOMEM;
3777 goto out;
3778 }
3779
3780 if (unlikely(ftrace_disabled)) {
3781 count = -ENODEV;
3782 goto out;
3783 }
3784
3785 mutex_lock(&ftrace_lock);
3786
3787 do_for_each_ftrace_rec(pg, rec) {
3788
3789 if (!ftrace_match_record(rec, &func_g, NULL, 0))
3790 continue;
3791
3792 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
3793 if (!entry) {
3794 /* If we did not process any, then return error */
3795 if (!count)
3796 count = -ENOMEM;
3797 goto out_unlock;
3798 }
3799
3800 count++;
3801
3802 entry->data = data;
3803
3804 /*
3805 * The caller might want to do something special
3806 * for each function we find. We call the callback
3807 * to give the caller an opportunity to do so.
3808 */
3809 if (ops->init) {
3810 if (ops->init(ops, rec->ip, &entry->data) < 0) {
3811 /* caller does not like this func */
3812 kfree(entry);
3813 continue;
3814 }
3815 }
3816
3817 ret = enter_record(hash, rec, 0);
3818 if (ret < 0) {
3819 kfree(entry);
3820 count = ret;
3821 goto out_unlock;
3822 }
3823
3824 entry->ops = ops;
3825 entry->ip = rec->ip;
3826
3827 key = hash_long(entry->ip, FTRACE_HASH_BITS);
3828 hlist_add_head_rcu(&entry->node, &ftrace_func_hash[key]);
3829
3830 } while_for_each_ftrace_rec();
3831
3832 ret = ftrace_hash_move(&trace_probe_ops, 1, orig_hash, hash);
3833
3834 __enable_ftrace_function_probe(&old_hash_ops);
3835
3836 if (!ret)
3837 free_ftrace_hash_rcu(old_hash);
3838 else
3839 count = ret;
3840
3841 out_unlock:
3842 mutex_unlock(&ftrace_lock);
3843 out:
3844 mutex_unlock(&trace_probe_ops.func_hash->regex_lock);
3845 free_ftrace_hash(hash);
3846
3847 return count;
3848 }
3849
3850 enum {
3851 PROBE_TEST_FUNC = 1,
3852 PROBE_TEST_DATA = 2
3853 };
3854
3855 static void
3856 __unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3857 void *data, int flags)
3858 {
3859 struct ftrace_func_entry *rec_entry;
3860 struct ftrace_func_probe *entry;
3861 struct ftrace_func_probe *p;
3862 struct ftrace_glob func_g;
3863 struct ftrace_hash **orig_hash = &trace_probe_ops.func_hash->filter_hash;
3864 struct ftrace_hash *old_hash = *orig_hash;
3865 struct list_head free_list;
3866 struct ftrace_hash *hash;
3867 struct hlist_node *tmp;
3868 char str[KSYM_SYMBOL_LEN];
3869 int i, ret;
3870
3871 if (glob && (strcmp(glob, "*") == 0 || !strlen(glob)))
3872 func_g.search = NULL;
3873 else if (glob) {
3874 int not;
3875
3876 func_g.type = filter_parse_regex(glob, strlen(glob),
3877 &func_g.search, &not);
3878 func_g.len = strlen(func_g.search);
3879 func_g.search = glob;
3880
3881 /* we do not support '!' for function probes */
3882 if (WARN_ON(not))
3883 return;
3884 }
3885
3886 mutex_lock(&trace_probe_ops.func_hash->regex_lock);
3887
3888 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
3889 if (!hash)
3890 /* Hmm, should report this somehow */
3891 goto out_unlock;
3892
3893 INIT_LIST_HEAD(&free_list);
3894
3895 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3896 struct hlist_head *hhd = &ftrace_func_hash[i];
3897
3898 hlist_for_each_entry_safe(entry, tmp, hhd, node) {
3899
3900 /* break up if statements for readability */
3901 if ((flags & PROBE_TEST_FUNC) && entry->ops != ops)
3902 continue;
3903
3904 if ((flags & PROBE_TEST_DATA) && entry->data != data)
3905 continue;
3906
3907 /* do this last, since it is the most expensive */
3908 if (func_g.search) {
3909 kallsyms_lookup(entry->ip, NULL, NULL,
3910 NULL, str);
3911 if (!ftrace_match(str, &func_g))
3912 continue;
3913 }
3914
3915 rec_entry = ftrace_lookup_ip(hash, entry->ip);
3916 /* It is possible more than one entry had this ip */
3917 if (rec_entry)
3918 free_hash_entry(hash, rec_entry);
3919
3920 hlist_del_rcu(&entry->node);
3921 list_add(&entry->free_list, &free_list);
3922 }
3923 }
3924 mutex_lock(&ftrace_lock);
3925 __disable_ftrace_function_probe();
3926 /*
3927 * Remove after the disable is called. Otherwise, if the last
3928 * probe is removed, a null hash means *all enabled*.
3929 */
3930 ret = ftrace_hash_move(&trace_probe_ops, 1, orig_hash, hash);
3931 synchronize_sched();
3932 if (!ret)
3933 free_ftrace_hash_rcu(old_hash);
3934
3935 list_for_each_entry_safe(entry, p, &free_list, free_list) {
3936 list_del(&entry->free_list);
3937 ftrace_free_entry(entry);
3938 }
3939 mutex_unlock(&ftrace_lock);
3940
3941 out_unlock:
3942 mutex_unlock(&trace_probe_ops.func_hash->regex_lock);
3943 free_ftrace_hash(hash);
3944 }
3945
3946 void
3947 unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3948 void *data)
3949 {
3950 __unregister_ftrace_function_probe(glob, ops, data,
3951 PROBE_TEST_FUNC | PROBE_TEST_DATA);
3952 }
3953
3954 void
3955 unregister_ftrace_function_probe_func(char *glob, struct ftrace_probe_ops *ops)
3956 {
3957 __unregister_ftrace_function_probe(glob, ops, NULL, PROBE_TEST_FUNC);
3958 }
3959
3960 void unregister_ftrace_function_probe_all(char *glob)
3961 {
3962 __unregister_ftrace_function_probe(glob, NULL, NULL, 0);
3963 }
3964
3965 static LIST_HEAD(ftrace_commands);
3966 static DEFINE_MUTEX(ftrace_cmd_mutex);
3967
3968 /*
3969 * Currently we only register ftrace commands from __init, so mark this
3970 * __init too.
3971 */
3972 __init int register_ftrace_command(struct ftrace_func_command *cmd)
3973 {
3974 struct ftrace_func_command *p;
3975 int ret = 0;
3976
3977 mutex_lock(&ftrace_cmd_mutex);
3978 list_for_each_entry(p, &ftrace_commands, list) {
3979 if (strcmp(cmd->name, p->name) == 0) {
3980 ret = -EBUSY;
3981 goto out_unlock;
3982 }
3983 }
3984 list_add(&cmd->list, &ftrace_commands);
3985 out_unlock:
3986 mutex_unlock(&ftrace_cmd_mutex);
3987
3988 return ret;
3989 }
3990
3991 /*
3992 * Currently we only unregister ftrace commands from __init, so mark
3993 * this __init too.
3994 */
3995 __init int unregister_ftrace_command(struct ftrace_func_command *cmd)
3996 {
3997 struct ftrace_func_command *p, *n;
3998 int ret = -ENODEV;
3999
4000 mutex_lock(&ftrace_cmd_mutex);
4001 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
4002 if (strcmp(cmd->name, p->name) == 0) {
4003 ret = 0;
4004 list_del_init(&p->list);
4005 goto out_unlock;
4006 }
4007 }
4008 out_unlock:
4009 mutex_unlock(&ftrace_cmd_mutex);
4010
4011 return ret;
4012 }
4013
4014 static int ftrace_process_regex(struct ftrace_hash *hash,
4015 char *buff, int len, int enable)
4016 {
4017 char *func, *command, *next = buff;
4018 struct ftrace_func_command *p;
4019 int ret = -EINVAL;
4020
4021 func = strsep(&next, ":");
4022
4023 if (!next) {
4024 ret = ftrace_match_records(hash, func, len);
4025 if (!ret)
4026 ret = -EINVAL;
4027 if (ret < 0)
4028 return ret;
4029 return 0;
4030 }
4031
4032 /* command found */
4033
4034 command = strsep(&next, ":");
4035
4036 mutex_lock(&ftrace_cmd_mutex);
4037 list_for_each_entry(p, &ftrace_commands, list) {
4038 if (strcmp(p->name, command) == 0) {
4039 ret = p->func(hash, func, command, next, enable);
4040 goto out_unlock;
4041 }
4042 }
4043 out_unlock:
4044 mutex_unlock(&ftrace_cmd_mutex);
4045
4046 return ret;
4047 }
4048
4049 static ssize_t
4050 ftrace_regex_write(struct file *file, const char __user *ubuf,
4051 size_t cnt, loff_t *ppos, int enable)
4052 {
4053 struct ftrace_iterator *iter;
4054 struct trace_parser *parser;
4055 ssize_t ret, read;
4056
4057 if (!cnt)
4058 return 0;
4059
4060 if (file->f_mode & FMODE_READ) {
4061 struct seq_file *m = file->private_data;
4062 iter = m->private;
4063 } else
4064 iter = file->private_data;
4065
4066 if (unlikely(ftrace_disabled))
4067 return -ENODEV;
4068
4069 /* iter->hash is a local copy, so we don't need regex_lock */
4070
4071 parser = &iter->parser;
4072 read = trace_get_user(parser, ubuf, cnt, ppos);
4073
4074 if (read >= 0 && trace_parser_loaded(parser) &&
4075 !trace_parser_cont(parser)) {
4076 ret = ftrace_process_regex(iter->hash, parser->buffer,
4077 parser->idx, enable);
4078 trace_parser_clear(parser);
4079 if (ret < 0)
4080 goto out;
4081 }
4082
4083 ret = read;
4084 out:
4085 return ret;
4086 }
4087
4088 ssize_t
4089 ftrace_filter_write(struct file *file, const char __user *ubuf,
4090 size_t cnt, loff_t *ppos)
4091 {
4092 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
4093 }
4094
4095 ssize_t
4096 ftrace_notrace_write(struct file *file, const char __user *ubuf,
4097 size_t cnt, loff_t *ppos)
4098 {
4099 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
4100 }
4101
4102 static int
4103 ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
4104 {
4105 struct ftrace_func_entry *entry;
4106
4107 if (!ftrace_location(ip))
4108 return -EINVAL;
4109
4110 if (remove) {
4111 entry = ftrace_lookup_ip(hash, ip);
4112 if (!entry)
4113 return -ENOENT;
4114 free_hash_entry(hash, entry);
4115 return 0;
4116 }
4117
4118 return add_hash_entry(hash, ip);
4119 }
4120
4121 static void ftrace_ops_update_code(struct ftrace_ops *ops,
4122 struct ftrace_ops_hash *old_hash)
4123 {
4124 struct ftrace_ops *op;
4125
4126 if (!ftrace_enabled)
4127 return;
4128
4129 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
4130 ftrace_run_modify_code(ops, FTRACE_UPDATE_CALLS, old_hash);
4131 return;
4132 }
4133
4134 /*
4135 * If this is the shared global_ops filter, then we need to
4136 * check if there is another ops that shares it, is enabled.
4137 * If so, we still need to run the modify code.
4138 */
4139 if (ops->func_hash != &global_ops.local_hash)
4140 return;
4141
4142 do_for_each_ftrace_op(op, ftrace_ops_list) {
4143 if (op->func_hash == &global_ops.local_hash &&
4144 op->flags & FTRACE_OPS_FL_ENABLED) {
4145 ftrace_run_modify_code(op, FTRACE_UPDATE_CALLS, old_hash);
4146 /* Only need to do this once */
4147 return;
4148 }
4149 } while_for_each_ftrace_op(op);
4150 }
4151
4152 static int
4153 ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
4154 unsigned long ip, int remove, int reset, int enable)
4155 {
4156 struct ftrace_hash **orig_hash;
4157 struct ftrace_ops_hash old_hash_ops;
4158 struct ftrace_hash *old_hash;
4159 struct ftrace_hash *hash;
4160 int ret;
4161
4162 if (unlikely(ftrace_disabled))
4163 return -ENODEV;
4164
4165 mutex_lock(&ops->func_hash->regex_lock);
4166
4167 if (enable)
4168 orig_hash = &ops->func_hash->filter_hash;
4169 else
4170 orig_hash = &ops->func_hash->notrace_hash;
4171
4172 if (reset)
4173 hash = alloc_ftrace_hash(FTRACE_HASH_DEFAULT_BITS);
4174 else
4175 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
4176
4177 if (!hash) {
4178 ret = -ENOMEM;
4179 goto out_regex_unlock;
4180 }
4181
4182 if (buf && !ftrace_match_records(hash, buf, len)) {
4183 ret = -EINVAL;
4184 goto out_regex_unlock;
4185 }
4186 if (ip) {
4187 ret = ftrace_match_addr(hash, ip, remove);
4188 if (ret < 0)
4189 goto out_regex_unlock;
4190 }
4191
4192 mutex_lock(&ftrace_lock);
4193 old_hash = *orig_hash;
4194 old_hash_ops.filter_hash = ops->func_hash->filter_hash;
4195 old_hash_ops.notrace_hash = ops->func_hash->notrace_hash;
4196 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
4197 if (!ret) {
4198 ftrace_ops_update_code(ops, &old_hash_ops);
4199 free_ftrace_hash_rcu(old_hash);
4200 }
4201 mutex_unlock(&ftrace_lock);
4202
4203 out_regex_unlock:
4204 mutex_unlock(&ops->func_hash->regex_lock);
4205
4206 free_ftrace_hash(hash);
4207 return ret;
4208 }
4209
4210 static int
4211 ftrace_set_addr(struct ftrace_ops *ops, unsigned long ip, int remove,
4212 int reset, int enable)
4213 {
4214 return ftrace_set_hash(ops, 0, 0, ip, remove, reset, enable);
4215 }
4216
4217 /**
4218 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
4219 * @ops - the ops to set the filter with
4220 * @ip - the address to add to or remove from the filter.
4221 * @remove - non zero to remove the ip from the filter
4222 * @reset - non zero to reset all filters before applying this filter.
4223 *
4224 * Filters denote which functions should be enabled when tracing is enabled
4225 * If @ip is NULL, it failes to update filter.
4226 */
4227 int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
4228 int remove, int reset)
4229 {
4230 ftrace_ops_init(ops);
4231 return ftrace_set_addr(ops, ip, remove, reset, 1);
4232 }
4233 EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
4234
4235 static int
4236 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
4237 int reset, int enable)
4238 {
4239 return ftrace_set_hash(ops, buf, len, 0, 0, reset, enable);
4240 }
4241
4242 /**
4243 * ftrace_set_filter - set a function to filter on in ftrace
4244 * @ops - the ops to set the filter with
4245 * @buf - the string that holds the function filter text.
4246 * @len - the length of the string.
4247 * @reset - non zero to reset all filters before applying this filter.
4248 *
4249 * Filters denote which functions should be enabled when tracing is enabled.
4250 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4251 */
4252 int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
4253 int len, int reset)
4254 {
4255 ftrace_ops_init(ops);
4256 return ftrace_set_regex(ops, buf, len, reset, 1);
4257 }
4258 EXPORT_SYMBOL_GPL(ftrace_set_filter);
4259
4260 /**
4261 * ftrace_set_notrace - set a function to not trace in ftrace
4262 * @ops - the ops to set the notrace filter with
4263 * @buf - the string that holds the function notrace text.
4264 * @len - the length of the string.
4265 * @reset - non zero to reset all filters before applying this filter.
4266 *
4267 * Notrace Filters denote which functions should not be enabled when tracing
4268 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4269 * for tracing.
4270 */
4271 int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
4272 int len, int reset)
4273 {
4274 ftrace_ops_init(ops);
4275 return ftrace_set_regex(ops, buf, len, reset, 0);
4276 }
4277 EXPORT_SYMBOL_GPL(ftrace_set_notrace);
4278 /**
4279 * ftrace_set_global_filter - set a function to filter on with global tracers
4280 * @buf - the string that holds the function filter text.
4281 * @len - the length of the string.
4282 * @reset - non zero to reset all filters before applying this filter.
4283 *
4284 * Filters denote which functions should be enabled when tracing is enabled.
4285 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
4286 */
4287 void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
4288 {
4289 ftrace_set_regex(&global_ops, buf, len, reset, 1);
4290 }
4291 EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
4292
4293 /**
4294 * ftrace_set_global_notrace - set a function to not trace with global tracers
4295 * @buf - the string that holds the function notrace text.
4296 * @len - the length of the string.
4297 * @reset - non zero to reset all filters before applying this filter.
4298 *
4299 * Notrace Filters denote which functions should not be enabled when tracing
4300 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
4301 * for tracing.
4302 */
4303 void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
4304 {
4305 ftrace_set_regex(&global_ops, buf, len, reset, 0);
4306 }
4307 EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
4308
4309 /*
4310 * command line interface to allow users to set filters on boot up.
4311 */
4312 #define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
4313 static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4314 static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
4315
4316 /* Used by function selftest to not test if filter is set */
4317 bool ftrace_filter_param __initdata;
4318
4319 static int __init set_ftrace_notrace(char *str)
4320 {
4321 ftrace_filter_param = true;
4322 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
4323 return 1;
4324 }
4325 __setup("ftrace_notrace=", set_ftrace_notrace);
4326
4327 static int __init set_ftrace_filter(char *str)
4328 {
4329 ftrace_filter_param = true;
4330 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
4331 return 1;
4332 }
4333 __setup("ftrace_filter=", set_ftrace_filter);
4334
4335 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4336 static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
4337 static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
4338 static int ftrace_set_func(unsigned long *array, int *idx, int size, char *buffer);
4339
4340 static unsigned long save_global_trampoline;
4341 static unsigned long save_global_flags;
4342
4343 static int __init set_graph_function(char *str)
4344 {
4345 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
4346 return 1;
4347 }
4348 __setup("ftrace_graph_filter=", set_graph_function);
4349
4350 static int __init set_graph_notrace_function(char *str)
4351 {
4352 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
4353 return 1;
4354 }
4355 __setup("ftrace_graph_notrace=", set_graph_notrace_function);
4356
4357 static void __init set_ftrace_early_graph(char *buf, int enable)
4358 {
4359 int ret;
4360 char *func;
4361 unsigned long *table = ftrace_graph_funcs;
4362 int *count = &ftrace_graph_count;
4363
4364 if (!enable) {
4365 table = ftrace_graph_notrace_funcs;
4366 count = &ftrace_graph_notrace_count;
4367 }
4368
4369 while (buf) {
4370 func = strsep(&buf, ",");
4371 /* we allow only one expression at a time */
4372 ret = ftrace_set_func(table, count, FTRACE_GRAPH_MAX_FUNCS, func);
4373 if (ret)
4374 printk(KERN_DEBUG "ftrace: function %s not "
4375 "traceable\n", func);
4376 }
4377 }
4378 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4379
4380 void __init
4381 ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
4382 {
4383 char *func;
4384
4385 ftrace_ops_init(ops);
4386
4387 while (buf) {
4388 func = strsep(&buf, ",");
4389 ftrace_set_regex(ops, func, strlen(func), 0, enable);
4390 }
4391 }
4392
4393 static void __init set_ftrace_early_filters(void)
4394 {
4395 if (ftrace_filter_buf[0])
4396 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
4397 if (ftrace_notrace_buf[0])
4398 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
4399 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4400 if (ftrace_graph_buf[0])
4401 set_ftrace_early_graph(ftrace_graph_buf, 1);
4402 if (ftrace_graph_notrace_buf[0])
4403 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
4404 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4405 }
4406
4407 int ftrace_regex_release(struct inode *inode, struct file *file)
4408 {
4409 struct seq_file *m = (struct seq_file *)file->private_data;
4410 struct ftrace_ops_hash old_hash_ops;
4411 struct ftrace_iterator *iter;
4412 struct ftrace_hash **orig_hash;
4413 struct ftrace_hash *old_hash;
4414 struct trace_parser *parser;
4415 int filter_hash;
4416 int ret;
4417
4418 if (file->f_mode & FMODE_READ) {
4419 iter = m->private;
4420 seq_release(inode, file);
4421 } else
4422 iter = file->private_data;
4423
4424 parser = &iter->parser;
4425 if (trace_parser_loaded(parser)) {
4426 parser->buffer[parser->idx] = 0;
4427 ftrace_match_records(iter->hash, parser->buffer, parser->idx);
4428 }
4429
4430 trace_parser_put(parser);
4431
4432 mutex_lock(&iter->ops->func_hash->regex_lock);
4433
4434 if (file->f_mode & FMODE_WRITE) {
4435 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
4436
4437 if (filter_hash)
4438 orig_hash = &iter->ops->func_hash->filter_hash;
4439 else
4440 orig_hash = &iter->ops->func_hash->notrace_hash;
4441
4442 mutex_lock(&ftrace_lock);
4443 old_hash = *orig_hash;
4444 old_hash_ops.filter_hash = iter->ops->func_hash->filter_hash;
4445 old_hash_ops.notrace_hash = iter->ops->func_hash->notrace_hash;
4446 ret = ftrace_hash_move(iter->ops, filter_hash,
4447 orig_hash, iter->hash);
4448 if (!ret) {
4449 ftrace_ops_update_code(iter->ops, &old_hash_ops);
4450 free_ftrace_hash_rcu(old_hash);
4451 }
4452 mutex_unlock(&ftrace_lock);
4453 }
4454
4455 mutex_unlock(&iter->ops->func_hash->regex_lock);
4456 free_ftrace_hash(iter->hash);
4457 kfree(iter);
4458
4459 return 0;
4460 }
4461
4462 static const struct file_operations ftrace_avail_fops = {
4463 .open = ftrace_avail_open,
4464 .read = seq_read,
4465 .llseek = seq_lseek,
4466 .release = seq_release_private,
4467 };
4468
4469 static const struct file_operations ftrace_enabled_fops = {
4470 .open = ftrace_enabled_open,
4471 .read = seq_read,
4472 .llseek = seq_lseek,
4473 .release = seq_release_private,
4474 };
4475
4476 static const struct file_operations ftrace_filter_fops = {
4477 .open = ftrace_filter_open,
4478 .read = seq_read,
4479 .write = ftrace_filter_write,
4480 .llseek = tracing_lseek,
4481 .release = ftrace_regex_release,
4482 };
4483
4484 static const struct file_operations ftrace_notrace_fops = {
4485 .open = ftrace_notrace_open,
4486 .read = seq_read,
4487 .write = ftrace_notrace_write,
4488 .llseek = tracing_lseek,
4489 .release = ftrace_regex_release,
4490 };
4491
4492 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4493
4494 static DEFINE_MUTEX(graph_lock);
4495
4496 int ftrace_graph_count;
4497 int ftrace_graph_notrace_count;
4498 unsigned long ftrace_graph_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;
4499 unsigned long ftrace_graph_notrace_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;
4500
4501 struct ftrace_graph_data {
4502 unsigned long *table;
4503 size_t size;
4504 int *count;
4505 const struct seq_operations *seq_ops;
4506 };
4507
4508 static void *
4509 __g_next(struct seq_file *m, loff_t *pos)
4510 {
4511 struct ftrace_graph_data *fgd = m->private;
4512
4513 if (*pos >= *fgd->count)
4514 return NULL;
4515 return &fgd->table[*pos];
4516 }
4517
4518 static void *
4519 g_next(struct seq_file *m, void *v, loff_t *pos)
4520 {
4521 (*pos)++;
4522 return __g_next(m, pos);
4523 }
4524
4525 static void *g_start(struct seq_file *m, loff_t *pos)
4526 {
4527 struct ftrace_graph_data *fgd = m->private;
4528
4529 mutex_lock(&graph_lock);
4530
4531 /* Nothing, tell g_show to print all functions are enabled */
4532 if (!*fgd->count && !*pos)
4533 return (void *)1;
4534
4535 return __g_next(m, pos);
4536 }
4537
4538 static void g_stop(struct seq_file *m, void *p)
4539 {
4540 mutex_unlock(&graph_lock);
4541 }
4542
4543 static int g_show(struct seq_file *m, void *v)
4544 {
4545 unsigned long *ptr = v;
4546
4547 if (!ptr)
4548 return 0;
4549
4550 if (ptr == (unsigned long *)1) {
4551 struct ftrace_graph_data *fgd = m->private;
4552
4553 if (fgd->table == ftrace_graph_funcs)
4554 seq_puts(m, "#### all functions enabled ####\n");
4555 else
4556 seq_puts(m, "#### no functions disabled ####\n");
4557 return 0;
4558 }
4559
4560 seq_printf(m, "%ps\n", (void *)*ptr);
4561
4562 return 0;
4563 }
4564
4565 static const struct seq_operations ftrace_graph_seq_ops = {
4566 .start = g_start,
4567 .next = g_next,
4568 .stop = g_stop,
4569 .show = g_show,
4570 };
4571
4572 static int
4573 __ftrace_graph_open(struct inode *inode, struct file *file,
4574 struct ftrace_graph_data *fgd)
4575 {
4576 int ret = 0;
4577
4578 mutex_lock(&graph_lock);
4579 if ((file->f_mode & FMODE_WRITE) &&
4580 (file->f_flags & O_TRUNC)) {
4581 *fgd->count = 0;
4582 memset(fgd->table, 0, fgd->size * sizeof(*fgd->table));
4583 }
4584 mutex_unlock(&graph_lock);
4585
4586 if (file->f_mode & FMODE_READ) {
4587 ret = seq_open(file, fgd->seq_ops);
4588 if (!ret) {
4589 struct seq_file *m = file->private_data;
4590 m->private = fgd;
4591 }
4592 } else
4593 file->private_data = fgd;
4594
4595 return ret;
4596 }
4597
4598 static int
4599 ftrace_graph_open(struct inode *inode, struct file *file)
4600 {
4601 struct ftrace_graph_data *fgd;
4602
4603 if (unlikely(ftrace_disabled))
4604 return -ENODEV;
4605
4606 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
4607 if (fgd == NULL)
4608 return -ENOMEM;
4609
4610 fgd->table = ftrace_graph_funcs;
4611 fgd->size = FTRACE_GRAPH_MAX_FUNCS;
4612 fgd->count = &ftrace_graph_count;
4613 fgd->seq_ops = &ftrace_graph_seq_ops;
4614
4615 return __ftrace_graph_open(inode, file, fgd);
4616 }
4617
4618 static int
4619 ftrace_graph_notrace_open(struct inode *inode, struct file *file)
4620 {
4621 struct ftrace_graph_data *fgd;
4622
4623 if (unlikely(ftrace_disabled))
4624 return -ENODEV;
4625
4626 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
4627 if (fgd == NULL)
4628 return -ENOMEM;
4629
4630 fgd->table = ftrace_graph_notrace_funcs;
4631 fgd->size = FTRACE_GRAPH_MAX_FUNCS;
4632 fgd->count = &ftrace_graph_notrace_count;
4633 fgd->seq_ops = &ftrace_graph_seq_ops;
4634
4635 return __ftrace_graph_open(inode, file, fgd);
4636 }
4637
4638 static int
4639 ftrace_graph_release(struct inode *inode, struct file *file)
4640 {
4641 if (file->f_mode & FMODE_READ) {
4642 struct seq_file *m = file->private_data;
4643
4644 kfree(m->private);
4645 seq_release(inode, file);
4646 } else {
4647 kfree(file->private_data);
4648 }
4649
4650 return 0;
4651 }
4652
4653 static int
4654 ftrace_set_func(unsigned long *array, int *idx, int size, char *buffer)
4655 {
4656 struct ftrace_glob func_g;
4657 struct dyn_ftrace *rec;
4658 struct ftrace_page *pg;
4659 int fail = 1;
4660 int not;
4661 bool exists;
4662 int i;
4663
4664 /* decode regex */
4665 func_g.type = filter_parse_regex(buffer, strlen(buffer),
4666 &func_g.search, &not);
4667 if (!not && *idx >= size)
4668 return -EBUSY;
4669
4670 func_g.len = strlen(func_g.search);
4671
4672 mutex_lock(&ftrace_lock);
4673
4674 if (unlikely(ftrace_disabled)) {
4675 mutex_unlock(&ftrace_lock);
4676 return -ENODEV;
4677 }
4678
4679 do_for_each_ftrace_rec(pg, rec) {
4680
4681 if (ftrace_match_record(rec, &func_g, NULL, 0)) {
4682 /* if it is in the array */
4683 exists = false;
4684 for (i = 0; i < *idx; i++) {
4685 if (array[i] == rec->ip) {
4686 exists = true;
4687 break;
4688 }
4689 }
4690
4691 if (!not) {
4692 fail = 0;
4693 if (!exists) {
4694 array[(*idx)++] = rec->ip;
4695 if (*idx >= size)
4696 goto out;
4697 }
4698 } else {
4699 if (exists) {
4700 array[i] = array[--(*idx)];
4701 array[*idx] = 0;
4702 fail = 0;
4703 }
4704 }
4705 }
4706 } while_for_each_ftrace_rec();
4707 out:
4708 mutex_unlock(&ftrace_lock);
4709
4710 if (fail)
4711 return -EINVAL;
4712
4713 return 0;
4714 }
4715
4716 static ssize_t
4717 ftrace_graph_write(struct file *file, const char __user *ubuf,
4718 size_t cnt, loff_t *ppos)
4719 {
4720 struct trace_parser parser;
4721 ssize_t read, ret = 0;
4722 struct ftrace_graph_data *fgd = file->private_data;
4723
4724 if (!cnt)
4725 return 0;
4726
4727 if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX))
4728 return -ENOMEM;
4729
4730 read = trace_get_user(&parser, ubuf, cnt, ppos);
4731
4732 if (read >= 0 && trace_parser_loaded((&parser))) {
4733 parser.buffer[parser.idx] = 0;
4734
4735 mutex_lock(&graph_lock);
4736
4737 /* we allow only one expression at a time */
4738 ret = ftrace_set_func(fgd->table, fgd->count, fgd->size,
4739 parser.buffer);
4740
4741 mutex_unlock(&graph_lock);
4742 }
4743
4744 if (!ret)
4745 ret = read;
4746
4747 trace_parser_put(&parser);
4748
4749 return ret;
4750 }
4751
4752 static const struct file_operations ftrace_graph_fops = {
4753 .open = ftrace_graph_open,
4754 .read = seq_read,
4755 .write = ftrace_graph_write,
4756 .llseek = tracing_lseek,
4757 .release = ftrace_graph_release,
4758 };
4759
4760 static const struct file_operations ftrace_graph_notrace_fops = {
4761 .open = ftrace_graph_notrace_open,
4762 .read = seq_read,
4763 .write = ftrace_graph_write,
4764 .llseek = tracing_lseek,
4765 .release = ftrace_graph_release,
4766 };
4767 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4768
4769 void ftrace_create_filter_files(struct ftrace_ops *ops,
4770 struct dentry *parent)
4771 {
4772
4773 trace_create_file("set_ftrace_filter", 0644, parent,
4774 ops, &ftrace_filter_fops);
4775
4776 trace_create_file("set_ftrace_notrace", 0644, parent,
4777 ops, &ftrace_notrace_fops);
4778 }
4779
4780 /*
4781 * The name "destroy_filter_files" is really a misnomer. Although
4782 * in the future, it may actualy delete the files, but this is
4783 * really intended to make sure the ops passed in are disabled
4784 * and that when this function returns, the caller is free to
4785 * free the ops.
4786 *
4787 * The "destroy" name is only to match the "create" name that this
4788 * should be paired with.
4789 */
4790 void ftrace_destroy_filter_files(struct ftrace_ops *ops)
4791 {
4792 mutex_lock(&ftrace_lock);
4793 if (ops->flags & FTRACE_OPS_FL_ENABLED)
4794 ftrace_shutdown(ops, 0);
4795 ops->flags |= FTRACE_OPS_FL_DELETED;
4796 mutex_unlock(&ftrace_lock);
4797 }
4798
4799 static __init int ftrace_init_dyn_tracefs(struct dentry *d_tracer)
4800 {
4801
4802 trace_create_file("available_filter_functions", 0444,
4803 d_tracer, NULL, &ftrace_avail_fops);
4804
4805 trace_create_file("enabled_functions", 0444,
4806 d_tracer, NULL, &ftrace_enabled_fops);
4807
4808 ftrace_create_filter_files(&global_ops, d_tracer);
4809
4810 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4811 trace_create_file("set_graph_function", 0444, d_tracer,
4812 NULL,
4813 &ftrace_graph_fops);
4814 trace_create_file("set_graph_notrace", 0444, d_tracer,
4815 NULL,
4816 &ftrace_graph_notrace_fops);
4817 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4818
4819 return 0;
4820 }
4821
4822 static int ftrace_cmp_ips(const void *a, const void *b)
4823 {
4824 const unsigned long *ipa = a;
4825 const unsigned long *ipb = b;
4826
4827 if (*ipa > *ipb)
4828 return 1;
4829 if (*ipa < *ipb)
4830 return -1;
4831 return 0;
4832 }
4833
4834 static int ftrace_process_locs(struct module *mod,
4835 unsigned long *start,
4836 unsigned long *end)
4837 {
4838 struct ftrace_page *start_pg;
4839 struct ftrace_page *pg;
4840 struct dyn_ftrace *rec;
4841 unsigned long count;
4842 unsigned long *p;
4843 unsigned long addr;
4844 unsigned long flags = 0; /* Shut up gcc */
4845 int ret = -ENOMEM;
4846
4847 count = end - start;
4848
4849 if (!count)
4850 return 0;
4851
4852 sort(start, count, sizeof(*start),
4853 ftrace_cmp_ips, NULL);
4854
4855 start_pg = ftrace_allocate_pages(count);
4856 if (!start_pg)
4857 return -ENOMEM;
4858
4859 mutex_lock(&ftrace_lock);
4860
4861 /*
4862 * Core and each module needs their own pages, as
4863 * modules will free them when they are removed.
4864 * Force a new page to be allocated for modules.
4865 */
4866 if (!mod) {
4867 WARN_ON(ftrace_pages || ftrace_pages_start);
4868 /* First initialization */
4869 ftrace_pages = ftrace_pages_start = start_pg;
4870 } else {
4871 if (!ftrace_pages)
4872 goto out;
4873
4874 if (WARN_ON(ftrace_pages->next)) {
4875 /* Hmm, we have free pages? */
4876 while (ftrace_pages->next)
4877 ftrace_pages = ftrace_pages->next;
4878 }
4879
4880 ftrace_pages->next = start_pg;
4881 }
4882
4883 p = start;
4884 pg = start_pg;
4885 while (p < end) {
4886 addr = ftrace_call_adjust(*p++);
4887 /*
4888 * Some architecture linkers will pad between
4889 * the different mcount_loc sections of different
4890 * object files to satisfy alignments.
4891 * Skip any NULL pointers.
4892 */
4893 if (!addr)
4894 continue;
4895
4896 if (pg->index == pg->size) {
4897 /* We should have allocated enough */
4898 if (WARN_ON(!pg->next))
4899 break;
4900 pg = pg->next;
4901 }
4902
4903 rec = &pg->records[pg->index++];
4904 rec->ip = addr;
4905 }
4906
4907 /* We should have used all pages */
4908 WARN_ON(pg->next);
4909
4910 /* Assign the last page to ftrace_pages */
4911 ftrace_pages = pg;
4912
4913 /*
4914 * We only need to disable interrupts on start up
4915 * because we are modifying code that an interrupt
4916 * may execute, and the modification is not atomic.
4917 * But for modules, nothing runs the code we modify
4918 * until we are finished with it, and there's no
4919 * reason to cause large interrupt latencies while we do it.
4920 */
4921 if (!mod)
4922 local_irq_save(flags);
4923 ftrace_update_code(mod, start_pg);
4924 if (!mod)
4925 local_irq_restore(flags);
4926 ret = 0;
4927 out:
4928 mutex_unlock(&ftrace_lock);
4929
4930 return ret;
4931 }
4932
4933 #ifdef CONFIG_MODULES
4934
4935 #define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
4936
4937 static int referenced_filters(struct dyn_ftrace *rec)
4938 {
4939 struct ftrace_ops *ops;
4940 int cnt = 0;
4941
4942 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
4943 if (ops_references_rec(ops, rec))
4944 cnt++;
4945 }
4946
4947 return cnt;
4948 }
4949
4950 void ftrace_release_mod(struct module *mod)
4951 {
4952 struct dyn_ftrace *rec;
4953 struct ftrace_page **last_pg;
4954 struct ftrace_page *pg;
4955 int order;
4956
4957 mutex_lock(&ftrace_lock);
4958
4959 if (ftrace_disabled)
4960 goto out_unlock;
4961
4962 /*
4963 * Each module has its own ftrace_pages, remove
4964 * them from the list.
4965 */
4966 last_pg = &ftrace_pages_start;
4967 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
4968 rec = &pg->records[0];
4969 if (within_module_core(rec->ip, mod)) {
4970 /*
4971 * As core pages are first, the first
4972 * page should never be a module page.
4973 */
4974 if (WARN_ON(pg == ftrace_pages_start))
4975 goto out_unlock;
4976
4977 /* Check if we are deleting the last page */
4978 if (pg == ftrace_pages)
4979 ftrace_pages = next_to_ftrace_page(last_pg);
4980
4981 *last_pg = pg->next;
4982 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
4983 free_pages((unsigned long)pg->records, order);
4984 kfree(pg);
4985 } else
4986 last_pg = &pg->next;
4987 }
4988 out_unlock:
4989 mutex_unlock(&ftrace_lock);
4990 }
4991
4992 void ftrace_module_enable(struct module *mod)
4993 {
4994 struct dyn_ftrace *rec;
4995 struct ftrace_page *pg;
4996
4997 mutex_lock(&ftrace_lock);
4998
4999 if (ftrace_disabled)
5000 goto out_unlock;
5001
5002 /*
5003 * If the tracing is enabled, go ahead and enable the record.
5004 *
5005 * The reason not to enable the record immediatelly is the
5006 * inherent check of ftrace_make_nop/ftrace_make_call for
5007 * correct previous instructions. Making first the NOP
5008 * conversion puts the module to the correct state, thus
5009 * passing the ftrace_make_call check.
5010 *
5011 * We also delay this to after the module code already set the
5012 * text to read-only, as we now need to set it back to read-write
5013 * so that we can modify the text.
5014 */
5015 if (ftrace_start_up)
5016 ftrace_arch_code_modify_prepare();
5017
5018 do_for_each_ftrace_rec(pg, rec) {
5019 int cnt;
5020 /*
5021 * do_for_each_ftrace_rec() is a double loop.
5022 * module text shares the pg. If a record is
5023 * not part of this module, then skip this pg,
5024 * which the "break" will do.
5025 */
5026 if (!within_module_core(rec->ip, mod))
5027 break;
5028
5029 cnt = 0;
5030
5031 /*
5032 * When adding a module, we need to check if tracers are
5033 * currently enabled and if they are, and can trace this record,
5034 * we need to enable the module functions as well as update the
5035 * reference counts for those function records.
5036 */
5037 if (ftrace_start_up)
5038 cnt += referenced_filters(rec);
5039
5040 /* This clears FTRACE_FL_DISABLED */
5041 rec->flags = cnt;
5042
5043 if (ftrace_start_up && cnt) {
5044 int failed = __ftrace_replace_code(rec, 1);
5045 if (failed) {
5046 ftrace_bug(failed, rec);
5047 goto out_loop;
5048 }
5049 }
5050
5051 } while_for_each_ftrace_rec();
5052
5053 out_loop:
5054 if (ftrace_start_up)
5055 ftrace_arch_code_modify_post_process();
5056
5057 out_unlock:
5058 mutex_unlock(&ftrace_lock);
5059 }
5060
5061 void ftrace_module_init(struct module *mod)
5062 {
5063 if (ftrace_disabled || !mod->num_ftrace_callsites)
5064 return;
5065
5066 ftrace_process_locs(mod, mod->ftrace_callsites,
5067 mod->ftrace_callsites + mod->num_ftrace_callsites);
5068 }
5069 #endif /* CONFIG_MODULES */
5070
5071 void __init ftrace_init(void)
5072 {
5073 extern unsigned long __start_mcount_loc[];
5074 extern unsigned long __stop_mcount_loc[];
5075 unsigned long count, flags;
5076 int ret;
5077
5078 local_irq_save(flags);
5079 ret = ftrace_dyn_arch_init();
5080 local_irq_restore(flags);
5081 if (ret)
5082 goto failed;
5083
5084 count = __stop_mcount_loc - __start_mcount_loc;
5085 if (!count) {
5086 pr_info("ftrace: No functions to be traced?\n");
5087 goto failed;
5088 }
5089
5090 pr_info("ftrace: allocating %ld entries in %ld pages\n",
5091 count, count / ENTRIES_PER_PAGE + 1);
5092
5093 last_ftrace_enabled = ftrace_enabled = 1;
5094
5095 ret = ftrace_process_locs(NULL,
5096 __start_mcount_loc,
5097 __stop_mcount_loc);
5098
5099 set_ftrace_early_filters();
5100
5101 return;
5102 failed:
5103 ftrace_disabled = 1;
5104 }
5105
5106 /* Do nothing if arch does not support this */
5107 void __weak arch_ftrace_update_trampoline(struct ftrace_ops *ops)
5108 {
5109 }
5110
5111 static void ftrace_update_trampoline(struct ftrace_ops *ops)
5112 {
5113
5114 /*
5115 * Currently there's no safe way to free a trampoline when the kernel
5116 * is configured with PREEMPT. That is because a task could be preempted
5117 * when it jumped to the trampoline, it may be preempted for a long time
5118 * depending on the system load, and currently there's no way to know
5119 * when it will be off the trampoline. If the trampoline is freed
5120 * too early, when the task runs again, it will be executing on freed
5121 * memory and crash.
5122 */
5123 #ifdef CONFIG_PREEMPT
5124 /* Currently, only non dynamic ops can have a trampoline */
5125 if (ops->flags & FTRACE_OPS_FL_DYNAMIC)
5126 return;
5127 #endif
5128
5129 arch_ftrace_update_trampoline(ops);
5130 }
5131
5132 #else
5133
5134 static struct ftrace_ops global_ops = {
5135 .func = ftrace_stub,
5136 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
5137 FTRACE_OPS_FL_INITIALIZED |
5138 FTRACE_OPS_FL_PID,
5139 };
5140
5141 static int __init ftrace_nodyn_init(void)
5142 {
5143 ftrace_enabled = 1;
5144 return 0;
5145 }
5146 core_initcall(ftrace_nodyn_init);
5147
5148 static inline int ftrace_init_dyn_tracefs(struct dentry *d_tracer) { return 0; }
5149 static inline void ftrace_startup_enable(int command) { }
5150 static inline void ftrace_startup_all(int command) { }
5151 /* Keep as macros so we do not need to define the commands */
5152 # define ftrace_startup(ops, command) \
5153 ({ \
5154 int ___ret = __register_ftrace_function(ops); \
5155 if (!___ret) \
5156 (ops)->flags |= FTRACE_OPS_FL_ENABLED; \
5157 ___ret; \
5158 })
5159 # define ftrace_shutdown(ops, command) \
5160 ({ \
5161 int ___ret = __unregister_ftrace_function(ops); \
5162 if (!___ret) \
5163 (ops)->flags &= ~FTRACE_OPS_FL_ENABLED; \
5164 ___ret; \
5165 })
5166
5167 # define ftrace_startup_sysctl() do { } while (0)
5168 # define ftrace_shutdown_sysctl() do { } while (0)
5169
5170 static inline int
5171 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
5172 {
5173 return 1;
5174 }
5175
5176 static void ftrace_update_trampoline(struct ftrace_ops *ops)
5177 {
5178 }
5179
5180 #endif /* CONFIG_DYNAMIC_FTRACE */
5181
5182 __init void ftrace_init_global_array_ops(struct trace_array *tr)
5183 {
5184 tr->ops = &global_ops;
5185 tr->ops->private = tr;
5186 }
5187
5188 void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
5189 {
5190 /* If we filter on pids, update to use the pid function */
5191 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
5192 if (WARN_ON(tr->ops->func != ftrace_stub))
5193 printk("ftrace ops had %pS for function\n",
5194 tr->ops->func);
5195 }
5196 tr->ops->func = func;
5197 tr->ops->private = tr;
5198 }
5199
5200 void ftrace_reset_array_ops(struct trace_array *tr)
5201 {
5202 tr->ops->func = ftrace_stub;
5203 }
5204
5205 static inline void
5206 __ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
5207 struct ftrace_ops *ignored, struct pt_regs *regs)
5208 {
5209 struct ftrace_ops *op;
5210 int bit;
5211
5212 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
5213 if (bit < 0)
5214 return;
5215
5216 /*
5217 * Some of the ops may be dynamically allocated,
5218 * they must be freed after a synchronize_sched().
5219 */
5220 preempt_disable_notrace();
5221
5222 do_for_each_ftrace_op(op, ftrace_ops_list) {
5223 /*
5224 * Check the following for each ops before calling their func:
5225 * if RCU flag is set, then rcu_is_watching() must be true
5226 * if PER_CPU is set, then ftrace_function_local_disable()
5227 * must be false
5228 * Otherwise test if the ip matches the ops filter
5229 *
5230 * If any of the above fails then the op->func() is not executed.
5231 */
5232 if ((!(op->flags & FTRACE_OPS_FL_RCU) || rcu_is_watching()) &&
5233 (!(op->flags & FTRACE_OPS_FL_PER_CPU) ||
5234 !ftrace_function_local_disabled(op)) &&
5235 ftrace_ops_test(op, ip, regs)) {
5236
5237 if (FTRACE_WARN_ON(!op->func)) {
5238 pr_warn("op=%p %pS\n", op, op);
5239 goto out;
5240 }
5241 op->func(ip, parent_ip, op, regs);
5242 }
5243 } while_for_each_ftrace_op(op);
5244 out:
5245 preempt_enable_notrace();
5246 trace_clear_recursion(bit);
5247 }
5248
5249 /*
5250 * Some archs only support passing ip and parent_ip. Even though
5251 * the list function ignores the op parameter, we do not want any
5252 * C side effects, where a function is called without the caller
5253 * sending a third parameter.
5254 * Archs are to support both the regs and ftrace_ops at the same time.
5255 * If they support ftrace_ops, it is assumed they support regs.
5256 * If call backs want to use regs, they must either check for regs
5257 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
5258 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
5259 * An architecture can pass partial regs with ftrace_ops and still
5260 * set the ARCH_SUPPORTS_FTRACE_OPS.
5261 */
5262 #if ARCH_SUPPORTS_FTRACE_OPS
5263 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
5264 struct ftrace_ops *op, struct pt_regs *regs)
5265 {
5266 __ftrace_ops_list_func(ip, parent_ip, NULL, regs);
5267 }
5268 #else
5269 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip)
5270 {
5271 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
5272 }
5273 #endif
5274
5275 /*
5276 * If there's only one function registered but it does not support
5277 * recursion, needs RCU protection and/or requires per cpu handling, then
5278 * this function will be called by the mcount trampoline.
5279 */
5280 static void ftrace_ops_assist_func(unsigned long ip, unsigned long parent_ip,
5281 struct ftrace_ops *op, struct pt_regs *regs)
5282 {
5283 int bit;
5284
5285 if ((op->flags & FTRACE_OPS_FL_RCU) && !rcu_is_watching())
5286 return;
5287
5288 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
5289 if (bit < 0)
5290 return;
5291
5292 preempt_disable_notrace();
5293
5294 if (!(op->flags & FTRACE_OPS_FL_PER_CPU) ||
5295 !ftrace_function_local_disabled(op)) {
5296 op->func(ip, parent_ip, op, regs);
5297 }
5298
5299 preempt_enable_notrace();
5300 trace_clear_recursion(bit);
5301 }
5302
5303 /**
5304 * ftrace_ops_get_func - get the function a trampoline should call
5305 * @ops: the ops to get the function for
5306 *
5307 * Normally the mcount trampoline will call the ops->func, but there
5308 * are times that it should not. For example, if the ops does not
5309 * have its own recursion protection, then it should call the
5310 * ftrace_ops_recurs_func() instead.
5311 *
5312 * Returns the function that the trampoline should call for @ops.
5313 */
5314 ftrace_func_t ftrace_ops_get_func(struct ftrace_ops *ops)
5315 {
5316 /*
5317 * If the function does not handle recursion, needs to be RCU safe,
5318 * or does per cpu logic, then we need to call the assist handler.
5319 */
5320 if (!(ops->flags & FTRACE_OPS_FL_RECURSION_SAFE) ||
5321 ops->flags & (FTRACE_OPS_FL_RCU | FTRACE_OPS_FL_PER_CPU))
5322 return ftrace_ops_assist_func;
5323
5324 return ops->func;
5325 }
5326
5327 static void clear_ftrace_swapper(void)
5328 {
5329 struct task_struct *p;
5330 int cpu;
5331
5332 get_online_cpus();
5333 for_each_online_cpu(cpu) {
5334 p = idle_task(cpu);
5335 clear_tsk_trace_trace(p);
5336 }
5337 put_online_cpus();
5338 }
5339
5340 static void set_ftrace_swapper(void)
5341 {
5342 struct task_struct *p;
5343 int cpu;
5344
5345 get_online_cpus();
5346 for_each_online_cpu(cpu) {
5347 p = idle_task(cpu);
5348 set_tsk_trace_trace(p);
5349 }
5350 put_online_cpus();
5351 }
5352
5353 static void clear_ftrace_pid(struct pid *pid)
5354 {
5355 struct task_struct *p;
5356
5357 rcu_read_lock();
5358 do_each_pid_task(pid, PIDTYPE_PID, p) {
5359 clear_tsk_trace_trace(p);
5360 } while_each_pid_task(pid, PIDTYPE_PID, p);
5361 rcu_read_unlock();
5362
5363 put_pid(pid);
5364 }
5365
5366 static void set_ftrace_pid(struct pid *pid)
5367 {
5368 struct task_struct *p;
5369
5370 rcu_read_lock();
5371 do_each_pid_task(pid, PIDTYPE_PID, p) {
5372 set_tsk_trace_trace(p);
5373 } while_each_pid_task(pid, PIDTYPE_PID, p);
5374 rcu_read_unlock();
5375 }
5376
5377 static void clear_ftrace_pid_task(struct pid *pid)
5378 {
5379 if (pid == ftrace_swapper_pid)
5380 clear_ftrace_swapper();
5381 else
5382 clear_ftrace_pid(pid);
5383 }
5384
5385 static void set_ftrace_pid_task(struct pid *pid)
5386 {
5387 if (pid == ftrace_swapper_pid)
5388 set_ftrace_swapper();
5389 else
5390 set_ftrace_pid(pid);
5391 }
5392
5393 static int ftrace_pid_add(int p)
5394 {
5395 struct pid *pid;
5396 struct ftrace_pid *fpid;
5397 int ret = -EINVAL;
5398
5399 mutex_lock(&ftrace_lock);
5400
5401 if (!p)
5402 pid = ftrace_swapper_pid;
5403 else
5404 pid = find_get_pid(p);
5405
5406 if (!pid)
5407 goto out;
5408
5409 ret = 0;
5410
5411 list_for_each_entry(fpid, &ftrace_pids, list)
5412 if (fpid->pid == pid)
5413 goto out_put;
5414
5415 ret = -ENOMEM;
5416
5417 fpid = kmalloc(sizeof(*fpid), GFP_KERNEL);
5418 if (!fpid)
5419 goto out_put;
5420
5421 list_add(&fpid->list, &ftrace_pids);
5422 fpid->pid = pid;
5423
5424 set_ftrace_pid_task(pid);
5425
5426 ftrace_update_pid_func();
5427
5428 ftrace_startup_all(0);
5429
5430 mutex_unlock(&ftrace_lock);
5431 return 0;
5432
5433 out_put:
5434 if (pid != ftrace_swapper_pid)
5435 put_pid(pid);
5436
5437 out:
5438 mutex_unlock(&ftrace_lock);
5439 return ret;
5440 }
5441
5442 static void ftrace_pid_reset(void)
5443 {
5444 struct ftrace_pid *fpid, *safe;
5445
5446 mutex_lock(&ftrace_lock);
5447 list_for_each_entry_safe(fpid, safe, &ftrace_pids, list) {
5448 struct pid *pid = fpid->pid;
5449
5450 clear_ftrace_pid_task(pid);
5451
5452 list_del(&fpid->list);
5453 kfree(fpid);
5454 }
5455
5456 ftrace_update_pid_func();
5457 ftrace_startup_all(0);
5458
5459 mutex_unlock(&ftrace_lock);
5460 }
5461
5462 static void *fpid_start(struct seq_file *m, loff_t *pos)
5463 {
5464 mutex_lock(&ftrace_lock);
5465
5466 if (!ftrace_pids_enabled() && (!*pos))
5467 return (void *) 1;
5468
5469 return seq_list_start(&ftrace_pids, *pos);
5470 }
5471
5472 static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
5473 {
5474 if (v == (void *)1)
5475 return NULL;
5476
5477 return seq_list_next(v, &ftrace_pids, pos);
5478 }
5479
5480 static void fpid_stop(struct seq_file *m, void *p)
5481 {
5482 mutex_unlock(&ftrace_lock);
5483 }
5484
5485 static int fpid_show(struct seq_file *m, void *v)
5486 {
5487 const struct ftrace_pid *fpid = list_entry(v, struct ftrace_pid, list);
5488
5489 if (v == (void *)1) {
5490 seq_puts(m, "no pid\n");
5491 return 0;
5492 }
5493
5494 if (fpid->pid == ftrace_swapper_pid)
5495 seq_puts(m, "swapper tasks\n");
5496 else
5497 seq_printf(m, "%u\n", pid_vnr(fpid->pid));
5498
5499 return 0;
5500 }
5501
5502 static const struct seq_operations ftrace_pid_sops = {
5503 .start = fpid_start,
5504 .next = fpid_next,
5505 .stop = fpid_stop,
5506 .show = fpid_show,
5507 };
5508
5509 static int
5510 ftrace_pid_open(struct inode *inode, struct file *file)
5511 {
5512 int ret = 0;
5513
5514 if ((file->f_mode & FMODE_WRITE) &&
5515 (file->f_flags & O_TRUNC))
5516 ftrace_pid_reset();
5517
5518 if (file->f_mode & FMODE_READ)
5519 ret = seq_open(file, &ftrace_pid_sops);
5520
5521 return ret;
5522 }
5523
5524 static ssize_t
5525 ftrace_pid_write(struct file *filp, const char __user *ubuf,
5526 size_t cnt, loff_t *ppos)
5527 {
5528 char buf[64], *tmp;
5529 long val;
5530 int ret;
5531
5532 if (cnt >= sizeof(buf))
5533 return -EINVAL;
5534
5535 if (copy_from_user(&buf, ubuf, cnt))
5536 return -EFAULT;
5537
5538 buf[cnt] = 0;
5539
5540 /*
5541 * Allow "echo > set_ftrace_pid" or "echo -n '' > set_ftrace_pid"
5542 * to clean the filter quietly.
5543 */
5544 tmp = strstrip(buf);
5545 if (strlen(tmp) == 0)
5546 return 1;
5547
5548 ret = kstrtol(tmp, 10, &val);
5549 if (ret < 0)
5550 return ret;
5551
5552 ret = ftrace_pid_add(val);
5553
5554 return ret ? ret : cnt;
5555 }
5556
5557 static int
5558 ftrace_pid_release(struct inode *inode, struct file *file)
5559 {
5560 if (file->f_mode & FMODE_READ)
5561 seq_release(inode, file);
5562
5563 return 0;
5564 }
5565
5566 static const struct file_operations ftrace_pid_fops = {
5567 .open = ftrace_pid_open,
5568 .write = ftrace_pid_write,
5569 .read = seq_read,
5570 .llseek = tracing_lseek,
5571 .release = ftrace_pid_release,
5572 };
5573
5574 static __init int ftrace_init_tracefs(void)
5575 {
5576 struct dentry *d_tracer;
5577
5578 d_tracer = tracing_init_dentry();
5579 if (IS_ERR(d_tracer))
5580 return 0;
5581
5582 ftrace_init_dyn_tracefs(d_tracer);
5583
5584 trace_create_file("set_ftrace_pid", 0644, d_tracer,
5585 NULL, &ftrace_pid_fops);
5586
5587 ftrace_profile_tracefs(d_tracer);
5588
5589 return 0;
5590 }
5591 fs_initcall(ftrace_init_tracefs);
5592
5593 /**
5594 * ftrace_kill - kill ftrace
5595 *
5596 * This function should be used by panic code. It stops ftrace
5597 * but in a not so nice way. If you need to simply kill ftrace
5598 * from a non-atomic section, use ftrace_kill.
5599 */
5600 void ftrace_kill(void)
5601 {
5602 ftrace_disabled = 1;
5603 ftrace_enabled = 0;
5604 clear_ftrace_function();
5605 }
5606
5607 /**
5608 * Test if ftrace is dead or not.
5609 */
5610 int ftrace_is_dead(void)
5611 {
5612 return ftrace_disabled;
5613 }
5614
5615 /**
5616 * register_ftrace_function - register a function for profiling
5617 * @ops - ops structure that holds the function for profiling.
5618 *
5619 * Register a function to be called by all functions in the
5620 * kernel.
5621 *
5622 * Note: @ops->func and all the functions it calls must be labeled
5623 * with "notrace", otherwise it will go into a
5624 * recursive loop.
5625 */
5626 int register_ftrace_function(struct ftrace_ops *ops)
5627 {
5628 int ret = -1;
5629
5630 ftrace_ops_init(ops);
5631
5632 mutex_lock(&ftrace_lock);
5633
5634 ret = ftrace_startup(ops, 0);
5635
5636 mutex_unlock(&ftrace_lock);
5637
5638 return ret;
5639 }
5640 EXPORT_SYMBOL_GPL(register_ftrace_function);
5641
5642 /**
5643 * unregister_ftrace_function - unregister a function for profiling.
5644 * @ops - ops structure that holds the function to unregister
5645 *
5646 * Unregister a function that was added to be called by ftrace profiling.
5647 */
5648 int unregister_ftrace_function(struct ftrace_ops *ops)
5649 {
5650 int ret;
5651
5652 mutex_lock(&ftrace_lock);
5653 ret = ftrace_shutdown(ops, 0);
5654 mutex_unlock(&ftrace_lock);
5655
5656 return ret;
5657 }
5658 EXPORT_SYMBOL_GPL(unregister_ftrace_function);
5659
5660 int
5661 ftrace_enable_sysctl(struct ctl_table *table, int write,
5662 void __user *buffer, size_t *lenp,
5663 loff_t *ppos)
5664 {
5665 int ret = -ENODEV;
5666
5667 mutex_lock(&ftrace_lock);
5668
5669 if (unlikely(ftrace_disabled))
5670 goto out;
5671
5672 ret = proc_dointvec(table, write, buffer, lenp, ppos);
5673
5674 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
5675 goto out;
5676
5677 last_ftrace_enabled = !!ftrace_enabled;
5678
5679 if (ftrace_enabled) {
5680
5681 /* we are starting ftrace again */
5682 if (ftrace_ops_list != &ftrace_list_end)
5683 update_ftrace_function();
5684
5685 ftrace_startup_sysctl();
5686
5687 } else {
5688 /* stopping ftrace calls (just send to ftrace_stub) */
5689 ftrace_trace_function = ftrace_stub;
5690
5691 ftrace_shutdown_sysctl();
5692 }
5693
5694 out:
5695 mutex_unlock(&ftrace_lock);
5696 return ret;
5697 }
5698
5699 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5700
5701 static struct ftrace_ops graph_ops = {
5702 .func = ftrace_stub,
5703 .flags = FTRACE_OPS_FL_RECURSION_SAFE |
5704 FTRACE_OPS_FL_INITIALIZED |
5705 FTRACE_OPS_FL_PID |
5706 FTRACE_OPS_FL_STUB,
5707 #ifdef FTRACE_GRAPH_TRAMP_ADDR
5708 .trampoline = FTRACE_GRAPH_TRAMP_ADDR,
5709 /* trampoline_size is only needed for dynamically allocated tramps */
5710 #endif
5711 ASSIGN_OPS_HASH(graph_ops, &global_ops.local_hash)
5712 };
5713
5714 void ftrace_graph_sleep_time_control(bool enable)
5715 {
5716 fgraph_sleep_time = enable;
5717 }
5718
5719 void ftrace_graph_graph_time_control(bool enable)
5720 {
5721 fgraph_graph_time = enable;
5722 }
5723
5724 int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
5725 {
5726 return 0;
5727 }
5728
5729 /* The callbacks that hook a function */
5730 trace_func_graph_ret_t ftrace_graph_return =
5731 (trace_func_graph_ret_t)ftrace_stub;
5732 trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
5733 static trace_func_graph_ent_t __ftrace_graph_entry = ftrace_graph_entry_stub;
5734
5735 /* Try to assign a return stack array on FTRACE_RETSTACK_ALLOC_SIZE tasks. */
5736 static int alloc_retstack_tasklist(struct ftrace_ret_stack **ret_stack_list)
5737 {
5738 int i;
5739 int ret = 0;
5740 int start = 0, end = FTRACE_RETSTACK_ALLOC_SIZE;
5741 struct task_struct *g, *t;
5742
5743 for (i = 0; i < FTRACE_RETSTACK_ALLOC_SIZE; i++) {
5744 ret_stack_list[i] = kmalloc(FTRACE_RETFUNC_DEPTH
5745 * sizeof(struct ftrace_ret_stack),
5746 GFP_KERNEL);
5747 if (!ret_stack_list[i]) {
5748 start = 0;
5749 end = i;
5750 ret = -ENOMEM;
5751 goto free;
5752 }
5753 }
5754
5755 read_lock(&tasklist_lock);
5756 do_each_thread(g, t) {
5757 if (start == end) {
5758 ret = -EAGAIN;
5759 goto unlock;
5760 }
5761
5762 if (t->ret_stack == NULL) {
5763 atomic_set(&t->tracing_graph_pause, 0);
5764 atomic_set(&t->trace_overrun, 0);
5765 t->curr_ret_stack = -1;
5766 /* Make sure the tasks see the -1 first: */
5767 smp_wmb();
5768 t->ret_stack = ret_stack_list[start++];
5769 }
5770 } while_each_thread(g, t);
5771
5772 unlock:
5773 read_unlock(&tasklist_lock);
5774 free:
5775 for (i = start; i < end; i++)
5776 kfree(ret_stack_list[i]);
5777 return ret;
5778 }
5779
5780 static void
5781 ftrace_graph_probe_sched_switch(void *ignore, bool preempt,
5782 struct task_struct *prev, struct task_struct *next)
5783 {
5784 unsigned long long timestamp;
5785 int index;
5786
5787 /*
5788 * Does the user want to count the time a function was asleep.
5789 * If so, do not update the time stamps.
5790 */
5791 if (fgraph_sleep_time)
5792 return;
5793
5794 timestamp = trace_clock_local();
5795
5796 prev->ftrace_timestamp = timestamp;
5797
5798 /* only process tasks that we timestamped */
5799 if (!next->ftrace_timestamp)
5800 return;
5801
5802 /*
5803 * Update all the counters in next to make up for the
5804 * time next was sleeping.
5805 */
5806 timestamp -= next->ftrace_timestamp;
5807
5808 for (index = next->curr_ret_stack; index >= 0; index--)
5809 next->ret_stack[index].calltime += timestamp;
5810 }
5811
5812 /* Allocate a return stack for each task */
5813 static int start_graph_tracing(void)
5814 {
5815 struct ftrace_ret_stack **ret_stack_list;
5816 int ret, cpu;
5817
5818 ret_stack_list = kmalloc(FTRACE_RETSTACK_ALLOC_SIZE *
5819 sizeof(struct ftrace_ret_stack *),
5820 GFP_KERNEL);
5821
5822 if (!ret_stack_list)
5823 return -ENOMEM;
5824
5825 /* The cpu_boot init_task->ret_stack will never be freed */
5826 for_each_online_cpu(cpu) {
5827 if (!idle_task(cpu)->ret_stack)
5828 ftrace_graph_init_idle_task(idle_task(cpu), cpu);
5829 }
5830
5831 do {
5832 ret = alloc_retstack_tasklist(ret_stack_list);
5833 } while (ret == -EAGAIN);
5834
5835 if (!ret) {
5836 ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
5837 if (ret)
5838 pr_info("ftrace_graph: Couldn't activate tracepoint"
5839 " probe to kernel_sched_switch\n");
5840 }
5841
5842 kfree(ret_stack_list);
5843 return ret;
5844 }
5845
5846 /*
5847 * Hibernation protection.
5848 * The state of the current task is too much unstable during
5849 * suspend/restore to disk. We want to protect against that.
5850 */
5851 static int
5852 ftrace_suspend_notifier_call(struct notifier_block *bl, unsigned long state,
5853 void *unused)
5854 {
5855 switch (state) {
5856 case PM_HIBERNATION_PREPARE:
5857 pause_graph_tracing();
5858 break;
5859
5860 case PM_POST_HIBERNATION:
5861 unpause_graph_tracing();
5862 break;
5863 }
5864 return NOTIFY_DONE;
5865 }
5866
5867 static int ftrace_graph_entry_test(struct ftrace_graph_ent *trace)
5868 {
5869 if (!ftrace_ops_test(&global_ops, trace->func, NULL))
5870 return 0;
5871 return __ftrace_graph_entry(trace);
5872 }
5873
5874 /*
5875 * The function graph tracer should only trace the functions defined
5876 * by set_ftrace_filter and set_ftrace_notrace. If another function
5877 * tracer ops is registered, the graph tracer requires testing the
5878 * function against the global ops, and not just trace any function
5879 * that any ftrace_ops registered.
5880 */
5881 static void update_function_graph_func(void)
5882 {
5883 struct ftrace_ops *op;
5884 bool do_test = false;
5885
5886 /*
5887 * The graph and global ops share the same set of functions
5888 * to test. If any other ops is on the list, then
5889 * the graph tracing needs to test if its the function
5890 * it should call.
5891 */
5892 do_for_each_ftrace_op(op, ftrace_ops_list) {
5893 if (op != &global_ops && op != &graph_ops &&
5894 op != &ftrace_list_end) {
5895 do_test = true;
5896 /* in double loop, break out with goto */
5897 goto out;
5898 }
5899 } while_for_each_ftrace_op(op);
5900 out:
5901 if (do_test)
5902 ftrace_graph_entry = ftrace_graph_entry_test;
5903 else
5904 ftrace_graph_entry = __ftrace_graph_entry;
5905 }
5906
5907 static struct notifier_block ftrace_suspend_notifier = {
5908 .notifier_call = ftrace_suspend_notifier_call,
5909 };
5910
5911 int register_ftrace_graph(trace_func_graph_ret_t retfunc,
5912 trace_func_graph_ent_t entryfunc)
5913 {
5914 int ret = 0;
5915
5916 mutex_lock(&ftrace_lock);
5917
5918 /* we currently allow only one tracer registered at a time */
5919 if (ftrace_graph_active) {
5920 ret = -EBUSY;
5921 goto out;
5922 }
5923
5924 register_pm_notifier(&ftrace_suspend_notifier);
5925
5926 ftrace_graph_active++;
5927 ret = start_graph_tracing();
5928 if (ret) {
5929 ftrace_graph_active--;
5930 goto out;
5931 }
5932
5933 ftrace_graph_return = retfunc;
5934
5935 /*
5936 * Update the indirect function to the entryfunc, and the
5937 * function that gets called to the entry_test first. Then
5938 * call the update fgraph entry function to determine if
5939 * the entryfunc should be called directly or not.
5940 */
5941 __ftrace_graph_entry = entryfunc;
5942 ftrace_graph_entry = ftrace_graph_entry_test;
5943 update_function_graph_func();
5944
5945 ret = ftrace_startup(&graph_ops, FTRACE_START_FUNC_RET);
5946 out:
5947 mutex_unlock(&ftrace_lock);
5948 return ret;
5949 }
5950
5951 void unregister_ftrace_graph(void)
5952 {
5953 mutex_lock(&ftrace_lock);
5954
5955 if (unlikely(!ftrace_graph_active))
5956 goto out;
5957
5958 ftrace_graph_active--;
5959 ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
5960 ftrace_graph_entry = ftrace_graph_entry_stub;
5961 __ftrace_graph_entry = ftrace_graph_entry_stub;
5962 ftrace_shutdown(&graph_ops, FTRACE_STOP_FUNC_RET);
5963 unregister_pm_notifier(&ftrace_suspend_notifier);
5964 unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
5965
5966 #ifdef CONFIG_DYNAMIC_FTRACE
5967 /*
5968 * Function graph does not allocate the trampoline, but
5969 * other global_ops do. We need to reset the ALLOC_TRAMP flag
5970 * if one was used.
5971 */
5972 global_ops.trampoline = save_global_trampoline;
5973 if (save_global_flags & FTRACE_OPS_FL_ALLOC_TRAMP)
5974 global_ops.flags |= FTRACE_OPS_FL_ALLOC_TRAMP;
5975 #endif
5976
5977 out:
5978 mutex_unlock(&ftrace_lock);
5979 }
5980
5981 static DEFINE_PER_CPU(struct ftrace_ret_stack *, idle_ret_stack);
5982
5983 static void
5984 graph_init_task(struct task_struct *t, struct ftrace_ret_stack *ret_stack)
5985 {
5986 atomic_set(&t->tracing_graph_pause, 0);
5987 atomic_set(&t->trace_overrun, 0);
5988 t->ftrace_timestamp = 0;
5989 /* make curr_ret_stack visible before we add the ret_stack */
5990 smp_wmb();
5991 t->ret_stack = ret_stack;
5992 }
5993
5994 /*
5995 * Allocate a return stack for the idle task. May be the first
5996 * time through, or it may be done by CPU hotplug online.
5997 */
5998 void ftrace_graph_init_idle_task(struct task_struct *t, int cpu)
5999 {
6000 t->curr_ret_stack = -1;
6001 /*
6002 * The idle task has no parent, it either has its own
6003 * stack or no stack at all.
6004 */
6005 if (t->ret_stack)
6006 WARN_ON(t->ret_stack != per_cpu(idle_ret_stack, cpu));
6007
6008 if (ftrace_graph_active) {
6009 struct ftrace_ret_stack *ret_stack;
6010
6011 ret_stack = per_cpu(idle_ret_stack, cpu);
6012 if (!ret_stack) {
6013 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
6014 * sizeof(struct ftrace_ret_stack),
6015 GFP_KERNEL);
6016 if (!ret_stack)
6017 return;
6018 per_cpu(idle_ret_stack, cpu) = ret_stack;
6019 }
6020 graph_init_task(t, ret_stack);
6021 }
6022 }
6023
6024 /* Allocate a return stack for newly created task */
6025 void ftrace_graph_init_task(struct task_struct *t)
6026 {
6027 /* Make sure we do not use the parent ret_stack */
6028 t->ret_stack = NULL;
6029 t->curr_ret_stack = -1;
6030
6031 if (ftrace_graph_active) {
6032 struct ftrace_ret_stack *ret_stack;
6033
6034 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
6035 * sizeof(struct ftrace_ret_stack),
6036 GFP_KERNEL);
6037 if (!ret_stack)
6038 return;
6039 graph_init_task(t, ret_stack);
6040 }
6041 }
6042
6043 void ftrace_graph_exit_task(struct task_struct *t)
6044 {
6045 struct ftrace_ret_stack *ret_stack = t->ret_stack;
6046
6047 t->ret_stack = NULL;
6048 /* NULL must become visible to IRQs before we free it: */
6049 barrier();
6050
6051 kfree(ret_stack);
6052 }
6053 #endif