Commit | Line | Data |
---|---|---|
fb52607a FW |
1 | /* |
2 | * | |
3 | * Function graph tracer. | |
9005f3eb | 4 | * Copyright (c) 2008-2009 Frederic Weisbecker <fweisbec@gmail.com> |
fb52607a FW |
5 | * Mostly borrowed from function tracer which |
6 | * is Copyright (c) Steven Rostedt <srostedt@redhat.com> | |
7 | * | |
8 | */ | |
9 | #include <linux/debugfs.h> | |
10 | #include <linux/uaccess.h> | |
11 | #include <linux/ftrace.h> | |
5a0e3ad6 | 12 | #include <linux/slab.h> |
fb52607a FW |
13 | #include <linux/fs.h> |
14 | ||
15 | #include "trace.h" | |
f0868d1e | 16 | #include "trace_output.h" |
fb52607a | 17 | |
b304d044 SR |
18 | /* When set, irq functions will be ignored */ |
19 | static int ftrace_graph_skip_irqs; | |
20 | ||
be1eca39 | 21 | struct fgraph_cpu_data { |
2fbcdb35 SR |
22 | pid_t last_pid; |
23 | int depth; | |
2bd16212 | 24 | int depth_irq; |
be1eca39 | 25 | int ignore; |
f1c7f517 | 26 | unsigned long enter_funcs[FTRACE_RETFUNC_DEPTH]; |
be1eca39 JO |
27 | }; |
28 | ||
29 | struct fgraph_data { | |
6016ee13 | 30 | struct fgraph_cpu_data __percpu *cpu_data; |
be1eca39 JO |
31 | |
32 | /* Place to preserve last processed entry. */ | |
33 | struct ftrace_graph_ent_entry ent; | |
34 | struct ftrace_graph_ret_entry ret; | |
35 | int failed; | |
36 | int cpu; | |
2fbcdb35 SR |
37 | }; |
38 | ||
287b6e68 | 39 | #define TRACE_GRAPH_INDENT 2 |
fb52607a | 40 | |
1a056155 | 41 | /* Flag options */ |
fb52607a | 42 | #define TRACE_GRAPH_PRINT_OVERRUN 0x1 |
1a056155 FW |
43 | #define TRACE_GRAPH_PRINT_CPU 0x2 |
44 | #define TRACE_GRAPH_PRINT_OVERHEAD 0x4 | |
11e84acc | 45 | #define TRACE_GRAPH_PRINT_PROC 0x8 |
9005f3eb | 46 | #define TRACE_GRAPH_PRINT_DURATION 0x10 |
9106b693 | 47 | #define TRACE_GRAPH_PRINT_ABS_TIME 0x20 |
2bd16212 | 48 | #define TRACE_GRAPH_PRINT_IRQS 0x40 |
1a056155 | 49 | |
8741db53 SR |
50 | static unsigned int max_depth; |
51 | ||
fb52607a | 52 | static struct tracer_opt trace_opts[] = { |
9005f3eb | 53 | /* Display overruns? (for self-debug purpose) */ |
1a056155 FW |
54 | { TRACER_OPT(funcgraph-overrun, TRACE_GRAPH_PRINT_OVERRUN) }, |
55 | /* Display CPU ? */ | |
56 | { TRACER_OPT(funcgraph-cpu, TRACE_GRAPH_PRINT_CPU) }, | |
57 | /* Display Overhead ? */ | |
58 | { TRACER_OPT(funcgraph-overhead, TRACE_GRAPH_PRINT_OVERHEAD) }, | |
11e84acc FW |
59 | /* Display proc name/pid */ |
60 | { TRACER_OPT(funcgraph-proc, TRACE_GRAPH_PRINT_PROC) }, | |
9005f3eb FW |
61 | /* Display duration of execution */ |
62 | { TRACER_OPT(funcgraph-duration, TRACE_GRAPH_PRINT_DURATION) }, | |
63 | /* Display absolute time of an entry */ | |
64 | { TRACER_OPT(funcgraph-abstime, TRACE_GRAPH_PRINT_ABS_TIME) }, | |
2bd16212 JO |
65 | /* Display interrupts */ |
66 | { TRACER_OPT(funcgraph-irqs, TRACE_GRAPH_PRINT_IRQS) }, | |
fb52607a FW |
67 | { } /* Empty entry */ |
68 | }; | |
69 | ||
70 | static struct tracer_flags tracer_flags = { | |
11e84acc | 71 | /* Don't display overruns and proc by default */ |
9005f3eb | 72 | .val = TRACE_GRAPH_PRINT_CPU | TRACE_GRAPH_PRINT_OVERHEAD | |
2bd16212 | 73 | TRACE_GRAPH_PRINT_DURATION | TRACE_GRAPH_PRINT_IRQS, |
fb52607a FW |
74 | .opts = trace_opts |
75 | }; | |
76 | ||
1a0799a8 | 77 | static struct trace_array *graph_array; |
9005f3eb | 78 | |
ffeb80fc JO |
79 | /* |
80 | * DURATION column is being also used to display IRQ signs, | |
81 | * following values are used by print_graph_irq and others | |
82 | * to fill in space into DURATION column. | |
83 | */ | |
84 | enum { | |
6fc84ea7 SRRH |
85 | FLAGS_FILL_FULL = 1 << TRACE_GRAPH_PRINT_FILL_SHIFT, |
86 | FLAGS_FILL_START = 2 << TRACE_GRAPH_PRINT_FILL_SHIFT, | |
87 | FLAGS_FILL_END = 3 << TRACE_GRAPH_PRINT_FILL_SHIFT, | |
ffeb80fc JO |
88 | }; |
89 | ||
90 | static enum print_line_t | |
91 | print_graph_duration(unsigned long long duration, struct trace_seq *s, | |
92 | u32 flags); | |
fb52607a | 93 | |
712406a6 SR |
94 | /* Add a function return address to the trace stack on thread info.*/ |
95 | int | |
71e308a2 SR |
96 | ftrace_push_return_trace(unsigned long ret, unsigned long func, int *depth, |
97 | unsigned long frame_pointer) | |
712406a6 | 98 | { |
5d1a03dc | 99 | unsigned long long calltime; |
712406a6 SR |
100 | int index; |
101 | ||
102 | if (!current->ret_stack) | |
103 | return -EBUSY; | |
104 | ||
82310a32 SR |
105 | /* |
106 | * We must make sure the ret_stack is tested before we read | |
107 | * anything else. | |
108 | */ | |
109 | smp_rmb(); | |
110 | ||
712406a6 SR |
111 | /* The return trace stack is full */ |
112 | if (current->curr_ret_stack == FTRACE_RETFUNC_DEPTH - 1) { | |
113 | atomic_inc(¤t->trace_overrun); | |
114 | return -EBUSY; | |
115 | } | |
116 | ||
29ad23b0 NK |
117 | /* |
118 | * The curr_ret_stack is an index to ftrace return stack of | |
119 | * current task. Its value should be in [0, FTRACE_RETFUNC_ | |
120 | * DEPTH) when the function graph tracer is used. To support | |
121 | * filtering out specific functions, it makes the index | |
122 | * negative by subtracting huge value (FTRACE_NOTRACE_DEPTH) | |
123 | * so when it sees a negative index the ftrace will ignore | |
124 | * the record. And the index gets recovered when returning | |
125 | * from the filtered function by adding the FTRACE_NOTRACE_ | |
126 | * DEPTH and then it'll continue to record functions normally. | |
127 | * | |
128 | * The curr_ret_stack is initialized to -1 and get increased | |
129 | * in this function. So it can be less than -1 only if it was | |
130 | * filtered out via ftrace_graph_notrace_addr() which can be | |
131 | * set from set_graph_notrace file in debugfs by user. | |
132 | */ | |
133 | if (current->curr_ret_stack < -1) | |
134 | return -EBUSY; | |
135 | ||
5d1a03dc SR |
136 | calltime = trace_clock_local(); |
137 | ||
712406a6 | 138 | index = ++current->curr_ret_stack; |
29ad23b0 NK |
139 | if (ftrace_graph_notrace_addr(func)) |
140 | current->curr_ret_stack -= FTRACE_NOTRACE_DEPTH; | |
712406a6 SR |
141 | barrier(); |
142 | current->ret_stack[index].ret = ret; | |
143 | current->ret_stack[index].func = func; | |
5d1a03dc | 144 | current->ret_stack[index].calltime = calltime; |
a2a16d6a | 145 | current->ret_stack[index].subtime = 0; |
71e308a2 | 146 | current->ret_stack[index].fp = frame_pointer; |
29ad23b0 | 147 | *depth = current->curr_ret_stack; |
712406a6 SR |
148 | |
149 | return 0; | |
150 | } | |
151 | ||
152 | /* Retrieve a function return address to the trace stack on thread info.*/ | |
a2a16d6a | 153 | static void |
71e308a2 SR |
154 | ftrace_pop_return_trace(struct ftrace_graph_ret *trace, unsigned long *ret, |
155 | unsigned long frame_pointer) | |
712406a6 SR |
156 | { |
157 | int index; | |
158 | ||
159 | index = current->curr_ret_stack; | |
160 | ||
29ad23b0 NK |
161 | /* |
162 | * A negative index here means that it's just returned from a | |
163 | * notrace'd function. Recover index to get an original | |
164 | * return address. See ftrace_push_return_trace(). | |
165 | * | |
166 | * TODO: Need to check whether the stack gets corrupted. | |
167 | */ | |
168 | if (index < 0) | |
169 | index += FTRACE_NOTRACE_DEPTH; | |
170 | ||
171 | if (unlikely(index < 0 || index >= FTRACE_RETFUNC_DEPTH)) { | |
712406a6 SR |
172 | ftrace_graph_stop(); |
173 | WARN_ON(1); | |
174 | /* Might as well panic, otherwise we have no where to go */ | |
175 | *ret = (unsigned long)panic; | |
176 | return; | |
177 | } | |
178 | ||
781d0624 | 179 | #if defined(CONFIG_HAVE_FUNCTION_GRAPH_FP_TEST) && !defined(CC_USING_FENTRY) |
71e308a2 SR |
180 | /* |
181 | * The arch may choose to record the frame pointer used | |
182 | * and check it here to make sure that it is what we expect it | |
183 | * to be. If gcc does not set the place holder of the return | |
184 | * address in the frame pointer, and does a copy instead, then | |
185 | * the function graph trace will fail. This test detects this | |
186 | * case. | |
187 | * | |
188 | * Currently, x86_32 with optimize for size (-Os) makes the latest | |
189 | * gcc do the above. | |
781d0624 SR |
190 | * |
191 | * Note, -mfentry does not use frame pointers, and this test | |
192 | * is not needed if CC_USING_FENTRY is set. | |
71e308a2 SR |
193 | */ |
194 | if (unlikely(current->ret_stack[index].fp != frame_pointer)) { | |
195 | ftrace_graph_stop(); | |
196 | WARN(1, "Bad frame pointer: expected %lx, received %lx\n" | |
b375a11a | 197 | " from func %ps return to %lx\n", |
71e308a2 SR |
198 | current->ret_stack[index].fp, |
199 | frame_pointer, | |
200 | (void *)current->ret_stack[index].func, | |
201 | current->ret_stack[index].ret); | |
202 | *ret = (unsigned long)panic; | |
203 | return; | |
204 | } | |
205 | #endif | |
206 | ||
712406a6 SR |
207 | *ret = current->ret_stack[index].ret; |
208 | trace->func = current->ret_stack[index].func; | |
209 | trace->calltime = current->ret_stack[index].calltime; | |
210 | trace->overrun = atomic_read(¤t->trace_overrun); | |
211 | trace->depth = index; | |
712406a6 SR |
212 | } |
213 | ||
214 | /* | |
215 | * Send the trace to the ring-buffer. | |
216 | * @return the original return address. | |
217 | */ | |
71e308a2 | 218 | unsigned long ftrace_return_to_handler(unsigned long frame_pointer) |
712406a6 SR |
219 | { |
220 | struct ftrace_graph_ret trace; | |
221 | unsigned long ret; | |
222 | ||
71e308a2 | 223 | ftrace_pop_return_trace(&trace, &ret, frame_pointer); |
0012693a | 224 | trace.rettime = trace_clock_local(); |
a2a16d6a SR |
225 | barrier(); |
226 | current->curr_ret_stack--; | |
29ad23b0 NK |
227 | /* |
228 | * The curr_ret_stack can be less than -1 only if it was | |
229 | * filtered out and it's about to return from the function. | |
230 | * Recover the index and continue to trace normal functions. | |
231 | */ | |
232 | if (current->curr_ret_stack < -1) { | |
233 | current->curr_ret_stack += FTRACE_NOTRACE_DEPTH; | |
234 | return ret; | |
235 | } | |
712406a6 | 236 | |
03274a3f SRRH |
237 | /* |
238 | * The trace should run after decrementing the ret counter | |
239 | * in case an interrupt were to come in. We don't want to | |
240 | * lose the interrupt if max_depth is set. | |
241 | */ | |
242 | ftrace_graph_return(&trace); | |
243 | ||
712406a6 SR |
244 | if (unlikely(!ret)) { |
245 | ftrace_graph_stop(); | |
246 | WARN_ON(1); | |
247 | /* Might as well panic. What else to do? */ | |
248 | ret = (unsigned long)panic; | |
249 | } | |
250 | ||
251 | return ret; | |
252 | } | |
253 | ||
62b915f1 | 254 | int __trace_graph_entry(struct trace_array *tr, |
1a0799a8 FW |
255 | struct ftrace_graph_ent *trace, |
256 | unsigned long flags, | |
257 | int pc) | |
258 | { | |
259 | struct ftrace_event_call *call = &event_funcgraph_entry; | |
260 | struct ring_buffer_event *event; | |
12883efb | 261 | struct ring_buffer *buffer = tr->trace_buffer.buffer; |
1a0799a8 FW |
262 | struct ftrace_graph_ent_entry *entry; |
263 | ||
dd17c8f7 | 264 | if (unlikely(__this_cpu_read(ftrace_cpu_disabled))) |
1a0799a8 FW |
265 | return 0; |
266 | ||
e77405ad | 267 | event = trace_buffer_lock_reserve(buffer, TRACE_GRAPH_ENT, |
1a0799a8 FW |
268 | sizeof(*entry), flags, pc); |
269 | if (!event) | |
270 | return 0; | |
271 | entry = ring_buffer_event_data(event); | |
272 | entry->graph_ent = *trace; | |
f306cc82 | 273 | if (!call_filter_check_discard(call, entry, buffer, event)) |
7ffbd48d | 274 | __buffer_unlock_commit(buffer, event); |
1a0799a8 FW |
275 | |
276 | return 1; | |
277 | } | |
278 | ||
b304d044 SR |
279 | static inline int ftrace_graph_ignore_irqs(void) |
280 | { | |
e4a3f541 | 281 | if (!ftrace_graph_skip_irqs || trace_recursion_test(TRACE_IRQ_BIT)) |
b304d044 SR |
282 | return 0; |
283 | ||
284 | return in_irq(); | |
285 | } | |
286 | ||
1a0799a8 FW |
287 | int trace_graph_entry(struct ftrace_graph_ent *trace) |
288 | { | |
289 | struct trace_array *tr = graph_array; | |
290 | struct trace_array_cpu *data; | |
291 | unsigned long flags; | |
292 | long disabled; | |
293 | int ret; | |
294 | int cpu; | |
295 | int pc; | |
296 | ||
1a0799a8 FW |
297 | if (!ftrace_trace_task(current)) |
298 | return 0; | |
299 | ||
ea2c68a0 | 300 | /* trace it when it is-nested-in or is a function enabled. */ |
8741db53 | 301 | if ((!(trace->depth || ftrace_graph_addr(trace->func)) || |
29ad23b0 | 302 | ftrace_graph_ignore_irqs()) || (trace->depth < 0) || |
8741db53 | 303 | (max_depth && trace->depth >= max_depth)) |
1a0799a8 FW |
304 | return 0; |
305 | ||
29ad23b0 NK |
306 | /* |
307 | * Do not trace a function if it's filtered by set_graph_notrace. | |
308 | * Make the index of ret stack negative to indicate that it should | |
309 | * ignore further functions. But it needs its own ret stack entry | |
310 | * to recover the original index in order to continue tracing after | |
311 | * returning from the function. | |
312 | */ | |
313 | if (ftrace_graph_notrace_addr(trace->func)) | |
314 | return 1; | |
315 | ||
1a0799a8 FW |
316 | local_irq_save(flags); |
317 | cpu = raw_smp_processor_id(); | |
12883efb | 318 | data = per_cpu_ptr(tr->trace_buffer.data, cpu); |
1a0799a8 FW |
319 | disabled = atomic_inc_return(&data->disabled); |
320 | if (likely(disabled == 1)) { | |
321 | pc = preempt_count(); | |
322 | ret = __trace_graph_entry(tr, trace, flags, pc); | |
323 | } else { | |
324 | ret = 0; | |
325 | } | |
1a0799a8 FW |
326 | |
327 | atomic_dec(&data->disabled); | |
328 | local_irq_restore(flags); | |
329 | ||
330 | return ret; | |
331 | } | |
332 | ||
0e950173 TB |
333 | int trace_graph_thresh_entry(struct ftrace_graph_ent *trace) |
334 | { | |
335 | if (tracing_thresh) | |
336 | return 1; | |
337 | else | |
338 | return trace_graph_entry(trace); | |
339 | } | |
340 | ||
0a772620 JO |
341 | static void |
342 | __trace_graph_function(struct trace_array *tr, | |
343 | unsigned long ip, unsigned long flags, int pc) | |
344 | { | |
345 | u64 time = trace_clock_local(); | |
346 | struct ftrace_graph_ent ent = { | |
347 | .func = ip, | |
348 | .depth = 0, | |
349 | }; | |
350 | struct ftrace_graph_ret ret = { | |
351 | .func = ip, | |
352 | .depth = 0, | |
353 | .calltime = time, | |
354 | .rettime = time, | |
355 | }; | |
356 | ||
357 | __trace_graph_entry(tr, &ent, flags, pc); | |
358 | __trace_graph_return(tr, &ret, flags, pc); | |
359 | } | |
360 | ||
361 | void | |
362 | trace_graph_function(struct trace_array *tr, | |
363 | unsigned long ip, unsigned long parent_ip, | |
364 | unsigned long flags, int pc) | |
365 | { | |
0a772620 JO |
366 | __trace_graph_function(tr, ip, flags, pc); |
367 | } | |
368 | ||
62b915f1 | 369 | void __trace_graph_return(struct trace_array *tr, |
1a0799a8 FW |
370 | struct ftrace_graph_ret *trace, |
371 | unsigned long flags, | |
372 | int pc) | |
373 | { | |
374 | struct ftrace_event_call *call = &event_funcgraph_exit; | |
375 | struct ring_buffer_event *event; | |
12883efb | 376 | struct ring_buffer *buffer = tr->trace_buffer.buffer; |
1a0799a8 FW |
377 | struct ftrace_graph_ret_entry *entry; |
378 | ||
dd17c8f7 | 379 | if (unlikely(__this_cpu_read(ftrace_cpu_disabled))) |
1a0799a8 FW |
380 | return; |
381 | ||
e77405ad | 382 | event = trace_buffer_lock_reserve(buffer, TRACE_GRAPH_RET, |
1a0799a8 FW |
383 | sizeof(*entry), flags, pc); |
384 | if (!event) | |
385 | return; | |
386 | entry = ring_buffer_event_data(event); | |
387 | entry->ret = *trace; | |
f306cc82 | 388 | if (!call_filter_check_discard(call, entry, buffer, event)) |
7ffbd48d | 389 | __buffer_unlock_commit(buffer, event); |
1a0799a8 FW |
390 | } |
391 | ||
392 | void trace_graph_return(struct ftrace_graph_ret *trace) | |
393 | { | |
394 | struct trace_array *tr = graph_array; | |
395 | struct trace_array_cpu *data; | |
396 | unsigned long flags; | |
397 | long disabled; | |
398 | int cpu; | |
399 | int pc; | |
400 | ||
401 | local_irq_save(flags); | |
402 | cpu = raw_smp_processor_id(); | |
12883efb | 403 | data = per_cpu_ptr(tr->trace_buffer.data, cpu); |
1a0799a8 FW |
404 | disabled = atomic_inc_return(&data->disabled); |
405 | if (likely(disabled == 1)) { | |
406 | pc = preempt_count(); | |
407 | __trace_graph_return(tr, trace, flags, pc); | |
408 | } | |
1a0799a8 FW |
409 | atomic_dec(&data->disabled); |
410 | local_irq_restore(flags); | |
411 | } | |
412 | ||
24a53652 FW |
413 | void set_graph_array(struct trace_array *tr) |
414 | { | |
415 | graph_array = tr; | |
416 | ||
417 | /* Make graph_array visible before we start tracing */ | |
418 | ||
419 | smp_mb(); | |
420 | } | |
421 | ||
0e950173 TB |
422 | void trace_graph_thresh_return(struct ftrace_graph_ret *trace) |
423 | { | |
424 | if (tracing_thresh && | |
425 | (trace->rettime - trace->calltime < tracing_thresh)) | |
426 | return; | |
427 | else | |
428 | trace_graph_return(trace); | |
429 | } | |
430 | ||
fb52607a FW |
431 | static int graph_trace_init(struct trace_array *tr) |
432 | { | |
1a0799a8 FW |
433 | int ret; |
434 | ||
24a53652 | 435 | set_graph_array(tr); |
0e950173 TB |
436 | if (tracing_thresh) |
437 | ret = register_ftrace_graph(&trace_graph_thresh_return, | |
438 | &trace_graph_thresh_entry); | |
439 | else | |
440 | ret = register_ftrace_graph(&trace_graph_return, | |
441 | &trace_graph_entry); | |
660c7f9b SR |
442 | if (ret) |
443 | return ret; | |
444 | tracing_start_cmdline_record(); | |
445 | ||
446 | return 0; | |
fb52607a FW |
447 | } |
448 | ||
449 | static void graph_trace_reset(struct trace_array *tr) | |
450 | { | |
660c7f9b SR |
451 | tracing_stop_cmdline_record(); |
452 | unregister_ftrace_graph(); | |
fb52607a FW |
453 | } |
454 | ||
0c9e6f63 | 455 | static int max_bytes_for_cpu; |
1a056155 FW |
456 | |
457 | static enum print_line_t | |
458 | print_graph_cpu(struct trace_seq *s, int cpu) | |
459 | { | |
1a056155 | 460 | int ret; |
1a056155 | 461 | |
d51090b3 IM |
462 | /* |
463 | * Start with a space character - to make it stand out | |
464 | * to the right a bit when trace output is pasted into | |
465 | * email: | |
466 | */ | |
0c9e6f63 | 467 | ret = trace_seq_printf(s, " %*d) ", max_bytes_for_cpu, cpu); |
1a056155 | 468 | if (!ret) |
d51090b3 IM |
469 | return TRACE_TYPE_PARTIAL_LINE; |
470 | ||
1a056155 FW |
471 | return TRACE_TYPE_HANDLED; |
472 | } | |
473 | ||
11e84acc FW |
474 | #define TRACE_GRAPH_PROCINFO_LENGTH 14 |
475 | ||
476 | static enum print_line_t | |
477 | print_graph_proc(struct trace_seq *s, pid_t pid) | |
478 | { | |
4ca53085 | 479 | char comm[TASK_COMM_LEN]; |
11e84acc FW |
480 | /* sign + log10(MAX_INT) + '\0' */ |
481 | char pid_str[11]; | |
4ca53085 SR |
482 | int spaces = 0; |
483 | int ret; | |
484 | int len; | |
485 | int i; | |
11e84acc | 486 | |
4ca53085 | 487 | trace_find_cmdline(pid, comm); |
11e84acc FW |
488 | comm[7] = '\0'; |
489 | sprintf(pid_str, "%d", pid); | |
490 | ||
491 | /* 1 stands for the "-" character */ | |
492 | len = strlen(comm) + strlen(pid_str) + 1; | |
493 | ||
494 | if (len < TRACE_GRAPH_PROCINFO_LENGTH) | |
495 | spaces = TRACE_GRAPH_PROCINFO_LENGTH - len; | |
496 | ||
497 | /* First spaces to align center */ | |
498 | for (i = 0; i < spaces / 2; i++) { | |
146c3442 | 499 | ret = trace_seq_putc(s, ' '); |
11e84acc FW |
500 | if (!ret) |
501 | return TRACE_TYPE_PARTIAL_LINE; | |
502 | } | |
503 | ||
504 | ret = trace_seq_printf(s, "%s-%s", comm, pid_str); | |
505 | if (!ret) | |
506 | return TRACE_TYPE_PARTIAL_LINE; | |
507 | ||
508 | /* Last spaces to align center */ | |
509 | for (i = 0; i < spaces - (spaces / 2); i++) { | |
146c3442 | 510 | ret = trace_seq_putc(s, ' '); |
11e84acc FW |
511 | if (!ret) |
512 | return TRACE_TYPE_PARTIAL_LINE; | |
513 | } | |
514 | return TRACE_TYPE_HANDLED; | |
515 | } | |
516 | ||
1a056155 | 517 | |
49ff5903 SR |
518 | static enum print_line_t |
519 | print_graph_lat_fmt(struct trace_seq *s, struct trace_entry *entry) | |
520 | { | |
f81c972d | 521 | if (!trace_seq_putc(s, ' ')) |
637e7e86 SR |
522 | return 0; |
523 | ||
f81c972d | 524 | return trace_print_lat_fmt(s, entry); |
49ff5903 SR |
525 | } |
526 | ||
287b6e68 | 527 | /* If the pid changed since the last trace, output this event */ |
11e84acc | 528 | static enum print_line_t |
2fbcdb35 | 529 | verif_pid(struct trace_seq *s, pid_t pid, int cpu, struct fgraph_data *data) |
287b6e68 | 530 | { |
d51090b3 | 531 | pid_t prev_pid; |
9005f3eb | 532 | pid_t *last_pid; |
d51090b3 | 533 | int ret; |
660c7f9b | 534 | |
2fbcdb35 | 535 | if (!data) |
9005f3eb FW |
536 | return TRACE_TYPE_HANDLED; |
537 | ||
be1eca39 | 538 | last_pid = &(per_cpu_ptr(data->cpu_data, cpu)->last_pid); |
9005f3eb FW |
539 | |
540 | if (*last_pid == pid) | |
11e84acc | 541 | return TRACE_TYPE_HANDLED; |
fb52607a | 542 | |
9005f3eb FW |
543 | prev_pid = *last_pid; |
544 | *last_pid = pid; | |
d51090b3 | 545 | |
9005f3eb FW |
546 | if (prev_pid == -1) |
547 | return TRACE_TYPE_HANDLED; | |
d51090b3 IM |
548 | /* |
549 | * Context-switch trace line: | |
550 | ||
551 | ------------------------------------------ | |
552 | | 1) migration/0--1 => sshd-1755 | |
553 | ------------------------------------------ | |
554 | ||
555 | */ | |
146c3442 | 556 | ret = trace_seq_puts(s, |
1fd8f2a3 | 557 | " ------------------------------------------\n"); |
11e84acc | 558 | if (!ret) |
810dc732 | 559 | return TRACE_TYPE_PARTIAL_LINE; |
11e84acc FW |
560 | |
561 | ret = print_graph_cpu(s, cpu); | |
562 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
810dc732 | 563 | return TRACE_TYPE_PARTIAL_LINE; |
11e84acc FW |
564 | |
565 | ret = print_graph_proc(s, prev_pid); | |
566 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
810dc732 | 567 | return TRACE_TYPE_PARTIAL_LINE; |
11e84acc | 568 | |
146c3442 | 569 | ret = trace_seq_puts(s, " => "); |
11e84acc | 570 | if (!ret) |
810dc732 | 571 | return TRACE_TYPE_PARTIAL_LINE; |
11e84acc FW |
572 | |
573 | ret = print_graph_proc(s, pid); | |
574 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
810dc732 | 575 | return TRACE_TYPE_PARTIAL_LINE; |
11e84acc | 576 | |
146c3442 | 577 | ret = trace_seq_puts(s, |
11e84acc FW |
578 | "\n ------------------------------------------\n\n"); |
579 | if (!ret) | |
810dc732 | 580 | return TRACE_TYPE_PARTIAL_LINE; |
11e84acc | 581 | |
810dc732 | 582 | return TRACE_TYPE_HANDLED; |
287b6e68 FW |
583 | } |
584 | ||
b91facc3 FW |
585 | static struct ftrace_graph_ret_entry * |
586 | get_return_for_leaf(struct trace_iterator *iter, | |
83a8df61 FW |
587 | struct ftrace_graph_ent_entry *curr) |
588 | { | |
be1eca39 JO |
589 | struct fgraph_data *data = iter->private; |
590 | struct ring_buffer_iter *ring_iter = NULL; | |
83a8df61 FW |
591 | struct ring_buffer_event *event; |
592 | struct ftrace_graph_ret_entry *next; | |
593 | ||
be1eca39 JO |
594 | /* |
595 | * If the previous output failed to write to the seq buffer, | |
596 | * then we just reuse the data from before. | |
597 | */ | |
598 | if (data && data->failed) { | |
599 | curr = &data->ent; | |
600 | next = &data->ret; | |
601 | } else { | |
83a8df61 | 602 | |
6d158a81 | 603 | ring_iter = trace_buffer_iter(iter, iter->cpu); |
be1eca39 JO |
604 | |
605 | /* First peek to compare current entry and the next one */ | |
606 | if (ring_iter) | |
607 | event = ring_buffer_iter_peek(ring_iter, NULL); | |
608 | else { | |
609 | /* | |
610 | * We need to consume the current entry to see | |
611 | * the next one. | |
612 | */ | |
12883efb | 613 | ring_buffer_consume(iter->trace_buffer->buffer, iter->cpu, |
66a8cb95 | 614 | NULL, NULL); |
12883efb | 615 | event = ring_buffer_peek(iter->trace_buffer->buffer, iter->cpu, |
66a8cb95 | 616 | NULL, NULL); |
be1eca39 | 617 | } |
83a8df61 | 618 | |
be1eca39 JO |
619 | if (!event) |
620 | return NULL; | |
621 | ||
622 | next = ring_buffer_event_data(event); | |
83a8df61 | 623 | |
be1eca39 JO |
624 | if (data) { |
625 | /* | |
626 | * Save current and next entries for later reference | |
627 | * if the output fails. | |
628 | */ | |
629 | data->ent = *curr; | |
575570f0 SL |
630 | /* |
631 | * If the next event is not a return type, then | |
632 | * we only care about what type it is. Otherwise we can | |
633 | * safely copy the entire event. | |
634 | */ | |
635 | if (next->ent.type == TRACE_GRAPH_RET) | |
636 | data->ret = *next; | |
637 | else | |
638 | data->ret.ent.type = next->ent.type; | |
be1eca39 JO |
639 | } |
640 | } | |
83a8df61 FW |
641 | |
642 | if (next->ent.type != TRACE_GRAPH_RET) | |
b91facc3 | 643 | return NULL; |
83a8df61 FW |
644 | |
645 | if (curr->ent.pid != next->ent.pid || | |
646 | curr->graph_ent.func != next->ret.func) | |
b91facc3 | 647 | return NULL; |
83a8df61 | 648 | |
b91facc3 FW |
649 | /* this is a leaf, now advance the iterator */ |
650 | if (ring_iter) | |
651 | ring_buffer_read(ring_iter, NULL); | |
652 | ||
653 | return next; | |
83a8df61 FW |
654 | } |
655 | ||
d1f9cbd7 FW |
656 | static int print_graph_abs_time(u64 t, struct trace_seq *s) |
657 | { | |
658 | unsigned long usecs_rem; | |
659 | ||
660 | usecs_rem = do_div(t, NSEC_PER_SEC); | |
661 | usecs_rem /= 1000; | |
662 | ||
663 | return trace_seq_printf(s, "%5lu.%06lu | ", | |
664 | (unsigned long)t, usecs_rem); | |
665 | } | |
666 | ||
f8b755ac | 667 | static enum print_line_t |
d1f9cbd7 | 668 | print_graph_irq(struct trace_iterator *iter, unsigned long addr, |
d7a8d9e9 | 669 | enum trace_type type, int cpu, pid_t pid, u32 flags) |
f8b755ac FW |
670 | { |
671 | int ret; | |
d1f9cbd7 | 672 | struct trace_seq *s = &iter->seq; |
f8b755ac FW |
673 | |
674 | if (addr < (unsigned long)__irqentry_text_start || | |
675 | addr >= (unsigned long)__irqentry_text_end) | |
676 | return TRACE_TYPE_UNHANDLED; | |
677 | ||
749230b0 JO |
678 | if (trace_flags & TRACE_ITER_CONTEXT_INFO) { |
679 | /* Absolute time */ | |
680 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) { | |
681 | ret = print_graph_abs_time(iter->ts, s); | |
682 | if (!ret) | |
683 | return TRACE_TYPE_PARTIAL_LINE; | |
684 | } | |
d1f9cbd7 | 685 | |
749230b0 JO |
686 | /* Cpu */ |
687 | if (flags & TRACE_GRAPH_PRINT_CPU) { | |
688 | ret = print_graph_cpu(s, cpu); | |
689 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
690 | return TRACE_TYPE_PARTIAL_LINE; | |
691 | } | |
49ff5903 | 692 | |
749230b0 JO |
693 | /* Proc */ |
694 | if (flags & TRACE_GRAPH_PRINT_PROC) { | |
695 | ret = print_graph_proc(s, pid); | |
696 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
697 | return TRACE_TYPE_PARTIAL_LINE; | |
146c3442 | 698 | ret = trace_seq_puts(s, " | "); |
749230b0 JO |
699 | if (!ret) |
700 | return TRACE_TYPE_PARTIAL_LINE; | |
701 | } | |
9005f3eb | 702 | } |
f8b755ac | 703 | |
9005f3eb | 704 | /* No overhead */ |
6fc84ea7 | 705 | ret = print_graph_duration(0, s, flags | FLAGS_FILL_START); |
ffeb80fc JO |
706 | if (ret != TRACE_TYPE_HANDLED) |
707 | return ret; | |
f8b755ac | 708 | |
9005f3eb | 709 | if (type == TRACE_GRAPH_ENT) |
146c3442 | 710 | ret = trace_seq_puts(s, "==========>"); |
9005f3eb | 711 | else |
146c3442 | 712 | ret = trace_seq_puts(s, "<=========="); |
9005f3eb FW |
713 | |
714 | if (!ret) | |
715 | return TRACE_TYPE_PARTIAL_LINE; | |
716 | ||
6fc84ea7 | 717 | ret = print_graph_duration(0, s, flags | FLAGS_FILL_END); |
ffeb80fc JO |
718 | if (ret != TRACE_TYPE_HANDLED) |
719 | return ret; | |
720 | ||
146c3442 | 721 | ret = trace_seq_putc(s, '\n'); |
f8b755ac | 722 | |
f8b755ac FW |
723 | if (!ret) |
724 | return TRACE_TYPE_PARTIAL_LINE; | |
725 | return TRACE_TYPE_HANDLED; | |
726 | } | |
83a8df61 | 727 | |
0706f1c4 SR |
728 | enum print_line_t |
729 | trace_print_graph_duration(unsigned long long duration, struct trace_seq *s) | |
83a8df61 FW |
730 | { |
731 | unsigned long nsecs_rem = do_div(duration, 1000); | |
166d3c79 FW |
732 | /* log10(ULONG_MAX) + '\0' */ |
733 | char msecs_str[21]; | |
734 | char nsecs_str[5]; | |
735 | int ret, len; | |
736 | int i; | |
737 | ||
738 | sprintf(msecs_str, "%lu", (unsigned long) duration); | |
739 | ||
740 | /* Print msecs */ | |
9005f3eb | 741 | ret = trace_seq_printf(s, "%s", msecs_str); |
166d3c79 FW |
742 | if (!ret) |
743 | return TRACE_TYPE_PARTIAL_LINE; | |
744 | ||
745 | len = strlen(msecs_str); | |
746 | ||
747 | /* Print nsecs (we don't want to exceed 7 numbers) */ | |
748 | if (len < 7) { | |
14cae9bd BP |
749 | size_t slen = min_t(size_t, sizeof(nsecs_str), 8UL - len); |
750 | ||
751 | snprintf(nsecs_str, slen, "%03lu", nsecs_rem); | |
166d3c79 FW |
752 | ret = trace_seq_printf(s, ".%s", nsecs_str); |
753 | if (!ret) | |
754 | return TRACE_TYPE_PARTIAL_LINE; | |
755 | len += strlen(nsecs_str); | |
756 | } | |
757 | ||
146c3442 | 758 | ret = trace_seq_puts(s, " us "); |
166d3c79 FW |
759 | if (!ret) |
760 | return TRACE_TYPE_PARTIAL_LINE; | |
761 | ||
762 | /* Print remaining spaces to fit the row's width */ | |
763 | for (i = len; i < 7; i++) { | |
146c3442 | 764 | ret = trace_seq_putc(s, ' '); |
166d3c79 FW |
765 | if (!ret) |
766 | return TRACE_TYPE_PARTIAL_LINE; | |
767 | } | |
0706f1c4 SR |
768 | return TRACE_TYPE_HANDLED; |
769 | } | |
770 | ||
771 | static enum print_line_t | |
ffeb80fc JO |
772 | print_graph_duration(unsigned long long duration, struct trace_seq *s, |
773 | u32 flags) | |
0706f1c4 | 774 | { |
ffeb80fc JO |
775 | int ret = -1; |
776 | ||
749230b0 JO |
777 | if (!(flags & TRACE_GRAPH_PRINT_DURATION) || |
778 | !(trace_flags & TRACE_ITER_CONTEXT_INFO)) | |
779 | return TRACE_TYPE_HANDLED; | |
ffeb80fc JO |
780 | |
781 | /* No real adata, just filling the column with spaces */ | |
6fc84ea7 SRRH |
782 | switch (flags & TRACE_GRAPH_PRINT_FILL_MASK) { |
783 | case FLAGS_FILL_FULL: | |
146c3442 | 784 | ret = trace_seq_puts(s, " | "); |
ffeb80fc | 785 | return ret ? TRACE_TYPE_HANDLED : TRACE_TYPE_PARTIAL_LINE; |
6fc84ea7 | 786 | case FLAGS_FILL_START: |
146c3442 | 787 | ret = trace_seq_puts(s, " "); |
ffeb80fc | 788 | return ret ? TRACE_TYPE_HANDLED : TRACE_TYPE_PARTIAL_LINE; |
6fc84ea7 | 789 | case FLAGS_FILL_END: |
146c3442 | 790 | ret = trace_seq_puts(s, " |"); |
ffeb80fc JO |
791 | return ret ? TRACE_TYPE_HANDLED : TRACE_TYPE_PARTIAL_LINE; |
792 | } | |
793 | ||
794 | /* Signal a overhead of time execution to the output */ | |
795 | if (flags & TRACE_GRAPH_PRINT_OVERHEAD) { | |
796 | /* Duration exceeded 100 msecs */ | |
797 | if (duration > 100000ULL) | |
146c3442 | 798 | ret = trace_seq_puts(s, "! "); |
ffeb80fc JO |
799 | /* Duration exceeded 10 msecs */ |
800 | else if (duration > 10000ULL) | |
146c3442 | 801 | ret = trace_seq_puts(s, "+ "); |
ffeb80fc JO |
802 | } |
803 | ||
804 | /* | |
805 | * The -1 means we either did not exceed the duration tresholds | |
806 | * or we dont want to print out the overhead. Either way we need | |
807 | * to fill out the space. | |
808 | */ | |
809 | if (ret == -1) | |
146c3442 | 810 | ret = trace_seq_puts(s, " "); |
ffeb80fc JO |
811 | |
812 | /* Catching here any failure happenned above */ | |
813 | if (!ret) | |
814 | return TRACE_TYPE_PARTIAL_LINE; | |
0706f1c4 SR |
815 | |
816 | ret = trace_print_graph_duration(duration, s); | |
817 | if (ret != TRACE_TYPE_HANDLED) | |
818 | return ret; | |
166d3c79 | 819 | |
146c3442 | 820 | ret = trace_seq_puts(s, "| "); |
166d3c79 FW |
821 | if (!ret) |
822 | return TRACE_TYPE_PARTIAL_LINE; | |
166d3c79 | 823 | |
0706f1c4 | 824 | return TRACE_TYPE_HANDLED; |
83a8df61 FW |
825 | } |
826 | ||
83a8df61 | 827 | /* Case of a leaf function on its call entry */ |
287b6e68 | 828 | static enum print_line_t |
83a8df61 | 829 | print_graph_entry_leaf(struct trace_iterator *iter, |
b91facc3 | 830 | struct ftrace_graph_ent_entry *entry, |
d7a8d9e9 JO |
831 | struct ftrace_graph_ret_entry *ret_entry, |
832 | struct trace_seq *s, u32 flags) | |
fb52607a | 833 | { |
2fbcdb35 | 834 | struct fgraph_data *data = iter->private; |
83a8df61 | 835 | struct ftrace_graph_ret *graph_ret; |
83a8df61 FW |
836 | struct ftrace_graph_ent *call; |
837 | unsigned long long duration; | |
fb52607a | 838 | int ret; |
1a056155 | 839 | int i; |
fb52607a | 840 | |
83a8df61 FW |
841 | graph_ret = &ret_entry->ret; |
842 | call = &entry->graph_ent; | |
843 | duration = graph_ret->rettime - graph_ret->calltime; | |
844 | ||
2fbcdb35 | 845 | if (data) { |
f1c7f517 | 846 | struct fgraph_cpu_data *cpu_data; |
2fbcdb35 | 847 | int cpu = iter->cpu; |
f1c7f517 SR |
848 | |
849 | cpu_data = per_cpu_ptr(data->cpu_data, cpu); | |
2fbcdb35 SR |
850 | |
851 | /* | |
852 | * Comments display at + 1 to depth. Since | |
853 | * this is a leaf function, keep the comments | |
854 | * equal to this depth. | |
855 | */ | |
f1c7f517 SR |
856 | cpu_data->depth = call->depth - 1; |
857 | ||
858 | /* No need to keep this function around for this depth */ | |
859 | if (call->depth < FTRACE_RETFUNC_DEPTH) | |
860 | cpu_data->enter_funcs[call->depth] = 0; | |
2fbcdb35 SR |
861 | } |
862 | ||
ffeb80fc JO |
863 | /* Overhead and duration */ |
864 | ret = print_graph_duration(duration, s, flags); | |
865 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
9005f3eb | 866 | return TRACE_TYPE_PARTIAL_LINE; |
1a056155 | 867 | |
83a8df61 FW |
868 | /* Function */ |
869 | for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) { | |
146c3442 | 870 | ret = trace_seq_putc(s, ' '); |
83a8df61 FW |
871 | if (!ret) |
872 | return TRACE_TYPE_PARTIAL_LINE; | |
873 | } | |
874 | ||
b375a11a | 875 | ret = trace_seq_printf(s, "%ps();\n", (void *)call->func); |
83a8df61 FW |
876 | if (!ret) |
877 | return TRACE_TYPE_PARTIAL_LINE; | |
878 | ||
879 | return TRACE_TYPE_HANDLED; | |
880 | } | |
881 | ||
882 | static enum print_line_t | |
2fbcdb35 SR |
883 | print_graph_entry_nested(struct trace_iterator *iter, |
884 | struct ftrace_graph_ent_entry *entry, | |
d7a8d9e9 | 885 | struct trace_seq *s, int cpu, u32 flags) |
83a8df61 | 886 | { |
83a8df61 | 887 | struct ftrace_graph_ent *call = &entry->graph_ent; |
2fbcdb35 SR |
888 | struct fgraph_data *data = iter->private; |
889 | int ret; | |
890 | int i; | |
891 | ||
892 | if (data) { | |
f1c7f517 | 893 | struct fgraph_cpu_data *cpu_data; |
2fbcdb35 | 894 | int cpu = iter->cpu; |
2fbcdb35 | 895 | |
f1c7f517 SR |
896 | cpu_data = per_cpu_ptr(data->cpu_data, cpu); |
897 | cpu_data->depth = call->depth; | |
898 | ||
899 | /* Save this function pointer to see if the exit matches */ | |
900 | if (call->depth < FTRACE_RETFUNC_DEPTH) | |
901 | cpu_data->enter_funcs[call->depth] = call->func; | |
2fbcdb35 | 902 | } |
83a8df61 | 903 | |
9005f3eb | 904 | /* No time */ |
6fc84ea7 | 905 | ret = print_graph_duration(0, s, flags | FLAGS_FILL_FULL); |
ffeb80fc JO |
906 | if (ret != TRACE_TYPE_HANDLED) |
907 | return ret; | |
f8b755ac | 908 | |
83a8df61 | 909 | /* Function */ |
287b6e68 | 910 | for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) { |
146c3442 | 911 | ret = trace_seq_putc(s, ' '); |
fb52607a FW |
912 | if (!ret) |
913 | return TRACE_TYPE_PARTIAL_LINE; | |
287b6e68 FW |
914 | } |
915 | ||
b375a11a | 916 | ret = trace_seq_printf(s, "%ps() {\n", (void *)call->func); |
83a8df61 FW |
917 | if (!ret) |
918 | return TRACE_TYPE_PARTIAL_LINE; | |
919 | ||
b91facc3 FW |
920 | /* |
921 | * we already consumed the current entry to check the next one | |
922 | * and see if this is a leaf. | |
923 | */ | |
924 | return TRACE_TYPE_NO_CONSUME; | |
287b6e68 FW |
925 | } |
926 | ||
83a8df61 | 927 | static enum print_line_t |
ac5f6c96 | 928 | print_graph_prologue(struct trace_iterator *iter, struct trace_seq *s, |
d7a8d9e9 | 929 | int type, unsigned long addr, u32 flags) |
83a8df61 | 930 | { |
2fbcdb35 | 931 | struct fgraph_data *data = iter->private; |
83a8df61 | 932 | struct trace_entry *ent = iter->ent; |
ac5f6c96 SR |
933 | int cpu = iter->cpu; |
934 | int ret; | |
83a8df61 | 935 | |
1a056155 | 936 | /* Pid */ |
2fbcdb35 | 937 | if (verif_pid(s, ent->pid, cpu, data) == TRACE_TYPE_PARTIAL_LINE) |
9005f3eb FW |
938 | return TRACE_TYPE_PARTIAL_LINE; |
939 | ||
ac5f6c96 SR |
940 | if (type) { |
941 | /* Interrupt */ | |
d7a8d9e9 | 942 | ret = print_graph_irq(iter, addr, type, cpu, ent->pid, flags); |
ac5f6c96 SR |
943 | if (ret == TRACE_TYPE_PARTIAL_LINE) |
944 | return TRACE_TYPE_PARTIAL_LINE; | |
945 | } | |
83a8df61 | 946 | |
749230b0 JO |
947 | if (!(trace_flags & TRACE_ITER_CONTEXT_INFO)) |
948 | return 0; | |
949 | ||
9005f3eb | 950 | /* Absolute time */ |
d7a8d9e9 | 951 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) { |
9005f3eb FW |
952 | ret = print_graph_abs_time(iter->ts, s); |
953 | if (!ret) | |
954 | return TRACE_TYPE_PARTIAL_LINE; | |
955 | } | |
956 | ||
1a056155 | 957 | /* Cpu */ |
d7a8d9e9 | 958 | if (flags & TRACE_GRAPH_PRINT_CPU) { |
1a056155 | 959 | ret = print_graph_cpu(s, cpu); |
11e84acc FW |
960 | if (ret == TRACE_TYPE_PARTIAL_LINE) |
961 | return TRACE_TYPE_PARTIAL_LINE; | |
962 | } | |
963 | ||
964 | /* Proc */ | |
d7a8d9e9 | 965 | if (flags & TRACE_GRAPH_PRINT_PROC) { |
00a8bf85 | 966 | ret = print_graph_proc(s, ent->pid); |
11e84acc FW |
967 | if (ret == TRACE_TYPE_PARTIAL_LINE) |
968 | return TRACE_TYPE_PARTIAL_LINE; | |
969 | ||
146c3442 | 970 | ret = trace_seq_puts(s, " | "); |
1a056155 FW |
971 | if (!ret) |
972 | return TRACE_TYPE_PARTIAL_LINE; | |
973 | } | |
83a8df61 | 974 | |
49ff5903 SR |
975 | /* Latency format */ |
976 | if (trace_flags & TRACE_ITER_LATENCY_FMT) { | |
977 | ret = print_graph_lat_fmt(s, ent); | |
978 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
979 | return TRACE_TYPE_PARTIAL_LINE; | |
980 | } | |
981 | ||
ac5f6c96 SR |
982 | return 0; |
983 | } | |
984 | ||
2bd16212 JO |
985 | /* |
986 | * Entry check for irq code | |
987 | * | |
988 | * returns 1 if | |
989 | * - we are inside irq code | |
25985edc | 990 | * - we just entered irq code |
2bd16212 JO |
991 | * |
992 | * retunns 0 if | |
993 | * - funcgraph-interrupts option is set | |
994 | * - we are not inside irq code | |
995 | */ | |
996 | static int | |
997 | check_irq_entry(struct trace_iterator *iter, u32 flags, | |
998 | unsigned long addr, int depth) | |
999 | { | |
1000 | int cpu = iter->cpu; | |
a9d61173 | 1001 | int *depth_irq; |
2bd16212 | 1002 | struct fgraph_data *data = iter->private; |
2bd16212 | 1003 | |
a9d61173 JO |
1004 | /* |
1005 | * If we are either displaying irqs, or we got called as | |
1006 | * a graph event and private data does not exist, | |
1007 | * then we bypass the irq check. | |
1008 | */ | |
1009 | if ((flags & TRACE_GRAPH_PRINT_IRQS) || | |
1010 | (!data)) | |
2bd16212 JO |
1011 | return 0; |
1012 | ||
a9d61173 JO |
1013 | depth_irq = &(per_cpu_ptr(data->cpu_data, cpu)->depth_irq); |
1014 | ||
2bd16212 JO |
1015 | /* |
1016 | * We are inside the irq code | |
1017 | */ | |
1018 | if (*depth_irq >= 0) | |
1019 | return 1; | |
1020 | ||
1021 | if ((addr < (unsigned long)__irqentry_text_start) || | |
1022 | (addr >= (unsigned long)__irqentry_text_end)) | |
1023 | return 0; | |
1024 | ||
1025 | /* | |
1026 | * We are entering irq code. | |
1027 | */ | |
1028 | *depth_irq = depth; | |
1029 | return 1; | |
1030 | } | |
1031 | ||
1032 | /* | |
1033 | * Return check for irq code | |
1034 | * | |
1035 | * returns 1 if | |
1036 | * - we are inside irq code | |
1037 | * - we just left irq code | |
1038 | * | |
1039 | * returns 0 if | |
1040 | * - funcgraph-interrupts option is set | |
1041 | * - we are not inside irq code | |
1042 | */ | |
1043 | static int | |
1044 | check_irq_return(struct trace_iterator *iter, u32 flags, int depth) | |
1045 | { | |
1046 | int cpu = iter->cpu; | |
a9d61173 | 1047 | int *depth_irq; |
2bd16212 | 1048 | struct fgraph_data *data = iter->private; |
2bd16212 | 1049 | |
a9d61173 JO |
1050 | /* |
1051 | * If we are either displaying irqs, or we got called as | |
1052 | * a graph event and private data does not exist, | |
1053 | * then we bypass the irq check. | |
1054 | */ | |
1055 | if ((flags & TRACE_GRAPH_PRINT_IRQS) || | |
1056 | (!data)) | |
2bd16212 JO |
1057 | return 0; |
1058 | ||
a9d61173 JO |
1059 | depth_irq = &(per_cpu_ptr(data->cpu_data, cpu)->depth_irq); |
1060 | ||
2bd16212 JO |
1061 | /* |
1062 | * We are not inside the irq code. | |
1063 | */ | |
1064 | if (*depth_irq == -1) | |
1065 | return 0; | |
1066 | ||
1067 | /* | |
1068 | * We are inside the irq code, and this is returning entry. | |
1069 | * Let's not trace it and clear the entry depth, since | |
1070 | * we are out of irq code. | |
1071 | * | |
1072 | * This condition ensures that we 'leave the irq code' once | |
1073 | * we are out of the entry depth. Thus protecting us from | |
1074 | * the RETURN entry loss. | |
1075 | */ | |
1076 | if (*depth_irq >= depth) { | |
1077 | *depth_irq = -1; | |
1078 | return 1; | |
1079 | } | |
1080 | ||
1081 | /* | |
1082 | * We are inside the irq code, and this is not the entry. | |
1083 | */ | |
1084 | return 1; | |
1085 | } | |
1086 | ||
ac5f6c96 SR |
1087 | static enum print_line_t |
1088 | print_graph_entry(struct ftrace_graph_ent_entry *field, struct trace_seq *s, | |
d7a8d9e9 | 1089 | struct trace_iterator *iter, u32 flags) |
ac5f6c96 | 1090 | { |
be1eca39 | 1091 | struct fgraph_data *data = iter->private; |
ac5f6c96 SR |
1092 | struct ftrace_graph_ent *call = &field->graph_ent; |
1093 | struct ftrace_graph_ret_entry *leaf_ret; | |
be1eca39 JO |
1094 | static enum print_line_t ret; |
1095 | int cpu = iter->cpu; | |
ac5f6c96 | 1096 | |
2bd16212 JO |
1097 | if (check_irq_entry(iter, flags, call->func, call->depth)) |
1098 | return TRACE_TYPE_HANDLED; | |
1099 | ||
d7a8d9e9 | 1100 | if (print_graph_prologue(iter, s, TRACE_GRAPH_ENT, call->func, flags)) |
ac5f6c96 SR |
1101 | return TRACE_TYPE_PARTIAL_LINE; |
1102 | ||
b91facc3 FW |
1103 | leaf_ret = get_return_for_leaf(iter, field); |
1104 | if (leaf_ret) | |
d7a8d9e9 | 1105 | ret = print_graph_entry_leaf(iter, field, leaf_ret, s, flags); |
83a8df61 | 1106 | else |
d7a8d9e9 | 1107 | ret = print_graph_entry_nested(iter, field, s, cpu, flags); |
83a8df61 | 1108 | |
be1eca39 JO |
1109 | if (data) { |
1110 | /* | |
1111 | * If we failed to write our output, then we need to make | |
1112 | * note of it. Because we already consumed our entry. | |
1113 | */ | |
1114 | if (s->full) { | |
1115 | data->failed = 1; | |
1116 | data->cpu = cpu; | |
1117 | } else | |
1118 | data->failed = 0; | |
1119 | } | |
1120 | ||
1121 | return ret; | |
83a8df61 FW |
1122 | } |
1123 | ||
287b6e68 FW |
1124 | static enum print_line_t |
1125 | print_graph_return(struct ftrace_graph_ret *trace, struct trace_seq *s, | |
d7a8d9e9 JO |
1126 | struct trace_entry *ent, struct trace_iterator *iter, |
1127 | u32 flags) | |
287b6e68 | 1128 | { |
83a8df61 | 1129 | unsigned long long duration = trace->rettime - trace->calltime; |
2fbcdb35 SR |
1130 | struct fgraph_data *data = iter->private; |
1131 | pid_t pid = ent->pid; | |
1132 | int cpu = iter->cpu; | |
f1c7f517 | 1133 | int func_match = 1; |
2fbcdb35 SR |
1134 | int ret; |
1135 | int i; | |
1136 | ||
2bd16212 JO |
1137 | if (check_irq_return(iter, flags, trace->depth)) |
1138 | return TRACE_TYPE_HANDLED; | |
1139 | ||
2fbcdb35 | 1140 | if (data) { |
f1c7f517 SR |
1141 | struct fgraph_cpu_data *cpu_data; |
1142 | int cpu = iter->cpu; | |
1143 | ||
1144 | cpu_data = per_cpu_ptr(data->cpu_data, cpu); | |
2fbcdb35 SR |
1145 | |
1146 | /* | |
1147 | * Comments display at + 1 to depth. This is the | |
1148 | * return from a function, we now want the comments | |
1149 | * to display at the same level of the bracket. | |
1150 | */ | |
f1c7f517 SR |
1151 | cpu_data->depth = trace->depth - 1; |
1152 | ||
1153 | if (trace->depth < FTRACE_RETFUNC_DEPTH) { | |
1154 | if (cpu_data->enter_funcs[trace->depth] != trace->func) | |
1155 | func_match = 0; | |
1156 | cpu_data->enter_funcs[trace->depth] = 0; | |
1157 | } | |
2fbcdb35 | 1158 | } |
287b6e68 | 1159 | |
d7a8d9e9 | 1160 | if (print_graph_prologue(iter, s, 0, 0, flags)) |
437f24fb SR |
1161 | return TRACE_TYPE_PARTIAL_LINE; |
1162 | ||
ffeb80fc JO |
1163 | /* Overhead and duration */ |
1164 | ret = print_graph_duration(duration, s, flags); | |
1165 | if (ret == TRACE_TYPE_PARTIAL_LINE) | |
9005f3eb | 1166 | return TRACE_TYPE_PARTIAL_LINE; |
1a056155 | 1167 | |
83a8df61 | 1168 | /* Closing brace */ |
287b6e68 | 1169 | for (i = 0; i < trace->depth * TRACE_GRAPH_INDENT; i++) { |
146c3442 | 1170 | ret = trace_seq_putc(s, ' '); |
fb52607a FW |
1171 | if (!ret) |
1172 | return TRACE_TYPE_PARTIAL_LINE; | |
287b6e68 FW |
1173 | } |
1174 | ||
f1c7f517 SR |
1175 | /* |
1176 | * If the return function does not have a matching entry, | |
1177 | * then the entry was lost. Instead of just printing | |
1178 | * the '}' and letting the user guess what function this | |
1179 | * belongs to, write out the function name. | |
1180 | */ | |
1181 | if (func_match) { | |
146c3442 | 1182 | ret = trace_seq_puts(s, "}\n"); |
f1c7f517 SR |
1183 | if (!ret) |
1184 | return TRACE_TYPE_PARTIAL_LINE; | |
1185 | } else { | |
a094fe04 | 1186 | ret = trace_seq_printf(s, "} /* %ps */\n", (void *)trace->func); |
f1c7f517 SR |
1187 | if (!ret) |
1188 | return TRACE_TYPE_PARTIAL_LINE; | |
1189 | } | |
fb52607a | 1190 | |
83a8df61 | 1191 | /* Overrun */ |
d7a8d9e9 | 1192 | if (flags & TRACE_GRAPH_PRINT_OVERRUN) { |
287b6e68 FW |
1193 | ret = trace_seq_printf(s, " (Overruns: %lu)\n", |
1194 | trace->overrun); | |
fb52607a FW |
1195 | if (!ret) |
1196 | return TRACE_TYPE_PARTIAL_LINE; | |
287b6e68 | 1197 | } |
f8b755ac | 1198 | |
d7a8d9e9 JO |
1199 | ret = print_graph_irq(iter, trace->func, TRACE_GRAPH_RET, |
1200 | cpu, pid, flags); | |
f8b755ac FW |
1201 | if (ret == TRACE_TYPE_PARTIAL_LINE) |
1202 | return TRACE_TYPE_PARTIAL_LINE; | |
1203 | ||
287b6e68 FW |
1204 | return TRACE_TYPE_HANDLED; |
1205 | } | |
1206 | ||
1fd8f2a3 | 1207 | static enum print_line_t |
d7a8d9e9 JO |
1208 | print_graph_comment(struct trace_seq *s, struct trace_entry *ent, |
1209 | struct trace_iterator *iter, u32 flags) | |
1fd8f2a3 | 1210 | { |
5087f8d2 | 1211 | unsigned long sym_flags = (trace_flags & TRACE_ITER_SYM_MASK); |
2fbcdb35 | 1212 | struct fgraph_data *data = iter->private; |
5087f8d2 | 1213 | struct trace_event *event; |
2fbcdb35 | 1214 | int depth = 0; |
1fd8f2a3 | 1215 | int ret; |
2fbcdb35 SR |
1216 | int i; |
1217 | ||
1218 | if (data) | |
be1eca39 | 1219 | depth = per_cpu_ptr(data->cpu_data, iter->cpu)->depth; |
9005f3eb | 1220 | |
d7a8d9e9 | 1221 | if (print_graph_prologue(iter, s, 0, 0, flags)) |
d1f9cbd7 FW |
1222 | return TRACE_TYPE_PARTIAL_LINE; |
1223 | ||
9005f3eb | 1224 | /* No time */ |
6fc84ea7 | 1225 | ret = print_graph_duration(0, s, flags | FLAGS_FILL_FULL); |
ffeb80fc JO |
1226 | if (ret != TRACE_TYPE_HANDLED) |
1227 | return ret; | |
1fd8f2a3 | 1228 | |
1fd8f2a3 | 1229 | /* Indentation */ |
2fbcdb35 SR |
1230 | if (depth > 0) |
1231 | for (i = 0; i < (depth + 1) * TRACE_GRAPH_INDENT; i++) { | |
146c3442 | 1232 | ret = trace_seq_putc(s, ' '); |
1fd8f2a3 FW |
1233 | if (!ret) |
1234 | return TRACE_TYPE_PARTIAL_LINE; | |
1235 | } | |
1236 | ||
1237 | /* The comment */ | |
146c3442 | 1238 | ret = trace_seq_puts(s, "/* "); |
769b0441 FW |
1239 | if (!ret) |
1240 | return TRACE_TYPE_PARTIAL_LINE; | |
1241 | ||
5087f8d2 SR |
1242 | switch (iter->ent->type) { |
1243 | case TRACE_BPRINT: | |
1244 | ret = trace_print_bprintk_msg_only(iter); | |
1245 | if (ret != TRACE_TYPE_HANDLED) | |
1246 | return ret; | |
1247 | break; | |
1248 | case TRACE_PRINT: | |
1249 | ret = trace_print_printk_msg_only(iter); | |
1250 | if (ret != TRACE_TYPE_HANDLED) | |
1251 | return ret; | |
1252 | break; | |
1253 | default: | |
1254 | event = ftrace_find_event(ent->type); | |
1255 | if (!event) | |
1256 | return TRACE_TYPE_UNHANDLED; | |
1257 | ||
a9a57763 | 1258 | ret = event->funcs->trace(iter, sym_flags, event); |
5087f8d2 SR |
1259 | if (ret != TRACE_TYPE_HANDLED) |
1260 | return ret; | |
1261 | } | |
1fd8f2a3 | 1262 | |
412d0bb5 FW |
1263 | /* Strip ending newline */ |
1264 | if (s->buffer[s->len - 1] == '\n') { | |
1265 | s->buffer[s->len - 1] = '\0'; | |
1266 | s->len--; | |
1267 | } | |
1268 | ||
146c3442 | 1269 | ret = trace_seq_puts(s, " */\n"); |
1fd8f2a3 FW |
1270 | if (!ret) |
1271 | return TRACE_TYPE_PARTIAL_LINE; | |
1272 | ||
1273 | return TRACE_TYPE_HANDLED; | |
1274 | } | |
1275 | ||
1276 | ||
287b6e68 | 1277 | enum print_line_t |
321e68b0 | 1278 | print_graph_function_flags(struct trace_iterator *iter, u32 flags) |
287b6e68 | 1279 | { |
be1eca39 JO |
1280 | struct ftrace_graph_ent_entry *field; |
1281 | struct fgraph_data *data = iter->private; | |
287b6e68 | 1282 | struct trace_entry *entry = iter->ent; |
5087f8d2 | 1283 | struct trace_seq *s = &iter->seq; |
be1eca39 JO |
1284 | int cpu = iter->cpu; |
1285 | int ret; | |
1286 | ||
1287 | if (data && per_cpu_ptr(data->cpu_data, cpu)->ignore) { | |
1288 | per_cpu_ptr(data->cpu_data, cpu)->ignore = 0; | |
1289 | return TRACE_TYPE_HANDLED; | |
1290 | } | |
1291 | ||
1292 | /* | |
1293 | * If the last output failed, there's a possibility we need | |
1294 | * to print out the missing entry which would never go out. | |
1295 | */ | |
1296 | if (data && data->failed) { | |
1297 | field = &data->ent; | |
1298 | iter->cpu = data->cpu; | |
d7a8d9e9 | 1299 | ret = print_graph_entry(field, s, iter, flags); |
be1eca39 JO |
1300 | if (ret == TRACE_TYPE_HANDLED && iter->cpu != cpu) { |
1301 | per_cpu_ptr(data->cpu_data, iter->cpu)->ignore = 1; | |
1302 | ret = TRACE_TYPE_NO_CONSUME; | |
1303 | } | |
1304 | iter->cpu = cpu; | |
1305 | return ret; | |
1306 | } | |
fb52607a | 1307 | |
287b6e68 FW |
1308 | switch (entry->type) { |
1309 | case TRACE_GRAPH_ENT: { | |
38ceb592 LJ |
1310 | /* |
1311 | * print_graph_entry() may consume the current event, | |
1312 | * thus @field may become invalid, so we need to save it. | |
1313 | * sizeof(struct ftrace_graph_ent_entry) is very small, | |
1314 | * it can be safely saved at the stack. | |
1315 | */ | |
be1eca39 | 1316 | struct ftrace_graph_ent_entry saved; |
287b6e68 | 1317 | trace_assign_type(field, entry); |
38ceb592 | 1318 | saved = *field; |
d7a8d9e9 | 1319 | return print_graph_entry(&saved, s, iter, flags); |
287b6e68 FW |
1320 | } |
1321 | case TRACE_GRAPH_RET: { | |
1322 | struct ftrace_graph_ret_entry *field; | |
1323 | trace_assign_type(field, entry); | |
d7a8d9e9 | 1324 | return print_graph_return(&field->ret, s, entry, iter, flags); |
287b6e68 | 1325 | } |
62b915f1 JO |
1326 | case TRACE_STACK: |
1327 | case TRACE_FN: | |
1328 | /* dont trace stack and functions as comments */ | |
1329 | return TRACE_TYPE_UNHANDLED; | |
1330 | ||
287b6e68 | 1331 | default: |
d7a8d9e9 | 1332 | return print_graph_comment(s, entry, iter, flags); |
fb52607a | 1333 | } |
5087f8d2 SR |
1334 | |
1335 | return TRACE_TYPE_HANDLED; | |
fb52607a FW |
1336 | } |
1337 | ||
d7a8d9e9 JO |
1338 | static enum print_line_t |
1339 | print_graph_function(struct trace_iterator *iter) | |
1340 | { | |
321e68b0 | 1341 | return print_graph_function_flags(iter, tracer_flags.val); |
d7a8d9e9 JO |
1342 | } |
1343 | ||
9106b693 | 1344 | static enum print_line_t |
a9a57763 SR |
1345 | print_graph_function_event(struct trace_iterator *iter, int flags, |
1346 | struct trace_event *event) | |
9106b693 JO |
1347 | { |
1348 | return print_graph_function(iter); | |
1349 | } | |
1350 | ||
d7a8d9e9 | 1351 | static void print_lat_header(struct seq_file *s, u32 flags) |
49ff5903 SR |
1352 | { |
1353 | static const char spaces[] = " " /* 16 spaces */ | |
1354 | " " /* 4 spaces */ | |
1355 | " "; /* 17 spaces */ | |
1356 | int size = 0; | |
1357 | ||
d7a8d9e9 | 1358 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
49ff5903 | 1359 | size += 16; |
d7a8d9e9 | 1360 | if (flags & TRACE_GRAPH_PRINT_CPU) |
49ff5903 | 1361 | size += 4; |
d7a8d9e9 | 1362 | if (flags & TRACE_GRAPH_PRINT_PROC) |
49ff5903 SR |
1363 | size += 17; |
1364 | ||
1365 | seq_printf(s, "#%.*s _-----=> irqs-off \n", size, spaces); | |
1366 | seq_printf(s, "#%.*s / _----=> need-resched \n", size, spaces); | |
1367 | seq_printf(s, "#%.*s| / _---=> hardirq/softirq \n", size, spaces); | |
1368 | seq_printf(s, "#%.*s|| / _--=> preempt-depth \n", size, spaces); | |
199abfab | 1369 | seq_printf(s, "#%.*s||| / \n", size, spaces); |
49ff5903 SR |
1370 | } |
1371 | ||
0a772620 | 1372 | static void __print_graph_headers_flags(struct seq_file *s, u32 flags) |
decbec38 | 1373 | { |
49ff5903 SR |
1374 | int lat = trace_flags & TRACE_ITER_LATENCY_FMT; |
1375 | ||
1376 | if (lat) | |
d7a8d9e9 | 1377 | print_lat_header(s, flags); |
49ff5903 | 1378 | |
decbec38 | 1379 | /* 1st line */ |
49ff5903 | 1380 | seq_printf(s, "#"); |
d7a8d9e9 | 1381 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
9005f3eb | 1382 | seq_printf(s, " TIME "); |
d7a8d9e9 | 1383 | if (flags & TRACE_GRAPH_PRINT_CPU) |
49ff5903 | 1384 | seq_printf(s, " CPU"); |
d7a8d9e9 | 1385 | if (flags & TRACE_GRAPH_PRINT_PROC) |
49ff5903 SR |
1386 | seq_printf(s, " TASK/PID "); |
1387 | if (lat) | |
199abfab | 1388 | seq_printf(s, "||||"); |
d7a8d9e9 | 1389 | if (flags & TRACE_GRAPH_PRINT_DURATION) |
9005f3eb FW |
1390 | seq_printf(s, " DURATION "); |
1391 | seq_printf(s, " FUNCTION CALLS\n"); | |
decbec38 FW |
1392 | |
1393 | /* 2nd line */ | |
49ff5903 | 1394 | seq_printf(s, "#"); |
d7a8d9e9 | 1395 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
9005f3eb | 1396 | seq_printf(s, " | "); |
d7a8d9e9 | 1397 | if (flags & TRACE_GRAPH_PRINT_CPU) |
49ff5903 | 1398 | seq_printf(s, " | "); |
d7a8d9e9 | 1399 | if (flags & TRACE_GRAPH_PRINT_PROC) |
49ff5903 SR |
1400 | seq_printf(s, " | | "); |
1401 | if (lat) | |
199abfab | 1402 | seq_printf(s, "||||"); |
d7a8d9e9 | 1403 | if (flags & TRACE_GRAPH_PRINT_DURATION) |
9005f3eb FW |
1404 | seq_printf(s, " | | "); |
1405 | seq_printf(s, " | | | |\n"); | |
decbec38 | 1406 | } |
9005f3eb | 1407 | |
62b915f1 | 1408 | void print_graph_headers(struct seq_file *s) |
d7a8d9e9 JO |
1409 | { |
1410 | print_graph_headers_flags(s, tracer_flags.val); | |
1411 | } | |
1412 | ||
0a772620 JO |
1413 | void print_graph_headers_flags(struct seq_file *s, u32 flags) |
1414 | { | |
1415 | struct trace_iterator *iter = s->private; | |
1416 | ||
749230b0 JO |
1417 | if (!(trace_flags & TRACE_ITER_CONTEXT_INFO)) |
1418 | return; | |
1419 | ||
0a772620 JO |
1420 | if (trace_flags & TRACE_ITER_LATENCY_FMT) { |
1421 | /* print nothing if the buffers are empty */ | |
1422 | if (trace_empty(iter)) | |
1423 | return; | |
1424 | ||
1425 | print_trace_header(s, iter); | |
321e68b0 | 1426 | } |
0a772620 JO |
1427 | |
1428 | __print_graph_headers_flags(s, flags); | |
1429 | } | |
1430 | ||
62b915f1 | 1431 | void graph_trace_open(struct trace_iterator *iter) |
9005f3eb | 1432 | { |
2fbcdb35 | 1433 | /* pid and depth on the last trace processed */ |
be1eca39 | 1434 | struct fgraph_data *data; |
9005f3eb FW |
1435 | int cpu; |
1436 | ||
be1eca39 JO |
1437 | iter->private = NULL; |
1438 | ||
1439 | data = kzalloc(sizeof(*data), GFP_KERNEL); | |
2fbcdb35 | 1440 | if (!data) |
be1eca39 JO |
1441 | goto out_err; |
1442 | ||
1443 | data->cpu_data = alloc_percpu(struct fgraph_cpu_data); | |
1444 | if (!data->cpu_data) | |
1445 | goto out_err_free; | |
1446 | ||
1447 | for_each_possible_cpu(cpu) { | |
1448 | pid_t *pid = &(per_cpu_ptr(data->cpu_data, cpu)->last_pid); | |
1449 | int *depth = &(per_cpu_ptr(data->cpu_data, cpu)->depth); | |
1450 | int *ignore = &(per_cpu_ptr(data->cpu_data, cpu)->ignore); | |
2bd16212 JO |
1451 | int *depth_irq = &(per_cpu_ptr(data->cpu_data, cpu)->depth_irq); |
1452 | ||
be1eca39 JO |
1453 | *pid = -1; |
1454 | *depth = 0; | |
1455 | *ignore = 0; | |
2bd16212 | 1456 | *depth_irq = -1; |
be1eca39 | 1457 | } |
9005f3eb | 1458 | |
2fbcdb35 | 1459 | iter->private = data; |
be1eca39 JO |
1460 | |
1461 | return; | |
1462 | ||
1463 | out_err_free: | |
1464 | kfree(data); | |
1465 | out_err: | |
1466 | pr_warning("function graph tracer: not enough memory\n"); | |
9005f3eb FW |
1467 | } |
1468 | ||
62b915f1 | 1469 | void graph_trace_close(struct trace_iterator *iter) |
9005f3eb | 1470 | { |
be1eca39 JO |
1471 | struct fgraph_data *data = iter->private; |
1472 | ||
1473 | if (data) { | |
1474 | free_percpu(data->cpu_data); | |
1475 | kfree(data); | |
1476 | } | |
9005f3eb FW |
1477 | } |
1478 | ||
b304d044 SR |
1479 | static int func_graph_set_flag(u32 old_flags, u32 bit, int set) |
1480 | { | |
1481 | if (bit == TRACE_GRAPH_PRINT_IRQS) | |
1482 | ftrace_graph_skip_irqs = !set; | |
1483 | ||
1484 | return 0; | |
1485 | } | |
1486 | ||
a9a57763 SR |
1487 | static struct trace_event_functions graph_functions = { |
1488 | .trace = print_graph_function_event, | |
1489 | }; | |
1490 | ||
9106b693 JO |
1491 | static struct trace_event graph_trace_entry_event = { |
1492 | .type = TRACE_GRAPH_ENT, | |
a9a57763 | 1493 | .funcs = &graph_functions, |
9106b693 JO |
1494 | }; |
1495 | ||
1496 | static struct trace_event graph_trace_ret_event = { | |
1497 | .type = TRACE_GRAPH_RET, | |
a9a57763 | 1498 | .funcs = &graph_functions |
9106b693 JO |
1499 | }; |
1500 | ||
8f768993 | 1501 | static struct tracer graph_trace __tracer_data = { |
ef18012b | 1502 | .name = "function_graph", |
9005f3eb | 1503 | .open = graph_trace_open, |
be1eca39 | 1504 | .pipe_open = graph_trace_open, |
9005f3eb | 1505 | .close = graph_trace_close, |
be1eca39 | 1506 | .pipe_close = graph_trace_close, |
6eaaa5d5 | 1507 | .wait_pipe = poll_wait_pipe, |
ef18012b SR |
1508 | .init = graph_trace_init, |
1509 | .reset = graph_trace_reset, | |
decbec38 FW |
1510 | .print_line = print_graph_function, |
1511 | .print_header = print_graph_headers, | |
fb52607a | 1512 | .flags = &tracer_flags, |
b304d044 | 1513 | .set_flag = func_graph_set_flag, |
7447dce9 FW |
1514 | #ifdef CONFIG_FTRACE_SELFTEST |
1515 | .selftest = trace_selftest_startup_function_graph, | |
1516 | #endif | |
fb52607a FW |
1517 | }; |
1518 | ||
8741db53 SR |
1519 | |
1520 | static ssize_t | |
1521 | graph_depth_write(struct file *filp, const char __user *ubuf, size_t cnt, | |
1522 | loff_t *ppos) | |
1523 | { | |
1524 | unsigned long val; | |
1525 | int ret; | |
1526 | ||
1527 | ret = kstrtoul_from_user(ubuf, cnt, 10, &val); | |
1528 | if (ret) | |
1529 | return ret; | |
1530 | ||
1531 | max_depth = val; | |
1532 | ||
1533 | *ppos += cnt; | |
1534 | ||
1535 | return cnt; | |
1536 | } | |
1537 | ||
1538 | static ssize_t | |
1539 | graph_depth_read(struct file *filp, char __user *ubuf, size_t cnt, | |
1540 | loff_t *ppos) | |
1541 | { | |
1542 | char buf[15]; /* More than enough to hold UINT_MAX + "\n"*/ | |
1543 | int n; | |
1544 | ||
1545 | n = sprintf(buf, "%d\n", max_depth); | |
1546 | ||
1547 | return simple_read_from_buffer(ubuf, cnt, ppos, buf, n); | |
1548 | } | |
1549 | ||
1550 | static const struct file_operations graph_depth_fops = { | |
1551 | .open = tracing_open_generic, | |
1552 | .write = graph_depth_write, | |
1553 | .read = graph_depth_read, | |
1554 | .llseek = generic_file_llseek, | |
1555 | }; | |
1556 | ||
1557 | static __init int init_graph_debugfs(void) | |
1558 | { | |
1559 | struct dentry *d_tracer; | |
1560 | ||
1561 | d_tracer = tracing_init_dentry(); | |
1562 | if (!d_tracer) | |
1563 | return 0; | |
1564 | ||
1565 | trace_create_file("max_graph_depth", 0644, d_tracer, | |
1566 | NULL, &graph_depth_fops); | |
1567 | ||
1568 | return 0; | |
1569 | } | |
1570 | fs_initcall(init_graph_debugfs); | |
1571 | ||
fb52607a FW |
1572 | static __init int init_graph_trace(void) |
1573 | { | |
0c9e6f63 LJ |
1574 | max_bytes_for_cpu = snprintf(NULL, 0, "%d", nr_cpu_ids - 1); |
1575 | ||
9106b693 JO |
1576 | if (!register_ftrace_event(&graph_trace_entry_event)) { |
1577 | pr_warning("Warning: could not register graph trace events\n"); | |
1578 | return 1; | |
1579 | } | |
1580 | ||
1581 | if (!register_ftrace_event(&graph_trace_ret_event)) { | |
1582 | pr_warning("Warning: could not register graph trace events\n"); | |
1583 | return 1; | |
1584 | } | |
1585 | ||
fb52607a FW |
1586 | return register_tracer(&graph_trace); |
1587 | } | |
1588 | ||
6f415672 | 1589 | core_initcall(init_graph_trace); |