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" | |
29d720ed | 6 | #include "evsel.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 | 25 | .min_percent = 0.5, |
99571ab3 AK |
26 | .order = ORDER_CALLEE, |
27 | .key = CCKEY_FUNCTION | |
3d1d07ec JK |
28 | }; |
29 | ||
42b28ac0 | 30 | u16 hists__col_len(struct hists *hists, enum hist_column col) |
8a6c5b26 | 31 | { |
42b28ac0 | 32 | return hists->col_len[col]; |
8a6c5b26 ACM |
33 | } |
34 | ||
42b28ac0 | 35 | void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 36 | { |
42b28ac0 | 37 | hists->col_len[col] = len; |
8a6c5b26 ACM |
38 | } |
39 | ||
42b28ac0 | 40 | bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 41 | { |
42b28ac0 ACM |
42 | if (len > hists__col_len(hists, col)) { |
43 | hists__set_col_len(hists, col, len); | |
8a6c5b26 ACM |
44 | return true; |
45 | } | |
46 | return false; | |
47 | } | |
48 | ||
7ccf4f90 | 49 | void hists__reset_col_len(struct hists *hists) |
8a6c5b26 ACM |
50 | { |
51 | enum hist_column col; | |
52 | ||
53 | for (col = 0; col < HISTC_NR_COLS; ++col) | |
42b28ac0 | 54 | hists__set_col_len(hists, col, 0); |
8a6c5b26 ACM |
55 | } |
56 | ||
b5387528 RAV |
57 | static void hists__set_unres_dso_col_len(struct hists *hists, int dso) |
58 | { | |
59 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; | |
60 | ||
61 | if (hists__col_len(hists, dso) < unresolved_col_width && | |
62 | !symbol_conf.col_width_list_str && !symbol_conf.field_sep && | |
63 | !symbol_conf.dso_list) | |
64 | hists__set_col_len(hists, dso, unresolved_col_width); | |
65 | } | |
66 | ||
7ccf4f90 | 67 | void hists__calc_col_len(struct hists *hists, struct hist_entry *h) |
8a6c5b26 | 68 | { |
b5387528 | 69 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; |
98a3b32c | 70 | int symlen; |
8a6c5b26 ACM |
71 | u16 len; |
72 | ||
ded19d57 NK |
73 | /* |
74 | * +4 accounts for '[x] ' priv level info | |
75 | * +2 accounts for 0x prefix on raw addresses | |
76 | * +3 accounts for ' y ' symtab origin info | |
77 | */ | |
78 | if (h->ms.sym) { | |
79 | symlen = h->ms.sym->namelen + 4; | |
80 | if (verbose) | |
81 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
82 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
83 | } else { | |
98a3b32c SE |
84 | symlen = unresolved_col_width + 4 + 2; |
85 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
b5387528 | 86 | hists__set_unres_dso_col_len(hists, HISTC_DSO); |
98a3b32c | 87 | } |
8a6c5b26 ACM |
88 | |
89 | len = thread__comm_len(h->thread); | |
42b28ac0 ACM |
90 | if (hists__new_col_len(hists, HISTC_COMM, len)) |
91 | hists__set_col_len(hists, HISTC_THREAD, len + 6); | |
8a6c5b26 ACM |
92 | |
93 | if (h->ms.map) { | |
94 | len = dso__name_len(h->ms.map->dso); | |
42b28ac0 | 95 | hists__new_col_len(hists, HISTC_DSO, len); |
8a6c5b26 | 96 | } |
b5387528 | 97 | |
cb993744 NK |
98 | if (h->parent) |
99 | hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen); | |
100 | ||
b5387528 | 101 | if (h->branch_info) { |
b5387528 RAV |
102 | if (h->branch_info->from.sym) { |
103 | symlen = (int)h->branch_info->from.sym->namelen + 4; | |
ded19d57 NK |
104 | if (verbose) |
105 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
106 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); |
107 | ||
108 | symlen = dso__name_len(h->branch_info->from.map->dso); | |
109 | hists__new_col_len(hists, HISTC_DSO_FROM, symlen); | |
110 | } else { | |
111 | symlen = unresolved_col_width + 4 + 2; | |
112 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); | |
113 | hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM); | |
114 | } | |
115 | ||
116 | if (h->branch_info->to.sym) { | |
117 | symlen = (int)h->branch_info->to.sym->namelen + 4; | |
ded19d57 NK |
118 | if (verbose) |
119 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
120 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); |
121 | ||
122 | symlen = dso__name_len(h->branch_info->to.map->dso); | |
123 | hists__new_col_len(hists, HISTC_DSO_TO, symlen); | |
124 | } else { | |
125 | symlen = unresolved_col_width + 4 + 2; | |
126 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); | |
127 | hists__set_unres_dso_col_len(hists, HISTC_DSO_TO); | |
128 | } | |
129 | } | |
98a3b32c SE |
130 | |
131 | if (h->mem_info) { | |
98a3b32c SE |
132 | if (h->mem_info->daddr.sym) { |
133 | symlen = (int)h->mem_info->daddr.sym->namelen + 4 | |
134 | + unresolved_col_width + 2; | |
135 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
136 | symlen); | |
137 | } else { | |
138 | symlen = unresolved_col_width + 4 + 2; | |
139 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
140 | symlen); | |
141 | } | |
142 | if (h->mem_info->daddr.map) { | |
143 | symlen = dso__name_len(h->mem_info->daddr.map->dso); | |
144 | hists__new_col_len(hists, HISTC_MEM_DADDR_DSO, | |
145 | symlen); | |
146 | } else { | |
147 | symlen = unresolved_col_width + 4 + 2; | |
148 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
149 | } | |
150 | } else { | |
151 | symlen = unresolved_col_width + 4 + 2; | |
152 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen); | |
153 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
154 | } | |
155 | ||
156 | hists__new_col_len(hists, HISTC_MEM_LOCKED, 6); | |
157 | hists__new_col_len(hists, HISTC_MEM_TLB, 22); | |
158 | hists__new_col_len(hists, HISTC_MEM_SNOOP, 12); | |
159 | hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3); | |
160 | hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12); | |
161 | hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12); | |
475eeab9 AK |
162 | |
163 | if (h->transaction) | |
164 | hists__new_col_len(hists, HISTC_TRANSACTION, | |
165 | hist_entry__transaction_len()); | |
8a6c5b26 ACM |
166 | } |
167 | ||
7ccf4f90 NK |
168 | void hists__output_recalc_col_len(struct hists *hists, int max_rows) |
169 | { | |
170 | struct rb_node *next = rb_first(&hists->entries); | |
171 | struct hist_entry *n; | |
172 | int row = 0; | |
173 | ||
174 | hists__reset_col_len(hists); | |
175 | ||
176 | while (next && row++ < max_rows) { | |
177 | n = rb_entry(next, struct hist_entry, rb_node); | |
178 | if (!n->filtered) | |
179 | hists__calc_col_len(hists, n); | |
180 | next = rb_next(&n->rb_node); | |
181 | } | |
182 | } | |
183 | ||
f39056f9 NK |
184 | static void he_stat__add_cpumode_period(struct he_stat *he_stat, |
185 | unsigned int cpumode, u64 period) | |
a1645ce1 | 186 | { |
28e2a106 | 187 | switch (cpumode) { |
a1645ce1 | 188 | case PERF_RECORD_MISC_KERNEL: |
f39056f9 | 189 | he_stat->period_sys += period; |
a1645ce1 ZY |
190 | break; |
191 | case PERF_RECORD_MISC_USER: | |
f39056f9 | 192 | he_stat->period_us += period; |
a1645ce1 ZY |
193 | break; |
194 | case PERF_RECORD_MISC_GUEST_KERNEL: | |
f39056f9 | 195 | he_stat->period_guest_sys += period; |
a1645ce1 ZY |
196 | break; |
197 | case PERF_RECORD_MISC_GUEST_USER: | |
f39056f9 | 198 | he_stat->period_guest_us += period; |
a1645ce1 ZY |
199 | break; |
200 | default: | |
201 | break; | |
202 | } | |
203 | } | |
204 | ||
05484298 AK |
205 | static void he_stat__add_period(struct he_stat *he_stat, u64 period, |
206 | u64 weight) | |
139c0815 | 207 | { |
98a3b32c | 208 | |
139c0815 | 209 | he_stat->period += period; |
05484298 | 210 | he_stat->weight += weight; |
139c0815 NK |
211 | he_stat->nr_events += 1; |
212 | } | |
213 | ||
214 | static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src) | |
215 | { | |
216 | dest->period += src->period; | |
217 | dest->period_sys += src->period_sys; | |
218 | dest->period_us += src->period_us; | |
219 | dest->period_guest_sys += src->period_guest_sys; | |
220 | dest->period_guest_us += src->period_guest_us; | |
221 | dest->nr_events += src->nr_events; | |
05484298 | 222 | dest->weight += src->weight; |
139c0815 NK |
223 | } |
224 | ||
f39056f9 | 225 | static void he_stat__decay(struct he_stat *he_stat) |
ab81f3fd | 226 | { |
f39056f9 NK |
227 | he_stat->period = (he_stat->period * 7) / 8; |
228 | he_stat->nr_events = (he_stat->nr_events * 7) / 8; | |
05484298 | 229 | /* XXX need decay for weight too? */ |
ab81f3fd ACM |
230 | } |
231 | ||
232 | static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) | |
233 | { | |
b24c28f7 | 234 | u64 prev_period = he->stat.period; |
c64550cf ACM |
235 | |
236 | if (prev_period == 0) | |
df71d95f | 237 | return true; |
c64550cf | 238 | |
f39056f9 | 239 | he_stat__decay(&he->stat); |
c64550cf ACM |
240 | |
241 | if (!he->filtered) | |
b24c28f7 | 242 | hists->stats.total_period -= prev_period - he->stat.period; |
c64550cf | 243 | |
b24c28f7 | 244 | return he->stat.period == 0; |
ab81f3fd ACM |
245 | } |
246 | ||
3a5714f8 | 247 | void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel) |
ab81f3fd ACM |
248 | { |
249 | struct rb_node *next = rb_first(&hists->entries); | |
250 | struct hist_entry *n; | |
251 | ||
252 | while (next) { | |
253 | n = rb_entry(next, struct hist_entry, rb_node); | |
254 | next = rb_next(&n->rb_node); | |
df71d95f ACM |
255 | /* |
256 | * We may be annotating this, for instance, so keep it here in | |
257 | * case some it gets new samples, we'll eventually free it when | |
258 | * the user stops browsing and it agains gets fully decayed. | |
259 | */ | |
b079d4e9 ACM |
260 | if (((zap_user && n->level == '.') || |
261 | (zap_kernel && n->level != '.') || | |
262 | hists__decay_entry(hists, n)) && | |
263 | !n->used) { | |
ab81f3fd ACM |
264 | rb_erase(&n->rb_node, &hists->entries); |
265 | ||
3a5714f8 | 266 | if (sort__need_collapse) |
ab81f3fd ACM |
267 | rb_erase(&n->rb_node_in, &hists->entries_collapsed); |
268 | ||
269 | hist_entry__free(n); | |
270 | --hists->nr_entries; | |
271 | } | |
272 | } | |
273 | } | |
274 | ||
3d1d07ec | 275 | /* |
c82ee828 | 276 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
277 | */ |
278 | ||
28e2a106 ACM |
279 | static struct hist_entry *hist_entry__new(struct hist_entry *template) |
280 | { | |
d2009c51 | 281 | size_t callchain_size = symbol_conf.use_callchain ? sizeof(struct callchain_root) : 0; |
98a3b32c | 282 | struct hist_entry *he = zalloc(sizeof(*he) + callchain_size); |
28e2a106 | 283 | |
12c14278 ACM |
284 | if (he != NULL) { |
285 | *he = *template; | |
c4b35351 | 286 | |
12c14278 ACM |
287 | if (he->ms.map) |
288 | he->ms.map->referenced = true; | |
3cf0cb1f SE |
289 | |
290 | if (he->branch_info) { | |
26353a61 NK |
291 | /* |
292 | * This branch info is (a part of) allocated from | |
293 | * machine__resolve_bstack() and will be freed after | |
294 | * adding new entries. So we need to save a copy. | |
295 | */ | |
296 | he->branch_info = malloc(sizeof(*he->branch_info)); | |
297 | if (he->branch_info == NULL) { | |
298 | free(he); | |
299 | return NULL; | |
300 | } | |
301 | ||
302 | memcpy(he->branch_info, template->branch_info, | |
303 | sizeof(*he->branch_info)); | |
304 | ||
3cf0cb1f SE |
305 | if (he->branch_info->from.map) |
306 | he->branch_info->from.map->referenced = true; | |
307 | if (he->branch_info->to.map) | |
308 | he->branch_info->to.map->referenced = true; | |
309 | } | |
310 | ||
98a3b32c SE |
311 | if (he->mem_info) { |
312 | if (he->mem_info->iaddr.map) | |
313 | he->mem_info->iaddr.map->referenced = true; | |
314 | if (he->mem_info->daddr.map) | |
315 | he->mem_info->daddr.map->referenced = true; | |
316 | } | |
317 | ||
28e2a106 | 318 | if (symbol_conf.use_callchain) |
12c14278 | 319 | callchain_init(he->callchain); |
b821c732 ACM |
320 | |
321 | INIT_LIST_HEAD(&he->pairs.node); | |
28e2a106 ACM |
322 | } |
323 | ||
12c14278 | 324 | return he; |
28e2a106 ACM |
325 | } |
326 | ||
66f97ed3 | 327 | void hists__inc_nr_entries(struct hists *hists, struct hist_entry *h) |
fefb0b94 | 328 | { |
8a6c5b26 | 329 | if (!h->filtered) { |
42b28ac0 ACM |
330 | hists__calc_col_len(hists, h); |
331 | ++hists->nr_entries; | |
b24c28f7 | 332 | hists->stats.total_period += h->stat.period; |
8a6c5b26 | 333 | } |
fefb0b94 ACM |
334 | } |
335 | ||
7a007ca9 ACM |
336 | static u8 symbol__parent_filter(const struct symbol *parent) |
337 | { | |
338 | if (symbol_conf.exclude_other && parent == NULL) | |
339 | return 1 << HIST_FILTER__PARENT; | |
340 | return 0; | |
341 | } | |
342 | ||
b5387528 | 343 | static struct hist_entry *add_hist_entry(struct hists *hists, |
f1cbf78d NK |
344 | struct hist_entry *entry, |
345 | struct addr_location *al) | |
9735abf1 | 346 | { |
1980c2eb | 347 | struct rb_node **p; |
9735abf1 ACM |
348 | struct rb_node *parent = NULL; |
349 | struct hist_entry *he; | |
354cc40e | 350 | int64_t cmp; |
f1cbf78d NK |
351 | u64 period = entry->stat.period; |
352 | u64 weight = entry->stat.weight; | |
9735abf1 | 353 | |
1980c2eb ACM |
354 | p = &hists->entries_in->rb_node; |
355 | ||
9735abf1 ACM |
356 | while (*p != NULL) { |
357 | parent = *p; | |
1980c2eb | 358 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 359 | |
9afcf930 NK |
360 | /* |
361 | * Make sure that it receives arguments in a same order as | |
362 | * hist_entry__collapse() so that we can use an appropriate | |
363 | * function when searching an entry regardless which sort | |
364 | * keys were used. | |
365 | */ | |
366 | cmp = hist_entry__cmp(he, entry); | |
9735abf1 ACM |
367 | |
368 | if (!cmp) { | |
05484298 | 369 | he_stat__add_period(&he->stat, period, weight); |
63fa471d | 370 | |
ceb2acbc NK |
371 | /* |
372 | * This mem info was allocated from machine__resolve_mem | |
373 | * and will not be used anymore. | |
374 | */ | |
74cf249d | 375 | zfree(&entry->mem_info); |
ceb2acbc | 376 | |
63fa471d DM |
377 | /* If the map of an existing hist_entry has |
378 | * become out-of-date due to an exec() or | |
379 | * similar, update it. Otherwise we will | |
380 | * mis-adjust symbol addresses when computing | |
381 | * the history counter to increment. | |
382 | */ | |
383 | if (he->ms.map != entry->ms.map) { | |
384 | he->ms.map = entry->ms.map; | |
385 | if (he->ms.map) | |
386 | he->ms.map->referenced = true; | |
387 | } | |
28e2a106 | 388 | goto out; |
9735abf1 ACM |
389 | } |
390 | ||
391 | if (cmp < 0) | |
392 | p = &(*p)->rb_left; | |
393 | else | |
394 | p = &(*p)->rb_right; | |
395 | } | |
396 | ||
b5387528 | 397 | he = hist_entry__new(entry); |
9735abf1 | 398 | if (!he) |
27a0dcb7 | 399 | return NULL; |
1980c2eb | 400 | |
c1fb5651 | 401 | hists->nr_entries++; |
1980c2eb ACM |
402 | rb_link_node(&he->rb_node_in, parent, p); |
403 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 404 | out: |
f39056f9 | 405 | he_stat__add_cpumode_period(&he->stat, al->cpumode, period); |
9735abf1 ACM |
406 | return he; |
407 | } | |
408 | ||
c824c433 | 409 | struct hist_entry *__hists__add_entry(struct hists *hists, |
b5387528 | 410 | struct addr_location *al, |
41a4e6e2 NK |
411 | struct symbol *sym_parent, |
412 | struct branch_info *bi, | |
413 | struct mem_info *mi, | |
414 | u64 period, u64 weight, u64 transaction) | |
b5387528 RAV |
415 | { |
416 | struct hist_entry entry = { | |
417 | .thread = al->thread, | |
4dfced35 | 418 | .comm = thread__comm(al->thread), |
b5387528 RAV |
419 | .ms = { |
420 | .map = al->map, | |
421 | .sym = al->sym, | |
422 | }, | |
423 | .cpu = al->cpu, | |
424 | .ip = al->addr, | |
425 | .level = al->level, | |
b24c28f7 | 426 | .stat = { |
c4b35351 | 427 | .nr_events = 1, |
41a4e6e2 | 428 | .period = period, |
05484298 | 429 | .weight = weight, |
b24c28f7 | 430 | }, |
b5387528 RAV |
431 | .parent = sym_parent, |
432 | .filtered = symbol__parent_filter(sym_parent), | |
c824c433 | 433 | .hists = hists, |
41a4e6e2 NK |
434 | .branch_info = bi, |
435 | .mem_info = mi, | |
475eeab9 | 436 | .transaction = transaction, |
b5387528 RAV |
437 | }; |
438 | ||
f1cbf78d | 439 | return add_hist_entry(hists, &entry, al); |
b5387528 RAV |
440 | } |
441 | ||
3d1d07ec JK |
442 | int64_t |
443 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
444 | { | |
445 | struct sort_entry *se; | |
446 | int64_t cmp = 0; | |
447 | ||
448 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
fcd14984 | 449 | cmp = se->se_cmp(left, right); |
3d1d07ec JK |
450 | if (cmp) |
451 | break; | |
452 | } | |
453 | ||
454 | return cmp; | |
455 | } | |
456 | ||
457 | int64_t | |
458 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
459 | { | |
460 | struct sort_entry *se; | |
461 | int64_t cmp = 0; | |
462 | ||
463 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
464 | int64_t (*f)(struct hist_entry *, struct hist_entry *); | |
465 | ||
fcd14984 | 466 | f = se->se_collapse ?: se->se_cmp; |
3d1d07ec JK |
467 | |
468 | cmp = f(left, right); | |
469 | if (cmp) | |
470 | break; | |
471 | } | |
472 | ||
473 | return cmp; | |
474 | } | |
475 | ||
476 | void hist_entry__free(struct hist_entry *he) | |
477 | { | |
74cf249d ACM |
478 | zfree(&he->branch_info); |
479 | zfree(&he->mem_info); | |
f048d548 | 480 | free_srcline(he->srcline); |
3d1d07ec JK |
481 | free(he); |
482 | } | |
483 | ||
484 | /* | |
485 | * collapse the histogram | |
486 | */ | |
487 | ||
1d037ca1 | 488 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
489 | struct rb_root *root, |
490 | struct hist_entry *he) | |
3d1d07ec | 491 | { |
b9bf0892 | 492 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
493 | struct rb_node *parent = NULL; |
494 | struct hist_entry *iter; | |
495 | int64_t cmp; | |
496 | ||
497 | while (*p != NULL) { | |
498 | parent = *p; | |
1980c2eb | 499 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
500 | |
501 | cmp = hist_entry__collapse(iter, he); | |
502 | ||
503 | if (!cmp) { | |
139c0815 | 504 | he_stat__add_stat(&iter->stat, &he->stat); |
9ec60972 | 505 | |
1b3a0e95 | 506 | if (symbol_conf.use_callchain) { |
47260645 NK |
507 | callchain_cursor_reset(&callchain_cursor); |
508 | callchain_merge(&callchain_cursor, | |
509 | iter->callchain, | |
1b3a0e95 FW |
510 | he->callchain); |
511 | } | |
3d1d07ec | 512 | hist_entry__free(he); |
fefb0b94 | 513 | return false; |
3d1d07ec JK |
514 | } |
515 | ||
516 | if (cmp < 0) | |
517 | p = &(*p)->rb_left; | |
518 | else | |
519 | p = &(*p)->rb_right; | |
520 | } | |
521 | ||
1980c2eb ACM |
522 | rb_link_node(&he->rb_node_in, parent, p); |
523 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 524 | return true; |
3d1d07ec JK |
525 | } |
526 | ||
1980c2eb | 527 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 528 | { |
1980c2eb ACM |
529 | struct rb_root *root; |
530 | ||
531 | pthread_mutex_lock(&hists->lock); | |
532 | ||
533 | root = hists->entries_in; | |
534 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
535 | hists->entries_in = &hists->entries_in_array[0]; | |
536 | ||
537 | pthread_mutex_unlock(&hists->lock); | |
538 | ||
539 | return root; | |
540 | } | |
541 | ||
90cf1fb5 ACM |
542 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
543 | { | |
544 | hists__filter_entry_by_dso(hists, he); | |
545 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 546 | hists__filter_entry_by_symbol(hists, he); |
90cf1fb5 ACM |
547 | } |
548 | ||
c1fb5651 | 549 | void hists__collapse_resort(struct hists *hists, struct ui_progress *prog) |
1980c2eb ACM |
550 | { |
551 | struct rb_root *root; | |
3d1d07ec JK |
552 | struct rb_node *next; |
553 | struct hist_entry *n; | |
554 | ||
3a5714f8 | 555 | if (!sort__need_collapse) |
3d1d07ec JK |
556 | return; |
557 | ||
1980c2eb ACM |
558 | root = hists__get_rotate_entries_in(hists); |
559 | next = rb_first(root); | |
b9bf0892 | 560 | |
3d1d07ec | 561 | while (next) { |
33e940a2 ACM |
562 | if (session_done()) |
563 | break; | |
1980c2eb ACM |
564 | n = rb_entry(next, struct hist_entry, rb_node_in); |
565 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 566 | |
1980c2eb | 567 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
568 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
569 | /* | |
570 | * If it wasn't combined with one of the entries already | |
571 | * collapsed, we need to apply the filters that may have | |
572 | * been set by, say, the hist_browser. | |
573 | */ | |
574 | hists__apply_filters(hists, n); | |
90cf1fb5 | 575 | } |
c1fb5651 NK |
576 | if (prog) |
577 | ui_progress__update(prog, 1); | |
3d1d07ec | 578 | } |
1980c2eb | 579 | } |
b9bf0892 | 580 | |
3d1d07ec | 581 | /* |
c82ee828 | 582 | * reverse the map, sort on period. |
3d1d07ec JK |
583 | */ |
584 | ||
29d720ed NK |
585 | static int period_cmp(u64 period_a, u64 period_b) |
586 | { | |
587 | if (period_a > period_b) | |
588 | return 1; | |
589 | if (period_a < period_b) | |
590 | return -1; | |
591 | return 0; | |
592 | } | |
593 | ||
594 | static int hist_entry__sort_on_period(struct hist_entry *a, | |
595 | struct hist_entry *b) | |
596 | { | |
597 | int ret; | |
598 | int i, nr_members; | |
599 | struct perf_evsel *evsel; | |
600 | struct hist_entry *pair; | |
601 | u64 *periods_a, *periods_b; | |
602 | ||
603 | ret = period_cmp(a->stat.period, b->stat.period); | |
604 | if (ret || !symbol_conf.event_group) | |
605 | return ret; | |
606 | ||
607 | evsel = hists_to_evsel(a->hists); | |
608 | nr_members = evsel->nr_members; | |
609 | if (nr_members <= 1) | |
610 | return ret; | |
611 | ||
612 | periods_a = zalloc(sizeof(periods_a) * nr_members); | |
613 | periods_b = zalloc(sizeof(periods_b) * nr_members); | |
614 | ||
615 | if (!periods_a || !periods_b) | |
616 | goto out; | |
617 | ||
618 | list_for_each_entry(pair, &a->pairs.head, pairs.node) { | |
619 | evsel = hists_to_evsel(pair->hists); | |
620 | periods_a[perf_evsel__group_idx(evsel)] = pair->stat.period; | |
621 | } | |
622 | ||
623 | list_for_each_entry(pair, &b->pairs.head, pairs.node) { | |
624 | evsel = hists_to_evsel(pair->hists); | |
625 | periods_b[perf_evsel__group_idx(evsel)] = pair->stat.period; | |
626 | } | |
627 | ||
628 | for (i = 1; i < nr_members; i++) { | |
629 | ret = period_cmp(periods_a[i], periods_b[i]); | |
630 | if (ret) | |
631 | break; | |
632 | } | |
633 | ||
634 | out: | |
635 | free(periods_a); | |
636 | free(periods_b); | |
637 | ||
638 | return ret; | |
639 | } | |
640 | ||
1c02c4d2 ACM |
641 | static void __hists__insert_output_entry(struct rb_root *entries, |
642 | struct hist_entry *he, | |
643 | u64 min_callchain_hits) | |
3d1d07ec | 644 | { |
1c02c4d2 | 645 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
646 | struct rb_node *parent = NULL; |
647 | struct hist_entry *iter; | |
648 | ||
d599db3f | 649 | if (symbol_conf.use_callchain) |
b9fb9304 | 650 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
651 | min_callchain_hits, &callchain_param); |
652 | ||
653 | while (*p != NULL) { | |
654 | parent = *p; | |
655 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
656 | ||
29d720ed | 657 | if (hist_entry__sort_on_period(he, iter) > 0) |
3d1d07ec JK |
658 | p = &(*p)->rb_left; |
659 | else | |
660 | p = &(*p)->rb_right; | |
661 | } | |
662 | ||
663 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 664 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
665 | } |
666 | ||
3a5714f8 | 667 | void hists__output_resort(struct hists *hists) |
3d1d07ec | 668 | { |
1980c2eb | 669 | struct rb_root *root; |
3d1d07ec JK |
670 | struct rb_node *next; |
671 | struct hist_entry *n; | |
3d1d07ec JK |
672 | u64 min_callchain_hits; |
673 | ||
42b28ac0 | 674 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 675 | |
3a5714f8 | 676 | if (sort__need_collapse) |
1980c2eb ACM |
677 | root = &hists->entries_collapsed; |
678 | else | |
679 | root = hists->entries_in; | |
680 | ||
681 | next = rb_first(root); | |
682 | hists->entries = RB_ROOT; | |
3d1d07ec | 683 | |
42b28ac0 | 684 | hists->nr_entries = 0; |
7928631a | 685 | hists->stats.total_period = 0; |
42b28ac0 | 686 | hists__reset_col_len(hists); |
fefb0b94 | 687 | |
3d1d07ec | 688 | while (next) { |
1980c2eb ACM |
689 | n = rb_entry(next, struct hist_entry, rb_node_in); |
690 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 691 | |
1980c2eb | 692 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits); |
42b28ac0 | 693 | hists__inc_nr_entries(hists, n); |
3d1d07ec | 694 | } |
1980c2eb | 695 | } |
b9bf0892 | 696 | |
42b28ac0 | 697 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
698 | enum hist_filter filter) |
699 | { | |
700 | h->filtered &= ~(1 << filter); | |
701 | if (h->filtered) | |
702 | return; | |
703 | ||
42b28ac0 | 704 | ++hists->nr_entries; |
0f0cbf7a | 705 | if (h->ms.unfolded) |
42b28ac0 | 706 | hists->nr_entries += h->nr_rows; |
0f0cbf7a | 707 | h->row_offset = 0; |
b24c28f7 NK |
708 | hists->stats.total_period += h->stat.period; |
709 | hists->stats.nr_events[PERF_RECORD_SAMPLE] += h->stat.nr_events; | |
cc5edb0e | 710 | |
42b28ac0 | 711 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
712 | } |
713 | ||
90cf1fb5 ACM |
714 | |
715 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
716 | struct hist_entry *he) | |
717 | { | |
718 | if (hists->dso_filter != NULL && | |
719 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
720 | he->filtered |= (1 << HIST_FILTER__DSO); | |
721 | return true; | |
722 | } | |
723 | ||
724 | return false; | |
725 | } | |
726 | ||
d7b76f09 | 727 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
728 | { |
729 | struct rb_node *nd; | |
730 | ||
42b28ac0 ACM |
731 | hists->nr_entries = hists->stats.total_period = 0; |
732 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
733 | hists__reset_col_len(hists); | |
b09e0190 | 734 | |
42b28ac0 | 735 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
736 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
737 | ||
738 | if (symbol_conf.exclude_other && !h->parent) | |
739 | continue; | |
740 | ||
90cf1fb5 | 741 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 742 | continue; |
b09e0190 | 743 | |
42b28ac0 | 744 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
745 | } |
746 | } | |
747 | ||
90cf1fb5 ACM |
748 | static bool hists__filter_entry_by_thread(struct hists *hists, |
749 | struct hist_entry *he) | |
750 | { | |
751 | if (hists->thread_filter != NULL && | |
752 | he->thread != hists->thread_filter) { | |
753 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
754 | return true; | |
755 | } | |
756 | ||
757 | return false; | |
758 | } | |
759 | ||
d7b76f09 | 760 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
761 | { |
762 | struct rb_node *nd; | |
763 | ||
42b28ac0 ACM |
764 | hists->nr_entries = hists->stats.total_period = 0; |
765 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
766 | hists__reset_col_len(hists); | |
b09e0190 | 767 | |
42b28ac0 | 768 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
769 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
770 | ||
90cf1fb5 | 771 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 772 | continue; |
cc5edb0e | 773 | |
42b28ac0 | 774 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
775 | } |
776 | } | |
ef7b93a1 | 777 | |
e94d53eb NK |
778 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
779 | struct hist_entry *he) | |
780 | { | |
781 | if (hists->symbol_filter_str != NULL && | |
782 | (!he->ms.sym || strstr(he->ms.sym->name, | |
783 | hists->symbol_filter_str) == NULL)) { | |
784 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
785 | return true; | |
786 | } | |
787 | ||
788 | return false; | |
789 | } | |
790 | ||
791 | void hists__filter_by_symbol(struct hists *hists) | |
792 | { | |
793 | struct rb_node *nd; | |
794 | ||
795 | hists->nr_entries = hists->stats.total_period = 0; | |
796 | hists->stats.nr_events[PERF_RECORD_SAMPLE] = 0; | |
797 | hists__reset_col_len(hists); | |
798 | ||
799 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
800 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
801 | ||
802 | if (hists__filter_entry_by_symbol(hists, h)) | |
803 | continue; | |
804 | ||
805 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
806 | } | |
807 | } | |
808 | ||
28a6b6aa ACM |
809 | void events_stats__inc(struct events_stats *stats, u32 type) |
810 | { | |
811 | ++stats->nr_events[0]; | |
812 | ++stats->nr_events[type]; | |
813 | } | |
814 | ||
42b28ac0 | 815 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 816 | { |
28a6b6aa | 817 | events_stats__inc(&hists->stats, type); |
c8446b9b | 818 | } |
95529be4 | 819 | |
494d70a1 ACM |
820 | static struct hist_entry *hists__add_dummy_entry(struct hists *hists, |
821 | struct hist_entry *pair) | |
822 | { | |
ce74f60e NK |
823 | struct rb_root *root; |
824 | struct rb_node **p; | |
494d70a1 ACM |
825 | struct rb_node *parent = NULL; |
826 | struct hist_entry *he; | |
354cc40e | 827 | int64_t cmp; |
494d70a1 | 828 | |
ce74f60e NK |
829 | if (sort__need_collapse) |
830 | root = &hists->entries_collapsed; | |
831 | else | |
832 | root = hists->entries_in; | |
833 | ||
834 | p = &root->rb_node; | |
835 | ||
494d70a1 ACM |
836 | while (*p != NULL) { |
837 | parent = *p; | |
ce74f60e | 838 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
494d70a1 | 839 | |
ce74f60e | 840 | cmp = hist_entry__collapse(he, pair); |
494d70a1 ACM |
841 | |
842 | if (!cmp) | |
843 | goto out; | |
844 | ||
845 | if (cmp < 0) | |
846 | p = &(*p)->rb_left; | |
847 | else | |
848 | p = &(*p)->rb_right; | |
849 | } | |
850 | ||
851 | he = hist_entry__new(pair); | |
852 | if (he) { | |
30193d78 ACM |
853 | memset(&he->stat, 0, sizeof(he->stat)); |
854 | he->hists = hists; | |
ce74f60e NK |
855 | rb_link_node(&he->rb_node_in, parent, p); |
856 | rb_insert_color(&he->rb_node_in, root); | |
494d70a1 | 857 | hists__inc_nr_entries(hists, he); |
e0af43d2 | 858 | he->dummy = true; |
494d70a1 ACM |
859 | } |
860 | out: | |
861 | return he; | |
862 | } | |
863 | ||
95529be4 ACM |
864 | static struct hist_entry *hists__find_entry(struct hists *hists, |
865 | struct hist_entry *he) | |
866 | { | |
ce74f60e NK |
867 | struct rb_node *n; |
868 | ||
869 | if (sort__need_collapse) | |
870 | n = hists->entries_collapsed.rb_node; | |
871 | else | |
872 | n = hists->entries_in->rb_node; | |
95529be4 ACM |
873 | |
874 | while (n) { | |
ce74f60e NK |
875 | struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); |
876 | int64_t cmp = hist_entry__collapse(iter, he); | |
95529be4 ACM |
877 | |
878 | if (cmp < 0) | |
879 | n = n->rb_left; | |
880 | else if (cmp > 0) | |
881 | n = n->rb_right; | |
882 | else | |
883 | return iter; | |
884 | } | |
885 | ||
886 | return NULL; | |
887 | } | |
888 | ||
889 | /* | |
890 | * Look for pairs to link to the leader buckets (hist_entries): | |
891 | */ | |
892 | void hists__match(struct hists *leader, struct hists *other) | |
893 | { | |
ce74f60e | 894 | struct rb_root *root; |
95529be4 ACM |
895 | struct rb_node *nd; |
896 | struct hist_entry *pos, *pair; | |
897 | ||
ce74f60e NK |
898 | if (sort__need_collapse) |
899 | root = &leader->entries_collapsed; | |
900 | else | |
901 | root = leader->entries_in; | |
902 | ||
903 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
904 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
95529be4 ACM |
905 | pair = hists__find_entry(other, pos); |
906 | ||
907 | if (pair) | |
5fa9041b | 908 | hist_entry__add_pair(pair, pos); |
95529be4 ACM |
909 | } |
910 | } | |
494d70a1 ACM |
911 | |
912 | /* | |
913 | * Look for entries in the other hists that are not present in the leader, if | |
914 | * we find them, just add a dummy entry on the leader hists, with period=0, | |
915 | * nr_events=0, to serve as the list header. | |
916 | */ | |
917 | int hists__link(struct hists *leader, struct hists *other) | |
918 | { | |
ce74f60e | 919 | struct rb_root *root; |
494d70a1 ACM |
920 | struct rb_node *nd; |
921 | struct hist_entry *pos, *pair; | |
922 | ||
ce74f60e NK |
923 | if (sort__need_collapse) |
924 | root = &other->entries_collapsed; | |
925 | else | |
926 | root = other->entries_in; | |
927 | ||
928 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
929 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
494d70a1 ACM |
930 | |
931 | if (!hist_entry__has_pairs(pos)) { | |
932 | pair = hists__add_dummy_entry(leader, pos); | |
933 | if (pair == NULL) | |
934 | return -1; | |
5fa9041b | 935 | hist_entry__add_pair(pos, pair); |
494d70a1 ACM |
936 | } |
937 | } | |
938 | ||
939 | return 0; | |
940 | } |