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; |
c64550cf ACM |
228 | |
229 | if (prev_period == 0) | |
df71d95f | 230 | return true; |
c64550cf | 231 | |
f39056f9 | 232 | he_stat__decay(&he->stat); |
c64550cf ACM |
233 | |
234 | if (!he->filtered) | |
b24c28f7 | 235 | hists->stats.total_period -= prev_period - he->stat.period; |
c64550cf | 236 | |
b24c28f7 | 237 | return he->stat.period == 0; |
ab81f3fd ACM |
238 | } |
239 | ||
3a5714f8 | 240 | void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel) |
ab81f3fd ACM |
241 | { |
242 | struct rb_node *next = rb_first(&hists->entries); | |
243 | struct hist_entry *n; | |
244 | ||
245 | while (next) { | |
246 | n = rb_entry(next, struct hist_entry, rb_node); | |
247 | next = rb_next(&n->rb_node); | |
df71d95f ACM |
248 | /* |
249 | * We may be annotating this, for instance, so keep it here in | |
250 | * case some it gets new samples, we'll eventually free it when | |
251 | * the user stops browsing and it agains gets fully decayed. | |
252 | */ | |
b079d4e9 ACM |
253 | if (((zap_user && n->level == '.') || |
254 | (zap_kernel && n->level != '.') || | |
255 | hists__decay_entry(hists, n)) && | |
256 | !n->used) { | |
ab81f3fd ACM |
257 | rb_erase(&n->rb_node, &hists->entries); |
258 | ||
3a5714f8 | 259 | if (sort__need_collapse) |
ab81f3fd ACM |
260 | rb_erase(&n->rb_node_in, &hists->entries_collapsed); |
261 | ||
262 | hist_entry__free(n); | |
263 | --hists->nr_entries; | |
264 | } | |
265 | } | |
266 | } | |
267 | ||
3d1d07ec | 268 | /* |
c82ee828 | 269 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
270 | */ |
271 | ||
28e2a106 ACM |
272 | static struct hist_entry *hist_entry__new(struct hist_entry *template) |
273 | { | |
d2009c51 | 274 | size_t callchain_size = symbol_conf.use_callchain ? sizeof(struct callchain_root) : 0; |
98a3b32c | 275 | struct hist_entry *he = zalloc(sizeof(*he) + callchain_size); |
28e2a106 | 276 | |
12c14278 ACM |
277 | if (he != NULL) { |
278 | *he = *template; | |
c4b35351 | 279 | |
12c14278 ACM |
280 | if (he->ms.map) |
281 | he->ms.map->referenced = true; | |
3cf0cb1f SE |
282 | |
283 | if (he->branch_info) { | |
26353a61 NK |
284 | /* |
285 | * This branch info is (a part of) allocated from | |
644f2df2 | 286 | * sample__resolve_bstack() and will be freed after |
26353a61 NK |
287 | * adding new entries. So we need to save a copy. |
288 | */ | |
289 | he->branch_info = malloc(sizeof(*he->branch_info)); | |
290 | if (he->branch_info == NULL) { | |
291 | free(he); | |
292 | return NULL; | |
293 | } | |
294 | ||
295 | memcpy(he->branch_info, template->branch_info, | |
296 | sizeof(*he->branch_info)); | |
297 | ||
3cf0cb1f SE |
298 | if (he->branch_info->from.map) |
299 | he->branch_info->from.map->referenced = true; | |
300 | if (he->branch_info->to.map) | |
301 | he->branch_info->to.map->referenced = true; | |
302 | } | |
303 | ||
98a3b32c SE |
304 | if (he->mem_info) { |
305 | if (he->mem_info->iaddr.map) | |
306 | he->mem_info->iaddr.map->referenced = true; | |
307 | if (he->mem_info->daddr.map) | |
308 | he->mem_info->daddr.map->referenced = true; | |
309 | } | |
310 | ||
28e2a106 | 311 | if (symbol_conf.use_callchain) |
12c14278 | 312 | callchain_init(he->callchain); |
b821c732 ACM |
313 | |
314 | INIT_LIST_HEAD(&he->pairs.node); | |
28e2a106 ACM |
315 | } |
316 | ||
12c14278 | 317 | return he; |
28e2a106 ACM |
318 | } |
319 | ||
6263835a | 320 | void hists__inc_stats(struct hists *hists, struct hist_entry *h) |
fefb0b94 | 321 | { |
8a6c5b26 | 322 | if (!h->filtered) { |
42b28ac0 | 323 | hists__calc_col_len(hists, h); |
f2148330 NK |
324 | hists->nr_non_filtered_entries++; |
325 | hists->stats.total_non_filtered_period += h->stat.period; | |
8a6c5b26 | 326 | } |
f2148330 NK |
327 | hists->nr_entries++; |
328 | hists->stats.total_period += h->stat.period; | |
fefb0b94 ACM |
329 | } |
330 | ||
7a007ca9 ACM |
331 | static u8 symbol__parent_filter(const struct symbol *parent) |
332 | { | |
333 | if (symbol_conf.exclude_other && parent == NULL) | |
334 | return 1 << HIST_FILTER__PARENT; | |
335 | return 0; | |
336 | } | |
337 | ||
b5387528 | 338 | static struct hist_entry *add_hist_entry(struct hists *hists, |
f1cbf78d NK |
339 | struct hist_entry *entry, |
340 | struct addr_location *al) | |
9735abf1 | 341 | { |
1980c2eb | 342 | struct rb_node **p; |
9735abf1 ACM |
343 | struct rb_node *parent = NULL; |
344 | struct hist_entry *he; | |
354cc40e | 345 | int64_t cmp; |
f1cbf78d NK |
346 | u64 period = entry->stat.period; |
347 | u64 weight = entry->stat.weight; | |
9735abf1 | 348 | |
1980c2eb ACM |
349 | p = &hists->entries_in->rb_node; |
350 | ||
9735abf1 ACM |
351 | while (*p != NULL) { |
352 | parent = *p; | |
1980c2eb | 353 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 354 | |
9afcf930 NK |
355 | /* |
356 | * Make sure that it receives arguments in a same order as | |
357 | * hist_entry__collapse() so that we can use an appropriate | |
358 | * function when searching an entry regardless which sort | |
359 | * keys were used. | |
360 | */ | |
361 | cmp = hist_entry__cmp(he, entry); | |
9735abf1 ACM |
362 | |
363 | if (!cmp) { | |
05484298 | 364 | he_stat__add_period(&he->stat, period, weight); |
63fa471d | 365 | |
ceb2acbc | 366 | /* |
e80faac0 | 367 | * This mem info was allocated from sample__resolve_mem |
ceb2acbc NK |
368 | * and will not be used anymore. |
369 | */ | |
74cf249d | 370 | zfree(&entry->mem_info); |
ceb2acbc | 371 | |
63fa471d DM |
372 | /* If the map of an existing hist_entry has |
373 | * become out-of-date due to an exec() or | |
374 | * similar, update it. Otherwise we will | |
375 | * mis-adjust symbol addresses when computing | |
376 | * the history counter to increment. | |
377 | */ | |
378 | if (he->ms.map != entry->ms.map) { | |
379 | he->ms.map = entry->ms.map; | |
380 | if (he->ms.map) | |
381 | he->ms.map->referenced = true; | |
382 | } | |
28e2a106 | 383 | goto out; |
9735abf1 ACM |
384 | } |
385 | ||
386 | if (cmp < 0) | |
387 | p = &(*p)->rb_left; | |
388 | else | |
389 | p = &(*p)->rb_right; | |
390 | } | |
391 | ||
b5387528 | 392 | he = hist_entry__new(entry); |
9735abf1 | 393 | if (!he) |
27a0dcb7 | 394 | return NULL; |
1980c2eb | 395 | |
c1fb5651 | 396 | hists->nr_entries++; |
1980c2eb ACM |
397 | rb_link_node(&he->rb_node_in, parent, p); |
398 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 399 | out: |
f39056f9 | 400 | he_stat__add_cpumode_period(&he->stat, al->cpumode, period); |
9735abf1 ACM |
401 | return he; |
402 | } | |
403 | ||
c824c433 | 404 | struct hist_entry *__hists__add_entry(struct hists *hists, |
b5387528 | 405 | struct addr_location *al, |
41a4e6e2 NK |
406 | struct symbol *sym_parent, |
407 | struct branch_info *bi, | |
408 | struct mem_info *mi, | |
409 | u64 period, u64 weight, u64 transaction) | |
b5387528 RAV |
410 | { |
411 | struct hist_entry entry = { | |
412 | .thread = al->thread, | |
4dfced35 | 413 | .comm = thread__comm(al->thread), |
b5387528 RAV |
414 | .ms = { |
415 | .map = al->map, | |
416 | .sym = al->sym, | |
417 | }, | |
418 | .cpu = al->cpu, | |
419 | .ip = al->addr, | |
420 | .level = al->level, | |
b24c28f7 | 421 | .stat = { |
c4b35351 | 422 | .nr_events = 1, |
41a4e6e2 | 423 | .period = period, |
05484298 | 424 | .weight = weight, |
b24c28f7 | 425 | }, |
b5387528 | 426 | .parent = sym_parent, |
2c86c7ca | 427 | .filtered = symbol__parent_filter(sym_parent) | al->filtered, |
c824c433 | 428 | .hists = hists, |
41a4e6e2 NK |
429 | .branch_info = bi, |
430 | .mem_info = mi, | |
475eeab9 | 431 | .transaction = transaction, |
b5387528 RAV |
432 | }; |
433 | ||
f1cbf78d | 434 | return add_hist_entry(hists, &entry, al); |
b5387528 RAV |
435 | } |
436 | ||
3d1d07ec JK |
437 | int64_t |
438 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
439 | { | |
440 | struct sort_entry *se; | |
441 | int64_t cmp = 0; | |
442 | ||
443 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
fcd14984 | 444 | cmp = se->se_cmp(left, right); |
3d1d07ec JK |
445 | if (cmp) |
446 | break; | |
447 | } | |
448 | ||
449 | return cmp; | |
450 | } | |
451 | ||
452 | int64_t | |
453 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
454 | { | |
455 | struct sort_entry *se; | |
456 | int64_t cmp = 0; | |
457 | ||
458 | list_for_each_entry(se, &hist_entry__sort_list, list) { | |
459 | int64_t (*f)(struct hist_entry *, struct hist_entry *); | |
460 | ||
fcd14984 | 461 | f = se->se_collapse ?: se->se_cmp; |
3d1d07ec JK |
462 | |
463 | cmp = f(left, right); | |
464 | if (cmp) | |
465 | break; | |
466 | } | |
467 | ||
468 | return cmp; | |
469 | } | |
470 | ||
471 | void hist_entry__free(struct hist_entry *he) | |
472 | { | |
74cf249d ACM |
473 | zfree(&he->branch_info); |
474 | zfree(&he->mem_info); | |
f048d548 | 475 | free_srcline(he->srcline); |
3d1d07ec JK |
476 | free(he); |
477 | } | |
478 | ||
479 | /* | |
480 | * collapse the histogram | |
481 | */ | |
482 | ||
1d037ca1 | 483 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
484 | struct rb_root *root, |
485 | struct hist_entry *he) | |
3d1d07ec | 486 | { |
b9bf0892 | 487 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
488 | struct rb_node *parent = NULL; |
489 | struct hist_entry *iter; | |
490 | int64_t cmp; | |
491 | ||
492 | while (*p != NULL) { | |
493 | parent = *p; | |
1980c2eb | 494 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
495 | |
496 | cmp = hist_entry__collapse(iter, he); | |
497 | ||
498 | if (!cmp) { | |
139c0815 | 499 | he_stat__add_stat(&iter->stat, &he->stat); |
9ec60972 | 500 | |
1b3a0e95 | 501 | if (symbol_conf.use_callchain) { |
47260645 NK |
502 | callchain_cursor_reset(&callchain_cursor); |
503 | callchain_merge(&callchain_cursor, | |
504 | iter->callchain, | |
1b3a0e95 FW |
505 | he->callchain); |
506 | } | |
3d1d07ec | 507 | hist_entry__free(he); |
fefb0b94 | 508 | return false; |
3d1d07ec JK |
509 | } |
510 | ||
511 | if (cmp < 0) | |
512 | p = &(*p)->rb_left; | |
513 | else | |
514 | p = &(*p)->rb_right; | |
515 | } | |
516 | ||
1980c2eb ACM |
517 | rb_link_node(&he->rb_node_in, parent, p); |
518 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 519 | return true; |
3d1d07ec JK |
520 | } |
521 | ||
1980c2eb | 522 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 523 | { |
1980c2eb ACM |
524 | struct rb_root *root; |
525 | ||
526 | pthread_mutex_lock(&hists->lock); | |
527 | ||
528 | root = hists->entries_in; | |
529 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
530 | hists->entries_in = &hists->entries_in_array[0]; | |
531 | ||
532 | pthread_mutex_unlock(&hists->lock); | |
533 | ||
534 | return root; | |
535 | } | |
536 | ||
90cf1fb5 ACM |
537 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
538 | { | |
539 | hists__filter_entry_by_dso(hists, he); | |
540 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 541 | hists__filter_entry_by_symbol(hists, he); |
90cf1fb5 ACM |
542 | } |
543 | ||
c1fb5651 | 544 | void hists__collapse_resort(struct hists *hists, struct ui_progress *prog) |
1980c2eb ACM |
545 | { |
546 | struct rb_root *root; | |
3d1d07ec JK |
547 | struct rb_node *next; |
548 | struct hist_entry *n; | |
549 | ||
3a5714f8 | 550 | if (!sort__need_collapse) |
3d1d07ec JK |
551 | return; |
552 | ||
1980c2eb ACM |
553 | root = hists__get_rotate_entries_in(hists); |
554 | next = rb_first(root); | |
b9bf0892 | 555 | |
3d1d07ec | 556 | while (next) { |
33e940a2 ACM |
557 | if (session_done()) |
558 | break; | |
1980c2eb ACM |
559 | n = rb_entry(next, struct hist_entry, rb_node_in); |
560 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 561 | |
1980c2eb | 562 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
563 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
564 | /* | |
565 | * If it wasn't combined with one of the entries already | |
566 | * collapsed, we need to apply the filters that may have | |
567 | * been set by, say, the hist_browser. | |
568 | */ | |
569 | hists__apply_filters(hists, n); | |
90cf1fb5 | 570 | } |
c1fb5651 NK |
571 | if (prog) |
572 | ui_progress__update(prog, 1); | |
3d1d07ec | 573 | } |
1980c2eb | 574 | } |
b9bf0892 | 575 | |
3d1d07ec | 576 | /* |
c82ee828 | 577 | * reverse the map, sort on period. |
3d1d07ec JK |
578 | */ |
579 | ||
29d720ed NK |
580 | static int period_cmp(u64 period_a, u64 period_b) |
581 | { | |
582 | if (period_a > period_b) | |
583 | return 1; | |
584 | if (period_a < period_b) | |
585 | return -1; | |
586 | return 0; | |
587 | } | |
588 | ||
589 | static int hist_entry__sort_on_period(struct hist_entry *a, | |
590 | struct hist_entry *b) | |
591 | { | |
592 | int ret; | |
593 | int i, nr_members; | |
594 | struct perf_evsel *evsel; | |
595 | struct hist_entry *pair; | |
596 | u64 *periods_a, *periods_b; | |
597 | ||
598 | ret = period_cmp(a->stat.period, b->stat.period); | |
599 | if (ret || !symbol_conf.event_group) | |
600 | return ret; | |
601 | ||
602 | evsel = hists_to_evsel(a->hists); | |
603 | nr_members = evsel->nr_members; | |
604 | if (nr_members <= 1) | |
605 | return ret; | |
606 | ||
607 | periods_a = zalloc(sizeof(periods_a) * nr_members); | |
608 | periods_b = zalloc(sizeof(periods_b) * nr_members); | |
609 | ||
610 | if (!periods_a || !periods_b) | |
611 | goto out; | |
612 | ||
613 | list_for_each_entry(pair, &a->pairs.head, pairs.node) { | |
614 | evsel = hists_to_evsel(pair->hists); | |
615 | periods_a[perf_evsel__group_idx(evsel)] = pair->stat.period; | |
616 | } | |
617 | ||
618 | list_for_each_entry(pair, &b->pairs.head, pairs.node) { | |
619 | evsel = hists_to_evsel(pair->hists); | |
620 | periods_b[perf_evsel__group_idx(evsel)] = pair->stat.period; | |
621 | } | |
622 | ||
623 | for (i = 1; i < nr_members; i++) { | |
624 | ret = period_cmp(periods_a[i], periods_b[i]); | |
625 | if (ret) | |
626 | break; | |
627 | } | |
628 | ||
629 | out: | |
630 | free(periods_a); | |
631 | free(periods_b); | |
632 | ||
633 | return ret; | |
634 | } | |
635 | ||
1c02c4d2 ACM |
636 | static void __hists__insert_output_entry(struct rb_root *entries, |
637 | struct hist_entry *he, | |
638 | u64 min_callchain_hits) | |
3d1d07ec | 639 | { |
1c02c4d2 | 640 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
641 | struct rb_node *parent = NULL; |
642 | struct hist_entry *iter; | |
643 | ||
d599db3f | 644 | if (symbol_conf.use_callchain) |
b9fb9304 | 645 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
646 | min_callchain_hits, &callchain_param); |
647 | ||
648 | while (*p != NULL) { | |
649 | parent = *p; | |
650 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
651 | ||
29d720ed | 652 | if (hist_entry__sort_on_period(he, iter) > 0) |
3d1d07ec JK |
653 | p = &(*p)->rb_left; |
654 | else | |
655 | p = &(*p)->rb_right; | |
656 | } | |
657 | ||
658 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 659 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
660 | } |
661 | ||
3a5714f8 | 662 | void hists__output_resort(struct hists *hists) |
3d1d07ec | 663 | { |
1980c2eb | 664 | struct rb_root *root; |
3d1d07ec JK |
665 | struct rb_node *next; |
666 | struct hist_entry *n; | |
3d1d07ec JK |
667 | u64 min_callchain_hits; |
668 | ||
42b28ac0 | 669 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 670 | |
3a5714f8 | 671 | if (sort__need_collapse) |
1980c2eb ACM |
672 | root = &hists->entries_collapsed; |
673 | else | |
674 | root = hists->entries_in; | |
675 | ||
676 | next = rb_first(root); | |
677 | hists->entries = RB_ROOT; | |
3d1d07ec | 678 | |
f2148330 NK |
679 | hists->nr_non_filtered_entries = 0; |
680 | hists->stats.total_period = 0; | |
681 | hists->stats.total_non_filtered_period = 0; | |
42b28ac0 | 682 | hists__reset_col_len(hists); |
fefb0b94 | 683 | |
3d1d07ec | 684 | while (next) { |
1980c2eb ACM |
685 | n = rb_entry(next, struct hist_entry, rb_node_in); |
686 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 687 | |
1980c2eb | 688 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits); |
6263835a | 689 | hists__inc_stats(hists, n); |
3d1d07ec | 690 | } |
1980c2eb | 691 | } |
b9bf0892 | 692 | |
42b28ac0 | 693 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
694 | enum hist_filter filter) |
695 | { | |
696 | h->filtered &= ~(1 << filter); | |
697 | if (h->filtered) | |
698 | return; | |
699 | ||
1ab1fa5d | 700 | ++hists->nr_non_filtered_entries; |
f2148330 | 701 | if (h->ms.unfolded) |
1ab1fa5d | 702 | hists->nr_non_filtered_entries += h->nr_rows; |
0f0cbf7a | 703 | h->row_offset = 0; |
1ab1fa5d | 704 | hists->stats.total_non_filtered_period += h->stat.period; |
1ab1fa5d | 705 | hists->stats.nr_non_filtered_samples += h->stat.nr_events; |
cc5edb0e | 706 | |
42b28ac0 | 707 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
708 | } |
709 | ||
90cf1fb5 ACM |
710 | |
711 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
712 | struct hist_entry *he) | |
713 | { | |
714 | if (hists->dso_filter != NULL && | |
715 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
716 | he->filtered |= (1 << HIST_FILTER__DSO); | |
717 | return true; | |
718 | } | |
719 | ||
720 | return false; | |
721 | } | |
722 | ||
d7b76f09 | 723 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
724 | { |
725 | struct rb_node *nd; | |
726 | ||
f2148330 NK |
727 | hists->nr_non_filtered_entries = 0; |
728 | hists->stats.total_non_filtered_period = 0; | |
1ab1fa5d | 729 | hists->stats.nr_non_filtered_samples = 0; |
42b28ac0 | 730 | hists__reset_col_len(hists); |
b09e0190 | 731 | |
42b28ac0 | 732 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
733 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
734 | ||
735 | if (symbol_conf.exclude_other && !h->parent) | |
736 | continue; | |
737 | ||
90cf1fb5 | 738 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 739 | continue; |
b09e0190 | 740 | |
42b28ac0 | 741 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
742 | } |
743 | } | |
744 | ||
90cf1fb5 ACM |
745 | static bool hists__filter_entry_by_thread(struct hists *hists, |
746 | struct hist_entry *he) | |
747 | { | |
748 | if (hists->thread_filter != NULL && | |
749 | he->thread != hists->thread_filter) { | |
750 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
751 | return true; | |
752 | } | |
753 | ||
754 | return false; | |
755 | } | |
756 | ||
d7b76f09 | 757 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
758 | { |
759 | struct rb_node *nd; | |
760 | ||
f2148330 NK |
761 | hists->nr_non_filtered_entries = 0; |
762 | hists->stats.total_non_filtered_period = 0; | |
1ab1fa5d | 763 | hists->stats.nr_non_filtered_samples = 0; |
42b28ac0 | 764 | hists__reset_col_len(hists); |
b09e0190 | 765 | |
42b28ac0 | 766 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
767 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
768 | ||
90cf1fb5 | 769 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 770 | continue; |
cc5edb0e | 771 | |
42b28ac0 | 772 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
773 | } |
774 | } | |
ef7b93a1 | 775 | |
e94d53eb NK |
776 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
777 | struct hist_entry *he) | |
778 | { | |
779 | if (hists->symbol_filter_str != NULL && | |
780 | (!he->ms.sym || strstr(he->ms.sym->name, | |
781 | hists->symbol_filter_str) == NULL)) { | |
782 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
783 | return true; | |
784 | } | |
785 | ||
786 | return false; | |
787 | } | |
788 | ||
789 | void hists__filter_by_symbol(struct hists *hists) | |
790 | { | |
791 | struct rb_node *nd; | |
792 | ||
f2148330 NK |
793 | hists->nr_non_filtered_entries = 0; |
794 | hists->stats.total_non_filtered_period = 0; | |
1ab1fa5d | 795 | hists->stats.nr_non_filtered_samples = 0; |
e94d53eb NK |
796 | hists__reset_col_len(hists); |
797 | ||
798 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
799 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
800 | ||
801 | if (hists__filter_entry_by_symbol(hists, h)) | |
802 | continue; | |
803 | ||
804 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
805 | } | |
806 | } | |
807 | ||
28a6b6aa ACM |
808 | void events_stats__inc(struct events_stats *stats, u32 type) |
809 | { | |
810 | ++stats->nr_events[0]; | |
811 | ++stats->nr_events[type]; | |
812 | } | |
813 | ||
42b28ac0 | 814 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 815 | { |
28a6b6aa | 816 | events_stats__inc(&hists->stats, type); |
c8446b9b | 817 | } |
95529be4 | 818 | |
494d70a1 ACM |
819 | static struct hist_entry *hists__add_dummy_entry(struct hists *hists, |
820 | struct hist_entry *pair) | |
821 | { | |
ce74f60e NK |
822 | struct rb_root *root; |
823 | struct rb_node **p; | |
494d70a1 ACM |
824 | struct rb_node *parent = NULL; |
825 | struct hist_entry *he; | |
354cc40e | 826 | int64_t cmp; |
494d70a1 | 827 | |
ce74f60e NK |
828 | if (sort__need_collapse) |
829 | root = &hists->entries_collapsed; | |
830 | else | |
831 | root = hists->entries_in; | |
832 | ||
833 | p = &root->rb_node; | |
834 | ||
494d70a1 ACM |
835 | while (*p != NULL) { |
836 | parent = *p; | |
ce74f60e | 837 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
494d70a1 | 838 | |
ce74f60e | 839 | cmp = hist_entry__collapse(he, pair); |
494d70a1 ACM |
840 | |
841 | if (!cmp) | |
842 | goto out; | |
843 | ||
844 | if (cmp < 0) | |
845 | p = &(*p)->rb_left; | |
846 | else | |
847 | p = &(*p)->rb_right; | |
848 | } | |
849 | ||
850 | he = hist_entry__new(pair); | |
851 | if (he) { | |
30193d78 ACM |
852 | memset(&he->stat, 0, sizeof(he->stat)); |
853 | he->hists = hists; | |
ce74f60e NK |
854 | rb_link_node(&he->rb_node_in, parent, p); |
855 | rb_insert_color(&he->rb_node_in, root); | |
6263835a | 856 | hists__inc_stats(hists, he); |
e0af43d2 | 857 | he->dummy = true; |
494d70a1 ACM |
858 | } |
859 | out: | |
860 | return he; | |
861 | } | |
862 | ||
95529be4 ACM |
863 | static struct hist_entry *hists__find_entry(struct hists *hists, |
864 | struct hist_entry *he) | |
865 | { | |
ce74f60e NK |
866 | struct rb_node *n; |
867 | ||
868 | if (sort__need_collapse) | |
869 | n = hists->entries_collapsed.rb_node; | |
870 | else | |
871 | n = hists->entries_in->rb_node; | |
95529be4 ACM |
872 | |
873 | while (n) { | |
ce74f60e NK |
874 | struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); |
875 | int64_t cmp = hist_entry__collapse(iter, he); | |
95529be4 ACM |
876 | |
877 | if (cmp < 0) | |
878 | n = n->rb_left; | |
879 | else if (cmp > 0) | |
880 | n = n->rb_right; | |
881 | else | |
882 | return iter; | |
883 | } | |
884 | ||
885 | return NULL; | |
886 | } | |
887 | ||
888 | /* | |
889 | * Look for pairs to link to the leader buckets (hist_entries): | |
890 | */ | |
891 | void hists__match(struct hists *leader, struct hists *other) | |
892 | { | |
ce74f60e | 893 | struct rb_root *root; |
95529be4 ACM |
894 | struct rb_node *nd; |
895 | struct hist_entry *pos, *pair; | |
896 | ||
ce74f60e NK |
897 | if (sort__need_collapse) |
898 | root = &leader->entries_collapsed; | |
899 | else | |
900 | root = leader->entries_in; | |
901 | ||
902 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
903 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
95529be4 ACM |
904 | pair = hists__find_entry(other, pos); |
905 | ||
906 | if (pair) | |
5fa9041b | 907 | hist_entry__add_pair(pair, pos); |
95529be4 ACM |
908 | } |
909 | } | |
494d70a1 ACM |
910 | |
911 | /* | |
912 | * Look for entries in the other hists that are not present in the leader, if | |
913 | * we find them, just add a dummy entry on the leader hists, with period=0, | |
914 | * nr_events=0, to serve as the list header. | |
915 | */ | |
916 | int hists__link(struct hists *leader, struct hists *other) | |
917 | { | |
ce74f60e | 918 | struct rb_root *root; |
494d70a1 ACM |
919 | struct rb_node *nd; |
920 | struct hist_entry *pos, *pair; | |
921 | ||
ce74f60e NK |
922 | if (sort__need_collapse) |
923 | root = &other->entries_collapsed; | |
924 | else | |
925 | root = other->entries_in; | |
926 | ||
927 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
928 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
494d70a1 ACM |
929 | |
930 | if (!hist_entry__has_pairs(pos)) { | |
931 | pair = hists__add_dummy_entry(leader, pos); | |
932 | if (pair == NULL) | |
933 | return -1; | |
5fa9041b | 934 | hist_entry__add_pair(pos, pair); |
494d70a1 ACM |
935 | } |
936 | } | |
937 | ||
938 | return 0; | |
939 | } | |
f2148330 NK |
940 | |
941 | u64 hists__total_period(struct hists *hists) | |
942 | { | |
943 | return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period : | |
944 | hists->stats.total_period; | |
945 | } | |
33db4568 NK |
946 | |
947 | int parse_filter_percentage(const struct option *opt __maybe_unused, | |
948 | const char *arg, int unset __maybe_unused) | |
949 | { | |
950 | if (!strcmp(arg, "relative")) | |
951 | symbol_conf.filter_relative = true; | |
952 | else if (!strcmp(arg, "absolute")) | |
953 | symbol_conf.filter_relative = false; | |
954 | else | |
955 | return -1; | |
956 | ||
957 | return 0; | |
958 | } | |
0b93da17 NK |
959 | |
960 | int perf_hist_config(const char *var, const char *value) | |
961 | { | |
962 | if (!strcmp(var, "hist.percentage")) | |
963 | return parse_filter_percentage(NULL, value, 0); | |
964 | ||
965 | return 0; | |
966 | } |