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