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 default_parent_pattern
[];
29 extern const char *parent_pattern
;
30 extern const char default_sort_order
[];
31 extern regex_t ignore_callees_regex
;
32 extern int have_ignore_callees
;
33 extern int sort__need_collapse
;
34 extern int sort__has_parent
;
35 extern int sort__has_sym
;
36 extern enum sort_mode sort__mode
;
37 extern struct sort_entry sort_comm
;
38 extern struct sort_entry sort_dso
;
39 extern struct sort_entry sort_sym
;
40 extern struct sort_entry sort_parent
;
41 extern struct sort_entry sort_dso_from
;
42 extern struct sort_entry sort_dso_to
;
43 extern struct sort_entry sort_sym_from
;
44 extern struct sort_entry sort_sym_to
;
45 extern enum sort_type sort__first_dimension
;
57 struct hist_entry_diff
{
61 double period_ratio_delta
;
66 /* HISTC_WEIGHTED_DIFF */
71 * struct hist_entry - histogram entry
73 * @row_offset - offset from the first callchain expanded to appear on screen
74 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
77 struct rb_node rb_node_in
;
78 struct rb_node rb_node
;
80 struct list_head node
;
81 struct list_head head
;
85 struct thread
*thread
;
91 struct hist_entry_diff diff
;
93 /* We are added by hists__add_dummy_entry. */
96 /* XXX These two should move to some tree widget lib */
100 bool init_have_children
;
105 struct symbol
*parent
;
106 unsigned long position
;
107 struct rb_root sorted_chain
;
108 struct branch_info
*branch_info
;
110 struct mem_info
*mem_info
;
111 struct callchain_root callchain
[0]; /* must be last member */
114 static inline bool hist_entry__has_pairs(struct hist_entry
*he
)
116 return !list_empty(&he
->pairs
.node
);
119 static inline struct hist_entry
*hist_entry__next_pair(struct hist_entry
*he
)
121 if (hist_entry__has_pairs(he
))
122 return list_entry(he
->pairs
.node
.next
, struct hist_entry
, pairs
.node
);
126 static inline void hist_entry__add_pair(struct hist_entry
*pair
,
127 struct hist_entry
*he
)
129 list_add_tail(&pair
->pairs
.node
, &he
->pairs
.head
);
139 /* common sort keys */
151 /* branch stack specific sort keys */
153 SORT_DSO_FROM
= __SORT_BRANCH_STACK
,
161 /* memory mode specific sort keys */
163 SORT_MEM_DADDR_SYMBOL
= __SORT_MEMORY_MODE
,
172 * configurable sorting bits
176 struct list_head list
;
178 const char *se_header
;
180 int64_t (*se_cmp
)(struct hist_entry
*, struct hist_entry
*);
181 int64_t (*se_collapse
)(struct hist_entry
*, struct hist_entry
*);
182 int (*se_snprintf
)(struct hist_entry
*he
, char *bf
, size_t size
,
188 extern struct sort_entry sort_thread
;
189 extern struct list_head hist_entry__sort_list
;
191 int setup_sorting(void);
192 extern int sort_dimension__add(const char *);
193 void sort__setup_elide(FILE *fp
);
195 int report_parse_ignore_callees_opt(const struct option
*opt
, const char *arg
, int unset
);
197 #endif /* __PERF_SORT_H */