1 /* SPDX-License-Identifier: GPL-2.0 */
4 #include "../builtin.h"
9 #include <linux/list.h>
11 #include <linux/rbtree.h>
12 #include "map_symbol.h"
13 #include "symbol_conf.h"
15 #include "callchain.h"
22 #include <subcmd/parse-options.h>
23 #include "parse-events.h"
29 extern regex_t parent_regex;
30 extern const char *sort_order;
31 extern const char *field_order;
32 extern const char default_parent_pattern[];
33 extern const char *parent_pattern;
34 extern const char *default_sort_order;
35 extern regex_t ignore_callees_regex;
36 extern int have_ignore_callees;
37 extern enum sort_mode sort__mode;
38 extern struct sort_entry sort_comm;
39 extern struct sort_entry sort_dso;
40 extern struct sort_entry sort_sym;
41 extern struct sort_entry sort_parent;
42 extern struct sort_entry sort_dso_from;
43 extern struct sort_entry sort_dso_to;
44 extern struct sort_entry sort_sym_from;
45 extern struct sort_entry sort_sym_to;
46 extern struct sort_entry sort_srcline;
47 extern enum sort_type sort__first_dimension;
48 extern const char default_mem_sort_order[];
71 struct hist_entry_diff {
75 double period_ratio_delta;
80 /* HISTC_WEIGHTED_DIFF */
83 /* PERF_HPP_DIFF__CYCLES */
88 struct hist_entry_ops {
89 void *(*new)(size_t size);
90 void (*free)(void *ptr);
94 * struct hist_entry - histogram entry
96 * @row_offset - offset from the first callchain expanded to appear on screen
97 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
100 struct rb_node rb_node_in;
101 struct rb_node rb_node;
103 struct list_head node;
104 struct list_head head;
107 struct he_stat *stat_acc;
108 struct map_symbol ms;
109 struct thread *thread;
111 struct namespace_id cgroup_id;
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;
154 struct res_sample *res_samples;
156 struct perf_hpp_list *hpp_list;
157 struct hist_entry *parent_he;
158 struct hist_entry_ops *ops;
160 /* this is for hierarchical entry structure */
162 struct rb_root_cached hroot_in;
163 struct rb_root_cached hroot_out;
164 }; /* non-leaf entries */
165 struct rb_root sorted_chain; /* leaf entry has callchains */
167 struct callchain_root callchain[0]; /* must be last member */
170 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he)
172 return he->callchain_size != 0;
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;
207 static inline u64 cl_address(u64 address)
209 /* return the cacheline of the address */
210 return (address & ~(cacheline_size() - 1));
213 static inline u64 cl_offset(u64 address)
215 /* return the cacheline of the address */
216 return (address & (cacheline_size() - 1));
225 SORT_MODE__TRACEPOINT,
229 /* common sort keys */
249 /* branch stack specific sort keys */
251 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,
277 * configurable sorting bits
281 const char *se_header;
283 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
284 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
285 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
286 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
288 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
293 struct hists block_hists;
294 struct perf_hpp_list block_list;
295 struct perf_hpp_fmt block_fmt;
298 struct hist_entry he;
301 extern struct sort_entry sort_thread;
302 extern struct list_head hist_entry__sort_list;
306 int setup_sorting(struct evlist *evlist);
307 int setup_output_field(void);
308 void reset_output_field(void);
309 void sort__setup_elide(FILE *fp);
310 void perf_hpp__set_elide(int idx, bool elide);
312 const char *sort_help(const char *prefix);
314 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
316 bool is_strict_order(const char *order);
318 int hpp_dimension__add_output(unsigned col);
319 void reset_dimensions(void);
320 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
321 struct evlist *evlist,
323 int output_field_add(struct perf_hpp_list *list, char *tok);
325 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
327 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
329 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
330 char *hist_entry__srcline(struct hist_entry *he);
331 #endif /* __PERF_SORT_H */