builtin-report.c 24.6 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 125 126 127 128 129 130 131
static size_t
callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
			u64 total_samples, int depth, int depth_mask)
{
	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
		ret += callchain__fprintf_graph(fp, child, new_total,
178 179 180 181 182
						depth + 1,
						new_depth_mask | (1 << depth));
		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 199 200 201
	return ret;
}

static size_t
callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
			u64 total_samples)
202 203 204 205 206 207 208
{
	struct callchain_list *chain;
	size_t ret = 0;

	if (!self)
		return 0;

209
	ret += callchain__fprintf_flat(fp, self->parent, total_samples);
210 211


212 213 214 215 216 217 218
	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",
219
					(void *)(long)chain->ip);
220
	}
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238

	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;
239 240
		switch (callchain_param.mode) {
		case CHAIN_FLAT:
241 242
			ret += percent_color_fprintf(fp, "           %6.2f%%\n",
						     percent);
243
			ret += callchain__fprintf_flat(fp, chain, total_samples);
244 245 246
			break;
		case CHAIN_GRAPH_ABS: /* Falldown */
		case CHAIN_GRAPH_REL:
247 248
			ret += callchain__fprintf_graph(fp, chain,
							total_samples, 1, 1);
249
		case CHAIN_NONE:
250 251
		default:
			break;
252
		}
253 254 255 256 257 258 259
		ret += fprintf(fp, "\n");
		rb_node = rb_next(rb_node);
	}

	return ret;
}

260
static size_t
261
hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
262 263 264 265
{
	struct sort_entry *se;
	size_t ret;

266 267 268
	if (exclude_other && !self->parent)
		return 0;

269
	if (total_samples)
270 271 272
		ret = percent_color_fprintf(fp,
					    field_sep ? "%.2f" : "   %6.2f%%",
					(self->count * 100.0) / total_samples);
273
	else
274
		ret = fprintf(fp, field_sep ? "%lld" : "%12lld ", self->count);
275

276 277 278 279 280 281
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%c%lld", *field_sep, self->count);
		else
			fprintf(fp, "%11lld", self->count);
	}
282

283
	list_for_each_entry(se, &hist_entry__sort_list, list) {
284
		if (se->elide)
285 286
			continue;

287 288
		fprintf(fp, "%s", field_sep ?: "  ");
		ret += se->print(fp, self, se->width ? *se->width : 0);
289
	}
290 291 292

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

293 294 295
	if (callchain)
		hist_entry_callchain__fprintf(fp, self, total_samples);

296 297 298
	return ret;
}

299 300 301 302
/*
 *
 */

303 304 305 306 307 308 309 310 311 312 313 314
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;
}

315
static void thread__comm_adjust(struct thread *self)
316
{
317
	char *comm = self->comm;
318 319 320 321 322 323 324 325 326 327

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

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);
338 339 340 341 342

	return 0;
}


343
static struct symbol *
344
resolve_symbol(struct thread *thread, struct map **mapp, u64 *ipp)
345 346
{
	struct map *map = mapp ? *mapp : NULL;
347
	u64 ip = *ipp;
348 349 350 351

	if (map)
		goto got_map;

352 353 354
	if (!thread)
		return NULL;

355 356
	map = thread__find_map(thread, ip);
	if (map != NULL) {
357 358 359 360 361
		/*
		 * 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.
		 */
362
		if (!sort_dso.elide && !map->dso->slen_calculated)
363 364
			dso__calc_col_width(map->dso);

365 366 367 368 369 370 371 372 373
		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
374 375 376 377 378
		 * 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.
379
		 */
380 381
		if ((long long)ip < 0)
			return kernel_maps__find_symbol(ip, mapp);
382
	}
383 384
	dump_printf(" ...... dso: %s\n",
		    map ? map->dso->long_name : "<not found>");
385
	dump_printf(" ...... map: %Lx -> %Lx\n", *ipp, ip);
386
	*ipp  = ip;
387

388
	return map ? map->dso->find_symbol(map->dso, ip) : NULL;
389 390
}

391
static int call__match(struct symbol *sym)
392
{
393
	if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0))
394
		return 1;
395

396
	return 0;
397 398
}

399 400 401
static struct symbol **resolve_callchain(struct thread *thread, struct map *map,
					 struct ip_callchain *chain,
					 struct symbol **parent)
402 403
{
	u64 context = PERF_CONTEXT_MAX;
404
	struct symbol **syms = NULL;
405
	unsigned int i;
406 407 408 409 410 411 412 413 414 415 416

	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];
417
		struct symbol *sym = NULL;
418 419 420 421 422 423 424

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

		switch (context) {
I
Ingo Molnar 已提交
425 426
		case PERF_CONTEXT_HV:
			break;
427
		case PERF_CONTEXT_KERNEL:
428
			sym = kernel_maps__find_symbol(ip, &map);
429 430
			break;
		default:
431
			sym = resolve_symbol(thread, &map, &ip);
432 433 434 435
			break;
		}

		if (sym) {
436 437
			if (sort__has_parent && !*parent && call__match(sym))
				*parent = sym;
438 439 440 441 442 443 444 445 446
			if (!callchain)
				break;
			syms[i] = sym;
		}
	}

	return syms;
}

447 448 449 450
/*
 * collect histogram counts
 */

451
static int
452
hist_entry__add(struct thread *thread, struct map *map,
453 454
		struct symbol *sym, u64 ip, struct ip_callchain *chain,
		char level, u64 count)
455
{
456 457
	struct symbol **syms = NULL, *parent = NULL;
	bool hit;
458 459
	struct hist_entry *he;

460
	if ((sort__has_parent || callchain) && chain)
461
		syms = resolve_callchain(thread, map, chain, &parent);
462

463 464 465 466
	he = __hist_entry__add(thread, map, sym, parent,
			       ip, count, level, &hit);
	if (he == NULL)
		return -ENOMEM;
467

468 469
	if (hit)
		he->count += count;
470

471
	if (callchain) {
472 473
		if (!hit)
			callchain_init(&he->callchain);
474 475
		append_chain(&he->callchain, chain, syms);
		free(syms);
476
	}
477 478

	return 0;
479 480
}

481
static size_t output__fprintf(FILE *fp, u64 total_samples)
482
{
483
	struct hist_entry *pos;
484
	struct sort_entry *se;
485 486
	struct rb_node *nd;
	size_t ret = 0;
487 488
	unsigned int width;
	char *col_width = col_width_list_str;
489 490 491
	int raw_printing_style;

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

493 494
	init_rem_hits();

495
	fprintf(fp, "# Samples: %Ld\n", (u64)total_samples);
496 497 498
	fprintf(fp, "#\n");

	fprintf(fp, "# Overhead");
499 500 501 502 503 504
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%cSamples", *field_sep);
		else
			fputs("  Samples  ", fp);
	}
505
	list_for_each_entry(se, &hist_entry__sort_list, list) {
506
		if (se->elide)
507
			continue;
508 509
		if (field_sep) {
			fprintf(fp, "%c%s", *field_sep, se->header);
510
			continue;
511 512 513 514 515 516 517 518 519 520 521 522 523 524
		}
		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);
525
	}
526 527
	fprintf(fp, "\n");

528 529 530
	if (field_sep)
		goto print_entries;

531
	fprintf(fp, "# ........");
532 533
	if (show_nr_samples)
		fprintf(fp, " ..........");
534
	list_for_each_entry(se, &hist_entry__sort_list, list) {
535
		unsigned int i;
536

537
		if (se->elide)
538 539
			continue;

540
		fprintf(fp, "  ");
541 542 543 544 545
		if (se->width)
			width = *se->width;
		else
			width = strlen(se->header);
		for (i = 0; i < width; i++)
546
			fprintf(fp, ".");
547
	}
548 549 550
	fprintf(fp, "\n");

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

552
print_entries:
553 554 555
	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);
556 557
	}

558 559
	if (sort_order == default_sort_order &&
			parent_pattern == default_parent_pattern) {
560
		fprintf(fp, "#\n");
561
		fprintf(fp, "# (For a higher level overview, try: perf report --sort comm,dso)\n");
562 563
		fprintf(fp, "#\n");
	}
564
	fprintf(fp, "\n");
565

566 567
	free(rem_sq_bracket);

568
	if (show_threads)
569 570
		perf_read_values_display(fp, &show_threads_values,
					 raw_printing_style);
571

572 573 574
	return ret;
}

575
static int validate_chain(struct ip_callchain *chain, event_t *event)
576 577 578 579 580 581
{
	unsigned int chain_size;

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

582
	if (chain->nr*sizeof(u64) > chain_size)
583 584 585 586 587
		return -1;

	return 0;
}

588
static int
589
process_sample_event(event_t *event, unsigned long offset, unsigned long head)
590 591
{
	char level;
592
	struct symbol *sym = NULL;
593 594
	u64 ip = event->ip.ip;
	u64 period = 1;
595
	struct map *map = NULL;
596
	void *more_data = event->ip.__more_data;
597
	struct ip_callchain *chain = NULL;
598
	int cpumode;
599
	struct thread *thread = threads__findnew(event->ip.pid);
600

601
	if (sample_type & PERF_SAMPLE_PERIOD) {
602 603
		period = *(u64 *)more_data;
		more_data += sizeof(u64);
604
	}
605

606
	dump_printf("%p [%p]: PERF_RECORD_SAMPLE (IP, %d): %d/%d: %p period: %Ld\n",
607 608 609
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->header.misc,
610
		event->ip.pid, event->ip.tid,
611
		(void *)(long)ip,
612
		(long long)period);
613

614
	if (sample_type & PERF_SAMPLE_CALLCHAIN) {
615
		unsigned int i;
616 617 618

		chain = (void *)more_data;

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

621 622 623 624 625 626
		if (validate_chain(chain, event) < 0) {
			eprintf("call-chain problem with event, skipping it.\n");
			return 0;
		}

		if (dump_trace) {
627
			for (i = 0; i < chain->nr; i++)
628
				dump_printf("..... %2d: %016Lx\n", i, chain->ips[i]);
629 630 631
		}
	}

632
	dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);
633 634

	if (thread == NULL) {
635
		eprintf("problem processing %d event, skipping it.\n",
636 637 638
			event->header.type);
		return -1;
	}
639

640 641 642
	if (comm_list && !strlist__has_entry(comm_list, thread->comm))
		return 0;

643
	cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK;
644

645
	if (cpumode == PERF_RECORD_MISC_KERNEL) {
646
		level = 'k';
647 648 649
		sym = kernel_maps__find_symbol(ip, &map);
		dump_printf(" ...... dso: %s\n",
			    map ? map->dso->long_name : "<not found>");
650
	} else if (cpumode == PERF_RECORD_MISC_USER) {
651
		level = '.';
652
		sym = resolve_symbol(thread, &map, &ip);
653

654 655
	} else {
		level = 'H';
656
		dump_printf(" ...... dso: [hypervisor]\n");
657
	}
658

659 660 661 662 663 664
	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;
665

666 667
	if (sym_list && sym && !strlist__has_entry(sym_list, sym->name))
		return 0;
668

669 670 671 672
	if (hist_entry__add(thread, map, sym, ip,
			    chain, level, period)) {
		eprintf("problem incrementing symbol count, skipping event\n");
		return -1;
673
	}
674

675
	total += period;
676

677 678
	return 0;
}
I
Ingo Molnar 已提交
679

680 681 682
static int
process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
{
683
	struct map *map = map__new(&event->mmap, cwd, cwdlen);
684
	struct thread *thread = threads__findnew(event->mmap.pid);
685

686
	dump_printf("%p [%p]: PERF_RECORD_MMAP %d/%d: [%p(%p) @ %p]: %s\n",
687 688
		(void *)(offset + head),
		(void *)(long)(event->header.size),
689
		event->mmap.pid,
690
		event->mmap.tid,
691 692 693 694 695 696
		(void *)(long)event->mmap.start,
		(void *)(long)event->mmap.len,
		(void *)(long)event->mmap.pgoff,
		event->mmap.filename);

	if (thread == NULL || map == NULL) {
697
		dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n");
698
		return 0;
699 700 701 702 703 704 705 706 707 708 709
	}

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

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

712
	dump_printf("%p [%p]: PERF_RECORD_COMM: %s:%d\n",
713 714 715 716 717
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->comm.comm, event->comm.pid);

	if (thread == NULL ||
718
	    thread__set_comm_adjust(thread, event->comm.comm)) {
719
		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
720
		return -1;
721
	}
722 723 724 725 726
	total_comm++;

	return 0;
}

727
static int
728
process_task_event(event_t *event, unsigned long offset, unsigned long head)
729
{
730 731
	struct thread *thread = threads__findnew(event->fork.pid);
	struct thread *parent = threads__findnew(event->fork.ppid);
732

733
	dump_printf("%p [%p]: PERF_RECORD_%s: (%d:%d):(%d:%d)\n",
734 735
		(void *)(offset + head),
		(void *)(long)(event->header.size),
736
		event->header.type == PERF_RECORD_FORK ? "FORK" : "EXIT",
737 738 739 740 741 742 743 744 745 746
		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;

747
	if (event->header.type == PERF_RECORD_EXIT)
748
		return 0;
749 750

	if (!thread || !parent || thread__fork(thread, parent)) {
751
		dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n");
752 753 754 755 756 757 758
		return -1;
	}
	total_fork++;

	return 0;
}

759 760 761
static int
process_lost_event(event_t *event, unsigned long offset, unsigned long head)
{
762
	dump_printf("%p [%p]: PERF_RECORD_LOST: id:%Ld: lost:%Ld\n",
763 764 765 766 767 768 769 770 771 772
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->lost.id,
		event->lost.lost);

	total_lost += event->lost.lost;

	return 0;
}

773 774 775
static int
process_read_event(event_t *event, unsigned long offset, unsigned long head)
{
776
	struct perf_event_attr *attr;
777 778

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

780
	if (show_threads) {
781
		const char *name = attr ? __event_name(attr->type, attr->config)
782 783 784 785 786 787 788 789
				   : "unknown";
		perf_read_values_add_value(&show_threads_values,
					   event->read.pid, event->read.tid,
					   event->read.id,
					   name,
					   event->read.value);
	}

790
	dump_printf("%p [%p]: PERF_RECORD_READ: %d %d %s %Lu\n",
791 792 793 794
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->read.pid,
			event->read.tid,
795 796
			attr ? __event_name(attr->type, attr->config)
			     : "FAIL",
797 798 799 800 801
			event->read.value);

	return 0;
}

802
static int sample_type_check(u64 type)
803
{
804
	sample_type = type;
805

806 807 808 809 810
	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");
811
			return -1;
812 813
		}
		if (callchain) {
814
			fprintf(stderr, "selected -g but no callchain data."
815 816
					" Did you call perf record without"
					" -g?\n");
817
			return -1;
818
		}
819 820 821 822 823
	} 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");
824
				return -1;
825
			}
826 827
	}

828 829
	return 0;
}
830

831 832 833 834 835 836 837 838 839 840
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,
};
841 842


843 844 845 846
static int __cmd_report(void)
{
	struct thread *idle;
	int ret;
847

848
	idle = register_idle_thread();
849
	thread__comm_adjust(idle);
I
Ingo Molnar 已提交
850

851 852
	if (show_threads)
		perf_read_values_init(&show_threads_values);
853

854
	register_perf_file_handler(&file_handler);
855

856 857 858 859
	ret = mmap_dispatch_perf_file(&header, input_name, force, full_paths,
				      &cwdlen, &cwd);
	if (ret)
		return ret;
860

861 862 863 864 865
	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);
866
	dump_printf(" unknown events: %10ld\n", file_handler.total_unknown);
867

I
Ingo Molnar 已提交
868
	if (dump_trace)
869 870
		return 0;

871
	if (verbose > 3)
872
		threads__fprintf(stdout);
873

874
	if (verbose > 2)
875 876
		dsos__fprintf(stdout);

P
Peter Zijlstra 已提交
877
	collapse__resort();
878
	output__resort(total);
879
	output__fprintf(stdout, total);
880

881 882 883
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

884
	return ret;
885 886
}

887 888 889 890
static int
parse_callchain_opt(const struct option *opt __used, const char *arg,
		    int unset __used)
{
891 892 893
	char *tok;
	char *endptr;

894 895 896 897 898
	callchain = 1;

	if (!arg)
		return 0;

899 900 901 902 903 904
	tok = strtok((char *)arg, ",");
	if (!tok)
		return -1;

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

907
	else if (!strncmp(tok, "flat", strlen(arg)))
908 909 910 911 912
		callchain_param.mode = CHAIN_FLAT;

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

913 914 915 916 917 918 919
	else if (!strncmp(tok, "none", strlen(arg))) {
		callchain_param.mode = CHAIN_NONE;
		callchain = 0;

		return 0;
	}

920 921 922
	else
		return -1;

923 924 925
	/* get the min percentage */
	tok = strtok(NULL, ",");
	if (!tok)
926
		goto setup;
927

928
	callchain_param.min_percent = strtod(tok, &endptr);
929 930 931
	if (tok == endptr)
		return -1;

932 933 934 935 936
setup:
	if (register_callchain_param(&callchain_param) < 0) {
		fprintf(stderr, "Can't register callchain params\n");
		return -1;
	}
937 938 939
	return 0;
}

940 941
//static const char * const report_usage[] = {
const char * const report_usage[] = {
942 943 944 945 946 947 948
	"perf report [<options>] <command>",
	NULL
};

static const struct option options[] = {
	OPT_STRING('i', "input", &input_name, "file",
		    "input file name"),
949 950
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
951 952
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
953
	OPT_STRING('k', "vmlinux", &vmlinux_name, "file", "vmlinux pathname"),
954
	OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
955 956
	OPT_BOOLEAN('m', "modules", &modules,
		    "load module symbols - WARNING: use only with -k and LIVE kernel"),
957 958
	OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples,
		    "Show a column with the number of samples"),
959 960
	OPT_BOOLEAN('T', "threads", &show_threads,
		    "Show per-thread event counters"),
961 962
	OPT_STRING(0, "pretty", &pretty_printing_style, "key",
		   "pretty printing style key: normal raw"),
963
	OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
964
		   "sort by key(s): pid, comm, dso, symbol, parent"),
965 966
	OPT_BOOLEAN('P', "full-paths", &full_paths,
		    "Don't shorten the pathnames taking into account the cwd"),
967 968
	OPT_STRING('p', "parent", &parent_pattern, "regex",
		   "regex filter to identify parent, see: '--sort parent'"),
969 970
	OPT_BOOLEAN('x', "exclude-other", &exclude_other,
		    "Only display entries with parent-match"),
971
	OPT_CALLBACK_DEFAULT('g', "call-graph", NULL, "output_type,min_percent",
972
		     "Display callchains using output_type and min percent threshold. "
973
		     "Default: fractal,0.5", &parse_callchain_opt, callchain_default_opt),
974 975
	OPT_STRING('d', "dsos", &dso_list_str, "dso[,dso...]",
		   "only consider symbols in these dsos"),
976 977
	OPT_STRING('C', "comms", &comm_list_str, "comm[,comm...]",
		   "only consider symbols in these comms"),
978 979
	OPT_STRING('S', "symbols", &sym_list_str, "symbol[,symbol...]",
		   "only consider these symbols"),
980 981 982 983 984 985
	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."),
986 987 988
	OPT_END()
};

989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003
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);
}

1004
static void setup_list(struct strlist **list, const char *list_str,
1005 1006
		       struct sort_entry *se, const char *list_name,
		       FILE *fp)
1007 1008 1009 1010 1011 1012 1013 1014
{
	if (list_str) {
		*list = strlist__new(true, list_str);
		if (!*list) {
			fprintf(stderr, "problems parsing %s list\n",
				list_name);
			exit(129);
		}
1015 1016 1017 1018 1019
		if (strlist__nr_entries(*list) == 1) {
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(*list, 0)->s);
			se->elide = true;
		}
1020 1021 1022
	}
}

1023
int cmd_report(int argc, const char **argv, const char *prefix __used)
1024
{
1025
	symbol__init();
1026

1027
	argc = parse_options(argc, argv, options, report_usage, 0);
1028

1029 1030
	setup_sorting();

1031
	if (parent_pattern != default_parent_pattern) {
1032
		sort_dimension__add("parent");
1033 1034
		sort_parent.elide = 1;
	} else
1035 1036
		exclude_other = 0;

1037 1038 1039 1040 1041 1042
	/*
	 * Any (unrecognized) arguments left?
	 */
	if (argc)
		usage_with_options(report_usage, options);

1043 1044
	setup_pager();

1045 1046 1047
	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);
1048

1049 1050 1051 1052 1053 1054
	if (field_sep && *field_sep == '.') {
		fputs("'.' is the only non valid --field-separator argument\n",
		      stderr);
		exit(129);
	}

1055 1056
	return __cmd_report();
}