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: |
b24c28f7 | 138 | he->stat.period_sys += period; |
a1645ce1 ZY |
139 | break; |
140 | case PERF_RECORD_MISC_USER: | |
b24c28f7 | 141 | he->stat.period_us += period; |
a1645ce1 ZY |
142 | break; |
143 | case PERF_RECORD_MISC_GUEST_KERNEL: | |
b24c28f7 | 144 | he->stat.period_guest_sys += period; |
a1645ce1 ZY |
145 | break; |
146 | case PERF_RECORD_MISC_GUEST_USER: | |
b24c28f7 | 147 | he->stat.period_guest_us += period; |
a1645ce1 ZY |
148 | break; |
149 | default: | |
150 | break; | |
151 | } | |
152 | } | |
153 | ||
139c0815 NK |
154 | static void he_stat__add_period(struct he_stat *he_stat, u64 period) |
155 | { | |
156 | he_stat->period += period; | |
157 | he_stat->nr_events += 1; | |
158 | } | |
159 | ||
160 | static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src) | |
161 | { | |
162 | dest->period += src->period; | |
163 | dest->period_sys += src->period_sys; | |
164 | dest->period_us += src->period_us; | |
165 | dest->period_guest_sys += src->period_guest_sys; | |
166 | dest->period_guest_us += src->period_guest_us; | |
167 | dest->nr_events += src->nr_events; | |
168 | } | |
169 | ||
ab81f3fd ACM |
170 | static void hist_entry__decay(struct hist_entry *he) |
171 | { | |
b24c28f7 NK |
172 | he->stat.period = (he->stat.period * 7) / 8; |
173 | he->stat.nr_events = (he->stat.nr_events * 7) / 8; | |
ab81f3fd ACM |
174 | } |
175 | ||
176 | static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) | |
177 | { | |
b24c28f7 | 178 | u64 prev_period = he->stat.period; |
c64550cf ACM |
179 | |
180 | if (prev_period == 0) | |
df71d95f | 181 | return true; |
c64550cf | 182 | |
ab81f3fd | 183 | hist_entry__decay(he); |
c64550cf ACM |
184 | |
185 | if (!he->filtered) | |
b24c28f7 | 186 | hists->stats.total_period -= prev_period - he->stat.period; |
c64550cf | 187 | |
b24c28f7 | 188 | return he->stat.period == 0; |
ab81f3fd ACM |
189 | } |
190 | ||
b079d4e9 ACM |
191 | static void __hists__decay_entries(struct hists *hists, bool zap_user, |
192 | bool zap_kernel, bool threaded) | |
ab81f3fd ACM |
193 | { |
194 | struct rb_node *next = rb_first(&hists->entries); | |
195 | struct hist_entry *n; | |
196 | ||
197 | while (next) { | |
198 | n = rb_entry(next, struct hist_entry, rb_node); | |
199 | next = rb_next(&n->rb_node); | |
df71d95f ACM |
200 | /* |
201 | * We may be annotating this, for instance, so keep it here in | |
202 | * case some it gets new samples, we'll eventually free it when | |
203 | * the user stops browsing and it agains gets fully decayed. | |
204 | */ | |
b079d4e9 ACM |
205 | if (((zap_user && n->level == '.') || |
206 | (zap_kernel && n->level != '.') || | |
207 | hists__decay_entry(hists, n)) && | |
208 | !n->used) { | |
ab81f3fd ACM |
209 | rb_erase(&n->rb_node, &hists->entries); |
210 | ||
e345fa18 | 211 | if (sort__need_collapse || threaded) |
ab81f3fd ACM |
212 | rb_erase(&n->rb_node_in, &hists->entries_collapsed); |
213 | ||
214 | hist_entry__free(n); | |
215 | --hists->nr_entries; | |
216 | } | |
217 | } | |
218 | } | |
219 | ||
b079d4e9 | 220 | void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel) |
e345fa18 | 221 | { |
b079d4e9 | 222 | return __hists__decay_entries(hists, zap_user, zap_kernel, false); |
e345fa18 ACM |
223 | } |
224 | ||
b079d4e9 ACM |
225 | void hists__decay_entries_threaded(struct hists *hists, |
226 | bool zap_user, bool zap_kernel) | |
e345fa18 | 227 | { |
b079d4e9 | 228 | return __hists__decay_entries(hists, zap_user, zap_kernel, true); |
e345fa18 ACM |
229 | } |
230 | ||
3d1d07ec | 231 | /* |
c82ee828 | 232 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
233 | */ |
234 | ||
28e2a106 ACM |
235 | static struct hist_entry *hist_entry__new(struct hist_entry *template) |
236 | { | |
d2009c51 | 237 | size_t callchain_size = symbol_conf.use_callchain ? sizeof(struct callchain_root) : 0; |
12c14278 | 238 | struct hist_entry *he = malloc(sizeof(*he) + callchain_size); |
28e2a106 | 239 | |
12c14278 ACM |
240 | if (he != NULL) { |
241 | *he = *template; | |
c4b35351 | 242 | |
12c14278 ACM |
243 | if (he->ms.map) |
244 | he->ms.map->referenced = true; | |
28e2a106 | 245 | if (symbol_conf.use_callchain) |
12c14278 | 246 | callchain_init(he->callchain); |
b821c732 ACM |
247 | |
248 | INIT_LIST_HEAD(&he->pairs.node); | |
28e2a106 ACM |
249 | } |
250 | ||
12c14278 | 251 | return he; |
28e2a106 ACM |
252 | } |
253 | ||
42b28ac0 | 254 | static void hists__inc_nr_entries(struct hists *hists, struct hist_entry *h) |
fefb0b94 | 255 | { |
8a6c5b26 | 256 | if (!h->filtered) { |
42b28ac0 ACM |
257 | hists__calc_col_len(hists, h); |
258 | ++hists->nr_entries; | |
b24c28f7 | 259 | hists->stats.total_period += h->stat.period; |
8a6c5b26 | 260 | } |
fefb0b94 ACM |
261 | } |
262 | ||
7a007ca9 ACM |
263 | static u8 symbol__parent_filter(const struct symbol *parent) |
264 | { | |
265 | if (symbol_conf.exclude_other && parent == NULL) | |
266 | return 1 << HIST_FILTER__PARENT; | |
267 | return 0; | |
268 | } | |
269 | ||
b5387528 RAV |
270 | static struct hist_entry *add_hist_entry(struct hists *hists, |
271 | struct hist_entry *entry, | |
1c02c4d2 | 272 | struct addr_location *al, |
b5387528 | 273 | u64 period) |
9735abf1 | 274 | { |
1980c2eb | 275 | struct rb_node **p; |
9735abf1 ACM |
276 | struct rb_node *parent = NULL; |
277 | struct hist_entry *he; | |
9735abf1 ACM |
278 | int cmp; |
279 | ||
1980c2eb ACM |
280 | pthread_mutex_lock(&hists->lock); |
281 | ||
282 | p = &hists->entries_in->rb_node; | |
283 | ||
9735abf1 ACM |
284 | while (*p != NULL) { |
285 | parent = *p; | |
1980c2eb | 286 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 287 | |
b5387528 | 288 | cmp = hist_entry__cmp(entry, he); |
9735abf1 ACM |
289 | |
290 | if (!cmp) { | |
139c0815 | 291 | he_stat__add_period(&he->stat, period); |
63fa471d DM |
292 | |
293 | /* If the map of an existing hist_entry has | |
294 | * become out-of-date due to an exec() or | |
295 | * similar, update it. Otherwise we will | |
296 | * mis-adjust symbol addresses when computing | |
297 | * the history counter to increment. | |
298 | */ | |
299 | if (he->ms.map != entry->ms.map) { | |
300 | he->ms.map = entry->ms.map; | |
301 | if (he->ms.map) | |
302 | he->ms.map->referenced = true; | |
303 | } | |
28e2a106 | 304 | goto out; |
9735abf1 ACM |
305 | } |
306 | ||
307 | if (cmp < 0) | |
308 | p = &(*p)->rb_left; | |
309 | else | |
310 | p = &(*p)->rb_right; | |
311 | } | |
312 | ||
b5387528 | 313 | he = hist_entry__new(entry); |
9735abf1 | 314 | if (!he) |
1980c2eb ACM |
315 | goto out_unlock; |
316 | ||
317 | rb_link_node(&he->rb_node_in, parent, p); | |
318 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 319 | out: |
c82ee828 | 320 | hist_entry__add_cpumode_period(he, al->cpumode, period); |
1980c2eb ACM |
321 | out_unlock: |
322 | pthread_mutex_unlock(&hists->lock); | |
9735abf1 ACM |
323 | return he; |
324 | } | |
325 | ||
b5387528 RAV |
326 | struct hist_entry *__hists__add_branch_entry(struct hists *self, |
327 | struct addr_location *al, | |
328 | struct symbol *sym_parent, | |
329 | struct branch_info *bi, | |
330 | u64 period) | |
331 | { | |
332 | struct hist_entry entry = { | |
333 | .thread = al->thread, | |
334 | .ms = { | |
335 | .map = bi->to.map, | |
336 | .sym = bi->to.sym, | |
337 | }, | |
338 | .cpu = al->cpu, | |
339 | .ip = bi->to.addr, | |
340 | .level = al->level, | |
b24c28f7 NK |
341 | .stat = { |
342 | .period = period, | |
c4b35351 | 343 | .nr_events = 1, |
b24c28f7 | 344 | }, |
b5387528 RAV |
345 | .parent = sym_parent, |
346 | .filtered = symbol__parent_filter(sym_parent), | |
347 | .branch_info = bi, | |
ae359f19 | 348 | .hists = self, |
b5387528 RAV |
349 | }; |
350 | ||
351 | return add_hist_entry(self, &entry, al, period); | |
352 | } | |
353 | ||
354 | struct hist_entry *__hists__add_entry(struct hists *self, | |
355 | struct addr_location *al, | |
356 | struct symbol *sym_parent, u64 period) | |
357 | { | |
358 | struct hist_entry entry = { | |
359 | .thread = al->thread, | |
360 | .ms = { | |
361 | .map = al->map, | |
362 | .sym = al->sym, | |
363 | }, | |
364 | .cpu = al->cpu, | |
365 | .ip = al->addr, | |
366 | .level = al->level, | |
b24c28f7 NK |
367 | .stat = { |
368 | .period = period, | |
c4b35351 | 369 | .nr_events = 1, |
b24c28f7 | 370 | }, |
b5387528 RAV |
371 | .parent = sym_parent, |
372 | .filtered = symbol__parent_filter(sym_parent), | |
ae359f19 | 373 | .hists = self, |
b5387528 RAV |
374 | }; |
375 | ||
376 | return add_hist_entry(self, &entry, al, period); | |
377 | } | |
378 | ||
3d1d07ec JK |
379 | int64_t |
380 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
381 | { | |
382 | struct sort_entry *se; | |
383 | int64_t cmp = 0; | |
384 | ||
385 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
fcd14984 | 386 | cmp = se->se_cmp(left, right); |
3d1d07ec JK |
387 | if (cmp) |
388 | break; | |
389 | } | |
390 | ||
391 | return cmp; | |
392 | } | |
393 | ||
394 | int64_t | |
395 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
396 | { | |
397 | struct sort_entry *se; | |
398 | int64_t cmp = 0; | |
399 | ||
400 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
401 | int64_t (*f)(struct hist_entry *, struct hist_entry *); | |
402 | ||
fcd14984 | 403 | f = se->se_collapse ?: se->se_cmp; |
3d1d07ec JK |
404 | |
405 | cmp = f(left, right); | |
406 | if (cmp) | |
407 | break; | |
408 | } | |
409 | ||
410 | return cmp; | |
411 | } | |
412 | ||
413 | void hist_entry__free(struct hist_entry *he) | |
414 | { | |
580e338d | 415 | free(he->branch_info); |
3d1d07ec JK |
416 | free(he); |
417 | } | |
418 | ||
419 | /* | |
420 | * collapse the histogram | |
421 | */ | |
422 | ||
1d037ca1 | 423 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
424 | struct rb_root *root, |
425 | struct hist_entry *he) | |
3d1d07ec | 426 | { |
b9bf0892 | 427 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
428 | struct rb_node *parent = NULL; |
429 | struct hist_entry *iter; | |
430 | int64_t cmp; | |
431 | ||
432 | while (*p != NULL) { | |
433 | parent = *p; | |
1980c2eb | 434 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
435 | |
436 | cmp = hist_entry__collapse(iter, he); | |
437 | ||
438 | if (!cmp) { | |
139c0815 | 439 | he_stat__add_stat(&iter->stat, &he->stat); |
9ec60972 | 440 | |
1b3a0e95 | 441 | if (symbol_conf.use_callchain) { |
47260645 NK |
442 | callchain_cursor_reset(&callchain_cursor); |
443 | callchain_merge(&callchain_cursor, | |
444 | iter->callchain, | |
1b3a0e95 FW |
445 | he->callchain); |
446 | } | |
3d1d07ec | 447 | hist_entry__free(he); |
fefb0b94 | 448 | return false; |
3d1d07ec JK |
449 | } |
450 | ||
451 | if (cmp < 0) | |
452 | p = &(*p)->rb_left; | |
453 | else | |
454 | p = &(*p)->rb_right; | |
455 | } | |
456 | ||
1980c2eb ACM |
457 | rb_link_node(&he->rb_node_in, parent, p); |
458 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 459 | return true; |
3d1d07ec JK |
460 | } |
461 | ||
1980c2eb | 462 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 463 | { |
1980c2eb ACM |
464 | struct rb_root *root; |
465 | ||
466 | pthread_mutex_lock(&hists->lock); | |
467 | ||
468 | root = hists->entries_in; | |
469 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
470 | hists->entries_in = &hists->entries_in_array[0]; | |
471 | ||
472 | pthread_mutex_unlock(&hists->lock); | |
473 | ||
474 | return root; | |
475 | } | |
476 | ||
90cf1fb5 ACM |
477 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
478 | { | |
479 | hists__filter_entry_by_dso(hists, he); | |
480 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 481 | hists__filter_entry_by_symbol(hists, he); |
90cf1fb5 ACM |
482 | } |
483 | ||
1980c2eb ACM |
484 | static void __hists__collapse_resort(struct hists *hists, bool threaded) |
485 | { | |
486 | struct rb_root *root; | |
3d1d07ec JK |
487 | struct rb_node *next; |
488 | struct hist_entry *n; | |
489 | ||
1980c2eb | 490 | if (!sort__need_collapse && !threaded) |
3d1d07ec JK |
491 | return; |
492 | ||
1980c2eb ACM |
493 | root = hists__get_rotate_entries_in(hists); |
494 | next = rb_first(root); | |
b9bf0892 | 495 | |
3d1d07ec | 496 | while (next) { |
1980c2eb ACM |
497 | n = rb_entry(next, struct hist_entry, rb_node_in); |
498 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 499 | |
1980c2eb | 500 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
501 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
502 | /* | |
503 | * If it wasn't combined with one of the entries already | |
504 | * collapsed, we need to apply the filters that may have | |
505 | * been set by, say, the hist_browser. | |
506 | */ | |
507 | hists__apply_filters(hists, n); | |
90cf1fb5 | 508 | } |
3d1d07ec | 509 | } |
1980c2eb | 510 | } |
b9bf0892 | 511 | |
1980c2eb ACM |
512 | void hists__collapse_resort(struct hists *hists) |
513 | { | |
514 | return __hists__collapse_resort(hists, false); | |
515 | } | |
516 | ||
517 | void hists__collapse_resort_threaded(struct hists *hists) | |
518 | { | |
519 | return __hists__collapse_resort(hists, true); | |
3d1d07ec JK |
520 | } |
521 | ||
522 | /* | |
c82ee828 | 523 | * reverse the map, sort on period. |
3d1d07ec JK |
524 | */ |
525 | ||
1c02c4d2 ACM |
526 | static void __hists__insert_output_entry(struct rb_root *entries, |
527 | struct hist_entry *he, | |
528 | u64 min_callchain_hits) | |
3d1d07ec | 529 | { |
1c02c4d2 | 530 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
531 | struct rb_node *parent = NULL; |
532 | struct hist_entry *iter; | |
533 | ||
d599db3f | 534 | if (symbol_conf.use_callchain) |
b9fb9304 | 535 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
536 | min_callchain_hits, &callchain_param); |
537 | ||
538 | while (*p != NULL) { | |
539 | parent = *p; | |
540 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
541 | ||
b24c28f7 | 542 | if (he->stat.period > iter->stat.period) |
3d1d07ec JK |
543 | p = &(*p)->rb_left; |
544 | else | |
545 | p = &(*p)->rb_right; | |
546 | } | |
547 | ||
548 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 549 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
550 | } |
551 | ||
1980c2eb | 552 | static void __hists__output_resort(struct hists *hists, bool threaded) |
3d1d07ec | 553 | { |
1980c2eb | 554 | struct rb_root *root; |
3d1d07ec JK |
555 | struct rb_node *next; |
556 | struct hist_entry *n; | |
3d1d07ec JK |
557 | u64 min_callchain_hits; |
558 | ||
42b28ac0 | 559 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 560 | |
1980c2eb ACM |
561 | if (sort__need_collapse || threaded) |
562 | root = &hists->entries_collapsed; | |
563 | else | |
564 | root = hists->entries_in; | |
565 | ||
566 | next = rb_first(root); | |
567 | hists->entries = RB_ROOT; | |
3d1d07ec | 568 | |
42b28ac0 | 569 | hists->nr_entries = 0; |
7928631a | 570 | hists->stats.total_period = 0; |
42b28ac0 | 571 | hists__reset_col_len(hists); |
fefb0b94 | 572 | |
3d1d07ec | 573 | while (next) { |
1980c2eb ACM |
574 | n = rb_entry(next, struct hist_entry, rb_node_in); |
575 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 576 | |
1980c2eb | 577 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits); |
42b28ac0 | 578 | hists__inc_nr_entries(hists, n); |
3d1d07ec | 579 | } |
1980c2eb | 580 | } |
b9bf0892 | 581 | |
1980c2eb ACM |
582 | void hists__output_resort(struct hists *hists) |
583 | { | |
584 | return __hists__output_resort(hists, false); | |
585 | } | |
586 | ||
587 | void hists__output_resort_threaded(struct hists *hists) | |
588 | { | |
589 | return __hists__output_resort(hists, true); | |
3d1d07ec | 590 | } |
4ecf84d0 | 591 | |
42b28ac0 | 592 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
593 | enum hist_filter filter) |
594 | { | |
595 | h->filtered &= ~(1 << filter); | |
596 | if (h->filtered) | |
597 | return; | |
598 | ||
42b28ac0 | 599 | ++hists->nr_entries; |
0f0cbf7a | 600 | if (h->ms.unfolded) |
42b28ac0 | 601 | hists->nr_entries += h->nr_rows; |
0f0cbf7a | 602 | h->row_offset = 0; |
b24c28f7 NK |
603 | hists->stats.total_period += h->stat.period; |
604 | hists->stats.nr_events[PERF_RECORD_SAMPLE] += h->stat.nr_events; | |
cc5edb0e | 605 | |
42b28ac0 | 606 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
607 | } |
608 | ||
90cf1fb5 ACM |
609 | |
610 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
611 | struct hist_entry *he) | |
612 | { | |
613 | if (hists->dso_filter != NULL && | |
614 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
615 | he->filtered |= (1 << HIST_FILTER__DSO); | |
616 | return true; | |
617 | } | |
618 | ||
619 | return false; | |
620 | } | |
621 | ||
d7b76f09 | 622 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
623 | { |
624 | struct rb_node *nd; | |
625 | ||
42b28ac0 ACM |
626 | hists->nr_entries = hists->stats.total_period = 0; |
627 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
628 | hists__reset_col_len(hists); | |
b09e0190 | 629 | |
42b28ac0 | 630 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
631 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
632 | ||
633 | if (symbol_conf.exclude_other && !h->parent) | |
634 | continue; | |
635 | ||
90cf1fb5 | 636 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 637 | continue; |
b09e0190 | 638 | |
42b28ac0 | 639 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
640 | } |
641 | } | |
642 | ||
90cf1fb5 ACM |
643 | static bool hists__filter_entry_by_thread(struct hists *hists, |
644 | struct hist_entry *he) | |
645 | { | |
646 | if (hists->thread_filter != NULL && | |
647 | he->thread != hists->thread_filter) { | |
648 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
649 | return true; | |
650 | } | |
651 | ||
652 | return false; | |
653 | } | |
654 | ||
d7b76f09 | 655 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
656 | { |
657 | struct rb_node *nd; | |
658 | ||
42b28ac0 ACM |
659 | hists->nr_entries = hists->stats.total_period = 0; |
660 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
661 | hists__reset_col_len(hists); | |
b09e0190 | 662 | |
42b28ac0 | 663 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
664 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
665 | ||
90cf1fb5 | 666 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 667 | continue; |
cc5edb0e | 668 | |
42b28ac0 | 669 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
670 | } |
671 | } | |
ef7b93a1 | 672 | |
e94d53eb NK |
673 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
674 | struct hist_entry *he) | |
675 | { | |
676 | if (hists->symbol_filter_str != NULL && | |
677 | (!he->ms.sym || strstr(he->ms.sym->name, | |
678 | hists->symbol_filter_str) == NULL)) { | |
679 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
680 | return true; | |
681 | } | |
682 | ||
683 | return false; | |
684 | } | |
685 | ||
686 | void hists__filter_by_symbol(struct hists *hists) | |
687 | { | |
688 | struct rb_node *nd; | |
689 | ||
690 | hists->nr_entries = hists->stats.total_period = 0; | |
691 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
692 | hists__reset_col_len(hists); | |
693 | ||
694 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
695 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
696 | ||
697 | if (hists__filter_entry_by_symbol(hists, h)) | |
698 | continue; | |
699 | ||
700 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
701 | } | |
702 | } | |
703 | ||
2f525d01 | 704 | int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip) |
ef7b93a1 | 705 | { |
2f525d01 | 706 | return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip); |
ef7b93a1 ACM |
707 | } |
708 | ||
ce6f4fab | 709 | int hist_entry__annotate(struct hist_entry *he, size_t privsize) |
ef7b93a1 | 710 | { |
ce6f4fab | 711 | return symbol__annotate(he->ms.sym, he->ms.map, privsize); |
ef7b93a1 | 712 | } |
c8446b9b | 713 | |
42b28ac0 | 714 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 715 | { |
42b28ac0 ACM |
716 | ++hists->stats.nr_events[0]; |
717 | ++hists->stats.nr_events[type]; | |
c8446b9b | 718 | } |
95529be4 ACM |
719 | |
720 | static struct hist_entry *hists__find_entry(struct hists *hists, | |
721 | struct hist_entry *he) | |
722 | { | |
723 | struct rb_node *n = hists->entries.rb_node; | |
724 | ||
725 | while (n) { | |
726 | struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node); | |
727 | int64_t cmp = hist_entry__cmp(he, iter); | |
728 | ||
729 | if (cmp < 0) | |
730 | n = n->rb_left; | |
731 | else if (cmp > 0) | |
732 | n = n->rb_right; | |
733 | else | |
734 | return iter; | |
735 | } | |
736 | ||
737 | return NULL; | |
738 | } | |
739 | ||
740 | /* | |
741 | * Look for pairs to link to the leader buckets (hist_entries): | |
742 | */ | |
743 | void hists__match(struct hists *leader, struct hists *other) | |
744 | { | |
745 | struct rb_node *nd; | |
746 | struct hist_entry *pos, *pair; | |
747 | ||
748 | for (nd = rb_first(&leader->entries); nd; nd = rb_next(nd)) { | |
749 | pos = rb_entry(nd, struct hist_entry, rb_node); | |
750 | pair = hists__find_entry(other, pos); | |
751 | ||
752 | if (pair) | |
753 | hist__entry_add_pair(pos, pair); | |
754 | } | |
755 | } |