Commit | Line | Data |
---|---|---|
8a0ecfb8 | 1 | #include "util.h" |
598357eb | 2 | #include "build-id.h" |
3d1d07ec | 3 | #include "hist.h" |
4e4f06e4 ACM |
4 | #include "session.h" |
5 | #include "sort.h" | |
2a1731fb | 6 | #include "evlist.h" |
29d720ed | 7 | #include "evsel.h" |
69bcb019 | 8 | #include "annotate.h" |
740b97f9 | 9 | #include "ui/progress.h" |
9b33827d | 10 | #include <math.h> |
3d1d07ec | 11 | |
90cf1fb5 ACM |
12 | static bool hists__filter_entry_by_dso(struct hists *hists, |
13 | struct hist_entry *he); | |
14 | static bool hists__filter_entry_by_thread(struct hists *hists, | |
15 | struct hist_entry *he); | |
e94d53eb NK |
16 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
17 | struct hist_entry *he); | |
21394d94 KL |
18 | static bool hists__filter_entry_by_socket(struct hists *hists, |
19 | struct hist_entry *he); | |
90cf1fb5 | 20 | |
42b28ac0 | 21 | u16 hists__col_len(struct hists *hists, enum hist_column col) |
8a6c5b26 | 22 | { |
42b28ac0 | 23 | return hists->col_len[col]; |
8a6c5b26 ACM |
24 | } |
25 | ||
42b28ac0 | 26 | void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 27 | { |
42b28ac0 | 28 | hists->col_len[col] = len; |
8a6c5b26 ACM |
29 | } |
30 | ||
42b28ac0 | 31 | bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 32 | { |
42b28ac0 ACM |
33 | if (len > hists__col_len(hists, col)) { |
34 | hists__set_col_len(hists, col, len); | |
8a6c5b26 ACM |
35 | return true; |
36 | } | |
37 | return false; | |
38 | } | |
39 | ||
7ccf4f90 | 40 | void hists__reset_col_len(struct hists *hists) |
8a6c5b26 ACM |
41 | { |
42 | enum hist_column col; | |
43 | ||
44 | for (col = 0; col < HISTC_NR_COLS; ++col) | |
42b28ac0 | 45 | hists__set_col_len(hists, col, 0); |
8a6c5b26 ACM |
46 | } |
47 | ||
b5387528 RAV |
48 | static void hists__set_unres_dso_col_len(struct hists *hists, int dso) |
49 | { | |
50 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; | |
51 | ||
52 | if (hists__col_len(hists, dso) < unresolved_col_width && | |
53 | !symbol_conf.col_width_list_str && !symbol_conf.field_sep && | |
54 | !symbol_conf.dso_list) | |
55 | hists__set_col_len(hists, dso, unresolved_col_width); | |
56 | } | |
57 | ||
7ccf4f90 | 58 | void hists__calc_col_len(struct hists *hists, struct hist_entry *h) |
8a6c5b26 | 59 | { |
b5387528 | 60 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; |
98a3b32c | 61 | int symlen; |
8a6c5b26 ACM |
62 | u16 len; |
63 | ||
ded19d57 NK |
64 | /* |
65 | * +4 accounts for '[x] ' priv level info | |
66 | * +2 accounts for 0x prefix on raw addresses | |
67 | * +3 accounts for ' y ' symtab origin info | |
68 | */ | |
69 | if (h->ms.sym) { | |
70 | symlen = h->ms.sym->namelen + 4; | |
71 | if (verbose) | |
72 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
73 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
74 | } else { | |
98a3b32c SE |
75 | symlen = unresolved_col_width + 4 + 2; |
76 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
b5387528 | 77 | hists__set_unres_dso_col_len(hists, HISTC_DSO); |
98a3b32c | 78 | } |
8a6c5b26 ACM |
79 | |
80 | len = thread__comm_len(h->thread); | |
42b28ac0 ACM |
81 | if (hists__new_col_len(hists, HISTC_COMM, len)) |
82 | hists__set_col_len(hists, HISTC_THREAD, len + 6); | |
8a6c5b26 ACM |
83 | |
84 | if (h->ms.map) { | |
85 | len = dso__name_len(h->ms.map->dso); | |
42b28ac0 | 86 | hists__new_col_len(hists, HISTC_DSO, len); |
8a6c5b26 | 87 | } |
b5387528 | 88 | |
cb993744 NK |
89 | if (h->parent) |
90 | hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen); | |
91 | ||
b5387528 | 92 | if (h->branch_info) { |
b5387528 RAV |
93 | if (h->branch_info->from.sym) { |
94 | symlen = (int)h->branch_info->from.sym->namelen + 4; | |
ded19d57 NK |
95 | if (verbose) |
96 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
97 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); |
98 | ||
99 | symlen = dso__name_len(h->branch_info->from.map->dso); | |
100 | hists__new_col_len(hists, HISTC_DSO_FROM, symlen); | |
101 | } else { | |
102 | symlen = unresolved_col_width + 4 + 2; | |
103 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); | |
104 | hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM); | |
105 | } | |
106 | ||
107 | if (h->branch_info->to.sym) { | |
108 | symlen = (int)h->branch_info->to.sym->namelen + 4; | |
ded19d57 NK |
109 | if (verbose) |
110 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
111 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); |
112 | ||
113 | symlen = dso__name_len(h->branch_info->to.map->dso); | |
114 | hists__new_col_len(hists, HISTC_DSO_TO, symlen); | |
115 | } else { | |
116 | symlen = unresolved_col_width + 4 + 2; | |
117 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); | |
118 | hists__set_unres_dso_col_len(hists, HISTC_DSO_TO); | |
119 | } | |
120 | } | |
98a3b32c SE |
121 | |
122 | if (h->mem_info) { | |
98a3b32c SE |
123 | if (h->mem_info->daddr.sym) { |
124 | symlen = (int)h->mem_info->daddr.sym->namelen + 4 | |
125 | + unresolved_col_width + 2; | |
126 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
127 | symlen); | |
9b32ba71 DZ |
128 | hists__new_col_len(hists, HISTC_MEM_DCACHELINE, |
129 | symlen + 1); | |
98a3b32c SE |
130 | } else { |
131 | symlen = unresolved_col_width + 4 + 2; | |
132 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
133 | symlen); | |
134 | } | |
b34b3bf0 JO |
135 | |
136 | if (h->mem_info->iaddr.sym) { | |
137 | symlen = (int)h->mem_info->iaddr.sym->namelen + 4 | |
138 | + unresolved_col_width + 2; | |
139 | hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, | |
140 | symlen); | |
141 | } else { | |
142 | symlen = unresolved_col_width + 4 + 2; | |
143 | hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, | |
144 | symlen); | |
145 | } | |
146 | ||
98a3b32c SE |
147 | if (h->mem_info->daddr.map) { |
148 | symlen = dso__name_len(h->mem_info->daddr.map->dso); | |
149 | hists__new_col_len(hists, HISTC_MEM_DADDR_DSO, | |
150 | symlen); | |
151 | } else { | |
152 | symlen = unresolved_col_width + 4 + 2; | |
153 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
154 | } | |
155 | } else { | |
156 | symlen = unresolved_col_width + 4 + 2; | |
157 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen); | |
b34b3bf0 | 158 | hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen); |
98a3b32c SE |
159 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); |
160 | } | |
161 | ||
a4978eca | 162 | hists__new_col_len(hists, HISTC_CPU, 3); |
2e7ea3ab | 163 | hists__new_col_len(hists, HISTC_SOCKET, 6); |
98a3b32c SE |
164 | hists__new_col_len(hists, HISTC_MEM_LOCKED, 6); |
165 | hists__new_col_len(hists, HISTC_MEM_TLB, 22); | |
166 | hists__new_col_len(hists, HISTC_MEM_SNOOP, 12); | |
167 | hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3); | |
168 | hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12); | |
169 | hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12); | |
475eeab9 | 170 | |
e8e6d37e ACM |
171 | if (h->srcline) |
172 | hists__new_col_len(hists, HISTC_SRCLINE, strlen(h->srcline)); | |
173 | ||
31191a85 AK |
174 | if (h->srcfile) |
175 | hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile)); | |
176 | ||
475eeab9 AK |
177 | if (h->transaction) |
178 | hists__new_col_len(hists, HISTC_TRANSACTION, | |
179 | hist_entry__transaction_len()); | |
8a6c5b26 ACM |
180 | } |
181 | ||
7ccf4f90 NK |
182 | void hists__output_recalc_col_len(struct hists *hists, int max_rows) |
183 | { | |
184 | struct rb_node *next = rb_first(&hists->entries); | |
185 | struct hist_entry *n; | |
186 | int row = 0; | |
187 | ||
188 | hists__reset_col_len(hists); | |
189 | ||
190 | while (next && row++ < max_rows) { | |
191 | n = rb_entry(next, struct hist_entry, rb_node); | |
192 | if (!n->filtered) | |
193 | hists__calc_col_len(hists, n); | |
194 | next = rb_next(&n->rb_node); | |
195 | } | |
196 | } | |
197 | ||
f39056f9 NK |
198 | static void he_stat__add_cpumode_period(struct he_stat *he_stat, |
199 | unsigned int cpumode, u64 period) | |
a1645ce1 | 200 | { |
28e2a106 | 201 | switch (cpumode) { |
a1645ce1 | 202 | case PERF_RECORD_MISC_KERNEL: |
f39056f9 | 203 | he_stat->period_sys += period; |
a1645ce1 ZY |
204 | break; |
205 | case PERF_RECORD_MISC_USER: | |
f39056f9 | 206 | he_stat->period_us += period; |
a1645ce1 ZY |
207 | break; |
208 | case PERF_RECORD_MISC_GUEST_KERNEL: | |
f39056f9 | 209 | he_stat->period_guest_sys += period; |
a1645ce1 ZY |
210 | break; |
211 | case PERF_RECORD_MISC_GUEST_USER: | |
f39056f9 | 212 | he_stat->period_guest_us += period; |
a1645ce1 ZY |
213 | break; |
214 | default: | |
215 | break; | |
216 | } | |
217 | } | |
218 | ||
05484298 AK |
219 | static void he_stat__add_period(struct he_stat *he_stat, u64 period, |
220 | u64 weight) | |
139c0815 | 221 | { |
98a3b32c | 222 | |
139c0815 | 223 | he_stat->period += period; |
05484298 | 224 | he_stat->weight += weight; |
139c0815 NK |
225 | he_stat->nr_events += 1; |
226 | } | |
227 | ||
228 | static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src) | |
229 | { | |
230 | dest->period += src->period; | |
231 | dest->period_sys += src->period_sys; | |
232 | dest->period_us += src->period_us; | |
233 | dest->period_guest_sys += src->period_guest_sys; | |
234 | dest->period_guest_us += src->period_guest_us; | |
235 | dest->nr_events += src->nr_events; | |
05484298 | 236 | dest->weight += src->weight; |
139c0815 NK |
237 | } |
238 | ||
f39056f9 | 239 | static void he_stat__decay(struct he_stat *he_stat) |
ab81f3fd | 240 | { |
f39056f9 NK |
241 | he_stat->period = (he_stat->period * 7) / 8; |
242 | he_stat->nr_events = (he_stat->nr_events * 7) / 8; | |
05484298 | 243 | /* XXX need decay for weight too? */ |
ab81f3fd ACM |
244 | } |
245 | ||
246 | static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) | |
247 | { | |
b24c28f7 | 248 | u64 prev_period = he->stat.period; |
3186b681 | 249 | u64 diff; |
c64550cf ACM |
250 | |
251 | if (prev_period == 0) | |
df71d95f | 252 | return true; |
c64550cf | 253 | |
f39056f9 | 254 | he_stat__decay(&he->stat); |
f8be1c8c NK |
255 | if (symbol_conf.cumulate_callchain) |
256 | he_stat__decay(he->stat_acc); | |
c64550cf | 257 | |
3186b681 NK |
258 | diff = prev_period - he->stat.period; |
259 | ||
260 | hists->stats.total_period -= diff; | |
c64550cf | 261 | if (!he->filtered) |
3186b681 | 262 | hists->stats.total_non_filtered_period -= diff; |
c64550cf | 263 | |
b24c28f7 | 264 | return he->stat.period == 0; |
ab81f3fd ACM |
265 | } |
266 | ||
956b65e1 ACM |
267 | static void hists__delete_entry(struct hists *hists, struct hist_entry *he) |
268 | { | |
269 | rb_erase(&he->rb_node, &hists->entries); | |
270 | ||
271 | if (sort__need_collapse) | |
272 | rb_erase(&he->rb_node_in, &hists->entries_collapsed); | |
61fa0e94 NK |
273 | else |
274 | rb_erase(&he->rb_node_in, hists->entries_in); | |
956b65e1 ACM |
275 | |
276 | --hists->nr_entries; | |
277 | if (!he->filtered) | |
278 | --hists->nr_non_filtered_entries; | |
279 | ||
280 | hist_entry__delete(he); | |
281 | } | |
282 | ||
3a5714f8 | 283 | void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel) |
ab81f3fd ACM |
284 | { |
285 | struct rb_node *next = rb_first(&hists->entries); | |
286 | struct hist_entry *n; | |
287 | ||
288 | while (next) { | |
289 | n = rb_entry(next, struct hist_entry, rb_node); | |
290 | next = rb_next(&n->rb_node); | |
b079d4e9 ACM |
291 | if (((zap_user && n->level == '.') || |
292 | (zap_kernel && n->level != '.') || | |
4c47f4fc | 293 | hists__decay_entry(hists, n))) { |
956b65e1 | 294 | hists__delete_entry(hists, n); |
ab81f3fd ACM |
295 | } |
296 | } | |
297 | } | |
298 | ||
701937bd NK |
299 | void hists__delete_entries(struct hists *hists) |
300 | { | |
301 | struct rb_node *next = rb_first(&hists->entries); | |
302 | struct hist_entry *n; | |
303 | ||
304 | while (next) { | |
305 | n = rb_entry(next, struct hist_entry, rb_node); | |
306 | next = rb_next(&n->rb_node); | |
307 | ||
956b65e1 | 308 | hists__delete_entry(hists, n); |
701937bd NK |
309 | } |
310 | } | |
311 | ||
3d1d07ec | 312 | /* |
c82ee828 | 313 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
314 | */ |
315 | ||
a0b51af3 NK |
316 | static struct hist_entry *hist_entry__new(struct hist_entry *template, |
317 | bool sample_self) | |
28e2a106 | 318 | { |
f8be1c8c NK |
319 | size_t callchain_size = 0; |
320 | struct hist_entry *he; | |
321 | ||
82aa019e | 322 | if (symbol_conf.use_callchain) |
f8be1c8c NK |
323 | callchain_size = sizeof(struct callchain_root); |
324 | ||
325 | he = zalloc(sizeof(*he) + callchain_size); | |
28e2a106 | 326 | |
12c14278 ACM |
327 | if (he != NULL) { |
328 | *he = *template; | |
c4b35351 | 329 | |
f8be1c8c NK |
330 | if (symbol_conf.cumulate_callchain) { |
331 | he->stat_acc = malloc(sizeof(he->stat)); | |
332 | if (he->stat_acc == NULL) { | |
333 | free(he); | |
334 | return NULL; | |
335 | } | |
336 | memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); | |
a0b51af3 NK |
337 | if (!sample_self) |
338 | memset(&he->stat, 0, sizeof(he->stat)); | |
f8be1c8c NK |
339 | } |
340 | ||
5c24b67a | 341 | map__get(he->ms.map); |
3cf0cb1f SE |
342 | |
343 | if (he->branch_info) { | |
26353a61 NK |
344 | /* |
345 | * This branch info is (a part of) allocated from | |
644f2df2 | 346 | * sample__resolve_bstack() and will be freed after |
26353a61 NK |
347 | * adding new entries. So we need to save a copy. |
348 | */ | |
349 | he->branch_info = malloc(sizeof(*he->branch_info)); | |
350 | if (he->branch_info == NULL) { | |
5c24b67a | 351 | map__zput(he->ms.map); |
f8be1c8c | 352 | free(he->stat_acc); |
26353a61 NK |
353 | free(he); |
354 | return NULL; | |
355 | } | |
356 | ||
357 | memcpy(he->branch_info, template->branch_info, | |
358 | sizeof(*he->branch_info)); | |
359 | ||
5c24b67a ACM |
360 | map__get(he->branch_info->from.map); |
361 | map__get(he->branch_info->to.map); | |
3cf0cb1f SE |
362 | } |
363 | ||
98a3b32c | 364 | if (he->mem_info) { |
5c24b67a ACM |
365 | map__get(he->mem_info->iaddr.map); |
366 | map__get(he->mem_info->daddr.map); | |
98a3b32c SE |
367 | } |
368 | ||
28e2a106 | 369 | if (symbol_conf.use_callchain) |
12c14278 | 370 | callchain_init(he->callchain); |
b821c732 | 371 | |
72392834 NK |
372 | if (he->raw_data) { |
373 | he->raw_data = memdup(he->raw_data, he->raw_size); | |
374 | ||
375 | if (he->raw_data == NULL) { | |
376 | map__put(he->ms.map); | |
377 | if (he->branch_info) { | |
378 | map__put(he->branch_info->from.map); | |
379 | map__put(he->branch_info->to.map); | |
380 | free(he->branch_info); | |
381 | } | |
382 | if (he->mem_info) { | |
383 | map__put(he->mem_info->iaddr.map); | |
384 | map__put(he->mem_info->daddr.map); | |
385 | } | |
386 | free(he->stat_acc); | |
387 | free(he); | |
388 | return NULL; | |
389 | } | |
390 | } | |
b821c732 | 391 | INIT_LIST_HEAD(&he->pairs.node); |
f3b623b8 | 392 | thread__get(he->thread); |
28e2a106 ACM |
393 | } |
394 | ||
12c14278 | 395 | return he; |
28e2a106 ACM |
396 | } |
397 | ||
7a007ca9 ACM |
398 | static u8 symbol__parent_filter(const struct symbol *parent) |
399 | { | |
400 | if (symbol_conf.exclude_other && parent == NULL) | |
401 | return 1 << HIST_FILTER__PARENT; | |
402 | return 0; | |
403 | } | |
404 | ||
e7e0efcd ACM |
405 | static struct hist_entry *hists__findnew_entry(struct hists *hists, |
406 | struct hist_entry *entry, | |
407 | struct addr_location *al, | |
408 | bool sample_self) | |
9735abf1 | 409 | { |
1980c2eb | 410 | struct rb_node **p; |
9735abf1 ACM |
411 | struct rb_node *parent = NULL; |
412 | struct hist_entry *he; | |
354cc40e | 413 | int64_t cmp; |
f1cbf78d NK |
414 | u64 period = entry->stat.period; |
415 | u64 weight = entry->stat.weight; | |
9735abf1 | 416 | |
1980c2eb ACM |
417 | p = &hists->entries_in->rb_node; |
418 | ||
9735abf1 ACM |
419 | while (*p != NULL) { |
420 | parent = *p; | |
1980c2eb | 421 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 422 | |
9afcf930 NK |
423 | /* |
424 | * Make sure that it receives arguments in a same order as | |
425 | * hist_entry__collapse() so that we can use an appropriate | |
426 | * function when searching an entry regardless which sort | |
427 | * keys were used. | |
428 | */ | |
429 | cmp = hist_entry__cmp(he, entry); | |
9735abf1 ACM |
430 | |
431 | if (!cmp) { | |
a0b51af3 NK |
432 | if (sample_self) |
433 | he_stat__add_period(&he->stat, period, weight); | |
f8be1c8c NK |
434 | if (symbol_conf.cumulate_callchain) |
435 | he_stat__add_period(he->stat_acc, period, weight); | |
63fa471d | 436 | |
ceb2acbc | 437 | /* |
e80faac0 | 438 | * This mem info was allocated from sample__resolve_mem |
ceb2acbc NK |
439 | * and will not be used anymore. |
440 | */ | |
74cf249d | 441 | zfree(&entry->mem_info); |
ceb2acbc | 442 | |
63fa471d DM |
443 | /* If the map of an existing hist_entry has |
444 | * become out-of-date due to an exec() or | |
445 | * similar, update it. Otherwise we will | |
446 | * mis-adjust symbol addresses when computing | |
447 | * the history counter to increment. | |
448 | */ | |
449 | if (he->ms.map != entry->ms.map) { | |
5c24b67a ACM |
450 | map__put(he->ms.map); |
451 | he->ms.map = map__get(entry->ms.map); | |
63fa471d | 452 | } |
28e2a106 | 453 | goto out; |
9735abf1 ACM |
454 | } |
455 | ||
456 | if (cmp < 0) | |
457 | p = &(*p)->rb_left; | |
458 | else | |
459 | p = &(*p)->rb_right; | |
460 | } | |
461 | ||
a0b51af3 | 462 | he = hist_entry__new(entry, sample_self); |
9735abf1 | 463 | if (!he) |
27a0dcb7 | 464 | return NULL; |
1980c2eb | 465 | |
590cd344 NK |
466 | hists->nr_entries++; |
467 | ||
1980c2eb ACM |
468 | rb_link_node(&he->rb_node_in, parent, p); |
469 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 470 | out: |
a0b51af3 NK |
471 | if (sample_self) |
472 | he_stat__add_cpumode_period(&he->stat, al->cpumode, period); | |
f8be1c8c NK |
473 | if (symbol_conf.cumulate_callchain) |
474 | he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); | |
9735abf1 ACM |
475 | return he; |
476 | } | |
477 | ||
c824c433 | 478 | struct hist_entry *__hists__add_entry(struct hists *hists, |
b5387528 | 479 | struct addr_location *al, |
41a4e6e2 NK |
480 | struct symbol *sym_parent, |
481 | struct branch_info *bi, | |
482 | struct mem_info *mi, | |
fd36f3dd | 483 | struct perf_sample *sample, |
a0b51af3 | 484 | bool sample_self) |
b5387528 RAV |
485 | { |
486 | struct hist_entry entry = { | |
487 | .thread = al->thread, | |
4dfced35 | 488 | .comm = thread__comm(al->thread), |
b5387528 RAV |
489 | .ms = { |
490 | .map = al->map, | |
491 | .sym = al->sym, | |
492 | }, | |
0c4c4deb | 493 | .socket = al->socket, |
7365be55 DZ |
494 | .cpu = al->cpu, |
495 | .cpumode = al->cpumode, | |
496 | .ip = al->addr, | |
497 | .level = al->level, | |
b24c28f7 | 498 | .stat = { |
c4b35351 | 499 | .nr_events = 1, |
fd36f3dd NK |
500 | .period = sample->period, |
501 | .weight = sample->weight, | |
b24c28f7 | 502 | }, |
b5387528 | 503 | .parent = sym_parent, |
2c86c7ca | 504 | .filtered = symbol__parent_filter(sym_parent) | al->filtered, |
c824c433 | 505 | .hists = hists, |
41a4e6e2 NK |
506 | .branch_info = bi, |
507 | .mem_info = mi, | |
fd36f3dd | 508 | .transaction = sample->transaction, |
72392834 NK |
509 | .raw_data = sample->raw_data, |
510 | .raw_size = sample->raw_size, | |
b5387528 RAV |
511 | }; |
512 | ||
e7e0efcd | 513 | return hists__findnew_entry(hists, &entry, al, sample_self); |
b5387528 RAV |
514 | } |
515 | ||
69bcb019 NK |
516 | static int |
517 | iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, | |
518 | struct addr_location *al __maybe_unused) | |
519 | { | |
520 | return 0; | |
521 | } | |
522 | ||
523 | static int | |
524 | iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, | |
525 | struct addr_location *al __maybe_unused) | |
526 | { | |
527 | return 0; | |
528 | } | |
529 | ||
530 | static int | |
531 | iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
532 | { | |
533 | struct perf_sample *sample = iter->sample; | |
534 | struct mem_info *mi; | |
535 | ||
536 | mi = sample__resolve_mem(sample, al); | |
537 | if (mi == NULL) | |
538 | return -ENOMEM; | |
539 | ||
540 | iter->priv = mi; | |
541 | return 0; | |
542 | } | |
543 | ||
544 | static int | |
545 | iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
546 | { | |
547 | u64 cost; | |
548 | struct mem_info *mi = iter->priv; | |
4ea062ed | 549 | struct hists *hists = evsel__hists(iter->evsel); |
fd36f3dd | 550 | struct perf_sample *sample = iter->sample; |
69bcb019 NK |
551 | struct hist_entry *he; |
552 | ||
553 | if (mi == NULL) | |
554 | return -EINVAL; | |
555 | ||
fd36f3dd | 556 | cost = sample->weight; |
69bcb019 NK |
557 | if (!cost) |
558 | cost = 1; | |
559 | ||
560 | /* | |
561 | * must pass period=weight in order to get the correct | |
562 | * sorting from hists__collapse_resort() which is solely | |
563 | * based on periods. We want sorting be done on nr_events * weight | |
564 | * and this is indirectly achieved by passing period=weight here | |
565 | * and the he_stat__add_period() function. | |
566 | */ | |
fd36f3dd NK |
567 | sample->period = cost; |
568 | ||
4ea062ed | 569 | he = __hists__add_entry(hists, al, iter->parent, NULL, mi, |
fd36f3dd | 570 | sample, true); |
69bcb019 NK |
571 | if (!he) |
572 | return -ENOMEM; | |
573 | ||
574 | iter->he = he; | |
575 | return 0; | |
576 | } | |
577 | ||
578 | static int | |
9d3c02d7 NK |
579 | iter_finish_mem_entry(struct hist_entry_iter *iter, |
580 | struct addr_location *al __maybe_unused) | |
69bcb019 NK |
581 | { |
582 | struct perf_evsel *evsel = iter->evsel; | |
4ea062ed | 583 | struct hists *hists = evsel__hists(evsel); |
69bcb019 | 584 | struct hist_entry *he = iter->he; |
69bcb019 NK |
585 | int err = -EINVAL; |
586 | ||
587 | if (he == NULL) | |
588 | goto out; | |
589 | ||
4ea062ed | 590 | hists__inc_nr_samples(hists, he->filtered); |
69bcb019 NK |
591 | |
592 | err = hist_entry__append_callchain(he, iter->sample); | |
593 | ||
594 | out: | |
595 | /* | |
e7e0efcd ACM |
596 | * We don't need to free iter->priv (mem_info) here since the mem info |
597 | * was either already freed in hists__findnew_entry() or passed to a | |
598 | * new hist entry by hist_entry__new(). | |
69bcb019 NK |
599 | */ |
600 | iter->priv = NULL; | |
601 | ||
602 | iter->he = NULL; | |
603 | return err; | |
604 | } | |
605 | ||
606 | static int | |
607 | iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
608 | { | |
609 | struct branch_info *bi; | |
610 | struct perf_sample *sample = iter->sample; | |
611 | ||
612 | bi = sample__resolve_bstack(sample, al); | |
613 | if (!bi) | |
614 | return -ENOMEM; | |
615 | ||
616 | iter->curr = 0; | |
617 | iter->total = sample->branch_stack->nr; | |
618 | ||
619 | iter->priv = bi; | |
620 | return 0; | |
621 | } | |
622 | ||
623 | static int | |
624 | iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused, | |
625 | struct addr_location *al __maybe_unused) | |
626 | { | |
9d3c02d7 NK |
627 | /* to avoid calling callback function */ |
628 | iter->he = NULL; | |
629 | ||
69bcb019 NK |
630 | return 0; |
631 | } | |
632 | ||
633 | static int | |
634 | iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
635 | { | |
636 | struct branch_info *bi = iter->priv; | |
637 | int i = iter->curr; | |
638 | ||
639 | if (bi == NULL) | |
640 | return 0; | |
641 | ||
642 | if (iter->curr >= iter->total) | |
643 | return 0; | |
644 | ||
645 | al->map = bi[i].to.map; | |
646 | al->sym = bi[i].to.sym; | |
647 | al->addr = bi[i].to.addr; | |
648 | return 1; | |
649 | } | |
650 | ||
651 | static int | |
652 | iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
653 | { | |
9d3c02d7 | 654 | struct branch_info *bi; |
69bcb019 | 655 | struct perf_evsel *evsel = iter->evsel; |
4ea062ed | 656 | struct hists *hists = evsel__hists(evsel); |
fd36f3dd | 657 | struct perf_sample *sample = iter->sample; |
69bcb019 NK |
658 | struct hist_entry *he = NULL; |
659 | int i = iter->curr; | |
660 | int err = 0; | |
661 | ||
662 | bi = iter->priv; | |
663 | ||
664 | if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym)) | |
665 | goto out; | |
666 | ||
667 | /* | |
668 | * The report shows the percentage of total branches captured | |
669 | * and not events sampled. Thus we use a pseudo period of 1. | |
670 | */ | |
fd36f3dd NK |
671 | sample->period = 1; |
672 | sample->weight = bi->flags.cycles ? bi->flags.cycles : 1; | |
673 | ||
4ea062ed | 674 | he = __hists__add_entry(hists, al, iter->parent, &bi[i], NULL, |
fd36f3dd | 675 | sample, true); |
69bcb019 NK |
676 | if (he == NULL) |
677 | return -ENOMEM; | |
678 | ||
4ea062ed | 679 | hists__inc_nr_samples(hists, he->filtered); |
69bcb019 NK |
680 | |
681 | out: | |
682 | iter->he = he; | |
683 | iter->curr++; | |
684 | return err; | |
685 | } | |
686 | ||
687 | static int | |
688 | iter_finish_branch_entry(struct hist_entry_iter *iter, | |
689 | struct addr_location *al __maybe_unused) | |
690 | { | |
691 | zfree(&iter->priv); | |
692 | iter->he = NULL; | |
693 | ||
694 | return iter->curr >= iter->total ? 0 : -1; | |
695 | } | |
696 | ||
697 | static int | |
698 | iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused, | |
699 | struct addr_location *al __maybe_unused) | |
700 | { | |
701 | return 0; | |
702 | } | |
703 | ||
704 | static int | |
705 | iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
706 | { | |
707 | struct perf_evsel *evsel = iter->evsel; | |
708 | struct perf_sample *sample = iter->sample; | |
709 | struct hist_entry *he; | |
710 | ||
4ea062ed | 711 | he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, |
fd36f3dd | 712 | sample, true); |
69bcb019 NK |
713 | if (he == NULL) |
714 | return -ENOMEM; | |
715 | ||
716 | iter->he = he; | |
717 | return 0; | |
718 | } | |
719 | ||
720 | static int | |
9d3c02d7 NK |
721 | iter_finish_normal_entry(struct hist_entry_iter *iter, |
722 | struct addr_location *al __maybe_unused) | |
69bcb019 | 723 | { |
69bcb019 NK |
724 | struct hist_entry *he = iter->he; |
725 | struct perf_evsel *evsel = iter->evsel; | |
726 | struct perf_sample *sample = iter->sample; | |
727 | ||
728 | if (he == NULL) | |
729 | return 0; | |
730 | ||
731 | iter->he = NULL; | |
732 | ||
4ea062ed | 733 | hists__inc_nr_samples(evsel__hists(evsel), he->filtered); |
69bcb019 NK |
734 | |
735 | return hist_entry__append_callchain(he, sample); | |
736 | } | |
737 | ||
7a13aa28 | 738 | static int |
96b40f3c | 739 | iter_prepare_cumulative_entry(struct hist_entry_iter *iter, |
7a13aa28 NK |
740 | struct addr_location *al __maybe_unused) |
741 | { | |
b4d3c8bd NK |
742 | struct hist_entry **he_cache; |
743 | ||
7a13aa28 | 744 | callchain_cursor_commit(&callchain_cursor); |
b4d3c8bd NK |
745 | |
746 | /* | |
747 | * This is for detecting cycles or recursions so that they're | |
748 | * cumulated only one time to prevent entries more than 100% | |
749 | * overhead. | |
750 | */ | |
96b40f3c | 751 | he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1)); |
b4d3c8bd NK |
752 | if (he_cache == NULL) |
753 | return -ENOMEM; | |
754 | ||
755 | iter->priv = he_cache; | |
756 | iter->curr = 0; | |
757 | ||
7a13aa28 NK |
758 | return 0; |
759 | } | |
760 | ||
761 | static int | |
762 | iter_add_single_cumulative_entry(struct hist_entry_iter *iter, | |
763 | struct addr_location *al) | |
764 | { | |
765 | struct perf_evsel *evsel = iter->evsel; | |
4ea062ed | 766 | struct hists *hists = evsel__hists(evsel); |
7a13aa28 | 767 | struct perf_sample *sample = iter->sample; |
b4d3c8bd | 768 | struct hist_entry **he_cache = iter->priv; |
7a13aa28 NK |
769 | struct hist_entry *he; |
770 | int err = 0; | |
771 | ||
4ea062ed | 772 | he = __hists__add_entry(hists, al, iter->parent, NULL, NULL, |
fd36f3dd | 773 | sample, true); |
7a13aa28 NK |
774 | if (he == NULL) |
775 | return -ENOMEM; | |
776 | ||
777 | iter->he = he; | |
b4d3c8bd | 778 | he_cache[iter->curr++] = he; |
7a13aa28 | 779 | |
82aa019e | 780 | hist_entry__append_callchain(he, sample); |
be7f855a NK |
781 | |
782 | /* | |
783 | * We need to re-initialize the cursor since callchain_append() | |
784 | * advanced the cursor to the end. | |
785 | */ | |
786 | callchain_cursor_commit(&callchain_cursor); | |
787 | ||
4ea062ed | 788 | hists__inc_nr_samples(hists, he->filtered); |
7a13aa28 NK |
789 | |
790 | return err; | |
791 | } | |
792 | ||
793 | static int | |
794 | iter_next_cumulative_entry(struct hist_entry_iter *iter, | |
795 | struct addr_location *al) | |
796 | { | |
797 | struct callchain_cursor_node *node; | |
798 | ||
799 | node = callchain_cursor_current(&callchain_cursor); | |
800 | if (node == NULL) | |
801 | return 0; | |
802 | ||
c7405d85 | 803 | return fill_callchain_info(al, node, iter->hide_unresolved); |
7a13aa28 NK |
804 | } |
805 | ||
806 | static int | |
807 | iter_add_next_cumulative_entry(struct hist_entry_iter *iter, | |
808 | struct addr_location *al) | |
809 | { | |
810 | struct perf_evsel *evsel = iter->evsel; | |
811 | struct perf_sample *sample = iter->sample; | |
b4d3c8bd | 812 | struct hist_entry **he_cache = iter->priv; |
7a13aa28 | 813 | struct hist_entry *he; |
b4d3c8bd | 814 | struct hist_entry he_tmp = { |
5cef8976 | 815 | .hists = evsel__hists(evsel), |
b4d3c8bd NK |
816 | .cpu = al->cpu, |
817 | .thread = al->thread, | |
818 | .comm = thread__comm(al->thread), | |
819 | .ip = al->addr, | |
820 | .ms = { | |
821 | .map = al->map, | |
822 | .sym = al->sym, | |
823 | }, | |
824 | .parent = iter->parent, | |
72392834 NK |
825 | .raw_data = sample->raw_data, |
826 | .raw_size = sample->raw_size, | |
b4d3c8bd NK |
827 | }; |
828 | int i; | |
be7f855a NK |
829 | struct callchain_cursor cursor; |
830 | ||
831 | callchain_cursor_snapshot(&cursor, &callchain_cursor); | |
832 | ||
833 | callchain_cursor_advance(&callchain_cursor); | |
b4d3c8bd NK |
834 | |
835 | /* | |
836 | * Check if there's duplicate entries in the callchain. | |
837 | * It's possible that it has cycles or recursive calls. | |
838 | */ | |
839 | for (i = 0; i < iter->curr; i++) { | |
9d3c02d7 NK |
840 | if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) { |
841 | /* to avoid calling callback function */ | |
842 | iter->he = NULL; | |
b4d3c8bd | 843 | return 0; |
9d3c02d7 | 844 | } |
b4d3c8bd | 845 | } |
7a13aa28 | 846 | |
4ea062ed | 847 | he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, |
fd36f3dd | 848 | sample, false); |
7a13aa28 NK |
849 | if (he == NULL) |
850 | return -ENOMEM; | |
851 | ||
852 | iter->he = he; | |
b4d3c8bd | 853 | he_cache[iter->curr++] = he; |
7a13aa28 | 854 | |
82aa019e NK |
855 | if (symbol_conf.use_callchain) |
856 | callchain_append(he->callchain, &cursor, sample->period); | |
7a13aa28 NK |
857 | return 0; |
858 | } | |
859 | ||
860 | static int | |
861 | iter_finish_cumulative_entry(struct hist_entry_iter *iter, | |
862 | struct addr_location *al __maybe_unused) | |
863 | { | |
b4d3c8bd | 864 | zfree(&iter->priv); |
7a13aa28 | 865 | iter->he = NULL; |
b4d3c8bd | 866 | |
7a13aa28 NK |
867 | return 0; |
868 | } | |
869 | ||
69bcb019 NK |
870 | const struct hist_iter_ops hist_iter_mem = { |
871 | .prepare_entry = iter_prepare_mem_entry, | |
872 | .add_single_entry = iter_add_single_mem_entry, | |
873 | .next_entry = iter_next_nop_entry, | |
874 | .add_next_entry = iter_add_next_nop_entry, | |
875 | .finish_entry = iter_finish_mem_entry, | |
876 | }; | |
877 | ||
878 | const struct hist_iter_ops hist_iter_branch = { | |
879 | .prepare_entry = iter_prepare_branch_entry, | |
880 | .add_single_entry = iter_add_single_branch_entry, | |
881 | .next_entry = iter_next_branch_entry, | |
882 | .add_next_entry = iter_add_next_branch_entry, | |
883 | .finish_entry = iter_finish_branch_entry, | |
884 | }; | |
885 | ||
886 | const struct hist_iter_ops hist_iter_normal = { | |
887 | .prepare_entry = iter_prepare_normal_entry, | |
888 | .add_single_entry = iter_add_single_normal_entry, | |
889 | .next_entry = iter_next_nop_entry, | |
890 | .add_next_entry = iter_add_next_nop_entry, | |
891 | .finish_entry = iter_finish_normal_entry, | |
892 | }; | |
893 | ||
7a13aa28 NK |
894 | const struct hist_iter_ops hist_iter_cumulative = { |
895 | .prepare_entry = iter_prepare_cumulative_entry, | |
896 | .add_single_entry = iter_add_single_cumulative_entry, | |
897 | .next_entry = iter_next_cumulative_entry, | |
898 | .add_next_entry = iter_add_next_cumulative_entry, | |
899 | .finish_entry = iter_finish_cumulative_entry, | |
900 | }; | |
901 | ||
69bcb019 | 902 | int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al, |
9d3c02d7 | 903 | int max_stack_depth, void *arg) |
69bcb019 NK |
904 | { |
905 | int err, err2; | |
906 | ||
063bd936 NK |
907 | err = sample__resolve_callchain(iter->sample, &iter->parent, |
908 | iter->evsel, al, max_stack_depth); | |
69bcb019 NK |
909 | if (err) |
910 | return err; | |
911 | ||
96b40f3c AH |
912 | iter->max_stack = max_stack_depth; |
913 | ||
69bcb019 NK |
914 | err = iter->ops->prepare_entry(iter, al); |
915 | if (err) | |
916 | goto out; | |
917 | ||
918 | err = iter->ops->add_single_entry(iter, al); | |
919 | if (err) | |
920 | goto out; | |
921 | ||
9d3c02d7 NK |
922 | if (iter->he && iter->add_entry_cb) { |
923 | err = iter->add_entry_cb(iter, al, true, arg); | |
924 | if (err) | |
925 | goto out; | |
926 | } | |
927 | ||
69bcb019 NK |
928 | while (iter->ops->next_entry(iter, al)) { |
929 | err = iter->ops->add_next_entry(iter, al); | |
930 | if (err) | |
931 | break; | |
9d3c02d7 NK |
932 | |
933 | if (iter->he && iter->add_entry_cb) { | |
934 | err = iter->add_entry_cb(iter, al, false, arg); | |
935 | if (err) | |
936 | goto out; | |
937 | } | |
69bcb019 NK |
938 | } |
939 | ||
940 | out: | |
941 | err2 = iter->ops->finish_entry(iter, al); | |
942 | if (!err) | |
943 | err = err2; | |
944 | ||
945 | return err; | |
946 | } | |
947 | ||
3d1d07ec JK |
948 | int64_t |
949 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
950 | { | |
093f0ef3 | 951 | struct perf_hpp_fmt *fmt; |
3d1d07ec JK |
952 | int64_t cmp = 0; |
953 | ||
093f0ef3 | 954 | perf_hpp__for_each_sort_list(fmt) { |
87bbdf76 | 955 | cmp = fmt->cmp(fmt, left, right); |
3d1d07ec JK |
956 | if (cmp) |
957 | break; | |
958 | } | |
959 | ||
960 | return cmp; | |
961 | } | |
962 | ||
963 | int64_t | |
964 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
965 | { | |
093f0ef3 | 966 | struct perf_hpp_fmt *fmt; |
3d1d07ec JK |
967 | int64_t cmp = 0; |
968 | ||
093f0ef3 | 969 | perf_hpp__for_each_sort_list(fmt) { |
87bbdf76 | 970 | cmp = fmt->collapse(fmt, left, right); |
3d1d07ec JK |
971 | if (cmp) |
972 | break; | |
973 | } | |
974 | ||
975 | return cmp; | |
976 | } | |
977 | ||
6733d1bf | 978 | void hist_entry__delete(struct hist_entry *he) |
3d1d07ec | 979 | { |
f3b623b8 | 980 | thread__zput(he->thread); |
5c24b67a ACM |
981 | map__zput(he->ms.map); |
982 | ||
983 | if (he->branch_info) { | |
984 | map__zput(he->branch_info->from.map); | |
985 | map__zput(he->branch_info->to.map); | |
986 | zfree(&he->branch_info); | |
987 | } | |
988 | ||
989 | if (he->mem_info) { | |
990 | map__zput(he->mem_info->iaddr.map); | |
991 | map__zput(he->mem_info->daddr.map); | |
992 | zfree(&he->mem_info); | |
993 | } | |
994 | ||
f8be1c8c | 995 | zfree(&he->stat_acc); |
f048d548 | 996 | free_srcline(he->srcline); |
31191a85 AK |
997 | if (he->srcfile && he->srcfile[0]) |
998 | free(he->srcfile); | |
d114960c | 999 | free_callchain(he->callchain); |
72392834 | 1000 | free(he->raw_data); |
3d1d07ec JK |
1001 | free(he); |
1002 | } | |
1003 | ||
1004 | /* | |
1005 | * collapse the histogram | |
1006 | */ | |
1007 | ||
1d037ca1 | 1008 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
1009 | struct rb_root *root, |
1010 | struct hist_entry *he) | |
3d1d07ec | 1011 | { |
b9bf0892 | 1012 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
1013 | struct rb_node *parent = NULL; |
1014 | struct hist_entry *iter; | |
1015 | int64_t cmp; | |
1016 | ||
1017 | while (*p != NULL) { | |
1018 | parent = *p; | |
1980c2eb | 1019 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
1020 | |
1021 | cmp = hist_entry__collapse(iter, he); | |
1022 | ||
1023 | if (!cmp) { | |
139c0815 | 1024 | he_stat__add_stat(&iter->stat, &he->stat); |
f8be1c8c NK |
1025 | if (symbol_conf.cumulate_callchain) |
1026 | he_stat__add_stat(iter->stat_acc, he->stat_acc); | |
9ec60972 | 1027 | |
1b3a0e95 | 1028 | if (symbol_conf.use_callchain) { |
47260645 NK |
1029 | callchain_cursor_reset(&callchain_cursor); |
1030 | callchain_merge(&callchain_cursor, | |
1031 | iter->callchain, | |
1b3a0e95 FW |
1032 | he->callchain); |
1033 | } | |
6733d1bf | 1034 | hist_entry__delete(he); |
fefb0b94 | 1035 | return false; |
3d1d07ec JK |
1036 | } |
1037 | ||
1038 | if (cmp < 0) | |
1039 | p = &(*p)->rb_left; | |
1040 | else | |
1041 | p = &(*p)->rb_right; | |
1042 | } | |
740b97f9 | 1043 | hists->nr_entries++; |
3d1d07ec | 1044 | |
1980c2eb ACM |
1045 | rb_link_node(&he->rb_node_in, parent, p); |
1046 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 1047 | return true; |
3d1d07ec JK |
1048 | } |
1049 | ||
1980c2eb | 1050 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 1051 | { |
1980c2eb ACM |
1052 | struct rb_root *root; |
1053 | ||
1054 | pthread_mutex_lock(&hists->lock); | |
1055 | ||
1056 | root = hists->entries_in; | |
1057 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
1058 | hists->entries_in = &hists->entries_in_array[0]; | |
1059 | ||
1060 | pthread_mutex_unlock(&hists->lock); | |
1061 | ||
1062 | return root; | |
1063 | } | |
1064 | ||
90cf1fb5 ACM |
1065 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
1066 | { | |
1067 | hists__filter_entry_by_dso(hists, he); | |
1068 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 1069 | hists__filter_entry_by_symbol(hists, he); |
21394d94 | 1070 | hists__filter_entry_by_socket(hists, he); |
90cf1fb5 ACM |
1071 | } |
1072 | ||
c1fb5651 | 1073 | void hists__collapse_resort(struct hists *hists, struct ui_progress *prog) |
1980c2eb ACM |
1074 | { |
1075 | struct rb_root *root; | |
3d1d07ec JK |
1076 | struct rb_node *next; |
1077 | struct hist_entry *n; | |
1078 | ||
3a5714f8 | 1079 | if (!sort__need_collapse) |
3d1d07ec JK |
1080 | return; |
1081 | ||
740b97f9 NK |
1082 | hists->nr_entries = 0; |
1083 | ||
1980c2eb | 1084 | root = hists__get_rotate_entries_in(hists); |
740b97f9 | 1085 | |
1980c2eb | 1086 | next = rb_first(root); |
b9bf0892 | 1087 | |
3d1d07ec | 1088 | while (next) { |
33e940a2 ACM |
1089 | if (session_done()) |
1090 | break; | |
1980c2eb ACM |
1091 | n = rb_entry(next, struct hist_entry, rb_node_in); |
1092 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 1093 | |
1980c2eb | 1094 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
1095 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
1096 | /* | |
1097 | * If it wasn't combined with one of the entries already | |
1098 | * collapsed, we need to apply the filters that may have | |
1099 | * been set by, say, the hist_browser. | |
1100 | */ | |
1101 | hists__apply_filters(hists, n); | |
90cf1fb5 | 1102 | } |
c1fb5651 NK |
1103 | if (prog) |
1104 | ui_progress__update(prog, 1); | |
3d1d07ec | 1105 | } |
1980c2eb | 1106 | } |
b9bf0892 | 1107 | |
043ca389 | 1108 | static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b) |
29d720ed | 1109 | { |
043ca389 NK |
1110 | struct perf_hpp_fmt *fmt; |
1111 | int64_t cmp = 0; | |
29d720ed | 1112 | |
26d8b338 | 1113 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
1114 | if (perf_hpp__should_skip(fmt)) |
1115 | continue; | |
1116 | ||
87bbdf76 | 1117 | cmp = fmt->sort(fmt, a, b); |
043ca389 | 1118 | if (cmp) |
29d720ed NK |
1119 | break; |
1120 | } | |
1121 | ||
043ca389 | 1122 | return cmp; |
29d720ed NK |
1123 | } |
1124 | ||
9283ba9b NK |
1125 | static void hists__reset_filter_stats(struct hists *hists) |
1126 | { | |
1127 | hists->nr_non_filtered_entries = 0; | |
1128 | hists->stats.total_non_filtered_period = 0; | |
1129 | } | |
1130 | ||
1131 | void hists__reset_stats(struct hists *hists) | |
1132 | { | |
1133 | hists->nr_entries = 0; | |
1134 | hists->stats.total_period = 0; | |
1135 | ||
1136 | hists__reset_filter_stats(hists); | |
1137 | } | |
1138 | ||
1139 | static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h) | |
1140 | { | |
1141 | hists->nr_non_filtered_entries++; | |
1142 | hists->stats.total_non_filtered_period += h->stat.period; | |
1143 | } | |
1144 | ||
1145 | void hists__inc_stats(struct hists *hists, struct hist_entry *h) | |
1146 | { | |
1147 | if (!h->filtered) | |
1148 | hists__inc_filter_stats(hists, h); | |
1149 | ||
1150 | hists->nr_entries++; | |
1151 | hists->stats.total_period += h->stat.period; | |
1152 | } | |
1153 | ||
1c02c4d2 ACM |
1154 | static void __hists__insert_output_entry(struct rb_root *entries, |
1155 | struct hist_entry *he, | |
f9db0d0f KL |
1156 | u64 min_callchain_hits, |
1157 | bool use_callchain) | |
3d1d07ec | 1158 | { |
1c02c4d2 | 1159 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
1160 | struct rb_node *parent = NULL; |
1161 | struct hist_entry *iter; | |
1162 | ||
f9db0d0f | 1163 | if (use_callchain) |
b9fb9304 | 1164 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
1165 | min_callchain_hits, &callchain_param); |
1166 | ||
1167 | while (*p != NULL) { | |
1168 | parent = *p; | |
1169 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
1170 | ||
043ca389 | 1171 | if (hist_entry__sort(he, iter) > 0) |
3d1d07ec JK |
1172 | p = &(*p)->rb_left; |
1173 | else | |
1174 | p = &(*p)->rb_right; | |
1175 | } | |
1176 | ||
1177 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 1178 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
1179 | } |
1180 | ||
740b97f9 | 1181 | void hists__output_resort(struct hists *hists, struct ui_progress *prog) |
3d1d07ec | 1182 | { |
1980c2eb | 1183 | struct rb_root *root; |
3d1d07ec JK |
1184 | struct rb_node *next; |
1185 | struct hist_entry *n; | |
3d1d07ec | 1186 | u64 min_callchain_hits; |
f9db0d0f | 1187 | struct perf_evsel *evsel = hists_to_evsel(hists); |
9e207ddf KL |
1188 | bool use_callchain; |
1189 | ||
208e7607 | 1190 | if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph) |
9e207ddf KL |
1191 | use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN; |
1192 | else | |
1193 | use_callchain = symbol_conf.use_callchain; | |
3d1d07ec | 1194 | |
42b28ac0 | 1195 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 1196 | |
3a5714f8 | 1197 | if (sort__need_collapse) |
1980c2eb ACM |
1198 | root = &hists->entries_collapsed; |
1199 | else | |
1200 | root = hists->entries_in; | |
1201 | ||
1202 | next = rb_first(root); | |
1203 | hists->entries = RB_ROOT; | |
3d1d07ec | 1204 | |
9283ba9b | 1205 | hists__reset_stats(hists); |
42b28ac0 | 1206 | hists__reset_col_len(hists); |
fefb0b94 | 1207 | |
3d1d07ec | 1208 | while (next) { |
1980c2eb ACM |
1209 | n = rb_entry(next, struct hist_entry, rb_node_in); |
1210 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 1211 | |
f9db0d0f | 1212 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain); |
6263835a | 1213 | hists__inc_stats(hists, n); |
ae993efc NK |
1214 | |
1215 | if (!n->filtered) | |
1216 | hists__calc_col_len(hists, n); | |
740b97f9 NK |
1217 | |
1218 | if (prog) | |
1219 | ui_progress__update(prog, 1); | |
3d1d07ec | 1220 | } |
1980c2eb | 1221 | } |
b9bf0892 | 1222 | |
42b28ac0 | 1223 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
1224 | enum hist_filter filter) |
1225 | { | |
1226 | h->filtered &= ~(1 << filter); | |
1227 | if (h->filtered) | |
1228 | return; | |
1229 | ||
87e90f43 | 1230 | /* force fold unfiltered entry for simplicity */ |
3698dab1 | 1231 | h->unfolded = false; |
0f0cbf7a | 1232 | h->row_offset = 0; |
a8cd1f43 | 1233 | h->nr_rows = 0; |
9283ba9b | 1234 | |
1ab1fa5d | 1235 | hists->stats.nr_non_filtered_samples += h->stat.nr_events; |
cc5edb0e | 1236 | |
9283ba9b | 1237 | hists__inc_filter_stats(hists, h); |
42b28ac0 | 1238 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
1239 | } |
1240 | ||
90cf1fb5 ACM |
1241 | |
1242 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
1243 | struct hist_entry *he) | |
1244 | { | |
1245 | if (hists->dso_filter != NULL && | |
1246 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
1247 | he->filtered |= (1 << HIST_FILTER__DSO); | |
1248 | return true; | |
1249 | } | |
1250 | ||
1251 | return false; | |
1252 | } | |
1253 | ||
d7b76f09 | 1254 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
1255 | { |
1256 | struct rb_node *nd; | |
1257 | ||
1ab1fa5d | 1258 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1259 | |
1260 | hists__reset_filter_stats(hists); | |
42b28ac0 | 1261 | hists__reset_col_len(hists); |
b09e0190 | 1262 | |
42b28ac0 | 1263 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
1264 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
1265 | ||
1266 | if (symbol_conf.exclude_other && !h->parent) | |
1267 | continue; | |
1268 | ||
90cf1fb5 | 1269 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 1270 | continue; |
b09e0190 | 1271 | |
42b28ac0 | 1272 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
1273 | } |
1274 | } | |
1275 | ||
90cf1fb5 ACM |
1276 | static bool hists__filter_entry_by_thread(struct hists *hists, |
1277 | struct hist_entry *he) | |
1278 | { | |
1279 | if (hists->thread_filter != NULL && | |
1280 | he->thread != hists->thread_filter) { | |
1281 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
1282 | return true; | |
1283 | } | |
1284 | ||
1285 | return false; | |
1286 | } | |
1287 | ||
d7b76f09 | 1288 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
1289 | { |
1290 | struct rb_node *nd; | |
1291 | ||
1ab1fa5d | 1292 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1293 | |
1294 | hists__reset_filter_stats(hists); | |
42b28ac0 | 1295 | hists__reset_col_len(hists); |
b09e0190 | 1296 | |
42b28ac0 | 1297 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
1298 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
1299 | ||
90cf1fb5 | 1300 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 1301 | continue; |
cc5edb0e | 1302 | |
42b28ac0 | 1303 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
1304 | } |
1305 | } | |
ef7b93a1 | 1306 | |
e94d53eb NK |
1307 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
1308 | struct hist_entry *he) | |
1309 | { | |
1310 | if (hists->symbol_filter_str != NULL && | |
1311 | (!he->ms.sym || strstr(he->ms.sym->name, | |
1312 | hists->symbol_filter_str) == NULL)) { | |
1313 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
1314 | return true; | |
1315 | } | |
1316 | ||
1317 | return false; | |
1318 | } | |
1319 | ||
1320 | void hists__filter_by_symbol(struct hists *hists) | |
1321 | { | |
1322 | struct rb_node *nd; | |
1323 | ||
1ab1fa5d | 1324 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1325 | |
1326 | hists__reset_filter_stats(hists); | |
e94d53eb NK |
1327 | hists__reset_col_len(hists); |
1328 | ||
1329 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
1330 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
1331 | ||
1332 | if (hists__filter_entry_by_symbol(hists, h)) | |
1333 | continue; | |
1334 | ||
1335 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
1336 | } | |
1337 | } | |
1338 | ||
21394d94 KL |
1339 | static bool hists__filter_entry_by_socket(struct hists *hists, |
1340 | struct hist_entry *he) | |
1341 | { | |
1342 | if ((hists->socket_filter > -1) && | |
1343 | (he->socket != hists->socket_filter)) { | |
1344 | he->filtered |= (1 << HIST_FILTER__SOCKET); | |
1345 | return true; | |
1346 | } | |
1347 | ||
1348 | return false; | |
1349 | } | |
1350 | ||
84734b06 KL |
1351 | void hists__filter_by_socket(struct hists *hists) |
1352 | { | |
1353 | struct rb_node *nd; | |
1354 | ||
1355 | hists->stats.nr_non_filtered_samples = 0; | |
1356 | ||
1357 | hists__reset_filter_stats(hists); | |
1358 | hists__reset_col_len(hists); | |
1359 | ||
1360 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
1361 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
1362 | ||
1363 | if (hists__filter_entry_by_socket(hists, h)) | |
1364 | continue; | |
1365 | ||
1366 | hists__remove_entry_filter(hists, h, HIST_FILTER__SOCKET); | |
1367 | } | |
1368 | } | |
1369 | ||
28a6b6aa ACM |
1370 | void events_stats__inc(struct events_stats *stats, u32 type) |
1371 | { | |
1372 | ++stats->nr_events[0]; | |
1373 | ++stats->nr_events[type]; | |
1374 | } | |
1375 | ||
42b28ac0 | 1376 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 1377 | { |
28a6b6aa | 1378 | events_stats__inc(&hists->stats, type); |
c8446b9b | 1379 | } |
95529be4 | 1380 | |
1844dbcb NK |
1381 | void hists__inc_nr_samples(struct hists *hists, bool filtered) |
1382 | { | |
1383 | events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE); | |
1384 | if (!filtered) | |
1385 | hists->stats.nr_non_filtered_samples++; | |
1386 | } | |
1387 | ||
494d70a1 ACM |
1388 | static struct hist_entry *hists__add_dummy_entry(struct hists *hists, |
1389 | struct hist_entry *pair) | |
1390 | { | |
ce74f60e NK |
1391 | struct rb_root *root; |
1392 | struct rb_node **p; | |
494d70a1 ACM |
1393 | struct rb_node *parent = NULL; |
1394 | struct hist_entry *he; | |
354cc40e | 1395 | int64_t cmp; |
494d70a1 | 1396 | |
ce74f60e NK |
1397 | if (sort__need_collapse) |
1398 | root = &hists->entries_collapsed; | |
1399 | else | |
1400 | root = hists->entries_in; | |
1401 | ||
1402 | p = &root->rb_node; | |
1403 | ||
494d70a1 ACM |
1404 | while (*p != NULL) { |
1405 | parent = *p; | |
ce74f60e | 1406 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
494d70a1 | 1407 | |
ce74f60e | 1408 | cmp = hist_entry__collapse(he, pair); |
494d70a1 ACM |
1409 | |
1410 | if (!cmp) | |
1411 | goto out; | |
1412 | ||
1413 | if (cmp < 0) | |
1414 | p = &(*p)->rb_left; | |
1415 | else | |
1416 | p = &(*p)->rb_right; | |
1417 | } | |
1418 | ||
a0b51af3 | 1419 | he = hist_entry__new(pair, true); |
494d70a1 | 1420 | if (he) { |
30193d78 ACM |
1421 | memset(&he->stat, 0, sizeof(he->stat)); |
1422 | he->hists = hists; | |
ce74f60e NK |
1423 | rb_link_node(&he->rb_node_in, parent, p); |
1424 | rb_insert_color(&he->rb_node_in, root); | |
6263835a | 1425 | hists__inc_stats(hists, he); |
e0af43d2 | 1426 | he->dummy = true; |
494d70a1 ACM |
1427 | } |
1428 | out: | |
1429 | return he; | |
1430 | } | |
1431 | ||
95529be4 ACM |
1432 | static struct hist_entry *hists__find_entry(struct hists *hists, |
1433 | struct hist_entry *he) | |
1434 | { | |
ce74f60e NK |
1435 | struct rb_node *n; |
1436 | ||
1437 | if (sort__need_collapse) | |
1438 | n = hists->entries_collapsed.rb_node; | |
1439 | else | |
1440 | n = hists->entries_in->rb_node; | |
95529be4 ACM |
1441 | |
1442 | while (n) { | |
ce74f60e NK |
1443 | struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); |
1444 | int64_t cmp = hist_entry__collapse(iter, he); | |
95529be4 ACM |
1445 | |
1446 | if (cmp < 0) | |
1447 | n = n->rb_left; | |
1448 | else if (cmp > 0) | |
1449 | n = n->rb_right; | |
1450 | else | |
1451 | return iter; | |
1452 | } | |
1453 | ||
1454 | return NULL; | |
1455 | } | |
1456 | ||
1457 | /* | |
1458 | * Look for pairs to link to the leader buckets (hist_entries): | |
1459 | */ | |
1460 | void hists__match(struct hists *leader, struct hists *other) | |
1461 | { | |
ce74f60e | 1462 | struct rb_root *root; |
95529be4 ACM |
1463 | struct rb_node *nd; |
1464 | struct hist_entry *pos, *pair; | |
1465 | ||
ce74f60e NK |
1466 | if (sort__need_collapse) |
1467 | root = &leader->entries_collapsed; | |
1468 | else | |
1469 | root = leader->entries_in; | |
1470 | ||
1471 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
1472 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
95529be4 ACM |
1473 | pair = hists__find_entry(other, pos); |
1474 | ||
1475 | if (pair) | |
5fa9041b | 1476 | hist_entry__add_pair(pair, pos); |
95529be4 ACM |
1477 | } |
1478 | } | |
494d70a1 ACM |
1479 | |
1480 | /* | |
1481 | * Look for entries in the other hists that are not present in the leader, if | |
1482 | * we find them, just add a dummy entry on the leader hists, with period=0, | |
1483 | * nr_events=0, to serve as the list header. | |
1484 | */ | |
1485 | int hists__link(struct hists *leader, struct hists *other) | |
1486 | { | |
ce74f60e | 1487 | struct rb_root *root; |
494d70a1 ACM |
1488 | struct rb_node *nd; |
1489 | struct hist_entry *pos, *pair; | |
1490 | ||
ce74f60e NK |
1491 | if (sort__need_collapse) |
1492 | root = &other->entries_collapsed; | |
1493 | else | |
1494 | root = other->entries_in; | |
1495 | ||
1496 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
1497 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
494d70a1 ACM |
1498 | |
1499 | if (!hist_entry__has_pairs(pos)) { | |
1500 | pair = hists__add_dummy_entry(leader, pos); | |
1501 | if (pair == NULL) | |
1502 | return -1; | |
5fa9041b | 1503 | hist_entry__add_pair(pos, pair); |
494d70a1 ACM |
1504 | } |
1505 | } | |
1506 | ||
1507 | return 0; | |
1508 | } | |
f2148330 | 1509 | |
57849998 AK |
1510 | void hist__account_cycles(struct branch_stack *bs, struct addr_location *al, |
1511 | struct perf_sample *sample, bool nonany_branch_mode) | |
1512 | { | |
1513 | struct branch_info *bi; | |
1514 | ||
1515 | /* If we have branch cycles always annotate them. */ | |
1516 | if (bs && bs->nr && bs->entries[0].flags.cycles) { | |
1517 | int i; | |
1518 | ||
1519 | bi = sample__resolve_bstack(sample, al); | |
1520 | if (bi) { | |
1521 | struct addr_map_symbol *prev = NULL; | |
1522 | ||
1523 | /* | |
1524 | * Ignore errors, still want to process the | |
1525 | * other entries. | |
1526 | * | |
1527 | * For non standard branch modes always | |
1528 | * force no IPC (prev == NULL) | |
1529 | * | |
1530 | * Note that perf stores branches reversed from | |
1531 | * program order! | |
1532 | */ | |
1533 | for (i = bs->nr - 1; i >= 0; i--) { | |
1534 | addr_map_symbol__account_cycles(&bi[i].from, | |
1535 | nonany_branch_mode ? NULL : prev, | |
1536 | bi[i].flags.cycles); | |
1537 | prev = &bi[i].to; | |
1538 | } | |
1539 | free(bi); | |
1540 | } | |
1541 | } | |
1542 | } | |
2a1731fb ACM |
1543 | |
1544 | size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp) | |
1545 | { | |
1546 | struct perf_evsel *pos; | |
1547 | size_t ret = 0; | |
1548 | ||
1549 | evlist__for_each(evlist, pos) { | |
1550 | ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos)); | |
1551 | ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp); | |
1552 | } | |
1553 | ||
1554 | return ret; | |
1555 | } | |
1556 | ||
1557 | ||
f2148330 NK |
1558 | u64 hists__total_period(struct hists *hists) |
1559 | { | |
1560 | return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period : | |
1561 | hists->stats.total_period; | |
1562 | } | |
33db4568 NK |
1563 | |
1564 | int parse_filter_percentage(const struct option *opt __maybe_unused, | |
1565 | const char *arg, int unset __maybe_unused) | |
1566 | { | |
1567 | if (!strcmp(arg, "relative")) | |
1568 | symbol_conf.filter_relative = true; | |
1569 | else if (!strcmp(arg, "absolute")) | |
1570 | symbol_conf.filter_relative = false; | |
1571 | else | |
1572 | return -1; | |
1573 | ||
1574 | return 0; | |
1575 | } | |
0b93da17 NK |
1576 | |
1577 | int perf_hist_config(const char *var, const char *value) | |
1578 | { | |
1579 | if (!strcmp(var, "hist.percentage")) | |
1580 | return parse_filter_percentage(NULL, value, 0); | |
1581 | ||
1582 | return 0; | |
1583 | } | |
a635fc51 ACM |
1584 | |
1585 | static int hists_evsel__init(struct perf_evsel *evsel) | |
1586 | { | |
1587 | struct hists *hists = evsel__hists(evsel); | |
1588 | ||
1589 | memset(hists, 0, sizeof(*hists)); | |
1590 | hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT; | |
1591 | hists->entries_in = &hists->entries_in_array[0]; | |
1592 | hists->entries_collapsed = RB_ROOT; | |
1593 | hists->entries = RB_ROOT; | |
1594 | pthread_mutex_init(&hists->lock, NULL); | |
21394d94 | 1595 | hists->socket_filter = -1; |
a635fc51 ACM |
1596 | return 0; |
1597 | } | |
1598 | ||
61fa0e94 NK |
1599 | static void hists__delete_remaining_entries(struct rb_root *root) |
1600 | { | |
1601 | struct rb_node *node; | |
1602 | struct hist_entry *he; | |
1603 | ||
1604 | while (!RB_EMPTY_ROOT(root)) { | |
1605 | node = rb_first(root); | |
1606 | rb_erase(node, root); | |
1607 | ||
1608 | he = rb_entry(node, struct hist_entry, rb_node_in); | |
1609 | hist_entry__delete(he); | |
1610 | } | |
1611 | } | |
1612 | ||
1613 | static void hists__delete_all_entries(struct hists *hists) | |
1614 | { | |
1615 | hists__delete_entries(hists); | |
1616 | hists__delete_remaining_entries(&hists->entries_in_array[0]); | |
1617 | hists__delete_remaining_entries(&hists->entries_in_array[1]); | |
1618 | hists__delete_remaining_entries(&hists->entries_collapsed); | |
1619 | } | |
1620 | ||
17577dec MH |
1621 | static void hists_evsel__exit(struct perf_evsel *evsel) |
1622 | { | |
1623 | struct hists *hists = evsel__hists(evsel); | |
1624 | ||
61fa0e94 | 1625 | hists__delete_all_entries(hists); |
17577dec MH |
1626 | } |
1627 | ||
a635fc51 ACM |
1628 | /* |
1629 | * XXX We probably need a hists_evsel__exit() to free the hist_entries | |
1630 | * stored in the rbtree... | |
1631 | */ | |
1632 | ||
1633 | int hists__init(void) | |
1634 | { | |
1635 | int err = perf_evsel__object_config(sizeof(struct hists_evsel), | |
17577dec MH |
1636 | hists_evsel__init, |
1637 | hists_evsel__exit); | |
a635fc51 ACM |
1638 | if (err) |
1639 | fputs("FATAL ERROR: Couldn't setup hists class\n", stderr); | |
1640 | ||
1641 | return err; | |
1642 | } |