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