]>
Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
fb52607a FW |
2 | /* |
3 | * | |
4 | * Function graph tracer. | |
9005f3eb | 5 | * Copyright (c) 2008-2009 Frederic Weisbecker <fweisbec@gmail.com> |
fb52607a FW |
6 | * Mostly borrowed from function tracer which |
7 | * is Copyright (c) Steven Rostedt <srostedt@redhat.com> | |
8 | * | |
9 | */ | |
fb52607a FW |
10 | #include <linux/uaccess.h> |
11 | #include <linux/ftrace.h> | |
be7635e7 | 12 | #include <linux/interrupt.h> |
5a0e3ad6 | 13 | #include <linux/slab.h> |
fb52607a FW |
14 | #include <linux/fs.h> |
15 | ||
16 | #include "trace.h" | |
f0868d1e | 17 | #include "trace_output.h" |
fb52607a | 18 | |
b304d044 SR |
19 | /* When set, irq functions will be ignored */ |
20 | static int ftrace_graph_skip_irqs; | |
21 | ||
be1eca39 | 22 | struct fgraph_cpu_data { |
2fbcdb35 SR |
23 | pid_t last_pid; |
24 | int depth; | |
2bd16212 | 25 | int depth_irq; |
be1eca39 | 26 | int ignore; |
f1c7f517 | 27 | unsigned long enter_funcs[FTRACE_RETFUNC_DEPTH]; |
be1eca39 JO |
28 | }; |
29 | ||
30 | struct fgraph_data { | |
6016ee13 | 31 | struct fgraph_cpu_data __percpu *cpu_data; |
be1eca39 JO |
32 | |
33 | /* Place to preserve last processed entry. */ | |
34 | struct ftrace_graph_ent_entry ent; | |
35 | struct ftrace_graph_ret_entry ret; | |
36 | int failed; | |
37 | int cpu; | |
2fbcdb35 SR |
38 | }; |
39 | ||
287b6e68 | 40 | #define TRACE_GRAPH_INDENT 2 |
fb52607a | 41 | |
1a414428 | 42 | unsigned int fgraph_max_depth; |
8741db53 | 43 | |
fb52607a | 44 | static struct tracer_opt trace_opts[] = { |
9005f3eb | 45 | /* Display overruns? (for self-debug purpose) */ |
1a056155 FW |
46 | { TRACER_OPT(funcgraph-overrun, TRACE_GRAPH_PRINT_OVERRUN) }, |
47 | /* Display CPU ? */ | |
48 | { TRACER_OPT(funcgraph-cpu, TRACE_GRAPH_PRINT_CPU) }, | |
49 | /* Display Overhead ? */ | |
50 | { TRACER_OPT(funcgraph-overhead, TRACE_GRAPH_PRINT_OVERHEAD) }, | |
11e84acc FW |
51 | /* Display proc name/pid */ |
52 | { TRACER_OPT(funcgraph-proc, TRACE_GRAPH_PRINT_PROC) }, | |
9005f3eb FW |
53 | /* Display duration of execution */ |
54 | { TRACER_OPT(funcgraph-duration, TRACE_GRAPH_PRINT_DURATION) }, | |
55 | /* Display absolute time of an entry */ | |
56 | { TRACER_OPT(funcgraph-abstime, TRACE_GRAPH_PRINT_ABS_TIME) }, | |
2bd16212 JO |
57 | /* Display interrupts */ |
58 | { TRACER_OPT(funcgraph-irqs, TRACE_GRAPH_PRINT_IRQS) }, | |
607e3a29 RE |
59 | /* Display function name after trailing } */ |
60 | { TRACER_OPT(funcgraph-tail, TRACE_GRAPH_PRINT_TAIL) }, | |
55577204 SRRH |
61 | /* Include sleep time (scheduled out) between entry and return */ |
62 | { TRACER_OPT(sleep-time, TRACE_GRAPH_SLEEP_TIME) }, | |
c8dd0f45 SRV |
63 | |
64 | #ifdef CONFIG_FUNCTION_PROFILER | |
55577204 SRRH |
65 | /* Include time within nested functions */ |
66 | { TRACER_OPT(graph-time, TRACE_GRAPH_GRAPH_TIME) }, | |
c8dd0f45 SRV |
67 | #endif |
68 | ||
fb52607a FW |
69 | { } /* Empty entry */ |
70 | }; | |
71 | ||
72 | static struct tracer_flags tracer_flags = { | |
607e3a29 | 73 | /* Don't display overruns, proc, or tail by default */ |
9005f3eb | 74 | .val = TRACE_GRAPH_PRINT_CPU | TRACE_GRAPH_PRINT_OVERHEAD | |
55577204 SRRH |
75 | TRACE_GRAPH_PRINT_DURATION | TRACE_GRAPH_PRINT_IRQS | |
76 | TRACE_GRAPH_SLEEP_TIME | TRACE_GRAPH_GRAPH_TIME, | |
fb52607a FW |
77 | .opts = trace_opts |
78 | }; | |
79 | ||
1a0799a8 | 80 | static struct trace_array *graph_array; |
9005f3eb | 81 | |
ffeb80fc JO |
82 | /* |
83 | * DURATION column is being also used to display IRQ signs, | |
84 | * following values are used by print_graph_irq and others | |
85 | * to fill in space into DURATION column. | |
86 | */ | |
87 | enum { | |
6fc84ea7 SRRH |
88 | FLAGS_FILL_FULL = 1 << TRACE_GRAPH_PRINT_FILL_SHIFT, |
89 | FLAGS_FILL_START = 2 << TRACE_GRAPH_PRINT_FILL_SHIFT, | |
90 | FLAGS_FILL_END = 3 << TRACE_GRAPH_PRINT_FILL_SHIFT, | |
ffeb80fc JO |
91 | }; |
92 | ||
9d9add34 | 93 | static void |
983f938a SRRH |
94 | print_graph_duration(struct trace_array *tr, unsigned long long duration, |
95 | struct trace_seq *s, u32 flags); | |
fb52607a | 96 | |
62b915f1 | 97 | int __trace_graph_entry(struct trace_array *tr, |
1a0799a8 | 98 | struct ftrace_graph_ent *trace, |
36590c50 | 99 | unsigned int trace_ctx) |
1a0799a8 | 100 | { |
2425bcb9 | 101 | struct trace_event_call *call = &event_funcgraph_entry; |
1a0799a8 | 102 | struct ring_buffer_event *event; |
13292494 | 103 | struct trace_buffer *buffer = tr->array_buffer.buffer; |
1a0799a8 FW |
104 | struct ftrace_graph_ent_entry *entry; |
105 | ||
e77405ad | 106 | event = trace_buffer_lock_reserve(buffer, TRACE_GRAPH_ENT, |
36590c50 | 107 | sizeof(*entry), trace_ctx); |
1a0799a8 FW |
108 | if (!event) |
109 | return 0; | |
110 | entry = ring_buffer_event_data(event); | |
111 | entry->graph_ent = *trace; | |
f306cc82 | 112 | if (!call_filter_check_discard(call, entry, buffer, event)) |
52ffabe3 | 113 | trace_buffer_unlock_commit_nostack(buffer, event); |
1a0799a8 FW |
114 | |
115 | return 1; | |
116 | } | |
117 | ||
b304d044 SR |
118 | static inline int ftrace_graph_ignore_irqs(void) |
119 | { | |
e4a3f541 | 120 | if (!ftrace_graph_skip_irqs || trace_recursion_test(TRACE_IRQ_BIT)) |
b304d044 SR |
121 | return 0; |
122 | ||
123 | return in_irq(); | |
124 | } | |
125 | ||
1a0799a8 FW |
126 | int trace_graph_entry(struct ftrace_graph_ent *trace) |
127 | { | |
128 | struct trace_array *tr = graph_array; | |
129 | struct trace_array_cpu *data; | |
130 | unsigned long flags; | |
36590c50 | 131 | unsigned int trace_ctx; |
1a0799a8 FW |
132 | long disabled; |
133 | int ret; | |
134 | int cpu; | |
1a0799a8 | 135 | |
9cd2992f SRV |
136 | if (trace_recursion_test(TRACE_GRAPH_NOTRACE_BIT)) |
137 | return 0; | |
138 | ||
6c77221d CD |
139 | /* |
140 | * Do not trace a function if it's filtered by set_graph_notrace. | |
141 | * Make the index of ret stack negative to indicate that it should | |
142 | * ignore further functions. But it needs its own ret stack entry | |
143 | * to recover the original index in order to continue tracing after | |
144 | * returning from the function. | |
145 | */ | |
9cd2992f SRV |
146 | if (ftrace_graph_notrace_addr(trace->func)) { |
147 | trace_recursion_set(TRACE_GRAPH_NOTRACE_BIT); | |
148 | /* | |
149 | * Need to return 1 to have the return called | |
150 | * that will clear the NOTRACE bit. | |
151 | */ | |
152 | return 1; | |
153 | } | |
154 | ||
345ddcc8 | 155 | if (!ftrace_trace_task(tr)) |
1a0799a8 FW |
156 | return 0; |
157 | ||
1a414428 SRRH |
158 | if (ftrace_graph_ignore_func(trace)) |
159 | return 0; | |
160 | ||
161 | if (ftrace_graph_ignore_irqs()) | |
1a0799a8 FW |
162 | return 0; |
163 | ||
7fa8b717 JF |
164 | /* |
165 | * Stop here if tracing_threshold is set. We only write function return | |
166 | * events to the ring buffer. | |
167 | */ | |
168 | if (tracing_thresh) | |
169 | return 1; | |
170 | ||
1a0799a8 FW |
171 | local_irq_save(flags); |
172 | cpu = raw_smp_processor_id(); | |
1c5eb448 | 173 | data = per_cpu_ptr(tr->array_buffer.data, cpu); |
1a0799a8 FW |
174 | disabled = atomic_inc_return(&data->disabled); |
175 | if (likely(disabled == 1)) { | |
36590c50 SAS |
176 | trace_ctx = tracing_gen_ctx_flags(flags); |
177 | ret = __trace_graph_entry(tr, trace, trace_ctx); | |
1a0799a8 FW |
178 | } else { |
179 | ret = 0; | |
180 | } | |
1a0799a8 FW |
181 | |
182 | atomic_dec(&data->disabled); | |
183 | local_irq_restore(flags); | |
184 | ||
185 | return ret; | |
186 | } | |
187 | ||
0a772620 JO |
188 | static void |
189 | __trace_graph_function(struct trace_array *tr, | |
36590c50 | 190 | unsigned long ip, unsigned int trace_ctx) |
0a772620 JO |
191 | { |
192 | u64 time = trace_clock_local(); | |
193 | struct ftrace_graph_ent ent = { | |
194 | .func = ip, | |
195 | .depth = 0, | |
196 | }; | |
197 | struct ftrace_graph_ret ret = { | |
198 | .func = ip, | |
199 | .depth = 0, | |
200 | .calltime = time, | |
201 | .rettime = time, | |
202 | }; | |
203 | ||
36590c50 SAS |
204 | __trace_graph_entry(tr, &ent, trace_ctx); |
205 | __trace_graph_return(tr, &ret, trace_ctx); | |
0a772620 JO |
206 | } |
207 | ||
208 | void | |
209 | trace_graph_function(struct trace_array *tr, | |
210 | unsigned long ip, unsigned long parent_ip, | |
36590c50 | 211 | unsigned int trace_ctx) |
0a772620 | 212 | { |
36590c50 | 213 | __trace_graph_function(tr, ip, trace_ctx); |
0a772620 JO |
214 | } |
215 | ||
62b915f1 | 216 | void __trace_graph_return(struct trace_array *tr, |
1a0799a8 | 217 | struct ftrace_graph_ret *trace, |
36590c50 | 218 | unsigned int trace_ctx) |
1a0799a8 | 219 | { |
2425bcb9 | 220 | struct trace_event_call *call = &event_funcgraph_exit; |
1a0799a8 | 221 | struct ring_buffer_event *event; |
13292494 | 222 | struct trace_buffer *buffer = tr->array_buffer.buffer; |
1a0799a8 FW |
223 | struct ftrace_graph_ret_entry *entry; |
224 | ||
e77405ad | 225 | event = trace_buffer_lock_reserve(buffer, TRACE_GRAPH_RET, |
36590c50 | 226 | sizeof(*entry), trace_ctx); |
1a0799a8 FW |
227 | if (!event) |
228 | return; | |
229 | entry = ring_buffer_event_data(event); | |
230 | entry->ret = *trace; | |
f306cc82 | 231 | if (!call_filter_check_discard(call, entry, buffer, event)) |
52ffabe3 | 232 | trace_buffer_unlock_commit_nostack(buffer, event); |
1a0799a8 FW |
233 | } |
234 | ||
235 | void trace_graph_return(struct ftrace_graph_ret *trace) | |
236 | { | |
237 | struct trace_array *tr = graph_array; | |
238 | struct trace_array_cpu *data; | |
239 | unsigned long flags; | |
36590c50 | 240 | unsigned int trace_ctx; |
1a0799a8 FW |
241 | long disabled; |
242 | int cpu; | |
1a0799a8 | 243 | |
5cf99a0f SRV |
244 | ftrace_graph_addr_finish(trace); |
245 | ||
9cd2992f SRV |
246 | if (trace_recursion_test(TRACE_GRAPH_NOTRACE_BIT)) { |
247 | trace_recursion_clear(TRACE_GRAPH_NOTRACE_BIT); | |
248 | return; | |
249 | } | |
250 | ||
1a0799a8 FW |
251 | local_irq_save(flags); |
252 | cpu = raw_smp_processor_id(); | |
1c5eb448 | 253 | data = per_cpu_ptr(tr->array_buffer.data, cpu); |
1a0799a8 FW |
254 | disabled = atomic_inc_return(&data->disabled); |
255 | if (likely(disabled == 1)) { | |
36590c50 SAS |
256 | trace_ctx = tracing_gen_ctx_flags(flags); |
257 | __trace_graph_return(tr, trace, trace_ctx); | |
1a0799a8 | 258 | } |
1a0799a8 FW |
259 | atomic_dec(&data->disabled); |
260 | local_irq_restore(flags); | |
261 | } | |
262 | ||
24a53652 FW |
263 | void set_graph_array(struct trace_array *tr) |
264 | { | |
265 | graph_array = tr; | |
266 | ||
267 | /* Make graph_array visible before we start tracing */ | |
268 | ||
269 | smp_mb(); | |
270 | } | |
271 | ||
ba1afef6 | 272 | static void trace_graph_thresh_return(struct ftrace_graph_ret *trace) |
0e950173 | 273 | { |
5cf99a0f SRV |
274 | ftrace_graph_addr_finish(trace); |
275 | ||
9cd2992f SRV |
276 | if (trace_recursion_test(TRACE_GRAPH_NOTRACE_BIT)) { |
277 | trace_recursion_clear(TRACE_GRAPH_NOTRACE_BIT); | |
278 | return; | |
279 | } | |
280 | ||
0e950173 TB |
281 | if (tracing_thresh && |
282 | (trace->rettime - trace->calltime < tracing_thresh)) | |
283 | return; | |
284 | else | |
285 | trace_graph_return(trace); | |
286 | } | |
287 | ||
688f7089 SRV |
288 | static struct fgraph_ops funcgraph_thresh_ops = { |
289 | .entryfunc = &trace_graph_entry, | |
290 | .retfunc = &trace_graph_thresh_return, | |
291 | }; | |
292 | ||
293 | static struct fgraph_ops funcgraph_ops = { | |
294 | .entryfunc = &trace_graph_entry, | |
295 | .retfunc = &trace_graph_return, | |
296 | }; | |
297 | ||
fb52607a FW |
298 | static int graph_trace_init(struct trace_array *tr) |
299 | { | |
1a0799a8 FW |
300 | int ret; |
301 | ||
24a53652 | 302 | set_graph_array(tr); |
0e950173 | 303 | if (tracing_thresh) |
688f7089 | 304 | ret = register_ftrace_graph(&funcgraph_thresh_ops); |
0e950173 | 305 | else |
688f7089 | 306 | ret = register_ftrace_graph(&funcgraph_ops); |
660c7f9b SR |
307 | if (ret) |
308 | return ret; | |
309 | tracing_start_cmdline_record(); | |
310 | ||
311 | return 0; | |
fb52607a FW |
312 | } |
313 | ||
314 | static void graph_trace_reset(struct trace_array *tr) | |
315 | { | |
660c7f9b | 316 | tracing_stop_cmdline_record(); |
688f7089 SRV |
317 | if (tracing_thresh) |
318 | unregister_ftrace_graph(&funcgraph_thresh_ops); | |
319 | else | |
320 | unregister_ftrace_graph(&funcgraph_ops); | |
fb52607a FW |
321 | } |
322 | ||
ba1afef6 | 323 | static int graph_trace_update_thresh(struct trace_array *tr) |
6508fa76 SF |
324 | { |
325 | graph_trace_reset(tr); | |
326 | return graph_trace_init(tr); | |
327 | } | |
328 | ||
0c9e6f63 | 329 | static int max_bytes_for_cpu; |
1a056155 | 330 | |
9d9add34 | 331 | static void print_graph_cpu(struct trace_seq *s, int cpu) |
1a056155 | 332 | { |
d51090b3 IM |
333 | /* |
334 | * Start with a space character - to make it stand out | |
335 | * to the right a bit when trace output is pasted into | |
336 | * email: | |
337 | */ | |
9d9add34 | 338 | trace_seq_printf(s, " %*d) ", max_bytes_for_cpu, cpu); |
1a056155 FW |
339 | } |
340 | ||
11e84acc FW |
341 | #define TRACE_GRAPH_PROCINFO_LENGTH 14 |
342 | ||
9d9add34 | 343 | static void print_graph_proc(struct trace_seq *s, pid_t pid) |
11e84acc | 344 | { |
4ca53085 | 345 | char comm[TASK_COMM_LEN]; |
11e84acc FW |
346 | /* sign + log10(MAX_INT) + '\0' */ |
347 | char pid_str[11]; | |
4ca53085 | 348 | int spaces = 0; |
4ca53085 SR |
349 | int len; |
350 | int i; | |
11e84acc | 351 | |
4ca53085 | 352 | trace_find_cmdline(pid, comm); |
11e84acc FW |
353 | comm[7] = '\0'; |
354 | sprintf(pid_str, "%d", pid); | |
355 | ||
356 | /* 1 stands for the "-" character */ | |
357 | len = strlen(comm) + strlen(pid_str) + 1; | |
358 | ||
359 | if (len < TRACE_GRAPH_PROCINFO_LENGTH) | |
360 | spaces = TRACE_GRAPH_PROCINFO_LENGTH - len; | |
361 | ||
362 | /* First spaces to align center */ | |
9d9add34 SRRH |
363 | for (i = 0; i < spaces / 2; i++) |
364 | trace_seq_putc(s, ' '); | |
11e84acc | 365 | |
9d9add34 | 366 | trace_seq_printf(s, "%s-%s", comm, pid_str); |
11e84acc FW |
367 | |
368 | /* Last spaces to align center */ | |
9d9add34 SRRH |
369 | for (i = 0; i < spaces - (spaces / 2); i++) |
370 | trace_seq_putc(s, ' '); | |
11e84acc FW |
371 | } |
372 | ||
1a056155 | 373 | |
9d9add34 | 374 | static void print_graph_lat_fmt(struct trace_seq *s, struct trace_entry *entry) |
49ff5903 | 375 | { |
9d9add34 SRRH |
376 | trace_seq_putc(s, ' '); |
377 | trace_print_lat_fmt(s, entry); | |
afbab501 | 378 | trace_seq_puts(s, " | "); |
49ff5903 SR |
379 | } |
380 | ||
287b6e68 | 381 | /* If the pid changed since the last trace, output this event */ |
9d9add34 | 382 | static void |
2fbcdb35 | 383 | verif_pid(struct trace_seq *s, pid_t pid, int cpu, struct fgraph_data *data) |
287b6e68 | 384 | { |
d51090b3 | 385 | pid_t prev_pid; |
9005f3eb | 386 | pid_t *last_pid; |
660c7f9b | 387 | |
2fbcdb35 | 388 | if (!data) |
9d9add34 | 389 | return; |
9005f3eb | 390 | |
be1eca39 | 391 | last_pid = &(per_cpu_ptr(data->cpu_data, cpu)->last_pid); |
9005f3eb FW |
392 | |
393 | if (*last_pid == pid) | |
9d9add34 | 394 | return; |
fb52607a | 395 | |
9005f3eb FW |
396 | prev_pid = *last_pid; |
397 | *last_pid = pid; | |
d51090b3 | 398 | |
9005f3eb | 399 | if (prev_pid == -1) |
9d9add34 | 400 | return; |
d51090b3 IM |
401 | /* |
402 | * Context-switch trace line: | |
403 | ||
404 | ------------------------------------------ | |
405 | | 1) migration/0--1 => sshd-1755 | |
406 | ------------------------------------------ | |
407 | ||
408 | */ | |
9d9add34 SRRH |
409 | trace_seq_puts(s, " ------------------------------------------\n"); |
410 | print_graph_cpu(s, cpu); | |
411 | print_graph_proc(s, prev_pid); | |
412 | trace_seq_puts(s, " => "); | |
413 | print_graph_proc(s, pid); | |
414 | trace_seq_puts(s, "\n ------------------------------------------\n\n"); | |
287b6e68 FW |
415 | } |
416 | ||
b91facc3 FW |
417 | static struct ftrace_graph_ret_entry * |
418 | get_return_for_leaf(struct trace_iterator *iter, | |
83a8df61 FW |
419 | struct ftrace_graph_ent_entry *curr) |
420 | { | |
be1eca39 JO |
421 | struct fgraph_data *data = iter->private; |
422 | struct ring_buffer_iter *ring_iter = NULL; | |
83a8df61 FW |
423 | struct ring_buffer_event *event; |
424 | struct ftrace_graph_ret_entry *next; | |
425 | ||
be1eca39 JO |
426 | /* |
427 | * If the previous output failed to write to the seq buffer, | |
428 | * then we just reuse the data from before. | |
429 | */ | |
430 | if (data && data->failed) { | |
431 | curr = &data->ent; | |
432 | next = &data->ret; | |
433 | } else { | |
83a8df61 | 434 | |
6d158a81 | 435 | ring_iter = trace_buffer_iter(iter, iter->cpu); |
be1eca39 JO |
436 | |
437 | /* First peek to compare current entry and the next one */ | |
438 | if (ring_iter) | |
439 | event = ring_buffer_iter_peek(ring_iter, NULL); | |
440 | else { | |
441 | /* | |
442 | * We need to consume the current entry to see | |
443 | * the next one. | |
444 | */ | |
1c5eb448 | 445 | ring_buffer_consume(iter->array_buffer->buffer, iter->cpu, |
66a8cb95 | 446 | NULL, NULL); |
1c5eb448 | 447 | event = ring_buffer_peek(iter->array_buffer->buffer, iter->cpu, |
66a8cb95 | 448 | NULL, NULL); |
be1eca39 | 449 | } |
83a8df61 | 450 | |
be1eca39 JO |
451 | if (!event) |
452 | return NULL; | |
453 | ||
454 | next = ring_buffer_event_data(event); | |
83a8df61 | 455 | |
be1eca39 JO |
456 | if (data) { |
457 | /* | |
458 | * Save current and next entries for later reference | |
459 | * if the output fails. | |
460 | */ | |
461 | data->ent = *curr; | |
575570f0 SL |
462 | /* |
463 | * If the next event is not a return type, then | |
464 | * we only care about what type it is. Otherwise we can | |
465 | * safely copy the entire event. | |
466 | */ | |
467 | if (next->ent.type == TRACE_GRAPH_RET) | |
468 | data->ret = *next; | |
469 | else | |
470 | data->ret.ent.type = next->ent.type; | |
be1eca39 JO |
471 | } |
472 | } | |
83a8df61 FW |
473 | |
474 | if (next->ent.type != TRACE_GRAPH_RET) | |
b91facc3 | 475 | return NULL; |
83a8df61 FW |
476 | |
477 | if (curr->ent.pid != next->ent.pid || | |
478 | curr->graph_ent.func != next->ret.func) | |
b91facc3 | 479 | return NULL; |
83a8df61 | 480 | |
b91facc3 FW |
481 | /* this is a leaf, now advance the iterator */ |
482 | if (ring_iter) | |
bc1a72af | 483 | ring_buffer_iter_advance(ring_iter); |
b91facc3 FW |
484 | |
485 | return next; | |
83a8df61 FW |
486 | } |
487 | ||
9d9add34 | 488 | static void print_graph_abs_time(u64 t, struct trace_seq *s) |
d1f9cbd7 FW |
489 | { |
490 | unsigned long usecs_rem; | |
491 | ||
492 | usecs_rem = do_div(t, NSEC_PER_SEC); | |
493 | usecs_rem /= 1000; | |
494 | ||
9d9add34 SRRH |
495 | trace_seq_printf(s, "%5lu.%06lu | ", |
496 | (unsigned long)t, usecs_rem); | |
d1f9cbd7 FW |
497 | } |
498 | ||
9acd8de6 CD |
499 | static void |
500 | print_graph_rel_time(struct trace_iterator *iter, struct trace_seq *s) | |
501 | { | |
502 | unsigned long long usecs; | |
503 | ||
1c5eb448 | 504 | usecs = iter->ts - iter->array_buffer->time_start; |
9acd8de6 CD |
505 | do_div(usecs, NSEC_PER_USEC); |
506 | ||
507 | trace_seq_printf(s, "%9llu us | ", usecs); | |
508 | } | |
509 | ||
9d9add34 | 510 | static void |
d1f9cbd7 | 511 | print_graph_irq(struct trace_iterator *iter, unsigned long addr, |
d7a8d9e9 | 512 | enum trace_type type, int cpu, pid_t pid, u32 flags) |
f8b755ac | 513 | { |
983f938a | 514 | struct trace_array *tr = iter->tr; |
d1f9cbd7 | 515 | struct trace_seq *s = &iter->seq; |
678f845e | 516 | struct trace_entry *ent = iter->ent; |
f8b755ac FW |
517 | |
518 | if (addr < (unsigned long)__irqentry_text_start || | |
519 | addr >= (unsigned long)__irqentry_text_end) | |
9d9add34 | 520 | return; |
f8b755ac | 521 | |
983f938a | 522 | if (tr->trace_flags & TRACE_ITER_CONTEXT_INFO) { |
749230b0 | 523 | /* Absolute time */ |
9d9add34 SRRH |
524 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
525 | print_graph_abs_time(iter->ts, s); | |
d1f9cbd7 | 526 | |
9acd8de6 CD |
527 | /* Relative time */ |
528 | if (flags & TRACE_GRAPH_PRINT_REL_TIME) | |
529 | print_graph_rel_time(iter, s); | |
530 | ||
749230b0 | 531 | /* Cpu */ |
9d9add34 SRRH |
532 | if (flags & TRACE_GRAPH_PRINT_CPU) |
533 | print_graph_cpu(s, cpu); | |
49ff5903 | 534 | |
749230b0 JO |
535 | /* Proc */ |
536 | if (flags & TRACE_GRAPH_PRINT_PROC) { | |
9d9add34 SRRH |
537 | print_graph_proc(s, pid); |
538 | trace_seq_puts(s, " | "); | |
749230b0 | 539 | } |
678f845e DBO |
540 | |
541 | /* Latency format */ | |
983f938a | 542 | if (tr->trace_flags & TRACE_ITER_LATENCY_FMT) |
9d9add34 | 543 | print_graph_lat_fmt(s, ent); |
9005f3eb | 544 | } |
f8b755ac | 545 | |
9005f3eb | 546 | /* No overhead */ |
983f938a | 547 | print_graph_duration(tr, 0, s, flags | FLAGS_FILL_START); |
f8b755ac | 548 | |
9005f3eb | 549 | if (type == TRACE_GRAPH_ENT) |
9d9add34 | 550 | trace_seq_puts(s, "==========>"); |
9005f3eb | 551 | else |
9d9add34 | 552 | trace_seq_puts(s, "<=========="); |
9005f3eb | 553 | |
983f938a | 554 | print_graph_duration(tr, 0, s, flags | FLAGS_FILL_END); |
9d9add34 | 555 | trace_seq_putc(s, '\n'); |
f8b755ac | 556 | } |
83a8df61 | 557 | |
9d9add34 | 558 | void |
0706f1c4 | 559 | trace_print_graph_duration(unsigned long long duration, struct trace_seq *s) |
83a8df61 FW |
560 | { |
561 | unsigned long nsecs_rem = do_div(duration, 1000); | |
166d3c79 | 562 | /* log10(ULONG_MAX) + '\0' */ |
4526d067 | 563 | char usecs_str[21]; |
166d3c79 | 564 | char nsecs_str[5]; |
9d9add34 | 565 | int len; |
166d3c79 FW |
566 | int i; |
567 | ||
4526d067 | 568 | sprintf(usecs_str, "%lu", (unsigned long) duration); |
166d3c79 FW |
569 | |
570 | /* Print msecs */ | |
9d9add34 | 571 | trace_seq_printf(s, "%s", usecs_str); |
166d3c79 | 572 | |
4526d067 | 573 | len = strlen(usecs_str); |
166d3c79 FW |
574 | |
575 | /* Print nsecs (we don't want to exceed 7 numbers) */ | |
576 | if (len < 7) { | |
14cae9bd BP |
577 | size_t slen = min_t(size_t, sizeof(nsecs_str), 8UL - len); |
578 | ||
579 | snprintf(nsecs_str, slen, "%03lu", nsecs_rem); | |
9d9add34 | 580 | trace_seq_printf(s, ".%s", nsecs_str); |
82c355e8 | 581 | len += strlen(nsecs_str) + 1; |
166d3c79 FW |
582 | } |
583 | ||
9d9add34 | 584 | trace_seq_puts(s, " us "); |
166d3c79 FW |
585 | |
586 | /* Print remaining spaces to fit the row's width */ | |
82c355e8 | 587 | for (i = len; i < 8; i++) |
9d9add34 | 588 | trace_seq_putc(s, ' '); |
0706f1c4 SR |
589 | } |
590 | ||
9d9add34 | 591 | static void |
983f938a SRRH |
592 | print_graph_duration(struct trace_array *tr, unsigned long long duration, |
593 | struct trace_seq *s, u32 flags) | |
0706f1c4 | 594 | { |
749230b0 | 595 | if (!(flags & TRACE_GRAPH_PRINT_DURATION) || |
983f938a | 596 | !(tr->trace_flags & TRACE_ITER_CONTEXT_INFO)) |
9d9add34 | 597 | return; |
ffeb80fc JO |
598 | |
599 | /* No real adata, just filling the column with spaces */ | |
6fc84ea7 SRRH |
600 | switch (flags & TRACE_GRAPH_PRINT_FILL_MASK) { |
601 | case FLAGS_FILL_FULL: | |
9d9add34 SRRH |
602 | trace_seq_puts(s, " | "); |
603 | return; | |
6fc84ea7 | 604 | case FLAGS_FILL_START: |
9d9add34 SRRH |
605 | trace_seq_puts(s, " "); |
606 | return; | |
6fc84ea7 | 607 | case FLAGS_FILL_END: |
9d9add34 SRRH |
608 | trace_seq_puts(s, " |"); |
609 | return; | |
ffeb80fc JO |
610 | } |
611 | ||
612 | /* Signal a overhead of time execution to the output */ | |
8e1e1df2 BP |
613 | if (flags & TRACE_GRAPH_PRINT_OVERHEAD) |
614 | trace_seq_printf(s, "%c ", trace_find_mark(duration)); | |
615 | else | |
9d9add34 | 616 | trace_seq_puts(s, " "); |
0706f1c4 | 617 | |
9d9add34 SRRH |
618 | trace_print_graph_duration(duration, s); |
619 | trace_seq_puts(s, "| "); | |
83a8df61 FW |
620 | } |
621 | ||
83a8df61 | 622 | /* Case of a leaf function on its call entry */ |
287b6e68 | 623 | static enum print_line_t |
83a8df61 | 624 | print_graph_entry_leaf(struct trace_iterator *iter, |
b91facc3 | 625 | struct ftrace_graph_ent_entry *entry, |
d7a8d9e9 JO |
626 | struct ftrace_graph_ret_entry *ret_entry, |
627 | struct trace_seq *s, u32 flags) | |
fb52607a | 628 | { |
2fbcdb35 | 629 | struct fgraph_data *data = iter->private; |
983f938a | 630 | struct trace_array *tr = iter->tr; |
83a8df61 | 631 | struct ftrace_graph_ret *graph_ret; |
83a8df61 FW |
632 | struct ftrace_graph_ent *call; |
633 | unsigned long long duration; | |
1fe4293f | 634 | int cpu = iter->cpu; |
1a056155 | 635 | int i; |
fb52607a | 636 | |
83a8df61 FW |
637 | graph_ret = &ret_entry->ret; |
638 | call = &entry->graph_ent; | |
639 | duration = graph_ret->rettime - graph_ret->calltime; | |
640 | ||
2fbcdb35 | 641 | if (data) { |
f1c7f517 | 642 | struct fgraph_cpu_data *cpu_data; |
f1c7f517 SR |
643 | |
644 | cpu_data = per_cpu_ptr(data->cpu_data, cpu); | |
2fbcdb35 SR |
645 | |
646 | /* | |
647 | * Comments display at + 1 to depth. Since | |
648 | * this is a leaf function, keep the comments | |
649 | * equal to this depth. | |
650 | */ | |
f1c7f517 SR |
651 | cpu_data->depth = call->depth - 1; |
652 | ||
653 | /* No need to keep this function around for this depth */ | |
794de08a SRRH |
654 | if (call->depth < FTRACE_RETFUNC_DEPTH && |
655 | !WARN_ON_ONCE(call->depth < 0)) | |
f1c7f517 | 656 | cpu_data->enter_funcs[call->depth] = 0; |
2fbcdb35 SR |
657 | } |
658 | ||
ffeb80fc | 659 | /* Overhead and duration */ |
983f938a | 660 | print_graph_duration(tr, duration, s, flags); |
1a056155 | 661 | |
83a8df61 | 662 | /* Function */ |
9d9add34 SRRH |
663 | for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) |
664 | trace_seq_putc(s, ' '); | |
83a8df61 | 665 | |
9d9add34 | 666 | trace_seq_printf(s, "%ps();\n", (void *)call->func); |
83a8df61 | 667 | |
1fe4293f CD |
668 | print_graph_irq(iter, graph_ret->func, TRACE_GRAPH_RET, |
669 | cpu, iter->ent->pid, flags); | |
670 | ||
9d9add34 | 671 | return trace_handle_return(s); |
83a8df61 FW |
672 | } |
673 | ||
674 | static enum print_line_t | |
2fbcdb35 SR |
675 | print_graph_entry_nested(struct trace_iterator *iter, |
676 | struct ftrace_graph_ent_entry *entry, | |
d7a8d9e9 | 677 | struct trace_seq *s, int cpu, u32 flags) |
83a8df61 | 678 | { |
83a8df61 | 679 | struct ftrace_graph_ent *call = &entry->graph_ent; |
2fbcdb35 | 680 | struct fgraph_data *data = iter->private; |
983f938a | 681 | struct trace_array *tr = iter->tr; |
2fbcdb35 SR |
682 | int i; |
683 | ||
684 | if (data) { | |
f1c7f517 | 685 | struct fgraph_cpu_data *cpu_data; |
2fbcdb35 | 686 | int cpu = iter->cpu; |
2fbcdb35 | 687 | |
f1c7f517 SR |
688 | cpu_data = per_cpu_ptr(data->cpu_data, cpu); |
689 | cpu_data->depth = call->depth; | |
690 | ||
691 | /* Save this function pointer to see if the exit matches */ | |
794de08a SRRH |
692 | if (call->depth < FTRACE_RETFUNC_DEPTH && |
693 | !WARN_ON_ONCE(call->depth < 0)) | |
f1c7f517 | 694 | cpu_data->enter_funcs[call->depth] = call->func; |
2fbcdb35 | 695 | } |
83a8df61 | 696 | |
9005f3eb | 697 | /* No time */ |
983f938a | 698 | print_graph_duration(tr, 0, s, flags | FLAGS_FILL_FULL); |
f8b755ac | 699 | |
83a8df61 | 700 | /* Function */ |
9d9add34 SRRH |
701 | for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) |
702 | trace_seq_putc(s, ' '); | |
703 | ||
704 | trace_seq_printf(s, "%ps() {\n", (void *)call->func); | |
287b6e68 | 705 | |
9d9add34 | 706 | if (trace_seq_has_overflowed(s)) |
83a8df61 FW |
707 | return TRACE_TYPE_PARTIAL_LINE; |
708 | ||
b91facc3 FW |
709 | /* |
710 | * we already consumed the current entry to check the next one | |
711 | * and see if this is a leaf. | |
712 | */ | |
713 | return TRACE_TYPE_NO_CONSUME; | |
287b6e68 FW |
714 | } |
715 | ||
9d9add34 | 716 | static void |
ac5f6c96 | 717 | print_graph_prologue(struct trace_iterator *iter, struct trace_seq *s, |
d7a8d9e9 | 718 | int type, unsigned long addr, u32 flags) |
83a8df61 | 719 | { |
2fbcdb35 | 720 | struct fgraph_data *data = iter->private; |
83a8df61 | 721 | struct trace_entry *ent = iter->ent; |
983f938a | 722 | struct trace_array *tr = iter->tr; |
ac5f6c96 | 723 | int cpu = iter->cpu; |
83a8df61 | 724 | |
1a056155 | 725 | /* Pid */ |
9d9add34 | 726 | verif_pid(s, ent->pid, cpu, data); |
9005f3eb | 727 | |
9d9add34 | 728 | if (type) |
ac5f6c96 | 729 | /* Interrupt */ |
9d9add34 | 730 | print_graph_irq(iter, addr, type, cpu, ent->pid, flags); |
83a8df61 | 731 | |
983f938a | 732 | if (!(tr->trace_flags & TRACE_ITER_CONTEXT_INFO)) |
9d9add34 | 733 | return; |
749230b0 | 734 | |
9005f3eb | 735 | /* Absolute time */ |
9d9add34 SRRH |
736 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
737 | print_graph_abs_time(iter->ts, s); | |
9005f3eb | 738 | |
9acd8de6 CD |
739 | /* Relative time */ |
740 | if (flags & TRACE_GRAPH_PRINT_REL_TIME) | |
741 | print_graph_rel_time(iter, s); | |
742 | ||
1a056155 | 743 | /* Cpu */ |
9d9add34 SRRH |
744 | if (flags & TRACE_GRAPH_PRINT_CPU) |
745 | print_graph_cpu(s, cpu); | |
11e84acc FW |
746 | |
747 | /* Proc */ | |
d7a8d9e9 | 748 | if (flags & TRACE_GRAPH_PRINT_PROC) { |
9d9add34 SRRH |
749 | print_graph_proc(s, ent->pid); |
750 | trace_seq_puts(s, " | "); | |
1a056155 | 751 | } |
83a8df61 | 752 | |
49ff5903 | 753 | /* Latency format */ |
983f938a | 754 | if (tr->trace_flags & TRACE_ITER_LATENCY_FMT) |
9d9add34 | 755 | print_graph_lat_fmt(s, ent); |
49ff5903 | 756 | |
9d9add34 | 757 | return; |
ac5f6c96 SR |
758 | } |
759 | ||
2bd16212 JO |
760 | /* |
761 | * Entry check for irq code | |
762 | * | |
763 | * returns 1 if | |
764 | * - we are inside irq code | |
25985edc | 765 | * - we just entered irq code |
2bd16212 | 766 | * |
f2cc020d | 767 | * returns 0 if |
2bd16212 JO |
768 | * - funcgraph-interrupts option is set |
769 | * - we are not inside irq code | |
770 | */ | |
771 | static int | |
772 | check_irq_entry(struct trace_iterator *iter, u32 flags, | |
773 | unsigned long addr, int depth) | |
774 | { | |
775 | int cpu = iter->cpu; | |
a9d61173 | 776 | int *depth_irq; |
2bd16212 | 777 | struct fgraph_data *data = iter->private; |
2bd16212 | 778 | |
a9d61173 JO |
779 | /* |
780 | * If we are either displaying irqs, or we got called as | |
781 | * a graph event and private data does not exist, | |
782 | * then we bypass the irq check. | |
783 | */ | |
784 | if ((flags & TRACE_GRAPH_PRINT_IRQS) || | |
785 | (!data)) | |
2bd16212 JO |
786 | return 0; |
787 | ||
a9d61173 JO |
788 | depth_irq = &(per_cpu_ptr(data->cpu_data, cpu)->depth_irq); |
789 | ||
2bd16212 JO |
790 | /* |
791 | * We are inside the irq code | |
792 | */ | |
793 | if (*depth_irq >= 0) | |
794 | return 1; | |
795 | ||
796 | if ((addr < (unsigned long)__irqentry_text_start) || | |
797 | (addr >= (unsigned long)__irqentry_text_end)) | |
798 | return 0; | |
799 | ||
800 | /* | |
801 | * We are entering irq code. | |
802 | */ | |
803 | *depth_irq = depth; | |
804 | return 1; | |
805 | } | |
806 | ||
807 | /* | |
808 | * Return check for irq code | |
809 | * | |
810 | * returns 1 if | |
811 | * - we are inside irq code | |
812 | * - we just left irq code | |
813 | * | |
814 | * returns 0 if | |
815 | * - funcgraph-interrupts option is set | |
816 | * - we are not inside irq code | |
817 | */ | |
818 | static int | |
819 | check_irq_return(struct trace_iterator *iter, u32 flags, int depth) | |
820 | { | |
821 | int cpu = iter->cpu; | |
a9d61173 | 822 | int *depth_irq; |
2bd16212 | 823 | struct fgraph_data *data = iter->private; |
2bd16212 | 824 | |
a9d61173 JO |
825 | /* |
826 | * If we are either displaying irqs, or we got called as | |
827 | * a graph event and private data does not exist, | |
828 | * then we bypass the irq check. | |
829 | */ | |
830 | if ((flags & TRACE_GRAPH_PRINT_IRQS) || | |
831 | (!data)) | |
2bd16212 JO |
832 | return 0; |
833 | ||
a9d61173 JO |
834 | depth_irq = &(per_cpu_ptr(data->cpu_data, cpu)->depth_irq); |
835 | ||
2bd16212 JO |
836 | /* |
837 | * We are not inside the irq code. | |
838 | */ | |
839 | if (*depth_irq == -1) | |
840 | return 0; | |
841 | ||
842 | /* | |
843 | * We are inside the irq code, and this is returning entry. | |
844 | * Let's not trace it and clear the entry depth, since | |
845 | * we are out of irq code. | |
846 | * | |
847 | * This condition ensures that we 'leave the irq code' once | |
848 | * we are out of the entry depth. Thus protecting us from | |
849 | * the RETURN entry loss. | |
850 | */ | |
851 | if (*depth_irq >= depth) { | |
852 | *depth_irq = -1; | |
853 | return 1; | |
854 | } | |
855 | ||
856 | /* | |
857 | * We are inside the irq code, and this is not the entry. | |
858 | */ | |
859 | return 1; | |
860 | } | |
861 | ||
ac5f6c96 SR |
862 | static enum print_line_t |
863 | print_graph_entry(struct ftrace_graph_ent_entry *field, struct trace_seq *s, | |
d7a8d9e9 | 864 | struct trace_iterator *iter, u32 flags) |
ac5f6c96 | 865 | { |
be1eca39 | 866 | struct fgraph_data *data = iter->private; |
ac5f6c96 SR |
867 | struct ftrace_graph_ent *call = &field->graph_ent; |
868 | struct ftrace_graph_ret_entry *leaf_ret; | |
be1eca39 JO |
869 | static enum print_line_t ret; |
870 | int cpu = iter->cpu; | |
ac5f6c96 | 871 | |
2bd16212 JO |
872 | if (check_irq_entry(iter, flags, call->func, call->depth)) |
873 | return TRACE_TYPE_HANDLED; | |
874 | ||
9d9add34 | 875 | print_graph_prologue(iter, s, TRACE_GRAPH_ENT, call->func, flags); |
ac5f6c96 | 876 | |
b91facc3 FW |
877 | leaf_ret = get_return_for_leaf(iter, field); |
878 | if (leaf_ret) | |
d7a8d9e9 | 879 | ret = print_graph_entry_leaf(iter, field, leaf_ret, s, flags); |
83a8df61 | 880 | else |
d7a8d9e9 | 881 | ret = print_graph_entry_nested(iter, field, s, cpu, flags); |
83a8df61 | 882 | |
be1eca39 JO |
883 | if (data) { |
884 | /* | |
885 | * If we failed to write our output, then we need to make | |
886 | * note of it. Because we already consumed our entry. | |
887 | */ | |
888 | if (s->full) { | |
889 | data->failed = 1; | |
890 | data->cpu = cpu; | |
891 | } else | |
892 | data->failed = 0; | |
893 | } | |
894 | ||
895 | return ret; | |
83a8df61 FW |
896 | } |
897 | ||
287b6e68 FW |
898 | static enum print_line_t |
899 | print_graph_return(struct ftrace_graph_ret *trace, struct trace_seq *s, | |
d7a8d9e9 JO |
900 | struct trace_entry *ent, struct trace_iterator *iter, |
901 | u32 flags) | |
287b6e68 | 902 | { |
83a8df61 | 903 | unsigned long long duration = trace->rettime - trace->calltime; |
2fbcdb35 | 904 | struct fgraph_data *data = iter->private; |
983f938a | 905 | struct trace_array *tr = iter->tr; |
2fbcdb35 SR |
906 | pid_t pid = ent->pid; |
907 | int cpu = iter->cpu; | |
f1c7f517 | 908 | int func_match = 1; |
2fbcdb35 SR |
909 | int i; |
910 | ||
2bd16212 JO |
911 | if (check_irq_return(iter, flags, trace->depth)) |
912 | return TRACE_TYPE_HANDLED; | |
913 | ||
2fbcdb35 | 914 | if (data) { |
f1c7f517 SR |
915 | struct fgraph_cpu_data *cpu_data; |
916 | int cpu = iter->cpu; | |
917 | ||
918 | cpu_data = per_cpu_ptr(data->cpu_data, cpu); | |
2fbcdb35 SR |
919 | |
920 | /* | |
921 | * Comments display at + 1 to depth. This is the | |
922 | * return from a function, we now want the comments | |
923 | * to display at the same level of the bracket. | |
924 | */ | |
f1c7f517 SR |
925 | cpu_data->depth = trace->depth - 1; |
926 | ||
794de08a SRRH |
927 | if (trace->depth < FTRACE_RETFUNC_DEPTH && |
928 | !WARN_ON_ONCE(trace->depth < 0)) { | |
f1c7f517 SR |
929 | if (cpu_data->enter_funcs[trace->depth] != trace->func) |
930 | func_match = 0; | |
931 | cpu_data->enter_funcs[trace->depth] = 0; | |
932 | } | |
2fbcdb35 | 933 | } |
287b6e68 | 934 | |
9d9add34 | 935 | print_graph_prologue(iter, s, 0, 0, flags); |
437f24fb | 936 | |
ffeb80fc | 937 | /* Overhead and duration */ |
983f938a | 938 | print_graph_duration(tr, duration, s, flags); |
1a056155 | 939 | |
83a8df61 | 940 | /* Closing brace */ |
9d9add34 SRRH |
941 | for (i = 0; i < trace->depth * TRACE_GRAPH_INDENT; i++) |
942 | trace_seq_putc(s, ' '); | |
287b6e68 | 943 | |
f1c7f517 SR |
944 | /* |
945 | * If the return function does not have a matching entry, | |
946 | * then the entry was lost. Instead of just printing | |
947 | * the '}' and letting the user guess what function this | |
607e3a29 RE |
948 | * belongs to, write out the function name. Always do |
949 | * that if the funcgraph-tail option is enabled. | |
f1c7f517 | 950 | */ |
9d9add34 SRRH |
951 | if (func_match && !(flags & TRACE_GRAPH_PRINT_TAIL)) |
952 | trace_seq_puts(s, "}\n"); | |
953 | else | |
954 | trace_seq_printf(s, "} /* %ps */\n", (void *)trace->func); | |
fb52607a | 955 | |
83a8df61 | 956 | /* Overrun */ |
9d9add34 | 957 | if (flags & TRACE_GRAPH_PRINT_OVERRUN) |
60602cb5 | 958 | trace_seq_printf(s, " (Overruns: %u)\n", |
9d9add34 | 959 | trace->overrun); |
f8b755ac | 960 | |
9d9add34 SRRH |
961 | print_graph_irq(iter, trace->func, TRACE_GRAPH_RET, |
962 | cpu, pid, flags); | |
f8b755ac | 963 | |
9d9add34 | 964 | return trace_handle_return(s); |
287b6e68 FW |
965 | } |
966 | ||
1fd8f2a3 | 967 | static enum print_line_t |
d7a8d9e9 JO |
968 | print_graph_comment(struct trace_seq *s, struct trace_entry *ent, |
969 | struct trace_iterator *iter, u32 flags) | |
1fd8f2a3 | 970 | { |
983f938a SRRH |
971 | struct trace_array *tr = iter->tr; |
972 | unsigned long sym_flags = (tr->trace_flags & TRACE_ITER_SYM_MASK); | |
2fbcdb35 | 973 | struct fgraph_data *data = iter->private; |
5087f8d2 | 974 | struct trace_event *event; |
2fbcdb35 | 975 | int depth = 0; |
1fd8f2a3 | 976 | int ret; |
2fbcdb35 SR |
977 | int i; |
978 | ||
979 | if (data) | |
be1eca39 | 980 | depth = per_cpu_ptr(data->cpu_data, iter->cpu)->depth; |
9005f3eb | 981 | |
9d9add34 | 982 | print_graph_prologue(iter, s, 0, 0, flags); |
d1f9cbd7 | 983 | |
9005f3eb | 984 | /* No time */ |
983f938a | 985 | print_graph_duration(tr, 0, s, flags | FLAGS_FILL_FULL); |
1fd8f2a3 | 986 | |
1fd8f2a3 | 987 | /* Indentation */ |
2fbcdb35 | 988 | if (depth > 0) |
9d9add34 SRRH |
989 | for (i = 0; i < (depth + 1) * TRACE_GRAPH_INDENT; i++) |
990 | trace_seq_putc(s, ' '); | |
1fd8f2a3 FW |
991 | |
992 | /* The comment */ | |
9d9add34 | 993 | trace_seq_puts(s, "/* "); |
769b0441 | 994 | |
5087f8d2 | 995 | switch (iter->ent->type) { |
613dccdf NK |
996 | case TRACE_BPUTS: |
997 | ret = trace_print_bputs_msg_only(iter); | |
998 | if (ret != TRACE_TYPE_HANDLED) | |
999 | return ret; | |
1000 | break; | |
5087f8d2 SR |
1001 | case TRACE_BPRINT: |
1002 | ret = trace_print_bprintk_msg_only(iter); | |
1003 | if (ret != TRACE_TYPE_HANDLED) | |
1004 | return ret; | |
1005 | break; | |
1006 | case TRACE_PRINT: | |
1007 | ret = trace_print_printk_msg_only(iter); | |
1008 | if (ret != TRACE_TYPE_HANDLED) | |
1009 | return ret; | |
1010 | break; | |
1011 | default: | |
1012 | event = ftrace_find_event(ent->type); | |
1013 | if (!event) | |
1014 | return TRACE_TYPE_UNHANDLED; | |
1015 | ||
a9a57763 | 1016 | ret = event->funcs->trace(iter, sym_flags, event); |
5087f8d2 SR |
1017 | if (ret != TRACE_TYPE_HANDLED) |
1018 | return ret; | |
1019 | } | |
1fd8f2a3 | 1020 | |
5ac48378 SRRH |
1021 | if (trace_seq_has_overflowed(s)) |
1022 | goto out; | |
1023 | ||
412d0bb5 | 1024 | /* Strip ending newline */ |
3a161d99 SRRH |
1025 | if (s->buffer[s->seq.len - 1] == '\n') { |
1026 | s->buffer[s->seq.len - 1] = '\0'; | |
1027 | s->seq.len--; | |
412d0bb5 FW |
1028 | } |
1029 | ||
9d9add34 | 1030 | trace_seq_puts(s, " */\n"); |
5ac48378 | 1031 | out: |
9d9add34 | 1032 | return trace_handle_return(s); |
1fd8f2a3 FW |
1033 | } |
1034 | ||
1035 | ||
287b6e68 | 1036 | enum print_line_t |
321e68b0 | 1037 | print_graph_function_flags(struct trace_iterator *iter, u32 flags) |
287b6e68 | 1038 | { |
be1eca39 JO |
1039 | struct ftrace_graph_ent_entry *field; |
1040 | struct fgraph_data *data = iter->private; | |
287b6e68 | 1041 | struct trace_entry *entry = iter->ent; |
5087f8d2 | 1042 | struct trace_seq *s = &iter->seq; |
be1eca39 JO |
1043 | int cpu = iter->cpu; |
1044 | int ret; | |
1045 | ||
1046 | if (data && per_cpu_ptr(data->cpu_data, cpu)->ignore) { | |
1047 | per_cpu_ptr(data->cpu_data, cpu)->ignore = 0; | |
1048 | return TRACE_TYPE_HANDLED; | |
1049 | } | |
1050 | ||
1051 | /* | |
1052 | * If the last output failed, there's a possibility we need | |
1053 | * to print out the missing entry which would never go out. | |
1054 | */ | |
1055 | if (data && data->failed) { | |
1056 | field = &data->ent; | |
1057 | iter->cpu = data->cpu; | |
d7a8d9e9 | 1058 | ret = print_graph_entry(field, s, iter, flags); |
be1eca39 JO |
1059 | if (ret == TRACE_TYPE_HANDLED && iter->cpu != cpu) { |
1060 | per_cpu_ptr(data->cpu_data, iter->cpu)->ignore = 1; | |
1061 | ret = TRACE_TYPE_NO_CONSUME; | |
1062 | } | |
1063 | iter->cpu = cpu; | |
1064 | return ret; | |
1065 | } | |
fb52607a | 1066 | |
287b6e68 FW |
1067 | switch (entry->type) { |
1068 | case TRACE_GRAPH_ENT: { | |
38ceb592 LJ |
1069 | /* |
1070 | * print_graph_entry() may consume the current event, | |
1071 | * thus @field may become invalid, so we need to save it. | |
1072 | * sizeof(struct ftrace_graph_ent_entry) is very small, | |
1073 | * it can be safely saved at the stack. | |
1074 | */ | |
be1eca39 | 1075 | struct ftrace_graph_ent_entry saved; |
287b6e68 | 1076 | trace_assign_type(field, entry); |
38ceb592 | 1077 | saved = *field; |
d7a8d9e9 | 1078 | return print_graph_entry(&saved, s, iter, flags); |
287b6e68 FW |
1079 | } |
1080 | case TRACE_GRAPH_RET: { | |
1081 | struct ftrace_graph_ret_entry *field; | |
1082 | trace_assign_type(field, entry); | |
d7a8d9e9 | 1083 | return print_graph_return(&field->ret, s, entry, iter, flags); |
287b6e68 | 1084 | } |
62b915f1 JO |
1085 | case TRACE_STACK: |
1086 | case TRACE_FN: | |
1087 | /* dont trace stack and functions as comments */ | |
1088 | return TRACE_TYPE_UNHANDLED; | |
1089 | ||
287b6e68 | 1090 | default: |
d7a8d9e9 | 1091 | return print_graph_comment(s, entry, iter, flags); |
fb52607a | 1092 | } |
5087f8d2 SR |
1093 | |
1094 | return TRACE_TYPE_HANDLED; | |
fb52607a FW |
1095 | } |
1096 | ||
d7a8d9e9 JO |
1097 | static enum print_line_t |
1098 | print_graph_function(struct trace_iterator *iter) | |
1099 | { | |
321e68b0 | 1100 | return print_graph_function_flags(iter, tracer_flags.val); |
d7a8d9e9 JO |
1101 | } |
1102 | ||
9106b693 | 1103 | static enum print_line_t |
a9a57763 SR |
1104 | print_graph_function_event(struct trace_iterator *iter, int flags, |
1105 | struct trace_event *event) | |
9106b693 JO |
1106 | { |
1107 | return print_graph_function(iter); | |
1108 | } | |
1109 | ||
d7a8d9e9 | 1110 | static void print_lat_header(struct seq_file *s, u32 flags) |
49ff5903 SR |
1111 | { |
1112 | static const char spaces[] = " " /* 16 spaces */ | |
1113 | " " /* 4 spaces */ | |
1114 | " "; /* 17 spaces */ | |
1115 | int size = 0; | |
1116 | ||
d7a8d9e9 | 1117 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
49ff5903 | 1118 | size += 16; |
9acd8de6 CD |
1119 | if (flags & TRACE_GRAPH_PRINT_REL_TIME) |
1120 | size += 16; | |
d7a8d9e9 | 1121 | if (flags & TRACE_GRAPH_PRINT_CPU) |
49ff5903 | 1122 | size += 4; |
d7a8d9e9 | 1123 | if (flags & TRACE_GRAPH_PRINT_PROC) |
49ff5903 SR |
1124 | size += 17; |
1125 | ||
1126 | seq_printf(s, "#%.*s _-----=> irqs-off \n", size, spaces); | |
1127 | seq_printf(s, "#%.*s / _----=> need-resched \n", size, spaces); | |
1128 | seq_printf(s, "#%.*s| / _---=> hardirq/softirq \n", size, spaces); | |
1129 | seq_printf(s, "#%.*s|| / _--=> preempt-depth \n", size, spaces); | |
199abfab | 1130 | seq_printf(s, "#%.*s||| / \n", size, spaces); |
49ff5903 SR |
1131 | } |
1132 | ||
983f938a SRRH |
1133 | static void __print_graph_headers_flags(struct trace_array *tr, |
1134 | struct seq_file *s, u32 flags) | |
decbec38 | 1135 | { |
983f938a | 1136 | int lat = tr->trace_flags & TRACE_ITER_LATENCY_FMT; |
49ff5903 SR |
1137 | |
1138 | if (lat) | |
d7a8d9e9 | 1139 | print_lat_header(s, flags); |
49ff5903 | 1140 | |
decbec38 | 1141 | /* 1st line */ |
1177e436 | 1142 | seq_putc(s, '#'); |
d7a8d9e9 | 1143 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
fa6f0cc7 | 1144 | seq_puts(s, " TIME "); |
9acd8de6 CD |
1145 | if (flags & TRACE_GRAPH_PRINT_REL_TIME) |
1146 | seq_puts(s, " REL TIME "); | |
d7a8d9e9 | 1147 | if (flags & TRACE_GRAPH_PRINT_CPU) |
fa6f0cc7 | 1148 | seq_puts(s, " CPU"); |
d7a8d9e9 | 1149 | if (flags & TRACE_GRAPH_PRINT_PROC) |
fa6f0cc7 | 1150 | seq_puts(s, " TASK/PID "); |
49ff5903 | 1151 | if (lat) |
afbab501 | 1152 | seq_puts(s, "|||| "); |
d7a8d9e9 | 1153 | if (flags & TRACE_GRAPH_PRINT_DURATION) |
fa6f0cc7 RV |
1154 | seq_puts(s, " DURATION "); |
1155 | seq_puts(s, " FUNCTION CALLS\n"); | |
decbec38 FW |
1156 | |
1157 | /* 2nd line */ | |
1177e436 | 1158 | seq_putc(s, '#'); |
d7a8d9e9 | 1159 | if (flags & TRACE_GRAPH_PRINT_ABS_TIME) |
fa6f0cc7 | 1160 | seq_puts(s, " | "); |
9acd8de6 CD |
1161 | if (flags & TRACE_GRAPH_PRINT_REL_TIME) |
1162 | seq_puts(s, " | "); | |
d7a8d9e9 | 1163 | if (flags & TRACE_GRAPH_PRINT_CPU) |
fa6f0cc7 | 1164 | seq_puts(s, " | "); |
d7a8d9e9 | 1165 | if (flags & TRACE_GRAPH_PRINT_PROC) |
fa6f0cc7 | 1166 | seq_puts(s, " | | "); |
49ff5903 | 1167 | if (lat) |
afbab501 | 1168 | seq_puts(s, "|||| "); |
d7a8d9e9 | 1169 | if (flags & TRACE_GRAPH_PRINT_DURATION) |
fa6f0cc7 RV |
1170 | seq_puts(s, " | | "); |
1171 | seq_puts(s, " | | | |\n"); | |
decbec38 | 1172 | } |
9005f3eb | 1173 | |
ba1afef6 | 1174 | static void print_graph_headers(struct seq_file *s) |
d7a8d9e9 JO |
1175 | { |
1176 | print_graph_headers_flags(s, tracer_flags.val); | |
1177 | } | |
1178 | ||
0a772620 JO |
1179 | void print_graph_headers_flags(struct seq_file *s, u32 flags) |
1180 | { | |
1181 | struct trace_iterator *iter = s->private; | |
983f938a | 1182 | struct trace_array *tr = iter->tr; |
0a772620 | 1183 | |
983f938a | 1184 | if (!(tr->trace_flags & TRACE_ITER_CONTEXT_INFO)) |
749230b0 JO |
1185 | return; |
1186 | ||
983f938a | 1187 | if (tr->trace_flags & TRACE_ITER_LATENCY_FMT) { |
0a772620 JO |
1188 | /* print nothing if the buffers are empty */ |
1189 | if (trace_empty(iter)) | |
1190 | return; | |
1191 | ||
1192 | print_trace_header(s, iter); | |
321e68b0 | 1193 | } |
0a772620 | 1194 | |
983f938a | 1195 | __print_graph_headers_flags(tr, s, flags); |
0a772620 JO |
1196 | } |
1197 | ||
62b915f1 | 1198 | void graph_trace_open(struct trace_iterator *iter) |
9005f3eb | 1199 | { |
2fbcdb35 | 1200 | /* pid and depth on the last trace processed */ |
be1eca39 | 1201 | struct fgraph_data *data; |
ef99b88b | 1202 | gfp_t gfpflags; |
9005f3eb FW |
1203 | int cpu; |
1204 | ||
be1eca39 JO |
1205 | iter->private = NULL; |
1206 | ||
ef99b88b RV |
1207 | /* We can be called in atomic context via ftrace_dump() */ |
1208 | gfpflags = (in_atomic() || irqs_disabled()) ? GFP_ATOMIC : GFP_KERNEL; | |
1209 | ||
1210 | data = kzalloc(sizeof(*data), gfpflags); | |
2fbcdb35 | 1211 | if (!data) |
be1eca39 JO |
1212 | goto out_err; |
1213 | ||
ef99b88b | 1214 | data->cpu_data = alloc_percpu_gfp(struct fgraph_cpu_data, gfpflags); |
be1eca39 JO |
1215 | if (!data->cpu_data) |
1216 | goto out_err_free; | |
1217 | ||
1218 | for_each_possible_cpu(cpu) { | |
1219 | pid_t *pid = &(per_cpu_ptr(data->cpu_data, cpu)->last_pid); | |
1220 | int *depth = &(per_cpu_ptr(data->cpu_data, cpu)->depth); | |
1221 | int *ignore = &(per_cpu_ptr(data->cpu_data, cpu)->ignore); | |
2bd16212 JO |
1222 | int *depth_irq = &(per_cpu_ptr(data->cpu_data, cpu)->depth_irq); |
1223 | ||
be1eca39 JO |
1224 | *pid = -1; |
1225 | *depth = 0; | |
1226 | *ignore = 0; | |
2bd16212 | 1227 | *depth_irq = -1; |
be1eca39 | 1228 | } |
9005f3eb | 1229 | |
2fbcdb35 | 1230 | iter->private = data; |
be1eca39 JO |
1231 | |
1232 | return; | |
1233 | ||
1234 | out_err_free: | |
1235 | kfree(data); | |
1236 | out_err: | |
a395d6a7 | 1237 | pr_warn("function graph tracer: not enough memory\n"); |
9005f3eb FW |
1238 | } |
1239 | ||
62b915f1 | 1240 | void graph_trace_close(struct trace_iterator *iter) |
9005f3eb | 1241 | { |
be1eca39 JO |
1242 | struct fgraph_data *data = iter->private; |
1243 | ||
1244 | if (data) { | |
1245 | free_percpu(data->cpu_data); | |
1246 | kfree(data); | |
1247 | } | |
9005f3eb FW |
1248 | } |
1249 | ||
8c1a49ae SRRH |
1250 | static int |
1251 | func_graph_set_flag(struct trace_array *tr, u32 old_flags, u32 bit, int set) | |
b304d044 SR |
1252 | { |
1253 | if (bit == TRACE_GRAPH_PRINT_IRQS) | |
1254 | ftrace_graph_skip_irqs = !set; | |
1255 | ||
55577204 SRRH |
1256 | if (bit == TRACE_GRAPH_SLEEP_TIME) |
1257 | ftrace_graph_sleep_time_control(set); | |
1258 | ||
1259 | if (bit == TRACE_GRAPH_GRAPH_TIME) | |
1260 | ftrace_graph_graph_time_control(set); | |
1261 | ||
b304d044 SR |
1262 | return 0; |
1263 | } | |
1264 | ||
a9a57763 SR |
1265 | static struct trace_event_functions graph_functions = { |
1266 | .trace = print_graph_function_event, | |
1267 | }; | |
1268 | ||
9106b693 JO |
1269 | static struct trace_event graph_trace_entry_event = { |
1270 | .type = TRACE_GRAPH_ENT, | |
a9a57763 | 1271 | .funcs = &graph_functions, |
9106b693 JO |
1272 | }; |
1273 | ||
1274 | static struct trace_event graph_trace_ret_event = { | |
1275 | .type = TRACE_GRAPH_RET, | |
a9a57763 | 1276 | .funcs = &graph_functions |
9106b693 JO |
1277 | }; |
1278 | ||
8f768993 | 1279 | static struct tracer graph_trace __tracer_data = { |
ef18012b | 1280 | .name = "function_graph", |
6508fa76 | 1281 | .update_thresh = graph_trace_update_thresh, |
9005f3eb | 1282 | .open = graph_trace_open, |
be1eca39 | 1283 | .pipe_open = graph_trace_open, |
9005f3eb | 1284 | .close = graph_trace_close, |
be1eca39 | 1285 | .pipe_close = graph_trace_close, |
ef18012b SR |
1286 | .init = graph_trace_init, |
1287 | .reset = graph_trace_reset, | |
decbec38 FW |
1288 | .print_line = print_graph_function, |
1289 | .print_header = print_graph_headers, | |
fb52607a | 1290 | .flags = &tracer_flags, |
b304d044 | 1291 | .set_flag = func_graph_set_flag, |
7447dce9 FW |
1292 | #ifdef CONFIG_FTRACE_SELFTEST |
1293 | .selftest = trace_selftest_startup_function_graph, | |
1294 | #endif | |
fb52607a FW |
1295 | }; |
1296 | ||
8741db53 SR |
1297 | |
1298 | static ssize_t | |
1299 | graph_depth_write(struct file *filp, const char __user *ubuf, size_t cnt, | |
1300 | loff_t *ppos) | |
1301 | { | |
1302 | unsigned long val; | |
1303 | int ret; | |
1304 | ||
1305 | ret = kstrtoul_from_user(ubuf, cnt, 10, &val); | |
1306 | if (ret) | |
1307 | return ret; | |
1308 | ||
1a414428 | 1309 | fgraph_max_depth = val; |
8741db53 SR |
1310 | |
1311 | *ppos += cnt; | |
1312 | ||
1313 | return cnt; | |
1314 | } | |
1315 | ||
1316 | static ssize_t | |
1317 | graph_depth_read(struct file *filp, char __user *ubuf, size_t cnt, | |
1318 | loff_t *ppos) | |
1319 | { | |
1320 | char buf[15]; /* More than enough to hold UINT_MAX + "\n"*/ | |
1321 | int n; | |
1322 | ||
1a414428 | 1323 | n = sprintf(buf, "%d\n", fgraph_max_depth); |
8741db53 SR |
1324 | |
1325 | return simple_read_from_buffer(ubuf, cnt, ppos, buf, n); | |
1326 | } | |
1327 | ||
1328 | static const struct file_operations graph_depth_fops = { | |
1329 | .open = tracing_open_generic, | |
1330 | .write = graph_depth_write, | |
1331 | .read = graph_depth_read, | |
1332 | .llseek = generic_file_llseek, | |
1333 | }; | |
1334 | ||
8434dc93 | 1335 | static __init int init_graph_tracefs(void) |
8741db53 | 1336 | { |
22c36b18 | 1337 | int ret; |
8741db53 | 1338 | |
22c36b18 WY |
1339 | ret = tracing_init_dentry(); |
1340 | if (ret) | |
8741db53 SR |
1341 | return 0; |
1342 | ||
22c36b18 | 1343 | trace_create_file("max_graph_depth", 0644, NULL, |
8741db53 SR |
1344 | NULL, &graph_depth_fops); |
1345 | ||
1346 | return 0; | |
1347 | } | |
8434dc93 | 1348 | fs_initcall(init_graph_tracefs); |
8741db53 | 1349 | |
fb52607a FW |
1350 | static __init int init_graph_trace(void) |
1351 | { | |
9b130ad5 | 1352 | max_bytes_for_cpu = snprintf(NULL, 0, "%u", nr_cpu_ids - 1); |
0c9e6f63 | 1353 | |
9023c930 | 1354 | if (!register_trace_event(&graph_trace_entry_event)) { |
a395d6a7 | 1355 | pr_warn("Warning: could not register graph trace events\n"); |
9106b693 JO |
1356 | return 1; |
1357 | } | |
1358 | ||
9023c930 | 1359 | if (!register_trace_event(&graph_trace_ret_event)) { |
a395d6a7 | 1360 | pr_warn("Warning: could not register graph trace events\n"); |
9106b693 JO |
1361 | return 1; |
1362 | } | |
1363 | ||
fb52607a FW |
1364 | return register_tracer(&graph_trace); |
1365 | } | |
1366 | ||
6f415672 | 1367 | core_initcall(init_graph_trace); |