trace_functions_graph.c 20.3 KB
Newer Older
1
2
3
/*
 *
 * Function graph tracer.
4
 * Copyright (c) 2008-2009 Frederic Weisbecker <fweisbec@gmail.com>
5
6
7
8
9
10
11
12
13
14
 * Mostly borrowed from function tracer which
 * is Copyright (c) Steven Rostedt <srostedt@redhat.com>
 *
 */
#include <linux/debugfs.h>
#include <linux/uaccess.h>
#include <linux/ftrace.h>
#include <linux/fs.h>

#include "trace.h"
15
#include "trace_output.h"
16

17
#define TRACE_GRAPH_INDENT	2
18

19
/* Flag options */
20
#define TRACE_GRAPH_PRINT_OVERRUN	0x1
21
22
#define TRACE_GRAPH_PRINT_CPU		0x2
#define TRACE_GRAPH_PRINT_OVERHEAD	0x4
23
#define TRACE_GRAPH_PRINT_PROC		0x8
24
25
#define TRACE_GRAPH_PRINT_DURATION	0x10
#define TRACE_GRAPH_PRINT_ABS_TIME	0X20
26

27
static struct tracer_opt trace_opts[] = {
28
	/* Display overruns? (for self-debug purpose) */
29
30
31
32
33
	{ TRACER_OPT(funcgraph-overrun, TRACE_GRAPH_PRINT_OVERRUN) },
	/* Display CPU ? */
	{ TRACER_OPT(funcgraph-cpu, TRACE_GRAPH_PRINT_CPU) },
	/* Display Overhead ? */
	{ TRACER_OPT(funcgraph-overhead, TRACE_GRAPH_PRINT_OVERHEAD) },
34
35
	/* Display proc name/pid */
	{ TRACER_OPT(funcgraph-proc, TRACE_GRAPH_PRINT_PROC) },
36
37
38
39
	/* Display duration of execution */
	{ TRACER_OPT(funcgraph-duration, TRACE_GRAPH_PRINT_DURATION) },
	/* Display absolute time of an entry */
	{ TRACER_OPT(funcgraph-abstime, TRACE_GRAPH_PRINT_ABS_TIME) },
40
41
42
43
	{ } /* Empty entry */
};

static struct tracer_flags tracer_flags = {
44
	/* Don't display overruns and proc by default */
45
46
	.val = TRACE_GRAPH_PRINT_CPU | TRACE_GRAPH_PRINT_OVERHEAD |
	       TRACE_GRAPH_PRINT_DURATION,
47
48
49
	.opts = trace_opts
};

50
/* pid on the last trace processed */
51

52

53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
/* Add a function return address to the trace stack on thread info.*/
int
ftrace_push_return_trace(unsigned long ret, unsigned long long time,
			 unsigned long func, int *depth)
{
	int index;

	if (!current->ret_stack)
		return -EBUSY;

	/* The return trace stack is full */
	if (current->curr_ret_stack == FTRACE_RETFUNC_DEPTH - 1) {
		atomic_inc(&current->trace_overrun);
		return -EBUSY;
	}

	index = ++current->curr_ret_stack;
	barrier();
	current->ret_stack[index].ret = ret;
	current->ret_stack[index].func = func;
	current->ret_stack[index].calltime = time;
	*depth = index;

	return 0;
}

/* Retrieve a function return address to the trace stack on thread info.*/
void
ftrace_pop_return_trace(struct ftrace_graph_ret *trace, unsigned long *ret)
{
	int index;

	index = current->curr_ret_stack;

	if (unlikely(index < 0)) {
		ftrace_graph_stop();
		WARN_ON(1);
		/* Might as well panic, otherwise we have no where to go */
		*ret = (unsigned long)panic;
		return;
	}

	*ret = current->ret_stack[index].ret;
	trace->func = current->ret_stack[index].func;
	trace->calltime = current->ret_stack[index].calltime;
	trace->overrun = atomic_read(&current->trace_overrun);
	trace->depth = index;
	barrier();
	current->curr_ret_stack--;

}

/*
 * Send the trace to the ring-buffer.
 * @return the original return address.
 */
unsigned long ftrace_return_to_handler(void)
{
	struct ftrace_graph_ret trace;
	unsigned long ret;

	ftrace_pop_return_trace(&trace, &ret);
115
	trace.rettime = trace_clock_local();
116
117
118
119
120
121
122
123
124
125
126
127
	ftrace_graph_return(&trace);

	if (unlikely(!ret)) {
		ftrace_graph_stop();
		WARN_ON(1);
		/* Might as well panic. What else to do? */
		ret = (unsigned long)panic;
	}

	return ret;
}

128
129
static int graph_trace_init(struct trace_array *tr)
{
130
	int ret = register_ftrace_graph(&trace_graph_return,
131
					&trace_graph_entry);
132
133
134
135
136
	if (ret)
		return ret;
	tracing_start_cmdline_record();

	return 0;
137
138
139
140
}

static void graph_trace_reset(struct trace_array *tr)
{
141
142
	tracing_stop_cmdline_record();
	unregister_ftrace_graph();
143
144
}

145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
static inline int log10_cpu(int nb)
{
	if (nb / 100)
		return 3;
	if (nb / 10)
		return 2;
	return 1;
}

static enum print_line_t
print_graph_cpu(struct trace_seq *s, int cpu)
{
	int i;
	int ret;
	int log10_this = log10_cpu(cpu);
160
	int log10_all = log10_cpu(cpumask_weight(cpu_online_mask));
161
162


163
164
165
166
167
168
169
170
171
172
173
174
175
	/*
	 * Start with a space character - to make it stand out
	 * to the right a bit when trace output is pasted into
	 * email:
	 */
	ret = trace_seq_printf(s, " ");

	/*
	 * Tricky - we space the CPU field according to the max
	 * number of online CPUs. On a 2-cpu system it would take
	 * a maximum of 1 digit - on a 128 cpu system it would
	 * take up to 3 digits:
	 */
176
177
178
179
180
181
182
	for (i = 0; i < log10_all - log10_this; i++) {
		ret = trace_seq_printf(s, " ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
	ret = trace_seq_printf(s, "%d) ", cpu);
	if (!ret)
183
184
		return TRACE_TYPE_PARTIAL_LINE;

185
186
187
	return TRACE_TYPE_HANDLED;
}

188
189
190
191
192
#define TRACE_GRAPH_PROCINFO_LENGTH	14

static enum print_line_t
print_graph_proc(struct trace_seq *s, pid_t pid)
{
193
	char comm[TASK_COMM_LEN];
194
195
	/* sign + log10(MAX_INT) + '\0' */
	char pid_str[11];
196
197
198
199
	int spaces = 0;
	int ret;
	int len;
	int i;
200

201
	trace_find_cmdline(pid, comm);
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
	comm[7] = '\0';
	sprintf(pid_str, "%d", pid);

	/* 1 stands for the "-" character */
	len = strlen(comm) + strlen(pid_str) + 1;

	if (len < TRACE_GRAPH_PROCINFO_LENGTH)
		spaces = TRACE_GRAPH_PROCINFO_LENGTH - len;

	/* First spaces to align center */
	for (i = 0; i < spaces / 2; i++) {
		ret = trace_seq_printf(s, " ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	ret = trace_seq_printf(s, "%s-%s", comm, pid_str);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	/* Last spaces to align center */
	for (i = 0; i < spaces - (spaces / 2); i++) {
		ret = trace_seq_printf(s, " ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
	return TRACE_TYPE_HANDLED;
}

231

232
/* If the pid changed since the last trace, output this event */
233
static enum print_line_t
234
verif_pid(struct trace_seq *s, pid_t pid, int cpu, pid_t *last_pids_cpu)
235
{
236
	pid_t prev_pid;
237
	pid_t *last_pid;
238
	int ret;
239

240
241
242
243
244
245
	if (!last_pids_cpu)
		return TRACE_TYPE_HANDLED;

	last_pid = per_cpu_ptr(last_pids_cpu, cpu);

	if (*last_pid == pid)
246
		return TRACE_TYPE_HANDLED;
247

248
249
	prev_pid = *last_pid;
	*last_pid = pid;
250

251
252
	if (prev_pid == -1)
		return TRACE_TYPE_HANDLED;
253
254
255
256
257
258
259
260
261
/*
 * Context-switch trace line:

 ------------------------------------------
 | 1)  migration/0--1  =>  sshd-1755
 ------------------------------------------

 */
	ret = trace_seq_printf(s,
262
		" ------------------------------------------\n");
263
	if (!ret)
264
		return TRACE_TYPE_PARTIAL_LINE;
265
266
267

	ret = print_graph_cpu(s, cpu);
	if (ret == TRACE_TYPE_PARTIAL_LINE)
268
		return TRACE_TYPE_PARTIAL_LINE;
269
270
271

	ret = print_graph_proc(s, prev_pid);
	if (ret == TRACE_TYPE_PARTIAL_LINE)
272
		return TRACE_TYPE_PARTIAL_LINE;
273
274
275

	ret = trace_seq_printf(s, " => ");
	if (!ret)
276
		return TRACE_TYPE_PARTIAL_LINE;
277
278
279

	ret = print_graph_proc(s, pid);
	if (ret == TRACE_TYPE_PARTIAL_LINE)
280
		return TRACE_TYPE_PARTIAL_LINE;
281
282
283
284

	ret = trace_seq_printf(s,
		"\n ------------------------------------------\n\n");
	if (!ret)
285
		return TRACE_TYPE_PARTIAL_LINE;
286

287
	return TRACE_TYPE_HANDLED;
288
289
}

290
291
static struct ftrace_graph_ret_entry *
get_return_for_leaf(struct trace_iterator *iter,
292
293
294
295
296
297
298
299
		struct ftrace_graph_ent_entry *curr)
{
	struct ring_buffer_iter *ring_iter;
	struct ring_buffer_event *event;
	struct ftrace_graph_ret_entry *next;

	ring_iter = iter->buffer_iter[iter->cpu];

300
301
302
303
304
305
306
307
308
	/* First peek to compare current entry and the next one */
	if (ring_iter)
		event = ring_buffer_iter_peek(ring_iter, NULL);
	else {
	/* We need to consume the current entry to see the next one */
		ring_buffer_consume(iter->tr->buffer, iter->cpu, NULL);
		event = ring_buffer_peek(iter->tr->buffer, iter->cpu,
					NULL);
	}
309
310

	if (!event)
311
		return NULL;
312
313
314
315

	next = ring_buffer_event_data(event);

	if (next->ent.type != TRACE_GRAPH_RET)
316
		return NULL;
317
318
319

	if (curr->ent.pid != next->ent.pid ||
			curr->graph_ent.func != next->ret.func)
320
		return NULL;
321

322
323
324
325
326
	/* this is a leaf, now advance the iterator */
	if (ring_iter)
		ring_buffer_read(ring_iter, NULL);

	return next;
327
328
}

329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
/* Signal a overhead of time execution to the output */
static int
print_graph_overhead(unsigned long long duration, struct trace_seq *s)
{
	/* If duration disappear, we don't need anything */
	if (!(tracer_flags.val & TRACE_GRAPH_PRINT_DURATION))
		return 1;

	/* Non nested entry or return */
	if (duration == -1)
		return trace_seq_printf(s, "  ");

	if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERHEAD) {
		/* Duration exceeded 100 msecs */
		if (duration > 100000ULL)
			return trace_seq_printf(s, "! ");

		/* Duration exceeded 10 msecs */
		if (duration > 10000ULL)
			return trace_seq_printf(s, "+ ");
	}

	return trace_seq_printf(s, "  ");
}

354
355
356
357
358
359
360
361
362
363
364
static int print_graph_abs_time(u64 t, struct trace_seq *s)
{
	unsigned long usecs_rem;

	usecs_rem = do_div(t, NSEC_PER_SEC);
	usecs_rem /= 1000;

	return trace_seq_printf(s, "%5lu.%06lu |  ",
			(unsigned long)t, usecs_rem);
}

365
static enum print_line_t
366
print_graph_irq(struct trace_iterator *iter, unsigned long addr,
367
		enum trace_type type, int cpu, pid_t pid)
368
369
{
	int ret;
370
	struct trace_seq *s = &iter->seq;
371
372
373
374
375

	if (addr < (unsigned long)__irqentry_text_start ||
		addr >= (unsigned long)__irqentry_text_end)
		return TRACE_TYPE_UNHANDLED;

376
377
378
379
380
381
382
	/* Absolute time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
		ret = print_graph_abs_time(iter->ts, s);
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
	/* Cpu */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
		ret = print_graph_cpu(s, cpu);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}
	/* Proc */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
		ret = print_graph_proc(s, pid);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
		ret = trace_seq_printf(s, " | ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
398

399
400
401
402
	/* No overhead */
	ret = print_graph_overhead(-1, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
403

404
405
406
407
408
409
410
411
412
413
414
415
	if (type == TRACE_GRAPH_ENT)
		ret = trace_seq_printf(s, "==========>");
	else
		ret = trace_seq_printf(s, "<==========");

	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	/* Don't close the duration column if haven't one */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
		trace_seq_printf(s, " |");
	ret = trace_seq_printf(s, "\n");
416
417
418
419
420

	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
	return TRACE_TYPE_HANDLED;
}
421

422
static enum print_line_t
423
424
425
print_graph_duration(unsigned long long duration, struct trace_seq *s)
{
	unsigned long nsecs_rem = do_div(duration, 1000);
426
427
428
429
430
431
432
433
434
	/* log10(ULONG_MAX) + '\0' */
	char msecs_str[21];
	char nsecs_str[5];
	int ret, len;
	int i;

	sprintf(msecs_str, "%lu", (unsigned long) duration);

	/* Print msecs */
435
	ret = trace_seq_printf(s, "%s", msecs_str);
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	len = strlen(msecs_str);

	/* Print nsecs (we don't want to exceed 7 numbers) */
	if (len < 7) {
		snprintf(nsecs_str, 8 - len, "%03lu", nsecs_rem);
		ret = trace_seq_printf(s, ".%s", nsecs_str);
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
		len += strlen(nsecs_str);
	}

	ret = trace_seq_printf(s, " us ");
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	/* Print remaining spaces to fit the row's width */
	for (i = len; i < 7; i++) {
		ret = trace_seq_printf(s, " ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	ret = trace_seq_printf(s, "|  ");
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
	return TRACE_TYPE_HANDLED;

466
467
468
}

/* Case of a leaf function on its call entry */
469
static enum print_line_t
470
print_graph_entry_leaf(struct trace_iterator *iter,
471
472
		struct ftrace_graph_ent_entry *entry,
		struct ftrace_graph_ret_entry *ret_entry, struct trace_seq *s)
473
{
474
475
476
	struct ftrace_graph_ret *graph_ret;
	struct ftrace_graph_ent *call;
	unsigned long long duration;
477
	int ret;
478
	int i;
479

480
481
482
483
484
	graph_ret = &ret_entry->ret;
	call = &entry->graph_ent;
	duration = graph_ret->rettime - graph_ret->calltime;

	/* Overhead */
485
486
487
	ret = print_graph_overhead(duration, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
488
489

	/* Duration */
490
491
492
493
494
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
		ret = print_graph_duration(duration, s);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}
495

496
497
498
499
500
501
502
503
504
505
506
	/* Function */
	for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
		ret = trace_seq_printf(s, " ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	ret = seq_print_ip_sym(s, call->func, 0);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

507
	ret = trace_seq_printf(s, "();\n");
508
509
510
511
512
513
514
515
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	return TRACE_TYPE_HANDLED;
}

static enum print_line_t
print_graph_entry_nested(struct ftrace_graph_ent_entry *entry,
516
			struct trace_seq *s, pid_t pid, int cpu)
517
518
519
520
521
522
{
	int i;
	int ret;
	struct ftrace_graph_ent *call = &entry->graph_ent;

	/* No overhead */
523
524
525
	ret = print_graph_overhead(-1, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
526

527
528
	/* No time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
529
530
531
532
533
		ret = trace_seq_printf(s, "            |  ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

534
	/* Function */
535
536
	for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
		ret = trace_seq_printf(s, " ");
537
538
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
539
540
541
542
543
544
	}

	ret = seq_print_ip_sym(s, call->func, 0);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

545
	ret = trace_seq_printf(s, "() {\n");
546
547
548
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

549
550
551
552
553
	/*
	 * we already consumed the current entry to check the next one
	 * and see if this is a leaf.
	 */
	return TRACE_TYPE_NO_CONSUME;
554
555
}

556
557
static enum print_line_t
print_graph_entry(struct ftrace_graph_ent_entry *field, struct trace_seq *s,
558
			struct trace_iterator *iter)
559
560
{
	int ret;
561
562
	int cpu = iter->cpu;
	pid_t *last_entry = iter->private;
563
	struct trace_entry *ent = iter->ent;
564
	struct ftrace_graph_ent *call = &field->graph_ent;
565
	struct ftrace_graph_ret_entry *leaf_ret;
566

567
	/* Pid */
568
569
570
571
	if (verif_pid(s, ent->pid, cpu, last_entry) == TRACE_TYPE_PARTIAL_LINE)
		return TRACE_TYPE_PARTIAL_LINE;

	/* Interrupt */
572
	ret = print_graph_irq(iter, call->func, TRACE_GRAPH_ENT, cpu, ent->pid);
573
	if (ret == TRACE_TYPE_PARTIAL_LINE)
574
575
		return TRACE_TYPE_PARTIAL_LINE;

576
577
578
579
580
581
582
	/* Absolute time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
		ret = print_graph_abs_time(iter->ts, s);
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

583
584
585
	/* Cpu */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
		ret = print_graph_cpu(s, cpu);
586
587
588
589
590
591
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	/* Proc */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
592
		ret = print_graph_proc(s, ent->pid);
593
594
595
596
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;

		ret = trace_seq_printf(s, " | ");
597
598
599
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
600

601
602
603
	leaf_ret = get_return_for_leaf(iter, field);
	if (leaf_ret)
		return print_graph_entry_leaf(iter, field, leaf_ret, s);
604
	else
605
		return print_graph_entry_nested(field, s, iter->ent->pid, cpu);
606
607
608

}

609
610
static enum print_line_t
print_graph_return(struct ftrace_graph_ret *trace, struct trace_seq *s,
611
		   struct trace_entry *ent, struct trace_iterator *iter)
612
613
614
{
	int i;
	int ret;
615
	int cpu = iter->cpu;
616
	pid_t *last_pid = iter->private, pid = ent->pid;
617
	unsigned long long duration = trace->rettime - trace->calltime;
618

619
	/* Pid */
620
	if (verif_pid(s, pid, cpu, last_pid) == TRACE_TYPE_PARTIAL_LINE)
621
622
		return TRACE_TYPE_PARTIAL_LINE;

623
624
625
626
627
628
629
	/* Absolute time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
		ret = print_graph_abs_time(iter->ts, s);
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

630
	/* Cpu */
631
632
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
		ret = print_graph_cpu(s, cpu);
633
634
635
636
637
638
639
640
641
642
643
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	/* Proc */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
		ret = print_graph_proc(s, ent->pid);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;

		ret = trace_seq_printf(s, " | ");
644
645
646
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
647

648
	/* Overhead */
649
650
651
	ret = print_graph_overhead(duration, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
652
653

	/* Duration */
654
655
656
657
658
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
		ret = print_graph_duration(duration, s);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}
659
660

	/* Closing brace */
661
662
	for (i = 0; i < trace->depth * TRACE_GRAPH_INDENT; i++) {
		ret = trace_seq_printf(s, " ");
663
664
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
665
666
	}

667
	ret = trace_seq_printf(s, "}\n");
668
669
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
670

671
	/* Overrun */
672
673
674
	if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERRUN) {
		ret = trace_seq_printf(s, " (Overruns: %lu)\n",
					trace->overrun);
675
676
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
677
	}
678

679
	ret = print_graph_irq(iter, trace->func, TRACE_GRAPH_RET, cpu, pid);
680
681
682
	if (ret == TRACE_TYPE_PARTIAL_LINE)
		return TRACE_TYPE_PARTIAL_LINE;

683
684
685
	return TRACE_TYPE_HANDLED;
}

686
static enum print_line_t
687
print_graph_comment(struct bprint_entry *trace, struct trace_seq *s,
688
689
690
691
		   struct trace_entry *ent, struct trace_iterator *iter)
{
	int i;
	int ret;
692
693
694
	int cpu = iter->cpu;
	pid_t *last_pid = iter->private;

695
696
697
698
	/* Pid */
	if (verif_pid(s, ent->pid, cpu, last_pid) == TRACE_TYPE_PARTIAL_LINE)
		return TRACE_TYPE_PARTIAL_LINE;

699
700
701
702
703
704
	/* Absolute time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
		ret = print_graph_abs_time(iter->ts, s);
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
705
706
707

	/* Cpu */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
708
		ret = print_graph_cpu(s, cpu);
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	/* Proc */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
		ret = print_graph_proc(s, ent->pid);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;

		ret = trace_seq_printf(s, " | ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	/* No overhead */
725
726
727
728
729
730
731
	ret = print_graph_overhead(-1, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	/* No time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
		ret = trace_seq_printf(s, "            |  ");
732
733
734
735
736
737
738
739
740
741
742
743
744
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	/* Indentation */
	if (trace->depth > 0)
		for (i = 0; i < (trace->depth + 1) * TRACE_GRAPH_INDENT; i++) {
			ret = trace_seq_printf(s, " ");
			if (!ret)
				return TRACE_TYPE_PARTIAL_LINE;
		}

	/* The comment */
745
746
747
748
749
	ret = trace_seq_printf(s, "/* ");
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	ret = trace_seq_bprintf(s, trace->fmt, trace->buf);
750
751
752
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

753
754
755
756
757
758
	/* Strip ending newline */
	if (s->buffer[s->len - 1] == '\n') {
		s->buffer[s->len - 1] = '\0';
		s->len--;
	}

759
760
761
762
763
764
765
766
	ret = trace_seq_printf(s, " */\n");
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	return TRACE_TYPE_HANDLED;
}


767
768
769
770
771
enum print_line_t
print_graph_function(struct trace_iterator *iter)
{
	struct trace_seq *s = &iter->seq;
	struct trace_entry *entry = iter->ent;
772

773
774
775
776
	switch (entry->type) {
	case TRACE_GRAPH_ENT: {
		struct ftrace_graph_ent_entry *field;
		trace_assign_type(field, entry);
777
		return print_graph_entry(field, s, iter);
778
779
780
781
	}
	case TRACE_GRAPH_RET: {
		struct ftrace_graph_ret_entry *field;
		trace_assign_type(field, entry);
782
		return print_graph_return(&field->ret, s, entry, iter);
783
	}
784
785
	case TRACE_BPRINT: {
		struct bprint_entry *field;
786
787
788
		trace_assign_type(field, entry);
		return print_graph_comment(field, s, entry, iter);
	}
789
790
	default:
		return TRACE_TYPE_UNHANDLED;
791
792
793
	}
}

794
795
796
797
static void print_graph_headers(struct seq_file *s)
{
	/* 1st line */
	seq_printf(s, "# ");
798
799
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
		seq_printf(s, "     TIME       ");
800
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
801
		seq_printf(s, "CPU");
802
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
803
804
805
806
		seq_printf(s, "  TASK/PID      ");
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
		seq_printf(s, "  DURATION   ");
	seq_printf(s, "               FUNCTION CALLS\n");
807
808
809

	/* 2nd line */
	seq_printf(s, "# ");
810
811
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
		seq_printf(s, "      |         ");
812
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
813
		seq_printf(s, "|  ");
814
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
815
816
817
818
		seq_printf(s, "  |    |        ");
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
		seq_printf(s, "   |   |      ");
	seq_printf(s, "               |   |   |   |\n");
819
}
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839

static void graph_trace_open(struct trace_iterator *iter)
{
	/* pid on the last trace processed */
	pid_t *last_pid = alloc_percpu(pid_t);
	int cpu;

	if (!last_pid)
		pr_warning("function graph tracer: not enough memory\n");
	else
		for_each_possible_cpu(cpu) {
			pid_t *pid = per_cpu_ptr(last_pid, cpu);
			*pid = -1;
		}

	iter->private = last_pid;
}

static void graph_trace_close(struct trace_iterator *iter)
{
840
	free_percpu(iter->private);
841
842
}

843
static struct tracer graph_trace __read_mostly = {
844
	.name		= "function_graph",
845
846
	.open		= graph_trace_open,
	.close		= graph_trace_close,
847
	.wait_pipe	= poll_wait_pipe,
848
849
	.init		= graph_trace_init,
	.reset		= graph_trace_reset,
850
851
	.print_line	= print_graph_function,
	.print_header	= print_graph_headers,
852
	.flags		= &tracer_flags,
853
854
855
#ifdef CONFIG_FTRACE_SELFTEST
	.selftest	= trace_selftest_startup_function_graph,
#endif
856
857
858
859
860
861
862
863
};

static __init int init_graph_trace(void)
{
	return register_tracer(&graph_trace);
}

device_initcall(init_graph_trace);