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