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 18 19 20 21
struct fgraph_data {
	pid_t		last_pid;
	int		depth;
};

22
#define TRACE_GRAPH_INDENT	2
23

24
/* Flag options */
25
#define TRACE_GRAPH_PRINT_OVERRUN	0x1
26 27
#define TRACE_GRAPH_PRINT_CPU		0x2
#define TRACE_GRAPH_PRINT_OVERHEAD	0x4
28
#define TRACE_GRAPH_PRINT_PROC		0x8
29 30
#define TRACE_GRAPH_PRINT_DURATION	0x10
#define TRACE_GRAPH_PRINT_ABS_TIME	0X20
31

32
static struct tracer_opt trace_opts[] = {
33
	/* Display overruns? (for self-debug purpose) */
34 35 36 37 38
	{ 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) },
39 40
	/* Display proc name/pid */
	{ TRACER_OPT(funcgraph-proc, TRACE_GRAPH_PRINT_PROC) },
41 42 43 44
	/* 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) },
45 46 47 48
	{ } /* Empty entry */
};

static struct tracer_flags tracer_flags = {
49
	/* Don't display overruns and proc by default */
50 51
	.val = TRACE_GRAPH_PRINT_CPU | TRACE_GRAPH_PRINT_OVERHEAD |
	       TRACE_GRAPH_PRINT_DURATION,
52 53 54
	.opts = trace_opts
};

55
/* pid on the last trace processed */
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 115 116 117 118 119
/* 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);
120
	trace.rettime = trace_clock_local();
121 122 123 124 125 126 127 128 129 130 131 132
	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;
}

133 134
static int graph_trace_init(struct trace_array *tr)
{
135
	int ret = register_ftrace_graph(&trace_graph_return,
136
					&trace_graph_entry);
137 138 139 140 141
	if (ret)
		return ret;
	tracing_start_cmdline_record();

	return 0;
142 143 144 145
}

static void graph_trace_reset(struct trace_array *tr)
{
146 147
	tracing_stop_cmdline_record();
	unregister_ftrace_graph();
148 149
}

150 151 152 153 154 155 156 157 158 159 160 161 162 163 164
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);
165
	int log10_all = log10_cpu(cpumask_weight(cpu_online_mask));
166 167


168 169 170 171 172 173 174 175 176 177 178 179 180
	/*
	 * 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:
	 */
181 182 183 184 185 186 187
	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)
188 189
		return TRACE_TYPE_PARTIAL_LINE;

190 191 192
	return TRACE_TYPE_HANDLED;
}

193 194 195 196 197
#define TRACE_GRAPH_PROCINFO_LENGTH	14

static enum print_line_t
print_graph_proc(struct trace_seq *s, pid_t pid)
{
198
	char comm[TASK_COMM_LEN];
199 200
	/* sign + log10(MAX_INT) + '\0' */
	char pid_str[11];
201 202 203 204
	int spaces = 0;
	int ret;
	int len;
	int i;
205

206
	trace_find_cmdline(pid, comm);
207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235
	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;
}

236

237
/* If the pid changed since the last trace, output this event */
238
static enum print_line_t
239
verif_pid(struct trace_seq *s, pid_t pid, int cpu, struct fgraph_data *data)
240
{
241
	pid_t prev_pid;
242
	pid_t *last_pid;
243
	int ret;
244

245
	if (!data)
246 247
		return TRACE_TYPE_HANDLED;

248
	last_pid = &(per_cpu_ptr(data, cpu)->last_pid);
249 250

	if (*last_pid == pid)
251
		return TRACE_TYPE_HANDLED;
252

253 254
	prev_pid = *last_pid;
	*last_pid = pid;
255

256 257
	if (prev_pid == -1)
		return TRACE_TYPE_HANDLED;
258 259 260 261 262 263 264 265 266
/*
 * Context-switch trace line:

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

 */
	ret = trace_seq_printf(s,
267
		" ------------------------------------------\n");
268
	if (!ret)
269
		return TRACE_TYPE_PARTIAL_LINE;
270 271 272

	ret = print_graph_cpu(s, cpu);
	if (ret == TRACE_TYPE_PARTIAL_LINE)
273
		return TRACE_TYPE_PARTIAL_LINE;
274 275 276

	ret = print_graph_proc(s, prev_pid);
	if (ret == TRACE_TYPE_PARTIAL_LINE)
277
		return TRACE_TYPE_PARTIAL_LINE;
278 279 280

	ret = trace_seq_printf(s, " => ");
	if (!ret)
281
		return TRACE_TYPE_PARTIAL_LINE;
282 283 284

	ret = print_graph_proc(s, pid);
	if (ret == TRACE_TYPE_PARTIAL_LINE)
285
		return TRACE_TYPE_PARTIAL_LINE;
286 287 288 289

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

292
	return TRACE_TYPE_HANDLED;
293 294
}

295 296
static struct ftrace_graph_ret_entry *
get_return_for_leaf(struct trace_iterator *iter,
297 298 299 300 301 302 303 304
		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];

305 306 307 308 309 310 311 312 313
	/* 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);
	}
314 315

	if (!event)
316
		return NULL;
317 318 319 320

	next = ring_buffer_event_data(event);

	if (next->ent.type != TRACE_GRAPH_RET)
321
		return NULL;
322 323 324

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

327 328 329 330 331
	/* this is a leaf, now advance the iterator */
	if (ring_iter)
		ring_buffer_read(ring_iter, NULL);

	return next;
332 333
}

334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358
/* 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, "  ");
}

359 360 361 362 363 364 365 366 367 368 369
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);
}

370
static enum print_line_t
371
print_graph_irq(struct trace_iterator *iter, unsigned long addr,
372
		enum trace_type type, int cpu, pid_t pid)
373 374
{
	int ret;
375
	struct trace_seq *s = &iter->seq;
376 377 378 379 380

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

381 382 383 384 385 386 387
	/* 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;
	}

388 389 390 391 392 393 394 395 396 397 398 399 400 401 402
	/* 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;
	}
403

404 405 406 407
	/* No overhead */
	ret = print_graph_overhead(-1, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
408

409 410 411 412 413 414 415 416 417 418 419 420
	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");
421 422 423 424 425

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

427
static enum print_line_t
428 429 430
print_graph_duration(unsigned long long duration, struct trace_seq *s)
{
	unsigned long nsecs_rem = do_div(duration, 1000);
431 432 433 434 435 436 437 438 439
	/* 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 */
440
	ret = trace_seq_printf(s, "%s", msecs_str);
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 466 467 468 469 470
	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;

471 472 473
}

/* Case of a leaf function on its call entry */
474
static enum print_line_t
475
print_graph_entry_leaf(struct trace_iterator *iter,
476 477
		struct ftrace_graph_ent_entry *entry,
		struct ftrace_graph_ret_entry *ret_entry, struct trace_seq *s)
478
{
479
	struct fgraph_data *data = iter->private;
480 481 482
	struct ftrace_graph_ret *graph_ret;
	struct ftrace_graph_ent *call;
	unsigned long long duration;
483
	int ret;
484
	int i;
485

486 487 488 489
	graph_ret = &ret_entry->ret;
	call = &entry->graph_ent;
	duration = graph_ret->rettime - graph_ret->calltime;

490 491 492 493 494 495 496 497 498 499 500 501
	if (data) {
		int cpu = iter->cpu;
		int *depth = &(per_cpu_ptr(data, cpu)->depth);

		/*
		 * Comments display at + 1 to depth. Since
		 * this is a leaf function, keep the comments
		 * equal to this depth.
		 */
		*depth = call->depth - 1;
	}

502
	/* Overhead */
503 504 505
	ret = print_graph_overhead(duration, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
506 507

	/* Duration */
508 509 510 511 512
	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;
	}
513

514 515 516 517 518 519 520 521 522 523 524
	/* 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;

525
	ret = trace_seq_printf(s, "();\n");
526 527 528 529 530 531 532
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	return TRACE_TYPE_HANDLED;
}

static enum print_line_t
533 534 535
print_graph_entry_nested(struct trace_iterator *iter,
			 struct ftrace_graph_ent_entry *entry,
			 struct trace_seq *s, int cpu)
536 537
{
	struct ftrace_graph_ent *call = &entry->graph_ent;
538 539 540 541 542 543 544 545 546 547
	struct fgraph_data *data = iter->private;
	int ret;
	int i;

	if (data) {
		int cpu = iter->cpu;
		int *depth = &(per_cpu_ptr(data, cpu)->depth);

		*depth = call->depth;
	}
548 549

	/* No overhead */
550 551 552
	ret = print_graph_overhead(-1, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
553

554 555
	/* No time */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
556 557 558 559 560
		ret = trace_seq_printf(s, "            |  ");
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

561
	/* Function */
562 563
	for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
		ret = trace_seq_printf(s, " ");
564 565
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
566 567 568 569 570 571
	}

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

572
	ret = trace_seq_printf(s, "() {\n");
573 574 575
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

576 577 578 579 580
	/*
	 * we already consumed the current entry to check the next one
	 * and see if this is a leaf.
	 */
	return TRACE_TYPE_NO_CONSUME;
581 582
}

583
static enum print_line_t
584 585
print_graph_prologue(struct trace_iterator *iter, struct trace_seq *s,
		     int type, unsigned long addr)
586
{
587
	struct fgraph_data *data = iter->private;
588
	struct trace_entry *ent = iter->ent;
589 590
	int cpu = iter->cpu;
	int ret;
591

592
	/* Pid */
593
	if (verif_pid(s, ent->pid, cpu, data) == TRACE_TYPE_PARTIAL_LINE)
594 595
		return TRACE_TYPE_PARTIAL_LINE;

596 597 598 599 600 601
	if (type) {
		/* Interrupt */
		ret = print_graph_irq(iter, addr, type, cpu, ent->pid);
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}
602

603 604 605 606 607 608 609
	/* 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;
	}

610 611 612
	/* Cpu */
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
		ret = print_graph_cpu(s, cpu);
613 614 615 616 617 618
		if (ret == TRACE_TYPE_PARTIAL_LINE)
			return TRACE_TYPE_PARTIAL_LINE;
	}

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

		ret = trace_seq_printf(s, " | ");
624 625 626
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}
627

628 629 630 631 632 633 634 635 636 637 638 639 640 641
	return 0;
}

static enum print_line_t
print_graph_entry(struct ftrace_graph_ent_entry *field, struct trace_seq *s,
			struct trace_iterator *iter)
{
	int cpu = iter->cpu;
	struct ftrace_graph_ent *call = &field->graph_ent;
	struct ftrace_graph_ret_entry *leaf_ret;

	if (print_graph_prologue(iter, s, TRACE_GRAPH_ENT, call->func))
		return TRACE_TYPE_PARTIAL_LINE;

642 643 644
	leaf_ret = get_return_for_leaf(iter, field);
	if (leaf_ret)
		return print_graph_entry_leaf(iter, field, leaf_ret, s);
645
	else
646
		return print_graph_entry_nested(iter, field, s, cpu);
647 648 649

}

650 651
static enum print_line_t
print_graph_return(struct ftrace_graph_ret *trace, struct trace_seq *s,
652
		   struct trace_entry *ent, struct trace_iterator *iter)
653
{
654
	unsigned long long duration = trace->rettime - trace->calltime;
655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671
	struct fgraph_data *data = iter->private;
	pid_t pid = ent->pid;
	int cpu = iter->cpu;
	int ret;
	int i;

	if (data) {
		int cpu = iter->cpu;
		int *depth = &(per_cpu_ptr(data, cpu)->depth);

		/*
		 * Comments display at + 1 to depth. This is the
		 * return from a function, we now want the comments
		 * to display at the same level of the bracket.
		 */
		*depth = trace->depth - 1;
	}
672

673
	if (print_graph_prologue(iter, s, 0, 0))
674 675
		return TRACE_TYPE_PARTIAL_LINE;

676
	/* Overhead */
677 678 679
	ret = print_graph_overhead(duration, s);
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
680 681

	/* Duration */
682 683 684 685 686
	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;
	}
687 688

	/* Closing brace */
689 690
	for (i = 0; i < trace->depth * TRACE_GRAPH_INDENT; i++) {
		ret = trace_seq_printf(s, " ");
691 692
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
693 694
	}

695
	ret = trace_seq_printf(s, "}\n");
696 697
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;
698

699
	/* Overrun */
700 701 702
	if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERRUN) {
		ret = trace_seq_printf(s, " (Overruns: %lu)\n",
					trace->overrun);
703 704
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
705
	}
706

707
	ret = print_graph_irq(iter, trace->func, TRACE_GRAPH_RET, cpu, pid);
708 709 710
	if (ret == TRACE_TYPE_PARTIAL_LINE)
		return TRACE_TYPE_PARTIAL_LINE;

711 712 713
	return TRACE_TYPE_HANDLED;
}

714
static enum print_line_t
715
print_graph_comment(struct bprint_entry *trace, struct trace_seq *s,
716 717
		   struct trace_entry *ent, struct trace_iterator *iter)
{
718 719
	struct fgraph_data *data = iter->private;
	int depth = 0;
720
	int ret;
721 722 723 724
	int i;

	if (data)
		depth = per_cpu_ptr(data, iter->cpu)->depth;
725

726
	if (print_graph_prologue(iter, s, 0, 0))
727 728
		return TRACE_TYPE_PARTIAL_LINE;

729
	/* No overhead */
730 731 732 733 734 735 736
	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, "            |  ");
737 738 739 740 741
		if (!ret)
			return TRACE_TYPE_PARTIAL_LINE;
	}

	/* Indentation */
742 743
	if (depth > 0)
		for (i = 0; i < (depth + 1) * TRACE_GRAPH_INDENT; i++) {
744 745 746 747 748 749
			ret = trace_seq_printf(s, " ");
			if (!ret)
				return TRACE_TYPE_PARTIAL_LINE;
		}

	/* The comment */
750 751 752 753 754
	ret = trace_seq_printf(s, "/* ");
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	ret = trace_seq_bprintf(s, trace->fmt, trace->buf);
755 756 757
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

758 759 760 761 762 763
	/* Strip ending newline */
	if (s->buffer[s->len - 1] == '\n') {
		s->buffer[s->len - 1] = '\0';
		s->len--;
	}

764 765 766 767 768 769 770 771
	ret = trace_seq_printf(s, " */\n");
	if (!ret)
		return TRACE_TYPE_PARTIAL_LINE;

	return TRACE_TYPE_HANDLED;
}


772 773 774 775 776
enum print_line_t
print_graph_function(struct trace_iterator *iter)
{
	struct trace_seq *s = &iter->seq;
	struct trace_entry *entry = iter->ent;
777

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

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

	/* 2nd line */
	seq_printf(s, "# ");
815 816
	if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
		seq_printf(s, "      |         ");
817
	if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
818
		seq_printf(s, "|  ");
819
	if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
820 821 822 823
		seq_printf(s, "  |    |        ");
	if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
		seq_printf(s, "   |   |      ");
	seq_printf(s, "               |   |   |   |\n");
824
}
825 826 827

static void graph_trace_open(struct trace_iterator *iter)
{
828 829
	/* pid and depth on the last trace processed */
	struct fgraph_data *data = alloc_percpu(struct fgraph_data);
830 831
	int cpu;

832
	if (!data)
833 834 835
		pr_warning("function graph tracer: not enough memory\n");
	else
		for_each_possible_cpu(cpu) {
836 837
			pid_t *pid = &(per_cpu_ptr(data, cpu)->last_pid);
			int *depth = &(per_cpu_ptr(data, cpu)->depth);
838
			*pid = -1;
839
			*depth = 0;
840 841
		}

842
	iter->private = data;
843 844 845 846
}

static void graph_trace_close(struct trace_iterator *iter)
{
847
	free_percpu(iter->private);
848 849
}

850
static struct tracer graph_trace __read_mostly = {
851
	.name		= "function_graph",
852 853
	.open		= graph_trace_open,
	.close		= graph_trace_close,
854
	.wait_pipe	= poll_wait_pipe,
855 856
	.init		= graph_trace_init,
	.reset		= graph_trace_reset,
857 858
	.print_line	= print_graph_function,
	.print_header	= print_graph_headers,
859
	.flags		= &tracer_flags,
860 861 862
#ifdef CONFIG_FTRACE_SELFTEST
	.selftest	= trace_selftest_startup_function_graph,
#endif
863 864 865 866 867 868 869 870
};

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

device_initcall(init_graph_trace);