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" |
69bcb019 | 7 | #include "annotate.h" |
9b33827d | 8 | #include <math.h> |
3d1d07ec | 9 | |
90cf1fb5 ACM |
10 | static bool hists__filter_entry_by_dso(struct hists *hists, |
11 | struct hist_entry *he); | |
12 | static bool hists__filter_entry_by_thread(struct hists *hists, | |
13 | struct hist_entry *he); | |
e94d53eb NK |
14 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
15 | struct hist_entry *he); | |
90cf1fb5 | 16 | |
3d1d07ec JK |
17 | struct callchain_param callchain_param = { |
18 | .mode = CHAIN_GRAPH_REL, | |
d797fdc5 | 19 | .min_percent = 0.5, |
99571ab3 AK |
20 | .order = ORDER_CALLEE, |
21 | .key = CCKEY_FUNCTION | |
3d1d07ec JK |
22 | }; |
23 | ||
42b28ac0 | 24 | u16 hists__col_len(struct hists *hists, enum hist_column col) |
8a6c5b26 | 25 | { |
42b28ac0 | 26 | return hists->col_len[col]; |
8a6c5b26 ACM |
27 | } |
28 | ||
42b28ac0 | 29 | void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 30 | { |
42b28ac0 | 31 | hists->col_len[col] = len; |
8a6c5b26 ACM |
32 | } |
33 | ||
42b28ac0 | 34 | bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 35 | { |
42b28ac0 ACM |
36 | if (len > hists__col_len(hists, col)) { |
37 | hists__set_col_len(hists, col, len); | |
8a6c5b26 ACM |
38 | return true; |
39 | } | |
40 | return false; | |
41 | } | |
42 | ||
7ccf4f90 | 43 | void hists__reset_col_len(struct hists *hists) |
8a6c5b26 ACM |
44 | { |
45 | enum hist_column col; | |
46 | ||
47 | for (col = 0; col < HISTC_NR_COLS; ++col) | |
42b28ac0 | 48 | hists__set_col_len(hists, col, 0); |
8a6c5b26 ACM |
49 | } |
50 | ||
b5387528 RAV |
51 | static void hists__set_unres_dso_col_len(struct hists *hists, int dso) |
52 | { | |
53 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; | |
54 | ||
55 | if (hists__col_len(hists, dso) < unresolved_col_width && | |
56 | !symbol_conf.col_width_list_str && !symbol_conf.field_sep && | |
57 | !symbol_conf.dso_list) | |
58 | hists__set_col_len(hists, dso, unresolved_col_width); | |
59 | } | |
60 | ||
7ccf4f90 | 61 | void hists__calc_col_len(struct hists *hists, struct hist_entry *h) |
8a6c5b26 | 62 | { |
b5387528 | 63 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; |
98a3b32c | 64 | int symlen; |
8a6c5b26 ACM |
65 | u16 len; |
66 | ||
ded19d57 NK |
67 | /* |
68 | * +4 accounts for '[x] ' priv level info | |
69 | * +2 accounts for 0x prefix on raw addresses | |
70 | * +3 accounts for ' y ' symtab origin info | |
71 | */ | |
72 | if (h->ms.sym) { | |
73 | symlen = h->ms.sym->namelen + 4; | |
74 | if (verbose) | |
75 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
76 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
77 | } else { | |
98a3b32c SE |
78 | symlen = unresolved_col_width + 4 + 2; |
79 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
b5387528 | 80 | hists__set_unres_dso_col_len(hists, HISTC_DSO); |
98a3b32c | 81 | } |
8a6c5b26 ACM |
82 | |
83 | len = thread__comm_len(h->thread); | |
42b28ac0 ACM |
84 | if (hists__new_col_len(hists, HISTC_COMM, len)) |
85 | hists__set_col_len(hists, HISTC_THREAD, len + 6); | |
8a6c5b26 ACM |
86 | |
87 | if (h->ms.map) { | |
88 | len = dso__name_len(h->ms.map->dso); | |
42b28ac0 | 89 | hists__new_col_len(hists, HISTC_DSO, len); |
8a6c5b26 | 90 | } |
b5387528 | 91 | |
cb993744 NK |
92 | if (h->parent) |
93 | hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen); | |
94 | ||
b5387528 | 95 | if (h->branch_info) { |
b5387528 RAV |
96 | if (h->branch_info->from.sym) { |
97 | symlen = (int)h->branch_info->from.sym->namelen + 4; | |
ded19d57 NK |
98 | if (verbose) |
99 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
100 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); |
101 | ||
102 | symlen = dso__name_len(h->branch_info->from.map->dso); | |
103 | hists__new_col_len(hists, HISTC_DSO_FROM, symlen); | |
104 | } else { | |
105 | symlen = unresolved_col_width + 4 + 2; | |
106 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); | |
107 | hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM); | |
108 | } | |
109 | ||
110 | if (h->branch_info->to.sym) { | |
111 | symlen = (int)h->branch_info->to.sym->namelen + 4; | |
ded19d57 NK |
112 | if (verbose) |
113 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
114 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); |
115 | ||
116 | symlen = dso__name_len(h->branch_info->to.map->dso); | |
117 | hists__new_col_len(hists, HISTC_DSO_TO, symlen); | |
118 | } else { | |
119 | symlen = unresolved_col_width + 4 + 2; | |
120 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); | |
121 | hists__set_unres_dso_col_len(hists, HISTC_DSO_TO); | |
122 | } | |
123 | } | |
98a3b32c SE |
124 | |
125 | if (h->mem_info) { | |
98a3b32c SE |
126 | if (h->mem_info->daddr.sym) { |
127 | symlen = (int)h->mem_info->daddr.sym->namelen + 4 | |
128 | + unresolved_col_width + 2; | |
129 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
130 | symlen); | |
131 | } else { | |
132 | symlen = unresolved_col_width + 4 + 2; | |
133 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
134 | symlen); | |
135 | } | |
136 | if (h->mem_info->daddr.map) { | |
137 | symlen = dso__name_len(h->mem_info->daddr.map->dso); | |
138 | hists__new_col_len(hists, HISTC_MEM_DADDR_DSO, | |
139 | symlen); | |
140 | } else { | |
141 | symlen = unresolved_col_width + 4 + 2; | |
142 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
143 | } | |
144 | } else { | |
145 | symlen = unresolved_col_width + 4 + 2; | |
146 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen); | |
147 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
148 | } | |
149 | ||
150 | hists__new_col_len(hists, HISTC_MEM_LOCKED, 6); | |
151 | hists__new_col_len(hists, HISTC_MEM_TLB, 22); | |
152 | hists__new_col_len(hists, HISTC_MEM_SNOOP, 12); | |
153 | hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3); | |
154 | hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12); | |
155 | hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12); | |
475eeab9 AK |
156 | |
157 | if (h->transaction) | |
158 | hists__new_col_len(hists, HISTC_TRANSACTION, | |
159 | hist_entry__transaction_len()); | |
8a6c5b26 ACM |
160 | } |
161 | ||
7ccf4f90 NK |
162 | void hists__output_recalc_col_len(struct hists *hists, int max_rows) |
163 | { | |
164 | struct rb_node *next = rb_first(&hists->entries); | |
165 | struct hist_entry *n; | |
166 | int row = 0; | |
167 | ||
168 | hists__reset_col_len(hists); | |
169 | ||
170 | while (next && row++ < max_rows) { | |
171 | n = rb_entry(next, struct hist_entry, rb_node); | |
172 | if (!n->filtered) | |
173 | hists__calc_col_len(hists, n); | |
174 | next = rb_next(&n->rb_node); | |
175 | } | |
176 | } | |
177 | ||
f39056f9 NK |
178 | static void he_stat__add_cpumode_period(struct he_stat *he_stat, |
179 | unsigned int cpumode, u64 period) | |
a1645ce1 | 180 | { |
28e2a106 | 181 | switch (cpumode) { |
a1645ce1 | 182 | case PERF_RECORD_MISC_KERNEL: |
f39056f9 | 183 | he_stat->period_sys += period; |
a1645ce1 ZY |
184 | break; |
185 | case PERF_RECORD_MISC_USER: | |
f39056f9 | 186 | he_stat->period_us += period; |
a1645ce1 ZY |
187 | break; |
188 | case PERF_RECORD_MISC_GUEST_KERNEL: | |
f39056f9 | 189 | he_stat->period_guest_sys += period; |
a1645ce1 ZY |
190 | break; |
191 | case PERF_RECORD_MISC_GUEST_USER: | |
f39056f9 | 192 | he_stat->period_guest_us += period; |
a1645ce1 ZY |
193 | break; |
194 | default: | |
195 | break; | |
196 | } | |
197 | } | |
198 | ||
05484298 AK |
199 | static void he_stat__add_period(struct he_stat *he_stat, u64 period, |
200 | u64 weight) | |
139c0815 | 201 | { |
98a3b32c | 202 | |
139c0815 | 203 | he_stat->period += period; |
05484298 | 204 | he_stat->weight += weight; |
139c0815 NK |
205 | he_stat->nr_events += 1; |
206 | } | |
207 | ||
208 | static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src) | |
209 | { | |
210 | dest->period += src->period; | |
211 | dest->period_sys += src->period_sys; | |
212 | dest->period_us += src->period_us; | |
213 | dest->period_guest_sys += src->period_guest_sys; | |
214 | dest->period_guest_us += src->period_guest_us; | |
215 | dest->nr_events += src->nr_events; | |
05484298 | 216 | dest->weight += src->weight; |
139c0815 NK |
217 | } |
218 | ||
f39056f9 | 219 | static void he_stat__decay(struct he_stat *he_stat) |
ab81f3fd | 220 | { |
f39056f9 NK |
221 | he_stat->period = (he_stat->period * 7) / 8; |
222 | he_stat->nr_events = (he_stat->nr_events * 7) / 8; | |
05484298 | 223 | /* XXX need decay for weight too? */ |
ab81f3fd ACM |
224 | } |
225 | ||
226 | static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) | |
227 | { | |
b24c28f7 | 228 | u64 prev_period = he->stat.period; |
3186b681 | 229 | u64 diff; |
c64550cf ACM |
230 | |
231 | if (prev_period == 0) | |
df71d95f | 232 | return true; |
c64550cf | 233 | |
f39056f9 | 234 | he_stat__decay(&he->stat); |
f8be1c8c NK |
235 | if (symbol_conf.cumulate_callchain) |
236 | he_stat__decay(he->stat_acc); | |
c64550cf | 237 | |
3186b681 NK |
238 | diff = prev_period - he->stat.period; |
239 | ||
240 | hists->stats.total_period -= diff; | |
c64550cf | 241 | if (!he->filtered) |
3186b681 | 242 | hists->stats.total_non_filtered_period -= diff; |
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 | ||
ab81f3fd | 269 | --hists->nr_entries; |
3186b681 NK |
270 | if (!n->filtered) |
271 | --hists->nr_non_filtered_entries; | |
272 | ||
273 | hist_entry__free(n); | |
ab81f3fd ACM |
274 | } |
275 | } | |
276 | } | |
277 | ||
3d1d07ec | 278 | /* |
c82ee828 | 279 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
280 | */ |
281 | ||
28e2a106 ACM |
282 | static struct hist_entry *hist_entry__new(struct hist_entry *template) |
283 | { | |
f8be1c8c NK |
284 | size_t callchain_size = 0; |
285 | struct hist_entry *he; | |
286 | ||
287 | if (symbol_conf.use_callchain || symbol_conf.cumulate_callchain) | |
288 | callchain_size = sizeof(struct callchain_root); | |
289 | ||
290 | he = zalloc(sizeof(*he) + callchain_size); | |
28e2a106 | 291 | |
12c14278 ACM |
292 | if (he != NULL) { |
293 | *he = *template; | |
c4b35351 | 294 | |
f8be1c8c NK |
295 | if (symbol_conf.cumulate_callchain) { |
296 | he->stat_acc = malloc(sizeof(he->stat)); | |
297 | if (he->stat_acc == NULL) { | |
298 | free(he); | |
299 | return NULL; | |
300 | } | |
301 | memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); | |
302 | } | |
303 | ||
12c14278 ACM |
304 | if (he->ms.map) |
305 | he->ms.map->referenced = true; | |
3cf0cb1f SE |
306 | |
307 | if (he->branch_info) { | |
26353a61 NK |
308 | /* |
309 | * This branch info is (a part of) allocated from | |
644f2df2 | 310 | * sample__resolve_bstack() and will be freed after |
26353a61 NK |
311 | * adding new entries. So we need to save a copy. |
312 | */ | |
313 | he->branch_info = malloc(sizeof(*he->branch_info)); | |
314 | if (he->branch_info == NULL) { | |
f8be1c8c | 315 | free(he->stat_acc); |
26353a61 NK |
316 | free(he); |
317 | return NULL; | |
318 | } | |
319 | ||
320 | memcpy(he->branch_info, template->branch_info, | |
321 | sizeof(*he->branch_info)); | |
322 | ||
3cf0cb1f SE |
323 | if (he->branch_info->from.map) |
324 | he->branch_info->from.map->referenced = true; | |
325 | if (he->branch_info->to.map) | |
326 | he->branch_info->to.map->referenced = true; | |
327 | } | |
328 | ||
98a3b32c SE |
329 | if (he->mem_info) { |
330 | if (he->mem_info->iaddr.map) | |
331 | he->mem_info->iaddr.map->referenced = true; | |
332 | if (he->mem_info->daddr.map) | |
333 | he->mem_info->daddr.map->referenced = true; | |
334 | } | |
335 | ||
28e2a106 | 336 | if (symbol_conf.use_callchain) |
12c14278 | 337 | callchain_init(he->callchain); |
b821c732 ACM |
338 | |
339 | INIT_LIST_HEAD(&he->pairs.node); | |
28e2a106 ACM |
340 | } |
341 | ||
12c14278 | 342 | return he; |
28e2a106 ACM |
343 | } |
344 | ||
7a007ca9 ACM |
345 | static u8 symbol__parent_filter(const struct symbol *parent) |
346 | { | |
347 | if (symbol_conf.exclude_other && parent == NULL) | |
348 | return 1 << HIST_FILTER__PARENT; | |
349 | return 0; | |
350 | } | |
351 | ||
b5387528 | 352 | static struct hist_entry *add_hist_entry(struct hists *hists, |
f1cbf78d NK |
353 | struct hist_entry *entry, |
354 | struct addr_location *al) | |
9735abf1 | 355 | { |
1980c2eb | 356 | struct rb_node **p; |
9735abf1 ACM |
357 | struct rb_node *parent = NULL; |
358 | struct hist_entry *he; | |
354cc40e | 359 | int64_t cmp; |
f1cbf78d NK |
360 | u64 period = entry->stat.period; |
361 | u64 weight = entry->stat.weight; | |
9735abf1 | 362 | |
1980c2eb ACM |
363 | p = &hists->entries_in->rb_node; |
364 | ||
9735abf1 ACM |
365 | while (*p != NULL) { |
366 | parent = *p; | |
1980c2eb | 367 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 368 | |
9afcf930 NK |
369 | /* |
370 | * Make sure that it receives arguments in a same order as | |
371 | * hist_entry__collapse() so that we can use an appropriate | |
372 | * function when searching an entry regardless which sort | |
373 | * keys were used. | |
374 | */ | |
375 | cmp = hist_entry__cmp(he, entry); | |
9735abf1 ACM |
376 | |
377 | if (!cmp) { | |
05484298 | 378 | he_stat__add_period(&he->stat, period, weight); |
f8be1c8c NK |
379 | if (symbol_conf.cumulate_callchain) |
380 | he_stat__add_period(he->stat_acc, period, weight); | |
63fa471d | 381 | |
ceb2acbc | 382 | /* |
e80faac0 | 383 | * This mem info was allocated from sample__resolve_mem |
ceb2acbc NK |
384 | * and will not be used anymore. |
385 | */ | |
74cf249d | 386 | zfree(&entry->mem_info); |
ceb2acbc | 387 | |
63fa471d DM |
388 | /* If the map of an existing hist_entry has |
389 | * become out-of-date due to an exec() or | |
390 | * similar, update it. Otherwise we will | |
391 | * mis-adjust symbol addresses when computing | |
392 | * the history counter to increment. | |
393 | */ | |
394 | if (he->ms.map != entry->ms.map) { | |
395 | he->ms.map = entry->ms.map; | |
396 | if (he->ms.map) | |
397 | he->ms.map->referenced = true; | |
398 | } | |
28e2a106 | 399 | goto out; |
9735abf1 ACM |
400 | } |
401 | ||
402 | if (cmp < 0) | |
403 | p = &(*p)->rb_left; | |
404 | else | |
405 | p = &(*p)->rb_right; | |
406 | } | |
407 | ||
b5387528 | 408 | he = hist_entry__new(entry); |
9735abf1 | 409 | if (!he) |
27a0dcb7 | 410 | return NULL; |
1980c2eb ACM |
411 | |
412 | rb_link_node(&he->rb_node_in, parent, p); | |
413 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 414 | out: |
f39056f9 | 415 | he_stat__add_cpumode_period(&he->stat, al->cpumode, period); |
f8be1c8c NK |
416 | if (symbol_conf.cumulate_callchain) |
417 | he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); | |
9735abf1 ACM |
418 | return he; |
419 | } | |
420 | ||
c824c433 | 421 | struct hist_entry *__hists__add_entry(struct hists *hists, |
b5387528 | 422 | struct addr_location *al, |
41a4e6e2 NK |
423 | struct symbol *sym_parent, |
424 | struct branch_info *bi, | |
425 | struct mem_info *mi, | |
426 | u64 period, u64 weight, u64 transaction) | |
b5387528 RAV |
427 | { |
428 | struct hist_entry entry = { | |
429 | .thread = al->thread, | |
4dfced35 | 430 | .comm = thread__comm(al->thread), |
b5387528 RAV |
431 | .ms = { |
432 | .map = al->map, | |
433 | .sym = al->sym, | |
434 | }, | |
435 | .cpu = al->cpu, | |
436 | .ip = al->addr, | |
437 | .level = al->level, | |
b24c28f7 | 438 | .stat = { |
c4b35351 | 439 | .nr_events = 1, |
41a4e6e2 | 440 | .period = period, |
05484298 | 441 | .weight = weight, |
b24c28f7 | 442 | }, |
b5387528 | 443 | .parent = sym_parent, |
2c86c7ca | 444 | .filtered = symbol__parent_filter(sym_parent) | al->filtered, |
c824c433 | 445 | .hists = hists, |
41a4e6e2 NK |
446 | .branch_info = bi, |
447 | .mem_info = mi, | |
475eeab9 | 448 | .transaction = transaction, |
b5387528 RAV |
449 | }; |
450 | ||
f1cbf78d | 451 | return add_hist_entry(hists, &entry, al); |
b5387528 RAV |
452 | } |
453 | ||
69bcb019 NK |
454 | static int |
455 | iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, | |
456 | struct addr_location *al __maybe_unused) | |
457 | { | |
458 | return 0; | |
459 | } | |
460 | ||
461 | static int | |
462 | iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, | |
463 | struct addr_location *al __maybe_unused) | |
464 | { | |
465 | return 0; | |
466 | } | |
467 | ||
468 | static int | |
469 | iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
470 | { | |
471 | struct perf_sample *sample = iter->sample; | |
472 | struct mem_info *mi; | |
473 | ||
474 | mi = sample__resolve_mem(sample, al); | |
475 | if (mi == NULL) | |
476 | return -ENOMEM; | |
477 | ||
478 | iter->priv = mi; | |
479 | return 0; | |
480 | } | |
481 | ||
482 | static int | |
483 | iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
484 | { | |
485 | u64 cost; | |
486 | struct mem_info *mi = iter->priv; | |
487 | struct hist_entry *he; | |
488 | ||
489 | if (mi == NULL) | |
490 | return -EINVAL; | |
491 | ||
492 | cost = iter->sample->weight; | |
493 | if (!cost) | |
494 | cost = 1; | |
495 | ||
496 | /* | |
497 | * must pass period=weight in order to get the correct | |
498 | * sorting from hists__collapse_resort() which is solely | |
499 | * based on periods. We want sorting be done on nr_events * weight | |
500 | * and this is indirectly achieved by passing period=weight here | |
501 | * and the he_stat__add_period() function. | |
502 | */ | |
503 | he = __hists__add_entry(&iter->evsel->hists, al, iter->parent, NULL, mi, | |
504 | cost, cost, 0); | |
505 | if (!he) | |
506 | return -ENOMEM; | |
507 | ||
508 | iter->he = he; | |
509 | return 0; | |
510 | } | |
511 | ||
512 | static int | |
513 | iter_finish_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
514 | { | |
515 | struct perf_evsel *evsel = iter->evsel; | |
516 | struct hist_entry *he = iter->he; | |
517 | struct mem_info *mx; | |
518 | int err = -EINVAL; | |
519 | ||
520 | if (he == NULL) | |
521 | goto out; | |
522 | ||
523 | if (ui__has_annotation()) { | |
524 | err = hist_entry__inc_addr_samples(he, evsel->idx, al->addr); | |
525 | if (err) | |
526 | goto out; | |
527 | ||
528 | mx = he->mem_info; | |
529 | err = addr_map_symbol__inc_samples(&mx->daddr, evsel->idx); | |
530 | if (err) | |
531 | goto out; | |
532 | } | |
533 | ||
534 | hists__inc_nr_samples(&evsel->hists, he->filtered); | |
535 | ||
536 | err = hist_entry__append_callchain(he, iter->sample); | |
537 | ||
538 | out: | |
539 | /* | |
540 | * We don't need to free iter->priv (mem_info) here since | |
541 | * the mem info was either already freed in add_hist_entry() or | |
542 | * passed to a new hist entry by hist_entry__new(). | |
543 | */ | |
544 | iter->priv = NULL; | |
545 | ||
546 | iter->he = NULL; | |
547 | return err; | |
548 | } | |
549 | ||
550 | static int | |
551 | iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
552 | { | |
553 | struct branch_info *bi; | |
554 | struct perf_sample *sample = iter->sample; | |
555 | ||
556 | bi = sample__resolve_bstack(sample, al); | |
557 | if (!bi) | |
558 | return -ENOMEM; | |
559 | ||
560 | iter->curr = 0; | |
561 | iter->total = sample->branch_stack->nr; | |
562 | ||
563 | iter->priv = bi; | |
564 | return 0; | |
565 | } | |
566 | ||
567 | static int | |
568 | iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused, | |
569 | struct addr_location *al __maybe_unused) | |
570 | { | |
571 | return 0; | |
572 | } | |
573 | ||
574 | static int | |
575 | iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
576 | { | |
577 | struct branch_info *bi = iter->priv; | |
578 | int i = iter->curr; | |
579 | ||
580 | if (bi == NULL) | |
581 | return 0; | |
582 | ||
583 | if (iter->curr >= iter->total) | |
584 | return 0; | |
585 | ||
586 | al->map = bi[i].to.map; | |
587 | al->sym = bi[i].to.sym; | |
588 | al->addr = bi[i].to.addr; | |
589 | return 1; | |
590 | } | |
591 | ||
592 | static int | |
593 | iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
594 | { | |
595 | struct branch_info *bi, *bx; | |
596 | struct perf_evsel *evsel = iter->evsel; | |
597 | struct hist_entry *he = NULL; | |
598 | int i = iter->curr; | |
599 | int err = 0; | |
600 | ||
601 | bi = iter->priv; | |
602 | ||
603 | if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym)) | |
604 | goto out; | |
605 | ||
606 | /* | |
607 | * The report shows the percentage of total branches captured | |
608 | * and not events sampled. Thus we use a pseudo period of 1. | |
609 | */ | |
610 | he = __hists__add_entry(&evsel->hists, al, iter->parent, &bi[i], NULL, | |
611 | 1, 1, 0); | |
612 | if (he == NULL) | |
613 | return -ENOMEM; | |
614 | ||
615 | if (ui__has_annotation()) { | |
616 | bx = he->branch_info; | |
617 | err = addr_map_symbol__inc_samples(&bx->from, evsel->idx); | |
618 | if (err) | |
619 | goto out; | |
620 | ||
621 | err = addr_map_symbol__inc_samples(&bx->to, evsel->idx); | |
622 | if (err) | |
623 | goto out; | |
624 | } | |
625 | ||
626 | hists__inc_nr_samples(&evsel->hists, he->filtered); | |
627 | ||
628 | out: | |
629 | iter->he = he; | |
630 | iter->curr++; | |
631 | return err; | |
632 | } | |
633 | ||
634 | static int | |
635 | iter_finish_branch_entry(struct hist_entry_iter *iter, | |
636 | struct addr_location *al __maybe_unused) | |
637 | { | |
638 | zfree(&iter->priv); | |
639 | iter->he = NULL; | |
640 | ||
641 | return iter->curr >= iter->total ? 0 : -1; | |
642 | } | |
643 | ||
644 | static int | |
645 | iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused, | |
646 | struct addr_location *al __maybe_unused) | |
647 | { | |
648 | return 0; | |
649 | } | |
650 | ||
651 | static int | |
652 | iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
653 | { | |
654 | struct perf_evsel *evsel = iter->evsel; | |
655 | struct perf_sample *sample = iter->sample; | |
656 | struct hist_entry *he; | |
657 | ||
658 | he = __hists__add_entry(&evsel->hists, al, iter->parent, NULL, NULL, | |
659 | sample->period, sample->weight, | |
660 | sample->transaction); | |
661 | if (he == NULL) | |
662 | return -ENOMEM; | |
663 | ||
664 | iter->he = he; | |
665 | return 0; | |
666 | } | |
667 | ||
668 | static int | |
669 | iter_finish_normal_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
670 | { | |
671 | int err; | |
672 | struct hist_entry *he = iter->he; | |
673 | struct perf_evsel *evsel = iter->evsel; | |
674 | struct perf_sample *sample = iter->sample; | |
675 | ||
676 | if (he == NULL) | |
677 | return 0; | |
678 | ||
679 | iter->he = NULL; | |
680 | ||
681 | if (ui__has_annotation()) { | |
682 | err = hist_entry__inc_addr_samples(he, evsel->idx, al->addr); | |
683 | if (err) | |
684 | return err; | |
685 | } | |
686 | ||
687 | hists__inc_nr_samples(&evsel->hists, he->filtered); | |
688 | ||
689 | return hist_entry__append_callchain(he, sample); | |
690 | } | |
691 | ||
692 | const struct hist_iter_ops hist_iter_mem = { | |
693 | .prepare_entry = iter_prepare_mem_entry, | |
694 | .add_single_entry = iter_add_single_mem_entry, | |
695 | .next_entry = iter_next_nop_entry, | |
696 | .add_next_entry = iter_add_next_nop_entry, | |
697 | .finish_entry = iter_finish_mem_entry, | |
698 | }; | |
699 | ||
700 | const struct hist_iter_ops hist_iter_branch = { | |
701 | .prepare_entry = iter_prepare_branch_entry, | |
702 | .add_single_entry = iter_add_single_branch_entry, | |
703 | .next_entry = iter_next_branch_entry, | |
704 | .add_next_entry = iter_add_next_branch_entry, | |
705 | .finish_entry = iter_finish_branch_entry, | |
706 | }; | |
707 | ||
708 | const struct hist_iter_ops hist_iter_normal = { | |
709 | .prepare_entry = iter_prepare_normal_entry, | |
710 | .add_single_entry = iter_add_single_normal_entry, | |
711 | .next_entry = iter_next_nop_entry, | |
712 | .add_next_entry = iter_add_next_nop_entry, | |
713 | .finish_entry = iter_finish_normal_entry, | |
714 | }; | |
715 | ||
716 | int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al, | |
717 | struct perf_evsel *evsel, struct perf_sample *sample, | |
718 | int max_stack_depth) | |
719 | { | |
720 | int err, err2; | |
721 | ||
722 | err = sample__resolve_callchain(sample, &iter->parent, evsel, al, | |
723 | max_stack_depth); | |
724 | if (err) | |
725 | return err; | |
726 | ||
727 | iter->evsel = evsel; | |
728 | iter->sample = sample; | |
729 | ||
730 | err = iter->ops->prepare_entry(iter, al); | |
731 | if (err) | |
732 | goto out; | |
733 | ||
734 | err = iter->ops->add_single_entry(iter, al); | |
735 | if (err) | |
736 | goto out; | |
737 | ||
738 | while (iter->ops->next_entry(iter, al)) { | |
739 | err = iter->ops->add_next_entry(iter, al); | |
740 | if (err) | |
741 | break; | |
742 | } | |
743 | ||
744 | out: | |
745 | err2 = iter->ops->finish_entry(iter, al); | |
746 | if (!err) | |
747 | err = err2; | |
748 | ||
749 | return err; | |
750 | } | |
751 | ||
3d1d07ec JK |
752 | int64_t |
753 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
754 | { | |
093f0ef3 | 755 | struct perf_hpp_fmt *fmt; |
3d1d07ec JK |
756 | int64_t cmp = 0; |
757 | ||
093f0ef3 | 758 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
759 | if (perf_hpp__should_skip(fmt)) |
760 | continue; | |
761 | ||
093f0ef3 | 762 | cmp = fmt->cmp(left, right); |
3d1d07ec JK |
763 | if (cmp) |
764 | break; | |
765 | } | |
766 | ||
767 | return cmp; | |
768 | } | |
769 | ||
770 | int64_t | |
771 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
772 | { | |
093f0ef3 | 773 | struct perf_hpp_fmt *fmt; |
3d1d07ec JK |
774 | int64_t cmp = 0; |
775 | ||
093f0ef3 | 776 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
777 | if (perf_hpp__should_skip(fmt)) |
778 | continue; | |
779 | ||
093f0ef3 | 780 | cmp = fmt->collapse(left, right); |
3d1d07ec JK |
781 | if (cmp) |
782 | break; | |
783 | } | |
784 | ||
785 | return cmp; | |
786 | } | |
787 | ||
788 | void hist_entry__free(struct hist_entry *he) | |
789 | { | |
74cf249d ACM |
790 | zfree(&he->branch_info); |
791 | zfree(&he->mem_info); | |
f8be1c8c | 792 | zfree(&he->stat_acc); |
f048d548 | 793 | free_srcline(he->srcline); |
3d1d07ec JK |
794 | free(he); |
795 | } | |
796 | ||
797 | /* | |
798 | * collapse the histogram | |
799 | */ | |
800 | ||
1d037ca1 | 801 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
802 | struct rb_root *root, |
803 | struct hist_entry *he) | |
3d1d07ec | 804 | { |
b9bf0892 | 805 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
806 | struct rb_node *parent = NULL; |
807 | struct hist_entry *iter; | |
808 | int64_t cmp; | |
809 | ||
810 | while (*p != NULL) { | |
811 | parent = *p; | |
1980c2eb | 812 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
813 | |
814 | cmp = hist_entry__collapse(iter, he); | |
815 | ||
816 | if (!cmp) { | |
139c0815 | 817 | he_stat__add_stat(&iter->stat, &he->stat); |
f8be1c8c NK |
818 | if (symbol_conf.cumulate_callchain) |
819 | he_stat__add_stat(iter->stat_acc, he->stat_acc); | |
9ec60972 | 820 | |
1b3a0e95 | 821 | if (symbol_conf.use_callchain) { |
47260645 NK |
822 | callchain_cursor_reset(&callchain_cursor); |
823 | callchain_merge(&callchain_cursor, | |
824 | iter->callchain, | |
1b3a0e95 FW |
825 | he->callchain); |
826 | } | |
3d1d07ec | 827 | hist_entry__free(he); |
fefb0b94 | 828 | return false; |
3d1d07ec JK |
829 | } |
830 | ||
831 | if (cmp < 0) | |
832 | p = &(*p)->rb_left; | |
833 | else | |
834 | p = &(*p)->rb_right; | |
835 | } | |
836 | ||
1980c2eb ACM |
837 | rb_link_node(&he->rb_node_in, parent, p); |
838 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 839 | return true; |
3d1d07ec JK |
840 | } |
841 | ||
1980c2eb | 842 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 843 | { |
1980c2eb ACM |
844 | struct rb_root *root; |
845 | ||
846 | pthread_mutex_lock(&hists->lock); | |
847 | ||
848 | root = hists->entries_in; | |
849 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
850 | hists->entries_in = &hists->entries_in_array[0]; | |
851 | ||
852 | pthread_mutex_unlock(&hists->lock); | |
853 | ||
854 | return root; | |
855 | } | |
856 | ||
90cf1fb5 ACM |
857 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
858 | { | |
859 | hists__filter_entry_by_dso(hists, he); | |
860 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 861 | hists__filter_entry_by_symbol(hists, he); |
90cf1fb5 ACM |
862 | } |
863 | ||
c1fb5651 | 864 | void hists__collapse_resort(struct hists *hists, struct ui_progress *prog) |
1980c2eb ACM |
865 | { |
866 | struct rb_root *root; | |
3d1d07ec JK |
867 | struct rb_node *next; |
868 | struct hist_entry *n; | |
869 | ||
3a5714f8 | 870 | if (!sort__need_collapse) |
3d1d07ec JK |
871 | return; |
872 | ||
1980c2eb ACM |
873 | root = hists__get_rotate_entries_in(hists); |
874 | next = rb_first(root); | |
b9bf0892 | 875 | |
3d1d07ec | 876 | while (next) { |
33e940a2 ACM |
877 | if (session_done()) |
878 | break; | |
1980c2eb ACM |
879 | n = rb_entry(next, struct hist_entry, rb_node_in); |
880 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 881 | |
1980c2eb | 882 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
883 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
884 | /* | |
885 | * If it wasn't combined with one of the entries already | |
886 | * collapsed, we need to apply the filters that may have | |
887 | * been set by, say, the hist_browser. | |
888 | */ | |
889 | hists__apply_filters(hists, n); | |
90cf1fb5 | 890 | } |
c1fb5651 NK |
891 | if (prog) |
892 | ui_progress__update(prog, 1); | |
3d1d07ec | 893 | } |
1980c2eb | 894 | } |
b9bf0892 | 895 | |
043ca389 | 896 | static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b) |
29d720ed | 897 | { |
043ca389 NK |
898 | struct perf_hpp_fmt *fmt; |
899 | int64_t cmp = 0; | |
29d720ed | 900 | |
26d8b338 | 901 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
902 | if (perf_hpp__should_skip(fmt)) |
903 | continue; | |
904 | ||
043ca389 NK |
905 | cmp = fmt->sort(a, b); |
906 | if (cmp) | |
29d720ed NK |
907 | break; |
908 | } | |
909 | ||
043ca389 | 910 | return cmp; |
29d720ed NK |
911 | } |
912 | ||
9283ba9b NK |
913 | static void hists__reset_filter_stats(struct hists *hists) |
914 | { | |
915 | hists->nr_non_filtered_entries = 0; | |
916 | hists->stats.total_non_filtered_period = 0; | |
917 | } | |
918 | ||
919 | void hists__reset_stats(struct hists *hists) | |
920 | { | |
921 | hists->nr_entries = 0; | |
922 | hists->stats.total_period = 0; | |
923 | ||
924 | hists__reset_filter_stats(hists); | |
925 | } | |
926 | ||
927 | static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h) | |
928 | { | |
929 | hists->nr_non_filtered_entries++; | |
930 | hists->stats.total_non_filtered_period += h->stat.period; | |
931 | } | |
932 | ||
933 | void hists__inc_stats(struct hists *hists, struct hist_entry *h) | |
934 | { | |
935 | if (!h->filtered) | |
936 | hists__inc_filter_stats(hists, h); | |
937 | ||
938 | hists->nr_entries++; | |
939 | hists->stats.total_period += h->stat.period; | |
940 | } | |
941 | ||
1c02c4d2 ACM |
942 | static void __hists__insert_output_entry(struct rb_root *entries, |
943 | struct hist_entry *he, | |
944 | u64 min_callchain_hits) | |
3d1d07ec | 945 | { |
1c02c4d2 | 946 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
947 | struct rb_node *parent = NULL; |
948 | struct hist_entry *iter; | |
949 | ||
d599db3f | 950 | if (symbol_conf.use_callchain) |
b9fb9304 | 951 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
952 | min_callchain_hits, &callchain_param); |
953 | ||
954 | while (*p != NULL) { | |
955 | parent = *p; | |
956 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
957 | ||
043ca389 | 958 | if (hist_entry__sort(he, iter) > 0) |
3d1d07ec JK |
959 | p = &(*p)->rb_left; |
960 | else | |
961 | p = &(*p)->rb_right; | |
962 | } | |
963 | ||
964 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 965 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
966 | } |
967 | ||
3a5714f8 | 968 | void hists__output_resort(struct hists *hists) |
3d1d07ec | 969 | { |
1980c2eb | 970 | struct rb_root *root; |
3d1d07ec JK |
971 | struct rb_node *next; |
972 | struct hist_entry *n; | |
3d1d07ec JK |
973 | u64 min_callchain_hits; |
974 | ||
42b28ac0 | 975 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 976 | |
3a5714f8 | 977 | if (sort__need_collapse) |
1980c2eb ACM |
978 | root = &hists->entries_collapsed; |
979 | else | |
980 | root = hists->entries_in; | |
981 | ||
982 | next = rb_first(root); | |
983 | hists->entries = RB_ROOT; | |
3d1d07ec | 984 | |
9283ba9b | 985 | hists__reset_stats(hists); |
42b28ac0 | 986 | hists__reset_col_len(hists); |
fefb0b94 | 987 | |
3d1d07ec | 988 | while (next) { |
1980c2eb ACM |
989 | n = rb_entry(next, struct hist_entry, rb_node_in); |
990 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 991 | |
1980c2eb | 992 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits); |
6263835a | 993 | hists__inc_stats(hists, n); |
ae993efc NK |
994 | |
995 | if (!n->filtered) | |
996 | hists__calc_col_len(hists, n); | |
3d1d07ec | 997 | } |
1980c2eb | 998 | } |
b9bf0892 | 999 | |
42b28ac0 | 1000 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
1001 | enum hist_filter filter) |
1002 | { | |
1003 | h->filtered &= ~(1 << filter); | |
1004 | if (h->filtered) | |
1005 | return; | |
1006 | ||
87e90f43 NK |
1007 | /* force fold unfiltered entry for simplicity */ |
1008 | h->ms.unfolded = false; | |
0f0cbf7a | 1009 | h->row_offset = 0; |
9283ba9b | 1010 | |
1ab1fa5d | 1011 | hists->stats.nr_non_filtered_samples += h->stat.nr_events; |
cc5edb0e | 1012 | |
9283ba9b | 1013 | hists__inc_filter_stats(hists, h); |
42b28ac0 | 1014 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
1015 | } |
1016 | ||
90cf1fb5 ACM |
1017 | |
1018 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
1019 | struct hist_entry *he) | |
1020 | { | |
1021 | if (hists->dso_filter != NULL && | |
1022 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
1023 | he->filtered |= (1 << HIST_FILTER__DSO); | |
1024 | return true; | |
1025 | } | |
1026 | ||
1027 | return false; | |
1028 | } | |
1029 | ||
d7b76f09 | 1030 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
1031 | { |
1032 | struct rb_node *nd; | |
1033 | ||
1ab1fa5d | 1034 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1035 | |
1036 | hists__reset_filter_stats(hists); | |
42b28ac0 | 1037 | hists__reset_col_len(hists); |
b09e0190 | 1038 | |
42b28ac0 | 1039 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
1040 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
1041 | ||
1042 | if (symbol_conf.exclude_other && !h->parent) | |
1043 | continue; | |
1044 | ||
90cf1fb5 | 1045 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 1046 | continue; |
b09e0190 | 1047 | |
42b28ac0 | 1048 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
1049 | } |
1050 | } | |
1051 | ||
90cf1fb5 ACM |
1052 | static bool hists__filter_entry_by_thread(struct hists *hists, |
1053 | struct hist_entry *he) | |
1054 | { | |
1055 | if (hists->thread_filter != NULL && | |
1056 | he->thread != hists->thread_filter) { | |
1057 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
1058 | return true; | |
1059 | } | |
1060 | ||
1061 | return false; | |
1062 | } | |
1063 | ||
d7b76f09 | 1064 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
1065 | { |
1066 | struct rb_node *nd; | |
1067 | ||
1ab1fa5d | 1068 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1069 | |
1070 | hists__reset_filter_stats(hists); | |
42b28ac0 | 1071 | hists__reset_col_len(hists); |
b09e0190 | 1072 | |
42b28ac0 | 1073 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
1074 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
1075 | ||
90cf1fb5 | 1076 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 1077 | continue; |
cc5edb0e | 1078 | |
42b28ac0 | 1079 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
1080 | } |
1081 | } | |
ef7b93a1 | 1082 | |
e94d53eb NK |
1083 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
1084 | struct hist_entry *he) | |
1085 | { | |
1086 | if (hists->symbol_filter_str != NULL && | |
1087 | (!he->ms.sym || strstr(he->ms.sym->name, | |
1088 | hists->symbol_filter_str) == NULL)) { | |
1089 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
1090 | return true; | |
1091 | } | |
1092 | ||
1093 | return false; | |
1094 | } | |
1095 | ||
1096 | void hists__filter_by_symbol(struct hists *hists) | |
1097 | { | |
1098 | struct rb_node *nd; | |
1099 | ||
1ab1fa5d | 1100 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1101 | |
1102 | hists__reset_filter_stats(hists); | |
e94d53eb NK |
1103 | hists__reset_col_len(hists); |
1104 | ||
1105 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
1106 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
1107 | ||
1108 | if (hists__filter_entry_by_symbol(hists, h)) | |
1109 | continue; | |
1110 | ||
1111 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
1112 | } | |
1113 | } | |
1114 | ||
28a6b6aa ACM |
1115 | void events_stats__inc(struct events_stats *stats, u32 type) |
1116 | { | |
1117 | ++stats->nr_events[0]; | |
1118 | ++stats->nr_events[type]; | |
1119 | } | |
1120 | ||
42b28ac0 | 1121 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 1122 | { |
28a6b6aa | 1123 | events_stats__inc(&hists->stats, type); |
c8446b9b | 1124 | } |
95529be4 | 1125 | |
1844dbcb NK |
1126 | void hists__inc_nr_samples(struct hists *hists, bool filtered) |
1127 | { | |
1128 | events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE); | |
1129 | if (!filtered) | |
1130 | hists->stats.nr_non_filtered_samples++; | |
1131 | } | |
1132 | ||
494d70a1 ACM |
1133 | static struct hist_entry *hists__add_dummy_entry(struct hists *hists, |
1134 | struct hist_entry *pair) | |
1135 | { | |
ce74f60e NK |
1136 | struct rb_root *root; |
1137 | struct rb_node **p; | |
494d70a1 ACM |
1138 | struct rb_node *parent = NULL; |
1139 | struct hist_entry *he; | |
354cc40e | 1140 | int64_t cmp; |
494d70a1 | 1141 | |
ce74f60e NK |
1142 | if (sort__need_collapse) |
1143 | root = &hists->entries_collapsed; | |
1144 | else | |
1145 | root = hists->entries_in; | |
1146 | ||
1147 | p = &root->rb_node; | |
1148 | ||
494d70a1 ACM |
1149 | while (*p != NULL) { |
1150 | parent = *p; | |
ce74f60e | 1151 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
494d70a1 | 1152 | |
ce74f60e | 1153 | cmp = hist_entry__collapse(he, pair); |
494d70a1 ACM |
1154 | |
1155 | if (!cmp) | |
1156 | goto out; | |
1157 | ||
1158 | if (cmp < 0) | |
1159 | p = &(*p)->rb_left; | |
1160 | else | |
1161 | p = &(*p)->rb_right; | |
1162 | } | |
1163 | ||
1164 | he = hist_entry__new(pair); | |
1165 | if (he) { | |
30193d78 ACM |
1166 | memset(&he->stat, 0, sizeof(he->stat)); |
1167 | he->hists = hists; | |
ce74f60e NK |
1168 | rb_link_node(&he->rb_node_in, parent, p); |
1169 | rb_insert_color(&he->rb_node_in, root); | |
6263835a | 1170 | hists__inc_stats(hists, he); |
e0af43d2 | 1171 | he->dummy = true; |
494d70a1 ACM |
1172 | } |
1173 | out: | |
1174 | return he; | |
1175 | } | |
1176 | ||
95529be4 ACM |
1177 | static struct hist_entry *hists__find_entry(struct hists *hists, |
1178 | struct hist_entry *he) | |
1179 | { | |
ce74f60e NK |
1180 | struct rb_node *n; |
1181 | ||
1182 | if (sort__need_collapse) | |
1183 | n = hists->entries_collapsed.rb_node; | |
1184 | else | |
1185 | n = hists->entries_in->rb_node; | |
95529be4 ACM |
1186 | |
1187 | while (n) { | |
ce74f60e NK |
1188 | struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); |
1189 | int64_t cmp = hist_entry__collapse(iter, he); | |
95529be4 ACM |
1190 | |
1191 | if (cmp < 0) | |
1192 | n = n->rb_left; | |
1193 | else if (cmp > 0) | |
1194 | n = n->rb_right; | |
1195 | else | |
1196 | return iter; | |
1197 | } | |
1198 | ||
1199 | return NULL; | |
1200 | } | |
1201 | ||
1202 | /* | |
1203 | * Look for pairs to link to the leader buckets (hist_entries): | |
1204 | */ | |
1205 | void hists__match(struct hists *leader, struct hists *other) | |
1206 | { | |
ce74f60e | 1207 | struct rb_root *root; |
95529be4 ACM |
1208 | struct rb_node *nd; |
1209 | struct hist_entry *pos, *pair; | |
1210 | ||
ce74f60e NK |
1211 | if (sort__need_collapse) |
1212 | root = &leader->entries_collapsed; | |
1213 | else | |
1214 | root = leader->entries_in; | |
1215 | ||
1216 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
1217 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
95529be4 ACM |
1218 | pair = hists__find_entry(other, pos); |
1219 | ||
1220 | if (pair) | |
5fa9041b | 1221 | hist_entry__add_pair(pair, pos); |
95529be4 ACM |
1222 | } |
1223 | } | |
494d70a1 ACM |
1224 | |
1225 | /* | |
1226 | * Look for entries in the other hists that are not present in the leader, if | |
1227 | * we find them, just add a dummy entry on the leader hists, with period=0, | |
1228 | * nr_events=0, to serve as the list header. | |
1229 | */ | |
1230 | int hists__link(struct hists *leader, struct hists *other) | |
1231 | { | |
ce74f60e | 1232 | struct rb_root *root; |
494d70a1 ACM |
1233 | struct rb_node *nd; |
1234 | struct hist_entry *pos, *pair; | |
1235 | ||
ce74f60e NK |
1236 | if (sort__need_collapse) |
1237 | root = &other->entries_collapsed; | |
1238 | else | |
1239 | root = other->entries_in; | |
1240 | ||
1241 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
1242 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
494d70a1 ACM |
1243 | |
1244 | if (!hist_entry__has_pairs(pos)) { | |
1245 | pair = hists__add_dummy_entry(leader, pos); | |
1246 | if (pair == NULL) | |
1247 | return -1; | |
5fa9041b | 1248 | hist_entry__add_pair(pos, pair); |
494d70a1 ACM |
1249 | } |
1250 | } | |
1251 | ||
1252 | return 0; | |
1253 | } | |
f2148330 NK |
1254 | |
1255 | u64 hists__total_period(struct hists *hists) | |
1256 | { | |
1257 | return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period : | |
1258 | hists->stats.total_period; | |
1259 | } | |
33db4568 NK |
1260 | |
1261 | int parse_filter_percentage(const struct option *opt __maybe_unused, | |
1262 | const char *arg, int unset __maybe_unused) | |
1263 | { | |
1264 | if (!strcmp(arg, "relative")) | |
1265 | symbol_conf.filter_relative = true; | |
1266 | else if (!strcmp(arg, "absolute")) | |
1267 | symbol_conf.filter_relative = false; | |
1268 | else | |
1269 | return -1; | |
1270 | ||
1271 | return 0; | |
1272 | } | |
0b93da17 NK |
1273 | |
1274 | int perf_hist_config(const char *var, const char *value) | |
1275 | { | |
1276 | if (!strcmp(var, "hist.percentage")) | |
1277 | return parse_filter_percentage(NULL, value, 0); | |
1278 | ||
1279 | return 0; | |
1280 | } |