]>
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" | |
2a1731fb | 6 | #include "evlist.h" |
29d720ed | 7 | #include "evsel.h" |
69bcb019 | 8 | #include "annotate.h" |
740b97f9 | 9 | #include "ui/progress.h" |
9b33827d | 10 | #include <math.h> |
3d1d07ec | 11 | |
90cf1fb5 ACM |
12 | static bool hists__filter_entry_by_dso(struct hists *hists, |
13 | struct hist_entry *he); | |
14 | static bool hists__filter_entry_by_thread(struct hists *hists, | |
15 | struct hist_entry *he); | |
e94d53eb NK |
16 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
17 | struct hist_entry *he); | |
90cf1fb5 | 18 | |
42b28ac0 | 19 | u16 hists__col_len(struct hists *hists, enum hist_column col) |
8a6c5b26 | 20 | { |
42b28ac0 | 21 | return hists->col_len[col]; |
8a6c5b26 ACM |
22 | } |
23 | ||
42b28ac0 | 24 | void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 25 | { |
42b28ac0 | 26 | hists->col_len[col] = len; |
8a6c5b26 ACM |
27 | } |
28 | ||
42b28ac0 | 29 | bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len) |
8a6c5b26 | 30 | { |
42b28ac0 ACM |
31 | if (len > hists__col_len(hists, col)) { |
32 | hists__set_col_len(hists, col, len); | |
8a6c5b26 ACM |
33 | return true; |
34 | } | |
35 | return false; | |
36 | } | |
37 | ||
7ccf4f90 | 38 | void hists__reset_col_len(struct hists *hists) |
8a6c5b26 ACM |
39 | { |
40 | enum hist_column col; | |
41 | ||
42 | for (col = 0; col < HISTC_NR_COLS; ++col) | |
42b28ac0 | 43 | hists__set_col_len(hists, col, 0); |
8a6c5b26 ACM |
44 | } |
45 | ||
b5387528 RAV |
46 | static void hists__set_unres_dso_col_len(struct hists *hists, int dso) |
47 | { | |
48 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; | |
49 | ||
50 | if (hists__col_len(hists, dso) < unresolved_col_width && | |
51 | !symbol_conf.col_width_list_str && !symbol_conf.field_sep && | |
52 | !symbol_conf.dso_list) | |
53 | hists__set_col_len(hists, dso, unresolved_col_width); | |
54 | } | |
55 | ||
7ccf4f90 | 56 | void hists__calc_col_len(struct hists *hists, struct hist_entry *h) |
8a6c5b26 | 57 | { |
b5387528 | 58 | const unsigned int unresolved_col_width = BITS_PER_LONG / 4; |
98a3b32c | 59 | int symlen; |
8a6c5b26 ACM |
60 | u16 len; |
61 | ||
ded19d57 NK |
62 | /* |
63 | * +4 accounts for '[x] ' priv level info | |
64 | * +2 accounts for 0x prefix on raw addresses | |
65 | * +3 accounts for ' y ' symtab origin info | |
66 | */ | |
67 | if (h->ms.sym) { | |
68 | symlen = h->ms.sym->namelen + 4; | |
69 | if (verbose) | |
70 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
71 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
72 | } else { | |
98a3b32c SE |
73 | symlen = unresolved_col_width + 4 + 2; |
74 | hists__new_col_len(hists, HISTC_SYMBOL, symlen); | |
b5387528 | 75 | hists__set_unres_dso_col_len(hists, HISTC_DSO); |
98a3b32c | 76 | } |
8a6c5b26 ACM |
77 | |
78 | len = thread__comm_len(h->thread); | |
42b28ac0 ACM |
79 | if (hists__new_col_len(hists, HISTC_COMM, len)) |
80 | hists__set_col_len(hists, HISTC_THREAD, len + 6); | |
8a6c5b26 ACM |
81 | |
82 | if (h->ms.map) { | |
83 | len = dso__name_len(h->ms.map->dso); | |
42b28ac0 | 84 | hists__new_col_len(hists, HISTC_DSO, len); |
8a6c5b26 | 85 | } |
b5387528 | 86 | |
cb993744 NK |
87 | if (h->parent) |
88 | hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen); | |
89 | ||
b5387528 | 90 | if (h->branch_info) { |
b5387528 RAV |
91 | if (h->branch_info->from.sym) { |
92 | symlen = (int)h->branch_info->from.sym->namelen + 4; | |
ded19d57 NK |
93 | if (verbose) |
94 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
95 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); |
96 | ||
97 | symlen = dso__name_len(h->branch_info->from.map->dso); | |
98 | hists__new_col_len(hists, HISTC_DSO_FROM, symlen); | |
99 | } else { | |
100 | symlen = unresolved_col_width + 4 + 2; | |
101 | hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen); | |
102 | hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM); | |
103 | } | |
104 | ||
105 | if (h->branch_info->to.sym) { | |
106 | symlen = (int)h->branch_info->to.sym->namelen + 4; | |
ded19d57 NK |
107 | if (verbose) |
108 | symlen += BITS_PER_LONG / 4 + 2 + 3; | |
b5387528 RAV |
109 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); |
110 | ||
111 | symlen = dso__name_len(h->branch_info->to.map->dso); | |
112 | hists__new_col_len(hists, HISTC_DSO_TO, symlen); | |
113 | } else { | |
114 | symlen = unresolved_col_width + 4 + 2; | |
115 | hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen); | |
116 | hists__set_unres_dso_col_len(hists, HISTC_DSO_TO); | |
117 | } | |
118 | } | |
98a3b32c SE |
119 | |
120 | if (h->mem_info) { | |
98a3b32c SE |
121 | if (h->mem_info->daddr.sym) { |
122 | symlen = (int)h->mem_info->daddr.sym->namelen + 4 | |
123 | + unresolved_col_width + 2; | |
124 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
125 | symlen); | |
9b32ba71 DZ |
126 | hists__new_col_len(hists, HISTC_MEM_DCACHELINE, |
127 | symlen + 1); | |
98a3b32c SE |
128 | } else { |
129 | symlen = unresolved_col_width + 4 + 2; | |
130 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, | |
131 | symlen); | |
132 | } | |
133 | if (h->mem_info->daddr.map) { | |
134 | symlen = dso__name_len(h->mem_info->daddr.map->dso); | |
135 | hists__new_col_len(hists, HISTC_MEM_DADDR_DSO, | |
136 | symlen); | |
137 | } else { | |
138 | symlen = unresolved_col_width + 4 + 2; | |
139 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
140 | } | |
141 | } else { | |
142 | symlen = unresolved_col_width + 4 + 2; | |
143 | hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen); | |
144 | hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO); | |
145 | } | |
146 | ||
147 | hists__new_col_len(hists, HISTC_MEM_LOCKED, 6); | |
148 | hists__new_col_len(hists, HISTC_MEM_TLB, 22); | |
149 | hists__new_col_len(hists, HISTC_MEM_SNOOP, 12); | |
150 | hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3); | |
151 | hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12); | |
152 | hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12); | |
475eeab9 | 153 | |
e8e6d37e ACM |
154 | if (h->srcline) |
155 | hists__new_col_len(hists, HISTC_SRCLINE, strlen(h->srcline)); | |
156 | ||
475eeab9 AK |
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 | ||
956b65e1 ACM |
247 | static void hists__delete_entry(struct hists *hists, struct hist_entry *he) |
248 | { | |
249 | rb_erase(&he->rb_node, &hists->entries); | |
250 | ||
251 | if (sort__need_collapse) | |
252 | rb_erase(&he->rb_node_in, &hists->entries_collapsed); | |
253 | ||
254 | --hists->nr_entries; | |
255 | if (!he->filtered) | |
256 | --hists->nr_non_filtered_entries; | |
257 | ||
258 | hist_entry__delete(he); | |
259 | } | |
260 | ||
3a5714f8 | 261 | void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel) |
ab81f3fd ACM |
262 | { |
263 | struct rb_node *next = rb_first(&hists->entries); | |
264 | struct hist_entry *n; | |
265 | ||
266 | while (next) { | |
267 | n = rb_entry(next, struct hist_entry, rb_node); | |
268 | next = rb_next(&n->rb_node); | |
b079d4e9 ACM |
269 | if (((zap_user && n->level == '.') || |
270 | (zap_kernel && n->level != '.') || | |
4c47f4fc | 271 | hists__decay_entry(hists, n))) { |
956b65e1 | 272 | hists__delete_entry(hists, n); |
ab81f3fd ACM |
273 | } |
274 | } | |
275 | } | |
276 | ||
701937bd NK |
277 | void hists__delete_entries(struct hists *hists) |
278 | { | |
279 | struct rb_node *next = rb_first(&hists->entries); | |
280 | struct hist_entry *n; | |
281 | ||
282 | while (next) { | |
283 | n = rb_entry(next, struct hist_entry, rb_node); | |
284 | next = rb_next(&n->rb_node); | |
285 | ||
956b65e1 | 286 | hists__delete_entry(hists, n); |
701937bd NK |
287 | } |
288 | } | |
289 | ||
3d1d07ec | 290 | /* |
c82ee828 | 291 | * histogram, sorted on item, collects periods |
3d1d07ec JK |
292 | */ |
293 | ||
a0b51af3 NK |
294 | static struct hist_entry *hist_entry__new(struct hist_entry *template, |
295 | bool sample_self) | |
28e2a106 | 296 | { |
f8be1c8c NK |
297 | size_t callchain_size = 0; |
298 | struct hist_entry *he; | |
299 | ||
82aa019e | 300 | if (symbol_conf.use_callchain) |
f8be1c8c NK |
301 | callchain_size = sizeof(struct callchain_root); |
302 | ||
303 | he = zalloc(sizeof(*he) + callchain_size); | |
28e2a106 | 304 | |
12c14278 ACM |
305 | if (he != NULL) { |
306 | *he = *template; | |
c4b35351 | 307 | |
f8be1c8c NK |
308 | if (symbol_conf.cumulate_callchain) { |
309 | he->stat_acc = malloc(sizeof(he->stat)); | |
310 | if (he->stat_acc == NULL) { | |
311 | free(he); | |
312 | return NULL; | |
313 | } | |
314 | memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); | |
a0b51af3 NK |
315 | if (!sample_self) |
316 | memset(&he->stat, 0, sizeof(he->stat)); | |
f8be1c8c NK |
317 | } |
318 | ||
5c24b67a | 319 | map__get(he->ms.map); |
3cf0cb1f SE |
320 | |
321 | if (he->branch_info) { | |
26353a61 NK |
322 | /* |
323 | * This branch info is (a part of) allocated from | |
644f2df2 | 324 | * sample__resolve_bstack() and will be freed after |
26353a61 NK |
325 | * adding new entries. So we need to save a copy. |
326 | */ | |
327 | he->branch_info = malloc(sizeof(*he->branch_info)); | |
328 | if (he->branch_info == NULL) { | |
5c24b67a | 329 | map__zput(he->ms.map); |
f8be1c8c | 330 | free(he->stat_acc); |
26353a61 NK |
331 | free(he); |
332 | return NULL; | |
333 | } | |
334 | ||
335 | memcpy(he->branch_info, template->branch_info, | |
336 | sizeof(*he->branch_info)); | |
337 | ||
5c24b67a ACM |
338 | map__get(he->branch_info->from.map); |
339 | map__get(he->branch_info->to.map); | |
3cf0cb1f SE |
340 | } |
341 | ||
98a3b32c | 342 | if (he->mem_info) { |
5c24b67a ACM |
343 | map__get(he->mem_info->iaddr.map); |
344 | map__get(he->mem_info->daddr.map); | |
98a3b32c SE |
345 | } |
346 | ||
28e2a106 | 347 | if (symbol_conf.use_callchain) |
12c14278 | 348 | callchain_init(he->callchain); |
b821c732 ACM |
349 | |
350 | INIT_LIST_HEAD(&he->pairs.node); | |
f3b623b8 | 351 | thread__get(he->thread); |
28e2a106 ACM |
352 | } |
353 | ||
12c14278 | 354 | return he; |
28e2a106 ACM |
355 | } |
356 | ||
7a007ca9 ACM |
357 | static u8 symbol__parent_filter(const struct symbol *parent) |
358 | { | |
359 | if (symbol_conf.exclude_other && parent == NULL) | |
360 | return 1 << HIST_FILTER__PARENT; | |
361 | return 0; | |
362 | } | |
363 | ||
e7e0efcd ACM |
364 | static struct hist_entry *hists__findnew_entry(struct hists *hists, |
365 | struct hist_entry *entry, | |
366 | struct addr_location *al, | |
367 | bool sample_self) | |
9735abf1 | 368 | { |
1980c2eb | 369 | struct rb_node **p; |
9735abf1 ACM |
370 | struct rb_node *parent = NULL; |
371 | struct hist_entry *he; | |
354cc40e | 372 | int64_t cmp; |
f1cbf78d NK |
373 | u64 period = entry->stat.period; |
374 | u64 weight = entry->stat.weight; | |
9735abf1 | 375 | |
1980c2eb ACM |
376 | p = &hists->entries_in->rb_node; |
377 | ||
9735abf1 ACM |
378 | while (*p != NULL) { |
379 | parent = *p; | |
1980c2eb | 380 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
9735abf1 | 381 | |
9afcf930 NK |
382 | /* |
383 | * Make sure that it receives arguments in a same order as | |
384 | * hist_entry__collapse() so that we can use an appropriate | |
385 | * function when searching an entry regardless which sort | |
386 | * keys were used. | |
387 | */ | |
388 | cmp = hist_entry__cmp(he, entry); | |
9735abf1 ACM |
389 | |
390 | if (!cmp) { | |
a0b51af3 NK |
391 | if (sample_self) |
392 | he_stat__add_period(&he->stat, period, weight); | |
f8be1c8c NK |
393 | if (symbol_conf.cumulate_callchain) |
394 | he_stat__add_period(he->stat_acc, period, weight); | |
63fa471d | 395 | |
ceb2acbc | 396 | /* |
e80faac0 | 397 | * This mem info was allocated from sample__resolve_mem |
ceb2acbc NK |
398 | * and will not be used anymore. |
399 | */ | |
74cf249d | 400 | zfree(&entry->mem_info); |
ceb2acbc | 401 | |
63fa471d DM |
402 | /* If the map of an existing hist_entry has |
403 | * become out-of-date due to an exec() or | |
404 | * similar, update it. Otherwise we will | |
405 | * mis-adjust symbol addresses when computing | |
406 | * the history counter to increment. | |
407 | */ | |
408 | if (he->ms.map != entry->ms.map) { | |
5c24b67a ACM |
409 | map__put(he->ms.map); |
410 | he->ms.map = map__get(entry->ms.map); | |
63fa471d | 411 | } |
28e2a106 | 412 | goto out; |
9735abf1 ACM |
413 | } |
414 | ||
415 | if (cmp < 0) | |
416 | p = &(*p)->rb_left; | |
417 | else | |
418 | p = &(*p)->rb_right; | |
419 | } | |
420 | ||
a0b51af3 | 421 | he = hist_entry__new(entry, sample_self); |
9735abf1 | 422 | if (!he) |
27a0dcb7 | 423 | return NULL; |
1980c2eb | 424 | |
590cd344 NK |
425 | hists->nr_entries++; |
426 | ||
1980c2eb ACM |
427 | rb_link_node(&he->rb_node_in, parent, p); |
428 | rb_insert_color(&he->rb_node_in, hists->entries_in); | |
28e2a106 | 429 | out: |
a0b51af3 NK |
430 | if (sample_self) |
431 | he_stat__add_cpumode_period(&he->stat, al->cpumode, period); | |
f8be1c8c NK |
432 | if (symbol_conf.cumulate_callchain) |
433 | he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); | |
9735abf1 ACM |
434 | return he; |
435 | } | |
436 | ||
c824c433 | 437 | struct hist_entry *__hists__add_entry(struct hists *hists, |
b5387528 | 438 | struct addr_location *al, |
41a4e6e2 NK |
439 | struct symbol *sym_parent, |
440 | struct branch_info *bi, | |
441 | struct mem_info *mi, | |
a0b51af3 NK |
442 | u64 period, u64 weight, u64 transaction, |
443 | bool sample_self) | |
b5387528 RAV |
444 | { |
445 | struct hist_entry entry = { | |
446 | .thread = al->thread, | |
4dfced35 | 447 | .comm = thread__comm(al->thread), |
b5387528 RAV |
448 | .ms = { |
449 | .map = al->map, | |
450 | .sym = al->sym, | |
451 | }, | |
7365be55 DZ |
452 | .cpu = al->cpu, |
453 | .cpumode = al->cpumode, | |
454 | .ip = al->addr, | |
455 | .level = al->level, | |
b24c28f7 | 456 | .stat = { |
c4b35351 | 457 | .nr_events = 1, |
41a4e6e2 | 458 | .period = period, |
05484298 | 459 | .weight = weight, |
b24c28f7 | 460 | }, |
b5387528 | 461 | .parent = sym_parent, |
2c86c7ca | 462 | .filtered = symbol__parent_filter(sym_parent) | al->filtered, |
c824c433 | 463 | .hists = hists, |
41a4e6e2 NK |
464 | .branch_info = bi, |
465 | .mem_info = mi, | |
475eeab9 | 466 | .transaction = transaction, |
b5387528 RAV |
467 | }; |
468 | ||
e7e0efcd | 469 | return hists__findnew_entry(hists, &entry, al, sample_self); |
b5387528 RAV |
470 | } |
471 | ||
69bcb019 NK |
472 | static int |
473 | iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, | |
474 | struct addr_location *al __maybe_unused) | |
475 | { | |
476 | return 0; | |
477 | } | |
478 | ||
479 | static int | |
480 | iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, | |
481 | struct addr_location *al __maybe_unused) | |
482 | { | |
483 | return 0; | |
484 | } | |
485 | ||
486 | static int | |
487 | iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
488 | { | |
489 | struct perf_sample *sample = iter->sample; | |
490 | struct mem_info *mi; | |
491 | ||
492 | mi = sample__resolve_mem(sample, al); | |
493 | if (mi == NULL) | |
494 | return -ENOMEM; | |
495 | ||
496 | iter->priv = mi; | |
497 | return 0; | |
498 | } | |
499 | ||
500 | static int | |
501 | iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
502 | { | |
503 | u64 cost; | |
504 | struct mem_info *mi = iter->priv; | |
4ea062ed | 505 | struct hists *hists = evsel__hists(iter->evsel); |
69bcb019 NK |
506 | struct hist_entry *he; |
507 | ||
508 | if (mi == NULL) | |
509 | return -EINVAL; | |
510 | ||
511 | cost = iter->sample->weight; | |
512 | if (!cost) | |
513 | cost = 1; | |
514 | ||
515 | /* | |
516 | * must pass period=weight in order to get the correct | |
517 | * sorting from hists__collapse_resort() which is solely | |
518 | * based on periods. We want sorting be done on nr_events * weight | |
519 | * and this is indirectly achieved by passing period=weight here | |
520 | * and the he_stat__add_period() function. | |
521 | */ | |
4ea062ed | 522 | he = __hists__add_entry(hists, al, iter->parent, NULL, mi, |
a0b51af3 | 523 | cost, cost, 0, true); |
69bcb019 NK |
524 | if (!he) |
525 | return -ENOMEM; | |
526 | ||
527 | iter->he = he; | |
528 | return 0; | |
529 | } | |
530 | ||
531 | static int | |
9d3c02d7 NK |
532 | iter_finish_mem_entry(struct hist_entry_iter *iter, |
533 | struct addr_location *al __maybe_unused) | |
69bcb019 NK |
534 | { |
535 | struct perf_evsel *evsel = iter->evsel; | |
4ea062ed | 536 | struct hists *hists = evsel__hists(evsel); |
69bcb019 | 537 | struct hist_entry *he = iter->he; |
69bcb019 NK |
538 | int err = -EINVAL; |
539 | ||
540 | if (he == NULL) | |
541 | goto out; | |
542 | ||
4ea062ed | 543 | hists__inc_nr_samples(hists, he->filtered); |
69bcb019 NK |
544 | |
545 | err = hist_entry__append_callchain(he, iter->sample); | |
546 | ||
547 | out: | |
548 | /* | |
e7e0efcd ACM |
549 | * We don't need to free iter->priv (mem_info) here since the mem info |
550 | * was either already freed in hists__findnew_entry() or passed to a | |
551 | * new hist entry by hist_entry__new(). | |
69bcb019 NK |
552 | */ |
553 | iter->priv = NULL; | |
554 | ||
555 | iter->he = NULL; | |
556 | return err; | |
557 | } | |
558 | ||
559 | static int | |
560 | iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
561 | { | |
562 | struct branch_info *bi; | |
563 | struct perf_sample *sample = iter->sample; | |
564 | ||
565 | bi = sample__resolve_bstack(sample, al); | |
566 | if (!bi) | |
567 | return -ENOMEM; | |
568 | ||
569 | iter->curr = 0; | |
570 | iter->total = sample->branch_stack->nr; | |
571 | ||
572 | iter->priv = bi; | |
573 | return 0; | |
574 | } | |
575 | ||
576 | static int | |
577 | iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused, | |
578 | struct addr_location *al __maybe_unused) | |
579 | { | |
9d3c02d7 NK |
580 | /* to avoid calling callback function */ |
581 | iter->he = NULL; | |
582 | ||
69bcb019 NK |
583 | return 0; |
584 | } | |
585 | ||
586 | static int | |
587 | iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
588 | { | |
589 | struct branch_info *bi = iter->priv; | |
590 | int i = iter->curr; | |
591 | ||
592 | if (bi == NULL) | |
593 | return 0; | |
594 | ||
595 | if (iter->curr >= iter->total) | |
596 | return 0; | |
597 | ||
598 | al->map = bi[i].to.map; | |
599 | al->sym = bi[i].to.sym; | |
600 | al->addr = bi[i].to.addr; | |
601 | return 1; | |
602 | } | |
603 | ||
604 | static int | |
605 | iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
606 | { | |
9d3c02d7 | 607 | struct branch_info *bi; |
69bcb019 | 608 | struct perf_evsel *evsel = iter->evsel; |
4ea062ed | 609 | struct hists *hists = evsel__hists(evsel); |
69bcb019 NK |
610 | struct hist_entry *he = NULL; |
611 | int i = iter->curr; | |
612 | int err = 0; | |
613 | ||
614 | bi = iter->priv; | |
615 | ||
616 | if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym)) | |
617 | goto out; | |
618 | ||
619 | /* | |
620 | * The report shows the percentage of total branches captured | |
621 | * and not events sampled. Thus we use a pseudo period of 1. | |
622 | */ | |
4ea062ed | 623 | he = __hists__add_entry(hists, al, iter->parent, &bi[i], NULL, |
0e332f03 AK |
624 | 1, bi->flags.cycles ? bi->flags.cycles : 1, |
625 | 0, true); | |
69bcb019 NK |
626 | if (he == NULL) |
627 | return -ENOMEM; | |
628 | ||
4ea062ed | 629 | hists__inc_nr_samples(hists, he->filtered); |
69bcb019 NK |
630 | |
631 | out: | |
632 | iter->he = he; | |
633 | iter->curr++; | |
634 | return err; | |
635 | } | |
636 | ||
637 | static int | |
638 | iter_finish_branch_entry(struct hist_entry_iter *iter, | |
639 | struct addr_location *al __maybe_unused) | |
640 | { | |
641 | zfree(&iter->priv); | |
642 | iter->he = NULL; | |
643 | ||
644 | return iter->curr >= iter->total ? 0 : -1; | |
645 | } | |
646 | ||
647 | static int | |
648 | iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused, | |
649 | struct addr_location *al __maybe_unused) | |
650 | { | |
651 | return 0; | |
652 | } | |
653 | ||
654 | static int | |
655 | iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al) | |
656 | { | |
657 | struct perf_evsel *evsel = iter->evsel; | |
658 | struct perf_sample *sample = iter->sample; | |
659 | struct hist_entry *he; | |
660 | ||
4ea062ed | 661 | he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, |
69bcb019 | 662 | sample->period, sample->weight, |
a0b51af3 | 663 | sample->transaction, true); |
69bcb019 NK |
664 | if (he == NULL) |
665 | return -ENOMEM; | |
666 | ||
667 | iter->he = he; | |
668 | return 0; | |
669 | } | |
670 | ||
671 | static int | |
9d3c02d7 NK |
672 | iter_finish_normal_entry(struct hist_entry_iter *iter, |
673 | struct addr_location *al __maybe_unused) | |
69bcb019 | 674 | { |
69bcb019 NK |
675 | struct hist_entry *he = iter->he; |
676 | struct perf_evsel *evsel = iter->evsel; | |
677 | struct perf_sample *sample = iter->sample; | |
678 | ||
679 | if (he == NULL) | |
680 | return 0; | |
681 | ||
682 | iter->he = NULL; | |
683 | ||
4ea062ed | 684 | hists__inc_nr_samples(evsel__hists(evsel), he->filtered); |
69bcb019 NK |
685 | |
686 | return hist_entry__append_callchain(he, sample); | |
687 | } | |
688 | ||
7a13aa28 NK |
689 | static int |
690 | iter_prepare_cumulative_entry(struct hist_entry_iter *iter __maybe_unused, | |
691 | struct addr_location *al __maybe_unused) | |
692 | { | |
b4d3c8bd NK |
693 | struct hist_entry **he_cache; |
694 | ||
7a13aa28 | 695 | callchain_cursor_commit(&callchain_cursor); |
b4d3c8bd NK |
696 | |
697 | /* | |
698 | * This is for detecting cycles or recursions so that they're | |
699 | * cumulated only one time to prevent entries more than 100% | |
700 | * overhead. | |
701 | */ | |
702 | he_cache = malloc(sizeof(*he_cache) * (PERF_MAX_STACK_DEPTH + 1)); | |
703 | if (he_cache == NULL) | |
704 | return -ENOMEM; | |
705 | ||
706 | iter->priv = he_cache; | |
707 | iter->curr = 0; | |
708 | ||
7a13aa28 NK |
709 | return 0; |
710 | } | |
711 | ||
712 | static int | |
713 | iter_add_single_cumulative_entry(struct hist_entry_iter *iter, | |
714 | struct addr_location *al) | |
715 | { | |
716 | struct perf_evsel *evsel = iter->evsel; | |
4ea062ed | 717 | struct hists *hists = evsel__hists(evsel); |
7a13aa28 | 718 | struct perf_sample *sample = iter->sample; |
b4d3c8bd | 719 | struct hist_entry **he_cache = iter->priv; |
7a13aa28 NK |
720 | struct hist_entry *he; |
721 | int err = 0; | |
722 | ||
4ea062ed | 723 | he = __hists__add_entry(hists, al, iter->parent, NULL, NULL, |
7a13aa28 NK |
724 | sample->period, sample->weight, |
725 | sample->transaction, true); | |
726 | if (he == NULL) | |
727 | return -ENOMEM; | |
728 | ||
729 | iter->he = he; | |
b4d3c8bd | 730 | he_cache[iter->curr++] = he; |
7a13aa28 | 731 | |
82aa019e | 732 | hist_entry__append_callchain(he, sample); |
be7f855a NK |
733 | |
734 | /* | |
735 | * We need to re-initialize the cursor since callchain_append() | |
736 | * advanced the cursor to the end. | |
737 | */ | |
738 | callchain_cursor_commit(&callchain_cursor); | |
739 | ||
4ea062ed | 740 | hists__inc_nr_samples(hists, he->filtered); |
7a13aa28 NK |
741 | |
742 | return err; | |
743 | } | |
744 | ||
745 | static int | |
746 | iter_next_cumulative_entry(struct hist_entry_iter *iter, | |
747 | struct addr_location *al) | |
748 | { | |
749 | struct callchain_cursor_node *node; | |
750 | ||
751 | node = callchain_cursor_current(&callchain_cursor); | |
752 | if (node == NULL) | |
753 | return 0; | |
754 | ||
c7405d85 | 755 | return fill_callchain_info(al, node, iter->hide_unresolved); |
7a13aa28 NK |
756 | } |
757 | ||
758 | static int | |
759 | iter_add_next_cumulative_entry(struct hist_entry_iter *iter, | |
760 | struct addr_location *al) | |
761 | { | |
762 | struct perf_evsel *evsel = iter->evsel; | |
763 | struct perf_sample *sample = iter->sample; | |
b4d3c8bd | 764 | struct hist_entry **he_cache = iter->priv; |
7a13aa28 | 765 | struct hist_entry *he; |
b4d3c8bd | 766 | struct hist_entry he_tmp = { |
5cef8976 | 767 | .hists = evsel__hists(evsel), |
b4d3c8bd NK |
768 | .cpu = al->cpu, |
769 | .thread = al->thread, | |
770 | .comm = thread__comm(al->thread), | |
771 | .ip = al->addr, | |
772 | .ms = { | |
773 | .map = al->map, | |
774 | .sym = al->sym, | |
775 | }, | |
776 | .parent = iter->parent, | |
777 | }; | |
778 | int i; | |
be7f855a NK |
779 | struct callchain_cursor cursor; |
780 | ||
781 | callchain_cursor_snapshot(&cursor, &callchain_cursor); | |
782 | ||
783 | callchain_cursor_advance(&callchain_cursor); | |
b4d3c8bd NK |
784 | |
785 | /* | |
786 | * Check if there's duplicate entries in the callchain. | |
787 | * It's possible that it has cycles or recursive calls. | |
788 | */ | |
789 | for (i = 0; i < iter->curr; i++) { | |
9d3c02d7 NK |
790 | if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) { |
791 | /* to avoid calling callback function */ | |
792 | iter->he = NULL; | |
b4d3c8bd | 793 | return 0; |
9d3c02d7 | 794 | } |
b4d3c8bd | 795 | } |
7a13aa28 | 796 | |
4ea062ed | 797 | he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, |
7a13aa28 NK |
798 | sample->period, sample->weight, |
799 | sample->transaction, false); | |
800 | if (he == NULL) | |
801 | return -ENOMEM; | |
802 | ||
803 | iter->he = he; | |
b4d3c8bd | 804 | he_cache[iter->curr++] = he; |
7a13aa28 | 805 | |
82aa019e NK |
806 | if (symbol_conf.use_callchain) |
807 | callchain_append(he->callchain, &cursor, sample->period); | |
7a13aa28 NK |
808 | return 0; |
809 | } | |
810 | ||
811 | static int | |
812 | iter_finish_cumulative_entry(struct hist_entry_iter *iter, | |
813 | struct addr_location *al __maybe_unused) | |
814 | { | |
b4d3c8bd | 815 | zfree(&iter->priv); |
7a13aa28 | 816 | iter->he = NULL; |
b4d3c8bd | 817 | |
7a13aa28 NK |
818 | return 0; |
819 | } | |
820 | ||
69bcb019 NK |
821 | const struct hist_iter_ops hist_iter_mem = { |
822 | .prepare_entry = iter_prepare_mem_entry, | |
823 | .add_single_entry = iter_add_single_mem_entry, | |
824 | .next_entry = iter_next_nop_entry, | |
825 | .add_next_entry = iter_add_next_nop_entry, | |
826 | .finish_entry = iter_finish_mem_entry, | |
827 | }; | |
828 | ||
829 | const struct hist_iter_ops hist_iter_branch = { | |
830 | .prepare_entry = iter_prepare_branch_entry, | |
831 | .add_single_entry = iter_add_single_branch_entry, | |
832 | .next_entry = iter_next_branch_entry, | |
833 | .add_next_entry = iter_add_next_branch_entry, | |
834 | .finish_entry = iter_finish_branch_entry, | |
835 | }; | |
836 | ||
837 | const struct hist_iter_ops hist_iter_normal = { | |
838 | .prepare_entry = iter_prepare_normal_entry, | |
839 | .add_single_entry = iter_add_single_normal_entry, | |
840 | .next_entry = iter_next_nop_entry, | |
841 | .add_next_entry = iter_add_next_nop_entry, | |
842 | .finish_entry = iter_finish_normal_entry, | |
843 | }; | |
844 | ||
7a13aa28 NK |
845 | const struct hist_iter_ops hist_iter_cumulative = { |
846 | .prepare_entry = iter_prepare_cumulative_entry, | |
847 | .add_single_entry = iter_add_single_cumulative_entry, | |
848 | .next_entry = iter_next_cumulative_entry, | |
849 | .add_next_entry = iter_add_next_cumulative_entry, | |
850 | .finish_entry = iter_finish_cumulative_entry, | |
851 | }; | |
852 | ||
69bcb019 | 853 | int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al, |
9d3c02d7 | 854 | int max_stack_depth, void *arg) |
69bcb019 NK |
855 | { |
856 | int err, err2; | |
857 | ||
063bd936 NK |
858 | err = sample__resolve_callchain(iter->sample, &iter->parent, |
859 | iter->evsel, al, max_stack_depth); | |
69bcb019 NK |
860 | if (err) |
861 | return err; | |
862 | ||
69bcb019 NK |
863 | err = iter->ops->prepare_entry(iter, al); |
864 | if (err) | |
865 | goto out; | |
866 | ||
867 | err = iter->ops->add_single_entry(iter, al); | |
868 | if (err) | |
869 | goto out; | |
870 | ||
9d3c02d7 NK |
871 | if (iter->he && iter->add_entry_cb) { |
872 | err = iter->add_entry_cb(iter, al, true, arg); | |
873 | if (err) | |
874 | goto out; | |
875 | } | |
876 | ||
69bcb019 NK |
877 | while (iter->ops->next_entry(iter, al)) { |
878 | err = iter->ops->add_next_entry(iter, al); | |
879 | if (err) | |
880 | break; | |
9d3c02d7 NK |
881 | |
882 | if (iter->he && iter->add_entry_cb) { | |
883 | err = iter->add_entry_cb(iter, al, false, arg); | |
884 | if (err) | |
885 | goto out; | |
886 | } | |
69bcb019 NK |
887 | } |
888 | ||
889 | out: | |
890 | err2 = iter->ops->finish_entry(iter, al); | |
891 | if (!err) | |
892 | err = err2; | |
893 | ||
894 | return err; | |
895 | } | |
896 | ||
3d1d07ec JK |
897 | int64_t |
898 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | |
899 | { | |
093f0ef3 | 900 | struct perf_hpp_fmt *fmt; |
3d1d07ec JK |
901 | int64_t cmp = 0; |
902 | ||
093f0ef3 | 903 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
904 | if (perf_hpp__should_skip(fmt)) |
905 | continue; | |
906 | ||
87bbdf76 | 907 | cmp = fmt->cmp(fmt, left, right); |
3d1d07ec JK |
908 | if (cmp) |
909 | break; | |
910 | } | |
911 | ||
912 | return cmp; | |
913 | } | |
914 | ||
915 | int64_t | |
916 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | |
917 | { | |
093f0ef3 | 918 | struct perf_hpp_fmt *fmt; |
3d1d07ec JK |
919 | int64_t cmp = 0; |
920 | ||
093f0ef3 | 921 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
922 | if (perf_hpp__should_skip(fmt)) |
923 | continue; | |
924 | ||
87bbdf76 | 925 | cmp = fmt->collapse(fmt, left, right); |
3d1d07ec JK |
926 | if (cmp) |
927 | break; | |
928 | } | |
929 | ||
930 | return cmp; | |
931 | } | |
932 | ||
6733d1bf | 933 | void hist_entry__delete(struct hist_entry *he) |
3d1d07ec | 934 | { |
f3b623b8 | 935 | thread__zput(he->thread); |
5c24b67a ACM |
936 | map__zput(he->ms.map); |
937 | ||
938 | if (he->branch_info) { | |
939 | map__zput(he->branch_info->from.map); | |
940 | map__zput(he->branch_info->to.map); | |
941 | zfree(&he->branch_info); | |
942 | } | |
943 | ||
944 | if (he->mem_info) { | |
945 | map__zput(he->mem_info->iaddr.map); | |
946 | map__zput(he->mem_info->daddr.map); | |
947 | zfree(&he->mem_info); | |
948 | } | |
949 | ||
f8be1c8c | 950 | zfree(&he->stat_acc); |
f048d548 | 951 | free_srcline(he->srcline); |
d114960c | 952 | free_callchain(he->callchain); |
3d1d07ec JK |
953 | free(he); |
954 | } | |
955 | ||
956 | /* | |
957 | * collapse the histogram | |
958 | */ | |
959 | ||
1d037ca1 | 960 | static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused, |
1b3a0e95 FW |
961 | struct rb_root *root, |
962 | struct hist_entry *he) | |
3d1d07ec | 963 | { |
b9bf0892 | 964 | struct rb_node **p = &root->rb_node; |
3d1d07ec JK |
965 | struct rb_node *parent = NULL; |
966 | struct hist_entry *iter; | |
967 | int64_t cmp; | |
968 | ||
969 | while (*p != NULL) { | |
970 | parent = *p; | |
1980c2eb | 971 | iter = rb_entry(parent, struct hist_entry, rb_node_in); |
3d1d07ec JK |
972 | |
973 | cmp = hist_entry__collapse(iter, he); | |
974 | ||
975 | if (!cmp) { | |
139c0815 | 976 | he_stat__add_stat(&iter->stat, &he->stat); |
f8be1c8c NK |
977 | if (symbol_conf.cumulate_callchain) |
978 | he_stat__add_stat(iter->stat_acc, he->stat_acc); | |
9ec60972 | 979 | |
1b3a0e95 | 980 | if (symbol_conf.use_callchain) { |
47260645 NK |
981 | callchain_cursor_reset(&callchain_cursor); |
982 | callchain_merge(&callchain_cursor, | |
983 | iter->callchain, | |
1b3a0e95 FW |
984 | he->callchain); |
985 | } | |
6733d1bf | 986 | hist_entry__delete(he); |
fefb0b94 | 987 | return false; |
3d1d07ec JK |
988 | } |
989 | ||
990 | if (cmp < 0) | |
991 | p = &(*p)->rb_left; | |
992 | else | |
993 | p = &(*p)->rb_right; | |
994 | } | |
740b97f9 | 995 | hists->nr_entries++; |
3d1d07ec | 996 | |
1980c2eb ACM |
997 | rb_link_node(&he->rb_node_in, parent, p); |
998 | rb_insert_color(&he->rb_node_in, root); | |
fefb0b94 | 999 | return true; |
3d1d07ec JK |
1000 | } |
1001 | ||
1980c2eb | 1002 | static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) |
3d1d07ec | 1003 | { |
1980c2eb ACM |
1004 | struct rb_root *root; |
1005 | ||
1006 | pthread_mutex_lock(&hists->lock); | |
1007 | ||
1008 | root = hists->entries_in; | |
1009 | if (++hists->entries_in > &hists->entries_in_array[1]) | |
1010 | hists->entries_in = &hists->entries_in_array[0]; | |
1011 | ||
1012 | pthread_mutex_unlock(&hists->lock); | |
1013 | ||
1014 | return root; | |
1015 | } | |
1016 | ||
90cf1fb5 ACM |
1017 | static void hists__apply_filters(struct hists *hists, struct hist_entry *he) |
1018 | { | |
1019 | hists__filter_entry_by_dso(hists, he); | |
1020 | hists__filter_entry_by_thread(hists, he); | |
e94d53eb | 1021 | hists__filter_entry_by_symbol(hists, he); |
90cf1fb5 ACM |
1022 | } |
1023 | ||
c1fb5651 | 1024 | void hists__collapse_resort(struct hists *hists, struct ui_progress *prog) |
1980c2eb ACM |
1025 | { |
1026 | struct rb_root *root; | |
3d1d07ec JK |
1027 | struct rb_node *next; |
1028 | struct hist_entry *n; | |
1029 | ||
3a5714f8 | 1030 | if (!sort__need_collapse) |
3d1d07ec JK |
1031 | return; |
1032 | ||
740b97f9 NK |
1033 | hists->nr_entries = 0; |
1034 | ||
1980c2eb | 1035 | root = hists__get_rotate_entries_in(hists); |
740b97f9 | 1036 | |
1980c2eb | 1037 | next = rb_first(root); |
b9bf0892 | 1038 | |
3d1d07ec | 1039 | while (next) { |
33e940a2 ACM |
1040 | if (session_done()) |
1041 | break; | |
1980c2eb ACM |
1042 | n = rb_entry(next, struct hist_entry, rb_node_in); |
1043 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 1044 | |
1980c2eb | 1045 | rb_erase(&n->rb_node_in, root); |
90cf1fb5 ACM |
1046 | if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) { |
1047 | /* | |
1048 | * If it wasn't combined with one of the entries already | |
1049 | * collapsed, we need to apply the filters that may have | |
1050 | * been set by, say, the hist_browser. | |
1051 | */ | |
1052 | hists__apply_filters(hists, n); | |
90cf1fb5 | 1053 | } |
c1fb5651 NK |
1054 | if (prog) |
1055 | ui_progress__update(prog, 1); | |
3d1d07ec | 1056 | } |
1980c2eb | 1057 | } |
b9bf0892 | 1058 | |
043ca389 | 1059 | static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b) |
29d720ed | 1060 | { |
043ca389 NK |
1061 | struct perf_hpp_fmt *fmt; |
1062 | int64_t cmp = 0; | |
29d720ed | 1063 | |
26d8b338 | 1064 | perf_hpp__for_each_sort_list(fmt) { |
e67d49a7 NK |
1065 | if (perf_hpp__should_skip(fmt)) |
1066 | continue; | |
1067 | ||
87bbdf76 | 1068 | cmp = fmt->sort(fmt, a, b); |
043ca389 | 1069 | if (cmp) |
29d720ed NK |
1070 | break; |
1071 | } | |
1072 | ||
043ca389 | 1073 | return cmp; |
29d720ed NK |
1074 | } |
1075 | ||
9283ba9b NK |
1076 | static void hists__reset_filter_stats(struct hists *hists) |
1077 | { | |
1078 | hists->nr_non_filtered_entries = 0; | |
1079 | hists->stats.total_non_filtered_period = 0; | |
1080 | } | |
1081 | ||
1082 | void hists__reset_stats(struct hists *hists) | |
1083 | { | |
1084 | hists->nr_entries = 0; | |
1085 | hists->stats.total_period = 0; | |
1086 | ||
1087 | hists__reset_filter_stats(hists); | |
1088 | } | |
1089 | ||
1090 | static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h) | |
1091 | { | |
1092 | hists->nr_non_filtered_entries++; | |
1093 | hists->stats.total_non_filtered_period += h->stat.period; | |
1094 | } | |
1095 | ||
1096 | void hists__inc_stats(struct hists *hists, struct hist_entry *h) | |
1097 | { | |
1098 | if (!h->filtered) | |
1099 | hists__inc_filter_stats(hists, h); | |
1100 | ||
1101 | hists->nr_entries++; | |
1102 | hists->stats.total_period += h->stat.period; | |
1103 | } | |
1104 | ||
1c02c4d2 ACM |
1105 | static void __hists__insert_output_entry(struct rb_root *entries, |
1106 | struct hist_entry *he, | |
1107 | u64 min_callchain_hits) | |
3d1d07ec | 1108 | { |
1c02c4d2 | 1109 | struct rb_node **p = &entries->rb_node; |
3d1d07ec JK |
1110 | struct rb_node *parent = NULL; |
1111 | struct hist_entry *iter; | |
1112 | ||
d599db3f | 1113 | if (symbol_conf.use_callchain) |
b9fb9304 | 1114 | callchain_param.sort(&he->sorted_chain, he->callchain, |
3d1d07ec JK |
1115 | min_callchain_hits, &callchain_param); |
1116 | ||
1117 | while (*p != NULL) { | |
1118 | parent = *p; | |
1119 | iter = rb_entry(parent, struct hist_entry, rb_node); | |
1120 | ||
043ca389 | 1121 | if (hist_entry__sort(he, iter) > 0) |
3d1d07ec JK |
1122 | p = &(*p)->rb_left; |
1123 | else | |
1124 | p = &(*p)->rb_right; | |
1125 | } | |
1126 | ||
1127 | rb_link_node(&he->rb_node, parent, p); | |
1c02c4d2 | 1128 | rb_insert_color(&he->rb_node, entries); |
3d1d07ec JK |
1129 | } |
1130 | ||
740b97f9 | 1131 | void hists__output_resort(struct hists *hists, struct ui_progress *prog) |
3d1d07ec | 1132 | { |
1980c2eb | 1133 | struct rb_root *root; |
3d1d07ec JK |
1134 | struct rb_node *next; |
1135 | struct hist_entry *n; | |
3d1d07ec JK |
1136 | u64 min_callchain_hits; |
1137 | ||
42b28ac0 | 1138 | min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100); |
3d1d07ec | 1139 | |
3a5714f8 | 1140 | if (sort__need_collapse) |
1980c2eb ACM |
1141 | root = &hists->entries_collapsed; |
1142 | else | |
1143 | root = hists->entries_in; | |
1144 | ||
1145 | next = rb_first(root); | |
1146 | hists->entries = RB_ROOT; | |
3d1d07ec | 1147 | |
9283ba9b | 1148 | hists__reset_stats(hists); |
42b28ac0 | 1149 | hists__reset_col_len(hists); |
fefb0b94 | 1150 | |
3d1d07ec | 1151 | while (next) { |
1980c2eb ACM |
1152 | n = rb_entry(next, struct hist_entry, rb_node_in); |
1153 | next = rb_next(&n->rb_node_in); | |
3d1d07ec | 1154 | |
1980c2eb | 1155 | __hists__insert_output_entry(&hists->entries, n, min_callchain_hits); |
6263835a | 1156 | hists__inc_stats(hists, n); |
ae993efc NK |
1157 | |
1158 | if (!n->filtered) | |
1159 | hists__calc_col_len(hists, n); | |
740b97f9 NK |
1160 | |
1161 | if (prog) | |
1162 | ui_progress__update(prog, 1); | |
3d1d07ec | 1163 | } |
1980c2eb | 1164 | } |
b9bf0892 | 1165 | |
42b28ac0 | 1166 | static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, |
cc5edb0e ACM |
1167 | enum hist_filter filter) |
1168 | { | |
1169 | h->filtered &= ~(1 << filter); | |
1170 | if (h->filtered) | |
1171 | return; | |
1172 | ||
87e90f43 | 1173 | /* force fold unfiltered entry for simplicity */ |
3698dab1 | 1174 | h->unfolded = false; |
0f0cbf7a | 1175 | h->row_offset = 0; |
a8cd1f43 | 1176 | h->nr_rows = 0; |
9283ba9b | 1177 | |
1ab1fa5d | 1178 | hists->stats.nr_non_filtered_samples += h->stat.nr_events; |
cc5edb0e | 1179 | |
9283ba9b | 1180 | hists__inc_filter_stats(hists, h); |
42b28ac0 | 1181 | hists__calc_col_len(hists, h); |
cc5edb0e ACM |
1182 | } |
1183 | ||
90cf1fb5 ACM |
1184 | |
1185 | static bool hists__filter_entry_by_dso(struct hists *hists, | |
1186 | struct hist_entry *he) | |
1187 | { | |
1188 | if (hists->dso_filter != NULL && | |
1189 | (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { | |
1190 | he->filtered |= (1 << HIST_FILTER__DSO); | |
1191 | return true; | |
1192 | } | |
1193 | ||
1194 | return false; | |
1195 | } | |
1196 | ||
d7b76f09 | 1197 | void hists__filter_by_dso(struct hists *hists) |
b09e0190 ACM |
1198 | { |
1199 | struct rb_node *nd; | |
1200 | ||
1ab1fa5d | 1201 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1202 | |
1203 | hists__reset_filter_stats(hists); | |
42b28ac0 | 1204 | hists__reset_col_len(hists); |
b09e0190 | 1205 | |
42b28ac0 | 1206 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
1207 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
1208 | ||
1209 | if (symbol_conf.exclude_other && !h->parent) | |
1210 | continue; | |
1211 | ||
90cf1fb5 | 1212 | if (hists__filter_entry_by_dso(hists, h)) |
b09e0190 | 1213 | continue; |
b09e0190 | 1214 | |
42b28ac0 | 1215 | hists__remove_entry_filter(hists, h, HIST_FILTER__DSO); |
b09e0190 ACM |
1216 | } |
1217 | } | |
1218 | ||
90cf1fb5 ACM |
1219 | static bool hists__filter_entry_by_thread(struct hists *hists, |
1220 | struct hist_entry *he) | |
1221 | { | |
1222 | if (hists->thread_filter != NULL && | |
1223 | he->thread != hists->thread_filter) { | |
1224 | he->filtered |= (1 << HIST_FILTER__THREAD); | |
1225 | return true; | |
1226 | } | |
1227 | ||
1228 | return false; | |
1229 | } | |
1230 | ||
d7b76f09 | 1231 | void hists__filter_by_thread(struct hists *hists) |
b09e0190 ACM |
1232 | { |
1233 | struct rb_node *nd; | |
1234 | ||
1ab1fa5d | 1235 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1236 | |
1237 | hists__reset_filter_stats(hists); | |
42b28ac0 | 1238 | hists__reset_col_len(hists); |
b09e0190 | 1239 | |
42b28ac0 | 1240 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { |
b09e0190 ACM |
1241 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
1242 | ||
90cf1fb5 | 1243 | if (hists__filter_entry_by_thread(hists, h)) |
b09e0190 | 1244 | continue; |
cc5edb0e | 1245 | |
42b28ac0 | 1246 | hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD); |
b09e0190 ACM |
1247 | } |
1248 | } | |
ef7b93a1 | 1249 | |
e94d53eb NK |
1250 | static bool hists__filter_entry_by_symbol(struct hists *hists, |
1251 | struct hist_entry *he) | |
1252 | { | |
1253 | if (hists->symbol_filter_str != NULL && | |
1254 | (!he->ms.sym || strstr(he->ms.sym->name, | |
1255 | hists->symbol_filter_str) == NULL)) { | |
1256 | he->filtered |= (1 << HIST_FILTER__SYMBOL); | |
1257 | return true; | |
1258 | } | |
1259 | ||
1260 | return false; | |
1261 | } | |
1262 | ||
1263 | void hists__filter_by_symbol(struct hists *hists) | |
1264 | { | |
1265 | struct rb_node *nd; | |
1266 | ||
1ab1fa5d | 1267 | hists->stats.nr_non_filtered_samples = 0; |
9283ba9b NK |
1268 | |
1269 | hists__reset_filter_stats(hists); | |
e94d53eb NK |
1270 | hists__reset_col_len(hists); |
1271 | ||
1272 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | |
1273 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
1274 | ||
1275 | if (hists__filter_entry_by_symbol(hists, h)) | |
1276 | continue; | |
1277 | ||
1278 | hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL); | |
1279 | } | |
1280 | } | |
1281 | ||
28a6b6aa ACM |
1282 | void events_stats__inc(struct events_stats *stats, u32 type) |
1283 | { | |
1284 | ++stats->nr_events[0]; | |
1285 | ++stats->nr_events[type]; | |
1286 | } | |
1287 | ||
42b28ac0 | 1288 | void hists__inc_nr_events(struct hists *hists, u32 type) |
c8446b9b | 1289 | { |
28a6b6aa | 1290 | events_stats__inc(&hists->stats, type); |
c8446b9b | 1291 | } |
95529be4 | 1292 | |
1844dbcb NK |
1293 | void hists__inc_nr_samples(struct hists *hists, bool filtered) |
1294 | { | |
1295 | events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE); | |
1296 | if (!filtered) | |
1297 | hists->stats.nr_non_filtered_samples++; | |
1298 | } | |
1299 | ||
494d70a1 ACM |
1300 | static struct hist_entry *hists__add_dummy_entry(struct hists *hists, |
1301 | struct hist_entry *pair) | |
1302 | { | |
ce74f60e NK |
1303 | struct rb_root *root; |
1304 | struct rb_node **p; | |
494d70a1 ACM |
1305 | struct rb_node *parent = NULL; |
1306 | struct hist_entry *he; | |
354cc40e | 1307 | int64_t cmp; |
494d70a1 | 1308 | |
ce74f60e NK |
1309 | if (sort__need_collapse) |
1310 | root = &hists->entries_collapsed; | |
1311 | else | |
1312 | root = hists->entries_in; | |
1313 | ||
1314 | p = &root->rb_node; | |
1315 | ||
494d70a1 ACM |
1316 | while (*p != NULL) { |
1317 | parent = *p; | |
ce74f60e | 1318 | he = rb_entry(parent, struct hist_entry, rb_node_in); |
494d70a1 | 1319 | |
ce74f60e | 1320 | cmp = hist_entry__collapse(he, pair); |
494d70a1 ACM |
1321 | |
1322 | if (!cmp) | |
1323 | goto out; | |
1324 | ||
1325 | if (cmp < 0) | |
1326 | p = &(*p)->rb_left; | |
1327 | else | |
1328 | p = &(*p)->rb_right; | |
1329 | } | |
1330 | ||
a0b51af3 | 1331 | he = hist_entry__new(pair, true); |
494d70a1 | 1332 | if (he) { |
30193d78 ACM |
1333 | memset(&he->stat, 0, sizeof(he->stat)); |
1334 | he->hists = hists; | |
ce74f60e NK |
1335 | rb_link_node(&he->rb_node_in, parent, p); |
1336 | rb_insert_color(&he->rb_node_in, root); | |
6263835a | 1337 | hists__inc_stats(hists, he); |
e0af43d2 | 1338 | he->dummy = true; |
494d70a1 ACM |
1339 | } |
1340 | out: | |
1341 | return he; | |
1342 | } | |
1343 | ||
95529be4 ACM |
1344 | static struct hist_entry *hists__find_entry(struct hists *hists, |
1345 | struct hist_entry *he) | |
1346 | { | |
ce74f60e NK |
1347 | struct rb_node *n; |
1348 | ||
1349 | if (sort__need_collapse) | |
1350 | n = hists->entries_collapsed.rb_node; | |
1351 | else | |
1352 | n = hists->entries_in->rb_node; | |
95529be4 ACM |
1353 | |
1354 | while (n) { | |
ce74f60e NK |
1355 | struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); |
1356 | int64_t cmp = hist_entry__collapse(iter, he); | |
95529be4 ACM |
1357 | |
1358 | if (cmp < 0) | |
1359 | n = n->rb_left; | |
1360 | else if (cmp > 0) | |
1361 | n = n->rb_right; | |
1362 | else | |
1363 | return iter; | |
1364 | } | |
1365 | ||
1366 | return NULL; | |
1367 | } | |
1368 | ||
1369 | /* | |
1370 | * Look for pairs to link to the leader buckets (hist_entries): | |
1371 | */ | |
1372 | void hists__match(struct hists *leader, struct hists *other) | |
1373 | { | |
ce74f60e | 1374 | struct rb_root *root; |
95529be4 ACM |
1375 | struct rb_node *nd; |
1376 | struct hist_entry *pos, *pair; | |
1377 | ||
ce74f60e NK |
1378 | if (sort__need_collapse) |
1379 | root = &leader->entries_collapsed; | |
1380 | else | |
1381 | root = leader->entries_in; | |
1382 | ||
1383 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
1384 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
95529be4 ACM |
1385 | pair = hists__find_entry(other, pos); |
1386 | ||
1387 | if (pair) | |
5fa9041b | 1388 | hist_entry__add_pair(pair, pos); |
95529be4 ACM |
1389 | } |
1390 | } | |
494d70a1 ACM |
1391 | |
1392 | /* | |
1393 | * Look for entries in the other hists that are not present in the leader, if | |
1394 | * we find them, just add a dummy entry on the leader hists, with period=0, | |
1395 | * nr_events=0, to serve as the list header. | |
1396 | */ | |
1397 | int hists__link(struct hists *leader, struct hists *other) | |
1398 | { | |
ce74f60e | 1399 | struct rb_root *root; |
494d70a1 ACM |
1400 | struct rb_node *nd; |
1401 | struct hist_entry *pos, *pair; | |
1402 | ||
ce74f60e NK |
1403 | if (sort__need_collapse) |
1404 | root = &other->entries_collapsed; | |
1405 | else | |
1406 | root = other->entries_in; | |
1407 | ||
1408 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
1409 | pos = rb_entry(nd, struct hist_entry, rb_node_in); | |
494d70a1 ACM |
1410 | |
1411 | if (!hist_entry__has_pairs(pos)) { | |
1412 | pair = hists__add_dummy_entry(leader, pos); | |
1413 | if (pair == NULL) | |
1414 | return -1; | |
5fa9041b | 1415 | hist_entry__add_pair(pos, pair); |
494d70a1 ACM |
1416 | } |
1417 | } | |
1418 | ||
1419 | return 0; | |
1420 | } | |
f2148330 | 1421 | |
57849998 AK |
1422 | void hist__account_cycles(struct branch_stack *bs, struct addr_location *al, |
1423 | struct perf_sample *sample, bool nonany_branch_mode) | |
1424 | { | |
1425 | struct branch_info *bi; | |
1426 | ||
1427 | /* If we have branch cycles always annotate them. */ | |
1428 | if (bs && bs->nr && bs->entries[0].flags.cycles) { | |
1429 | int i; | |
1430 | ||
1431 | bi = sample__resolve_bstack(sample, al); | |
1432 | if (bi) { | |
1433 | struct addr_map_symbol *prev = NULL; | |
1434 | ||
1435 | /* | |
1436 | * Ignore errors, still want to process the | |
1437 | * other entries. | |
1438 | * | |
1439 | * For non standard branch modes always | |
1440 | * force no IPC (prev == NULL) | |
1441 | * | |
1442 | * Note that perf stores branches reversed from | |
1443 | * program order! | |
1444 | */ | |
1445 | for (i = bs->nr - 1; i >= 0; i--) { | |
1446 | addr_map_symbol__account_cycles(&bi[i].from, | |
1447 | nonany_branch_mode ? NULL : prev, | |
1448 | bi[i].flags.cycles); | |
1449 | prev = &bi[i].to; | |
1450 | } | |
1451 | free(bi); | |
1452 | } | |
1453 | } | |
1454 | } | |
2a1731fb ACM |
1455 | |
1456 | size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp) | |
1457 | { | |
1458 | struct perf_evsel *pos; | |
1459 | size_t ret = 0; | |
1460 | ||
1461 | evlist__for_each(evlist, pos) { | |
1462 | ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos)); | |
1463 | ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp); | |
1464 | } | |
1465 | ||
1466 | return ret; | |
1467 | } | |
1468 | ||
1469 | ||
f2148330 NK |
1470 | u64 hists__total_period(struct hists *hists) |
1471 | { | |
1472 | return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period : | |
1473 | hists->stats.total_period; | |
1474 | } | |
33db4568 NK |
1475 | |
1476 | int parse_filter_percentage(const struct option *opt __maybe_unused, | |
1477 | const char *arg, int unset __maybe_unused) | |
1478 | { | |
1479 | if (!strcmp(arg, "relative")) | |
1480 | symbol_conf.filter_relative = true; | |
1481 | else if (!strcmp(arg, "absolute")) | |
1482 | symbol_conf.filter_relative = false; | |
1483 | else | |
1484 | return -1; | |
1485 | ||
1486 | return 0; | |
1487 | } | |
0b93da17 NK |
1488 | |
1489 | int perf_hist_config(const char *var, const char *value) | |
1490 | { | |
1491 | if (!strcmp(var, "hist.percentage")) | |
1492 | return parse_filter_percentage(NULL, value, 0); | |
1493 | ||
1494 | return 0; | |
1495 | } | |
a635fc51 ACM |
1496 | |
1497 | static int hists_evsel__init(struct perf_evsel *evsel) | |
1498 | { | |
1499 | struct hists *hists = evsel__hists(evsel); | |
1500 | ||
1501 | memset(hists, 0, sizeof(*hists)); | |
1502 | hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT; | |
1503 | hists->entries_in = &hists->entries_in_array[0]; | |
1504 | hists->entries_collapsed = RB_ROOT; | |
1505 | hists->entries = RB_ROOT; | |
1506 | pthread_mutex_init(&hists->lock, NULL); | |
1507 | return 0; | |
1508 | } | |
1509 | ||
1510 | /* | |
1511 | * XXX We probably need a hists_evsel__exit() to free the hist_entries | |
1512 | * stored in the rbtree... | |
1513 | */ | |
1514 | ||
1515 | int hists__init(void) | |
1516 | { | |
1517 | int err = perf_evsel__object_config(sizeof(struct hists_evsel), | |
1518 | hists_evsel__init, NULL); | |
1519 | if (err) | |
1520 | fputs("FATAL ERROR: Couldn't setup hists class\n", stderr); | |
1521 | ||
1522 | return err; | |
1523 | } |