1 // SPDX-License-Identifier: GPL-2.0
6 #include <linux/mman.h>
7 #include <linux/time64.h>
12 #include "cacheline.h"
17 #include "map_symbol.h"
25 #include <traceevent/event-parse.h>
26 #include "mem-events.h"
28 #include "time-utils.h"
31 #include <linux/kernel.h>
32 #include <linux/string.h>
35 const char default_parent_pattern
[] = "^sys_|^do_page_fault";
36 const char *parent_pattern
= default_parent_pattern
;
37 const char *default_sort_order
= "comm,dso,symbol";
38 const char default_branch_sort_order
[] = "comm,dso_from,symbol_from,symbol_to,cycles";
39 const char default_mem_sort_order
[] = "local_weight,mem,sym,dso,symbol_daddr,dso_daddr,snoop,tlb,locked";
40 const char default_top_sort_order
[] = "dso,symbol";
41 const char default_diff_sort_order
[] = "dso,symbol";
42 const char default_tracepoint_sort_order
[] = "trace";
43 const char *sort_order
;
44 const char *field_order
;
45 regex_t ignore_callees_regex
;
46 int have_ignore_callees
= 0;
47 enum sort_mode sort__mode
= SORT_MODE__NORMAL
;
50 * Replaces all occurrences of a char used with the:
52 * -t, --field-separator
54 * option, that uses a special separator character and don't pad with spaces,
55 * replacing all occurrences of this separator in symbol names (and other
56 * output) with a '.' character, that thus it's the only non valid separator.
58 static int repsep_snprintf(char *bf
, size_t size
, const char *fmt
, ...)
64 n
= vsnprintf(bf
, size
, fmt
, ap
);
65 if (symbol_conf
.field_sep
&& n
> 0) {
69 sep
= strchr(sep
, *symbol_conf
.field_sep
);
82 static int64_t cmp_null(const void *l
, const void *r
)
95 sort__thread_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
97 return right
->thread
->tid
- left
->thread
->tid
;
100 static int hist_entry__thread_snprintf(struct hist_entry
*he
, char *bf
,
101 size_t size
, unsigned int width
)
103 const char *comm
= thread__comm_str(he
->thread
);
105 width
= max(7U, width
) - 8;
106 return repsep_snprintf(bf
, size
, "%7d:%-*.*s", he
->thread
->tid
,
107 width
, width
, comm
?: "");
110 static int hist_entry__thread_filter(struct hist_entry
*he
, int type
, const void *arg
)
112 const struct thread
*th
= arg
;
114 if (type
!= HIST_FILTER__THREAD
)
117 return th
&& he
->thread
!= th
;
120 struct sort_entry sort_thread
= {
121 .se_header
= " Pid:Command",
122 .se_cmp
= sort__thread_cmp
,
123 .se_snprintf
= hist_entry__thread_snprintf
,
124 .se_filter
= hist_entry__thread_filter
,
125 .se_width_idx
= HISTC_THREAD
,
131 * We can't use pointer comparison in functions below,
132 * because it gives different results based on pointer
133 * values, which could break some sorting assumptions.
136 sort__comm_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
138 return strcmp(comm__str(right
->comm
), comm__str(left
->comm
));
142 sort__comm_collapse(struct hist_entry
*left
, struct hist_entry
*right
)
144 return strcmp(comm__str(right
->comm
), comm__str(left
->comm
));
148 sort__comm_sort(struct hist_entry
*left
, struct hist_entry
*right
)
150 return strcmp(comm__str(right
->comm
), comm__str(left
->comm
));
153 static int hist_entry__comm_snprintf(struct hist_entry
*he
, char *bf
,
154 size_t size
, unsigned int width
)
156 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, comm__str(he
->comm
));
159 struct sort_entry sort_comm
= {
160 .se_header
= "Command",
161 .se_cmp
= sort__comm_cmp
,
162 .se_collapse
= sort__comm_collapse
,
163 .se_sort
= sort__comm_sort
,
164 .se_snprintf
= hist_entry__comm_snprintf
,
165 .se_filter
= hist_entry__thread_filter
,
166 .se_width_idx
= HISTC_COMM
,
171 static int64_t _sort__dso_cmp(struct map
*map_l
, struct map
*map_r
)
173 struct dso
*dso_l
= map_l
? map_l
->dso
: NULL
;
174 struct dso
*dso_r
= map_r
? map_r
->dso
: NULL
;
175 const char *dso_name_l
, *dso_name_r
;
177 if (!dso_l
|| !dso_r
)
178 return cmp_null(dso_r
, dso_l
);
181 dso_name_l
= dso_l
->long_name
;
182 dso_name_r
= dso_r
->long_name
;
184 dso_name_l
= dso_l
->short_name
;
185 dso_name_r
= dso_r
->short_name
;
188 return strcmp(dso_name_l
, dso_name_r
);
192 sort__dso_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
194 return _sort__dso_cmp(right
->ms
.map
, left
->ms
.map
);
197 static int _hist_entry__dso_snprintf(struct map
*map
, char *bf
,
198 size_t size
, unsigned int width
)
200 if (map
&& map
->dso
) {
201 const char *dso_name
= verbose
> 0 ? map
->dso
->long_name
:
202 map
->dso
->short_name
;
203 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, dso_name
);
206 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "[unknown]");
209 static int hist_entry__dso_snprintf(struct hist_entry
*he
, char *bf
,
210 size_t size
, unsigned int width
)
212 return _hist_entry__dso_snprintf(he
->ms
.map
, bf
, size
, width
);
215 static int hist_entry__dso_filter(struct hist_entry
*he
, int type
, const void *arg
)
217 const struct dso
*dso
= arg
;
219 if (type
!= HIST_FILTER__DSO
)
222 return dso
&& (!he
->ms
.map
|| he
->ms
.map
->dso
!= dso
);
225 struct sort_entry sort_dso
= {
226 .se_header
= "Shared Object",
227 .se_cmp
= sort__dso_cmp
,
228 .se_snprintf
= hist_entry__dso_snprintf
,
229 .se_filter
= hist_entry__dso_filter
,
230 .se_width_idx
= HISTC_DSO
,
235 static int64_t _sort__addr_cmp(u64 left_ip
, u64 right_ip
)
237 return (int64_t)(right_ip
- left_ip
);
240 static int64_t _sort__sym_cmp(struct symbol
*sym_l
, struct symbol
*sym_r
)
242 if (!sym_l
|| !sym_r
)
243 return cmp_null(sym_l
, sym_r
);
248 if (sym_l
->inlined
|| sym_r
->inlined
) {
249 int ret
= strcmp(sym_l
->name
, sym_r
->name
);
253 if ((sym_l
->start
<= sym_r
->end
) && (sym_l
->end
>= sym_r
->start
))
257 if (sym_l
->start
!= sym_r
->start
)
258 return (int64_t)(sym_r
->start
- sym_l
->start
);
260 return (int64_t)(sym_r
->end
- sym_l
->end
);
264 sort__sym_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
268 if (!left
->ms
.sym
&& !right
->ms
.sym
)
269 return _sort__addr_cmp(left
->ip
, right
->ip
);
272 * comparing symbol address alone is not enough since it's a
273 * relative address within a dso.
275 if (!hists__has(left
->hists
, dso
) || hists__has(right
->hists
, dso
)) {
276 ret
= sort__dso_cmp(left
, right
);
281 return _sort__sym_cmp(left
->ms
.sym
, right
->ms
.sym
);
285 sort__sym_sort(struct hist_entry
*left
, struct hist_entry
*right
)
287 if (!left
->ms
.sym
|| !right
->ms
.sym
)
288 return cmp_null(left
->ms
.sym
, right
->ms
.sym
);
290 return strcmp(right
->ms
.sym
->name
, left
->ms
.sym
->name
);
293 static int _hist_entry__sym_snprintf(struct map_symbol
*ms
,
294 u64 ip
, char level
, char *bf
, size_t size
,
297 struct symbol
*sym
= ms
->sym
;
298 struct map
*map
= ms
->map
;
302 char o
= map
? dso__symtab_origin(map
->dso
) : '!';
303 ret
+= repsep_snprintf(bf
, size
, "%-#*llx %c ",
304 BITS_PER_LONG
/ 4 + 2, ip
, o
);
307 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "[%c] ", level
);
309 if (sym
->type
== STT_OBJECT
) {
310 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%s", sym
->name
);
311 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "+0x%llx",
312 ip
- map
->unmap_ip(map
, sym
->start
));
314 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%.*s",
318 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
,
322 size_t len
= BITS_PER_LONG
/ 4;
323 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%-#.*llx",
330 int hist_entry__sym_snprintf(struct hist_entry
*he
, char *bf
, size_t size
, unsigned int width
)
332 return _hist_entry__sym_snprintf(&he
->ms
, he
->ip
,
333 he
->level
, bf
, size
, width
);
336 static int hist_entry__sym_filter(struct hist_entry
*he
, int type
, const void *arg
)
338 const char *sym
= arg
;
340 if (type
!= HIST_FILTER__SYMBOL
)
343 return sym
&& (!he
->ms
.sym
|| !strstr(he
->ms
.sym
->name
, sym
));
346 struct sort_entry sort_sym
= {
347 .se_header
= "Symbol",
348 .se_cmp
= sort__sym_cmp
,
349 .se_sort
= sort__sym_sort
,
350 .se_snprintf
= hist_entry__sym_snprintf
,
351 .se_filter
= hist_entry__sym_filter
,
352 .se_width_idx
= HISTC_SYMBOL
,
357 char *hist_entry__srcline(struct hist_entry
*he
)
359 return map__srcline(he
->ms
.map
, he
->ip
, he
->ms
.sym
);
363 sort__srcline_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
366 left
->srcline
= hist_entry__srcline(left
);
368 right
->srcline
= hist_entry__srcline(right
);
370 return strcmp(right
->srcline
, left
->srcline
);
373 static int hist_entry__srcline_snprintf(struct hist_entry
*he
, char *bf
,
374 size_t size
, unsigned int width
)
377 he
->srcline
= hist_entry__srcline(he
);
379 return repsep_snprintf(bf
, size
, "%-.*s", width
, he
->srcline
);
382 struct sort_entry sort_srcline
= {
383 .se_header
= "Source:Line",
384 .se_cmp
= sort__srcline_cmp
,
385 .se_snprintf
= hist_entry__srcline_snprintf
,
386 .se_width_idx
= HISTC_SRCLINE
,
389 /* --sort srcline_from */
391 static char *addr_map_symbol__srcline(struct addr_map_symbol
*ams
)
393 return map__srcline(ams
->ms
.map
, ams
->al_addr
, ams
->ms
.sym
);
397 sort__srcline_from_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
399 if (!left
->branch_info
->srcline_from
)
400 left
->branch_info
->srcline_from
= addr_map_symbol__srcline(&left
->branch_info
->from
);
402 if (!right
->branch_info
->srcline_from
)
403 right
->branch_info
->srcline_from
= addr_map_symbol__srcline(&right
->branch_info
->from
);
405 return strcmp(right
->branch_info
->srcline_from
, left
->branch_info
->srcline_from
);
408 static int hist_entry__srcline_from_snprintf(struct hist_entry
*he
, char *bf
,
409 size_t size
, unsigned int width
)
411 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, he
->branch_info
->srcline_from
);
414 struct sort_entry sort_srcline_from
= {
415 .se_header
= "From Source:Line",
416 .se_cmp
= sort__srcline_from_cmp
,
417 .se_snprintf
= hist_entry__srcline_from_snprintf
,
418 .se_width_idx
= HISTC_SRCLINE_FROM
,
421 /* --sort srcline_to */
424 sort__srcline_to_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
426 if (!left
->branch_info
->srcline_to
)
427 left
->branch_info
->srcline_to
= addr_map_symbol__srcline(&left
->branch_info
->to
);
429 if (!right
->branch_info
->srcline_to
)
430 right
->branch_info
->srcline_to
= addr_map_symbol__srcline(&right
->branch_info
->to
);
432 return strcmp(right
->branch_info
->srcline_to
, left
->branch_info
->srcline_to
);
435 static int hist_entry__srcline_to_snprintf(struct hist_entry
*he
, char *bf
,
436 size_t size
, unsigned int width
)
438 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, he
->branch_info
->srcline_to
);
441 struct sort_entry sort_srcline_to
= {
442 .se_header
= "To Source:Line",
443 .se_cmp
= sort__srcline_to_cmp
,
444 .se_snprintf
= hist_entry__srcline_to_snprintf
,
445 .se_width_idx
= HISTC_SRCLINE_TO
,
448 static int hist_entry__sym_ipc_snprintf(struct hist_entry
*he
, char *bf
,
449 size_t size
, unsigned int width
)
452 struct symbol
*sym
= he
->ms
.sym
;
453 struct annotation
*notes
;
454 double ipc
= 0.0, coverage
= 0.0;
458 return repsep_snprintf(bf
, size
, "%-*s", width
, "-");
460 notes
= symbol__annotation(sym
);
462 if (notes
->hit_cycles
)
463 ipc
= notes
->hit_insn
/ ((double)notes
->hit_cycles
);
465 if (notes
->total_insn
) {
466 coverage
= notes
->cover_insn
* 100.0 /
467 ((double)notes
->total_insn
);
470 snprintf(tmp
, sizeof(tmp
), "%-5.2f [%5.1f%%]", ipc
, coverage
);
471 return repsep_snprintf(bf
, size
, "%-*s", width
, tmp
);
474 struct sort_entry sort_sym_ipc
= {
475 .se_header
= "IPC [IPC Coverage]",
476 .se_cmp
= sort__sym_cmp
,
477 .se_snprintf
= hist_entry__sym_ipc_snprintf
,
478 .se_width_idx
= HISTC_SYMBOL_IPC
,
481 static int hist_entry__sym_ipc_null_snprintf(struct hist_entry
*he
483 char *bf
, size_t size
,
488 snprintf(tmp
, sizeof(tmp
), "%-5s %2s", "-", "-");
489 return repsep_snprintf(bf
, size
, "%-*s", width
, tmp
);
492 struct sort_entry sort_sym_ipc_null
= {
493 .se_header
= "IPC [IPC Coverage]",
494 .se_cmp
= sort__sym_cmp
,
495 .se_snprintf
= hist_entry__sym_ipc_null_snprintf
,
496 .se_width_idx
= HISTC_SYMBOL_IPC
,
501 static char no_srcfile
[1];
503 static char *hist_entry__get_srcfile(struct hist_entry
*e
)
506 struct map
*map
= e
->ms
.map
;
511 sf
= __get_srcline(map
->dso
, map__rip_2objdump(map
, e
->ip
),
512 e
->ms
.sym
, false, true, true, e
->ip
);
513 if (!strcmp(sf
, SRCLINE_UNKNOWN
))
525 sort__srcfile_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
528 left
->srcfile
= hist_entry__get_srcfile(left
);
530 right
->srcfile
= hist_entry__get_srcfile(right
);
532 return strcmp(right
->srcfile
, left
->srcfile
);
535 static int hist_entry__srcfile_snprintf(struct hist_entry
*he
, char *bf
,
536 size_t size
, unsigned int width
)
539 he
->srcfile
= hist_entry__get_srcfile(he
);
541 return repsep_snprintf(bf
, size
, "%-.*s", width
, he
->srcfile
);
544 struct sort_entry sort_srcfile
= {
545 .se_header
= "Source File",
546 .se_cmp
= sort__srcfile_cmp
,
547 .se_snprintf
= hist_entry__srcfile_snprintf
,
548 .se_width_idx
= HISTC_SRCFILE
,
554 sort__parent_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
556 struct symbol
*sym_l
= left
->parent
;
557 struct symbol
*sym_r
= right
->parent
;
559 if (!sym_l
|| !sym_r
)
560 return cmp_null(sym_l
, sym_r
);
562 return strcmp(sym_r
->name
, sym_l
->name
);
565 static int hist_entry__parent_snprintf(struct hist_entry
*he
, char *bf
,
566 size_t size
, unsigned int width
)
568 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
,
569 he
->parent
? he
->parent
->name
: "[other]");
572 struct sort_entry sort_parent
= {
573 .se_header
= "Parent symbol",
574 .se_cmp
= sort__parent_cmp
,
575 .se_snprintf
= hist_entry__parent_snprintf
,
576 .se_width_idx
= HISTC_PARENT
,
582 sort__cpu_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
584 return right
->cpu
- left
->cpu
;
587 static int hist_entry__cpu_snprintf(struct hist_entry
*he
, char *bf
,
588 size_t size
, unsigned int width
)
590 return repsep_snprintf(bf
, size
, "%*.*d", width
, width
, he
->cpu
);
593 struct sort_entry sort_cpu
= {
595 .se_cmp
= sort__cpu_cmp
,
596 .se_snprintf
= hist_entry__cpu_snprintf
,
597 .se_width_idx
= HISTC_CPU
,
600 /* --sort cgroup_id */
602 static int64_t _sort__cgroup_dev_cmp(u64 left_dev
, u64 right_dev
)
604 return (int64_t)(right_dev
- left_dev
);
607 static int64_t _sort__cgroup_inode_cmp(u64 left_ino
, u64 right_ino
)
609 return (int64_t)(right_ino
- left_ino
);
613 sort__cgroup_id_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
617 ret
= _sort__cgroup_dev_cmp(right
->cgroup_id
.dev
, left
->cgroup_id
.dev
);
621 return _sort__cgroup_inode_cmp(right
->cgroup_id
.ino
,
622 left
->cgroup_id
.ino
);
625 static int hist_entry__cgroup_id_snprintf(struct hist_entry
*he
,
626 char *bf
, size_t size
,
627 unsigned int width __maybe_unused
)
629 return repsep_snprintf(bf
, size
, "%lu/0x%lx", he
->cgroup_id
.dev
,
633 struct sort_entry sort_cgroup_id
= {
634 .se_header
= "cgroup id (dev/inode)",
635 .se_cmp
= sort__cgroup_id_cmp
,
636 .se_snprintf
= hist_entry__cgroup_id_snprintf
,
637 .se_width_idx
= HISTC_CGROUP_ID
,
643 sort__cgroup_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
645 return right
->cgroup
- left
->cgroup
;
648 static int hist_entry__cgroup_snprintf(struct hist_entry
*he
,
649 char *bf
, size_t size
,
650 unsigned int width __maybe_unused
)
652 const char *cgrp_name
= "N/A";
655 struct cgroup
*cgrp
= cgroup__find(he
->ms
.maps
->machine
->env
,
658 cgrp_name
= cgrp
->name
;
660 cgrp_name
= "unknown";
663 return repsep_snprintf(bf
, size
, "%s", cgrp_name
);
666 struct sort_entry sort_cgroup
= {
667 .se_header
= "Cgroup",
668 .se_cmp
= sort__cgroup_cmp
,
669 .se_snprintf
= hist_entry__cgroup_snprintf
,
670 .se_width_idx
= HISTC_CGROUP
,
676 sort__socket_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
678 return right
->socket
- left
->socket
;
681 static int hist_entry__socket_snprintf(struct hist_entry
*he
, char *bf
,
682 size_t size
, unsigned int width
)
684 return repsep_snprintf(bf
, size
, "%*.*d", width
, width
-3, he
->socket
);
687 static int hist_entry__socket_filter(struct hist_entry
*he
, int type
, const void *arg
)
689 int sk
= *(const int *)arg
;
691 if (type
!= HIST_FILTER__SOCKET
)
694 return sk
>= 0 && he
->socket
!= sk
;
697 struct sort_entry sort_socket
= {
698 .se_header
= "Socket",
699 .se_cmp
= sort__socket_cmp
,
700 .se_snprintf
= hist_entry__socket_snprintf
,
701 .se_filter
= hist_entry__socket_filter
,
702 .se_width_idx
= HISTC_SOCKET
,
708 sort__time_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
710 return right
->time
- left
->time
;
713 static int hist_entry__time_snprintf(struct hist_entry
*he
, char *bf
,
714 size_t size
, unsigned int width
)
718 if (symbol_conf
.nanosecs
)
719 timestamp__scnprintf_nsec(he
->time
, he_time
,
722 timestamp__scnprintf_usec(he
->time
, he_time
,
725 return repsep_snprintf(bf
, size
, "%-.*s", width
, he_time
);
728 struct sort_entry sort_time
= {
730 .se_cmp
= sort__time_cmp
,
731 .se_snprintf
= hist_entry__time_snprintf
,
732 .se_width_idx
= HISTC_TIME
,
737 static char *get_trace_output(struct hist_entry
*he
)
739 struct trace_seq seq
;
741 struct tep_record rec
= {
742 .data
= he
->raw_data
,
743 .size
= he
->raw_size
,
746 evsel
= hists_to_evsel(he
->hists
);
748 trace_seq_init(&seq
);
749 if (symbol_conf
.raw_trace
) {
750 tep_print_fields(&seq
, he
->raw_data
, he
->raw_size
,
753 tep_print_event(evsel
->tp_format
->tep
,
754 &seq
, &rec
, "%s", TEP_PRINT_INFO
);
757 * Trim the buffer, it starts at 4KB and we're not going to
758 * add anything more to this buffer.
760 return realloc(seq
.buffer
, seq
.len
+ 1);
764 sort__trace_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
768 evsel
= hists_to_evsel(left
->hists
);
769 if (evsel
->core
.attr
.type
!= PERF_TYPE_TRACEPOINT
)
772 if (left
->trace_output
== NULL
)
773 left
->trace_output
= get_trace_output(left
);
774 if (right
->trace_output
== NULL
)
775 right
->trace_output
= get_trace_output(right
);
777 return strcmp(right
->trace_output
, left
->trace_output
);
780 static int hist_entry__trace_snprintf(struct hist_entry
*he
, char *bf
,
781 size_t size
, unsigned int width
)
785 evsel
= hists_to_evsel(he
->hists
);
786 if (evsel
->core
.attr
.type
!= PERF_TYPE_TRACEPOINT
)
787 return scnprintf(bf
, size
, "%-.*s", width
, "N/A");
789 if (he
->trace_output
== NULL
)
790 he
->trace_output
= get_trace_output(he
);
791 return repsep_snprintf(bf
, size
, "%-.*s", width
, he
->trace_output
);
794 struct sort_entry sort_trace
= {
795 .se_header
= "Trace output",
796 .se_cmp
= sort__trace_cmp
,
797 .se_snprintf
= hist_entry__trace_snprintf
,
798 .se_width_idx
= HISTC_TRACE
,
801 /* sort keys for branch stacks */
804 sort__dso_from_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
806 if (!left
->branch_info
|| !right
->branch_info
)
807 return cmp_null(left
->branch_info
, right
->branch_info
);
809 return _sort__dso_cmp(left
->branch_info
->from
.ms
.map
,
810 right
->branch_info
->from
.ms
.map
);
813 static int hist_entry__dso_from_snprintf(struct hist_entry
*he
, char *bf
,
814 size_t size
, unsigned int width
)
817 return _hist_entry__dso_snprintf(he
->branch_info
->from
.ms
.map
,
820 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
823 static int hist_entry__dso_from_filter(struct hist_entry
*he
, int type
,
826 const struct dso
*dso
= arg
;
828 if (type
!= HIST_FILTER__DSO
)
831 return dso
&& (!he
->branch_info
|| !he
->branch_info
->from
.ms
.map
||
832 he
->branch_info
->from
.ms
.map
->dso
!= dso
);
836 sort__dso_to_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
838 if (!left
->branch_info
|| !right
->branch_info
)
839 return cmp_null(left
->branch_info
, right
->branch_info
);
841 return _sort__dso_cmp(left
->branch_info
->to
.ms
.map
,
842 right
->branch_info
->to
.ms
.map
);
845 static int hist_entry__dso_to_snprintf(struct hist_entry
*he
, char *bf
,
846 size_t size
, unsigned int width
)
849 return _hist_entry__dso_snprintf(he
->branch_info
->to
.ms
.map
,
852 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
855 static int hist_entry__dso_to_filter(struct hist_entry
*he
, int type
,
858 const struct dso
*dso
= arg
;
860 if (type
!= HIST_FILTER__DSO
)
863 return dso
&& (!he
->branch_info
|| !he
->branch_info
->to
.ms
.map
||
864 he
->branch_info
->to
.ms
.map
->dso
!= dso
);
868 sort__sym_from_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
870 struct addr_map_symbol
*from_l
= &left
->branch_info
->from
;
871 struct addr_map_symbol
*from_r
= &right
->branch_info
->from
;
873 if (!left
->branch_info
|| !right
->branch_info
)
874 return cmp_null(left
->branch_info
, right
->branch_info
);
876 from_l
= &left
->branch_info
->from
;
877 from_r
= &right
->branch_info
->from
;
879 if (!from_l
->ms
.sym
&& !from_r
->ms
.sym
)
880 return _sort__addr_cmp(from_l
->addr
, from_r
->addr
);
882 return _sort__sym_cmp(from_l
->ms
.sym
, from_r
->ms
.sym
);
886 sort__sym_to_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
888 struct addr_map_symbol
*to_l
, *to_r
;
890 if (!left
->branch_info
|| !right
->branch_info
)
891 return cmp_null(left
->branch_info
, right
->branch_info
);
893 to_l
= &left
->branch_info
->to
;
894 to_r
= &right
->branch_info
->to
;
896 if (!to_l
->ms
.sym
&& !to_r
->ms
.sym
)
897 return _sort__addr_cmp(to_l
->addr
, to_r
->addr
);
899 return _sort__sym_cmp(to_l
->ms
.sym
, to_r
->ms
.sym
);
902 static int hist_entry__sym_from_snprintf(struct hist_entry
*he
, char *bf
,
903 size_t size
, unsigned int width
)
905 if (he
->branch_info
) {
906 struct addr_map_symbol
*from
= &he
->branch_info
->from
;
908 return _hist_entry__sym_snprintf(&from
->ms
, from
->al_addr
,
909 he
->level
, bf
, size
, width
);
912 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
915 static int hist_entry__sym_to_snprintf(struct hist_entry
*he
, char *bf
,
916 size_t size
, unsigned int width
)
918 if (he
->branch_info
) {
919 struct addr_map_symbol
*to
= &he
->branch_info
->to
;
921 return _hist_entry__sym_snprintf(&to
->ms
, to
->al_addr
,
922 he
->level
, bf
, size
, width
);
925 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
928 static int hist_entry__sym_from_filter(struct hist_entry
*he
, int type
,
931 const char *sym
= arg
;
933 if (type
!= HIST_FILTER__SYMBOL
)
936 return sym
&& !(he
->branch_info
&& he
->branch_info
->from
.ms
.sym
&&
937 strstr(he
->branch_info
->from
.ms
.sym
->name
, sym
));
940 static int hist_entry__sym_to_filter(struct hist_entry
*he
, int type
,
943 const char *sym
= arg
;
945 if (type
!= HIST_FILTER__SYMBOL
)
948 return sym
&& !(he
->branch_info
&& he
->branch_info
->to
.ms
.sym
&&
949 strstr(he
->branch_info
->to
.ms
.sym
->name
, sym
));
952 struct sort_entry sort_dso_from
= {
953 .se_header
= "Source Shared Object",
954 .se_cmp
= sort__dso_from_cmp
,
955 .se_snprintf
= hist_entry__dso_from_snprintf
,
956 .se_filter
= hist_entry__dso_from_filter
,
957 .se_width_idx
= HISTC_DSO_FROM
,
960 struct sort_entry sort_dso_to
= {
961 .se_header
= "Target Shared Object",
962 .se_cmp
= sort__dso_to_cmp
,
963 .se_snprintf
= hist_entry__dso_to_snprintf
,
964 .se_filter
= hist_entry__dso_to_filter
,
965 .se_width_idx
= HISTC_DSO_TO
,
968 struct sort_entry sort_sym_from
= {
969 .se_header
= "Source Symbol",
970 .se_cmp
= sort__sym_from_cmp
,
971 .se_snprintf
= hist_entry__sym_from_snprintf
,
972 .se_filter
= hist_entry__sym_from_filter
,
973 .se_width_idx
= HISTC_SYMBOL_FROM
,
976 struct sort_entry sort_sym_to
= {
977 .se_header
= "Target Symbol",
978 .se_cmp
= sort__sym_to_cmp
,
979 .se_snprintf
= hist_entry__sym_to_snprintf
,
980 .se_filter
= hist_entry__sym_to_filter
,
981 .se_width_idx
= HISTC_SYMBOL_TO
,
985 sort__mispredict_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
989 if (!left
->branch_info
|| !right
->branch_info
)
990 return cmp_null(left
->branch_info
, right
->branch_info
);
992 mp
= left
->branch_info
->flags
.mispred
!= right
->branch_info
->flags
.mispred
;
993 p
= left
->branch_info
->flags
.predicted
!= right
->branch_info
->flags
.predicted
;
997 static int hist_entry__mispredict_snprintf(struct hist_entry
*he
, char *bf
,
998 size_t size
, unsigned int width
){
999 static const char *out
= "N/A";
1001 if (he
->branch_info
) {
1002 if (he
->branch_info
->flags
.predicted
)
1004 else if (he
->branch_info
->flags
.mispred
)
1008 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, out
);
1012 sort__cycles_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1014 if (!left
->branch_info
|| !right
->branch_info
)
1015 return cmp_null(left
->branch_info
, right
->branch_info
);
1017 return left
->branch_info
->flags
.cycles
-
1018 right
->branch_info
->flags
.cycles
;
1021 static int hist_entry__cycles_snprintf(struct hist_entry
*he
, char *bf
,
1022 size_t size
, unsigned int width
)
1024 if (!he
->branch_info
)
1025 return scnprintf(bf
, size
, "%-.*s", width
, "N/A");
1026 if (he
->branch_info
->flags
.cycles
== 0)
1027 return repsep_snprintf(bf
, size
, "%-*s", width
, "-");
1028 return repsep_snprintf(bf
, size
, "%-*hd", width
,
1029 he
->branch_info
->flags
.cycles
);
1032 struct sort_entry sort_cycles
= {
1033 .se_header
= "Basic Block Cycles",
1034 .se_cmp
= sort__cycles_cmp
,
1035 .se_snprintf
= hist_entry__cycles_snprintf
,
1036 .se_width_idx
= HISTC_CYCLES
,
1039 /* --sort daddr_sym */
1041 sort__daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1043 uint64_t l
= 0, r
= 0;
1046 l
= left
->mem_info
->daddr
.addr
;
1047 if (right
->mem_info
)
1048 r
= right
->mem_info
->daddr
.addr
;
1050 return (int64_t)(r
- l
);
1053 static int hist_entry__daddr_snprintf(struct hist_entry
*he
, char *bf
,
1054 size_t size
, unsigned int width
)
1057 struct map_symbol
*ms
= NULL
;
1060 addr
= he
->mem_info
->daddr
.addr
;
1061 ms
= &he
->mem_info
->daddr
.ms
;
1063 return _hist_entry__sym_snprintf(ms
, addr
, he
->level
, bf
, size
, width
);
1067 sort__iaddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1069 uint64_t l
= 0, r
= 0;
1072 l
= left
->mem_info
->iaddr
.addr
;
1073 if (right
->mem_info
)
1074 r
= right
->mem_info
->iaddr
.addr
;
1076 return (int64_t)(r
- l
);
1079 static int hist_entry__iaddr_snprintf(struct hist_entry
*he
, char *bf
,
1080 size_t size
, unsigned int width
)
1083 struct map_symbol
*ms
= NULL
;
1086 addr
= he
->mem_info
->iaddr
.addr
;
1087 ms
= &he
->mem_info
->iaddr
.ms
;
1089 return _hist_entry__sym_snprintf(ms
, addr
, he
->level
, bf
, size
, width
);
1093 sort__dso_daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1095 struct map
*map_l
= NULL
;
1096 struct map
*map_r
= NULL
;
1099 map_l
= left
->mem_info
->daddr
.ms
.map
;
1100 if (right
->mem_info
)
1101 map_r
= right
->mem_info
->daddr
.ms
.map
;
1103 return _sort__dso_cmp(map_l
, map_r
);
1106 static int hist_entry__dso_daddr_snprintf(struct hist_entry
*he
, char *bf
,
1107 size_t size
, unsigned int width
)
1109 struct map
*map
= NULL
;
1112 map
= he
->mem_info
->daddr
.ms
.map
;
1114 return _hist_entry__dso_snprintf(map
, bf
, size
, width
);
1118 sort__locked_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1120 union perf_mem_data_src data_src_l
;
1121 union perf_mem_data_src data_src_r
;
1124 data_src_l
= left
->mem_info
->data_src
;
1126 data_src_l
.mem_lock
= PERF_MEM_LOCK_NA
;
1128 if (right
->mem_info
)
1129 data_src_r
= right
->mem_info
->data_src
;
1131 data_src_r
.mem_lock
= PERF_MEM_LOCK_NA
;
1133 return (int64_t)(data_src_r
.mem_lock
- data_src_l
.mem_lock
);
1136 static int hist_entry__locked_snprintf(struct hist_entry
*he
, char *bf
,
1137 size_t size
, unsigned int width
)
1141 perf_mem__lck_scnprintf(out
, sizeof(out
), he
->mem_info
);
1142 return repsep_snprintf(bf
, size
, "%.*s", width
, out
);
1146 sort__tlb_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1148 union perf_mem_data_src data_src_l
;
1149 union perf_mem_data_src data_src_r
;
1152 data_src_l
= left
->mem_info
->data_src
;
1154 data_src_l
.mem_dtlb
= PERF_MEM_TLB_NA
;
1156 if (right
->mem_info
)
1157 data_src_r
= right
->mem_info
->data_src
;
1159 data_src_r
.mem_dtlb
= PERF_MEM_TLB_NA
;
1161 return (int64_t)(data_src_r
.mem_dtlb
- data_src_l
.mem_dtlb
);
1164 static int hist_entry__tlb_snprintf(struct hist_entry
*he
, char *bf
,
1165 size_t size
, unsigned int width
)
1169 perf_mem__tlb_scnprintf(out
, sizeof(out
), he
->mem_info
);
1170 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1174 sort__lvl_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1176 union perf_mem_data_src data_src_l
;
1177 union perf_mem_data_src data_src_r
;
1180 data_src_l
= left
->mem_info
->data_src
;
1182 data_src_l
.mem_lvl
= PERF_MEM_LVL_NA
;
1184 if (right
->mem_info
)
1185 data_src_r
= right
->mem_info
->data_src
;
1187 data_src_r
.mem_lvl
= PERF_MEM_LVL_NA
;
1189 return (int64_t)(data_src_r
.mem_lvl
- data_src_l
.mem_lvl
);
1192 static int hist_entry__lvl_snprintf(struct hist_entry
*he
, char *bf
,
1193 size_t size
, unsigned int width
)
1197 perf_mem__lvl_scnprintf(out
, sizeof(out
), he
->mem_info
);
1198 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1202 sort__snoop_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1204 union perf_mem_data_src data_src_l
;
1205 union perf_mem_data_src data_src_r
;
1208 data_src_l
= left
->mem_info
->data_src
;
1210 data_src_l
.mem_snoop
= PERF_MEM_SNOOP_NA
;
1212 if (right
->mem_info
)
1213 data_src_r
= right
->mem_info
->data_src
;
1215 data_src_r
.mem_snoop
= PERF_MEM_SNOOP_NA
;
1217 return (int64_t)(data_src_r
.mem_snoop
- data_src_l
.mem_snoop
);
1220 static int hist_entry__snoop_snprintf(struct hist_entry
*he
, char *bf
,
1221 size_t size
, unsigned int width
)
1225 perf_mem__snp_scnprintf(out
, sizeof(out
), he
->mem_info
);
1226 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1230 sort__dcacheline_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1233 struct map
*l_map
, *r_map
;
1236 if (!left
->mem_info
) return -1;
1237 if (!right
->mem_info
) return 1;
1239 /* group event types together */
1240 if (left
->cpumode
> right
->cpumode
) return -1;
1241 if (left
->cpumode
< right
->cpumode
) return 1;
1243 l_map
= left
->mem_info
->daddr
.ms
.map
;
1244 r_map
= right
->mem_info
->daddr
.ms
.map
;
1246 /* if both are NULL, jump to sort on al_addr instead */
1247 if (!l_map
&& !r_map
)
1250 if (!l_map
) return -1;
1251 if (!r_map
) return 1;
1253 rc
= dso__cmp_id(l_map
->dso
, r_map
->dso
);
1257 * Addresses with no major/minor numbers are assumed to be
1258 * anonymous in userspace. Sort those on pid then address.
1260 * The kernel and non-zero major/minor mapped areas are
1261 * assumed to be unity mapped. Sort those on address.
1264 if ((left
->cpumode
!= PERF_RECORD_MISC_KERNEL
) &&
1265 (!(l_map
->flags
& MAP_SHARED
)) &&
1266 !l_map
->dso
->id
.maj
&& !l_map
->dso
->id
.min
&&
1267 !l_map
->dso
->id
.ino
&& !l_map
->dso
->id
.ino_generation
) {
1268 /* userspace anonymous */
1270 if (left
->thread
->pid_
> right
->thread
->pid_
) return -1;
1271 if (left
->thread
->pid_
< right
->thread
->pid_
) return 1;
1275 /* al_addr does all the right addr - start + offset calculations */
1276 l
= cl_address(left
->mem_info
->daddr
.al_addr
);
1277 r
= cl_address(right
->mem_info
->daddr
.al_addr
);
1279 if (l
> r
) return -1;
1280 if (l
< r
) return 1;
1285 static int hist_entry__dcacheline_snprintf(struct hist_entry
*he
, char *bf
,
1286 size_t size
, unsigned int width
)
1290 struct map_symbol
*ms
= NULL
;
1291 char level
= he
->level
;
1294 struct map
*map
= he
->mem_info
->daddr
.ms
.map
;
1296 addr
= cl_address(he
->mem_info
->daddr
.al_addr
);
1297 ms
= &he
->mem_info
->daddr
.ms
;
1299 /* print [s] for shared data mmaps */
1300 if ((he
->cpumode
!= PERF_RECORD_MISC_KERNEL
) &&
1301 map
&& !(map
->prot
& PROT_EXEC
) &&
1302 (map
->flags
& MAP_SHARED
) &&
1303 (map
->dso
->id
.maj
|| map
->dso
->id
.min
||
1304 map
->dso
->id
.ino
|| map
->dso
->id
.ino_generation
))
1309 return _hist_entry__sym_snprintf(ms
, addr
, level
, bf
, size
, width
);
1312 struct sort_entry sort_mispredict
= {
1313 .se_header
= "Branch Mispredicted",
1314 .se_cmp
= sort__mispredict_cmp
,
1315 .se_snprintf
= hist_entry__mispredict_snprintf
,
1316 .se_width_idx
= HISTC_MISPREDICT
,
1319 static u64
he_weight(struct hist_entry
*he
)
1321 return he
->stat
.nr_events
? he
->stat
.weight
/ he
->stat
.nr_events
: 0;
1325 sort__local_weight_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1327 return he_weight(left
) - he_weight(right
);
1330 static int hist_entry__local_weight_snprintf(struct hist_entry
*he
, char *bf
,
1331 size_t size
, unsigned int width
)
1333 return repsep_snprintf(bf
, size
, "%-*llu", width
, he_weight(he
));
1336 struct sort_entry sort_local_weight
= {
1337 .se_header
= "Local Weight",
1338 .se_cmp
= sort__local_weight_cmp
,
1339 .se_snprintf
= hist_entry__local_weight_snprintf
,
1340 .se_width_idx
= HISTC_LOCAL_WEIGHT
,
1344 sort__global_weight_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1346 return left
->stat
.weight
- right
->stat
.weight
;
1349 static int hist_entry__global_weight_snprintf(struct hist_entry
*he
, char *bf
,
1350 size_t size
, unsigned int width
)
1352 return repsep_snprintf(bf
, size
, "%-*llu", width
, he
->stat
.weight
);
1355 struct sort_entry sort_global_weight
= {
1356 .se_header
= "Weight",
1357 .se_cmp
= sort__global_weight_cmp
,
1358 .se_snprintf
= hist_entry__global_weight_snprintf
,
1359 .se_width_idx
= HISTC_GLOBAL_WEIGHT
,
1362 struct sort_entry sort_mem_daddr_sym
= {
1363 .se_header
= "Data Symbol",
1364 .se_cmp
= sort__daddr_cmp
,
1365 .se_snprintf
= hist_entry__daddr_snprintf
,
1366 .se_width_idx
= HISTC_MEM_DADDR_SYMBOL
,
1369 struct sort_entry sort_mem_iaddr_sym
= {
1370 .se_header
= "Code Symbol",
1371 .se_cmp
= sort__iaddr_cmp
,
1372 .se_snprintf
= hist_entry__iaddr_snprintf
,
1373 .se_width_idx
= HISTC_MEM_IADDR_SYMBOL
,
1376 struct sort_entry sort_mem_daddr_dso
= {
1377 .se_header
= "Data Object",
1378 .se_cmp
= sort__dso_daddr_cmp
,
1379 .se_snprintf
= hist_entry__dso_daddr_snprintf
,
1380 .se_width_idx
= HISTC_MEM_DADDR_DSO
,
1383 struct sort_entry sort_mem_locked
= {
1384 .se_header
= "Locked",
1385 .se_cmp
= sort__locked_cmp
,
1386 .se_snprintf
= hist_entry__locked_snprintf
,
1387 .se_width_idx
= HISTC_MEM_LOCKED
,
1390 struct sort_entry sort_mem_tlb
= {
1391 .se_header
= "TLB access",
1392 .se_cmp
= sort__tlb_cmp
,
1393 .se_snprintf
= hist_entry__tlb_snprintf
,
1394 .se_width_idx
= HISTC_MEM_TLB
,
1397 struct sort_entry sort_mem_lvl
= {
1398 .se_header
= "Memory access",
1399 .se_cmp
= sort__lvl_cmp
,
1400 .se_snprintf
= hist_entry__lvl_snprintf
,
1401 .se_width_idx
= HISTC_MEM_LVL
,
1404 struct sort_entry sort_mem_snoop
= {
1405 .se_header
= "Snoop",
1406 .se_cmp
= sort__snoop_cmp
,
1407 .se_snprintf
= hist_entry__snoop_snprintf
,
1408 .se_width_idx
= HISTC_MEM_SNOOP
,
1411 struct sort_entry sort_mem_dcacheline
= {
1412 .se_header
= "Data Cacheline",
1413 .se_cmp
= sort__dcacheline_cmp
,
1414 .se_snprintf
= hist_entry__dcacheline_snprintf
,
1415 .se_width_idx
= HISTC_MEM_DCACHELINE
,
1419 sort__phys_daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1421 uint64_t l
= 0, r
= 0;
1424 l
= left
->mem_info
->daddr
.phys_addr
;
1425 if (right
->mem_info
)
1426 r
= right
->mem_info
->daddr
.phys_addr
;
1428 return (int64_t)(r
- l
);
1431 static int hist_entry__phys_daddr_snprintf(struct hist_entry
*he
, char *bf
,
1432 size_t size
, unsigned int width
)
1436 size_t len
= BITS_PER_LONG
/ 4;
1438 addr
= he
->mem_info
->daddr
.phys_addr
;
1440 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "[%c] ", he
->level
);
1442 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%-#.*llx", len
, addr
);
1444 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%-*s", width
- ret
, "");
1452 struct sort_entry sort_mem_phys_daddr
= {
1453 .se_header
= "Data Physical Address",
1454 .se_cmp
= sort__phys_daddr_cmp
,
1455 .se_snprintf
= hist_entry__phys_daddr_snprintf
,
1456 .se_width_idx
= HISTC_MEM_PHYS_DADDR
,
1460 sort__abort_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1462 if (!left
->branch_info
|| !right
->branch_info
)
1463 return cmp_null(left
->branch_info
, right
->branch_info
);
1465 return left
->branch_info
->flags
.abort
!=
1466 right
->branch_info
->flags
.abort
;
1469 static int hist_entry__abort_snprintf(struct hist_entry
*he
, char *bf
,
1470 size_t size
, unsigned int width
)
1472 static const char *out
= "N/A";
1474 if (he
->branch_info
) {
1475 if (he
->branch_info
->flags
.abort
)
1481 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1484 struct sort_entry sort_abort
= {
1485 .se_header
= "Transaction abort",
1486 .se_cmp
= sort__abort_cmp
,
1487 .se_snprintf
= hist_entry__abort_snprintf
,
1488 .se_width_idx
= HISTC_ABORT
,
1492 sort__in_tx_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1494 if (!left
->branch_info
|| !right
->branch_info
)
1495 return cmp_null(left
->branch_info
, right
->branch_info
);
1497 return left
->branch_info
->flags
.in_tx
!=
1498 right
->branch_info
->flags
.in_tx
;
1501 static int hist_entry__in_tx_snprintf(struct hist_entry
*he
, char *bf
,
1502 size_t size
, unsigned int width
)
1504 static const char *out
= "N/A";
1506 if (he
->branch_info
) {
1507 if (he
->branch_info
->flags
.in_tx
)
1513 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1516 struct sort_entry sort_in_tx
= {
1517 .se_header
= "Branch in transaction",
1518 .se_cmp
= sort__in_tx_cmp
,
1519 .se_snprintf
= hist_entry__in_tx_snprintf
,
1520 .se_width_idx
= HISTC_IN_TX
,
1524 sort__transaction_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1526 return left
->transaction
- right
->transaction
;
1529 static inline char *add_str(char *p
, const char *str
)
1532 return p
+ strlen(str
);
1535 static struct txbit
{
1540 { PERF_TXN_ELISION
, "EL ", 0 },
1541 { PERF_TXN_TRANSACTION
, "TX ", 1 },
1542 { PERF_TXN_SYNC
, "SYNC ", 1 },
1543 { PERF_TXN_ASYNC
, "ASYNC ", 0 },
1544 { PERF_TXN_RETRY
, "RETRY ", 0 },
1545 { PERF_TXN_CONFLICT
, "CON ", 0 },
1546 { PERF_TXN_CAPACITY_WRITE
, "CAP-WRITE ", 1 },
1547 { PERF_TXN_CAPACITY_READ
, "CAP-READ ", 0 },
1551 int hist_entry__transaction_len(void)
1556 for (i
= 0; txbits
[i
].name
; i
++) {
1557 if (!txbits
[i
].skip_for_len
)
1558 len
+= strlen(txbits
[i
].name
);
1560 len
+= 4; /* :XX<space> */
1564 static int hist_entry__transaction_snprintf(struct hist_entry
*he
, char *bf
,
1565 size_t size
, unsigned int width
)
1567 u64 t
= he
->transaction
;
1573 for (i
= 0; txbits
[i
].name
; i
++)
1574 if (txbits
[i
].flag
& t
)
1575 p
= add_str(p
, txbits
[i
].name
);
1576 if (t
&& !(t
& (PERF_TXN_SYNC
|PERF_TXN_ASYNC
)))
1577 p
= add_str(p
, "NEITHER ");
1578 if (t
& PERF_TXN_ABORT_MASK
) {
1579 sprintf(p
, ":%" PRIx64
,
1580 (t
& PERF_TXN_ABORT_MASK
) >>
1581 PERF_TXN_ABORT_SHIFT
);
1585 return repsep_snprintf(bf
, size
, "%-*s", width
, buf
);
1588 struct sort_entry sort_transaction
= {
1589 .se_header
= "Transaction ",
1590 .se_cmp
= sort__transaction_cmp
,
1591 .se_snprintf
= hist_entry__transaction_snprintf
,
1592 .se_width_idx
= HISTC_TRANSACTION
,
1595 /* --sort symbol_size */
1597 static int64_t _sort__sym_size_cmp(struct symbol
*sym_l
, struct symbol
*sym_r
)
1599 int64_t size_l
= sym_l
!= NULL
? symbol__size(sym_l
) : 0;
1600 int64_t size_r
= sym_r
!= NULL
? symbol__size(sym_r
) : 0;
1602 return size_l
< size_r
? -1 :
1603 size_l
== size_r
? 0 : 1;
1607 sort__sym_size_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1609 return _sort__sym_size_cmp(right
->ms
.sym
, left
->ms
.sym
);
1612 static int _hist_entry__sym_size_snprintf(struct symbol
*sym
, char *bf
,
1613 size_t bf_size
, unsigned int width
)
1616 return repsep_snprintf(bf
, bf_size
, "%*d", width
, symbol__size(sym
));
1618 return repsep_snprintf(bf
, bf_size
, "%*s", width
, "unknown");
1621 static int hist_entry__sym_size_snprintf(struct hist_entry
*he
, char *bf
,
1622 size_t size
, unsigned int width
)
1624 return _hist_entry__sym_size_snprintf(he
->ms
.sym
, bf
, size
, width
);
1627 struct sort_entry sort_sym_size
= {
1628 .se_header
= "Symbol size",
1629 .se_cmp
= sort__sym_size_cmp
,
1630 .se_snprintf
= hist_entry__sym_size_snprintf
,
1631 .se_width_idx
= HISTC_SYM_SIZE
,
1634 /* --sort dso_size */
1636 static int64_t _sort__dso_size_cmp(struct map
*map_l
, struct map
*map_r
)
1638 int64_t size_l
= map_l
!= NULL
? map__size(map_l
) : 0;
1639 int64_t size_r
= map_r
!= NULL
? map__size(map_r
) : 0;
1641 return size_l
< size_r
? -1 :
1642 size_l
== size_r
? 0 : 1;
1646 sort__dso_size_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1648 return _sort__dso_size_cmp(right
->ms
.map
, left
->ms
.map
);
1651 static int _hist_entry__dso_size_snprintf(struct map
*map
, char *bf
,
1652 size_t bf_size
, unsigned int width
)
1654 if (map
&& map
->dso
)
1655 return repsep_snprintf(bf
, bf_size
, "%*d", width
,
1658 return repsep_snprintf(bf
, bf_size
, "%*s", width
, "unknown");
1661 static int hist_entry__dso_size_snprintf(struct hist_entry
*he
, char *bf
,
1662 size_t size
, unsigned int width
)
1664 return _hist_entry__dso_size_snprintf(he
->ms
.map
, bf
, size
, width
);
1667 struct sort_entry sort_dso_size
= {
1668 .se_header
= "DSO size",
1669 .se_cmp
= sort__dso_size_cmp
,
1670 .se_snprintf
= hist_entry__dso_size_snprintf
,
1671 .se_width_idx
= HISTC_DSO_SIZE
,
1675 struct sort_dimension
{
1677 struct sort_entry
*entry
;
1681 #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }
1683 static struct sort_dimension common_sort_dimensions
[] = {
1684 DIM(SORT_PID
, "pid", sort_thread
),
1685 DIM(SORT_COMM
, "comm", sort_comm
),
1686 DIM(SORT_DSO
, "dso", sort_dso
),
1687 DIM(SORT_SYM
, "symbol", sort_sym
),
1688 DIM(SORT_PARENT
, "parent", sort_parent
),
1689 DIM(SORT_CPU
, "cpu", sort_cpu
),
1690 DIM(SORT_SOCKET
, "socket", sort_socket
),
1691 DIM(SORT_SRCLINE
, "srcline", sort_srcline
),
1692 DIM(SORT_SRCFILE
, "srcfile", sort_srcfile
),
1693 DIM(SORT_LOCAL_WEIGHT
, "local_weight", sort_local_weight
),
1694 DIM(SORT_GLOBAL_WEIGHT
, "weight", sort_global_weight
),
1695 DIM(SORT_TRANSACTION
, "transaction", sort_transaction
),
1696 DIM(SORT_TRACE
, "trace", sort_trace
),
1697 DIM(SORT_SYM_SIZE
, "symbol_size", sort_sym_size
),
1698 DIM(SORT_DSO_SIZE
, "dso_size", sort_dso_size
),
1699 DIM(SORT_CGROUP
, "cgroup", sort_cgroup
),
1700 DIM(SORT_CGROUP_ID
, "cgroup_id", sort_cgroup_id
),
1701 DIM(SORT_SYM_IPC_NULL
, "ipc_null", sort_sym_ipc_null
),
1702 DIM(SORT_TIME
, "time", sort_time
),
1707 #define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) }
1709 static struct sort_dimension bstack_sort_dimensions
[] = {
1710 DIM(SORT_DSO_FROM
, "dso_from", sort_dso_from
),
1711 DIM(SORT_DSO_TO
, "dso_to", sort_dso_to
),
1712 DIM(SORT_SYM_FROM
, "symbol_from", sort_sym_from
),
1713 DIM(SORT_SYM_TO
, "symbol_to", sort_sym_to
),
1714 DIM(SORT_MISPREDICT
, "mispredict", sort_mispredict
),
1715 DIM(SORT_IN_TX
, "in_tx", sort_in_tx
),
1716 DIM(SORT_ABORT
, "abort", sort_abort
),
1717 DIM(SORT_CYCLES
, "cycles", sort_cycles
),
1718 DIM(SORT_SRCLINE_FROM
, "srcline_from", sort_srcline_from
),
1719 DIM(SORT_SRCLINE_TO
, "srcline_to", sort_srcline_to
),
1720 DIM(SORT_SYM_IPC
, "ipc_lbr", sort_sym_ipc
),
1725 #define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) }
1727 static struct sort_dimension memory_sort_dimensions
[] = {
1728 DIM(SORT_MEM_DADDR_SYMBOL
, "symbol_daddr", sort_mem_daddr_sym
),
1729 DIM(SORT_MEM_IADDR_SYMBOL
, "symbol_iaddr", sort_mem_iaddr_sym
),
1730 DIM(SORT_MEM_DADDR_DSO
, "dso_daddr", sort_mem_daddr_dso
),
1731 DIM(SORT_MEM_LOCKED
, "locked", sort_mem_locked
),
1732 DIM(SORT_MEM_TLB
, "tlb", sort_mem_tlb
),
1733 DIM(SORT_MEM_LVL
, "mem", sort_mem_lvl
),
1734 DIM(SORT_MEM_SNOOP
, "snoop", sort_mem_snoop
),
1735 DIM(SORT_MEM_DCACHELINE
, "dcacheline", sort_mem_dcacheline
),
1736 DIM(SORT_MEM_PHYS_DADDR
, "phys_daddr", sort_mem_phys_daddr
),
1741 struct hpp_dimension
{
1743 struct perf_hpp_fmt
*fmt
;
1747 #define DIM(d, n) { .name = n, .fmt = &perf_hpp__format[d], }
1749 static struct hpp_dimension hpp_sort_dimensions
[] = {
1750 DIM(PERF_HPP__OVERHEAD
, "overhead"),
1751 DIM(PERF_HPP__OVERHEAD_SYS
, "overhead_sys"),
1752 DIM(PERF_HPP__OVERHEAD_US
, "overhead_us"),
1753 DIM(PERF_HPP__OVERHEAD_GUEST_SYS
, "overhead_guest_sys"),
1754 DIM(PERF_HPP__OVERHEAD_GUEST_US
, "overhead_guest_us"),
1755 DIM(PERF_HPP__OVERHEAD_ACC
, "overhead_children"),
1756 DIM(PERF_HPP__SAMPLES
, "sample"),
1757 DIM(PERF_HPP__PERIOD
, "period"),
1762 struct hpp_sort_entry
{
1763 struct perf_hpp_fmt hpp
;
1764 struct sort_entry
*se
;
1767 void perf_hpp__reset_sort_width(struct perf_hpp_fmt
*fmt
, struct hists
*hists
)
1769 struct hpp_sort_entry
*hse
;
1771 if (!perf_hpp__is_sort_entry(fmt
))
1774 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1775 hists__new_col_len(hists
, hse
->se
->se_width_idx
, strlen(fmt
->name
));
1778 static int __sort__hpp_header(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
1779 struct hists
*hists
, int line __maybe_unused
,
1780 int *span __maybe_unused
)
1782 struct hpp_sort_entry
*hse
;
1783 size_t len
= fmt
->user_len
;
1785 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1788 len
= hists__col_len(hists
, hse
->se
->se_width_idx
);
1790 return scnprintf(hpp
->buf
, hpp
->size
, "%-*.*s", len
, len
, fmt
->name
);
1793 static int __sort__hpp_width(struct perf_hpp_fmt
*fmt
,
1794 struct perf_hpp
*hpp __maybe_unused
,
1795 struct hists
*hists
)
1797 struct hpp_sort_entry
*hse
;
1798 size_t len
= fmt
->user_len
;
1800 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1803 len
= hists__col_len(hists
, hse
->se
->se_width_idx
);
1808 static int __sort__hpp_entry(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
1809 struct hist_entry
*he
)
1811 struct hpp_sort_entry
*hse
;
1812 size_t len
= fmt
->user_len
;
1814 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1817 len
= hists__col_len(he
->hists
, hse
->se
->se_width_idx
);
1819 return hse
->se
->se_snprintf(he
, hpp
->buf
, hpp
->size
, len
);
1822 static int64_t __sort__hpp_cmp(struct perf_hpp_fmt
*fmt
,
1823 struct hist_entry
*a
, struct hist_entry
*b
)
1825 struct hpp_sort_entry
*hse
;
1827 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1828 return hse
->se
->se_cmp(a
, b
);
1831 static int64_t __sort__hpp_collapse(struct perf_hpp_fmt
*fmt
,
1832 struct hist_entry
*a
, struct hist_entry
*b
)
1834 struct hpp_sort_entry
*hse
;
1835 int64_t (*collapse_fn
)(struct hist_entry
*, struct hist_entry
*);
1837 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1838 collapse_fn
= hse
->se
->se_collapse
?: hse
->se
->se_cmp
;
1839 return collapse_fn(a
, b
);
1842 static int64_t __sort__hpp_sort(struct perf_hpp_fmt
*fmt
,
1843 struct hist_entry
*a
, struct hist_entry
*b
)
1845 struct hpp_sort_entry
*hse
;
1846 int64_t (*sort_fn
)(struct hist_entry
*, struct hist_entry
*);
1848 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1849 sort_fn
= hse
->se
->se_sort
?: hse
->se
->se_cmp
;
1850 return sort_fn(a
, b
);
1853 bool perf_hpp__is_sort_entry(struct perf_hpp_fmt
*format
)
1855 return format
->header
== __sort__hpp_header
;
1858 #define MK_SORT_ENTRY_CHK(key) \
1859 bool perf_hpp__is_ ## key ## _entry(struct perf_hpp_fmt *fmt) \
1861 struct hpp_sort_entry *hse; \
1863 if (!perf_hpp__is_sort_entry(fmt)) \
1866 hse = container_of(fmt, struct hpp_sort_entry, hpp); \
1867 return hse->se == &sort_ ## key ; \
1870 MK_SORT_ENTRY_CHK(trace
)
1871 MK_SORT_ENTRY_CHK(srcline
)
1872 MK_SORT_ENTRY_CHK(srcfile
)
1873 MK_SORT_ENTRY_CHK(thread
)
1874 MK_SORT_ENTRY_CHK(comm
)
1875 MK_SORT_ENTRY_CHK(dso
)
1876 MK_SORT_ENTRY_CHK(sym
)
1879 static bool __sort__hpp_equal(struct perf_hpp_fmt
*a
, struct perf_hpp_fmt
*b
)
1881 struct hpp_sort_entry
*hse_a
;
1882 struct hpp_sort_entry
*hse_b
;
1884 if (!perf_hpp__is_sort_entry(a
) || !perf_hpp__is_sort_entry(b
))
1887 hse_a
= container_of(a
, struct hpp_sort_entry
, hpp
);
1888 hse_b
= container_of(b
, struct hpp_sort_entry
, hpp
);
1890 return hse_a
->se
== hse_b
->se
;
1893 static void hse_free(struct perf_hpp_fmt
*fmt
)
1895 struct hpp_sort_entry
*hse
;
1897 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1901 static struct hpp_sort_entry
*
1902 __sort_dimension__alloc_hpp(struct sort_dimension
*sd
, int level
)
1904 struct hpp_sort_entry
*hse
;
1906 hse
= malloc(sizeof(*hse
));
1908 pr_err("Memory allocation failed\n");
1912 hse
->se
= sd
->entry
;
1913 hse
->hpp
.name
= sd
->entry
->se_header
;
1914 hse
->hpp
.header
= __sort__hpp_header
;
1915 hse
->hpp
.width
= __sort__hpp_width
;
1916 hse
->hpp
.entry
= __sort__hpp_entry
;
1917 hse
->hpp
.color
= NULL
;
1919 hse
->hpp
.cmp
= __sort__hpp_cmp
;
1920 hse
->hpp
.collapse
= __sort__hpp_collapse
;
1921 hse
->hpp
.sort
= __sort__hpp_sort
;
1922 hse
->hpp
.equal
= __sort__hpp_equal
;
1923 hse
->hpp
.free
= hse_free
;
1925 INIT_LIST_HEAD(&hse
->hpp
.list
);
1926 INIT_LIST_HEAD(&hse
->hpp
.sort_list
);
1927 hse
->hpp
.elide
= false;
1929 hse
->hpp
.user_len
= 0;
1930 hse
->hpp
.level
= level
;
1935 static void hpp_free(struct perf_hpp_fmt
*fmt
)
1940 static struct perf_hpp_fmt
*__hpp_dimension__alloc_hpp(struct hpp_dimension
*hd
,
1943 struct perf_hpp_fmt
*fmt
;
1945 fmt
= memdup(hd
->fmt
, sizeof(*fmt
));
1947 INIT_LIST_HEAD(&fmt
->list
);
1948 INIT_LIST_HEAD(&fmt
->sort_list
);
1949 fmt
->free
= hpp_free
;
1956 int hist_entry__filter(struct hist_entry
*he
, int type
, const void *arg
)
1958 struct perf_hpp_fmt
*fmt
;
1959 struct hpp_sort_entry
*hse
;
1963 perf_hpp_list__for_each_format(he
->hpp_list
, fmt
) {
1964 if (!perf_hpp__is_sort_entry(fmt
))
1967 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1968 if (hse
->se
->se_filter
== NULL
)
1972 * hist entry is filtered if any of sort key in the hpp list
1973 * is applied. But it should skip non-matched filter types.
1975 r
= hse
->se
->se_filter(he
, type
, arg
);
1986 static int __sort_dimension__add_hpp_sort(struct sort_dimension
*sd
,
1987 struct perf_hpp_list
*list
,
1990 struct hpp_sort_entry
*hse
= __sort_dimension__alloc_hpp(sd
, level
);
1995 perf_hpp_list__register_sort_field(list
, &hse
->hpp
);
1999 static int __sort_dimension__add_hpp_output(struct sort_dimension
*sd
,
2000 struct perf_hpp_list
*list
)
2002 struct hpp_sort_entry
*hse
= __sort_dimension__alloc_hpp(sd
, 0);
2007 perf_hpp_list__column_register(list
, &hse
->hpp
);
2011 struct hpp_dynamic_entry
{
2012 struct perf_hpp_fmt hpp
;
2013 struct evsel
*evsel
;
2014 struct tep_format_field
*field
;
2015 unsigned dynamic_len
;
2019 static int hde_width(struct hpp_dynamic_entry
*hde
)
2021 if (!hde
->hpp
.len
) {
2022 int len
= hde
->dynamic_len
;
2023 int namelen
= strlen(hde
->field
->name
);
2024 int fieldlen
= hde
->field
->size
;
2029 if (!(hde
->field
->flags
& TEP_FIELD_IS_STRING
)) {
2030 /* length for print hex numbers */
2031 fieldlen
= hde
->field
->size
* 2 + 2;
2038 return hde
->hpp
.len
;
2041 static void update_dynamic_len(struct hpp_dynamic_entry
*hde
,
2042 struct hist_entry
*he
)
2045 struct tep_format_field
*field
= hde
->field
;
2052 /* parse pretty print result and update max length */
2053 if (!he
->trace_output
)
2054 he
->trace_output
= get_trace_output(he
);
2056 namelen
= strlen(field
->name
);
2057 str
= he
->trace_output
;
2060 pos
= strchr(str
, ' ');
2063 pos
= str
+ strlen(str
);
2066 if (!strncmp(str
, field
->name
, namelen
)) {
2072 if (len
> hde
->dynamic_len
)
2073 hde
->dynamic_len
= len
;
2084 static int __sort__hde_header(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
2085 struct hists
*hists __maybe_unused
,
2086 int line __maybe_unused
,
2087 int *span __maybe_unused
)
2089 struct hpp_dynamic_entry
*hde
;
2090 size_t len
= fmt
->user_len
;
2092 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2095 len
= hde_width(hde
);
2097 return scnprintf(hpp
->buf
, hpp
->size
, "%*.*s", len
, len
, hde
->field
->name
);
2100 static int __sort__hde_width(struct perf_hpp_fmt
*fmt
,
2101 struct perf_hpp
*hpp __maybe_unused
,
2102 struct hists
*hists __maybe_unused
)
2104 struct hpp_dynamic_entry
*hde
;
2105 size_t len
= fmt
->user_len
;
2107 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2110 len
= hde_width(hde
);
2115 bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt
*fmt
, struct hists
*hists
)
2117 struct hpp_dynamic_entry
*hde
;
2119 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2121 return hists_to_evsel(hists
) == hde
->evsel
;
2124 static int __sort__hde_entry(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
2125 struct hist_entry
*he
)
2127 struct hpp_dynamic_entry
*hde
;
2128 size_t len
= fmt
->user_len
;
2130 struct tep_format_field
*field
;
2135 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2138 len
= hde_width(hde
);
2143 if (!he
->trace_output
)
2144 he
->trace_output
= get_trace_output(he
);
2147 namelen
= strlen(field
->name
);
2148 str
= he
->trace_output
;
2151 pos
= strchr(str
, ' ');
2154 pos
= str
+ strlen(str
);
2157 if (!strncmp(str
, field
->name
, namelen
)) {
2159 str
= strndup(str
, pos
- str
);
2162 return scnprintf(hpp
->buf
, hpp
->size
,
2163 "%*.*s", len
, len
, "ERROR");
2174 struct trace_seq seq
;
2176 trace_seq_init(&seq
);
2177 tep_print_field(&seq
, he
->raw_data
, hde
->field
);
2181 ret
= scnprintf(hpp
->buf
, hpp
->size
, "%*.*s", len
, len
, str
);
2186 static int64_t __sort__hde_cmp(struct perf_hpp_fmt
*fmt
,
2187 struct hist_entry
*a
, struct hist_entry
*b
)
2189 struct hpp_dynamic_entry
*hde
;
2190 struct tep_format_field
*field
;
2191 unsigned offset
, size
;
2193 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2196 update_dynamic_len(hde
, a
);
2201 if (field
->flags
& TEP_FIELD_IS_DYNAMIC
) {
2202 unsigned long long dyn
;
2204 tep_read_number_field(field
, a
->raw_data
, &dyn
);
2205 offset
= dyn
& 0xffff;
2206 size
= (dyn
>> 16) & 0xffff;
2208 /* record max width for output */
2209 if (size
> hde
->dynamic_len
)
2210 hde
->dynamic_len
= size
;
2212 offset
= field
->offset
;
2216 return memcmp(a
->raw_data
+ offset
, b
->raw_data
+ offset
, size
);
2219 bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt
*fmt
)
2221 return fmt
->cmp
== __sort__hde_cmp
;
2224 static bool __sort__hde_equal(struct perf_hpp_fmt
*a
, struct perf_hpp_fmt
*b
)
2226 struct hpp_dynamic_entry
*hde_a
;
2227 struct hpp_dynamic_entry
*hde_b
;
2229 if (!perf_hpp__is_dynamic_entry(a
) || !perf_hpp__is_dynamic_entry(b
))
2232 hde_a
= container_of(a
, struct hpp_dynamic_entry
, hpp
);
2233 hde_b
= container_of(b
, struct hpp_dynamic_entry
, hpp
);
2235 return hde_a
->field
== hde_b
->field
;
2238 static void hde_free(struct perf_hpp_fmt
*fmt
)
2240 struct hpp_dynamic_entry
*hde
;
2242 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2246 static struct hpp_dynamic_entry
*
2247 __alloc_dynamic_entry(struct evsel
*evsel
, struct tep_format_field
*field
,
2250 struct hpp_dynamic_entry
*hde
;
2252 hde
= malloc(sizeof(*hde
));
2254 pr_debug("Memory allocation failed\n");
2260 hde
->dynamic_len
= 0;
2262 hde
->hpp
.name
= field
->name
;
2263 hde
->hpp
.header
= __sort__hde_header
;
2264 hde
->hpp
.width
= __sort__hde_width
;
2265 hde
->hpp
.entry
= __sort__hde_entry
;
2266 hde
->hpp
.color
= NULL
;
2268 hde
->hpp
.cmp
= __sort__hde_cmp
;
2269 hde
->hpp
.collapse
= __sort__hde_cmp
;
2270 hde
->hpp
.sort
= __sort__hde_cmp
;
2271 hde
->hpp
.equal
= __sort__hde_equal
;
2272 hde
->hpp
.free
= hde_free
;
2274 INIT_LIST_HEAD(&hde
->hpp
.list
);
2275 INIT_LIST_HEAD(&hde
->hpp
.sort_list
);
2276 hde
->hpp
.elide
= false;
2278 hde
->hpp
.user_len
= 0;
2279 hde
->hpp
.level
= level
;
2284 struct perf_hpp_fmt
*perf_hpp_fmt__dup(struct perf_hpp_fmt
*fmt
)
2286 struct perf_hpp_fmt
*new_fmt
= NULL
;
2288 if (perf_hpp__is_sort_entry(fmt
)) {
2289 struct hpp_sort_entry
*hse
, *new_hse
;
2291 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
2292 new_hse
= memdup(hse
, sizeof(*hse
));
2294 new_fmt
= &new_hse
->hpp
;
2295 } else if (perf_hpp__is_dynamic_entry(fmt
)) {
2296 struct hpp_dynamic_entry
*hde
, *new_hde
;
2298 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2299 new_hde
= memdup(hde
, sizeof(*hde
));
2301 new_fmt
= &new_hde
->hpp
;
2303 new_fmt
= memdup(fmt
, sizeof(*fmt
));
2306 INIT_LIST_HEAD(&new_fmt
->list
);
2307 INIT_LIST_HEAD(&new_fmt
->sort_list
);
2312 static int parse_field_name(char *str
, char **event
, char **field
, char **opt
)
2314 char *event_name
, *field_name
, *opt_name
;
2317 field_name
= strchr(str
, '.');
2320 *field_name
++ = '\0';
2326 opt_name
= strchr(field_name
, '/');
2330 *event
= event_name
;
2331 *field
= field_name
;
2337 /* find match evsel using a given event name. The event name can be:
2338 * 1. '%' + event index (e.g. '%1' for first event)
2339 * 2. full event name (e.g. sched:sched_switch)
2340 * 3. partial event name (should not contain ':')
2342 static struct evsel
*find_evsel(struct evlist
*evlist
, char *event_name
)
2344 struct evsel
*evsel
= NULL
;
2349 if (event_name
[0] == '%') {
2350 int nr
= strtol(event_name
+1, NULL
, 0);
2352 if (nr
> evlist
->core
.nr_entries
)
2355 evsel
= evlist__first(evlist
);
2357 evsel
= perf_evsel__next(evsel
);
2362 full_name
= !!strchr(event_name
, ':');
2363 evlist__for_each_entry(evlist
, pos
) {
2365 if (full_name
&& !strcmp(pos
->name
, event_name
))
2368 if (!full_name
&& strstr(pos
->name
, event_name
)) {
2370 pr_debug("'%s' event is ambiguous: it can be %s or %s\n",
2371 event_name
, evsel
->name
, pos
->name
);
2381 static int __dynamic_dimension__add(struct evsel
*evsel
,
2382 struct tep_format_field
*field
,
2383 bool raw_trace
, int level
)
2385 struct hpp_dynamic_entry
*hde
;
2387 hde
= __alloc_dynamic_entry(evsel
, field
, level
);
2391 hde
->raw_trace
= raw_trace
;
2393 perf_hpp__register_sort_field(&hde
->hpp
);
2397 static int add_evsel_fields(struct evsel
*evsel
, bool raw_trace
, int level
)
2400 struct tep_format_field
*field
;
2402 field
= evsel
->tp_format
->format
.fields
;
2404 ret
= __dynamic_dimension__add(evsel
, field
, raw_trace
, level
);
2408 field
= field
->next
;
2413 static int add_all_dynamic_fields(struct evlist
*evlist
, bool raw_trace
,
2417 struct evsel
*evsel
;
2419 evlist__for_each_entry(evlist
, evsel
) {
2420 if (evsel
->core
.attr
.type
!= PERF_TYPE_TRACEPOINT
)
2423 ret
= add_evsel_fields(evsel
, raw_trace
, level
);
2430 static int add_all_matching_fields(struct evlist
*evlist
,
2431 char *field_name
, bool raw_trace
, int level
)
2434 struct evsel
*evsel
;
2435 struct tep_format_field
*field
;
2437 evlist__for_each_entry(evlist
, evsel
) {
2438 if (evsel
->core
.attr
.type
!= PERF_TYPE_TRACEPOINT
)
2441 field
= tep_find_any_field(evsel
->tp_format
, field_name
);
2445 ret
= __dynamic_dimension__add(evsel
, field
, raw_trace
, level
);
2452 static int add_dynamic_entry(struct evlist
*evlist
, const char *tok
,
2455 char *str
, *event_name
, *field_name
, *opt_name
;
2456 struct evsel
*evsel
;
2457 struct tep_format_field
*field
;
2458 bool raw_trace
= symbol_conf
.raw_trace
;
2468 if (parse_field_name(str
, &event_name
, &field_name
, &opt_name
) < 0) {
2474 if (strcmp(opt_name
, "raw")) {
2475 pr_debug("unsupported field option %s\n", opt_name
);
2482 if (!strcmp(field_name
, "trace_fields")) {
2483 ret
= add_all_dynamic_fields(evlist
, raw_trace
, level
);
2487 if (event_name
== NULL
) {
2488 ret
= add_all_matching_fields(evlist
, field_name
, raw_trace
, level
);
2492 evsel
= find_evsel(evlist
, event_name
);
2493 if (evsel
== NULL
) {
2494 pr_debug("Cannot find event: %s\n", event_name
);
2499 if (evsel
->core
.attr
.type
!= PERF_TYPE_TRACEPOINT
) {
2500 pr_debug("%s is not a tracepoint event\n", event_name
);
2505 if (!strcmp(field_name
, "*")) {
2506 ret
= add_evsel_fields(evsel
, raw_trace
, level
);
2508 field
= tep_find_any_field(evsel
->tp_format
, field_name
);
2509 if (field
== NULL
) {
2510 pr_debug("Cannot find event field for %s.%s\n",
2511 event_name
, field_name
);
2515 ret
= __dynamic_dimension__add(evsel
, field
, raw_trace
, level
);
2523 static int __sort_dimension__add(struct sort_dimension
*sd
,
2524 struct perf_hpp_list
*list
,
2530 if (__sort_dimension__add_hpp_sort(sd
, list
, level
) < 0)
2533 if (sd
->entry
->se_collapse
)
2534 list
->need_collapse
= 1;
2541 static int __hpp_dimension__add(struct hpp_dimension
*hd
,
2542 struct perf_hpp_list
*list
,
2545 struct perf_hpp_fmt
*fmt
;
2550 fmt
= __hpp_dimension__alloc_hpp(hd
, level
);
2555 perf_hpp_list__register_sort_field(list
, fmt
);
2559 static int __sort_dimension__add_output(struct perf_hpp_list
*list
,
2560 struct sort_dimension
*sd
)
2565 if (__sort_dimension__add_hpp_output(sd
, list
) < 0)
2572 static int __hpp_dimension__add_output(struct perf_hpp_list
*list
,
2573 struct hpp_dimension
*hd
)
2575 struct perf_hpp_fmt
*fmt
;
2580 fmt
= __hpp_dimension__alloc_hpp(hd
, 0);
2585 perf_hpp_list__column_register(list
, fmt
);
2589 int hpp_dimension__add_output(unsigned col
)
2591 BUG_ON(col
>= PERF_HPP__MAX_INDEX
);
2592 return __hpp_dimension__add_output(&perf_hpp_list
, &hpp_sort_dimensions
[col
]);
2595 int sort_dimension__add(struct perf_hpp_list
*list
, const char *tok
,
2596 struct evlist
*evlist
,
2601 for (i
= 0; i
< ARRAY_SIZE(common_sort_dimensions
); i
++) {
2602 struct sort_dimension
*sd
= &common_sort_dimensions
[i
];
2604 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2607 if (sd
->entry
== &sort_parent
) {
2608 int ret
= regcomp(&parent_regex
, parent_pattern
, REG_EXTENDED
);
2612 regerror(ret
, &parent_regex
, err
, sizeof(err
));
2613 pr_err("Invalid regex: %s\n%s", parent_pattern
, err
);
2617 } else if (sd
->entry
== &sort_sym
) {
2620 * perf diff displays the performance difference amongst
2621 * two or more perf.data files. Those files could come
2622 * from different binaries. So we should not compare
2623 * their ips, but the name of symbol.
2625 if (sort__mode
== SORT_MODE__DIFF
)
2626 sd
->entry
->se_collapse
= sort__sym_sort
;
2628 } else if (sd
->entry
== &sort_dso
) {
2630 } else if (sd
->entry
== &sort_socket
) {
2632 } else if (sd
->entry
== &sort_thread
) {
2634 } else if (sd
->entry
== &sort_comm
) {
2638 return __sort_dimension__add(sd
, list
, level
);
2641 for (i
= 0; i
< ARRAY_SIZE(hpp_sort_dimensions
); i
++) {
2642 struct hpp_dimension
*hd
= &hpp_sort_dimensions
[i
];
2644 if (strncasecmp(tok
, hd
->name
, strlen(tok
)))
2647 return __hpp_dimension__add(hd
, list
, level
);
2650 for (i
= 0; i
< ARRAY_SIZE(bstack_sort_dimensions
); i
++) {
2651 struct sort_dimension
*sd
= &bstack_sort_dimensions
[i
];
2653 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2656 if (sort__mode
!= SORT_MODE__BRANCH
)
2659 if (sd
->entry
== &sort_sym_from
|| sd
->entry
== &sort_sym_to
)
2662 __sort_dimension__add(sd
, list
, level
);
2666 for (i
= 0; i
< ARRAY_SIZE(memory_sort_dimensions
); i
++) {
2667 struct sort_dimension
*sd
= &memory_sort_dimensions
[i
];
2669 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2672 if (sort__mode
!= SORT_MODE__MEMORY
)
2675 if (sd
->entry
== &sort_mem_dcacheline
&& cacheline_size() == 0)
2678 if (sd
->entry
== &sort_mem_daddr_sym
)
2681 __sort_dimension__add(sd
, list
, level
);
2685 if (!add_dynamic_entry(evlist
, tok
, level
))
2691 static int setup_sort_list(struct perf_hpp_list
*list
, char *str
,
2692 struct evlist
*evlist
)
2698 bool in_group
= false;
2702 tmp
= strpbrk(str
, "{}, ");
2707 next_level
= level
+ 1;
2711 else if (*tmp
== '}')
2719 ret
= sort_dimension__add(list
, tok
, evlist
, level
);
2720 if (ret
== -EINVAL
) {
2721 if (!cacheline_size() && !strncasecmp(tok
, "dcacheline", strlen(tok
)))
2722 ui__error("The \"dcacheline\" --sort key needs to know the cacheline size and it couldn't be determined on this system");
2724 ui__error("Invalid --sort key: `%s'", tok
);
2726 } else if (ret
== -ESRCH
) {
2727 ui__error("Unknown --sort key: `%s'", tok
);
2738 static const char *get_default_sort_order(struct evlist
*evlist
)
2740 const char *default_sort_orders
[] = {
2742 default_branch_sort_order
,
2743 default_mem_sort_order
,
2744 default_top_sort_order
,
2745 default_diff_sort_order
,
2746 default_tracepoint_sort_order
,
2748 bool use_trace
= true;
2749 struct evsel
*evsel
;
2751 BUG_ON(sort__mode
>= ARRAY_SIZE(default_sort_orders
));
2753 if (evlist
== NULL
|| perf_evlist__empty(evlist
))
2756 evlist__for_each_entry(evlist
, evsel
) {
2757 if (evsel
->core
.attr
.type
!= PERF_TYPE_TRACEPOINT
) {
2764 sort__mode
= SORT_MODE__TRACEPOINT
;
2765 if (symbol_conf
.raw_trace
)
2766 return "trace_fields";
2769 return default_sort_orders
[sort__mode
];
2772 static int setup_sort_order(struct evlist
*evlist
)
2774 char *new_sort_order
;
2777 * Append '+'-prefixed sort order to the default sort
2780 if (!sort_order
|| is_strict_order(sort_order
))
2783 if (sort_order
[1] == '\0') {
2784 ui__error("Invalid --sort key: `+'");
2789 * We allocate new sort_order string, but we never free it,
2790 * because it's checked over the rest of the code.
2792 if (asprintf(&new_sort_order
, "%s,%s",
2793 get_default_sort_order(evlist
), sort_order
+ 1) < 0) {
2794 pr_err("Not enough memory to set up --sort");
2798 sort_order
= new_sort_order
;
2803 * Adds 'pre,' prefix into 'str' is 'pre' is
2804 * not already part of 'str'.
2806 static char *prefix_if_not_in(const char *pre
, char *str
)
2810 if (!str
|| strstr(str
, pre
))
2813 if (asprintf(&n
, "%s,%s", pre
, str
) < 0)
2820 static char *setup_overhead(char *keys
)
2822 if (sort__mode
== SORT_MODE__DIFF
)
2825 keys
= prefix_if_not_in("overhead", keys
);
2827 if (symbol_conf
.cumulate_callchain
)
2828 keys
= prefix_if_not_in("overhead_children", keys
);
2833 static int __setup_sorting(struct evlist
*evlist
)
2836 const char *sort_keys
;
2839 ret
= setup_sort_order(evlist
);
2843 sort_keys
= sort_order
;
2844 if (sort_keys
== NULL
) {
2845 if (is_strict_order(field_order
)) {
2847 * If user specified field order but no sort order,
2848 * we'll honor it and not add default sort orders.
2853 sort_keys
= get_default_sort_order(evlist
);
2856 str
= strdup(sort_keys
);
2858 pr_err("Not enough memory to setup sort keys");
2863 * Prepend overhead fields for backward compatibility.
2865 if (!is_strict_order(field_order
)) {
2866 str
= setup_overhead(str
);
2868 pr_err("Not enough memory to setup overhead keys");
2873 ret
= setup_sort_list(&perf_hpp_list
, str
, evlist
);
2879 void perf_hpp__set_elide(int idx
, bool elide
)
2881 struct perf_hpp_fmt
*fmt
;
2882 struct hpp_sort_entry
*hse
;
2884 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2885 if (!perf_hpp__is_sort_entry(fmt
))
2888 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
2889 if (hse
->se
->se_width_idx
== idx
) {
2896 static bool __get_elide(struct strlist
*list
, const char *list_name
, FILE *fp
)
2898 if (list
&& strlist__nr_entries(list
) == 1) {
2900 fprintf(fp
, "# %s: %s\n", list_name
,
2901 strlist__entry(list
, 0)->s
);
2907 static bool get_elide(int idx
, FILE *output
)
2911 return __get_elide(symbol_conf
.sym_list
, "symbol", output
);
2913 return __get_elide(symbol_conf
.dso_list
, "dso", output
);
2915 return __get_elide(symbol_conf
.comm_list
, "comm", output
);
2920 if (sort__mode
!= SORT_MODE__BRANCH
)
2924 case HISTC_SYMBOL_FROM
:
2925 return __get_elide(symbol_conf
.sym_from_list
, "sym_from", output
);
2926 case HISTC_SYMBOL_TO
:
2927 return __get_elide(symbol_conf
.sym_to_list
, "sym_to", output
);
2928 case HISTC_DSO_FROM
:
2929 return __get_elide(symbol_conf
.dso_from_list
, "dso_from", output
);
2931 return __get_elide(symbol_conf
.dso_to_list
, "dso_to", output
);
2939 void sort__setup_elide(FILE *output
)
2941 struct perf_hpp_fmt
*fmt
;
2942 struct hpp_sort_entry
*hse
;
2944 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2945 if (!perf_hpp__is_sort_entry(fmt
))
2948 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
2949 fmt
->elide
= get_elide(hse
->se
->se_width_idx
, output
);
2953 * It makes no sense to elide all of sort entries.
2954 * Just revert them to show up again.
2956 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2957 if (!perf_hpp__is_sort_entry(fmt
))
2964 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2965 if (!perf_hpp__is_sort_entry(fmt
))
2972 int output_field_add(struct perf_hpp_list
*list
, char *tok
)
2976 for (i
= 0; i
< ARRAY_SIZE(common_sort_dimensions
); i
++) {
2977 struct sort_dimension
*sd
= &common_sort_dimensions
[i
];
2979 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2982 return __sort_dimension__add_output(list
, sd
);
2985 for (i
= 0; i
< ARRAY_SIZE(hpp_sort_dimensions
); i
++) {
2986 struct hpp_dimension
*hd
= &hpp_sort_dimensions
[i
];
2988 if (strncasecmp(tok
, hd
->name
, strlen(tok
)))
2991 return __hpp_dimension__add_output(list
, hd
);
2994 for (i
= 0; i
< ARRAY_SIZE(bstack_sort_dimensions
); i
++) {
2995 struct sort_dimension
*sd
= &bstack_sort_dimensions
[i
];
2997 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
3000 if (sort__mode
!= SORT_MODE__MEMORY
)
3003 return __sort_dimension__add_output(list
, sd
);
3006 for (i
= 0; i
< ARRAY_SIZE(memory_sort_dimensions
); i
++) {
3007 struct sort_dimension
*sd
= &memory_sort_dimensions
[i
];
3009 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
3012 if (sort__mode
!= SORT_MODE__BRANCH
)
3015 return __sort_dimension__add_output(list
, sd
);
3021 static int setup_output_list(struct perf_hpp_list
*list
, char *str
)
3026 for (tok
= strtok_r(str
, ", ", &tmp
);
3027 tok
; tok
= strtok_r(NULL
, ", ", &tmp
)) {
3028 ret
= output_field_add(list
, tok
);
3029 if (ret
== -EINVAL
) {
3030 ui__error("Invalid --fields key: `%s'", tok
);
3032 } else if (ret
== -ESRCH
) {
3033 ui__error("Unknown --fields key: `%s'", tok
);
3041 void reset_dimensions(void)
3045 for (i
= 0; i
< ARRAY_SIZE(common_sort_dimensions
); i
++)
3046 common_sort_dimensions
[i
].taken
= 0;
3048 for (i
= 0; i
< ARRAY_SIZE(hpp_sort_dimensions
); i
++)
3049 hpp_sort_dimensions
[i
].taken
= 0;
3051 for (i
= 0; i
< ARRAY_SIZE(bstack_sort_dimensions
); i
++)
3052 bstack_sort_dimensions
[i
].taken
= 0;
3054 for (i
= 0; i
< ARRAY_SIZE(memory_sort_dimensions
); i
++)
3055 memory_sort_dimensions
[i
].taken
= 0;
3058 bool is_strict_order(const char *order
)
3060 return order
&& (*order
!= '+');
3063 static int __setup_output_field(void)
3068 if (field_order
== NULL
)
3071 strp
= str
= strdup(field_order
);
3073 pr_err("Not enough memory to setup output fields");
3077 if (!is_strict_order(field_order
))
3080 if (!strlen(strp
)) {
3081 ui__error("Invalid --fields key: `+'");
3085 ret
= setup_output_list(&perf_hpp_list
, strp
);
3092 int setup_sorting(struct evlist
*evlist
)
3096 err
= __setup_sorting(evlist
);
3100 if (parent_pattern
!= default_parent_pattern
) {
3101 err
= sort_dimension__add(&perf_hpp_list
, "parent", evlist
, -1);
3109 * perf diff doesn't use default hpp output fields.
3111 if (sort__mode
!= SORT_MODE__DIFF
)
3114 err
= __setup_output_field();
3118 /* copy sort keys to output fields */
3119 perf_hpp__setup_output_field(&perf_hpp_list
);
3120 /* and then copy output fields to sort keys */
3121 perf_hpp__append_sort_keys(&perf_hpp_list
);
3123 /* setup hists-specific output fields */
3124 if (perf_hpp__setup_hists_formats(&perf_hpp_list
, evlist
) < 0)
3130 void reset_output_field(void)
3132 perf_hpp_list
.need_collapse
= 0;
3133 perf_hpp_list
.parent
= 0;
3134 perf_hpp_list
.sym
= 0;
3135 perf_hpp_list
.dso
= 0;
3141 perf_hpp__reset_output_field(&perf_hpp_list
);
3144 #define INDENT (3*8 + 1)
3146 static void add_key(struct strbuf
*sb
, const char *str
, int *llen
)
3149 strbuf_addstr(sb
, "\n\t\t\t ");
3152 strbuf_addf(sb
, " %s", str
);
3153 *llen
+= strlen(str
) + 1;
3156 static void add_sort_string(struct strbuf
*sb
, struct sort_dimension
*s
, int n
,
3161 for (i
= 0; i
< n
; i
++)
3162 add_key(sb
, s
[i
].name
, llen
);
3165 static void add_hpp_sort_string(struct strbuf
*sb
, struct hpp_dimension
*s
, int n
,
3170 for (i
= 0; i
< n
; i
++)
3171 add_key(sb
, s
[i
].name
, llen
);
3174 const char *sort_help(const char *prefix
)
3178 int len
= strlen(prefix
) + INDENT
;
3180 strbuf_init(&sb
, 300);
3181 strbuf_addstr(&sb
, prefix
);
3182 add_hpp_sort_string(&sb
, hpp_sort_dimensions
,
3183 ARRAY_SIZE(hpp_sort_dimensions
), &len
);
3184 add_sort_string(&sb
, common_sort_dimensions
,
3185 ARRAY_SIZE(common_sort_dimensions
), &len
);
3186 add_sort_string(&sb
, bstack_sort_dimensions
,
3187 ARRAY_SIZE(bstack_sort_dimensions
), &len
);
3188 add_sort_string(&sb
, memory_sort_dimensions
,
3189 ARRAY_SIZE(memory_sort_dimensions
), &len
);
3190 s
= strbuf_detach(&sb
, NULL
);
3191 strbuf_release(&sb
);