builtin-report.c 25.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 ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask)
{
	int i;
	size_t ret = 0;

	ret += fprintf(fp, "%s", "                ");

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

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

	return ret;
}
79
static size_t
80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96
ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain, int depth,
		       int depth_mask, int count, u64 total_samples,
		       int hits)
{
	int i;
	size_t ret = 0;

	ret += fprintf(fp, "%s", "                ");
	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;
97
			ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
98 99 100 101 102 103 104 105 106 107 108
		} 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;
}

109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
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;
}

124
static size_t
125 126
__callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
			   u64 total_samples, int depth, int depth_mask)
127 128 129 130 131
{
	struct rb_node *node, *next;
	struct callchain_node *child;
	struct callchain_list *chain;
	int new_depth_mask = depth_mask;
132
	u64 new_total;
133
	u64 remaining;
134 135 136
	size_t ret = 0;
	int i;

137
	if (callchain_param.mode == CHAIN_GRAPH_REL)
138
		new_total = self->children_hit;
139 140 141
	else
		new_total = total_samples;

142 143
	remaining = new_total;

144 145
	node = rb_first(&self->rb_root);
	while (node) {
146 147
		u64 cumul;

148
		child = rb_entry(node, struct callchain_node, rb_node);
149 150
		cumul = cumul_hits(child);
		remaining -= cumul;
151 152 153 154

		/*
		 * The depth mask manages the output of pipes that show
		 * the depth. We don't want to keep the pipes of the current
155 156 157
		 * level for the last child of this depth.
		 * Except if we have remaining filtered hits. They will
		 * supersede the last child
158 159
		 */
		next = rb_next(node);
160
		if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
161 162 163 164 165 166 167 168 169 170 171 172 173
			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
		 */
		ret += ipchain__fprintf_graph_line(fp, depth, depth_mask);
		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++,
174
						      new_total,
175
						      cumul);
176
		}
177 178 179
		ret += __callchain__fprintf_graph(fp, child, new_total,
						  depth + 1,
						  new_depth_mask | (1 << depth));
180 181 182
		node = next;
	}

183 184 185 186 187 188 189 190 191 192 193 194 195
	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,
					      remaining);
	}

196 197 198
	return ret;
}

199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225
static size_t
callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
			 u64 total_samples)
{
	struct callchain_list *chain;
	int i = 0;
	int ret = 0;

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

		if (!i++ && sort_by_sym_first)
			continue;

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

	ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1);

	return ret;
}

226 227 228
static size_t
callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
			u64 total_samples)
229 230 231 232 233 234 235
{
	struct callchain_list *chain;
	size_t ret = 0;

	if (!self)
		return 0;

236
	ret += callchain__fprintf_flat(fp, self->parent, total_samples);
237 238


239 240 241 242 243 244 245
	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",
246
					(void *)(long)chain->ip);
247
	}
248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265

	return ret;
}

static size_t
hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
			      u64 total_samples)
{
	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;
266 267
		switch (callchain_param.mode) {
		case CHAIN_FLAT:
268 269
			ret += percent_color_fprintf(fp, "           %6.2f%%\n",
						     percent);
270
			ret += callchain__fprintf_flat(fp, chain, total_samples);
271 272 273
			break;
		case CHAIN_GRAPH_ABS: /* Falldown */
		case CHAIN_GRAPH_REL:
274
			ret += callchain__fprintf_graph(fp, chain, total_samples);
275
		case CHAIN_NONE:
276 277
		default:
			break;
278
		}
279 280 281 282 283 284 285
		ret += fprintf(fp, "\n");
		rb_node = rb_next(rb_node);
	}

	return ret;
}

286
static size_t
287
hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
288 289 290 291
{
	struct sort_entry *se;
	size_t ret;

292 293 294
	if (exclude_other && !self->parent)
		return 0;

295
	if (total_samples)
296 297 298
		ret = percent_color_fprintf(fp,
					    field_sep ? "%.2f" : "   %6.2f%%",
					(self->count * 100.0) / total_samples);
299
	else
300
		ret = fprintf(fp, field_sep ? "%lld" : "%12lld ", self->count);
301

302 303 304 305 306 307
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%c%lld", *field_sep, self->count);
		else
			fprintf(fp, "%11lld", self->count);
	}
308

309
	list_for_each_entry(se, &hist_entry__sort_list, list) {
310
		if (se->elide)
311 312
			continue;

313 314
		fprintf(fp, "%s", field_sep ?: "  ");
		ret += se->print(fp, self, se->width ? *se->width : 0);
315
	}
316 317 318

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

319 320 321
	if (callchain)
		hist_entry_callchain__fprintf(fp, self, total_samples);

322 323 324
	return ret;
}

325 326 327 328
/*
 *
 */

329 330 331 332 333 334 335 336 337 338 339 340
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;
}

341
static void thread__comm_adjust(struct thread *self)
342
{
343
	char *comm = self->comm;
344 345 346 347 348 349 350 351 352 353

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

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);
364 365 366 367 368

	return 0;
}


369
static struct symbol *
370
resolve_symbol(struct thread *thread, struct map **mapp, u64 *ipp)
371 372
{
	struct map *map = mapp ? *mapp : NULL;
373
	u64 ip = *ipp;
374 375 376 377

	if (map)
		goto got_map;

378 379 380
	if (!thread)
		return NULL;

381 382
	map = thread__find_map(thread, ip);
	if (map != NULL) {
383 384 385 386 387
		/*
		 * 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.
		 */
388
		if (!sort_dso.elide && !map->dso->slen_calculated)
389 390
			dso__calc_col_width(map->dso);

391 392 393 394 395 396 397 398 399
		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
400 401 402 403 404
		 * 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.
405
		 */
406 407
		if ((long long)ip < 0)
			return kernel_maps__find_symbol(ip, mapp);
408
	}
409 410
	dump_printf(" ...... dso: %s\n",
		    map ? map->dso->long_name : "<not found>");
411
	dump_printf(" ...... map: %Lx -> %Lx\n", *ipp, ip);
412
	*ipp  = ip;
413

414
	return map ? map->dso->find_symbol(map->dso, ip) : NULL;
415 416
}

417
static int call__match(struct symbol *sym)
418
{
419
	if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0))
420
		return 1;
421

422
	return 0;
423 424
}

425 426 427
static struct symbol **resolve_callchain(struct thread *thread, struct map *map,
					 struct ip_callchain *chain,
					 struct symbol **parent)
428 429
{
	u64 context = PERF_CONTEXT_MAX;
430
	struct symbol **syms = NULL;
431
	unsigned int i;
432 433 434 435 436 437 438 439 440 441 442

	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];
443
		struct symbol *sym = NULL;
444 445 446 447 448 449 450

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

		switch (context) {
I
Ingo Molnar 已提交
451 452
		case PERF_CONTEXT_HV:
			break;
453
		case PERF_CONTEXT_KERNEL:
454
			sym = kernel_maps__find_symbol(ip, &map);
455 456
			break;
		default:
457
			sym = resolve_symbol(thread, &map, &ip);
458 459 460 461
			break;
		}

		if (sym) {
462 463
			if (sort__has_parent && !*parent && call__match(sym))
				*parent = sym;
464 465 466 467 468 469 470 471 472
			if (!callchain)
				break;
			syms[i] = sym;
		}
	}

	return syms;
}

473 474 475 476
/*
 * collect histogram counts
 */

477
static int
478
hist_entry__add(struct thread *thread, struct map *map,
479 480
		struct symbol *sym, u64 ip, struct ip_callchain *chain,
		char level, u64 count)
481
{
482 483
	struct symbol **syms = NULL, *parent = NULL;
	bool hit;
484 485
	struct hist_entry *he;

486
	if ((sort__has_parent || callchain) && chain)
487
		syms = resolve_callchain(thread, map, chain, &parent);
488

489 490 491 492
	he = __hist_entry__add(thread, map, sym, parent,
			       ip, count, level, &hit);
	if (he == NULL)
		return -ENOMEM;
493

494 495
	if (hit)
		he->count += count;
496

497
	if (callchain) {
498 499
		if (!hit)
			callchain_init(&he->callchain);
500 501
		append_chain(&he->callchain, chain, syms);
		free(syms);
502
	}
503 504

	return 0;
505 506
}

507
static size_t output__fprintf(FILE *fp, u64 total_samples)
508
{
509
	struct hist_entry *pos;
510
	struct sort_entry *se;
511 512
	struct rb_node *nd;
	size_t ret = 0;
513 514
	unsigned int width;
	char *col_width = col_width_list_str;
515 516 517
	int raw_printing_style;

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

519 520
	init_rem_hits();

521
	fprintf(fp, "# Samples: %Ld\n", (u64)total_samples);
522 523 524
	fprintf(fp, "#\n");

	fprintf(fp, "# Overhead");
525 526 527 528 529 530
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%cSamples", *field_sep);
		else
			fputs("  Samples  ", fp);
	}
531
	list_for_each_entry(se, &hist_entry__sort_list, list) {
532
		if (se->elide)
533
			continue;
534 535
		if (field_sep) {
			fprintf(fp, "%c%s", *field_sep, se->header);
536
			continue;
537 538 539 540 541 542 543 544 545 546 547 548 549 550
		}
		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);
551
	}
552 553
	fprintf(fp, "\n");

554 555 556
	if (field_sep)
		goto print_entries;

557
	fprintf(fp, "# ........");
558 559
	if (show_nr_samples)
		fprintf(fp, " ..........");
560
	list_for_each_entry(se, &hist_entry__sort_list, list) {
561
		unsigned int i;
562

563
		if (se->elide)
564 565
			continue;

566
		fprintf(fp, "  ");
567 568 569 570 571
		if (se->width)
			width = *se->width;
		else
			width = strlen(se->header);
		for (i = 0; i < width; i++)
572
			fprintf(fp, ".");
573
	}
574 575 576
	fprintf(fp, "\n");

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

578
print_entries:
579 580 581
	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);
582 583
	}

584 585
	if (sort_order == default_sort_order &&
			parent_pattern == default_parent_pattern) {
586
		fprintf(fp, "#\n");
587
		fprintf(fp, "# (For a higher level overview, try: perf report --sort comm,dso)\n");
588 589
		fprintf(fp, "#\n");
	}
590
	fprintf(fp, "\n");
591

592 593
	free(rem_sq_bracket);

594
	if (show_threads)
595 596
		perf_read_values_display(fp, &show_threads_values,
					 raw_printing_style);
597

598 599 600
	return ret;
}

601
static int validate_chain(struct ip_callchain *chain, event_t *event)
602 603 604 605 606 607
{
	unsigned int chain_size;

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

608
	if (chain->nr*sizeof(u64) > chain_size)
609 610 611 612 613
		return -1;

	return 0;
}

614
static int
615
process_sample_event(event_t *event, unsigned long offset, unsigned long head)
616 617
{
	char level;
618
	struct symbol *sym = NULL;
619 620
	u64 ip = event->ip.ip;
	u64 period = 1;
621
	struct map *map = NULL;
622
	void *more_data = event->ip.__more_data;
623
	struct ip_callchain *chain = NULL;
624
	int cpumode;
625
	struct thread *thread = threads__findnew(event->ip.pid);
626

627
	if (sample_type & PERF_SAMPLE_PERIOD) {
628 629
		period = *(u64 *)more_data;
		more_data += sizeof(u64);
630
	}
631

632
	dump_printf("%p [%p]: PERF_RECORD_SAMPLE (IP, %d): %d/%d: %p period: %Ld\n",
633 634 635
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->header.misc,
636
		event->ip.pid, event->ip.tid,
637
		(void *)(long)ip,
638
		(long long)period);
639

640
	if (sample_type & PERF_SAMPLE_CALLCHAIN) {
641
		unsigned int i;
642 643 644

		chain = (void *)more_data;

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

647 648 649 650 651 652
		if (validate_chain(chain, event) < 0) {
			eprintf("call-chain problem with event, skipping it.\n");
			return 0;
		}

		if (dump_trace) {
653
			for (i = 0; i < chain->nr; i++)
654
				dump_printf("..... %2d: %016Lx\n", i, chain->ips[i]);
655 656 657
		}
	}

658
	if (thread == NULL) {
659
		eprintf("problem processing %d event, skipping it.\n",
660 661 662
			event->header.type);
		return -1;
	}
663

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

666 667 668
	if (comm_list && !strlist__has_entry(comm_list, thread->comm))
		return 0;

669
	cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK;
670

671
	if (cpumode == PERF_RECORD_MISC_KERNEL) {
672
		level = 'k';
673 674 675
		sym = kernel_maps__find_symbol(ip, &map);
		dump_printf(" ...... dso: %s\n",
			    map ? map->dso->long_name : "<not found>");
676
	} else if (cpumode == PERF_RECORD_MISC_USER) {
677
		level = '.';
678
		sym = resolve_symbol(thread, &map, &ip);
679

680 681
	} else {
		level = 'H';
682
		dump_printf(" ...... dso: [hypervisor]\n");
683
	}
684

685 686 687 688 689 690
	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;
691

692 693
	if (sym_list && sym && !strlist__has_entry(sym_list, sym->name))
		return 0;
694

695 696 697 698
	if (hist_entry__add(thread, map, sym, ip,
			    chain, level, period)) {
		eprintf("problem incrementing symbol count, skipping event\n");
		return -1;
699
	}
700

701
	total += period;
702

703 704
	return 0;
}
I
Ingo Molnar 已提交
705

706 707 708
static int
process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
{
709
	struct map *map = map__new(&event->mmap, cwd, cwdlen, 0, NULL, verbose);
710
	struct thread *thread = threads__findnew(event->mmap.pid);
711

712
	dump_printf("%p [%p]: PERF_RECORD_MMAP %d/%d: [%p(%p) @ %p]: %s\n",
713 714
		(void *)(offset + head),
		(void *)(long)(event->header.size),
715
		event->mmap.pid,
716
		event->mmap.tid,
717 718 719 720 721 722
		(void *)(long)event->mmap.start,
		(void *)(long)event->mmap.len,
		(void *)(long)event->mmap.pgoff,
		event->mmap.filename);

	if (thread == NULL || map == NULL) {
723
		dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n");
724
		return 0;
725 726 727 728 729 730 731 732 733 734 735
	}

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

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

738
	dump_printf("%p [%p]: PERF_RECORD_COMM: %s:%d\n",
739 740 741 742 743
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->comm.comm, event->comm.pid);

	if (thread == NULL ||
744
	    thread__set_comm_adjust(thread, event->comm.comm)) {
745
		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
746
		return -1;
747
	}
748 749 750 751 752
	total_comm++;

	return 0;
}

753
static int
754
process_task_event(event_t *event, unsigned long offset, unsigned long head)
755
{
756 757
	struct thread *thread = threads__findnew(event->fork.pid);
	struct thread *parent = threads__findnew(event->fork.ppid);
758

759
	dump_printf("%p [%p]: PERF_RECORD_%s: (%d:%d):(%d:%d)\n",
760 761
		(void *)(offset + head),
		(void *)(long)(event->header.size),
762
		event->header.type == PERF_RECORD_FORK ? "FORK" : "EXIT",
763 764 765 766 767 768 769 770 771 772
		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;

773
	if (event->header.type == PERF_RECORD_EXIT)
774
		return 0;
775 776

	if (!thread || !parent || thread__fork(thread, parent)) {
777
		dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n");
778 779 780 781 782 783 784
		return -1;
	}
	total_fork++;

	return 0;
}

785 786 787
static int
process_lost_event(event_t *event, unsigned long offset, unsigned long head)
{
788
	dump_printf("%p [%p]: PERF_RECORD_LOST: id:%Ld: lost:%Ld\n",
789 790 791 792 793 794 795 796 797 798
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->lost.id,
		event->lost.lost);

	total_lost += event->lost.lost;

	return 0;
}

799 800 801
static int
process_read_event(event_t *event, unsigned long offset, unsigned long head)
{
802
	struct perf_event_attr *attr;
803 804

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

806
	if (show_threads) {
807
		const char *name = attr ? __event_name(attr->type, attr->config)
808 809 810 811 812 813 814 815
				   : "unknown";
		perf_read_values_add_value(&show_threads_values,
					   event->read.pid, event->read.tid,
					   event->read.id,
					   name,
					   event->read.value);
	}

816
	dump_printf("%p [%p]: PERF_RECORD_READ: %d %d %s %Lu\n",
817 818 819 820
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->read.pid,
			event->read.tid,
821 822
			attr ? __event_name(attr->type, attr->config)
			     : "FAIL",
823 824 825 826 827
			event->read.value);

	return 0;
}

828
static int sample_type_check(u64 type)
829
{
830
	sample_type = type;
831

832 833 834 835 836
	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");
837
			return -1;
838 839
		}
		if (callchain) {
840
			fprintf(stderr, "selected -g but no callchain data."
841 842
					" Did you call perf record without"
					" -g?\n");
843
			return -1;
844
		}
845 846 847 848 849
	} 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");
850
				return -1;
851
			}
852 853
	}

854 855
	return 0;
}
856

857 858 859 860 861 862 863 864 865 866
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,
};
867 868


869 870 871 872
static int __cmd_report(void)
{
	struct thread *idle;
	int ret;
873

874
	idle = register_idle_thread();
875
	thread__comm_adjust(idle);
I
Ingo Molnar 已提交
876

877 878
	if (show_threads)
		perf_read_values_init(&show_threads_values);
879

880
	register_perf_file_handler(&file_handler);
881

882 883 884 885
	ret = mmap_dispatch_perf_file(&header, input_name, force, full_paths,
				      &cwdlen, &cwd);
	if (ret)
		return ret;
886

887 888 889 890 891
	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);
892
	dump_printf(" unknown events: %10ld\n", file_handler.total_unknown);
893

I
Ingo Molnar 已提交
894
	if (dump_trace)
895 896
		return 0;

897
	if (verbose > 3)
898
		threads__fprintf(stdout);
899

900
	if (verbose > 2)
901 902
		dsos__fprintf(stdout);

P
Peter Zijlstra 已提交
903
	collapse__resort();
904
	output__resort(total);
905
	output__fprintf(stdout, total);
906

907 908 909
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

910
	return ret;
911 912
}

913 914 915 916
static int
parse_callchain_opt(const struct option *opt __used, const char *arg,
		    int unset __used)
{
917 918 919
	char *tok;
	char *endptr;

920 921 922 923 924
	callchain = 1;

	if (!arg)
		return 0;

925 926 927 928 929 930
	tok = strtok((char *)arg, ",");
	if (!tok)
		return -1;

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

933
	else if (!strncmp(tok, "flat", strlen(arg)))
934 935 936 937 938
		callchain_param.mode = CHAIN_FLAT;

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

939 940 941 942 943 944 945
	else if (!strncmp(tok, "none", strlen(arg))) {
		callchain_param.mode = CHAIN_NONE;
		callchain = 0;

		return 0;
	}

946 947 948
	else
		return -1;

949 950 951
	/* get the min percentage */
	tok = strtok(NULL, ",");
	if (!tok)
952
		goto setup;
953

954
	callchain_param.min_percent = strtod(tok, &endptr);
955 956 957
	if (tok == endptr)
		return -1;

958 959 960 961 962
setup:
	if (register_callchain_param(&callchain_param) < 0) {
		fprintf(stderr, "Can't register callchain params\n");
		return -1;
	}
963 964 965
	return 0;
}

966 967
//static const char * const report_usage[] = {
const char * const report_usage[] = {
968 969 970 971 972 973 974
	"perf report [<options>] <command>",
	NULL
};

static const struct option options[] = {
	OPT_STRING('i', "input", &input_name, "file",
		    "input file name"),
975 976
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
977 978
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
979
	OPT_STRING('k', "vmlinux", &vmlinux_name, "file", "vmlinux pathname"),
980
	OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
981 982
	OPT_BOOLEAN('m', "modules", &modules,
		    "load module symbols - WARNING: use only with -k and LIVE kernel"),
983 984
	OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples,
		    "Show a column with the number of samples"),
985 986
	OPT_BOOLEAN('T', "threads", &show_threads,
		    "Show per-thread event counters"),
987 988
	OPT_STRING(0, "pretty", &pretty_printing_style, "key",
		   "pretty printing style key: normal raw"),
989
	OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
990
		   "sort by key(s): pid, comm, dso, symbol, parent"),
991 992
	OPT_BOOLEAN('P', "full-paths", &full_paths,
		    "Don't shorten the pathnames taking into account the cwd"),
993 994
	OPT_STRING('p', "parent", &parent_pattern, "regex",
		   "regex filter to identify parent, see: '--sort parent'"),
995 996
	OPT_BOOLEAN('x', "exclude-other", &exclude_other,
		    "Only display entries with parent-match"),
997
	OPT_CALLBACK_DEFAULT('g', "call-graph", NULL, "output_type,min_percent",
998
		     "Display callchains using output_type and min percent threshold. "
999
		     "Default: fractal,0.5", &parse_callchain_opt, callchain_default_opt),
1000 1001
	OPT_STRING('d', "dsos", &dso_list_str, "dso[,dso...]",
		   "only consider symbols in these dsos"),
1002 1003
	OPT_STRING('C', "comms", &comm_list_str, "comm[,comm...]",
		   "only consider symbols in these comms"),
1004 1005
	OPT_STRING('S', "symbols", &sym_list_str, "symbol[,symbol...]",
		   "only consider these symbols"),
1006 1007 1008 1009 1010 1011
	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."),
1012 1013 1014
	OPT_END()
};

1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029
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);
}

1030
static void setup_list(struct strlist **list, const char *list_str,
1031 1032
		       struct sort_entry *se, const char *list_name,
		       FILE *fp)
1033 1034 1035 1036 1037 1038 1039 1040
{
	if (list_str) {
		*list = strlist__new(true, list_str);
		if (!*list) {
			fprintf(stderr, "problems parsing %s list\n",
				list_name);
			exit(129);
		}
1041 1042 1043 1044 1045
		if (strlist__nr_entries(*list) == 1) {
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(*list, 0)->s);
			se->elide = true;
		}
1046 1047 1048
	}
}

1049
int cmd_report(int argc, const char **argv, const char *prefix __used)
1050
{
1051
	symbol__init();
1052

1053
	argc = parse_options(argc, argv, options, report_usage, 0);
1054

1055 1056
	setup_sorting();

1057
	if (parent_pattern != default_parent_pattern) {
1058
		sort_dimension__add("parent");
1059 1060
		sort_parent.elide = 1;
	} else
1061 1062
		exclude_other = 0;

1063 1064 1065 1066 1067 1068
	/*
	 * Any (unrecognized) arguments left?
	 */
	if (argc)
		usage_with_options(report_usage, options);

1069 1070
	setup_pager();

1071 1072 1073
	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);
1074

1075 1076 1077 1078 1079 1080
	if (field_sep && *field_sep == '.') {
		fputs("'.' is the only non valid --field-separator argument\n",
		      stderr);
		exit(129);
	}

1081 1082
	return __cmd_report();
}