sort.c 71.7 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
2
#include <errno.h>
3
#include <inttypes.h>
4
#include <regex.h>
5
#include <linux/mman.h>
6
#include "sort.h"
7
#include "hist.h"
8
#include "comm.h"
9
#include "symbol.h"
10
#include "thread.h"
11
#include "evsel.h"
12
#include "evlist.h"
13
#include "strlist.h"
14
#include <traceevent/event-parse.h>
15
#include "mem-events.h"
16
#include <linux/kernel.h>
17 18

regex_t		parent_regex;
19 20
const char	default_parent_pattern[] = "^sys_|^do_page_fault";
const char	*parent_pattern = default_parent_pattern;
21
const char	*default_sort_order = "comm,dso,symbol";
22
const char	default_branch_sort_order[] = "comm,dso_from,symbol_from,symbol_to,cycles";
23 24 25
const char	default_mem_sort_order[] = "local_weight,mem,sym,dso,symbol_daddr,dso_daddr,snoop,tlb,locked";
const char	default_top_sort_order[] = "dso,symbol";
const char	default_diff_sort_order[] = "dso,symbol";
26
const char	default_tracepoint_sort_order[] = "trace";
27
const char	*sort_order;
28
const char	*field_order;
29 30
regex_t		ignore_callees_regex;
int		have_ignore_callees = 0;
31
enum sort_mode	sort__mode = SORT_MODE__NORMAL;
32

33 34 35 36 37 38 39 40 41
/*
 * Replaces all occurrences of a char used with the:
 *
 * -t, --field-separator
 *
 * option, that uses a special separator character and don't pad with spaces,
 * replacing all occurances of this separator in symbol names (and other
 * output) with a '.' character, that thus it's the only non valid separator.
*/
42
static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
43 44 45 46 47
{
	int n;
	va_list ap;

	va_start(ap, fmt);
48
	n = vsnprintf(bf, size, fmt, ap);
49
	if (symbol_conf.field_sep && n > 0) {
50 51 52
		char *sep = bf;

		while (1) {
53
			sep = strchr(sep, *symbol_conf.field_sep);
54 55 56
			if (sep == NULL)
				break;
			*sep = '.';
57 58 59
		}
	}
	va_end(ap);
60 61 62

	if (n >= (int)size)
		return size - 1;
63 64 65
	return n;
}

66
static int64_t cmp_null(const void *l, const void *r)
67 68 69 70 71 72 73 74 75 76 77 78 79 80
{
	if (!l && !r)
		return 0;
	else if (!l)
		return -1;
	else
		return 1;
}

/* --sort pid */

static int64_t
sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
{
81
	return right->thread->tid - left->thread->tid;
82 83
}

84
static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf,
85
				       size_t size, unsigned int width)
86
{
87
	const char *comm = thread__comm_str(he->thread);
88

89 90
	width = max(7U, width) - 8;
	return repsep_snprintf(bf, size, "%7d:%-*.*s", he->thread->tid,
91
			       width, width, comm ?: "");
92 93
}

94 95 96 97 98 99 100 101 102 103
static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg)
{
	const struct thread *th = arg;

	if (type != HIST_FILTER__THREAD)
		return -1;

	return th && he->thread != th;
}

104
struct sort_entry sort_thread = {
105
	.se_header	= "    Pid:Command",
106 107
	.se_cmp		= sort__thread_cmp,
	.se_snprintf	= hist_entry__thread_snprintf,
108
	.se_filter	= hist_entry__thread_filter,
109 110 111 112 113
	.se_width_idx	= HISTC_THREAD,
};

/* --sort comm */

114 115 116 117 118
/*
 * We can't use pointer comparison in functions below,
 * because it gives different results based on pointer
 * values, which could break some sorting assumptions.
 */
119 120 121
static int64_t
sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
{
122
	return strcmp(comm__str(right->comm), comm__str(left->comm));
123 124 125 126 127
}

static int64_t
sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
{
128
	return strcmp(comm__str(right->comm), comm__str(left->comm));
129 130
}

131 132 133 134 135 136
static int64_t
sort__comm_sort(struct hist_entry *left, struct hist_entry *right)
{
	return strcmp(comm__str(right->comm), comm__str(left->comm));
}

137
static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf,
138
				     size_t size, unsigned int width)
139
{
140
	return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm));
141 142
}

143 144 145 146
struct sort_entry sort_comm = {
	.se_header	= "Command",
	.se_cmp		= sort__comm_cmp,
	.se_collapse	= sort__comm_collapse,
147
	.se_sort	= sort__comm_sort,
148
	.se_snprintf	= hist_entry__comm_snprintf,
149
	.se_filter	= hist_entry__thread_filter,
150 151 152 153 154
	.se_width_idx	= HISTC_COMM,
};

/* --sort dso */

155 156 157 158 159 160 161
static int64_t _sort__dso_cmp(struct map *map_l, struct map *map_r)
{
	struct dso *dso_l = map_l ? map_l->dso : NULL;
	struct dso *dso_r = map_r ? map_r->dso : NULL;
	const char *dso_name_l, *dso_name_r;

	if (!dso_l || !dso_r)
162
		return cmp_null(dso_r, dso_l);
163

164
	if (verbose > 0) {
165 166 167 168 169 170 171 172 173 174
		dso_name_l = dso_l->long_name;
		dso_name_r = dso_r->long_name;
	} else {
		dso_name_l = dso_l->short_name;
		dso_name_r = dso_r->short_name;
	}

	return strcmp(dso_name_l, dso_name_r);
}

175
static int64_t
176 177
sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
{
178
	return _sort__dso_cmp(right->ms.map, left->ms.map);
179
}
180

181 182 183 184
static int _hist_entry__dso_snprintf(struct map *map, char *bf,
				     size_t size, unsigned int width)
{
	if (map && map->dso) {
185 186
		const char *dso_name = verbose > 0 ? map->dso->long_name :
			map->dso->short_name;
187
		return repsep_snprintf(bf, size, "%-*.*s", width, width, dso_name);
188 189
	}

190
	return repsep_snprintf(bf, size, "%-*.*s", width, width, "[unknown]");
191 192
}

193
static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf,
194 195
				    size_t size, unsigned int width)
{
196
	return _hist_entry__dso_snprintf(he->ms.map, bf, size, width);
197 198
}

199 200 201 202 203 204 205 206 207 208
static int hist_entry__dso_filter(struct hist_entry *he, int type, const void *arg)
{
	const struct dso *dso = arg;

	if (type != HIST_FILTER__DSO)
		return -1;

	return dso && (!he->ms.map || he->ms.map->dso != dso);
}

209 210 211 212
struct sort_entry sort_dso = {
	.se_header	= "Shared Object",
	.se_cmp		= sort__dso_cmp,
	.se_snprintf	= hist_entry__dso_snprintf,
213
	.se_filter	= hist_entry__dso_filter,
214 215 216 217
	.se_width_idx	= HISTC_DSO,
};

/* --sort symbol */
218

219 220 221 222 223
static int64_t _sort__addr_cmp(u64 left_ip, u64 right_ip)
{
	return (int64_t)(right_ip - left_ip);
}

224
static int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r)
225 226 227 228 229 230 231
{
	if (!sym_l || !sym_r)
		return cmp_null(sym_l, sym_r);

	if (sym_l == sym_r)
		return 0;

232 233 234
	if (sym_l->inlined || sym_r->inlined)
		return strcmp(sym_l->name, sym_r->name);

235 236
	if (sym_l->start != sym_r->start)
		return (int64_t)(sym_r->start - sym_l->start);
237

238
	return (int64_t)(sym_r->end - sym_l->end);
239 240
}

241 242
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
243
{
244 245
	int64_t ret;

246
	if (!left->ms.sym && !right->ms.sym)
247
		return _sort__addr_cmp(left->ip, right->ip);
248

249 250 251 252
	/*
	 * comparing symbol address alone is not enough since it's a
	 * relative address within a dso.
	 */
253
	if (!hists__has(left->hists, dso) || hists__has(right->hists, dso)) {
N
Namhyung Kim 已提交
254 255 256 257
		ret = sort__dso_cmp(left, right);
		if (ret != 0)
			return ret;
	}
258

259
	return _sort__sym_cmp(left->ms.sym, right->ms.sym);
260 261
}

262 263 264 265 266 267 268 269 270
static int64_t
sort__sym_sort(struct hist_entry *left, struct hist_entry *right)
{
	if (!left->ms.sym || !right->ms.sym)
		return cmp_null(left->ms.sym, right->ms.sym);

	return strcmp(right->ms.sym->name, left->ms.sym->name);
}

271 272
static int _hist_entry__sym_snprintf(struct map *map, struct symbol *sym,
				     u64 ip, char level, char *bf, size_t size,
273
				     unsigned int width)
274 275 276
{
	size_t ret = 0;

277
	if (verbose > 0) {
278 279
		char o = map ? dso__symtab_origin(map->dso) : '!';
		ret += repsep_snprintf(bf, size, "%-#*llx %c ",
280
				       BITS_PER_LONG / 4 + 2, ip, o);
281
	}
282

283
	ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level);
284
	if (sym && map) {
285
		if (sym->type == STT_OBJECT) {
286 287
			ret += repsep_snprintf(bf + ret, size - ret, "%s", sym->name);
			ret += repsep_snprintf(bf + ret, size - ret, "+0x%llx",
288
					ip - map->unmap_ip(map, sym->start));
289
		} else {
290
			ret += repsep_snprintf(bf + ret, size - ret, "%.*s",
291 292
					       width - ret,
					       sym->name);
293 294 295
			if (sym->inlined)
				ret += repsep_snprintf(bf + ret, size - ret,
						       " (inlined)");
296 297
		}
	} else {
298 299 300 301 302
		size_t len = BITS_PER_LONG / 4;
		ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx",
				       len, ip);
	}

303
	return ret;
304 305
}

306
static int hist_entry__sym_snprintf(struct hist_entry *he, char *bf,
307
				    size_t size, unsigned int width)
308
{
309 310
	return _hist_entry__sym_snprintf(he->ms.map, he->ms.sym, he->ip,
					 he->level, bf, size, width);
311
}
312

313 314 315 316 317 318 319 320 321 322
static int hist_entry__sym_filter(struct hist_entry *he, int type, const void *arg)
{
	const char *sym = arg;

	if (type != HIST_FILTER__SYMBOL)
		return -1;

	return sym && (!he->ms.sym || !strstr(he->ms.sym->name, sym));
}

323 324 325
struct sort_entry sort_sym = {
	.se_header	= "Symbol",
	.se_cmp		= sort__sym_cmp,
326
	.se_sort	= sort__sym_sort,
327
	.se_snprintf	= hist_entry__sym_snprintf,
328
	.se_filter	= hist_entry__sym_filter,
329 330
	.se_width_idx	= HISTC_SYMBOL,
};
331

332 333
/* --sort srcline */

J
Jiri Olsa 已提交
334
char *hist_entry__get_srcline(struct hist_entry *he)
335 336 337 338 339 340 341
{
	struct map *map = he->ms.map;

	if (!map)
		return SRCLINE_UNKNOWN;

	return get_srcline(map->dso, map__rip_2objdump(map, he->ip),
342
			   he->ms.sym, true, true, he->ip);
343 344
}

345 346 347
static int64_t
sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right)
{
348 349 350 351 352
	if (!left->srcline)
		left->srcline = hist_entry__get_srcline(left);
	if (!right->srcline)
		right->srcline = hist_entry__get_srcline(right);

353
	return strcmp(right->srcline, left->srcline);
354 355
}

356
static int hist_entry__srcline_snprintf(struct hist_entry *he, char *bf,
357
					size_t size, unsigned int width)
358
{
359 360 361
	if (!he->srcline)
		he->srcline = hist_entry__get_srcline(he);

362
	return repsep_snprintf(bf, size, "%-.*s", width, he->srcline);
363 364 365 366 367 368 369 370 371
}

struct sort_entry sort_srcline = {
	.se_header	= "Source:Line",
	.se_cmp		= sort__srcline_cmp,
	.se_snprintf	= hist_entry__srcline_snprintf,
	.se_width_idx	= HISTC_SRCLINE,
};

372 373 374 375 376 377 378 379 380 381 382 383 384
/* --sort srcline_from */

static int64_t
sort__srcline_from_cmp(struct hist_entry *left, struct hist_entry *right)
{
	if (!left->branch_info->srcline_from) {
		struct map *map = left->branch_info->from.map;
		if (!map)
			left->branch_info->srcline_from = SRCLINE_UNKNOWN;
		else
			left->branch_info->srcline_from = get_srcline(map->dso,
					   map__rip_2objdump(map,
							     left->branch_info->from.al_addr),
385
							 left->branch_info->from.sym,
386 387
							 true, true,
							 left->branch_info->from.al_addr);
388 389 390 391 392 393 394 395 396
	}
	if (!right->branch_info->srcline_from) {
		struct map *map = right->branch_info->from.map;
		if (!map)
			right->branch_info->srcline_from = SRCLINE_UNKNOWN;
		else
			right->branch_info->srcline_from = get_srcline(map->dso,
					     map__rip_2objdump(map,
							       right->branch_info->from.al_addr),
397
						     right->branch_info->from.sym,
398 399
						     true, true,
						     right->branch_info->from.al_addr);
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
	}
	return strcmp(right->branch_info->srcline_from, left->branch_info->srcline_from);
}

static int hist_entry__srcline_from_snprintf(struct hist_entry *he, char *bf,
					size_t size, unsigned int width)
{
	return repsep_snprintf(bf, size, "%-*.*s", width, width, he->branch_info->srcline_from);
}

struct sort_entry sort_srcline_from = {
	.se_header	= "From Source:Line",
	.se_cmp		= sort__srcline_from_cmp,
	.se_snprintf	= hist_entry__srcline_from_snprintf,
	.se_width_idx	= HISTC_SRCLINE_FROM,
};

/* --sort srcline_to */

static int64_t
sort__srcline_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
	if (!left->branch_info->srcline_to) {
		struct map *map = left->branch_info->to.map;
		if (!map)
			left->branch_info->srcline_to = SRCLINE_UNKNOWN;
		else
			left->branch_info->srcline_to = get_srcline(map->dso,
					   map__rip_2objdump(map,
							     left->branch_info->to.al_addr),
430
							 left->branch_info->from.sym,
431 432
							 true, true,
							 left->branch_info->to.al_addr);
433 434 435 436 437 438 439 440 441
	}
	if (!right->branch_info->srcline_to) {
		struct map *map = right->branch_info->to.map;
		if (!map)
			right->branch_info->srcline_to = SRCLINE_UNKNOWN;
		else
			right->branch_info->srcline_to = get_srcline(map->dso,
					     map__rip_2objdump(map,
							       right->branch_info->to.al_addr),
442
						     right->branch_info->to.sym,
443 444
						     true, true,
						     right->branch_info->to.al_addr);
445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461
	}
	return strcmp(right->branch_info->srcline_to, left->branch_info->srcline_to);
}

static int hist_entry__srcline_to_snprintf(struct hist_entry *he, char *bf,
					size_t size, unsigned int width)
{
	return repsep_snprintf(bf, size, "%-*.*s", width, width, he->branch_info->srcline_to);
}

struct sort_entry sort_srcline_to = {
	.se_header	= "To Source:Line",
	.se_cmp		= sort__srcline_to_cmp,
	.se_snprintf	= hist_entry__srcline_to_snprintf,
	.se_width_idx	= HISTC_SRCLINE_TO,
};

462 463 464 465
/* --sort srcfile */

static char no_srcfile[1];

466
static char *hist_entry__get_srcfile(struct hist_entry *e)
467 468 469 470
{
	char *sf, *p;
	struct map *map = e->ms.map;

471 472 473
	if (!map)
		return no_srcfile;

474
	sf = __get_srcline(map->dso, map__rip_2objdump(map, e->ip),
475
			 e->ms.sym, false, true, true, e->ip);
476 477
	if (!strcmp(sf, SRCLINE_UNKNOWN))
		return no_srcfile;
478 479 480 481 482 483 484 485 486 487 488 489
	p = strchr(sf, ':');
	if (p && *sf) {
		*p = 0;
		return sf;
	}
	free(sf);
	return no_srcfile;
}

static int64_t
sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right)
{
490 491 492 493 494
	if (!left->srcfile)
		left->srcfile = hist_entry__get_srcfile(left);
	if (!right->srcfile)
		right->srcfile = hist_entry__get_srcfile(right);

495 496 497 498 499 500
	return strcmp(right->srcfile, left->srcfile);
}

static int hist_entry__srcfile_snprintf(struct hist_entry *he, char *bf,
					size_t size, unsigned int width)
{
501 502 503
	if (!he->srcfile)
		he->srcfile = hist_entry__get_srcfile(he);

504
	return repsep_snprintf(bf, size, "%-.*s", width, he->srcfile);
505 506 507 508 509 510 511 512 513
}

struct sort_entry sort_srcfile = {
	.se_header	= "Source File",
	.se_cmp		= sort__srcfile_cmp,
	.se_snprintf	= hist_entry__srcfile_snprintf,
	.se_width_idx	= HISTC_SRCFILE,
};

514 515
/* --sort parent */

516
static int64_t
517 518 519 520 521 522 523 524
sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
{
	struct symbol *sym_l = left->parent;
	struct symbol *sym_r = right->parent;

	if (!sym_l || !sym_r)
		return cmp_null(sym_l, sym_r);

525
	return strcmp(sym_r->name, sym_l->name);
526 527
}

528
static int hist_entry__parent_snprintf(struct hist_entry *he, char *bf,
529
				       size_t size, unsigned int width)
530
{
531
	return repsep_snprintf(bf, size, "%-*.*s", width, width,
532
			      he->parent ? he->parent->name : "[other]");
533 534
}

535 536 537 538 539 540 541
struct sort_entry sort_parent = {
	.se_header	= "Parent symbol",
	.se_cmp		= sort__parent_cmp,
	.se_snprintf	= hist_entry__parent_snprintf,
	.se_width_idx	= HISTC_PARENT,
};

A
Arun Sharma 已提交
542 543
/* --sort cpu */

544
static int64_t
A
Arun Sharma 已提交
545 546 547 548 549
sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return right->cpu - left->cpu;
}

550 551
static int hist_entry__cpu_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
A
Arun Sharma 已提交
552
{
553
	return repsep_snprintf(bf, size, "%*.*d", width, width, he->cpu);
A
Arun Sharma 已提交
554 555
}

556 557 558 559 560 561 562
struct sort_entry sort_cpu = {
	.se_header      = "CPU",
	.se_cmp	        = sort__cpu_cmp,
	.se_snprintf    = hist_entry__cpu_snprintf,
	.se_width_idx	= HISTC_CPU,
};

563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602
/* --sort cgroup_id */

static int64_t _sort__cgroup_dev_cmp(u64 left_dev, u64 right_dev)
{
	return (int64_t)(right_dev - left_dev);
}

static int64_t _sort__cgroup_inode_cmp(u64 left_ino, u64 right_ino)
{
	return (int64_t)(right_ino - left_ino);
}

static int64_t
sort__cgroup_id_cmp(struct hist_entry *left, struct hist_entry *right)
{
	int64_t ret;

	ret = _sort__cgroup_dev_cmp(right->cgroup_id.dev, left->cgroup_id.dev);
	if (ret != 0)
		return ret;

	return _sort__cgroup_inode_cmp(right->cgroup_id.ino,
				       left->cgroup_id.ino);
}

static int hist_entry__cgroup_id_snprintf(struct hist_entry *he,
					  char *bf, size_t size,
					  unsigned int width __maybe_unused)
{
	return repsep_snprintf(bf, size, "%lu/0x%lx", he->cgroup_id.dev,
			       he->cgroup_id.ino);
}

struct sort_entry sort_cgroup_id = {
	.se_header      = "cgroup id (dev/inode)",
	.se_cmp	        = sort__cgroup_id_cmp,
	.se_snprintf    = hist_entry__cgroup_id_snprintf,
	.se_width_idx	= HISTC_CGROUP_ID,
};

603 604 605 606 607 608 609 610 611 612 613 614 615 616
/* --sort socket */

static int64_t
sort__socket_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return right->socket - left->socket;
}

static int hist_entry__socket_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
{
	return repsep_snprintf(bf, size, "%*.*d", width, width-3, he->socket);
}

617 618 619 620 621 622 623 624 625 626
static int hist_entry__socket_filter(struct hist_entry *he, int type, const void *arg)
{
	int sk = *(const int *)arg;

	if (type != HIST_FILTER__SOCKET)
		return -1;

	return sk >= 0 && he->socket != sk;
}

627 628 629 630
struct sort_entry sort_socket = {
	.se_header      = "Socket",
	.se_cmp	        = sort__socket_cmp,
	.se_snprintf    = hist_entry__socket_snprintf,
631
	.se_filter      = hist_entry__socket_filter,
632 633 634
	.se_width_idx	= HISTC_SOCKET,
};

N
Namhyung Kim 已提交
635 636 637 638 639 640 641 642 643 644 645 646 647 648
/* --sort trace */

static char *get_trace_output(struct hist_entry *he)
{
	struct trace_seq seq;
	struct perf_evsel *evsel;
	struct pevent_record rec = {
		.data = he->raw_data,
		.size = he->raw_size,
	};

	evsel = hists_to_evsel(he->hists);

	trace_seq_init(&seq);
649 650 651 652 653 654
	if (symbol_conf.raw_trace) {
		pevent_print_fields(&seq, he->raw_data, he->raw_size,
				    evsel->tp_format);
	} else {
		pevent_event_info(&seq, evsel->tp_format, &rec);
	}
655 656 657 658 659
	/*
	 * Trim the buffer, it starts at 4KB and we're not going to
	 * add anything more to this buffer.
	 */
	return realloc(seq.buffer, seq.len + 1);
N
Namhyung Kim 已提交
660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685
}

static int64_t
sort__trace_cmp(struct hist_entry *left, struct hist_entry *right)
{
	struct perf_evsel *evsel;

	evsel = hists_to_evsel(left->hists);
	if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
		return 0;

	if (left->trace_output == NULL)
		left->trace_output = get_trace_output(left);
	if (right->trace_output == NULL)
		right->trace_output = get_trace_output(right);

	return strcmp(right->trace_output, left->trace_output);
}

static int hist_entry__trace_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
{
	struct perf_evsel *evsel;

	evsel = hists_to_evsel(he->hists);
	if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
686
		return scnprintf(bf, size, "%-.*s", width, "N/A");
N
Namhyung Kim 已提交
687 688 689

	if (he->trace_output == NULL)
		he->trace_output = get_trace_output(he);
690
	return repsep_snprintf(bf, size, "%-.*s", width, he->trace_output);
N
Namhyung Kim 已提交
691 692 693 694 695 696 697 698 699
}

struct sort_entry sort_trace = {
	.se_header      = "Trace output",
	.se_cmp	        = sort__trace_cmp,
	.se_snprintf    = hist_entry__trace_snprintf,
	.se_width_idx	= HISTC_TRACE,
};

700 701
/* sort keys for branch stacks */

702 703 704
static int64_t
sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right)
{
705 706 707
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

708 709 710 711
	return _sort__dso_cmp(left->branch_info->from.map,
			      right->branch_info->from.map);
}

712
static int hist_entry__dso_from_snprintf(struct hist_entry *he, char *bf,
713 714
				    size_t size, unsigned int width)
{
715 716 717 718 719
	if (he->branch_info)
		return _hist_entry__dso_snprintf(he->branch_info->from.map,
						 bf, size, width);
	else
		return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
720 721
}

722 723 724 725 726 727 728 729 730 731 732 733
static int hist_entry__dso_from_filter(struct hist_entry *he, int type,
				       const void *arg)
{
	const struct dso *dso = arg;

	if (type != HIST_FILTER__DSO)
		return -1;

	return dso && (!he->branch_info || !he->branch_info->from.map ||
		       he->branch_info->from.map->dso != dso);
}

734 735 736
static int64_t
sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
737 738 739
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

740 741 742 743
	return _sort__dso_cmp(left->branch_info->to.map,
			      right->branch_info->to.map);
}

744
static int hist_entry__dso_to_snprintf(struct hist_entry *he, char *bf,
745 746
				       size_t size, unsigned int width)
{
747 748 749 750 751
	if (he->branch_info)
		return _hist_entry__dso_snprintf(he->branch_info->to.map,
						 bf, size, width);
	else
		return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
752 753
}

754 755 756 757 758 759 760 761 762 763 764 765
static int hist_entry__dso_to_filter(struct hist_entry *he, int type,
				     const void *arg)
{
	const struct dso *dso = arg;

	if (type != HIST_FILTER__DSO)
		return -1;

	return dso && (!he->branch_info || !he->branch_info->to.map ||
		       he->branch_info->to.map->dso != dso);
}

766 767 768 769 770 771
static int64_t
sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right)
{
	struct addr_map_symbol *from_l = &left->branch_info->from;
	struct addr_map_symbol *from_r = &right->branch_info->from;

772 773 774 775 776 777
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

	from_l = &left->branch_info->from;
	from_r = &right->branch_info->from;

778
	if (!from_l->sym && !from_r->sym)
779
		return _sort__addr_cmp(from_l->addr, from_r->addr);
780

781
	return _sort__sym_cmp(from_l->sym, from_r->sym);
782 783 784 785 786
}

static int64_t
sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
787 788 789 790 791 792 793
	struct addr_map_symbol *to_l, *to_r;

	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

	to_l = &left->branch_info->to;
	to_r = &right->branch_info->to;
794 795

	if (!to_l->sym && !to_r->sym)
796
		return _sort__addr_cmp(to_l->addr, to_r->addr);
797

798
	return _sort__sym_cmp(to_l->sym, to_r->sym);
799 800
}

801
static int hist_entry__sym_from_snprintf(struct hist_entry *he, char *bf,
802
					 size_t size, unsigned int width)
803
{
804 805
	if (he->branch_info) {
		struct addr_map_symbol *from = &he->branch_info->from;
806

807 808 809 810 811
		return _hist_entry__sym_snprintf(from->map, from->sym, from->addr,
						 he->level, bf, size, width);
	}

	return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
812 813
}

814
static int hist_entry__sym_to_snprintf(struct hist_entry *he, char *bf,
815
				       size_t size, unsigned int width)
816
{
817 818 819 820 821 822
	if (he->branch_info) {
		struct addr_map_symbol *to = &he->branch_info->to;

		return _hist_entry__sym_snprintf(to->map, to->sym, to->addr,
						 he->level, bf, size, width);
	}
823

824
	return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
825 826
}

827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850
static int hist_entry__sym_from_filter(struct hist_entry *he, int type,
				       const void *arg)
{
	const char *sym = arg;

	if (type != HIST_FILTER__SYMBOL)
		return -1;

	return sym && !(he->branch_info && he->branch_info->from.sym &&
			strstr(he->branch_info->from.sym->name, sym));
}

static int hist_entry__sym_to_filter(struct hist_entry *he, int type,
				       const void *arg)
{
	const char *sym = arg;

	if (type != HIST_FILTER__SYMBOL)
		return -1;

	return sym && !(he->branch_info && he->branch_info->to.sym &&
		        strstr(he->branch_info->to.sym->name, sym));
}

851 852 853 854
struct sort_entry sort_dso_from = {
	.se_header	= "Source Shared Object",
	.se_cmp		= sort__dso_from_cmp,
	.se_snprintf	= hist_entry__dso_from_snprintf,
855
	.se_filter	= hist_entry__dso_from_filter,
856 857 858
	.se_width_idx	= HISTC_DSO_FROM,
};

859 860 861 862
struct sort_entry sort_dso_to = {
	.se_header	= "Target Shared Object",
	.se_cmp		= sort__dso_to_cmp,
	.se_snprintf	= hist_entry__dso_to_snprintf,
863
	.se_filter	= hist_entry__dso_to_filter,
864 865 866 867 868 869 870
	.se_width_idx	= HISTC_DSO_TO,
};

struct sort_entry sort_sym_from = {
	.se_header	= "Source Symbol",
	.se_cmp		= sort__sym_from_cmp,
	.se_snprintf	= hist_entry__sym_from_snprintf,
871
	.se_filter	= hist_entry__sym_from_filter,
872 873 874 875 876 877 878
	.se_width_idx	= HISTC_SYMBOL_FROM,
};

struct sort_entry sort_sym_to = {
	.se_header	= "Target Symbol",
	.se_cmp		= sort__sym_to_cmp,
	.se_snprintf	= hist_entry__sym_to_snprintf,
879
	.se_filter	= hist_entry__sym_to_filter,
880 881 882 883 884 885
	.se_width_idx	= HISTC_SYMBOL_TO,
};

static int64_t
sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right)
{
886
	unsigned char mp, p;
887

888 889 890 891 892
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

	mp = left->branch_info->flags.mispred != right->branch_info->flags.mispred;
	p  = left->branch_info->flags.predicted != right->branch_info->flags.predicted;
893 894 895
	return mp || p;
}

896
static int hist_entry__mispredict_snprintf(struct hist_entry *he, char *bf,
897 898 899
				    size_t size, unsigned int width){
	static const char *out = "N/A";

900 901 902 903 904 905
	if (he->branch_info) {
		if (he->branch_info->flags.predicted)
			out = "N";
		else if (he->branch_info->flags.mispred)
			out = "Y";
	}
906

907
	return repsep_snprintf(bf, size, "%-*.*s", width, width, out);
908 909
}

910 911 912
static int64_t
sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right)
{
913 914 915
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

916 917 918 919 920 921 922
	return left->branch_info->flags.cycles -
		right->branch_info->flags.cycles;
}

static int hist_entry__cycles_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
{
923 924
	if (!he->branch_info)
		return scnprintf(bf, size, "%-.*s", width, "N/A");
925 926 927 928 929 930 931 932 933 934 935 936 937
	if (he->branch_info->flags.cycles == 0)
		return repsep_snprintf(bf, size, "%-*s", width, "-");
	return repsep_snprintf(bf, size, "%-*hd", width,
			       he->branch_info->flags.cycles);
}

struct sort_entry sort_cycles = {
	.se_header	= "Basic Block Cycles",
	.se_cmp		= sort__cycles_cmp,
	.se_snprintf	= hist_entry__cycles_snprintf,
	.se_width_idx	= HISTC_CYCLES,
};

938
/* --sort daddr_sym */
939
int64_t
940 941 942 943 944 945 946 947 948 949 950 951
sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t l = 0, r = 0;

	if (left->mem_info)
		l = left->mem_info->daddr.addr;
	if (right->mem_info)
		r = right->mem_info->daddr.addr;

	return (int64_t)(r - l);
}

952
static int hist_entry__daddr_snprintf(struct hist_entry *he, char *bf,
953 954 955 956 957 958
				    size_t size, unsigned int width)
{
	uint64_t addr = 0;
	struct map *map = NULL;
	struct symbol *sym = NULL;

959 960 961 962
	if (he->mem_info) {
		addr = he->mem_info->daddr.addr;
		map = he->mem_info->daddr.map;
		sym = he->mem_info->daddr.sym;
963
	}
964
	return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
965 966 967
					 width);
}

968
int64_t
969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996
sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t l = 0, r = 0;

	if (left->mem_info)
		l = left->mem_info->iaddr.addr;
	if (right->mem_info)
		r = right->mem_info->iaddr.addr;

	return (int64_t)(r - l);
}

static int hist_entry__iaddr_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
{
	uint64_t addr = 0;
	struct map *map = NULL;
	struct symbol *sym = NULL;

	if (he->mem_info) {
		addr = he->mem_info->iaddr.addr;
		map  = he->mem_info->iaddr.map;
		sym  = he->mem_info->iaddr.sym;
	}
	return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
					 width);
}

997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010
static int64_t
sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right)
{
	struct map *map_l = NULL;
	struct map *map_r = NULL;

	if (left->mem_info)
		map_l = left->mem_info->daddr.map;
	if (right->mem_info)
		map_r = right->mem_info->daddr.map;

	return _sort__dso_cmp(map_l, map_r);
}

1011
static int hist_entry__dso_daddr_snprintf(struct hist_entry *he, char *bf,
1012 1013 1014 1015
				    size_t size, unsigned int width)
{
	struct map *map = NULL;

1016 1017
	if (he->mem_info)
		map = he->mem_info->daddr.map;
1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040

	return _hist_entry__dso_snprintf(map, bf, size, width);
}

static int64_t
sort__locked_cmp(struct hist_entry *left, struct hist_entry *right)
{
	union perf_mem_data_src data_src_l;
	union perf_mem_data_src data_src_r;

	if (left->mem_info)
		data_src_l = left->mem_info->data_src;
	else
		data_src_l.mem_lock = PERF_MEM_LOCK_NA;

	if (right->mem_info)
		data_src_r = right->mem_info->data_src;
	else
		data_src_r.mem_lock = PERF_MEM_LOCK_NA;

	return (int64_t)(data_src_r.mem_lock - data_src_l.mem_lock);
}

1041
static int hist_entry__locked_snprintf(struct hist_entry *he, char *bf,
1042 1043
				    size_t size, unsigned int width)
{
1044
	char out[10];
1045

1046
	perf_mem__lck_scnprintf(out, sizeof(out), he->mem_info);
1047
	return repsep_snprintf(bf, size, "%.*s", width, out);
1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068
}

static int64_t
sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right)
{
	union perf_mem_data_src data_src_l;
	union perf_mem_data_src data_src_r;

	if (left->mem_info)
		data_src_l = left->mem_info->data_src;
	else
		data_src_l.mem_dtlb = PERF_MEM_TLB_NA;

	if (right->mem_info)
		data_src_r = right->mem_info->data_src;
	else
		data_src_r.mem_dtlb = PERF_MEM_TLB_NA;

	return (int64_t)(data_src_r.mem_dtlb - data_src_l.mem_dtlb);
}

1069
static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf,
1070 1071 1072 1073
				    size_t size, unsigned int width)
{
	char out[64];

1074
	perf_mem__tlb_scnprintf(out, sizeof(out), he->mem_info);
1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096
	return repsep_snprintf(bf, size, "%-*s", width, out);
}

static int64_t
sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right)
{
	union perf_mem_data_src data_src_l;
	union perf_mem_data_src data_src_r;

	if (left->mem_info)
		data_src_l = left->mem_info->data_src;
	else
		data_src_l.mem_lvl = PERF_MEM_LVL_NA;

	if (right->mem_info)
		data_src_r = right->mem_info->data_src;
	else
		data_src_r.mem_lvl = PERF_MEM_LVL_NA;

	return (int64_t)(data_src_r.mem_lvl - data_src_l.mem_lvl);
}

1097
static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf,
1098 1099 1100 1101
				    size_t size, unsigned int width)
{
	char out[64];

1102
	perf_mem__lvl_scnprintf(out, sizeof(out), he->mem_info);
1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
	return repsep_snprintf(bf, size, "%-*s", width, out);
}

static int64_t
sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right)
{
	union perf_mem_data_src data_src_l;
	union perf_mem_data_src data_src_r;

	if (left->mem_info)
		data_src_l = left->mem_info->data_src;
	else
		data_src_l.mem_snoop = PERF_MEM_SNOOP_NA;

	if (right->mem_info)
		data_src_r = right->mem_info->data_src;
	else
		data_src_r.mem_snoop = PERF_MEM_SNOOP_NA;

	return (int64_t)(data_src_r.mem_snoop - data_src_l.mem_snoop);
}

1125
static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf,
1126 1127 1128 1129
				    size_t size, unsigned int width)
{
	char out[64];

1130
	perf_mem__snp_scnprintf(out, sizeof(out), he->mem_info);
1131 1132 1133
	return repsep_snprintf(bf, size, "%-*s", width, out);
}

1134
int64_t
D
Don Zickus 已提交
1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213
sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right)
{
	u64 l, r;
	struct map *l_map, *r_map;

	if (!left->mem_info)  return -1;
	if (!right->mem_info) return 1;

	/* group event types together */
	if (left->cpumode > right->cpumode) return -1;
	if (left->cpumode < right->cpumode) return 1;

	l_map = left->mem_info->daddr.map;
	r_map = right->mem_info->daddr.map;

	/* if both are NULL, jump to sort on al_addr instead */
	if (!l_map && !r_map)
		goto addr;

	if (!l_map) return -1;
	if (!r_map) return 1;

	if (l_map->maj > r_map->maj) return -1;
	if (l_map->maj < r_map->maj) return 1;

	if (l_map->min > r_map->min) return -1;
	if (l_map->min < r_map->min) return 1;

	if (l_map->ino > r_map->ino) return -1;
	if (l_map->ino < r_map->ino) return 1;

	if (l_map->ino_generation > r_map->ino_generation) return -1;
	if (l_map->ino_generation < r_map->ino_generation) return 1;

	/*
	 * Addresses with no major/minor numbers are assumed to be
	 * anonymous in userspace.  Sort those on pid then address.
	 *
	 * The kernel and non-zero major/minor mapped areas are
	 * assumed to be unity mapped.  Sort those on address.
	 */

	if ((left->cpumode != PERF_RECORD_MISC_KERNEL) &&
	    (!(l_map->flags & MAP_SHARED)) &&
	    !l_map->maj && !l_map->min && !l_map->ino &&
	    !l_map->ino_generation) {
		/* userspace anonymous */

		if (left->thread->pid_ > right->thread->pid_) return -1;
		if (left->thread->pid_ < right->thread->pid_) return 1;
	}

addr:
	/* al_addr does all the right addr - start + offset calculations */
	l = cl_address(left->mem_info->daddr.al_addr);
	r = cl_address(right->mem_info->daddr.al_addr);

	if (l > r) return -1;
	if (l < r) return 1;

	return 0;
}

static int hist_entry__dcacheline_snprintf(struct hist_entry *he, char *bf,
					  size_t size, unsigned int width)
{

	uint64_t addr = 0;
	struct map *map = NULL;
	struct symbol *sym = NULL;
	char level = he->level;

	if (he->mem_info) {
		addr = cl_address(he->mem_info->daddr.al_addr);
		map = he->mem_info->daddr.map;
		sym = he->mem_info->daddr.sym;

		/* print [s] for shared data mmaps */
		if ((he->cpumode != PERF_RECORD_MISC_KERNEL) &&
1214
		     map && !(map->prot & PROT_EXEC) &&
D
Don Zickus 已提交
1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225
		    (map->flags & MAP_SHARED) &&
		    (map->maj || map->min || map->ino ||
		     map->ino_generation))
			level = 's';
		else if (!map)
			level = 'X';
	}
	return _hist_entry__sym_snprintf(map, sym, addr, level, bf, size,
					 width);
}

1226 1227 1228 1229 1230 1231 1232
struct sort_entry sort_mispredict = {
	.se_header	= "Branch Mispredicted",
	.se_cmp		= sort__mispredict_cmp,
	.se_snprintf	= hist_entry__mispredict_snprintf,
	.se_width_idx	= HISTC_MISPREDICT,
};

1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243
static u64 he_weight(struct hist_entry *he)
{
	return he->stat.nr_events ? he->stat.weight / he->stat.nr_events : 0;
}

static int64_t
sort__local_weight_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return he_weight(left) - he_weight(right);
}

1244
static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf,
1245 1246
				    size_t size, unsigned int width)
{
1247
	return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he));
1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262
}

struct sort_entry sort_local_weight = {
	.se_header	= "Local Weight",
	.se_cmp		= sort__local_weight_cmp,
	.se_snprintf	= hist_entry__local_weight_snprintf,
	.se_width_idx	= HISTC_LOCAL_WEIGHT,
};

static int64_t
sort__global_weight_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return left->stat.weight - right->stat.weight;
}

1263
static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf,
1264 1265
					      size_t size, unsigned int width)
{
1266
	return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight);
1267 1268 1269 1270 1271 1272 1273 1274 1275
}

struct sort_entry sort_global_weight = {
	.se_header	= "Weight",
	.se_cmp		= sort__global_weight_cmp,
	.se_snprintf	= hist_entry__global_weight_snprintf,
	.se_width_idx	= HISTC_GLOBAL_WEIGHT,
};

1276 1277 1278 1279 1280 1281 1282
struct sort_entry sort_mem_daddr_sym = {
	.se_header	= "Data Symbol",
	.se_cmp		= sort__daddr_cmp,
	.se_snprintf	= hist_entry__daddr_snprintf,
	.se_width_idx	= HISTC_MEM_DADDR_SYMBOL,
};

1283 1284 1285 1286 1287 1288 1289
struct sort_entry sort_mem_iaddr_sym = {
	.se_header	= "Code Symbol",
	.se_cmp		= sort__iaddr_cmp,
	.se_snprintf	= hist_entry__iaddr_snprintf,
	.se_width_idx	= HISTC_MEM_IADDR_SYMBOL,
};

1290 1291 1292 1293
struct sort_entry sort_mem_daddr_dso = {
	.se_header	= "Data Object",
	.se_cmp		= sort__dso_daddr_cmp,
	.se_snprintf	= hist_entry__dso_daddr_snprintf,
1294
	.se_width_idx	= HISTC_MEM_DADDR_DSO,
1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324
};

struct sort_entry sort_mem_locked = {
	.se_header	= "Locked",
	.se_cmp		= sort__locked_cmp,
	.se_snprintf	= hist_entry__locked_snprintf,
	.se_width_idx	= HISTC_MEM_LOCKED,
};

struct sort_entry sort_mem_tlb = {
	.se_header	= "TLB access",
	.se_cmp		= sort__tlb_cmp,
	.se_snprintf	= hist_entry__tlb_snprintf,
	.se_width_idx	= HISTC_MEM_TLB,
};

struct sort_entry sort_mem_lvl = {
	.se_header	= "Memory access",
	.se_cmp		= sort__lvl_cmp,
	.se_snprintf	= hist_entry__lvl_snprintf,
	.se_width_idx	= HISTC_MEM_LVL,
};

struct sort_entry sort_mem_snoop = {
	.se_header	= "Snoop",
	.se_cmp		= sort__snoop_cmp,
	.se_snprintf	= hist_entry__snoop_snprintf,
	.se_width_idx	= HISTC_MEM_SNOOP,
};

D
Don Zickus 已提交
1325 1326 1327 1328 1329 1330 1331
struct sort_entry sort_mem_dcacheline = {
	.se_header	= "Data Cacheline",
	.se_cmp		= sort__dcacheline_cmp,
	.se_snprintf	= hist_entry__dcacheline_snprintf,
	.se_width_idx	= HISTC_MEM_DCACHELINE,
};

1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372
static int64_t
sort__phys_daddr_cmp(struct hist_entry *left, struct hist_entry *right)
{
	uint64_t l = 0, r = 0;

	if (left->mem_info)
		l = left->mem_info->daddr.phys_addr;
	if (right->mem_info)
		r = right->mem_info->daddr.phys_addr;

	return (int64_t)(r - l);
}

static int hist_entry__phys_daddr_snprintf(struct hist_entry *he, char *bf,
					   size_t size, unsigned int width)
{
	uint64_t addr = 0;
	size_t ret = 0;
	size_t len = BITS_PER_LONG / 4;

	addr = he->mem_info->daddr.phys_addr;

	ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", he->level);

	ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx", len, addr);

	ret += repsep_snprintf(bf + ret, size - ret, "%-*s", width - ret, "");

	if (ret > width)
		bf[width] = '\0';

	return width;
}

struct sort_entry sort_mem_phys_daddr = {
	.se_header	= "Data Physical Address",
	.se_cmp		= sort__phys_daddr_cmp,
	.se_snprintf	= hist_entry__phys_daddr_snprintf,
	.se_width_idx	= HISTC_MEM_PHYS_DADDR,
};

1373 1374 1375
static int64_t
sort__abort_cmp(struct hist_entry *left, struct hist_entry *right)
{
1376 1377 1378
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1379 1380 1381 1382
	return left->branch_info->flags.abort !=
		right->branch_info->flags.abort;
}

1383
static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf,
1384 1385
				    size_t size, unsigned int width)
{
1386 1387 1388 1389 1390 1391 1392 1393
	static const char *out = "N/A";

	if (he->branch_info) {
		if (he->branch_info->flags.abort)
			out = "A";
		else
			out = ".";
	}
1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407

	return repsep_snprintf(bf, size, "%-*s", width, out);
}

struct sort_entry sort_abort = {
	.se_header	= "Transaction abort",
	.se_cmp		= sort__abort_cmp,
	.se_snprintf	= hist_entry__abort_snprintf,
	.se_width_idx	= HISTC_ABORT,
};

static int64_t
sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right)
{
1408 1409 1410
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1411 1412 1413 1414
	return left->branch_info->flags.in_tx !=
		right->branch_info->flags.in_tx;
}

1415
static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf,
1416 1417
				    size_t size, unsigned int width)
{
1418
	static const char *out = "N/A";
1419

1420 1421 1422 1423 1424 1425
	if (he->branch_info) {
		if (he->branch_info->flags.in_tx)
			out = "T";
		else
			out = ".";
	}
1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436

	return repsep_snprintf(bf, size, "%-*s", width, out);
}

struct sort_entry sort_in_tx = {
	.se_header	= "Branch in transaction",
	.se_cmp		= sort__in_tx_cmp,
	.se_snprintf	= hist_entry__in_tx_snprintf,
	.se_width_idx	= HISTC_IN_TX,
};

1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477
static int64_t
sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return left->transaction - right->transaction;
}

static inline char *add_str(char *p, const char *str)
{
	strcpy(p, str);
	return p + strlen(str);
}

static struct txbit {
	unsigned flag;
	const char *name;
	int skip_for_len;
} txbits[] = {
	{ PERF_TXN_ELISION,        "EL ",        0 },
	{ PERF_TXN_TRANSACTION,    "TX ",        1 },
	{ PERF_TXN_SYNC,           "SYNC ",      1 },
	{ PERF_TXN_ASYNC,          "ASYNC ",     0 },
	{ PERF_TXN_RETRY,          "RETRY ",     0 },
	{ PERF_TXN_CONFLICT,       "CON ",       0 },
	{ PERF_TXN_CAPACITY_WRITE, "CAP-WRITE ", 1 },
	{ PERF_TXN_CAPACITY_READ,  "CAP-READ ",  0 },
	{ 0, NULL, 0 }
};

int hist_entry__transaction_len(void)
{
	int i;
	int len = 0;

	for (i = 0; txbits[i].name; i++) {
		if (!txbits[i].skip_for_len)
			len += strlen(txbits[i].name);
	}
	len += 4; /* :XX<space> */
	return len;
}

1478
static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf,
1479 1480
					    size_t size, unsigned int width)
{
1481
	u64 t = he->transaction;
1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508
	char buf[128];
	char *p = buf;
	int i;

	buf[0] = 0;
	for (i = 0; txbits[i].name; i++)
		if (txbits[i].flag & t)
			p = add_str(p, txbits[i].name);
	if (t && !(t & (PERF_TXN_SYNC|PERF_TXN_ASYNC)))
		p = add_str(p, "NEITHER ");
	if (t & PERF_TXN_ABORT_MASK) {
		sprintf(p, ":%" PRIx64,
			(t & PERF_TXN_ABORT_MASK) >>
			PERF_TXN_ABORT_SHIFT);
		p += strlen(p);
	}

	return repsep_snprintf(bf, size, "%-*s", width, buf);
}

struct sort_entry sort_transaction = {
	.se_header	= "Transaction                ",
	.se_cmp		= sort__transaction_cmp,
	.se_snprintf	= hist_entry__transaction_snprintf,
	.se_width_idx	= HISTC_TRANSACTION,
};

1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547
/* --sort symbol_size */

static int64_t _sort__sym_size_cmp(struct symbol *sym_l, struct symbol *sym_r)
{
	int64_t size_l = sym_l != NULL ? symbol__size(sym_l) : 0;
	int64_t size_r = sym_r != NULL ? symbol__size(sym_r) : 0;

	return size_l < size_r ? -1 :
		size_l == size_r ? 0 : 1;
}

static int64_t
sort__sym_size_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return _sort__sym_size_cmp(right->ms.sym, left->ms.sym);
}

static int _hist_entry__sym_size_snprintf(struct symbol *sym, char *bf,
					  size_t bf_size, unsigned int width)
{
	if (sym)
		return repsep_snprintf(bf, bf_size, "%*d", width, symbol__size(sym));

	return repsep_snprintf(bf, bf_size, "%*s", width, "unknown");
}

static int hist_entry__sym_size_snprintf(struct hist_entry *he, char *bf,
					 size_t size, unsigned int width)
{
	return _hist_entry__sym_size_snprintf(he->ms.sym, bf, size, width);
}

struct sort_entry sort_sym_size = {
	.se_header	= "Symbol size",
	.se_cmp		= sort__sym_size_cmp,
	.se_snprintf	= hist_entry__sym_size_snprintf,
	.se_width_idx	= HISTC_SYM_SIZE,
};

1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587
/* --sort dso_size */

static int64_t _sort__dso_size_cmp(struct map *map_l, struct map *map_r)
{
	int64_t size_l = map_l != NULL ? map__size(map_l) : 0;
	int64_t size_r = map_r != NULL ? map__size(map_r) : 0;

	return size_l < size_r ? -1 :
		size_l == size_r ? 0 : 1;
}

static int64_t
sort__dso_size_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return _sort__dso_size_cmp(right->ms.map, left->ms.map);
}

static int _hist_entry__dso_size_snprintf(struct map *map, char *bf,
					  size_t bf_size, unsigned int width)
{
	if (map && map->dso)
		return repsep_snprintf(bf, bf_size, "%*d", width,
				       map__size(map));

	return repsep_snprintf(bf, bf_size, "%*s", width, "unknown");
}

static int hist_entry__dso_size_snprintf(struct hist_entry *he, char *bf,
					 size_t size, unsigned int width)
{
	return _hist_entry__dso_size_snprintf(he->ms.map, bf, size, width);
}

struct sort_entry sort_dso_size = {
	.se_header	= "DSO size",
	.se_cmp		= sort__dso_size_cmp,
	.se_snprintf	= hist_entry__dso_size_snprintf,
	.se_width_idx	= HISTC_DSO_SIZE,
};

1588

1589 1590 1591 1592 1593 1594
struct sort_dimension {
	const char		*name;
	struct sort_entry	*entry;
	int			taken;
};

1595 1596
#define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }

1597
static struct sort_dimension common_sort_dimensions[] = {
1598 1599 1600 1601 1602 1603
	DIM(SORT_PID, "pid", sort_thread),
	DIM(SORT_COMM, "comm", sort_comm),
	DIM(SORT_DSO, "dso", sort_dso),
	DIM(SORT_SYM, "symbol", sort_sym),
	DIM(SORT_PARENT, "parent", sort_parent),
	DIM(SORT_CPU, "cpu", sort_cpu),
1604
	DIM(SORT_SOCKET, "socket", sort_socket),
1605
	DIM(SORT_SRCLINE, "srcline", sort_srcline),
1606
	DIM(SORT_SRCFILE, "srcfile", sort_srcfile),
1607 1608
	DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight),
	DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight),
1609
	DIM(SORT_TRANSACTION, "transaction", sort_transaction),
N
Namhyung Kim 已提交
1610
	DIM(SORT_TRACE, "trace", sort_trace),
1611
	DIM(SORT_SYM_SIZE, "symbol_size", sort_sym_size),
1612
	DIM(SORT_DSO_SIZE, "dso_size", sort_dso_size),
1613
	DIM(SORT_CGROUP_ID, "cgroup_id", sort_cgroup_id),
1614 1615
};

1616 1617 1618 1619 1620 1621 1622 1623 1624 1625
#undef DIM

#define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) }

static struct sort_dimension bstack_sort_dimensions[] = {
	DIM(SORT_DSO_FROM, "dso_from", sort_dso_from),
	DIM(SORT_DSO_TO, "dso_to", sort_dso_to),
	DIM(SORT_SYM_FROM, "symbol_from", sort_sym_from),
	DIM(SORT_SYM_TO, "symbol_to", sort_sym_to),
	DIM(SORT_MISPREDICT, "mispredict", sort_mispredict),
1626 1627
	DIM(SORT_IN_TX, "in_tx", sort_in_tx),
	DIM(SORT_ABORT, "abort", sort_abort),
1628
	DIM(SORT_CYCLES, "cycles", sort_cycles),
1629 1630
	DIM(SORT_SRCLINE_FROM, "srcline_from", sort_srcline_from),
	DIM(SORT_SRCLINE_TO, "srcline_to", sort_srcline_to),
1631 1632 1633 1634
};

#undef DIM

1635 1636 1637 1638
#define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) }

static struct sort_dimension memory_sort_dimensions[] = {
	DIM(SORT_MEM_DADDR_SYMBOL, "symbol_daddr", sort_mem_daddr_sym),
1639
	DIM(SORT_MEM_IADDR_SYMBOL, "symbol_iaddr", sort_mem_iaddr_sym),
1640 1641 1642 1643 1644
	DIM(SORT_MEM_DADDR_DSO, "dso_daddr", sort_mem_daddr_dso),
	DIM(SORT_MEM_LOCKED, "locked", sort_mem_locked),
	DIM(SORT_MEM_TLB, "tlb", sort_mem_tlb),
	DIM(SORT_MEM_LVL, "mem", sort_mem_lvl),
	DIM(SORT_MEM_SNOOP, "snoop", sort_mem_snoop),
D
Don Zickus 已提交
1645
	DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline),
1646
	DIM(SORT_MEM_PHYS_DADDR, "phys_daddr", sort_mem_phys_daddr),
1647 1648 1649 1650
};

#undef DIM

1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664
struct hpp_dimension {
	const char		*name;
	struct perf_hpp_fmt	*fmt;
	int			taken;
};

#define DIM(d, n) { .name = n, .fmt = &perf_hpp__format[d], }

static struct hpp_dimension hpp_sort_dimensions[] = {
	DIM(PERF_HPP__OVERHEAD, "overhead"),
	DIM(PERF_HPP__OVERHEAD_SYS, "overhead_sys"),
	DIM(PERF_HPP__OVERHEAD_US, "overhead_us"),
	DIM(PERF_HPP__OVERHEAD_GUEST_SYS, "overhead_guest_sys"),
	DIM(PERF_HPP__OVERHEAD_GUEST_US, "overhead_guest_us"),
1665
	DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"),
1666 1667 1668 1669 1670 1671
	DIM(PERF_HPP__SAMPLES, "sample"),
	DIM(PERF_HPP__PERIOD, "period"),
};

#undef DIM

1672 1673 1674 1675 1676
struct hpp_sort_entry {
	struct perf_hpp_fmt hpp;
	struct sort_entry *se;
};

1677
void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists)
1678 1679 1680 1681 1682 1683 1684
{
	struct hpp_sort_entry *hse;

	if (!perf_hpp__is_sort_entry(fmt))
		return;

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1685
	hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name));
1686 1687
}

1688
static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
1689 1690
			      struct hists *hists, int line __maybe_unused,
			      int *span __maybe_unused)
1691 1692
{
	struct hpp_sort_entry *hse;
1693
	size_t len = fmt->user_len;
1694 1695 1696

	hse = container_of(fmt, struct hpp_sort_entry, hpp);

1697
	if (!len)
1698
		len = hists__col_len(hists, hse->se->se_width_idx);
1699

1700
	return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name);
1701 1702 1703 1704
}

static int __sort__hpp_width(struct perf_hpp_fmt *fmt,
			     struct perf_hpp *hpp __maybe_unused,
1705
			     struct hists *hists)
1706 1707
{
	struct hpp_sort_entry *hse;
1708
	size_t len = fmt->user_len;
1709 1710 1711

	hse = container_of(fmt, struct hpp_sort_entry, hpp);

1712
	if (!len)
1713
		len = hists__col_len(hists, hse->se->se_width_idx);
1714 1715

	return len;
1716 1717 1718 1719 1720 1721
}

static int __sort__hpp_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
			     struct hist_entry *he)
{
	struct hpp_sort_entry *hse;
1722
	size_t len = fmt->user_len;
1723 1724

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1725 1726 1727

	if (!len)
		len = hists__col_len(he->hists, hse->se->se_width_idx);
1728 1729 1730 1731

	return hse->se->se_snprintf(he, hpp->buf, hpp->size, len);
}

1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762
static int64_t __sort__hpp_cmp(struct perf_hpp_fmt *fmt,
			       struct hist_entry *a, struct hist_entry *b)
{
	struct hpp_sort_entry *hse;

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
	return hse->se->se_cmp(a, b);
}

static int64_t __sort__hpp_collapse(struct perf_hpp_fmt *fmt,
				    struct hist_entry *a, struct hist_entry *b)
{
	struct hpp_sort_entry *hse;
	int64_t (*collapse_fn)(struct hist_entry *, struct hist_entry *);

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
	collapse_fn = hse->se->se_collapse ?: hse->se->se_cmp;
	return collapse_fn(a, b);
}

static int64_t __sort__hpp_sort(struct perf_hpp_fmt *fmt,
				struct hist_entry *a, struct hist_entry *b)
{
	struct hpp_sort_entry *hse;
	int64_t (*sort_fn)(struct hist_entry *, struct hist_entry *);

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
	sort_fn = hse->se->se_sort ?: hse->se->se_cmp;
	return sort_fn(a, b);
}

1763 1764 1765 1766 1767
bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format)
{
	return format->header == __sort__hpp_header;
}

1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786
#define MK_SORT_ENTRY_CHK(key)					\
bool perf_hpp__is_ ## key ## _entry(struct perf_hpp_fmt *fmt)	\
{								\
	struct hpp_sort_entry *hse;				\
								\
	if (!perf_hpp__is_sort_entry(fmt))			\
		return false;					\
								\
	hse = container_of(fmt, struct hpp_sort_entry, hpp);	\
	return hse->se == &sort_ ## key ;			\
}

MK_SORT_ENTRY_CHK(trace)
MK_SORT_ENTRY_CHK(srcline)
MK_SORT_ENTRY_CHK(srcfile)
MK_SORT_ENTRY_CHK(thread)
MK_SORT_ENTRY_CHK(comm)
MK_SORT_ENTRY_CHK(dso)
MK_SORT_ENTRY_CHK(sym)
1787 1788


1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802
static bool __sort__hpp_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b)
{
	struct hpp_sort_entry *hse_a;
	struct hpp_sort_entry *hse_b;

	if (!perf_hpp__is_sort_entry(a) || !perf_hpp__is_sort_entry(b))
		return false;

	hse_a = container_of(a, struct hpp_sort_entry, hpp);
	hse_b = container_of(b, struct hpp_sort_entry, hpp);

	return hse_a->se == hse_b->se;
}

1803 1804 1805 1806 1807 1808 1809 1810
static void hse_free(struct perf_hpp_fmt *fmt)
{
	struct hpp_sort_entry *hse;

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
	free(hse);
}

1811
static struct hpp_sort_entry *
1812
__sort_dimension__alloc_hpp(struct sort_dimension *sd, int level)
1813 1814 1815 1816 1817 1818
{
	struct hpp_sort_entry *hse;

	hse = malloc(sizeof(*hse));
	if (hse == NULL) {
		pr_err("Memory allocation failed\n");
1819
		return NULL;
1820 1821 1822
	}

	hse->se = sd->entry;
1823
	hse->hpp.name = sd->entry->se_header;
1824 1825 1826 1827 1828
	hse->hpp.header = __sort__hpp_header;
	hse->hpp.width = __sort__hpp_width;
	hse->hpp.entry = __sort__hpp_entry;
	hse->hpp.color = NULL;

1829 1830 1831
	hse->hpp.cmp = __sort__hpp_cmp;
	hse->hpp.collapse = __sort__hpp_collapse;
	hse->hpp.sort = __sort__hpp_sort;
1832
	hse->hpp.equal = __sort__hpp_equal;
1833
	hse->hpp.free = hse_free;
1834 1835 1836

	INIT_LIST_HEAD(&hse->hpp.list);
	INIT_LIST_HEAD(&hse->hpp.sort_list);
1837
	hse->hpp.elide = false;
1838
	hse->hpp.len = 0;
1839
	hse->hpp.user_len = 0;
1840
	hse->hpp.level = level;
1841

1842 1843 1844
	return hse;
}

1845 1846 1847 1848 1849
static void hpp_free(struct perf_hpp_fmt *fmt)
{
	free(fmt);
}

1850 1851
static struct perf_hpp_fmt *__hpp_dimension__alloc_hpp(struct hpp_dimension *hd,
						       int level)
1852 1853 1854 1855 1856 1857 1858
{
	struct perf_hpp_fmt *fmt;

	fmt = memdup(hd->fmt, sizeof(*fmt));
	if (fmt) {
		INIT_LIST_HEAD(&fmt->list);
		INIT_LIST_HEAD(&fmt->sort_list);
1859
		fmt->free = hpp_free;
1860
		fmt->level = level;
1861 1862 1863 1864 1865
	}

	return fmt;
}

1866 1867 1868 1869
int hist_entry__filter(struct hist_entry *he, int type, const void *arg)
{
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891
	int ret = -1;
	int r;

	perf_hpp_list__for_each_format(he->hpp_list, fmt) {
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

		hse = container_of(fmt, struct hpp_sort_entry, hpp);
		if (hse->se->se_filter == NULL)
			continue;

		/*
		 * hist entry is filtered if any of sort key in the hpp list
		 * is applied.  But it should skip non-matched filter types.
		 */
		r = hse->se->se_filter(he, type, arg);
		if (r >= 0) {
			if (ret < 0)
				ret = 0;
			ret |= r;
		}
	}
1892

1893
	return ret;
1894 1895
}

1896 1897 1898
static int __sort_dimension__add_hpp_sort(struct sort_dimension *sd,
					  struct perf_hpp_list *list,
					  int level)
1899
{
1900
	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd, level);
1901 1902 1903 1904

	if (hse == NULL)
		return -1;

1905
	perf_hpp_list__register_sort_field(list, &hse->hpp);
1906 1907 1908
	return 0;
}

1909 1910
static int __sort_dimension__add_hpp_output(struct sort_dimension *sd,
					    struct perf_hpp_list *list)
1911
{
1912
	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd, 0);
1913 1914 1915 1916

	if (hse == NULL)
		return -1;

1917
	perf_hpp_list__column_register(list, &hse->hpp);
1918 1919 1920
	return 0;
}

1921 1922 1923 1924 1925
struct hpp_dynamic_entry {
	struct perf_hpp_fmt hpp;
	struct perf_evsel *evsel;
	struct format_field *field;
	unsigned dynamic_len;
1926
	bool raw_trace;
1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950
};

static int hde_width(struct hpp_dynamic_entry *hde)
{
	if (!hde->hpp.len) {
		int len = hde->dynamic_len;
		int namelen = strlen(hde->field->name);
		int fieldlen = hde->field->size;

		if (namelen > len)
			len = namelen;

		if (!(hde->field->flags & FIELD_IS_STRING)) {
			/* length for print hex numbers */
			fieldlen = hde->field->size * 2 + 2;
		}
		if (fieldlen > len)
			len = fieldlen;

		hde->hpp.len = len;
	}
	return hde->hpp.len;
}

1951 1952 1953 1954 1955 1956 1957 1958
static void update_dynamic_len(struct hpp_dynamic_entry *hde,
			       struct hist_entry *he)
{
	char *str, *pos;
	struct format_field *field = hde->field;
	size_t namelen;
	bool last = false;

1959 1960 1961
	if (hde->raw_trace)
		return;

1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993
	/* parse pretty print result and update max length */
	if (!he->trace_output)
		he->trace_output = get_trace_output(he);

	namelen = strlen(field->name);
	str = he->trace_output;

	while (str) {
		pos = strchr(str, ' ');
		if (pos == NULL) {
			last = true;
			pos = str + strlen(str);
		}

		if (!strncmp(str, field->name, namelen)) {
			size_t len;

			str += namelen + 1;
			len = pos - str;

			if (len > hde->dynamic_len)
				hde->dynamic_len = len;
			break;
		}

		if (last)
			str = NULL;
		else
			str = pos + 1;
	}
}

1994
static int __sort__hde_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
1995
			      struct hists *hists __maybe_unused,
1996 1997
			      int line __maybe_unused,
			      int *span __maybe_unused)
1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011
{
	struct hpp_dynamic_entry *hde;
	size_t len = fmt->user_len;

	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);

	if (!len)
		len = hde_width(hde);

	return scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, hde->field->name);
}

static int __sort__hde_width(struct perf_hpp_fmt *fmt,
			     struct perf_hpp *hpp __maybe_unused,
2012
			     struct hists *hists __maybe_unused)
2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024
{
	struct hpp_dynamic_entry *hde;
	size_t len = fmt->user_len;

	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);

	if (!len)
		len = hde_width(hde);

	return len;
}

2025 2026 2027 2028 2029 2030 2031 2032 2033
bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt *fmt, struct hists *hists)
{
	struct hpp_dynamic_entry *hde;

	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);

	return hists_to_evsel(hists) == hde->evsel;
}

2034 2035 2036 2037 2038
static int __sort__hde_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
			     struct hist_entry *he)
{
	struct hpp_dynamic_entry *hde;
	size_t len = fmt->user_len;
2039 2040 2041 2042
	char *str, *pos;
	struct format_field *field;
	size_t namelen;
	bool last = false;
2043 2044 2045 2046 2047 2048 2049
	int ret;

	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);

	if (!len)
		len = hde_width(hde);

2050 2051
	if (hde->raw_trace)
		goto raw_field;
2052

2053 2054 2055
	if (!he->trace_output)
		he->trace_output = get_trace_output(he);

2056
	field = hde->field;
2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084
	namelen = strlen(field->name);
	str = he->trace_output;

	while (str) {
		pos = strchr(str, ' ');
		if (pos == NULL) {
			last = true;
			pos = str + strlen(str);
		}

		if (!strncmp(str, field->name, namelen)) {
			str += namelen + 1;
			str = strndup(str, pos - str);

			if (str == NULL)
				return scnprintf(hpp->buf, hpp->size,
						 "%*.*s", len, len, "ERROR");
			break;
		}

		if (last)
			str = NULL;
		else
			str = pos + 1;
	}

	if (str == NULL) {
		struct trace_seq seq;
2085
raw_field:
2086 2087 2088 2089 2090 2091 2092
		trace_seq_init(&seq);
		pevent_print_field(&seq, he->raw_data, hde->field);
		str = seq.buffer;
	}

	ret = scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, str);
	free(str);
2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104
	return ret;
}

static int64_t __sort__hde_cmp(struct perf_hpp_fmt *fmt,
			       struct hist_entry *a, struct hist_entry *b)
{
	struct hpp_dynamic_entry *hde;
	struct format_field *field;
	unsigned offset, size;

	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);

2105 2106 2107 2108 2109
	if (b == NULL) {
		update_dynamic_len(hde, a);
		return 0;
	}

2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128
	field = hde->field;
	if (field->flags & FIELD_IS_DYNAMIC) {
		unsigned long long dyn;

		pevent_read_number_field(field, a->raw_data, &dyn);
		offset = dyn & 0xffff;
		size = (dyn >> 16) & 0xffff;

		/* record max width for output */
		if (size > hde->dynamic_len)
			hde->dynamic_len = size;
	} else {
		offset = field->offset;
		size = field->size;
	}

	return memcmp(a->raw_data + offset, b->raw_data + offset, size);
}

2129 2130 2131 2132 2133
bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *fmt)
{
	return fmt->cmp == __sort__hde_cmp;
}

2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147
static bool __sort__hde_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b)
{
	struct hpp_dynamic_entry *hde_a;
	struct hpp_dynamic_entry *hde_b;

	if (!perf_hpp__is_dynamic_entry(a) || !perf_hpp__is_dynamic_entry(b))
		return false;

	hde_a = container_of(a, struct hpp_dynamic_entry, hpp);
	hde_b = container_of(b, struct hpp_dynamic_entry, hpp);

	return hde_a->field == hde_b->field;
}

2148 2149 2150 2151 2152 2153 2154 2155
static void hde_free(struct perf_hpp_fmt *fmt)
{
	struct hpp_dynamic_entry *hde;

	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
	free(hde);
}

2156
static struct hpp_dynamic_entry *
2157 2158
__alloc_dynamic_entry(struct perf_evsel *evsel, struct format_field *field,
		      int level)
2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180
{
	struct hpp_dynamic_entry *hde;

	hde = malloc(sizeof(*hde));
	if (hde == NULL) {
		pr_debug("Memory allocation failed\n");
		return NULL;
	}

	hde->evsel = evsel;
	hde->field = field;
	hde->dynamic_len = 0;

	hde->hpp.name = field->name;
	hde->hpp.header = __sort__hde_header;
	hde->hpp.width  = __sort__hde_width;
	hde->hpp.entry  = __sort__hde_entry;
	hde->hpp.color  = NULL;

	hde->hpp.cmp = __sort__hde_cmp;
	hde->hpp.collapse = __sort__hde_cmp;
	hde->hpp.sort = __sort__hde_cmp;
2181
	hde->hpp.equal = __sort__hde_equal;
2182
	hde->hpp.free = hde_free;
2183 2184 2185 2186 2187 2188

	INIT_LIST_HEAD(&hde->hpp.list);
	INIT_LIST_HEAD(&hde->hpp.sort_list);
	hde->hpp.elide = false;
	hde->hpp.len = 0;
	hde->hpp.user_len = 0;
2189
	hde->hpp.level = level;
2190 2191 2192 2193

	return hde;
}

2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221
struct perf_hpp_fmt *perf_hpp_fmt__dup(struct perf_hpp_fmt *fmt)
{
	struct perf_hpp_fmt *new_fmt = NULL;

	if (perf_hpp__is_sort_entry(fmt)) {
		struct hpp_sort_entry *hse, *new_hse;

		hse = container_of(fmt, struct hpp_sort_entry, hpp);
		new_hse = memdup(hse, sizeof(*hse));
		if (new_hse)
			new_fmt = &new_hse->hpp;
	} else if (perf_hpp__is_dynamic_entry(fmt)) {
		struct hpp_dynamic_entry *hde, *new_hde;

		hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
		new_hde = memdup(hde, sizeof(*hde));
		if (new_hde)
			new_fmt = &new_hde->hpp;
	} else {
		new_fmt = memdup(fmt, sizeof(*fmt));
	}

	INIT_LIST_HEAD(&new_fmt->list);
	INIT_LIST_HEAD(&new_fmt->sort_list);

	return new_fmt;
}

2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247
static int parse_field_name(char *str, char **event, char **field, char **opt)
{
	char *event_name, *field_name, *opt_name;

	event_name = str;
	field_name = strchr(str, '.');

	if (field_name) {
		*field_name++ = '\0';
	} else {
		event_name = NULL;
		field_name = str;
	}

	opt_name = strchr(field_name, '/');
	if (opt_name)
		*opt_name++ = '\0';

	*event = event_name;
	*field = field_name;
	*opt   = opt_name;

	return 0;
}

/* find match evsel using a given event name.  The event name can be:
2248 2249 2250
 *   1. '%' + event index (e.g. '%1' for first event)
 *   2. full event name (e.g. sched:sched_switch)
 *   3. partial event name (should not contain ':')
2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272
 */
static struct perf_evsel *find_evsel(struct perf_evlist *evlist, char *event_name)
{
	struct perf_evsel *evsel = NULL;
	struct perf_evsel *pos;
	bool full_name;

	/* case 1 */
	if (event_name[0] == '%') {
		int nr = strtol(event_name+1, NULL, 0);

		if (nr > evlist->nr_entries)
			return NULL;

		evsel = perf_evlist__first(evlist);
		while (--nr > 0)
			evsel = perf_evsel__next(evsel);

		return evsel;
	}

	full_name = !!strchr(event_name, ':');
2273
	evlist__for_each_entry(evlist, pos) {
2274
		/* case 2 */
2275 2276
		if (full_name && !strcmp(pos->name, event_name))
			return pos;
2277
		/* case 3 */
2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290
		if (!full_name && strstr(pos->name, event_name)) {
			if (evsel) {
				pr_debug("'%s' event is ambiguous: it can be %s or %s\n",
					 event_name, evsel->name, pos->name);
				return NULL;
			}
			evsel = pos;
		}
	}

	return evsel;
}

2291 2292
static int __dynamic_dimension__add(struct perf_evsel *evsel,
				    struct format_field *field,
2293
				    bool raw_trace, int level)
2294 2295 2296
{
	struct hpp_dynamic_entry *hde;

2297
	hde = __alloc_dynamic_entry(evsel, field, level);
2298 2299 2300 2301 2302 2303 2304 2305 2306
	if (hde == NULL)
		return -ENOMEM;

	hde->raw_trace = raw_trace;

	perf_hpp__register_sort_field(&hde->hpp);
	return 0;
}

2307
static int add_evsel_fields(struct perf_evsel *evsel, bool raw_trace, int level)
2308 2309 2310 2311 2312 2313
{
	int ret;
	struct format_field *field;

	field = evsel->tp_format->format.fields;
	while (field) {
2314
		ret = __dynamic_dimension__add(evsel, field, raw_trace, level);
2315 2316 2317 2318 2319 2320 2321 2322
		if (ret < 0)
			return ret;

		field = field->next;
	}
	return 0;
}

2323 2324
static int add_all_dynamic_fields(struct perf_evlist *evlist, bool raw_trace,
				  int level)
2325 2326 2327 2328
{
	int ret;
	struct perf_evsel *evsel;

2329
	evlist__for_each_entry(evlist, evsel) {
2330 2331 2332
		if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
			continue;

2333
		ret = add_evsel_fields(evsel, raw_trace, level);
2334 2335 2336 2337 2338 2339
		if (ret < 0)
			return ret;
	}
	return 0;
}

2340
static int add_all_matching_fields(struct perf_evlist *evlist,
2341
				   char *field_name, bool raw_trace, int level)
2342 2343 2344 2345 2346
{
	int ret = -ESRCH;
	struct perf_evsel *evsel;
	struct format_field *field;

2347
	evlist__for_each_entry(evlist, evsel) {
2348 2349 2350 2351 2352 2353 2354
		if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
			continue;

		field = pevent_find_any_field(evsel->tp_format, field_name);
		if (field == NULL)
			continue;

2355
		ret = __dynamic_dimension__add(evsel, field, raw_trace, level);
2356 2357 2358 2359 2360 2361
		if (ret < 0)
			break;
	}
	return ret;
}

2362 2363
static int add_dynamic_entry(struct perf_evlist *evlist, const char *tok,
			     int level)
2364
{
2365 2366
	char *str, *event_name, *field_name, *opt_name;
	struct perf_evsel *evsel;
2367
	struct format_field *field;
2368
	bool raw_trace = symbol_conf.raw_trace;
2369 2370 2371 2372 2373 2374 2375 2376 2377
	int ret = 0;

	if (evlist == NULL)
		return -ENOENT;

	str = strdup(tok);
	if (str == NULL)
		return -ENOMEM;

2378
	if (parse_field_name(str, &event_name, &field_name, &opt_name) < 0) {
2379 2380 2381 2382
		ret = -EINVAL;
		goto out;
	}

2383 2384 2385
	if (opt_name) {
		if (strcmp(opt_name, "raw")) {
			pr_debug("unsupported field option %s\n", opt_name);
2386 2387 2388 2389 2390 2391
			ret = -EINVAL;
			goto out;
		}
		raw_trace = true;
	}

2392
	if (!strcmp(field_name, "trace_fields")) {
2393
		ret = add_all_dynamic_fields(evlist, raw_trace, level);
2394 2395 2396
		goto out;
	}

2397
	if (event_name == NULL) {
2398
		ret = add_all_matching_fields(evlist, field_name, raw_trace, level);
2399 2400 2401
		goto out;
	}

2402
	evsel = find_evsel(evlist, event_name);
2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414
	if (evsel == NULL) {
		pr_debug("Cannot find event: %s\n", event_name);
		ret = -ENOENT;
		goto out;
	}

	if (evsel->attr.type != PERF_TYPE_TRACEPOINT) {
		pr_debug("%s is not a tracepoint event\n", event_name);
		ret = -EINVAL;
		goto out;
	}

2415
	if (!strcmp(field_name, "*")) {
2416
		ret = add_evsel_fields(evsel, raw_trace, level);
2417 2418 2419 2420 2421 2422 2423 2424
	} else {
		field = pevent_find_any_field(evsel->tp_format, field_name);
		if (field == NULL) {
			pr_debug("Cannot find event field for %s.%s\n",
				 event_name, field_name);
			return -ENOENT;
		}

2425
		ret = __dynamic_dimension__add(evsel, field, raw_trace, level);
2426
	}
2427 2428 2429 2430 2431 2432

out:
	free(str);
	return ret;
}

2433 2434 2435
static int __sort_dimension__add(struct sort_dimension *sd,
				 struct perf_hpp_list *list,
				 int level)
2436 2437
{
	if (sd->taken)
2438 2439
		return 0;

2440
	if (__sort_dimension__add_hpp_sort(sd, list, level) < 0)
2441
		return -1;
2442 2443

	if (sd->entry->se_collapse)
2444
		list->need_collapse = 1;
2445 2446

	sd->taken = 1;
2447 2448

	return 0;
2449 2450
}

2451 2452 2453
static int __hpp_dimension__add(struct hpp_dimension *hd,
				struct perf_hpp_list *list,
				int level)
2454
{
2455
	struct perf_hpp_fmt *fmt;
2456

2457 2458 2459
	if (hd->taken)
		return 0;

2460
	fmt = __hpp_dimension__alloc_hpp(hd, level);
2461 2462 2463 2464
	if (!fmt)
		return -1;

	hd->taken = 1;
2465
	perf_hpp_list__register_sort_field(list, fmt);
2466 2467 2468
	return 0;
}

2469 2470
static int __sort_dimension__add_output(struct perf_hpp_list *list,
					struct sort_dimension *sd)
2471 2472 2473 2474
{
	if (sd->taken)
		return 0;

2475
	if (__sort_dimension__add_hpp_output(sd, list) < 0)
2476 2477 2478 2479 2480 2481
		return -1;

	sd->taken = 1;
	return 0;
}

2482 2483
static int __hpp_dimension__add_output(struct perf_hpp_list *list,
				       struct hpp_dimension *hd)
2484
{
2485
	struct perf_hpp_fmt *fmt;
2486

2487 2488 2489
	if (hd->taken)
		return 0;

2490
	fmt = __hpp_dimension__alloc_hpp(hd, 0);
2491 2492 2493 2494
	if (!fmt)
		return -1;

	hd->taken = 1;
2495
	perf_hpp_list__column_register(list, fmt);
2496 2497 2498
	return 0;
}

2499 2500 2501
int hpp_dimension__add_output(unsigned col)
{
	BUG_ON(col >= PERF_HPP__MAX_INDEX);
2502
	return __hpp_dimension__add_output(&perf_hpp_list, &hpp_sort_dimensions[col]);
2503 2504
}

2505 2506 2507
int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
			struct perf_evlist *evlist,
			int level)
2508 2509 2510
{
	unsigned int i;

2511 2512
	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
		struct sort_dimension *sd = &common_sort_dimensions[i];
2513 2514 2515

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

2517 2518 2519 2520 2521 2522
		if (sd->entry == &sort_parent) {
			int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
			if (ret) {
				char err[BUFSIZ];

				regerror(ret, &parent_regex, err, sizeof(err));
2523 2524
				pr_err("Invalid regex: %s\n%s", parent_pattern, err);
				return -EINVAL;
2525
			}
2526
			list->parent = 1;
2527
		} else if (sd->entry == &sort_sym) {
2528
			list->sym = 1;
2529 2530 2531 2532 2533 2534 2535 2536 2537
			/*
			 * perf diff displays the performance difference amongst
			 * two or more perf.data files. Those files could come
			 * from different binaries. So we should not compare
			 * their ips, but the name of symbol.
			 */
			if (sort__mode == SORT_MODE__DIFF)
				sd->entry->se_collapse = sort__sym_sort;

N
Namhyung Kim 已提交
2538
		} else if (sd->entry == &sort_dso) {
2539
			list->dso = 1;
2540
		} else if (sd->entry == &sort_socket) {
2541
			list->socket = 1;
2542
		} else if (sd->entry == &sort_thread) {
2543
			list->thread = 1;
2544
		} else if (sd->entry == &sort_comm) {
2545
			list->comm = 1;
2546 2547
		}

2548
		return __sort_dimension__add(sd, list, level);
2549
	}
2550

2551 2552 2553 2554 2555 2556
	for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) {
		struct hpp_dimension *hd = &hpp_sort_dimensions[i];

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

2557
		return __hpp_dimension__add(hd, list, level);
2558 2559
	}

2560 2561 2562 2563 2564 2565
	for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) {
		struct sort_dimension *sd = &bstack_sort_dimensions[i];

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

2566
		if (sort__mode != SORT_MODE__BRANCH)
2567 2568 2569
			return -EINVAL;

		if (sd->entry == &sort_sym_from || sd->entry == &sort_sym_to)
2570
			list->sym = 1;
2571

2572
		__sort_dimension__add(sd, list, level);
2573 2574 2575
		return 0;
	}

2576 2577 2578 2579 2580 2581 2582 2583 2584
	for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) {
		struct sort_dimension *sd = &memory_sort_dimensions[i];

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

		if (sort__mode != SORT_MODE__MEMORY)
			return -EINVAL;

2585 2586 2587
		if (sd->entry == &sort_mem_dcacheline && cacheline_size == 0)
			return -EINVAL;

2588
		if (sd->entry == &sort_mem_daddr_sym)
2589
			list->sym = 1;
2590

2591
		__sort_dimension__add(sd, list, level);
2592 2593 2594
		return 0;
	}

2595
	if (!add_dynamic_entry(evlist, tok, level))
2596 2597
		return 0;

2598 2599
	return -ESRCH;
}
2600

2601 2602
static int setup_sort_list(struct perf_hpp_list *list, char *str,
			   struct perf_evlist *evlist)
2603 2604 2605
{
	char *tmp, *tok;
	int ret = 0;
2606
	int level = 0;
2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626
	int next_level = 1;
	bool in_group = false;

	do {
		tok = str;
		tmp = strpbrk(str, "{}, ");
		if (tmp) {
			if (in_group)
				next_level = level;
			else
				next_level = level + 1;

			if (*tmp == '{')
				in_group = true;
			else if (*tmp == '}')
				in_group = false;

			*tmp = '\0';
			str = tmp + 1;
		}
2627

2628
		if (*tok) {
2629
			ret = sort_dimension__add(list, tok, evlist, level);
2630
			if (ret == -EINVAL) {
2631
				if (!cacheline_size && !strncasecmp(tok, "dcacheline", strlen(tok)))
2632
					pr_err("The \"dcacheline\" --sort key needs to know the cacheline size and it couldn't be determined on this system");
2633
				else
2634
					pr_err("Invalid --sort key: `%s'", tok);
2635 2636
				break;
			} else if (ret == -ESRCH) {
2637
				pr_err("Unknown --sort key: `%s'", tok);
2638 2639
				break;
			}
2640
		}
2641 2642 2643

		level = next_level;
	} while (tmp);
2644 2645 2646 2647

	return ret;
}

2648
static const char *get_default_sort_order(struct perf_evlist *evlist)
2649 2650 2651 2652 2653 2654 2655
{
	const char *default_sort_orders[] = {
		default_sort_order,
		default_branch_sort_order,
		default_mem_sort_order,
		default_top_sort_order,
		default_diff_sort_order,
2656
		default_tracepoint_sort_order,
2657
	};
2658 2659
	bool use_trace = true;
	struct perf_evsel *evsel;
2660 2661 2662

	BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders));

2663
	if (evlist == NULL || perf_evlist__empty(evlist))
2664 2665
		goto out_no_evlist;

2666
	evlist__for_each_entry(evlist, evsel) {
2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678
		if (evsel->attr.type != PERF_TYPE_TRACEPOINT) {
			use_trace = false;
			break;
		}
	}

	if (use_trace) {
		sort__mode = SORT_MODE__TRACEPOINT;
		if (symbol_conf.raw_trace)
			return "trace_fields";
	}
out_no_evlist:
2679 2680 2681
	return default_sort_orders[sort__mode];
}

2682
static int setup_sort_order(struct perf_evlist *evlist)
2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693
{
	char *new_sort_order;

	/*
	 * Append '+'-prefixed sort order to the default sort
	 * order string.
	 */
	if (!sort_order || is_strict_order(sort_order))
		return 0;

	if (sort_order[1] == '\0') {
2694
		pr_err("Invalid --sort key: `+'");
2695 2696 2697 2698 2699 2700 2701 2702
		return -EINVAL;
	}

	/*
	 * We allocate new sort_order string, but we never free it,
	 * because it's checked over the rest of the code.
	 */
	if (asprintf(&new_sort_order, "%s,%s",
2703
		     get_default_sort_order(evlist), sort_order + 1) < 0) {
2704
		pr_err("Not enough memory to set up --sort");
2705 2706 2707 2708 2709 2710 2711
		return -ENOMEM;
	}

	sort_order = new_sort_order;
	return 0;
}

2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731
/*
 * Adds 'pre,' prefix into 'str' is 'pre' is
 * not already part of 'str'.
 */
static char *prefix_if_not_in(const char *pre, char *str)
{
	char *n;

	if (!str || strstr(str, pre))
		return str;

	if (asprintf(&n, "%s,%s", pre, str) < 0)
		return NULL;

	free(str);
	return n;
}

static char *setup_overhead(char *keys)
{
2732 2733 2734
	if (sort__mode == SORT_MODE__DIFF)
		return keys;

2735 2736 2737 2738 2739 2740 2741 2742
	keys = prefix_if_not_in("overhead", keys);

	if (symbol_conf.cumulate_callchain)
		keys = prefix_if_not_in("overhead_children", keys);

	return keys;
}

2743
static int __setup_sorting(struct perf_evlist *evlist)
2744
{
2745
	char *str;
2746
	const char *sort_keys;
2747
	int ret = 0;
2748

2749
	ret = setup_sort_order(evlist);
2750 2751 2752 2753
	if (ret)
		return ret;

	sort_keys = sort_order;
2754
	if (sort_keys == NULL) {
2755
		if (is_strict_order(field_order)) {
2756 2757 2758 2759 2760 2761 2762
			/*
			 * If user specified field order but no sort order,
			 * we'll honor it and not add default sort orders.
			 */
			return 0;
		}

2763
		sort_keys = get_default_sort_order(evlist);
2764
	}
2765 2766

	str = strdup(sort_keys);
2767
	if (str == NULL) {
2768
		pr_err("Not enough memory to setup sort keys");
2769 2770 2771
		return -ENOMEM;
	}

2772 2773 2774 2775 2776 2777
	/*
	 * Prepend overhead fields for backward compatibility.
	 */
	if (!is_strict_order(field_order)) {
		str = setup_overhead(str);
		if (str == NULL) {
2778
			pr_err("Not enough memory to setup overhead keys");
2779 2780 2781 2782
			return -ENOMEM;
		}
	}

2783
	ret = setup_sort_list(&perf_hpp_list, str, evlist);
2784 2785

	free(str);
2786
	return ret;
2787
}
2788

2789
void perf_hpp__set_elide(int idx, bool elide)
2790
{
2791 2792
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
2793

2794
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2795 2796 2797 2798 2799 2800 2801 2802
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

		hse = container_of(fmt, struct hpp_sort_entry, hpp);
		if (hse->se->se_width_idx == idx) {
			fmt->elide = elide;
			break;
		}
2803 2804 2805
	}
}

2806
static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp)
2807 2808 2809 2810 2811
{
	if (list && strlist__nr_entries(list) == 1) {
		if (fp != NULL)
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(list, 0)->s);
2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827
		return true;
	}
	return false;
}

static bool get_elide(int idx, FILE *output)
{
	switch (idx) {
	case HISTC_SYMBOL:
		return __get_elide(symbol_conf.sym_list, "symbol", output);
	case HISTC_DSO:
		return __get_elide(symbol_conf.dso_list, "dso", output);
	case HISTC_COMM:
		return __get_elide(symbol_conf.comm_list, "comm", output);
	default:
		break;
2828
	}
2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846

	if (sort__mode != SORT_MODE__BRANCH)
		return false;

	switch (idx) {
	case HISTC_SYMBOL_FROM:
		return __get_elide(symbol_conf.sym_from_list, "sym_from", output);
	case HISTC_SYMBOL_TO:
		return __get_elide(symbol_conf.sym_to_list, "sym_to", output);
	case HISTC_DSO_FROM:
		return __get_elide(symbol_conf.dso_from_list, "dso_from", output);
	case HISTC_DSO_TO:
		return __get_elide(symbol_conf.dso_to_list, "dso_to", output);
	default:
		break;
	}

	return false;
2847
}
2848 2849 2850

void sort__setup_elide(FILE *output)
{
2851 2852
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
2853

2854
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2855 2856 2857 2858 2859
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

		hse = container_of(fmt, struct hpp_sort_entry, hpp);
		fmt->elide = get_elide(hse->se->se_width_idx, output);
2860 2861
	}

2862 2863 2864 2865
	/*
	 * It makes no sense to elide all of sort entries.
	 * Just revert them to show up again.
	 */
2866
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2867 2868 2869
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

2870
		if (!fmt->elide)
2871 2872 2873
			return;
	}

2874
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2875 2876 2877
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

2878
		fmt->elide = false;
2879
	}
2880
}
2881

2882
int output_field_add(struct perf_hpp_list *list, char *tok)
2883 2884 2885 2886 2887 2888 2889 2890 2891
{
	unsigned int i;

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

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

2892
		return __sort_dimension__add_output(list, sd);
2893 2894 2895 2896 2897 2898 2899 2900
	}

	for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) {
		struct hpp_dimension *hd = &hpp_sort_dimensions[i];

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

2901
		return __hpp_dimension__add_output(list, hd);
2902 2903 2904 2905 2906 2907 2908 2909
	}

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

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

2910
		return __sort_dimension__add_output(list, sd);
2911 2912 2913 2914 2915 2916 2917 2918
	}

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

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

2919
		return __sort_dimension__add_output(list, sd);
2920 2921 2922 2923 2924
	}

	return -ESRCH;
}

2925
static int setup_output_list(struct perf_hpp_list *list, char *str)
2926 2927 2928 2929 2930 2931
{
	char *tmp, *tok;
	int ret = 0;

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
2932
		ret = output_field_add(list, tok);
2933
		if (ret == -EINVAL) {
2934
			ui__error("Invalid --fields key: `%s'", tok);
2935 2936
			break;
		} else if (ret == -ESRCH) {
2937
			ui__error("Unknown --fields key: `%s'", tok);
2938 2939 2940 2941 2942 2943 2944
			break;
		}
	}

	return ret;
}

2945
void reset_dimensions(void)
2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961
{
	unsigned int i;

	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++)
		common_sort_dimensions[i].taken = 0;

	for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++)
		hpp_sort_dimensions[i].taken = 0;

	for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++)
		bstack_sort_dimensions[i].taken = 0;

	for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++)
		memory_sort_dimensions[i].taken = 0;
}

2962 2963 2964 2965 2966
bool is_strict_order(const char *order)
{
	return order && (*order != '+');
}

2967 2968
static int __setup_output_field(void)
{
2969
	char *str, *strp;
2970
	int ret = -EINVAL;
2971 2972 2973 2974

	if (field_order == NULL)
		return 0;

2975
	strp = str = strdup(field_order);
2976
	if (str == NULL) {
2977
		pr_err("Not enough memory to setup output fields");
2978 2979 2980
		return -ENOMEM;
	}

2981 2982 2983 2984
	if (!is_strict_order(field_order))
		strp++;

	if (!strlen(strp)) {
2985
		pr_err("Invalid --fields key: `+'");
2986 2987 2988
		goto out;
	}

2989
	ret = setup_output_list(&perf_hpp_list, strp);
2990

2991
out:
2992 2993 2994 2995
	free(str);
	return ret;
}

2996 2997 2998 2999 3000 3001 3002 3003 3004
int setup_sorting(struct perf_evlist *evlist)
{
	int err;

	err = __setup_sorting(evlist);
	if (err < 0)
		return err;

	if (parent_pattern != default_parent_pattern) {
3005
		err = sort_dimension__add(&perf_hpp_list, "parent", evlist, -1);
3006 3007 3008 3009
		if (err < 0)
			return err;
	}

3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022
	reset_dimensions();

	/*
	 * perf diff doesn't use default hpp output fields.
	 */
	if (sort__mode != SORT_MODE__DIFF)
		perf_hpp__init();

	err = __setup_output_field();
	if (err < 0)
		return err;

	/* copy sort keys to output fields */
3023
	perf_hpp__setup_output_field(&perf_hpp_list);
3024
	/* and then copy output fields to sort keys */
3025
	perf_hpp__append_sort_keys(&perf_hpp_list);
3026

3027 3028 3029 3030
	/* setup hists-specific output fields */
	if (perf_hpp__setup_hists_formats(&perf_hpp_list, evlist) < 0)
		return -1;

3031 3032
	return 0;
}
3033 3034 3035

void reset_output_field(void)
{
3036
	perf_hpp_list.need_collapse = 0;
3037
	perf_hpp_list.parent = 0;
3038
	perf_hpp_list.sym = 0;
3039
	perf_hpp_list.dso = 0;
3040

3041 3042 3043
	field_order = NULL;
	sort_order = NULL;

3044
	reset_dimensions();
3045
	perf_hpp__reset_output_field(&perf_hpp_list);
3046
}