builtin-annotate.c 22.8 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
/*
 * builtin-annotate.c
 *
 * Builtin annotate 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.
 */
#include "builtin.h"

#include "util/util.h"

#include "util/color.h"
13
#include <linux/list.h>
14
#include "util/cache.h"
15
#include <linux/rbtree.h>
16 17 18 19
#include "util/symbol.h"
#include "util/string.h"

#include "perf.h"
20
#include "util/debug.h"
21 22 23

#include "util/parse-options.h"
#include "util/parse-events.h"
24
#include "util/thread.h"
25 26 27

static char		const *input_name = "perf.data";

28
static char		default_sort_order[] = "comm,symbol";
29 30
static char		*sort_order = default_sort_order;

31
static int		force;
32 33 34
static int		input;
static int		show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV;

35 36
static int		full_paths;

37 38
static int		print_line;

39 40 41
static unsigned long	page_size;
static unsigned long	mmap_window = 32;

42 43 44
static struct rb_root	threads;
static struct thread	*last_match;

45 46

struct sym_ext {
47
	struct rb_node	node;
48 49 50 51
	double		percent;
	char		*path;
};

52 53 54 55 56 57 58 59 60 61 62 63 64
/*
 * 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;
65
	u64	 ip;
66 67 68 69 70 71 72 73 74 75 76 77
	char		 level;

	uint32_t	 count;
};

/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

78
	const char *header;
79 80 81 82 83 84

	int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
	int64_t (*collapse)(struct hist_entry *, struct hist_entry *);
	size_t	(*print)(FILE *fp, struct hist_entry *);
};

85 86 87 88 89 90 91 92 93 94
static int64_t cmp_null(void *l, void *r)
{
	if (!l && !r)
		return 0;
	else if (!l)
		return -1;
	else
		return 1;
}

95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128
/* --sort pid */

static int64_t
sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return right->thread->pid - left->thread->pid;
}

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

static struct sort_entry sort_thread = {
	.header = "         Command:  Pid",
	.cmp	= sort__thread_cmp,
	.print	= sort__thread_print,
};

/* --sort comm */

static int64_t
sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return right->thread->pid - left->thread->pid;
}

static int64_t
sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
{
	char *comm_l = left->thread->comm;
	char *comm_r = right->thread->comm;

129 130
	if (!comm_l || !comm_r)
		return cmp_null(comm_l, comm_r);
131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155

	return strcmp(comm_l, comm_r);
}

static size_t
sort__comm_print(FILE *fp, struct hist_entry *self)
{
	return fprintf(fp, "%16s", self->thread->comm);
}

static struct sort_entry sort_comm = {
	.header		= "         Command",
	.cmp		= sort__comm_cmp,
	.collapse	= sort__comm_collapse,
	.print		= sort__comm_print,
};

/* --sort dso */

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;

156 157
	if (!dso_l || !dso_r)
		return cmp_null(dso_l, dso_r);
158 159 160 161 162 163 164 165 166 167

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

static size_t
sort__dso_print(FILE *fp, struct hist_entry *self)
{
	if (self->dso)
		return fprintf(fp, "%-25s", self->dso->name);

168
	return fprintf(fp, "%016llx         ", (u64)self->ip);
169 170 171 172 173 174 175 176 177 178 179 180 181
}

static struct sort_entry sort_dso = {
	.header = "Shared Object            ",
	.cmp	= sort__dso_cmp,
	.print	= sort__dso_print,
};

/* --sort symbol */

static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
{
182
	u64 ip_l, ip_r;
183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198

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

static size_t
sort__sym_print(FILE *fp, struct hist_entry *self)
{
	size_t ret = 0;

	if (verbose)
199
		ret += fprintf(fp, "%#018llx  ", (u64)self->ip);
200 201 202 203 204

	if (self->sym) {
		ret += fprintf(fp, "[%c] %s",
			self->dso == kernel_dso ? 'k' : '.', self->sym->name);
	} else {
205
		ret += fprintf(fp, "%#016llx", (u64)self->ip);
206 207 208 209 210 211 212 213 214 215 216 217 218 219
	}

	return ret;
}

static struct sort_entry sort_sym = {
	.header = "Symbol",
	.cmp	= sort__sym_cmp,
	.print	= sort__sym_print,
};

static int sort__need_collapse = 0;

struct sort_dimension {
220
	const char		*name;
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235
	struct sort_entry	*entry;
	int			taken;
};

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

static LIST_HEAD(hist_entry__sort_list);

static int sort_dimension__add(char *tok)
{
236
	unsigned int i;
237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292

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

		if (sd->taken)
			continue;

		if (strncasecmp(tok, sd->name, strlen(tok)))
			continue;

		if (sd->entry->collapse)
			sort__need_collapse = 1;

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

		return 0;
	}

	return -ESRCH;
}

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 int64_t
hist_entry__collapse(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) {
		int64_t (*f)(struct hist_entry *, struct hist_entry *);

		f = se->collapse ?: se->cmp;

		cmp = f(left, right);
		if (cmp)
			break;
	}

	return cmp;
}

293 294 295
/*
 * collect histogram counts
 */
296
static void hist_hit(struct hist_entry *he, u64 ip)
297
{
298 299
	unsigned int sym_size, offset;
	struct symbol *sym = he->sym;
300

301
	he->count++;
302

303 304
	if (!sym || !sym->hist)
		return;
305

306 307
	sym_size = sym->end - sym->start;
	offset = ip - sym->start;
308

309 310
	if (offset >= sym_size)
		return;
311

312 313
	sym->hist_sum++;
	sym->hist[offset]++;
314

315 316
	if (verbose >= 3)
		printf("%p %s: count++ [ip: %p, %08Lx] => %Ld\n",
317
			(void *)(unsigned long)he->sym->start,
318
			he->sym->name,
319
			(void *)(unsigned long)ip, ip - he->sym->start,
320
			sym->hist[offset]);
321 322 323 324
}

static int
hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
325
		struct symbol *sym, u64 ip, char level)
326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347
{
	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) {
348 349
			hist_hit(he, ip);

350 351 352 353 354 355 356 357 358 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 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479
			return 0;
		}

		if (cmp < 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

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

static void hist_entry__free(struct hist_entry *he)
{
	free(he);
}

/*
 * collapse the histogram
 */

static struct rb_root collapse_hists;

static void collapse__insert_entry(struct hist_entry *he)
{
	struct rb_node **p = &collapse_hists.rb_node;
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
	int64_t cmp;

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

		cmp = hist_entry__collapse(iter, he);

		if (!cmp) {
			iter->count += he->count;
			hist_entry__free(he);
			return;
		}

		if (cmp < 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &collapse_hists);
}

static void collapse__resort(void)
{
	struct rb_node *next;
	struct hist_entry *n;

	if (!sort__need_collapse)
		return;

	next = rb_first(&hist);
	while (next) {
		n = rb_entry(next, struct hist_entry, rb_node);
		next = rb_next(&n->rb_node);

		rb_erase(&n->rb_node, &hist);
		collapse__insert_entry(n);
	}
}

/*
 * reverse the map, sort on count.
 */

static struct rb_root output_hists;

static void output__insert_entry(struct hist_entry *he)
{
	struct rb_node **p = &output_hists.rb_node;
	struct rb_node *parent = NULL;
	struct hist_entry *iter;

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

		if (he->count > iter->count)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &output_hists);
}

static void output__resort(void)
{
	struct rb_node *next;
	struct hist_entry *n;
	struct rb_root *tree = &hist;

	if (sort__need_collapse)
		tree = &collapse_hists;

	next = rb_first(tree);

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

		rb_erase(&n->rb_node, tree);
		output__insert_entry(n);
	}
}

static unsigned long total = 0,
		     total_mmap = 0,
		     total_comm = 0,
		     total_fork = 0,
		     total_unknown = 0;

static int
480
process_sample_event(event_t *event, unsigned long offset, unsigned long head)
481 482 483 484
{
	char level;
	int show = 0;
	struct dso *dso = NULL;
485
	struct thread *thread;
486
	u64 ip = event->ip.ip;
487 488
	struct map *map = NULL;

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

491
	dump_printf("%p [%p]: PERF_EVENT (IP, %d): %d: %p\n",
492 493 494 495 496 497
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->header.misc,
		event->ip.pid,
		(void *)(long)ip);

498
	dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);
499 500 501 502 503 504 505

	if (thread == NULL) {
		fprintf(stderr, "problem processing %d event, skipping it.\n",
			event->header.type);
		return -1;
	}

506
	if (event->header.misc & PERF_RECORD_MISC_KERNEL) {
507 508 509 510 511
		show = SHOW_KERNEL;
		level = 'k';

		dso = kernel_dso;

512
		dump_printf(" ...... dso: %s\n", dso->name);
513

514
	} else if (event->header.misc & PERF_RECORD_MISC_USER) {
515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532

		show = SHOW_USER;
		level = '.';

		map = thread__find_map(thread, ip);
		if (map != NULL) {
			ip = map->map_ip(map, ip);
			dso = map->dso;
		} 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
			 * vsyscall (which executes in user-mode):
			 */
			if ((long long)ip < 0)
				dso = kernel_dso;
		}
533
		dump_printf(" ...... dso: %s\n", dso ? dso->name : "<not found>");
534 535 536 537

	} else {
		show = SHOW_HV;
		level = 'H';
538
		dump_printf(" ...... dso: [hypervisor]\n");
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560
	}

	if (show & show_mask) {
		struct symbol *sym = NULL;

		if (dso)
			sym = dso->find_symbol(dso, ip);

		if (hist_entry__add(thread, map, dso, sym, ip, level)) {
			fprintf(stderr,
		"problem incrementing symbol count, skipping event\n");
			return -1;
		}
	}
	total++;

	return 0;
}

static int
process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
{
561
	struct thread *thread;
562
	struct map *map = map__new(&event->mmap, NULL, 0);
563

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

566
	dump_printf("%p [%p]: PERF_RECORD_MMAP %d: [%p(%p) @ %p]: %s\n",
567 568 569 570 571 572 573 574 575
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->mmap.pid,
		(void *)(long)event->mmap.start,
		(void *)(long)event->mmap.len,
		(void *)(long)event->mmap.pgoff,
		event->mmap.filename);

	if (thread == NULL || map == NULL) {
576
		dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n");
577 578 579 580 581 582 583 584 585 586 587 588
		return 0;
	}

	thread__insert_map(thread, map);
	total_mmap++;

	return 0;
}

static int
process_comm_event(event_t *event, unsigned long offset, unsigned long head)
{
589
	struct thread *thread;
590

591
	thread = threads__findnew(event->comm.pid, &threads, &last_match);
592
	dump_printf("%p [%p]: PERF_RECORD_COMM: %s:%d\n",
593 594 595 596 597 598
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->comm.comm, event->comm.pid);

	if (thread == NULL ||
	    thread__set_comm(thread, event->comm.comm)) {
599
		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
600 601 602 603 604 605 606 607 608 609
		return -1;
	}
	total_comm++;

	return 0;
}

static int
process_fork_event(event_t *event, unsigned long offset, unsigned long head)
{
610 611
	struct thread *thread;
	struct thread *parent;
612

613 614
	thread = threads__findnew(event->fork.pid, &threads, &last_match);
	parent = threads__findnew(event->fork.ppid, &threads, &last_match);
615
	dump_printf("%p [%p]: PERF_RECORD_FORK: %d:%d\n",
616 617 618 619
		(void *)(offset + head),
		(void *)(long)(event->header.size),
		event->fork.pid, event->fork.ppid);

620 621 622 623 624 625 626
	/*
	 * A thread clone will have the same PID for both
	 * parent and child.
	 */
	if (thread == parent)
		return 0;

627
	if (!thread || !parent || thread__fork(thread, parent)) {
628
		dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n");
629 630 631 632 633 634 635 636 637 638 639
		return -1;
	}
	total_fork++;

	return 0;
}

static int
process_event(event_t *event, unsigned long offset, unsigned long head)
{
	switch (event->header.type) {
640
	case PERF_RECORD_SAMPLE:
641 642
		return process_sample_event(event, offset, head);

643
	case PERF_RECORD_MMAP:
644 645
		return process_mmap_event(event, offset, head);

646
	case PERF_RECORD_COMM:
647 648
		return process_comm_event(event, offset, head);

649
	case PERF_RECORD_FORK:
650 651 652 653 654
		return process_fork_event(event, offset, head);
	/*
	 * We dont process them right now but they are fine:
	 */

655 656
	case PERF_RECORD_THROTTLE:
	case PERF_RECORD_UNTHROTTLE:
657 658 659 660 661 662 663 664 665
		return 0;

	default:
		return -1;
	}

	return 0;
}

666
static int
667
parse_line(FILE *file, struct symbol *sym, u64 start, u64 len)
668 669
{
	char *line = NULL, *tmp, *tmp2;
670 671
	static const char *prev_line;
	static const char *prev_color;
672 673
	unsigned int offset;
	size_t line_len;
674
	s64 line_ip;
675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710
	int ret;
	char *c;

	if (getline(&line, &line_len, file) < 0)
		return -1;
	if (!line)
		return -1;

	c = strchr(line, '\n');
	if (c)
		*c = 0;

	line_ip = -1;
	offset = 0;
	ret = -2;

	/*
	 * Strip leading spaces:
	 */
	tmp = line;
	while (*tmp) {
		if (*tmp != ' ')
			break;
		tmp++;
	}

	if (*tmp) {
		/*
		 * Parse hexa addresses followed by ':'
		 */
		line_ip = strtoull(tmp, &tmp2, 16);
		if (*tmp2 != ':')
			line_ip = -1;
	}

	if (line_ip != -1) {
711
		const char *path = NULL;
712 713
		unsigned int hits = 0;
		double percent = 0.0;
714
		const char *color;
715
		struct sym_ext *sym_ext = sym->priv;
716 717 718 719 720

		offset = line_ip - start;
		if (offset < len)
			hits = sym->hist[offset];

721
		if (offset < len && sym_ext) {
722 723 724
			path = sym_ext[offset].path;
			percent = sym_ext[offset].percent;
		} else if (sym->hist_sum)
725 726
			percent = 100.0 * hits / sym->hist_sum;

727
		color = get_percent_color(percent);
728

729 730 731 732 733 734 735 736 737 738 739 740 741 742
		/*
		 * Also color the filename and line if needed, with
		 * the same color than the percentage. Don't print it
		 * twice for close colored ip with the same filename:line
		 */
		if (path) {
			if (!prev_line || strcmp(prev_line, path)
				       || color != prev_color) {
				color_fprintf(stdout, color, " %s", path);
				prev_line = path;
				prev_color = color;
			}
		}

743 744 745 746 747 748 749 750 751 752 753 754 755
		color_fprintf(stdout, color, " %7.2f", percent);
		printf(" :	");
		color_fprintf(stdout, PERF_COLOR_BLUE, "%s\n", line);
	} else {
		if (!*line)
			printf("         :\n");
		else
			printf("         :	%s\n", line);
	}

	return 0;
}

756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777
static struct rb_root root_sym_ext;

static void insert_source_line(struct sym_ext *sym_ext)
{
	struct sym_ext *iter;
	struct rb_node **p = &root_sym_ext.rb_node;
	struct rb_node *parent = NULL;

	while (*p != NULL) {
		parent = *p;
		iter = rb_entry(parent, struct sym_ext, node);

		if (sym_ext->percent > iter->percent)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&sym_ext->node, parent, p);
	rb_insert_color(&sym_ext->node, &root_sym_ext);
}

778 779 780 781 782 783 784 785 786 787 788 789 790
static void free_source_line(struct symbol *sym, int len)
{
	struct sym_ext *sym_ext = sym->priv;
	int i;

	if (!sym_ext)
		return;

	for (i = 0; i < len; i++)
		free(sym_ext[i].path);
	free(sym_ext);

	sym->priv = NULL;
791
	root_sym_ext = RB_ROOT;
792 793 794
}

/* Get the filename:line for the colored entries */
795
static void
796
get_source_line(struct symbol *sym, u64 start, int len, const char *filename)
797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813
{
	int i;
	char cmd[PATH_MAX * 2];
	struct sym_ext *sym_ext;

	if (!sym->hist_sum)
		return;

	sym->priv = calloc(len, sizeof(struct sym_ext));
	if (!sym->priv)
		return;

	sym_ext = sym->priv;

	for (i = 0; i < len; i++) {
		char *path = NULL;
		size_t line_len;
814
		u64 offset;
815 816 817 818 819 820 821
		FILE *fp;

		sym_ext[i].percent = 100.0 * sym->hist[i] / sym->hist_sum;
		if (sym_ext[i].percent <= 0.5)
			continue;

		offset = start + i;
822
		sprintf(cmd, "addr2line -e %s %016llx", filename, offset);
823 824 825 826 827 828 829
		fp = popen(cmd, "r");
		if (!fp)
			continue;

		if (getline(&path, &line_len, fp) < 0 || !line_len)
			goto next;

830
		sym_ext[i].path = malloc(sizeof(char) * line_len + 1);
831 832 833 834
		if (!sym_ext[i].path)
			goto next;

		strcpy(sym_ext[i].path, path);
835
		insert_source_line(&sym_ext[i]);
836 837 838 839 840 841

	next:
		pclose(fp);
	}
}

842
static void print_summary(const char *filename)
843 844 845 846 847 848 849 850 851 852 853 854 855 856 857
{
	struct sym_ext *sym_ext;
	struct rb_node *node;

	printf("\nSorted summary for file %s\n", filename);
	printf("----------------------------------------------\n\n");

	if (RB_EMPTY_ROOT(&root_sym_ext)) {
		printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
		return;
	}

	node = rb_first(&root_sym_ext);
	while (node) {
		double percent;
858
		const char *color;
859 860 861 862
		char *path;

		sym_ext = rb_entry(node, struct sym_ext, node);
		percent = sym_ext->percent;
863
		color = get_percent_color(percent);
864 865 866 867 868 869 870
		path = sym_ext->path;

		color_fprintf(stdout, color, " %7.2f %s", percent, path);
		node = rb_next(node);
	}
}

871 872
static void annotate_sym(struct dso *dso, struct symbol *sym)
{
873
	const char *filename = dso->name, *d_filename;
874
	u64 start, end, len;
875 876 877 878 879
	char command[PATH_MAX*2];
	FILE *file;

	if (!filename)
		return;
880 881 882
	if (sym->module)
		filename = sym->module->path;
	else if (dso == kernel_dso)
883
		filename = vmlinux_name;
884 885 886 887

	start = sym->obj_start;
	if (!start)
		start = sym->start;
888 889 890 891
	if (full_paths)
		d_filename = filename;
	else
		d_filename = basename(filename);
892 893 894 895

	end = start + sym->end - sym->start + 1;
	len = sym->end - sym->start;

896
	if (print_line) {
897
		get_source_line(sym, start, len, filename);
898 899 900 901
		print_summary(filename);
	}

	printf("\n\n------------------------------------------------\n");
902
	printf(" Percent |	Source code & Disassembly of %s\n", d_filename);
903 904 905 906
	printf("------------------------------------------------\n");

	if (verbose >= 2)
		printf("annotating [%p] %30s : [%p] %30s\n", dso, dso->name, sym, sym->name);
907

908 909
	sprintf(command, "objdump --start-address=0x%016Lx --stop-address=0x%016Lx -dS %s|grep -v %s",
			(u64)start, (u64)end, filename, filename);
910 911 912 913 914 915 916 917 918 919 920 921 922 923

	if (verbose >= 3)
		printf("doing: %s\n", command);

	file = popen(command, "r");
	if (!file)
		return;

	while (!feof(file)) {
		if (parse_line(file, sym, start, len) < 0)
			break;
	}

	pclose(file);
924 925
	if (print_line)
		free_source_line(sym, len);
926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949
}

static void find_annotations(void)
{
	struct rb_node *nd;
	struct dso *dso;
	int count = 0;

	list_for_each_entry(dso, &dsos, node) {

		for (nd = rb_first(&dso->syms); nd; nd = rb_next(nd)) {
			struct symbol *sym = rb_entry(nd, struct symbol, rb_node);

			if (sym->hist) {
				annotate_sym(dso, sym);
				count++;
			}
		}
	}

	if (!count)
		printf(" Error: symbol '%s' not present amongst the samples.\n", sym_hist_filter);
}

950 951 952 953 954
static int __cmd_annotate(void)
{
	int ret, rc = EXIT_FAILURE;
	unsigned long offset = 0;
	unsigned long head = 0;
955
	struct stat input_stat;
956 957 958 959
	event_t *event;
	uint32_t size;
	char *buf;

960
	register_idle_thread(&threads, &last_match);
961 962 963 964 965 966 967

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

968
	ret = fstat(input, &input_stat);
969 970 971 972 973
	if (ret < 0) {
		perror("failed to stat file");
		exit(-1);
	}

974 975
	if (!force && input_stat.st_uid && (input_stat.st_uid != geteuid())) {
		fprintf(stderr, "file: %s not owned by current user or root\n", input_name);
976 977 978
		exit(-1);
	}

979
	if (!input_stat.st_size) {
980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005
		fprintf(stderr, "zero-sized file, nothing to do!\n");
		exit(0);
	}

	if (load_kernel() < 0) {
		perror("failed to load kernel symbols");
		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);

	size = event->header.size;
	if (!size)
		size = 8;

	if (head + event->header.size >= page_size * mmap_window) {
		unsigned long shift = page_size * (head / page_size);
1006
		int munmap_ret;
1007

1008 1009
		munmap_ret = munmap(buf, page_size * mmap_window);
		assert(munmap_ret == 0);
1010 1011 1012 1013 1014 1015 1016 1017

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

	size = event->header.size;

1018
	dump_printf("%p [%p]: event: %d\n",
1019 1020 1021 1022 1023 1024
			(void *)(offset + head),
			(void *)(long)event->header.size,
			event->header.type);

	if (!size || process_event(event, offset, head) < 0) {

1025
		dump_printf("%p [%p]: skipping unknown header type: %d\n",
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->header.type);

		total_unknown++;

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

	head += size;

1045
	if (offset + head < (unsigned long)input_stat.st_size)
1046 1047 1048 1049 1050
		goto more;

	rc = EXIT_SUCCESS;
	close(input);

1051 1052 1053 1054 1055
	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(" unknown events: %10ld\n", total_unknown);
1056 1057 1058 1059 1060

	if (dump_trace)
		return 0;

	if (verbose >= 3)
1061
		threads__fprintf(stdout, &threads);
1062 1063 1064 1065 1066 1067

	if (verbose >= 2)
		dsos__fprintf(stdout);

	collapse__resort();
	output__resort();
1068 1069

	find_annotations();
1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081

	return rc;
}

static const char * const annotate_usage[] = {
	"perf annotate [<options>] <command>",
	NULL
};

static const struct option options[] = {
	OPT_STRING('i', "input", &input_name, "file",
		    "input file name"),
1082
	OPT_STRING('s', "symbol", &sym_hist_filter, "symbol",
1083
		    "symbol to annotate"),
1084
	OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
1085 1086 1087 1088
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
1089
	OPT_STRING('k', "vmlinux", &vmlinux_name, "file", "vmlinux pathname"),
1090 1091
	OPT_BOOLEAN('m', "modules", &modules,
		    "load module symbols - WARNING: use only with -k and LIVE kernel"),
1092 1093
	OPT_BOOLEAN('l', "print-line", &print_line,
		    "print matching source lines (may be slow)"),
1094 1095
	OPT_BOOLEAN('P', "full-paths", &full_paths,
		    "Don't shorten the displayed pathnames"),
1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113
	OPT_END()
};

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(annotate_usage, options);
		}
	}

	free(str);
}

1114
int cmd_annotate(int argc, const char **argv, const char *prefix __used)
1115 1116 1117 1118 1119 1120 1121 1122 1123
{
	symbol__init();

	page_size = getpagesize();

	argc = parse_options(argc, argv, options, annotate_usage, 0);

	setup_sorting();

1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135
	if (argc) {
		/*
		 * Special case: if there's an argument left then assume tha
		 * it's a symbol filter:
		 */
		if (argc > 1)
			usage_with_options(annotate_usage, options);

		sym_hist_filter = argv[0];
	}

	if (!sym_hist_filter)
1136 1137 1138 1139 1140 1141
		usage_with_options(annotate_usage, options);

	setup_pager();

	return __cmd_annotate();
}