1 /* SPDX-License-Identifier: GPL-2.0 */
4 #include "../builtin.h"
9 #include <linux/list.h>
11 #include <linux/rbtree.h>
14 #include "callchain.h"
21 #include <subcmd/parse-options.h>
22 #include "parse-events.h"
28 extern regex_t parent_regex
;
29 extern const char *sort_order
;
30 extern const char *field_order
;
31 extern const char default_parent_pattern
[];
32 extern const char *parent_pattern
;
33 extern const char *default_sort_order
;
34 extern regex_t ignore_callees_regex
;
35 extern int have_ignore_callees
;
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 struct sort_entry sort_srcline
;
46 extern enum sort_type sort__first_dimension
;
47 extern const char default_mem_sort_order
[];
64 struct hist_entry_diff
{
68 double period_ratio_delta
;
73 /* HISTC_WEIGHTED_DIFF */
78 struct hist_entry_ops
{
79 void *(*new)(size_t size
);
80 void (*free
)(void *ptr
);
84 * struct hist_entry - histogram entry
86 * @row_offset - offset from the first callchain expanded to appear on screen
87 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
90 struct rb_node rb_node_in
;
91 struct rb_node rb_node
;
93 struct list_head node
;
94 struct list_head head
;
97 struct he_stat
*stat_acc
;
99 struct thread
*thread
;
101 struct namespace_id cgroup_id
;
109 /* We are added by hists__add_dummy_entry. */
117 * Since perf diff only supports the stdio output, TUI
118 * fields are only accessed from perf report (or perf
119 * top). So make it a union to reduce memory usage.
121 struct hist_entry_diff diff
;
122 struct /* for TUI */ {
125 bool init_have_children
;
133 struct inline_node
*inline_node
;
134 struct symbol
*parent
;
135 struct branch_info
*branch_info
;
137 struct mem_info
*mem_info
;
141 struct perf_hpp_list
*hpp_list
;
142 struct hist_entry
*parent_he
;
143 struct hist_entry_ops
*ops
;
145 /* this is for hierarchical entry structure */
147 struct rb_root hroot_in
;
148 struct rb_root hroot_out
;
149 }; /* non-leaf entries */
150 struct rb_root sorted_chain
; /* leaf entry has callchains */
152 struct callchain_root callchain
[0]; /* must be last member */
155 static inline bool hist_entry__has_pairs(struct hist_entry
*he
)
157 return !list_empty(&he
->pairs
.node
);
160 static inline struct hist_entry
*hist_entry__next_pair(struct hist_entry
*he
)
162 if (hist_entry__has_pairs(he
))
163 return list_entry(he
->pairs
.node
.next
, struct hist_entry
, pairs
.node
);
167 static inline void hist_entry__add_pair(struct hist_entry
*pair
,
168 struct hist_entry
*he
)
170 list_add_tail(&pair
->pairs
.node
, &he
->pairs
.head
);
173 static inline float hist_entry__get_percent_limit(struct hist_entry
*he
)
175 u64 period
= he
->stat
.period
;
176 u64 total_period
= hists__total_period(he
->hists
);
178 if (unlikely(total_period
== 0))
181 if (symbol_conf
.cumulate_callchain
)
182 period
= he
->stat_acc
->period
;
184 return period
* 100.0 / total_period
;
187 static inline u64
cl_address(u64 address
)
189 /* return the cacheline of the address */
190 return (address
& ~(cacheline_size
- 1));
193 static inline u64
cl_offset(u64 address
)
195 /* return the cacheline of the address */
196 return (address
& (cacheline_size
- 1));
205 SORT_MODE__TRACEPOINT
,
209 /* common sort keys */
226 /* branch stack specific sort keys */
228 SORT_DSO_FROM
= __SORT_BRANCH_STACK
,
239 /* memory mode specific sort keys */
241 SORT_MEM_DADDR_SYMBOL
= __SORT_MEMORY_MODE
,
248 SORT_MEM_IADDR_SYMBOL
,
253 * configurable sorting bits
257 const char *se_header
;
259 int64_t (*se_cmp
)(struct hist_entry
*, struct hist_entry
*);
260 int64_t (*se_collapse
)(struct hist_entry
*, struct hist_entry
*);
261 int64_t (*se_sort
)(struct hist_entry
*, struct hist_entry
*);
262 int (*se_snprintf
)(struct hist_entry
*he
, char *bf
, size_t size
,
264 int (*se_filter
)(struct hist_entry
*he
, int type
, const void *arg
);
268 extern struct sort_entry sort_thread
;
269 extern struct list_head hist_entry__sort_list
;
273 int setup_sorting(struct perf_evlist
*evlist
);
274 int setup_output_field(void);
275 void reset_output_field(void);
276 void sort__setup_elide(FILE *fp
);
277 void perf_hpp__set_elide(int idx
, bool elide
);
279 int report_parse_ignore_callees_opt(const struct option
*opt
, const char *arg
, int unset
);
281 bool is_strict_order(const char *order
);
283 int hpp_dimension__add_output(unsigned col
);
284 void reset_dimensions(void);
285 int sort_dimension__add(struct perf_hpp_list
*list
, const char *tok
,
286 struct perf_evlist
*evlist
,
288 int output_field_add(struct perf_hpp_list
*list
, char *tok
);
290 sort__iaddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
292 sort__daddr_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
294 sort__dcacheline_cmp(struct hist_entry
*left
, struct hist_entry
*right
);
295 char *hist_entry__get_srcline(struct hist_entry
*he
);
296 #endif /* __PERF_SORT_H */