sort.c 59.7 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
#include "evlist.h"
#include <traceevent/event-parse.h>
9
#include "mem-events.h"
10 11

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

32 33 34 35 36 37 38 39 40
/*
 * 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.
*/
41
static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
42 43 44 45 46
{
	int n;
	va_list ap;

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

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

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

65
static int64_t cmp_null(const void *l, const void *r)
66 67 68 69 70 71 72 73 74 75 76 77 78 79
{
	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)
{
80
	return right->thread->tid - left->thread->tid;
81 82
}

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

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

93
struct sort_entry sort_thread = {
94
	.se_header	= "  Pid:Command",
95 96 97 98 99 100 101 102 103 104
	.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)
{
105
	/* Compare the addr that should be unique among comm */
106
	return strcmp(comm__str(right->comm), comm__str(left->comm));
107 108 109 110 111
}

static int64_t
sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
{
112
	/* Compare the addr that should be unique among comm */
113
	return strcmp(comm__str(right->comm), comm__str(left->comm));
114 115
}

116 117 118 119 120 121
static int64_t
sort__comm_sort(struct hist_entry *left, struct hist_entry *right)
{
	return strcmp(comm__str(right->comm), comm__str(left->comm));
}

122
static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf,
123
				     size_t size, unsigned int width)
124
{
125
	return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm));
126 127
}

128 129 130 131
struct sort_entry sort_comm = {
	.se_header	= "Command",
	.se_cmp		= sort__comm_cmp,
	.se_collapse	= sort__comm_collapse,
132
	.se_sort	= sort__comm_sort,
133 134 135 136 137 138
	.se_snprintf	= hist_entry__comm_snprintf,
	.se_width_idx	= HISTC_COMM,
};

/* --sort dso */

139 140 141 142 143 144 145
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)
146
		return cmp_null(dso_r, dso_l);
147 148 149 150 151 152 153 154 155 156 157 158

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

159
static int64_t
160 161
sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
{
162
	return _sort__dso_cmp(right->ms.map, left->ms.map);
163
}
164

165 166 167 168 169 170
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;
171
		return repsep_snprintf(bf, size, "%-*.*s", width, width, dso_name);
172 173
	}

174
	return repsep_snprintf(bf, size, "%-*.*s", width, width, "[unknown]");
175 176
}

177
static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf,
178 179
				    size_t size, unsigned int width)
{
180
	return _hist_entry__dso_snprintf(he->ms.map, bf, size, width);
181 182 183 184 185 186 187 188 189 190
}

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 */
191

192 193 194 195 196
static int64_t _sort__addr_cmp(u64 left_ip, u64 right_ip)
{
	return (int64_t)(right_ip - left_ip);
}

197
static int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r)
198 199 200 201 202 203 204
{
	if (!sym_l || !sym_r)
		return cmp_null(sym_l, sym_r);

	if (sym_l == sym_r)
		return 0;

205 206
	if (sym_l->start != sym_r->start)
		return (int64_t)(sym_r->start - sym_l->start);
207

208
	return (int64_t)(sym_r->end - sym_l->end);
209 210
}

211 212
static int64_t
sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
213
{
214 215
	int64_t ret;

216
	if (!left->ms.sym && !right->ms.sym)
217
		return _sort__addr_cmp(left->ip, right->ip);
218

219 220 221 222
	/*
	 * comparing symbol address alone is not enough since it's a
	 * relative address within a dso.
	 */
N
Namhyung Kim 已提交
223 224 225 226 227
	if (!sort__has_dso) {
		ret = sort__dso_cmp(left, right);
		if (ret != 0)
			return ret;
	}
228

229
	return _sort__sym_cmp(left->ms.sym, right->ms.sym);
230 231
}

232 233 234 235 236 237 238 239 240
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);
}

241 242
static int _hist_entry__sym_snprintf(struct map *map, struct symbol *sym,
				     u64 ip, char level, char *bf, size_t size,
243
				     unsigned int width)
244 245 246 247 248 249
{
	size_t ret = 0;

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

253
	ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level);
254 255 256 257
	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",
258
					ip - map->unmap_ip(map, sym->start));
259
		} else {
260
			ret += repsep_snprintf(bf + ret, size - ret, "%.*s",
261 262 263 264
					       width - ret,
					       sym->name);
		}
	} else {
265 266 267 268 269
		size_t len = BITS_PER_LONG / 4;
		ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx",
				       len, ip);
	}

270
	return ret;
271 272
}

273
static int hist_entry__sym_snprintf(struct hist_entry *he, char *bf,
274
				    size_t size, unsigned int width)
275
{
276 277
	return _hist_entry__sym_snprintf(he->ms.map, he->ms.sym, he->ip,
					 he->level, bf, size, width);
278
}
279

280 281 282
struct sort_entry sort_sym = {
	.se_header	= "Symbol",
	.se_cmp		= sort__sym_cmp,
283
	.se_sort	= sort__sym_sort,
284 285 286
	.se_snprintf	= hist_entry__sym_snprintf,
	.se_width_idx	= HISTC_SYMBOL,
};
287

288 289
/* --sort srcline */

290 291 292 293 294 295 296 297 298 299 300
static char *hist_entry__get_srcline(struct hist_entry *he)
{
	struct map *map = he->ms.map;

	if (!map)
		return SRCLINE_UNKNOWN;

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

301 302 303
static int64_t
sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right)
{
304 305 306 307 308
	if (!left->srcline)
		left->srcline = hist_entry__get_srcline(left);
	if (!right->srcline)
		right->srcline = hist_entry__get_srcline(right);

309
	return strcmp(right->srcline, left->srcline);
310 311
}

312
static int hist_entry__srcline_snprintf(struct hist_entry *he, char *bf,
313
					size_t size, unsigned int width)
314
{
315 316 317
	if (!he->srcline)
		he->srcline = hist_entry__get_srcline(he);

318
	return repsep_snprintf(bf, size, "%-.*s", width, he->srcline);
319 320 321 322 323 324 325 326 327
}

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

328 329 330 331
/* --sort srcfile */

static char no_srcfile[1];

332
static char *hist_entry__get_srcfile(struct hist_entry *e)
333 334 335 336
{
	char *sf, *p;
	struct map *map = e->ms.map;

337 338 339
	if (!map)
		return no_srcfile;

340 341
	sf = __get_srcline(map->dso, map__rip_2objdump(map, e->ip),
			 e->ms.sym, false, true);
342 343
	if (!strcmp(sf, SRCLINE_UNKNOWN))
		return no_srcfile;
344 345 346 347 348 349 350 351 352 353 354 355
	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)
{
356 357 358 359 360
	if (!left->srcfile)
		left->srcfile = hist_entry__get_srcfile(left);
	if (!right->srcfile)
		right->srcfile = hist_entry__get_srcfile(right);

361 362 363 364 365 366
	return strcmp(right->srcfile, left->srcfile);
}

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

370
	return repsep_snprintf(bf, size, "%-.*s", width, he->srcfile);
371 372 373 374 375 376 377 378 379
}

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

380 381
/* --sort parent */

382
static int64_t
383 384 385 386 387 388 389 390
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);

391
	return strcmp(sym_r->name, sym_l->name);
392 393
}

394
static int hist_entry__parent_snprintf(struct hist_entry *he, char *bf,
395
				       size_t size, unsigned int width)
396
{
397
	return repsep_snprintf(bf, size, "%-*.*s", width, width,
398
			      he->parent ? he->parent->name : "[other]");
399 400
}

401 402 403 404 405 406 407
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 已提交
408 409
/* --sort cpu */

410
static int64_t
A
Arun Sharma 已提交
411 412 413 414 415
sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
{
	return right->cpu - left->cpu;
}

416 417
static int hist_entry__cpu_snprintf(struct hist_entry *he, char *bf,
				    size_t size, unsigned int width)
A
Arun Sharma 已提交
418
{
419
	return repsep_snprintf(bf, size, "%*.*d", width, width, he->cpu);
A
Arun Sharma 已提交
420 421
}

422 423 424 425 426 427 428
struct sort_entry sort_cpu = {
	.se_header      = "CPU",
	.se_cmp	        = sort__cpu_cmp,
	.se_snprintf    = hist_entry__cpu_snprintf,
	.se_width_idx	= HISTC_CPU,
};

429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449
/* --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);
}

struct sort_entry sort_socket = {
	.se_header      = "Socket",
	.se_cmp	        = sort__socket_cmp,
	.se_snprintf    = hist_entry__socket_snprintf,
	.se_width_idx	= HISTC_SOCKET,
};

N
Namhyung Kim 已提交
450 451 452 453 454 455 456 457 458 459 460 461 462 463
/* --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);
464 465 466 467 468 469
	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);
	}
N
Namhyung Kim 已提交
470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496
	return seq.buffer;
}

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)
497
		return scnprintf(bf, size, "%-.*s", width, "N/A");
N
Namhyung Kim 已提交
498 499 500

	if (he->trace_output == NULL)
		he->trace_output = get_trace_output(he);
501
	return repsep_snprintf(bf, size, "%-.*s", width, he->trace_output);
N
Namhyung Kim 已提交
502 503 504 505 506 507 508 509 510
}

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

511 512
/* sort keys for branch stacks */

513 514 515
static int64_t
sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right)
{
516 517 518
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

519 520 521 522
	return _sort__dso_cmp(left->branch_info->from.map,
			      right->branch_info->from.map);
}

523
static int hist_entry__dso_from_snprintf(struct hist_entry *he, char *bf,
524 525
				    size_t size, unsigned int width)
{
526 527 528 529 530
	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");
531 532 533 534 535
}

static int64_t
sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
536 537 538
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

539 540 541 542
	return _sort__dso_cmp(left->branch_info->to.map,
			      right->branch_info->to.map);
}

543
static int hist_entry__dso_to_snprintf(struct hist_entry *he, char *bf,
544 545
				       size_t size, unsigned int width)
{
546 547 548 549 550
	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");
551 552 553 554 555 556 557 558
}

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;

559 560 561 562 563 564
	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;

565
	if (!from_l->sym && !from_r->sym)
566
		return _sort__addr_cmp(from_l->addr, from_r->addr);
567

568
	return _sort__sym_cmp(from_l->sym, from_r->sym);
569 570 571 572 573
}

static int64_t
sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right)
{
574 575 576 577 578 579 580
	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;
581 582

	if (!to_l->sym && !to_r->sym)
583
		return _sort__addr_cmp(to_l->addr, to_r->addr);
584

585
	return _sort__sym_cmp(to_l->sym, to_r->sym);
586 587
}

588
static int hist_entry__sym_from_snprintf(struct hist_entry *he, char *bf,
589
					 size_t size, unsigned int width)
590
{
591 592
	if (he->branch_info) {
		struct addr_map_symbol *from = &he->branch_info->from;
593

594 595 596 597 598
		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");
599 600
}

601
static int hist_entry__sym_to_snprintf(struct hist_entry *he, char *bf,
602
				       size_t size, unsigned int width)
603
{
604 605 606 607 608 609
	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);
	}
610

611
	return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
612 613
}

614 615 616 617 618 619 620
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,
};

621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
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)
{
645
	unsigned char mp, p;
646

647 648 649 650 651
	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;
652 653 654
	return mp || p;
}

655
static int hist_entry__mispredict_snprintf(struct hist_entry *he, char *bf,
656 657 658
				    size_t size, unsigned int width){
	static const char *out = "N/A";

659 660 661 662 663 664
	if (he->branch_info) {
		if (he->branch_info->flags.predicted)
			out = "N";
		else if (he->branch_info->flags.mispred)
			out = "Y";
	}
665

666
	return repsep_snprintf(bf, size, "%-*.*s", width, width, out);
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
static int64_t
sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right)
{
	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)
{
	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,
};

692 693 694 695 696 697 698 699 700 701 702 703 704 705
/* --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);
}

706
static int hist_entry__daddr_snprintf(struct hist_entry *he, char *bf,
707 708 709 710 711 712
				    size_t size, unsigned int width)
{
	uint64_t addr = 0;
	struct map *map = NULL;
	struct symbol *sym = NULL;

713 714 715 716
	if (he->mem_info) {
		addr = he->mem_info->daddr.addr;
		map = he->mem_info->daddr.map;
		sym = he->mem_info->daddr.sym;
717
	}
718
	return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
719 720 721
					 width);
}

722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750
static int64_t
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);
}

751 752 753 754 755 756 757 758 759 760 761 762 763 764
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);
}

765
static int hist_entry__dso_daddr_snprintf(struct hist_entry *he, char *bf,
766 767 768 769
				    size_t size, unsigned int width)
{
	struct map *map = NULL;

770 771
	if (he->mem_info)
		map = he->mem_info->daddr.map;
772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794

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

795
static int hist_entry__locked_snprintf(struct hist_entry *he, char *bf,
796 797 798 799 800
				    size_t size, unsigned int width)
{
	const char *out;
	u64 mask = PERF_MEM_LOCK_NA;

801 802
	if (he->mem_info)
		mask = he->mem_info->data_src.mem_lock;
803 804 805 806 807 808 809 810

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

811
	return repsep_snprintf(bf, size, "%.*s", width, out);
812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832
}

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

833
static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf,
834 835 836 837
				    size_t size, unsigned int width)
{
	char out[64];

838
	perf_mem__tlb_scnprintf(out, sizeof(out), he->mem_info);
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
	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",
};

878
static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf,
879 880 881 882 883 884 885 886
				    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;

887 888
	if (he->mem_info)
		m  = he->mem_info->data_src.mem_lvl;
889 890 891 892 893 894 895 896 897

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

898
	for (i = 0; m && i < ARRAY_SIZE(mem_lvl); i++, m >>= 1) {
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 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944
		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",
};

945
static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf,
946 947 948 949 950 951 952 953 954
				    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';

955 956
	if (he->mem_info)
		m = he->mem_info->data_src.mem_snoop;
957

958
	for (i = 0; m && i < ARRAY_SIZE(snoop_access); i++, m >>= 1) {
959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974
		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 已提交
975 976 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 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066
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);
}

1067 1068 1069 1070 1071 1072 1073
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,
};

1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084
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);
}

1085
static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf,
1086 1087
				    size_t size, unsigned int width)
{
1088
	return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he));
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103
}

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

1104
static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf,
1105 1106
					      size_t size, unsigned int width)
{
1107
	return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight);
1108 1109 1110 1111 1112 1113 1114 1115 1116
}

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

1117 1118 1119 1120 1121 1122 1123
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,
};

1124 1125 1126 1127 1128 1129 1130
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,
};

1131 1132 1133 1134 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
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 已提交
1166 1167 1168 1169 1170 1171 1172
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,
};

1173 1174 1175
static int64_t
sort__abort_cmp(struct hist_entry *left, struct hist_entry *right)
{
1176 1177 1178
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1179 1180 1181 1182
	return left->branch_info->flags.abort !=
		right->branch_info->flags.abort;
}

1183
static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf,
1184 1185
				    size_t size, unsigned int width)
{
1186 1187 1188 1189 1190 1191 1192 1193
	static const char *out = "N/A";

	if (he->branch_info) {
		if (he->branch_info->flags.abort)
			out = "A";
		else
			out = ".";
	}
1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207

	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)
{
1208 1209 1210
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1211 1212 1213 1214
	return left->branch_info->flags.in_tx !=
		right->branch_info->flags.in_tx;
}

1215
static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf,
1216 1217
				    size_t size, unsigned int width)
{
1218
	static const char *out = "N/A";
1219

1220 1221 1222 1223 1224 1225
	if (he->branch_info) {
		if (he->branch_info->flags.in_tx)
			out = "T";
		else
			out = ".";
	}
1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236

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

1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277
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;
}

1278
static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf,
1279 1280
					    size_t size, unsigned int width)
{
1281
	u64 t = he->transaction;
1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308
	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,
};

1309 1310 1311 1312 1313 1314
struct sort_dimension {
	const char		*name;
	struct sort_entry	*entry;
	int			taken;
};

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

1317
static struct sort_dimension common_sort_dimensions[] = {
1318 1319 1320 1321 1322 1323
	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),
1324
	DIM(SORT_SOCKET, "socket", sort_socket),
1325
	DIM(SORT_SRCLINE, "srcline", sort_srcline),
1326
	DIM(SORT_SRCFILE, "srcfile", sort_srcfile),
1327 1328
	DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight),
	DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight),
1329
	DIM(SORT_TRANSACTION, "transaction", sort_transaction),
N
Namhyung Kim 已提交
1330
	DIM(SORT_TRACE, "trace", sort_trace),
1331 1332
};

1333 1334 1335 1336 1337 1338 1339 1340 1341 1342
#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),
1343 1344
	DIM(SORT_IN_TX, "in_tx", sort_in_tx),
	DIM(SORT_ABORT, "abort", sort_abort),
1345
	DIM(SORT_CYCLES, "cycles", sort_cycles),
1346 1347 1348 1349
};

#undef DIM

1350 1351 1352 1353
#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),
1354
	DIM(SORT_MEM_IADDR_SYMBOL, "symbol_iaddr", sort_mem_iaddr_sym),
1355 1356 1357 1358 1359
	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 已提交
1360
	DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline),
1361 1362 1363 1364
};

#undef DIM

1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378
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"),
1379
	DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"),
1380 1381 1382 1383 1384 1385
	DIM(PERF_HPP__SAMPLES, "sample"),
	DIM(PERF_HPP__PERIOD, "period"),
};

#undef DIM

1386 1387 1388 1389 1390
struct hpp_sort_entry {
	struct perf_hpp_fmt hpp;
	struct sort_entry *se;
};

1391
void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists)
1392 1393 1394 1395 1396 1397 1398
{
	struct hpp_sort_entry *hse;

	if (!perf_hpp__is_sort_entry(fmt))
		return;

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1399
	hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name));
1400 1401
}

1402 1403 1404 1405
static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
			      struct perf_evsel *evsel)
{
	struct hpp_sort_entry *hse;
1406
	size_t len = fmt->user_len;
1407 1408 1409

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

1410
	if (!len)
1411
		len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
1412

1413
	return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name);
1414 1415 1416 1417 1418 1419 1420
}

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;
1421
	size_t len = fmt->user_len;
1422 1423 1424

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

1425
	if (!len)
1426
		len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
1427 1428

	return len;
1429 1430 1431 1432 1433 1434
}

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

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1438 1439 1440

	if (!len)
		len = hists__col_len(he->hists, hse->se->se_width_idx);
1441 1442 1443 1444

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

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

1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494
bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format)
{
	return format->header == __sort__hpp_header;
}

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

1495 1496 1497 1498 1499 1500 1501 1502
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);
}

1503 1504
static struct hpp_sort_entry *
__sort_dimension__alloc_hpp(struct sort_dimension *sd)
1505 1506 1507 1508 1509 1510
{
	struct hpp_sort_entry *hse;

	hse = malloc(sizeof(*hse));
	if (hse == NULL) {
		pr_err("Memory allocation failed\n");
1511
		return NULL;
1512 1513 1514
	}

	hse->se = sd->entry;
1515
	hse->hpp.name = sd->entry->se_header;
1516 1517 1518 1519 1520
	hse->hpp.header = __sort__hpp_header;
	hse->hpp.width = __sort__hpp_width;
	hse->hpp.entry = __sort__hpp_entry;
	hse->hpp.color = NULL;

1521 1522 1523
	hse->hpp.cmp = __sort__hpp_cmp;
	hse->hpp.collapse = __sort__hpp_collapse;
	hse->hpp.sort = __sort__hpp_sort;
1524
	hse->hpp.equal = __sort__hpp_equal;
1525
	hse->hpp.free = hse_free;
1526 1527 1528

	INIT_LIST_HEAD(&hse->hpp.list);
	INIT_LIST_HEAD(&hse->hpp.sort_list);
1529
	hse->hpp.elide = false;
1530
	hse->hpp.len = 0;
1531
	hse->hpp.user_len = 0;
1532

1533 1534 1535
	return hse;
}

1536 1537 1538 1539 1540
static void hpp_free(struct perf_hpp_fmt *fmt)
{
	free(fmt);
}

1541 1542 1543 1544 1545 1546 1547 1548
static struct perf_hpp_fmt *__hpp_dimension__alloc_hpp(struct hpp_dimension *hd)
{
	struct perf_hpp_fmt *fmt;

	fmt = memdup(hd->fmt, sizeof(*fmt));
	if (fmt) {
		INIT_LIST_HEAD(&fmt->list);
		INIT_LIST_HEAD(&fmt->sort_list);
1549
		fmt->free = hpp_free;
1550 1551 1552 1553 1554
	}

	return fmt;
}

1555 1556 1557 1558 1559 1560 1561
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;

1562 1563 1564 1565
	perf_hpp__register_sort_field(&hse->hpp);
	return 0;
}

1566 1567
static int __sort_dimension__add_hpp_output(struct perf_hpp_list *list,
					    struct sort_dimension *sd)
1568 1569 1570 1571 1572 1573
{
	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd);

	if (hse == NULL)
		return -1;

1574
	perf_hpp_list__column_register(list, &hse->hpp);
1575 1576 1577
	return 0;
}

1578 1579 1580 1581 1582
struct hpp_dynamic_entry {
	struct perf_hpp_fmt hpp;
	struct perf_evsel *evsel;
	struct format_field *field;
	unsigned dynamic_len;
1583
	bool raw_trace;
1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607
};

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

1608 1609 1610 1611 1612 1613 1614 1615
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;

1616 1617 1618
	if (hde->raw_trace)
		return;

1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650
	/* 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;
	}
}

1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679
static int __sort__hde_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
			      struct perf_evsel *evsel __maybe_unused)
{
	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,
			     struct perf_evsel *evsel __maybe_unused)
{
	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;
}

1680 1681 1682 1683 1684 1685 1686 1687 1688
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;
}

1689 1690 1691 1692 1693
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;
1694 1695 1696 1697
	char *str, *pos;
	struct format_field *field;
	size_t namelen;
	bool last = false;
1698 1699 1700 1701 1702 1703 1704
	int ret;

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

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

1705 1706
	if (hde->raw_trace)
		goto raw_field;
1707

1708
	field = hde->field;
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
	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;
1737
raw_field:
1738 1739 1740 1741 1742 1743 1744
		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);
1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770
	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);

	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;
1771 1772 1773

		update_dynamic_len(hde, a);
		update_dynamic_len(hde, b);
1774 1775 1776 1777 1778
	}

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

1779 1780 1781 1782 1783
bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *fmt)
{
	return fmt->cmp == __sort__hde_cmp;
}

1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797
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;
}

1798 1799 1800 1801 1802 1803 1804 1805
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);
}

1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829
static struct hpp_dynamic_entry *
__alloc_dynamic_entry(struct perf_evsel *evsel, struct format_field *field)
{
	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;
1830
	hde->hpp.equal = __sort__hde_equal;
1831
	hde->hpp.free = hde_free;
1832 1833 1834 1835 1836 1837 1838 1839 1840 1841

	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;

	return hde;
}

1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867
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:
1868 1869 1870
 *   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 ':')
1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893
 */
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, ':');
	evlist__for_each(evlist, pos) {
1894
		/* case 2 */
1895 1896
		if (full_name && !strcmp(pos->name, event_name))
			return pos;
1897
		/* case 3 */
1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910
		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;
}

1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926
static int __dynamic_dimension__add(struct perf_evsel *evsel,
				    struct format_field *field,
				    bool raw_trace)
{
	struct hpp_dynamic_entry *hde;

	hde = __alloc_dynamic_entry(evsel, field);
	if (hde == NULL)
		return -ENOMEM;

	hde->raw_trace = raw_trace;

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

1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958
static int add_evsel_fields(struct perf_evsel *evsel, bool raw_trace)
{
	int ret;
	struct format_field *field;

	field = evsel->tp_format->format.fields;
	while (field) {
		ret = __dynamic_dimension__add(evsel, field, raw_trace);
		if (ret < 0)
			return ret;

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

static int add_all_dynamic_fields(struct perf_evlist *evlist, bool raw_trace)
{
	int ret;
	struct perf_evsel *evsel;

	evlist__for_each(evlist, evsel) {
		if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
			continue;

		ret = add_evsel_fields(evsel, raw_trace);
		if (ret < 0)
			return ret;
	}
	return 0;
}

1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980
static int add_all_matching_fields(struct perf_evlist *evlist,
				   char *field_name, bool raw_trace)
{
	int ret = -ESRCH;
	struct perf_evsel *evsel;
	struct format_field *field;

	evlist__for_each(evlist, evsel) {
		if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
			continue;

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

		ret = __dynamic_dimension__add(evsel, field, raw_trace);
		if (ret < 0)
			break;
	}
	return ret;
}

1981 1982
static int add_dynamic_entry(struct perf_evlist *evlist, const char *tok)
{
1983 1984
	char *str, *event_name, *field_name, *opt_name;
	struct perf_evsel *evsel;
1985
	struct format_field *field;
1986
	bool raw_trace = symbol_conf.raw_trace;
1987 1988 1989 1990 1991 1992 1993 1994 1995
	int ret = 0;

	if (evlist == NULL)
		return -ENOENT;

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

1996
	if (parse_field_name(str, &event_name, &field_name, &opt_name) < 0) {
1997 1998 1999 2000
		ret = -EINVAL;
		goto out;
	}

2001 2002 2003
	if (opt_name) {
		if (strcmp(opt_name, "raw")) {
			pr_debug("unsupported field option %s\n", opt_name);
2004 2005 2006 2007 2008 2009
			ret = -EINVAL;
			goto out;
		}
		raw_trace = true;
	}

2010 2011 2012 2013 2014
	if (!strcmp(field_name, "trace_fields")) {
		ret = add_all_dynamic_fields(evlist, raw_trace);
		goto out;
	}

2015 2016 2017 2018 2019
	if (event_name == NULL) {
		ret = add_all_matching_fields(evlist, field_name, raw_trace);
		goto out;
	}

2020
	evsel = find_evsel(evlist, event_name);
2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032
	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;
	}

2033
	if (!strcmp(field_name, "*")) {
2034
		ret = add_evsel_fields(evsel, raw_trace);
2035 2036 2037 2038 2039 2040 2041 2042 2043 2044
	} 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;
		}

		ret = __dynamic_dimension__add(evsel, field, raw_trace);
	}
2045 2046 2047 2048 2049 2050

out:
	free(str);
	return ret;
}

2051
static int __sort_dimension__add(struct sort_dimension *sd)
2052 2053
{
	if (sd->taken)
2054 2055
		return 0;

2056
	if (__sort_dimension__add_hpp_sort(sd) < 0)
2057
		return -1;
2058 2059 2060 2061 2062

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

	sd->taken = 1;
2063 2064

	return 0;
2065 2066
}

2067 2068
static int __hpp_dimension__add(struct hpp_dimension *hd)
{
2069
	struct perf_hpp_fmt *fmt;
2070

2071 2072 2073 2074 2075 2076 2077 2078 2079
	if (hd->taken)
		return 0;

	fmt = __hpp_dimension__alloc_hpp(hd);
	if (!fmt)
		return -1;

	hd->taken = 1;
	perf_hpp__register_sort_field(fmt);
2080 2081 2082
	return 0;
}

2083 2084
static int __sort_dimension__add_output(struct perf_hpp_list *list,
					struct sort_dimension *sd)
2085 2086 2087 2088
{
	if (sd->taken)
		return 0;

2089
	if (__sort_dimension__add_hpp_output(list, sd) < 0)
2090 2091 2092 2093 2094 2095
		return -1;

	sd->taken = 1;
	return 0;
}

2096 2097
static int __hpp_dimension__add_output(struct perf_hpp_list *list,
				       struct hpp_dimension *hd)
2098
{
2099
	struct perf_hpp_fmt *fmt;
2100

2101 2102 2103 2104 2105 2106 2107 2108
	if (hd->taken)
		return 0;

	fmt = __hpp_dimension__alloc_hpp(hd);
	if (!fmt)
		return -1;

	hd->taken = 1;
2109
	perf_hpp_list__column_register(list, fmt);
2110 2111 2112
	return 0;
}

2113 2114 2115
int hpp_dimension__add_output(unsigned col)
{
	BUG_ON(col >= PERF_HPP__MAX_INDEX);
2116
	return __hpp_dimension__add_output(&perf_hpp_list, &hpp_sort_dimensions[col]);
2117 2118
}

2119 2120
static int sort_dimension__add(const char *tok,
			       struct perf_evlist *evlist __maybe_unused)
2121 2122 2123
{
	unsigned int i;

2124 2125
	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
		struct sort_dimension *sd = &common_sort_dimensions[i];
2126 2127 2128

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

2130 2131 2132 2133 2134 2135
		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));
2136 2137
				pr_err("Invalid regex: %s\n%s", parent_pattern, err);
				return -EINVAL;
2138 2139
			}
			sort__has_parent = 1;
2140
		} else if (sd->entry == &sort_sym) {
N
Namhyung Kim 已提交
2141
			sort__has_sym = 1;
2142 2143 2144 2145 2146 2147 2148 2149 2150
			/*
			 * 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 已提交
2151 2152
		} else if (sd->entry == &sort_dso) {
			sort__has_dso = 1;
2153 2154
		} else if (sd->entry == &sort_socket) {
			sort__has_socket = 1;
2155 2156
		} else if (sd->entry == &sort_thread) {
			sort__has_thread = 1;
2157 2158
		}

2159
		return __sort_dimension__add(sd);
2160
	}
2161

2162 2163 2164 2165 2166 2167 2168 2169 2170
	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);
	}

2171 2172 2173 2174 2175 2176
	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;

2177
		if (sort__mode != SORT_MODE__BRANCH)
2178 2179 2180 2181 2182
			return -EINVAL;

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

2183
		__sort_dimension__add(sd);
2184 2185 2186
		return 0;
	}

2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198
	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;

2199
		__sort_dimension__add(sd);
2200 2201 2202
		return 0;
	}

2203 2204 2205
	if (!add_dynamic_entry(evlist, tok))
		return 0;

2206 2207
	return -ESRCH;
}
2208

2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228
static int setup_sort_list(char *str, struct perf_evlist *evlist)
{
	char *tmp, *tok;
	int ret = 0;

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
		ret = sort_dimension__add(tok, evlist);
		if (ret == -EINVAL) {
			error("Invalid --sort key: `%s'", tok);
			break;
		} else if (ret == -ESRCH) {
			error("Unknown --sort key: `%s'", tok);
			break;
		}
	}

	return ret;
}

2229
static const char *get_default_sort_order(struct perf_evlist *evlist)
2230 2231 2232 2233 2234 2235 2236
{
	const char *default_sort_orders[] = {
		default_sort_order,
		default_branch_sort_order,
		default_mem_sort_order,
		default_top_sort_order,
		default_diff_sort_order,
2237
		default_tracepoint_sort_order,
2238
	};
2239 2240
	bool use_trace = true;
	struct perf_evsel *evsel;
2241 2242 2243

	BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders));

2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259
	if (evlist == NULL)
		goto out_no_evlist;

	evlist__for_each(evlist, evsel) {
		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:
2260 2261 2262
	return default_sort_orders[sort__mode];
}

2263
static int setup_sort_order(struct perf_evlist *evlist)
2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283
{
	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",
2284
		     get_default_sort_order(evlist), sort_order + 1) < 0) {
2285 2286 2287 2288 2289 2290 2291 2292
		error("Not enough memory to set up --sort");
		return -ENOMEM;
	}

	sort_order = new_sort_order;
	return 0;
}

2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320
/*
 * 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)
{
	keys = prefix_if_not_in("overhead", keys);

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

	return keys;
}

2321
static int __setup_sorting(struct perf_evlist *evlist)
2322
{
2323
	char *str;
2324
	const char *sort_keys;
2325
	int ret = 0;
2326

2327
	ret = setup_sort_order(evlist);
2328 2329 2330 2331
	if (ret)
		return ret;

	sort_keys = sort_order;
2332
	if (sort_keys == NULL) {
2333
		if (is_strict_order(field_order)) {
2334 2335 2336 2337 2338 2339 2340
			/*
			 * If user specified field order but no sort order,
			 * we'll honor it and not add default sort orders.
			 */
			return 0;
		}

2341
		sort_keys = get_default_sort_order(evlist);
2342
	}
2343 2344

	str = strdup(sort_keys);
2345 2346 2347 2348 2349
	if (str == NULL) {
		error("Not enough memory to setup sort keys");
		return -ENOMEM;
	}

2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360
	/*
	 * Prepend overhead fields for backward compatibility.
	 */
	if (!is_strict_order(field_order)) {
		str = setup_overhead(str);
		if (str == NULL) {
			error("Not enough memory to setup overhead keys");
			return -ENOMEM;
		}
	}

2361
	ret = setup_sort_list(str, evlist);
2362 2363

	free(str);
2364
	return ret;
2365
}
2366

2367
void perf_hpp__set_elide(int idx, bool elide)
2368
{
2369 2370
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
2371

2372
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2373 2374 2375 2376 2377 2378 2379 2380
		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;
		}
2381 2382 2383
	}
}

2384
static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp)
2385 2386 2387 2388 2389
{
	if (list && strlist__nr_entries(list) == 1) {
		if (fp != NULL)
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(list, 0)->s);
2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405
		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;
2406
	}
2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424

	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;
2425
}
2426 2427 2428

void sort__setup_elide(FILE *output)
{
2429 2430
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
2431

2432
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2433 2434 2435 2436 2437
		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);
2438 2439
	}

2440 2441 2442 2443
	/*
	 * It makes no sense to elide all of sort entries.
	 * Just revert them to show up again.
	 */
2444
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2445 2446 2447
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

2448
		if (!fmt->elide)
2449 2450 2451
			return;
	}

2452
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2453 2454 2455
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

2456
		fmt->elide = false;
2457
	}
2458
}
2459

2460
static int output_field_add(struct perf_hpp_list *list, char *tok)
2461 2462 2463 2464 2465 2466 2467 2468 2469
{
	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;

2470
		return __sort_dimension__add_output(list, sd);
2471 2472 2473 2474 2475 2476 2477 2478
	}

	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;

2479
		return __hpp_dimension__add_output(list, hd);
2480 2481 2482 2483 2484 2485 2486 2487
	}

	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;

2488
		return __sort_dimension__add_output(list, sd);
2489 2490 2491 2492 2493 2494 2495 2496
	}

	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;

2497
		return __sort_dimension__add_output(list, sd);
2498 2499 2500 2501 2502
	}

	return -ESRCH;
}

2503
static int setup_output_list(struct perf_hpp_list *list, char *str)
2504 2505 2506 2507 2508 2509
{
	char *tmp, *tok;
	int ret = 0;

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
2510
		ret = output_field_add(list, tok);
2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522
		if (ret == -EINVAL) {
			error("Invalid --fields key: `%s'", tok);
			break;
		} else if (ret == -ESRCH) {
			error("Unknown --fields key: `%s'", tok);
			break;
		}
	}

	return ret;
}

2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539
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;
}

2540 2541 2542 2543 2544
bool is_strict_order(const char *order)
{
	return order && (*order != '+');
}

2545 2546
static int __setup_output_field(void)
{
2547
	char *str, *strp;
2548
	int ret = -EINVAL;
2549 2550 2551 2552

	if (field_order == NULL)
		return 0;

2553
	strp = str = strdup(field_order);
2554 2555 2556 2557 2558
	if (str == NULL) {
		error("Not enough memory to setup output fields");
		return -ENOMEM;
	}

2559 2560 2561 2562 2563 2564 2565 2566
	if (!is_strict_order(field_order))
		strp++;

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

2567
	ret = setup_output_list(&perf_hpp_list, strp);
2568

2569
out:
2570 2571 2572 2573
	free(str);
	return ret;
}

2574
int setup_sorting(struct perf_evlist *evlist)
2575 2576 2577
{
	int err;

2578
	err = __setup_sorting(evlist);
2579 2580 2581 2582
	if (err < 0)
		return err;

	if (parent_pattern != default_parent_pattern) {
2583
		err = sort_dimension__add("parent", evlist);
2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600
		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 */
2601
	perf_hpp__setup_output_field(&perf_hpp_list);
2602
	/* and then copy output fields to sort keys */
2603
	perf_hpp__append_sort_keys(&perf_hpp_list);
2604 2605 2606

	return 0;
}
2607 2608 2609 2610 2611 2612 2613 2614

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

2615 2616 2617
	field_order = NULL;
	sort_order = NULL;

2618
	reset_dimensions();
2619
	perf_hpp__reset_output_field(&perf_hpp_list);
2620
}