3 #include "../builtin.h"
8 #include <linux/list.h>
10 #include <linux/rbtree.h>
13 #include "callchain.h"
21 #include <subcmd/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 enum sort_mode sort__mode
;
35 extern struct sort_entry sort_comm
;
36 extern struct sort_entry sort_dso
;
37 extern struct sort_entry sort_sym
;
38 extern struct sort_entry sort_parent
;
39 extern struct sort_entry sort_dso_from
;
40 extern struct sort_entry sort_dso_to
;
41 extern struct sort_entry sort_sym_from
;
42 extern struct sort_entry sort_sym_to
;
43 extern struct sort_entry sort_srcline
;
44 extern enum sort_type sort__first_dimension
;
45 extern const char default_mem_sort_order
[];
62 struct hist_entry_diff
{
66 double period_ratio_delta
;
71 /* HISTC_WEIGHTED_DIFF */
76 struct hist_entry_ops
{
77 void *(*new)(size_t size
);
78 void (*free
)(void *ptr
);
82 * struct hist_entry - histogram entry
84 * @row_offset - offset from the first callchain expanded to appear on screen
85 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
88 struct rb_node rb_node_in
;
89 struct rb_node rb_node
;
91 struct list_head node
;
92 struct list_head head
;
95 struct he_stat
*stat_acc
;
97 struct thread
*thread
;
99 struct namespace_id cgroup_id
;
107 /* We are added by hists__add_dummy_entry. */
115 * Since perf diff only supports the stdio output, TUI
116 * fields are only accessed from perf report (or perf
117 * top). So make it a union to reduce memory usage.
119 struct hist_entry_diff diff
;
120 struct /* for TUI */ {
123 bool init_have_children
;
131 struct inline_node
*inline_node
;
132 struct symbol
*parent
;
133 struct branch_info
*branch_info
;
135 struct mem_info
*mem_info
;
139 struct perf_hpp_list
*hpp_list
;
140 struct hist_entry
*parent_he
;
141 struct hist_entry_ops
*ops
;
143 /* this is for hierarchical entry structure */
145 struct rb_root hroot_in
;
146 struct rb_root hroot_out
;
147 }; /* non-leaf entries */
148 struct rb_root sorted_chain
; /* leaf entry has callchains */
150 struct callchain_root callchain
[0]; /* must be last member */
153 static inline bool hist_entry__has_pairs(struct hist_entry
*he
)
155 return !list_empty(&he
->pairs
.node
);
158 static inline struct hist_entry
*hist_entry__next_pair(struct hist_entry
*he
)
160 if (hist_entry__has_pairs(he
))
161 return list_entry(he
->pairs
.node
.next
, struct hist_entry
, pairs
.node
);
165 static inline void hist_entry__add_pair(struct hist_entry
*pair
,
166 struct hist_entry
*he
)
168 list_add_tail(&pair
->pairs
.node
, &he
->pairs
.head
);
171 static inline float hist_entry__get_percent_limit(struct hist_entry
*he
)
173 u64 period
= he
->stat
.period
;
174 u64 total_period
= hists__total_period(he
->hists
);
176 if (unlikely(total_period
== 0))
179 if (symbol_conf
.cumulate_callchain
)
180 period
= he
->stat_acc
->period
;
182 return period
* 100.0 / total_period
;
185 static inline u64
cl_address(u64 address
)
187 /* return the cacheline of the address */
188 return (address
& ~(cacheline_size
- 1));
191 static inline u64
cl_offset(u64 address
)
193 /* return the cacheline of the address */
194 return (address
& (cacheline_size
- 1));
203 SORT_MODE__TRACEPOINT
,
207 /* common sort keys */
224 /* branch stack specific sort keys */
226 SORT_DSO_FROM
= __SORT_BRANCH_STACK
,
237 /* memory mode specific sort keys */
239 SORT_MEM_DADDR_SYMBOL
= __SORT_MEMORY_MODE
,
246 SORT_MEM_IADDR_SYMBOL
,
250 * configurable sorting bits
254 const char *se_header
;
256 int64_t (*se_cmp
)(struct hist_entry
*, struct hist_entry
*);
257 int64_t (*se_collapse
)(struct hist_entry
*, struct hist_entry
*);
258 int64_t (*se_sort
)(struct hist_entry
*, struct hist_entry
*);
259 int (*se_snprintf
)(struct hist_entry
*he
, char *bf
, size_t size
,
261 int (*se_filter
)(struct hist_entry
*he
, int type
, const void *arg
);
265 extern struct sort_entry sort_thread
;
266 extern struct list_head hist_entry__sort_list
;
270 int setup_sorting(struct perf_evlist
*evlist
);
271 int setup_output_field(void);
272 void reset_output_field(void);
273 void sort__setup_elide(FILE *fp
);
274 void perf_hpp__set_elide(int idx
, bool elide
);
276 int report_parse_ignore_callees_opt(const struct option
*opt
, const char *arg
, int unset
);
278 bool is_strict_order(const char *order
);
280 int hpp_dimension__add_output(unsigned col
);
281 void reset_dimensions(void);
282 int sort_dimension__add(struct perf_hpp_list
*list
, const char *tok
,
283 struct perf_evlist
*evlist
,
285 int output_field_add(struct perf_hpp_list
*list
, char *tok
);
287 sort__iaddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
289 sort__daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
291 sort__dcacheline_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
292 char *hist_entry__get_srcline(struct hist_entry
*he
);
293 #endif /* __PERF_SORT_H */