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"
18 struct annotated_data_type;
20 extern regex_t parent_regex;
21 extern const char *sort_order;
22 extern const char *field_order;
23 extern const char default_parent_pattern[];
24 extern const char *parent_pattern;
25 extern const char *default_sort_order;
26 extern regex_t ignore_callees_regex;
27 extern int have_ignore_callees;
28 extern enum sort_mode sort__mode;
29 extern struct sort_entry sort_comm;
30 extern struct sort_entry sort_dso;
31 extern struct sort_entry sort_sym;
32 extern struct sort_entry sort_parent;
33 extern struct sort_entry sort_dso_from;
34 extern struct sort_entry sort_dso_to;
35 extern struct sort_entry sort_sym_from;
36 extern struct sort_entry sort_sym_to;
37 extern struct sort_entry sort_srcline;
38 extern struct sort_entry sort_type;
39 extern const char default_mem_sort_order[];
40 extern bool chk_double_cl;
62 struct hist_entry_diff {
66 double period_ratio_delta;
71 /* HISTC_WEIGHTED_DIFF */
74 /* PERF_HPP_DIFF__CYCLES */
78 unsigned long svals[NUM_SPARKS];
81 struct hist_entry_ops {
82 void *(*new)(size_t size);
83 void (*free)(void *ptr);
87 * struct hist_entry - histogram entry
89 * @row_offset - offset from the first callchain expanded to appear on screen
90 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
93 struct rb_node rb_node_in;
94 struct rb_node rb_node;
96 struct list_head node;
97 struct list_head head;
100 struct he_stat *stat_acc;
101 struct map_symbol ms;
102 struct thread *thread;
104 struct namespace_id cgroup_id;
117 struct simd_flags simd_flags;
119 /* We are added by hists__add_dummy_entry. */
129 * Since perf diff only supports the stdio output, TUI
130 * fields are only accessed from perf report (or perf
131 * top). So make it a union to reduce memory usage.
133 struct hist_entry_diff diff;
134 struct /* for TUI */ {
137 bool init_have_children;
145 struct symbol *parent;
146 struct branch_info *branch_info;
149 struct mem_info *mem_info;
150 struct block_info *block_info;
151 struct kvm_info *kvm_info;
155 struct res_sample *res_samples;
157 struct perf_hpp_list *hpp_list;
158 struct hist_entry *parent_he;
159 struct hist_entry_ops *ops;
160 struct annotated_data_type *mem_type;
162 /* this is for hierarchical entry structure */
164 struct rb_root_cached hroot_in;
165 struct rb_root_cached hroot_out;
166 }; /* non-leaf entries */
167 struct rb_root sorted_chain; /* leaf entry has callchains */
169 struct callchain_root callchain[0]; /* must be last member */
172 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he)
174 return he->callchain_size != 0;
177 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width);
179 static inline bool hist_entry__has_pairs(struct hist_entry *he)
181 return !list_empty(&he->pairs.node);
184 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
186 if (hist_entry__has_pairs(he))
187 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
191 static inline void hist_entry__add_pair(struct hist_entry *pair,
192 struct hist_entry *he)
194 list_add_tail(&pair->pairs.node, &he->pairs.head);
197 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
199 u64 period = he->stat.period;
200 u64 total_period = hists__total_period(he->hists);
202 if (unlikely(total_period == 0))
205 if (symbol_conf.cumulate_callchain)
206 period = he->stat_acc->period;
208 return period * 100.0 / total_period;
217 SORT_MODE__TRACEPOINT,
221 /* common sort keys */
244 SORT_LOCAL_PIPELINE_STAGE_CYC,
245 SORT_GLOBAL_PIPELINE_STAGE_CYC,
247 SORT_LOCAL_RETIRE_LAT,
248 SORT_GLOBAL_RETIRE_LAT,
250 SORT_ANNOTATE_DATA_TYPE,
251 SORT_ANNOTATE_DATA_TYPE_OFFSET,
254 /* branch stack specific sort keys */
256 SORT_DSO_FROM = __SORT_BRANCH_STACK,
270 /* memory mode specific sort keys */
272 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
279 SORT_MEM_IADDR_SYMBOL,
281 SORT_MEM_DATA_PAGE_SIZE,
286 * configurable sorting bits
290 const char *se_header;
292 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
293 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
294 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
295 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
297 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
298 void (*se_init)(struct hist_entry *he);
303 struct hists block_hists;
304 struct perf_hpp_list block_list;
305 struct perf_hpp_fmt block_fmt;
308 struct hist_entry he;
311 extern struct sort_entry sort_thread;
315 int setup_sorting(struct evlist *evlist);
316 int setup_output_field(void);
317 void reset_output_field(void);
318 void sort__setup_elide(FILE *fp);
319 void perf_hpp__set_elide(int idx, bool elide);
321 char *sort_help(const char *prefix);
323 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
325 bool is_strict_order(const char *order);
327 int hpp_dimension__add_output(unsigned col);
328 void reset_dimensions(void);
329 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
330 struct evlist *evlist,
332 int output_field_add(struct perf_hpp_list *list, char *tok);
334 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
336 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
338 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
340 _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r);
341 char *hist_entry__srcline(struct hist_entry *he);
342 #endif /* __PERF_SORT_H */