builtin-report.c 24.8 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 60
static struct rb_root	threads;
static struct thread	*last_match;

61 62
static struct perf_header *header;

63 64
static u64		sample_type;

65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
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;
}
82
static size_t
83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
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;
100
			ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
101 102 103 104 105 106 107 108 109 110 111
		} 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;
}

112 113 114 115 116 117 118 119 120 121 122 123 124 125 126
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;
}

127 128 129 130 131 132 133 134
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;
135
	u64 new_total;
136
	u64 remaining;
137 138 139
	size_t ret = 0;
	int i;

140
	if (callchain_param.mode == CHAIN_GRAPH_REL)
141
		new_total = self->children_hit;
142 143 144
	else
		new_total = total_samples;

145 146
	remaining = new_total;

147 148
	node = rb_first(&self->rb_root);
	while (node) {
149 150
		u64 cumul;

151
		child = rb_entry(node, struct callchain_node, rb_node);
152 153
		cumul = cumul_hits(child);
		remaining -= cumul;
154 155 156 157

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

186 187 188 189 190 191 192 193 194 195 196 197 198
	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);
	}

199 200 201 202 203 204
	return ret;
}

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

	if (!self)
		return 0;

212
	ret += callchain__fprintf_flat(fp, self->parent, total_samples);
213 214


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

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

	return ret;
}

263
static size_t
264
hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
265 266 267 268
{
	struct sort_entry *se;
	size_t ret;

269 270 271
	if (exclude_other && !self->parent)
		return 0;

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

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

286
	list_for_each_entry(se, &hist_entry__sort_list, list) {
287
		if (se->elide)
288 289
			continue;

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

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

296 297 298
	if (callchain)
		hist_entry_callchain__fprintf(fp, self, total_samples);

299 300 301
	return ret;
}

302 303 304 305
/*
 *
 */

306 307 308 309 310 311 312 313 314 315 316 317
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;
}

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

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

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);
341 342 343 344 345

	return 0;
}


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

	if (map)
		goto got_map;

355 356 357
	if (!thread)
		return NULL;

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

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

391
	return map ? map->dso->find_symbol(map->dso, ip) : NULL;
392 393
}

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

399
	return 0;
400 401
}

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

	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];
420
		struct symbol *sym = NULL;
421 422 423 424 425 426 427

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

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

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

	return syms;
}

450 451 452 453
/*
 * collect histogram counts
 */

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

463
	if ((sort__has_parent || callchain) && chain)
464
		syms = resolve_callchain(thread, map, chain, &parent);
465

466 467 468 469
	he = __hist_entry__add(thread, map, sym, parent,
			       ip, count, level, &hit);
	if (he == NULL)
		return -ENOMEM;
470

471 472
	if (hit)
		he->count += count;
473

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

	return 0;
482 483
}

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

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

496 497
	init_rem_hits();

498
	fprintf(fp, "# Samples: %Ld\n", (u64)total_samples);
499 500 501
	fprintf(fp, "#\n");

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

531 532 533
	if (field_sep)
		goto print_entries;

534
	fprintf(fp, "# ........");
535 536
	if (show_nr_samples)
		fprintf(fp, " ..........");
537
	list_for_each_entry(se, &hist_entry__sort_list, list) {
538
		unsigned int i;
539

540
		if (se->elide)
541 542
			continue;

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

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

555
print_entries:
556 557 558
	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);
559 560
	}

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

569 570
	free(rem_sq_bracket);

571
	if (show_threads)
572 573
		perf_read_values_display(fp, &show_threads_values,
					 raw_printing_style);
574

575 576 577
	return ret;
}

578
static int validate_chain(struct ip_callchain *chain, event_t *event)
579 580 581 582 583 584
{
	unsigned int chain_size;

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

585
	if (chain->nr*sizeof(u64) > chain_size)
586 587 588 589 590
		return -1;

	return 0;
}

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

604 605
	thread = threads__findnew(event->ip.pid, &threads, &last_match);

606
	if (sample_type & PERF_SAMPLE_PERIOD) {
607 608
		period = *(u64 *)more_data;
		more_data += sizeof(u64);
609
	}
610

611
	dump_printf("%p [%p]: PERF_RECORD_SAMPLE (IP, %d): %d/%d: %p period: %Ld\n",
612 613 614
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->header.misc,
615
		event->ip.pid, event->ip.tid,
616
		(void *)(long)ip,
617
		(long long)period);
618

619
	if (sample_type & PERF_SAMPLE_CALLCHAIN) {
620
		unsigned int i;
621 622 623

		chain = (void *)more_data;

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

626 627 628 629 630 631
		if (validate_chain(chain, event) < 0) {
			eprintf("call-chain problem with event, skipping it.\n");
			return 0;
		}

		if (dump_trace) {
632
			for (i = 0; i < chain->nr; i++)
633
				dump_printf("..... %2d: %016Lx\n", i, chain->ips[i]);
634 635 636
		}
	}

637
	dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);
638 639

	if (thread == NULL) {
640
		eprintf("problem processing %d event, skipping it.\n",
641 642 643
			event->header.type);
		return -1;
	}
644

645 646 647
	if (comm_list && !strlist__has_entry(comm_list, thread->comm))
		return 0;

648
	cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK;
649

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

659 660
	} else {
		level = 'H';
661
		dump_printf(" ...... dso: [hypervisor]\n");
662
	}
663

664 665 666 667 668 669
	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;
670

671 672
	if (sym_list && sym && !strlist__has_entry(sym_list, sym->name))
		return 0;
673

674 675 676 677
	if (hist_entry__add(thread, map, sym, ip,
			    chain, level, period)) {
		eprintf("problem incrementing symbol count, skipping event\n");
		return -1;
678
	}
679

680
	total += period;
681

682 683
	return 0;
}
I
Ingo Molnar 已提交
684

685 686 687
static int
process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
{
688
	struct thread *thread;
689
	struct map *map = map__new(&event->mmap, cwd, cwdlen);
690

691 692
	thread = threads__findnew(event->mmap.pid, &threads, &last_match);

693
	dump_printf("%p [%p]: PERF_RECORD_MMAP %d/%d: [%p(%p) @ %p]: %s\n",
694 695
		(void *)(offset + head),
		(void *)(long)(event->header.size),
696
		event->mmap.pid,
697
		event->mmap.tid,
698 699 700 701 702 703
		(void *)(long)event->mmap.start,
		(void *)(long)event->mmap.len,
		(void *)(long)event->mmap.pgoff,
		event->mmap.filename);

	if (thread == NULL || map == NULL) {
704
		dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n");
705
		return 0;
706 707 708 709 710 711 712 713 714 715 716
	}

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

static int
process_comm_event(event_t *event, unsigned long offset, unsigned long head)
{
717 718 719
	struct thread *thread;

	thread = threads__findnew(event->comm.pid, &threads, &last_match);
720

721
	dump_printf("%p [%p]: PERF_RECORD_COMM: %s:%d\n",
722 723 724 725 726
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->comm.comm, event->comm.pid);

	if (thread == NULL ||
727
	    thread__set_comm_adjust(thread, event->comm.comm)) {
728
		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
729
		return -1;
730
	}
731 732 733 734 735
	total_comm++;

	return 0;
}

736
static int
737
process_task_event(event_t *event, unsigned long offset, unsigned long head)
738
{
739 740 741 742 743
	struct thread *thread;
	struct thread *parent;

	thread = threads__findnew(event->fork.pid, &threads, &last_match);
	parent = threads__findnew(event->fork.ppid, &threads, &last_match);
744

745
	dump_printf("%p [%p]: PERF_RECORD_%s: (%d:%d):(%d:%d)\n",
746 747
		(void *)(offset + head),
		(void *)(long)(event->header.size),
748
		event->header.type == PERF_RECORD_FORK ? "FORK" : "EXIT",
749 750 751 752 753 754 755 756 757 758
		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;

759
	if (event->header.type == PERF_RECORD_EXIT)
760
		return 0;
761 762

	if (!thread || !parent || thread__fork(thread, parent)) {
763
		dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n");
764 765 766 767 768 769 770
		return -1;
	}
	total_fork++;

	return 0;
}

771 772 773
static int
process_lost_event(event_t *event, unsigned long offset, unsigned long head)
{
774
	dump_printf("%p [%p]: PERF_RECORD_LOST: id:%Ld: lost:%Ld\n",
775 776 777 778 779 780 781 782 783 784
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->lost.id,
		event->lost.lost);

	total_lost += event->lost.lost;

	return 0;
}

785 786 787
static int
process_read_event(event_t *event, unsigned long offset, unsigned long head)
{
788
	struct perf_event_attr *attr;
789 790

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

792
	if (show_threads) {
793
		const char *name = attr ? __event_name(attr->type, attr->config)
794 795 796 797 798 799 800 801
				   : "unknown";
		perf_read_values_add_value(&show_threads_values,
					   event->read.pid, event->read.tid,
					   event->read.id,
					   name,
					   event->read.value);
	}

802
	dump_printf("%p [%p]: PERF_RECORD_READ: %d %d %s %Lu\n",
803 804 805 806
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->read.pid,
			event->read.tid,
807 808
			attr ? __event_name(attr->type, attr->config)
			     : "FAIL",
809 810 811 812 813
			event->read.value);

	return 0;
}

814
static int sample_type_check(u64 type)
815
{
816
	sample_type = type;
817

818 819 820 821 822
	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");
823
			return -1;
824 825
		}
		if (callchain) {
826
			fprintf(stderr, "selected -g but no callchain data."
827 828
					" Did you call perf record without"
					" -g?\n");
829
			return -1;
830
		}
831 832 833 834 835
	} 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");
836
				return -1;
837
			}
838 839
	}

840 841
	return 0;
}
842

843 844 845 846 847 848 849 850 851 852
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,
};
853 854


855 856 857 858
static int __cmd_report(void)
{
	struct thread *idle;
	int ret;
859

860 861
	idle = register_idle_thread(&threads, &last_match);
	thread__comm_adjust(idle);
I
Ingo Molnar 已提交
862

863 864
	if (show_threads)
		perf_read_values_init(&show_threads_values);
865

866
	register_perf_file_handler(&file_handler);
867

868 869 870 871
	ret = mmap_dispatch_perf_file(&header, input_name, force, full_paths,
				      &cwdlen, &cwd);
	if (ret)
		return ret;
872

873 874 875 876 877
	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);
878
	dump_printf(" unknown events: %10ld\n", file_handler.total_unknown);
879

I
Ingo Molnar 已提交
880
	if (dump_trace)
881 882
		return 0;

883
	if (verbose >= 3)
884
		threads__fprintf(stdout, &threads);
885

886
	if (verbose >= 2)
887 888
		dsos__fprintf(stdout);

P
Peter Zijlstra 已提交
889
	collapse__resort();
890
	output__resort(total);
891
	output__fprintf(stdout, total);
892

893 894 895
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

896
	return ret;
897 898
}

899 900 901 902
static int
parse_callchain_opt(const struct option *opt __used, const char *arg,
		    int unset __used)
{
903 904 905
	char *tok;
	char *endptr;

906 907 908 909 910
	callchain = 1;

	if (!arg)
		return 0;

911 912 913 914 915 916
	tok = strtok((char *)arg, ",");
	if (!tok)
		return -1;

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

919
	else if (!strncmp(tok, "flat", strlen(arg)))
920 921 922 923 924
		callchain_param.mode = CHAIN_FLAT;

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

925 926 927 928 929 930 931
	else if (!strncmp(tok, "none", strlen(arg))) {
		callchain_param.mode = CHAIN_NONE;
		callchain = 0;

		return 0;
	}

932 933 934
	else
		return -1;

935 936 937
	/* get the min percentage */
	tok = strtok(NULL, ",");
	if (!tok)
938
		goto setup;
939

940
	callchain_param.min_percent = strtod(tok, &endptr);
941 942 943
	if (tok == endptr)
		return -1;

944 945 946 947 948
setup:
	if (register_callchain_param(&callchain_param) < 0) {
		fprintf(stderr, "Can't register callchain params\n");
		return -1;
	}
949 950 951
	return 0;
}

952 953
//static const char * const report_usage[] = {
const char * const report_usage[] = {
954 955 956 957 958 959 960
	"perf report [<options>] <command>",
	NULL
};

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

1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015
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);
}

1016
static void setup_list(struct strlist **list, const char *list_str,
1017 1018
		       struct sort_entry *se, const char *list_name,
		       FILE *fp)
1019 1020 1021 1022 1023 1024 1025 1026
{
	if (list_str) {
		*list = strlist__new(true, list_str);
		if (!*list) {
			fprintf(stderr, "problems parsing %s list\n",
				list_name);
			exit(129);
		}
1027 1028 1029 1030 1031
		if (strlist__nr_entries(*list) == 1) {
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(*list, 0)->s);
			se->elide = true;
		}
1032 1033 1034
	}
}

1035
int cmd_report(int argc, const char **argv, const char *prefix __used)
1036
{
1037
	symbol__init();
1038

1039
	argc = parse_options(argc, argv, options, report_usage, 0);
1040

1041 1042
	setup_sorting();

1043
	if (parent_pattern != default_parent_pattern) {
1044
		sort_dimension__add("parent");
1045 1046
		sort_parent.elide = 1;
	} else
1047 1048
		exclude_other = 0;

1049 1050 1051 1052 1053 1054
	/*
	 * Any (unrecognized) arguments left?
	 */
	if (argc)
		usage_with_options(report_usage, options);

1055 1056
	setup_pager();

1057 1058 1059
	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);
1060

1061 1062 1063 1064 1065 1066
	if (field_sep && *field_sep == '.') {
		fputs("'.' is the only non valid --field-separator argument\n",
		      stderr);
		exit(129);
	}

1067 1068
	return __cmd_report();
}