builtin-report.c 16.0 KB
Newer Older
1
#include "util/util.h"
2
#include "builtin.h"
3

4
#include "util/list.h"
5
#include "util/cache.h"
6
#include "util/rbtree.h"
7
#include "util/symbol.h"
8

9 10 11 12 13
#include "perf.h"

#include "util/parse-options.h"
#include "util/parse-events.h"

14 15 16 17
#define SHOW_KERNEL	1
#define SHOW_USER	2
#define SHOW_HV		4

18
static char		const *input_name = "perf.data";
19
static char		*vmlinux = NULL;
20
static char		*sort_order = "pid,symbol";
21 22 23
static int		input;
static int		show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV;

24
static int		dump_trace = 0;
25
static int		verbose;
26

27 28 29
static unsigned long	page_size;
static unsigned long	mmap_window = 32;

30
const char *perf_event_names[] = {
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82
	[PERF_EVENT_MMAP]   = " PERF_EVENT_MMAP",
	[PERF_EVENT_MUNMAP] = " PERF_EVENT_MUNMAP",
	[PERF_EVENT_COMM]   = " PERF_EVENT_COMM",
};

struct ip_event {
	struct perf_event_header header;
	__u64 ip;
	__u32 pid, tid;
};
struct mmap_event {
	struct perf_event_header header;
	__u32 pid, tid;
	__u64 start;
	__u64 len;
	__u64 pgoff;
	char filename[PATH_MAX];
};
struct comm_event {
	struct perf_event_header header;
	__u32 pid,tid;
	char comm[16];
};

typedef union event_union {
	struct perf_event_header header;
	struct ip_event ip;
	struct mmap_event mmap;
	struct comm_event comm;
} event_t;

static LIST_HEAD(dsos);
static struct dso *kernel_dso;

static void dsos__add(struct dso *dso)
{
	list_add_tail(&dso->node, &dsos);
}

static struct dso *dsos__find(const char *name)
{
	struct dso *pos;

	list_for_each_entry(pos, &dsos, node)
		if (strcmp(pos->name, name) == 0)
			return pos;
	return NULL;
}

static struct dso *dsos__findnew(const char *name)
{
	struct dso *dso = dsos__find(name);
83
	int nr;
84 85

	if (dso == NULL) {
86
		dso = dso__new(name, 0);
87 88 89
		if (!dso)
			goto out_delete_dso;

90
		nr = dso__load(dso, NULL);
91 92
		if (nr < 0) {
			fprintf(stderr, "Failed to open: %s\n", name);
93
			goto out_delete_dso;
94 95 96 97 98 99
		}
		if (!nr) {
			fprintf(stderr,
		"Failed to find debug symbols for: %s, maybe install a debug package?\n",
					name);
		}
100 101 102 103 104 105 106 107 108 109 110

		dsos__add(dso);
	}

	return dso;

out_delete_dso:
	dso__delete(dso);
	return NULL;
}

111
static void dsos__fprintf(FILE *fp)
112 113 114 115 116 117 118
{
	struct dso *pos;

	list_for_each_entry(pos, &dsos, node)
		dso__fprintf(pos, fp);
}

119 120
static int load_kernel(void)
{
121
	int err;
122

123
	kernel_dso = dso__new("[kernel]", 0);
124
	if (!kernel_dso)
125
		return -1;
126

127
	err = dso__load_kernel(kernel_dso, vmlinux, NULL);
128 129 130 131 132
	if (err) {
		dso__delete(kernel_dso);
		kernel_dso = NULL;
	} else
		dsos__add(kernel_dso);
133

134
	return err;
135 136
}

137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
struct map {
	struct list_head node;
	uint64_t	 start;
	uint64_t	 end;
	uint64_t	 pgoff;
	struct dso	 *dso;
};

static struct map *map__new(struct mmap_event *event)
{
	struct map *self = malloc(sizeof(*self));

	if (self != NULL) {
		self->start = event->start;
		self->end   = event->start + event->len;
		self->pgoff = event->pgoff;

		self->dso = dsos__findnew(event->filename);
		if (self->dso == NULL)
			goto out_delete;
	}
	return self;
out_delete:
	free(self);
	return NULL;
}

164 165
struct thread;

166
struct thread {
167
	struct rb_node	 rb_node;
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
	struct list_head maps;
	pid_t		 pid;
	char		 *comm;
};

static struct thread *thread__new(pid_t pid)
{
	struct thread *self = malloc(sizeof(*self));

	if (self != NULL) {
		self->pid = pid;
		self->comm = NULL;
		INIT_LIST_HEAD(&self->maps);
	}

	return self;
}

static int thread__set_comm(struct thread *self, const char *comm)
{
	self->comm = strdup(comm);
	return self->comm ? 0 : -ENOMEM;
}

192
static struct rb_root threads;
193

194
static struct thread *threads__findnew(pid_t pid)
195
{
196 197 198
	struct rb_node **p = &threads.rb_node;
	struct rb_node *parent = NULL;
	struct thread *th;
199

200 201 202
	while (*p != NULL) {
		parent = *p;
		th = rb_entry(parent, struct thread, rb_node);
203

204 205
		if (th->pid == pid)
			return th;
206

207 208 209 210
		if (pid < th->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
211 212
	}

213 214 215 216 217 218
	th = thread__new(pid);
	if (th != NULL) {
		rb_link_node(&th->rb_node, parent, p);
		rb_insert_color(&th->rb_node, &threads);
	}
	return th;
219 220 221 222 223 224 225 226 227
}

static void thread__insert_map(struct thread *self, struct map *map)
{
	list_add_tail(&map->node, &self->maps);
}

static struct map *thread__find_map(struct thread *self, uint64_t ip)
{
228 229
	struct map *pos;

230 231 232 233 234 235 236 237 238 239
	if (self == NULL)
		return NULL;

	list_for_each_entry(pos, &self->maps, node)
		if (ip >= pos->start && ip <= pos->end)
			return pos;

	return NULL;
}

240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258
/*
 * histogram, sorted on item, collects counts
 */

static struct rb_root hist;

struct hist_entry {
	struct rb_node	 rb_node;

	struct thread	 *thread;
	struct map	 *map;
	struct dso	 *dso;
	struct symbol	 *sym;
	uint64_t	 ip;
	char		 level;

	uint32_t	 count;
};

259 260 261 262 263 264 265
/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

266 267
	char *header;

268 269 270 271
	int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
	size_t	(*print)(FILE *fp, struct hist_entry *);
};

272
static int64_t
273
sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
274
{
275 276 277 278 279 280
	return right->thread->pid - left->thread->pid;
}

static size_t
sort__thread_print(FILE *fp, struct hist_entry *self)
{
281
	return fprintf(fp, " %16s:%5d", self->thread->comm ?: "", self->thread->pid);
282
}
283

284
static struct sort_entry sort_thread = {
285
	.header = "         Command: Pid ",
286 287 288 289
	.cmp	= sort__thread_cmp,
	.print	= sort__thread_print,
};

290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
static int64_t
sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
{
	char *comm_l = left->thread->comm;
	char *comm_r = right->thread->comm;

	if (!comm_l || !comm_r) {
		if (!comm_l && !comm_r)
			return 0;
		else if (!comm_l)
			return -1;
		else
			return 1;
	}

	return strcmp(comm_l, comm_r);
}

static size_t
sort__comm_print(FILE *fp, struct hist_entry *self)
{
311
	return fprintf(fp, " %16s", self->thread->comm ?: "<unknown>");
312 313 314
}

static struct sort_entry sort_comm = {
315
	.header = "         Command",
316 317 318 319
	.cmp	= sort__comm_cmp,
	.print	= sort__comm_print,
};

320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
static int64_t
sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
{
	struct dso *dso_l = left->dso;
	struct dso *dso_r = right->dso;

	if (!dso_l || !dso_r) {
		if (!dso_l && !dso_r)
			return 0;
		else if (!dso_l)
			return -1;
		else
			return 1;
	}

	return strcmp(dso_l->name, dso_r->name);
}

static size_t
sort__dso_print(FILE *fp, struct hist_entry *self)
{
341
	return fprintf(fp, " %64s", self->dso ? self->dso->name : "<unknown>");
342 343 344
}

static struct sort_entry sort_dso = {
345
	.header = "                                                    Shared Object",
346 347 348 349
	.cmp	= sort__dso_cmp,
	.print	= sort__dso_print,
};

350 351 352 353
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t ip_l, ip_r;
354 355 356 357 358 359 360 361 362 363

	if (left->sym == right->sym)
		return 0;

	ip_l = left->sym ? left->sym->start : left->ip;
	ip_r = right->sym ? right->sym->start : right->ip;

	return (int64_t)(ip_r - ip_l);
}

364 365 366 367 368 369
static size_t
sort__sym_print(FILE *fp, struct hist_entry *self)
{
	size_t ret = 0;

	if (verbose)
370
		ret += fprintf(fp, " %#018llx", (unsigned long long)self->ip);
371

372 373 374
	ret += fprintf(fp, " %s: %s",
			self->dso ? self->dso->name : "<unknown>",
			self->sym ? self->sym->name : "<unknown>");
375 376 377 378 379

	return ret;
}

static struct sort_entry sort_sym = {
380 381 382
	.header = "Shared Object: Symbol",
	.cmp	= sort__sym_cmp,
	.print	= sort__sym_print,
383 384
};

385 386 387 388 389 390 391 392
struct sort_dimension {
	char *name;
	struct sort_entry *entry;
	int taken;
};

static struct sort_dimension sort_dimensions[] = {
	{ .name = "pid",	.entry = &sort_thread,	},
393
	{ .name = "comm",	.entry = &sort_comm,	},
394
	{ .name = "dso",	.entry = &sort_dso,	},
395 396 397
	{ .name = "symbol",	.entry = &sort_sym,	},
};

398 399
static LIST_HEAD(hist_entry__sort_list);

400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420
static int sort_dimension__add(char *tok)
{
	int i;

	for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
		struct sort_dimension *sd = &sort_dimensions[i];

		if (sd->taken)
			continue;

		if (strcmp(tok, sd->name))
			continue;

		list_add_tail(&sd->entry->list, &hist_entry__sort_list);
		sd->taken = 1;
		return 0;
	}

	return -ESRCH;
}

421 422
static void setup_sorting(void)
{
423 424 425 426 427 428 429
	char *tmp, *tok, *str = strdup(sort_order);

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp))
		sort_dimension__add(tok);

	free(str);
430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453
}

static int64_t
hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
{
	struct sort_entry *se;
	int64_t cmp = 0;

	list_for_each_entry(se, &hist_entry__sort_list, list) {
		cmp = se->cmp(left, right);
		if (cmp)
			break;
	}

	return cmp;
}

static size_t
hist_entry__fprintf(FILE *fp, struct hist_entry *self, uint64_t total_samples)
{
	struct sort_entry *se;
	size_t ret;

	if (total_samples) {
454
		ret = fprintf(fp, "    %5.2f%%",
455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470
				(self->count * 100.0) / total_samples);
	} else
		ret = fprintf(fp, "%12d ", self->count);

	list_for_each_entry(se, &hist_entry__sort_list, list)
		ret += se->print(fp, self);

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

	return ret;
}

/*
 * collect histogram counts
 */

471 472 473
static int
hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
		struct symbol *sym, uint64_t ip, char level)
474
{
475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503
	struct rb_node **p = &hist.rb_node;
	struct rb_node *parent = NULL;
	struct hist_entry *he;
	struct hist_entry entry = {
		.thread	= thread,
		.map	= map,
		.dso	= dso,
		.sym	= sym,
		.ip	= ip,
		.level	= level,
		.count	= 1,
	};
	int cmp;

	while (*p != NULL) {
		parent = *p;
		he = rb_entry(parent, struct hist_entry, rb_node);

		cmp = hist_entry__cmp(&entry, he);

		if (!cmp) {
			he->count++;
			return 0;
		}

		if (cmp < 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
504
	}
505 506 507 508 509 510 511 512 513

	he = malloc(sizeof(*he));
	if (!he)
		return -ENOMEM;
	*he = entry;
	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &hist);

	return 0;
514 515
}

516 517 518 519 520 521 522
/*
 * reverse the map, sort on count.
 */

static struct rb_root output_hists;

static void output__insert_entry(struct hist_entry *he)
523
{
524
	struct rb_node **p = &output_hists.rb_node;
525
	struct rb_node *parent = NULL;
526
	struct hist_entry *iter;
527 528 529

	while (*p != NULL) {
		parent = *p;
530
		iter = rb_entry(parent, struct hist_entry, rb_node);
531

532
		if (he->count > iter->count)
533 534 535 536 537
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

538 539
	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &output_hists);
540 541
}

542
static void output__resort(void)
543
{
544 545
	struct rb_node *next = rb_first(&hist);
	struct hist_entry *n;
546

547 548 549
	while (next) {
		n = rb_entry(next, struct hist_entry, rb_node);
		next = rb_next(&n->rb_node);
550

551 552
		rb_erase(&n->rb_node, &hist);
		output__insert_entry(n);
553 554 555
	}
}

556
static size_t output__fprintf(FILE *fp, uint64_t total_samples)
557
{
558
	struct hist_entry *pos;
559
	struct sort_entry *se;
560 561 562
	struct rb_node *nd;
	size_t ret = 0;

563 564 565 566 567 568 569 570
	fprintf(fp, "#\n");

	fprintf(fp, "# Overhead");
	list_for_each_entry(se, &hist_entry__sort_list, list)
		fprintf(fp, " %s", se->header);
	fprintf(fp, "\n");

	fprintf(fp, "# ........");
571
	list_for_each_entry(se, &hist_entry__sort_list, list) {
572 573 574 575 576
		int i;

		fprintf(fp, " ");
		for (i = 0; i < strlen(se->header); i++)
			fprintf(fp, ".");
577
	}
578 579 580
	fprintf(fp, "\n");

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

582 583 584
	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);
585 586 587 588 589
	}

	return ret;
}

590

591
static int __cmd_report(void)
592 593 594 595 596 597 598
{
	unsigned long offset = 0;
	unsigned long head = 0;
	struct stat stat;
	char *buf;
	event_t *event;
	int ret, rc = EXIT_FAILURE;
599
	uint32_t size;
I
Ingo Molnar 已提交
600
	unsigned long total = 0, total_mmap = 0, total_comm = 0, total_unknown = 0;
601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618

	input = open(input_name, O_RDONLY);
	if (input < 0) {
		perror("failed to open file");
		exit(-1);
	}

	ret = fstat(input, &stat);
	if (ret < 0) {
		perror("failed to stat file");
		exit(-1);
	}

	if (!stat.st_size) {
		fprintf(stderr, "zero-sized file, nothing to do!\n");
		exit(0);
	}

619
	if (load_kernel() < 0) {
620
		perror("failed to load kernel symbols");
621 622 623 624 625 626 627 628 629 630 631 632 633 634
		return EXIT_FAILURE;
	}

remap:
	buf = (char *)mmap(NULL, page_size * mmap_window, PROT_READ,
			   MAP_SHARED, input, offset);
	if (buf == MAP_FAILED) {
		perror("failed to mmap file");
		exit(-1);
	}

more:
	event = (event_t *)(buf + head);

635 636 637 638
	size = event->header.size;
	if (!size)
		size = 8;

639 640 641 642 643 644 645 646 647 648 649 650
	if (head + event->header.size >= page_size * mmap_window) {
		unsigned long shift = page_size * (head / page_size);
		int ret;

		ret = munmap(buf, page_size * mmap_window);
		assert(ret == 0);

		offset += shift;
		head -= shift;
		goto remap;
	}

651 652 653
	size = event->header.size;
	if (!size)
		goto broken_event;
654 655 656 657 658 659

	if (event->header.misc & PERF_EVENT_MISC_OVERFLOW) {
		char level;
		int show = 0;
		struct dso *dso = NULL;
		struct thread *thread = threads__findnew(event->ip.pid);
660
		uint64_t ip = event->ip.ip;
661
		struct map *map = NULL;
662

663
		if (dump_trace) {
I
Ingo Molnar 已提交
664 665 666
			fprintf(stderr, "%p [%p]: PERF_EVENT (IP, %d): %d: %p\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
667 668
				event->header.misc,
				event->ip.pid,
669
				(void *)(long)ip);
670 671
		}

672
		if (thread == NULL) {
673
			fprintf(stderr, "problem processing %d event, skipping it.\n",
674
				event->header.type);
675
			goto broken_event;
676
		}
677 678 679 680

		if (event->header.misc & PERF_EVENT_MISC_KERNEL) {
			show = SHOW_KERNEL;
			level = 'k';
681

682
			dso = kernel_dso;
683

684
		} else if (event->header.misc & PERF_EVENT_MISC_USER) {
685

686 687
			show = SHOW_USER;
			level = '.';
688 689

			map = thread__find_map(thread, ip);
690
			if (map != NULL) {
691
				dso = map->dso;
692 693
				ip -= map->start + map->pgoff;
			}
694

695 696 697 698 699 700
		} else {
			show = SHOW_HV;
			level = 'H';
		}

		if (show & show_mask) {
701
			struct symbol *sym = dso__find_symbol(dso, ip);
702

703 704
			if (hist_entry__add(thread, map, dso, sym, ip, level)) {
				fprintf(stderr,
705 706
		"problem incrementing symbol count, skipping event\n");
				goto broken_event;
707
			}
708 709 710 711 712 713 714
		}
		total++;
	} else switch (event->header.type) {
	case PERF_EVENT_MMAP: {
		struct thread *thread = threads__findnew(event->mmap.pid);
		struct map *map = map__new(&event->mmap);

715
		if (dump_trace) {
I
Ingo Molnar 已提交
716 717 718
			fprintf(stderr, "%p [%p]: PERF_EVENT_MMAP: [%p(%p) @ %p]: %s\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
719 720 721
				(void *)(long)event->mmap.start,
				(void *)(long)event->mmap.len,
				(void *)(long)event->mmap.pgoff,
722 723
				event->mmap.filename);
		}
724
		if (thread == NULL || map == NULL) {
725 726
			fprintf(stderr, "problem processing PERF_EVENT_MMAP, skipping event.\n");
			goto broken_event;
727
		}
728
		thread__insert_map(thread, map);
729
		total_mmap++;
730 731 732 733 734
		break;
	}
	case PERF_EVENT_COMM: {
		struct thread *thread = threads__findnew(event->comm.pid);

735
		if (dump_trace) {
I
Ingo Molnar 已提交
736 737 738
			fprintf(stderr, "%p [%p]: PERF_EVENT_COMM: %s:%d\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
739 740
				event->comm.comm, event->comm.pid);
		}
741
		if (thread == NULL ||
742
		    thread__set_comm(thread, event->comm.comm)) {
743 744
			fprintf(stderr, "problem processing PERF_EVENT_COMM, skipping event.\n");
			goto broken_event;
745
		}
746
		total_comm++;
747 748
		break;
	}
749
	default: {
750
broken_event:
751 752 753 754 755 756
		if (dump_trace)
			fprintf(stderr, "%p [%p]: skipping unknown header type: %d\n",
					(void *)(offset + head),
					(void *)(long)(event->header.size),
					event->header.type);

757
		total_unknown++;
758 759 760 761 762 763 764 765 766 767

		/*
		 * assume we lost track of the stream, check alignment, and
		 * increment a single u64 in the hope to catch on again 'soon'.
		 */

		if (unlikely(head & 7))
			head &= ~7ULL;

		size = 8;
768
	}
769 770
	}

771
	head += size;
I
Ingo Molnar 已提交
772

773 774 775 776 777
	if (offset + head < stat.st_size)
		goto more;

	rc = EXIT_SUCCESS;
	close(input);
778 779

	if (dump_trace) {
780 781 782 783
		fprintf(stderr, "      IP events: %10ld\n", total);
		fprintf(stderr, "    mmap events: %10ld\n", total_mmap);
		fprintf(stderr, "    comm events: %10ld\n", total_comm);
		fprintf(stderr, " unknown events: %10ld\n", total_unknown);
784 785 786 787

		return 0;
	}

788
	if (verbose >= 2)
789 790
		dsos__fprintf(stdout);

791 792
	output__resort();
	output__fprintf(stdout, total);
793 794 795 796

	return rc;
}

797 798 799 800 801 802 803 804
static const char * const report_usage[] = {
	"perf report [<options>] <command>",
	NULL
};

static const struct option options[] = {
	OPT_STRING('i', "input", &input_name, "file",
		    "input file name"),
805 806
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
807 808
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
809
	OPT_STRING('k', "vmlinux", &vmlinux, "file", "vmlinux pathname"),
810 811
	OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
		   "sort by key(s): pid, comm, dso, symbol. Default: pid,symbol"),
812 813 814 815 816
	OPT_END()
};

int cmd_report(int argc, const char **argv, const char *prefix)
{
817
	symbol__init();
818 819 820 821 822

	page_size = getpagesize();

	parse_options(argc, argv, options, report_usage, 0);

823 824
	setup_sorting();

825 826
	setup_pager();

827 828
	return __cmd_report();
}