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 const char default_mem_sort_order[];
38 extern bool chk_double_cl;
60 struct hist_entry_diff {
64 double period_ratio_delta;
69 /* HISTC_WEIGHTED_DIFF */
72 /* PERF_HPP_DIFF__CYCLES */
76 unsigned long svals[NUM_SPARKS];
79 struct hist_entry_ops {
80 void *(*new)(size_t size);
81 void (*free)(void *ptr);
85 * struct hist_entry - histogram entry
87 * @row_offset - offset from the first callchain expanded to appear on screen
88 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
91 struct rb_node rb_node_in;
92 struct rb_node rb_node;
94 struct list_head node;
95 struct list_head head;
98 struct he_stat *stat_acc;
100 struct thread *thread;
102 struct namespace_id cgroup_id;
114 struct simd_flags simd_flags;
116 /* We are added by hists__add_dummy_entry. */
126 * Since perf diff only supports the stdio output, TUI
127 * fields are only accessed from perf report (or perf
128 * top). So make it a union to reduce memory usage.
130 struct hist_entry_diff diff;
131 struct /* for TUI */ {
134 bool init_have_children;
142 struct symbol *parent;
143 struct branch_info *branch_info;
146 struct mem_info *mem_info;
147 struct block_info *block_info;
148 struct kvm_info *kvm_info;
152 struct res_sample *res_samples;
154 struct perf_hpp_list *hpp_list;
155 struct hist_entry *parent_he;
156 struct hist_entry_ops *ops;
158 /* this is for hierarchical entry structure */
160 struct rb_root_cached hroot_in;
161 struct rb_root_cached hroot_out;
162 }; /* non-leaf entries */
163 struct rb_root sorted_chain; /* leaf entry has callchains */
165 struct callchain_root callchain[0]; /* must be last member */
168 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he)
170 return he->callchain_size != 0;
173 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width);
175 static inline bool hist_entry__has_pairs(struct hist_entry *he)
177 return !list_empty(&he->pairs.node);
180 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
182 if (hist_entry__has_pairs(he))
183 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
187 static inline void hist_entry__add_pair(struct hist_entry *pair,
188 struct hist_entry *he)
190 list_add_tail(&pair->pairs.node, &he->pairs.head);
193 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
195 u64 period = he->stat.period;
196 u64 total_period = hists__total_period(he->hists);
198 if (unlikely(total_period == 0))
201 if (symbol_conf.cumulate_callchain)
202 period = he->stat_acc->period;
204 return period * 100.0 / total_period;
213 SORT_MODE__TRACEPOINT,
217 /* common sort keys */
240 SORT_LOCAL_PIPELINE_STAGE_CYC,
241 SORT_GLOBAL_PIPELINE_STAGE_CYC,
243 SORT_LOCAL_RETIRE_LAT,
244 SORT_GLOBAL_RETIRE_LAT,
247 /* branch stack specific sort keys */
249 SORT_DSO_FROM = __SORT_BRANCH_STACK,
263 /* memory mode specific sort keys */
265 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
272 SORT_MEM_IADDR_SYMBOL,
274 SORT_MEM_DATA_PAGE_SIZE,
279 * configurable sorting bits
283 const char *se_header;
285 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
286 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
287 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
288 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
290 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
291 void (*se_init)(struct hist_entry *he);
296 struct hists block_hists;
297 struct perf_hpp_list block_list;
298 struct perf_hpp_fmt block_fmt;
301 struct hist_entry he;
304 extern struct sort_entry sort_thread;
308 int setup_sorting(struct evlist *evlist);
309 int setup_output_field(void);
310 void reset_output_field(void);
311 void sort__setup_elide(FILE *fp);
312 void perf_hpp__set_elide(int idx, bool elide);
314 char *sort_help(const char *prefix);
316 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
318 bool is_strict_order(const char *order);
320 int hpp_dimension__add_output(unsigned col);
321 void reset_dimensions(void);
322 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
323 struct evlist *evlist,
325 int output_field_add(struct perf_hpp_list *list, char *tok);
327 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
329 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
331 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
333 _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r);
334 char *hist_entry__srcline(struct hist_entry *he);
335 #endif /* __PERF_SORT_H */