builtin-report.c 17.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
#include "util/string.h"
9

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

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

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

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

25
static int		dump_trace = 0;
26
static int		verbose;
27
static int		full_paths;
28

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

32
const char *perf_event_names[] = {
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 83 84
	[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);
85
	int nr;
86

87 88 89 90 91 92
	if (dso)
		return dso;

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

94 95 96 97
	nr = dso__load(dso, NULL);
	if (nr < 0) {
		fprintf(stderr, "Failed to open: %s\n", name);
		goto out_delete_dso;
98
	}
99 100 101 102 103 104 105
	if (!nr && verbose) {
		fprintf(stderr,
		"No symbols found in: %s, maybe install a debug package?\n",
				name);
	}

	dsos__add(dso);
106 107 108 109 110 111 112 113

	return dso;

out_delete_dso:
	dso__delete(dso);
	return NULL;
}

114
static void dsos__fprintf(FILE *fp)
115 116 117 118 119 120 121
{
	struct dso *pos;

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

122 123
static int load_kernel(void)
{
124
	int err;
125

126
	kernel_dso = dso__new("[kernel]", 0);
127
	if (!kernel_dso)
128
		return -1;
129

130
	err = dso__load_kernel(kernel_dso, vmlinux, NULL);
131 132 133 134 135
	if (err) {
		dso__delete(kernel_dso);
		kernel_dso = NULL;
	} else
		dsos__add(kernel_dso);
136

137
	return err;
138 139
}

140 141 142 143 144 145 146 147 148 149
static int strcommon(const char *pathname, const char *cwd, int cwdlen)
{
	int n = 0;

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

	return n;
}

150 151 152 153 154 155 156 157
struct map {
	struct list_head node;
	uint64_t	 start;
	uint64_t	 end;
	uint64_t	 pgoff;
	struct dso	 *dso;
};

158
static struct map *map__new(struct mmap_event *event, char *cwd, int cwdlen)
159 160 161 162
{
	struct map *self = malloc(sizeof(*self));

	if (self != NULL) {
163 164 165 166 167 168 169 170 171 172 173 174
		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;
			}
		}

175 176 177 178
		self->start = event->start;
		self->end   = event->start + event->len;
		self->pgoff = event->pgoff;

179
		self->dso = dsos__findnew(filename);
180 181 182 183 184 185 186 187 188
		if (self->dso == NULL)
			goto out_delete;
	}
	return self;
out_delete:
	free(self);
	return NULL;
}

189 190
struct thread;

191
struct thread {
192
	struct rb_node	 rb_node;
193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
	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;
}

217
static struct rb_root threads;
218

219
static struct thread *threads__findnew(pid_t pid)
220
{
221 222 223
	struct rb_node **p = &threads.rb_node;
	struct rb_node *parent = NULL;
	struct thread *th;
224

225 226 227
	while (*p != NULL) {
		parent = *p;
		th = rb_entry(parent, struct thread, rb_node);
228

229 230
		if (th->pid == pid)
			return th;
231

232 233 234 235
		if (pid < th->pid)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
236 237
	}

238 239 240 241 242 243
	th = thread__new(pid);
	if (th != NULL) {
		rb_link_node(&th->rb_node, parent, p);
		rb_insert_color(&th->rb_node, &threads);
	}
	return th;
244 245 246 247 248 249 250 251 252
}

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)
{
253 254
	struct map *pos;

255 256 257 258 259 260 261 262 263 264
	if (self == NULL)
		return NULL;

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

	return NULL;
}

265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
/*
 * 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;
};

284 285 286 287 288 289 290
/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

291 292
	char *header;

293 294 295 296
	int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
	size_t	(*print)(FILE *fp, struct hist_entry *);
};

297
static int64_t
298
sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
299
{
300 301 302 303 304 305
	return right->thread->pid - left->thread->pid;
}

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

309
static struct sort_entry sort_thread = {
310
	.header = "          Command: Pid ",
311 312 313 314
	.cmp	= sort__thread_cmp,
	.print	= sort__thread_print,
};

315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335
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)
{
336
	return fprintf(fp, "  %16s", self->thread->comm ?: "<unknown>");
337 338 339
}

static struct sort_entry sort_comm = {
340
	.header = "          Command",
341 342 343 344
	.cmp	= sort__comm_cmp,
	.print	= sort__comm_print,
};

345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365
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)
{
366
	return fprintf(fp, "  %s", self->dso ? self->dso->name : "<unknown>");
367 368 369
}

static struct sort_entry sort_dso = {
370
	.header = " Shared Object",
371 372 373 374
	.cmp	= sort__dso_cmp,
	.print	= sort__dso_print,
};

375 376 377 378
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t ip_l, ip_r;
379 380 381 382 383 384 385 386 387 388

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

389 390 391 392 393 394
static size_t
sort__sym_print(FILE *fp, struct hist_entry *self)
{
	size_t ret = 0;

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

397
	ret += fprintf(fp, "  %s: %s",
398 399
			self->dso ? self->dso->name : "<unknown>",
			self->sym ? self->sym->name : "<unknown>");
400 401 402 403 404

	return ret;
}

static struct sort_entry sort_sym = {
405
	.header = " Shared Object: Symbol",
406 407
	.cmp	= sort__sym_cmp,
	.print	= sort__sym_print,
408 409
};

410 411 412 413 414 415 416 417
struct sort_dimension {
	char *name;
	struct sort_entry *entry;
	int taken;
};

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

423 424
static LIST_HEAD(hist_entry__sort_list);

425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445
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;
}

446 447
static void setup_sorting(void)
{
448 449 450 451 452 453 454
	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);
455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478
}

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) {
479
		ret = fprintf(fp, "    %5.2f%%",
480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
				(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
 */

496 497 498
static int
hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
		struct symbol *sym, uint64_t ip, char level)
499
{
500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528
	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;
529
	}
530 531 532 533 534 535 536 537 538

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

541 542 543 544 545 546 547
/*
 * reverse the map, sort on count.
 */

static struct rb_root output_hists;

static void output__insert_entry(struct hist_entry *he)
548
{
549
	struct rb_node **p = &output_hists.rb_node;
550
	struct rb_node *parent = NULL;
551
	struct hist_entry *iter;
552 553 554

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

557
		if (he->count > iter->count)
558 559 560 561 562
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

563 564
	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, &output_hists);
565 566
}

567
static void output__resort(void)
568
{
569 570
	struct rb_node *next = rb_first(&hist);
	struct hist_entry *n;
571

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

576 577
		rb_erase(&n->rb_node, &hist);
		output__insert_entry(n);
578 579 580
	}
}

581
static size_t output__fprintf(FILE *fp, uint64_t total_samples)
582
{
583
	struct hist_entry *pos;
584
	struct sort_entry *se;
585 586 587
	struct rb_node *nd;
	size_t ret = 0;

588 589 590 591 592 593 594 595
	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, "# ........");
596
	list_for_each_entry(se, &hist_entry__sort_list, list) {
597 598
		int i;

599 600
		fprintf(fp, "  ");
		for (i = 0; i < strlen(se->header)-1; i++)
601
			fprintf(fp, ".");
602
	}
603 604 605
	fprintf(fp, "\n");

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

607 608 609
	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);
610 611 612 613 614
	}

	return ret;
}

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

626

627
static int __cmd_report(void)
628 629 630 631 632 633 634
{
	unsigned long offset = 0;
	unsigned long head = 0;
	struct stat stat;
	char *buf;
	event_t *event;
	int ret, rc = EXIT_FAILURE;
635
	uint32_t size;
I
Ingo Molnar 已提交
636
	unsigned long total = 0, total_mmap = 0, total_comm = 0, total_unknown = 0;
637 638
	char cwd[PATH_MAX], *cwdp = cwd;
	int cwdlen;
639

640 641
	register_idle_thread();

642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658
	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);
	}

659
	if (load_kernel() < 0) {
660
		perror("failed to load kernel symbols");
661 662 663
		return EXIT_FAILURE;
	}

664 665 666 667 668 669
	if (!full_paths) {
		if (getcwd(cwd, sizeof(cwd)) == NULL) {
			perror("failed to get the current directory");
			return EXIT_FAILURE;
		}
		cwdlen = strlen(cwd);
670
	} else {
671
		cwdp = NULL;
672 673
		cwdlen = 0;
	}
674 675 676 677 678 679 680 681 682 683 684
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);

685 686 687 688
	size = event->header.size;
	if (!size)
		size = 8;

689 690 691 692 693 694 695 696 697 698 699 700
	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;
	}

701 702 703
	size = event->header.size;
	if (!size)
		goto broken_event;
704 705 706 707 708 709

	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);
710
		uint64_t ip = event->ip.ip;
711
		struct map *map = NULL;
712

713
		if (dump_trace) {
I
Ingo Molnar 已提交
714 715 716
			fprintf(stderr, "%p [%p]: PERF_EVENT (IP, %d): %d: %p\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
717 718
				event->header.misc,
				event->ip.pid,
719
				(void *)(long)ip);
720 721
		}

722
		if (thread == NULL) {
723
			fprintf(stderr, "problem processing %d event, skipping it.\n",
724
				event->header.type);
725
			goto broken_event;
726
		}
727 728 729 730

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

732
			dso = kernel_dso;
733

734
		} else if (event->header.misc & PERF_EVENT_MISC_USER) {
735

736 737
			show = SHOW_USER;
			level = '.';
738 739

			map = thread__find_map(thread, ip);
740
			if (map != NULL) {
741
				dso = map->dso;
742 743
				ip -= map->start + map->pgoff;
			}
744

745 746 747 748 749 750
		} else {
			show = SHOW_HV;
			level = 'H';
		}

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

753 754
			if (hist_entry__add(thread, map, dso, sym, ip, level)) {
				fprintf(stderr,
755 756
		"problem incrementing symbol count, skipping event\n");
				goto broken_event;
757
			}
758 759 760 761 762
		}
		total++;
	} else switch (event->header.type) {
	case PERF_EVENT_MMAP: {
		struct thread *thread = threads__findnew(event->mmap.pid);
763
		struct map *map = map__new(&event->mmap, cwdp, cwdlen);
764

765
		if (dump_trace) {
I
Ingo Molnar 已提交
766 767 768
			fprintf(stderr, "%p [%p]: PERF_EVENT_MMAP: [%p(%p) @ %p]: %s\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
769 770 771
				(void *)(long)event->mmap.start,
				(void *)(long)event->mmap.len,
				(void *)(long)event->mmap.pgoff,
772 773
				event->mmap.filename);
		}
774
		if (thread == NULL || map == NULL) {
775 776
			fprintf(stderr, "problem processing PERF_EVENT_MMAP, skipping event.\n");
			goto broken_event;
777
		}
778
		thread__insert_map(thread, map);
779
		total_mmap++;
780 781 782 783 784
		break;
	}
	case PERF_EVENT_COMM: {
		struct thread *thread = threads__findnew(event->comm.pid);

785
		if (dump_trace) {
I
Ingo Molnar 已提交
786 787 788
			fprintf(stderr, "%p [%p]: PERF_EVENT_COMM: %s:%d\n",
				(void *)(offset + head),
				(void *)(long)(event->header.size),
789 790
				event->comm.comm, event->comm.pid);
		}
791
		if (thread == NULL ||
792
		    thread__set_comm(thread, event->comm.comm)) {
793 794
			fprintf(stderr, "problem processing PERF_EVENT_COMM, skipping event.\n");
			goto broken_event;
795
		}
796
		total_comm++;
797 798
		break;
	}
799
	default: {
800
broken_event:
801 802 803 804 805 806
		if (dump_trace)
			fprintf(stderr, "%p [%p]: skipping unknown header type: %d\n",
					(void *)(offset + head),
					(void *)(long)(event->header.size),
					event->header.type);

807
		total_unknown++;
808 809 810 811 812 813 814 815 816 817

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

821
	head += size;
I
Ingo Molnar 已提交
822

823 824 825 826 827
	if (offset + head < stat.st_size)
		goto more;

	rc = EXIT_SUCCESS;
	close(input);
828 829

	if (dump_trace) {
830 831 832 833
		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);
834 835 836 837

		return 0;
	}

838
	if (verbose >= 2)
839 840
		dsos__fprintf(stdout);

841 842
	output__resort();
	output__fprintf(stdout, total);
843 844 845 846

	return rc;
}

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

int cmd_report(int argc, const char **argv, const char *prefix)
{
869
	symbol__init();
870 871 872 873 874

	page_size = getpagesize();

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

875 876
	setup_sorting();

877 878
	setup_pager();

879 880
	return __cmd_report();
}