]>
Commit | Line | Data |
---|---|---|
78f7defe | 1 | #include "annotate.h" |
8a0ecfb8 | 2 | #include "util.h" |
598357eb | 3 | #include "build-id.h" |
3d1d07ec | 4 | #include "hist.h" |
4e4f06e4 ACM |
5 | #include "session.h" |
6 | #include "sort.h" | |
9b33827d | 7 | #include <math.h> |
3d1d07ec | 8 | |
90cf1fb5 ACM |
9 | static bool hists__filter_entry_by_dso(struct hists *hists, |
10 | struct hist_entry *he); | |
11 | static bool hists__filter_entry_by_thread(struct hists *hists, | |
12 | struct hist_entry *he); | |
e94d53eb NK |
13 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
14 | struct hist_entry *he); | |
90cf1fb5 | 15 | |
7a007ca9 ACM |
16 | enum hist_filter { |
17 | HIST_FILTER__DSO, | |
18 | HIST_FILTER__THREAD, | |
19 | HIST_FILTER__PARENT, | |
e94d53eb | 20 | HIST_FILTER__SYMBOL, |
7a007ca9 ACM |
21 | }; |
22 | ||
3d1d07ec JK |
23 | struct callchain_param callchain_param = { |
24 | .mode = CHAIN_GRAPH_REL, | |
d797fdc5 SL |
25 | .min_percent = 0.5, |
26 | .order = ORDER_CALLEE | |
3d1d07ec JK |
27 | }; |
28 | ||
42b28ac0 | 29 | u16 hists__col_len(struct hists *hists, enum hist_column col) |
8a6c5b26 | 30 | { |
42b28ac0 | 31 | return hists->col_len[col]; |
8a6c5b26 ACM |
32 | } |
33 | ||
42b28ac0 | 34 | void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 35 | { |
42b28ac0 | 36 | hists->col_len[col] = len; |
8a6c5b26 ACM |
37 | } |
38 | ||
42b28ac0 | 39 | bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 40 | { |
42b28ac0 ACM |
41 | if (len > hists__col_len(hists, col)) { |
42 | hists__set_col_len(hists, col, len); | |
8a6c5b26 ACM |
43 | return true; |
44 | } | |
45 | return false; | |
46 | } | |
47 | ||
7ccf4f90 | 48 | void hists__reset_col_len(struct hists *hists) |
8a6c5b26 ACM |
49 | { |
50 | enum hist_column col; | |
51 | ||
52 | for (col = 0; col < HISTC_NR_COLS; ++col) | |
42b28ac0 | 53 | hists__set_col_len(hists, col, 0); |
8a6c5b26 ACM |
54 | } |
55 | ||
b5387528 RAV |
56 | static void hists__set_unres_dso_col_len(struct hists *hists, int dso) |
57 | { | |
58 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; | |
59 | ||
60 | if (hists__col_len(hists, dso) < unresolved_col_width && | |
61 | !symbol_conf.col_width_list_str && !symbol_conf.field_sep && | |
62 | !symbol_conf.dso_list) | |
63 | hists__set_col_len(hists, dso, unresolved_col_width); | |
64 | } | |
65 | ||
7ccf4f90 | 66 | void hists__calc_col_len(struct hists *hists, struct hist_entry *h) |
8a6c5b26 | 67 | { |
b5387528 | 68 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; |
8a6c5b26 ACM |
69 | u16 len; |
70 | ||
71 | if (h->ms.sym) | |
b5387528 RAV |
72 | hists__new_col_len(hists, HISTC_SYMBOL, h->ms.sym->namelen + 4); |
73 | else | |
74 | hists__set_unres_dso_col_len(hists, HISTC_DSO); | |
8a6c5b26 ACM |
75 | |
76 | len = thread__comm_len(h->thread); | |
42b28ac0 ACM |
77 | if (hists__new_col_len(hists, HISTC_COMM, len)) |
78 | hists__set_col_len(hists, HISTC_THREAD, len + 6); | |
8a6c5b26 ACM |
79 | |
80 | if (h->ms.map) { | |
81 | len = dso__name_len(h->ms.map->dso); | |
42b28ac0 | 82 | hists__new_col_len(hists, HISTC_DSO, len); |
8a6c5b26 | 83 | } |
b5387528 RAV |
84 | |
85 | if (h->branch_info) { | |
86 | int symlen; | |
87 | /* | |
88 | * +4 accounts for '[x] ' priv level info | |
89 | * +2 account of 0x prefix on raw addresses | |
90 | */ | |
91 | if (h->branch_info->from.sym) { | |
92 | symlen = (int)h->branch_info->from.sym->namelen + 4; | |
93 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); | |
94 | ||
95 | symlen = dso__name_len(h->branch_info->from.map->dso); | |
96 | hists__new_col_len(hists, HISTC_DSO_FROM, symlen); | |
97 | } else { | |
98 | symlen = unresolved_col_width + 4 + 2; | |
99 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); | |
100 | hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM); | |
101 | } | |
102 | ||
103 | if (h->branch_info->to.sym) { | |
104 | symlen = (int)h->branch_info->to.sym->namelen + 4; | |
105 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); | |
106 | ||
107 | symlen = dso__name_len(h->branch_info->to.map->dso); | |
108 | hists__new_col_len(hists, HISTC_DSO_TO, symlen); | |
109 | } else { | |
110 | symlen = unresolved_col_width + 4 + 2; | |
111 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); | |
112 | hists__set_unres_dso_col_len(hists, HISTC_DSO_TO); | |
113 | } | |
114 | } | |
8a6c5b26 ACM |
115 | } |
116 | ||
7ccf4f90 NK |
117 | void hists__output_recalc_col_len(struct hists *hists, int max_rows) |
118 | { | |
119 | struct rb_node *next = rb_first(&hists->entries); | |
120 | struct hist_entry *n; | |
121 | int row = 0; | |
122 | ||
123 | hists__reset_col_len(hists); | |
124 | ||
125 | while (next && row++ < max_rows) { | |
126 | n = rb_entry(next, struct hist_entry, rb_node); | |
127 | if (!n->filtered) | |
128 | hists__calc_col_len(hists, n); | |
129 | next = rb_next(&n->rb_node); | |
130 | } | |
131 | } | |
132 | ||
12c14278 | 133 | static void hist_entry__add_cpumode_period(struct hist_entry *he, |
c82ee828 | 134 | unsigned int cpumode, u64 period) |
a1645ce1 | 135 | { |
28e2a106 | 136 | switch (cpumode) { |
a1645ce1 | 137 | case PERF_RECORD_MISC_KERNEL: |
12c14278 | 138 | he->period_sys += period; |
a1645ce1 ZY |
139 | break; |
140 | case PERF_RECORD_MISC_USER: | |
12c14278 | 141 | he->period_us += period; |
a1645ce1 ZY |
142 | break; |
143 | case PERF_RECORD_MISC_GUEST_KERNEL: | |
12c14278 | 144 | he->period_guest_sys += period; |
a1645ce1 ZY |
145 | break; |
146 | case PERF_RECORD_MISC_GUEST_USER: | |
12c14278 | 147 | he->period_guest_us += period; |
a1645ce1 ZY |
148 | break; |
149 | default: | |
150 | break; | |
151 | } | |
152 | } | |
153 | ||
ab81f3fd ACM |
154 | static void hist_entry__decay(struct hist_entry *he) |
155 | { | |
156 | he->period = (he->period * 7) / 8; | |
157 | he->nr_events = (he->nr_events * 7) / 8; | |
158 | } | |
159 | ||
160 | static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) | |
161 | { | |
c64550cf ACM |
162 | u64 prev_period = he->period; |
163 | ||
164 | if (prev_period == 0) | |
df71d95f | 165 | return true; |
c64550cf | 166 | |
ab81f3fd | 167 | hist_entry__decay(he); |
c64550cf ACM |
168 | |
169 | if (!he->filtered) | |
170 | hists->stats.total_period -= prev_period - he->period; | |
171 | ||
ab81f3fd ACM |
172 | return he->period == 0; |
173 | } | |
174 | ||
b079d4e9 ACM |
175 | static void __hists__decay_entries(struct hists *hists, bool zap_user, |
176 | bool zap_kernel, bool threaded) | |
ab81f3fd ACM |
177 | { |
178 | struct rb_node *next = rb_first(&hists->entries); | |
179 | struct hist_entry *n; | |
180 | ||
181 | while (next) { | |
182 | n = rb_entry(next, struct hist_entry, rb_node); | |
183 | next = rb_next(&n->rb_node); | |
df71d95f ACM |
184 | /* |
185 | * We may be annotating this, for instance, so keep it here in | |
186 | * case some it gets new samples, we'll eventually free it when | |
187 | * the user stops browsing and it agains gets fully decayed. | |
188 | */ | |
b079d4e9 ACM |
189 | if (((zap_user && n->level == '.') || |
190 | (zap_kernel && n->level != '.') || | |
191 | hists__decay_entry(hists, n)) && | |
192 | !n->used) { | |
ab81f3fd ACM |
193 | rb_erase(&n->rb_node, &hists->entries); |
194 | ||
e345fa18 | 195 | if (sort__need_collapse || threaded) |
ab81f3fd ACM |
196 | rb_erase(&n->rb_node_in, &hists->entries_collapsed); |
197 | ||
198 | hist_entry__free(n); | |
199 | --hists->nr_entries; | |
200 | } | |
201 | } | |
202 | } | |
203 | ||
b079d4e9 | 204 | void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel) |
e345fa18 | 205 | { |
b079d4e9 | 206 | return __hists__decay_entries(hists, zap_user, zap_kernel, false); |
e345fa18 ACM |
207 | } |
208 | ||
b079d4e9 ACM |
209 | void hists__decay_entries_threaded(struct hists *hists, |
210 | bool zap_user, bool zap_kernel) | |
e345fa18 | 211 | { |
b079d4e9 | 212 | return __hists__decay_entries(hists, zap_user, zap_kernel, true); |
e345fa18 ACM |
213 | } |
214 | ||
3d1d07ec | 215 | /* |
c82ee828 | 216 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
217 | */ |
218 | ||
28e2a106 ACM |
219 | static struct hist_entry *hist_entry__new(struct hist_entry *template) |
220 | { | |
d2009c51 | 221 | size_t callchain_size = symbol_conf.use_callchain ? sizeof(struct callchain_root) : 0; |
12c14278 | 222 | struct hist_entry *he = malloc(sizeof(*he) + callchain_size); |
28e2a106 | 223 | |
12c14278 ACM |
224 | if (he != NULL) { |
225 | *he = *template; | |
226 | he->nr_events = 1; | |
227 | if (he->ms.map) | |
228 | he->ms.map->referenced = true; | |
28e2a106 | 229 | if (symbol_conf.use_callchain) |
12c14278 | 230 | callchain_init(he->callchain); |
28e2a106 ACM |
231 | } |
232 | ||
12c14278 | 233 | return he; |
28e2a106 ACM |
234 | } |
235 | ||
42b28ac0 | 236 | static void hists__inc_nr_entries(struct hists *hists, struct hist_entry *h) |
fefb0b94 | 237 | { |
8a6c5b26 | 238 | if (!h->filtered) { |
42b28ac0 ACM |
239 | hists__calc_col_len(hists, h); |
240 | ++hists->nr_entries; | |
1980c2eb | 241 | hists->stats.total_period += h->period; |
8a6c5b26 | 242 | } |
fefb0b94 ACM |
243 | } |
244 | ||
7a007ca9 ACM |
245 | static u8 symbol__parent_filter(const struct symbol *parent) |
246 | { | |
247 | if (symbol_conf.exclude_other && parent == NULL) | |
248 | return 1 << HIST_FILTER__PARENT; | |
249 | return 0; | |
250 | } | |
251 | ||
b5387528 RAV |
252 | static struct hist_entry *add_hist_entry(struct hists *hists, |
253 | struct hist_entry *entry, | |
1c02c4d2 | 254 | struct addr_location *al, |
b5387528 | 255 | u64 period) |
9735abf1 | 256 | { |
1980c2eb | 257 | struct rb_node **p; |
9735abf1 ACM |
258 | struct rb_node *parent = NULL; |
259 | struct hist_entry *he; | |
9735abf1 ACM |
260 | int cmp; |
261 | ||
1980c2eb ACM |
262 | pthread_mutex_lock(&hists->lock); |
263 | ||
264 | p = &hists->entries_in->rb_node; | |
265 | ||
9735abf1 ACM |
266 | while (*p != NULL) { |
267 | parent = *p; | |
1980c2eb | 268 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 269 | |
b5387528 | 270 | cmp = hist_entry__cmp(entry, he); |
9735abf1 ACM |
271 | |
272 | if (!cmp) { | |
c82ee828 ACM |
273 | he->period += period; |
274 | ++he->nr_events; | |
63fa471d DM |
275 | |
276 | /* If the map of an existing hist_entry has | |
277 | * become out-of-date due to an exec() or | |
278 | * similar, update it. Otherwise we will | |
279 | * mis-adjust symbol addresses when computing | |
280 | * the history counter to increment. | |
281 | */ | |
282 | if (he->ms.map != entry->ms.map) { | |
283 | he->ms.map = entry->ms.map; | |
284 | if (he->ms.map) | |
285 | he->ms.map->referenced = true; | |
286 | } | |
28e2a106 | 287 | goto out; |
9735abf1 ACM |
288 | } |
289 | ||
290 | if (cmp < 0) | |
291 | p = &(*p)->rb_left; | |
292 | else | |
293 | p = &(*p)->rb_right; | |
294 | } | |
295 | ||
b5387528 | 296 | he = hist_entry__new(entry); |
9735abf1 | 297 | if (!he) |
1980c2eb ACM |
298 | goto out_unlock; |
299 | ||
300 | rb_link_node(&he->rb_node_in, parent, p); | |
301 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 302 | out: |
c82ee828 | 303 | hist_entry__add_cpumode_period(he, al->cpumode, period); |
1980c2eb ACM |
304 | out_unlock: |
305 | pthread_mutex_unlock(&hists->lock); | |
9735abf1 ACM |
306 | return he; |
307 | } | |
308 | ||
b5387528 RAV |
309 | struct hist_entry *__hists__add_branch_entry(struct hists *self, |
310 | struct addr_location *al, | |
311 | struct symbol *sym_parent, | |
312 | struct branch_info *bi, | |
313 | u64 period) | |
314 | { | |
315 | struct hist_entry entry = { | |
316 | .thread = al->thread, | |
317 | .ms = { | |
318 | .map = bi->to.map, | |
319 | .sym = bi->to.sym, | |
320 | }, | |
321 | .cpu = al->cpu, | |
322 | .ip = bi->to.addr, | |
323 | .level = al->level, | |
324 | .period = period, | |
325 | .parent = sym_parent, | |
326 | .filtered = symbol__parent_filter(sym_parent), | |
327 | .branch_info = bi, | |
ae359f19 | 328 | .hists = self, |
b5387528 RAV |
329 | }; |
330 | ||
331 | return add_hist_entry(self, &entry, al, period); | |
332 | } | |
333 | ||
334 | struct hist_entry *__hists__add_entry(struct hists *self, | |
335 | struct addr_location *al, | |
336 | struct symbol *sym_parent, u64 period) | |
337 | { | |
338 | struct hist_entry entry = { | |
339 | .thread = al->thread, | |
340 | .ms = { | |
341 | .map = al->map, | |
342 | .sym = al->sym, | |
343 | }, | |
344 | .cpu = al->cpu, | |
345 | .ip = al->addr, | |
346 | .level = al->level, | |
347 | .period = period, | |
348 | .parent = sym_parent, | |
349 | .filtered = symbol__parent_filter(sym_parent), | |
ae359f19 | 350 | .hists = self, |
b5387528 RAV |
351 | }; |
352 | ||
353 | return add_hist_entry(self, &entry, al, period); | |
354 | } | |
355 | ||
3d1d07ec JK |
356 | int64_t |
357 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
358 | { | |
359 | struct sort_entry *se; | |
360 | int64_t cmp = 0; | |
361 | ||
362 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
fcd14984 | 363 | cmp = se->se_cmp(left, right); |
3d1d07ec JK |
364 | if (cmp) |
365 | break; | |
366 | } | |
367 | ||
368 | return cmp; | |
369 | } | |
370 | ||
371 | int64_t | |
372 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
373 | { | |
374 | struct sort_entry *se; | |
375 | int64_t cmp = 0; | |
376 | ||
377 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
378 | int64_t (*f)(struct hist_entry *, struct hist_entry *); | |
379 | ||
fcd14984 | 380 | f = se->se_collapse ?: se->se_cmp; |
3d1d07ec JK |
381 | |
382 | cmp = f(left, right); | |
383 | if (cmp) | |
384 | break; | |
385 | } | |
386 | ||
387 | return cmp; | |
388 | } | |
389 | ||
390 | void hist_entry__free(struct hist_entry *he) | |
391 | { | |
392 | free(he); | |
393 | } | |
394 | ||
395 | /* | |
396 | * collapse the histogram | |
397 | */ | |
398 | ||
1d037ca1 | 399 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
400 | struct rb_root *root, |
401 | struct hist_entry *he) | |
3d1d07ec | 402 | { |
b9bf0892 | 403 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
404 | struct rb_node *parent = NULL; |
405 | struct hist_entry *iter; | |
406 | int64_t cmp; | |
407 | ||
408 | while (*p != NULL) { | |
409 | parent = *p; | |
1980c2eb | 410 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
411 | |
412 | cmp = hist_entry__collapse(iter, he); | |
413 | ||
414 | if (!cmp) { | |
9ec60972 NK |
415 | iter->period += he->period; |
416 | iter->period_sys += he->period_sys; | |
417 | iter->period_us += he->period_us; | |
418 | iter->period_guest_sys += he->period_guest_sys; | |
419 | iter->period_guest_us += he->period_guest_us; | |
420 | iter->nr_events += he->nr_events; | |
421 | ||
1b3a0e95 | 422 | if (symbol_conf.use_callchain) { |
47260645 NK |
423 | callchain_cursor_reset(&callchain_cursor); |
424 | callchain_merge(&callchain_cursor, | |
425 | iter->callchain, | |
1b3a0e95 FW |
426 | he->callchain); |
427 | } | |
3d1d07ec | 428 | hist_entry__free(he); |
fefb0b94 | 429 | return false; |
3d1d07ec JK |
430 | } |
431 | ||
432 | if (cmp < 0) | |
433 | p = &(*p)->rb_left; | |
434 | else | |
435 | p = &(*p)->rb_right; | |
436 | } | |
437 | ||
1980c2eb ACM |
438 | rb_link_node(&he->rb_node_in, parent, p); |
439 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 440 | return true; |
3d1d07ec JK |
441 | } |
442 | ||
1980c2eb | 443 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 444 | { |
1980c2eb ACM |
445 | struct rb_root *root; |
446 | ||
447 | pthread_mutex_lock(&hists->lock); | |
448 | ||
449 | root = hists->entries_in; | |
450 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
451 | hists->entries_in = &hists->entries_in_array[0]; | |
452 | ||
453 | pthread_mutex_unlock(&hists->lock); | |
454 | ||
455 | return root; | |
456 | } | |
457 | ||
90cf1fb5 ACM |
458 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
459 | { | |
460 | hists__filter_entry_by_dso(hists, he); | |
461 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 462 | hists__filter_entry_by_symbol(hists, he); |
90cf1fb5 ACM |
463 | } |
464 | ||
1980c2eb ACM |
465 | static void __hists__collapse_resort(struct hists *hists, bool threaded) |
466 | { | |
467 | struct rb_root *root; | |
3d1d07ec JK |
468 | struct rb_node *next; |
469 | struct hist_entry *n; | |
470 | ||
1980c2eb | 471 | if (!sort__need_collapse && !threaded) |
3d1d07ec JK |
472 | return; |
473 | ||
1980c2eb ACM |
474 | root = hists__get_rotate_entries_in(hists); |
475 | next = rb_first(root); | |
b9bf0892 | 476 | |
3d1d07ec | 477 | while (next) { |
1980c2eb ACM |
478 | n = rb_entry(next, struct hist_entry, rb_node_in); |
479 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 480 | |
1980c2eb | 481 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
482 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
483 | /* | |
484 | * If it wasn't combined with one of the entries already | |
485 | * collapsed, we need to apply the filters that may have | |
486 | * been set by, say, the hist_browser. | |
487 | */ | |
488 | hists__apply_filters(hists, n); | |
90cf1fb5 | 489 | } |
3d1d07ec | 490 | } |
1980c2eb | 491 | } |
b9bf0892 | 492 | |
1980c2eb ACM |
493 | void hists__collapse_resort(struct hists *hists) |
494 | { | |
495 | return __hists__collapse_resort(hists, false); | |
496 | } | |
497 | ||
498 | void hists__collapse_resort_threaded(struct hists *hists) | |
499 | { | |
500 | return __hists__collapse_resort(hists, true); | |
3d1d07ec JK |
501 | } |
502 | ||
503 | /* | |
c82ee828 | 504 | * reverse the map, sort on period. |
3d1d07ec JK |
505 | */ |
506 | ||
1c02c4d2 ACM |
507 | static void __hists__insert_output_entry(struct rb_root *entries, |
508 | struct hist_entry *he, | |
509 | u64 min_callchain_hits) | |
3d1d07ec | 510 | { |
1c02c4d2 | 511 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
512 | struct rb_node *parent = NULL; |
513 | struct hist_entry *iter; | |
514 | ||
d599db3f | 515 | if (symbol_conf.use_callchain) |
b9fb9304 | 516 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
517 | min_callchain_hits, &callchain_param); |
518 | ||
519 | while (*p != NULL) { | |
520 | parent = *p; | |
521 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
522 | ||
c82ee828 | 523 | if (he->period > iter->period) |
3d1d07ec JK |
524 | p = &(*p)->rb_left; |
525 | else | |
526 | p = &(*p)->rb_right; | |
527 | } | |
528 | ||
529 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 530 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
531 | } |
532 | ||
1980c2eb | 533 | static void __hists__output_resort(struct hists *hists, bool threaded) |
3d1d07ec | 534 | { |
1980c2eb | 535 | struct rb_root *root; |
3d1d07ec JK |
536 | struct rb_node *next; |
537 | struct hist_entry *n; | |
3d1d07ec JK |
538 | u64 min_callchain_hits; |
539 | ||
42b28ac0 | 540 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 541 | |
1980c2eb ACM |
542 | if (sort__need_collapse || threaded) |
543 | root = &hists->entries_collapsed; | |
544 | else | |
545 | root = hists->entries_in; | |
546 | ||
547 | next = rb_first(root); | |
548 | hists->entries = RB_ROOT; | |
3d1d07ec | 549 | |
42b28ac0 | 550 | hists->nr_entries = 0; |
7928631a | 551 | hists->stats.total_period = 0; |
42b28ac0 | 552 | hists__reset_col_len(hists); |
fefb0b94 | 553 | |
3d1d07ec | 554 | while (next) { |
1980c2eb ACM |
555 | n = rb_entry(next, struct hist_entry, rb_node_in); |
556 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 557 | |
1980c2eb | 558 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits); |
42b28ac0 | 559 | hists__inc_nr_entries(hists, n); |
3d1d07ec | 560 | } |
1980c2eb | 561 | } |
b9bf0892 | 562 | |
1980c2eb ACM |
563 | void hists__output_resort(struct hists *hists) |
564 | { | |
565 | return __hists__output_resort(hists, false); | |
566 | } | |
567 | ||
568 | void hists__output_resort_threaded(struct hists *hists) | |
569 | { | |
570 | return __hists__output_resort(hists, true); | |
3d1d07ec | 571 | } |
4ecf84d0 | 572 | |
42b28ac0 | 573 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
574 | enum hist_filter filter) |
575 | { | |
576 | h->filtered &= ~(1 << filter); | |
577 | if (h->filtered) | |
578 | return; | |
579 | ||
42b28ac0 | 580 | ++hists->nr_entries; |
0f0cbf7a | 581 | if (h->ms.unfolded) |
42b28ac0 | 582 | hists->nr_entries += h->nr_rows; |
0f0cbf7a | 583 | h->row_offset = 0; |
42b28ac0 ACM |
584 | hists->stats.total_period += h->period; |
585 | hists->stats.nr_events[PERF_RECORD_SAMPLE] += h->nr_events; | |
cc5edb0e | 586 | |
42b28ac0 | 587 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
588 | } |
589 | ||
90cf1fb5 ACM |
590 | |
591 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
592 | struct hist_entry *he) | |
593 | { | |
594 | if (hists->dso_filter != NULL && | |
595 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
596 | he->filtered |= (1 << HIST_FILTER__DSO); | |
597 | return true; | |
598 | } | |
599 | ||
600 | return false; | |
601 | } | |
602 | ||
d7b76f09 | 603 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
604 | { |
605 | struct rb_node *nd; | |
606 | ||
42b28ac0 ACM |
607 | hists->nr_entries = hists->stats.total_period = 0; |
608 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
609 | hists__reset_col_len(hists); | |
b09e0190 | 610 | |
42b28ac0 | 611 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
612 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
613 | ||
614 | if (symbol_conf.exclude_other && !h->parent) | |
615 | continue; | |
616 | ||
90cf1fb5 | 617 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 618 | continue; |
b09e0190 | 619 | |
42b28ac0 | 620 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
621 | } |
622 | } | |
623 | ||
90cf1fb5 ACM |
624 | static bool hists__filter_entry_by_thread(struct hists *hists, |
625 | struct hist_entry *he) | |
626 | { | |
627 | if (hists->thread_filter != NULL && | |
628 | he->thread != hists->thread_filter) { | |
629 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
630 | return true; | |
631 | } | |
632 | ||
633 | return false; | |
634 | } | |
635 | ||
d7b76f09 | 636 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
637 | { |
638 | struct rb_node *nd; | |
639 | ||
42b28ac0 ACM |
640 | hists->nr_entries = hists->stats.total_period = 0; |
641 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
642 | hists__reset_col_len(hists); | |
b09e0190 | 643 | |
42b28ac0 | 644 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
645 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
646 | ||
90cf1fb5 | 647 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 648 | continue; |
cc5edb0e | 649 | |
42b28ac0 | 650 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
651 | } |
652 | } | |
ef7b93a1 | 653 | |
e94d53eb NK |
654 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
655 | struct hist_entry *he) | |
656 | { | |
657 | if (hists->symbol_filter_str != NULL && | |
658 | (!he->ms.sym || strstr(he->ms.sym->name, | |
659 | hists->symbol_filter_str) == NULL)) { | |
660 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
661 | return true; | |
662 | } | |
663 | ||
664 | return false; | |
665 | } | |
666 | ||
667 | void hists__filter_by_symbol(struct hists *hists) | |
668 | { | |
669 | struct rb_node *nd; | |
670 | ||
671 | hists->nr_entries = hists->stats.total_period = 0; | |
672 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
673 | hists__reset_col_len(hists); | |
674 | ||
675 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
676 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
677 | ||
678 | if (hists__filter_entry_by_symbol(hists, h)) | |
679 | continue; | |
680 | ||
681 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
682 | } | |
683 | } | |
684 | ||
2f525d01 | 685 | int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip) |
ef7b93a1 | 686 | { |
2f525d01 | 687 | return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip); |
ef7b93a1 ACM |
688 | } |
689 | ||
ce6f4fab | 690 | int hist_entry__annotate(struct hist_entry *he, size_t privsize) |
ef7b93a1 | 691 | { |
ce6f4fab | 692 | return symbol__annotate(he->ms.sym, he->ms.map, privsize); |
ef7b93a1 | 693 | } |
c8446b9b | 694 | |
42b28ac0 | 695 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 696 | { |
42b28ac0 ACM |
697 | ++hists->stats.nr_events[0]; |
698 | ++hists->stats.nr_events[type]; | |
c8446b9b | 699 | } |