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[];
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;
115 /* We are added by hists__add_dummy_entry. */
125 * Since perf diff only supports the stdio output, TUI
126 * fields are only accessed from perf report (or perf
127 * top). So make it a union to reduce memory usage.
129 struct hist_entry_diff diff;
130 struct /* for TUI */ {
133 bool init_have_children;
141 struct symbol *parent;
142 struct branch_info *branch_info;
145 struct mem_info *mem_info;
146 struct block_info *block_info;
150 struct res_sample *res_samples;
152 struct perf_hpp_list *hpp_list;
153 struct hist_entry *parent_he;
154 struct hist_entry_ops *ops;
156 /* this is for hierarchical entry structure */
158 struct rb_root_cached hroot_in;
159 struct rb_root_cached hroot_out;
160 }; /* non-leaf entries */
161 struct rb_root sorted_chain; /* leaf entry has callchains */
163 struct callchain_root callchain[0]; /* must be last member */
166 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he)
168 return he->callchain_size != 0;
171 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width);
173 static inline bool hist_entry__has_pairs(struct hist_entry *he)
175 return !list_empty(&he->pairs.node);
178 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
180 if (hist_entry__has_pairs(he))
181 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
185 static inline void hist_entry__add_pair(struct hist_entry *pair,
186 struct hist_entry *he)
188 list_add_tail(&pair->pairs.node, &he->pairs.head);
191 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
193 u64 period = he->stat.period;
194 u64 total_period = hists__total_period(he->hists);
196 if (unlikely(total_period == 0))
199 if (symbol_conf.cumulate_callchain)
200 period = he->stat_acc->period;
202 return period * 100.0 / total_period;
211 SORT_MODE__TRACEPOINT,
215 /* common sort keys */
238 SORT_LOCAL_PIPELINE_STAGE_CYC,
239 SORT_GLOBAL_PIPELINE_STAGE_CYC,
241 /* branch stack specific sort keys */
243 SORT_DSO_FROM = __SORT_BRANCH_STACK,
257 /* memory mode specific sort keys */
259 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
266 SORT_MEM_IADDR_SYMBOL,
268 SORT_MEM_DATA_PAGE_SIZE,
273 * configurable sorting bits
277 const char *se_header;
279 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
280 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
281 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
282 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
284 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
289 struct hists block_hists;
290 struct perf_hpp_list block_list;
291 struct perf_hpp_fmt block_fmt;
294 struct hist_entry he;
297 extern struct sort_entry sort_thread;
298 extern struct list_head hist_entry__sort_list;
302 int setup_sorting(struct evlist *evlist);
303 int setup_output_field(void);
304 void reset_output_field(void);
305 void sort__setup_elide(FILE *fp);
306 void perf_hpp__set_elide(int idx, bool elide);
308 char *sort_help(const char *prefix);
310 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
312 bool is_strict_order(const char *order);
314 int hpp_dimension__add_output(unsigned col);
315 void reset_dimensions(void);
316 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
317 struct evlist *evlist,
319 int output_field_add(struct perf_hpp_list *list, char *tok);
321 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
323 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
325 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
327 _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r);
328 char *hist_entry__srcline(struct hist_entry *he);
329 #endif /* __PERF_SORT_H */