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
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 55
static char		callchain_default_opt[] = "fractal,0.5";

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

59 60
static struct perf_header *header;

61 62
static u64		sample_type;

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

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

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

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

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

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

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

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

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

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

160 161
	remaining = new_total;

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

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

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

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

217 218 219
	return ret;
}

220

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

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

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

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

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

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

	return ret;
}

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

	if (!self)
		return 0;

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


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

	return ret;
}

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

	return ret;
}

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

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

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

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

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

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

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

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

367 368 369
	return ret;
}

370 371 372 373
/*
 *
 */

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

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

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

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

	return 0;
}


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

	if (map)
		goto got_map;

423 424 425
	if (!thread)
		return NULL;

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

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

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

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

467
	return 0;
468 469
}

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

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

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

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

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

	return syms;
}

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

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

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

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

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

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

	return 0;
550 551
}

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

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

564 565
	init_rem_hits();

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

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

599 600 601
	if (field_sep)
		goto print_entries;

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

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

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

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

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

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

637 638
	free(rem_sq_bracket);

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

643 644 645
	return ret;
}

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

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

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

	return 0;
}

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

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

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

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

		chain = (void *)more_data;

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

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

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

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

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

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

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

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

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

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

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

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

747
	total += period;
748

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

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

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

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

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

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

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

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

	return 0;
}

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

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

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

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

	return 0;
}

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

	total_lost += event->lost.lost;

	return 0;
}

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

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

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

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

	return 0;
}

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

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

900 901
	return 0;
}
902

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


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

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

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

926
	register_perf_file_handler(&file_handler);
927

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

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

I
Ingo Molnar 已提交
940
	if (dump_trace)
941 942
		return 0;

943
	if (verbose > 3)
944
		threads__fprintf(stdout);
945

946
	if (verbose > 2)
947 948
		dsos__fprintf(stdout);

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

953 954 955
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

956
	return ret;
957 958
}

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

966 967 968 969 970
	callchain = 1;

	if (!arg)
		return 0;

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

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

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

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

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

		return 0;
	}

992 993 994
	else
		return -1;

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

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

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

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

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

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

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

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

1099
	argc = parse_options(argc, argv, options, report_usage, 0);
1100

1101 1102
	setup_sorting();

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

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

1115 1116
	setup_pager();

1117 1118 1119
	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);
1120

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

1127 1128
	return __cmd_report();
}