Commit | Line | Data |
---|---|---|
dd68ada2 JK |
1 | #ifndef __PERF_SORT_H |
2 | #define __PERF_SORT_H | |
3 | #include "../builtin.h" | |
4 | ||
5 | #include "util.h" | |
6 | ||
7 | #include "color.h" | |
8 | #include <linux/list.h> | |
9 | #include "cache.h" | |
10 | #include <linux/rbtree.h> | |
11 | #include "symbol.h" | |
12 | #include "string.h" | |
13 | #include "callchain.h" | |
14 | #include "strlist.h" | |
15 | #include "values.h" | |
16 | ||
17 | #include "../perf.h" | |
18 | #include "debug.h" | |
19 | #include "header.h" | |
20 | ||
4b6ab94e | 21 | #include <subcmd/parse-options.h> |
dd68ada2 | 22 | #include "parse-events.h" |
14135663 | 23 | #include "hist.h" |
dd68ada2 | 24 | #include "thread.h" |
dd68ada2 JK |
25 | |
26 | extern regex_t parent_regex; | |
edb7c60e | 27 | extern const char *sort_order; |
a7d945bc | 28 | extern const char *field_order; |
edb7c60e ACM |
29 | extern const char default_parent_pattern[]; |
30 | extern const char *parent_pattern; | |
31 | extern const char default_sort_order[]; | |
b21484f1 GP |
32 | extern regex_t ignore_callees_regex; |
33 | extern int have_ignore_callees; | |
55369fc1 | 34 | extern enum sort_mode sort__mode; |
dd68ada2 JK |
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; | |
a68c2c58 SE |
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; | |
a4fb581b | 43 | extern enum sort_type sort__first_dimension; |
228f14f2 | 44 | extern const char default_mem_sort_order[]; |
dd68ada2 | 45 | |
b24c28f7 NK |
46 | struct he_stat { |
47 | u64 period; | |
48 | u64 period_sys; | |
49 | u64 period_us; | |
50 | u64 period_guest_sys; | |
51 | u64 period_guest_us; | |
05484298 | 52 | u64 weight; |
b24c28f7 NK |
53 | u32 nr_events; |
54 | }; | |
55 | ||
96c47f19 JO |
56 | struct hist_entry_diff { |
57 | bool computed; | |
a0b404f4 NK |
58 | union { |
59 | /* PERF_HPP__DELTA */ | |
60 | double period_ratio_delta; | |
96c47f19 | 61 | |
a0b404f4 NK |
62 | /* PERF_HPP__RATIO */ |
63 | double period_ratio; | |
81d5f958 | 64 | |
a0b404f4 NK |
65 | /* HISTC_WEIGHTED_DIFF */ |
66 | s64 wdiff; | |
67 | }; | |
96c47f19 JO |
68 | }; |
69 | ||
0f0cbf7a ACM |
70 | /** |
71 | * struct hist_entry - histogram entry | |
72 | * | |
73 | * @row_offset - offset from the first callchain expanded to appear on screen | |
74 | * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding | |
75 | */ | |
dd68ada2 | 76 | struct hist_entry { |
1980c2eb | 77 | struct rb_node rb_node_in; |
dd68ada2 | 78 | struct rb_node rb_node; |
b821c732 ACM |
79 | union { |
80 | struct list_head node; | |
81 | struct list_head head; | |
82 | } pairs; | |
b24c28f7 | 83 | struct he_stat stat; |
f8be1c8c | 84 | struct he_stat *stat_acc; |
59fd5306 | 85 | struct map_symbol ms; |
a5e29aca | 86 | struct thread *thread; |
4dfced35 | 87 | struct comm *comm; |
dd68ada2 | 88 | u64 ip; |
475eeab9 | 89 | u64 transaction; |
0c4c4deb | 90 | s32 socket; |
f60f3593 | 91 | s32 cpu; |
7365be55 | 92 | u8 cpumode; |
aef810ec | 93 | u8 depth; |
0f0cbf7a | 94 | |
e0af43d2 JO |
95 | /* We are added by hists__add_dummy_entry. */ |
96 | bool dummy; | |
aef810ec | 97 | bool leaf; |
e0af43d2 | 98 | |
dd68ada2 | 99 | char level; |
a5e29aca | 100 | u8 filtered; |
29750821 NK |
101 | union { |
102 | /* | |
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. | |
106 | */ | |
107 | struct hist_entry_diff diff; | |
108 | struct /* for TUI */ { | |
109 | u16 row_offset; | |
110 | u16 nr_rows; | |
d8a0f800 | 111 | bool init_have_children; |
3698dab1 NK |
112 | bool unfolded; |
113 | bool has_children; | |
79dded87 | 114 | bool has_no_entry; |
29750821 NK |
115 | }; |
116 | }; | |
409a8be6 | 117 | char *srcline; |
31191a85 | 118 | char *srcfile; |
83753190 | 119 | struct symbol *parent; |
b5387528 | 120 | struct branch_info *branch_info; |
ae359f19 | 121 | struct hists *hists; |
98a3b32c | 122 | struct mem_info *mem_info; |
72392834 NK |
123 | void *raw_data; |
124 | u32 raw_size; | |
60517d28 | 125 | void *trace_output; |
1b2dbbf4 | 126 | struct perf_hpp_list *hpp_list; |
aef810ec NK |
127 | struct hist_entry *parent_he; |
128 | union { | |
129 | /* this is for hierarchical entry structure */ | |
130 | struct { | |
131 | struct rb_root hroot_in; | |
132 | struct rb_root hroot_out; | |
133 | }; /* non-leaf entries */ | |
134 | struct rb_root sorted_chain; /* leaf entry has callchains */ | |
135 | }; | |
98a3b32c | 136 | struct callchain_root callchain[0]; /* must be last member */ |
dd68ada2 JK |
137 | }; |
138 | ||
b821c732 ACM |
139 | static inline bool hist_entry__has_pairs(struct hist_entry *he) |
140 | { | |
141 | return !list_empty(&he->pairs.node); | |
142 | } | |
143 | ||
144 | static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he) | |
145 | { | |
146 | if (hist_entry__has_pairs(he)) | |
147 | return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); | |
148 | return NULL; | |
149 | } | |
150 | ||
4d23322a JO |
151 | static inline void hist_entry__add_pair(struct hist_entry *pair, |
152 | struct hist_entry *he) | |
b821c732 | 153 | { |
4d23322a | 154 | list_add_tail(&pair->pairs.node, &he->pairs.head); |
b821c732 ACM |
155 | } |
156 | ||
14135663 NK |
157 | static inline float hist_entry__get_percent_limit(struct hist_entry *he) |
158 | { | |
159 | u64 period = he->stat.period; | |
160 | u64 total_period = hists__total_period(he->hists); | |
161 | ||
162 | if (unlikely(total_period == 0)) | |
163 | return 0; | |
164 | ||
165 | if (symbol_conf.cumulate_callchain) | |
166 | period = he->stat_acc->period; | |
167 | ||
168 | return period * 100.0 / total_period; | |
169 | } | |
170 | ||
e95cf700 JO |
171 | static inline u64 cl_address(u64 address) |
172 | { | |
173 | /* return the cacheline of the address */ | |
174 | return (address & ~(cacheline_size - 1)); | |
175 | } | |
14135663 | 176 | |
d3927110 JO |
177 | static inline u64 cl_offset(u64 address) |
178 | { | |
179 | /* return the cacheline of the address */ | |
180 | return (address & (cacheline_size - 1)); | |
181 | } | |
182 | ||
55369fc1 NK |
183 | enum sort_mode { |
184 | SORT_MODE__NORMAL, | |
185 | SORT_MODE__BRANCH, | |
186 | SORT_MODE__MEMORY, | |
512ae1bd NK |
187 | SORT_MODE__TOP, |
188 | SORT_MODE__DIFF, | |
d49dadea | 189 | SORT_MODE__TRACEPOINT, |
55369fc1 NK |
190 | }; |
191 | ||
a4fb581b | 192 | enum sort_type { |
fc5871ed | 193 | /* common sort keys */ |
a4fb581b FW |
194 | SORT_PID, |
195 | SORT_COMM, | |
196 | SORT_DSO, | |
197 | SORT_SYM, | |
f60f3593 AS |
198 | SORT_PARENT, |
199 | SORT_CPU, | |
2e7ea3ab | 200 | SORT_SOCKET, |
fc5871ed | 201 | SORT_SRCLINE, |
31191a85 | 202 | SORT_SRCFILE, |
f9ea55d0 AK |
203 | SORT_LOCAL_WEIGHT, |
204 | SORT_GLOBAL_WEIGHT, | |
475eeab9 | 205 | SORT_TRANSACTION, |
a34bb6a0 | 206 | SORT_TRACE, |
fc5871ed NK |
207 | |
208 | /* branch stack specific sort keys */ | |
209 | __SORT_BRANCH_STACK, | |
210 | SORT_DSO_FROM = __SORT_BRANCH_STACK, | |
b5387528 RAV |
211 | SORT_DSO_TO, |
212 | SORT_SYM_FROM, | |
213 | SORT_SYM_TO, | |
214 | SORT_MISPREDICT, | |
f5d05bce AK |
215 | SORT_ABORT, |
216 | SORT_IN_TX, | |
0e332f03 | 217 | SORT_CYCLES, |
508be0df AK |
218 | SORT_SRCLINE_FROM, |
219 | SORT_SRCLINE_TO, | |
afab87b9 NK |
220 | |
221 | /* memory mode specific sort keys */ | |
222 | __SORT_MEMORY_MODE, | |
f9ea55d0 | 223 | SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE, |
afab87b9 NK |
224 | SORT_MEM_DADDR_DSO, |
225 | SORT_MEM_LOCKED, | |
226 | SORT_MEM_TLB, | |
227 | SORT_MEM_LVL, | |
228 | SORT_MEM_SNOOP, | |
9b32ba71 | 229 | SORT_MEM_DCACHELINE, |
28e6db20 | 230 | SORT_MEM_IADDR_SYMBOL, |
a4fb581b FW |
231 | }; |
232 | ||
dd68ada2 JK |
233 | /* |
234 | * configurable sorting bits | |
235 | */ | |
236 | ||
237 | struct sort_entry { | |
fcd14984 | 238 | const char *se_header; |
dd68ada2 | 239 | |
fcd14984 FW |
240 | int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *); |
241 | int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *); | |
202e7a6d | 242 | int64_t (*se_sort)(struct hist_entry *, struct hist_entry *); |
316c7136 | 243 | int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size, |
fcd14984 | 244 | unsigned int width); |
54430101 | 245 | int (*se_filter)(struct hist_entry *he, int type, const void *arg); |
8a6c5b26 | 246 | u8 se_width_idx; |
dd68ada2 JK |
247 | }; |
248 | ||
249 | extern struct sort_entry sort_thread; | |
250 | extern struct list_head hist_entry__sort_list; | |
251 | ||
40184c46 NK |
252 | struct perf_evlist; |
253 | struct pevent; | |
254 | int setup_sorting(struct perf_evlist *evlist); | |
a7d945bc | 255 | int setup_output_field(void); |
1c89fe9b | 256 | void reset_output_field(void); |
08e71542 | 257 | void sort__setup_elide(FILE *fp); |
f2998422 | 258 | void perf_hpp__set_elide(int idx, bool elide); |
dd68ada2 | 259 | |
b21484f1 GP |
260 | int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset); |
261 | ||
2f3f9bcf | 262 | bool is_strict_order(const char *order); |
beeaaeb3 JO |
263 | |
264 | int hpp_dimension__add_output(unsigned col); | |
dd68ada2 | 265 | #endif /* __PERF_SORT_H */ |