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 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 enum sort_type sort__first_dimension;
58 struct hist_entry_diff {
62 double period_ratio_delta;
67 /* HISTC_WEIGHTED_DIFF */
72 * struct hist_entry - histogram entry
74 * @row_offset - offset from the first callchain expanded to appear on screen
75 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
78 struct rb_node rb_node_in;
79 struct rb_node rb_node;
81 struct list_head node;
82 struct list_head head;
85 struct he_stat *stat_acc;
87 struct thread *thread;
93 struct hist_entry_diff diff;
95 /* We are added by hists__add_dummy_entry. */
98 /* XXX These two should move to some tree widget lib */
102 bool init_have_children;
107 struct symbol *parent;
108 unsigned long position;
109 struct rb_root sorted_chain;
110 struct branch_info *branch_info;
112 struct mem_info *mem_info;
113 struct callchain_root callchain[0]; /* must be last member */
116 static inline bool hist_entry__has_pairs(struct hist_entry *he)
118 return !list_empty(&he->pairs.node);
121 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
123 if (hist_entry__has_pairs(he))
124 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
128 static inline void hist_entry__add_pair(struct hist_entry *pair,
129 struct hist_entry *he)
131 list_add_tail(&pair->pairs.node, &he->pairs.head);
134 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
136 u64 period = he->stat.period;
137 u64 total_period = hists__total_period(he->hists);
139 if (unlikely(total_period == 0))
142 if (symbol_conf.cumulate_callchain)
143 period = he->stat_acc->period;
145 return period * 100.0 / total_period;
158 /* common sort keys */
170 /* branch stack specific sort keys */
172 SORT_DSO_FROM = __SORT_BRANCH_STACK,
180 /* memory mode specific sort keys */
182 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
191 * configurable sorting bits
195 struct list_head list;
197 const char *se_header;
199 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
200 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
201 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
202 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
207 extern struct sort_entry sort_thread;
208 extern struct list_head hist_entry__sort_list;
210 int setup_sorting(void);
211 int setup_output_field(void);
212 void reset_output_field(void);
213 extern int sort_dimension__add(const char *);
214 void sort__setup_elide(FILE *fp);
215 void perf_hpp__set_elide(int idx, bool elide);
217 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
219 #endif /* __PERF_SORT_H */