builtin-report.c 22.5 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/color.h"
13
#include <linux/list.h>
14
#include "util/cache.h"
15
#include <linux/rbtree.h>
16
#include "util/symbol.h"
17
#include "util/string.h"
18
#include "util/callchain.h"
19
#include "util/strlist.h"
20
#include "util/values.h"
21

22
#include "perf.h"
23
#include "util/debug.h"
24
#include "util/header.h"
25 26 27 28

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

29
#include "util/data_map.h"
30
#include "util/thread.h"
31
#include "util/sort.h"
32
#include "util/hist.h"
33

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

36 37
static char		*dso_list_str, *comm_list_str, *sym_list_str,
			*col_width_list_str;
38
static struct strlist	*dso_list, *comm_list, *sym_list;
39

40
static int		force;
41

42
static int		full_paths;
43
static int		show_nr_samples;
44

45 46 47
static int		show_threads;
static struct perf_read_values	show_threads_values;

48 49 50
static char		default_pretty_printing_style[] = "normal";
static char		*pretty_printing_style = default_pretty_printing_style;

51
static int		exclude_other = 1;
52

53 54
static char		callchain_default_opt[] = "fractal,0.5";

55 56
static struct perf_header *header;

57 58
static u64		sample_type;

59 60
struct symbol_conf	symbol_conf;

61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77

static size_t
callchain__fprintf_left_margin(FILE *fp, int left_margin)
{
	int i;
	int ret;

	ret = fprintf(fp, "            ");

	for (i = 0; i < left_margin; i++)
		ret += fprintf(fp, " ");

	return ret;
}

static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
					  int left_margin)
78 79 80 81
{
	int i;
	size_t ret = 0;

82
	ret += callchain__fprintf_left_margin(fp, left_margin);
83 84 85 86 87 88 89 90 91 92 93

	for (i = 0; i < depth; i++)
		if (depth_mask & (1 << i))
			ret += fprintf(fp, "|          ");
		else
			ret += fprintf(fp, "           ");

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

	return ret;
}
94
static size_t
95 96
ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain, int depth,
		       int depth_mask, int count, u64 total_samples,
97
		       int hits, int left_margin)
98 99 100 101
{
	int i;
	size_t ret = 0;

102
	ret += callchain__fprintf_left_margin(fp, left_margin);
103 104 105 106 107 108 109 110 111
	for (i = 0; i < depth; i++) {
		if (depth_mask & (1 << i))
			ret += fprintf(fp, "|");
		else
			ret += fprintf(fp, " ");
		if (!count && i == depth - 1) {
			double percent;

			percent = hits * 100.0 / total_samples;
112
			ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
113 114 115 116 117 118 119 120 121 122 123
		} else
			ret += fprintf(fp, "%s", "          ");
	}
	if (chain->sym)
		ret += fprintf(fp, "%s\n", chain->sym->name);
	else
		ret += fprintf(fp, "%p\n", (void *)(long)chain->ip);

	return ret;
}

124 125 126 127 128 129 130 131 132 133 134 135 136 137 138
static struct symbol *rem_sq_bracket;
static struct callchain_list rem_hits;

static void init_rem_hits(void)
{
	rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
	if (!rem_sq_bracket) {
		fprintf(stderr, "Not enough memory to display remaining hits\n");
		return;
	}

	strcpy(rem_sq_bracket->name, "[...]");
	rem_hits.sym = rem_sq_bracket;
}

139
static size_t
140
__callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
141 142
			   u64 total_samples, int depth, int depth_mask,
			   int left_margin)
143 144 145 146 147
{
	struct rb_node *node, *next;
	struct callchain_node *child;
	struct callchain_list *chain;
	int new_depth_mask = depth_mask;
148
	u64 new_total;
149
	u64 remaining;
150 151 152
	size_t ret = 0;
	int i;

153
	if (callchain_param.mode == CHAIN_GRAPH_REL)
154
		new_total = self->children_hit;
155 156 157
	else
		new_total = total_samples;

158 159
	remaining = new_total;

160 161
	node = rb_first(&self->rb_root);
	while (node) {
162 163
		u64 cumul;

164
		child = rb_entry(node, struct callchain_node, rb_node);
165 166
		cumul = cumul_hits(child);
		remaining -= cumul;
167 168 169 170

		/*
		 * The depth mask manages the output of pipes that show
		 * the depth. We don't want to keep the pipes of the current
171 172 173
		 * level for the last child of this depth.
		 * Except if we have remaining filtered hits. They will
		 * supersede the last child
174 175
		 */
		next = rb_next(node);
176
		if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
177 178 179 180 181 182
			new_depth_mask &= ~(1 << (depth - 1));

		/*
		 * But we keep the older depth mask for the line seperator
		 * to keep the level link until we reach the last child
		 */
183 184
		ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
						   left_margin);
185 186 187 188 189 190
		i = 0;
		list_for_each_entry(chain, &child->val, list) {
			if (chain->ip >= PERF_CONTEXT_MAX)
				continue;
			ret += ipchain__fprintf_graph(fp, chain, depth,
						      new_depth_mask, i++,
191
						      new_total,
192 193
						      cumul,
						      left_margin);
194
		}
195 196
		ret += __callchain__fprintf_graph(fp, child, new_total,
						  depth + 1,
197 198
						  new_depth_mask | (1 << depth),
						  left_margin);
199 200 201
		node = next;
	}

202 203 204 205 206 207 208 209 210 211
	if (callchain_param.mode == CHAIN_GRAPH_REL &&
		remaining && remaining != new_total) {

		if (!rem_sq_bracket)
			return ret;

		new_depth_mask &= ~(1 << (depth - 1));

		ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
					      new_depth_mask, 0, new_total,
212
					      remaining, left_margin);
213 214
	}

215 216 217
	return ret;
}

218

219 220
static size_t
callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
221
			 u64 total_samples, int left_margin)
222 223
{
	struct callchain_list *chain;
224
	bool printed = false;
225 226 227 228 229 230 231
	int i = 0;
	int ret = 0;

	list_for_each_entry(chain, &self->val, list) {
		if (chain->ip >= PERF_CONTEXT_MAX)
			continue;

232
		if (!i++ && sort__first_dimension == SORT_SYM)
233 234
			continue;

235 236 237 238 239 240 241 242 243 244 245
		if (!printed) {
			ret += callchain__fprintf_left_margin(fp, left_margin);
			ret += fprintf(fp, "|\n");
			ret += callchain__fprintf_left_margin(fp, left_margin);
			ret += fprintf(fp, "---");

			left_margin += 3;
			printed = true;
		} else
			ret += callchain__fprintf_left_margin(fp, left_margin);

246
		if (chain->sym)
247
			ret += fprintf(fp, " %s\n", chain->sym->name);
248
		else
249
			ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
250 251
	}

252
	ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1, left_margin);
253 254 255 256

	return ret;
}

257 258 259
static size_t
callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
			u64 total_samples)
260 261 262 263 264 265 266
{
	struct callchain_list *chain;
	size_t ret = 0;

	if (!self)
		return 0;

267
	ret += callchain__fprintf_flat(fp, self->parent, total_samples);
268 269


270 271 272 273 274 275 276
	list_for_each_entry(chain, &self->val, list) {
		if (chain->ip >= PERF_CONTEXT_MAX)
			continue;
		if (chain->sym)
			ret += fprintf(fp, "                %s\n", chain->sym->name);
		else
			ret += fprintf(fp, "                %p\n",
277
					(void *)(long)chain->ip);
278
	}
279 280 281 282 283 284

	return ret;
}

static size_t
hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
285
			      u64 total_samples, int left_margin)
286 287 288 289 290 291 292 293 294 295 296
{
	struct rb_node *rb_node;
	struct callchain_node *chain;
	size_t ret = 0;

	rb_node = rb_first(&self->sorted_chain);
	while (rb_node) {
		double percent;

		chain = rb_entry(rb_node, struct callchain_node, rb_node);
		percent = chain->hit * 100.0 / total_samples;
297 298
		switch (callchain_param.mode) {
		case CHAIN_FLAT:
299 300
			ret += percent_color_fprintf(fp, "           %6.2f%%\n",
						     percent);
301
			ret += callchain__fprintf_flat(fp, chain, total_samples);
302 303 304
			break;
		case CHAIN_GRAPH_ABS: /* Falldown */
		case CHAIN_GRAPH_REL:
305 306
			ret += callchain__fprintf_graph(fp, chain, total_samples,
							left_margin);
307
		case CHAIN_NONE:
308 309
		default:
			break;
310
		}
311 312 313 314 315 316 317
		ret += fprintf(fp, "\n");
		rb_node = rb_next(rb_node);
	}

	return ret;
}

318
static size_t
319
hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
320 321 322 323
{
	struct sort_entry *se;
	size_t ret;

324 325 326
	if (exclude_other && !self->parent)
		return 0;

327
	if (total_samples)
328 329 330
		ret = percent_color_fprintf(fp,
					    field_sep ? "%.2f" : "   %6.2f%%",
					(self->count * 100.0) / total_samples);
331
	else
332
		ret = fprintf(fp, field_sep ? "%lld" : "%12lld ", self->count);
333

334 335 336 337 338 339
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%c%lld", *field_sep, self->count);
		else
			fprintf(fp, "%11lld", self->count);
	}
340

341
	list_for_each_entry(se, &hist_entry__sort_list, list) {
342
		if (se->elide)
343 344
			continue;

345 346
		fprintf(fp, "%s", field_sep ?: "  ");
		ret += se->print(fp, self, se->width ? *se->width : 0);
347
	}
348 349 350

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

351 352 353 354 355 356 357 358 359 360 361 362 363
	if (callchain) {
		int left_margin = 0;

		if (sort__first_dimension == SORT_COMM) {
			se = list_first_entry(&hist_entry__sort_list, typeof(*se),
						list);
			left_margin = se->width ? *se->width : 0;
			left_margin -= thread__comm_len(self->thread);
		}

		hist_entry_callchain__fprintf(fp, self, total_samples,
					      left_margin);
	}
364

365 366 367
	return ret;
}

368 369 370 371
/*
 *
 */

372 373 374 375 376 377 378 379 380 381 382 383
static void dso__calc_col_width(struct dso *self)
{
	if (!col_width_list_str && !field_sep &&
	    (!dso_list || strlist__has_entry(dso_list, self->name))) {
		unsigned int slen = strlen(self->name);
		if (slen > dsos__col_width)
			dsos__col_width = slen;
	}

	self->slen_calculated = 1;
}

384
static void thread__comm_adjust(struct thread *self)
385
{
386
	char *comm = self->comm;
387 388 389 390 391 392 393 394 395 396

	if (!col_width_list_str && !field_sep &&
	    (!comm_list || strlist__has_entry(comm_list, comm))) {
		unsigned int slen = strlen(comm);

		if (slen > comms__col_width) {
			comms__col_width = slen;
			threads__col_width = slen + 6;
		}
	}
397 398 399 400 401 402 403 404 405 406
}

static int thread__set_comm_adjust(struct thread *self, const char *comm)
{
	int ret = thread__set_comm(self, comm);

	if (ret)
		return ret;

	thread__comm_adjust(self);
407 408 409 410

	return 0;
}

411
static int call__match(struct symbol *sym)
412
{
413
	if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0))
414
		return 1;
415

416
	return 0;
417 418
}

419
static struct symbol **resolve_callchain(struct thread *thread,
420 421
					 struct ip_callchain *chain,
					 struct symbol **parent)
422
{
423
	u8 cpumode = PERF_RECORD_MISC_USER;
424
	struct symbol **syms = NULL;
425
	unsigned int i;
426 427 428 429 430 431 432 433 434 435 436

	if (callchain) {
		syms = calloc(chain->nr, sizeof(*syms));
		if (!syms) {
			fprintf(stderr, "Can't allocate memory for symbols\n");
			exit(-1);
		}
	}

	for (i = 0; i < chain->nr; i++) {
		u64 ip = chain->ips[i];
437
		struct addr_location al;
438 439

		if (ip >= PERF_CONTEXT_MAX) {
440 441 442 443 444 445 446 447 448 449
			switch (ip) {
			case PERF_CONTEXT_HV:
				cpumode = PERF_RECORD_MISC_HYPERVISOR;	break;
			case PERF_CONTEXT_KERNEL:
				cpumode = PERF_RECORD_MISC_KERNEL;	break;
			case PERF_CONTEXT_USER:
				cpumode = PERF_RECORD_MISC_USER;	break;
			default:
				break;
			}
450 451 452
			continue;
		}

453 454 455 456 457 458
		thread__find_addr_location(thread, cpumode, MAP__FUNCTION,
					   ip, &al, NULL);
		if (al.sym != NULL) {
			if (sort__has_parent && !*parent &&
			    call__match(al.sym))
				*parent = al.sym;
459 460
			if (!callchain)
				break;
461
			syms[i] = al.sym;
462 463 464 465 466 467
		}
	}

	return syms;
}

468 469 470 471
/*
 * collect histogram counts
 */

472 473
static int hist_entry__add(struct addr_location *al,
			   struct ip_callchain *chain, u64 count)
474
{
475 476
	struct symbol **syms = NULL, *parent = NULL;
	bool hit;
477 478
	struct hist_entry *he;

479
	if ((sort__has_parent || callchain) && chain)
480
		syms = resolve_callchain(al->thread, chain, &parent);
481

482
	he = __hist_entry__add(al, parent, count, &hit);
483 484
	if (he == NULL)
		return -ENOMEM;
485

486 487
	if (hit)
		he->count += count;
488

489
	if (callchain) {
490 491
		if (!hit)
			callchain_init(&he->callchain);
492 493
		append_chain(&he->callchain, chain, syms);
		free(syms);
494
	}
495 496

	return 0;
497 498
}

499
static size_t output__fprintf(FILE *fp, u64 total_samples)
500
{
501
	struct hist_entry *pos;
502
	struct sort_entry *se;
503 504
	struct rb_node *nd;
	size_t ret = 0;
505 506
	unsigned int width;
	char *col_width = col_width_list_str;
507 508 509
	int raw_printing_style;

	raw_printing_style = !strcmp(pretty_printing_style, "raw");
510

511 512
	init_rem_hits();

513
	fprintf(fp, "# Samples: %Ld\n", (u64)total_samples);
514 515 516
	fprintf(fp, "#\n");

	fprintf(fp, "# Overhead");
517 518 519 520 521 522
	if (show_nr_samples) {
		if (field_sep)
			fprintf(fp, "%cSamples", *field_sep);
		else
			fputs("  Samples  ", fp);
	}
523
	list_for_each_entry(se, &hist_entry__sort_list, list) {
524
		if (se->elide)
525
			continue;
526 527
		if (field_sep) {
			fprintf(fp, "%c%s", *field_sep, se->header);
528
			continue;
529 530 531 532 533 534 535 536 537 538 539 540 541 542
		}
		width = strlen(se->header);
		if (se->width) {
			if (col_width_list_str) {
				if (col_width) {
					*se->width = atoi(col_width);
					col_width = strchr(col_width, ',');
					if (col_width)
						++col_width;
				}
			}
			width = *se->width = max(*se->width, width);
		}
		fprintf(fp, "  %*s", width, se->header);
543
	}
544 545
	fprintf(fp, "\n");

546 547 548
	if (field_sep)
		goto print_entries;

549
	fprintf(fp, "# ........");
550 551
	if (show_nr_samples)
		fprintf(fp, " ..........");
552
	list_for_each_entry(se, &hist_entry__sort_list, list) {
553
		unsigned int i;
554

555
		if (se->elide)
556 557
			continue;

558
		fprintf(fp, "  ");
559 560 561 562 563
		if (se->width)
			width = *se->width;
		else
			width = strlen(se->header);
		for (i = 0; i < width; i++)
564
			fprintf(fp, ".");
565
	}
566 567 568
	fprintf(fp, "\n");

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

570
print_entries:
571 572 573
	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);
574 575
	}

576 577
	if (sort_order == default_sort_order &&
			parent_pattern == default_parent_pattern) {
578
		fprintf(fp, "#\n");
579
		fprintf(fp, "# (For a higher level overview, try: perf report --sort comm,dso)\n");
580 581
		fprintf(fp, "#\n");
	}
582
	fprintf(fp, "\n");
583

584 585
	free(rem_sq_bracket);

586
	if (show_threads)
587 588
		perf_read_values_display(fp, &show_threads_values,
					 raw_printing_style);
589

590 591 592
	return ret;
}

593
static int validate_chain(struct ip_callchain *chain, event_t *event)
594 595 596 597 598 599
{
	unsigned int chain_size;

	chain_size = event->header.size;
	chain_size -= (unsigned long)&event->ip.__more_data - (unsigned long)event;

600
	if (chain->nr*sizeof(u64) > chain_size)
601 602 603 604 605
		return -1;

	return 0;
}

606
static int process_sample_event(event_t *event)
607
{
608 609
	u64 ip = event->ip.ip;
	u64 period = 1;
610
	void *more_data = event->ip.__more_data;
611
	struct ip_callchain *chain = NULL;
612
	int cpumode;
613
	struct addr_location al;
614
	struct thread *thread = threads__findnew(event->ip.pid);
615

616
	if (sample_type & PERF_SAMPLE_PERIOD) {
617 618
		period = *(u64 *)more_data;
		more_data += sizeof(u64);
619
	}
620

621
	dump_printf("(IP, %d): %d/%d: %p period: %Ld\n",
622
		event->header.misc,
623
		event->ip.pid, event->ip.tid,
624
		(void *)(long)ip,
625
		(long long)period);
626

627
	if (sample_type & PERF_SAMPLE_CALLCHAIN) {
628
		unsigned int i;
629 630 631

		chain = (void *)more_data;

632
		dump_printf("... chain: nr:%Lu\n", chain->nr);
633

634
		if (validate_chain(chain, event) < 0) {
635 636
			pr_debug("call-chain problem with event, "
				 "skipping it.\n");
637 638 639 640
			return 0;
		}

		if (dump_trace) {
641
			for (i = 0; i < chain->nr; i++)
642
				dump_printf("..... %2d: %016Lx\n", i, chain->ips[i]);
643 644 645
		}
	}

646
	if (thread == NULL) {
647
		pr_debug("problem processing %d event, skipping it.\n",
648 649 650
			event->header.type);
		return -1;
	}
651

652 653
	dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);

654 655 656
	if (comm_list && !strlist__has_entry(comm_list, thread->comm))
		return 0;

657
	cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK;
658

659 660 661 662 663 664 665 666
	thread__find_addr_location(thread, cpumode,
				   MAP__FUNCTION, ip, &al, NULL);
	/*
	 * We have to do this here as we may have a dso with no symbol hit that
	 * has a name longer than the ones with symbols sampled.
	 */
	if (al.map && !sort_dso.elide && !al.map->dso->slen_calculated)
		dso__calc_col_width(al.map->dso);
667

668
	if (dso_list &&
669 670 671 672
	    (!al.map || !al.map->dso ||
	     !(strlist__has_entry(dso_list, al.map->dso->short_name) ||
	       (al.map->dso->short_name != al.map->dso->long_name &&
		strlist__has_entry(dso_list, al.map->dso->long_name)))))
673
		return 0;
674

675
	if (sym_list && al.sym && !strlist__has_entry(sym_list, al.sym->name))
676
		return 0;
677

678
	if (hist_entry__add(&al, chain, period)) {
679
		pr_debug("problem incrementing symbol count, skipping event\n");
680
		return -1;
681
	}
682

683
	event__stats.total += period;
684

685 686
	return 0;
}
I
Ingo Molnar 已提交
687

688
static int process_comm_event(event_t *event)
689
{
690
	struct thread *thread = threads__findnew(event->comm.pid);
691

692
	dump_printf(": %s:%d\n", event->comm.comm, event->comm.pid);
693 694

	if (thread == NULL ||
695
	    thread__set_comm_adjust(thread, event->comm.comm)) {
696
		dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n");
697
		return -1;
698
	}
699 700 701 702

	return 0;
}

703
static int process_read_event(event_t *event)
704
{
705
	struct perf_event_attr *attr;
706 707

	attr = perf_header__find_attr(event->read.id, header);
708

709
	if (show_threads) {
710
		const char *name = attr ? __event_name(attr->type, attr->config)
711 712 713 714 715 716 717 718
				   : "unknown";
		perf_read_values_add_value(&show_threads_values,
					   event->read.pid, event->read.tid,
					   event->read.id,
					   name,
					   event->read.value);
	}

719 720 721
	dump_printf(": %d %d %s %Lu\n", event->read.pid, event->read.tid,
		    attr ? __event_name(attr->type, attr->config) : "FAIL",
		    event->read.value);
722 723 724 725

	return 0;
}

726
static int sample_type_check(u64 type)
727
{
728
	sample_type = type;
729

730 731 732 733 734
	if (!(sample_type & PERF_SAMPLE_CALLCHAIN)) {
		if (sort__has_parent) {
			fprintf(stderr, "selected --sort parent, but no"
					" callchain data. Did you call"
					" perf record without -g?\n");
735
			return -1;
736 737
		}
		if (callchain) {
738
			fprintf(stderr, "selected -g but no callchain data."
739 740
					" Did you call perf record without"
					" -g?\n");
741
			return -1;
742
		}
743 744 745 746 747
	} else if (callchain_param.mode != CHAIN_NONE && !callchain) {
			callchain = 1;
			if (register_callchain_param(&callchain_param) < 0) {
				fprintf(stderr, "Can't register callchain"
						" params\n");
748
				return -1;
749
			}
750 751
	}

752 753
	return 0;
}
754

755 756
static struct perf_file_handler file_handler = {
	.process_sample_event	= process_sample_event,
757
	.process_mmap_event	= event__process_mmap,
758
	.process_comm_event	= process_comm_event,
759 760 761
	.process_exit_event	= event__process_task,
	.process_fork_event	= event__process_task,
	.process_lost_event	= event__process_lost,
762 763 764
	.process_read_event	= process_read_event,
	.sample_type_check	= sample_type_check,
};
765 766


767 768 769 770
static int __cmd_report(void)
{
	struct thread *idle;
	int ret;
771

772
	idle = register_idle_thread();
773
	thread__comm_adjust(idle);
I
Ingo Molnar 已提交
774

775 776
	if (show_threads)
		perf_read_values_init(&show_threads_values);
777

778
	register_perf_file_handler(&file_handler);
779

780
	ret = mmap_dispatch_perf_file(&header, input_name, force,
781
				      full_paths, &event__cwdlen, &event__cwd);
782 783
	if (ret)
		return ret;
784

785 786
	if (dump_trace) {
		event__print_totals();
787
		return 0;
788
	}
789

790
	if (verbose > 3)
791
		threads__fprintf(stdout);
792

793
	if (verbose > 2)
794 795
		dsos__fprintf(stdout);

P
Peter Zijlstra 已提交
796
	collapse__resort();
797 798
	output__resort(event__stats.total);
	output__fprintf(stdout, event__stats.total);
799

800 801 802
	if (show_threads)
		perf_read_values_destroy(&show_threads_values);

803
	return ret;
804 805
}

806 807 808 809
static int
parse_callchain_opt(const struct option *opt __used, const char *arg,
		    int unset __used)
{
810 811 812
	char *tok;
	char *endptr;

813 814 815 816 817
	callchain = 1;

	if (!arg)
		return 0;

818 819 820 821 822 823
	tok = strtok((char *)arg, ",");
	if (!tok)
		return -1;

	/* get the output mode */
	if (!strncmp(tok, "graph", strlen(arg)))
824
		callchain_param.mode = CHAIN_GRAPH_ABS;
825

826
	else if (!strncmp(tok, "flat", strlen(arg)))
827 828 829 830 831
		callchain_param.mode = CHAIN_FLAT;

	else if (!strncmp(tok, "fractal", strlen(arg)))
		callchain_param.mode = CHAIN_GRAPH_REL;

832 833 834 835 836 837 838
	else if (!strncmp(tok, "none", strlen(arg))) {
		callchain_param.mode = CHAIN_NONE;
		callchain = 0;

		return 0;
	}

839 840 841
	else
		return -1;

842 843 844
	/* get the min percentage */
	tok = strtok(NULL, ",");
	if (!tok)
845
		goto setup;
846

847
	callchain_param.min_percent = strtod(tok, &endptr);
848 849 850
	if (tok == endptr)
		return -1;

851 852 853 854 855
setup:
	if (register_callchain_param(&callchain_param) < 0) {
		fprintf(stderr, "Can't register callchain params\n");
		return -1;
	}
856 857 858
	return 0;
}

859 860
//static const char * const report_usage[] = {
const char * const report_usage[] = {
861 862 863 864 865 866 867
	"perf report [<options>] <command>",
	NULL
};

static const struct option options[] = {
	OPT_STRING('i', "input", &input_name, "file",
		    "input file name"),
868 869
	OPT_BOOLEAN('v', "verbose", &verbose,
		    "be more verbose (show symbol address, etc)"),
870 871
	OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
		    "dump raw trace in ASCII"),
872 873
	OPT_STRING('k', "vmlinux", &symbol_conf.vmlinux_name,
		   "file", "vmlinux pathname"),
874
	OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
875
	OPT_BOOLEAN('m', "modules", &symbol_conf.use_modules,
876
		    "load module symbols - WARNING: use only with -k and LIVE kernel"),
877 878
	OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples,
		    "Show a column with the number of samples"),
879 880
	OPT_BOOLEAN('T', "threads", &show_threads,
		    "Show per-thread event counters"),
881 882
	OPT_STRING(0, "pretty", &pretty_printing_style, "key",
		   "pretty printing style key: normal raw"),
883
	OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
884
		   "sort by key(s): pid, comm, dso, symbol, parent"),
885 886
	OPT_BOOLEAN('P', "full-paths", &full_paths,
		    "Don't shorten the pathnames taking into account the cwd"),
887 888
	OPT_STRING('p', "parent", &parent_pattern, "regex",
		   "regex filter to identify parent, see: '--sort parent'"),
889 890
	OPT_BOOLEAN('x', "exclude-other", &exclude_other,
		    "Only display entries with parent-match"),
891
	OPT_CALLBACK_DEFAULT('g', "call-graph", NULL, "output_type,min_percent",
892
		     "Display callchains using output_type and min percent threshold. "
893
		     "Default: fractal,0.5", &parse_callchain_opt, callchain_default_opt),
894 895
	OPT_STRING('d', "dsos", &dso_list_str, "dso[,dso...]",
		   "only consider symbols in these dsos"),
896 897
	OPT_STRING('C', "comms", &comm_list_str, "comm[,comm...]",
		   "only consider symbols in these comms"),
898 899
	OPT_STRING('S', "symbols", &sym_list_str, "symbol[,symbol...]",
		   "only consider these symbols"),
900 901 902 903 904 905
	OPT_STRING('w', "column-widths", &col_width_list_str,
		   "width[,width...]",
		   "don't try to adjust column width, use these fixed values"),
	OPT_STRING('t', "field-separator", &field_sep, "separator",
		   "separator for columns, no spaces will be added between "
		   "columns '.' is reserved."),
906 907 908
	OPT_END()
};

909 910 911 912 913 914 915 916 917 918 919 920 921 922 923
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);
}

924
static void setup_list(struct strlist **list, const char *list_str,
925 926
		       struct sort_entry *se, const char *list_name,
		       FILE *fp)
927 928 929 930 931 932 933 934
{
	if (list_str) {
		*list = strlist__new(true, list_str);
		if (!*list) {
			fprintf(stderr, "problems parsing %s list\n",
				list_name);
			exit(129);
		}
935 936 937 938 939
		if (strlist__nr_entries(*list) == 1) {
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(*list, 0)->s);
			se->elide = true;
		}
940 941 942
	}
}

943
int cmd_report(int argc, const char **argv, const char *prefix __used)
944
{
945 946
	if (symbol__init(&symbol_conf) < 0)
		return -1;
947

948
	argc = parse_options(argc, argv, options, report_usage, 0);
949

950 951
	setup_sorting();

952
	if (parent_pattern != default_parent_pattern) {
953
		sort_dimension__add("parent");
954 955
		sort_parent.elide = 1;
	} else
956 957
		exclude_other = 0;

958 959 960 961 962 963
	/*
	 * Any (unrecognized) arguments left?
	 */
	if (argc)
		usage_with_options(report_usage, options);

964 965
	setup_pager();

966 967 968
	setup_list(&dso_list, dso_list_str, &sort_dso, "dso", stdout);
	setup_list(&comm_list, comm_list_str, &sort_comm, "comm", stdout);
	setup_list(&sym_list, sym_list_str, &sort_sym, "symbol", stdout);
969

970 971 972 973 974 975
	if (field_sep && *field_sep == '.') {
		fputs("'.' is the only non valid --field-separator argument\n",
		      stderr);
		exit(129);
	}

976 977
	return __cmd_report();
}