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