builtin-report.c 26.1 KB
Newer Older
1 2 3 4 5 6 7
/*
 * builtin-report.c
 *
 * Builtin report command: Analyze the perf.data input file,
 * look up and read DSOs and symbol information and display
 * a histogram of results, along various sorting keys.
 */
8
#include "builtin.h"
9

10 11
#include "util/util.h"

12
#include "util/color.h"
13
#include <linux/list.h>
14
#include "util/cache.h"
15
#include <linux/rbtree.h>
16
#include "util/symbol.h"
17
#include "util/string.h"
18
#include "util/callchain.h"
19
#include "util/strlist.h"
20
#include "util/values.h"
21

22
#include "perf.h"
23
#include "util/debug.h"
24
#include "util/header.h"
25 26 27 28

#include "util/parse-options.h"
#include "util/parse-events.h"

29
#include "util/data_map.h"
30
#include "util/thread.h"
31
#include "util/sort.h"
32
#include "util/hist.h"
33

34
static char		const *input_name = "perf.data";
35

36 37
static char		*dso_list_str, *comm_list_str, *sym_list_str,
			*col_width_list_str;
38
static struct strlist	*dso_list, *comm_list, *sym_list;
39

40
static int		force;
41

42
static int		full_paths;
43
static int		show_nr_samples;
44

45 46 47
static int		show_threads;
static struct perf_read_values	show_threads_values;

48 49 50
static char		default_pretty_printing_style[] = "normal";
static char		*pretty_printing_style = default_pretty_printing_style;

51
static int		exclude_other = 1;
52

53 54
static char		callchain_default_opt[] = "fractal,0.5";

55
static char		*cwd;
56 57
static int		cwdlen;

58 59
static struct perf_header *header;

60 61
static u64		sample_type;

62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78

static size_t
callchain__fprintf_left_margin(FILE *fp, int left_margin)
{
	int i;
	int ret;

	ret = fprintf(fp, "            ");

	for (i = 0; i < left_margin; i++)
		ret += fprintf(fp, " ");

	return ret;
}

static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
					  int left_margin)
79 80 81 82
{
	int i;
	size_t ret = 0;

83
	ret += callchain__fprintf_left_margin(fp, left_margin);
84 85 86 87 88 89 90 91 92 93 94

	for (i = 0; i < depth; i++)
		if (depth_mask & (1 << i))
			ret += fprintf(fp, "|          ");
		else
			ret += fprintf(fp, "           ");

	ret += fprintf(fp, "\n");

	return ret;
}
95
static size_t
96 97
ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain, int depth,
		       int depth_mask, int count, u64 total_samples,
98
		       int hits, int left_margin)
99 100 101 102
{
	int i;
	size_t ret = 0;

103
	ret += callchain__fprintf_left_margin(fp, left_margin);
104 105 106 107 108 109 110 111 112
	for (i = 0; i < depth; i++) {
		if (depth_mask & (1 << i))
			ret += fprintf(fp, "|");
		else
			ret += fprintf(fp, " ");
		if (!count && i == depth - 1) {
			double percent;

			percent = hits * 100.0 / total_samples;
113
			ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
114 115 116 117 118 119 120 121 122 123 124
		} else
			ret += fprintf(fp, "%s", "          ");
	}
	if (chain->sym)
		ret += fprintf(fp, "%s\n", chain->sym->name);
	else
		ret += fprintf(fp, "%p\n", (void *)(long)chain->ip);

	return ret;
}

125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
static struct symbol *rem_sq_bracket;
static struct callchain_list rem_hits;

static void init_rem_hits(void)
{
	rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
	if (!rem_sq_bracket) {
		fprintf(stderr, "Not enough memory to display remaining hits\n");
		return;
	}

	strcpy(rem_sq_bracket->name, "[...]");
	rem_hits.sym = rem_sq_bracket;
}

140
static size_t
141
__callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
142 143
			   u64 total_samples, int depth, int depth_mask,
			   int left_margin)
144 145 146 147 148
{
	struct rb_node *node, *next;
	struct callchain_node *child;
	struct callchain_list *chain;
	int new_depth_mask = depth_mask;
149
	u64 new_total;
150
	u64 remaining;
151 152 153
	size_t ret = 0;
	int i;

154
	if (callchain_param.mode == CHAIN_GRAPH_REL)
155
		new_total = self->children_hit;
156 157 158
	else
		new_total = total_samples;

159 160
	remaining = new_total;

161 162
	node = rb_first(&self->rb_root);
	while (node) {
163 164
		u64 cumul;

165
		child = rb_entry(node, struct callchain_node, rb_node);
166 167
		cumul = cumul_hits(child);
		remaining -= cumul;
168 169 170 171

		/*
		 * The depth mask manages the output of pipes that show
		 * the depth. We don't want to keep the pipes of the current
172 173 174
		 * level for the last child of this depth.
		 * Except if we have remaining filtered hits. They will
		 * supersede the last child
175 176
		 */
		next = rb_next(node);
177
		if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
178 179 180 181 182 183
			new_depth_mask &= ~(1 << (depth - 1));

		/*
		 * But we keep the older depth mask for the line seperator
		 * to keep the level link until we reach the last child
		 */
184 185
		ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
						   left_margin);
186 187 188 189 190 191
		i = 0;
		list_for_each_entry(chain, &child->val, list) {
			if (chain->ip >= PERF_CONTEXT_MAX)
				continue;
			ret += ipchain__fprintf_graph(fp, chain, depth,
						      new_depth_mask, i++,
192
						      new_total,
193 194
						      cumul,
						      left_margin);
195
		}
196 197
		ret += __callchain__fprintf_graph(fp, child, new_total,
						  depth + 1,
198 199
						  new_depth_mask | (1 << depth),
						  left_margin);
200 201 202
		node = next;
	}

203 204 205 206 207 208 209 210 211 212
	if (callchain_param.mode == CHAIN_GRAPH_REL &&
		remaining && remaining != new_total) {

		if (!rem_sq_bracket)
			return ret;

		new_depth_mask &= ~(1 << (depth - 1));

		ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
					      new_depth_mask, 0, new_total,
213
					      remaining, left_margin);
214 215
	}

216 217 218
	return ret;
}

219

220 221
static size_t
callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
222
			 u64 total_samples, int left_margin)
223 224
{
	struct callchain_list *chain;
225
	bool printed = false;
226 227 228 229 230 231 232
	int i = 0;
	int ret = 0;

	list_for_each_entry(chain, &self->val, list) {
		if (chain->ip >= PERF_CONTEXT_MAX)
			continue;

233
		if (!i++ && sort__first_dimension == SORT_SYM)
234 235
			continue;

236 237 238 239 240 241 242 243 244 245 246
		if (!printed) {
			ret += callchain__fprintf_left_margin(fp, left_margin);
			ret += fprintf(fp, "|\n");
			ret += callchain__fprintf_left_margin(fp, left_margin);
			ret += fprintf(fp, "---");

			left_margin += 3;
			printed = true;
		} else
			ret += callchain__fprintf_left_margin(fp, left_margin);

247
		if (chain->sym)
248
			ret += fprintf(fp, " %s\n", chain->sym->name);
249
		else
250
			ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
251 252
	}

253
	ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1, left_margin);
254 255 256 257

	return ret;
}

258 259 260
static size_t
callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
			u64 total_samples)
261 262 263 264 265 266 267
{
	struct callchain_list *chain;
	size_t ret = 0;

	if (!self)
		return 0;

268
	ret += callchain__fprintf_flat(fp, self->parent, total_samples);
269 270


271 272 273 274 275 276 277
	list_for_each_entry(chain, &self->val, list) {
		if (chain->ip >= PERF_CONTEXT_MAX)
			continue;
		if (chain->sym)
			ret += fprintf(fp, "                %s\n", chain->sym->name);
		else
			ret += fprintf(fp, "                %p\n",
278
					(void *)(long)chain->ip);
279
	}
280 281 282 283 284 285

	return ret;
}

static size_t
hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
286
			      u64 total_samples, int left_margin)
287 288 289 290 291 292 293 294 295 296 297
{
	struct rb_node *rb_node;
	struct callchain_node *chain;
	size_t ret = 0;

	rb_node = rb_first(&self->sorted_chain);
	while (rb_node) {
		double percent;

		chain = rb_entry(rb_node, struct callchain_node, rb_node);
		percent = chain->hit * 100.0 / total_samples;
298 299
		switch (callchain_param.mode) {
		case CHAIN_FLAT:
300 301
			ret += percent_color_fprintf(fp, "           %6.2f%%\n",
						     percent);
302
			ret += callchain__fprintf_flat(fp, chain, total_samples);
303 304 305
			break;
		case CHAIN_GRAPH_ABS: /* Falldown */
		case CHAIN_GRAPH_REL:
306 307
			ret += callchain__fprintf_graph(fp, chain, total_samples,
							left_margin);
308
		case CHAIN_NONE:
309 310
		default:
			break;
311
		}
312 313 314 315 316 317 318
		ret += fprintf(fp, "\n");
		rb_node = rb_next(rb_node);
	}

	return ret;
}

319
static size_t
320
hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
321 322 323 324
{
	struct sort_entry *se;
	size_t ret;

325 326 327
	if (exclude_other && !self->parent)
		return 0;

328
	if (total_samples)
329 330 331
		ret = percent_color_fprintf(fp,
					    field_sep ? "%.2f" : "   %6.2f%%",
					(self->count * 100.0) / total_samples);
332
	else
333
		ret = fprintf(fp, field_sep ? "%lld" : "%12lld ", self->count);
334

335 336 337 338 339 340
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%c%lld", *field_sep, self->count);
		else
			fprintf(fp, "%11lld", self->count);
	}
341

342
	list_for_each_entry(se, &hist_entry__sort_list, list) {
343
		if (se->elide)
344 345
			continue;

346 347
		fprintf(fp, "%s", field_sep ?: "  ");
		ret += se->print(fp, self, se->width ? *se->width : 0);
348
	}
349 350 351

	ret += fprintf(fp, "\n");

352 353 354 355 356 357 358 359 360 361 362 363 364
	if (callchain) {
		int left_margin = 0;

		if (sort__first_dimension == SORT_COMM) {
			se = list_first_entry(&hist_entry__sort_list, typeof(*se),
						list);
			left_margin = se->width ? *se->width : 0;
			left_margin -= thread__comm_len(self->thread);
		}

		hist_entry_callchain__fprintf(fp, self, total_samples,
					      left_margin);
	}
365

366 367 368
	return ret;
}

369 370 371 372
/*
 *
 */

373 374 375 376 377 378 379 380 381 382 383 384
static void dso__calc_col_width(struct dso *self)
{
	if (!col_width_list_str && !field_sep &&
	    (!dso_list || strlist__has_entry(dso_list, self->name))) {
		unsigned int slen = strlen(self->name);
		if (slen > dsos__col_width)
			dsos__col_width = slen;
	}

	self->slen_calculated = 1;
}

385
static void thread__comm_adjust(struct thread *self)
386
{
387
	char *comm = self->comm;
388 389 390 391 392 393 394 395 396 397

	if (!col_width_list_str && !field_sep &&
	    (!comm_list || strlist__has_entry(comm_list, comm))) {
		unsigned int slen = strlen(comm);

		if (slen > comms__col_width) {
			comms__col_width = slen;
			threads__col_width = slen + 6;
		}
	}
398 399 400 401 402 403 404 405 406 407
}

static int thread__set_comm_adjust(struct thread *self, const char *comm)
{
	int ret = thread__set_comm(self, comm);

	if (ret)
		return ret;

	thread__comm_adjust(self);
408 409 410 411 412

	return 0;
}


413
static struct symbol *
414
resolve_symbol(struct thread *thread, struct map **mapp, u64 *ipp)
415 416
{
	struct map *map = mapp ? *mapp : NULL;
417
	u64 ip = *ipp;
418 419 420 421

	if (map)
		goto got_map;

422 423 424
	if (!thread)
		return NULL;

425 426
	map = thread__find_map(thread, ip);
	if (map != NULL) {
427 428 429 430 431
		/*
		 * We have to do this here as we may have a dso
		 * with no symbol hit that has a name longer than
		 * the ones with symbols sampled.
		 */
432
		if (!sort_dso.elide && !map->dso->slen_calculated)
433 434
			dso__calc_col_width(map->dso);

435 436 437 438 439 440 441 442 443
		if (mapp)
			*mapp = map;
got_map:
		ip = map->map_ip(map, ip);
	} else {
		/*
		 * If this is outside of all known maps,
		 * and is a negative address, try to look it
		 * up in the kernel dso, as it might be a
444 445 446 447 448
		 * vsyscall or vdso (which executes in user-mode).
		 *
		 * XXX This is nasty, we should have a symbol list in
		 * the "[vdso]" dso, but for now lets use the old
		 * trick of looking in the whole kernel symbol list.
449
		 */
450 451
		if ((long long)ip < 0)
			return kernel_maps__find_symbol(ip, mapp);
452
	}
453 454
	dump_printf(" ...... dso: %s\n",
		    map ? map->dso->long_name : "<not found>");
455
	dump_printf(" ...... map: %Lx -> %Lx\n", *ipp, ip);
456
	*ipp  = ip;
457

458
	return map ? map->dso->find_symbol(map->dso, ip) : NULL;
459 460
}

461
static int call__match(struct symbol *sym)
462
{
463
	if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0))
464
		return 1;
465

466
	return 0;
467 468
}

469 470 471
static struct symbol **resolve_callchain(struct thread *thread, struct map *map,
					 struct ip_callchain *chain,
					 struct symbol **parent)
472 473
{
	u64 context = PERF_CONTEXT_MAX;
474
	struct symbol **syms = NULL;
475
	unsigned int i;
476 477 478 479 480 481 482 483 484 485 486

	if (callchain) {
		syms = calloc(chain->nr, sizeof(*syms));
		if (!syms) {
			fprintf(stderr, "Can't allocate memory for symbols\n");
			exit(-1);
		}
	}

	for (i = 0; i < chain->nr; i++) {
		u64 ip = chain->ips[i];
487
		struct symbol *sym = NULL;
488 489 490 491 492 493 494

		if (ip >= PERF_CONTEXT_MAX) {
			context = ip;
			continue;
		}

		switch (context) {
I
Ingo Molnar 已提交
495 496
		case PERF_CONTEXT_HV:
			break;
497
		case PERF_CONTEXT_KERNEL:
498
			sym = kernel_maps__find_symbol(ip, &map);
499 500
			break;
		default:
501
			sym = resolve_symbol(thread, &map, &ip);
502 503 504 505
			break;
		}

		if (sym) {
506 507
			if (sort__has_parent && !*parent && call__match(sym))
				*parent = sym;
508 509 510 511 512 513 514 515 516
			if (!callchain)
				break;
			syms[i] = sym;
		}
	}

	return syms;
}

517 518 519 520
/*
 * collect histogram counts
 */

521
static int
522
hist_entry__add(struct thread *thread, struct map *map,
523 524
		struct symbol *sym, u64 ip, struct ip_callchain *chain,
		char level, u64 count)
525
{
526 527
	struct symbol **syms = NULL, *parent = NULL;
	bool hit;
528 529
	struct hist_entry *he;

530
	if ((sort__has_parent || callchain) && chain)
531
		syms = resolve_callchain(thread, map, chain, &parent);
532

533 534 535 536
	he = __hist_entry__add(thread, map, sym, parent,
			       ip, count, level, &hit);
	if (he == NULL)
		return -ENOMEM;
537

538 539
	if (hit)
		he->count += count;
540

541
	if (callchain) {
542 543
		if (!hit)
			callchain_init(&he->callchain);
544 545
		append_chain(&he->callchain, chain, syms);
		free(syms);
546
	}
547 548

	return 0;
549 550
}

551
static size_t output__fprintf(FILE *fp, u64 total_samples)
552
{
553
	struct hist_entry *pos;
554
	struct sort_entry *se;
555 556
	struct rb_node *nd;
	size_t ret = 0;
557 558
	unsigned int width;
	char *col_width = col_width_list_str;
559 560 561
	int raw_printing_style;

	raw_printing_style = !strcmp(pretty_printing_style, "raw");
562

563 564
	init_rem_hits();

565
	fprintf(fp, "# Samples: %Ld\n", (u64)total_samples);
566 567 568
	fprintf(fp, "#\n");

	fprintf(fp, "# Overhead");
569 570 571 572 573 574
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%cSamples", *field_sep);
		else
			fputs("  Samples  ", fp);
	}
575
	list_for_each_entry(se, &hist_entry__sort_list, list) {
576
		if (se->elide)
577
			continue;
578 579
		if (field_sep) {
			fprintf(fp, "%c%s", *field_sep, se->header);
580
			continue;
581 582 583 584 585 586 587 588 589 590 591 592 593 594
		}
		width = strlen(se->header);
		if (se->width) {
			if (col_width_list_str) {
				if (col_width) {
					*se->width = atoi(col_width);
					col_width = strchr(col_width, ',');
					if (col_width)
						++col_width;
				}
			}
			width = *se->width = max(*se->width, width);
		}
		fprintf(fp, "  %*s", width, se->header);
595
	}
596 597
	fprintf(fp, "\n");

598 599 600
	if (field_sep)
		goto print_entries;

601
	fprintf(fp, "# ........");
602 603
	if (show_nr_samples)
		fprintf(fp, " ..........");
604
	list_for_each_entry(se, &hist_entry__sort_list, list) {
605
		unsigned int i;
606

607
		if (se->elide)
608 609
			continue;

610
		fprintf(fp, "  ");
611 612 613 614 615
		if (se->width)
			width = *se->width;
		else
			width = strlen(se->header);
		for (i = 0; i < width; i++)
616
			fprintf(fp, ".");
617
	}
618 619 620
	fprintf(fp, "\n");

	fprintf(fp, "#\n");
621

622
print_entries:
623 624 625
	for (nd = rb_first(&output_hists); nd; nd = rb_next(nd)) {
		pos = rb_entry(nd, struct hist_entry, rb_node);
		ret += hist_entry__fprintf(fp, pos, total_samples);
626 627
	}

628 629
	if (sort_order == default_sort_order &&
			parent_pattern == default_parent_pattern) {
630
		fprintf(fp, "#\n");
631
		fprintf(fp, "# (For a higher level overview, try: perf report --sort comm,dso)\n");
632 633
		fprintf(fp, "#\n");
	}
634
	fprintf(fp, "\n");
635

636 637
	free(rem_sq_bracket);

638
	if (show_threads)
639 640
		perf_read_values_display(fp, &show_threads_values,
					 raw_printing_style);
641

642 643 644
	return ret;
}

645
static int validate_chain(struct ip_callchain *chain, event_t *event)
646 647 648 649 650 651
{
	unsigned int chain_size;

	chain_size = event->header.size;
	chain_size -= (unsigned long)&event->ip.__more_data - (unsigned long)event;

652
	if (chain->nr*sizeof(u64) > chain_size)
653 654 655 656 657
		return -1;

	return 0;
}

658
static int
659
process_sample_event(event_t *event, unsigned long offset, unsigned long head)
660 661
{
	char level;
662
	struct symbol *sym = NULL;
663 664
	u64 ip = event->ip.ip;
	u64 period = 1;
665
	struct map *map = NULL;
666
	void *more_data = event->ip.__more_data;
667
	struct ip_callchain *chain = NULL;
668
	int cpumode;
669
	struct thread *thread = threads__findnew(event->ip.pid);
670

671
	if (sample_type & PERF_SAMPLE_PERIOD) {
672 673
		period = *(u64 *)more_data;
		more_data += sizeof(u64);
674
	}
675

676
	dump_printf("%p [%p]: PERF_RECORD_SAMPLE (IP, %d): %d/%d: %p period: %Ld\n",
677 678 679
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->header.misc,
680
		event->ip.pid, event->ip.tid,
681
		(void *)(long)ip,
682
		(long long)period);
683

684
	if (sample_type & PERF_SAMPLE_CALLCHAIN) {
685
		unsigned int i;
686 687 688

		chain = (void *)more_data;

689
		dump_printf("... chain: nr:%Lu\n", chain->nr);
690

691 692 693 694 695 696
		if (validate_chain(chain, event) < 0) {
			eprintf("call-chain problem with event, skipping it.\n");
			return 0;
		}

		if (dump_trace) {
697
			for (i = 0; i < chain->nr; i++)
698
				dump_printf("..... %2d: %016Lx\n", i, chain->ips[i]);
699 700 701
		}
	}

702
	if (thread == NULL) {
703
		eprintf("problem processing %d event, skipping it.\n",
704 705 706
			event->header.type);
		return -1;
	}
707

708 709
	dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);

710 711 712
	if (comm_list && !strlist__has_entry(comm_list, thread->comm))
		return 0;

713
	cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK;
714

715
	if (cpumode == PERF_RECORD_MISC_KERNEL) {
716
		level = 'k';
717 718 719
		sym = kernel_maps__find_symbol(ip, &map);
		dump_printf(" ...... dso: %s\n",
			    map ? map->dso->long_name : "<not found>");
720
	} else if (cpumode == PERF_RECORD_MISC_USER) {
721
		level = '.';
722
		sym = resolve_symbol(thread, &map, &ip);
723

724 725
	} else {
		level = 'H';
726
		dump_printf(" ...... dso: [hypervisor]\n");
727
	}
728

729 730 731 732 733 734
	if (dso_list &&
	    (!map || !map->dso ||
	     !(strlist__has_entry(dso_list, map->dso->short_name) ||
	       (map->dso->short_name != map->dso->long_name &&
		strlist__has_entry(dso_list, map->dso->long_name)))))
		return 0;
735

736 737
	if (sym_list && sym && !strlist__has_entry(sym_list, sym->name))
		return 0;
738

739 740 741 742
	if (hist_entry__add(thread, map, sym, ip,
			    chain, level, period)) {
		eprintf("problem incrementing symbol count, skipping event\n");
		return -1;
743
	}
744

745
	total += period;
746

747 748
	return 0;
}
I
Ingo Molnar 已提交
749

750 751 752
static int
process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
{
753
	struct map *map = map__new(&event->mmap, cwd, cwdlen, 0, NULL, verbose);
754
	struct thread *thread = threads__findnew(event->mmap.pid);
755

756
	dump_printf("%p [%p]: PERF_RECORD_MMAP %d/%d: [%p(%p) @ %p]: %s\n",
757 758
		(void *)(offset + head),
		(void *)(long)(event->header.size),
759
		event->mmap.pid,
760
		event->mmap.tid,
761 762 763 764 765 766
		(void *)(long)event->mmap.start,
		(void *)(long)event->mmap.len,
		(void *)(long)event->mmap.pgoff,
		event->mmap.filename);

	if (thread == NULL || map == NULL) {
767
		dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n");
768
		return 0;
769 770 771 772 773 774 775 776 777 778 779
	}

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

static int
process_comm_event(event_t *event, unsigned long offset, unsigned long head)
{
780
	struct thread *thread = threads__findnew(event->comm.pid);
781

782
	dump_printf("%p [%p]: PERF_RECORD_COMM: %s:%d\n",
783 784 785 786 787
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->comm.comm, event->comm.pid);

	if (thread == NULL ||
788
	    thread__set_comm_adjust(thread, event->comm.comm)) {
789
		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
790
		return -1;
791
	}
792 793 794 795 796
	total_comm++;

	return 0;
}

797
static int
798
process_task_event(event_t *event, unsigned long offset, unsigned long head)
799
{
800 801
	struct thread *thread = threads__findnew(event->fork.pid);
	struct thread *parent = threads__findnew(event->fork.ppid);
802

803
	dump_printf("%p [%p]: PERF_RECORD_%s: (%d:%d):(%d:%d)\n",
804 805
		(void *)(offset + head),
		(void *)(long)(event->header.size),
806
		event->header.type == PERF_RECORD_FORK ? "FORK" : "EXIT",
807 808 809 810 811 812 813 814 815 816
		event->fork.pid, event->fork.tid,
		event->fork.ppid, event->fork.ptid);

	/*
	 * A thread clone will have the same PID for both
	 * parent and child.
	 */
	if (thread == parent)
		return 0;

817
	if (event->header.type == PERF_RECORD_EXIT)
818
		return 0;
819 820

	if (!thread || !parent || thread__fork(thread, parent)) {
821
		dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n");
822 823 824 825 826 827 828
		return -1;
	}
	total_fork++;

	return 0;
}

829 830 831
static int
process_lost_event(event_t *event, unsigned long offset, unsigned long head)
{
832
	dump_printf("%p [%p]: PERF_RECORD_LOST: id:%Ld: lost:%Ld\n",
833 834 835 836 837 838 839 840 841 842
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->lost.id,
		event->lost.lost);

	total_lost += event->lost.lost;

	return 0;
}

843 844 845
static int
process_read_event(event_t *event, unsigned long offset, unsigned long head)
{
846
	struct perf_event_attr *attr;
847 848

	attr = perf_header__find_attr(event->read.id, header);
849

850
	if (show_threads) {
851
		const char *name = attr ? __event_name(attr->type, attr->config)
852 853 854 855 856 857 858 859
				   : "unknown";
		perf_read_values_add_value(&show_threads_values,
					   event->read.pid, event->read.tid,
					   event->read.id,
					   name,
					   event->read.value);
	}

860
	dump_printf("%p [%p]: PERF_RECORD_READ: %d %d %s %Lu\n",
861 862 863 864
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->read.pid,
			event->read.tid,
865 866
			attr ? __event_name(attr->type, attr->config)
			     : "FAIL",
867 868 869 870 871
			event->read.value);

	return 0;
}

872
static int sample_type_check(u64 type)
873
{
874
	sample_type = type;
875

876 877 878 879 880
	if (!(sample_type & PERF_SAMPLE_CALLCHAIN)) {
		if (sort__has_parent) {
			fprintf(stderr, "selected --sort parent, but no"
					" callchain data. Did you call"
					" perf record without -g?\n");
881
			return -1;
882 883
		}
		if (callchain) {
884
			fprintf(stderr, "selected -g but no callchain data."
885 886
					" Did you call perf record without"
					" -g?\n");
887
			return -1;
888
		}
889 890 891 892 893
	} else if (callchain_param.mode != CHAIN_NONE && !callchain) {
			callchain = 1;
			if (register_callchain_param(&callchain_param) < 0) {
				fprintf(stderr, "Can't register callchain"
						" params\n");
894
				return -1;
895
			}
896 897
	}

898 899
	return 0;
}
900

901 902 903 904 905 906 907 908 909 910
static struct perf_file_handler file_handler = {
	.process_sample_event	= process_sample_event,
	.process_mmap_event	= process_mmap_event,
	.process_comm_event	= process_comm_event,
	.process_exit_event	= process_task_event,
	.process_fork_event	= process_task_event,
	.process_lost_event	= process_lost_event,
	.process_read_event	= process_read_event,
	.sample_type_check	= sample_type_check,
};
911 912


913 914 915 916
static int __cmd_report(void)
{
	struct thread *idle;
	int ret;
917

918
	idle = register_idle_thread();
919
	thread__comm_adjust(idle);
I
Ingo Molnar 已提交
920

921 922
	if (show_threads)
		perf_read_values_init(&show_threads_values);
923

924
	register_perf_file_handler(&file_handler);
925

926 927 928 929
	ret = mmap_dispatch_perf_file(&header, input_name, force, full_paths,
				      &cwdlen, &cwd);
	if (ret)
		return ret;
930

931 932 933 934 935
	dump_printf("      IP events: %10ld\n", total);
	dump_printf("    mmap events: %10ld\n", total_mmap);
	dump_printf("    comm events: %10ld\n", total_comm);
	dump_printf("    fork events: %10ld\n", total_fork);
	dump_printf("    lost events: %10ld\n", total_lost);
936
	dump_printf(" unknown events: %10ld\n", file_handler.total_unknown);
937

I
Ingo Molnar 已提交
938
	if (dump_trace)
939 940
		return 0;

941
	if (verbose > 3)
942
		threads__fprintf(stdout);
943

944
	if (verbose > 2)
945 946
		dsos__fprintf(stdout);

P
Peter Zijlstra 已提交
947
	collapse__resort();
948
	output__resort(total);
949
	output__fprintf(stdout, total);
950

951 952 953
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

954
	return ret;
955 956
}

957 958 959 960
static int
parse_callchain_opt(const struct option *opt __used, const char *arg,
		    int unset __used)
{
961 962 963
	char *tok;
	char *endptr;

964 965 966 967 968
	callchain = 1;

	if (!arg)
		return 0;

969 970 971 972 973 974
	tok = strtok((char *)arg, ",");
	if (!tok)
		return -1;

	/* get the output mode */
	if (!strncmp(tok, "graph", strlen(arg)))
975
		callchain_param.mode = CHAIN_GRAPH_ABS;
976

977
	else if (!strncmp(tok, "flat", strlen(arg)))
978 979 980 981 982
		callchain_param.mode = CHAIN_FLAT;

	else if (!strncmp(tok, "fractal", strlen(arg)))
		callchain_param.mode = CHAIN_GRAPH_REL;

983 984 985 986 987 988 989
	else if (!strncmp(tok, "none", strlen(arg))) {
		callchain_param.mode = CHAIN_NONE;
		callchain = 0;

		return 0;
	}

990 991 992
	else
		return -1;

993 994 995
	/* get the min percentage */
	tok = strtok(NULL, ",");
	if (!tok)
996
		goto setup;
997

998
	callchain_param.min_percent = strtod(tok, &endptr);
999 1000 1001
	if (tok == endptr)
		return -1;

1002 1003 1004 1005 1006
setup:
	if (register_callchain_param(&callchain_param) < 0) {
		fprintf(stderr, "Can't register callchain params\n");
		return -1;
	}
1007 1008 1009
	return 0;
}

1010 1011
//static const char * const report_usage[] = {
const char * const report_usage[] = {
1012 1013 1014 1015 1016 1017 1018
	"perf report [<options>] <command>",
	NULL
};

static const struct option options[] = {
	OPT_STRING('i', "input", &input_name, "file",
		    "input file name"),
1019 1020
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
1021 1022
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
1023
	OPT_STRING('k', "vmlinux", &vmlinux_name, "file", "vmlinux pathname"),
1024
	OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
1025 1026
	OPT_BOOLEAN('m', "modules", &modules,
		    "load module symbols - WARNING: use only with -k and LIVE kernel"),
1027 1028
	OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples,
		    "Show a column with the number of samples"),
1029 1030
	OPT_BOOLEAN('T', "threads", &show_threads,
		    "Show per-thread event counters"),
1031 1032
	OPT_STRING(0, "pretty", &pretty_printing_style, "key",
		   "pretty printing style key: normal raw"),
1033
	OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
1034
		   "sort by key(s): pid, comm, dso, symbol, parent"),
1035 1036
	OPT_BOOLEAN('P', "full-paths", &full_paths,
		    "Don't shorten the pathnames taking into account the cwd"),
1037 1038
	OPT_STRING('p', "parent", &parent_pattern, "regex",
		   "regex filter to identify parent, see: '--sort parent'"),
1039 1040
	OPT_BOOLEAN('x', "exclude-other", &exclude_other,
		    "Only display entries with parent-match"),
1041
	OPT_CALLBACK_DEFAULT('g', "call-graph", NULL, "output_type,min_percent",
1042
		     "Display callchains using output_type and min percent threshold. "
1043
		     "Default: fractal,0.5", &parse_callchain_opt, callchain_default_opt),
1044 1045
	OPT_STRING('d', "dsos", &dso_list_str, "dso[,dso...]",
		   "only consider symbols in these dsos"),
1046 1047
	OPT_STRING('C', "comms", &comm_list_str, "comm[,comm...]",
		   "only consider symbols in these comms"),
1048 1049
	OPT_STRING('S', "symbols", &sym_list_str, "symbol[,symbol...]",
		   "only consider these symbols"),
1050 1051 1052 1053 1054 1055
	OPT_STRING('w', "column-widths", &col_width_list_str,
		   "width[,width...]",
		   "don't try to adjust column width, use these fixed values"),
	OPT_STRING('t', "field-separator", &field_sep, "separator",
		   "separator for columns, no spaces will be added between "
		   "columns '.' is reserved."),
1056 1057 1058
	OPT_END()
};

1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073
static void setup_sorting(void)
{
	char *tmp, *tok, *str = strdup(sort_order);

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
		if (sort_dimension__add(tok) < 0) {
			error("Unknown --sort key: `%s'", tok);
			usage_with_options(report_usage, options);
		}
	}

	free(str);
}

1074
static void setup_list(struct strlist **list, const char *list_str,
1075 1076
		       struct sort_entry *se, const char *list_name,
		       FILE *fp)
1077 1078 1079 1080 1081 1082 1083 1084
{
	if (list_str) {
		*list = strlist__new(true, list_str);
		if (!*list) {
			fprintf(stderr, "problems parsing %s list\n",
				list_name);
			exit(129);
		}
1085 1086 1087 1088 1089
		if (strlist__nr_entries(*list) == 1) {
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(*list, 0)->s);
			se->elide = true;
		}
1090 1091 1092
	}
}

1093
int cmd_report(int argc, const char **argv, const char *prefix __used)
1094
{
1095
	symbol__init();
1096

1097
	argc = parse_options(argc, argv, options, report_usage, 0);
1098

1099 1100
	setup_sorting();

1101
	if (parent_pattern != default_parent_pattern) {
1102
		sort_dimension__add("parent");
1103 1104
		sort_parent.elide = 1;
	} else
1105 1106
		exclude_other = 0;

1107 1108 1109 1110 1111 1112
	/*
	 * Any (unrecognized) arguments left?
	 */
	if (argc)
		usage_with_options(report_usage, options);

1113 1114
	setup_pager();

1115 1116 1117
	setup_list(&dso_list, dso_list_str, &sort_dso, "dso", stdout);
	setup_list(&comm_list, comm_list_str, &sort_comm, "comm", stdout);
	setup_list(&sym_list, sym_list_str, &sort_sym, "symbol", stdout);
1118

1119 1120 1121 1122 1123 1124
	if (field_sep && *field_sep == '.') {
		fputs("'.' is the only non valid --field-separator argument\n",
		      stderr);
		exit(129);
	}

1125 1126
	return __cmd_report();
}