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;
47 extern const char default_mem_sort_order[];
59 struct hist_entry_diff {
63 double period_ratio_delta;
68 /* HISTC_WEIGHTED_DIFF */
74 * struct hist_entry - histogram entry
76 * @row_offset - offset from the first callchain expanded to appear on screen
77 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
80 struct rb_node rb_node_in;
81 struct rb_node rb_node;
83 struct list_head node;
84 struct list_head head;
87 struct he_stat *stat_acc;
89 struct thread *thread;
96 /* We are added by hists__add_dummy_entry. */
103 * Since perf diff only supports the stdio output, TUI
104 * fields are only accessed from perf report (or perf
105 * top). So make it an union to reduce memory usage.
107 struct hist_entry_diff diff;
108 struct /* for TUI */ {
111 bool init_have_children;
117 struct symbol *parent;
118 struct rb_root sorted_chain;
119 struct branch_info *branch_info;
121 struct mem_info *mem_info;
122 struct callchain_root callchain[0]; /* must be last member */
125 static inline bool hist_entry__has_pairs(struct hist_entry *he)
127 return !list_empty(&he->pairs.node);
130 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
132 if (hist_entry__has_pairs(he))
133 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
137 static inline void hist_entry__add_pair(struct hist_entry *pair,
138 struct hist_entry *he)
140 list_add_tail(&pair->pairs.node, &he->pairs.head);
143 static inline float hist_entry__get_percent_limit(struct hist_entry *he)
145 u64 period = he->stat.period;
146 u64 total_period = hists__total_period(he->hists);
148 if (unlikely(total_period == 0))
151 if (symbol_conf.cumulate_callchain)
152 period = he->stat_acc->period;
154 return period * 100.0 / total_period;
167 /* common sort keys */
179 /* branch stack specific sort keys */
181 SORT_DSO_FROM = __SORT_BRANCH_STACK,
189 /* memory mode specific sort keys */
191 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
201 * configurable sorting bits
205 struct list_head list;
207 const char *se_header;
209 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
210 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
211 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
212 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
217 extern struct sort_entry sort_thread;
218 extern struct list_head hist_entry__sort_list;
220 int setup_sorting(void);
221 int setup_output_field(void);
222 void reset_output_field(void);
223 extern int sort_dimension__add(const char *);
224 void sort__setup_elide(FILE *fp);
225 void perf_hpp__set_elide(int idx, bool elide);
227 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
229 bool is_strict_order(const char *order);
230 #endif /* __PERF_SORT_H */