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