1 /* SPDX-License-Identifier: GPL-2.0 */
6 #include <linux/list.h>
7 #include <linux/rbtree.h>
8 #include "map_symbol.h"
9 #include "symbol_conf.h"
10 #include "callchain.h"
19 extern regex_t parent_regex
;
20 extern const char *sort_order
;
21 extern const char *field_order
;
22 extern const char default_parent_pattern
[];
23 extern const char *parent_pattern
;
24 extern const char *default_sort_order
;
25 extern regex_t ignore_callees_regex
;
26 extern int have_ignore_callees
;
27 extern enum sort_mode sort__mode
;
28 extern struct sort_entry sort_comm
;
29 extern struct sort_entry sort_dso
;
30 extern struct sort_entry sort_sym
;
31 extern struct sort_entry sort_parent
;
32 extern struct sort_entry sort_dso_from
;
33 extern struct sort_entry sort_dso_to
;
34 extern struct sort_entry sort_sym_from
;
35 extern struct sort_entry sort_sym_to
;
36 extern struct sort_entry sort_srcline
;
37 extern enum sort_type sort__first_dimension
;
38 extern const char default_mem_sort_order
[];
61 struct hist_entry_diff
{
65 double period_ratio_delta
;
70 /* HISTC_WEIGHTED_DIFF */
73 /* PERF_HPP_DIFF__CYCLES */
77 unsigned long svals
[NUM_SPARKS
];
80 struct hist_entry_ops
{
81 void *(*new)(size_t size
);
82 void (*free
)(void *ptr
);
86 * struct hist_entry - histogram entry
88 * @row_offset - offset from the first callchain expanded to appear on screen
89 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
92 struct rb_node rb_node_in
;
93 struct rb_node rb_node
;
95 struct list_head node
;
96 struct list_head head
;
99 struct he_stat
*stat_acc
;
100 struct map_symbol ms
;
101 struct thread
*thread
;
103 struct namespace_id cgroup_id
;
112 /* We are added by hists__add_dummy_entry. */
122 * Since perf diff only supports the stdio output, TUI
123 * fields are only accessed from perf report (or perf
124 * top). So make it a union to reduce memory usage.
126 struct hist_entry_diff diff
;
127 struct /* for TUI */ {
130 bool init_have_children
;
138 struct symbol
*parent
;
139 struct branch_info
*branch_info
;
142 struct mem_info
*mem_info
;
143 struct block_info
*block_info
;
147 struct res_sample
*res_samples
;
149 struct perf_hpp_list
*hpp_list
;
150 struct hist_entry
*parent_he
;
151 struct hist_entry_ops
*ops
;
153 /* this is for hierarchical entry structure */
155 struct rb_root_cached hroot_in
;
156 struct rb_root_cached hroot_out
;
157 }; /* non-leaf entries */
158 struct rb_root sorted_chain
; /* leaf entry has callchains */
160 struct callchain_root callchain
[0]; /* must be last member */
163 static __pure
inline bool hist_entry__has_callchains(struct hist_entry
*he
)
165 return he
->callchain_size
!= 0;
168 int hist_entry__sym_snprintf(struct hist_entry
*he
, char *bf
, size_t size
, unsigned int width
);
170 static inline bool hist_entry__has_pairs(struct hist_entry
*he
)
172 return !list_empty(&he
->pairs
.node
);
175 static inline struct hist_entry
*hist_entry__next_pair(struct hist_entry
*he
)
177 if (hist_entry__has_pairs(he
))
178 return list_entry(he
->pairs
.node
.next
, struct hist_entry
, pairs
.node
);
182 static inline void hist_entry__add_pair(struct hist_entry
*pair
,
183 struct hist_entry
*he
)
185 list_add_tail(&pair
->pairs
.node
, &he
->pairs
.head
);
188 static inline float hist_entry__get_percent_limit(struct hist_entry
*he
)
190 u64 period
= he
->stat
.period
;
191 u64 total_period
= hists__total_period(he
->hists
);
193 if (unlikely(total_period
== 0))
196 if (symbol_conf
.cumulate_callchain
)
197 period
= he
->stat_acc
->period
;
199 return period
* 100.0 / total_period
;
208 SORT_MODE__TRACEPOINT
,
212 /* common sort keys */
233 /* branch stack specific sort keys */
235 SORT_DSO_FROM
= __SORT_BRANCH_STACK
,
247 /* memory mode specific sort keys */
249 SORT_MEM_DADDR_SYMBOL
= __SORT_MEMORY_MODE
,
256 SORT_MEM_IADDR_SYMBOL
,
258 SORT_MEM_DATA_PAGE_SIZE
,
262 * configurable sorting bits
266 const char *se_header
;
268 int64_t (*se_cmp
)(struct hist_entry
*, struct hist_entry
*);
269 int64_t (*se_collapse
)(struct hist_entry
*, struct hist_entry
*);
270 int64_t (*se_sort
)(struct hist_entry
*, struct hist_entry
*);
271 int (*se_snprintf
)(struct hist_entry
*he
, char *bf
, size_t size
,
273 int (*se_filter
)(struct hist_entry
*he
, int type
, const void *arg
);
278 struct hists block_hists
;
279 struct perf_hpp_list block_list
;
280 struct perf_hpp_fmt block_fmt
;
283 struct hist_entry he
;
286 extern struct sort_entry sort_thread
;
287 extern struct list_head hist_entry__sort_list
;
291 int setup_sorting(struct evlist
*evlist
);
292 int setup_output_field(void);
293 void reset_output_field(void);
294 void sort__setup_elide(FILE *fp
);
295 void perf_hpp__set_elide(int idx
, bool elide
);
297 const char *sort_help(const char *prefix
);
299 int report_parse_ignore_callees_opt(const struct option
*opt
, const char *arg
, int unset
);
301 bool is_strict_order(const char *order
);
303 int hpp_dimension__add_output(unsigned col
);
304 void reset_dimensions(void);
305 int sort_dimension__add(struct perf_hpp_list
*list
, const char *tok
,
306 struct evlist
*evlist
,
308 int output_field_add(struct perf_hpp_list
*list
, char *tok
);
310 sort__iaddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
312 sort__daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
314 sort__dcacheline_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
316 _sort__sym_cmp(struct symbol
*sym_l
, struct symbol
*sym_r
);
317 char *hist_entry__srcline(struct hist_entry
*he
);
318 #endif /* __PERF_SORT_H */