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