3 #include "../builtin.h"
8 #include <linux/list.h>
10 #include <linux/rbtree.h>
13 #include "callchain.h"
21 #include <subcmd/parse-options.h>
22 #include "parse-events.h"
26 extern regex_t parent_regex;
27 extern const char *sort_order;
28 extern const char *field_order;
29 extern const char default_parent_pattern[];
30 extern const char *parent_pattern;
31 extern const char default_sort_order[];
32 extern regex_t ignore_callees_regex;
33 extern int have_ignore_callees;
34 extern int sort__need_collapse;
35 extern int sort__has_dso;
36 extern int sort__has_parent;
37 extern int sort__has_sym;
38 extern int sort__has_socket;
39 extern int sort__has_thread;
40 extern int sort__has_comm;
41 extern enum sort_mode sort__mode;
42 extern struct sort_entry sort_comm;
43 extern struct sort_entry sort_dso;
44 extern struct sort_entry sort_sym;
45 extern struct sort_entry sort_parent;
46 extern struct sort_entry sort_dso_from;
47 extern struct sort_entry sort_dso_to;
48 extern struct sort_entry sort_sym_from;
49 extern struct sort_entry sort_sym_to;
50 extern enum sort_type sort__first_dimension;
51 extern const char default_mem_sort_order[];
63 struct hist_entry_diff {
67 double period_ratio_delta;
72 /* HISTC_WEIGHTED_DIFF */
78 * struct hist_entry - histogram entry
80 * @row_offset - offset from the first callchain expanded to appear on screen
81 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
84 struct rb_node rb_node_in;
85 struct rb_node rb_node;
87 struct list_head node;
88 struct list_head head;
91 struct he_stat *stat_acc;
93 struct thread *thread;
102 /* We are added by hists__add_dummy_entry. */
110 * Since perf diff only supports the stdio output, TUI
111 * fields are only accessed from perf report (or perf
112 * top). So make it an union to reduce memory usage.
114 struct hist_entry_diff diff;
115 struct /* for TUI */ {
118 bool init_have_children;
126 struct symbol *parent;
127 struct branch_info *branch_info;
129 struct mem_info *mem_info;
133 struct perf_hpp_list *hpp_list;
134 struct hist_entry *parent_he;
136 /* this is for hierarchical entry structure */
138 struct rb_root hroot_in;
139 struct rb_root hroot_out;
140 }; /* non-leaf entries */
141 struct rb_root sorted_chain; /* leaf entry has callchains */
143 struct callchain_root callchain[0]; /* must be last member */
146 static inline bool hist_entry__has_pairs(struct hist_entry *he)
148 return !list_empty(&he->pairs.node);
151 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
153 if (hist_entry__has_pairs(he))
154 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
158 static inline void hist_entry__add_pair(struct hist_entry *pair,
159 struct hist_entry *he)
161 list_add_tail(&pair->pairs.node, &he->pairs.head);
164 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
166 u64 period = he->stat.period;
167 u64 total_period = hists__total_period(he->hists);
169 if (unlikely(total_period == 0))
172 if (symbol_conf.cumulate_callchain)
173 period = he->stat_acc->period;
175 return period * 100.0 / total_period;
178 static inline u64 cl_address(u64 address)
180 /* return the cacheline of the address */
181 return (address & ~(cacheline_size - 1));
184 static inline u64 cl_offset(u64 address)
186 /* return the cacheline of the address */
187 return (address & (cacheline_size - 1));
196 SORT_MODE__TRACEPOINT,
200 /* common sort keys */
215 /* branch stack specific sort keys */
217 SORT_DSO_FROM = __SORT_BRANCH_STACK,
226 /* memory mode specific sort keys */
228 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
235 SORT_MEM_IADDR_SYMBOL,
239 * configurable sorting bits
243 const char *se_header;
245 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
246 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
247 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
248 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
250 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
254 extern struct sort_entry sort_thread;
255 extern struct list_head hist_entry__sort_list;
259 int setup_sorting(struct perf_evlist *evlist);
260 int setup_output_field(void);
261 void reset_output_field(void);
262 void sort__setup_elide(FILE *fp);
263 void perf_hpp__set_elide(int idx, bool elide);
265 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
267 bool is_strict_order(const char *order);
269 int hpp_dimension__add_output(unsigned col);
270 #endif /* __PERF_SORT_H */