3 * Function graph tracer.
5 * Mostly borrowed from function tracer which
9 #include <linux/debugfs.h>
10 #include <linux/uaccess.h>
11 #include <linux/ftrace.h>
12 #include <linux/slab.h>
16 #include "trace_output.h"
18 struct fgraph_cpu_data {
22 unsigned long enter_funcs[FTRACE_RETFUNC_DEPTH];
26 struct fgraph_cpu_data *cpu_data;
28 /* Place to preserve last processed entry. */
29 struct ftrace_graph_ent_entry ent;
30 struct ftrace_graph_ret_entry ret;
35 #define TRACE_GRAPH_INDENT 2
38 #define TRACE_GRAPH_PRINT_OVERRUN 0x1
39 #define TRACE_GRAPH_PRINT_CPU 0x2
40 #define TRACE_GRAPH_PRINT_OVERHEAD 0x4
41 #define TRACE_GRAPH_PRINT_PROC 0x8
42 #define TRACE_GRAPH_PRINT_DURATION 0x10
43 #define TRACE_GRAPH_PRINT_ABS_TIME 0X20
45 static struct tracer_opt trace_opts[] = {
46 /* Display overruns? (for self-debug purpose) */
47 { TRACER_OPT(funcgraph-overrun, TRACE_GRAPH_PRINT_OVERRUN) },
49 { TRACER_OPT(funcgraph-cpu, TRACE_GRAPH_PRINT_CPU) },
50 /* Display Overhead ? */
51 { TRACER_OPT(funcgraph-overhead, TRACE_GRAPH_PRINT_OVERHEAD) },
52 /* Display proc name/pid */
53 { TRACER_OPT(funcgraph-proc, TRACE_GRAPH_PRINT_PROC) },
54 /* Display duration of execution */
55 { TRACER_OPT(funcgraph-duration, TRACE_GRAPH_PRINT_DURATION) },
56 /* Display absolute time of an entry */
57 { TRACER_OPT(funcgraph-abstime, TRACE_GRAPH_PRINT_ABS_TIME) },
61 static struct tracer_flags tracer_flags = {
62 /* Don't display overruns and proc by default */
63 .val = TRACE_GRAPH_PRINT_CPU | TRACE_GRAPH_PRINT_OVERHEAD |
64 TRACE_GRAPH_PRINT_DURATION,
68 static struct trace_array *graph_array;
71 /* Add a function return address to the trace stack on thread info.*/
73 ftrace_push_return_trace(unsigned long ret, unsigned long func, int *depth,
74 unsigned long frame_pointer)
76 unsigned long long calltime;
79 if (!current->ret_stack)
83 * We must make sure the ret_stack is tested before we read
88 /* The return trace stack is full */
89 if (current->curr_ret_stack == FTRACE_RETFUNC_DEPTH - 1) {
90 atomic_inc(¤t->trace_overrun);
94 calltime = trace_clock_local();
96 index = ++current->curr_ret_stack;
98 current->ret_stack[index].ret = ret;
99 current->ret_stack[index].func = func;
100 current->ret_stack[index].calltime = calltime;
101 current->ret_stack[index].subtime = 0;
102 current->ret_stack[index].fp = frame_pointer;
108 /* Retrieve a function return address to the trace stack on thread info.*/
110 ftrace_pop_return_trace(struct ftrace_graph_ret *trace, unsigned long *ret,
111 unsigned long frame_pointer)
115 index = current->curr_ret_stack;
117 if (unlikely(index < 0)) {
120 /* Might as well panic, otherwise we have no where to go */
121 *ret = (unsigned long)panic;
125 #ifdef CONFIG_HAVE_FUNCTION_GRAPH_FP_TEST
127 * The arch may choose to record the frame pointer used
128 * and check it here to make sure that it is what we expect it
129 * to be. If gcc does not set the place holder of the return
130 * address in the frame pointer, and does a copy instead, then
131 * the function graph trace will fail. This test detects this
134 * Currently, x86_32 with optimize for size (-Os) makes the latest
137 if (unlikely(current->ret_stack[index].fp != frame_pointer)) {
139 WARN(1, "Bad frame pointer: expected %lx, received %lx\n"
140 " from func %ps return to %lx\n",
141 current->ret_stack[index].fp,
143 (void *)current->ret_stack[index].func,
144 current->ret_stack[index].ret);
145 *ret = (unsigned long)panic;
150 *ret = current->ret_stack[index].ret;
151 trace->func = current->ret_stack[index].func;
152 trace->calltime = current->ret_stack[index].calltime;
153 trace->overrun = atomic_read(¤t->trace_overrun);
154 trace->depth = index;
158 * Send the trace to the ring-buffer.
159 * @return the original return address.
161 unsigned long ftrace_return_to_handler(unsigned long frame_pointer)
163 struct ftrace_graph_ret trace;
166 ftrace_pop_return_trace(&trace, &ret, frame_pointer);
167 trace.rettime = trace_clock_local();
168 ftrace_graph_return(&trace);
170 current->curr_ret_stack--;
172 if (unlikely(!ret)) {
175 /* Might as well panic. What else to do? */
176 ret = (unsigned long)panic;
182 static int __trace_graph_entry(struct trace_array *tr,
183 struct ftrace_graph_ent *trace,
187 struct ftrace_event_call *call = &event_funcgraph_entry;
188 struct ring_buffer_event *event;
189 struct ring_buffer *buffer = tr->buffer;
190 struct ftrace_graph_ent_entry *entry;
192 if (unlikely(__this_cpu_read(ftrace_cpu_disabled)))
195 event = trace_buffer_lock_reserve(buffer, TRACE_GRAPH_ENT,
196 sizeof(*entry), flags, pc);
199 entry = ring_buffer_event_data(event);
200 entry->graph_ent = *trace;
201 if (!filter_current_check_discard(buffer, call, entry, event))
202 ring_buffer_unlock_commit(buffer, event);
207 int trace_graph_entry(struct ftrace_graph_ent *trace)
209 struct trace_array *tr = graph_array;
210 struct trace_array_cpu *data;
217 if (!ftrace_trace_task(current))
220 /* trace it when it is-nested-in or is a function enabled. */
221 if (!(trace->depth || ftrace_graph_addr(trace->func)))
224 local_irq_save(flags);
225 cpu = raw_smp_processor_id();
226 data = tr->data[cpu];
227 disabled = atomic_inc_return(&data->disabled);
228 if (likely(disabled == 1)) {
229 pc = preempt_count();
230 ret = __trace_graph_entry(tr, trace, flags, pc);
235 atomic_dec(&data->disabled);
236 local_irq_restore(flags);
241 int trace_graph_thresh_entry(struct ftrace_graph_ent *trace)
246 return trace_graph_entry(trace);
249 static void __trace_graph_return(struct trace_array *tr,
250 struct ftrace_graph_ret *trace,
254 struct ftrace_event_call *call = &event_funcgraph_exit;
255 struct ring_buffer_event *event;
256 struct ring_buffer *buffer = tr->buffer;
257 struct ftrace_graph_ret_entry *entry;
259 if (unlikely(__this_cpu_read(ftrace_cpu_disabled)))
262 event = trace_buffer_lock_reserve(buffer, TRACE_GRAPH_RET,
263 sizeof(*entry), flags, pc);
266 entry = ring_buffer_event_data(event);
268 if (!filter_current_check_discard(buffer, call, entry, event))
269 ring_buffer_unlock_commit(buffer, event);
272 void trace_graph_return(struct ftrace_graph_ret *trace)
274 struct trace_array *tr = graph_array;
275 struct trace_array_cpu *data;
281 local_irq_save(flags);
282 cpu = raw_smp_processor_id();
283 data = tr->data[cpu];
284 disabled = atomic_inc_return(&data->disabled);
285 if (likely(disabled == 1)) {
286 pc = preempt_count();
287 __trace_graph_return(tr, trace, flags, pc);
289 atomic_dec(&data->disabled);
290 local_irq_restore(flags);
293 void set_graph_array(struct trace_array *tr)
297 /* Make graph_array visible before we start tracing */
302 void trace_graph_thresh_return(struct ftrace_graph_ret *trace)
304 if (tracing_thresh &&
305 (trace->rettime - trace->calltime < tracing_thresh))
308 trace_graph_return(trace);
311 static int graph_trace_init(struct trace_array *tr)
317 ret = register_ftrace_graph(&trace_graph_thresh_return,
318 &trace_graph_thresh_entry);
320 ret = register_ftrace_graph(&trace_graph_return,
324 tracing_start_cmdline_record();
329 static void graph_trace_reset(struct trace_array *tr)
331 tracing_stop_cmdline_record();
332 unregister_ftrace_graph();
335 static int max_bytes_for_cpu;
337 static enum print_line_t
338 print_graph_cpu(struct trace_seq *s, int cpu)
343 * Start with a space character - to make it stand out
344 * to the right a bit when trace output is pasted into
347 ret = trace_seq_printf(s, " %*d) ", max_bytes_for_cpu, cpu);
349 return TRACE_TYPE_PARTIAL_LINE;
351 return TRACE_TYPE_HANDLED;
354 #define TRACE_GRAPH_PROCINFO_LENGTH 14
356 static enum print_line_t
357 print_graph_proc(struct trace_seq *s, pid_t pid)
359 char comm[TASK_COMM_LEN];
360 /* sign + log10(MAX_INT) + '\0' */
367 trace_find_cmdline(pid, comm);
369 sprintf(pid_str, "%d", pid);
371 /* 1 stands for the "-" character */
372 len = strlen(comm) + strlen(pid_str) + 1;
374 if (len < TRACE_GRAPH_PROCINFO_LENGTH)
375 spaces = TRACE_GRAPH_PROCINFO_LENGTH - len;
377 /* First spaces to align center */
378 for (i = 0; i < spaces / 2; i++) {
379 ret = trace_seq_printf(s, " ");
381 return TRACE_TYPE_PARTIAL_LINE;
384 ret = trace_seq_printf(s, "%s-%s", comm, pid_str);
386 return TRACE_TYPE_PARTIAL_LINE;
388 /* Last spaces to align center */
389 for (i = 0; i < spaces - (spaces / 2); i++) {
390 ret = trace_seq_printf(s, " ");
392 return TRACE_TYPE_PARTIAL_LINE;
394 return TRACE_TYPE_HANDLED;
398 static enum print_line_t
399 print_graph_lat_fmt(struct trace_seq *s, struct trace_entry *entry)
401 if (!trace_seq_putc(s, ' '))
404 return trace_print_lat_fmt(s, entry);
407 /* If the pid changed since the last trace, output this event */
408 static enum print_line_t
409 verif_pid(struct trace_seq *s, pid_t pid, int cpu, struct fgraph_data *data)
416 return TRACE_TYPE_HANDLED;
418 last_pid = &(per_cpu_ptr(data->cpu_data, cpu)->last_pid);
420 if (*last_pid == pid)
421 return TRACE_TYPE_HANDLED;
423 prev_pid = *last_pid;
427 return TRACE_TYPE_HANDLED;
429 * Context-switch trace line:
431 ------------------------------------------
432 | 1) migration/0--1 => sshd-1755
433 ------------------------------------------
436 ret = trace_seq_printf(s,
437 " ------------------------------------------\n");
439 return TRACE_TYPE_PARTIAL_LINE;
441 ret = print_graph_cpu(s, cpu);
442 if (ret == TRACE_TYPE_PARTIAL_LINE)
443 return TRACE_TYPE_PARTIAL_LINE;
445 ret = print_graph_proc(s, prev_pid);
446 if (ret == TRACE_TYPE_PARTIAL_LINE)
447 return TRACE_TYPE_PARTIAL_LINE;
449 ret = trace_seq_printf(s, " => ");
451 return TRACE_TYPE_PARTIAL_LINE;
453 ret = print_graph_proc(s, pid);
454 if (ret == TRACE_TYPE_PARTIAL_LINE)
455 return TRACE_TYPE_PARTIAL_LINE;
457 ret = trace_seq_printf(s,
458 "\n ------------------------------------------\n\n");
460 return TRACE_TYPE_PARTIAL_LINE;
462 return TRACE_TYPE_HANDLED;
465 static struct ftrace_graph_ret_entry *
466 get_return_for_leaf(struct trace_iterator *iter,
467 struct ftrace_graph_ent_entry *curr)
469 struct fgraph_data *data = iter->private;
470 struct ring_buffer_iter *ring_iter = NULL;
471 struct ring_buffer_event *event;
472 struct ftrace_graph_ret_entry *next;
475 * If the previous output failed to write to the seq buffer,
476 * then we just reuse the data from before.
478 if (data && data->failed) {
483 ring_iter = iter->buffer_iter[iter->cpu];
485 /* First peek to compare current entry and the next one */
487 event = ring_buffer_iter_peek(ring_iter, NULL);
490 * We need to consume the current entry to see
493 ring_buffer_consume(iter->tr->buffer, iter->cpu,
495 event = ring_buffer_peek(iter->tr->buffer, iter->cpu,
502 next = ring_buffer_event_data(event);
506 * Save current and next entries for later reference
507 * if the output fails.
514 if (next->ent.type != TRACE_GRAPH_RET)
517 if (curr->ent.pid != next->ent.pid ||
518 curr->graph_ent.func != next->ret.func)
521 /* this is a leaf, now advance the iterator */
523 ring_buffer_read(ring_iter, NULL);
528 /* Signal a overhead of time execution to the output */
530 print_graph_overhead(unsigned long long duration, struct trace_seq *s)
532 /* If duration disappear, we don't need anything */
533 if (!(tracer_flags.val & TRACE_GRAPH_PRINT_DURATION))
536 /* Non nested entry or return */
538 return trace_seq_printf(s, " ");
540 if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERHEAD) {
541 /* Duration exceeded 100 msecs */
542 if (duration > 100000ULL)
543 return trace_seq_printf(s, "! ");
545 /* Duration exceeded 10 msecs */
546 if (duration > 10000ULL)
547 return trace_seq_printf(s, "+ ");
550 return trace_seq_printf(s, " ");
553 static int print_graph_abs_time(u64 t, struct trace_seq *s)
555 unsigned long usecs_rem;
557 usecs_rem = do_div(t, NSEC_PER_SEC);
560 return trace_seq_printf(s, "%5lu.%06lu | ",
561 (unsigned long)t, usecs_rem);
564 static enum print_line_t
565 print_graph_irq(struct trace_iterator *iter, unsigned long addr,
566 enum trace_type type, int cpu, pid_t pid)
569 struct trace_seq *s = &iter->seq;
571 if (addr < (unsigned long)__irqentry_text_start ||
572 addr >= (unsigned long)__irqentry_text_end)
573 return TRACE_TYPE_UNHANDLED;
576 if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
577 ret = print_graph_abs_time(iter->ts, s);
579 return TRACE_TYPE_PARTIAL_LINE;
583 if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
584 ret = print_graph_cpu(s, cpu);
585 if (ret == TRACE_TYPE_PARTIAL_LINE)
586 return TRACE_TYPE_PARTIAL_LINE;
590 if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
591 ret = print_graph_proc(s, pid);
592 if (ret == TRACE_TYPE_PARTIAL_LINE)
593 return TRACE_TYPE_PARTIAL_LINE;
594 ret = trace_seq_printf(s, " | ");
596 return TRACE_TYPE_PARTIAL_LINE;
600 ret = print_graph_overhead(-1, s);
602 return TRACE_TYPE_PARTIAL_LINE;
604 if (type == TRACE_GRAPH_ENT)
605 ret = trace_seq_printf(s, "==========>");
607 ret = trace_seq_printf(s, "<==========");
610 return TRACE_TYPE_PARTIAL_LINE;
612 /* Don't close the duration column if haven't one */
613 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
614 trace_seq_printf(s, " |");
615 ret = trace_seq_printf(s, "\n");
618 return TRACE_TYPE_PARTIAL_LINE;
619 return TRACE_TYPE_HANDLED;
623 trace_print_graph_duration(unsigned long long duration, struct trace_seq *s)
625 unsigned long nsecs_rem = do_div(duration, 1000);
626 /* log10(ULONG_MAX) + '\0' */
632 sprintf(msecs_str, "%lu", (unsigned long) duration);
635 ret = trace_seq_printf(s, "%s", msecs_str);
637 return TRACE_TYPE_PARTIAL_LINE;
639 len = strlen(msecs_str);
641 /* Print nsecs (we don't want to exceed 7 numbers) */
643 snprintf(nsecs_str, 8 - len, "%03lu", nsecs_rem);
644 ret = trace_seq_printf(s, ".%s", nsecs_str);
646 return TRACE_TYPE_PARTIAL_LINE;
647 len += strlen(nsecs_str);
650 ret = trace_seq_printf(s, " us ");
652 return TRACE_TYPE_PARTIAL_LINE;
654 /* Print remaining spaces to fit the row's width */
655 for (i = len; i < 7; i++) {
656 ret = trace_seq_printf(s, " ");
658 return TRACE_TYPE_PARTIAL_LINE;
660 return TRACE_TYPE_HANDLED;
663 static enum print_line_t
664 print_graph_duration(unsigned long long duration, struct trace_seq *s)
668 ret = trace_print_graph_duration(duration, s);
669 if (ret != TRACE_TYPE_HANDLED)
672 ret = trace_seq_printf(s, "| ");
674 return TRACE_TYPE_PARTIAL_LINE;
676 return TRACE_TYPE_HANDLED;
679 /* Case of a leaf function on its call entry */
680 static enum print_line_t
681 print_graph_entry_leaf(struct trace_iterator *iter,
682 struct ftrace_graph_ent_entry *entry,
683 struct ftrace_graph_ret_entry *ret_entry, struct trace_seq *s)
685 struct fgraph_data *data = iter->private;
686 struct ftrace_graph_ret *graph_ret;
687 struct ftrace_graph_ent *call;
688 unsigned long long duration;
692 graph_ret = &ret_entry->ret;
693 call = &entry->graph_ent;
694 duration = graph_ret->rettime - graph_ret->calltime;
697 struct fgraph_cpu_data *cpu_data;
700 cpu_data = per_cpu_ptr(data->cpu_data, cpu);
703 * Comments display at + 1 to depth. Since
704 * this is a leaf function, keep the comments
705 * equal to this depth.
707 cpu_data->depth = call->depth - 1;
709 /* No need to keep this function around for this depth */
710 if (call->depth < FTRACE_RETFUNC_DEPTH)
711 cpu_data->enter_funcs[call->depth] = 0;
715 ret = print_graph_overhead(duration, s);
717 return TRACE_TYPE_PARTIAL_LINE;
720 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
721 ret = print_graph_duration(duration, s);
722 if (ret == TRACE_TYPE_PARTIAL_LINE)
723 return TRACE_TYPE_PARTIAL_LINE;
727 for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
728 ret = trace_seq_printf(s, " ");
730 return TRACE_TYPE_PARTIAL_LINE;
733 ret = trace_seq_printf(s, "%ps();\n", (void *)call->func);
735 return TRACE_TYPE_PARTIAL_LINE;
737 return TRACE_TYPE_HANDLED;
740 static enum print_line_t
741 print_graph_entry_nested(struct trace_iterator *iter,
742 struct ftrace_graph_ent_entry *entry,
743 struct trace_seq *s, int cpu)
745 struct ftrace_graph_ent *call = &entry->graph_ent;
746 struct fgraph_data *data = iter->private;
751 struct fgraph_cpu_data *cpu_data;
754 cpu_data = per_cpu_ptr(data->cpu_data, cpu);
755 cpu_data->depth = call->depth;
757 /* Save this function pointer to see if the exit matches */
758 if (call->depth < FTRACE_RETFUNC_DEPTH)
759 cpu_data->enter_funcs[call->depth] = call->func;
763 ret = print_graph_overhead(-1, s);
765 return TRACE_TYPE_PARTIAL_LINE;
768 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
769 ret = trace_seq_printf(s, " | ");
771 return TRACE_TYPE_PARTIAL_LINE;
775 for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
776 ret = trace_seq_printf(s, " ");
778 return TRACE_TYPE_PARTIAL_LINE;
781 ret = trace_seq_printf(s, "%ps() {\n", (void *)call->func);
783 return TRACE_TYPE_PARTIAL_LINE;
786 * we already consumed the current entry to check the next one
787 * and see if this is a leaf.
789 return TRACE_TYPE_NO_CONSUME;
792 static enum print_line_t
793 print_graph_prologue(struct trace_iterator *iter, struct trace_seq *s,
794 int type, unsigned long addr)
796 struct fgraph_data *data = iter->private;
797 struct trace_entry *ent = iter->ent;
802 if (verif_pid(s, ent->pid, cpu, data) == TRACE_TYPE_PARTIAL_LINE)
803 return TRACE_TYPE_PARTIAL_LINE;
807 ret = print_graph_irq(iter, addr, type, cpu, ent->pid);
808 if (ret == TRACE_TYPE_PARTIAL_LINE)
809 return TRACE_TYPE_PARTIAL_LINE;
813 if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
814 ret = print_graph_abs_time(iter->ts, s);
816 return TRACE_TYPE_PARTIAL_LINE;
820 if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
821 ret = print_graph_cpu(s, cpu);
822 if (ret == TRACE_TYPE_PARTIAL_LINE)
823 return TRACE_TYPE_PARTIAL_LINE;
827 if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
828 ret = print_graph_proc(s, ent->pid);
829 if (ret == TRACE_TYPE_PARTIAL_LINE)
830 return TRACE_TYPE_PARTIAL_LINE;
832 ret = trace_seq_printf(s, " | ");
834 return TRACE_TYPE_PARTIAL_LINE;
838 if (trace_flags & TRACE_ITER_LATENCY_FMT) {
839 ret = print_graph_lat_fmt(s, ent);
840 if (ret == TRACE_TYPE_PARTIAL_LINE)
841 return TRACE_TYPE_PARTIAL_LINE;
847 static enum print_line_t
848 print_graph_entry(struct ftrace_graph_ent_entry *field, struct trace_seq *s,
849 struct trace_iterator *iter)
851 struct fgraph_data *data = iter->private;
852 struct ftrace_graph_ent *call = &field->graph_ent;
853 struct ftrace_graph_ret_entry *leaf_ret;
854 static enum print_line_t ret;
857 if (print_graph_prologue(iter, s, TRACE_GRAPH_ENT, call->func))
858 return TRACE_TYPE_PARTIAL_LINE;
860 leaf_ret = get_return_for_leaf(iter, field);
862 ret = print_graph_entry_leaf(iter, field, leaf_ret, s);
864 ret = print_graph_entry_nested(iter, field, s, cpu);
868 * If we failed to write our output, then we need to make
869 * note of it. Because we already consumed our entry.
881 static enum print_line_t
882 print_graph_return(struct ftrace_graph_ret *trace, struct trace_seq *s,
883 struct trace_entry *ent, struct trace_iterator *iter)
885 unsigned long long duration = trace->rettime - trace->calltime;
886 struct fgraph_data *data = iter->private;
887 pid_t pid = ent->pid;
894 struct fgraph_cpu_data *cpu_data;
897 cpu_data = per_cpu_ptr(data->cpu_data, cpu);
900 * Comments display at + 1 to depth. This is the
901 * return from a function, we now want the comments
902 * to display at the same level of the bracket.
904 cpu_data->depth = trace->depth - 1;
906 if (trace->depth < FTRACE_RETFUNC_DEPTH) {
907 if (cpu_data->enter_funcs[trace->depth] != trace->func)
909 cpu_data->enter_funcs[trace->depth] = 0;
913 if (print_graph_prologue(iter, s, 0, 0))
914 return TRACE_TYPE_PARTIAL_LINE;
917 ret = print_graph_overhead(duration, s);
919 return TRACE_TYPE_PARTIAL_LINE;
922 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
923 ret = print_graph_duration(duration, s);
924 if (ret == TRACE_TYPE_PARTIAL_LINE)
925 return TRACE_TYPE_PARTIAL_LINE;
929 for (i = 0; i < trace->depth * TRACE_GRAPH_INDENT; i++) {
930 ret = trace_seq_printf(s, " ");
932 return TRACE_TYPE_PARTIAL_LINE;
936 * If the return function does not have a matching entry,
937 * then the entry was lost. Instead of just printing
938 * the '}' and letting the user guess what function this
939 * belongs to, write out the function name.
942 ret = trace_seq_printf(s, "}\n");
944 return TRACE_TYPE_PARTIAL_LINE;
946 ret = trace_seq_printf(s, "} /* %ps */\n", (void *)trace->func);
948 return TRACE_TYPE_PARTIAL_LINE;
952 if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERRUN) {
953 ret = trace_seq_printf(s, " (Overruns: %lu)\n",
956 return TRACE_TYPE_PARTIAL_LINE;
959 ret = print_graph_irq(iter, trace->func, TRACE_GRAPH_RET, cpu, pid);
960 if (ret == TRACE_TYPE_PARTIAL_LINE)
961 return TRACE_TYPE_PARTIAL_LINE;
963 return TRACE_TYPE_HANDLED;
966 static enum print_line_t
967 print_graph_comment(struct trace_seq *s, struct trace_entry *ent,
968 struct trace_iterator *iter)
970 unsigned long sym_flags = (trace_flags & TRACE_ITER_SYM_MASK);
971 struct fgraph_data *data = iter->private;
972 struct trace_event *event;
978 depth = per_cpu_ptr(data->cpu_data, iter->cpu)->depth;
980 if (print_graph_prologue(iter, s, 0, 0))
981 return TRACE_TYPE_PARTIAL_LINE;
984 ret = print_graph_overhead(-1, s);
986 return TRACE_TYPE_PARTIAL_LINE;
989 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
990 ret = trace_seq_printf(s, " | ");
992 return TRACE_TYPE_PARTIAL_LINE;
997 for (i = 0; i < (depth + 1) * TRACE_GRAPH_INDENT; i++) {
998 ret = trace_seq_printf(s, " ");
1000 return TRACE_TYPE_PARTIAL_LINE;
1004 ret = trace_seq_printf(s, "/* ");
1006 return TRACE_TYPE_PARTIAL_LINE;
1008 switch (iter->ent->type) {
1010 ret = trace_print_bprintk_msg_only(iter);
1011 if (ret != TRACE_TYPE_HANDLED)
1015 ret = trace_print_printk_msg_only(iter);
1016 if (ret != TRACE_TYPE_HANDLED)
1020 event = ftrace_find_event(ent->type);
1022 return TRACE_TYPE_UNHANDLED;
1024 ret = event->trace(iter, sym_flags);
1025 if (ret != TRACE_TYPE_HANDLED)
1029 /* Strip ending newline */
1030 if (s->buffer[s->len - 1] == '\n') {
1031 s->buffer[s->len - 1] = '\0';
1035 ret = trace_seq_printf(s, " */\n");
1037 return TRACE_TYPE_PARTIAL_LINE;
1039 return TRACE_TYPE_HANDLED;
1044 print_graph_function(struct trace_iterator *iter)
1046 struct ftrace_graph_ent_entry *field;
1047 struct fgraph_data *data = iter->private;
1048 struct trace_entry *entry = iter->ent;
1049 struct trace_seq *s = &iter->seq;
1050 int cpu = iter->cpu;
1053 if (data && per_cpu_ptr(data->cpu_data, cpu)->ignore) {
1054 per_cpu_ptr(data->cpu_data, cpu)->ignore = 0;
1055 return TRACE_TYPE_HANDLED;
1059 * If the last output failed, there's a possibility we need
1060 * to print out the missing entry which would never go out.
1062 if (data && data->failed) {
1064 iter->cpu = data->cpu;
1065 ret = print_graph_entry(field, s, iter);
1066 if (ret == TRACE_TYPE_HANDLED && iter->cpu != cpu) {
1067 per_cpu_ptr(data->cpu_data, iter->cpu)->ignore = 1;
1068 ret = TRACE_TYPE_NO_CONSUME;
1074 switch (entry->type) {
1075 case TRACE_GRAPH_ENT: {
1077 * print_graph_entry() may consume the current event,
1078 * thus @field may become invalid, so we need to save it.
1079 * sizeof(struct ftrace_graph_ent_entry) is very small,
1080 * it can be safely saved at the stack.
1082 struct ftrace_graph_ent_entry saved;
1083 trace_assign_type(field, entry);
1085 return print_graph_entry(&saved, s, iter);
1087 case TRACE_GRAPH_RET: {
1088 struct ftrace_graph_ret_entry *field;
1089 trace_assign_type(field, entry);
1090 return print_graph_return(&field->ret, s, entry, iter);
1093 return print_graph_comment(s, entry, iter);
1096 return TRACE_TYPE_HANDLED;
1099 static void print_lat_header(struct seq_file *s)
1101 static const char spaces[] = " " /* 16 spaces */
1103 " "; /* 17 spaces */
1106 if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
1108 if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
1110 if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
1113 seq_printf(s, "#%.*s _-----=> irqs-off \n", size, spaces);
1114 seq_printf(s, "#%.*s / _----=> need-resched \n", size, spaces);
1115 seq_printf(s, "#%.*s| / _---=> hardirq/softirq \n", size, spaces);
1116 seq_printf(s, "#%.*s|| / _--=> preempt-depth \n", size, spaces);
1117 seq_printf(s, "#%.*s||| / _-=> lock-depth \n", size, spaces);
1118 seq_printf(s, "#%.*s|||| / \n", size, spaces);
1121 static void print_graph_headers(struct seq_file *s)
1123 int lat = trace_flags & TRACE_ITER_LATENCY_FMT;
1126 print_lat_header(s);
1130 if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
1131 seq_printf(s, " TIME ");
1132 if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
1133 seq_printf(s, " CPU");
1134 if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
1135 seq_printf(s, " TASK/PID ");
1137 seq_printf(s, "|||||");
1138 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
1139 seq_printf(s, " DURATION ");
1140 seq_printf(s, " FUNCTION CALLS\n");
1144 if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
1145 seq_printf(s, " | ");
1146 if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
1147 seq_printf(s, " | ");
1148 if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
1149 seq_printf(s, " | | ");
1151 seq_printf(s, "|||||");
1152 if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
1153 seq_printf(s, " | | ");
1154 seq_printf(s, " | | | |\n");
1157 static void graph_trace_open(struct trace_iterator *iter)
1159 /* pid and depth on the last trace processed */
1160 struct fgraph_data *data;
1163 iter->private = NULL;
1165 data = kzalloc(sizeof(*data), GFP_KERNEL);
1169 data->cpu_data = alloc_percpu(struct fgraph_cpu_data);
1170 if (!data->cpu_data)
1173 for_each_possible_cpu(cpu) {
1174 pid_t *pid = &(per_cpu_ptr(data->cpu_data, cpu)->last_pid);
1175 int *depth = &(per_cpu_ptr(data->cpu_data, cpu)->depth);
1176 int *ignore = &(per_cpu_ptr(data->cpu_data, cpu)->ignore);
1182 iter->private = data;
1189 pr_warning("function graph tracer: not enough memory\n");
1192 static void graph_trace_close(struct trace_iterator *iter)
1194 struct fgraph_data *data = iter->private;
1197 free_percpu(data->cpu_data);
1202 static struct tracer graph_trace __read_mostly = {
1203 .name = "function_graph",
1204 .open = graph_trace_open,
1205 .pipe_open = graph_trace_open,
1206 .close = graph_trace_close,
1207 .pipe_close = graph_trace_close,
1208 .wait_pipe = poll_wait_pipe,
1209 .init = graph_trace_init,
1210 .reset = graph_trace_reset,
1211 .print_line = print_graph_function,
1212 .print_header = print_graph_headers,
1213 .flags = &tracer_flags,
1214 #ifdef CONFIG_FTRACE_SELFTEST
1215 .selftest = trace_selftest_startup_function_graph,
1219 static __init int init_graph_trace(void)
1221 max_bytes_for_cpu = snprintf(NULL, 0, "%d", nr_cpu_ids - 1);
1223 return register_tracer(&graph_trace);
1226 device_initcall(init_graph_trace);