builtin-report.c 26.2 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
static bool		use_modules;
42

43
static int		full_paths;
44
static int		show_nr_samples;
45

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

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

52
static int		exclude_other = 1;
53

54
static char		callchain_default_opt[] = "fractal,0.5";
55
const char		*vmlinux_name;
56

57
static char		*cwd;
58 59
static int		cwdlen;

60 61
static struct perf_header *header;

62 63
static u64		sample_type;

64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80

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)
81 82 83 84
{
	int i;
	size_t ret = 0;

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

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

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

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

105
	ret += callchain__fprintf_left_margin(fp, left_margin);
106 107 108 109 110 111 112 113 114
	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;
115
			ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
116 117 118 119 120 121 122 123 124 125 126
		} 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;
}

127 128 129 130 131 132 133 134 135 136 137 138 139 140 141
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;
}

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

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

161 162
	remaining = new_total;

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

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

		/*
		 * The depth mask manages the output of pipes that show
		 * the depth. We don't want to keep the pipes of the current
174 175 176
		 * level for the last child of this depth.
		 * Except if we have remaining filtered hits. They will
		 * supersede the last child
177 178
		 */
		next = rb_next(node);
179
		if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
180 181 182 183 184 185
			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
		 */
186 187
		ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
						   left_margin);
188 189 190 191 192 193
		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++,
194
						      new_total,
195 196
						      cumul,
						      left_margin);
197
		}
198 199
		ret += __callchain__fprintf_graph(fp, child, new_total,
						  depth + 1,
200 201
						  new_depth_mask | (1 << depth),
						  left_margin);
202 203 204
		node = next;
	}

205 206 207 208 209 210 211 212 213 214
	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,
215
					      remaining, left_margin);
216 217
	}

218 219 220
	return ret;
}

221

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

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

235
		if (!i++ && sort__first_dimension == SORT_SYM)
236 237
			continue;

238 239 240 241 242 243 244 245 246 247 248
		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);

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

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

	return ret;
}

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

	if (!self)
		return 0;

270
	ret += callchain__fprintf_flat(fp, self->parent, total_samples);
271 272


273 274 275 276 277 278 279
	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",
280
					(void *)(long)chain->ip);
281
	}
282 283 284 285 286 287

	return ret;
}

static size_t
hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
288
			      u64 total_samples, int left_margin)
289 290 291 292 293 294 295 296 297 298 299
{
	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;
300 301
		switch (callchain_param.mode) {
		case CHAIN_FLAT:
302 303
			ret += percent_color_fprintf(fp, "           %6.2f%%\n",
						     percent);
304
			ret += callchain__fprintf_flat(fp, chain, total_samples);
305 306 307
			break;
		case CHAIN_GRAPH_ABS: /* Falldown */
		case CHAIN_GRAPH_REL:
308 309
			ret += callchain__fprintf_graph(fp, chain, total_samples,
							left_margin);
310
		case CHAIN_NONE:
311 312
		default:
			break;
313
		}
314 315 316 317 318 319 320
		ret += fprintf(fp, "\n");
		rb_node = rb_next(rb_node);
	}

	return ret;
}

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

327 328 329
	if (exclude_other && !self->parent)
		return 0;

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

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

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

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

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

354 355 356 357 358 359 360 361 362 363 364 365 366
	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);
	}
367

368 369 370
	return ret;
}

371 372 373 374
/*
 *
 */

375 376 377 378 379 380 381 382 383 384 385 386
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;
}

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

	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;
		}
	}
400 401 402 403 404 405 406 407 408 409
}

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);
410 411 412 413 414

	return 0;
}


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

	if (map)
		goto got_map;

424 425 426
	if (!thread)
		return NULL;

427 428
	map = thread__find_map(thread, ip);
	if (map != NULL) {
429 430 431 432 433
		/*
		 * 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.
		 */
434
		if (!sort_dso.elide && !map->dso->slen_calculated)
435 436
			dso__calc_col_width(map->dso);

437 438 439 440 441 442 443 444 445
		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
446 447 448 449 450
		 * 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.
451
		 */
452
		if ((long long)ip < 0)
453
			return kernel_maps__find_symbol(ip, mapp, NULL);
454
	}
455 456
	dump_printf(" ...... dso: %s\n",
		    map ? map->dso->long_name : "<not found>");
457
	dump_printf(" ...... map: %Lx -> %Lx\n", *ipp, ip);
458
	*ipp  = ip;
459

460
	return map ? map__find_symbol(map, ip, NULL) : NULL;
461 462
}

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

468
	return 0;
469 470
}

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

	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];
489
		struct symbol *sym = NULL;
490 491 492 493 494 495 496

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

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

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

	return syms;
}

519 520 521 522
/*
 * collect histogram counts
 */

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

532
	if ((sort__has_parent || callchain) && chain)
533
		syms = resolve_callchain(thread, chain, &parent);
534

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

540 541
	if (hit)
		he->count += count;
542

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

	return 0;
551 552
}

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

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

565 566
	init_rem_hits();

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

	fprintf(fp, "# Overhead");
571 572 573 574 575 576
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%cSamples", *field_sep);
		else
			fputs("  Samples  ", fp);
	}
577
	list_for_each_entry(se, &hist_entry__sort_list, list) {
578
		if (se->elide)
579
			continue;
580 581
		if (field_sep) {
			fprintf(fp, "%c%s", *field_sep, se->header);
582
			continue;
583 584 585 586 587 588 589 590 591 592 593 594 595 596
		}
		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);
597
	}
598 599
	fprintf(fp, "\n");

600 601 602
	if (field_sep)
		goto print_entries;

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

609
		if (se->elide)
610 611
			continue;

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

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

624
print_entries:
625 626 627
	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);
628 629
	}

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

638 639
	free(rem_sq_bracket);

640
	if (show_threads)
641 642
		perf_read_values_display(fp, &show_threads_values,
					 raw_printing_style);
643

644 645 646
	return ret;
}

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

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

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

	return 0;
}

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

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

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

686
	if (sample_type & PERF_SAMPLE_CALLCHAIN) {
687
		unsigned int i;
688 689 690

		chain = (void *)more_data;

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

693
		if (validate_chain(chain, event) < 0) {
694 695
			pr_debug("call-chain problem with event, "
				 "skipping it.\n");
696 697 698 699
			return 0;
		}

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

705
	if (thread == NULL) {
706
		pr_debug("problem processing %d event, skipping it.\n",
707 708 709
			event->header.type);
		return -1;
	}
710

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

713 714 715
	if (comm_list && !strlist__has_entry(comm_list, thread->comm))
		return 0;

716
	cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK;
717

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

727 728
	} else {
		level = 'H';
729
		dump_printf(" ...... dso: [hypervisor]\n");
730
	}
731

732 733 734 735 736 737
	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;
738

739 740
	if (sym_list && sym && !strlist__has_entry(sym_list, sym->name))
		return 0;
741

742 743
	if (hist_entry__add(thread, map, sym, ip,
			    chain, level, period)) {
744
		pr_debug("problem incrementing symbol count, skipping event\n");
745
		return -1;
746
	}
747

748
	total += period;
749

750 751
	return 0;
}
I
Ingo Molnar 已提交
752

753 754 755
static int
process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
{
756
	struct map *map = map__new(&event->mmap, cwd, cwdlen);
757
	struct thread *thread = threads__findnew(event->mmap.pid);
758

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

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

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

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

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

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

	return 0;
}

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

806
	dump_printf("%p [%p]: PERF_RECORD_%s: (%d:%d):(%d:%d)\n",
807 808
		(void *)(offset + head),
		(void *)(long)(event->header.size),
809
		event->header.type == PERF_RECORD_FORK ? "FORK" : "EXIT",
810 811 812 813 814 815 816 817 818 819
		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;

820
	if (event->header.type == PERF_RECORD_EXIT)
821
		return 0;
822 823

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

	return 0;
}

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

	total_lost += event->lost.lost;

	return 0;
}

846 847 848
static int
process_read_event(event_t *event, unsigned long offset, unsigned long head)
{
849
	struct perf_event_attr *attr;
850 851

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

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

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

	return 0;
}

875
static int sample_type_check(u64 type)
876
{
877
	sample_type = type;
878

879 880 881 882 883
	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");
884
			return -1;
885 886
		}
		if (callchain) {
887
			fprintf(stderr, "selected -g but no callchain data."
888 889
					" Did you call perf record without"
					" -g?\n");
890
			return -1;
891
		}
892 893 894 895 896
	} 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");
897
				return -1;
898
			}
899 900
	}

901 902
	return 0;
}
903

904 905 906 907 908 909 910 911 912 913
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,
};
914 915


916 917 918 919
static int __cmd_report(void)
{
	struct thread *idle;
	int ret;
920

921
	idle = register_idle_thread();
922
	thread__comm_adjust(idle);
I
Ingo Molnar 已提交
923

924 925
	if (show_threads)
		perf_read_values_init(&show_threads_values);
926

927
	register_perf_file_handler(&file_handler);
928

929 930 931
	ret = mmap_dispatch_perf_file(&header, input_name, vmlinux_name,
				      !vmlinux_name, force,
				      full_paths, &cwdlen, &cwd);
932 933
	if (ret)
		return ret;
934

935 936 937 938 939
	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);
940
	dump_printf(" unknown events: %10ld\n", file_handler.total_unknown);
941

I
Ingo Molnar 已提交
942
	if (dump_trace)
943 944
		return 0;

945
	if (verbose > 3)
946
		threads__fprintf(stdout);
947

948
	if (verbose > 2)
949 950
		dsos__fprintf(stdout);

P
Peter Zijlstra 已提交
951
	collapse__resort();
952
	output__resort(total);
953
	output__fprintf(stdout, total);
954

955 956 957
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

958
	return ret;
959 960
}

961 962 963 964
static int
parse_callchain_opt(const struct option *opt __used, const char *arg,
		    int unset __used)
{
965 966 967
	char *tok;
	char *endptr;

968 969 970 971 972
	callchain = 1;

	if (!arg)
		return 0;

973 974 975 976 977 978
	tok = strtok((char *)arg, ",");
	if (!tok)
		return -1;

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

981
	else if (!strncmp(tok, "flat", strlen(arg)))
982 983 984 985 986
		callchain_param.mode = CHAIN_FLAT;

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

987 988 989 990 991 992 993
	else if (!strncmp(tok, "none", strlen(arg))) {
		callchain_param.mode = CHAIN_NONE;
		callchain = 0;

		return 0;
	}

994 995 996
	else
		return -1;

997 998 999
	/* get the min percentage */
	tok = strtok(NULL, ",");
	if (!tok)
1000
		goto setup;
1001

1002
	callchain_param.min_percent = strtod(tok, &endptr);
1003 1004 1005
	if (tok == endptr)
		return -1;

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

1014 1015
//static const char * const report_usage[] = {
const char * const report_usage[] = {
1016 1017 1018 1019 1020 1021 1022
	"perf report [<options>] <command>",
	NULL
};

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

1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077
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);
}

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

1097
int cmd_report(int argc, const char **argv, const char *prefix __used)
1098
{
1099
	symbol__init(0);
1100

1101
	argc = parse_options(argc, argv, options, report_usage, 0);
1102

1103 1104
	setup_sorting();

1105
	if (parent_pattern != default_parent_pattern) {
1106
		sort_dimension__add("parent");
1107 1108
		sort_parent.elide = 1;
	} else
1109 1110
		exclude_other = 0;

1111 1112 1113 1114 1115 1116
	/*
	 * Any (unrecognized) arguments left?
	 */
	if (argc)
		usage_with_options(report_usage, options);

1117 1118
	setup_pager();

1119 1120 1121
	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);
1122

1123 1124 1125 1126 1127 1128
	if (field_sep && *field_sep == '.') {
		fputs("'.' is the only non valid --field-separator argument\n",
		      stderr);
		exit(129);
	}

1129 1130
	return __cmd_report();
}