builtin-report.c 17.4 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/list.h"
13
#include "util/cache.h"
14
#include "util/rbtree.h"
15
#include "util/symbol.h"
16
#include "util/string.h"
17

18 19 20 21 22
#include "perf.h"

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

23 24 25 26
#define SHOW_KERNEL	1
#define SHOW_USER	2
#define SHOW_HV		4

27
static char		const *input_name = "perf.data";
28
static char		*vmlinux = NULL;
29
static char		*sort_order = "comm,dso";
30 31 32
static int		input;
static int		show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV;

33
static int		dump_trace = 0;
I
Ingo Molnar 已提交
34 35
#define dprintf(x...)	do { if (dump_trace) printf(x); } while (0)

36
static int		verbose;
37
static int		full_paths;
38

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

42
const char *perf_event_names[] = {
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 83 84 85 86 87 88 89 90 91 92 93 94
	[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);
95
	int nr;
96

97 98 99 100 101 102
	if (dso)
		return dso;

	dso = dso__new(name, 0);
	if (!dso)
		goto out_delete_dso;
103

104 105 106 107
	nr = dso__load(dso, NULL);
	if (nr < 0) {
		fprintf(stderr, "Failed to open: %s\n", name);
		goto out_delete_dso;
108
	}
109 110 111 112 113 114 115
	if (!nr && verbose) {
		fprintf(stderr,
		"No symbols found in: %s, maybe install a debug package?\n",
				name);
	}

	dsos__add(dso);
116 117 118 119 120 121 122 123

	return dso;

out_delete_dso:
	dso__delete(dso);
	return NULL;
}

124
static void dsos__fprintf(FILE *fp)
125 126 127 128 129 130 131
{
	struct dso *pos;

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

132 133
static int load_kernel(void)
{
134
	int err;
135

136
	kernel_dso = dso__new("[kernel]", 0);
137
	if (!kernel_dso)
138
		return -1;
139

140
	err = dso__load_kernel(kernel_dso, vmlinux, NULL);
141 142 143 144 145
	if (err) {
		dso__delete(kernel_dso);
		kernel_dso = NULL;
	} else
		dsos__add(kernel_dso);
146

147
	return err;
148 149
}

150 151 152 153 154 155 156 157 158 159
static int strcommon(const char *pathname, const char *cwd, int cwdlen)
{
	int n = 0;

	while (pathname[n] == cwd[n] && n < cwdlen)
		++n;

	return n;
}

160 161 162 163 164 165 166 167
struct map {
	struct list_head node;
	uint64_t	 start;
	uint64_t	 end;
	uint64_t	 pgoff;
	struct dso	 *dso;
};

168
static struct map *map__new(struct mmap_event *event, char *cwd, int cwdlen)
169 170 171 172
{
	struct map *self = malloc(sizeof(*self));

	if (self != NULL) {
173 174 175 176 177 178 179 180 181 182 183 184
		const char *filename = event->filename;
		char newfilename[PATH_MAX];

		if (cwd) {
			int n = strcommon(filename, cwd, cwdlen);
			if (n == cwdlen) {
				snprintf(newfilename, sizeof(newfilename),
					 ".%s", filename + n);
				filename = newfilename;
			}
		}

185 186 187 188
		self->start = event->start;
		self->end   = event->start + event->len;
		self->pgoff = event->pgoff;

189
		self->dso = dsos__findnew(filename);
190 191 192 193 194 195 196 197 198
		if (self->dso == NULL)
			goto out_delete;
	}
	return self;
out_delete:
	free(self);
	return NULL;
}

199 200
struct thread;

201
struct thread {
202
	struct rb_node	 rb_node;
203 204 205 206 207 208 209 210 211 212 213
	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;
214 215 216
		self->comm = malloc(30);
		if (self->comm)
			sprintf(self->comm, ":%d", pid);
217 218 219 220 221 222 223 224 225 226 227 228
		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;
}

229
static struct rb_root threads;
230

231
static struct thread *threads__findnew(pid_t pid)
232
{
233 234 235
	struct rb_node **p = &threads.rb_node;
	struct rb_node *parent = NULL;
	struct thread *th;
236

237 238 239
	while (*p != NULL) {
		parent = *p;
		th = rb_entry(parent, struct thread, rb_node);
240

241 242
		if (th->pid == pid)
			return th;
243

244 245 246 247
		if (pid < th->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
248 249
	}

250 251 252 253 254 255
	th = thread__new(pid);
	if (th != NULL) {
		rb_link_node(&th->rb_node, parent, p);
		rb_insert_color(&th->rb_node, &threads);
	}
	return th;
256 257 258 259 260 261 262 263 264
}

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)
{
265 266
	struct map *pos;

267 268 269 270 271 272 273 274 275 276
	if (self == NULL)
		return NULL;

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

	return NULL;
}

277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295
/*
 * 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;
};

296 297 298 299 300 301 302
/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

303 304
	char *header;

305 306 307 308
	int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
	size_t	(*print)(FILE *fp, struct hist_entry *);
};

309
static int64_t
310
sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
311
{
312 313 314 315 316 317
	return right->thread->pid - left->thread->pid;
}

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

321
static struct sort_entry sort_thread = {
322
	.header = "         Command: Pid ",
323 324 325 326
	.cmp	= sort__thread_cmp,
	.print	= sort__thread_print,
};

327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347
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)
{
348
	return fprintf(fp, "  %16s", self->thread->comm);
349 350 351
}

static struct sort_entry sort_comm = {
352
	.header = "          Command",
353 354 355 356
	.cmp	= sort__comm_cmp,
	.print	= sort__comm_print,
};

357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377
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)
{
378 379 380 381
	if (self->dso)
		return fprintf(fp, "  %-25s", self->dso->name);

	return fprintf(fp, "  %016llx", (__u64)self->ip);
382 383 384
}

static struct sort_entry sort_dso = {
385
	.header = " Shared Object          ",
386 387 388 389
	.cmp	= sort__dso_cmp,
	.print	= sort__dso_print,
};

390 391 392 393
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t ip_l, ip_r;
394 395 396 397 398 399 400 401 402 403

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

404 405 406 407 408 409
static size_t
sort__sym_print(FILE *fp, struct hist_entry *self)
{
	size_t ret = 0;

	if (verbose)
410 411 412 413 414 415
		ret += fprintf(fp, "  %#018llx", (__u64)self->ip);

	if (self->dso)
		ret += fprintf(fp, "  %s: ", self->dso->name);
	else
		ret += fprintf(fp, "  %#016llx: ", (__u64)self->ip);
416

417 418 419 420
	if (self->sym)
		ret += fprintf(fp, "%s", self->sym->name);
	else
		ret += fprintf(fp, "%#016llx", (__u64)self->ip);
421 422 423 424 425

	return ret;
}

static struct sort_entry sort_sym = {
426
	.header = " Shared Object: Symbol",
427 428
	.cmp	= sort__sym_cmp,
	.print	= sort__sym_print,
429 430
};

431 432 433 434 435 436 437 438
struct sort_dimension {
	char *name;
	struct sort_entry *entry;
	int taken;
};

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

444 445
static LIST_HEAD(hist_entry__sort_list);

446 447 448 449 450 451 452 453 454 455
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;

456
		if (strncasecmp(tok, sd->name, strlen(tok)))
457 458 459 460
			continue;

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

462 463 464 465 466 467
		return 0;
	}

	return -ESRCH;
}

468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489
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) {
490
		ret = fprintf(fp, "    %5.2f%%",
491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506
				(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
 */

507 508 509
static int
hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
		struct symbol *sym, uint64_t ip, char level)
510
{
511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539
	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;
540
	}
541 542 543 544 545 546 547 548 549

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

552 553 554 555 556 557 558
/*
 * reverse the map, sort on count.
 */

static struct rb_root output_hists;

static void output__insert_entry(struct hist_entry *he)
559
{
560
	struct rb_node **p = &output_hists.rb_node;
561
	struct rb_node *parent = NULL;
562
	struct hist_entry *iter;
563 564 565

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

568
		if (he->count > iter->count)
569 570 571 572 573
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

574 575
	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &output_hists);
576 577
}

578
static void output__resort(void)
579
{
580 581
	struct rb_node *next = rb_first(&hist);
	struct hist_entry *n;
582

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

587 588
		rb_erase(&n->rb_node, &hist);
		output__insert_entry(n);
589 590 591
	}
}

592
static size_t output__fprintf(FILE *fp, uint64_t total_samples)
593
{
594
	struct hist_entry *pos;
595
	struct sort_entry *se;
596 597 598
	struct rb_node *nd;
	size_t ret = 0;

599 600 601 602 603 604 605 606
	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, "# ........");
607
	list_for_each_entry(se, &hist_entry__sort_list, list) {
608 609
		int i;

610 611
		fprintf(fp, "  ");
		for (i = 0; i < strlen(se->header)-1; i++)
612
			fprintf(fp, ".");
613
	}
614 615 616
	fprintf(fp, "\n");

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

618 619 620
	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);
621 622 623 624 625
	}

	return ret;
}

626 627 628 629 630 631 632 633 634 635 636
static void register_idle_thread(void)
{
	struct thread *thread = threads__findnew(0);

	if (thread == NULL ||
			thread__set_comm(thread, "[idle]")) {
		fprintf(stderr, "problem inserting idle task.\n");
		exit(-1);
	}
}

637

638
static int __cmd_report(void)
639 640 641 642 643 644 645
{
	unsigned long offset = 0;
	unsigned long head = 0;
	struct stat stat;
	char *buf;
	event_t *event;
	int ret, rc = EXIT_FAILURE;
646
	uint32_t size;
I
Ingo Molnar 已提交
647
	unsigned long total = 0, total_mmap = 0, total_comm = 0, total_unknown = 0;
648 649
	char cwd[PATH_MAX], *cwdp = cwd;
	int cwdlen;
650

651 652
	register_idle_thread();

653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669
	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);
	}

670
	if (load_kernel() < 0) {
671
		perror("failed to load kernel symbols");
672 673 674
		return EXIT_FAILURE;
	}

675 676 677 678 679 680
	if (!full_paths) {
		if (getcwd(cwd, sizeof(cwd)) == NULL) {
			perror("failed to get the current directory");
			return EXIT_FAILURE;
		}
		cwdlen = strlen(cwd);
681
	} else {
682
		cwdp = NULL;
683 684
		cwdlen = 0;
	}
685 686 687 688 689 690 691 692 693 694 695
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);

696 697 698 699
	size = event->header.size;
	if (!size)
		size = 8;

700 701 702 703 704 705 706 707 708 709 710 711
	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;
	}

712 713 714
	size = event->header.size;
	if (!size)
		goto broken_event;
715 716 717 718 719 720

	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);
721
		uint64_t ip = event->ip.ip;
722
		struct map *map = NULL;
723

I
Ingo Molnar 已提交
724 725 726 727 728 729
		dprintf("%p [%p]: PERF_EVENT (IP, %d): %d: %p\n",
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->header.misc,
			event->ip.pid,
			(void *)(long)ip);
730

731
		if (thread == NULL) {
732
			fprintf(stderr, "problem processing %d event, skipping it.\n",
733
				event->header.type);
734
			goto broken_event;
735
		}
736 737 738 739

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

741
			dso = kernel_dso;
742

743
		} else if (event->header.misc & PERF_EVENT_MISC_USER) {
744

745 746
			show = SHOW_USER;
			level = '.';
747 748

			map = thread__find_map(thread, ip);
749
			if (map != NULL) {
750
				dso = map->dso;
751 752
				ip -= map->start + map->pgoff;
			}
753

754 755 756 757 758 759
		} else {
			show = SHOW_HV;
			level = 'H';
		}

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

762 763
			if (hist_entry__add(thread, map, dso, sym, ip, level)) {
				fprintf(stderr,
764 765
		"problem incrementing symbol count, skipping event\n");
				goto broken_event;
766
			}
767 768 769 770 771
		}
		total++;
	} else switch (event->header.type) {
	case PERF_EVENT_MMAP: {
		struct thread *thread = threads__findnew(event->mmap.pid);
772
		struct map *map = map__new(&event->mmap, cwdp, cwdlen);
773

I
Ingo Molnar 已提交
774 775 776 777 778 779 780 781
		dprintf("%p [%p]: PERF_EVENT_MMAP: [%p(%p) @ %p]: %s\n",
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			(void *)(long)event->mmap.start,
			(void *)(long)event->mmap.len,
			(void *)(long)event->mmap.pgoff,
			event->mmap.filename);

782
		if (thread == NULL || map == NULL) {
783 784
			if (verbose)
				fprintf(stderr, "problem processing PERF_EVENT_MMAP, skipping event.\n");
785
			goto broken_event;
786
		}
787
		thread__insert_map(thread, map);
788
		total_mmap++;
789 790 791 792 793
		break;
	}
	case PERF_EVENT_COMM: {
		struct thread *thread = threads__findnew(event->comm.pid);

I
Ingo Molnar 已提交
794 795 796 797 798
		dprintf("%p [%p]: PERF_EVENT_COMM: %s:%d\n",
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->comm.comm, event->comm.pid);

799
		if (thread == NULL ||
800
		    thread__set_comm(thread, event->comm.comm)) {
801 802
			fprintf(stderr, "problem processing PERF_EVENT_COMM, skipping event.\n");
			goto broken_event;
803
		}
804
		total_comm++;
805 806
		break;
	}
807
	default: {
808
broken_event:
I
Ingo Molnar 已提交
809 810 811 812
		dprintf("%p [%p]: skipping unknown header type: %d\n",
			(void *)(offset + head),
			(void *)(long)(event->header.size),
			event->header.type);
813

814
		total_unknown++;
815 816 817 818 819 820 821 822 823 824

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

828
	head += size;
I
Ingo Molnar 已提交
829

830 831 832 833 834
	if (offset + head < stat.st_size)
		goto more;

	rc = EXIT_SUCCESS;
	close(input);
835

I
Ingo Molnar 已提交
836 837 838 839
	dprintf("      IP events: %10ld\n", total);
	dprintf("    mmap events: %10ld\n", total_mmap);
	dprintf("    comm events: %10ld\n", total_comm);
	dprintf(" unknown events: %10ld\n", total_unknown);
840

I
Ingo Molnar 已提交
841
	if (dump_trace)
842 843
		return 0;

844
	if (verbose >= 2)
845 846
		dsos__fprintf(stdout);

847 848
	output__resort();
	output__fprintf(stdout, total);
849 850 851 852

	return rc;
}

853 854 855 856 857 858 859 860
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"),
861 862
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
863 864
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
865
	OPT_STRING('k', "vmlinux", &vmlinux, "file", "vmlinux pathname"),
866 867
	OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
		   "sort by key(s): pid, comm, dso, symbol. Default: pid,symbol"),
868 869
	OPT_BOOLEAN('P', "full-paths", &full_paths,
		    "Don't shorten the pathnames taking into account the cwd"),
870 871 872
	OPT_END()
};

873 874 875 876 877 878 879 880 881 882 883 884 885 886 887
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);
}

888 889
int cmd_report(int argc, const char **argv, const char *prefix)
{
890
	symbol__init();
891 892 893 894 895

	page_size = getpagesize();

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

896 897
	setup_sorting();

898 899
	setup_pager();

900 901
	return __cmd_report();
}