xref: /openbmc/linux/tools/perf/util/sort.c (revision b240b419db5d624ce7a5a397d6f62a1a686009ec)
1 // SPDX-License-Identifier: GPL-2.0
2 #include <errno.h>
3 #include <inttypes.h>
4 #include <regex.h>
5 #include <sys/mman.h>
6 #include "sort.h"
7 #include "hist.h"
8 #include "comm.h"
9 #include "symbol.h"
10 #include "thread.h"
11 #include "evsel.h"
12 #include "evlist.h"
13 #include "strlist.h"
14 #include <traceevent/event-parse.h>
15 #include "mem-events.h"
16 #include <linux/kernel.h>
17 
18 regex_t		parent_regex;
19 const char	default_parent_pattern[] = "^sys_|^do_page_fault";
20 const char	*parent_pattern = default_parent_pattern;
21 const char	*default_sort_order = "comm,dso,symbol";
22 const char	default_branch_sort_order[] = "comm,dso_from,symbol_from,symbol_to,cycles";
23 const char	default_mem_sort_order[] = "local_weight,mem,sym,dso,symbol_daddr,dso_daddr,snoop,tlb,locked";
24 const char	default_top_sort_order[] = "dso,symbol";
25 const char	default_diff_sort_order[] = "dso,symbol";
26 const char	default_tracepoint_sort_order[] = "trace";
27 const char	*sort_order;
28 const char	*field_order;
29 regex_t		ignore_callees_regex;
30 int		have_ignore_callees = 0;
31 enum sort_mode	sort__mode = SORT_MODE__NORMAL;
32 
33 /*
34  * Replaces all occurrences of a char used with the:
35  *
36  * -t, --field-separator
37  *
38  * option, that uses a special separator character and don't pad with spaces,
39  * replacing all occurances of this separator in symbol names (and other
40  * output) with a '.' character, that thus it's the only non valid separator.
41 */
42 static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
43 {
44 	int n;
45 	va_list ap;
46 
47 	va_start(ap, fmt);
48 	n = vsnprintf(bf, size, fmt, ap);
49 	if (symbol_conf.field_sep && n > 0) {
50 		char *sep = bf;
51 
52 		while (1) {
53 			sep = strchr(sep, *symbol_conf.field_sep);
54 			if (sep == NULL)
55 				break;
56 			*sep = '.';
57 		}
58 	}
59 	va_end(ap);
60 
61 	if (n >= (int)size)
62 		return size - 1;
63 	return n;
64 }
65 
66 static int64_t cmp_null(const void *l, const void *r)
67 {
68 	if (!l && !r)
69 		return 0;
70 	else if (!l)
71 		return -1;
72 	else
73 		return 1;
74 }
75 
76 /* --sort pid */
77 
78 static int64_t
79 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
80 {
81 	return right->thread->tid - left->thread->tid;
82 }
83 
84 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf,
85 				       size_t size, unsigned int width)
86 {
87 	const char *comm = thread__comm_str(he->thread);
88 
89 	width = max(7U, width) - 8;
90 	return repsep_snprintf(bf, size, "%7d:%-*.*s", he->thread->tid,
91 			       width, width, comm ?: "");
92 }
93 
94 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg)
95 {
96 	const struct thread *th = arg;
97 
98 	if (type != HIST_FILTER__THREAD)
99 		return -1;
100 
101 	return th && he->thread != th;
102 }
103 
104 struct sort_entry sort_thread = {
105 	.se_header	= "    Pid:Command",
106 	.se_cmp		= sort__thread_cmp,
107 	.se_snprintf	= hist_entry__thread_snprintf,
108 	.se_filter	= hist_entry__thread_filter,
109 	.se_width_idx	= HISTC_THREAD,
110 };
111 
112 /* --sort comm */
113 
114 /*
115  * We can't use pointer comparison in functions below,
116  * because it gives different results based on pointer
117  * values, which could break some sorting assumptions.
118  */
119 static int64_t
120 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
121 {
122 	return strcmp(comm__str(right->comm), comm__str(left->comm));
123 }
124 
125 static int64_t
126 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
127 {
128 	return strcmp(comm__str(right->comm), comm__str(left->comm));
129 }
130 
131 static int64_t
132 sort__comm_sort(struct hist_entry *left, struct hist_entry *right)
133 {
134 	return strcmp(comm__str(right->comm), comm__str(left->comm));
135 }
136 
137 static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf,
138 				     size_t size, unsigned int width)
139 {
140 	return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm));
141 }
142 
143 struct sort_entry sort_comm = {
144 	.se_header	= "Command",
145 	.se_cmp		= sort__comm_cmp,
146 	.se_collapse	= sort__comm_collapse,
147 	.se_sort	= sort__comm_sort,
148 	.se_snprintf	= hist_entry__comm_snprintf,
149 	.se_filter	= hist_entry__thread_filter,
150 	.se_width_idx	= HISTC_COMM,
151 };
152 
153 /* --sort dso */
154 
155 static int64_t _sort__dso_cmp(struct map *map_l, struct map *map_r)
156 {
157 	struct dso *dso_l = map_l ? map_l->dso : NULL;
158 	struct dso *dso_r = map_r ? map_r->dso : NULL;
159 	const char *dso_name_l, *dso_name_r;
160 
161 	if (!dso_l || !dso_r)
162 		return cmp_null(dso_r, dso_l);
163 
164 	if (verbose > 0) {
165 		dso_name_l = dso_l->long_name;
166 		dso_name_r = dso_r->long_name;
167 	} else {
168 		dso_name_l = dso_l->short_name;
169 		dso_name_r = dso_r->short_name;
170 	}
171 
172 	return strcmp(dso_name_l, dso_name_r);
173 }
174 
175 static int64_t
176 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
177 {
178 	return _sort__dso_cmp(right->ms.map, left->ms.map);
179 }
180 
181 static int _hist_entry__dso_snprintf(struct map *map, char *bf,
182 				     size_t size, unsigned int width)
183 {
184 	if (map && map->dso) {
185 		const char *dso_name = verbose > 0 ? map->dso->long_name :
186 			map->dso->short_name;
187 		return repsep_snprintf(bf, size, "%-*.*s", width, width, dso_name);
188 	}
189 
190 	return repsep_snprintf(bf, size, "%-*.*s", width, width, "[unknown]");
191 }
192 
193 static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf,
194 				    size_t size, unsigned int width)
195 {
196 	return _hist_entry__dso_snprintf(he->ms.map, bf, size, width);
197 }
198 
199 static int hist_entry__dso_filter(struct hist_entry *he, int type, const void *arg)
200 {
201 	const struct dso *dso = arg;
202 
203 	if (type != HIST_FILTER__DSO)
204 		return -1;
205 
206 	return dso && (!he->ms.map || he->ms.map->dso != dso);
207 }
208 
209 struct sort_entry sort_dso = {
210 	.se_header	= "Shared Object",
211 	.se_cmp		= sort__dso_cmp,
212 	.se_snprintf	= hist_entry__dso_snprintf,
213 	.se_filter	= hist_entry__dso_filter,
214 	.se_width_idx	= HISTC_DSO,
215 };
216 
217 /* --sort symbol */
218 
219 static int64_t _sort__addr_cmp(u64 left_ip, u64 right_ip)
220 {
221 	return (int64_t)(right_ip - left_ip);
222 }
223 
224 static int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r)
225 {
226 	if (!sym_l || !sym_r)
227 		return cmp_null(sym_l, sym_r);
228 
229 	if (sym_l == sym_r)
230 		return 0;
231 
232 	if (sym_l->inlined || sym_r->inlined)
233 		return strcmp(sym_l->name, sym_r->name);
234 
235 	if (sym_l->start != sym_r->start)
236 		return (int64_t)(sym_r->start - sym_l->start);
237 
238 	return (int64_t)(sym_r->end - sym_l->end);
239 }
240 
241 static int64_t
242 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
243 {
244 	int64_t ret;
245 
246 	if (!left->ms.sym && !right->ms.sym)
247 		return _sort__addr_cmp(left->ip, right->ip);
248 
249 	/*
250 	 * comparing symbol address alone is not enough since it's a
251 	 * relative address within a dso.
252 	 */
253 	if (!hists__has(left->hists, dso) || hists__has(right->hists, dso)) {
254 		ret = sort__dso_cmp(left, right);
255 		if (ret != 0)
256 			return ret;
257 	}
258 
259 	return _sort__sym_cmp(left->ms.sym, right->ms.sym);
260 }
261 
262 static int64_t
263 sort__sym_sort(struct hist_entry *left, struct hist_entry *right)
264 {
265 	if (!left->ms.sym || !right->ms.sym)
266 		return cmp_null(left->ms.sym, right->ms.sym);
267 
268 	return strcmp(right->ms.sym->name, left->ms.sym->name);
269 }
270 
271 static int _hist_entry__sym_snprintf(struct map *map, struct symbol *sym,
272 				     u64 ip, char level, char *bf, size_t size,
273 				     unsigned int width)
274 {
275 	size_t ret = 0;
276 
277 	if (verbose > 0) {
278 		char o = map ? dso__symtab_origin(map->dso) : '!';
279 		ret += repsep_snprintf(bf, size, "%-#*llx %c ",
280 				       BITS_PER_LONG / 4 + 2, ip, o);
281 	}
282 
283 	ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level);
284 	if (sym && map) {
285 		if (map->type == MAP__VARIABLE) {
286 			ret += repsep_snprintf(bf + ret, size - ret, "%s", sym->name);
287 			ret += repsep_snprintf(bf + ret, size - ret, "+0x%llx",
288 					ip - map->unmap_ip(map, sym->start));
289 		} else {
290 			ret += repsep_snprintf(bf + ret, size - ret, "%.*s",
291 					       width - ret,
292 					       sym->name);
293 			if (sym->inlined)
294 				ret += repsep_snprintf(bf + ret, size - ret,
295 						       " (inlined)");
296 		}
297 	} else {
298 		size_t len = BITS_PER_LONG / 4;
299 		ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx",
300 				       len, ip);
301 	}
302 
303 	return ret;
304 }
305 
306 static int hist_entry__sym_snprintf(struct hist_entry *he, char *bf,
307 				    size_t size, unsigned int width)
308 {
309 	return _hist_entry__sym_snprintf(he->ms.map, he->ms.sym, he->ip,
310 					 he->level, bf, size, width);
311 }
312 
313 static int hist_entry__sym_filter(struct hist_entry *he, int type, const void *arg)
314 {
315 	const char *sym = arg;
316 
317 	if (type != HIST_FILTER__SYMBOL)
318 		return -1;
319 
320 	return sym && (!he->ms.sym || !strstr(he->ms.sym->name, sym));
321 }
322 
323 struct sort_entry sort_sym = {
324 	.se_header	= "Symbol",
325 	.se_cmp		= sort__sym_cmp,
326 	.se_sort	= sort__sym_sort,
327 	.se_snprintf	= hist_entry__sym_snprintf,
328 	.se_filter	= hist_entry__sym_filter,
329 	.se_width_idx	= HISTC_SYMBOL,
330 };
331 
332 /* --sort srcline */
333 
334 char *hist_entry__get_srcline(struct hist_entry *he)
335 {
336 	struct map *map = he->ms.map;
337 
338 	if (!map)
339 		return SRCLINE_UNKNOWN;
340 
341 	return get_srcline(map->dso, map__rip_2objdump(map, he->ip),
342 			   he->ms.sym, true, true, he->ip);
343 }
344 
345 static int64_t
346 sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right)
347 {
348 	if (!left->srcline)
349 		left->srcline = hist_entry__get_srcline(left);
350 	if (!right->srcline)
351 		right->srcline = hist_entry__get_srcline(right);
352 
353 	return strcmp(right->srcline, left->srcline);
354 }
355 
356 static int hist_entry__srcline_snprintf(struct hist_entry *he, char *bf,
357 					size_t size, unsigned int width)
358 {
359 	if (!he->srcline)
360 		he->srcline = hist_entry__get_srcline(he);
361 
362 	return repsep_snprintf(bf, size, "%-.*s", width, he->srcline);
363 }
364 
365 struct sort_entry sort_srcline = {
366 	.se_header	= "Source:Line",
367 	.se_cmp		= sort__srcline_cmp,
368 	.se_snprintf	= hist_entry__srcline_snprintf,
369 	.se_width_idx	= HISTC_SRCLINE,
370 };
371 
372 /* --sort srcline_from */
373 
374 static int64_t
375 sort__srcline_from_cmp(struct hist_entry *left, struct hist_entry *right)
376 {
377 	if (!left->branch_info->srcline_from) {
378 		struct map *map = left->branch_info->from.map;
379 		if (!map)
380 			left->branch_info->srcline_from = SRCLINE_UNKNOWN;
381 		else
382 			left->branch_info->srcline_from = get_srcline(map->dso,
383 					   map__rip_2objdump(map,
384 							     left->branch_info->from.al_addr),
385 							 left->branch_info->from.sym,
386 							 true, true,
387 							 left->branch_info->from.al_addr);
388 	}
389 	if (!right->branch_info->srcline_from) {
390 		struct map *map = right->branch_info->from.map;
391 		if (!map)
392 			right->branch_info->srcline_from = SRCLINE_UNKNOWN;
393 		else
394 			right->branch_info->srcline_from = get_srcline(map->dso,
395 					     map__rip_2objdump(map,
396 							       right->branch_info->from.al_addr),
397 						     right->branch_info->from.sym,
398 						     true, true,
399 						     right->branch_info->from.al_addr);
400 	}
401 	return strcmp(right->branch_info->srcline_from, left->branch_info->srcline_from);
402 }
403 
404 static int hist_entry__srcline_from_snprintf(struct hist_entry *he, char *bf,
405 					size_t size, unsigned int width)
406 {
407 	return repsep_snprintf(bf, size, "%-*.*s", width, width, he->branch_info->srcline_from);
408 }
409 
410 struct sort_entry sort_srcline_from = {
411 	.se_header	= "From Source:Line",
412 	.se_cmp		= sort__srcline_from_cmp,
413 	.se_snprintf	= hist_entry__srcline_from_snprintf,
414 	.se_width_idx	= HISTC_SRCLINE_FROM,
415 };
416 
417 /* --sort srcline_to */
418 
419 static int64_t
420 sort__srcline_to_cmp(struct hist_entry *left, struct hist_entry *right)
421 {
422 	if (!left->branch_info->srcline_to) {
423 		struct map *map = left->branch_info->to.map;
424 		if (!map)
425 			left->branch_info->srcline_to = SRCLINE_UNKNOWN;
426 		else
427 			left->branch_info->srcline_to = get_srcline(map->dso,
428 					   map__rip_2objdump(map,
429 							     left->branch_info->to.al_addr),
430 							 left->branch_info->from.sym,
431 							 true, true,
432 							 left->branch_info->to.al_addr);
433 	}
434 	if (!right->branch_info->srcline_to) {
435 		struct map *map = right->branch_info->to.map;
436 		if (!map)
437 			right->branch_info->srcline_to = SRCLINE_UNKNOWN;
438 		else
439 			right->branch_info->srcline_to = get_srcline(map->dso,
440 					     map__rip_2objdump(map,
441 							       right->branch_info->to.al_addr),
442 						     right->branch_info->to.sym,
443 						     true, true,
444 						     right->branch_info->to.al_addr);
445 	}
446 	return strcmp(right->branch_info->srcline_to, left->branch_info->srcline_to);
447 }
448 
449 static int hist_entry__srcline_to_snprintf(struct hist_entry *he, char *bf,
450 					size_t size, unsigned int width)
451 {
452 	return repsep_snprintf(bf, size, "%-*.*s", width, width, he->branch_info->srcline_to);
453 }
454 
455 struct sort_entry sort_srcline_to = {
456 	.se_header	= "To Source:Line",
457 	.se_cmp		= sort__srcline_to_cmp,
458 	.se_snprintf	= hist_entry__srcline_to_snprintf,
459 	.se_width_idx	= HISTC_SRCLINE_TO,
460 };
461 
462 /* --sort srcfile */
463 
464 static char no_srcfile[1];
465 
466 static char *hist_entry__get_srcfile(struct hist_entry *e)
467 {
468 	char *sf, *p;
469 	struct map *map = e->ms.map;
470 
471 	if (!map)
472 		return no_srcfile;
473 
474 	sf = __get_srcline(map->dso, map__rip_2objdump(map, e->ip),
475 			 e->ms.sym, false, true, true, e->ip);
476 	if (!strcmp(sf, SRCLINE_UNKNOWN))
477 		return no_srcfile;
478 	p = strchr(sf, ':');
479 	if (p && *sf) {
480 		*p = 0;
481 		return sf;
482 	}
483 	free(sf);
484 	return no_srcfile;
485 }
486 
487 static int64_t
488 sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right)
489 {
490 	if (!left->srcfile)
491 		left->srcfile = hist_entry__get_srcfile(left);
492 	if (!right->srcfile)
493 		right->srcfile = hist_entry__get_srcfile(right);
494 
495 	return strcmp(right->srcfile, left->srcfile);
496 }
497 
498 static int hist_entry__srcfile_snprintf(struct hist_entry *he, char *bf,
499 					size_t size, unsigned int width)
500 {
501 	if (!he->srcfile)
502 		he->srcfile = hist_entry__get_srcfile(he);
503 
504 	return repsep_snprintf(bf, size, "%-.*s", width, he->srcfile);
505 }
506 
507 struct sort_entry sort_srcfile = {
508 	.se_header	= "Source File",
509 	.se_cmp		= sort__srcfile_cmp,
510 	.se_snprintf	= hist_entry__srcfile_snprintf,
511 	.se_width_idx	= HISTC_SRCFILE,
512 };
513 
514 /* --sort parent */
515 
516 static int64_t
517 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
518 {
519 	struct symbol *sym_l = left->parent;
520 	struct symbol *sym_r = right->parent;
521 
522 	if (!sym_l || !sym_r)
523 		return cmp_null(sym_l, sym_r);
524 
525 	return strcmp(sym_r->name, sym_l->name);
526 }
527 
528 static int hist_entry__parent_snprintf(struct hist_entry *he, char *bf,
529 				       size_t size, unsigned int width)
530 {
531 	return repsep_snprintf(bf, size, "%-*.*s", width, width,
532 			      he->parent ? he->parent->name : "[other]");
533 }
534 
535 struct sort_entry sort_parent = {
536 	.se_header	= "Parent symbol",
537 	.se_cmp		= sort__parent_cmp,
538 	.se_snprintf	= hist_entry__parent_snprintf,
539 	.se_width_idx	= HISTC_PARENT,
540 };
541 
542 /* --sort cpu */
543 
544 static int64_t
545 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
546 {
547 	return right->cpu - left->cpu;
548 }
549 
550 static int hist_entry__cpu_snprintf(struct hist_entry *he, char *bf,
551 				    size_t size, unsigned int width)
552 {
553 	return repsep_snprintf(bf, size, "%*.*d", width, width, he->cpu);
554 }
555 
556 struct sort_entry sort_cpu = {
557 	.se_header      = "CPU",
558 	.se_cmp	        = sort__cpu_cmp,
559 	.se_snprintf    = hist_entry__cpu_snprintf,
560 	.se_width_idx	= HISTC_CPU,
561 };
562 
563 /* --sort cgroup_id */
564 
565 static int64_t _sort__cgroup_dev_cmp(u64 left_dev, u64 right_dev)
566 {
567 	return (int64_t)(right_dev - left_dev);
568 }
569 
570 static int64_t _sort__cgroup_inode_cmp(u64 left_ino, u64 right_ino)
571 {
572 	return (int64_t)(right_ino - left_ino);
573 }
574 
575 static int64_t
576 sort__cgroup_id_cmp(struct hist_entry *left, struct hist_entry *right)
577 {
578 	int64_t ret;
579 
580 	ret = _sort__cgroup_dev_cmp(right->cgroup_id.dev, left->cgroup_id.dev);
581 	if (ret != 0)
582 		return ret;
583 
584 	return _sort__cgroup_inode_cmp(right->cgroup_id.ino,
585 				       left->cgroup_id.ino);
586 }
587 
588 static int hist_entry__cgroup_id_snprintf(struct hist_entry *he,
589 					  char *bf, size_t size,
590 					  unsigned int width __maybe_unused)
591 {
592 	return repsep_snprintf(bf, size, "%lu/0x%lx", he->cgroup_id.dev,
593 			       he->cgroup_id.ino);
594 }
595 
596 struct sort_entry sort_cgroup_id = {
597 	.se_header      = "cgroup id (dev/inode)",
598 	.se_cmp	        = sort__cgroup_id_cmp,
599 	.se_snprintf    = hist_entry__cgroup_id_snprintf,
600 	.se_width_idx	= HISTC_CGROUP_ID,
601 };
602 
603 /* --sort socket */
604 
605 static int64_t
606 sort__socket_cmp(struct hist_entry *left, struct hist_entry *right)
607 {
608 	return right->socket - left->socket;
609 }
610 
611 static int hist_entry__socket_snprintf(struct hist_entry *he, char *bf,
612 				    size_t size, unsigned int width)
613 {
614 	return repsep_snprintf(bf, size, "%*.*d", width, width-3, he->socket);
615 }
616 
617 static int hist_entry__socket_filter(struct hist_entry *he, int type, const void *arg)
618 {
619 	int sk = *(const int *)arg;
620 
621 	if (type != HIST_FILTER__SOCKET)
622 		return -1;
623 
624 	return sk >= 0 && he->socket != sk;
625 }
626 
627 struct sort_entry sort_socket = {
628 	.se_header      = "Socket",
629 	.se_cmp	        = sort__socket_cmp,
630 	.se_snprintf    = hist_entry__socket_snprintf,
631 	.se_filter      = hist_entry__socket_filter,
632 	.se_width_idx	= HISTC_SOCKET,
633 };
634 
635 /* --sort trace */
636 
637 static char *get_trace_output(struct hist_entry *he)
638 {
639 	struct trace_seq seq;
640 	struct perf_evsel *evsel;
641 	struct pevent_record rec = {
642 		.data = he->raw_data,
643 		.size = he->raw_size,
644 	};
645 
646 	evsel = hists_to_evsel(he->hists);
647 
648 	trace_seq_init(&seq);
649 	if (symbol_conf.raw_trace) {
650 		pevent_print_fields(&seq, he->raw_data, he->raw_size,
651 				    evsel->tp_format);
652 	} else {
653 		pevent_event_info(&seq, evsel->tp_format, &rec);
654 	}
655 	/*
656 	 * Trim the buffer, it starts at 4KB and we're not going to
657 	 * add anything more to this buffer.
658 	 */
659 	return realloc(seq.buffer, seq.len + 1);
660 }
661 
662 static int64_t
663 sort__trace_cmp(struct hist_entry *left, struct hist_entry *right)
664 {
665 	struct perf_evsel *evsel;
666 
667 	evsel = hists_to_evsel(left->hists);
668 	if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
669 		return 0;
670 
671 	if (left->trace_output == NULL)
672 		left->trace_output = get_trace_output(left);
673 	if (right->trace_output == NULL)
674 		right->trace_output = get_trace_output(right);
675 
676 	return strcmp(right->trace_output, left->trace_output);
677 }
678 
679 static int hist_entry__trace_snprintf(struct hist_entry *he, char *bf,
680 				    size_t size, unsigned int width)
681 {
682 	struct perf_evsel *evsel;
683 
684 	evsel = hists_to_evsel(he->hists);
685 	if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
686 		return scnprintf(bf, size, "%-.*s", width, "N/A");
687 
688 	if (he->trace_output == NULL)
689 		he->trace_output = get_trace_output(he);
690 	return repsep_snprintf(bf, size, "%-.*s", width, he->trace_output);
691 }
692 
693 struct sort_entry sort_trace = {
694 	.se_header      = "Trace output",
695 	.se_cmp	        = sort__trace_cmp,
696 	.se_snprintf    = hist_entry__trace_snprintf,
697 	.se_width_idx	= HISTC_TRACE,
698 };
699 
700 /* sort keys for branch stacks */
701 
702 static int64_t
703 sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right)
704 {
705 	if (!left->branch_info || !right->branch_info)
706 		return cmp_null(left->branch_info, right->branch_info);
707 
708 	return _sort__dso_cmp(left->branch_info->from.map,
709 			      right->branch_info->from.map);
710 }
711 
712 static int hist_entry__dso_from_snprintf(struct hist_entry *he, char *bf,
713 				    size_t size, unsigned int width)
714 {
715 	if (he->branch_info)
716 		return _hist_entry__dso_snprintf(he->branch_info->from.map,
717 						 bf, size, width);
718 	else
719 		return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
720 }
721 
722 static int hist_entry__dso_from_filter(struct hist_entry *he, int type,
723 				       const void *arg)
724 {
725 	const struct dso *dso = arg;
726 
727 	if (type != HIST_FILTER__DSO)
728 		return -1;
729 
730 	return dso && (!he->branch_info || !he->branch_info->from.map ||
731 		       he->branch_info->from.map->dso != dso);
732 }
733 
734 static int64_t
735 sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right)
736 {
737 	if (!left->branch_info || !right->branch_info)
738 		return cmp_null(left->branch_info, right->branch_info);
739 
740 	return _sort__dso_cmp(left->branch_info->to.map,
741 			      right->branch_info->to.map);
742 }
743 
744 static int hist_entry__dso_to_snprintf(struct hist_entry *he, char *bf,
745 				       size_t size, unsigned int width)
746 {
747 	if (he->branch_info)
748 		return _hist_entry__dso_snprintf(he->branch_info->to.map,
749 						 bf, size, width);
750 	else
751 		return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
752 }
753 
754 static int hist_entry__dso_to_filter(struct hist_entry *he, int type,
755 				     const void *arg)
756 {
757 	const struct dso *dso = arg;
758 
759 	if (type != HIST_FILTER__DSO)
760 		return -1;
761 
762 	return dso && (!he->branch_info || !he->branch_info->to.map ||
763 		       he->branch_info->to.map->dso != dso);
764 }
765 
766 static int64_t
767 sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right)
768 {
769 	struct addr_map_symbol *from_l = &left->branch_info->from;
770 	struct addr_map_symbol *from_r = &right->branch_info->from;
771 
772 	if (!left->branch_info || !right->branch_info)
773 		return cmp_null(left->branch_info, right->branch_info);
774 
775 	from_l = &left->branch_info->from;
776 	from_r = &right->branch_info->from;
777 
778 	if (!from_l->sym && !from_r->sym)
779 		return _sort__addr_cmp(from_l->addr, from_r->addr);
780 
781 	return _sort__sym_cmp(from_l->sym, from_r->sym);
782 }
783 
784 static int64_t
785 sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right)
786 {
787 	struct addr_map_symbol *to_l, *to_r;
788 
789 	if (!left->branch_info || !right->branch_info)
790 		return cmp_null(left->branch_info, right->branch_info);
791 
792 	to_l = &left->branch_info->to;
793 	to_r = &right->branch_info->to;
794 
795 	if (!to_l->sym && !to_r->sym)
796 		return _sort__addr_cmp(to_l->addr, to_r->addr);
797 
798 	return _sort__sym_cmp(to_l->sym, to_r->sym);
799 }
800 
801 static int hist_entry__sym_from_snprintf(struct hist_entry *he, char *bf,
802 					 size_t size, unsigned int width)
803 {
804 	if (he->branch_info) {
805 		struct addr_map_symbol *from = &he->branch_info->from;
806 
807 		return _hist_entry__sym_snprintf(from->map, from->sym, from->addr,
808 						 he->level, bf, size, width);
809 	}
810 
811 	return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
812 }
813 
814 static int hist_entry__sym_to_snprintf(struct hist_entry *he, char *bf,
815 				       size_t size, unsigned int width)
816 {
817 	if (he->branch_info) {
818 		struct addr_map_symbol *to = &he->branch_info->to;
819 
820 		return _hist_entry__sym_snprintf(to->map, to->sym, to->addr,
821 						 he->level, bf, size, width);
822 	}
823 
824 	return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
825 }
826 
827 static int hist_entry__sym_from_filter(struct hist_entry *he, int type,
828 				       const void *arg)
829 {
830 	const char *sym = arg;
831 
832 	if (type != HIST_FILTER__SYMBOL)
833 		return -1;
834 
835 	return sym && !(he->branch_info && he->branch_info->from.sym &&
836 			strstr(he->branch_info->from.sym->name, sym));
837 }
838 
839 static int hist_entry__sym_to_filter(struct hist_entry *he, int type,
840 				       const void *arg)
841 {
842 	const char *sym = arg;
843 
844 	if (type != HIST_FILTER__SYMBOL)
845 		return -1;
846 
847 	return sym && !(he->branch_info && he->branch_info->to.sym &&
848 		        strstr(he->branch_info->to.sym->name, sym));
849 }
850 
851 struct sort_entry sort_dso_from = {
852 	.se_header	= "Source Shared Object",
853 	.se_cmp		= sort__dso_from_cmp,
854 	.se_snprintf	= hist_entry__dso_from_snprintf,
855 	.se_filter	= hist_entry__dso_from_filter,
856 	.se_width_idx	= HISTC_DSO_FROM,
857 };
858 
859 struct sort_entry sort_dso_to = {
860 	.se_header	= "Target Shared Object",
861 	.se_cmp		= sort__dso_to_cmp,
862 	.se_snprintf	= hist_entry__dso_to_snprintf,
863 	.se_filter	= hist_entry__dso_to_filter,
864 	.se_width_idx	= HISTC_DSO_TO,
865 };
866 
867 struct sort_entry sort_sym_from = {
868 	.se_header	= "Source Symbol",
869 	.se_cmp		= sort__sym_from_cmp,
870 	.se_snprintf	= hist_entry__sym_from_snprintf,
871 	.se_filter	= hist_entry__sym_from_filter,
872 	.se_width_idx	= HISTC_SYMBOL_FROM,
873 };
874 
875 struct sort_entry sort_sym_to = {
876 	.se_header	= "Target Symbol",
877 	.se_cmp		= sort__sym_to_cmp,
878 	.se_snprintf	= hist_entry__sym_to_snprintf,
879 	.se_filter	= hist_entry__sym_to_filter,
880 	.se_width_idx	= HISTC_SYMBOL_TO,
881 };
882 
883 static int64_t
884 sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right)
885 {
886 	unsigned char mp, p;
887 
888 	if (!left->branch_info || !right->branch_info)
889 		return cmp_null(left->branch_info, right->branch_info);
890 
891 	mp = left->branch_info->flags.mispred != right->branch_info->flags.mispred;
892 	p  = left->branch_info->flags.predicted != right->branch_info->flags.predicted;
893 	return mp || p;
894 }
895 
896 static int hist_entry__mispredict_snprintf(struct hist_entry *he, char *bf,
897 				    size_t size, unsigned int width){
898 	static const char *out = "N/A";
899 
900 	if (he->branch_info) {
901 		if (he->branch_info->flags.predicted)
902 			out = "N";
903 		else if (he->branch_info->flags.mispred)
904 			out = "Y";
905 	}
906 
907 	return repsep_snprintf(bf, size, "%-*.*s", width, width, out);
908 }
909 
910 static int64_t
911 sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right)
912 {
913 	if (!left->branch_info || !right->branch_info)
914 		return cmp_null(left->branch_info, right->branch_info);
915 
916 	return left->branch_info->flags.cycles -
917 		right->branch_info->flags.cycles;
918 }
919 
920 static int hist_entry__cycles_snprintf(struct hist_entry *he, char *bf,
921 				    size_t size, unsigned int width)
922 {
923 	if (!he->branch_info)
924 		return scnprintf(bf, size, "%-.*s", width, "N/A");
925 	if (he->branch_info->flags.cycles == 0)
926 		return repsep_snprintf(bf, size, "%-*s", width, "-");
927 	return repsep_snprintf(bf, size, "%-*hd", width,
928 			       he->branch_info->flags.cycles);
929 }
930 
931 struct sort_entry sort_cycles = {
932 	.se_header	= "Basic Block Cycles",
933 	.se_cmp		= sort__cycles_cmp,
934 	.se_snprintf	= hist_entry__cycles_snprintf,
935 	.se_width_idx	= HISTC_CYCLES,
936 };
937 
938 /* --sort daddr_sym */
939 int64_t
940 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right)
941 {
942 	uint64_t l = 0, r = 0;
943 
944 	if (left->mem_info)
945 		l = left->mem_info->daddr.addr;
946 	if (right->mem_info)
947 		r = right->mem_info->daddr.addr;
948 
949 	return (int64_t)(r - l);
950 }
951 
952 static int hist_entry__daddr_snprintf(struct hist_entry *he, char *bf,
953 				    size_t size, unsigned int width)
954 {
955 	uint64_t addr = 0;
956 	struct map *map = NULL;
957 	struct symbol *sym = NULL;
958 
959 	if (he->mem_info) {
960 		addr = he->mem_info->daddr.addr;
961 		map = he->mem_info->daddr.map;
962 		sym = he->mem_info->daddr.sym;
963 	}
964 	return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
965 					 width);
966 }
967 
968 int64_t
969 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right)
970 {
971 	uint64_t l = 0, r = 0;
972 
973 	if (left->mem_info)
974 		l = left->mem_info->iaddr.addr;
975 	if (right->mem_info)
976 		r = right->mem_info->iaddr.addr;
977 
978 	return (int64_t)(r - l);
979 }
980 
981 static int hist_entry__iaddr_snprintf(struct hist_entry *he, char *bf,
982 				    size_t size, unsigned int width)
983 {
984 	uint64_t addr = 0;
985 	struct map *map = NULL;
986 	struct symbol *sym = NULL;
987 
988 	if (he->mem_info) {
989 		addr = he->mem_info->iaddr.addr;
990 		map  = he->mem_info->iaddr.map;
991 		sym  = he->mem_info->iaddr.sym;
992 	}
993 	return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
994 					 width);
995 }
996 
997 static int64_t
998 sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right)
999 {
1000 	struct map *map_l = NULL;
1001 	struct map *map_r = NULL;
1002 
1003 	if (left->mem_info)
1004 		map_l = left->mem_info->daddr.map;
1005 	if (right->mem_info)
1006 		map_r = right->mem_info->daddr.map;
1007 
1008 	return _sort__dso_cmp(map_l, map_r);
1009 }
1010 
1011 static int hist_entry__dso_daddr_snprintf(struct hist_entry *he, char *bf,
1012 				    size_t size, unsigned int width)
1013 {
1014 	struct map *map = NULL;
1015 
1016 	if (he->mem_info)
1017 		map = he->mem_info->daddr.map;
1018 
1019 	return _hist_entry__dso_snprintf(map, bf, size, width);
1020 }
1021 
1022 static int64_t
1023 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right)
1024 {
1025 	union perf_mem_data_src data_src_l;
1026 	union perf_mem_data_src data_src_r;
1027 
1028 	if (left->mem_info)
1029 		data_src_l = left->mem_info->data_src;
1030 	else
1031 		data_src_l.mem_lock = PERF_MEM_LOCK_NA;
1032 
1033 	if (right->mem_info)
1034 		data_src_r = right->mem_info->data_src;
1035 	else
1036 		data_src_r.mem_lock = PERF_MEM_LOCK_NA;
1037 
1038 	return (int64_t)(data_src_r.mem_lock - data_src_l.mem_lock);
1039 }
1040 
1041 static int hist_entry__locked_snprintf(struct hist_entry *he, char *bf,
1042 				    size_t size, unsigned int width)
1043 {
1044 	char out[10];
1045 
1046 	perf_mem__lck_scnprintf(out, sizeof(out), he->mem_info);
1047 	return repsep_snprintf(bf, size, "%.*s", width, out);
1048 }
1049 
1050 static int64_t
1051 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right)
1052 {
1053 	union perf_mem_data_src data_src_l;
1054 	union perf_mem_data_src data_src_r;
1055 
1056 	if (left->mem_info)
1057 		data_src_l = left->mem_info->data_src;
1058 	else
1059 		data_src_l.mem_dtlb = PERF_MEM_TLB_NA;
1060 
1061 	if (right->mem_info)
1062 		data_src_r = right->mem_info->data_src;
1063 	else
1064 		data_src_r.mem_dtlb = PERF_MEM_TLB_NA;
1065 
1066 	return (int64_t)(data_src_r.mem_dtlb - data_src_l.mem_dtlb);
1067 }
1068 
1069 static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf,
1070 				    size_t size, unsigned int width)
1071 {
1072 	char out[64];
1073 
1074 	perf_mem__tlb_scnprintf(out, sizeof(out), he->mem_info);
1075 	return repsep_snprintf(bf, size, "%-*s", width, out);
1076 }
1077 
1078 static int64_t
1079 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right)
1080 {
1081 	union perf_mem_data_src data_src_l;
1082 	union perf_mem_data_src data_src_r;
1083 
1084 	if (left->mem_info)
1085 		data_src_l = left->mem_info->data_src;
1086 	else
1087 		data_src_l.mem_lvl = PERF_MEM_LVL_NA;
1088 
1089 	if (right->mem_info)
1090 		data_src_r = right->mem_info->data_src;
1091 	else
1092 		data_src_r.mem_lvl = PERF_MEM_LVL_NA;
1093 
1094 	return (int64_t)(data_src_r.mem_lvl - data_src_l.mem_lvl);
1095 }
1096 
1097 static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf,
1098 				    size_t size, unsigned int width)
1099 {
1100 	char out[64];
1101 
1102 	perf_mem__lvl_scnprintf(out, sizeof(out), he->mem_info);
1103 	return repsep_snprintf(bf, size, "%-*s", width, out);
1104 }
1105 
1106 static int64_t
1107 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right)
1108 {
1109 	union perf_mem_data_src data_src_l;
1110 	union perf_mem_data_src data_src_r;
1111 
1112 	if (left->mem_info)
1113 		data_src_l = left->mem_info->data_src;
1114 	else
1115 		data_src_l.mem_snoop = PERF_MEM_SNOOP_NA;
1116 
1117 	if (right->mem_info)
1118 		data_src_r = right->mem_info->data_src;
1119 	else
1120 		data_src_r.mem_snoop = PERF_MEM_SNOOP_NA;
1121 
1122 	return (int64_t)(data_src_r.mem_snoop - data_src_l.mem_snoop);
1123 }
1124 
1125 static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf,
1126 				    size_t size, unsigned int width)
1127 {
1128 	char out[64];
1129 
1130 	perf_mem__snp_scnprintf(out, sizeof(out), he->mem_info);
1131 	return repsep_snprintf(bf, size, "%-*s", width, out);
1132 }
1133 
1134 int64_t
1135 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right)
1136 {
1137 	u64 l, r;
1138 	struct map *l_map, *r_map;
1139 
1140 	if (!left->mem_info)  return -1;
1141 	if (!right->mem_info) return 1;
1142 
1143 	/* group event types together */
1144 	if (left->cpumode > right->cpumode) return -1;
1145 	if (left->cpumode < right->cpumode) return 1;
1146 
1147 	l_map = left->mem_info->daddr.map;
1148 	r_map = right->mem_info->daddr.map;
1149 
1150 	/* if both are NULL, jump to sort on al_addr instead */
1151 	if (!l_map && !r_map)
1152 		goto addr;
1153 
1154 	if (!l_map) return -1;
1155 	if (!r_map) return 1;
1156 
1157 	if (l_map->maj > r_map->maj) return -1;
1158 	if (l_map->maj < r_map->maj) return 1;
1159 
1160 	if (l_map->min > r_map->min) return -1;
1161 	if (l_map->min < r_map->min) return 1;
1162 
1163 	if (l_map->ino > r_map->ino) return -1;
1164 	if (l_map->ino < r_map->ino) return 1;
1165 
1166 	if (l_map->ino_generation > r_map->ino_generation) return -1;
1167 	if (l_map->ino_generation < r_map->ino_generation) return 1;
1168 
1169 	/*
1170 	 * Addresses with no major/minor numbers are assumed to be
1171 	 * anonymous in userspace.  Sort those on pid then address.
1172 	 *
1173 	 * The kernel and non-zero major/minor mapped areas are
1174 	 * assumed to be unity mapped.  Sort those on address.
1175 	 */
1176 
1177 	if ((left->cpumode != PERF_RECORD_MISC_KERNEL) &&
1178 	    (!(l_map->flags & MAP_SHARED)) &&
1179 	    !l_map->maj && !l_map->min && !l_map->ino &&
1180 	    !l_map->ino_generation) {
1181 		/* userspace anonymous */
1182 
1183 		if (left->thread->pid_ > right->thread->pid_) return -1;
1184 		if (left->thread->pid_ < right->thread->pid_) return 1;
1185 	}
1186 
1187 addr:
1188 	/* al_addr does all the right addr - start + offset calculations */
1189 	l = cl_address(left->mem_info->daddr.al_addr);
1190 	r = cl_address(right->mem_info->daddr.al_addr);
1191 
1192 	if (l > r) return -1;
1193 	if (l < r) return 1;
1194 
1195 	return 0;
1196 }
1197 
1198 static int hist_entry__dcacheline_snprintf(struct hist_entry *he, char *bf,
1199 					  size_t size, unsigned int width)
1200 {
1201 
1202 	uint64_t addr = 0;
1203 	struct map *map = NULL;
1204 	struct symbol *sym = NULL;
1205 	char level = he->level;
1206 
1207 	if (he->mem_info) {
1208 		addr = cl_address(he->mem_info->daddr.al_addr);
1209 		map = he->mem_info->daddr.map;
1210 		sym = he->mem_info->daddr.sym;
1211 
1212 		/* print [s] for shared data mmaps */
1213 		if ((he->cpumode != PERF_RECORD_MISC_KERNEL) &&
1214 		     map && (map->type == MAP__VARIABLE) &&
1215 		    (map->flags & MAP_SHARED) &&
1216 		    (map->maj || map->min || map->ino ||
1217 		     map->ino_generation))
1218 			level = 's';
1219 		else if (!map)
1220 			level = 'X';
1221 	}
1222 	return _hist_entry__sym_snprintf(map, sym, addr, level, bf, size,
1223 					 width);
1224 }
1225 
1226 struct sort_entry sort_mispredict = {
1227 	.se_header	= "Branch Mispredicted",
1228 	.se_cmp		= sort__mispredict_cmp,
1229 	.se_snprintf	= hist_entry__mispredict_snprintf,
1230 	.se_width_idx	= HISTC_MISPREDICT,
1231 };
1232 
1233 static u64 he_weight(struct hist_entry *he)
1234 {
1235 	return he->stat.nr_events ? he->stat.weight / he->stat.nr_events : 0;
1236 }
1237 
1238 static int64_t
1239 sort__local_weight_cmp(struct hist_entry *left, struct hist_entry *right)
1240 {
1241 	return he_weight(left) - he_weight(right);
1242 }
1243 
1244 static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf,
1245 				    size_t size, unsigned int width)
1246 {
1247 	return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he));
1248 }
1249 
1250 struct sort_entry sort_local_weight = {
1251 	.se_header	= "Local Weight",
1252 	.se_cmp		= sort__local_weight_cmp,
1253 	.se_snprintf	= hist_entry__local_weight_snprintf,
1254 	.se_width_idx	= HISTC_LOCAL_WEIGHT,
1255 };
1256 
1257 static int64_t
1258 sort__global_weight_cmp(struct hist_entry *left, struct hist_entry *right)
1259 {
1260 	return left->stat.weight - right->stat.weight;
1261 }
1262 
1263 static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf,
1264 					      size_t size, unsigned int width)
1265 {
1266 	return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight);
1267 }
1268 
1269 struct sort_entry sort_global_weight = {
1270 	.se_header	= "Weight",
1271 	.se_cmp		= sort__global_weight_cmp,
1272 	.se_snprintf	= hist_entry__global_weight_snprintf,
1273 	.se_width_idx	= HISTC_GLOBAL_WEIGHT,
1274 };
1275 
1276 struct sort_entry sort_mem_daddr_sym = {
1277 	.se_header	= "Data Symbol",
1278 	.se_cmp		= sort__daddr_cmp,
1279 	.se_snprintf	= hist_entry__daddr_snprintf,
1280 	.se_width_idx	= HISTC_MEM_DADDR_SYMBOL,
1281 };
1282 
1283 struct sort_entry sort_mem_iaddr_sym = {
1284 	.se_header	= "Code Symbol",
1285 	.se_cmp		= sort__iaddr_cmp,
1286 	.se_snprintf	= hist_entry__iaddr_snprintf,
1287 	.se_width_idx	= HISTC_MEM_IADDR_SYMBOL,
1288 };
1289 
1290 struct sort_entry sort_mem_daddr_dso = {
1291 	.se_header	= "Data Object",
1292 	.se_cmp		= sort__dso_daddr_cmp,
1293 	.se_snprintf	= hist_entry__dso_daddr_snprintf,
1294 	.se_width_idx	= HISTC_MEM_DADDR_DSO,
1295 };
1296 
1297 struct sort_entry sort_mem_locked = {
1298 	.se_header	= "Locked",
1299 	.se_cmp		= sort__locked_cmp,
1300 	.se_snprintf	= hist_entry__locked_snprintf,
1301 	.se_width_idx	= HISTC_MEM_LOCKED,
1302 };
1303 
1304 struct sort_entry sort_mem_tlb = {
1305 	.se_header	= "TLB access",
1306 	.se_cmp		= sort__tlb_cmp,
1307 	.se_snprintf	= hist_entry__tlb_snprintf,
1308 	.se_width_idx	= HISTC_MEM_TLB,
1309 };
1310 
1311 struct sort_entry sort_mem_lvl = {
1312 	.se_header	= "Memory access",
1313 	.se_cmp		= sort__lvl_cmp,
1314 	.se_snprintf	= hist_entry__lvl_snprintf,
1315 	.se_width_idx	= HISTC_MEM_LVL,
1316 };
1317 
1318 struct sort_entry sort_mem_snoop = {
1319 	.se_header	= "Snoop",
1320 	.se_cmp		= sort__snoop_cmp,
1321 	.se_snprintf	= hist_entry__snoop_snprintf,
1322 	.se_width_idx	= HISTC_MEM_SNOOP,
1323 };
1324 
1325 struct sort_entry sort_mem_dcacheline = {
1326 	.se_header	= "Data Cacheline",
1327 	.se_cmp		= sort__dcacheline_cmp,
1328 	.se_snprintf	= hist_entry__dcacheline_snprintf,
1329 	.se_width_idx	= HISTC_MEM_DCACHELINE,
1330 };
1331 
1332 static int64_t
1333 sort__phys_daddr_cmp(struct hist_entry *left, struct hist_entry *right)
1334 {
1335 	uint64_t l = 0, r = 0;
1336 
1337 	if (left->mem_info)
1338 		l = left->mem_info->daddr.phys_addr;
1339 	if (right->mem_info)
1340 		r = right->mem_info->daddr.phys_addr;
1341 
1342 	return (int64_t)(r - l);
1343 }
1344 
1345 static int hist_entry__phys_daddr_snprintf(struct hist_entry *he, char *bf,
1346 					   size_t size, unsigned int width)
1347 {
1348 	uint64_t addr = 0;
1349 	size_t ret = 0;
1350 	size_t len = BITS_PER_LONG / 4;
1351 
1352 	addr = he->mem_info->daddr.phys_addr;
1353 
1354 	ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", he->level);
1355 
1356 	ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx", len, addr);
1357 
1358 	ret += repsep_snprintf(bf + ret, size - ret, "%-*s", width - ret, "");
1359 
1360 	if (ret > width)
1361 		bf[width] = '\0';
1362 
1363 	return width;
1364 }
1365 
1366 struct sort_entry sort_mem_phys_daddr = {
1367 	.se_header	= "Data Physical Address",
1368 	.se_cmp		= sort__phys_daddr_cmp,
1369 	.se_snprintf	= hist_entry__phys_daddr_snprintf,
1370 	.se_width_idx	= HISTC_MEM_PHYS_DADDR,
1371 };
1372 
1373 static int64_t
1374 sort__abort_cmp(struct hist_entry *left, struct hist_entry *right)
1375 {
1376 	if (!left->branch_info || !right->branch_info)
1377 		return cmp_null(left->branch_info, right->branch_info);
1378 
1379 	return left->branch_info->flags.abort !=
1380 		right->branch_info->flags.abort;
1381 }
1382 
1383 static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf,
1384 				    size_t size, unsigned int width)
1385 {
1386 	static const char *out = "N/A";
1387 
1388 	if (he->branch_info) {
1389 		if (he->branch_info->flags.abort)
1390 			out = "A";
1391 		else
1392 			out = ".";
1393 	}
1394 
1395 	return repsep_snprintf(bf, size, "%-*s", width, out);
1396 }
1397 
1398 struct sort_entry sort_abort = {
1399 	.se_header	= "Transaction abort",
1400 	.se_cmp		= sort__abort_cmp,
1401 	.se_snprintf	= hist_entry__abort_snprintf,
1402 	.se_width_idx	= HISTC_ABORT,
1403 };
1404 
1405 static int64_t
1406 sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right)
1407 {
1408 	if (!left->branch_info || !right->branch_info)
1409 		return cmp_null(left->branch_info, right->branch_info);
1410 
1411 	return left->branch_info->flags.in_tx !=
1412 		right->branch_info->flags.in_tx;
1413 }
1414 
1415 static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf,
1416 				    size_t size, unsigned int width)
1417 {
1418 	static const char *out = "N/A";
1419 
1420 	if (he->branch_info) {
1421 		if (he->branch_info->flags.in_tx)
1422 			out = "T";
1423 		else
1424 			out = ".";
1425 	}
1426 
1427 	return repsep_snprintf(bf, size, "%-*s", width, out);
1428 }
1429 
1430 struct sort_entry sort_in_tx = {
1431 	.se_header	= "Branch in transaction",
1432 	.se_cmp		= sort__in_tx_cmp,
1433 	.se_snprintf	= hist_entry__in_tx_snprintf,
1434 	.se_width_idx	= HISTC_IN_TX,
1435 };
1436 
1437 static int64_t
1438 sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right)
1439 {
1440 	return left->transaction - right->transaction;
1441 }
1442 
1443 static inline char *add_str(char *p, const char *str)
1444 {
1445 	strcpy(p, str);
1446 	return p + strlen(str);
1447 }
1448 
1449 static struct txbit {
1450 	unsigned flag;
1451 	const char *name;
1452 	int skip_for_len;
1453 } txbits[] = {
1454 	{ PERF_TXN_ELISION,        "EL ",        0 },
1455 	{ PERF_TXN_TRANSACTION,    "TX ",        1 },
1456 	{ PERF_TXN_SYNC,           "SYNC ",      1 },
1457 	{ PERF_TXN_ASYNC,          "ASYNC ",     0 },
1458 	{ PERF_TXN_RETRY,          "RETRY ",     0 },
1459 	{ PERF_TXN_CONFLICT,       "CON ",       0 },
1460 	{ PERF_TXN_CAPACITY_WRITE, "CAP-WRITE ", 1 },
1461 	{ PERF_TXN_CAPACITY_READ,  "CAP-READ ",  0 },
1462 	{ 0, NULL, 0 }
1463 };
1464 
1465 int hist_entry__transaction_len(void)
1466 {
1467 	int i;
1468 	int len = 0;
1469 
1470 	for (i = 0; txbits[i].name; i++) {
1471 		if (!txbits[i].skip_for_len)
1472 			len += strlen(txbits[i].name);
1473 	}
1474 	len += 4; /* :XX<space> */
1475 	return len;
1476 }
1477 
1478 static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf,
1479 					    size_t size, unsigned int width)
1480 {
1481 	u64 t = he->transaction;
1482 	char buf[128];
1483 	char *p = buf;
1484 	int i;
1485 
1486 	buf[0] = 0;
1487 	for (i = 0; txbits[i].name; i++)
1488 		if (txbits[i].flag & t)
1489 			p = add_str(p, txbits[i].name);
1490 	if (t && !(t & (PERF_TXN_SYNC|PERF_TXN_ASYNC)))
1491 		p = add_str(p, "NEITHER ");
1492 	if (t & PERF_TXN_ABORT_MASK) {
1493 		sprintf(p, ":%" PRIx64,
1494 			(t & PERF_TXN_ABORT_MASK) >>
1495 			PERF_TXN_ABORT_SHIFT);
1496 		p += strlen(p);
1497 	}
1498 
1499 	return repsep_snprintf(bf, size, "%-*s", width, buf);
1500 }
1501 
1502 struct sort_entry sort_transaction = {
1503 	.se_header	= "Transaction                ",
1504 	.se_cmp		= sort__transaction_cmp,
1505 	.se_snprintf	= hist_entry__transaction_snprintf,
1506 	.se_width_idx	= HISTC_TRANSACTION,
1507 };
1508 
1509 /* --sort symbol_size */
1510 
1511 static int64_t _sort__sym_size_cmp(struct symbol *sym_l, struct symbol *sym_r)
1512 {
1513 	int64_t size_l = sym_l != NULL ? symbol__size(sym_l) : 0;
1514 	int64_t size_r = sym_r != NULL ? symbol__size(sym_r) : 0;
1515 
1516 	return size_l < size_r ? -1 :
1517 		size_l == size_r ? 0 : 1;
1518 }
1519 
1520 static int64_t
1521 sort__sym_size_cmp(struct hist_entry *left, struct hist_entry *right)
1522 {
1523 	return _sort__sym_size_cmp(right->ms.sym, left->ms.sym);
1524 }
1525 
1526 static int _hist_entry__sym_size_snprintf(struct symbol *sym, char *bf,
1527 					  size_t bf_size, unsigned int width)
1528 {
1529 	if (sym)
1530 		return repsep_snprintf(bf, bf_size, "%*d", width, symbol__size(sym));
1531 
1532 	return repsep_snprintf(bf, bf_size, "%*s", width, "unknown");
1533 }
1534 
1535 static int hist_entry__sym_size_snprintf(struct hist_entry *he, char *bf,
1536 					 size_t size, unsigned int width)
1537 {
1538 	return _hist_entry__sym_size_snprintf(he->ms.sym, bf, size, width);
1539 }
1540 
1541 struct sort_entry sort_sym_size = {
1542 	.se_header	= "Symbol size",
1543 	.se_cmp		= sort__sym_size_cmp,
1544 	.se_snprintf	= hist_entry__sym_size_snprintf,
1545 	.se_width_idx	= HISTC_SYM_SIZE,
1546 };
1547 
1548 
1549 struct sort_dimension {
1550 	const char		*name;
1551 	struct sort_entry	*entry;
1552 	int			taken;
1553 };
1554 
1555 #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }
1556 
1557 static struct sort_dimension common_sort_dimensions[] = {
1558 	DIM(SORT_PID, "pid", sort_thread),
1559 	DIM(SORT_COMM, "comm", sort_comm),
1560 	DIM(SORT_DSO, "dso", sort_dso),
1561 	DIM(SORT_SYM, "symbol", sort_sym),
1562 	DIM(SORT_PARENT, "parent", sort_parent),
1563 	DIM(SORT_CPU, "cpu", sort_cpu),
1564 	DIM(SORT_SOCKET, "socket", sort_socket),
1565 	DIM(SORT_SRCLINE, "srcline", sort_srcline),
1566 	DIM(SORT_SRCFILE, "srcfile", sort_srcfile),
1567 	DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight),
1568 	DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight),
1569 	DIM(SORT_TRANSACTION, "transaction", sort_transaction),
1570 	DIM(SORT_TRACE, "trace", sort_trace),
1571 	DIM(SORT_SYM_SIZE, "symbol_size", sort_sym_size),
1572 	DIM(SORT_CGROUP_ID, "cgroup_id", sort_cgroup_id),
1573 };
1574 
1575 #undef DIM
1576 
1577 #define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) }
1578 
1579 static struct sort_dimension bstack_sort_dimensions[] = {
1580 	DIM(SORT_DSO_FROM, "dso_from", sort_dso_from),
1581 	DIM(SORT_DSO_TO, "dso_to", sort_dso_to),
1582 	DIM(SORT_SYM_FROM, "symbol_from", sort_sym_from),
1583 	DIM(SORT_SYM_TO, "symbol_to", sort_sym_to),
1584 	DIM(SORT_MISPREDICT, "mispredict", sort_mispredict),
1585 	DIM(SORT_IN_TX, "in_tx", sort_in_tx),
1586 	DIM(SORT_ABORT, "abort", sort_abort),
1587 	DIM(SORT_CYCLES, "cycles", sort_cycles),
1588 	DIM(SORT_SRCLINE_FROM, "srcline_from", sort_srcline_from),
1589 	DIM(SORT_SRCLINE_TO, "srcline_to", sort_srcline_to),
1590 };
1591 
1592 #undef DIM
1593 
1594 #define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) }
1595 
1596 static struct sort_dimension memory_sort_dimensions[] = {
1597 	DIM(SORT_MEM_DADDR_SYMBOL, "symbol_daddr", sort_mem_daddr_sym),
1598 	DIM(SORT_MEM_IADDR_SYMBOL, "symbol_iaddr", sort_mem_iaddr_sym),
1599 	DIM(SORT_MEM_DADDR_DSO, "dso_daddr", sort_mem_daddr_dso),
1600 	DIM(SORT_MEM_LOCKED, "locked", sort_mem_locked),
1601 	DIM(SORT_MEM_TLB, "tlb", sort_mem_tlb),
1602 	DIM(SORT_MEM_LVL, "mem", sort_mem_lvl),
1603 	DIM(SORT_MEM_SNOOP, "snoop", sort_mem_snoop),
1604 	DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline),
1605 	DIM(SORT_MEM_PHYS_DADDR, "phys_daddr", sort_mem_phys_daddr),
1606 };
1607 
1608 #undef DIM
1609 
1610 struct hpp_dimension {
1611 	const char		*name;
1612 	struct perf_hpp_fmt	*fmt;
1613 	int			taken;
1614 };
1615 
1616 #define DIM(d, n) { .name = n, .fmt = &perf_hpp__format[d], }
1617 
1618 static struct hpp_dimension hpp_sort_dimensions[] = {
1619 	DIM(PERF_HPP__OVERHEAD, "overhead"),
1620 	DIM(PERF_HPP__OVERHEAD_SYS, "overhead_sys"),
1621 	DIM(PERF_HPP__OVERHEAD_US, "overhead_us"),
1622 	DIM(PERF_HPP__OVERHEAD_GUEST_SYS, "overhead_guest_sys"),
1623 	DIM(PERF_HPP__OVERHEAD_GUEST_US, "overhead_guest_us"),
1624 	DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"),
1625 	DIM(PERF_HPP__SAMPLES, "sample"),
1626 	DIM(PERF_HPP__PERIOD, "period"),
1627 };
1628 
1629 #undef DIM
1630 
1631 struct hpp_sort_entry {
1632 	struct perf_hpp_fmt hpp;
1633 	struct sort_entry *se;
1634 };
1635 
1636 void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists)
1637 {
1638 	struct hpp_sort_entry *hse;
1639 
1640 	if (!perf_hpp__is_sort_entry(fmt))
1641 		return;
1642 
1643 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1644 	hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name));
1645 }
1646 
1647 static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
1648 			      struct hists *hists, int line __maybe_unused,
1649 			      int *span __maybe_unused)
1650 {
1651 	struct hpp_sort_entry *hse;
1652 	size_t len = fmt->user_len;
1653 
1654 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1655 
1656 	if (!len)
1657 		len = hists__col_len(hists, hse->se->se_width_idx);
1658 
1659 	return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name);
1660 }
1661 
1662 static int __sort__hpp_width(struct perf_hpp_fmt *fmt,
1663 			     struct perf_hpp *hpp __maybe_unused,
1664 			     struct hists *hists)
1665 {
1666 	struct hpp_sort_entry *hse;
1667 	size_t len = fmt->user_len;
1668 
1669 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1670 
1671 	if (!len)
1672 		len = hists__col_len(hists, hse->se->se_width_idx);
1673 
1674 	return len;
1675 }
1676 
1677 static int __sort__hpp_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
1678 			     struct hist_entry *he)
1679 {
1680 	struct hpp_sort_entry *hse;
1681 	size_t len = fmt->user_len;
1682 
1683 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1684 
1685 	if (!len)
1686 		len = hists__col_len(he->hists, hse->se->se_width_idx);
1687 
1688 	return hse->se->se_snprintf(he, hpp->buf, hpp->size, len);
1689 }
1690 
1691 static int64_t __sort__hpp_cmp(struct perf_hpp_fmt *fmt,
1692 			       struct hist_entry *a, struct hist_entry *b)
1693 {
1694 	struct hpp_sort_entry *hse;
1695 
1696 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1697 	return hse->se->se_cmp(a, b);
1698 }
1699 
1700 static int64_t __sort__hpp_collapse(struct perf_hpp_fmt *fmt,
1701 				    struct hist_entry *a, struct hist_entry *b)
1702 {
1703 	struct hpp_sort_entry *hse;
1704 	int64_t (*collapse_fn)(struct hist_entry *, struct hist_entry *);
1705 
1706 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1707 	collapse_fn = hse->se->se_collapse ?: hse->se->se_cmp;
1708 	return collapse_fn(a, b);
1709 }
1710 
1711 static int64_t __sort__hpp_sort(struct perf_hpp_fmt *fmt,
1712 				struct hist_entry *a, struct hist_entry *b)
1713 {
1714 	struct hpp_sort_entry *hse;
1715 	int64_t (*sort_fn)(struct hist_entry *, struct hist_entry *);
1716 
1717 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1718 	sort_fn = hse->se->se_sort ?: hse->se->se_cmp;
1719 	return sort_fn(a, b);
1720 }
1721 
1722 bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format)
1723 {
1724 	return format->header == __sort__hpp_header;
1725 }
1726 
1727 #define MK_SORT_ENTRY_CHK(key)					\
1728 bool perf_hpp__is_ ## key ## _entry(struct perf_hpp_fmt *fmt)	\
1729 {								\
1730 	struct hpp_sort_entry *hse;				\
1731 								\
1732 	if (!perf_hpp__is_sort_entry(fmt))			\
1733 		return false;					\
1734 								\
1735 	hse = container_of(fmt, struct hpp_sort_entry, hpp);	\
1736 	return hse->se == &sort_ ## key ;			\
1737 }
1738 
1739 MK_SORT_ENTRY_CHK(trace)
1740 MK_SORT_ENTRY_CHK(srcline)
1741 MK_SORT_ENTRY_CHK(srcfile)
1742 MK_SORT_ENTRY_CHK(thread)
1743 MK_SORT_ENTRY_CHK(comm)
1744 MK_SORT_ENTRY_CHK(dso)
1745 MK_SORT_ENTRY_CHK(sym)
1746 
1747 
1748 static bool __sort__hpp_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b)
1749 {
1750 	struct hpp_sort_entry *hse_a;
1751 	struct hpp_sort_entry *hse_b;
1752 
1753 	if (!perf_hpp__is_sort_entry(a) || !perf_hpp__is_sort_entry(b))
1754 		return false;
1755 
1756 	hse_a = container_of(a, struct hpp_sort_entry, hpp);
1757 	hse_b = container_of(b, struct hpp_sort_entry, hpp);
1758 
1759 	return hse_a->se == hse_b->se;
1760 }
1761 
1762 static void hse_free(struct perf_hpp_fmt *fmt)
1763 {
1764 	struct hpp_sort_entry *hse;
1765 
1766 	hse = container_of(fmt, struct hpp_sort_entry, hpp);
1767 	free(hse);
1768 }
1769 
1770 static struct hpp_sort_entry *
1771 __sort_dimension__alloc_hpp(struct sort_dimension *sd, int level)
1772 {
1773 	struct hpp_sort_entry *hse;
1774 
1775 	hse = malloc(sizeof(*hse));
1776 	if (hse == NULL) {
1777 		pr_err("Memory allocation failed\n");
1778 		return NULL;
1779 	}
1780 
1781 	hse->se = sd->entry;
1782 	hse->hpp.name = sd->entry->se_header;
1783 	hse->hpp.header = __sort__hpp_header;
1784 	hse->hpp.width = __sort__hpp_width;
1785 	hse->hpp.entry = __sort__hpp_entry;
1786 	hse->hpp.color = NULL;
1787 
1788 	hse->hpp.cmp = __sort__hpp_cmp;
1789 	hse->hpp.collapse = __sort__hpp_collapse;
1790 	hse->hpp.sort = __sort__hpp_sort;
1791 	hse->hpp.equal = __sort__hpp_equal;
1792 	hse->hpp.free = hse_free;
1793 
1794 	INIT_LIST_HEAD(&hse->hpp.list);
1795 	INIT_LIST_HEAD(&hse->hpp.sort_list);
1796 	hse->hpp.elide = false;
1797 	hse->hpp.len = 0;
1798 	hse->hpp.user_len = 0;
1799 	hse->hpp.level = level;
1800 
1801 	return hse;
1802 }
1803 
1804 static void hpp_free(struct perf_hpp_fmt *fmt)
1805 {
1806 	free(fmt);
1807 }
1808 
1809 static struct perf_hpp_fmt *__hpp_dimension__alloc_hpp(struct hpp_dimension *hd,
1810 						       int level)
1811 {
1812 	struct perf_hpp_fmt *fmt;
1813 
1814 	fmt = memdup(hd->fmt, sizeof(*fmt));
1815 	if (fmt) {
1816 		INIT_LIST_HEAD(&fmt->list);
1817 		INIT_LIST_HEAD(&fmt->sort_list);
1818 		fmt->free = hpp_free;
1819 		fmt->level = level;
1820 	}
1821 
1822 	return fmt;
1823 }
1824 
1825 int hist_entry__filter(struct hist_entry *he, int type, const void *arg)
1826 {
1827 	struct perf_hpp_fmt *fmt;
1828 	struct hpp_sort_entry *hse;
1829 	int ret = -1;
1830 	int r;
1831 
1832 	perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1833 		if (!perf_hpp__is_sort_entry(fmt))
1834 			continue;
1835 
1836 		hse = container_of(fmt, struct hpp_sort_entry, hpp);
1837 		if (hse->se->se_filter == NULL)
1838 			continue;
1839 
1840 		/*
1841 		 * hist entry is filtered if any of sort key in the hpp list
1842 		 * is applied.  But it should skip non-matched filter types.
1843 		 */
1844 		r = hse->se->se_filter(he, type, arg);
1845 		if (r >= 0) {
1846 			if (ret < 0)
1847 				ret = 0;
1848 			ret |= r;
1849 		}
1850 	}
1851 
1852 	return ret;
1853 }
1854 
1855 static int __sort_dimension__add_hpp_sort(struct sort_dimension *sd,
1856 					  struct perf_hpp_list *list,
1857 					  int level)
1858 {
1859 	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd, level);
1860 
1861 	if (hse == NULL)
1862 		return -1;
1863 
1864 	perf_hpp_list__register_sort_field(list, &hse->hpp);
1865 	return 0;
1866 }
1867 
1868 static int __sort_dimension__add_hpp_output(struct sort_dimension *sd,
1869 					    struct perf_hpp_list *list)
1870 {
1871 	struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd, 0);
1872 
1873 	if (hse == NULL)
1874 		return -1;
1875 
1876 	perf_hpp_list__column_register(list, &hse->hpp);
1877 	return 0;
1878 }
1879 
1880 struct hpp_dynamic_entry {
1881 	struct perf_hpp_fmt hpp;
1882 	struct perf_evsel *evsel;
1883 	struct format_field *field;
1884 	unsigned dynamic_len;
1885 	bool raw_trace;
1886 };
1887 
1888 static int hde_width(struct hpp_dynamic_entry *hde)
1889 {
1890 	if (!hde->hpp.len) {
1891 		int len = hde->dynamic_len;
1892 		int namelen = strlen(hde->field->name);
1893 		int fieldlen = hde->field->size;
1894 
1895 		if (namelen > len)
1896 			len = namelen;
1897 
1898 		if (!(hde->field->flags & FIELD_IS_STRING)) {
1899 			/* length for print hex numbers */
1900 			fieldlen = hde->field->size * 2 + 2;
1901 		}
1902 		if (fieldlen > len)
1903 			len = fieldlen;
1904 
1905 		hde->hpp.len = len;
1906 	}
1907 	return hde->hpp.len;
1908 }
1909 
1910 static void update_dynamic_len(struct hpp_dynamic_entry *hde,
1911 			       struct hist_entry *he)
1912 {
1913 	char *str, *pos;
1914 	struct format_field *field = hde->field;
1915 	size_t namelen;
1916 	bool last = false;
1917 
1918 	if (hde->raw_trace)
1919 		return;
1920 
1921 	/* parse pretty print result and update max length */
1922 	if (!he->trace_output)
1923 		he->trace_output = get_trace_output(he);
1924 
1925 	namelen = strlen(field->name);
1926 	str = he->trace_output;
1927 
1928 	while (str) {
1929 		pos = strchr(str, ' ');
1930 		if (pos == NULL) {
1931 			last = true;
1932 			pos = str + strlen(str);
1933 		}
1934 
1935 		if (!strncmp(str, field->name, namelen)) {
1936 			size_t len;
1937 
1938 			str += namelen + 1;
1939 			len = pos - str;
1940 
1941 			if (len > hde->dynamic_len)
1942 				hde->dynamic_len = len;
1943 			break;
1944 		}
1945 
1946 		if (last)
1947 			str = NULL;
1948 		else
1949 			str = pos + 1;
1950 	}
1951 }
1952 
1953 static int __sort__hde_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
1954 			      struct hists *hists __maybe_unused,
1955 			      int line __maybe_unused,
1956 			      int *span __maybe_unused)
1957 {
1958 	struct hpp_dynamic_entry *hde;
1959 	size_t len = fmt->user_len;
1960 
1961 	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
1962 
1963 	if (!len)
1964 		len = hde_width(hde);
1965 
1966 	return scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, hde->field->name);
1967 }
1968 
1969 static int __sort__hde_width(struct perf_hpp_fmt *fmt,
1970 			     struct perf_hpp *hpp __maybe_unused,
1971 			     struct hists *hists __maybe_unused)
1972 {
1973 	struct hpp_dynamic_entry *hde;
1974 	size_t len = fmt->user_len;
1975 
1976 	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
1977 
1978 	if (!len)
1979 		len = hde_width(hde);
1980 
1981 	return len;
1982 }
1983 
1984 bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt *fmt, struct hists *hists)
1985 {
1986 	struct hpp_dynamic_entry *hde;
1987 
1988 	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
1989 
1990 	return hists_to_evsel(hists) == hde->evsel;
1991 }
1992 
1993 static int __sort__hde_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
1994 			     struct hist_entry *he)
1995 {
1996 	struct hpp_dynamic_entry *hde;
1997 	size_t len = fmt->user_len;
1998 	char *str, *pos;
1999 	struct format_field *field;
2000 	size_t namelen;
2001 	bool last = false;
2002 	int ret;
2003 
2004 	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
2005 
2006 	if (!len)
2007 		len = hde_width(hde);
2008 
2009 	if (hde->raw_trace)
2010 		goto raw_field;
2011 
2012 	if (!he->trace_output)
2013 		he->trace_output = get_trace_output(he);
2014 
2015 	field = hde->field;
2016 	namelen = strlen(field->name);
2017 	str = he->trace_output;
2018 
2019 	while (str) {
2020 		pos = strchr(str, ' ');
2021 		if (pos == NULL) {
2022 			last = true;
2023 			pos = str + strlen(str);
2024 		}
2025 
2026 		if (!strncmp(str, field->name, namelen)) {
2027 			str += namelen + 1;
2028 			str = strndup(str, pos - str);
2029 
2030 			if (str == NULL)
2031 				return scnprintf(hpp->buf, hpp->size,
2032 						 "%*.*s", len, len, "ERROR");
2033 			break;
2034 		}
2035 
2036 		if (last)
2037 			str = NULL;
2038 		else
2039 			str = pos + 1;
2040 	}
2041 
2042 	if (str == NULL) {
2043 		struct trace_seq seq;
2044 raw_field:
2045 		trace_seq_init(&seq);
2046 		pevent_print_field(&seq, he->raw_data, hde->field);
2047 		str = seq.buffer;
2048 	}
2049 
2050 	ret = scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, str);
2051 	free(str);
2052 	return ret;
2053 }
2054 
2055 static int64_t __sort__hde_cmp(struct perf_hpp_fmt *fmt,
2056 			       struct hist_entry *a, struct hist_entry *b)
2057 {
2058 	struct hpp_dynamic_entry *hde;
2059 	struct format_field *field;
2060 	unsigned offset, size;
2061 
2062 	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
2063 
2064 	if (b == NULL) {
2065 		update_dynamic_len(hde, a);
2066 		return 0;
2067 	}
2068 
2069 	field = hde->field;
2070 	if (field->flags & FIELD_IS_DYNAMIC) {
2071 		unsigned long long dyn;
2072 
2073 		pevent_read_number_field(field, a->raw_data, &dyn);
2074 		offset = dyn & 0xffff;
2075 		size = (dyn >> 16) & 0xffff;
2076 
2077 		/* record max width for output */
2078 		if (size > hde->dynamic_len)
2079 			hde->dynamic_len = size;
2080 	} else {
2081 		offset = field->offset;
2082 		size = field->size;
2083 	}
2084 
2085 	return memcmp(a->raw_data + offset, b->raw_data + offset, size);
2086 }
2087 
2088 bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *fmt)
2089 {
2090 	return fmt->cmp == __sort__hde_cmp;
2091 }
2092 
2093 static bool __sort__hde_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b)
2094 {
2095 	struct hpp_dynamic_entry *hde_a;
2096 	struct hpp_dynamic_entry *hde_b;
2097 
2098 	if (!perf_hpp__is_dynamic_entry(a) || !perf_hpp__is_dynamic_entry(b))
2099 		return false;
2100 
2101 	hde_a = container_of(a, struct hpp_dynamic_entry, hpp);
2102 	hde_b = container_of(b, struct hpp_dynamic_entry, hpp);
2103 
2104 	return hde_a->field == hde_b->field;
2105 }
2106 
2107 static void hde_free(struct perf_hpp_fmt *fmt)
2108 {
2109 	struct hpp_dynamic_entry *hde;
2110 
2111 	hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
2112 	free(hde);
2113 }
2114 
2115 static struct hpp_dynamic_entry *
2116 __alloc_dynamic_entry(struct perf_evsel *evsel, struct format_field *field,
2117 		      int level)
2118 {
2119 	struct hpp_dynamic_entry *hde;
2120 
2121 	hde = malloc(sizeof(*hde));
2122 	if (hde == NULL) {
2123 		pr_debug("Memory allocation failed\n");
2124 		return NULL;
2125 	}
2126 
2127 	hde->evsel = evsel;
2128 	hde->field = field;
2129 	hde->dynamic_len = 0;
2130 
2131 	hde->hpp.name = field->name;
2132 	hde->hpp.header = __sort__hde_header;
2133 	hde->hpp.width  = __sort__hde_width;
2134 	hde->hpp.entry  = __sort__hde_entry;
2135 	hde->hpp.color  = NULL;
2136 
2137 	hde->hpp.cmp = __sort__hde_cmp;
2138 	hde->hpp.collapse = __sort__hde_cmp;
2139 	hde->hpp.sort = __sort__hde_cmp;
2140 	hde->hpp.equal = __sort__hde_equal;
2141 	hde->hpp.free = hde_free;
2142 
2143 	INIT_LIST_HEAD(&hde->hpp.list);
2144 	INIT_LIST_HEAD(&hde->hpp.sort_list);
2145 	hde->hpp.elide = false;
2146 	hde->hpp.len = 0;
2147 	hde->hpp.user_len = 0;
2148 	hde->hpp.level = level;
2149 
2150 	return hde;
2151 }
2152 
2153 struct perf_hpp_fmt *perf_hpp_fmt__dup(struct perf_hpp_fmt *fmt)
2154 {
2155 	struct perf_hpp_fmt *new_fmt = NULL;
2156 
2157 	if (perf_hpp__is_sort_entry(fmt)) {
2158 		struct hpp_sort_entry *hse, *new_hse;
2159 
2160 		hse = container_of(fmt, struct hpp_sort_entry, hpp);
2161 		new_hse = memdup(hse, sizeof(*hse));
2162 		if (new_hse)
2163 			new_fmt = &new_hse->hpp;
2164 	} else if (perf_hpp__is_dynamic_entry(fmt)) {
2165 		struct hpp_dynamic_entry *hde, *new_hde;
2166 
2167 		hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
2168 		new_hde = memdup(hde, sizeof(*hde));
2169 		if (new_hde)
2170 			new_fmt = &new_hde->hpp;
2171 	} else {
2172 		new_fmt = memdup(fmt, sizeof(*fmt));
2173 	}
2174 
2175 	INIT_LIST_HEAD(&new_fmt->list);
2176 	INIT_LIST_HEAD(&new_fmt->sort_list);
2177 
2178 	return new_fmt;
2179 }
2180 
2181 static int parse_field_name(char *str, char **event, char **field, char **opt)
2182 {
2183 	char *event_name, *field_name, *opt_name;
2184 
2185 	event_name = str;
2186 	field_name = strchr(str, '.');
2187 
2188 	if (field_name) {
2189 		*field_name++ = '\0';
2190 	} else {
2191 		event_name = NULL;
2192 		field_name = str;
2193 	}
2194 
2195 	opt_name = strchr(field_name, '/');
2196 	if (opt_name)
2197 		*opt_name++ = '\0';
2198 
2199 	*event = event_name;
2200 	*field = field_name;
2201 	*opt   = opt_name;
2202 
2203 	return 0;
2204 }
2205 
2206 /* find match evsel using a given event name.  The event name can be:
2207  *   1. '%' + event index (e.g. '%1' for first event)
2208  *   2. full event name (e.g. sched:sched_switch)
2209  *   3. partial event name (should not contain ':')
2210  */
2211 static struct perf_evsel *find_evsel(struct perf_evlist *evlist, char *event_name)
2212 {
2213 	struct perf_evsel *evsel = NULL;
2214 	struct perf_evsel *pos;
2215 	bool full_name;
2216 
2217 	/* case 1 */
2218 	if (event_name[0] == '%') {
2219 		int nr = strtol(event_name+1, NULL, 0);
2220 
2221 		if (nr > evlist->nr_entries)
2222 			return NULL;
2223 
2224 		evsel = perf_evlist__first(evlist);
2225 		while (--nr > 0)
2226 			evsel = perf_evsel__next(evsel);
2227 
2228 		return evsel;
2229 	}
2230 
2231 	full_name = !!strchr(event_name, ':');
2232 	evlist__for_each_entry(evlist, pos) {
2233 		/* case 2 */
2234 		if (full_name && !strcmp(pos->name, event_name))
2235 			return pos;
2236 		/* case 3 */
2237 		if (!full_name && strstr(pos->name, event_name)) {
2238 			if (evsel) {
2239 				pr_debug("'%s' event is ambiguous: it can be %s or %s\n",
2240 					 event_name, evsel->name, pos->name);
2241 				return NULL;
2242 			}
2243 			evsel = pos;
2244 		}
2245 	}
2246 
2247 	return evsel;
2248 }
2249 
2250 static int __dynamic_dimension__add(struct perf_evsel *evsel,
2251 				    struct format_field *field,
2252 				    bool raw_trace, int level)
2253 {
2254 	struct hpp_dynamic_entry *hde;
2255 
2256 	hde = __alloc_dynamic_entry(evsel, field, level);
2257 	if (hde == NULL)
2258 		return -ENOMEM;
2259 
2260 	hde->raw_trace = raw_trace;
2261 
2262 	perf_hpp__register_sort_field(&hde->hpp);
2263 	return 0;
2264 }
2265 
2266 static int add_evsel_fields(struct perf_evsel *evsel, bool raw_trace, int level)
2267 {
2268 	int ret;
2269 	struct format_field *field;
2270 
2271 	field = evsel->tp_format->format.fields;
2272 	while (field) {
2273 		ret = __dynamic_dimension__add(evsel, field, raw_trace, level);
2274 		if (ret < 0)
2275 			return ret;
2276 
2277 		field = field->next;
2278 	}
2279 	return 0;
2280 }
2281 
2282 static int add_all_dynamic_fields(struct perf_evlist *evlist, bool raw_trace,
2283 				  int level)
2284 {
2285 	int ret;
2286 	struct perf_evsel *evsel;
2287 
2288 	evlist__for_each_entry(evlist, evsel) {
2289 		if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
2290 			continue;
2291 
2292 		ret = add_evsel_fields(evsel, raw_trace, level);
2293 		if (ret < 0)
2294 			return ret;
2295 	}
2296 	return 0;
2297 }
2298 
2299 static int add_all_matching_fields(struct perf_evlist *evlist,
2300 				   char *field_name, bool raw_trace, int level)
2301 {
2302 	int ret = -ESRCH;
2303 	struct perf_evsel *evsel;
2304 	struct format_field *field;
2305 
2306 	evlist__for_each_entry(evlist, evsel) {
2307 		if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
2308 			continue;
2309 
2310 		field = pevent_find_any_field(evsel->tp_format, field_name);
2311 		if (field == NULL)
2312 			continue;
2313 
2314 		ret = __dynamic_dimension__add(evsel, field, raw_trace, level);
2315 		if (ret < 0)
2316 			break;
2317 	}
2318 	return ret;
2319 }
2320 
2321 static int add_dynamic_entry(struct perf_evlist *evlist, const char *tok,
2322 			     int level)
2323 {
2324 	char *str, *event_name, *field_name, *opt_name;
2325 	struct perf_evsel *evsel;
2326 	struct format_field *field;
2327 	bool raw_trace = symbol_conf.raw_trace;
2328 	int ret = 0;
2329 
2330 	if (evlist == NULL)
2331 		return -ENOENT;
2332 
2333 	str = strdup(tok);
2334 	if (str == NULL)
2335 		return -ENOMEM;
2336 
2337 	if (parse_field_name(str, &event_name, &field_name, &opt_name) < 0) {
2338 		ret = -EINVAL;
2339 		goto out;
2340 	}
2341 
2342 	if (opt_name) {
2343 		if (strcmp(opt_name, "raw")) {
2344 			pr_debug("unsupported field option %s\n", opt_name);
2345 			ret = -EINVAL;
2346 			goto out;
2347 		}
2348 		raw_trace = true;
2349 	}
2350 
2351 	if (!strcmp(field_name, "trace_fields")) {
2352 		ret = add_all_dynamic_fields(evlist, raw_trace, level);
2353 		goto out;
2354 	}
2355 
2356 	if (event_name == NULL) {
2357 		ret = add_all_matching_fields(evlist, field_name, raw_trace, level);
2358 		goto out;
2359 	}
2360 
2361 	evsel = find_evsel(evlist, event_name);
2362 	if (evsel == NULL) {
2363 		pr_debug("Cannot find event: %s\n", event_name);
2364 		ret = -ENOENT;
2365 		goto out;
2366 	}
2367 
2368 	if (evsel->attr.type != PERF_TYPE_TRACEPOINT) {
2369 		pr_debug("%s is not a tracepoint event\n", event_name);
2370 		ret = -EINVAL;
2371 		goto out;
2372 	}
2373 
2374 	if (!strcmp(field_name, "*")) {
2375 		ret = add_evsel_fields(evsel, raw_trace, level);
2376 	} else {
2377 		field = pevent_find_any_field(evsel->tp_format, field_name);
2378 		if (field == NULL) {
2379 			pr_debug("Cannot find event field for %s.%s\n",
2380 				 event_name, field_name);
2381 			return -ENOENT;
2382 		}
2383 
2384 		ret = __dynamic_dimension__add(evsel, field, raw_trace, level);
2385 	}
2386 
2387 out:
2388 	free(str);
2389 	return ret;
2390 }
2391 
2392 static int __sort_dimension__add(struct sort_dimension *sd,
2393 				 struct perf_hpp_list *list,
2394 				 int level)
2395 {
2396 	if (sd->taken)
2397 		return 0;
2398 
2399 	if (__sort_dimension__add_hpp_sort(sd, list, level) < 0)
2400 		return -1;
2401 
2402 	if (sd->entry->se_collapse)
2403 		list->need_collapse = 1;
2404 
2405 	sd->taken = 1;
2406 
2407 	return 0;
2408 }
2409 
2410 static int __hpp_dimension__add(struct hpp_dimension *hd,
2411 				struct perf_hpp_list *list,
2412 				int level)
2413 {
2414 	struct perf_hpp_fmt *fmt;
2415 
2416 	if (hd->taken)
2417 		return 0;
2418 
2419 	fmt = __hpp_dimension__alloc_hpp(hd, level);
2420 	if (!fmt)
2421 		return -1;
2422 
2423 	hd->taken = 1;
2424 	perf_hpp_list__register_sort_field(list, fmt);
2425 	return 0;
2426 }
2427 
2428 static int __sort_dimension__add_output(struct perf_hpp_list *list,
2429 					struct sort_dimension *sd)
2430 {
2431 	if (sd->taken)
2432 		return 0;
2433 
2434 	if (__sort_dimension__add_hpp_output(sd, list) < 0)
2435 		return -1;
2436 
2437 	sd->taken = 1;
2438 	return 0;
2439 }
2440 
2441 static int __hpp_dimension__add_output(struct perf_hpp_list *list,
2442 				       struct hpp_dimension *hd)
2443 {
2444 	struct perf_hpp_fmt *fmt;
2445 
2446 	if (hd->taken)
2447 		return 0;
2448 
2449 	fmt = __hpp_dimension__alloc_hpp(hd, 0);
2450 	if (!fmt)
2451 		return -1;
2452 
2453 	hd->taken = 1;
2454 	perf_hpp_list__column_register(list, fmt);
2455 	return 0;
2456 }
2457 
2458 int hpp_dimension__add_output(unsigned col)
2459 {
2460 	BUG_ON(col >= PERF_HPP__MAX_INDEX);
2461 	return __hpp_dimension__add_output(&perf_hpp_list, &hpp_sort_dimensions[col]);
2462 }
2463 
2464 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
2465 			struct perf_evlist *evlist,
2466 			int level)
2467 {
2468 	unsigned int i;
2469 
2470 	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
2471 		struct sort_dimension *sd = &common_sort_dimensions[i];
2472 
2473 		if (strncasecmp(tok, sd->name, strlen(tok)))
2474 			continue;
2475 
2476 		if (sd->entry == &sort_parent) {
2477 			int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
2478 			if (ret) {
2479 				char err[BUFSIZ];
2480 
2481 				regerror(ret, &parent_regex, err, sizeof(err));
2482 				pr_err("Invalid regex: %s\n%s", parent_pattern, err);
2483 				return -EINVAL;
2484 			}
2485 			list->parent = 1;
2486 		} else if (sd->entry == &sort_sym) {
2487 			list->sym = 1;
2488 			/*
2489 			 * perf diff displays the performance difference amongst
2490 			 * two or more perf.data files. Those files could come
2491 			 * from different binaries. So we should not compare
2492 			 * their ips, but the name of symbol.
2493 			 */
2494 			if (sort__mode == SORT_MODE__DIFF)
2495 				sd->entry->se_collapse = sort__sym_sort;
2496 
2497 		} else if (sd->entry == &sort_dso) {
2498 			list->dso = 1;
2499 		} else if (sd->entry == &sort_socket) {
2500 			list->socket = 1;
2501 		} else if (sd->entry == &sort_thread) {
2502 			list->thread = 1;
2503 		} else if (sd->entry == &sort_comm) {
2504 			list->comm = 1;
2505 		}
2506 
2507 		return __sort_dimension__add(sd, list, level);
2508 	}
2509 
2510 	for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) {
2511 		struct hpp_dimension *hd = &hpp_sort_dimensions[i];
2512 
2513 		if (strncasecmp(tok, hd->name, strlen(tok)))
2514 			continue;
2515 
2516 		return __hpp_dimension__add(hd, list, level);
2517 	}
2518 
2519 	for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) {
2520 		struct sort_dimension *sd = &bstack_sort_dimensions[i];
2521 
2522 		if (strncasecmp(tok, sd->name, strlen(tok)))
2523 			continue;
2524 
2525 		if (sort__mode != SORT_MODE__BRANCH)
2526 			return -EINVAL;
2527 
2528 		if (sd->entry == &sort_sym_from || sd->entry == &sort_sym_to)
2529 			list->sym = 1;
2530 
2531 		__sort_dimension__add(sd, list, level);
2532 		return 0;
2533 	}
2534 
2535 	for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) {
2536 		struct sort_dimension *sd = &memory_sort_dimensions[i];
2537 
2538 		if (strncasecmp(tok, sd->name, strlen(tok)))
2539 			continue;
2540 
2541 		if (sort__mode != SORT_MODE__MEMORY)
2542 			return -EINVAL;
2543 
2544 		if (sd->entry == &sort_mem_dcacheline && cacheline_size == 0)
2545 			return -EINVAL;
2546 
2547 		if (sd->entry == &sort_mem_daddr_sym)
2548 			list->sym = 1;
2549 
2550 		__sort_dimension__add(sd, list, level);
2551 		return 0;
2552 	}
2553 
2554 	if (!add_dynamic_entry(evlist, tok, level))
2555 		return 0;
2556 
2557 	return -ESRCH;
2558 }
2559 
2560 static int setup_sort_list(struct perf_hpp_list *list, char *str,
2561 			   struct perf_evlist *evlist)
2562 {
2563 	char *tmp, *tok;
2564 	int ret = 0;
2565 	int level = 0;
2566 	int next_level = 1;
2567 	bool in_group = false;
2568 
2569 	do {
2570 		tok = str;
2571 		tmp = strpbrk(str, "{}, ");
2572 		if (tmp) {
2573 			if (in_group)
2574 				next_level = level;
2575 			else
2576 				next_level = level + 1;
2577 
2578 			if (*tmp == '{')
2579 				in_group = true;
2580 			else if (*tmp == '}')
2581 				in_group = false;
2582 
2583 			*tmp = '\0';
2584 			str = tmp + 1;
2585 		}
2586 
2587 		if (*tok) {
2588 			ret = sort_dimension__add(list, tok, evlist, level);
2589 			if (ret == -EINVAL) {
2590 				if (!cacheline_size && !strncasecmp(tok, "dcacheline", strlen(tok)))
2591 					pr_err("The \"dcacheline\" --sort key needs to know the cacheline size and it couldn't be determined on this system");
2592 				else
2593 					pr_err("Invalid --sort key: `%s'", tok);
2594 				break;
2595 			} else if (ret == -ESRCH) {
2596 				pr_err("Unknown --sort key: `%s'", tok);
2597 				break;
2598 			}
2599 		}
2600 
2601 		level = next_level;
2602 	} while (tmp);
2603 
2604 	return ret;
2605 }
2606 
2607 static const char *get_default_sort_order(struct perf_evlist *evlist)
2608 {
2609 	const char *default_sort_orders[] = {
2610 		default_sort_order,
2611 		default_branch_sort_order,
2612 		default_mem_sort_order,
2613 		default_top_sort_order,
2614 		default_diff_sort_order,
2615 		default_tracepoint_sort_order,
2616 	};
2617 	bool use_trace = true;
2618 	struct perf_evsel *evsel;
2619 
2620 	BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders));
2621 
2622 	if (evlist == NULL || perf_evlist__empty(evlist))
2623 		goto out_no_evlist;
2624 
2625 	evlist__for_each_entry(evlist, evsel) {
2626 		if (evsel->attr.type != PERF_TYPE_TRACEPOINT) {
2627 			use_trace = false;
2628 			break;
2629 		}
2630 	}
2631 
2632 	if (use_trace) {
2633 		sort__mode = SORT_MODE__TRACEPOINT;
2634 		if (symbol_conf.raw_trace)
2635 			return "trace_fields";
2636 	}
2637 out_no_evlist:
2638 	return default_sort_orders[sort__mode];
2639 }
2640 
2641 static int setup_sort_order(struct perf_evlist *evlist)
2642 {
2643 	char *new_sort_order;
2644 
2645 	/*
2646 	 * Append '+'-prefixed sort order to the default sort
2647 	 * order string.
2648 	 */
2649 	if (!sort_order || is_strict_order(sort_order))
2650 		return 0;
2651 
2652 	if (sort_order[1] == '\0') {
2653 		pr_err("Invalid --sort key: `+'");
2654 		return -EINVAL;
2655 	}
2656 
2657 	/*
2658 	 * We allocate new sort_order string, but we never free it,
2659 	 * because it's checked over the rest of the code.
2660 	 */
2661 	if (asprintf(&new_sort_order, "%s,%s",
2662 		     get_default_sort_order(evlist), sort_order + 1) < 0) {
2663 		pr_err("Not enough memory to set up --sort");
2664 		return -ENOMEM;
2665 	}
2666 
2667 	sort_order = new_sort_order;
2668 	return 0;
2669 }
2670 
2671 /*
2672  * Adds 'pre,' prefix into 'str' is 'pre' is
2673  * not already part of 'str'.
2674  */
2675 static char *prefix_if_not_in(const char *pre, char *str)
2676 {
2677 	char *n;
2678 
2679 	if (!str || strstr(str, pre))
2680 		return str;
2681 
2682 	if (asprintf(&n, "%s,%s", pre, str) < 0)
2683 		return NULL;
2684 
2685 	free(str);
2686 	return n;
2687 }
2688 
2689 static char *setup_overhead(char *keys)
2690 {
2691 	if (sort__mode == SORT_MODE__DIFF)
2692 		return keys;
2693 
2694 	keys = prefix_if_not_in("overhead", keys);
2695 
2696 	if (symbol_conf.cumulate_callchain)
2697 		keys = prefix_if_not_in("overhead_children", keys);
2698 
2699 	return keys;
2700 }
2701 
2702 static int __setup_sorting(struct perf_evlist *evlist)
2703 {
2704 	char *str;
2705 	const char *sort_keys;
2706 	int ret = 0;
2707 
2708 	ret = setup_sort_order(evlist);
2709 	if (ret)
2710 		return ret;
2711 
2712 	sort_keys = sort_order;
2713 	if (sort_keys == NULL) {
2714 		if (is_strict_order(field_order)) {
2715 			/*
2716 			 * If user specified field order but no sort order,
2717 			 * we'll honor it and not add default sort orders.
2718 			 */
2719 			return 0;
2720 		}
2721 
2722 		sort_keys = get_default_sort_order(evlist);
2723 	}
2724 
2725 	str = strdup(sort_keys);
2726 	if (str == NULL) {
2727 		pr_err("Not enough memory to setup sort keys");
2728 		return -ENOMEM;
2729 	}
2730 
2731 	/*
2732 	 * Prepend overhead fields for backward compatibility.
2733 	 */
2734 	if (!is_strict_order(field_order)) {
2735 		str = setup_overhead(str);
2736 		if (str == NULL) {
2737 			pr_err("Not enough memory to setup overhead keys");
2738 			return -ENOMEM;
2739 		}
2740 	}
2741 
2742 	ret = setup_sort_list(&perf_hpp_list, str, evlist);
2743 
2744 	free(str);
2745 	return ret;
2746 }
2747 
2748 void perf_hpp__set_elide(int idx, bool elide)
2749 {
2750 	struct perf_hpp_fmt *fmt;
2751 	struct hpp_sort_entry *hse;
2752 
2753 	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2754 		if (!perf_hpp__is_sort_entry(fmt))
2755 			continue;
2756 
2757 		hse = container_of(fmt, struct hpp_sort_entry, hpp);
2758 		if (hse->se->se_width_idx == idx) {
2759 			fmt->elide = elide;
2760 			break;
2761 		}
2762 	}
2763 }
2764 
2765 static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp)
2766 {
2767 	if (list && strlist__nr_entries(list) == 1) {
2768 		if (fp != NULL)
2769 			fprintf(fp, "# %s: %s\n", list_name,
2770 				strlist__entry(list, 0)->s);
2771 		return true;
2772 	}
2773 	return false;
2774 }
2775 
2776 static bool get_elide(int idx, FILE *output)
2777 {
2778 	switch (idx) {
2779 	case HISTC_SYMBOL:
2780 		return __get_elide(symbol_conf.sym_list, "symbol", output);
2781 	case HISTC_DSO:
2782 		return __get_elide(symbol_conf.dso_list, "dso", output);
2783 	case HISTC_COMM:
2784 		return __get_elide(symbol_conf.comm_list, "comm", output);
2785 	default:
2786 		break;
2787 	}
2788 
2789 	if (sort__mode != SORT_MODE__BRANCH)
2790 		return false;
2791 
2792 	switch (idx) {
2793 	case HISTC_SYMBOL_FROM:
2794 		return __get_elide(symbol_conf.sym_from_list, "sym_from", output);
2795 	case HISTC_SYMBOL_TO:
2796 		return __get_elide(symbol_conf.sym_to_list, "sym_to", output);
2797 	case HISTC_DSO_FROM:
2798 		return __get_elide(symbol_conf.dso_from_list, "dso_from", output);
2799 	case HISTC_DSO_TO:
2800 		return __get_elide(symbol_conf.dso_to_list, "dso_to", output);
2801 	default:
2802 		break;
2803 	}
2804 
2805 	return false;
2806 }
2807 
2808 void sort__setup_elide(FILE *output)
2809 {
2810 	struct perf_hpp_fmt *fmt;
2811 	struct hpp_sort_entry *hse;
2812 
2813 	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2814 		if (!perf_hpp__is_sort_entry(fmt))
2815 			continue;
2816 
2817 		hse = container_of(fmt, struct hpp_sort_entry, hpp);
2818 		fmt->elide = get_elide(hse->se->se_width_idx, output);
2819 	}
2820 
2821 	/*
2822 	 * It makes no sense to elide all of sort entries.
2823 	 * Just revert them to show up again.
2824 	 */
2825 	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2826 		if (!perf_hpp__is_sort_entry(fmt))
2827 			continue;
2828 
2829 		if (!fmt->elide)
2830 			return;
2831 	}
2832 
2833 	perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
2834 		if (!perf_hpp__is_sort_entry(fmt))
2835 			continue;
2836 
2837 		fmt->elide = false;
2838 	}
2839 }
2840 
2841 int output_field_add(struct perf_hpp_list *list, char *tok)
2842 {
2843 	unsigned int i;
2844 
2845 	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
2846 		struct sort_dimension *sd = &common_sort_dimensions[i];
2847 
2848 		if (strncasecmp(tok, sd->name, strlen(tok)))
2849 			continue;
2850 
2851 		return __sort_dimension__add_output(list, sd);
2852 	}
2853 
2854 	for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) {
2855 		struct hpp_dimension *hd = &hpp_sort_dimensions[i];
2856 
2857 		if (strncasecmp(tok, hd->name, strlen(tok)))
2858 			continue;
2859 
2860 		return __hpp_dimension__add_output(list, hd);
2861 	}
2862 
2863 	for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) {
2864 		struct sort_dimension *sd = &bstack_sort_dimensions[i];
2865 
2866 		if (strncasecmp(tok, sd->name, strlen(tok)))
2867 			continue;
2868 
2869 		return __sort_dimension__add_output(list, sd);
2870 	}
2871 
2872 	for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) {
2873 		struct sort_dimension *sd = &memory_sort_dimensions[i];
2874 
2875 		if (strncasecmp(tok, sd->name, strlen(tok)))
2876 			continue;
2877 
2878 		return __sort_dimension__add_output(list, sd);
2879 	}
2880 
2881 	return -ESRCH;
2882 }
2883 
2884 static int setup_output_list(struct perf_hpp_list *list, char *str)
2885 {
2886 	char *tmp, *tok;
2887 	int ret = 0;
2888 
2889 	for (tok = strtok_r(str, ", ", &tmp);
2890 			tok; tok = strtok_r(NULL, ", ", &tmp)) {
2891 		ret = output_field_add(list, tok);
2892 		if (ret == -EINVAL) {
2893 			ui__error("Invalid --fields key: `%s'", tok);
2894 			break;
2895 		} else if (ret == -ESRCH) {
2896 			ui__error("Unknown --fields key: `%s'", tok);
2897 			break;
2898 		}
2899 	}
2900 
2901 	return ret;
2902 }
2903 
2904 void reset_dimensions(void)
2905 {
2906 	unsigned int i;
2907 
2908 	for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++)
2909 		common_sort_dimensions[i].taken = 0;
2910 
2911 	for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++)
2912 		hpp_sort_dimensions[i].taken = 0;
2913 
2914 	for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++)
2915 		bstack_sort_dimensions[i].taken = 0;
2916 
2917 	for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++)
2918 		memory_sort_dimensions[i].taken = 0;
2919 }
2920 
2921 bool is_strict_order(const char *order)
2922 {
2923 	return order && (*order != '+');
2924 }
2925 
2926 static int __setup_output_field(void)
2927 {
2928 	char *str, *strp;
2929 	int ret = -EINVAL;
2930 
2931 	if (field_order == NULL)
2932 		return 0;
2933 
2934 	strp = str = strdup(field_order);
2935 	if (str == NULL) {
2936 		pr_err("Not enough memory to setup output fields");
2937 		return -ENOMEM;
2938 	}
2939 
2940 	if (!is_strict_order(field_order))
2941 		strp++;
2942 
2943 	if (!strlen(strp)) {
2944 		pr_err("Invalid --fields key: `+'");
2945 		goto out;
2946 	}
2947 
2948 	ret = setup_output_list(&perf_hpp_list, strp);
2949 
2950 out:
2951 	free(str);
2952 	return ret;
2953 }
2954 
2955 int setup_sorting(struct perf_evlist *evlist)
2956 {
2957 	int err;
2958 
2959 	err = __setup_sorting(evlist);
2960 	if (err < 0)
2961 		return err;
2962 
2963 	if (parent_pattern != default_parent_pattern) {
2964 		err = sort_dimension__add(&perf_hpp_list, "parent", evlist, -1);
2965 		if (err < 0)
2966 			return err;
2967 	}
2968 
2969 	reset_dimensions();
2970 
2971 	/*
2972 	 * perf diff doesn't use default hpp output fields.
2973 	 */
2974 	if (sort__mode != SORT_MODE__DIFF)
2975 		perf_hpp__init();
2976 
2977 	err = __setup_output_field();
2978 	if (err < 0)
2979 		return err;
2980 
2981 	/* copy sort keys to output fields */
2982 	perf_hpp__setup_output_field(&perf_hpp_list);
2983 	/* and then copy output fields to sort keys */
2984 	perf_hpp__append_sort_keys(&perf_hpp_list);
2985 
2986 	/* setup hists-specific output fields */
2987 	if (perf_hpp__setup_hists_formats(&perf_hpp_list, evlist) < 0)
2988 		return -1;
2989 
2990 	return 0;
2991 }
2992 
2993 void reset_output_field(void)
2994 {
2995 	perf_hpp_list.need_collapse = 0;
2996 	perf_hpp_list.parent = 0;
2997 	perf_hpp_list.sym = 0;
2998 	perf_hpp_list.dso = 0;
2999 
3000 	field_order = NULL;
3001 	sort_order = NULL;
3002 
3003 	reset_dimensions();
3004 	perf_hpp__reset_output_field(&perf_hpp_list);
3005 }
3006