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