]> git.proxmox.com Git - mirror_ubuntu-eoan-kernel.git/blob - kernel/trace/ftrace.c
tracing: Add ftrace_graph_notrace boot parameter
[mirror_ubuntu-eoan-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 i;
1310
1311 /*
1312 * If the new source is empty, just free dst and assign it
1313 * the empty_hash.
1314 */
1315 if (!src->count) {
1316 new_hash = EMPTY_HASH;
1317 goto update;
1318 }
1319
1320 /*
1321 * Make the hash size about 1/2 the # found
1322 */
1323 for (size /= 2; size; size >>= 1)
1324 bits++;
1325
1326 /* Don't allocate too much */
1327 if (bits > FTRACE_HASH_MAX_BITS)
1328 bits = FTRACE_HASH_MAX_BITS;
1329
1330 new_hash = alloc_ftrace_hash(bits);
1331 if (!new_hash)
1332 return -ENOMEM;
1333
1334 size = 1 << src->size_bits;
1335 for (i = 0; i < size; i++) {
1336 hhd = &src->buckets[i];
1337 hlist_for_each_entry_safe(entry, tn, hhd, hlist) {
1338 remove_hash_entry(src, entry);
1339 __add_hash_entry(new_hash, entry);
1340 }
1341 }
1342
1343 update:
1344 /*
1345 * Remove the current set, update the hash and add
1346 * them back.
1347 */
1348 ftrace_hash_rec_disable(ops, enable);
1349
1350 old_hash = *dst;
1351 rcu_assign_pointer(*dst, new_hash);
1352 free_ftrace_hash_rcu(old_hash);
1353
1354 ftrace_hash_rec_enable(ops, enable);
1355
1356 return 0;
1357 }
1358
1359 /*
1360 * Test the hashes for this ops to see if we want to call
1361 * the ops->func or not.
1362 *
1363 * It's a match if the ip is in the ops->filter_hash or
1364 * the filter_hash does not exist or is empty,
1365 * AND
1366 * the ip is not in the ops->notrace_hash.
1367 *
1368 * This needs to be called with preemption disabled as
1369 * the hashes are freed with call_rcu_sched().
1370 */
1371 static int
1372 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
1373 {
1374 struct ftrace_hash *filter_hash;
1375 struct ftrace_hash *notrace_hash;
1376 int ret;
1377
1378 #ifdef CONFIG_DYNAMIC_FTRACE_WITH_REGS
1379 /*
1380 * There's a small race when adding ops that the ftrace handler
1381 * that wants regs, may be called without them. We can not
1382 * allow that handler to be called if regs is NULL.
1383 */
1384 if (regs == NULL && (ops->flags & FTRACE_OPS_FL_SAVE_REGS))
1385 return 0;
1386 #endif
1387
1388 filter_hash = rcu_dereference_raw_notrace(ops->filter_hash);
1389 notrace_hash = rcu_dereference_raw_notrace(ops->notrace_hash);
1390
1391 if ((ftrace_hash_empty(filter_hash) ||
1392 ftrace_lookup_ip(filter_hash, ip)) &&
1393 (ftrace_hash_empty(notrace_hash) ||
1394 !ftrace_lookup_ip(notrace_hash, ip)))
1395 ret = 1;
1396 else
1397 ret = 0;
1398
1399 return ret;
1400 }
1401
1402 /*
1403 * This is a double for. Do not use 'break' to break out of the loop,
1404 * you must use a goto.
1405 */
1406 #define do_for_each_ftrace_rec(pg, rec) \
1407 for (pg = ftrace_pages_start; pg; pg = pg->next) { \
1408 int _____i; \
1409 for (_____i = 0; _____i < pg->index; _____i++) { \
1410 rec = &pg->records[_____i];
1411
1412 #define while_for_each_ftrace_rec() \
1413 } \
1414 }
1415
1416
1417 static int ftrace_cmp_recs(const void *a, const void *b)
1418 {
1419 const struct dyn_ftrace *key = a;
1420 const struct dyn_ftrace *rec = b;
1421
1422 if (key->flags < rec->ip)
1423 return -1;
1424 if (key->ip >= rec->ip + MCOUNT_INSN_SIZE)
1425 return 1;
1426 return 0;
1427 }
1428
1429 static unsigned long ftrace_location_range(unsigned long start, unsigned long end)
1430 {
1431 struct ftrace_page *pg;
1432 struct dyn_ftrace *rec;
1433 struct dyn_ftrace key;
1434
1435 key.ip = start;
1436 key.flags = end; /* overload flags, as it is unsigned long */
1437
1438 for (pg = ftrace_pages_start; pg; pg = pg->next) {
1439 if (end < pg->records[0].ip ||
1440 start >= (pg->records[pg->index - 1].ip + MCOUNT_INSN_SIZE))
1441 continue;
1442 rec = bsearch(&key, pg->records, pg->index,
1443 sizeof(struct dyn_ftrace),
1444 ftrace_cmp_recs);
1445 if (rec)
1446 return rec->ip;
1447 }
1448
1449 return 0;
1450 }
1451
1452 /**
1453 * ftrace_location - return true if the ip giving is a traced location
1454 * @ip: the instruction pointer to check
1455 *
1456 * Returns rec->ip if @ip given is a pointer to a ftrace location.
1457 * That is, the instruction that is either a NOP or call to
1458 * the function tracer. It checks the ftrace internal tables to
1459 * determine if the address belongs or not.
1460 */
1461 unsigned long ftrace_location(unsigned long ip)
1462 {
1463 return ftrace_location_range(ip, ip);
1464 }
1465
1466 /**
1467 * ftrace_text_reserved - return true if range contains an ftrace location
1468 * @start: start of range to search
1469 * @end: end of range to search (inclusive). @end points to the last byte to check.
1470 *
1471 * Returns 1 if @start and @end contains a ftrace location.
1472 * That is, the instruction that is either a NOP or call to
1473 * the function tracer. It checks the ftrace internal tables to
1474 * determine if the address belongs or not.
1475 */
1476 int ftrace_text_reserved(const void *start, const void *end)
1477 {
1478 unsigned long ret;
1479
1480 ret = ftrace_location_range((unsigned long)start,
1481 (unsigned long)end);
1482
1483 return (int)!!ret;
1484 }
1485
1486 /* Test if ops registered to this rec needs regs */
1487 static bool test_rec_ops_needs_regs(struct dyn_ftrace *rec)
1488 {
1489 struct ftrace_ops *ops;
1490 bool keep_regs = false;
1491
1492 for (ops = ftrace_ops_list;
1493 ops != &ftrace_list_end; ops = ops->next) {
1494 /* pass rec in as regs to have non-NULL val */
1495 if (ftrace_ops_test(ops, rec->ip, rec)) {
1496 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1497 keep_regs = true;
1498 break;
1499 }
1500 }
1501 }
1502
1503 return keep_regs;
1504 }
1505
1506 static void ftrace_remove_tramp(struct ftrace_ops *ops,
1507 struct dyn_ftrace *rec)
1508 {
1509 struct ftrace_func_entry *entry;
1510
1511 entry = ftrace_lookup_ip(ops->tramp_hash, rec->ip);
1512 if (!entry)
1513 return;
1514
1515 /*
1516 * The tramp_hash entry will be removed at time
1517 * of update.
1518 */
1519 ops->trampolines--;
1520 rec->flags &= ~FTRACE_FL_TRAMP;
1521 }
1522
1523 static void ftrace_clear_tramps(struct dyn_ftrace *rec)
1524 {
1525 struct ftrace_ops *op;
1526
1527 do_for_each_ftrace_op(op, ftrace_ops_list) {
1528 if (op->trampolines)
1529 ftrace_remove_tramp(op, rec);
1530 } while_for_each_ftrace_op(op);
1531 }
1532
1533 static void __ftrace_hash_rec_update(struct ftrace_ops *ops,
1534 int filter_hash,
1535 bool inc)
1536 {
1537 struct ftrace_hash *hash;
1538 struct ftrace_hash *other_hash;
1539 struct ftrace_page *pg;
1540 struct dyn_ftrace *rec;
1541 int count = 0;
1542 int all = 0;
1543
1544 /* Only update if the ops has been registered */
1545 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
1546 return;
1547
1548 /*
1549 * In the filter_hash case:
1550 * If the count is zero, we update all records.
1551 * Otherwise we just update the items in the hash.
1552 *
1553 * In the notrace_hash case:
1554 * We enable the update in the hash.
1555 * As disabling notrace means enabling the tracing,
1556 * and enabling notrace means disabling, the inc variable
1557 * gets inversed.
1558 */
1559 if (filter_hash) {
1560 hash = ops->filter_hash;
1561 other_hash = ops->notrace_hash;
1562 if (ftrace_hash_empty(hash))
1563 all = 1;
1564 } else {
1565 inc = !inc;
1566 hash = ops->notrace_hash;
1567 other_hash = ops->filter_hash;
1568 /*
1569 * If the notrace hash has no items,
1570 * then there's nothing to do.
1571 */
1572 if (ftrace_hash_empty(hash))
1573 return;
1574 }
1575
1576 do_for_each_ftrace_rec(pg, rec) {
1577 int in_other_hash = 0;
1578 int in_hash = 0;
1579 int match = 0;
1580
1581 if (all) {
1582 /*
1583 * Only the filter_hash affects all records.
1584 * Update if the record is not in the notrace hash.
1585 */
1586 if (!other_hash || !ftrace_lookup_ip(other_hash, rec->ip))
1587 match = 1;
1588 } else {
1589 in_hash = !!ftrace_lookup_ip(hash, rec->ip);
1590 in_other_hash = !!ftrace_lookup_ip(other_hash, rec->ip);
1591
1592 /*
1593 * If filter_hash is set, we want to match all functions
1594 * that are in the hash but not in the other hash.
1595 *
1596 * If filter_hash is not set, then we are decrementing.
1597 * That means we match anything that is in the hash
1598 * and also in the other_hash. That is, we need to turn
1599 * off functions in the other hash because they are disabled
1600 * by this hash.
1601 */
1602 if (filter_hash && in_hash && !in_other_hash)
1603 match = 1;
1604 else if (!filter_hash && in_hash &&
1605 (in_other_hash || ftrace_hash_empty(other_hash)))
1606 match = 1;
1607 }
1608 if (!match)
1609 continue;
1610
1611 if (inc) {
1612 rec->flags++;
1613 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == FTRACE_REF_MAX))
1614 return;
1615
1616 /*
1617 * If there's only a single callback registered to a
1618 * function, and the ops has a trampoline registered
1619 * for it, then we can call it directly.
1620 */
1621 if (ftrace_rec_count(rec) == 1 && ops->trampoline) {
1622 rec->flags |= FTRACE_FL_TRAMP;
1623 ops->trampolines++;
1624 } else {
1625 /*
1626 * If we are adding another function callback
1627 * to this function, and the previous had a
1628 * trampoline used, then we need to go back to
1629 * the default trampoline.
1630 */
1631 rec->flags &= ~FTRACE_FL_TRAMP;
1632
1633 /* remove trampolines from any ops for this rec */
1634 ftrace_clear_tramps(rec);
1635 }
1636
1637 /*
1638 * If any ops wants regs saved for this function
1639 * then all ops will get saved regs.
1640 */
1641 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
1642 rec->flags |= FTRACE_FL_REGS;
1643 } else {
1644 if (FTRACE_WARN_ON(ftrace_rec_count(rec) == 0))
1645 return;
1646 rec->flags--;
1647
1648 if (ops->trampoline && !ftrace_rec_count(rec))
1649 ftrace_remove_tramp(ops, rec);
1650
1651 /*
1652 * If the rec had REGS enabled and the ops that is
1653 * being removed had REGS set, then see if there is
1654 * still any ops for this record that wants regs.
1655 * If not, we can stop recording them.
1656 */
1657 if (ftrace_rec_count(rec) > 0 &&
1658 rec->flags & FTRACE_FL_REGS &&
1659 ops->flags & FTRACE_OPS_FL_SAVE_REGS) {
1660 if (!test_rec_ops_needs_regs(rec))
1661 rec->flags &= ~FTRACE_FL_REGS;
1662 }
1663
1664 /*
1665 * flags will be cleared in ftrace_check_record()
1666 * if rec count is zero.
1667 */
1668 }
1669 count++;
1670 /* Shortcut, if we handled all records, we are done. */
1671 if (!all && count == hash->count)
1672 return;
1673 } while_for_each_ftrace_rec();
1674 }
1675
1676 static void ftrace_hash_rec_disable(struct ftrace_ops *ops,
1677 int filter_hash)
1678 {
1679 __ftrace_hash_rec_update(ops, filter_hash, 0);
1680 }
1681
1682 static void ftrace_hash_rec_enable(struct ftrace_ops *ops,
1683 int filter_hash)
1684 {
1685 __ftrace_hash_rec_update(ops, filter_hash, 1);
1686 }
1687
1688 static void print_ip_ins(const char *fmt, unsigned char *p)
1689 {
1690 int i;
1691
1692 printk(KERN_CONT "%s", fmt);
1693
1694 for (i = 0; i < MCOUNT_INSN_SIZE; i++)
1695 printk(KERN_CONT "%s%02x", i ? ":" : "", p[i]);
1696 }
1697
1698 /**
1699 * ftrace_bug - report and shutdown function tracer
1700 * @failed: The failed type (EFAULT, EINVAL, EPERM)
1701 * @ip: The address that failed
1702 *
1703 * The arch code that enables or disables the function tracing
1704 * can call ftrace_bug() when it has detected a problem in
1705 * modifying the code. @failed should be one of either:
1706 * EFAULT - if the problem happens on reading the @ip address
1707 * EINVAL - if what is read at @ip is not what was expected
1708 * EPERM - if the problem happens on writting to the @ip address
1709 */
1710 void ftrace_bug(int failed, unsigned long ip)
1711 {
1712 switch (failed) {
1713 case -EFAULT:
1714 FTRACE_WARN_ON_ONCE(1);
1715 pr_info("ftrace faulted on modifying ");
1716 print_ip_sym(ip);
1717 break;
1718 case -EINVAL:
1719 FTRACE_WARN_ON_ONCE(1);
1720 pr_info("ftrace failed to modify ");
1721 print_ip_sym(ip);
1722 print_ip_ins(" actual: ", (unsigned char *)ip);
1723 printk(KERN_CONT "\n");
1724 break;
1725 case -EPERM:
1726 FTRACE_WARN_ON_ONCE(1);
1727 pr_info("ftrace faulted on writing ");
1728 print_ip_sym(ip);
1729 break;
1730 default:
1731 FTRACE_WARN_ON_ONCE(1);
1732 pr_info("ftrace faulted on unknown error ");
1733 print_ip_sym(ip);
1734 }
1735 }
1736
1737 static int ftrace_check_record(struct dyn_ftrace *rec, int enable, int update)
1738 {
1739 unsigned long flag = 0UL;
1740
1741 /*
1742 * If we are updating calls:
1743 *
1744 * If the record has a ref count, then we need to enable it
1745 * because someone is using it.
1746 *
1747 * Otherwise we make sure its disabled.
1748 *
1749 * If we are disabling calls, then disable all records that
1750 * are enabled.
1751 */
1752 if (enable && ftrace_rec_count(rec))
1753 flag = FTRACE_FL_ENABLED;
1754
1755 /*
1756 * If enabling and the REGS flag does not match the REGS_EN, or
1757 * the TRAMP flag doesn't match the TRAMP_EN, then do not ignore
1758 * this record. Set flags to fail the compare against ENABLED.
1759 */
1760 if (flag) {
1761 if (!(rec->flags & FTRACE_FL_REGS) !=
1762 !(rec->flags & FTRACE_FL_REGS_EN))
1763 flag |= FTRACE_FL_REGS;
1764
1765 if (!(rec->flags & FTRACE_FL_TRAMP) !=
1766 !(rec->flags & FTRACE_FL_TRAMP_EN))
1767 flag |= FTRACE_FL_TRAMP;
1768 }
1769
1770 /* If the state of this record hasn't changed, then do nothing */
1771 if ((rec->flags & FTRACE_FL_ENABLED) == flag)
1772 return FTRACE_UPDATE_IGNORE;
1773
1774 if (flag) {
1775 /* Save off if rec is being enabled (for return value) */
1776 flag ^= rec->flags & FTRACE_FL_ENABLED;
1777
1778 if (update) {
1779 rec->flags |= FTRACE_FL_ENABLED;
1780 if (flag & FTRACE_FL_REGS) {
1781 if (rec->flags & FTRACE_FL_REGS)
1782 rec->flags |= FTRACE_FL_REGS_EN;
1783 else
1784 rec->flags &= ~FTRACE_FL_REGS_EN;
1785 }
1786 if (flag & FTRACE_FL_TRAMP) {
1787 if (rec->flags & FTRACE_FL_TRAMP)
1788 rec->flags |= FTRACE_FL_TRAMP_EN;
1789 else
1790 rec->flags &= ~FTRACE_FL_TRAMP_EN;
1791 }
1792 }
1793
1794 /*
1795 * If this record is being updated from a nop, then
1796 * return UPDATE_MAKE_CALL.
1797 * Otherwise,
1798 * return UPDATE_MODIFY_CALL to tell the caller to convert
1799 * from the save regs, to a non-save regs function or
1800 * vice versa, or from a trampoline call.
1801 */
1802 if (flag & FTRACE_FL_ENABLED)
1803 return FTRACE_UPDATE_MAKE_CALL;
1804
1805 return FTRACE_UPDATE_MODIFY_CALL;
1806 }
1807
1808 if (update) {
1809 /* If there's no more users, clear all flags */
1810 if (!ftrace_rec_count(rec))
1811 rec->flags = 0;
1812 else
1813 /* Just disable the record (keep REGS state) */
1814 rec->flags &= ~FTRACE_FL_ENABLED;
1815 }
1816
1817 return FTRACE_UPDATE_MAKE_NOP;
1818 }
1819
1820 /**
1821 * ftrace_update_record, set a record that now is tracing or not
1822 * @rec: the record to update
1823 * @enable: set to 1 if the record is tracing, zero to force disable
1824 *
1825 * The records that represent all functions that can be traced need
1826 * to be updated when tracing has been enabled.
1827 */
1828 int ftrace_update_record(struct dyn_ftrace *rec, int enable)
1829 {
1830 return ftrace_check_record(rec, enable, 1);
1831 }
1832
1833 /**
1834 * ftrace_test_record, check if the record has been enabled or not
1835 * @rec: the record to test
1836 * @enable: set to 1 to check if enabled, 0 if it is disabled
1837 *
1838 * The arch code may need to test if a record is already set to
1839 * tracing to determine how to modify the function code that it
1840 * represents.
1841 */
1842 int ftrace_test_record(struct dyn_ftrace *rec, int enable)
1843 {
1844 return ftrace_check_record(rec, enable, 0);
1845 }
1846
1847 static struct ftrace_ops *
1848 ftrace_find_tramp_ops_curr(struct dyn_ftrace *rec)
1849 {
1850 struct ftrace_ops *op;
1851
1852 /* Removed ops need to be tested first */
1853 if (removed_ops && removed_ops->tramp_hash) {
1854 if (ftrace_lookup_ip(removed_ops->tramp_hash, rec->ip))
1855 return removed_ops;
1856 }
1857
1858 do_for_each_ftrace_op(op, ftrace_ops_list) {
1859 if (!op->tramp_hash)
1860 continue;
1861
1862 if (ftrace_lookup_ip(op->tramp_hash, rec->ip))
1863 return op;
1864
1865 } while_for_each_ftrace_op(op);
1866
1867 return NULL;
1868 }
1869
1870 static struct ftrace_ops *
1871 ftrace_find_tramp_ops_new(struct dyn_ftrace *rec)
1872 {
1873 struct ftrace_ops *op;
1874
1875 do_for_each_ftrace_op(op, ftrace_ops_list) {
1876 /* pass rec in as regs to have non-NULL val */
1877 if (ftrace_ops_test(op, rec->ip, rec))
1878 return op;
1879 } while_for_each_ftrace_op(op);
1880
1881 return NULL;
1882 }
1883
1884 /**
1885 * ftrace_get_addr_new - Get the call address to set to
1886 * @rec: The ftrace record descriptor
1887 *
1888 * If the record has the FTRACE_FL_REGS set, that means that it
1889 * wants to convert to a callback that saves all regs. If FTRACE_FL_REGS
1890 * is not not set, then it wants to convert to the normal callback.
1891 *
1892 * Returns the address of the trampoline to set to
1893 */
1894 unsigned long ftrace_get_addr_new(struct dyn_ftrace *rec)
1895 {
1896 struct ftrace_ops *ops;
1897
1898 /* Trampolines take precedence over regs */
1899 if (rec->flags & FTRACE_FL_TRAMP) {
1900 ops = ftrace_find_tramp_ops_new(rec);
1901 if (FTRACE_WARN_ON(!ops || !ops->trampoline)) {
1902 pr_warning("Bad trampoline accounting at: %p (%pS)\n",
1903 (void *)rec->ip, (void *)rec->ip);
1904 /* Ftrace is shutting down, return anything */
1905 return (unsigned long)FTRACE_ADDR;
1906 }
1907 return ops->trampoline;
1908 }
1909
1910 if (rec->flags & FTRACE_FL_REGS)
1911 return (unsigned long)FTRACE_REGS_ADDR;
1912 else
1913 return (unsigned long)FTRACE_ADDR;
1914 }
1915
1916 /**
1917 * ftrace_get_addr_curr - Get the call address that is already there
1918 * @rec: The ftrace record descriptor
1919 *
1920 * The FTRACE_FL_REGS_EN is set when the record already points to
1921 * a function that saves all the regs. Basically the '_EN' version
1922 * represents the current state of the function.
1923 *
1924 * Returns the address of the trampoline that is currently being called
1925 */
1926 unsigned long ftrace_get_addr_curr(struct dyn_ftrace *rec)
1927 {
1928 struct ftrace_ops *ops;
1929
1930 /* Trampolines take precedence over regs */
1931 if (rec->flags & FTRACE_FL_TRAMP_EN) {
1932 ops = ftrace_find_tramp_ops_curr(rec);
1933 if (FTRACE_WARN_ON(!ops)) {
1934 pr_warning("Bad trampoline accounting at: %p (%pS)\n",
1935 (void *)rec->ip, (void *)rec->ip);
1936 /* Ftrace is shutting down, return anything */
1937 return (unsigned long)FTRACE_ADDR;
1938 }
1939 return ops->trampoline;
1940 }
1941
1942 if (rec->flags & FTRACE_FL_REGS_EN)
1943 return (unsigned long)FTRACE_REGS_ADDR;
1944 else
1945 return (unsigned long)FTRACE_ADDR;
1946 }
1947
1948 static int
1949 __ftrace_replace_code(struct dyn_ftrace *rec, int enable)
1950 {
1951 unsigned long ftrace_old_addr;
1952 unsigned long ftrace_addr;
1953 int ret;
1954
1955 ftrace_addr = ftrace_get_addr_new(rec);
1956
1957 /* This needs to be done before we call ftrace_update_record */
1958 ftrace_old_addr = ftrace_get_addr_curr(rec);
1959
1960 ret = ftrace_update_record(rec, enable);
1961
1962 switch (ret) {
1963 case FTRACE_UPDATE_IGNORE:
1964 return 0;
1965
1966 case FTRACE_UPDATE_MAKE_CALL:
1967 return ftrace_make_call(rec, ftrace_addr);
1968
1969 case FTRACE_UPDATE_MAKE_NOP:
1970 return ftrace_make_nop(NULL, rec, ftrace_addr);
1971
1972 case FTRACE_UPDATE_MODIFY_CALL:
1973 return ftrace_modify_call(rec, ftrace_old_addr, ftrace_addr);
1974 }
1975
1976 return -1; /* unknow ftrace bug */
1977 }
1978
1979 void __weak ftrace_replace_code(int enable)
1980 {
1981 struct dyn_ftrace *rec;
1982 struct ftrace_page *pg;
1983 int failed;
1984
1985 if (unlikely(ftrace_disabled))
1986 return;
1987
1988 do_for_each_ftrace_rec(pg, rec) {
1989 failed = __ftrace_replace_code(rec, enable);
1990 if (failed) {
1991 ftrace_bug(failed, rec->ip);
1992 /* Stop processing */
1993 return;
1994 }
1995 } while_for_each_ftrace_rec();
1996 }
1997
1998 struct ftrace_rec_iter {
1999 struct ftrace_page *pg;
2000 int index;
2001 };
2002
2003 /**
2004 * ftrace_rec_iter_start, start up iterating over traced functions
2005 *
2006 * Returns an iterator handle that is used to iterate over all
2007 * the records that represent address locations where functions
2008 * are traced.
2009 *
2010 * May return NULL if no records are available.
2011 */
2012 struct ftrace_rec_iter *ftrace_rec_iter_start(void)
2013 {
2014 /*
2015 * We only use a single iterator.
2016 * Protected by the ftrace_lock mutex.
2017 */
2018 static struct ftrace_rec_iter ftrace_rec_iter;
2019 struct ftrace_rec_iter *iter = &ftrace_rec_iter;
2020
2021 iter->pg = ftrace_pages_start;
2022 iter->index = 0;
2023
2024 /* Could have empty pages */
2025 while (iter->pg && !iter->pg->index)
2026 iter->pg = iter->pg->next;
2027
2028 if (!iter->pg)
2029 return NULL;
2030
2031 return iter;
2032 }
2033
2034 /**
2035 * ftrace_rec_iter_next, get the next record to process.
2036 * @iter: The handle to the iterator.
2037 *
2038 * Returns the next iterator after the given iterator @iter.
2039 */
2040 struct ftrace_rec_iter *ftrace_rec_iter_next(struct ftrace_rec_iter *iter)
2041 {
2042 iter->index++;
2043
2044 if (iter->index >= iter->pg->index) {
2045 iter->pg = iter->pg->next;
2046 iter->index = 0;
2047
2048 /* Could have empty pages */
2049 while (iter->pg && !iter->pg->index)
2050 iter->pg = iter->pg->next;
2051 }
2052
2053 if (!iter->pg)
2054 return NULL;
2055
2056 return iter;
2057 }
2058
2059 /**
2060 * ftrace_rec_iter_record, get the record at the iterator location
2061 * @iter: The current iterator location
2062 *
2063 * Returns the record that the current @iter is at.
2064 */
2065 struct dyn_ftrace *ftrace_rec_iter_record(struct ftrace_rec_iter *iter)
2066 {
2067 return &iter->pg->records[iter->index];
2068 }
2069
2070 static int
2071 ftrace_code_disable(struct module *mod, struct dyn_ftrace *rec)
2072 {
2073 unsigned long ip;
2074 int ret;
2075
2076 ip = rec->ip;
2077
2078 if (unlikely(ftrace_disabled))
2079 return 0;
2080
2081 ret = ftrace_make_nop(mod, rec, MCOUNT_ADDR);
2082 if (ret) {
2083 ftrace_bug(ret, ip);
2084 return 0;
2085 }
2086 return 1;
2087 }
2088
2089 /*
2090 * archs can override this function if they must do something
2091 * before the modifying code is performed.
2092 */
2093 int __weak ftrace_arch_code_modify_prepare(void)
2094 {
2095 return 0;
2096 }
2097
2098 /*
2099 * archs can override this function if they must do something
2100 * after the modifying code is performed.
2101 */
2102 int __weak ftrace_arch_code_modify_post_process(void)
2103 {
2104 return 0;
2105 }
2106
2107 void ftrace_modify_all_code(int command)
2108 {
2109 int update = command & FTRACE_UPDATE_TRACE_FUNC;
2110 int err = 0;
2111
2112 /*
2113 * If the ftrace_caller calls a ftrace_ops func directly,
2114 * we need to make sure that it only traces functions it
2115 * expects to trace. When doing the switch of functions,
2116 * we need to update to the ftrace_ops_list_func first
2117 * before the transition between old and new calls are set,
2118 * as the ftrace_ops_list_func will check the ops hashes
2119 * to make sure the ops are having the right functions
2120 * traced.
2121 */
2122 if (update) {
2123 err = ftrace_update_ftrace_func(ftrace_ops_list_func);
2124 if (FTRACE_WARN_ON(err))
2125 return;
2126 }
2127
2128 if (command & FTRACE_UPDATE_CALLS)
2129 ftrace_replace_code(1);
2130 else if (command & FTRACE_DISABLE_CALLS)
2131 ftrace_replace_code(0);
2132
2133 if (update && ftrace_trace_function != ftrace_ops_list_func) {
2134 function_trace_op = set_function_trace_op;
2135 smp_wmb();
2136 /* If irqs are disabled, we are in stop machine */
2137 if (!irqs_disabled())
2138 smp_call_function(ftrace_sync_ipi, NULL, 1);
2139 err = ftrace_update_ftrace_func(ftrace_trace_function);
2140 if (FTRACE_WARN_ON(err))
2141 return;
2142 }
2143
2144 if (command & FTRACE_START_FUNC_RET)
2145 err = ftrace_enable_ftrace_graph_caller();
2146 else if (command & FTRACE_STOP_FUNC_RET)
2147 err = ftrace_disable_ftrace_graph_caller();
2148 FTRACE_WARN_ON(err);
2149 }
2150
2151 static int __ftrace_modify_code(void *data)
2152 {
2153 int *command = data;
2154
2155 ftrace_modify_all_code(*command);
2156
2157 return 0;
2158 }
2159
2160 /**
2161 * ftrace_run_stop_machine, go back to the stop machine method
2162 * @command: The command to tell ftrace what to do
2163 *
2164 * If an arch needs to fall back to the stop machine method, the
2165 * it can call this function.
2166 */
2167 void ftrace_run_stop_machine(int command)
2168 {
2169 stop_machine(__ftrace_modify_code, &command, NULL);
2170 }
2171
2172 /**
2173 * arch_ftrace_update_code, modify the code to trace or not trace
2174 * @command: The command that needs to be done
2175 *
2176 * Archs can override this function if it does not need to
2177 * run stop_machine() to modify code.
2178 */
2179 void __weak arch_ftrace_update_code(int command)
2180 {
2181 ftrace_run_stop_machine(command);
2182 }
2183
2184 static int ftrace_save_ops_tramp_hash(struct ftrace_ops *ops)
2185 {
2186 struct ftrace_page *pg;
2187 struct dyn_ftrace *rec;
2188 int size, bits;
2189 int ret;
2190
2191 size = ops->trampolines;
2192 bits = 0;
2193 /*
2194 * Make the hash size about 1/2 the # found
2195 */
2196 for (size /= 2; size; size >>= 1)
2197 bits++;
2198
2199 ops->tramp_hash = alloc_ftrace_hash(bits);
2200 /*
2201 * TODO: a failed allocation is going to screw up
2202 * the accounting of what needs to be modified
2203 * and not. For now, we kill ftrace if we fail
2204 * to allocate here. But there are ways around this,
2205 * but that will take a little more work.
2206 */
2207 if (!ops->tramp_hash)
2208 return -ENOMEM;
2209
2210 do_for_each_ftrace_rec(pg, rec) {
2211 if (ftrace_rec_count(rec) == 1 &&
2212 ftrace_ops_test(ops, rec->ip, rec)) {
2213
2214 /* This record had better have a trampoline */
2215 if (FTRACE_WARN_ON(!(rec->flags & FTRACE_FL_TRAMP_EN)))
2216 return -1;
2217
2218 ret = add_hash_entry(ops->tramp_hash, rec->ip);
2219 if (ret < 0)
2220 return ret;
2221 }
2222 } while_for_each_ftrace_rec();
2223
2224 return 0;
2225 }
2226
2227 static int ftrace_save_tramp_hashes(void)
2228 {
2229 struct ftrace_ops *op;
2230 int ret;
2231
2232 /*
2233 * Now that any trampoline is being used, we need to save the
2234 * hashes for the ops that have them. This allows the mapping
2235 * back from the record to the ops that has the trampoline to
2236 * know what code is being replaced. Modifying code must always
2237 * verify what it is changing.
2238 */
2239 do_for_each_ftrace_op(op, ftrace_ops_list) {
2240
2241 /* The tramp_hash is recreated each time. */
2242 free_ftrace_hash(op->tramp_hash);
2243 op->tramp_hash = NULL;
2244
2245 if (op->trampolines) {
2246 ret = ftrace_save_ops_tramp_hash(op);
2247 if (ret)
2248 return ret;
2249 }
2250
2251 } while_for_each_ftrace_op(op);
2252
2253 return 0;
2254 }
2255
2256 static void ftrace_run_update_code(int command)
2257 {
2258 int ret;
2259
2260 ret = ftrace_arch_code_modify_prepare();
2261 FTRACE_WARN_ON(ret);
2262 if (ret)
2263 return;
2264 /*
2265 * Do not call function tracer while we update the code.
2266 * We are in stop machine.
2267 */
2268 function_trace_stop++;
2269
2270 /*
2271 * By default we use stop_machine() to modify the code.
2272 * But archs can do what ever they want as long as it
2273 * is safe. The stop_machine() is the safest, but also
2274 * produces the most overhead.
2275 */
2276 arch_ftrace_update_code(command);
2277
2278 function_trace_stop--;
2279
2280 ret = ftrace_arch_code_modify_post_process();
2281 FTRACE_WARN_ON(ret);
2282
2283 ret = ftrace_save_tramp_hashes();
2284 FTRACE_WARN_ON(ret);
2285 }
2286
2287 static ftrace_func_t saved_ftrace_func;
2288 static int ftrace_start_up;
2289
2290 static void control_ops_free(struct ftrace_ops *ops)
2291 {
2292 free_percpu(ops->disabled);
2293 }
2294
2295 static void ftrace_startup_enable(int command)
2296 {
2297 if (saved_ftrace_func != ftrace_trace_function) {
2298 saved_ftrace_func = ftrace_trace_function;
2299 command |= FTRACE_UPDATE_TRACE_FUNC;
2300 }
2301
2302 if (!command || !ftrace_enabled)
2303 return;
2304
2305 ftrace_run_update_code(command);
2306 }
2307
2308 static int ftrace_startup(struct ftrace_ops *ops, int command)
2309 {
2310 int ret;
2311
2312 if (unlikely(ftrace_disabled))
2313 return -ENODEV;
2314
2315 ret = __register_ftrace_function(ops);
2316 if (ret)
2317 return ret;
2318
2319 ftrace_start_up++;
2320 command |= FTRACE_UPDATE_CALLS;
2321
2322 ops->flags |= FTRACE_OPS_FL_ENABLED;
2323
2324 ftrace_hash_rec_enable(ops, 1);
2325
2326 ftrace_startup_enable(command);
2327
2328 return 0;
2329 }
2330
2331 static int ftrace_shutdown(struct ftrace_ops *ops, int command)
2332 {
2333 int ret;
2334
2335 if (unlikely(ftrace_disabled))
2336 return -ENODEV;
2337
2338 ret = __unregister_ftrace_function(ops);
2339 if (ret)
2340 return ret;
2341
2342 ftrace_start_up--;
2343 /*
2344 * Just warn in case of unbalance, no need to kill ftrace, it's not
2345 * critical but the ftrace_call callers may be never nopped again after
2346 * further ftrace uses.
2347 */
2348 WARN_ON_ONCE(ftrace_start_up < 0);
2349
2350 ftrace_hash_rec_disable(ops, 1);
2351
2352 ops->flags &= ~FTRACE_OPS_FL_ENABLED;
2353
2354 command |= FTRACE_UPDATE_CALLS;
2355
2356 if (saved_ftrace_func != ftrace_trace_function) {
2357 saved_ftrace_func = ftrace_trace_function;
2358 command |= FTRACE_UPDATE_TRACE_FUNC;
2359 }
2360
2361 if (!command || !ftrace_enabled) {
2362 /*
2363 * If these are control ops, they still need their
2364 * per_cpu field freed. Since, function tracing is
2365 * not currently active, we can just free them
2366 * without synchronizing all CPUs.
2367 */
2368 if (ops->flags & FTRACE_OPS_FL_CONTROL)
2369 control_ops_free(ops);
2370 return 0;
2371 }
2372
2373 /*
2374 * If the ops uses a trampoline, then it needs to be
2375 * tested first on update.
2376 */
2377 removed_ops = ops;
2378
2379 ftrace_run_update_code(command);
2380
2381 removed_ops = NULL;
2382
2383 /*
2384 * Dynamic ops may be freed, we must make sure that all
2385 * callers are done before leaving this function.
2386 * The same goes for freeing the per_cpu data of the control
2387 * ops.
2388 *
2389 * Again, normal synchronize_sched() is not good enough.
2390 * We need to do a hard force of sched synchronization.
2391 * This is because we use preempt_disable() to do RCU, but
2392 * the function tracers can be called where RCU is not watching
2393 * (like before user_exit()). We can not rely on the RCU
2394 * infrastructure to do the synchronization, thus we must do it
2395 * ourselves.
2396 */
2397 if (ops->flags & (FTRACE_OPS_FL_DYNAMIC | FTRACE_OPS_FL_CONTROL)) {
2398 schedule_on_each_cpu(ftrace_sync);
2399
2400 if (ops->flags & FTRACE_OPS_FL_CONTROL)
2401 control_ops_free(ops);
2402 }
2403
2404 return 0;
2405 }
2406
2407 static void ftrace_startup_sysctl(void)
2408 {
2409 if (unlikely(ftrace_disabled))
2410 return;
2411
2412 /* Force update next time */
2413 saved_ftrace_func = NULL;
2414 /* ftrace_start_up is true if we want ftrace running */
2415 if (ftrace_start_up)
2416 ftrace_run_update_code(FTRACE_UPDATE_CALLS);
2417 }
2418
2419 static void ftrace_shutdown_sysctl(void)
2420 {
2421 if (unlikely(ftrace_disabled))
2422 return;
2423
2424 /* ftrace_start_up is true if ftrace is running */
2425 if (ftrace_start_up)
2426 ftrace_run_update_code(FTRACE_DISABLE_CALLS);
2427 }
2428
2429 static cycle_t ftrace_update_time;
2430 unsigned long ftrace_update_tot_cnt;
2431
2432 static inline int ops_traces_mod(struct ftrace_ops *ops)
2433 {
2434 /*
2435 * Filter_hash being empty will default to trace module.
2436 * But notrace hash requires a test of individual module functions.
2437 */
2438 return ftrace_hash_empty(ops->filter_hash) &&
2439 ftrace_hash_empty(ops->notrace_hash);
2440 }
2441
2442 /*
2443 * Check if the current ops references the record.
2444 *
2445 * If the ops traces all functions, then it was already accounted for.
2446 * If the ops does not trace the current record function, skip it.
2447 * If the ops ignores the function via notrace filter, skip it.
2448 */
2449 static inline bool
2450 ops_references_rec(struct ftrace_ops *ops, struct dyn_ftrace *rec)
2451 {
2452 /* If ops isn't enabled, ignore it */
2453 if (!(ops->flags & FTRACE_OPS_FL_ENABLED))
2454 return 0;
2455
2456 /* If ops traces all mods, we already accounted for it */
2457 if (ops_traces_mod(ops))
2458 return 0;
2459
2460 /* The function must be in the filter */
2461 if (!ftrace_hash_empty(ops->filter_hash) &&
2462 !ftrace_lookup_ip(ops->filter_hash, rec->ip))
2463 return 0;
2464
2465 /* If in notrace hash, we ignore it too */
2466 if (ftrace_lookup_ip(ops->notrace_hash, rec->ip))
2467 return 0;
2468
2469 return 1;
2470 }
2471
2472 static int referenced_filters(struct dyn_ftrace *rec)
2473 {
2474 struct ftrace_ops *ops;
2475 int cnt = 0;
2476
2477 for (ops = ftrace_ops_list; ops != &ftrace_list_end; ops = ops->next) {
2478 if (ops_references_rec(ops, rec))
2479 cnt++;
2480 }
2481
2482 return cnt;
2483 }
2484
2485 static int ftrace_update_code(struct module *mod, struct ftrace_page *new_pgs)
2486 {
2487 struct ftrace_page *pg;
2488 struct dyn_ftrace *p;
2489 cycle_t start, stop;
2490 unsigned long update_cnt = 0;
2491 unsigned long ref = 0;
2492 bool test = false;
2493 int i;
2494
2495 /*
2496 * When adding a module, we need to check if tracers are
2497 * currently enabled and if they are set to trace all functions.
2498 * If they are, we need to enable the module functions as well
2499 * as update the reference counts for those function records.
2500 */
2501 if (mod) {
2502 struct ftrace_ops *ops;
2503
2504 for (ops = ftrace_ops_list;
2505 ops != &ftrace_list_end; ops = ops->next) {
2506 if (ops->flags & FTRACE_OPS_FL_ENABLED) {
2507 if (ops_traces_mod(ops))
2508 ref++;
2509 else
2510 test = true;
2511 }
2512 }
2513 }
2514
2515 start = ftrace_now(raw_smp_processor_id());
2516
2517 for (pg = new_pgs; pg; pg = pg->next) {
2518
2519 for (i = 0; i < pg->index; i++) {
2520 int cnt = ref;
2521
2522 /* If something went wrong, bail without enabling anything */
2523 if (unlikely(ftrace_disabled))
2524 return -1;
2525
2526 p = &pg->records[i];
2527 if (test)
2528 cnt += referenced_filters(p);
2529 p->flags = cnt;
2530
2531 /*
2532 * Do the initial record conversion from mcount jump
2533 * to the NOP instructions.
2534 */
2535 if (!ftrace_code_disable(mod, p))
2536 break;
2537
2538 update_cnt++;
2539
2540 /*
2541 * If the tracing is enabled, go ahead and enable the record.
2542 *
2543 * The reason not to enable the record immediatelly is the
2544 * inherent check of ftrace_make_nop/ftrace_make_call for
2545 * correct previous instructions. Making first the NOP
2546 * conversion puts the module to the correct state, thus
2547 * passing the ftrace_make_call check.
2548 */
2549 if (ftrace_start_up && cnt) {
2550 int failed = __ftrace_replace_code(p, 1);
2551 if (failed)
2552 ftrace_bug(failed, p->ip);
2553 }
2554 }
2555 }
2556
2557 stop = ftrace_now(raw_smp_processor_id());
2558 ftrace_update_time = stop - start;
2559 ftrace_update_tot_cnt += update_cnt;
2560
2561 return 0;
2562 }
2563
2564 static int ftrace_allocate_records(struct ftrace_page *pg, int count)
2565 {
2566 int order;
2567 int cnt;
2568
2569 if (WARN_ON(!count))
2570 return -EINVAL;
2571
2572 order = get_count_order(DIV_ROUND_UP(count, ENTRIES_PER_PAGE));
2573
2574 /*
2575 * We want to fill as much as possible. No more than a page
2576 * may be empty.
2577 */
2578 while ((PAGE_SIZE << order) / ENTRY_SIZE >= count + ENTRIES_PER_PAGE)
2579 order--;
2580
2581 again:
2582 pg->records = (void *)__get_free_pages(GFP_KERNEL | __GFP_ZERO, order);
2583
2584 if (!pg->records) {
2585 /* if we can't allocate this size, try something smaller */
2586 if (!order)
2587 return -ENOMEM;
2588 order >>= 1;
2589 goto again;
2590 }
2591
2592 cnt = (PAGE_SIZE << order) / ENTRY_SIZE;
2593 pg->size = cnt;
2594
2595 if (cnt > count)
2596 cnt = count;
2597
2598 return cnt;
2599 }
2600
2601 static struct ftrace_page *
2602 ftrace_allocate_pages(unsigned long num_to_init)
2603 {
2604 struct ftrace_page *start_pg;
2605 struct ftrace_page *pg;
2606 int order;
2607 int cnt;
2608
2609 if (!num_to_init)
2610 return 0;
2611
2612 start_pg = pg = kzalloc(sizeof(*pg), GFP_KERNEL);
2613 if (!pg)
2614 return NULL;
2615
2616 /*
2617 * Try to allocate as much as possible in one continues
2618 * location that fills in all of the space. We want to
2619 * waste as little space as possible.
2620 */
2621 for (;;) {
2622 cnt = ftrace_allocate_records(pg, num_to_init);
2623 if (cnt < 0)
2624 goto free_pages;
2625
2626 num_to_init -= cnt;
2627 if (!num_to_init)
2628 break;
2629
2630 pg->next = kzalloc(sizeof(*pg), GFP_KERNEL);
2631 if (!pg->next)
2632 goto free_pages;
2633
2634 pg = pg->next;
2635 }
2636
2637 return start_pg;
2638
2639 free_pages:
2640 pg = start_pg;
2641 while (pg) {
2642 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
2643 free_pages((unsigned long)pg->records, order);
2644 start_pg = pg->next;
2645 kfree(pg);
2646 pg = start_pg;
2647 }
2648 pr_info("ftrace: FAILED to allocate memory for functions\n");
2649 return NULL;
2650 }
2651
2652 #define FTRACE_BUFF_MAX (KSYM_SYMBOL_LEN+4) /* room for wildcards */
2653
2654 struct ftrace_iterator {
2655 loff_t pos;
2656 loff_t func_pos;
2657 struct ftrace_page *pg;
2658 struct dyn_ftrace *func;
2659 struct ftrace_func_probe *probe;
2660 struct trace_parser parser;
2661 struct ftrace_hash *hash;
2662 struct ftrace_ops *ops;
2663 int hidx;
2664 int idx;
2665 unsigned flags;
2666 };
2667
2668 static void *
2669 t_hash_next(struct seq_file *m, loff_t *pos)
2670 {
2671 struct ftrace_iterator *iter = m->private;
2672 struct hlist_node *hnd = NULL;
2673 struct hlist_head *hhd;
2674
2675 (*pos)++;
2676 iter->pos = *pos;
2677
2678 if (iter->probe)
2679 hnd = &iter->probe->node;
2680 retry:
2681 if (iter->hidx >= FTRACE_FUNC_HASHSIZE)
2682 return NULL;
2683
2684 hhd = &ftrace_func_hash[iter->hidx];
2685
2686 if (hlist_empty(hhd)) {
2687 iter->hidx++;
2688 hnd = NULL;
2689 goto retry;
2690 }
2691
2692 if (!hnd)
2693 hnd = hhd->first;
2694 else {
2695 hnd = hnd->next;
2696 if (!hnd) {
2697 iter->hidx++;
2698 goto retry;
2699 }
2700 }
2701
2702 if (WARN_ON_ONCE(!hnd))
2703 return NULL;
2704
2705 iter->probe = hlist_entry(hnd, struct ftrace_func_probe, node);
2706
2707 return iter;
2708 }
2709
2710 static void *t_hash_start(struct seq_file *m, loff_t *pos)
2711 {
2712 struct ftrace_iterator *iter = m->private;
2713 void *p = NULL;
2714 loff_t l;
2715
2716 if (!(iter->flags & FTRACE_ITER_DO_HASH))
2717 return NULL;
2718
2719 if (iter->func_pos > *pos)
2720 return NULL;
2721
2722 iter->hidx = 0;
2723 for (l = 0; l <= (*pos - iter->func_pos); ) {
2724 p = t_hash_next(m, &l);
2725 if (!p)
2726 break;
2727 }
2728 if (!p)
2729 return NULL;
2730
2731 /* Only set this if we have an item */
2732 iter->flags |= FTRACE_ITER_HASH;
2733
2734 return iter;
2735 }
2736
2737 static int
2738 t_hash_show(struct seq_file *m, struct ftrace_iterator *iter)
2739 {
2740 struct ftrace_func_probe *rec;
2741
2742 rec = iter->probe;
2743 if (WARN_ON_ONCE(!rec))
2744 return -EIO;
2745
2746 if (rec->ops->print)
2747 return rec->ops->print(m, rec->ip, rec->ops, rec->data);
2748
2749 seq_printf(m, "%ps:%ps", (void *)rec->ip, (void *)rec->ops->func);
2750
2751 if (rec->data)
2752 seq_printf(m, ":%p", rec->data);
2753 seq_putc(m, '\n');
2754
2755 return 0;
2756 }
2757
2758 static void *
2759 t_next(struct seq_file *m, void *v, loff_t *pos)
2760 {
2761 struct ftrace_iterator *iter = m->private;
2762 struct ftrace_ops *ops = iter->ops;
2763 struct dyn_ftrace *rec = NULL;
2764
2765 if (unlikely(ftrace_disabled))
2766 return NULL;
2767
2768 if (iter->flags & FTRACE_ITER_HASH)
2769 return t_hash_next(m, pos);
2770
2771 (*pos)++;
2772 iter->pos = iter->func_pos = *pos;
2773
2774 if (iter->flags & FTRACE_ITER_PRINTALL)
2775 return t_hash_start(m, pos);
2776
2777 retry:
2778 if (iter->idx >= iter->pg->index) {
2779 if (iter->pg->next) {
2780 iter->pg = iter->pg->next;
2781 iter->idx = 0;
2782 goto retry;
2783 }
2784 } else {
2785 rec = &iter->pg->records[iter->idx++];
2786 if (((iter->flags & FTRACE_ITER_FILTER) &&
2787 !(ftrace_lookup_ip(ops->filter_hash, rec->ip))) ||
2788
2789 ((iter->flags & FTRACE_ITER_NOTRACE) &&
2790 !ftrace_lookup_ip(ops->notrace_hash, rec->ip)) ||
2791
2792 ((iter->flags & FTRACE_ITER_ENABLED) &&
2793 !(rec->flags & FTRACE_FL_ENABLED))) {
2794
2795 rec = NULL;
2796 goto retry;
2797 }
2798 }
2799
2800 if (!rec)
2801 return t_hash_start(m, pos);
2802
2803 iter->func = rec;
2804
2805 return iter;
2806 }
2807
2808 static void reset_iter_read(struct ftrace_iterator *iter)
2809 {
2810 iter->pos = 0;
2811 iter->func_pos = 0;
2812 iter->flags &= ~(FTRACE_ITER_PRINTALL | FTRACE_ITER_HASH);
2813 }
2814
2815 static void *t_start(struct seq_file *m, loff_t *pos)
2816 {
2817 struct ftrace_iterator *iter = m->private;
2818 struct ftrace_ops *ops = iter->ops;
2819 void *p = NULL;
2820 loff_t l;
2821
2822 mutex_lock(&ftrace_lock);
2823
2824 if (unlikely(ftrace_disabled))
2825 return NULL;
2826
2827 /*
2828 * If an lseek was done, then reset and start from beginning.
2829 */
2830 if (*pos < iter->pos)
2831 reset_iter_read(iter);
2832
2833 /*
2834 * For set_ftrace_filter reading, if we have the filter
2835 * off, we can short cut and just print out that all
2836 * functions are enabled.
2837 */
2838 if (iter->flags & FTRACE_ITER_FILTER &&
2839 ftrace_hash_empty(ops->filter_hash)) {
2840 if (*pos > 0)
2841 return t_hash_start(m, pos);
2842 iter->flags |= FTRACE_ITER_PRINTALL;
2843 /* reset in case of seek/pread */
2844 iter->flags &= ~FTRACE_ITER_HASH;
2845 return iter;
2846 }
2847
2848 if (iter->flags & FTRACE_ITER_HASH)
2849 return t_hash_start(m, pos);
2850
2851 /*
2852 * Unfortunately, we need to restart at ftrace_pages_start
2853 * every time we let go of the ftrace_mutex. This is because
2854 * those pointers can change without the lock.
2855 */
2856 iter->pg = ftrace_pages_start;
2857 iter->idx = 0;
2858 for (l = 0; l <= *pos; ) {
2859 p = t_next(m, p, &l);
2860 if (!p)
2861 break;
2862 }
2863
2864 if (!p)
2865 return t_hash_start(m, pos);
2866
2867 return iter;
2868 }
2869
2870 static void t_stop(struct seq_file *m, void *p)
2871 {
2872 mutex_unlock(&ftrace_lock);
2873 }
2874
2875 static int t_show(struct seq_file *m, void *v)
2876 {
2877 struct ftrace_iterator *iter = m->private;
2878 struct dyn_ftrace *rec;
2879
2880 if (iter->flags & FTRACE_ITER_HASH)
2881 return t_hash_show(m, iter);
2882
2883 if (iter->flags & FTRACE_ITER_PRINTALL) {
2884 seq_printf(m, "#### all functions enabled ####\n");
2885 return 0;
2886 }
2887
2888 rec = iter->func;
2889
2890 if (!rec)
2891 return 0;
2892
2893 seq_printf(m, "%ps", (void *)rec->ip);
2894 if (iter->flags & FTRACE_ITER_ENABLED) {
2895 seq_printf(m, " (%ld)%s",
2896 ftrace_rec_count(rec),
2897 rec->flags & FTRACE_FL_REGS ? " R" : " ");
2898 if (rec->flags & FTRACE_FL_TRAMP_EN) {
2899 struct ftrace_ops *ops;
2900
2901 ops = ftrace_find_tramp_ops_curr(rec);
2902 if (ops && ops->trampoline)
2903 seq_printf(m, "\ttramp: %pS",
2904 (void *)ops->trampoline);
2905 else
2906 seq_printf(m, "\ttramp: ERROR!");
2907 }
2908 }
2909
2910 seq_printf(m, "\n");
2911
2912 return 0;
2913 }
2914
2915 static const struct seq_operations show_ftrace_seq_ops = {
2916 .start = t_start,
2917 .next = t_next,
2918 .stop = t_stop,
2919 .show = t_show,
2920 };
2921
2922 static int
2923 ftrace_avail_open(struct inode *inode, struct file *file)
2924 {
2925 struct ftrace_iterator *iter;
2926
2927 if (unlikely(ftrace_disabled))
2928 return -ENODEV;
2929
2930 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
2931 if (iter) {
2932 iter->pg = ftrace_pages_start;
2933 iter->ops = &global_ops;
2934 }
2935
2936 return iter ? 0 : -ENOMEM;
2937 }
2938
2939 static int
2940 ftrace_enabled_open(struct inode *inode, struct file *file)
2941 {
2942 struct ftrace_iterator *iter;
2943
2944 if (unlikely(ftrace_disabled))
2945 return -ENODEV;
2946
2947 iter = __seq_open_private(file, &show_ftrace_seq_ops, sizeof(*iter));
2948 if (iter) {
2949 iter->pg = ftrace_pages_start;
2950 iter->flags = FTRACE_ITER_ENABLED;
2951 iter->ops = &global_ops;
2952 }
2953
2954 return iter ? 0 : -ENOMEM;
2955 }
2956
2957 static void ftrace_filter_reset(struct ftrace_hash *hash)
2958 {
2959 mutex_lock(&ftrace_lock);
2960 ftrace_hash_clear(hash);
2961 mutex_unlock(&ftrace_lock);
2962 }
2963
2964 /**
2965 * ftrace_regex_open - initialize function tracer filter files
2966 * @ops: The ftrace_ops that hold the hash filters
2967 * @flag: The type of filter to process
2968 * @inode: The inode, usually passed in to your open routine
2969 * @file: The file, usually passed in to your open routine
2970 *
2971 * ftrace_regex_open() initializes the filter files for the
2972 * @ops. Depending on @flag it may process the filter hash or
2973 * the notrace hash of @ops. With this called from the open
2974 * routine, you can use ftrace_filter_write() for the write
2975 * routine if @flag has FTRACE_ITER_FILTER set, or
2976 * ftrace_notrace_write() if @flag has FTRACE_ITER_NOTRACE set.
2977 * tracing_lseek() should be used as the lseek routine, and
2978 * release must call ftrace_regex_release().
2979 */
2980 int
2981 ftrace_regex_open(struct ftrace_ops *ops, int flag,
2982 struct inode *inode, struct file *file)
2983 {
2984 struct ftrace_iterator *iter;
2985 struct ftrace_hash *hash;
2986 int ret = 0;
2987
2988 ftrace_ops_init(ops);
2989
2990 if (unlikely(ftrace_disabled))
2991 return -ENODEV;
2992
2993 iter = kzalloc(sizeof(*iter), GFP_KERNEL);
2994 if (!iter)
2995 return -ENOMEM;
2996
2997 if (trace_parser_get_init(&iter->parser, FTRACE_BUFF_MAX)) {
2998 kfree(iter);
2999 return -ENOMEM;
3000 }
3001
3002 iter->ops = ops;
3003 iter->flags = flag;
3004
3005 mutex_lock(&ops->regex_lock);
3006
3007 if (flag & FTRACE_ITER_NOTRACE)
3008 hash = ops->notrace_hash;
3009 else
3010 hash = ops->filter_hash;
3011
3012 if (file->f_mode & FMODE_WRITE) {
3013 const int size_bits = FTRACE_HASH_DEFAULT_BITS;
3014
3015 if (file->f_flags & O_TRUNC)
3016 iter->hash = alloc_ftrace_hash(size_bits);
3017 else
3018 iter->hash = alloc_and_copy_ftrace_hash(size_bits, hash);
3019
3020 if (!iter->hash) {
3021 trace_parser_put(&iter->parser);
3022 kfree(iter);
3023 ret = -ENOMEM;
3024 goto out_unlock;
3025 }
3026 }
3027
3028 if (file->f_mode & FMODE_READ) {
3029 iter->pg = ftrace_pages_start;
3030
3031 ret = seq_open(file, &show_ftrace_seq_ops);
3032 if (!ret) {
3033 struct seq_file *m = file->private_data;
3034 m->private = iter;
3035 } else {
3036 /* Failed */
3037 free_ftrace_hash(iter->hash);
3038 trace_parser_put(&iter->parser);
3039 kfree(iter);
3040 }
3041 } else
3042 file->private_data = iter;
3043
3044 out_unlock:
3045 mutex_unlock(&ops->regex_lock);
3046
3047 return ret;
3048 }
3049
3050 static int
3051 ftrace_filter_open(struct inode *inode, struct file *file)
3052 {
3053 struct ftrace_ops *ops = inode->i_private;
3054
3055 return ftrace_regex_open(ops,
3056 FTRACE_ITER_FILTER | FTRACE_ITER_DO_HASH,
3057 inode, file);
3058 }
3059
3060 static int
3061 ftrace_notrace_open(struct inode *inode, struct file *file)
3062 {
3063 struct ftrace_ops *ops = inode->i_private;
3064
3065 return ftrace_regex_open(ops, FTRACE_ITER_NOTRACE,
3066 inode, file);
3067 }
3068
3069 static int ftrace_match(char *str, char *regex, int len, int type)
3070 {
3071 int matched = 0;
3072 int slen;
3073
3074 switch (type) {
3075 case MATCH_FULL:
3076 if (strcmp(str, regex) == 0)
3077 matched = 1;
3078 break;
3079 case MATCH_FRONT_ONLY:
3080 if (strncmp(str, regex, len) == 0)
3081 matched = 1;
3082 break;
3083 case MATCH_MIDDLE_ONLY:
3084 if (strstr(str, regex))
3085 matched = 1;
3086 break;
3087 case MATCH_END_ONLY:
3088 slen = strlen(str);
3089 if (slen >= len && memcmp(str + slen - len, regex, len) == 0)
3090 matched = 1;
3091 break;
3092 }
3093
3094 return matched;
3095 }
3096
3097 static int
3098 enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int not)
3099 {
3100 struct ftrace_func_entry *entry;
3101 int ret = 0;
3102
3103 entry = ftrace_lookup_ip(hash, rec->ip);
3104 if (not) {
3105 /* Do nothing if it doesn't exist */
3106 if (!entry)
3107 return 0;
3108
3109 free_hash_entry(hash, entry);
3110 } else {
3111 /* Do nothing if it exists */
3112 if (entry)
3113 return 0;
3114
3115 ret = add_hash_entry(hash, rec->ip);
3116 }
3117 return ret;
3118 }
3119
3120 static int
3121 ftrace_match_record(struct dyn_ftrace *rec, char *mod,
3122 char *regex, int len, int type)
3123 {
3124 char str[KSYM_SYMBOL_LEN];
3125 char *modname;
3126
3127 kallsyms_lookup(rec->ip, NULL, NULL, &modname, str);
3128
3129 if (mod) {
3130 /* module lookup requires matching the module */
3131 if (!modname || strcmp(modname, mod))
3132 return 0;
3133
3134 /* blank search means to match all funcs in the mod */
3135 if (!len)
3136 return 1;
3137 }
3138
3139 return ftrace_match(str, regex, len, type);
3140 }
3141
3142 static int
3143 match_records(struct ftrace_hash *hash, char *buff,
3144 int len, char *mod, int not)
3145 {
3146 unsigned search_len = 0;
3147 struct ftrace_page *pg;
3148 struct dyn_ftrace *rec;
3149 int type = MATCH_FULL;
3150 char *search = buff;
3151 int found = 0;
3152 int ret;
3153
3154 if (len) {
3155 type = filter_parse_regex(buff, len, &search, &not);
3156 search_len = strlen(search);
3157 }
3158
3159 mutex_lock(&ftrace_lock);
3160
3161 if (unlikely(ftrace_disabled))
3162 goto out_unlock;
3163
3164 do_for_each_ftrace_rec(pg, rec) {
3165 if (ftrace_match_record(rec, mod, search, search_len, type)) {
3166 ret = enter_record(hash, rec, not);
3167 if (ret < 0) {
3168 found = ret;
3169 goto out_unlock;
3170 }
3171 found = 1;
3172 }
3173 } while_for_each_ftrace_rec();
3174 out_unlock:
3175 mutex_unlock(&ftrace_lock);
3176
3177 return found;
3178 }
3179
3180 static int
3181 ftrace_match_records(struct ftrace_hash *hash, char *buff, int len)
3182 {
3183 return match_records(hash, buff, len, NULL, 0);
3184 }
3185
3186 static int
3187 ftrace_match_module_records(struct ftrace_hash *hash, char *buff, char *mod)
3188 {
3189 int not = 0;
3190
3191 /* blank or '*' mean the same */
3192 if (strcmp(buff, "*") == 0)
3193 buff[0] = 0;
3194
3195 /* handle the case of 'dont filter this module' */
3196 if (strcmp(buff, "!") == 0 || strcmp(buff, "!*") == 0) {
3197 buff[0] = 0;
3198 not = 1;
3199 }
3200
3201 return match_records(hash, buff, strlen(buff), mod, not);
3202 }
3203
3204 /*
3205 * We register the module command as a template to show others how
3206 * to register the a command as well.
3207 */
3208
3209 static int
3210 ftrace_mod_callback(struct ftrace_hash *hash,
3211 char *func, char *cmd, char *param, int enable)
3212 {
3213 char *mod;
3214 int ret = -EINVAL;
3215
3216 /*
3217 * cmd == 'mod' because we only registered this func
3218 * for the 'mod' ftrace_func_command.
3219 * But if you register one func with multiple commands,
3220 * you can tell which command was used by the cmd
3221 * parameter.
3222 */
3223
3224 /* we must have a module name */
3225 if (!param)
3226 return ret;
3227
3228 mod = strsep(&param, ":");
3229 if (!strlen(mod))
3230 return ret;
3231
3232 ret = ftrace_match_module_records(hash, func, mod);
3233 if (!ret)
3234 ret = -EINVAL;
3235 if (ret < 0)
3236 return ret;
3237
3238 return 0;
3239 }
3240
3241 static struct ftrace_func_command ftrace_mod_cmd = {
3242 .name = "mod",
3243 .func = ftrace_mod_callback,
3244 };
3245
3246 static int __init ftrace_mod_cmd_init(void)
3247 {
3248 return register_ftrace_command(&ftrace_mod_cmd);
3249 }
3250 core_initcall(ftrace_mod_cmd_init);
3251
3252 static void function_trace_probe_call(unsigned long ip, unsigned long parent_ip,
3253 struct ftrace_ops *op, struct pt_regs *pt_regs)
3254 {
3255 struct ftrace_func_probe *entry;
3256 struct hlist_head *hhd;
3257 unsigned long key;
3258
3259 key = hash_long(ip, FTRACE_HASH_BITS);
3260
3261 hhd = &ftrace_func_hash[key];
3262
3263 if (hlist_empty(hhd))
3264 return;
3265
3266 /*
3267 * Disable preemption for these calls to prevent a RCU grace
3268 * period. This syncs the hash iteration and freeing of items
3269 * on the hash. rcu_read_lock is too dangerous here.
3270 */
3271 preempt_disable_notrace();
3272 hlist_for_each_entry_rcu_notrace(entry, hhd, node) {
3273 if (entry->ip == ip)
3274 entry->ops->func(ip, parent_ip, &entry->data);
3275 }
3276 preempt_enable_notrace();
3277 }
3278
3279 static struct ftrace_ops trace_probe_ops __read_mostly =
3280 {
3281 .func = function_trace_probe_call,
3282 .flags = FTRACE_OPS_FL_INITIALIZED,
3283 INIT_REGEX_LOCK(trace_probe_ops)
3284 };
3285
3286 static int ftrace_probe_registered;
3287
3288 static void __enable_ftrace_function_probe(void)
3289 {
3290 int ret;
3291 int i;
3292
3293 if (ftrace_probe_registered) {
3294 /* still need to update the function call sites */
3295 if (ftrace_enabled)
3296 ftrace_run_update_code(FTRACE_UPDATE_CALLS);
3297 return;
3298 }
3299
3300 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3301 struct hlist_head *hhd = &ftrace_func_hash[i];
3302 if (hhd->first)
3303 break;
3304 }
3305 /* Nothing registered? */
3306 if (i == FTRACE_FUNC_HASHSIZE)
3307 return;
3308
3309 ret = ftrace_startup(&trace_probe_ops, 0);
3310
3311 ftrace_probe_registered = 1;
3312 }
3313
3314 static void __disable_ftrace_function_probe(void)
3315 {
3316 int i;
3317
3318 if (!ftrace_probe_registered)
3319 return;
3320
3321 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3322 struct hlist_head *hhd = &ftrace_func_hash[i];
3323 if (hhd->first)
3324 return;
3325 }
3326
3327 /* no more funcs left */
3328 ftrace_shutdown(&trace_probe_ops, 0);
3329
3330 ftrace_probe_registered = 0;
3331 }
3332
3333
3334 static void ftrace_free_entry(struct ftrace_func_probe *entry)
3335 {
3336 if (entry->ops->free)
3337 entry->ops->free(entry->ops, entry->ip, &entry->data);
3338 kfree(entry);
3339 }
3340
3341 int
3342 register_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3343 void *data)
3344 {
3345 struct ftrace_func_probe *entry;
3346 struct ftrace_hash **orig_hash = &trace_probe_ops.filter_hash;
3347 struct ftrace_hash *hash;
3348 struct ftrace_page *pg;
3349 struct dyn_ftrace *rec;
3350 int type, len, not;
3351 unsigned long key;
3352 int count = 0;
3353 char *search;
3354 int ret;
3355
3356 type = filter_parse_regex(glob, strlen(glob), &search, &not);
3357 len = strlen(search);
3358
3359 /* we do not support '!' for function probes */
3360 if (WARN_ON(not))
3361 return -EINVAL;
3362
3363 mutex_lock(&trace_probe_ops.regex_lock);
3364
3365 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
3366 if (!hash) {
3367 count = -ENOMEM;
3368 goto out;
3369 }
3370
3371 if (unlikely(ftrace_disabled)) {
3372 count = -ENODEV;
3373 goto out;
3374 }
3375
3376 mutex_lock(&ftrace_lock);
3377
3378 do_for_each_ftrace_rec(pg, rec) {
3379
3380 if (!ftrace_match_record(rec, NULL, search, len, type))
3381 continue;
3382
3383 entry = kmalloc(sizeof(*entry), GFP_KERNEL);
3384 if (!entry) {
3385 /* If we did not process any, then return error */
3386 if (!count)
3387 count = -ENOMEM;
3388 goto out_unlock;
3389 }
3390
3391 count++;
3392
3393 entry->data = data;
3394
3395 /*
3396 * The caller might want to do something special
3397 * for each function we find. We call the callback
3398 * to give the caller an opportunity to do so.
3399 */
3400 if (ops->init) {
3401 if (ops->init(ops, rec->ip, &entry->data) < 0) {
3402 /* caller does not like this func */
3403 kfree(entry);
3404 continue;
3405 }
3406 }
3407
3408 ret = enter_record(hash, rec, 0);
3409 if (ret < 0) {
3410 kfree(entry);
3411 count = ret;
3412 goto out_unlock;
3413 }
3414
3415 entry->ops = ops;
3416 entry->ip = rec->ip;
3417
3418 key = hash_long(entry->ip, FTRACE_HASH_BITS);
3419 hlist_add_head_rcu(&entry->node, &ftrace_func_hash[key]);
3420
3421 } while_for_each_ftrace_rec();
3422
3423 ret = ftrace_hash_move(&trace_probe_ops, 1, orig_hash, hash);
3424 if (ret < 0)
3425 count = ret;
3426
3427 __enable_ftrace_function_probe();
3428
3429 out_unlock:
3430 mutex_unlock(&ftrace_lock);
3431 out:
3432 mutex_unlock(&trace_probe_ops.regex_lock);
3433 free_ftrace_hash(hash);
3434
3435 return count;
3436 }
3437
3438 enum {
3439 PROBE_TEST_FUNC = 1,
3440 PROBE_TEST_DATA = 2
3441 };
3442
3443 static void
3444 __unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3445 void *data, int flags)
3446 {
3447 struct ftrace_func_entry *rec_entry;
3448 struct ftrace_func_probe *entry;
3449 struct ftrace_func_probe *p;
3450 struct ftrace_hash **orig_hash = &trace_probe_ops.filter_hash;
3451 struct list_head free_list;
3452 struct ftrace_hash *hash;
3453 struct hlist_node *tmp;
3454 char str[KSYM_SYMBOL_LEN];
3455 int type = MATCH_FULL;
3456 int i, len = 0;
3457 char *search;
3458
3459 if (glob && (strcmp(glob, "*") == 0 || !strlen(glob)))
3460 glob = NULL;
3461 else if (glob) {
3462 int not;
3463
3464 type = filter_parse_regex(glob, strlen(glob), &search, &not);
3465 len = strlen(search);
3466
3467 /* we do not support '!' for function probes */
3468 if (WARN_ON(not))
3469 return;
3470 }
3471
3472 mutex_lock(&trace_probe_ops.regex_lock);
3473
3474 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
3475 if (!hash)
3476 /* Hmm, should report this somehow */
3477 goto out_unlock;
3478
3479 INIT_LIST_HEAD(&free_list);
3480
3481 for (i = 0; i < FTRACE_FUNC_HASHSIZE; i++) {
3482 struct hlist_head *hhd = &ftrace_func_hash[i];
3483
3484 hlist_for_each_entry_safe(entry, tmp, hhd, node) {
3485
3486 /* break up if statements for readability */
3487 if ((flags & PROBE_TEST_FUNC) && entry->ops != ops)
3488 continue;
3489
3490 if ((flags & PROBE_TEST_DATA) && entry->data != data)
3491 continue;
3492
3493 /* do this last, since it is the most expensive */
3494 if (glob) {
3495 kallsyms_lookup(entry->ip, NULL, NULL,
3496 NULL, str);
3497 if (!ftrace_match(str, glob, len, type))
3498 continue;
3499 }
3500
3501 rec_entry = ftrace_lookup_ip(hash, entry->ip);
3502 /* It is possible more than one entry had this ip */
3503 if (rec_entry)
3504 free_hash_entry(hash, rec_entry);
3505
3506 hlist_del_rcu(&entry->node);
3507 list_add(&entry->free_list, &free_list);
3508 }
3509 }
3510 mutex_lock(&ftrace_lock);
3511 __disable_ftrace_function_probe();
3512 /*
3513 * Remove after the disable is called. Otherwise, if the last
3514 * probe is removed, a null hash means *all enabled*.
3515 */
3516 ftrace_hash_move(&trace_probe_ops, 1, orig_hash, hash);
3517 synchronize_sched();
3518 list_for_each_entry_safe(entry, p, &free_list, free_list) {
3519 list_del(&entry->free_list);
3520 ftrace_free_entry(entry);
3521 }
3522 mutex_unlock(&ftrace_lock);
3523
3524 out_unlock:
3525 mutex_unlock(&trace_probe_ops.regex_lock);
3526 free_ftrace_hash(hash);
3527 }
3528
3529 void
3530 unregister_ftrace_function_probe(char *glob, struct ftrace_probe_ops *ops,
3531 void *data)
3532 {
3533 __unregister_ftrace_function_probe(glob, ops, data,
3534 PROBE_TEST_FUNC | PROBE_TEST_DATA);
3535 }
3536
3537 void
3538 unregister_ftrace_function_probe_func(char *glob, struct ftrace_probe_ops *ops)
3539 {
3540 __unregister_ftrace_function_probe(glob, ops, NULL, PROBE_TEST_FUNC);
3541 }
3542
3543 void unregister_ftrace_function_probe_all(char *glob)
3544 {
3545 __unregister_ftrace_function_probe(glob, NULL, NULL, 0);
3546 }
3547
3548 static LIST_HEAD(ftrace_commands);
3549 static DEFINE_MUTEX(ftrace_cmd_mutex);
3550
3551 /*
3552 * Currently we only register ftrace commands from __init, so mark this
3553 * __init too.
3554 */
3555 __init int register_ftrace_command(struct ftrace_func_command *cmd)
3556 {
3557 struct ftrace_func_command *p;
3558 int ret = 0;
3559
3560 mutex_lock(&ftrace_cmd_mutex);
3561 list_for_each_entry(p, &ftrace_commands, list) {
3562 if (strcmp(cmd->name, p->name) == 0) {
3563 ret = -EBUSY;
3564 goto out_unlock;
3565 }
3566 }
3567 list_add(&cmd->list, &ftrace_commands);
3568 out_unlock:
3569 mutex_unlock(&ftrace_cmd_mutex);
3570
3571 return ret;
3572 }
3573
3574 /*
3575 * Currently we only unregister ftrace commands from __init, so mark
3576 * this __init too.
3577 */
3578 __init int unregister_ftrace_command(struct ftrace_func_command *cmd)
3579 {
3580 struct ftrace_func_command *p, *n;
3581 int ret = -ENODEV;
3582
3583 mutex_lock(&ftrace_cmd_mutex);
3584 list_for_each_entry_safe(p, n, &ftrace_commands, list) {
3585 if (strcmp(cmd->name, p->name) == 0) {
3586 ret = 0;
3587 list_del_init(&p->list);
3588 goto out_unlock;
3589 }
3590 }
3591 out_unlock:
3592 mutex_unlock(&ftrace_cmd_mutex);
3593
3594 return ret;
3595 }
3596
3597 static int ftrace_process_regex(struct ftrace_hash *hash,
3598 char *buff, int len, int enable)
3599 {
3600 char *func, *command, *next = buff;
3601 struct ftrace_func_command *p;
3602 int ret = -EINVAL;
3603
3604 func = strsep(&next, ":");
3605
3606 if (!next) {
3607 ret = ftrace_match_records(hash, func, len);
3608 if (!ret)
3609 ret = -EINVAL;
3610 if (ret < 0)
3611 return ret;
3612 return 0;
3613 }
3614
3615 /* command found */
3616
3617 command = strsep(&next, ":");
3618
3619 mutex_lock(&ftrace_cmd_mutex);
3620 list_for_each_entry(p, &ftrace_commands, list) {
3621 if (strcmp(p->name, command) == 0) {
3622 ret = p->func(hash, func, command, next, enable);
3623 goto out_unlock;
3624 }
3625 }
3626 out_unlock:
3627 mutex_unlock(&ftrace_cmd_mutex);
3628
3629 return ret;
3630 }
3631
3632 static ssize_t
3633 ftrace_regex_write(struct file *file, const char __user *ubuf,
3634 size_t cnt, loff_t *ppos, int enable)
3635 {
3636 struct ftrace_iterator *iter;
3637 struct trace_parser *parser;
3638 ssize_t ret, read;
3639
3640 if (!cnt)
3641 return 0;
3642
3643 if (file->f_mode & FMODE_READ) {
3644 struct seq_file *m = file->private_data;
3645 iter = m->private;
3646 } else
3647 iter = file->private_data;
3648
3649 if (unlikely(ftrace_disabled))
3650 return -ENODEV;
3651
3652 /* iter->hash is a local copy, so we don't need regex_lock */
3653
3654 parser = &iter->parser;
3655 read = trace_get_user(parser, ubuf, cnt, ppos);
3656
3657 if (read >= 0 && trace_parser_loaded(parser) &&
3658 !trace_parser_cont(parser)) {
3659 ret = ftrace_process_regex(iter->hash, parser->buffer,
3660 parser->idx, enable);
3661 trace_parser_clear(parser);
3662 if (ret < 0)
3663 goto out;
3664 }
3665
3666 ret = read;
3667 out:
3668 return ret;
3669 }
3670
3671 ssize_t
3672 ftrace_filter_write(struct file *file, const char __user *ubuf,
3673 size_t cnt, loff_t *ppos)
3674 {
3675 return ftrace_regex_write(file, ubuf, cnt, ppos, 1);
3676 }
3677
3678 ssize_t
3679 ftrace_notrace_write(struct file *file, const char __user *ubuf,
3680 size_t cnt, loff_t *ppos)
3681 {
3682 return ftrace_regex_write(file, ubuf, cnt, ppos, 0);
3683 }
3684
3685 static int
3686 ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove)
3687 {
3688 struct ftrace_func_entry *entry;
3689
3690 if (!ftrace_location(ip))
3691 return -EINVAL;
3692
3693 if (remove) {
3694 entry = ftrace_lookup_ip(hash, ip);
3695 if (!entry)
3696 return -ENOENT;
3697 free_hash_entry(hash, entry);
3698 return 0;
3699 }
3700
3701 return add_hash_entry(hash, ip);
3702 }
3703
3704 static void ftrace_ops_update_code(struct ftrace_ops *ops)
3705 {
3706 if (ops->flags & FTRACE_OPS_FL_ENABLED && ftrace_enabled)
3707 ftrace_run_update_code(FTRACE_UPDATE_CALLS);
3708 }
3709
3710 static int
3711 ftrace_set_hash(struct ftrace_ops *ops, unsigned char *buf, int len,
3712 unsigned long ip, int remove, int reset, int enable)
3713 {
3714 struct ftrace_hash **orig_hash;
3715 struct ftrace_hash *hash;
3716 int ret;
3717
3718 if (unlikely(ftrace_disabled))
3719 return -ENODEV;
3720
3721 mutex_lock(&ops->regex_lock);
3722
3723 if (enable)
3724 orig_hash = &ops->filter_hash;
3725 else
3726 orig_hash = &ops->notrace_hash;
3727
3728 hash = alloc_and_copy_ftrace_hash(FTRACE_HASH_DEFAULT_BITS, *orig_hash);
3729 if (!hash) {
3730 ret = -ENOMEM;
3731 goto out_regex_unlock;
3732 }
3733
3734 if (reset)
3735 ftrace_filter_reset(hash);
3736 if (buf && !ftrace_match_records(hash, buf, len)) {
3737 ret = -EINVAL;
3738 goto out_regex_unlock;
3739 }
3740 if (ip) {
3741 ret = ftrace_match_addr(hash, ip, remove);
3742 if (ret < 0)
3743 goto out_regex_unlock;
3744 }
3745
3746 mutex_lock(&ftrace_lock);
3747 ret = ftrace_hash_move(ops, enable, orig_hash, hash);
3748 if (!ret)
3749 ftrace_ops_update_code(ops);
3750
3751 mutex_unlock(&ftrace_lock);
3752
3753 out_regex_unlock:
3754 mutex_unlock(&ops->regex_lock);
3755
3756 free_ftrace_hash(hash);
3757 return ret;
3758 }
3759
3760 static int
3761 ftrace_set_addr(struct ftrace_ops *ops, unsigned long ip, int remove,
3762 int reset, int enable)
3763 {
3764 return ftrace_set_hash(ops, 0, 0, ip, remove, reset, enable);
3765 }
3766
3767 /**
3768 * ftrace_set_filter_ip - set a function to filter on in ftrace by address
3769 * @ops - the ops to set the filter with
3770 * @ip - the address to add to or remove from the filter.
3771 * @remove - non zero to remove the ip from the filter
3772 * @reset - non zero to reset all filters before applying this filter.
3773 *
3774 * Filters denote which functions should be enabled when tracing is enabled
3775 * If @ip is NULL, it failes to update filter.
3776 */
3777 int ftrace_set_filter_ip(struct ftrace_ops *ops, unsigned long ip,
3778 int remove, int reset)
3779 {
3780 ftrace_ops_init(ops);
3781 return ftrace_set_addr(ops, ip, remove, reset, 1);
3782 }
3783 EXPORT_SYMBOL_GPL(ftrace_set_filter_ip);
3784
3785 static int
3786 ftrace_set_regex(struct ftrace_ops *ops, unsigned char *buf, int len,
3787 int reset, int enable)
3788 {
3789 return ftrace_set_hash(ops, buf, len, 0, 0, reset, enable);
3790 }
3791
3792 /**
3793 * ftrace_set_filter - set a function to filter on in ftrace
3794 * @ops - the ops to set the filter with
3795 * @buf - the string that holds the function filter text.
3796 * @len - the length of the string.
3797 * @reset - non zero to reset all filters before applying this filter.
3798 *
3799 * Filters denote which functions should be enabled when tracing is enabled.
3800 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
3801 */
3802 int ftrace_set_filter(struct ftrace_ops *ops, unsigned char *buf,
3803 int len, int reset)
3804 {
3805 ftrace_ops_init(ops);
3806 return ftrace_set_regex(ops, buf, len, reset, 1);
3807 }
3808 EXPORT_SYMBOL_GPL(ftrace_set_filter);
3809
3810 /**
3811 * ftrace_set_notrace - set a function to not trace in ftrace
3812 * @ops - the ops to set the notrace filter with
3813 * @buf - the string that holds the function notrace text.
3814 * @len - the length of the string.
3815 * @reset - non zero to reset all filters before applying this filter.
3816 *
3817 * Notrace Filters denote which functions should not be enabled when tracing
3818 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
3819 * for tracing.
3820 */
3821 int ftrace_set_notrace(struct ftrace_ops *ops, unsigned char *buf,
3822 int len, int reset)
3823 {
3824 ftrace_ops_init(ops);
3825 return ftrace_set_regex(ops, buf, len, reset, 0);
3826 }
3827 EXPORT_SYMBOL_GPL(ftrace_set_notrace);
3828 /**
3829 * ftrace_set_global_filter - set a function to filter on with global tracers
3830 * @buf - the string that holds the function filter text.
3831 * @len - the length of the string.
3832 * @reset - non zero to reset all filters before applying this filter.
3833 *
3834 * Filters denote which functions should be enabled when tracing is enabled.
3835 * If @buf is NULL and reset is set, all functions will be enabled for tracing.
3836 */
3837 void ftrace_set_global_filter(unsigned char *buf, int len, int reset)
3838 {
3839 ftrace_set_regex(&global_ops, buf, len, reset, 1);
3840 }
3841 EXPORT_SYMBOL_GPL(ftrace_set_global_filter);
3842
3843 /**
3844 * ftrace_set_global_notrace - set a function to not trace with global tracers
3845 * @buf - the string that holds the function notrace text.
3846 * @len - the length of the string.
3847 * @reset - non zero to reset all filters before applying this filter.
3848 *
3849 * Notrace Filters denote which functions should not be enabled when tracing
3850 * is enabled. If @buf is NULL and reset is set, all functions will be enabled
3851 * for tracing.
3852 */
3853 void ftrace_set_global_notrace(unsigned char *buf, int len, int reset)
3854 {
3855 ftrace_set_regex(&global_ops, buf, len, reset, 0);
3856 }
3857 EXPORT_SYMBOL_GPL(ftrace_set_global_notrace);
3858
3859 /*
3860 * command line interface to allow users to set filters on boot up.
3861 */
3862 #define FTRACE_FILTER_SIZE COMMAND_LINE_SIZE
3863 static char ftrace_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
3864 static char ftrace_filter_buf[FTRACE_FILTER_SIZE] __initdata;
3865
3866 /* Used by function selftest to not test if filter is set */
3867 bool ftrace_filter_param __initdata;
3868
3869 static int __init set_ftrace_notrace(char *str)
3870 {
3871 ftrace_filter_param = true;
3872 strlcpy(ftrace_notrace_buf, str, FTRACE_FILTER_SIZE);
3873 return 1;
3874 }
3875 __setup("ftrace_notrace=", set_ftrace_notrace);
3876
3877 static int __init set_ftrace_filter(char *str)
3878 {
3879 ftrace_filter_param = true;
3880 strlcpy(ftrace_filter_buf, str, FTRACE_FILTER_SIZE);
3881 return 1;
3882 }
3883 __setup("ftrace_filter=", set_ftrace_filter);
3884
3885 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
3886 static char ftrace_graph_buf[FTRACE_FILTER_SIZE] __initdata;
3887 static char ftrace_graph_notrace_buf[FTRACE_FILTER_SIZE] __initdata;
3888 static int ftrace_set_func(unsigned long *array, int *idx, int size, char *buffer);
3889
3890 static int __init set_graph_function(char *str)
3891 {
3892 strlcpy(ftrace_graph_buf, str, FTRACE_FILTER_SIZE);
3893 return 1;
3894 }
3895 __setup("ftrace_graph_filter=", set_graph_function);
3896
3897 static int __init set_graph_notrace_function(char *str)
3898 {
3899 strlcpy(ftrace_graph_notrace_buf, str, FTRACE_FILTER_SIZE);
3900 return 1;
3901 }
3902 __setup("ftrace_graph_notrace=", set_graph_notrace_function);
3903
3904 static void __init set_ftrace_early_graph(char *buf, int enable)
3905 {
3906 int ret;
3907 char *func;
3908 unsigned long *table = ftrace_graph_funcs;
3909 int *count = &ftrace_graph_count;
3910
3911 if (!enable) {
3912 table = ftrace_graph_notrace_funcs;
3913 count = &ftrace_graph_notrace_count;
3914 }
3915
3916 while (buf) {
3917 func = strsep(&buf, ",");
3918 /* we allow only one expression at a time */
3919 ret = ftrace_set_func(table, count, FTRACE_GRAPH_MAX_FUNCS, func);
3920 if (ret)
3921 printk(KERN_DEBUG "ftrace: function %s not "
3922 "traceable\n", func);
3923 }
3924 }
3925 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
3926
3927 void __init
3928 ftrace_set_early_filter(struct ftrace_ops *ops, char *buf, int enable)
3929 {
3930 char *func;
3931
3932 ftrace_ops_init(ops);
3933
3934 while (buf) {
3935 func = strsep(&buf, ",");
3936 ftrace_set_regex(ops, func, strlen(func), 0, enable);
3937 }
3938 }
3939
3940 static void __init set_ftrace_early_filters(void)
3941 {
3942 if (ftrace_filter_buf[0])
3943 ftrace_set_early_filter(&global_ops, ftrace_filter_buf, 1);
3944 if (ftrace_notrace_buf[0])
3945 ftrace_set_early_filter(&global_ops, ftrace_notrace_buf, 0);
3946 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
3947 if (ftrace_graph_buf[0])
3948 set_ftrace_early_graph(ftrace_graph_buf, 1);
3949 if (ftrace_graph_notrace_buf[0])
3950 set_ftrace_early_graph(ftrace_graph_notrace_buf, 0);
3951 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
3952 }
3953
3954 int ftrace_regex_release(struct inode *inode, struct file *file)
3955 {
3956 struct seq_file *m = (struct seq_file *)file->private_data;
3957 struct ftrace_iterator *iter;
3958 struct ftrace_hash **orig_hash;
3959 struct trace_parser *parser;
3960 int filter_hash;
3961 int ret;
3962
3963 if (file->f_mode & FMODE_READ) {
3964 iter = m->private;
3965 seq_release(inode, file);
3966 } else
3967 iter = file->private_data;
3968
3969 parser = &iter->parser;
3970 if (trace_parser_loaded(parser)) {
3971 parser->buffer[parser->idx] = 0;
3972 ftrace_match_records(iter->hash, parser->buffer, parser->idx);
3973 }
3974
3975 trace_parser_put(parser);
3976
3977 mutex_lock(&iter->ops->regex_lock);
3978
3979 if (file->f_mode & FMODE_WRITE) {
3980 filter_hash = !!(iter->flags & FTRACE_ITER_FILTER);
3981
3982 if (filter_hash)
3983 orig_hash = &iter->ops->filter_hash;
3984 else
3985 orig_hash = &iter->ops->notrace_hash;
3986
3987 mutex_lock(&ftrace_lock);
3988 ret = ftrace_hash_move(iter->ops, filter_hash,
3989 orig_hash, iter->hash);
3990 if (!ret)
3991 ftrace_ops_update_code(iter->ops);
3992
3993 mutex_unlock(&ftrace_lock);
3994 }
3995
3996 mutex_unlock(&iter->ops->regex_lock);
3997 free_ftrace_hash(iter->hash);
3998 kfree(iter);
3999
4000 return 0;
4001 }
4002
4003 static const struct file_operations ftrace_avail_fops = {
4004 .open = ftrace_avail_open,
4005 .read = seq_read,
4006 .llseek = seq_lseek,
4007 .release = seq_release_private,
4008 };
4009
4010 static const struct file_operations ftrace_enabled_fops = {
4011 .open = ftrace_enabled_open,
4012 .read = seq_read,
4013 .llseek = seq_lseek,
4014 .release = seq_release_private,
4015 };
4016
4017 static const struct file_operations ftrace_filter_fops = {
4018 .open = ftrace_filter_open,
4019 .read = seq_read,
4020 .write = ftrace_filter_write,
4021 .llseek = tracing_lseek,
4022 .release = ftrace_regex_release,
4023 };
4024
4025 static const struct file_operations ftrace_notrace_fops = {
4026 .open = ftrace_notrace_open,
4027 .read = seq_read,
4028 .write = ftrace_notrace_write,
4029 .llseek = tracing_lseek,
4030 .release = ftrace_regex_release,
4031 };
4032
4033 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4034
4035 static DEFINE_MUTEX(graph_lock);
4036
4037 int ftrace_graph_count;
4038 int ftrace_graph_notrace_count;
4039 unsigned long ftrace_graph_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;
4040 unsigned long ftrace_graph_notrace_funcs[FTRACE_GRAPH_MAX_FUNCS] __read_mostly;
4041
4042 struct ftrace_graph_data {
4043 unsigned long *table;
4044 size_t size;
4045 int *count;
4046 const struct seq_operations *seq_ops;
4047 };
4048
4049 static void *
4050 __g_next(struct seq_file *m, loff_t *pos)
4051 {
4052 struct ftrace_graph_data *fgd = m->private;
4053
4054 if (*pos >= *fgd->count)
4055 return NULL;
4056 return &fgd->table[*pos];
4057 }
4058
4059 static void *
4060 g_next(struct seq_file *m, void *v, loff_t *pos)
4061 {
4062 (*pos)++;
4063 return __g_next(m, pos);
4064 }
4065
4066 static void *g_start(struct seq_file *m, loff_t *pos)
4067 {
4068 struct ftrace_graph_data *fgd = m->private;
4069
4070 mutex_lock(&graph_lock);
4071
4072 /* Nothing, tell g_show to print all functions are enabled */
4073 if (!*fgd->count && !*pos)
4074 return (void *)1;
4075
4076 return __g_next(m, pos);
4077 }
4078
4079 static void g_stop(struct seq_file *m, void *p)
4080 {
4081 mutex_unlock(&graph_lock);
4082 }
4083
4084 static int g_show(struct seq_file *m, void *v)
4085 {
4086 unsigned long *ptr = v;
4087
4088 if (!ptr)
4089 return 0;
4090
4091 if (ptr == (unsigned long *)1) {
4092 seq_printf(m, "#### all functions enabled ####\n");
4093 return 0;
4094 }
4095
4096 seq_printf(m, "%ps\n", (void *)*ptr);
4097
4098 return 0;
4099 }
4100
4101 static const struct seq_operations ftrace_graph_seq_ops = {
4102 .start = g_start,
4103 .next = g_next,
4104 .stop = g_stop,
4105 .show = g_show,
4106 };
4107
4108 static int
4109 __ftrace_graph_open(struct inode *inode, struct file *file,
4110 struct ftrace_graph_data *fgd)
4111 {
4112 int ret = 0;
4113
4114 mutex_lock(&graph_lock);
4115 if ((file->f_mode & FMODE_WRITE) &&
4116 (file->f_flags & O_TRUNC)) {
4117 *fgd->count = 0;
4118 memset(fgd->table, 0, fgd->size * sizeof(*fgd->table));
4119 }
4120 mutex_unlock(&graph_lock);
4121
4122 if (file->f_mode & FMODE_READ) {
4123 ret = seq_open(file, fgd->seq_ops);
4124 if (!ret) {
4125 struct seq_file *m = file->private_data;
4126 m->private = fgd;
4127 }
4128 } else
4129 file->private_data = fgd;
4130
4131 return ret;
4132 }
4133
4134 static int
4135 ftrace_graph_open(struct inode *inode, struct file *file)
4136 {
4137 struct ftrace_graph_data *fgd;
4138
4139 if (unlikely(ftrace_disabled))
4140 return -ENODEV;
4141
4142 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
4143 if (fgd == NULL)
4144 return -ENOMEM;
4145
4146 fgd->table = ftrace_graph_funcs;
4147 fgd->size = FTRACE_GRAPH_MAX_FUNCS;
4148 fgd->count = &ftrace_graph_count;
4149 fgd->seq_ops = &ftrace_graph_seq_ops;
4150
4151 return __ftrace_graph_open(inode, file, fgd);
4152 }
4153
4154 static int
4155 ftrace_graph_notrace_open(struct inode *inode, struct file *file)
4156 {
4157 struct ftrace_graph_data *fgd;
4158
4159 if (unlikely(ftrace_disabled))
4160 return -ENODEV;
4161
4162 fgd = kmalloc(sizeof(*fgd), GFP_KERNEL);
4163 if (fgd == NULL)
4164 return -ENOMEM;
4165
4166 fgd->table = ftrace_graph_notrace_funcs;
4167 fgd->size = FTRACE_GRAPH_MAX_FUNCS;
4168 fgd->count = &ftrace_graph_notrace_count;
4169 fgd->seq_ops = &ftrace_graph_seq_ops;
4170
4171 return __ftrace_graph_open(inode, file, fgd);
4172 }
4173
4174 static int
4175 ftrace_graph_release(struct inode *inode, struct file *file)
4176 {
4177 if (file->f_mode & FMODE_READ) {
4178 struct seq_file *m = file->private_data;
4179
4180 kfree(m->private);
4181 seq_release(inode, file);
4182 } else {
4183 kfree(file->private_data);
4184 }
4185
4186 return 0;
4187 }
4188
4189 static int
4190 ftrace_set_func(unsigned long *array, int *idx, int size, char *buffer)
4191 {
4192 struct dyn_ftrace *rec;
4193 struct ftrace_page *pg;
4194 int search_len;
4195 int fail = 1;
4196 int type, not;
4197 char *search;
4198 bool exists;
4199 int i;
4200
4201 /* decode regex */
4202 type = filter_parse_regex(buffer, strlen(buffer), &search, &not);
4203 if (!not && *idx >= size)
4204 return -EBUSY;
4205
4206 search_len = strlen(search);
4207
4208 mutex_lock(&ftrace_lock);
4209
4210 if (unlikely(ftrace_disabled)) {
4211 mutex_unlock(&ftrace_lock);
4212 return -ENODEV;
4213 }
4214
4215 do_for_each_ftrace_rec(pg, rec) {
4216
4217 if (ftrace_match_record(rec, NULL, search, search_len, type)) {
4218 /* if it is in the array */
4219 exists = false;
4220 for (i = 0; i < *idx; i++) {
4221 if (array[i] == rec->ip) {
4222 exists = true;
4223 break;
4224 }
4225 }
4226
4227 if (!not) {
4228 fail = 0;
4229 if (!exists) {
4230 array[(*idx)++] = rec->ip;
4231 if (*idx >= size)
4232 goto out;
4233 }
4234 } else {
4235 if (exists) {
4236 array[i] = array[--(*idx)];
4237 array[*idx] = 0;
4238 fail = 0;
4239 }
4240 }
4241 }
4242 } while_for_each_ftrace_rec();
4243 out:
4244 mutex_unlock(&ftrace_lock);
4245
4246 if (fail)
4247 return -EINVAL;
4248
4249 return 0;
4250 }
4251
4252 static ssize_t
4253 ftrace_graph_write(struct file *file, const char __user *ubuf,
4254 size_t cnt, loff_t *ppos)
4255 {
4256 struct trace_parser parser;
4257 ssize_t read, ret = 0;
4258 struct ftrace_graph_data *fgd = file->private_data;
4259
4260 if (!cnt)
4261 return 0;
4262
4263 if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX))
4264 return -ENOMEM;
4265
4266 read = trace_get_user(&parser, ubuf, cnt, ppos);
4267
4268 if (read >= 0 && trace_parser_loaded((&parser))) {
4269 parser.buffer[parser.idx] = 0;
4270
4271 mutex_lock(&graph_lock);
4272
4273 /* we allow only one expression at a time */
4274 ret = ftrace_set_func(fgd->table, fgd->count, fgd->size,
4275 parser.buffer);
4276
4277 mutex_unlock(&graph_lock);
4278 }
4279
4280 if (!ret)
4281 ret = read;
4282
4283 trace_parser_put(&parser);
4284
4285 return ret;
4286 }
4287
4288 static const struct file_operations ftrace_graph_fops = {
4289 .open = ftrace_graph_open,
4290 .read = seq_read,
4291 .write = ftrace_graph_write,
4292 .llseek = tracing_lseek,
4293 .release = ftrace_graph_release,
4294 };
4295
4296 static const struct file_operations ftrace_graph_notrace_fops = {
4297 .open = ftrace_graph_notrace_open,
4298 .read = seq_read,
4299 .write = ftrace_graph_write,
4300 .llseek = tracing_lseek,
4301 .release = ftrace_graph_release,
4302 };
4303 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4304
4305 void ftrace_create_filter_files(struct ftrace_ops *ops,
4306 struct dentry *parent)
4307 {
4308
4309 trace_create_file("set_ftrace_filter", 0644, parent,
4310 ops, &ftrace_filter_fops);
4311
4312 trace_create_file("set_ftrace_notrace", 0644, parent,
4313 ops, &ftrace_notrace_fops);
4314 }
4315
4316 /*
4317 * The name "destroy_filter_files" is really a misnomer. Although
4318 * in the future, it may actualy delete the files, but this is
4319 * really intended to make sure the ops passed in are disabled
4320 * and that when this function returns, the caller is free to
4321 * free the ops.
4322 *
4323 * The "destroy" name is only to match the "create" name that this
4324 * should be paired with.
4325 */
4326 void ftrace_destroy_filter_files(struct ftrace_ops *ops)
4327 {
4328 mutex_lock(&ftrace_lock);
4329 if (ops->flags & FTRACE_OPS_FL_ENABLED)
4330 ftrace_shutdown(ops, 0);
4331 ops->flags |= FTRACE_OPS_FL_DELETED;
4332 mutex_unlock(&ftrace_lock);
4333 }
4334
4335 static __init int ftrace_init_dyn_debugfs(struct dentry *d_tracer)
4336 {
4337
4338 trace_create_file("available_filter_functions", 0444,
4339 d_tracer, NULL, &ftrace_avail_fops);
4340
4341 trace_create_file("enabled_functions", 0444,
4342 d_tracer, NULL, &ftrace_enabled_fops);
4343
4344 ftrace_create_filter_files(&global_ops, d_tracer);
4345
4346 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
4347 trace_create_file("set_graph_function", 0444, d_tracer,
4348 NULL,
4349 &ftrace_graph_fops);
4350 trace_create_file("set_graph_notrace", 0444, d_tracer,
4351 NULL,
4352 &ftrace_graph_notrace_fops);
4353 #endif /* CONFIG_FUNCTION_GRAPH_TRACER */
4354
4355 return 0;
4356 }
4357
4358 static int ftrace_cmp_ips(const void *a, const void *b)
4359 {
4360 const unsigned long *ipa = a;
4361 const unsigned long *ipb = b;
4362
4363 if (*ipa > *ipb)
4364 return 1;
4365 if (*ipa < *ipb)
4366 return -1;
4367 return 0;
4368 }
4369
4370 static void ftrace_swap_ips(void *a, void *b, int size)
4371 {
4372 unsigned long *ipa = a;
4373 unsigned long *ipb = b;
4374 unsigned long t;
4375
4376 t = *ipa;
4377 *ipa = *ipb;
4378 *ipb = t;
4379 }
4380
4381 static int ftrace_process_locs(struct module *mod,
4382 unsigned long *start,
4383 unsigned long *end)
4384 {
4385 struct ftrace_page *start_pg;
4386 struct ftrace_page *pg;
4387 struct dyn_ftrace *rec;
4388 unsigned long count;
4389 unsigned long *p;
4390 unsigned long addr;
4391 unsigned long flags = 0; /* Shut up gcc */
4392 int ret = -ENOMEM;
4393
4394 count = end - start;
4395
4396 if (!count)
4397 return 0;
4398
4399 sort(start, count, sizeof(*start),
4400 ftrace_cmp_ips, ftrace_swap_ips);
4401
4402 start_pg = ftrace_allocate_pages(count);
4403 if (!start_pg)
4404 return -ENOMEM;
4405
4406 mutex_lock(&ftrace_lock);
4407
4408 /*
4409 * Core and each module needs their own pages, as
4410 * modules will free them when they are removed.
4411 * Force a new page to be allocated for modules.
4412 */
4413 if (!mod) {
4414 WARN_ON(ftrace_pages || ftrace_pages_start);
4415 /* First initialization */
4416 ftrace_pages = ftrace_pages_start = start_pg;
4417 } else {
4418 if (!ftrace_pages)
4419 goto out;
4420
4421 if (WARN_ON(ftrace_pages->next)) {
4422 /* Hmm, we have free pages? */
4423 while (ftrace_pages->next)
4424 ftrace_pages = ftrace_pages->next;
4425 }
4426
4427 ftrace_pages->next = start_pg;
4428 }
4429
4430 p = start;
4431 pg = start_pg;
4432 while (p < end) {
4433 addr = ftrace_call_adjust(*p++);
4434 /*
4435 * Some architecture linkers will pad between
4436 * the different mcount_loc sections of different
4437 * object files to satisfy alignments.
4438 * Skip any NULL pointers.
4439 */
4440 if (!addr)
4441 continue;
4442
4443 if (pg->index == pg->size) {
4444 /* We should have allocated enough */
4445 if (WARN_ON(!pg->next))
4446 break;
4447 pg = pg->next;
4448 }
4449
4450 rec = &pg->records[pg->index++];
4451 rec->ip = addr;
4452 }
4453
4454 /* We should have used all pages */
4455 WARN_ON(pg->next);
4456
4457 /* Assign the last page to ftrace_pages */
4458 ftrace_pages = pg;
4459
4460 /*
4461 * We only need to disable interrupts on start up
4462 * because we are modifying code that an interrupt
4463 * may execute, and the modification is not atomic.
4464 * But for modules, nothing runs the code we modify
4465 * until we are finished with it, and there's no
4466 * reason to cause large interrupt latencies while we do it.
4467 */
4468 if (!mod)
4469 local_irq_save(flags);
4470 ftrace_update_code(mod, start_pg);
4471 if (!mod)
4472 local_irq_restore(flags);
4473 ret = 0;
4474 out:
4475 mutex_unlock(&ftrace_lock);
4476
4477 return ret;
4478 }
4479
4480 #ifdef CONFIG_MODULES
4481
4482 #define next_to_ftrace_page(p) container_of(p, struct ftrace_page, next)
4483
4484 void ftrace_release_mod(struct module *mod)
4485 {
4486 struct dyn_ftrace *rec;
4487 struct ftrace_page **last_pg;
4488 struct ftrace_page *pg;
4489 int order;
4490
4491 mutex_lock(&ftrace_lock);
4492
4493 if (ftrace_disabled)
4494 goto out_unlock;
4495
4496 /*
4497 * Each module has its own ftrace_pages, remove
4498 * them from the list.
4499 */
4500 last_pg = &ftrace_pages_start;
4501 for (pg = ftrace_pages_start; pg; pg = *last_pg) {
4502 rec = &pg->records[0];
4503 if (within_module_core(rec->ip, mod)) {
4504 /*
4505 * As core pages are first, the first
4506 * page should never be a module page.
4507 */
4508 if (WARN_ON(pg == ftrace_pages_start))
4509 goto out_unlock;
4510
4511 /* Check if we are deleting the last page */
4512 if (pg == ftrace_pages)
4513 ftrace_pages = next_to_ftrace_page(last_pg);
4514
4515 *last_pg = pg->next;
4516 order = get_count_order(pg->size / ENTRIES_PER_PAGE);
4517 free_pages((unsigned long)pg->records, order);
4518 kfree(pg);
4519 } else
4520 last_pg = &pg->next;
4521 }
4522 out_unlock:
4523 mutex_unlock(&ftrace_lock);
4524 }
4525
4526 static void ftrace_init_module(struct module *mod,
4527 unsigned long *start, unsigned long *end)
4528 {
4529 if (ftrace_disabled || start == end)
4530 return;
4531 ftrace_process_locs(mod, start, end);
4532 }
4533
4534 void ftrace_module_init(struct module *mod)
4535 {
4536 ftrace_init_module(mod, mod->ftrace_callsites,
4537 mod->ftrace_callsites +
4538 mod->num_ftrace_callsites);
4539 }
4540
4541 static int ftrace_module_notify_exit(struct notifier_block *self,
4542 unsigned long val, void *data)
4543 {
4544 struct module *mod = data;
4545
4546 if (val == MODULE_STATE_GOING)
4547 ftrace_release_mod(mod);
4548
4549 return 0;
4550 }
4551 #else
4552 static int ftrace_module_notify_exit(struct notifier_block *self,
4553 unsigned long val, void *data)
4554 {
4555 return 0;
4556 }
4557 #endif /* CONFIG_MODULES */
4558
4559 struct notifier_block ftrace_module_exit_nb = {
4560 .notifier_call = ftrace_module_notify_exit,
4561 .priority = INT_MIN, /* Run after anything that can remove kprobes */
4562 };
4563
4564 void __init ftrace_init(void)
4565 {
4566 extern unsigned long __start_mcount_loc[];
4567 extern unsigned long __stop_mcount_loc[];
4568 unsigned long count, flags;
4569 int ret;
4570
4571 local_irq_save(flags);
4572 ret = ftrace_dyn_arch_init();
4573 local_irq_restore(flags);
4574 if (ret)
4575 goto failed;
4576
4577 count = __stop_mcount_loc - __start_mcount_loc;
4578 if (!count) {
4579 pr_info("ftrace: No functions to be traced?\n");
4580 goto failed;
4581 }
4582
4583 pr_info("ftrace: allocating %ld entries in %ld pages\n",
4584 count, count / ENTRIES_PER_PAGE + 1);
4585
4586 last_ftrace_enabled = ftrace_enabled = 1;
4587
4588 ret = ftrace_process_locs(NULL,
4589 __start_mcount_loc,
4590 __stop_mcount_loc);
4591
4592 ret = register_module_notifier(&ftrace_module_exit_nb);
4593 if (ret)
4594 pr_warning("Failed to register trace ftrace module exit notifier\n");
4595
4596 set_ftrace_early_filters();
4597
4598 return;
4599 failed:
4600 ftrace_disabled = 1;
4601 }
4602
4603 #else
4604
4605 static struct ftrace_ops global_ops = {
4606 .func = ftrace_stub,
4607 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
4608 INIT_REGEX_LOCK(global_ops)
4609 };
4610
4611 static int __init ftrace_nodyn_init(void)
4612 {
4613 ftrace_enabled = 1;
4614 return 0;
4615 }
4616 core_initcall(ftrace_nodyn_init);
4617
4618 static inline int ftrace_init_dyn_debugfs(struct dentry *d_tracer) { return 0; }
4619 static inline void ftrace_startup_enable(int command) { }
4620 /* Keep as macros so we do not need to define the commands */
4621 # define ftrace_startup(ops, command) \
4622 ({ \
4623 int ___ret = __register_ftrace_function(ops); \
4624 if (!___ret) \
4625 (ops)->flags |= FTRACE_OPS_FL_ENABLED; \
4626 ___ret; \
4627 })
4628 # define ftrace_shutdown(ops, command) \
4629 ({ \
4630 int ___ret = __unregister_ftrace_function(ops); \
4631 if (!___ret) \
4632 (ops)->flags &= ~FTRACE_OPS_FL_ENABLED; \
4633 ___ret; \
4634 })
4635
4636 # define ftrace_startup_sysctl() do { } while (0)
4637 # define ftrace_shutdown_sysctl() do { } while (0)
4638
4639 static inline int
4640 ftrace_ops_test(struct ftrace_ops *ops, unsigned long ip, void *regs)
4641 {
4642 return 1;
4643 }
4644
4645 #endif /* CONFIG_DYNAMIC_FTRACE */
4646
4647 __init void ftrace_init_global_array_ops(struct trace_array *tr)
4648 {
4649 tr->ops = &global_ops;
4650 tr->ops->private = tr;
4651 }
4652
4653 void ftrace_init_array_ops(struct trace_array *tr, ftrace_func_t func)
4654 {
4655 /* If we filter on pids, update to use the pid function */
4656 if (tr->flags & TRACE_ARRAY_FL_GLOBAL) {
4657 if (WARN_ON(tr->ops->func != ftrace_stub))
4658 printk("ftrace ops had %pS for function\n",
4659 tr->ops->func);
4660 /* Only the top level instance does pid tracing */
4661 if (!list_empty(&ftrace_pids)) {
4662 set_ftrace_pid_function(func);
4663 func = ftrace_pid_func;
4664 }
4665 }
4666 tr->ops->func = func;
4667 tr->ops->private = tr;
4668 }
4669
4670 void ftrace_reset_array_ops(struct trace_array *tr)
4671 {
4672 tr->ops->func = ftrace_stub;
4673 }
4674
4675 static void
4676 ftrace_ops_control_func(unsigned long ip, unsigned long parent_ip,
4677 struct ftrace_ops *op, struct pt_regs *regs)
4678 {
4679 if (unlikely(trace_recursion_test(TRACE_CONTROL_BIT)))
4680 return;
4681
4682 /*
4683 * Some of the ops may be dynamically allocated,
4684 * they must be freed after a synchronize_sched().
4685 */
4686 preempt_disable_notrace();
4687 trace_recursion_set(TRACE_CONTROL_BIT);
4688
4689 /*
4690 * Control funcs (perf) uses RCU. Only trace if
4691 * RCU is currently active.
4692 */
4693 if (!rcu_is_watching())
4694 goto out;
4695
4696 do_for_each_ftrace_op(op, ftrace_control_list) {
4697 if (!(op->flags & FTRACE_OPS_FL_STUB) &&
4698 !ftrace_function_local_disabled(op) &&
4699 ftrace_ops_test(op, ip, regs))
4700 op->func(ip, parent_ip, op, regs);
4701 } while_for_each_ftrace_op(op);
4702 out:
4703 trace_recursion_clear(TRACE_CONTROL_BIT);
4704 preempt_enable_notrace();
4705 }
4706
4707 static struct ftrace_ops control_ops = {
4708 .func = ftrace_ops_control_func,
4709 .flags = FTRACE_OPS_FL_RECURSION_SAFE | FTRACE_OPS_FL_INITIALIZED,
4710 INIT_REGEX_LOCK(control_ops)
4711 };
4712
4713 static inline void
4714 __ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
4715 struct ftrace_ops *ignored, struct pt_regs *regs)
4716 {
4717 struct ftrace_ops *op;
4718 int bit;
4719
4720 if (function_trace_stop)
4721 return;
4722
4723 bit = trace_test_and_set_recursion(TRACE_LIST_START, TRACE_LIST_MAX);
4724 if (bit < 0)
4725 return;
4726
4727 /*
4728 * Some of the ops may be dynamically allocated,
4729 * they must be freed after a synchronize_sched().
4730 */
4731 preempt_disable_notrace();
4732 do_for_each_ftrace_op(op, ftrace_ops_list) {
4733 if (ftrace_ops_test(op, ip, regs)) {
4734 if (WARN_ON(!op->func)) {
4735 function_trace_stop = 1;
4736 printk("op=%p %pS\n", op, op);
4737 goto out;
4738 }
4739 op->func(ip, parent_ip, op, regs);
4740 }
4741 } while_for_each_ftrace_op(op);
4742 out:
4743 preempt_enable_notrace();
4744 trace_clear_recursion(bit);
4745 }
4746
4747 /*
4748 * Some archs only support passing ip and parent_ip. Even though
4749 * the list function ignores the op parameter, we do not want any
4750 * C side effects, where a function is called without the caller
4751 * sending a third parameter.
4752 * Archs are to support both the regs and ftrace_ops at the same time.
4753 * If they support ftrace_ops, it is assumed they support regs.
4754 * If call backs want to use regs, they must either check for regs
4755 * being NULL, or CONFIG_DYNAMIC_FTRACE_WITH_REGS.
4756 * Note, CONFIG_DYNAMIC_FTRACE_WITH_REGS expects a full regs to be saved.
4757 * An architecture can pass partial regs with ftrace_ops and still
4758 * set the ARCH_SUPPORT_FTARCE_OPS.
4759 */
4760 #if ARCH_SUPPORTS_FTRACE_OPS
4761 static void ftrace_ops_list_func(unsigned long ip, unsigned long parent_ip,
4762 struct ftrace_ops *op, struct pt_regs *regs)
4763 {
4764 __ftrace_ops_list_func(ip, parent_ip, NULL, regs);
4765 }
4766 #else
4767 static void ftrace_ops_no_ops(unsigned long ip, unsigned long parent_ip)
4768 {
4769 __ftrace_ops_list_func(ip, parent_ip, NULL, NULL);
4770 }
4771 #endif
4772
4773 static void clear_ftrace_swapper(void)
4774 {
4775 struct task_struct *p;
4776 int cpu;
4777
4778 get_online_cpus();
4779 for_each_online_cpu(cpu) {
4780 p = idle_task(cpu);
4781 clear_tsk_trace_trace(p);
4782 }
4783 put_online_cpus();
4784 }
4785
4786 static void set_ftrace_swapper(void)
4787 {
4788 struct task_struct *p;
4789 int cpu;
4790
4791 get_online_cpus();
4792 for_each_online_cpu(cpu) {
4793 p = idle_task(cpu);
4794 set_tsk_trace_trace(p);
4795 }
4796 put_online_cpus();
4797 }
4798
4799 static void clear_ftrace_pid(struct pid *pid)
4800 {
4801 struct task_struct *p;
4802
4803 rcu_read_lock();
4804 do_each_pid_task(pid, PIDTYPE_PID, p) {
4805 clear_tsk_trace_trace(p);
4806 } while_each_pid_task(pid, PIDTYPE_PID, p);
4807 rcu_read_unlock();
4808
4809 put_pid(pid);
4810 }
4811
4812 static void set_ftrace_pid(struct pid *pid)
4813 {
4814 struct task_struct *p;
4815
4816 rcu_read_lock();
4817 do_each_pid_task(pid, PIDTYPE_PID, p) {
4818 set_tsk_trace_trace(p);
4819 } while_each_pid_task(pid, PIDTYPE_PID, p);
4820 rcu_read_unlock();
4821 }
4822
4823 static void clear_ftrace_pid_task(struct pid *pid)
4824 {
4825 if (pid == ftrace_swapper_pid)
4826 clear_ftrace_swapper();
4827 else
4828 clear_ftrace_pid(pid);
4829 }
4830
4831 static void set_ftrace_pid_task(struct pid *pid)
4832 {
4833 if (pid == ftrace_swapper_pid)
4834 set_ftrace_swapper();
4835 else
4836 set_ftrace_pid(pid);
4837 }
4838
4839 static int ftrace_pid_add(int p)
4840 {
4841 struct pid *pid;
4842 struct ftrace_pid *fpid;
4843 int ret = -EINVAL;
4844
4845 mutex_lock(&ftrace_lock);
4846
4847 if (!p)
4848 pid = ftrace_swapper_pid;
4849 else
4850 pid = find_get_pid(p);
4851
4852 if (!pid)
4853 goto out;
4854
4855 ret = 0;
4856
4857 list_for_each_entry(fpid, &ftrace_pids, list)
4858 if (fpid->pid == pid)
4859 goto out_put;
4860
4861 ret = -ENOMEM;
4862
4863 fpid = kmalloc(sizeof(*fpid), GFP_KERNEL);
4864 if (!fpid)
4865 goto out_put;
4866
4867 list_add(&fpid->list, &ftrace_pids);
4868 fpid->pid = pid;
4869
4870 set_ftrace_pid_task(pid);
4871
4872 ftrace_update_pid_func();
4873 ftrace_startup_enable(0);
4874
4875 mutex_unlock(&ftrace_lock);
4876 return 0;
4877
4878 out_put:
4879 if (pid != ftrace_swapper_pid)
4880 put_pid(pid);
4881
4882 out:
4883 mutex_unlock(&ftrace_lock);
4884 return ret;
4885 }
4886
4887 static void ftrace_pid_reset(void)
4888 {
4889 struct ftrace_pid *fpid, *safe;
4890
4891 mutex_lock(&ftrace_lock);
4892 list_for_each_entry_safe(fpid, safe, &ftrace_pids, list) {
4893 struct pid *pid = fpid->pid;
4894
4895 clear_ftrace_pid_task(pid);
4896
4897 list_del(&fpid->list);
4898 kfree(fpid);
4899 }
4900
4901 ftrace_update_pid_func();
4902 ftrace_startup_enable(0);
4903
4904 mutex_unlock(&ftrace_lock);
4905 }
4906
4907 static void *fpid_start(struct seq_file *m, loff_t *pos)
4908 {
4909 mutex_lock(&ftrace_lock);
4910
4911 if (list_empty(&ftrace_pids) && (!*pos))
4912 return (void *) 1;
4913
4914 return seq_list_start(&ftrace_pids, *pos);
4915 }
4916
4917 static void *fpid_next(struct seq_file *m, void *v, loff_t *pos)
4918 {
4919 if (v == (void *)1)
4920 return NULL;
4921
4922 return seq_list_next(v, &ftrace_pids, pos);
4923 }
4924
4925 static void fpid_stop(struct seq_file *m, void *p)
4926 {
4927 mutex_unlock(&ftrace_lock);
4928 }
4929
4930 static int fpid_show(struct seq_file *m, void *v)
4931 {
4932 const struct ftrace_pid *fpid = list_entry(v, struct ftrace_pid, list);
4933
4934 if (v == (void *)1) {
4935 seq_printf(m, "no pid\n");
4936 return 0;
4937 }
4938
4939 if (fpid->pid == ftrace_swapper_pid)
4940 seq_printf(m, "swapper tasks\n");
4941 else
4942 seq_printf(m, "%u\n", pid_vnr(fpid->pid));
4943
4944 return 0;
4945 }
4946
4947 static const struct seq_operations ftrace_pid_sops = {
4948 .start = fpid_start,
4949 .next = fpid_next,
4950 .stop = fpid_stop,
4951 .show = fpid_show,
4952 };
4953
4954 static int
4955 ftrace_pid_open(struct inode *inode, struct file *file)
4956 {
4957 int ret = 0;
4958
4959 if ((file->f_mode & FMODE_WRITE) &&
4960 (file->f_flags & O_TRUNC))
4961 ftrace_pid_reset();
4962
4963 if (file->f_mode & FMODE_READ)
4964 ret = seq_open(file, &ftrace_pid_sops);
4965
4966 return ret;
4967 }
4968
4969 static ssize_t
4970 ftrace_pid_write(struct file *filp, const char __user *ubuf,
4971 size_t cnt, loff_t *ppos)
4972 {
4973 char buf[64], *tmp;
4974 long val;
4975 int ret;
4976
4977 if (cnt >= sizeof(buf))
4978 return -EINVAL;
4979
4980 if (copy_from_user(&buf, ubuf, cnt))
4981 return -EFAULT;
4982
4983 buf[cnt] = 0;
4984
4985 /*
4986 * Allow "echo > set_ftrace_pid" or "echo -n '' > set_ftrace_pid"
4987 * to clean the filter quietly.
4988 */
4989 tmp = strstrip(buf);
4990 if (strlen(tmp) == 0)
4991 return 1;
4992
4993 ret = kstrtol(tmp, 10, &val);
4994 if (ret < 0)
4995 return ret;
4996
4997 ret = ftrace_pid_add(val);
4998
4999 return ret ? ret : cnt;
5000 }
5001
5002 static int
5003 ftrace_pid_release(struct inode *inode, struct file *file)
5004 {
5005 if (file->f_mode & FMODE_READ)
5006 seq_release(inode, file);
5007
5008 return 0;
5009 }
5010
5011 static const struct file_operations ftrace_pid_fops = {
5012 .open = ftrace_pid_open,
5013 .write = ftrace_pid_write,
5014 .read = seq_read,
5015 .llseek = tracing_lseek,
5016 .release = ftrace_pid_release,
5017 };
5018
5019 static __init int ftrace_init_debugfs(void)
5020 {
5021 struct dentry *d_tracer;
5022
5023 d_tracer = tracing_init_dentry();
5024 if (!d_tracer)
5025 return 0;
5026
5027 ftrace_init_dyn_debugfs(d_tracer);
5028
5029 trace_create_file("set_ftrace_pid", 0644, d_tracer,
5030 NULL, &ftrace_pid_fops);
5031
5032 ftrace_profile_debugfs(d_tracer);
5033
5034 return 0;
5035 }
5036 fs_initcall(ftrace_init_debugfs);
5037
5038 /**
5039 * ftrace_kill - kill ftrace
5040 *
5041 * This function should be used by panic code. It stops ftrace
5042 * but in a not so nice way. If you need to simply kill ftrace
5043 * from a non-atomic section, use ftrace_kill.
5044 */
5045 void ftrace_kill(void)
5046 {
5047 ftrace_disabled = 1;
5048 ftrace_enabled = 0;
5049 clear_ftrace_function();
5050 }
5051
5052 /**
5053 * Test if ftrace is dead or not.
5054 */
5055 int ftrace_is_dead(void)
5056 {
5057 return ftrace_disabled;
5058 }
5059
5060 /**
5061 * register_ftrace_function - register a function for profiling
5062 * @ops - ops structure that holds the function for profiling.
5063 *
5064 * Register a function to be called by all functions in the
5065 * kernel.
5066 *
5067 * Note: @ops->func and all the functions it calls must be labeled
5068 * with "notrace", otherwise it will go into a
5069 * recursive loop.
5070 */
5071 int register_ftrace_function(struct ftrace_ops *ops)
5072 {
5073 int ret = -1;
5074
5075 ftrace_ops_init(ops);
5076
5077 mutex_lock(&ftrace_lock);
5078
5079 ret = ftrace_startup(ops, 0);
5080
5081 mutex_unlock(&ftrace_lock);
5082
5083 return ret;
5084 }
5085 EXPORT_SYMBOL_GPL(register_ftrace_function);
5086
5087 /**
5088 * unregister_ftrace_function - unregister a function for profiling.
5089 * @ops - ops structure that holds the function to unregister
5090 *
5091 * Unregister a function that was added to be called by ftrace profiling.
5092 */
5093 int unregister_ftrace_function(struct ftrace_ops *ops)
5094 {
5095 int ret;
5096
5097 mutex_lock(&ftrace_lock);
5098 ret = ftrace_shutdown(ops, 0);
5099 mutex_unlock(&ftrace_lock);
5100
5101 return ret;
5102 }
5103 EXPORT_SYMBOL_GPL(unregister_ftrace_function);
5104
5105 int
5106 ftrace_enable_sysctl(struct ctl_table *table, int write,
5107 void __user *buffer, size_t *lenp,
5108 loff_t *ppos)
5109 {
5110 int ret = -ENODEV;
5111
5112 mutex_lock(&ftrace_lock);
5113
5114 if (unlikely(ftrace_disabled))
5115 goto out;
5116
5117 ret = proc_dointvec(table, write, buffer, lenp, ppos);
5118
5119 if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled))
5120 goto out;
5121
5122 last_ftrace_enabled = !!ftrace_enabled;
5123
5124 if (ftrace_enabled) {
5125
5126 ftrace_startup_sysctl();
5127
5128 /* we are starting ftrace again */
5129 if (ftrace_ops_list != &ftrace_list_end)
5130 update_ftrace_function();
5131
5132 } else {
5133 /* stopping ftrace calls (just send to ftrace_stub) */
5134 ftrace_trace_function = ftrace_stub;
5135
5136 ftrace_shutdown_sysctl();
5137 }
5138
5139 out:
5140 mutex_unlock(&ftrace_lock);
5141 return ret;
5142 }
5143
5144 #ifdef CONFIG_FUNCTION_GRAPH_TRACER
5145
5146 static int ftrace_graph_active;
5147
5148 int ftrace_graph_entry_stub(struct ftrace_graph_ent *trace)
5149 {
5150 return 0;
5151 }
5152
5153 /* The callbacks that hook a function */
5154 trace_func_graph_ret_t ftrace_graph_return =
5155 (trace_func_graph_ret_t)ftrace_stub;
5156 trace_func_graph_ent_t ftrace_graph_entry = ftrace_graph_entry_stub;
5157 static trace_func_graph_ent_t __ftrace_graph_entry = ftrace_graph_entry_stub;
5158
5159 /* Try to assign a return stack array on FTRACE_RETSTACK_ALLOC_SIZE tasks. */
5160 static int alloc_retstack_tasklist(struct ftrace_ret_stack **ret_stack_list)
5161 {
5162 int i;
5163 int ret = 0;
5164 unsigned long flags;
5165 int start = 0, end = FTRACE_RETSTACK_ALLOC_SIZE;
5166 struct task_struct *g, *t;
5167
5168 for (i = 0; i < FTRACE_RETSTACK_ALLOC_SIZE; i++) {
5169 ret_stack_list[i] = kmalloc(FTRACE_RETFUNC_DEPTH
5170 * sizeof(struct ftrace_ret_stack),
5171 GFP_KERNEL);
5172 if (!ret_stack_list[i]) {
5173 start = 0;
5174 end = i;
5175 ret = -ENOMEM;
5176 goto free;
5177 }
5178 }
5179
5180 read_lock_irqsave(&tasklist_lock, flags);
5181 do_each_thread(g, t) {
5182 if (start == end) {
5183 ret = -EAGAIN;
5184 goto unlock;
5185 }
5186
5187 if (t->ret_stack == NULL) {
5188 atomic_set(&t->tracing_graph_pause, 0);
5189 atomic_set(&t->trace_overrun, 0);
5190 t->curr_ret_stack = -1;
5191 /* Make sure the tasks see the -1 first: */
5192 smp_wmb();
5193 t->ret_stack = ret_stack_list[start++];
5194 }
5195 } while_each_thread(g, t);
5196
5197 unlock:
5198 read_unlock_irqrestore(&tasklist_lock, flags);
5199 free:
5200 for (i = start; i < end; i++)
5201 kfree(ret_stack_list[i]);
5202 return ret;
5203 }
5204
5205 static void
5206 ftrace_graph_probe_sched_switch(void *ignore,
5207 struct task_struct *prev, struct task_struct *next)
5208 {
5209 unsigned long long timestamp;
5210 int index;
5211
5212 /*
5213 * Does the user want to count the time a function was asleep.
5214 * If so, do not update the time stamps.
5215 */
5216 if (trace_flags & TRACE_ITER_SLEEP_TIME)
5217 return;
5218
5219 timestamp = trace_clock_local();
5220
5221 prev->ftrace_timestamp = timestamp;
5222
5223 /* only process tasks that we timestamped */
5224 if (!next->ftrace_timestamp)
5225 return;
5226
5227 /*
5228 * Update all the counters in next to make up for the
5229 * time next was sleeping.
5230 */
5231 timestamp -= next->ftrace_timestamp;
5232
5233 for (index = next->curr_ret_stack; index >= 0; index--)
5234 next->ret_stack[index].calltime += timestamp;
5235 }
5236
5237 /* Allocate a return stack for each task */
5238 static int start_graph_tracing(void)
5239 {
5240 struct ftrace_ret_stack **ret_stack_list;
5241 int ret, cpu;
5242
5243 ret_stack_list = kmalloc(FTRACE_RETSTACK_ALLOC_SIZE *
5244 sizeof(struct ftrace_ret_stack *),
5245 GFP_KERNEL);
5246
5247 if (!ret_stack_list)
5248 return -ENOMEM;
5249
5250 /* The cpu_boot init_task->ret_stack will never be freed */
5251 for_each_online_cpu(cpu) {
5252 if (!idle_task(cpu)->ret_stack)
5253 ftrace_graph_init_idle_task(idle_task(cpu), cpu);
5254 }
5255
5256 do {
5257 ret = alloc_retstack_tasklist(ret_stack_list);
5258 } while (ret == -EAGAIN);
5259
5260 if (!ret) {
5261 ret = register_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
5262 if (ret)
5263 pr_info("ftrace_graph: Couldn't activate tracepoint"
5264 " probe to kernel_sched_switch\n");
5265 }
5266
5267 kfree(ret_stack_list);
5268 return ret;
5269 }
5270
5271 /*
5272 * Hibernation protection.
5273 * The state of the current task is too much unstable during
5274 * suspend/restore to disk. We want to protect against that.
5275 */
5276 static int
5277 ftrace_suspend_notifier_call(struct notifier_block *bl, unsigned long state,
5278 void *unused)
5279 {
5280 switch (state) {
5281 case PM_HIBERNATION_PREPARE:
5282 pause_graph_tracing();
5283 break;
5284
5285 case PM_POST_HIBERNATION:
5286 unpause_graph_tracing();
5287 break;
5288 }
5289 return NOTIFY_DONE;
5290 }
5291
5292 static int ftrace_graph_entry_test(struct ftrace_graph_ent *trace)
5293 {
5294 if (!ftrace_ops_test(&global_ops, trace->func, NULL))
5295 return 0;
5296 return __ftrace_graph_entry(trace);
5297 }
5298
5299 /*
5300 * The function graph tracer should only trace the functions defined
5301 * by set_ftrace_filter and set_ftrace_notrace. If another function
5302 * tracer ops is registered, the graph tracer requires testing the
5303 * function against the global ops, and not just trace any function
5304 * that any ftrace_ops registered.
5305 */
5306 static void update_function_graph_func(void)
5307 {
5308 if (ftrace_ops_list == &ftrace_list_end ||
5309 (ftrace_ops_list == &global_ops &&
5310 global_ops.next == &ftrace_list_end))
5311 ftrace_graph_entry = __ftrace_graph_entry;
5312 else
5313 ftrace_graph_entry = ftrace_graph_entry_test;
5314 }
5315
5316 static struct notifier_block ftrace_suspend_notifier = {
5317 .notifier_call = ftrace_suspend_notifier_call,
5318 };
5319
5320 int register_ftrace_graph(trace_func_graph_ret_t retfunc,
5321 trace_func_graph_ent_t entryfunc)
5322 {
5323 int ret = 0;
5324
5325 mutex_lock(&ftrace_lock);
5326
5327 /* we currently allow only one tracer registered at a time */
5328 if (ftrace_graph_active) {
5329 ret = -EBUSY;
5330 goto out;
5331 }
5332
5333 register_pm_notifier(&ftrace_suspend_notifier);
5334
5335 ftrace_graph_active++;
5336 ret = start_graph_tracing();
5337 if (ret) {
5338 ftrace_graph_active--;
5339 goto out;
5340 }
5341
5342 ftrace_graph_return = retfunc;
5343
5344 /*
5345 * Update the indirect function to the entryfunc, and the
5346 * function that gets called to the entry_test first. Then
5347 * call the update fgraph entry function to determine if
5348 * the entryfunc should be called directly or not.
5349 */
5350 __ftrace_graph_entry = entryfunc;
5351 ftrace_graph_entry = ftrace_graph_entry_test;
5352 update_function_graph_func();
5353
5354 /* Function graph doesn't use the .func field of global_ops */
5355 global_ops.flags |= FTRACE_OPS_FL_STUB;
5356
5357 #ifdef CONFIG_DYNAMIC_FTRACE
5358 /* Optimize function graph calling (if implemented by arch) */
5359 global_ops.trampoline = FTRACE_GRAPH_ADDR;
5360 #endif
5361
5362 ret = ftrace_startup(&global_ops, FTRACE_START_FUNC_RET);
5363
5364 out:
5365 mutex_unlock(&ftrace_lock);
5366 return ret;
5367 }
5368
5369 void unregister_ftrace_graph(void)
5370 {
5371 mutex_lock(&ftrace_lock);
5372
5373 if (unlikely(!ftrace_graph_active))
5374 goto out;
5375
5376 ftrace_graph_active--;
5377 ftrace_graph_return = (trace_func_graph_ret_t)ftrace_stub;
5378 ftrace_graph_entry = ftrace_graph_entry_stub;
5379 __ftrace_graph_entry = ftrace_graph_entry_stub;
5380 ftrace_shutdown(&global_ops, FTRACE_STOP_FUNC_RET);
5381 global_ops.flags &= ~FTRACE_OPS_FL_STUB;
5382 #ifdef CONFIG_DYNAMIC_FTRACE
5383 global_ops.trampoline = 0;
5384 #endif
5385 unregister_pm_notifier(&ftrace_suspend_notifier);
5386 unregister_trace_sched_switch(ftrace_graph_probe_sched_switch, NULL);
5387
5388 out:
5389 mutex_unlock(&ftrace_lock);
5390 }
5391
5392 static DEFINE_PER_CPU(struct ftrace_ret_stack *, idle_ret_stack);
5393
5394 static void
5395 graph_init_task(struct task_struct *t, struct ftrace_ret_stack *ret_stack)
5396 {
5397 atomic_set(&t->tracing_graph_pause, 0);
5398 atomic_set(&t->trace_overrun, 0);
5399 t->ftrace_timestamp = 0;
5400 /* make curr_ret_stack visible before we add the ret_stack */
5401 smp_wmb();
5402 t->ret_stack = ret_stack;
5403 }
5404
5405 /*
5406 * Allocate a return stack for the idle task. May be the first
5407 * time through, or it may be done by CPU hotplug online.
5408 */
5409 void ftrace_graph_init_idle_task(struct task_struct *t, int cpu)
5410 {
5411 t->curr_ret_stack = -1;
5412 /*
5413 * The idle task has no parent, it either has its own
5414 * stack or no stack at all.
5415 */
5416 if (t->ret_stack)
5417 WARN_ON(t->ret_stack != per_cpu(idle_ret_stack, cpu));
5418
5419 if (ftrace_graph_active) {
5420 struct ftrace_ret_stack *ret_stack;
5421
5422 ret_stack = per_cpu(idle_ret_stack, cpu);
5423 if (!ret_stack) {
5424 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
5425 * sizeof(struct ftrace_ret_stack),
5426 GFP_KERNEL);
5427 if (!ret_stack)
5428 return;
5429 per_cpu(idle_ret_stack, cpu) = ret_stack;
5430 }
5431 graph_init_task(t, ret_stack);
5432 }
5433 }
5434
5435 /* Allocate a return stack for newly created task */
5436 void ftrace_graph_init_task(struct task_struct *t)
5437 {
5438 /* Make sure we do not use the parent ret_stack */
5439 t->ret_stack = NULL;
5440 t->curr_ret_stack = -1;
5441
5442 if (ftrace_graph_active) {
5443 struct ftrace_ret_stack *ret_stack;
5444
5445 ret_stack = kmalloc(FTRACE_RETFUNC_DEPTH
5446 * sizeof(struct ftrace_ret_stack),
5447 GFP_KERNEL);
5448 if (!ret_stack)
5449 return;
5450 graph_init_task(t, ret_stack);
5451 }
5452 }
5453
5454 void ftrace_graph_exit_task(struct task_struct *t)
5455 {
5456 struct ftrace_ret_stack *ret_stack = t->ret_stack;
5457
5458 t->ret_stack = NULL;
5459 /* NULL must become visible to IRQs before we free it: */
5460 barrier();
5461
5462 kfree(ret_stack);
5463 }
5464
5465 void ftrace_graph_stop(void)
5466 {
5467 ftrace_stop();
5468 }
5469 #endif