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[];
65 struct hist_entry_diff {
69 double period_ratio_delta;
74 /* HISTC_WEIGHTED_DIFF */
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;
110 /* We are added by hists__add_dummy_entry. */
120 * Since perf diff only supports the stdio output, TUI
121 * fields are only accessed from perf report (or perf
122 * top). So make it a union to reduce memory usage.
124 struct hist_entry_diff diff;
125 struct /* for TUI */ {
128 bool init_have_children;
136 struct symbol *parent;
137 struct branch_info *branch_info;
140 struct mem_info *mem_info;
144 struct perf_hpp_list *hpp_list;
145 struct hist_entry *parent_he;
146 struct hist_entry_ops *ops;
148 /* this is for hierarchical entry structure */
150 struct rb_root_cached hroot_in;
151 struct rb_root_cached hroot_out;
152 }; /* non-leaf entries */
153 struct rb_root sorted_chain; /* leaf entry has callchains */
155 struct callchain_root callchain[0]; /* must be last member */
158 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he)
160 return he->callchain_size != 0;
163 static inline bool hist_entry__has_pairs(struct hist_entry *he)
165 return !list_empty(&he->pairs.node);
168 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
170 if (hist_entry__has_pairs(he))
171 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
175 static inline void hist_entry__add_pair(struct hist_entry *pair,
176 struct hist_entry *he)
178 list_add_tail(&pair->pairs.node, &he->pairs.head);
181 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
183 u64 period = he->stat.period;
184 u64 total_period = hists__total_period(he->hists);
186 if (unlikely(total_period == 0))
189 if (symbol_conf.cumulate_callchain)
190 period = he->stat_acc->period;
192 return period * 100.0 / total_period;
195 static inline u64 cl_address(u64 address)
197 /* return the cacheline of the address */
198 return (address & ~(cacheline_size() - 1));
201 static inline u64 cl_offset(u64 address)
203 /* return the cacheline of the address */
204 return (address & (cacheline_size() - 1));
213 SORT_MODE__TRACEPOINT,
217 /* common sort keys */
237 /* branch stack specific sort keys */
239 SORT_DSO_FROM = __SORT_BRANCH_STACK,
251 /* memory mode specific sort keys */
253 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
260 SORT_MEM_IADDR_SYMBOL,
265 * configurable sorting bits
269 const char *se_header;
271 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
272 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
273 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
274 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
276 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
280 extern struct sort_entry sort_thread;
281 extern struct list_head hist_entry__sort_list;
285 int setup_sorting(struct perf_evlist *evlist);
286 int setup_output_field(void);
287 void reset_output_field(void);
288 void sort__setup_elide(FILE *fp);
289 void perf_hpp__set_elide(int idx, bool elide);
291 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
293 bool is_strict_order(const char *order);
295 int hpp_dimension__add_output(unsigned col);
296 void reset_dimensions(void);
297 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
298 struct perf_evlist *evlist,
300 int output_field_add(struct perf_hpp_list *list, char *tok);
302 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
304 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
306 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
307 char *hist_entry__srcline(struct hist_entry *he);
308 #endif /* __PERF_SORT_H */