3 #include "../builtin.h"
8 #include <linux/list.h>
10 #include <linux/rbtree.h>
13 #include "callchain.h"
21 #include "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_parent;
36 extern int sort__has_sym;
37 extern int sort__has_socket;
38 extern enum sort_mode sort__mode;
39 extern struct sort_entry sort_comm;
40 extern struct sort_entry sort_dso;
41 extern struct sort_entry sort_sym;
42 extern struct sort_entry sort_parent;
43 extern struct sort_entry sort_dso_from;
44 extern struct sort_entry sort_dso_to;
45 extern struct sort_entry sort_sym_from;
46 extern struct sort_entry sort_sym_to;
47 extern enum sort_type sort__first_dimension;
48 extern const char default_mem_sort_order[];
60 struct hist_entry_diff {
64 double period_ratio_delta;
69 /* HISTC_WEIGHTED_DIFF */
75 * struct hist_entry - histogram entry
77 * @row_offset - offset from the first callchain expanded to appear on screen
78 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
81 struct rb_node rb_node_in;
82 struct rb_node rb_node;
84 struct list_head node;
85 struct list_head head;
88 struct he_stat *stat_acc;
90 struct thread *thread;
98 /* We are added by hists__add_dummy_entry. */
105 * Since perf diff only supports the stdio output, TUI
106 * fields are only accessed from perf report (or perf
107 * top). So make it an union to reduce memory usage.
109 struct hist_entry_diff diff;
110 struct /* for TUI */ {
113 bool init_have_children;
120 struct symbol *parent;
121 struct rb_root sorted_chain;
122 struct branch_info *branch_info;
124 struct mem_info *mem_info;
125 struct callchain_root callchain[0]; /* must be last member */
128 static inline bool hist_entry__has_pairs(struct hist_entry *he)
130 return !list_empty(&he->pairs.node);
133 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
135 if (hist_entry__has_pairs(he))
136 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
140 static inline void hist_entry__add_pair(struct hist_entry *pair,
141 struct hist_entry *he)
143 list_add_tail(&pair->pairs.node, &he->pairs.head);
146 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
148 u64 period = he->stat.period;
149 u64 total_period = hists__total_period(he->hists);
151 if (unlikely(total_period == 0))
154 if (symbol_conf.cumulate_callchain)
155 period = he->stat_acc->period;
157 return period * 100.0 / total_period;
170 /* common sort keys */
184 /* branch stack specific sort keys */
186 SORT_DSO_FROM = __SORT_BRANCH_STACK,
195 /* memory mode specific sort keys */
197 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
204 SORT_MEM_IADDR_SYMBOL,
208 * configurable sorting bits
212 struct list_head list;
214 const char *se_header;
216 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
217 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
218 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
219 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
224 extern struct sort_entry sort_thread;
225 extern struct list_head hist_entry__sort_list;
227 int setup_sorting(void);
228 int setup_output_field(void);
229 void reset_output_field(void);
230 extern int sort_dimension__add(const char *);
231 void sort__setup_elide(FILE *fp);
232 void perf_hpp__set_elide(int idx, bool elide);
234 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
236 bool is_strict_order(const char *order);
238 int hpp_dimension__add_output(unsigned col);
239 #endif /* __PERF_SORT_H */