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"
27 extern regex_t parent_regex;
28 extern const char *sort_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;
86 struct thread *thread;
90 struct hist_entry_diff diff;
92 /* We are added by hists__add_dummy_entry. */
95 /* XXX These two should move to some tree widget lib */
99 bool init_have_children;
104 struct symbol *parent;
105 unsigned long position;
106 struct rb_root sorted_chain;
107 struct branch_info *branch_info;
109 struct mem_info *mem_info;
110 struct callchain_root callchain[0]; /* must be last member */
113 static inline bool hist_entry__has_pairs(struct hist_entry *he)
115 return !list_empty(&he->pairs.node);
118 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
120 if (hist_entry__has_pairs(he))
121 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
125 static inline void hist_entry__add_pair(struct hist_entry *pair,
126 struct hist_entry *he)
128 list_add_tail(&pair->pairs.node, &he->pairs.head);
138 /* common sort keys */
149 /* branch stack specific sort keys */
151 SORT_DSO_FROM = __SORT_BRANCH_STACK,
157 /* memory mode specific sort keys */
159 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
168 * configurable sorting bits
172 struct list_head list;
174 const char *se_header;
176 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
177 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
178 int (*se_snprintf)(struct hist_entry *self, char *bf, size_t size,
184 extern struct sort_entry sort_thread;
185 extern struct list_head hist_entry__sort_list;
187 int setup_sorting(void);
188 extern int sort_dimension__add(const char *);
189 void sort__setup_elide(FILE *fp);
191 int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
193 #endif /* __PERF_SORT_H */