1 // SPDX-License-Identifier: GPL-2.0
14 #include <traceevent/event-parse.h>
15 #include "mem-events.h"
16 #include <linux/kernel.h>
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
;
34 * Replaces all occurrences of a char used with the:
36 * -t, --field-separator
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.
42 static int repsep_snprintf(char *bf
, size_t size
, const char *fmt
, ...)
48 n
= vsnprintf(bf
, size
, fmt
, ap
);
49 if (symbol_conf
.field_sep
&& n
> 0) {
53 sep
= strchr(sep
, *symbol_conf
.field_sep
);
66 static int64_t cmp_null(const void *l
, const void *r
)
79 sort__thread_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
81 return right
->thread
->tid
- left
->thread
->tid
;
84 static int hist_entry__thread_snprintf(struct hist_entry
*he
, char *bf
,
85 size_t size
, unsigned int width
)
87 const char *comm
= thread__comm_str(he
->thread
);
89 width
= max(7U, width
) - 8;
90 return repsep_snprintf(bf
, size
, "%7d:%-*.*s", he
->thread
->tid
,
91 width
, width
, comm
?: "");
94 static int hist_entry__thread_filter(struct hist_entry
*he
, int type
, const void *arg
)
96 const struct thread
*th
= arg
;
98 if (type
!= HIST_FILTER__THREAD
)
101 return th
&& he
->thread
!= th
;
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
,
115 sort__comm_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
117 /* Compare the addr that should be unique among comm */
118 return strcmp(comm__str(right
->comm
), comm__str(left
->comm
));
122 sort__comm_collapse(struct hist_entry
*left
, struct hist_entry
*right
)
124 /* Compare the addr that should be unique among comm */
125 return strcmp(comm__str(right
->comm
), comm__str(left
->comm
));
129 sort__comm_sort(struct hist_entry
*left
, struct hist_entry
*right
)
131 return strcmp(comm__str(right
->comm
), comm__str(left
->comm
));
134 static int hist_entry__comm_snprintf(struct hist_entry
*he
, char *bf
,
135 size_t size
, unsigned int width
)
137 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, comm__str(he
->comm
));
140 struct sort_entry sort_comm
= {
141 .se_header
= "Command",
142 .se_cmp
= sort__comm_cmp
,
143 .se_collapse
= sort__comm_collapse
,
144 .se_sort
= sort__comm_sort
,
145 .se_snprintf
= hist_entry__comm_snprintf
,
146 .se_filter
= hist_entry__thread_filter
,
147 .se_width_idx
= HISTC_COMM
,
152 static int64_t _sort__dso_cmp(struct map
*map_l
, struct map
*map_r
)
154 struct dso
*dso_l
= map_l
? map_l
->dso
: NULL
;
155 struct dso
*dso_r
= map_r
? map_r
->dso
: NULL
;
156 const char *dso_name_l
, *dso_name_r
;
158 if (!dso_l
|| !dso_r
)
159 return cmp_null(dso_r
, dso_l
);
162 dso_name_l
= dso_l
->long_name
;
163 dso_name_r
= dso_r
->long_name
;
165 dso_name_l
= dso_l
->short_name
;
166 dso_name_r
= dso_r
->short_name
;
169 return strcmp(dso_name_l
, dso_name_r
);
173 sort__dso_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
175 return _sort__dso_cmp(right
->ms
.map
, left
->ms
.map
);
178 static int _hist_entry__dso_snprintf(struct map
*map
, char *bf
,
179 size_t size
, unsigned int width
)
181 if (map
&& map
->dso
) {
182 const char *dso_name
= verbose
> 0 ? map
->dso
->long_name
:
183 map
->dso
->short_name
;
184 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, dso_name
);
187 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "[unknown]");
190 static int hist_entry__dso_snprintf(struct hist_entry
*he
, char *bf
,
191 size_t size
, unsigned int width
)
193 return _hist_entry__dso_snprintf(he
->ms
.map
, bf
, size
, width
);
196 static int hist_entry__dso_filter(struct hist_entry
*he
, int type
, const void *arg
)
198 const struct dso
*dso
= arg
;
200 if (type
!= HIST_FILTER__DSO
)
203 return dso
&& (!he
->ms
.map
|| he
->ms
.map
->dso
!= dso
);
206 struct sort_entry sort_dso
= {
207 .se_header
= "Shared Object",
208 .se_cmp
= sort__dso_cmp
,
209 .se_snprintf
= hist_entry__dso_snprintf
,
210 .se_filter
= hist_entry__dso_filter
,
211 .se_width_idx
= HISTC_DSO
,
216 static int64_t _sort__addr_cmp(u64 left_ip
, u64 right_ip
)
218 return (int64_t)(right_ip
- left_ip
);
221 static int64_t _sort__sym_cmp(struct symbol
*sym_l
, struct symbol
*sym_r
)
223 if (!sym_l
|| !sym_r
)
224 return cmp_null(sym_l
, sym_r
);
229 if (sym_l
->inlined
|| sym_r
->inlined
)
230 return strcmp(sym_l
->name
, sym_r
->name
);
232 if (sym_l
->start
!= sym_r
->start
)
233 return (int64_t)(sym_r
->start
- sym_l
->start
);
235 return (int64_t)(sym_r
->end
- sym_l
->end
);
239 sort__sym_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
243 if (!left
->ms
.sym
&& !right
->ms
.sym
)
244 return _sort__addr_cmp(left
->ip
, right
->ip
);
247 * comparing symbol address alone is not enough since it's a
248 * relative address within a dso.
250 if (!hists__has(left
->hists
, dso
) || hists__has(right
->hists
, dso
)) {
251 ret
= sort__dso_cmp(left
, right
);
256 return _sort__sym_cmp(left
->ms
.sym
, right
->ms
.sym
);
260 sort__sym_sort(struct hist_entry
*left
, struct hist_entry
*right
)
262 if (!left
->ms
.sym
|| !right
->ms
.sym
)
263 return cmp_null(left
->ms
.sym
, right
->ms
.sym
);
265 return strcmp(right
->ms
.sym
->name
, left
->ms
.sym
->name
);
268 static int _hist_entry__sym_snprintf(struct map
*map
, struct symbol
*sym
,
269 u64 ip
, char level
, char *bf
, size_t size
,
275 char o
= map
? dso__symtab_origin(map
->dso
) : '!';
276 ret
+= repsep_snprintf(bf
, size
, "%-#*llx %c ",
277 BITS_PER_LONG
/ 4 + 2, ip
, o
);
280 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "[%c] ", level
);
282 if (map
->type
== MAP__VARIABLE
) {
283 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%s", sym
->name
);
284 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "+0x%llx",
285 ip
- map
->unmap_ip(map
, sym
->start
));
287 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%.*s",
291 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
,
295 size_t len
= BITS_PER_LONG
/ 4;
296 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%-#.*llx",
303 static int hist_entry__sym_snprintf(struct hist_entry
*he
, char *bf
,
304 size_t size
, unsigned int width
)
306 return _hist_entry__sym_snprintf(he
->ms
.map
, he
->ms
.sym
, he
->ip
,
307 he
->level
, bf
, size
, width
);
310 static int hist_entry__sym_filter(struct hist_entry
*he
, int type
, const void *arg
)
312 const char *sym
= arg
;
314 if (type
!= HIST_FILTER__SYMBOL
)
317 return sym
&& (!he
->ms
.sym
|| !strstr(he
->ms
.sym
->name
, sym
));
320 struct sort_entry sort_sym
= {
321 .se_header
= "Symbol",
322 .se_cmp
= sort__sym_cmp
,
323 .se_sort
= sort__sym_sort
,
324 .se_snprintf
= hist_entry__sym_snprintf
,
325 .se_filter
= hist_entry__sym_filter
,
326 .se_width_idx
= HISTC_SYMBOL
,
331 char *hist_entry__get_srcline(struct hist_entry
*he
)
333 struct map
*map
= he
->ms
.map
;
336 return SRCLINE_UNKNOWN
;
338 return get_srcline(map
->dso
, map__rip_2objdump(map
, he
->ip
),
339 he
->ms
.sym
, true, true, he
->ip
);
343 sort__srcline_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
346 left
->srcline
= hist_entry__get_srcline(left
);
348 right
->srcline
= hist_entry__get_srcline(right
);
350 return strcmp(right
->srcline
, left
->srcline
);
353 static int hist_entry__srcline_snprintf(struct hist_entry
*he
, char *bf
,
354 size_t size
, unsigned int width
)
357 he
->srcline
= hist_entry__get_srcline(he
);
359 return repsep_snprintf(bf
, size
, "%-.*s", width
, he
->srcline
);
362 struct sort_entry sort_srcline
= {
363 .se_header
= "Source:Line",
364 .se_cmp
= sort__srcline_cmp
,
365 .se_snprintf
= hist_entry__srcline_snprintf
,
366 .se_width_idx
= HISTC_SRCLINE
,
369 /* --sort srcline_from */
372 sort__srcline_from_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
374 if (!left
->branch_info
->srcline_from
) {
375 struct map
*map
= left
->branch_info
->from
.map
;
377 left
->branch_info
->srcline_from
= SRCLINE_UNKNOWN
;
379 left
->branch_info
->srcline_from
= get_srcline(map
->dso
,
380 map__rip_2objdump(map
,
381 left
->branch_info
->from
.al_addr
),
382 left
->branch_info
->from
.sym
,
384 left
->branch_info
->from
.al_addr
);
386 if (!right
->branch_info
->srcline_from
) {
387 struct map
*map
= right
->branch_info
->from
.map
;
389 right
->branch_info
->srcline_from
= SRCLINE_UNKNOWN
;
391 right
->branch_info
->srcline_from
= get_srcline(map
->dso
,
392 map__rip_2objdump(map
,
393 right
->branch_info
->from
.al_addr
),
394 right
->branch_info
->from
.sym
,
396 right
->branch_info
->from
.al_addr
);
398 return strcmp(right
->branch_info
->srcline_from
, left
->branch_info
->srcline_from
);
401 static int hist_entry__srcline_from_snprintf(struct hist_entry
*he
, char *bf
,
402 size_t size
, unsigned int width
)
404 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, he
->branch_info
->srcline_from
);
407 struct sort_entry sort_srcline_from
= {
408 .se_header
= "From Source:Line",
409 .se_cmp
= sort__srcline_from_cmp
,
410 .se_snprintf
= hist_entry__srcline_from_snprintf
,
411 .se_width_idx
= HISTC_SRCLINE_FROM
,
414 /* --sort srcline_to */
417 sort__srcline_to_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
419 if (!left
->branch_info
->srcline_to
) {
420 struct map
*map
= left
->branch_info
->to
.map
;
422 left
->branch_info
->srcline_to
= SRCLINE_UNKNOWN
;
424 left
->branch_info
->srcline_to
= get_srcline(map
->dso
,
425 map__rip_2objdump(map
,
426 left
->branch_info
->to
.al_addr
),
427 left
->branch_info
->from
.sym
,
429 left
->branch_info
->to
.al_addr
);
431 if (!right
->branch_info
->srcline_to
) {
432 struct map
*map
= right
->branch_info
->to
.map
;
434 right
->branch_info
->srcline_to
= SRCLINE_UNKNOWN
;
436 right
->branch_info
->srcline_to
= get_srcline(map
->dso
,
437 map__rip_2objdump(map
,
438 right
->branch_info
->to
.al_addr
),
439 right
->branch_info
->to
.sym
,
441 right
->branch_info
->to
.al_addr
);
443 return strcmp(right
->branch_info
->srcline_to
, left
->branch_info
->srcline_to
);
446 static int hist_entry__srcline_to_snprintf(struct hist_entry
*he
, char *bf
,
447 size_t size
, unsigned int width
)
449 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, he
->branch_info
->srcline_to
);
452 struct sort_entry sort_srcline_to
= {
453 .se_header
= "To Source:Line",
454 .se_cmp
= sort__srcline_to_cmp
,
455 .se_snprintf
= hist_entry__srcline_to_snprintf
,
456 .se_width_idx
= HISTC_SRCLINE_TO
,
461 static char no_srcfile
[1];
463 static char *hist_entry__get_srcfile(struct hist_entry
*e
)
466 struct map
*map
= e
->ms
.map
;
471 sf
= __get_srcline(map
->dso
, map__rip_2objdump(map
, e
->ip
),
472 e
->ms
.sym
, false, true, true, e
->ip
);
473 if (!strcmp(sf
, SRCLINE_UNKNOWN
))
485 sort__srcfile_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
488 left
->srcfile
= hist_entry__get_srcfile(left
);
490 right
->srcfile
= hist_entry__get_srcfile(right
);
492 return strcmp(right
->srcfile
, left
->srcfile
);
495 static int hist_entry__srcfile_snprintf(struct hist_entry
*he
, char *bf
,
496 size_t size
, unsigned int width
)
499 he
->srcfile
= hist_entry__get_srcfile(he
);
501 return repsep_snprintf(bf
, size
, "%-.*s", width
, he
->srcfile
);
504 struct sort_entry sort_srcfile
= {
505 .se_header
= "Source File",
506 .se_cmp
= sort__srcfile_cmp
,
507 .se_snprintf
= hist_entry__srcfile_snprintf
,
508 .se_width_idx
= HISTC_SRCFILE
,
514 sort__parent_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
516 struct symbol
*sym_l
= left
->parent
;
517 struct symbol
*sym_r
= right
->parent
;
519 if (!sym_l
|| !sym_r
)
520 return cmp_null(sym_l
, sym_r
);
522 return strcmp(sym_r
->name
, sym_l
->name
);
525 static int hist_entry__parent_snprintf(struct hist_entry
*he
, char *bf
,
526 size_t size
, unsigned int width
)
528 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
,
529 he
->parent
? he
->parent
->name
: "[other]");
532 struct sort_entry sort_parent
= {
533 .se_header
= "Parent symbol",
534 .se_cmp
= sort__parent_cmp
,
535 .se_snprintf
= hist_entry__parent_snprintf
,
536 .se_width_idx
= HISTC_PARENT
,
542 sort__cpu_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
544 return right
->cpu
- left
->cpu
;
547 static int hist_entry__cpu_snprintf(struct hist_entry
*he
, char *bf
,
548 size_t size
, unsigned int width
)
550 return repsep_snprintf(bf
, size
, "%*.*d", width
, width
, he
->cpu
);
553 struct sort_entry sort_cpu
= {
555 .se_cmp
= sort__cpu_cmp
,
556 .se_snprintf
= hist_entry__cpu_snprintf
,
557 .se_width_idx
= HISTC_CPU
,
560 /* --sort cgroup_id */
562 static int64_t _sort__cgroup_dev_cmp(u64 left_dev
, u64 right_dev
)
564 return (int64_t)(right_dev
- left_dev
);
567 static int64_t _sort__cgroup_inode_cmp(u64 left_ino
, u64 right_ino
)
569 return (int64_t)(right_ino
- left_ino
);
573 sort__cgroup_id_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
577 ret
= _sort__cgroup_dev_cmp(right
->cgroup_id
.dev
, left
->cgroup_id
.dev
);
581 return _sort__cgroup_inode_cmp(right
->cgroup_id
.ino
,
582 left
->cgroup_id
.ino
);
585 static int hist_entry__cgroup_id_snprintf(struct hist_entry
*he
,
586 char *bf
, size_t size
,
587 unsigned int width __maybe_unused
)
589 return repsep_snprintf(bf
, size
, "%lu/0x%lx", he
->cgroup_id
.dev
,
593 struct sort_entry sort_cgroup_id
= {
594 .se_header
= "cgroup id (dev/inode)",
595 .se_cmp
= sort__cgroup_id_cmp
,
596 .se_snprintf
= hist_entry__cgroup_id_snprintf
,
597 .se_width_idx
= HISTC_CGROUP_ID
,
603 sort__socket_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
605 return right
->socket
- left
->socket
;
608 static int hist_entry__socket_snprintf(struct hist_entry
*he
, char *bf
,
609 size_t size
, unsigned int width
)
611 return repsep_snprintf(bf
, size
, "%*.*d", width
, width
-3, he
->socket
);
614 static int hist_entry__socket_filter(struct hist_entry
*he
, int type
, const void *arg
)
616 int sk
= *(const int *)arg
;
618 if (type
!= HIST_FILTER__SOCKET
)
621 return sk
>= 0 && he
->socket
!= sk
;
624 struct sort_entry sort_socket
= {
625 .se_header
= "Socket",
626 .se_cmp
= sort__socket_cmp
,
627 .se_snprintf
= hist_entry__socket_snprintf
,
628 .se_filter
= hist_entry__socket_filter
,
629 .se_width_idx
= HISTC_SOCKET
,
634 static char *get_trace_output(struct hist_entry
*he
)
636 struct trace_seq seq
;
637 struct perf_evsel
*evsel
;
638 struct pevent_record rec
= {
639 .data
= he
->raw_data
,
640 .size
= he
->raw_size
,
643 evsel
= hists_to_evsel(he
->hists
);
645 trace_seq_init(&seq
);
646 if (symbol_conf
.raw_trace
) {
647 pevent_print_fields(&seq
, he
->raw_data
, he
->raw_size
,
650 pevent_event_info(&seq
, evsel
->tp_format
, &rec
);
653 * Trim the buffer, it starts at 4KB and we're not going to
654 * add anything more to this buffer.
656 return realloc(seq
.buffer
, seq
.len
+ 1);
660 sort__trace_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
662 struct perf_evsel
*evsel
;
664 evsel
= hists_to_evsel(left
->hists
);
665 if (evsel
->attr
.type
!= PERF_TYPE_TRACEPOINT
)
668 if (left
->trace_output
== NULL
)
669 left
->trace_output
= get_trace_output(left
);
670 if (right
->trace_output
== NULL
)
671 right
->trace_output
= get_trace_output(right
);
673 return strcmp(right
->trace_output
, left
->trace_output
);
676 static int hist_entry__trace_snprintf(struct hist_entry
*he
, char *bf
,
677 size_t size
, unsigned int width
)
679 struct perf_evsel
*evsel
;
681 evsel
= hists_to_evsel(he
->hists
);
682 if (evsel
->attr
.type
!= PERF_TYPE_TRACEPOINT
)
683 return scnprintf(bf
, size
, "%-.*s", width
, "N/A");
685 if (he
->trace_output
== NULL
)
686 he
->trace_output
= get_trace_output(he
);
687 return repsep_snprintf(bf
, size
, "%-.*s", width
, he
->trace_output
);
690 struct sort_entry sort_trace
= {
691 .se_header
= "Trace output",
692 .se_cmp
= sort__trace_cmp
,
693 .se_snprintf
= hist_entry__trace_snprintf
,
694 .se_width_idx
= HISTC_TRACE
,
697 /* sort keys for branch stacks */
700 sort__dso_from_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
702 if (!left
->branch_info
|| !right
->branch_info
)
703 return cmp_null(left
->branch_info
, right
->branch_info
);
705 return _sort__dso_cmp(left
->branch_info
->from
.map
,
706 right
->branch_info
->from
.map
);
709 static int hist_entry__dso_from_snprintf(struct hist_entry
*he
, char *bf
,
710 size_t size
, unsigned int width
)
713 return _hist_entry__dso_snprintf(he
->branch_info
->from
.map
,
716 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
719 static int hist_entry__dso_from_filter(struct hist_entry
*he
, int type
,
722 const struct dso
*dso
= arg
;
724 if (type
!= HIST_FILTER__DSO
)
727 return dso
&& (!he
->branch_info
|| !he
->branch_info
->from
.map
||
728 he
->branch_info
->from
.map
->dso
!= dso
);
732 sort__dso_to_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
734 if (!left
->branch_info
|| !right
->branch_info
)
735 return cmp_null(left
->branch_info
, right
->branch_info
);
737 return _sort__dso_cmp(left
->branch_info
->to
.map
,
738 right
->branch_info
->to
.map
);
741 static int hist_entry__dso_to_snprintf(struct hist_entry
*he
, char *bf
,
742 size_t size
, unsigned int width
)
745 return _hist_entry__dso_snprintf(he
->branch_info
->to
.map
,
748 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
751 static int hist_entry__dso_to_filter(struct hist_entry
*he
, int type
,
754 const struct dso
*dso
= arg
;
756 if (type
!= HIST_FILTER__DSO
)
759 return dso
&& (!he
->branch_info
|| !he
->branch_info
->to
.map
||
760 he
->branch_info
->to
.map
->dso
!= dso
);
764 sort__sym_from_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
766 struct addr_map_symbol
*from_l
= &left
->branch_info
->from
;
767 struct addr_map_symbol
*from_r
= &right
->branch_info
->from
;
769 if (!left
->branch_info
|| !right
->branch_info
)
770 return cmp_null(left
->branch_info
, right
->branch_info
);
772 from_l
= &left
->branch_info
->from
;
773 from_r
= &right
->branch_info
->from
;
775 if (!from_l
->sym
&& !from_r
->sym
)
776 return _sort__addr_cmp(from_l
->addr
, from_r
->addr
);
778 return _sort__sym_cmp(from_l
->sym
, from_r
->sym
);
782 sort__sym_to_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
784 struct addr_map_symbol
*to_l
, *to_r
;
786 if (!left
->branch_info
|| !right
->branch_info
)
787 return cmp_null(left
->branch_info
, right
->branch_info
);
789 to_l
= &left
->branch_info
->to
;
790 to_r
= &right
->branch_info
->to
;
792 if (!to_l
->sym
&& !to_r
->sym
)
793 return _sort__addr_cmp(to_l
->addr
, to_r
->addr
);
795 return _sort__sym_cmp(to_l
->sym
, to_r
->sym
);
798 static int hist_entry__sym_from_snprintf(struct hist_entry
*he
, char *bf
,
799 size_t size
, unsigned int width
)
801 if (he
->branch_info
) {
802 struct addr_map_symbol
*from
= &he
->branch_info
->from
;
804 return _hist_entry__sym_snprintf(from
->map
, from
->sym
, from
->addr
,
805 he
->level
, bf
, size
, width
);
808 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
811 static int hist_entry__sym_to_snprintf(struct hist_entry
*he
, char *bf
,
812 size_t size
, unsigned int width
)
814 if (he
->branch_info
) {
815 struct addr_map_symbol
*to
= &he
->branch_info
->to
;
817 return _hist_entry__sym_snprintf(to
->map
, to
->sym
, to
->addr
,
818 he
->level
, bf
, size
, width
);
821 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, "N/A");
824 static int hist_entry__sym_from_filter(struct hist_entry
*he
, int type
,
827 const char *sym
= arg
;
829 if (type
!= HIST_FILTER__SYMBOL
)
832 return sym
&& !(he
->branch_info
&& he
->branch_info
->from
.sym
&&
833 strstr(he
->branch_info
->from
.sym
->name
, sym
));
836 static int hist_entry__sym_to_filter(struct hist_entry
*he
, int type
,
839 const char *sym
= arg
;
841 if (type
!= HIST_FILTER__SYMBOL
)
844 return sym
&& !(he
->branch_info
&& he
->branch_info
->to
.sym
&&
845 strstr(he
->branch_info
->to
.sym
->name
, sym
));
848 struct sort_entry sort_dso_from
= {
849 .se_header
= "Source Shared Object",
850 .se_cmp
= sort__dso_from_cmp
,
851 .se_snprintf
= hist_entry__dso_from_snprintf
,
852 .se_filter
= hist_entry__dso_from_filter
,
853 .se_width_idx
= HISTC_DSO_FROM
,
856 struct sort_entry sort_dso_to
= {
857 .se_header
= "Target Shared Object",
858 .se_cmp
= sort__dso_to_cmp
,
859 .se_snprintf
= hist_entry__dso_to_snprintf
,
860 .se_filter
= hist_entry__dso_to_filter
,
861 .se_width_idx
= HISTC_DSO_TO
,
864 struct sort_entry sort_sym_from
= {
865 .se_header
= "Source Symbol",
866 .se_cmp
= sort__sym_from_cmp
,
867 .se_snprintf
= hist_entry__sym_from_snprintf
,
868 .se_filter
= hist_entry__sym_from_filter
,
869 .se_width_idx
= HISTC_SYMBOL_FROM
,
872 struct sort_entry sort_sym_to
= {
873 .se_header
= "Target Symbol",
874 .se_cmp
= sort__sym_to_cmp
,
875 .se_snprintf
= hist_entry__sym_to_snprintf
,
876 .se_filter
= hist_entry__sym_to_filter
,
877 .se_width_idx
= HISTC_SYMBOL_TO
,
881 sort__mispredict_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
885 if (!left
->branch_info
|| !right
->branch_info
)
886 return cmp_null(left
->branch_info
, right
->branch_info
);
888 mp
= left
->branch_info
->flags
.mispred
!= right
->branch_info
->flags
.mispred
;
889 p
= left
->branch_info
->flags
.predicted
!= right
->branch_info
->flags
.predicted
;
893 static int hist_entry__mispredict_snprintf(struct hist_entry
*he
, char *bf
,
894 size_t size
, unsigned int width
){
895 static const char *out
= "N/A";
897 if (he
->branch_info
) {
898 if (he
->branch_info
->flags
.predicted
)
900 else if (he
->branch_info
->flags
.mispred
)
904 return repsep_snprintf(bf
, size
, "%-*.*s", width
, width
, out
);
908 sort__cycles_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
910 if (!left
->branch_info
|| !right
->branch_info
)
911 return cmp_null(left
->branch_info
, right
->branch_info
);
913 return left
->branch_info
->flags
.cycles
-
914 right
->branch_info
->flags
.cycles
;
917 static int hist_entry__cycles_snprintf(struct hist_entry
*he
, char *bf
,
918 size_t size
, unsigned int width
)
920 if (!he
->branch_info
)
921 return scnprintf(bf
, size
, "%-.*s", width
, "N/A");
922 if (he
->branch_info
->flags
.cycles
== 0)
923 return repsep_snprintf(bf
, size
, "%-*s", width
, "-");
924 return repsep_snprintf(bf
, size
, "%-*hd", width
,
925 he
->branch_info
->flags
.cycles
);
928 struct sort_entry sort_cycles
= {
929 .se_header
= "Basic Block Cycles",
930 .se_cmp
= sort__cycles_cmp
,
931 .se_snprintf
= hist_entry__cycles_snprintf
,
932 .se_width_idx
= HISTC_CYCLES
,
935 /* --sort daddr_sym */
937 sort__daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
939 uint64_t l
= 0, r
= 0;
942 l
= left
->mem_info
->daddr
.addr
;
944 r
= right
->mem_info
->daddr
.addr
;
946 return (int64_t)(r
- l
);
949 static int hist_entry__daddr_snprintf(struct hist_entry
*he
, char *bf
,
950 size_t size
, unsigned int width
)
953 struct map
*map
= NULL
;
954 struct symbol
*sym
= NULL
;
957 addr
= he
->mem_info
->daddr
.addr
;
958 map
= he
->mem_info
->daddr
.map
;
959 sym
= he
->mem_info
->daddr
.sym
;
961 return _hist_entry__sym_snprintf(map
, sym
, addr
, he
->level
, bf
, size
,
966 sort__iaddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
968 uint64_t l
= 0, r
= 0;
971 l
= left
->mem_info
->iaddr
.addr
;
973 r
= right
->mem_info
->iaddr
.addr
;
975 return (int64_t)(r
- l
);
978 static int hist_entry__iaddr_snprintf(struct hist_entry
*he
, char *bf
,
979 size_t size
, unsigned int width
)
982 struct map
*map
= NULL
;
983 struct symbol
*sym
= NULL
;
986 addr
= he
->mem_info
->iaddr
.addr
;
987 map
= he
->mem_info
->iaddr
.map
;
988 sym
= he
->mem_info
->iaddr
.sym
;
990 return _hist_entry__sym_snprintf(map
, sym
, addr
, he
->level
, bf
, size
,
995 sort__dso_daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
997 struct map
*map_l
= NULL
;
998 struct map
*map_r
= NULL
;
1001 map_l
= left
->mem_info
->daddr
.map
;
1002 if (right
->mem_info
)
1003 map_r
= right
->mem_info
->daddr
.map
;
1005 return _sort__dso_cmp(map_l
, map_r
);
1008 static int hist_entry__dso_daddr_snprintf(struct hist_entry
*he
, char *bf
,
1009 size_t size
, unsigned int width
)
1011 struct map
*map
= NULL
;
1014 map
= he
->mem_info
->daddr
.map
;
1016 return _hist_entry__dso_snprintf(map
, bf
, size
, width
);
1020 sort__locked_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1022 union perf_mem_data_src data_src_l
;
1023 union perf_mem_data_src data_src_r
;
1026 data_src_l
= left
->mem_info
->data_src
;
1028 data_src_l
.mem_lock
= PERF_MEM_LOCK_NA
;
1030 if (right
->mem_info
)
1031 data_src_r
= right
->mem_info
->data_src
;
1033 data_src_r
.mem_lock
= PERF_MEM_LOCK_NA
;
1035 return (int64_t)(data_src_r
.mem_lock
- data_src_l
.mem_lock
);
1038 static int hist_entry__locked_snprintf(struct hist_entry
*he
, char *bf
,
1039 size_t size
, unsigned int width
)
1043 perf_mem__lck_scnprintf(out
, sizeof(out
), he
->mem_info
);
1044 return repsep_snprintf(bf
, size
, "%.*s", width
, out
);
1048 sort__tlb_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1050 union perf_mem_data_src data_src_l
;
1051 union perf_mem_data_src data_src_r
;
1054 data_src_l
= left
->mem_info
->data_src
;
1056 data_src_l
.mem_dtlb
= PERF_MEM_TLB_NA
;
1058 if (right
->mem_info
)
1059 data_src_r
= right
->mem_info
->data_src
;
1061 data_src_r
.mem_dtlb
= PERF_MEM_TLB_NA
;
1063 return (int64_t)(data_src_r
.mem_dtlb
- data_src_l
.mem_dtlb
);
1066 static int hist_entry__tlb_snprintf(struct hist_entry
*he
, char *bf
,
1067 size_t size
, unsigned int width
)
1071 perf_mem__tlb_scnprintf(out
, sizeof(out
), he
->mem_info
);
1072 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1076 sort__lvl_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1078 union perf_mem_data_src data_src_l
;
1079 union perf_mem_data_src data_src_r
;
1082 data_src_l
= left
->mem_info
->data_src
;
1084 data_src_l
.mem_lvl
= PERF_MEM_LVL_NA
;
1086 if (right
->mem_info
)
1087 data_src_r
= right
->mem_info
->data_src
;
1089 data_src_r
.mem_lvl
= PERF_MEM_LVL_NA
;
1091 return (int64_t)(data_src_r
.mem_lvl
- data_src_l
.mem_lvl
);
1094 static int hist_entry__lvl_snprintf(struct hist_entry
*he
, char *bf
,
1095 size_t size
, unsigned int width
)
1099 perf_mem__lvl_scnprintf(out
, sizeof(out
), he
->mem_info
);
1100 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1104 sort__snoop_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1106 union perf_mem_data_src data_src_l
;
1107 union perf_mem_data_src data_src_r
;
1110 data_src_l
= left
->mem_info
->data_src
;
1112 data_src_l
.mem_snoop
= PERF_MEM_SNOOP_NA
;
1114 if (right
->mem_info
)
1115 data_src_r
= right
->mem_info
->data_src
;
1117 data_src_r
.mem_snoop
= PERF_MEM_SNOOP_NA
;
1119 return (int64_t)(data_src_r
.mem_snoop
- data_src_l
.mem_snoop
);
1122 static int hist_entry__snoop_snprintf(struct hist_entry
*he
, char *bf
,
1123 size_t size
, unsigned int width
)
1127 perf_mem__snp_scnprintf(out
, sizeof(out
), he
->mem_info
);
1128 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1132 sort__dcacheline_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1135 struct map
*l_map
, *r_map
;
1137 if (!left
->mem_info
) return -1;
1138 if (!right
->mem_info
) return 1;
1140 /* group event types together */
1141 if (left
->cpumode
> right
->cpumode
) return -1;
1142 if (left
->cpumode
< right
->cpumode
) return 1;
1144 l_map
= left
->mem_info
->daddr
.map
;
1145 r_map
= right
->mem_info
->daddr
.map
;
1147 /* if both are NULL, jump to sort on al_addr instead */
1148 if (!l_map
&& !r_map
)
1151 if (!l_map
) return -1;
1152 if (!r_map
) return 1;
1154 if (l_map
->maj
> r_map
->maj
) return -1;
1155 if (l_map
->maj
< r_map
->maj
) return 1;
1157 if (l_map
->min
> r_map
->min
) return -1;
1158 if (l_map
->min
< r_map
->min
) return 1;
1160 if (l_map
->ino
> r_map
->ino
) return -1;
1161 if (l_map
->ino
< r_map
->ino
) return 1;
1163 if (l_map
->ino_generation
> r_map
->ino_generation
) return -1;
1164 if (l_map
->ino_generation
< r_map
->ino_generation
) return 1;
1167 * Addresses with no major/minor numbers are assumed to be
1168 * anonymous in userspace. Sort those on pid then address.
1170 * The kernel and non-zero major/minor mapped areas are
1171 * assumed to be unity mapped. Sort those on address.
1174 if ((left
->cpumode
!= PERF_RECORD_MISC_KERNEL
) &&
1175 (!(l_map
->flags
& MAP_SHARED
)) &&
1176 !l_map
->maj
&& !l_map
->min
&& !l_map
->ino
&&
1177 !l_map
->ino_generation
) {
1178 /* userspace anonymous */
1180 if (left
->thread
->pid_
> right
->thread
->pid_
) return -1;
1181 if (left
->thread
->pid_
< right
->thread
->pid_
) return 1;
1185 /* al_addr does all the right addr - start + offset calculations */
1186 l
= cl_address(left
->mem_info
->daddr
.al_addr
);
1187 r
= cl_address(right
->mem_info
->daddr
.al_addr
);
1189 if (l
> r
) return -1;
1190 if (l
< r
) return 1;
1195 static int hist_entry__dcacheline_snprintf(struct hist_entry
*he
, char *bf
,
1196 size_t size
, unsigned int width
)
1200 struct map
*map
= NULL
;
1201 struct symbol
*sym
= NULL
;
1202 char level
= he
->level
;
1205 addr
= cl_address(he
->mem_info
->daddr
.al_addr
);
1206 map
= he
->mem_info
->daddr
.map
;
1207 sym
= he
->mem_info
->daddr
.sym
;
1209 /* print [s] for shared data mmaps */
1210 if ((he
->cpumode
!= PERF_RECORD_MISC_KERNEL
) &&
1211 map
&& (map
->type
== MAP__VARIABLE
) &&
1212 (map
->flags
& MAP_SHARED
) &&
1213 (map
->maj
|| map
->min
|| map
->ino
||
1214 map
->ino_generation
))
1219 return _hist_entry__sym_snprintf(map
, sym
, addr
, level
, bf
, size
,
1223 struct sort_entry sort_mispredict
= {
1224 .se_header
= "Branch Mispredicted",
1225 .se_cmp
= sort__mispredict_cmp
,
1226 .se_snprintf
= hist_entry__mispredict_snprintf
,
1227 .se_width_idx
= HISTC_MISPREDICT
,
1230 static u64
he_weight(struct hist_entry
*he
)
1232 return he
->stat
.nr_events
? he
->stat
.weight
/ he
->stat
.nr_events
: 0;
1236 sort__local_weight_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1238 return he_weight(left
) - he_weight(right
);
1241 static int hist_entry__local_weight_snprintf(struct hist_entry
*he
, char *bf
,
1242 size_t size
, unsigned int width
)
1244 return repsep_snprintf(bf
, size
, "%-*llu", width
, he_weight(he
));
1247 struct sort_entry sort_local_weight
= {
1248 .se_header
= "Local Weight",
1249 .se_cmp
= sort__local_weight_cmp
,
1250 .se_snprintf
= hist_entry__local_weight_snprintf
,
1251 .se_width_idx
= HISTC_LOCAL_WEIGHT
,
1255 sort__global_weight_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1257 return left
->stat
.weight
- right
->stat
.weight
;
1260 static int hist_entry__global_weight_snprintf(struct hist_entry
*he
, char *bf
,
1261 size_t size
, unsigned int width
)
1263 return repsep_snprintf(bf
, size
, "%-*llu", width
, he
->stat
.weight
);
1266 struct sort_entry sort_global_weight
= {
1267 .se_header
= "Weight",
1268 .se_cmp
= sort__global_weight_cmp
,
1269 .se_snprintf
= hist_entry__global_weight_snprintf
,
1270 .se_width_idx
= HISTC_GLOBAL_WEIGHT
,
1273 struct sort_entry sort_mem_daddr_sym
= {
1274 .se_header
= "Data Symbol",
1275 .se_cmp
= sort__daddr_cmp
,
1276 .se_snprintf
= hist_entry__daddr_snprintf
,
1277 .se_width_idx
= HISTC_MEM_DADDR_SYMBOL
,
1280 struct sort_entry sort_mem_iaddr_sym
= {
1281 .se_header
= "Code Symbol",
1282 .se_cmp
= sort__iaddr_cmp
,
1283 .se_snprintf
= hist_entry__iaddr_snprintf
,
1284 .se_width_idx
= HISTC_MEM_IADDR_SYMBOL
,
1287 struct sort_entry sort_mem_daddr_dso
= {
1288 .se_header
= "Data Object",
1289 .se_cmp
= sort__dso_daddr_cmp
,
1290 .se_snprintf
= hist_entry__dso_daddr_snprintf
,
1291 .se_width_idx
= HISTC_MEM_DADDR_DSO
,
1294 struct sort_entry sort_mem_locked
= {
1295 .se_header
= "Locked",
1296 .se_cmp
= sort__locked_cmp
,
1297 .se_snprintf
= hist_entry__locked_snprintf
,
1298 .se_width_idx
= HISTC_MEM_LOCKED
,
1301 struct sort_entry sort_mem_tlb
= {
1302 .se_header
= "TLB access",
1303 .se_cmp
= sort__tlb_cmp
,
1304 .se_snprintf
= hist_entry__tlb_snprintf
,
1305 .se_width_idx
= HISTC_MEM_TLB
,
1308 struct sort_entry sort_mem_lvl
= {
1309 .se_header
= "Memory access",
1310 .se_cmp
= sort__lvl_cmp
,
1311 .se_snprintf
= hist_entry__lvl_snprintf
,
1312 .se_width_idx
= HISTC_MEM_LVL
,
1315 struct sort_entry sort_mem_snoop
= {
1316 .se_header
= "Snoop",
1317 .se_cmp
= sort__snoop_cmp
,
1318 .se_snprintf
= hist_entry__snoop_snprintf
,
1319 .se_width_idx
= HISTC_MEM_SNOOP
,
1322 struct sort_entry sort_mem_dcacheline
= {
1323 .se_header
= "Data Cacheline",
1324 .se_cmp
= sort__dcacheline_cmp
,
1325 .se_snprintf
= hist_entry__dcacheline_snprintf
,
1326 .se_width_idx
= HISTC_MEM_DCACHELINE
,
1330 sort__phys_daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1332 uint64_t l
= 0, r
= 0;
1335 l
= left
->mem_info
->daddr
.phys_addr
;
1336 if (right
->mem_info
)
1337 r
= right
->mem_info
->daddr
.phys_addr
;
1339 return (int64_t)(r
- l
);
1342 static int hist_entry__phys_daddr_snprintf(struct hist_entry
*he
, char *bf
,
1343 size_t size
, unsigned int width
)
1347 size_t len
= BITS_PER_LONG
/ 4;
1349 addr
= he
->mem_info
->daddr
.phys_addr
;
1351 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "[%c] ", he
->level
);
1353 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%-#.*llx", len
, addr
);
1355 ret
+= repsep_snprintf(bf
+ ret
, size
- ret
, "%-*s", width
- ret
, "");
1363 struct sort_entry sort_mem_phys_daddr
= {
1364 .se_header
= "Data Physical Address",
1365 .se_cmp
= sort__phys_daddr_cmp
,
1366 .se_snprintf
= hist_entry__phys_daddr_snprintf
,
1367 .se_width_idx
= HISTC_MEM_PHYS_DADDR
,
1371 sort__abort_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1373 if (!left
->branch_info
|| !right
->branch_info
)
1374 return cmp_null(left
->branch_info
, right
->branch_info
);
1376 return left
->branch_info
->flags
.abort
!=
1377 right
->branch_info
->flags
.abort
;
1380 static int hist_entry__abort_snprintf(struct hist_entry
*he
, char *bf
,
1381 size_t size
, unsigned int width
)
1383 static const char *out
= "N/A";
1385 if (he
->branch_info
) {
1386 if (he
->branch_info
->flags
.abort
)
1392 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1395 struct sort_entry sort_abort
= {
1396 .se_header
= "Transaction abort",
1397 .se_cmp
= sort__abort_cmp
,
1398 .se_snprintf
= hist_entry__abort_snprintf
,
1399 .se_width_idx
= HISTC_ABORT
,
1403 sort__in_tx_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1405 if (!left
->branch_info
|| !right
->branch_info
)
1406 return cmp_null(left
->branch_info
, right
->branch_info
);
1408 return left
->branch_info
->flags
.in_tx
!=
1409 right
->branch_info
->flags
.in_tx
;
1412 static int hist_entry__in_tx_snprintf(struct hist_entry
*he
, char *bf
,
1413 size_t size
, unsigned int width
)
1415 static const char *out
= "N/A";
1417 if (he
->branch_info
) {
1418 if (he
->branch_info
->flags
.in_tx
)
1424 return repsep_snprintf(bf
, size
, "%-*s", width
, out
);
1427 struct sort_entry sort_in_tx
= {
1428 .se_header
= "Branch in transaction",
1429 .se_cmp
= sort__in_tx_cmp
,
1430 .se_snprintf
= hist_entry__in_tx_snprintf
,
1431 .se_width_idx
= HISTC_IN_TX
,
1435 sort__transaction_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1437 return left
->transaction
- right
->transaction
;
1440 static inline char *add_str(char *p
, const char *str
)
1443 return p
+ strlen(str
);
1446 static struct txbit
{
1451 { PERF_TXN_ELISION
, "EL ", 0 },
1452 { PERF_TXN_TRANSACTION
, "TX ", 1 },
1453 { PERF_TXN_SYNC
, "SYNC ", 1 },
1454 { PERF_TXN_ASYNC
, "ASYNC ", 0 },
1455 { PERF_TXN_RETRY
, "RETRY ", 0 },
1456 { PERF_TXN_CONFLICT
, "CON ", 0 },
1457 { PERF_TXN_CAPACITY_WRITE
, "CAP-WRITE ", 1 },
1458 { PERF_TXN_CAPACITY_READ
, "CAP-READ ", 0 },
1462 int hist_entry__transaction_len(void)
1467 for (i
= 0; txbits
[i
].name
; i
++) {
1468 if (!txbits
[i
].skip_for_len
)
1469 len
+= strlen(txbits
[i
].name
);
1471 len
+= 4; /* :XX<space> */
1475 static int hist_entry__transaction_snprintf(struct hist_entry
*he
, char *bf
,
1476 size_t size
, unsigned int width
)
1478 u64 t
= he
->transaction
;
1484 for (i
= 0; txbits
[i
].name
; i
++)
1485 if (txbits
[i
].flag
& t
)
1486 p
= add_str(p
, txbits
[i
].name
);
1487 if (t
&& !(t
& (PERF_TXN_SYNC
|PERF_TXN_ASYNC
)))
1488 p
= add_str(p
, "NEITHER ");
1489 if (t
& PERF_TXN_ABORT_MASK
) {
1490 sprintf(p
, ":%" PRIx64
,
1491 (t
& PERF_TXN_ABORT_MASK
) >>
1492 PERF_TXN_ABORT_SHIFT
);
1496 return repsep_snprintf(bf
, size
, "%-*s", width
, buf
);
1499 struct sort_entry sort_transaction
= {
1500 .se_header
= "Transaction ",
1501 .se_cmp
= sort__transaction_cmp
,
1502 .se_snprintf
= hist_entry__transaction_snprintf
,
1503 .se_width_idx
= HISTC_TRANSACTION
,
1506 /* --sort symbol_size */
1508 static int64_t _sort__sym_size_cmp(struct symbol
*sym_l
, struct symbol
*sym_r
)
1510 int64_t size_l
= sym_l
!= NULL
? symbol__size(sym_l
) : 0;
1511 int64_t size_r
= sym_r
!= NULL
? symbol__size(sym_r
) : 0;
1513 return size_l
< size_r
? -1 :
1514 size_l
== size_r
? 0 : 1;
1518 sort__sym_size_cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1520 return _sort__sym_size_cmp(right
->ms
.sym
, left
->ms
.sym
);
1523 static int _hist_entry__sym_size_snprintf(struct symbol
*sym
, char *bf
,
1524 size_t bf_size
, unsigned int width
)
1527 return repsep_snprintf(bf
, bf_size
, "%*d", width
, symbol__size(sym
));
1529 return repsep_snprintf(bf
, bf_size
, "%*s", width
, "unknown");
1532 static int hist_entry__sym_size_snprintf(struct hist_entry
*he
, char *bf
,
1533 size_t size
, unsigned int width
)
1535 return _hist_entry__sym_size_snprintf(he
->ms
.sym
, bf
, size
, width
);
1538 struct sort_entry sort_sym_size
= {
1539 .se_header
= "Symbol size",
1540 .se_cmp
= sort__sym_size_cmp
,
1541 .se_snprintf
= hist_entry__sym_size_snprintf
,
1542 .se_width_idx
= HISTC_SYM_SIZE
,
1546 struct sort_dimension
{
1548 struct sort_entry
*entry
;
1552 #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }
1554 static struct sort_dimension common_sort_dimensions
[] = {
1555 DIM(SORT_PID
, "pid", sort_thread
),
1556 DIM(SORT_COMM
, "comm", sort_comm
),
1557 DIM(SORT_DSO
, "dso", sort_dso
),
1558 DIM(SORT_SYM
, "symbol", sort_sym
),
1559 DIM(SORT_PARENT
, "parent", sort_parent
),
1560 DIM(SORT_CPU
, "cpu", sort_cpu
),
1561 DIM(SORT_SOCKET
, "socket", sort_socket
),
1562 DIM(SORT_SRCLINE
, "srcline", sort_srcline
),
1563 DIM(SORT_SRCFILE
, "srcfile", sort_srcfile
),
1564 DIM(SORT_LOCAL_WEIGHT
, "local_weight", sort_local_weight
),
1565 DIM(SORT_GLOBAL_WEIGHT
, "weight", sort_global_weight
),
1566 DIM(SORT_TRANSACTION
, "transaction", sort_transaction
),
1567 DIM(SORT_TRACE
, "trace", sort_trace
),
1568 DIM(SORT_SYM_SIZE
, "symbol_size", sort_sym_size
),
1569 DIM(SORT_CGROUP_ID
, "cgroup_id", sort_cgroup_id
),
1574 #define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) }
1576 static struct sort_dimension bstack_sort_dimensions
[] = {
1577 DIM(SORT_DSO_FROM
, "dso_from", sort_dso_from
),
1578 DIM(SORT_DSO_TO
, "dso_to", sort_dso_to
),
1579 DIM(SORT_SYM_FROM
, "symbol_from", sort_sym_from
),
1580 DIM(SORT_SYM_TO
, "symbol_to", sort_sym_to
),
1581 DIM(SORT_MISPREDICT
, "mispredict", sort_mispredict
),
1582 DIM(SORT_IN_TX
, "in_tx", sort_in_tx
),
1583 DIM(SORT_ABORT
, "abort", sort_abort
),
1584 DIM(SORT_CYCLES
, "cycles", sort_cycles
),
1585 DIM(SORT_SRCLINE_FROM
, "srcline_from", sort_srcline_from
),
1586 DIM(SORT_SRCLINE_TO
, "srcline_to", sort_srcline_to
),
1591 #define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) }
1593 static struct sort_dimension memory_sort_dimensions
[] = {
1594 DIM(SORT_MEM_DADDR_SYMBOL
, "symbol_daddr", sort_mem_daddr_sym
),
1595 DIM(SORT_MEM_IADDR_SYMBOL
, "symbol_iaddr", sort_mem_iaddr_sym
),
1596 DIM(SORT_MEM_DADDR_DSO
, "dso_daddr", sort_mem_daddr_dso
),
1597 DIM(SORT_MEM_LOCKED
, "locked", sort_mem_locked
),
1598 DIM(SORT_MEM_TLB
, "tlb", sort_mem_tlb
),
1599 DIM(SORT_MEM_LVL
, "mem", sort_mem_lvl
),
1600 DIM(SORT_MEM_SNOOP
, "snoop", sort_mem_snoop
),
1601 DIM(SORT_MEM_DCACHELINE
, "dcacheline", sort_mem_dcacheline
),
1602 DIM(SORT_MEM_PHYS_DADDR
, "phys_daddr", sort_mem_phys_daddr
),
1607 struct hpp_dimension
{
1609 struct perf_hpp_fmt
*fmt
;
1613 #define DIM(d, n) { .name = n, .fmt = &perf_hpp__format[d], }
1615 static struct hpp_dimension hpp_sort_dimensions
[] = {
1616 DIM(PERF_HPP__OVERHEAD
, "overhead"),
1617 DIM(PERF_HPP__OVERHEAD_SYS
, "overhead_sys"),
1618 DIM(PERF_HPP__OVERHEAD_US
, "overhead_us"),
1619 DIM(PERF_HPP__OVERHEAD_GUEST_SYS
, "overhead_guest_sys"),
1620 DIM(PERF_HPP__OVERHEAD_GUEST_US
, "overhead_guest_us"),
1621 DIM(PERF_HPP__OVERHEAD_ACC
, "overhead_children"),
1622 DIM(PERF_HPP__SAMPLES
, "sample"),
1623 DIM(PERF_HPP__PERIOD
, "period"),
1628 struct hpp_sort_entry
{
1629 struct perf_hpp_fmt hpp
;
1630 struct sort_entry
*se
;
1633 void perf_hpp__reset_sort_width(struct perf_hpp_fmt
*fmt
, struct hists
*hists
)
1635 struct hpp_sort_entry
*hse
;
1637 if (!perf_hpp__is_sort_entry(fmt
))
1640 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1641 hists__new_col_len(hists
, hse
->se
->se_width_idx
, strlen(fmt
->name
));
1644 static int __sort__hpp_header(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
1645 struct hists
*hists
, int line __maybe_unused
,
1646 int *span __maybe_unused
)
1648 struct hpp_sort_entry
*hse
;
1649 size_t len
= fmt
->user_len
;
1651 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1654 len
= hists__col_len(hists
, hse
->se
->se_width_idx
);
1656 return scnprintf(hpp
->buf
, hpp
->size
, "%-*.*s", len
, len
, fmt
->name
);
1659 static int __sort__hpp_width(struct perf_hpp_fmt
*fmt
,
1660 struct perf_hpp
*hpp __maybe_unused
,
1661 struct hists
*hists
)
1663 struct hpp_sort_entry
*hse
;
1664 size_t len
= fmt
->user_len
;
1666 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1669 len
= hists__col_len(hists
, hse
->se
->se_width_idx
);
1674 static int __sort__hpp_entry(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
1675 struct hist_entry
*he
)
1677 struct hpp_sort_entry
*hse
;
1678 size_t len
= fmt
->user_len
;
1680 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1683 len
= hists__col_len(he
->hists
, hse
->se
->se_width_idx
);
1685 return hse
->se
->se_snprintf(he
, hpp
->buf
, hpp
->size
, len
);
1688 static int64_t __sort__hpp_cmp(struct perf_hpp_fmt
*fmt
,
1689 struct hist_entry
*a
, struct hist_entry
*b
)
1691 struct hpp_sort_entry
*hse
;
1693 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1694 return hse
->se
->se_cmp(a
, b
);
1697 static int64_t __sort__hpp_collapse(struct perf_hpp_fmt
*fmt
,
1698 struct hist_entry
*a
, struct hist_entry
*b
)
1700 struct hpp_sort_entry
*hse
;
1701 int64_t (*collapse_fn
)(struct hist_entry
*, struct hist_entry
*);
1703 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1704 collapse_fn
= hse
->se
->se_collapse
?: hse
->se
->se_cmp
;
1705 return collapse_fn(a
, b
);
1708 static int64_t __sort__hpp_sort(struct perf_hpp_fmt
*fmt
,
1709 struct hist_entry
*a
, struct hist_entry
*b
)
1711 struct hpp_sort_entry
*hse
;
1712 int64_t (*sort_fn
)(struct hist_entry
*, struct hist_entry
*);
1714 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1715 sort_fn
= hse
->se
->se_sort
?: hse
->se
->se_cmp
;
1716 return sort_fn(a
, b
);
1719 bool perf_hpp__is_sort_entry(struct perf_hpp_fmt
*format
)
1721 return format
->header
== __sort__hpp_header
;
1724 #define MK_SORT_ENTRY_CHK(key) \
1725 bool perf_hpp__is_ ## key ## _entry(struct perf_hpp_fmt *fmt) \
1727 struct hpp_sort_entry *hse; \
1729 if (!perf_hpp__is_sort_entry(fmt)) \
1732 hse = container_of(fmt, struct hpp_sort_entry, hpp); \
1733 return hse->se == &sort_ ## key ; \
1736 MK_SORT_ENTRY_CHK(trace
)
1737 MK_SORT_ENTRY_CHK(srcline
)
1738 MK_SORT_ENTRY_CHK(srcfile
)
1739 MK_SORT_ENTRY_CHK(thread
)
1740 MK_SORT_ENTRY_CHK(comm
)
1741 MK_SORT_ENTRY_CHK(dso
)
1742 MK_SORT_ENTRY_CHK(sym
)
1745 static bool __sort__hpp_equal(struct perf_hpp_fmt
*a
, struct perf_hpp_fmt
*b
)
1747 struct hpp_sort_entry
*hse_a
;
1748 struct hpp_sort_entry
*hse_b
;
1750 if (!perf_hpp__is_sort_entry(a
) || !perf_hpp__is_sort_entry(b
))
1753 hse_a
= container_of(a
, struct hpp_sort_entry
, hpp
);
1754 hse_b
= container_of(b
, struct hpp_sort_entry
, hpp
);
1756 return hse_a
->se
== hse_b
->se
;
1759 static void hse_free(struct perf_hpp_fmt
*fmt
)
1761 struct hpp_sort_entry
*hse
;
1763 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1767 static struct hpp_sort_entry
*
1768 __sort_dimension__alloc_hpp(struct sort_dimension
*sd
, int level
)
1770 struct hpp_sort_entry
*hse
;
1772 hse
= malloc(sizeof(*hse
));
1774 pr_err("Memory allocation failed\n");
1778 hse
->se
= sd
->entry
;
1779 hse
->hpp
.name
= sd
->entry
->se_header
;
1780 hse
->hpp
.header
= __sort__hpp_header
;
1781 hse
->hpp
.width
= __sort__hpp_width
;
1782 hse
->hpp
.entry
= __sort__hpp_entry
;
1783 hse
->hpp
.color
= NULL
;
1785 hse
->hpp
.cmp
= __sort__hpp_cmp
;
1786 hse
->hpp
.collapse
= __sort__hpp_collapse
;
1787 hse
->hpp
.sort
= __sort__hpp_sort
;
1788 hse
->hpp
.equal
= __sort__hpp_equal
;
1789 hse
->hpp
.free
= hse_free
;
1791 INIT_LIST_HEAD(&hse
->hpp
.list
);
1792 INIT_LIST_HEAD(&hse
->hpp
.sort_list
);
1793 hse
->hpp
.elide
= false;
1795 hse
->hpp
.user_len
= 0;
1796 hse
->hpp
.level
= level
;
1801 static void hpp_free(struct perf_hpp_fmt
*fmt
)
1806 static struct perf_hpp_fmt
*__hpp_dimension__alloc_hpp(struct hpp_dimension
*hd
,
1809 struct perf_hpp_fmt
*fmt
;
1811 fmt
= memdup(hd
->fmt
, sizeof(*fmt
));
1813 INIT_LIST_HEAD(&fmt
->list
);
1814 INIT_LIST_HEAD(&fmt
->sort_list
);
1815 fmt
->free
= hpp_free
;
1822 int hist_entry__filter(struct hist_entry
*he
, int type
, const void *arg
)
1824 struct perf_hpp_fmt
*fmt
;
1825 struct hpp_sort_entry
*hse
;
1829 perf_hpp_list__for_each_format(he
->hpp_list
, fmt
) {
1830 if (!perf_hpp__is_sort_entry(fmt
))
1833 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
1834 if (hse
->se
->se_filter
== NULL
)
1838 * hist entry is filtered if any of sort key in the hpp list
1839 * is applied. But it should skip non-matched filter types.
1841 r
= hse
->se
->se_filter(he
, type
, arg
);
1852 static int __sort_dimension__add_hpp_sort(struct sort_dimension
*sd
,
1853 struct perf_hpp_list
*list
,
1856 struct hpp_sort_entry
*hse
= __sort_dimension__alloc_hpp(sd
, level
);
1861 perf_hpp_list__register_sort_field(list
, &hse
->hpp
);
1865 static int __sort_dimension__add_hpp_output(struct sort_dimension
*sd
,
1866 struct perf_hpp_list
*list
)
1868 struct hpp_sort_entry
*hse
= __sort_dimension__alloc_hpp(sd
, 0);
1873 perf_hpp_list__column_register(list
, &hse
->hpp
);
1877 struct hpp_dynamic_entry
{
1878 struct perf_hpp_fmt hpp
;
1879 struct perf_evsel
*evsel
;
1880 struct format_field
*field
;
1881 unsigned dynamic_len
;
1885 static int hde_width(struct hpp_dynamic_entry
*hde
)
1887 if (!hde
->hpp
.len
) {
1888 int len
= hde
->dynamic_len
;
1889 int namelen
= strlen(hde
->field
->name
);
1890 int fieldlen
= hde
->field
->size
;
1895 if (!(hde
->field
->flags
& FIELD_IS_STRING
)) {
1896 /* length for print hex numbers */
1897 fieldlen
= hde
->field
->size
* 2 + 2;
1904 return hde
->hpp
.len
;
1907 static void update_dynamic_len(struct hpp_dynamic_entry
*hde
,
1908 struct hist_entry
*he
)
1911 struct format_field
*field
= hde
->field
;
1918 /* parse pretty print result and update max length */
1919 if (!he
->trace_output
)
1920 he
->trace_output
= get_trace_output(he
);
1922 namelen
= strlen(field
->name
);
1923 str
= he
->trace_output
;
1926 pos
= strchr(str
, ' ');
1929 pos
= str
+ strlen(str
);
1932 if (!strncmp(str
, field
->name
, namelen
)) {
1938 if (len
> hde
->dynamic_len
)
1939 hde
->dynamic_len
= len
;
1950 static int __sort__hde_header(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
1951 struct hists
*hists __maybe_unused
,
1952 int line __maybe_unused
,
1953 int *span __maybe_unused
)
1955 struct hpp_dynamic_entry
*hde
;
1956 size_t len
= fmt
->user_len
;
1958 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
1961 len
= hde_width(hde
);
1963 return scnprintf(hpp
->buf
, hpp
->size
, "%*.*s", len
, len
, hde
->field
->name
);
1966 static int __sort__hde_width(struct perf_hpp_fmt
*fmt
,
1967 struct perf_hpp
*hpp __maybe_unused
,
1968 struct hists
*hists __maybe_unused
)
1970 struct hpp_dynamic_entry
*hde
;
1971 size_t len
= fmt
->user_len
;
1973 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
1976 len
= hde_width(hde
);
1981 bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt
*fmt
, struct hists
*hists
)
1983 struct hpp_dynamic_entry
*hde
;
1985 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
1987 return hists_to_evsel(hists
) == hde
->evsel
;
1990 static int __sort__hde_entry(struct perf_hpp_fmt
*fmt
, struct perf_hpp
*hpp
,
1991 struct hist_entry
*he
)
1993 struct hpp_dynamic_entry
*hde
;
1994 size_t len
= fmt
->user_len
;
1996 struct format_field
*field
;
2001 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2004 len
= hde_width(hde
);
2009 if (!he
->trace_output
)
2010 he
->trace_output
= get_trace_output(he
);
2013 namelen
= strlen(field
->name
);
2014 str
= he
->trace_output
;
2017 pos
= strchr(str
, ' ');
2020 pos
= str
+ strlen(str
);
2023 if (!strncmp(str
, field
->name
, namelen
)) {
2025 str
= strndup(str
, pos
- str
);
2028 return scnprintf(hpp
->buf
, hpp
->size
,
2029 "%*.*s", len
, len
, "ERROR");
2040 struct trace_seq seq
;
2042 trace_seq_init(&seq
);
2043 pevent_print_field(&seq
, he
->raw_data
, hde
->field
);
2047 ret
= scnprintf(hpp
->buf
, hpp
->size
, "%*.*s", len
, len
, str
);
2052 static int64_t __sort__hde_cmp(struct perf_hpp_fmt
*fmt
,
2053 struct hist_entry
*a
, struct hist_entry
*b
)
2055 struct hpp_dynamic_entry
*hde
;
2056 struct format_field
*field
;
2057 unsigned offset
, size
;
2059 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2062 update_dynamic_len(hde
, a
);
2067 if (field
->flags
& FIELD_IS_DYNAMIC
) {
2068 unsigned long long dyn
;
2070 pevent_read_number_field(field
, a
->raw_data
, &dyn
);
2071 offset
= dyn
& 0xffff;
2072 size
= (dyn
>> 16) & 0xffff;
2074 /* record max width for output */
2075 if (size
> hde
->dynamic_len
)
2076 hde
->dynamic_len
= size
;
2078 offset
= field
->offset
;
2082 return memcmp(a
->raw_data
+ offset
, b
->raw_data
+ offset
, size
);
2085 bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt
*fmt
)
2087 return fmt
->cmp
== __sort__hde_cmp
;
2090 static bool __sort__hde_equal(struct perf_hpp_fmt
*a
, struct perf_hpp_fmt
*b
)
2092 struct hpp_dynamic_entry
*hde_a
;
2093 struct hpp_dynamic_entry
*hde_b
;
2095 if (!perf_hpp__is_dynamic_entry(a
) || !perf_hpp__is_dynamic_entry(b
))
2098 hde_a
= container_of(a
, struct hpp_dynamic_entry
, hpp
);
2099 hde_b
= container_of(b
, struct hpp_dynamic_entry
, hpp
);
2101 return hde_a
->field
== hde_b
->field
;
2104 static void hde_free(struct perf_hpp_fmt
*fmt
)
2106 struct hpp_dynamic_entry
*hde
;
2108 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2112 static struct hpp_dynamic_entry
*
2113 __alloc_dynamic_entry(struct perf_evsel
*evsel
, struct format_field
*field
,
2116 struct hpp_dynamic_entry
*hde
;
2118 hde
= malloc(sizeof(*hde
));
2120 pr_debug("Memory allocation failed\n");
2126 hde
->dynamic_len
= 0;
2128 hde
->hpp
.name
= field
->name
;
2129 hde
->hpp
.header
= __sort__hde_header
;
2130 hde
->hpp
.width
= __sort__hde_width
;
2131 hde
->hpp
.entry
= __sort__hde_entry
;
2132 hde
->hpp
.color
= NULL
;
2134 hde
->hpp
.cmp
= __sort__hde_cmp
;
2135 hde
->hpp
.collapse
= __sort__hde_cmp
;
2136 hde
->hpp
.sort
= __sort__hde_cmp
;
2137 hde
->hpp
.equal
= __sort__hde_equal
;
2138 hde
->hpp
.free
= hde_free
;
2140 INIT_LIST_HEAD(&hde
->hpp
.list
);
2141 INIT_LIST_HEAD(&hde
->hpp
.sort_list
);
2142 hde
->hpp
.elide
= false;
2144 hde
->hpp
.user_len
= 0;
2145 hde
->hpp
.level
= level
;
2150 struct perf_hpp_fmt
*perf_hpp_fmt__dup(struct perf_hpp_fmt
*fmt
)
2152 struct perf_hpp_fmt
*new_fmt
= NULL
;
2154 if (perf_hpp__is_sort_entry(fmt
)) {
2155 struct hpp_sort_entry
*hse
, *new_hse
;
2157 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
2158 new_hse
= memdup(hse
, sizeof(*hse
));
2160 new_fmt
= &new_hse
->hpp
;
2161 } else if (perf_hpp__is_dynamic_entry(fmt
)) {
2162 struct hpp_dynamic_entry
*hde
, *new_hde
;
2164 hde
= container_of(fmt
, struct hpp_dynamic_entry
, hpp
);
2165 new_hde
= memdup(hde
, sizeof(*hde
));
2167 new_fmt
= &new_hde
->hpp
;
2169 new_fmt
= memdup(fmt
, sizeof(*fmt
));
2172 INIT_LIST_HEAD(&new_fmt
->list
);
2173 INIT_LIST_HEAD(&new_fmt
->sort_list
);
2178 static int parse_field_name(char *str
, char **event
, char **field
, char **opt
)
2180 char *event_name
, *field_name
, *opt_name
;
2183 field_name
= strchr(str
, '.');
2186 *field_name
++ = '\0';
2192 opt_name
= strchr(field_name
, '/');
2196 *event
= event_name
;
2197 *field
= field_name
;
2203 /* find match evsel using a given event name. The event name can be:
2204 * 1. '%' + event index (e.g. '%1' for first event)
2205 * 2. full event name (e.g. sched:sched_switch)
2206 * 3. partial event name (should not contain ':')
2208 static struct perf_evsel
*find_evsel(struct perf_evlist
*evlist
, char *event_name
)
2210 struct perf_evsel
*evsel
= NULL
;
2211 struct perf_evsel
*pos
;
2215 if (event_name
[0] == '%') {
2216 int nr
= strtol(event_name
+1, NULL
, 0);
2218 if (nr
> evlist
->nr_entries
)
2221 evsel
= perf_evlist__first(evlist
);
2223 evsel
= perf_evsel__next(evsel
);
2228 full_name
= !!strchr(event_name
, ':');
2229 evlist__for_each_entry(evlist
, pos
) {
2231 if (full_name
&& !strcmp(pos
->name
, event_name
))
2234 if (!full_name
&& strstr(pos
->name
, event_name
)) {
2236 pr_debug("'%s' event is ambiguous: it can be %s or %s\n",
2237 event_name
, evsel
->name
, pos
->name
);
2247 static int __dynamic_dimension__add(struct perf_evsel
*evsel
,
2248 struct format_field
*field
,
2249 bool raw_trace
, int level
)
2251 struct hpp_dynamic_entry
*hde
;
2253 hde
= __alloc_dynamic_entry(evsel
, field
, level
);
2257 hde
->raw_trace
= raw_trace
;
2259 perf_hpp__register_sort_field(&hde
->hpp
);
2263 static int add_evsel_fields(struct perf_evsel
*evsel
, bool raw_trace
, int level
)
2266 struct format_field
*field
;
2268 field
= evsel
->tp_format
->format
.fields
;
2270 ret
= __dynamic_dimension__add(evsel
, field
, raw_trace
, level
);
2274 field
= field
->next
;
2279 static int add_all_dynamic_fields(struct perf_evlist
*evlist
, bool raw_trace
,
2283 struct perf_evsel
*evsel
;
2285 evlist__for_each_entry(evlist
, evsel
) {
2286 if (evsel
->attr
.type
!= PERF_TYPE_TRACEPOINT
)
2289 ret
= add_evsel_fields(evsel
, raw_trace
, level
);
2296 static int add_all_matching_fields(struct perf_evlist
*evlist
,
2297 char *field_name
, bool raw_trace
, int level
)
2300 struct perf_evsel
*evsel
;
2301 struct format_field
*field
;
2303 evlist__for_each_entry(evlist
, evsel
) {
2304 if (evsel
->attr
.type
!= PERF_TYPE_TRACEPOINT
)
2307 field
= pevent_find_any_field(evsel
->tp_format
, field_name
);
2311 ret
= __dynamic_dimension__add(evsel
, field
, raw_trace
, level
);
2318 static int add_dynamic_entry(struct perf_evlist
*evlist
, const char *tok
,
2321 char *str
, *event_name
, *field_name
, *opt_name
;
2322 struct perf_evsel
*evsel
;
2323 struct format_field
*field
;
2324 bool raw_trace
= symbol_conf
.raw_trace
;
2334 if (parse_field_name(str
, &event_name
, &field_name
, &opt_name
) < 0) {
2340 if (strcmp(opt_name
, "raw")) {
2341 pr_debug("unsupported field option %s\n", opt_name
);
2348 if (!strcmp(field_name
, "trace_fields")) {
2349 ret
= add_all_dynamic_fields(evlist
, raw_trace
, level
);
2353 if (event_name
== NULL
) {
2354 ret
= add_all_matching_fields(evlist
, field_name
, raw_trace
, level
);
2358 evsel
= find_evsel(evlist
, event_name
);
2359 if (evsel
== NULL
) {
2360 pr_debug("Cannot find event: %s\n", event_name
);
2365 if (evsel
->attr
.type
!= PERF_TYPE_TRACEPOINT
) {
2366 pr_debug("%s is not a tracepoint event\n", event_name
);
2371 if (!strcmp(field_name
, "*")) {
2372 ret
= add_evsel_fields(evsel
, raw_trace
, level
);
2374 field
= pevent_find_any_field(evsel
->tp_format
, field_name
);
2375 if (field
== NULL
) {
2376 pr_debug("Cannot find event field for %s.%s\n",
2377 event_name
, field_name
);
2381 ret
= __dynamic_dimension__add(evsel
, field
, raw_trace
, level
);
2389 static int __sort_dimension__add(struct sort_dimension
*sd
,
2390 struct perf_hpp_list
*list
,
2396 if (__sort_dimension__add_hpp_sort(sd
, list
, level
) < 0)
2399 if (sd
->entry
->se_collapse
)
2400 list
->need_collapse
= 1;
2407 static int __hpp_dimension__add(struct hpp_dimension
*hd
,
2408 struct perf_hpp_list
*list
,
2411 struct perf_hpp_fmt
*fmt
;
2416 fmt
= __hpp_dimension__alloc_hpp(hd
, level
);
2421 perf_hpp_list__register_sort_field(list
, fmt
);
2425 static int __sort_dimension__add_output(struct perf_hpp_list
*list
,
2426 struct sort_dimension
*sd
)
2431 if (__sort_dimension__add_hpp_output(sd
, list
) < 0)
2438 static int __hpp_dimension__add_output(struct perf_hpp_list
*list
,
2439 struct hpp_dimension
*hd
)
2441 struct perf_hpp_fmt
*fmt
;
2446 fmt
= __hpp_dimension__alloc_hpp(hd
, 0);
2451 perf_hpp_list__column_register(list
, fmt
);
2455 int hpp_dimension__add_output(unsigned col
)
2457 BUG_ON(col
>= PERF_HPP__MAX_INDEX
);
2458 return __hpp_dimension__add_output(&perf_hpp_list
, &hpp_sort_dimensions
[col
]);
2461 int sort_dimension__add(struct perf_hpp_list
*list
, const char *tok
,
2462 struct perf_evlist
*evlist
,
2467 for (i
= 0; i
< ARRAY_SIZE(common_sort_dimensions
); i
++) {
2468 struct sort_dimension
*sd
= &common_sort_dimensions
[i
];
2470 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2473 if (sd
->entry
== &sort_parent
) {
2474 int ret
= regcomp(&parent_regex
, parent_pattern
, REG_EXTENDED
);
2478 regerror(ret
, &parent_regex
, err
, sizeof(err
));
2479 pr_err("Invalid regex: %s\n%s", parent_pattern
, err
);
2483 } else if (sd
->entry
== &sort_sym
) {
2486 * perf diff displays the performance difference amongst
2487 * two or more perf.data files. Those files could come
2488 * from different binaries. So we should not compare
2489 * their ips, but the name of symbol.
2491 if (sort__mode
== SORT_MODE__DIFF
)
2492 sd
->entry
->se_collapse
= sort__sym_sort
;
2494 } else if (sd
->entry
== &sort_dso
) {
2496 } else if (sd
->entry
== &sort_socket
) {
2498 } else if (sd
->entry
== &sort_thread
) {
2500 } else if (sd
->entry
== &sort_comm
) {
2504 return __sort_dimension__add(sd
, list
, level
);
2507 for (i
= 0; i
< ARRAY_SIZE(hpp_sort_dimensions
); i
++) {
2508 struct hpp_dimension
*hd
= &hpp_sort_dimensions
[i
];
2510 if (strncasecmp(tok
, hd
->name
, strlen(tok
)))
2513 return __hpp_dimension__add(hd
, list
, level
);
2516 for (i
= 0; i
< ARRAY_SIZE(bstack_sort_dimensions
); i
++) {
2517 struct sort_dimension
*sd
= &bstack_sort_dimensions
[i
];
2519 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2522 if (sort__mode
!= SORT_MODE__BRANCH
)
2525 if (sd
->entry
== &sort_sym_from
|| sd
->entry
== &sort_sym_to
)
2528 __sort_dimension__add(sd
, list
, level
);
2532 for (i
= 0; i
< ARRAY_SIZE(memory_sort_dimensions
); i
++) {
2533 struct sort_dimension
*sd
= &memory_sort_dimensions
[i
];
2535 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2538 if (sort__mode
!= SORT_MODE__MEMORY
)
2541 if (sd
->entry
== &sort_mem_dcacheline
&& cacheline_size
== 0)
2544 if (sd
->entry
== &sort_mem_daddr_sym
)
2547 __sort_dimension__add(sd
, list
, level
);
2551 if (!add_dynamic_entry(evlist
, tok
, level
))
2557 static int setup_sort_list(struct perf_hpp_list
*list
, char *str
,
2558 struct perf_evlist
*evlist
)
2564 bool in_group
= false;
2568 tmp
= strpbrk(str
, "{}, ");
2573 next_level
= level
+ 1;
2577 else if (*tmp
== '}')
2585 ret
= sort_dimension__add(list
, tok
, evlist
, level
);
2586 if (ret
== -EINVAL
) {
2587 if (!cacheline_size
&& !strncasecmp(tok
, "dcacheline", strlen(tok
)))
2588 pr_err("The \"dcacheline\" --sort key needs to know the cacheline size and it couldn't be determined on this system");
2590 pr_err("Invalid --sort key: `%s'", tok
);
2592 } else if (ret
== -ESRCH
) {
2593 pr_err("Unknown --sort key: `%s'", tok
);
2604 static const char *get_default_sort_order(struct perf_evlist
*evlist
)
2606 const char *default_sort_orders
[] = {
2608 default_branch_sort_order
,
2609 default_mem_sort_order
,
2610 default_top_sort_order
,
2611 default_diff_sort_order
,
2612 default_tracepoint_sort_order
,
2614 bool use_trace
= true;
2615 struct perf_evsel
*evsel
;
2617 BUG_ON(sort__mode
>= ARRAY_SIZE(default_sort_orders
));
2619 if (evlist
== NULL
|| perf_evlist__empty(evlist
))
2622 evlist__for_each_entry(evlist
, evsel
) {
2623 if (evsel
->attr
.type
!= PERF_TYPE_TRACEPOINT
) {
2630 sort__mode
= SORT_MODE__TRACEPOINT
;
2631 if (symbol_conf
.raw_trace
)
2632 return "trace_fields";
2635 return default_sort_orders
[sort__mode
];
2638 static int setup_sort_order(struct perf_evlist
*evlist
)
2640 char *new_sort_order
;
2643 * Append '+'-prefixed sort order to the default sort
2646 if (!sort_order
|| is_strict_order(sort_order
))
2649 if (sort_order
[1] == '\0') {
2650 pr_err("Invalid --sort key: `+'");
2655 * We allocate new sort_order string, but we never free it,
2656 * because it's checked over the rest of the code.
2658 if (asprintf(&new_sort_order
, "%s,%s",
2659 get_default_sort_order(evlist
), sort_order
+ 1) < 0) {
2660 pr_err("Not enough memory to set up --sort");
2664 sort_order
= new_sort_order
;
2669 * Adds 'pre,' prefix into 'str' is 'pre' is
2670 * not already part of 'str'.
2672 static char *prefix_if_not_in(const char *pre
, char *str
)
2676 if (!str
|| strstr(str
, pre
))
2679 if (asprintf(&n
, "%s,%s", pre
, str
) < 0)
2686 static char *setup_overhead(char *keys
)
2688 if (sort__mode
== SORT_MODE__DIFF
)
2691 keys
= prefix_if_not_in("overhead", keys
);
2693 if (symbol_conf
.cumulate_callchain
)
2694 keys
= prefix_if_not_in("overhead_children", keys
);
2699 static int __setup_sorting(struct perf_evlist
*evlist
)
2702 const char *sort_keys
;
2705 ret
= setup_sort_order(evlist
);
2709 sort_keys
= sort_order
;
2710 if (sort_keys
== NULL
) {
2711 if (is_strict_order(field_order
)) {
2713 * If user specified field order but no sort order,
2714 * we'll honor it and not add default sort orders.
2719 sort_keys
= get_default_sort_order(evlist
);
2722 str
= strdup(sort_keys
);
2724 pr_err("Not enough memory to setup sort keys");
2729 * Prepend overhead fields for backward compatibility.
2731 if (!is_strict_order(field_order
)) {
2732 str
= setup_overhead(str
);
2734 pr_err("Not enough memory to setup overhead keys");
2739 ret
= setup_sort_list(&perf_hpp_list
, str
, evlist
);
2745 void perf_hpp__set_elide(int idx
, bool elide
)
2747 struct perf_hpp_fmt
*fmt
;
2748 struct hpp_sort_entry
*hse
;
2750 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2751 if (!perf_hpp__is_sort_entry(fmt
))
2754 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
2755 if (hse
->se
->se_width_idx
== idx
) {
2762 static bool __get_elide(struct strlist
*list
, const char *list_name
, FILE *fp
)
2764 if (list
&& strlist__nr_entries(list
) == 1) {
2766 fprintf(fp
, "# %s: %s\n", list_name
,
2767 strlist__entry(list
, 0)->s
);
2773 static bool get_elide(int idx
, FILE *output
)
2777 return __get_elide(symbol_conf
.sym_list
, "symbol", output
);
2779 return __get_elide(symbol_conf
.dso_list
, "dso", output
);
2781 return __get_elide(symbol_conf
.comm_list
, "comm", output
);
2786 if (sort__mode
!= SORT_MODE__BRANCH
)
2790 case HISTC_SYMBOL_FROM
:
2791 return __get_elide(symbol_conf
.sym_from_list
, "sym_from", output
);
2792 case HISTC_SYMBOL_TO
:
2793 return __get_elide(symbol_conf
.sym_to_list
, "sym_to", output
);
2794 case HISTC_DSO_FROM
:
2795 return __get_elide(symbol_conf
.dso_from_list
, "dso_from", output
);
2797 return __get_elide(symbol_conf
.dso_to_list
, "dso_to", output
);
2805 void sort__setup_elide(FILE *output
)
2807 struct perf_hpp_fmt
*fmt
;
2808 struct hpp_sort_entry
*hse
;
2810 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2811 if (!perf_hpp__is_sort_entry(fmt
))
2814 hse
= container_of(fmt
, struct hpp_sort_entry
, hpp
);
2815 fmt
->elide
= get_elide(hse
->se
->se_width_idx
, output
);
2819 * It makes no sense to elide all of sort entries.
2820 * Just revert them to show up again.
2822 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2823 if (!perf_hpp__is_sort_entry(fmt
))
2830 perf_hpp_list__for_each_format(&perf_hpp_list
, fmt
) {
2831 if (!perf_hpp__is_sort_entry(fmt
))
2838 int output_field_add(struct perf_hpp_list
*list
, char *tok
)
2842 for (i
= 0; i
< ARRAY_SIZE(common_sort_dimensions
); i
++) {
2843 struct sort_dimension
*sd
= &common_sort_dimensions
[i
];
2845 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2848 return __sort_dimension__add_output(list
, sd
);
2851 for (i
= 0; i
< ARRAY_SIZE(hpp_sort_dimensions
); i
++) {
2852 struct hpp_dimension
*hd
= &hpp_sort_dimensions
[i
];
2854 if (strncasecmp(tok
, hd
->name
, strlen(tok
)))
2857 return __hpp_dimension__add_output(list
, hd
);
2860 for (i
= 0; i
< ARRAY_SIZE(bstack_sort_dimensions
); i
++) {
2861 struct sort_dimension
*sd
= &bstack_sort_dimensions
[i
];
2863 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2866 return __sort_dimension__add_output(list
, sd
);
2869 for (i
= 0; i
< ARRAY_SIZE(memory_sort_dimensions
); i
++) {
2870 struct sort_dimension
*sd
= &memory_sort_dimensions
[i
];
2872 if (strncasecmp(tok
, sd
->name
, strlen(tok
)))
2875 return __sort_dimension__add_output(list
, sd
);
2881 static int setup_output_list(struct perf_hpp_list
*list
, char *str
)
2886 for (tok
= strtok_r(str
, ", ", &tmp
);
2887 tok
; tok
= strtok_r(NULL
, ", ", &tmp
)) {
2888 ret
= output_field_add(list
, tok
);
2889 if (ret
== -EINVAL
) {
2890 ui__error("Invalid --fields key: `%s'", tok
);
2892 } else if (ret
== -ESRCH
) {
2893 ui__error("Unknown --fields key: `%s'", tok
);
2901 void reset_dimensions(void)
2905 for (i
= 0; i
< ARRAY_SIZE(common_sort_dimensions
); i
++)
2906 common_sort_dimensions
[i
].taken
= 0;
2908 for (i
= 0; i
< ARRAY_SIZE(hpp_sort_dimensions
); i
++)
2909 hpp_sort_dimensions
[i
].taken
= 0;
2911 for (i
= 0; i
< ARRAY_SIZE(bstack_sort_dimensions
); i
++)
2912 bstack_sort_dimensions
[i
].taken
= 0;
2914 for (i
= 0; i
< ARRAY_SIZE(memory_sort_dimensions
); i
++)
2915 memory_sort_dimensions
[i
].taken
= 0;
2918 bool is_strict_order(const char *order
)
2920 return order
&& (*order
!= '+');
2923 static int __setup_output_field(void)
2928 if (field_order
== NULL
)
2931 strp
= str
= strdup(field_order
);
2933 pr_err("Not enough memory to setup output fields");
2937 if (!is_strict_order(field_order
))
2940 if (!strlen(strp
)) {
2941 pr_err("Invalid --fields key: `+'");
2945 ret
= setup_output_list(&perf_hpp_list
, strp
);
2952 int setup_sorting(struct perf_evlist
*evlist
)
2956 err
= __setup_sorting(evlist
);
2960 if (parent_pattern
!= default_parent_pattern
) {
2961 err
= sort_dimension__add(&perf_hpp_list
, "parent", evlist
, -1);
2969 * perf diff doesn't use default hpp output fields.
2971 if (sort__mode
!= SORT_MODE__DIFF
)
2974 err
= __setup_output_field();
2978 /* copy sort keys to output fields */
2979 perf_hpp__setup_output_field(&perf_hpp_list
);
2980 /* and then copy output fields to sort keys */
2981 perf_hpp__append_sort_keys(&perf_hpp_list
);
2983 /* setup hists-specific output fields */
2984 if (perf_hpp__setup_hists_formats(&perf_hpp_list
, evlist
) < 0)
2990 void reset_output_field(void)
2992 perf_hpp_list
.need_collapse
= 0;
2993 perf_hpp_list
.parent
= 0;
2994 perf_hpp_list
.sym
= 0;
2995 perf_hpp_list
.dso
= 0;
3001 perf_hpp__reset_output_field(&perf_hpp_list
);