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