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

#include <libelf.h>
5 6
#include <gelf.h>
#include <elf.h>
7

8
#include "util/list.h"
9
#include "util/cache.h"
10
#include "util/rbtree.h"
11

12 13 14 15 16
#include "perf.h"

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

17 18 19 20
#define SHOW_KERNEL	1
#define SHOW_USER	2
#define SHOW_HV		4

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

27
static int		dump_trace = 0;
28
static int		verbose;
29

30 31 32
static unsigned long	page_size;
static unsigned long	mmap_window = 32;

33
const char *perf_event_names[] = {
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
	[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;

struct symbol {
66 67 68 69
	struct rb_node		rb_node;
	__u64			start;
	__u64			end;
	char			name[0];
70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91
};

static struct symbol *symbol__new(uint64_t start, uint64_t len, const char *name)
{
	struct symbol *self = malloc(sizeof(*self) + strlen(name) + 1);

	if (self != NULL) {
		self->start = start;
		self->end   = start + len;
		strcpy(self->name, name);
	}

	return self;
}

static void symbol__delete(struct symbol *self)
{
	free(self);
}

static size_t symbol__fprintf(struct symbol *self, FILE *fp)
{
92
	return fprintf(fp, " %llx-%llx %s\n",
93 94 95 96 97
		       self->start, self->end, self->name);
}

struct dso {
	struct list_head node;
98
	struct rb_root	 syms;
99 100 101 102 103 104 105 106 107
	char		 name[0];
};

static struct dso *dso__new(const char *name)
{
	struct dso *self = malloc(sizeof(*self) + strlen(name) + 1);

	if (self != NULL) {
		strcpy(self->name, name);
108
		self->syms = RB_ROOT;
109 110 111 112 113 114 115
	}

	return self;
}

static void dso__delete_symbols(struct dso *self)
{
116 117
	struct symbol *pos;
	struct rb_node *next = rb_first(&self->syms);
118

119 120 121
	while (next) {
		pos = rb_entry(next, struct symbol, rb_node);
		next = rb_next(&pos->rb_node);
122
		symbol__delete(pos);
123
	}
124 125 126 127 128 129 130 131 132 133
}

static void dso__delete(struct dso *self)
{
	dso__delete_symbols(self);
	free(self);
}

static void dso__insert_symbol(struct dso *self, struct symbol *sym)
{
134 135 136 137 138 139 140 141 142 143 144 145 146 147 148
	struct rb_node **p = &self->syms.rb_node;
	struct rb_node *parent = NULL;
	const uint64_t ip = sym->start;
	struct symbol *s;

	while (*p != NULL) {
		parent = *p;
		s = rb_entry(parent, struct symbol, rb_node);
		if (ip < s->start)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}
	rb_link_node(&sym->rb_node, parent, p);
	rb_insert_color(&sym->rb_node, &self->syms);
149 150 151 152
}

static struct symbol *dso__find_symbol(struct dso *self, uint64_t ip)
{
153 154
	struct rb_node *n;

155 156 157
	if (self == NULL)
		return NULL;

158
	n = self->syms.rb_node;
159

160 161 162 163 164 165 166 167 168 169
	while (n) {
		struct symbol *s = rb_entry(n, struct symbol, rb_node);

		if (ip < s->start)
			n = n->rb_left;
		else if (ip > s->end)
			n = n->rb_right;
		else
			return s;
	}
170 171 172 173

	return NULL;
}

174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
/**
 * elf_symtab__for_each_symbol - iterate thru all the symbols
 *
 * @self: struct elf_symtab instance to iterate
 * @index: uint32_t index
 * @sym: GElf_Sym iterator
 */
#define elf_symtab__for_each_symbol(syms, nr_syms, index, sym) \
	for (index = 0, gelf_getsym(syms, index, &sym);\
	     index < nr_syms; \
	     index++, gelf_getsym(syms, index, &sym))

static inline uint8_t elf_sym__type(const GElf_Sym *sym)
{
	return GELF_ST_TYPE(sym->st_info);
}

191
static inline int elf_sym__is_function(const GElf_Sym *sym)
192 193 194
{
	return elf_sym__type(sym) == STT_FUNC &&
	       sym->st_name != 0 &&
195 196
	       sym->st_shndx != SHN_UNDEF &&
	       sym->st_size != 0;
197 198 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 226 227
}

static inline const char *elf_sym__name(const GElf_Sym *sym,
					const Elf_Data *symstrs)
{
	return symstrs->d_buf + sym->st_name;
}

static Elf_Scn *elf_section_by_name(Elf *elf, GElf_Ehdr *ep,
				    GElf_Shdr *shp, const char *name,
				    size_t *index)
{
	Elf_Scn *sec = NULL;
	size_t cnt = 1;

	while ((sec = elf_nextscn(elf, sec)) != NULL) {
		char *str;

		gelf_getshdr(sec, shp);
		str = elf_strptr(elf, ep->e_shstrndx, shp->sh_name);
		if (!strcmp(name, str)) {
			if (index)
				*index = cnt;
			break;
		}
		++cnt;
	}

	return sec;
}

228
static int dso__load_sym(struct dso *self, int fd, char *name)
229
{
230 231
	Elf_Data *symstrs;
	uint32_t nr_syms;
232
	int err = -1;
233 234 235 236 237 238 239
	uint32_t index;
	GElf_Ehdr ehdr;
	GElf_Shdr shdr;
	Elf_Data *syms;
	GElf_Sym sym;
	Elf_Scn *sec;
	Elf *elf;
240
	int nr = 0;
241

242
	elf = elf_begin(fd, ELF_C_READ_MMAP, NULL);
243 244
	if (elf == NULL) {
		fprintf(stderr, "%s: cannot read %s ELF file.\n",
245
			__func__, name);
246 247 248 249 250 251 252 253
		goto out_close;
	}

	if (gelf_getehdr(elf, &ehdr) == NULL) {
		fprintf(stderr, "%s: cannot get elf header.\n", __func__);
		goto out_elf_end;
	}

254
	sec = elf_section_by_name(elf, &ehdr, &shdr, ".symtab", NULL);
255 256 257 258 259 260
	if (sec == NULL)
		sec = elf_section_by_name(elf, &ehdr, &shdr, ".dynsym", NULL);

	if (sec == NULL)
		goto out_elf_end;

261
	syms = elf_getdata(sec, NULL);
262 263 264 265 266 267 268
	if (syms == NULL)
		goto out_elf_end;

	sec = elf_getscn(elf, shdr.sh_link);
	if (sec == NULL)
		goto out_elf_end;

269
	symstrs = elf_getdata(sec, NULL);
270 271 272
	if (symstrs == NULL)
		goto out_elf_end;

273
	nr_syms = shdr.sh_size / shdr.sh_entsize;
274 275

	elf_symtab__for_each_symbol(syms, nr_syms, index, sym) {
276 277
		struct symbol *f;

278 279
		if (!elf_sym__is_function(&sym))
			continue;
280 281 282 283 284 285 286 287 288 289 290

		sec = elf_getscn(elf, sym.st_shndx);
		if (!sec)
			goto out_elf_end;

		gelf_getshdr(sec, &shdr);
		sym.st_value -= shdr.sh_addr - shdr.sh_offset;

		f = symbol__new(sym.st_value, sym.st_size,
				elf_sym__name(&sym, symstrs));
		if (!f)
291 292 293
			goto out_elf_end;

		dso__insert_symbol(self, f);
294 295

		nr++;
296 297
	}

298
	err = nr;
299 300 301 302
out_elf_end:
	elf_end(elf);
out_close:
	return err;
303 304
}

305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350
static int dso__load(struct dso *self)
{
	int size = strlen(self->name) + sizeof("/usr/lib/debug%s.debug");
	char *name = malloc(size);
	int variant = 0;
	int ret = -1;
	int fd;

	if (!name)
		return -1;

more:
	do {
		switch (variant) {
		case 0: /* Fedora */
			snprintf(name, size, "/usr/lib/debug%s.debug", self->name);
			break;
		case 1: /* Ubuntu */
			snprintf(name, size, "/usr/lib/debug%s", self->name);
			break;
		case 2: /* Sane people */
			snprintf(name, size, "%s", self->name);
			break;

		default:
			goto out;
		}
		variant++;

		fd = open(name, O_RDONLY);
	} while (fd < 0);

	ret = dso__load_sym(self, fd, name);
	close(fd);

	/*
	 * Some people seem to have debuginfo files _WITHOUT_ debug info!?!?
	 */
	if (!ret)
		goto more;

out:
	free(name);
	return ret;
}

351 352 353 354
static size_t dso__fprintf(struct dso *self, FILE *fp)
{
	size_t ret = fprintf(fp, "dso: %s\n", self->name);

355 356 357
	struct rb_node *nd;
	for (nd = rb_first(&self->syms); nd; nd = rb_next(nd)) {
		struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
358
		ret += symbol__fprintf(pos, fp);
359
	}
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384

	return ret;
}

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);
385
	int nr;
386 387 388

	if (dso == NULL) {
		dso = dso__new(name);
389 390 391 392 393 394
		if (!dso)
			goto out_delete_dso;

		nr = dso__load(dso);
		if (nr < 0) {
			fprintf(stderr, "Failed to open: %s\n", name);
395
			goto out_delete_dso;
396 397 398 399 400 401
		}
		if (!nr) {
			fprintf(stderr,
		"Failed to find debug symbols for: %s, maybe install a debug package?\n",
					name);
		}
402 403 404 405 406 407 408 409 410 411 412

		dsos__add(dso);
	}

	return dso;

out_delete_dso:
	dso__delete(dso);
	return NULL;
}

413
static void dsos__fprintf(FILE *fp)
414 415 416 417 418 419 420
{
	struct dso *pos;

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

421 422 423 424 425 426 427 428 429 430 431 432 433 434 435
static int hex(char ch)
{
	if ((ch >= '0') && (ch <= '9'))
		return ch - '0';
	if ((ch >= 'a') && (ch <= 'f'))
		return ch - 'a' + 10;
	if ((ch >= 'A') && (ch <= 'F'))
		return ch - 'A' + 10;
	return -1;
}

/*
 * While we find nice hex chars, build a long_val.
 * Return number of chars processed.
 */
436
static int hex2long(char *ptr, unsigned long *long_val)
437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453
{
	const char *p = ptr;
	*long_val = 0;

	while (*p) {
		const int hex_val = hex(*p);

		if (hex_val < 0)
			break;

		*long_val = (*long_val << 4) | hex_val;
		p++;
	}

	return p - ptr;
}

454 455
static int load_kallsyms(void)
{
456 457 458 459 460
	struct rb_node *nd, *prevnd;
	char *line = NULL;
	FILE *file;
	size_t n;

461 462 463 464
	kernel_dso = dso__new("[kernel]");
	if (kernel_dso == NULL)
		return -1;

465
	file = fopen("/proc/kallsyms", "r");
466 467 468 469
	if (file == NULL)
		goto out_delete_dso;

	while (!feof(file)) {
470
		unsigned long start;
471 472 473 474 475
		struct symbol *sym;
		int line_len, len;
		char symbol_type;

		line_len = getline(&line, &n, file);
476
		if (line_len < 0)
477 478 479 480 481
			break;

		if (!line)
			goto out_delete_dso;

482
		line[--line_len] = '\0'; /* \n */
483

484 485
		len = hex2long(line, &start);

486 487 488 489
		len++;
		if (len + 2 >= line_len)
			continue;

490
		symbol_type = toupper(line[len]);
491 492 493
		/*
		 * We're interested only in code ('T'ext)
		 */
494
		if (symbol_type != 'T' && symbol_type != 'W')
495 496 497 498
			continue;
		/*
		 * Well fix up the end later, when we have all sorted.
		 */
499
		sym = symbol__new(start, 0xdead, line + len + 2);
500

501 502 503 504
		if (sym == NULL)
			goto out_delete_dso;

		dso__insert_symbol(kernel_dso, sym);
505 506
	}

507 508 509 510
	/*
	 * Now that we have all sorted out, just set the ->end of all
	 * symbols
	 */
511
	prevnd = rb_first(&kernel_dso->syms);
512 513 514 515 516 517 518 519 520 521 522 523

	if (prevnd == NULL)
		goto out_delete_line;

	for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) {
		struct symbol *prev = rb_entry(prevnd, struct symbol, rb_node),
			      *curr = rb_entry(nd, struct symbol, rb_node);

		prev->end = curr->start - 1;
		prevnd = nd;
	}

524 525 526
	dsos__add(kernel_dso);
	free(line);
	fclose(file);
527

528 529
	return 0;

530 531
out_delete_line:
	free(line);
532 533 534 535 536
out_delete_dso:
	dso__delete(kernel_dso);
	return -1;
}

537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569
static int load_kernel(void)
{
	int fd, nr;

	if (!vmlinux)
		goto kallsyms;

	fd = open(vmlinux, O_RDONLY);
	if (fd < 0)
		goto kallsyms;

	kernel_dso = dso__new("[kernel]");
	if (!kernel_dso)
		goto fail_open;

	nr = dso__load_sym(kernel_dso, fd, vmlinux);

	if (nr <= 0)
		goto fail_load;

	dsos__add(kernel_dso);
	close(fd);

	return 0;

fail_load:
	dso__delete(kernel_dso);
fail_open:
	close(fd);
kallsyms:
	return load_kallsyms();
}

570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596
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;
}

597 598 599 600
struct thread;

static const char *thread__name(struct thread *self, char *bf, size_t size);

601
struct thread {
602
	struct rb_node	 rb_node;
603 604 605 606 607
	struct list_head maps;
	pid_t		 pid;
	char		 *comm;
};

608 609 610 611 612 613 614 615 616
static const char *thread__name(struct thread *self, char *bf, size_t size)
{
	if (self->comm)
		return self->comm;

	snprintf(bf, sizeof(bf), ":%u", self->pid);
	return bf;
}

617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635
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;
}

636
static struct rb_root threads;
637

638
static struct thread *threads__findnew(pid_t pid)
639
{
640 641 642
	struct rb_node **p = &threads.rb_node;
	struct rb_node *parent = NULL;
	struct thread *th;
643

644 645 646
	while (*p != NULL) {
		parent = *p;
		th = rb_entry(parent, struct thread, rb_node);
647

648 649
		if (th->pid == pid)
			return th;
650

651 652 653 654
		if (pid < th->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
655 656
	}

657 658 659 660 661 662
	th = thread__new(pid);
	if (th != NULL) {
		rb_link_node(&th->rb_node, parent, p);
		rb_insert_color(&th->rb_node, &threads);
	}
	return th;
663 664 665 666 667 668 669 670 671
}

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)
{
672 673
	struct map *pos;

674 675 676 677 678 679 680 681 682 683
	if (self == NULL)
		return NULL;

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

	return NULL;
}

684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702
/*
 * 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;
};

703 704 705 706 707 708 709 710
/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

	int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
711
	size_t (*print_header)(FILE *fp);
712 713 714
	size_t	(*print)(FILE *fp, struct hist_entry *);
};

715
static int64_t
716
sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
717
{
718 719 720 721 722 723 724 725
	return right->thread->pid - left->thread->pid;
}

static size_t
sort__thread_print(FILE *fp, struct hist_entry *self)
{
	char bf[32];

726
	return fprintf(fp, " %16s",
727 728
			thread__name(self->thread, bf, sizeof(bf)));
}
729

730 731 732 733 734
static struct sort_entry sort_thread = {
	.cmp	= sort__thread_cmp,
	.print	= sort__thread_print,
};

735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755
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)
{
756
	return fprintf(fp, " %16s", self->thread->comm ?: "<unknown>");
757 758 759 760 761 762 763
}

static struct sort_entry sort_comm = {
	.cmp	= sort__comm_cmp,
	.print	= sort__comm_print,
};

764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784
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)
{
785
	return fprintf(fp, " %64s", self->dso ? self->dso->name : "<unknown>");
786 787 788 789 790 791 792
}

static struct sort_entry sort_dso = {
	.cmp	= sort__dso_cmp,
	.print	= sort__dso_print,
};

793 794 795 796
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t ip_l, ip_r;
797 798 799 800 801 802 803 804 805 806

	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);
}

807 808 809 810 811 812 813 814 815 816 817 818
static size_t sort__sym_print_header(FILE *fp)
{
	size_t ret = 0;

	ret += fprintf(fp, "#\n");
	ret += fprintf(fp, "# Overhead          Command       File: Symbol\n");
	ret += fprintf(fp, "# ........          .......       ............\n");
	ret += fprintf(fp, "#\n");

	return ret;
}

819 820 821 822 823
static size_t
sort__sym_print(FILE *fp, struct hist_entry *self)
{
	size_t ret = 0;

824
	ret += fprintf(fp, "  [%c] ", self->level);
825 826

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

	if (self->level != '.')
830
		ret += fprintf(fp, " kernel: %s",
831 832
			       self->sym ? self->sym->name : "<unknown>");
	else
833
		ret += fprintf(fp, " %s: %s",
834 835 836 837 838 839 840
			       self->dso ? self->dso->name : "<unknown>",
			       self->sym ? self->sym->name : "<unknown>");

	return ret;
}

static struct sort_entry sort_sym = {
841 842 843
	.cmp		= sort__sym_cmp,
	.print_header	= sort__sym_print_header,
	.print		= sort__sym_print,
844 845
};

846 847 848 849 850 851 852 853
struct sort_dimension {
	char *name;
	struct sort_entry *entry;
	int taken;
};

static struct sort_dimension sort_dimensions[] = {
	{ .name = "pid",	.entry = &sort_thread,	},
854
	{ .name = "comm",	.entry = &sort_comm,	},
855
	{ .name = "dso",	.entry = &sort_dso,	},
856 857 858
	{ .name = "symbol",	.entry = &sort_sym,	},
};

859 860
static LIST_HEAD(hist_entry__sort_list);

861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881
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;
}

882 883
static void setup_sorting(void)
{
884 885 886 887 888 889 890
	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);
891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914
}

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) {
915
		ret = fprintf(fp, "    %5.2f%%",
916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931
				(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
 */

932 933 934
static int
hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
		struct symbol *sym, uint64_t ip, char level)
935
{
936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964
	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;
965
	}
966 967 968 969 970 971 972 973 974

	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;
975 976
}

977 978 979 980 981 982 983
/*
 * reverse the map, sort on count.
 */

static struct rb_root output_hists;

static void output__insert_entry(struct hist_entry *he)
984
{
985
	struct rb_node **p = &output_hists.rb_node;
986
	struct rb_node *parent = NULL;
987
	struct hist_entry *iter;
988 989 990

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

993
		if (he->count > iter->count)
994 995 996 997 998
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

999 1000
	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &output_hists);
1001 1002
}

1003
static void output__resort(void)
1004
{
1005 1006
	struct rb_node *next = rb_first(&hist);
	struct hist_entry *n;
1007

1008 1009 1010
	while (next) {
		n = rb_entry(next, struct hist_entry, rb_node);
		next = rb_next(&n->rb_node);
1011

1012 1013
		rb_erase(&n->rb_node, &hist);
		output__insert_entry(n);
1014 1015 1016
	}
}

1017
static size_t output__fprintf(FILE *fp, uint64_t total_samples)
1018
{
1019
	struct hist_entry *pos;
1020
	struct sort_entry *se;
1021 1022 1023
	struct rb_node *nd;
	size_t ret = 0;

1024 1025 1026 1027 1028
	list_for_each_entry(se, &hist_entry__sort_list, list) {
		if (se->print_header)
			ret += se->print_header(fp);
	}

1029 1030 1031
	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);
1032 1033 1034 1035 1036
	}

	return ret;
}

1037

1038
static int __cmd_report(void)
1039 1040 1041 1042 1043 1044 1045
{
	unsigned long offset = 0;
	unsigned long head = 0;
	struct stat stat;
	char *buf;
	event_t *event;
	int ret, rc = EXIT_FAILURE;
1046
	uint32_t size;
I
Ingo Molnar 已提交
1047
	unsigned long total = 0, total_mmap = 0, total_comm = 0, total_unknown = 0;
1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065

	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);
	}

1066
	if (load_kernel() < 0) {
1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081
		perror("failed to open kallsyms");
		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);

1082 1083 1084 1085
	size = event->header.size;
	if (!size)
		size = 8;

1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097
	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;
	}

1098 1099 1100
	size = event->header.size;
	if (!size)
		goto broken_event;
1101 1102 1103 1104 1105 1106

	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);
1107
		uint64_t ip = event->ip.ip;
1108
		struct map *map = NULL;
1109

1110
		if (dump_trace) {
I
Ingo Molnar 已提交
1111 1112 1113
			fprintf(stderr, "%p [%p]: PERF_EVENT (IP, %d): %d: %p\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
1114 1115
				event->header.misc,
				event->ip.pid,
1116
				(void *)(long)ip);
1117 1118
		}

1119
		if (thread == NULL) {
1120
			fprintf(stderr, "problem processing %d event, skipping it.\n",
1121
				event->header.type);
1122
			goto broken_event;
1123
		}
1124 1125 1126 1127

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

1129
			dso = kernel_dso;
1130

1131
		} else if (event->header.misc & PERF_EVENT_MISC_USER) {
1132

1133 1134
			show = SHOW_USER;
			level = '.';
1135 1136

			map = thread__find_map(thread, ip);
1137
			if (map != NULL) {
1138
				dso = map->dso;
1139 1140
				ip -= map->start + map->pgoff;
			}
1141

1142 1143 1144 1145 1146 1147
		} else {
			show = SHOW_HV;
			level = 'H';
		}

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

1150 1151
			if (hist_entry__add(thread, map, dso, sym, ip, level)) {
				fprintf(stderr,
1152 1153
		"problem incrementing symbol count, skipping event\n");
				goto broken_event;
1154
			}
1155 1156 1157 1158 1159 1160 1161
		}
		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);

1162
		if (dump_trace) {
I
Ingo Molnar 已提交
1163 1164 1165
			fprintf(stderr, "%p [%p]: PERF_EVENT_MMAP: [%p(%p) @ %p]: %s\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
1166 1167 1168
				(void *)(long)event->mmap.start,
				(void *)(long)event->mmap.len,
				(void *)(long)event->mmap.pgoff,
1169 1170
				event->mmap.filename);
		}
1171
		if (thread == NULL || map == NULL) {
1172 1173
			fprintf(stderr, "problem processing PERF_EVENT_MMAP, skipping event.\n");
			goto broken_event;
1174
		}
1175
		thread__insert_map(thread, map);
1176
		total_mmap++;
1177 1178 1179 1180 1181
		break;
	}
	case PERF_EVENT_COMM: {
		struct thread *thread = threads__findnew(event->comm.pid);

1182
		if (dump_trace) {
I
Ingo Molnar 已提交
1183 1184 1185
			fprintf(stderr, "%p [%p]: PERF_EVENT_COMM: %s:%d\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
1186 1187
				event->comm.comm, event->comm.pid);
		}
1188
		if (thread == NULL ||
1189
		    thread__set_comm(thread, event->comm.comm)) {
1190 1191
			fprintf(stderr, "problem processing PERF_EVENT_COMM, skipping event.\n");
			goto broken_event;
1192
		}
1193
		total_comm++;
1194 1195
		break;
	}
1196
	default: {
1197
broken_event:
1198 1199 1200 1201 1202 1203
		if (dump_trace)
			fprintf(stderr, "%p [%p]: skipping unknown header type: %d\n",
					(void *)(offset + head),
					(void *)(long)(event->header.size),
					event->header.type);

1204
		total_unknown++;
1205 1206 1207 1208 1209 1210 1211 1212 1213 1214

		/*
		 * 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;
1215
	}
1216 1217
	}

1218
	head += size;
I
Ingo Molnar 已提交
1219

1220 1221 1222 1223 1224
	if (offset + head < stat.st_size)
		goto more;

	rc = EXIT_SUCCESS;
	close(input);
1225 1226

	if (dump_trace) {
1227 1228 1229 1230
		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);
1231 1232 1233 1234

		return 0;
	}

1235
	if (verbose >= 2)
1236 1237
		dsos__fprintf(stdout);

1238 1239
	output__resort();
	output__fprintf(stdout, total);
1240 1241 1242 1243

	return rc;
}

1244 1245 1246 1247 1248 1249 1250 1251
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"),
1252 1253
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
1254 1255
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
1256
	OPT_STRING('k', "vmlinux", &vmlinux, "file", "vmlinux pathname"),
1257
	OPT_STRING('s', "sort", &sort_order, "foo", "bar"),
1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268
	OPT_END()
};

int cmd_report(int argc, const char **argv, const char *prefix)
{
	elf_version(EV_CURRENT);

	page_size = getpagesize();

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

1269 1270
	setup_sorting();

1271 1272
	setup_pager();

1273 1274
	return __cmd_report();
}