3 #include "../builtin.h"
8 #include <linux/list.h>
10 #include <linux/rbtree.h>
13 #include "callchain.h"
20 #include <subcmd/parse-options.h>
21 #include "parse-events.h"
27 extern regex_t parent_regex;
28 extern const char *sort_order;
29 extern const char *field_order;
30 extern const char default_parent_pattern[];
31 extern const char *parent_pattern;
32 extern const char *default_sort_order;
33 extern regex_t ignore_callees_regex;
34 extern int have_ignore_callees;
35 extern enum sort_mode sort__mode;
36 extern struct sort_entry sort_comm;
37 extern struct sort_entry sort_dso;
38 extern struct sort_entry sort_sym;
39 extern struct sort_entry sort_parent;
40 extern struct sort_entry sort_dso_from;
41 extern struct sort_entry sort_dso_to;
42 extern struct sort_entry sort_sym_from;
43 extern struct sort_entry sort_sym_to;
44 extern struct sort_entry sort_srcline;
45 extern enum sort_type sort__first_dimension;
46 extern const char default_mem_sort_order[];
63 struct hist_entry_diff {
67 double period_ratio_delta;
72 /* HISTC_WEIGHTED_DIFF */
77 struct hist_entry_ops {
78 void *(*new)(size_t size);
79 void (*free)(void *ptr);
83 * struct hist_entry - histogram entry
85 * @row_offset - offset from the first callchain expanded to appear on screen
86 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
89 struct rb_node rb_node_in;
90 struct rb_node rb_node;
92 struct list_head node;
93 struct list_head head;
96 struct he_stat *stat_acc;
98 struct thread *thread;
100 struct namespace_id cgroup_id;
108 /* We are added by hists__add_dummy_entry. */
116 * Since perf diff only supports the stdio output, TUI
117 * fields are only accessed from perf report (or perf
118 * top). So make it a union to reduce memory usage.
120 struct hist_entry_diff diff;
121 struct /* for TUI */ {
124 bool init_have_children;
132 struct inline_node *inline_node;
133 struct symbol *parent;
134 struct branch_info *branch_info;
136 struct mem_info *mem_info;
140 struct perf_hpp_list *hpp_list;
141 struct hist_entry *parent_he;
142 struct hist_entry_ops *ops;
144 /* this is for hierarchical entry structure */
146 struct rb_root hroot_in;
147 struct rb_root hroot_out;
148 }; /* non-leaf entries */
149 struct rb_root sorted_chain; /* leaf entry has callchains */
151 struct callchain_root callchain[0]; /* must be last member */
154 static inline bool hist_entry__has_pairs(struct hist_entry *he)
156 return !list_empty(&he->pairs.node);
159 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
161 if (hist_entry__has_pairs(he))
162 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
166 static inline void hist_entry__add_pair(struct hist_entry *pair,
167 struct hist_entry *he)
169 list_add_tail(&pair->pairs.node, &he->pairs.head);
172 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
174 u64 period = he->stat.period;
175 u64 total_period = hists__total_period(he->hists);
177 if (unlikely(total_period == 0))
180 if (symbol_conf.cumulate_callchain)
181 period = he->stat_acc->period;
183 return period * 100.0 / total_period;
186 static inline u64 cl_address(u64 address)
188 /* return the cacheline of the address */
189 return (address & ~(cacheline_size - 1));
192 static inline u64 cl_offset(u64 address)
194 /* return the cacheline of the address */
195 return (address & (cacheline_size - 1));
204 SORT_MODE__TRACEPOINT,
208 /* common sort keys */
225 /* branch stack specific sort keys */
227 SORT_DSO_FROM = __SORT_BRANCH_STACK,
238 /* memory mode specific sort keys */
240 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
247 SORT_MEM_IADDR_SYMBOL,
252 * configurable sorting bits
256 const char *se_header;
258 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
259 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
260 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
261 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
263 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
267 extern struct sort_entry sort_thread;
268 extern struct list_head hist_entry__sort_list;
272 int setup_sorting(struct perf_evlist *evlist);
273 int setup_output_field(void);
274 void reset_output_field(void);
275 void sort__setup_elide(FILE *fp);
276 void perf_hpp__set_elide(int idx, bool elide);
278 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
280 bool is_strict_order(const char *order);
282 int hpp_dimension__add_output(unsigned col);
283 void reset_dimensions(void);
284 int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
285 struct perf_evlist *evlist,
287 int output_field_add(struct perf_hpp_list *list, char *tok);
289 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
291 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
293 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
294 char *hist_entry__get_srcline(struct hist_entry *he);
295 #endif /* __PERF_SORT_H */