sort.c 43.1 KB
Newer Older
D
Don Zickus 已提交
1
#include <sys/mman.h>
2
#include "sort.h"
3
#include "hist.h"
4
#include "comm.h"
5
#include "symbol.h"
6
#include "evsel.h"
7 8

regex_t		parent_regex;
9 10 11
const char	default_parent_pattern[] = "^sys_|^do_page_fault";
const char	*parent_pattern = default_parent_pattern;
const char	default_sort_order[] = "comm,dso,symbol";
12 13 14 15 16
const char	default_branch_sort_order[] = "comm,dso_from,symbol_from,dso_to,symbol_to";
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";
const char	*sort_order;
17
const char	*field_order;
18 19
regex_t		ignore_callees_regex;
int		have_ignore_callees = 0;
20 21
int		sort__need_collapse = 0;
int		sort__has_parent = 0;
N
Namhyung Kim 已提交
22
int		sort__has_sym = 0;
N
Namhyung Kim 已提交
23
int		sort__has_dso = 0;
24
enum sort_mode	sort__mode = SORT_MODE__NORMAL;
25

26

27
static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
28 29 30 31 32
{
	int n;
	va_list ap;

	va_start(ap, fmt);
33
	n = vsnprintf(bf, size, fmt, ap);
34
	if (symbol_conf.field_sep && n > 0) {
35 36 37
		char *sep = bf;

		while (1) {
38
			sep = strchr(sep, *symbol_conf.field_sep);
39 40 41
			if (sep == NULL)
				break;
			*sep = '.';
42 43 44
		}
	}
	va_end(ap);
45 46 47

	if (n >= (int)size)
		return size - 1;
48 49 50
	return n;
}

51
static int64_t cmp_null(const void *l, const void *r)
52 53 54 55 56 57 58 59 60 61 62 63 64 65
{
	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)
{
66
	return right->thread->tid - left->thread->tid;
67 68
}

69
static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf,
70
				       size_t size, unsigned int width)
71
{
72
	const char *comm = thread__comm_str(he->thread);
73 74 75 76

	width = max(7U, width) - 6;
	return repsep_snprintf(bf, size, "%5d:%-*.*s", he->thread->tid,
			       width, width, comm ?: "");
77 78
}

79
struct sort_entry sort_thread = {
80
	.se_header	= "  Pid:Command",
81 82 83 84 85 86 87 88 89 90
	.se_cmp		= sort__thread_cmp,
	.se_snprintf	= hist_entry__thread_snprintf,
	.se_width_idx	= HISTC_THREAD,
};

/* --sort comm */

static int64_t
sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
{
91
	/* Compare the addr that should be unique among comm */
92
	return comm__str(right->comm) - comm__str(left->comm);
93 94 95 96 97
}

static int64_t
sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
{
98 99
	/* Compare the addr that should be unique among comm */
	return comm__str(right->comm) - comm__str(left->comm);
100 101
}

102 103 104 105 106 107
static int64_t
sort__comm_sort(struct hist_entry *left, struct hist_entry *right)
{
	return strcmp(comm__str(right->comm), comm__str(left->comm));
}

108
static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf,
109
				     size_t size, unsigned int width)
110
{
111
	return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm));
112 113
}

114 115 116 117
struct sort_entry sort_comm = {
	.se_header	= "Command",
	.se_cmp		= sort__comm_cmp,
	.se_collapse	= sort__comm_collapse,
118
	.se_sort	= sort__comm_sort,
119 120 121 122 123 124
	.se_snprintf	= hist_entry__comm_snprintf,
	.se_width_idx	= HISTC_COMM,
};

/* --sort dso */

125 126 127 128 129 130 131
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)
132
		return cmp_null(dso_r, dso_l);
133 134 135 136 137 138 139 140 141 142 143 144

	if (verbose) {
		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);
}

145
static int64_t
146 147
sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
{
148
	return _sort__dso_cmp(right->ms.map, left->ms.map);
149
}
150

151 152 153 154 155 156
static int _hist_entry__dso_snprintf(struct map *map, char *bf,
				     size_t size, unsigned int width)
{
	if (map && map->dso) {
		const char *dso_name = !verbose ? map->dso->short_name :
			map->dso->long_name;
157
		return repsep_snprintf(bf, size, "%-*.*s", width, width, dso_name);
158 159
	}

160
	return repsep_snprintf(bf, size, "%-*.*s", width, width, "[unknown]");
161 162
}

163
static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf,
164 165
				    size_t size, unsigned int width)
{
166
	return _hist_entry__dso_snprintf(he->ms.map, bf, size, width);
167 168 169 170 171 172 173 174 175 176
}

struct sort_entry sort_dso = {
	.se_header	= "Shared Object",
	.se_cmp		= sort__dso_cmp,
	.se_snprintf	= hist_entry__dso_snprintf,
	.se_width_idx	= HISTC_DSO,
};

/* --sort symbol */
177

178 179 180 181 182
static int64_t _sort__addr_cmp(u64 left_ip, u64 right_ip)
{
	return (int64_t)(right_ip - left_ip);
}

183
static int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r)
184
{
185 186
	u64 ip_l, ip_r;

187 188 189 190 191 192
	if (!sym_l || !sym_r)
		return cmp_null(sym_l, sym_r);

	if (sym_l == sym_r)
		return 0;

193 194
	ip_l = sym_l->start;
	ip_r = sym_r->start;
195 196 197 198

	return (int64_t)(ip_r - ip_l);
}

199 200
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
201
{
202 203
	int64_t ret;

204
	if (!left->ms.sym && !right->ms.sym)
205
		return _sort__addr_cmp(left->ip, right->ip);
206

207 208 209 210
	/*
	 * comparing symbol address alone is not enough since it's a
	 * relative address within a dso.
	 */
N
Namhyung Kim 已提交
211 212 213 214 215
	if (!sort__has_dso) {
		ret = sort__dso_cmp(left, right);
		if (ret != 0)
			return ret;
	}
216

217
	return _sort__sym_cmp(left->ms.sym, right->ms.sym);
218 219
}

220 221 222 223 224 225 226 227 228
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);
}

229 230
static int _hist_entry__sym_snprintf(struct map *map, struct symbol *sym,
				     u64 ip, char level, char *bf, size_t size,
231
				     unsigned int width)
232 233 234 235 236 237
{
	size_t ret = 0;

	if (verbose) {
		char o = map ? dso__symtab_origin(map->dso) : '!';
		ret += repsep_snprintf(bf, size, "%-#*llx %c ",
238
				       BITS_PER_LONG / 4 + 2, ip, o);
239
	}
240

241
	ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level);
242 243 244 245
	if (sym && map) {
		if (map->type == MAP__VARIABLE) {
			ret += repsep_snprintf(bf + ret, size - ret, "%s", sym->name);
			ret += repsep_snprintf(bf + ret, size - ret, "+0x%llx",
246
					ip - map->unmap_ip(map, sym->start));
247 248 249 250 251 252 253 254
			ret += repsep_snprintf(bf + ret, size - ret, "%-*s",
				       width - ret, "");
		} else {
			ret += repsep_snprintf(bf + ret, size - ret, "%-*s",
					       width - ret,
					       sym->name);
		}
	} else {
255 256 257 258 259 260 261
		size_t len = BITS_PER_LONG / 4;
		ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx",
				       len, ip);
		ret += repsep_snprintf(bf + ret, size - ret, "%-*s",
				       width - ret, "");
	}

262 263 264 265
	if (ret > width)
		bf[width] = '\0';

	return width;
266 267
}

268
static int hist_entry__sym_snprintf(struct hist_entry *he, char *bf,
269
				    size_t size, unsigned int width)
270
{
271 272
	return _hist_entry__sym_snprintf(he->ms.map, he->ms.sym, he->ip,
					 he->level, bf, size, width);
273
}
274

275 276 277
struct sort_entry sort_sym = {
	.se_header	= "Symbol",
	.se_cmp		= sort__sym_cmp,
278
	.se_sort	= sort__sym_sort,
279 280 281
	.se_snprintf	= hist_entry__sym_snprintf,
	.se_width_idx	= HISTC_SYMBOL,
};
282

283 284 285 286 287
/* --sort srcline */

static int64_t
sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right)
{
288 289 290 291 292 293
	if (!left->srcline) {
		if (!left->ms.map)
			left->srcline = SRCLINE_UNKNOWN;
		else {
			struct map *map = left->ms.map;
			left->srcline = get_srcline(map->dso,
294 295
					   map__rip_2objdump(map, left->ip),
						    left->ms.sym, true);
296 297 298 299 300 301 302 303
		}
	}
	if (!right->srcline) {
		if (!right->ms.map)
			right->srcline = SRCLINE_UNKNOWN;
		else {
			struct map *map = right->ms.map;
			right->srcline = get_srcline(map->dso,
304 305
					     map__rip_2objdump(map, right->ip),
						     right->ms.sym, true);
306 307
		}
	}
308
	return strcmp(right->srcline, left->srcline);
309 310
}

311
static int hist_entry__srcline_snprintf(struct hist_entry *he, char *bf,
312
					size_t size, unsigned int width)
313
{
314
	return repsep_snprintf(bf, size, "%-*.*s", width, width, he->srcline);
315 316 317 318 319 320 321 322 323
}

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

324 325
/* --sort parent */

326
static int64_t
327 328 329 330 331 332 333 334
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);

335
	return strcmp(sym_r->name, sym_l->name);
336 337
}

338
static int hist_entry__parent_snprintf(struct hist_entry *he, char *bf,
339
				       size_t size, unsigned int width)
340
{
341
	return repsep_snprintf(bf, size, "%-*.*s", width, width,
342
			      he->parent ? he->parent->name : "[other]");
343 344
}

345 346 347 348 349 350 351
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 已提交
352 353
/* --sort cpu */

354
static int64_t
A
Arun Sharma 已提交
355 356 357 358 359
sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return right->cpu - left->cpu;
}

360 361
static int hist_entry__cpu_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
A
Arun Sharma 已提交
362
{
363
	return repsep_snprintf(bf, size, "%*.*d", width, width, he->cpu);
A
Arun Sharma 已提交
364 365
}

366 367 368 369 370 371 372
struct sort_entry sort_cpu = {
	.se_header      = "CPU",
	.se_cmp	        = sort__cpu_cmp,
	.se_snprintf    = hist_entry__cpu_snprintf,
	.se_width_idx	= HISTC_CPU,
};

373 374
/* sort keys for branch stacks */

375 376 377
static int64_t
sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right)
{
378 379 380
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

381 382 383 384
	return _sort__dso_cmp(left->branch_info->from.map,
			      right->branch_info->from.map);
}

385
static int hist_entry__dso_from_snprintf(struct hist_entry *he, char *bf,
386 387
				    size_t size, unsigned int width)
{
388 389 390 391 392
	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");
393 394 395 396 397
}

static int64_t
sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
398 399 400
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

401 402 403 404
	return _sort__dso_cmp(left->branch_info->to.map,
			      right->branch_info->to.map);
}

405
static int hist_entry__dso_to_snprintf(struct hist_entry *he, char *bf,
406 407
				       size_t size, unsigned int width)
{
408 409 410 411 412
	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");
413 414 415 416 417 418 419 420
}

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;

421 422 423 424 425 426
	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;

427
	if (!from_l->sym && !from_r->sym)
428
		return _sort__addr_cmp(from_l->addr, from_r->addr);
429

430
	return _sort__sym_cmp(from_l->sym, from_r->sym);
431 432 433 434 435
}

static int64_t
sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
436 437 438 439 440 441 442
	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;
443 444

	if (!to_l->sym && !to_r->sym)
445
		return _sort__addr_cmp(to_l->addr, to_r->addr);
446

447
	return _sort__sym_cmp(to_l->sym, to_r->sym);
448 449
}

450
static int hist_entry__sym_from_snprintf(struct hist_entry *he, char *bf,
451
					 size_t size, unsigned int width)
452
{
453 454
	if (he->branch_info) {
		struct addr_map_symbol *from = &he->branch_info->from;
455

456 457 458 459 460
		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");
461 462
}

463
static int hist_entry__sym_to_snprintf(struct hist_entry *he, char *bf,
464
				       size_t size, unsigned int width)
465
{
466 467 468 469 470 471
	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);
	}
472

473
	return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
474 475
}

476 477 478 479 480 481 482
struct sort_entry sort_dso_from = {
	.se_header	= "Source Shared Object",
	.se_cmp		= sort__dso_from_cmp,
	.se_snprintf	= hist_entry__dso_from_snprintf,
	.se_width_idx	= HISTC_DSO_FROM,
};

483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506
struct sort_entry sort_dso_to = {
	.se_header	= "Target Shared Object",
	.se_cmp		= sort__dso_to_cmp,
	.se_snprintf	= hist_entry__dso_to_snprintf,
	.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,
	.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,
	.se_width_idx	= HISTC_SYMBOL_TO,
};

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

509 510 511 512 513
	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;
514 515 516
	return mp || p;
}

517
static int hist_entry__mispredict_snprintf(struct hist_entry *he, char *bf,
518 519 520
				    size_t size, unsigned int width){
	static const char *out = "N/A";

521 522 523 524 525 526
	if (he->branch_info) {
		if (he->branch_info->flags.predicted)
			out = "N";
		else if (he->branch_info->flags.mispred)
			out = "Y";
	}
527

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

531 532 533 534 535 536 537 538 539 540 541 542 543 544
/* --sort daddr_sym */
static int64_t
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);
}

545
static int hist_entry__daddr_snprintf(struct hist_entry *he, char *bf,
546 547 548 549 550 551
				    size_t size, unsigned int width)
{
	uint64_t addr = 0;
	struct map *map = NULL;
	struct symbol *sym = NULL;

552 553 554 555
	if (he->mem_info) {
		addr = he->mem_info->daddr.addr;
		map = he->mem_info->daddr.map;
		sym = he->mem_info->daddr.sym;
556
	}
557
	return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574
					 width);
}

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

575
static int hist_entry__dso_daddr_snprintf(struct hist_entry *he, char *bf,
576 577 578 579
				    size_t size, unsigned int width)
{
	struct map *map = NULL;

580 581
	if (he->mem_info)
		map = he->mem_info->daddr.map;
582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604

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

605
static int hist_entry__locked_snprintf(struct hist_entry *he, char *bf,
606 607 608 609 610
				    size_t size, unsigned int width)
{
	const char *out;
	u64 mask = PERF_MEM_LOCK_NA;

611 612
	if (he->mem_info)
		mask = he->mem_info->data_src.mem_lock;
613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653

	if (mask & PERF_MEM_LOCK_NA)
		out = "N/A";
	else if (mask & PERF_MEM_LOCK_LOCKED)
		out = "Yes";
	else
		out = "No";

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

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

static const char * const tlb_access[] = {
	"N/A",
	"HIT",
	"MISS",
	"L1",
	"L2",
	"Walker",
	"Fault",
};
#define NUM_TLB_ACCESS (sizeof(tlb_access)/sizeof(const char *))

654
static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf,
655 656 657 658 659 660 661 662 663 664
				    size_t size, unsigned int width)
{
	char out[64];
	size_t sz = sizeof(out) - 1; /* -1 for null termination */
	size_t l = 0, i;
	u64 m = PERF_MEM_TLB_NA;
	u64 hit, miss;

	out[0] = '\0';

665 666
	if (he->mem_info)
		m = he->mem_info->data_src.mem_dtlb;
667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730

	hit = m & PERF_MEM_TLB_HIT;
	miss = m & PERF_MEM_TLB_MISS;

	/* already taken care of */
	m &= ~(PERF_MEM_TLB_HIT|PERF_MEM_TLB_MISS);

	for (i = 0; m && i < NUM_TLB_ACCESS; i++, m >>= 1) {
		if (!(m & 0x1))
			continue;
		if (l) {
			strcat(out, " or ");
			l += 4;
		}
		strncat(out, tlb_access[i], sz - l);
		l += strlen(tlb_access[i]);
	}
	if (*out == '\0')
		strcpy(out, "N/A");
	if (hit)
		strncat(out, " hit", sz - l);
	if (miss)
		strncat(out, " miss", sz - l);

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

static const char * const mem_lvl[] = {
	"N/A",
	"HIT",
	"MISS",
	"L1",
	"LFB",
	"L2",
	"L3",
	"Local RAM",
	"Remote RAM (1 hop)",
	"Remote RAM (2 hops)",
	"Remote Cache (1 hop)",
	"Remote Cache (2 hops)",
	"I/O",
	"Uncached",
};
#define NUM_MEM_LVL (sizeof(mem_lvl)/sizeof(const char *))

731
static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf,
732 733 734 735 736 737 738 739
				    size_t size, unsigned int width)
{
	char out[64];
	size_t sz = sizeof(out) - 1; /* -1 for null termination */
	size_t i, l = 0;
	u64 m =  PERF_MEM_LVL_NA;
	u64 hit, miss;

740 741
	if (he->mem_info)
		m  = he->mem_info->data_src.mem_lvl;
742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798

	out[0] = '\0';

	hit = m & PERF_MEM_LVL_HIT;
	miss = m & PERF_MEM_LVL_MISS;

	/* already taken care of */
	m &= ~(PERF_MEM_LVL_HIT|PERF_MEM_LVL_MISS);

	for (i = 0; m && i < NUM_MEM_LVL; i++, m >>= 1) {
		if (!(m & 0x1))
			continue;
		if (l) {
			strcat(out, " or ");
			l += 4;
		}
		strncat(out, mem_lvl[i], sz - l);
		l += strlen(mem_lvl[i]);
	}
	if (*out == '\0')
		strcpy(out, "N/A");
	if (hit)
		strncat(out, " hit", sz - l);
	if (miss)
		strncat(out, " miss", sz - l);

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

static const char * const snoop_access[] = {
	"N/A",
	"None",
	"Miss",
	"Hit",
	"HitM",
};
#define NUM_SNOOP_ACCESS (sizeof(snoop_access)/sizeof(const char *))

799
static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf,
800 801 802 803 804 805 806 807 808
				    size_t size, unsigned int width)
{
	char out[64];
	size_t sz = sizeof(out) - 1; /* -1 for null termination */
	size_t i, l = 0;
	u64 m = PERF_MEM_SNOOP_NA;

	out[0] = '\0';

809 810
	if (he->mem_info)
		m = he->mem_info->data_src.mem_snoop;
811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828

	for (i = 0; m && i < NUM_SNOOP_ACCESS; i++, m >>= 1) {
		if (!(m & 0x1))
			continue;
		if (l) {
			strcat(out, " or ");
			l += 4;
		}
		strncat(out, snoop_access[i], sz - l);
		l += strlen(snoop_access[i]);
	}

	if (*out == '\0')
		strcpy(out, "N/A");

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

D
Don Zickus 已提交
829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926
static inline  u64 cl_address(u64 address)
{
	/* return the cacheline of the address */
	return (address & ~(cacheline_size - 1));
}

static int64_t
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) &&
		     map && (map->type == MAP__VARIABLE) &&
		    (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);
}

927 928 929 930 931 932 933
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,
};

934 935 936 937 938 939 940 941 942 943 944
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);
}

945
static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf,
946 947
				    size_t size, unsigned int width)
{
948
	return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he));
949 950 951 952 953 954 955 956 957 958 959 960 961 962 963
}

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

964
static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf,
965 966
					      size_t size, unsigned int width)
{
967
	return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight);
968 969 970 971 972 973 974 975 976
}

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

977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018
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,
};

struct sort_entry sort_mem_daddr_dso = {
	.se_header	= "Data Object",
	.se_cmp		= sort__dso_daddr_cmp,
	.se_snprintf	= hist_entry__dso_daddr_snprintf,
	.se_width_idx	= HISTC_MEM_DADDR_SYMBOL,
};

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 已提交
1019 1020 1021 1022 1023 1024 1025
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,
};

1026 1027 1028
static int64_t
sort__abort_cmp(struct hist_entry *left, struct hist_entry *right)
{
1029 1030 1031
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1032 1033 1034 1035
	return left->branch_info->flags.abort !=
		right->branch_info->flags.abort;
}

1036
static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf,
1037 1038
				    size_t size, unsigned int width)
{
1039 1040 1041 1042 1043 1044 1045 1046
	static const char *out = "N/A";

	if (he->branch_info) {
		if (he->branch_info->flags.abort)
			out = "A";
		else
			out = ".";
	}
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060

	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)
{
1061 1062 1063
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1064 1065 1066 1067
	return left->branch_info->flags.in_tx !=
		right->branch_info->flags.in_tx;
}

1068
static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf,
1069 1070
				    size_t size, unsigned int width)
{
1071
	static const char *out = "N/A";
1072

1073 1074 1075 1076 1077 1078
	if (he->branch_info) {
		if (he->branch_info->flags.in_tx)
			out = "T";
		else
			out = ".";
	}
1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089

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

1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130
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;
}

1131
static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf,
1132 1133
					    size_t size, unsigned int width)
{
1134
	u64 t = he->transaction;
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
	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,
};

1162 1163 1164 1165 1166 1167
struct sort_dimension {
	const char		*name;
	struct sort_entry	*entry;
	int			taken;
};

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

1170
static struct sort_dimension common_sort_dimensions[] = {
1171 1172 1173 1174 1175 1176
	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),
1177
	DIM(SORT_SRCLINE, "srcline", sort_srcline),
1178 1179
	DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight),
	DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight),
1180
	DIM(SORT_TRANSACTION, "transaction", sort_transaction),
1181 1182
};

1183 1184 1185 1186 1187 1188 1189 1190 1191 1192
#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),
1193 1194
	DIM(SORT_IN_TX, "in_tx", sort_in_tx),
	DIM(SORT_ABORT, "abort", sort_abort),
1195 1196 1197 1198
};

#undef DIM

1199 1200 1201 1202 1203 1204 1205 1206 1207
#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),
	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 已提交
1208
	DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline),
1209 1210 1211 1212
};

#undef DIM

1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226
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"),
1227
	DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"),
1228 1229 1230 1231 1232 1233
	DIM(PERF_HPP__SAMPLES, "sample"),
	DIM(PERF_HPP__PERIOD, "period"),
};

#undef DIM

1234 1235 1236 1237 1238
struct hpp_sort_entry {
	struct perf_hpp_fmt hpp;
	struct sort_entry *se;
};

1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252
bool perf_hpp__same_sort_entry(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;
}

1253
void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists)
1254 1255 1256 1257 1258 1259 1260
{
	struct hpp_sort_entry *hse;

	if (!perf_hpp__is_sort_entry(fmt))
		return;

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1261
	hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name));
1262 1263
}

1264 1265 1266 1267
static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
			      struct perf_evsel *evsel)
{
	struct hpp_sort_entry *hse;
1268
	size_t len = fmt->user_len;
1269 1270 1271

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

1272
	if (!len)
1273
		len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
1274

1275
	return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name);
1276 1277 1278 1279 1280 1281 1282
}

static int __sort__hpp_width(struct perf_hpp_fmt *fmt,
			     struct perf_hpp *hpp __maybe_unused,
			     struct perf_evsel *evsel)
{
	struct hpp_sort_entry *hse;
1283
	size_t len = fmt->user_len;
1284 1285 1286

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

1287
	if (!len)
1288
		len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
1289 1290

	return len;
1291 1292 1293 1294 1295 1296
}

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

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1300 1301 1302

	if (!len)
		len = hists__col_len(he->hists, hse->se->se_width_idx);
1303 1304 1305 1306

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

1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337
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);
}

1338 1339
static struct hpp_sort_entry *
__sort_dimension__alloc_hpp(struct sort_dimension *sd)
1340 1341 1342 1343 1344 1345
{
	struct hpp_sort_entry *hse;

	hse = malloc(sizeof(*hse));
	if (hse == NULL) {
		pr_err("Memory allocation failed\n");
1346
		return NULL;
1347 1348 1349
	}

	hse->se = sd->entry;
1350
	hse->hpp.name = sd->entry->se_header;
1351 1352 1353 1354 1355
	hse->hpp.header = __sort__hpp_header;
	hse->hpp.width = __sort__hpp_width;
	hse->hpp.entry = __sort__hpp_entry;
	hse->hpp.color = NULL;

1356 1357 1358
	hse->hpp.cmp = __sort__hpp_cmp;
	hse->hpp.collapse = __sort__hpp_collapse;
	hse->hpp.sort = __sort__hpp_sort;
1359 1360 1361

	INIT_LIST_HEAD(&hse->hpp.list);
	INIT_LIST_HEAD(&hse->hpp.sort_list);
1362
	hse->hpp.elide = false;
1363
	hse->hpp.len = 0;
1364
	hse->hpp.user_len = 0;
1365

1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380
	return hse;
}

bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format)
{
	return format->header == __sort__hpp_header;
}

static int __sort_dimension__add_hpp_sort(struct sort_dimension *sd)
{
	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd);

	if (hse == NULL)
		return -1;

1381 1382 1383 1384
	perf_hpp__register_sort_field(&hse->hpp);
	return 0;
}

1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395
static int __sort_dimension__add_hpp_output(struct sort_dimension *sd)
{
	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd);

	if (hse == NULL)
		return -1;

	perf_hpp__column_register(&hse->hpp);
	return 0;
}

1396
static int __sort_dimension__add(struct sort_dimension *sd)
1397 1398
{
	if (sd->taken)
1399 1400
		return 0;

1401
	if (__sort_dimension__add_hpp_sort(sd) < 0)
1402
		return -1;
1403 1404 1405 1406 1407

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

	sd->taken = 1;
1408 1409

	return 0;
1410 1411
}

1412 1413 1414 1415 1416 1417 1418 1419 1420 1421
static int __hpp_dimension__add(struct hpp_dimension *hd)
{
	if (!hd->taken) {
		hd->taken = 1;

		perf_hpp__register_sort_field(hd->fmt);
	}
	return 0;
}

1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443
static int __sort_dimension__add_output(struct sort_dimension *sd)
{
	if (sd->taken)
		return 0;

	if (__sort_dimension__add_hpp_output(sd) < 0)
		return -1;

	sd->taken = 1;
	return 0;
}

static int __hpp_dimension__add_output(struct hpp_dimension *hd)
{
	if (!hd->taken) {
		hd->taken = 1;

		perf_hpp__column_register(hd->fmt);
	}
	return 0;
}

1444 1445 1446 1447
int sort_dimension__add(const char *tok)
{
	unsigned int i;

1448 1449
	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
		struct sort_dimension *sd = &common_sort_dimensions[i];
1450 1451 1452

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

1454 1455 1456 1457 1458 1459
		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));
1460 1461
				pr_err("Invalid regex: %s\n%s", parent_pattern, err);
				return -EINVAL;
1462 1463
			}
			sort__has_parent = 1;
1464
		} else if (sd->entry == &sort_sym) {
N
Namhyung Kim 已提交
1465
			sort__has_sym = 1;
1466 1467 1468 1469 1470 1471 1472 1473 1474
			/*
			 * 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 已提交
1475 1476
		} else if (sd->entry == &sort_dso) {
			sort__has_dso = 1;
1477 1478
		}

1479
		return __sort_dimension__add(sd);
1480
	}
1481

1482 1483 1484 1485 1486 1487 1488 1489 1490
	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;

		return __hpp_dimension__add(hd);
	}

1491 1492 1493 1494 1495 1496
	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;

1497
		if (sort__mode != SORT_MODE__BRANCH)
1498 1499 1500 1501 1502
			return -EINVAL;

		if (sd->entry == &sort_sym_from || sd->entry == &sort_sym_to)
			sort__has_sym = 1;

1503
		__sort_dimension__add(sd);
1504 1505 1506
		return 0;
	}

1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518
	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;

		if (sd->entry == &sort_mem_daddr_sym)
			sort__has_sym = 1;

1519
		__sort_dimension__add(sd);
1520 1521 1522
		return 0;
	}

1523 1524
	return -ESRCH;
}
1525

1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540
static const char *get_default_sort_order(void)
{
	const char *default_sort_orders[] = {
		default_sort_order,
		default_branch_sort_order,
		default_mem_sort_order,
		default_top_sort_order,
		default_diff_sort_order,
	};

	BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders));

	return default_sort_orders[sort__mode];
}

1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570
static int setup_sort_order(void)
{
	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') {
		error("Invalid --sort key: `+'");
		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",
		     get_default_sort_order(), sort_order + 1) < 0) {
		error("Not enough memory to set up --sort");
		return -ENOMEM;
	}

	sort_order = new_sort_order;
	return 0;
}

1571
static int __setup_sorting(void)
1572
{
1573
	char *tmp, *tok, *str;
1574
	const char *sort_keys;
1575
	int ret = 0;
1576

1577 1578 1579 1580 1581
	ret = setup_sort_order();
	if (ret)
		return ret;

	sort_keys = sort_order;
1582
	if (sort_keys == NULL) {
1583
		if (is_strict_order(field_order)) {
1584 1585 1586 1587 1588 1589 1590
			/*
			 * If user specified field order but no sort order,
			 * we'll honor it and not add default sort orders.
			 */
			return 0;
		}

1591
		sort_keys = get_default_sort_order();
1592
	}
1593 1594

	str = strdup(sort_keys);
1595 1596 1597 1598 1599
	if (str == NULL) {
		error("Not enough memory to setup sort keys");
		return -ENOMEM;
	}

1600 1601
	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
1602
		ret = sort_dimension__add(tok);
1603 1604
		if (ret == -EINVAL) {
			error("Invalid --sort key: `%s'", tok);
1605
			break;
1606
		} else if (ret == -ESRCH) {
1607
			error("Unknown --sort key: `%s'", tok);
1608
			break;
1609 1610 1611 1612
		}
	}

	free(str);
1613
	return ret;
1614
}
1615

1616
void perf_hpp__set_elide(int idx, bool elide)
1617
{
1618 1619
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
1620

1621 1622 1623 1624 1625 1626 1627 1628 1629
	perf_hpp__for_each_format(fmt) {
		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;
		}
1630 1631 1632
	}
}

1633
static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp)
1634 1635 1636 1637 1638
{
	if (list && strlist__nr_entries(list) == 1) {
		if (fp != NULL)
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(list, 0)->s);
1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654
		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;
1655
	}
1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673

	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;
1674
}
1675 1676 1677

void sort__setup_elide(FILE *output)
{
1678 1679
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
1680

1681 1682 1683 1684 1685 1686
	perf_hpp__for_each_format(fmt) {
		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);
1687 1688
	}

1689 1690 1691 1692
	/*
	 * It makes no sense to elide all of sort entries.
	 * Just revert them to show up again.
	 */
1693 1694 1695 1696
	perf_hpp__for_each_format(fmt) {
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

1697
		if (!fmt->elide)
1698 1699 1700
			return;
	}

1701 1702 1703 1704
	perf_hpp__for_each_format(fmt) {
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

1705
		fmt->elide = false;
1706
	}
1707
}
1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 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 1763 1764 1765 1766 1767 1768

static int output_field_add(char *tok)
{
	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;

		return __sort_dimension__add_output(sd);
	}

	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;

		return __hpp_dimension__add_output(hd);
	}

	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;

		return __sort_dimension__add_output(sd);
	}

	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;

		return __sort_dimension__add_output(sd);
	}

	return -ESRCH;
}

static void reset_dimensions(void)
{
	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;
}

1769 1770 1771 1772 1773
bool is_strict_order(const char *order)
{
	return order && (*order != '+');
}

1774 1775
static int __setup_output_field(void)
{
1776 1777
	char *tmp, *tok, *str, *strp;
	int ret = -EINVAL;
1778 1779 1780 1781 1782 1783

	if (field_order == NULL)
		return 0;

	reset_dimensions();

1784
	strp = str = strdup(field_order);
1785 1786 1787 1788 1789
	if (str == NULL) {
		error("Not enough memory to setup output fields");
		return -ENOMEM;
	}

1790 1791 1792 1793 1794 1795 1796 1797 1798
	if (!is_strict_order(field_order))
		strp++;

	if (!strlen(strp)) {
		error("Invalid --fields key: `+'");
		goto out;
	}

	for (tok = strtok_r(strp, ", ", &tmp);
1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
		ret = output_field_add(tok);
		if (ret == -EINVAL) {
			error("Invalid --fields key: `%s'", tok);
			break;
		} else if (ret == -ESRCH) {
			error("Unknown --fields key: `%s'", tok);
			break;
		}
	}

1810
out:
1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847
	free(str);
	return ret;
}

int setup_sorting(void)
{
	int err;

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

	if (parent_pattern != default_parent_pattern) {
		err = sort_dimension__add("parent");
		if (err < 0)
			return err;
	}

	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 */
	perf_hpp__setup_output_field();
	/* and then copy output fields to sort keys */
	perf_hpp__append_sort_keys();

	return 0;
}
1848 1849 1850 1851 1852 1853 1854 1855

void reset_output_field(void)
{
	sort__need_collapse = 0;
	sort__has_parent = 0;
	sort__has_sym = 0;
	sort__has_dso = 0;

1856 1857 1858
	field_order = NULL;
	sort_order = NULL;

1859 1860 1861
	reset_dimensions();
	perf_hpp__reset_output_field();
}