sort.c 60.9 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 10

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

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

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

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

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

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

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

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

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

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

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

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

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

/* --sort dso */

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

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

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

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

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

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

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

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

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

	if (sym_l == sym_r)
		return 0;

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

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

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

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

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

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

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

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

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

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

269
	return ret;
270 271
}

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

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

287 288
/* --sort srcline */

289 290 291 292 293 294 295 296 297 298 299
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);
}

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

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 315 316
	if (!he->srcline)
		he->srcline = hist_entry__get_srcline(he);

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

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

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

static char no_srcfile[1];

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

336 337 338
	if (!map)
		return no_srcfile;

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

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

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

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

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

379 380
/* --sort parent */

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

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

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

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

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

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

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

428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448
/* --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 已提交
449 450 451 452 453 454 455 456 457 458 459 460 461 462
/* --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);
463 464 465 466 467 468
	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 已提交
469 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 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512
	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);

	hists__new_col_len(left->hists, HISTC_TRACE, strlen(left->trace_output));
	hists__new_col_len(right->hists, HISTC_TRACE, strlen(right->trace_output));

	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)
		return scnprintf(bf, size, "%-*.*s", width, width, "N/A");

	if (he->trace_output == NULL)
		he->trace_output = get_trace_output(he);
	return repsep_snprintf(bf, size, "%-*.*s", width, width, he->trace_output);
}

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

513 514
/* sort keys for branch stacks */

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

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

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

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

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

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

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;

561 562 563 564 565 566
	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;

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

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

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

	if (!to_l->sym && !to_r->sym)
585
		return _sort__addr_cmp(to_l->addr, to_r->addr);
586

587
	return _sort__sym_cmp(to_l->sym, to_r->sym);
588 589
}

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

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

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

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

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

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

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

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

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

668
	return repsep_snprintf(bf, size, "%-*.*s", width, width, out);
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
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,
};

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

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

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

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

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

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

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

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

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

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

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

813
	return repsep_snprintf(bf, size, "%.*s", width, out);
814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845
}

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

846
static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf,
847 848 849 850 851 852 853 854 855 856
				    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';

857 858
	if (he->mem_info)
		m = he->mem_info->data_src.mem_dtlb;
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

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

923
static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf,
924 925 926 927 928 929 930 931
				    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;

932 933
	if (he->mem_info)
		m  = he->mem_info->data_src.mem_lvl;
934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990

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

991
static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf,
992 993 994 995 996 997 998 999 1000
				    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';

1001 1002
	if (he->mem_info)
		m = he->mem_info->data_src.mem_snoop;
1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020

	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 已提交
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 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 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
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);
}

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

1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136
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);
}

1137
static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf,
1138 1139
				    size_t size, unsigned int width)
{
1140
	return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he));
1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155
}

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

1156
static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf,
1157 1158
					      size_t size, unsigned int width)
{
1159
	return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight);
1160 1161 1162 1163 1164 1165 1166 1167 1168
}

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

1169 1170 1171 1172 1173 1174 1175
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,
};

1176 1177 1178 1179 1180 1181 1182
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,
};

1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217
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 已提交
1218 1219 1220 1221 1222 1223 1224
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,
};

1225 1226 1227
static int64_t
sort__abort_cmp(struct hist_entry *left, struct hist_entry *right)
{
1228 1229 1230
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1231 1232 1233 1234
	return left->branch_info->flags.abort !=
		right->branch_info->flags.abort;
}

1235
static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf,
1236 1237
				    size_t size, unsigned int width)
{
1238 1239 1240 1241 1242 1243 1244 1245
	static const char *out = "N/A";

	if (he->branch_info) {
		if (he->branch_info->flags.abort)
			out = "A";
		else
			out = ".";
	}
1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259

	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)
{
1260 1261 1262
	if (!left->branch_info || !right->branch_info)
		return cmp_null(left->branch_info, right->branch_info);

1263 1264 1265 1266
	return left->branch_info->flags.in_tx !=
		right->branch_info->flags.in_tx;
}

1267
static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf,
1268 1269
				    size_t size, unsigned int width)
{
1270
	static const char *out = "N/A";
1271

1272 1273 1274 1275 1276 1277
	if (he->branch_info) {
		if (he->branch_info->flags.in_tx)
			out = "T";
		else
			out = ".";
	}
1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288

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

1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329
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;
}

1330
static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf,
1331 1332
					    size_t size, unsigned int width)
{
1333
	u64 t = he->transaction;
1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360
	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,
};

1361 1362 1363 1364 1365 1366
struct sort_dimension {
	const char		*name;
	struct sort_entry	*entry;
	int			taken;
};

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

1369
static struct sort_dimension common_sort_dimensions[] = {
1370 1371 1372 1373 1374 1375
	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),
1376
	DIM(SORT_SOCKET, "socket", sort_socket),
1377
	DIM(SORT_SRCLINE, "srcline", sort_srcline),
1378
	DIM(SORT_SRCFILE, "srcfile", sort_srcfile),
1379 1380
	DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight),
	DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight),
1381
	DIM(SORT_TRANSACTION, "transaction", sort_transaction),
N
Namhyung Kim 已提交
1382
	DIM(SORT_TRACE, "trace", sort_trace),
1383 1384
};

1385 1386 1387 1388 1389 1390 1391 1392 1393 1394
#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),
1395 1396
	DIM(SORT_IN_TX, "in_tx", sort_in_tx),
	DIM(SORT_ABORT, "abort", sort_abort),
1397
	DIM(SORT_CYCLES, "cycles", sort_cycles),
1398 1399 1400 1401
};

#undef DIM

1402 1403 1404 1405
#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),
1406
	DIM(SORT_MEM_IADDR_SYMBOL, "symbol_iaddr", sort_mem_iaddr_sym),
1407 1408 1409 1410 1411
	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 已提交
1412
	DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline),
1413 1414 1415 1416
};

#undef DIM

1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430
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"),
1431
	DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"),
1432 1433 1434 1435 1436 1437
	DIM(PERF_HPP__SAMPLES, "sample"),
	DIM(PERF_HPP__PERIOD, "period"),
};

#undef DIM

1438 1439 1440 1441 1442
struct hpp_sort_entry {
	struct perf_hpp_fmt hpp;
	struct sort_entry *se;
};

1443
void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists)
1444 1445 1446 1447 1448 1449 1450
{
	struct hpp_sort_entry *hse;

	if (!perf_hpp__is_sort_entry(fmt))
		return;

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1451
	hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name));
1452 1453
}

1454 1455 1456 1457
static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
			      struct perf_evsel *evsel)
{
	struct hpp_sort_entry *hse;
1458
	size_t len = fmt->user_len;
1459 1460 1461

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

1462
	if (!len)
1463
		len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
1464

1465
	return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name);
1466 1467 1468 1469 1470 1471 1472
}

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;
1473
	size_t len = fmt->user_len;
1474 1475 1476

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

1477
	if (!len)
1478
		len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
1479 1480

	return len;
1481 1482 1483 1484 1485 1486
}

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

	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1490 1491 1492

	if (!len)
		len = hists__col_len(he->hists, hse->se->se_width_idx);
1493 1494 1495 1496

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

1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527
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);
}

1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546
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;
}

1547 1548 1549 1550 1551 1552 1553 1554
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);
}

1555 1556
static struct hpp_sort_entry *
__sort_dimension__alloc_hpp(struct sort_dimension *sd)
1557 1558 1559 1560 1561 1562
{
	struct hpp_sort_entry *hse;

	hse = malloc(sizeof(*hse));
	if (hse == NULL) {
		pr_err("Memory allocation failed\n");
1563
		return NULL;
1564 1565 1566
	}

	hse->se = sd->entry;
1567
	hse->hpp.name = sd->entry->se_header;
1568 1569 1570 1571 1572
	hse->hpp.header = __sort__hpp_header;
	hse->hpp.width = __sort__hpp_width;
	hse->hpp.entry = __sort__hpp_entry;
	hse->hpp.color = NULL;

1573 1574 1575
	hse->hpp.cmp = __sort__hpp_cmp;
	hse->hpp.collapse = __sort__hpp_collapse;
	hse->hpp.sort = __sort__hpp_sort;
1576
	hse->hpp.equal = __sort__hpp_equal;
1577
	hse->hpp.free = hse_free;
1578 1579 1580

	INIT_LIST_HEAD(&hse->hpp.list);
	INIT_LIST_HEAD(&hse->hpp.sort_list);
1581
	hse->hpp.elide = false;
1582
	hse->hpp.len = 0;
1583
	hse->hpp.user_len = 0;
1584

1585 1586 1587
	return hse;
}

1588 1589 1590 1591 1592
static void hpp_free(struct perf_hpp_fmt *fmt)
{
	free(fmt);
}

1593 1594 1595 1596 1597 1598 1599 1600
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);
1601
		fmt->free = hpp_free;
1602 1603 1604 1605 1606
	}

	return fmt;
}

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

1614 1615 1616 1617
	perf_hpp__register_sort_field(&hse->hpp);
	return 0;
}

1618 1619
static int __sort_dimension__add_hpp_output(struct perf_hpp_list *list,
					    struct sort_dimension *sd)
1620 1621 1622 1623 1624 1625
{
	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd);

	if (hse == NULL)
		return -1;

1626
	perf_hpp_list__column_register(list, &hse->hpp);
1627 1628 1629
	return 0;
}

1630 1631 1632 1633 1634
struct hpp_dynamic_entry {
	struct perf_hpp_fmt hpp;
	struct perf_evsel *evsel;
	struct format_field *field;
	unsigned dynamic_len;
1635
	bool raw_trace;
1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659
};

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

1660 1661 1662 1663 1664 1665 1666 1667
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;

1668 1669 1670
	if (hde->raw_trace)
		return;

1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702
	/* 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;
	}
}

1703 1704 1705 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
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;
}

1732 1733 1734 1735 1736 1737 1738 1739 1740
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;
}

1741 1742 1743 1744 1745
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;
1746 1747 1748 1749
	char *str, *pos;
	struct format_field *field;
	size_t namelen;
	bool last = false;
1750 1751 1752 1753 1754 1755 1756
	int ret;

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

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

1757 1758
	if (hde->raw_trace)
		goto raw_field;
1759

1760
	field = hde->field;
1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788
	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;
1789
raw_field:
1790 1791 1792 1793 1794 1795 1796
		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);
1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822
	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;
1823 1824 1825

		update_dynamic_len(hde, a);
		update_dynamic_len(hde, b);
1826 1827 1828 1829 1830
	}

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

1831 1832 1833 1834 1835
bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *fmt)
{
	return fmt->cmp == __sort__hde_cmp;
}

1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849
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;
}

1850 1851 1852 1853 1854 1855 1856 1857
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);
}

1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881
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;
1882
	hde->hpp.equal = __sort__hde_equal;
1883
	hde->hpp.free = hde_free;
1884 1885 1886 1887 1888 1889 1890 1891 1892 1893

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

1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919
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:
1920 1921 1922
 *   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 ':')
1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945
 */
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) {
1946
		/* case 2 */
1947 1948
		if (full_name && !strcmp(pos->name, event_name))
			return pos;
1949
		/* case 3 */
1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962
		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;
}

1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978
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;
}

1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010
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;
}

2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032
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;
}

2033 2034
static int add_dynamic_entry(struct perf_evlist *evlist, const char *tok)
{
2035 2036
	char *str, *event_name, *field_name, *opt_name;
	struct perf_evsel *evsel;
2037
	struct format_field *field;
2038
	bool raw_trace = symbol_conf.raw_trace;
2039 2040 2041 2042 2043 2044 2045 2046 2047
	int ret = 0;

	if (evlist == NULL)
		return -ENOENT;

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

2048
	if (parse_field_name(str, &event_name, &field_name, &opt_name) < 0) {
2049 2050 2051 2052
		ret = -EINVAL;
		goto out;
	}

2053 2054 2055
	if (opt_name) {
		if (strcmp(opt_name, "raw")) {
			pr_debug("unsupported field option %s\n", opt_name);
2056 2057 2058 2059 2060 2061
			ret = -EINVAL;
			goto out;
		}
		raw_trace = true;
	}

2062 2063 2064 2065 2066
	if (!strcmp(field_name, "trace_fields")) {
		ret = add_all_dynamic_fields(evlist, raw_trace);
		goto out;
	}

2067 2068 2069 2070 2071
	if (event_name == NULL) {
		ret = add_all_matching_fields(evlist, field_name, raw_trace);
		goto out;
	}

2072
	evsel = find_evsel(evlist, event_name);
2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084
	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;
	}

2085
	if (!strcmp(field_name, "*")) {
2086
		ret = add_evsel_fields(evsel, raw_trace);
2087 2088 2089 2090 2091 2092 2093 2094 2095 2096
	} 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);
	}
2097 2098 2099 2100 2101 2102

out:
	free(str);
	return ret;
}

2103
static int __sort_dimension__add(struct sort_dimension *sd)
2104 2105
{
	if (sd->taken)
2106 2107
		return 0;

2108
	if (__sort_dimension__add_hpp_sort(sd) < 0)
2109
		return -1;
2110 2111 2112 2113 2114

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

	sd->taken = 1;
2115 2116

	return 0;
2117 2118
}

2119 2120
static int __hpp_dimension__add(struct hpp_dimension *hd)
{
2121
	struct perf_hpp_fmt *fmt;
2122

2123 2124 2125 2126 2127 2128 2129 2130 2131
	if (hd->taken)
		return 0;

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

	hd->taken = 1;
	perf_hpp__register_sort_field(fmt);
2132 2133 2134
	return 0;
}

2135 2136
static int __sort_dimension__add_output(struct perf_hpp_list *list,
					struct sort_dimension *sd)
2137 2138 2139 2140
{
	if (sd->taken)
		return 0;

2141
	if (__sort_dimension__add_hpp_output(list, sd) < 0)
2142 2143 2144 2145 2146 2147
		return -1;

	sd->taken = 1;
	return 0;
}

2148 2149
static int __hpp_dimension__add_output(struct perf_hpp_list *list,
				       struct hpp_dimension *hd)
2150
{
2151
	struct perf_hpp_fmt *fmt;
2152

2153 2154 2155 2156 2157 2158 2159 2160
	if (hd->taken)
		return 0;

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

	hd->taken = 1;
2161
	perf_hpp_list__column_register(list, fmt);
2162 2163 2164
	return 0;
}

2165 2166 2167
int hpp_dimension__add_output(unsigned col)
{
	BUG_ON(col >= PERF_HPP__MAX_INDEX);
2168
	return __hpp_dimension__add_output(&perf_hpp_list, &hpp_sort_dimensions[col]);
2169 2170
}

2171 2172
static int sort_dimension__add(const char *tok,
			       struct perf_evlist *evlist __maybe_unused)
2173 2174 2175
{
	unsigned int i;

2176 2177
	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
		struct sort_dimension *sd = &common_sort_dimensions[i];
2178 2179 2180

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

2182 2183 2184 2185 2186 2187
		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));
2188 2189
				pr_err("Invalid regex: %s\n%s", parent_pattern, err);
				return -EINVAL;
2190 2191
			}
			sort__has_parent = 1;
2192
		} else if (sd->entry == &sort_sym) {
N
Namhyung Kim 已提交
2193
			sort__has_sym = 1;
2194 2195 2196 2197 2198 2199 2200 2201 2202
			/*
			 * 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 已提交
2203 2204
		} else if (sd->entry == &sort_dso) {
			sort__has_dso = 1;
2205 2206
		} else if (sd->entry == &sort_socket) {
			sort__has_socket = 1;
2207 2208
		} else if (sd->entry == &sort_thread) {
			sort__has_thread = 1;
2209 2210
		}

2211
		return __sort_dimension__add(sd);
2212
	}
2213

2214 2215 2216 2217 2218 2219 2220 2221 2222
	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);
	}

2223 2224 2225 2226 2227 2228
	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;

2229
		if (sort__mode != SORT_MODE__BRANCH)
2230 2231 2232 2233 2234
			return -EINVAL;

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

2235
		__sort_dimension__add(sd);
2236 2237 2238
		return 0;
	}

2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250
	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;

2251
		__sort_dimension__add(sd);
2252 2253 2254
		return 0;
	}

2255 2256 2257
	if (!add_dynamic_entry(evlist, tok))
		return 0;

2258 2259
	return -ESRCH;
}
2260

2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280
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;
}

2281
static const char *get_default_sort_order(struct perf_evlist *evlist)
2282 2283 2284 2285 2286 2287 2288
{
	const char *default_sort_orders[] = {
		default_sort_order,
		default_branch_sort_order,
		default_mem_sort_order,
		default_top_sort_order,
		default_diff_sort_order,
2289
		default_tracepoint_sort_order,
2290
	};
2291 2292
	bool use_trace = true;
	struct perf_evsel *evsel;
2293 2294 2295

	BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders));

2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311
	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:
2312 2313 2314
	return default_sort_orders[sort__mode];
}

2315
static int setup_sort_order(struct perf_evlist *evlist)
2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335
{
	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",
2336
		     get_default_sort_order(evlist), sort_order + 1) < 0) {
2337 2338 2339 2340 2341 2342 2343 2344
		error("Not enough memory to set up --sort");
		return -ENOMEM;
	}

	sort_order = new_sort_order;
	return 0;
}

2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372
/*
 * 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;
}

2373
static int __setup_sorting(struct perf_evlist *evlist)
2374
{
2375
	char *str;
2376
	const char *sort_keys;
2377
	int ret = 0;
2378

2379
	ret = setup_sort_order(evlist);
2380 2381 2382 2383
	if (ret)
		return ret;

	sort_keys = sort_order;
2384
	if (sort_keys == NULL) {
2385
		if (is_strict_order(field_order)) {
2386 2387 2388 2389 2390 2391 2392
			/*
			 * If user specified field order but no sort order,
			 * we'll honor it and not add default sort orders.
			 */
			return 0;
		}

2393
		sort_keys = get_default_sort_order(evlist);
2394
	}
2395 2396

	str = strdup(sort_keys);
2397 2398 2399 2400 2401
	if (str == NULL) {
		error("Not enough memory to setup sort keys");
		return -ENOMEM;
	}

2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412
	/*
	 * 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;
		}
	}

2413
	ret = setup_sort_list(str, evlist);
2414 2415

	free(str);
2416
	return ret;
2417
}
2418

2419
void perf_hpp__set_elide(int idx, bool elide)
2420
{
2421 2422
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
2423

2424
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2425 2426 2427 2428 2429 2430 2431 2432
		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;
		}
2433 2434 2435
	}
}

2436
static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp)
2437 2438 2439 2440 2441
{
	if (list && strlist__nr_entries(list) == 1) {
		if (fp != NULL)
			fprintf(fp, "# %s: %s\n", list_name,
				strlist__entry(list, 0)->s);
2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457
		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;
2458
	}
2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476

	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;
2477
}
2478 2479 2480

void sort__setup_elide(FILE *output)
{
2481 2482
	struct perf_hpp_fmt *fmt;
	struct hpp_sort_entry *hse;
2483

2484
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2485 2486 2487 2488 2489
		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);
2490 2491
	}

2492 2493 2494 2495
	/*
	 * It makes no sense to elide all of sort entries.
	 * Just revert them to show up again.
	 */
2496
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2497 2498 2499
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

2500
		if (!fmt->elide)
2501 2502 2503
			return;
	}

2504
	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2505 2506 2507
		if (!perf_hpp__is_sort_entry(fmt))
			continue;

2508
		fmt->elide = false;
2509
	}
2510
}
2511

2512
static int output_field_add(struct perf_hpp_list *list, char *tok)
2513 2514 2515 2516 2517 2518 2519 2520 2521
{
	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;

2522
		return __sort_dimension__add_output(list, sd);
2523 2524 2525 2526 2527 2528 2529 2530
	}

	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;

2531
		return __hpp_dimension__add_output(list, hd);
2532 2533 2534 2535 2536 2537 2538 2539
	}

	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;

2540
		return __sort_dimension__add_output(list, sd);
2541 2542 2543 2544 2545 2546 2547 2548
	}

	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;

2549
		return __sort_dimension__add_output(list, sd);
2550 2551 2552 2553 2554
	}

	return -ESRCH;
}

2555
static int setup_output_list(struct perf_hpp_list *list, char *str)
2556 2557 2558 2559 2560 2561
{
	char *tmp, *tok;
	int ret = 0;

	for (tok = strtok_r(str, ", ", &tmp);
			tok; tok = strtok_r(NULL, ", ", &tmp)) {
2562
		ret = output_field_add(list, tok);
2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574
		if (ret == -EINVAL) {
			error("Invalid --fields key: `%s'", tok);
			break;
		} else if (ret == -ESRCH) {
			error("Unknown --fields key: `%s'", tok);
			break;
		}
	}

	return ret;
}

2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591
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;
}

2592 2593 2594 2595 2596
bool is_strict_order(const char *order)
{
	return order && (*order != '+');
}

2597 2598
static int __setup_output_field(void)
{
2599
	char *str, *strp;
2600
	int ret = -EINVAL;
2601 2602 2603 2604

	if (field_order == NULL)
		return 0;

2605
	strp = str = strdup(field_order);
2606 2607 2608 2609 2610
	if (str == NULL) {
		error("Not enough memory to setup output fields");
		return -ENOMEM;
	}

2611 2612 2613 2614 2615 2616 2617 2618
	if (!is_strict_order(field_order))
		strp++;

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

2619
	ret = setup_output_list(&perf_hpp_list, strp);
2620

2621
out:
2622 2623 2624 2625
	free(str);
	return ret;
}

2626
int setup_sorting(struct perf_evlist *evlist)
2627 2628 2629
{
	int err;

2630
	err = __setup_sorting(evlist);
2631 2632 2633 2634
	if (err < 0)
		return err;

	if (parent_pattern != default_parent_pattern) {
2635
		err = sort_dimension__add("parent", evlist);
2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652
		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 */
2653
	perf_hpp__setup_output_field(&perf_hpp_list);
2654
	/* and then copy output fields to sort keys */
2655
	perf_hpp__append_sort_keys(&perf_hpp_list);
2656 2657 2658

	return 0;
}
2659 2660 2661 2662 2663 2664 2665 2666

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

2667 2668 2669
	field_order = NULL;
	sort_order = NULL;

2670
	reset_dimensions();
2671
	perf_hpp__reset_output_field(&perf_hpp_list);
2672
}