Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include "callchain.h"
3#include "debug.h"
4#include "dso.h"
5#include "build-id.h"
6#include "hist.h"
7#include "map.h"
8#include "map_symbol.h"
9#include "branch.h"
10#include "mem-events.h"
11#include "session.h"
12#include "namespaces.h"
13#include "cgroup.h"
14#include "sort.h"
15#include "units.h"
16#include "evlist.h"
17#include "evsel.h"
18#include "annotate.h"
19#include "srcline.h"
20#include "symbol.h"
21#include "thread.h"
22#include "block-info.h"
23#include "ui/progress.h"
24#include <errno.h>
25#include <math.h>
26#include <inttypes.h>
27#include <sys/param.h>
28#include <linux/rbtree.h>
29#include <linux/string.h>
30#include <linux/time64.h>
31#include <linux/zalloc.h>
32
33static bool hists__filter_entry_by_dso(struct hists *hists,
34 struct hist_entry *he);
35static bool hists__filter_entry_by_thread(struct hists *hists,
36 struct hist_entry *he);
37static bool hists__filter_entry_by_symbol(struct hists *hists,
38 struct hist_entry *he);
39static bool hists__filter_entry_by_socket(struct hists *hists,
40 struct hist_entry *he);
41
42u16 hists__col_len(struct hists *hists, enum hist_column col)
43{
44 return hists->col_len[col];
45}
46
47void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
48{
49 hists->col_len[col] = len;
50}
51
52bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
53{
54 if (len > hists__col_len(hists, col)) {
55 hists__set_col_len(hists, col, len);
56 return true;
57 }
58 return false;
59}
60
61void hists__reset_col_len(struct hists *hists)
62{
63 enum hist_column col;
64
65 for (col = 0; col < HISTC_NR_COLS; ++col)
66 hists__set_col_len(hists, col, 0);
67}
68
69static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
70{
71 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
72
73 if (hists__col_len(hists, dso) < unresolved_col_width &&
74 !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
75 !symbol_conf.dso_list)
76 hists__set_col_len(hists, dso, unresolved_col_width);
77}
78
79void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
80{
81 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
82 int symlen;
83 u16 len;
84
85 if (h->block_info)
86 return;
87 /*
88 * +4 accounts for '[x] ' priv level info
89 * +2 accounts for 0x prefix on raw addresses
90 * +3 accounts for ' y ' symtab origin info
91 */
92 if (h->ms.sym) {
93 symlen = h->ms.sym->namelen + 4;
94 if (verbose > 0)
95 symlen += BITS_PER_LONG / 4 + 2 + 3;
96 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
97 } else {
98 symlen = unresolved_col_width + 4 + 2;
99 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
100 hists__set_unres_dso_col_len(hists, HISTC_DSO);
101 }
102
103 len = thread__comm_len(h->thread);
104 if (hists__new_col_len(hists, HISTC_COMM, len))
105 hists__set_col_len(hists, HISTC_THREAD, len + 8);
106
107 if (h->ms.map) {
108 len = dso__name_len(h->ms.map->dso);
109 hists__new_col_len(hists, HISTC_DSO, len);
110 }
111
112 if (h->parent)
113 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
114
115 if (h->branch_info) {
116 if (h->branch_info->from.ms.sym) {
117 symlen = (int)h->branch_info->from.ms.sym->namelen + 4;
118 if (verbose > 0)
119 symlen += BITS_PER_LONG / 4 + 2 + 3;
120 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
121
122 symlen = dso__name_len(h->branch_info->from.ms.map->dso);
123 hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
124 } else {
125 symlen = unresolved_col_width + 4 + 2;
126 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
127 hists__new_col_len(hists, HISTC_ADDR_FROM, symlen);
128 hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
129 }
130
131 if (h->branch_info->to.ms.sym) {
132 symlen = (int)h->branch_info->to.ms.sym->namelen + 4;
133 if (verbose > 0)
134 symlen += BITS_PER_LONG / 4 + 2 + 3;
135 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
136
137 symlen = dso__name_len(h->branch_info->to.ms.map->dso);
138 hists__new_col_len(hists, HISTC_DSO_TO, symlen);
139 } else {
140 symlen = unresolved_col_width + 4 + 2;
141 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
142 hists__new_col_len(hists, HISTC_ADDR_TO, symlen);
143 hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
144 }
145
146 if (h->branch_info->srcline_from)
147 hists__new_col_len(hists, HISTC_SRCLINE_FROM,
148 strlen(h->branch_info->srcline_from));
149 if (h->branch_info->srcline_to)
150 hists__new_col_len(hists, HISTC_SRCLINE_TO,
151 strlen(h->branch_info->srcline_to));
152 }
153
154 if (h->mem_info) {
155 if (h->mem_info->daddr.ms.sym) {
156 symlen = (int)h->mem_info->daddr.ms.sym->namelen + 4
157 + unresolved_col_width + 2;
158 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
159 symlen);
160 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
161 symlen + 1);
162 } else {
163 symlen = unresolved_col_width + 4 + 2;
164 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
165 symlen);
166 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
167 symlen);
168 }
169
170 if (h->mem_info->iaddr.ms.sym) {
171 symlen = (int)h->mem_info->iaddr.ms.sym->namelen + 4
172 + unresolved_col_width + 2;
173 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
174 symlen);
175 } else {
176 symlen = unresolved_col_width + 4 + 2;
177 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
178 symlen);
179 }
180
181 if (h->mem_info->daddr.ms.map) {
182 symlen = dso__name_len(h->mem_info->daddr.ms.map->dso);
183 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
184 symlen);
185 } else {
186 symlen = unresolved_col_width + 4 + 2;
187 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
188 }
189
190 hists__new_col_len(hists, HISTC_MEM_PHYS_DADDR,
191 unresolved_col_width + 4 + 2);
192
193 hists__new_col_len(hists, HISTC_MEM_DATA_PAGE_SIZE,
194 unresolved_col_width + 4 + 2);
195
196 } else {
197 symlen = unresolved_col_width + 4 + 2;
198 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
199 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
200 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
201 }
202
203 hists__new_col_len(hists, HISTC_CGROUP, 6);
204 hists__new_col_len(hists, HISTC_CGROUP_ID, 20);
205 hists__new_col_len(hists, HISTC_CPU, 3);
206 hists__new_col_len(hists, HISTC_SOCKET, 6);
207 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
208 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
209 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
210 hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
211 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
212 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
213 hists__new_col_len(hists, HISTC_MEM_BLOCKED, 10);
214 hists__new_col_len(hists, HISTC_LOCAL_INS_LAT, 13);
215 hists__new_col_len(hists, HISTC_GLOBAL_INS_LAT, 13);
216 hists__new_col_len(hists, HISTC_LOCAL_P_STAGE_CYC, 13);
217 hists__new_col_len(hists, HISTC_GLOBAL_P_STAGE_CYC, 13);
218 hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2);
219
220 if (symbol_conf.nanosecs)
221 hists__new_col_len(hists, HISTC_TIME, 16);
222 else
223 hists__new_col_len(hists, HISTC_TIME, 12);
224 hists__new_col_len(hists, HISTC_CODE_PAGE_SIZE, 6);
225
226 if (h->srcline) {
227 len = MAX(strlen(h->srcline), strlen(sort_srcline.se_header));
228 hists__new_col_len(hists, HISTC_SRCLINE, len);
229 }
230
231 if (h->srcfile)
232 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
233
234 if (h->transaction)
235 hists__new_col_len(hists, HISTC_TRANSACTION,
236 hist_entry__transaction_len());
237
238 if (h->trace_output)
239 hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
240
241 if (h->cgroup) {
242 const char *cgrp_name = "unknown";
243 struct cgroup *cgrp = cgroup__find(h->ms.maps->machine->env,
244 h->cgroup);
245 if (cgrp != NULL)
246 cgrp_name = cgrp->name;
247
248 hists__new_col_len(hists, HISTC_CGROUP, strlen(cgrp_name));
249 }
250}
251
252void hists__output_recalc_col_len(struct hists *hists, int max_rows)
253{
254 struct rb_node *next = rb_first_cached(&hists->entries);
255 struct hist_entry *n;
256 int row = 0;
257
258 hists__reset_col_len(hists);
259
260 while (next && row++ < max_rows) {
261 n = rb_entry(next, struct hist_entry, rb_node);
262 if (!n->filtered)
263 hists__calc_col_len(hists, n);
264 next = rb_next(&n->rb_node);
265 }
266}
267
268static void he_stat__add_cpumode_period(struct he_stat *he_stat,
269 unsigned int cpumode, u64 period)
270{
271 switch (cpumode) {
272 case PERF_RECORD_MISC_KERNEL:
273 he_stat->period_sys += period;
274 break;
275 case PERF_RECORD_MISC_USER:
276 he_stat->period_us += period;
277 break;
278 case PERF_RECORD_MISC_GUEST_KERNEL:
279 he_stat->period_guest_sys += period;
280 break;
281 case PERF_RECORD_MISC_GUEST_USER:
282 he_stat->period_guest_us += period;
283 break;
284 default:
285 break;
286 }
287}
288
289static long hist_time(unsigned long htime)
290{
291 unsigned long time_quantum = symbol_conf.time_quantum;
292 if (time_quantum)
293 return (htime / time_quantum) * time_quantum;
294 return htime;
295}
296
297static void he_stat__add_period(struct he_stat *he_stat, u64 period)
298{
299 he_stat->period += period;
300 he_stat->nr_events += 1;
301}
302
303static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
304{
305 dest->period += src->period;
306 dest->period_sys += src->period_sys;
307 dest->period_us += src->period_us;
308 dest->period_guest_sys += src->period_guest_sys;
309 dest->period_guest_us += src->period_guest_us;
310 dest->nr_events += src->nr_events;
311}
312
313static void he_stat__decay(struct he_stat *he_stat)
314{
315 he_stat->period = (he_stat->period * 7) / 8;
316 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
317 /* XXX need decay for weight too? */
318}
319
320static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
321
322static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
323{
324 u64 prev_period = he->stat.period;
325 u64 diff;
326
327 if (prev_period == 0)
328 return true;
329
330 he_stat__decay(&he->stat);
331 if (symbol_conf.cumulate_callchain)
332 he_stat__decay(he->stat_acc);
333 decay_callchain(he->callchain);
334
335 diff = prev_period - he->stat.period;
336
337 if (!he->depth) {
338 hists->stats.total_period -= diff;
339 if (!he->filtered)
340 hists->stats.total_non_filtered_period -= diff;
341 }
342
343 if (!he->leaf) {
344 struct hist_entry *child;
345 struct rb_node *node = rb_first_cached(&he->hroot_out);
346 while (node) {
347 child = rb_entry(node, struct hist_entry, rb_node);
348 node = rb_next(node);
349
350 if (hists__decay_entry(hists, child))
351 hists__delete_entry(hists, child);
352 }
353 }
354
355 return he->stat.period == 0;
356}
357
358static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
359{
360 struct rb_root_cached *root_in;
361 struct rb_root_cached *root_out;
362
363 if (he->parent_he) {
364 root_in = &he->parent_he->hroot_in;
365 root_out = &he->parent_he->hroot_out;
366 } else {
367 if (hists__has(hists, need_collapse))
368 root_in = &hists->entries_collapsed;
369 else
370 root_in = hists->entries_in;
371 root_out = &hists->entries;
372 }
373
374 rb_erase_cached(&he->rb_node_in, root_in);
375 rb_erase_cached(&he->rb_node, root_out);
376
377 --hists->nr_entries;
378 if (!he->filtered)
379 --hists->nr_non_filtered_entries;
380
381 hist_entry__delete(he);
382}
383
384void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
385{
386 struct rb_node *next = rb_first_cached(&hists->entries);
387 struct hist_entry *n;
388
389 while (next) {
390 n = rb_entry(next, struct hist_entry, rb_node);
391 next = rb_next(&n->rb_node);
392 if (((zap_user && n->level == '.') ||
393 (zap_kernel && n->level != '.') ||
394 hists__decay_entry(hists, n))) {
395 hists__delete_entry(hists, n);
396 }
397 }
398}
399
400void hists__delete_entries(struct hists *hists)
401{
402 struct rb_node *next = rb_first_cached(&hists->entries);
403 struct hist_entry *n;
404
405 while (next) {
406 n = rb_entry(next, struct hist_entry, rb_node);
407 next = rb_next(&n->rb_node);
408
409 hists__delete_entry(hists, n);
410 }
411}
412
413struct hist_entry *hists__get_entry(struct hists *hists, int idx)
414{
415 struct rb_node *next = rb_first_cached(&hists->entries);
416 struct hist_entry *n;
417 int i = 0;
418
419 while (next) {
420 n = rb_entry(next, struct hist_entry, rb_node);
421 if (i == idx)
422 return n;
423
424 next = rb_next(&n->rb_node);
425 i++;
426 }
427
428 return NULL;
429}
430
431/*
432 * histogram, sorted on item, collects periods
433 */
434
435static int hist_entry__init(struct hist_entry *he,
436 struct hist_entry *template,
437 bool sample_self,
438 size_t callchain_size)
439{
440 *he = *template;
441 he->callchain_size = callchain_size;
442
443 if (symbol_conf.cumulate_callchain) {
444 he->stat_acc = malloc(sizeof(he->stat));
445 if (he->stat_acc == NULL)
446 return -ENOMEM;
447 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
448 if (!sample_self)
449 memset(&he->stat, 0, sizeof(he->stat));
450 }
451
452 map__get(he->ms.map);
453
454 if (he->branch_info) {
455 /*
456 * This branch info is (a part of) allocated from
457 * sample__resolve_bstack() and will be freed after
458 * adding new entries. So we need to save a copy.
459 */
460 he->branch_info = malloc(sizeof(*he->branch_info));
461 if (he->branch_info == NULL)
462 goto err;
463
464 memcpy(he->branch_info, template->branch_info,
465 sizeof(*he->branch_info));
466
467 map__get(he->branch_info->from.ms.map);
468 map__get(he->branch_info->to.ms.map);
469 }
470
471 if (he->mem_info) {
472 map__get(he->mem_info->iaddr.ms.map);
473 map__get(he->mem_info->daddr.ms.map);
474 }
475
476 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)
477 callchain_init(he->callchain);
478
479 if (he->raw_data) {
480 he->raw_data = memdup(he->raw_data, he->raw_size);
481 if (he->raw_data == NULL)
482 goto err_infos;
483 }
484
485 if (he->srcline) {
486 he->srcline = strdup(he->srcline);
487 if (he->srcline == NULL)
488 goto err_rawdata;
489 }
490
491 if (symbol_conf.res_sample) {
492 he->res_samples = calloc(sizeof(struct res_sample),
493 symbol_conf.res_sample);
494 if (!he->res_samples)
495 goto err_srcline;
496 }
497
498 INIT_LIST_HEAD(&he->pairs.node);
499 thread__get(he->thread);
500 he->hroot_in = RB_ROOT_CACHED;
501 he->hroot_out = RB_ROOT_CACHED;
502
503 if (!symbol_conf.report_hierarchy)
504 he->leaf = true;
505
506 return 0;
507
508err_srcline:
509 zfree(&he->srcline);
510
511err_rawdata:
512 zfree(&he->raw_data);
513
514err_infos:
515 if (he->branch_info) {
516 map__put(he->branch_info->from.ms.map);
517 map__put(he->branch_info->to.ms.map);
518 zfree(&he->branch_info);
519 }
520 if (he->mem_info) {
521 map__put(he->mem_info->iaddr.ms.map);
522 map__put(he->mem_info->daddr.ms.map);
523 }
524err:
525 map__zput(he->ms.map);
526 zfree(&he->stat_acc);
527 return -ENOMEM;
528}
529
530static void *hist_entry__zalloc(size_t size)
531{
532 return zalloc(size + sizeof(struct hist_entry));
533}
534
535static void hist_entry__free(void *ptr)
536{
537 free(ptr);
538}
539
540static struct hist_entry_ops default_ops = {
541 .new = hist_entry__zalloc,
542 .free = hist_entry__free,
543};
544
545static struct hist_entry *hist_entry__new(struct hist_entry *template,
546 bool sample_self)
547{
548 struct hist_entry_ops *ops = template->ops;
549 size_t callchain_size = 0;
550 struct hist_entry *he;
551 int err = 0;
552
553 if (!ops)
554 ops = template->ops = &default_ops;
555
556 if (symbol_conf.use_callchain)
557 callchain_size = sizeof(struct callchain_root);
558
559 he = ops->new(callchain_size);
560 if (he) {
561 err = hist_entry__init(he, template, sample_self, callchain_size);
562 if (err) {
563 ops->free(he);
564 he = NULL;
565 }
566 }
567
568 return he;
569}
570
571static u8 symbol__parent_filter(const struct symbol *parent)
572{
573 if (symbol_conf.exclude_other && parent == NULL)
574 return 1 << HIST_FILTER__PARENT;
575 return 0;
576}
577
578static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
579{
580 if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain)
581 return;
582
583 he->hists->callchain_period += period;
584 if (!he->filtered)
585 he->hists->callchain_non_filtered_period += period;
586}
587
588static struct hist_entry *hists__findnew_entry(struct hists *hists,
589 struct hist_entry *entry,
590 struct addr_location *al,
591 bool sample_self)
592{
593 struct rb_node **p;
594 struct rb_node *parent = NULL;
595 struct hist_entry *he;
596 int64_t cmp;
597 u64 period = entry->stat.period;
598 bool leftmost = true;
599
600 p = &hists->entries_in->rb_root.rb_node;
601
602 while (*p != NULL) {
603 parent = *p;
604 he = rb_entry(parent, struct hist_entry, rb_node_in);
605
606 /*
607 * Make sure that it receives arguments in a same order as
608 * hist_entry__collapse() so that we can use an appropriate
609 * function when searching an entry regardless which sort
610 * keys were used.
611 */
612 cmp = hist_entry__cmp(he, entry);
613
614 if (!cmp) {
615 if (sample_self) {
616 he_stat__add_period(&he->stat, period);
617 hist_entry__add_callchain_period(he, period);
618 }
619 if (symbol_conf.cumulate_callchain)
620 he_stat__add_period(he->stat_acc, period);
621
622 /*
623 * This mem info was allocated from sample__resolve_mem
624 * and will not be used anymore.
625 */
626 mem_info__zput(entry->mem_info);
627
628 block_info__zput(entry->block_info);
629
630 /* If the map of an existing hist_entry has
631 * become out-of-date due to an exec() or
632 * similar, update it. Otherwise we will
633 * mis-adjust symbol addresses when computing
634 * the history counter to increment.
635 */
636 if (he->ms.map != entry->ms.map) {
637 map__put(he->ms.map);
638 he->ms.map = map__get(entry->ms.map);
639 }
640 goto out;
641 }
642
643 if (cmp < 0)
644 p = &(*p)->rb_left;
645 else {
646 p = &(*p)->rb_right;
647 leftmost = false;
648 }
649 }
650
651 he = hist_entry__new(entry, sample_self);
652 if (!he)
653 return NULL;
654
655 if (sample_self)
656 hist_entry__add_callchain_period(he, period);
657 hists->nr_entries++;
658
659 rb_link_node(&he->rb_node_in, parent, p);
660 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost);
661out:
662 if (sample_self)
663 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
664 if (symbol_conf.cumulate_callchain)
665 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
666 return he;
667}
668
669static unsigned random_max(unsigned high)
670{
671 unsigned thresh = -high % high;
672 for (;;) {
673 unsigned r = random();
674 if (r >= thresh)
675 return r % high;
676 }
677}
678
679static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample)
680{
681 struct res_sample *r;
682 int j;
683
684 if (he->num_res < symbol_conf.res_sample) {
685 j = he->num_res++;
686 } else {
687 j = random_max(symbol_conf.res_sample);
688 }
689 r = &he->res_samples[j];
690 r->time = sample->time;
691 r->cpu = sample->cpu;
692 r->tid = sample->tid;
693}
694
695static struct hist_entry*
696__hists__add_entry(struct hists *hists,
697 struct addr_location *al,
698 struct symbol *sym_parent,
699 struct branch_info *bi,
700 struct mem_info *mi,
701 struct block_info *block_info,
702 struct perf_sample *sample,
703 bool sample_self,
704 struct hist_entry_ops *ops)
705{
706 struct namespaces *ns = thread__namespaces(al->thread);
707 struct hist_entry entry = {
708 .thread = al->thread,
709 .comm = thread__comm(al->thread),
710 .cgroup_id = {
711 .dev = ns ? ns->link_info[CGROUP_NS_INDEX].dev : 0,
712 .ino = ns ? ns->link_info[CGROUP_NS_INDEX].ino : 0,
713 },
714 .cgroup = sample->cgroup,
715 .ms = {
716 .maps = al->maps,
717 .map = al->map,
718 .sym = al->sym,
719 },
720 .srcline = (char *) al->srcline,
721 .socket = al->socket,
722 .cpu = al->cpu,
723 .cpumode = al->cpumode,
724 .ip = al->addr,
725 .level = al->level,
726 .code_page_size = sample->code_page_size,
727 .stat = {
728 .nr_events = 1,
729 .period = sample->period,
730 },
731 .parent = sym_parent,
732 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
733 .hists = hists,
734 .branch_info = bi,
735 .mem_info = mi,
736 .block_info = block_info,
737 .transaction = sample->transaction,
738 .raw_data = sample->raw_data,
739 .raw_size = sample->raw_size,
740 .ops = ops,
741 .time = hist_time(sample->time),
742 .weight = sample->weight,
743 .ins_lat = sample->ins_lat,
744 .p_stage_cyc = sample->p_stage_cyc,
745 }, *he = hists__findnew_entry(hists, &entry, al, sample_self);
746
747 if (!hists->has_callchains && he && he->callchain_size != 0)
748 hists->has_callchains = true;
749 if (he && symbol_conf.res_sample)
750 hists__res_sample(he, sample);
751 return he;
752}
753
754struct hist_entry *hists__add_entry(struct hists *hists,
755 struct addr_location *al,
756 struct symbol *sym_parent,
757 struct branch_info *bi,
758 struct mem_info *mi,
759 struct perf_sample *sample,
760 bool sample_self)
761{
762 return __hists__add_entry(hists, al, sym_parent, bi, mi, NULL,
763 sample, sample_self, NULL);
764}
765
766struct hist_entry *hists__add_entry_ops(struct hists *hists,
767 struct hist_entry_ops *ops,
768 struct addr_location *al,
769 struct symbol *sym_parent,
770 struct branch_info *bi,
771 struct mem_info *mi,
772 struct perf_sample *sample,
773 bool sample_self)
774{
775 return __hists__add_entry(hists, al, sym_parent, bi, mi, NULL,
776 sample, sample_self, ops);
777}
778
779struct hist_entry *hists__add_entry_block(struct hists *hists,
780 struct addr_location *al,
781 struct block_info *block_info)
782{
783 struct hist_entry entry = {
784 .block_info = block_info,
785 .hists = hists,
786 .ms = {
787 .maps = al->maps,
788 .map = al->map,
789 .sym = al->sym,
790 },
791 }, *he = hists__findnew_entry(hists, &entry, al, false);
792
793 return he;
794}
795
796static int
797iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
798 struct addr_location *al __maybe_unused)
799{
800 return 0;
801}
802
803static int
804iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
805 struct addr_location *al __maybe_unused)
806{
807 return 0;
808}
809
810static int
811iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
812{
813 struct perf_sample *sample = iter->sample;
814 struct mem_info *mi;
815
816 mi = sample__resolve_mem(sample, al);
817 if (mi == NULL)
818 return -ENOMEM;
819
820 iter->priv = mi;
821 return 0;
822}
823
824static int
825iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
826{
827 u64 cost;
828 struct mem_info *mi = iter->priv;
829 struct hists *hists = evsel__hists(iter->evsel);
830 struct perf_sample *sample = iter->sample;
831 struct hist_entry *he;
832
833 if (mi == NULL)
834 return -EINVAL;
835
836 cost = sample->weight;
837 if (!cost)
838 cost = 1;
839
840 /*
841 * must pass period=weight in order to get the correct
842 * sorting from hists__collapse_resort() which is solely
843 * based on periods. We want sorting be done on nr_events * weight
844 * and this is indirectly achieved by passing period=weight here
845 * and the he_stat__add_period() function.
846 */
847 sample->period = cost;
848
849 he = hists__add_entry(hists, al, iter->parent, NULL, mi,
850 sample, true);
851 if (!he)
852 return -ENOMEM;
853
854 iter->he = he;
855 return 0;
856}
857
858static int
859iter_finish_mem_entry(struct hist_entry_iter *iter,
860 struct addr_location *al __maybe_unused)
861{
862 struct evsel *evsel = iter->evsel;
863 struct hists *hists = evsel__hists(evsel);
864 struct hist_entry *he = iter->he;
865 int err = -EINVAL;
866
867 if (he == NULL)
868 goto out;
869
870 hists__inc_nr_samples(hists, he->filtered);
871
872 err = hist_entry__append_callchain(he, iter->sample);
873
874out:
875 /*
876 * We don't need to free iter->priv (mem_info) here since the mem info
877 * was either already freed in hists__findnew_entry() or passed to a
878 * new hist entry by hist_entry__new().
879 */
880 iter->priv = NULL;
881
882 iter->he = NULL;
883 return err;
884}
885
886static int
887iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
888{
889 struct branch_info *bi;
890 struct perf_sample *sample = iter->sample;
891
892 bi = sample__resolve_bstack(sample, al);
893 if (!bi)
894 return -ENOMEM;
895
896 iter->curr = 0;
897 iter->total = sample->branch_stack->nr;
898
899 iter->priv = bi;
900 return 0;
901}
902
903static int
904iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
905 struct addr_location *al __maybe_unused)
906{
907 return 0;
908}
909
910static int
911iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
912{
913 struct branch_info *bi = iter->priv;
914 int i = iter->curr;
915
916 if (bi == NULL)
917 return 0;
918
919 if (iter->curr >= iter->total)
920 return 0;
921
922 al->maps = bi[i].to.ms.maps;
923 al->map = bi[i].to.ms.map;
924 al->sym = bi[i].to.ms.sym;
925 al->addr = bi[i].to.addr;
926 return 1;
927}
928
929static int
930iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
931{
932 struct branch_info *bi;
933 struct evsel *evsel = iter->evsel;
934 struct hists *hists = evsel__hists(evsel);
935 struct perf_sample *sample = iter->sample;
936 struct hist_entry *he = NULL;
937 int i = iter->curr;
938 int err = 0;
939
940 bi = iter->priv;
941
942 if (iter->hide_unresolved && !(bi[i].from.ms.sym && bi[i].to.ms.sym))
943 goto out;
944
945 /*
946 * The report shows the percentage of total branches captured
947 * and not events sampled. Thus we use a pseudo period of 1.
948 */
949 sample->period = 1;
950 sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;
951
952 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
953 sample, true);
954 if (he == NULL)
955 return -ENOMEM;
956
957 hists__inc_nr_samples(hists, he->filtered);
958
959out:
960 iter->he = he;
961 iter->curr++;
962 return err;
963}
964
965static int
966iter_finish_branch_entry(struct hist_entry_iter *iter,
967 struct addr_location *al __maybe_unused)
968{
969 zfree(&iter->priv);
970 iter->he = NULL;
971
972 return iter->curr >= iter->total ? 0 : -1;
973}
974
975static int
976iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
977 struct addr_location *al __maybe_unused)
978{
979 return 0;
980}
981
982static int
983iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
984{
985 struct evsel *evsel = iter->evsel;
986 struct perf_sample *sample = iter->sample;
987 struct hist_entry *he;
988
989 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
990 sample, true);
991 if (he == NULL)
992 return -ENOMEM;
993
994 iter->he = he;
995 return 0;
996}
997
998static int
999iter_finish_normal_entry(struct hist_entry_iter *iter,
1000 struct addr_location *al __maybe_unused)
1001{
1002 struct hist_entry *he = iter->he;
1003 struct evsel *evsel = iter->evsel;
1004 struct perf_sample *sample = iter->sample;
1005
1006 if (he == NULL)
1007 return 0;
1008
1009 iter->he = NULL;
1010
1011 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
1012
1013 return hist_entry__append_callchain(he, sample);
1014}
1015
1016static int
1017iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
1018 struct addr_location *al __maybe_unused)
1019{
1020 struct hist_entry **he_cache;
1021
1022 callchain_cursor_commit(&callchain_cursor);
1023
1024 /*
1025 * This is for detecting cycles or recursions so that they're
1026 * cumulated only one time to prevent entries more than 100%
1027 * overhead.
1028 */
1029 he_cache = malloc(sizeof(*he_cache) * (callchain_cursor.nr + 1));
1030 if (he_cache == NULL)
1031 return -ENOMEM;
1032
1033 iter->priv = he_cache;
1034 iter->curr = 0;
1035
1036 return 0;
1037}
1038
1039static int
1040iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
1041 struct addr_location *al)
1042{
1043 struct evsel *evsel = iter->evsel;
1044 struct hists *hists = evsel__hists(evsel);
1045 struct perf_sample *sample = iter->sample;
1046 struct hist_entry **he_cache = iter->priv;
1047 struct hist_entry *he;
1048 int err = 0;
1049
1050 he = hists__add_entry(hists, al, iter->parent, NULL, NULL,
1051 sample, true);
1052 if (he == NULL)
1053 return -ENOMEM;
1054
1055 iter->he = he;
1056 he_cache[iter->curr++] = he;
1057
1058 hist_entry__append_callchain(he, sample);
1059
1060 /*
1061 * We need to re-initialize the cursor since callchain_append()
1062 * advanced the cursor to the end.
1063 */
1064 callchain_cursor_commit(&callchain_cursor);
1065
1066 hists__inc_nr_samples(hists, he->filtered);
1067
1068 return err;
1069}
1070
1071static int
1072iter_next_cumulative_entry(struct hist_entry_iter *iter,
1073 struct addr_location *al)
1074{
1075 struct callchain_cursor_node *node;
1076
1077 node = callchain_cursor_current(&callchain_cursor);
1078 if (node == NULL)
1079 return 0;
1080
1081 return fill_callchain_info(al, node, iter->hide_unresolved);
1082}
1083
1084static bool
1085hist_entry__fast__sym_diff(struct hist_entry *left,
1086 struct hist_entry *right)
1087{
1088 struct symbol *sym_l = left->ms.sym;
1089 struct symbol *sym_r = right->ms.sym;
1090
1091 if (!sym_l && !sym_r)
1092 return left->ip != right->ip;
1093
1094 return !!_sort__sym_cmp(sym_l, sym_r);
1095}
1096
1097
1098static int
1099iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
1100 struct addr_location *al)
1101{
1102 struct evsel *evsel = iter->evsel;
1103 struct perf_sample *sample = iter->sample;
1104 struct hist_entry **he_cache = iter->priv;
1105 struct hist_entry *he;
1106 struct hist_entry he_tmp = {
1107 .hists = evsel__hists(evsel),
1108 .cpu = al->cpu,
1109 .thread = al->thread,
1110 .comm = thread__comm(al->thread),
1111 .ip = al->addr,
1112 .ms = {
1113 .maps = al->maps,
1114 .map = al->map,
1115 .sym = al->sym,
1116 },
1117 .srcline = (char *) al->srcline,
1118 .parent = iter->parent,
1119 .raw_data = sample->raw_data,
1120 .raw_size = sample->raw_size,
1121 };
1122 int i;
1123 struct callchain_cursor cursor;
1124 bool fast = hists__has(he_tmp.hists, sym);
1125
1126 callchain_cursor_snapshot(&cursor, &callchain_cursor);
1127
1128 callchain_cursor_advance(&callchain_cursor);
1129
1130 /*
1131 * Check if there's duplicate entries in the callchain.
1132 * It's possible that it has cycles or recursive calls.
1133 */
1134 for (i = 0; i < iter->curr; i++) {
1135 /*
1136 * For most cases, there are no duplicate entries in callchain.
1137 * The symbols are usually different. Do a quick check for
1138 * symbols first.
1139 */
1140 if (fast && hist_entry__fast__sym_diff(he_cache[i], &he_tmp))
1141 continue;
1142
1143 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
1144 /* to avoid calling callback function */
1145 iter->he = NULL;
1146 return 0;
1147 }
1148 }
1149
1150 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
1151 sample, false);
1152 if (he == NULL)
1153 return -ENOMEM;
1154
1155 iter->he = he;
1156 he_cache[iter->curr++] = he;
1157
1158 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)
1159 callchain_append(he->callchain, &cursor, sample->period);
1160 return 0;
1161}
1162
1163static int
1164iter_finish_cumulative_entry(struct hist_entry_iter *iter,
1165 struct addr_location *al __maybe_unused)
1166{
1167 zfree(&iter->priv);
1168 iter->he = NULL;
1169
1170 return 0;
1171}
1172
1173const struct hist_iter_ops hist_iter_mem = {
1174 .prepare_entry = iter_prepare_mem_entry,
1175 .add_single_entry = iter_add_single_mem_entry,
1176 .next_entry = iter_next_nop_entry,
1177 .add_next_entry = iter_add_next_nop_entry,
1178 .finish_entry = iter_finish_mem_entry,
1179};
1180
1181const struct hist_iter_ops hist_iter_branch = {
1182 .prepare_entry = iter_prepare_branch_entry,
1183 .add_single_entry = iter_add_single_branch_entry,
1184 .next_entry = iter_next_branch_entry,
1185 .add_next_entry = iter_add_next_branch_entry,
1186 .finish_entry = iter_finish_branch_entry,
1187};
1188
1189const struct hist_iter_ops hist_iter_normal = {
1190 .prepare_entry = iter_prepare_normal_entry,
1191 .add_single_entry = iter_add_single_normal_entry,
1192 .next_entry = iter_next_nop_entry,
1193 .add_next_entry = iter_add_next_nop_entry,
1194 .finish_entry = iter_finish_normal_entry,
1195};
1196
1197const struct hist_iter_ops hist_iter_cumulative = {
1198 .prepare_entry = iter_prepare_cumulative_entry,
1199 .add_single_entry = iter_add_single_cumulative_entry,
1200 .next_entry = iter_next_cumulative_entry,
1201 .add_next_entry = iter_add_next_cumulative_entry,
1202 .finish_entry = iter_finish_cumulative_entry,
1203};
1204
1205int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
1206 int max_stack_depth, void *arg)
1207{
1208 int err, err2;
1209 struct map *alm = NULL;
1210
1211 if (al)
1212 alm = map__get(al->map);
1213
1214 err = sample__resolve_callchain(iter->sample, &callchain_cursor, &iter->parent,
1215 iter->evsel, al, max_stack_depth);
1216 if (err) {
1217 map__put(alm);
1218 return err;
1219 }
1220
1221 err = iter->ops->prepare_entry(iter, al);
1222 if (err)
1223 goto out;
1224
1225 err = iter->ops->add_single_entry(iter, al);
1226 if (err)
1227 goto out;
1228
1229 if (iter->he && iter->add_entry_cb) {
1230 err = iter->add_entry_cb(iter, al, true, arg);
1231 if (err)
1232 goto out;
1233 }
1234
1235 while (iter->ops->next_entry(iter, al)) {
1236 err = iter->ops->add_next_entry(iter, al);
1237 if (err)
1238 break;
1239
1240 if (iter->he && iter->add_entry_cb) {
1241 err = iter->add_entry_cb(iter, al, false, arg);
1242 if (err)
1243 goto out;
1244 }
1245 }
1246
1247out:
1248 err2 = iter->ops->finish_entry(iter, al);
1249 if (!err)
1250 err = err2;
1251
1252 map__put(alm);
1253
1254 return err;
1255}
1256
1257int64_t
1258hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1259{
1260 struct hists *hists = left->hists;
1261 struct perf_hpp_fmt *fmt;
1262 int64_t cmp = 0;
1263
1264 hists__for_each_sort_list(hists, fmt) {
1265 if (perf_hpp__is_dynamic_entry(fmt) &&
1266 !perf_hpp__defined_dynamic_entry(fmt, hists))
1267 continue;
1268
1269 cmp = fmt->cmp(fmt, left, right);
1270 if (cmp)
1271 break;
1272 }
1273
1274 return cmp;
1275}
1276
1277int64_t
1278hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1279{
1280 struct hists *hists = left->hists;
1281 struct perf_hpp_fmt *fmt;
1282 int64_t cmp = 0;
1283
1284 hists__for_each_sort_list(hists, fmt) {
1285 if (perf_hpp__is_dynamic_entry(fmt) &&
1286 !perf_hpp__defined_dynamic_entry(fmt, hists))
1287 continue;
1288
1289 cmp = fmt->collapse(fmt, left, right);
1290 if (cmp)
1291 break;
1292 }
1293
1294 return cmp;
1295}
1296
1297void hist_entry__delete(struct hist_entry *he)
1298{
1299 struct hist_entry_ops *ops = he->ops;
1300
1301 thread__zput(he->thread);
1302 map__zput(he->ms.map);
1303
1304 if (he->branch_info) {
1305 map__zput(he->branch_info->from.ms.map);
1306 map__zput(he->branch_info->to.ms.map);
1307 free_srcline(he->branch_info->srcline_from);
1308 free_srcline(he->branch_info->srcline_to);
1309 zfree(&he->branch_info);
1310 }
1311
1312 if (he->mem_info) {
1313 map__zput(he->mem_info->iaddr.ms.map);
1314 map__zput(he->mem_info->daddr.ms.map);
1315 mem_info__zput(he->mem_info);
1316 }
1317
1318 if (he->block_info)
1319 block_info__zput(he->block_info);
1320
1321 zfree(&he->res_samples);
1322 zfree(&he->stat_acc);
1323 free_srcline(he->srcline);
1324 if (he->srcfile && he->srcfile[0])
1325 zfree(&he->srcfile);
1326 free_callchain(he->callchain);
1327 zfree(&he->trace_output);
1328 zfree(&he->raw_data);
1329 ops->free(he);
1330}
1331
1332/*
1333 * If this is not the last column, then we need to pad it according to the
1334 * pre-calculated max length for this column, otherwise don't bother adding
1335 * spaces because that would break viewing this with, for instance, 'less',
1336 * that would show tons of trailing spaces when a long C++ demangled method
1337 * names is sampled.
1338*/
1339int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1340 struct perf_hpp_fmt *fmt, int printed)
1341{
1342 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1343 const int width = fmt->width(fmt, hpp, he->hists);
1344 if (printed < width) {
1345 advance_hpp(hpp, printed);
1346 printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
1347 }
1348 }
1349
1350 return printed;
1351}
1352
1353/*
1354 * collapse the histogram
1355 */
1356
1357static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1358static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1359 enum hist_filter type);
1360
1361typedef bool (*fmt_chk_fn)(struct perf_hpp_fmt *fmt);
1362
1363static bool check_thread_entry(struct perf_hpp_fmt *fmt)
1364{
1365 return perf_hpp__is_thread_entry(fmt) || perf_hpp__is_comm_entry(fmt);
1366}
1367
1368static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1369 enum hist_filter type,
1370 fmt_chk_fn check)
1371{
1372 struct perf_hpp_fmt *fmt;
1373 bool type_match = false;
1374 struct hist_entry *parent = he->parent_he;
1375
1376 switch (type) {
1377 case HIST_FILTER__THREAD:
1378 if (symbol_conf.comm_list == NULL &&
1379 symbol_conf.pid_list == NULL &&
1380 symbol_conf.tid_list == NULL)
1381 return;
1382 break;
1383 case HIST_FILTER__DSO:
1384 if (symbol_conf.dso_list == NULL)
1385 return;
1386 break;
1387 case HIST_FILTER__SYMBOL:
1388 if (symbol_conf.sym_list == NULL)
1389 return;
1390 break;
1391 case HIST_FILTER__PARENT:
1392 case HIST_FILTER__GUEST:
1393 case HIST_FILTER__HOST:
1394 case HIST_FILTER__SOCKET:
1395 case HIST_FILTER__C2C:
1396 default:
1397 return;
1398 }
1399
1400 /* if it's filtered by own fmt, it has to have filter bits */
1401 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1402 if (check(fmt)) {
1403 type_match = true;
1404 break;
1405 }
1406 }
1407
1408 if (type_match) {
1409 /*
1410 * If the filter is for current level entry, propagate
1411 * filter marker to parents. The marker bit was
1412 * already set by default so it only needs to clear
1413 * non-filtered entries.
1414 */
1415 if (!(he->filtered & (1 << type))) {
1416 while (parent) {
1417 parent->filtered &= ~(1 << type);
1418 parent = parent->parent_he;
1419 }
1420 }
1421 } else {
1422 /*
1423 * If current entry doesn't have matching formats, set
1424 * filter marker for upper level entries. it will be
1425 * cleared if its lower level entries is not filtered.
1426 *
1427 * For lower-level entries, it inherits parent's
1428 * filter bit so that lower level entries of a
1429 * non-filtered entry won't set the filter marker.
1430 */
1431 if (parent == NULL)
1432 he->filtered |= (1 << type);
1433 else
1434 he->filtered |= (parent->filtered & (1 << type));
1435 }
1436}
1437
1438static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1439{
1440 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,
1441 check_thread_entry);
1442
1443 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,
1444 perf_hpp__is_dso_entry);
1445
1446 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,
1447 perf_hpp__is_sym_entry);
1448
1449 hists__apply_filters(he->hists, he);
1450}
1451
1452static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1453 struct rb_root_cached *root,
1454 struct hist_entry *he,
1455 struct hist_entry *parent_he,
1456 struct perf_hpp_list *hpp_list)
1457{
1458 struct rb_node **p = &root->rb_root.rb_node;
1459 struct rb_node *parent = NULL;
1460 struct hist_entry *iter, *new;
1461 struct perf_hpp_fmt *fmt;
1462 int64_t cmp;
1463 bool leftmost = true;
1464
1465 while (*p != NULL) {
1466 parent = *p;
1467 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1468
1469 cmp = 0;
1470 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1471 cmp = fmt->collapse(fmt, iter, he);
1472 if (cmp)
1473 break;
1474 }
1475
1476 if (!cmp) {
1477 he_stat__add_stat(&iter->stat, &he->stat);
1478 return iter;
1479 }
1480
1481 if (cmp < 0)
1482 p = &parent->rb_left;
1483 else {
1484 p = &parent->rb_right;
1485 leftmost = false;
1486 }
1487 }
1488
1489 new = hist_entry__new(he, true);
1490 if (new == NULL)
1491 return NULL;
1492
1493 hists->nr_entries++;
1494
1495 /* save related format list for output */
1496 new->hpp_list = hpp_list;
1497 new->parent_he = parent_he;
1498
1499 hist_entry__apply_hierarchy_filters(new);
1500
1501 /* some fields are now passed to 'new' */
1502 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1503 if (perf_hpp__is_trace_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1504 he->trace_output = NULL;
1505 else
1506 new->trace_output = NULL;
1507
1508 if (perf_hpp__is_srcline_entry(fmt))
1509 he->srcline = NULL;
1510 else
1511 new->srcline = NULL;
1512
1513 if (perf_hpp__is_srcfile_entry(fmt))
1514 he->srcfile = NULL;
1515 else
1516 new->srcfile = NULL;
1517 }
1518
1519 rb_link_node(&new->rb_node_in, parent, p);
1520 rb_insert_color_cached(&new->rb_node_in, root, leftmost);
1521 return new;
1522}
1523
1524static int hists__hierarchy_insert_entry(struct hists *hists,
1525 struct rb_root_cached *root,
1526 struct hist_entry *he)
1527{
1528 struct perf_hpp_list_node *node;
1529 struct hist_entry *new_he = NULL;
1530 struct hist_entry *parent = NULL;
1531 int depth = 0;
1532 int ret = 0;
1533
1534 list_for_each_entry(node, &hists->hpp_formats, list) {
1535 /* skip period (overhead) and elided columns */
1536 if (node->level == 0 || node->skip)
1537 continue;
1538
1539 /* insert copy of 'he' for each fmt into the hierarchy */
1540 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1541 if (new_he == NULL) {
1542 ret = -1;
1543 break;
1544 }
1545
1546 root = &new_he->hroot_in;
1547 new_he->depth = depth++;
1548 parent = new_he;
1549 }
1550
1551 if (new_he) {
1552 new_he->leaf = true;
1553
1554 if (hist_entry__has_callchains(new_he) &&
1555 symbol_conf.use_callchain) {
1556 callchain_cursor_reset(&callchain_cursor);
1557 if (callchain_merge(&callchain_cursor,
1558 new_he->callchain,
1559 he->callchain) < 0)
1560 ret = -1;
1561 }
1562 }
1563
1564 /* 'he' is no longer used */
1565 hist_entry__delete(he);
1566
1567 /* return 0 (or -1) since it already applied filters */
1568 return ret;
1569}
1570
1571static int hists__collapse_insert_entry(struct hists *hists,
1572 struct rb_root_cached *root,
1573 struct hist_entry *he)
1574{
1575 struct rb_node **p = &root->rb_root.rb_node;
1576 struct rb_node *parent = NULL;
1577 struct hist_entry *iter;
1578 int64_t cmp;
1579 bool leftmost = true;
1580
1581 if (symbol_conf.report_hierarchy)
1582 return hists__hierarchy_insert_entry(hists, root, he);
1583
1584 while (*p != NULL) {
1585 parent = *p;
1586 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1587
1588 cmp = hist_entry__collapse(iter, he);
1589
1590 if (!cmp) {
1591 int ret = 0;
1592
1593 he_stat__add_stat(&iter->stat, &he->stat);
1594 if (symbol_conf.cumulate_callchain)
1595 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1596
1597 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) {
1598 callchain_cursor_reset(&callchain_cursor);
1599 if (callchain_merge(&callchain_cursor,
1600 iter->callchain,
1601 he->callchain) < 0)
1602 ret = -1;
1603 }
1604 hist_entry__delete(he);
1605 return ret;
1606 }
1607
1608 if (cmp < 0)
1609 p = &(*p)->rb_left;
1610 else {
1611 p = &(*p)->rb_right;
1612 leftmost = false;
1613 }
1614 }
1615 hists->nr_entries++;
1616
1617 rb_link_node(&he->rb_node_in, parent, p);
1618 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
1619 return 1;
1620}
1621
1622struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists)
1623{
1624 struct rb_root_cached *root;
1625
1626 mutex_lock(&hists->lock);
1627
1628 root = hists->entries_in;
1629 if (++hists->entries_in > &hists->entries_in_array[1])
1630 hists->entries_in = &hists->entries_in_array[0];
1631
1632 mutex_unlock(&hists->lock);
1633
1634 return root;
1635}
1636
1637static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1638{
1639 hists__filter_entry_by_dso(hists, he);
1640 hists__filter_entry_by_thread(hists, he);
1641 hists__filter_entry_by_symbol(hists, he);
1642 hists__filter_entry_by_socket(hists, he);
1643}
1644
1645int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1646{
1647 struct rb_root_cached *root;
1648 struct rb_node *next;
1649 struct hist_entry *n;
1650 int ret;
1651
1652 if (!hists__has(hists, need_collapse))
1653 return 0;
1654
1655 hists->nr_entries = 0;
1656
1657 root = hists__get_rotate_entries_in(hists);
1658
1659 next = rb_first_cached(root);
1660
1661 while (next) {
1662 if (session_done())
1663 break;
1664 n = rb_entry(next, struct hist_entry, rb_node_in);
1665 next = rb_next(&n->rb_node_in);
1666
1667 rb_erase_cached(&n->rb_node_in, root);
1668 ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
1669 if (ret < 0)
1670 return -1;
1671
1672 if (ret) {
1673 /*
1674 * If it wasn't combined with one of the entries already
1675 * collapsed, we need to apply the filters that may have
1676 * been set by, say, the hist_browser.
1677 */
1678 hists__apply_filters(hists, n);
1679 }
1680 if (prog)
1681 ui_progress__update(prog, 1);
1682 }
1683 return 0;
1684}
1685
1686static int64_t hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1687{
1688 struct hists *hists = a->hists;
1689 struct perf_hpp_fmt *fmt;
1690 int64_t cmp = 0;
1691
1692 hists__for_each_sort_list(hists, fmt) {
1693 if (perf_hpp__should_skip(fmt, a->hists))
1694 continue;
1695
1696 cmp = fmt->sort(fmt, a, b);
1697 if (cmp)
1698 break;
1699 }
1700
1701 return cmp;
1702}
1703
1704static void hists__reset_filter_stats(struct hists *hists)
1705{
1706 hists->nr_non_filtered_entries = 0;
1707 hists->stats.total_non_filtered_period = 0;
1708}
1709
1710void hists__reset_stats(struct hists *hists)
1711{
1712 hists->nr_entries = 0;
1713 hists->stats.total_period = 0;
1714
1715 hists__reset_filter_stats(hists);
1716}
1717
1718static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1719{
1720 hists->nr_non_filtered_entries++;
1721 hists->stats.total_non_filtered_period += h->stat.period;
1722}
1723
1724void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1725{
1726 if (!h->filtered)
1727 hists__inc_filter_stats(hists, h);
1728
1729 hists->nr_entries++;
1730 hists->stats.total_period += h->stat.period;
1731}
1732
1733static void hierarchy_recalc_total_periods(struct hists *hists)
1734{
1735 struct rb_node *node;
1736 struct hist_entry *he;
1737
1738 node = rb_first_cached(&hists->entries);
1739
1740 hists->stats.total_period = 0;
1741 hists->stats.total_non_filtered_period = 0;
1742
1743 /*
1744 * recalculate total period using top-level entries only
1745 * since lower level entries only see non-filtered entries
1746 * but upper level entries have sum of both entries.
1747 */
1748 while (node) {
1749 he = rb_entry(node, struct hist_entry, rb_node);
1750 node = rb_next(node);
1751
1752 hists->stats.total_period += he->stat.period;
1753 if (!he->filtered)
1754 hists->stats.total_non_filtered_period += he->stat.period;
1755 }
1756}
1757
1758static void hierarchy_insert_output_entry(struct rb_root_cached *root,
1759 struct hist_entry *he)
1760{
1761 struct rb_node **p = &root->rb_root.rb_node;
1762 struct rb_node *parent = NULL;
1763 struct hist_entry *iter;
1764 struct perf_hpp_fmt *fmt;
1765 bool leftmost = true;
1766
1767 while (*p != NULL) {
1768 parent = *p;
1769 iter = rb_entry(parent, struct hist_entry, rb_node);
1770
1771 if (hist_entry__sort(he, iter) > 0)
1772 p = &parent->rb_left;
1773 else {
1774 p = &parent->rb_right;
1775 leftmost = false;
1776 }
1777 }
1778
1779 rb_link_node(&he->rb_node, parent, p);
1780 rb_insert_color_cached(&he->rb_node, root, leftmost);
1781
1782 /* update column width of dynamic entry */
1783 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
1784 if (fmt->init)
1785 fmt->init(fmt, he);
1786 }
1787}
1788
1789static void hists__hierarchy_output_resort(struct hists *hists,
1790 struct ui_progress *prog,
1791 struct rb_root_cached *root_in,
1792 struct rb_root_cached *root_out,
1793 u64 min_callchain_hits,
1794 bool use_callchain)
1795{
1796 struct rb_node *node;
1797 struct hist_entry *he;
1798
1799 *root_out = RB_ROOT_CACHED;
1800 node = rb_first_cached(root_in);
1801
1802 while (node) {
1803 he = rb_entry(node, struct hist_entry, rb_node_in);
1804 node = rb_next(node);
1805
1806 hierarchy_insert_output_entry(root_out, he);
1807
1808 if (prog)
1809 ui_progress__update(prog, 1);
1810
1811 hists->nr_entries++;
1812 if (!he->filtered) {
1813 hists->nr_non_filtered_entries++;
1814 hists__calc_col_len(hists, he);
1815 }
1816
1817 if (!he->leaf) {
1818 hists__hierarchy_output_resort(hists, prog,
1819 &he->hroot_in,
1820 &he->hroot_out,
1821 min_callchain_hits,
1822 use_callchain);
1823 continue;
1824 }
1825
1826 if (!use_callchain)
1827 continue;
1828
1829 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1830 u64 total = he->stat.period;
1831
1832 if (symbol_conf.cumulate_callchain)
1833 total = he->stat_acc->period;
1834
1835 min_callchain_hits = total * (callchain_param.min_percent / 100);
1836 }
1837
1838 callchain_param.sort(&he->sorted_chain, he->callchain,
1839 min_callchain_hits, &callchain_param);
1840 }
1841}
1842
1843static void __hists__insert_output_entry(struct rb_root_cached *entries,
1844 struct hist_entry *he,
1845 u64 min_callchain_hits,
1846 bool use_callchain)
1847{
1848 struct rb_node **p = &entries->rb_root.rb_node;
1849 struct rb_node *parent = NULL;
1850 struct hist_entry *iter;
1851 struct perf_hpp_fmt *fmt;
1852 bool leftmost = true;
1853
1854 if (use_callchain) {
1855 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1856 u64 total = he->stat.period;
1857
1858 if (symbol_conf.cumulate_callchain)
1859 total = he->stat_acc->period;
1860
1861 min_callchain_hits = total * (callchain_param.min_percent / 100);
1862 }
1863 callchain_param.sort(&he->sorted_chain, he->callchain,
1864 min_callchain_hits, &callchain_param);
1865 }
1866
1867 while (*p != NULL) {
1868 parent = *p;
1869 iter = rb_entry(parent, struct hist_entry, rb_node);
1870
1871 if (hist_entry__sort(he, iter) > 0)
1872 p = &(*p)->rb_left;
1873 else {
1874 p = &(*p)->rb_right;
1875 leftmost = false;
1876 }
1877 }
1878
1879 rb_link_node(&he->rb_node, parent, p);
1880 rb_insert_color_cached(&he->rb_node, entries, leftmost);
1881
1882 /* update column width of dynamic entries */
1883 perf_hpp_list__for_each_sort_list(&perf_hpp_list, fmt) {
1884 if (fmt->init)
1885 fmt->init(fmt, he);
1886 }
1887}
1888
1889static void output_resort(struct hists *hists, struct ui_progress *prog,
1890 bool use_callchain, hists__resort_cb_t cb,
1891 void *cb_arg)
1892{
1893 struct rb_root_cached *root;
1894 struct rb_node *next;
1895 struct hist_entry *n;
1896 u64 callchain_total;
1897 u64 min_callchain_hits;
1898
1899 callchain_total = hists->callchain_period;
1900 if (symbol_conf.filter_relative)
1901 callchain_total = hists->callchain_non_filtered_period;
1902
1903 min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1904
1905 hists__reset_stats(hists);
1906 hists__reset_col_len(hists);
1907
1908 if (symbol_conf.report_hierarchy) {
1909 hists__hierarchy_output_resort(hists, prog,
1910 &hists->entries_collapsed,
1911 &hists->entries,
1912 min_callchain_hits,
1913 use_callchain);
1914 hierarchy_recalc_total_periods(hists);
1915 return;
1916 }
1917
1918 if (hists__has(hists, need_collapse))
1919 root = &hists->entries_collapsed;
1920 else
1921 root = hists->entries_in;
1922
1923 next = rb_first_cached(root);
1924 hists->entries = RB_ROOT_CACHED;
1925
1926 while (next) {
1927 n = rb_entry(next, struct hist_entry, rb_node_in);
1928 next = rb_next(&n->rb_node_in);
1929
1930 if (cb && cb(n, cb_arg))
1931 continue;
1932
1933 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1934 hists__inc_stats(hists, n);
1935
1936 if (!n->filtered)
1937 hists__calc_col_len(hists, n);
1938
1939 if (prog)
1940 ui_progress__update(prog, 1);
1941 }
1942}
1943
1944void evsel__output_resort_cb(struct evsel *evsel, struct ui_progress *prog,
1945 hists__resort_cb_t cb, void *cb_arg)
1946{
1947 bool use_callchain;
1948
1949 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1950 use_callchain = evsel__has_callchain(evsel);
1951 else
1952 use_callchain = symbol_conf.use_callchain;
1953
1954 use_callchain |= symbol_conf.show_branchflag_count;
1955
1956 output_resort(evsel__hists(evsel), prog, use_callchain, cb, cb_arg);
1957}
1958
1959void evsel__output_resort(struct evsel *evsel, struct ui_progress *prog)
1960{
1961 return evsel__output_resort_cb(evsel, prog, NULL, NULL);
1962}
1963
1964void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1965{
1966 output_resort(hists, prog, symbol_conf.use_callchain, NULL, NULL);
1967}
1968
1969void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
1970 hists__resort_cb_t cb)
1971{
1972 output_resort(hists, prog, symbol_conf.use_callchain, cb, NULL);
1973}
1974
1975static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
1976{
1977 if (he->leaf || hmd == HMD_FORCE_SIBLING)
1978 return false;
1979
1980 if (he->unfolded || hmd == HMD_FORCE_CHILD)
1981 return true;
1982
1983 return false;
1984}
1985
1986struct rb_node *rb_hierarchy_last(struct rb_node *node)
1987{
1988 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1989
1990 while (can_goto_child(he, HMD_NORMAL)) {
1991 node = rb_last(&he->hroot_out.rb_root);
1992 he = rb_entry(node, struct hist_entry, rb_node);
1993 }
1994 return node;
1995}
1996
1997struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
1998{
1999 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2000
2001 if (can_goto_child(he, hmd))
2002 node = rb_first_cached(&he->hroot_out);
2003 else
2004 node = rb_next(node);
2005
2006 while (node == NULL) {
2007 he = he->parent_he;
2008 if (he == NULL)
2009 break;
2010
2011 node = rb_next(&he->rb_node);
2012 }
2013 return node;
2014}
2015
2016struct rb_node *rb_hierarchy_prev(struct rb_node *node)
2017{
2018 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2019
2020 node = rb_prev(node);
2021 if (node)
2022 return rb_hierarchy_last(node);
2023
2024 he = he->parent_he;
2025 if (he == NULL)
2026 return NULL;
2027
2028 return &he->rb_node;
2029}
2030
2031bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
2032{
2033 struct rb_node *node;
2034 struct hist_entry *child;
2035 float percent;
2036
2037 if (he->leaf)
2038 return false;
2039
2040 node = rb_first_cached(&he->hroot_out);
2041 child = rb_entry(node, struct hist_entry, rb_node);
2042
2043 while (node && child->filtered) {
2044 node = rb_next(node);
2045 child = rb_entry(node, struct hist_entry, rb_node);
2046 }
2047
2048 if (node)
2049 percent = hist_entry__get_percent_limit(child);
2050 else
2051 percent = 0;
2052
2053 return node && percent >= limit;
2054}
2055
2056static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
2057 enum hist_filter filter)
2058{
2059 h->filtered &= ~(1 << filter);
2060
2061 if (symbol_conf.report_hierarchy) {
2062 struct hist_entry *parent = h->parent_he;
2063
2064 while (parent) {
2065 he_stat__add_stat(&parent->stat, &h->stat);
2066
2067 parent->filtered &= ~(1 << filter);
2068
2069 if (parent->filtered)
2070 goto next;
2071
2072 /* force fold unfiltered entry for simplicity */
2073 parent->unfolded = false;
2074 parent->has_no_entry = false;
2075 parent->row_offset = 0;
2076 parent->nr_rows = 0;
2077next:
2078 parent = parent->parent_he;
2079 }
2080 }
2081
2082 if (h->filtered)
2083 return;
2084
2085 /* force fold unfiltered entry for simplicity */
2086 h->unfolded = false;
2087 h->has_no_entry = false;
2088 h->row_offset = 0;
2089 h->nr_rows = 0;
2090
2091 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
2092
2093 hists__inc_filter_stats(hists, h);
2094 hists__calc_col_len(hists, h);
2095}
2096
2097
2098static bool hists__filter_entry_by_dso(struct hists *hists,
2099 struct hist_entry *he)
2100{
2101 if (hists->dso_filter != NULL &&
2102 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
2103 he->filtered |= (1 << HIST_FILTER__DSO);
2104 return true;
2105 }
2106
2107 return false;
2108}
2109
2110static bool hists__filter_entry_by_thread(struct hists *hists,
2111 struct hist_entry *he)
2112{
2113 if (hists->thread_filter != NULL &&
2114 he->thread != hists->thread_filter) {
2115 he->filtered |= (1 << HIST_FILTER__THREAD);
2116 return true;
2117 }
2118
2119 return false;
2120}
2121
2122static bool hists__filter_entry_by_symbol(struct hists *hists,
2123 struct hist_entry *he)
2124{
2125 if (hists->symbol_filter_str != NULL &&
2126 (!he->ms.sym || strstr(he->ms.sym->name,
2127 hists->symbol_filter_str) == NULL)) {
2128 he->filtered |= (1 << HIST_FILTER__SYMBOL);
2129 return true;
2130 }
2131
2132 return false;
2133}
2134
2135static bool hists__filter_entry_by_socket(struct hists *hists,
2136 struct hist_entry *he)
2137{
2138 if ((hists->socket_filter > -1) &&
2139 (he->socket != hists->socket_filter)) {
2140 he->filtered |= (1 << HIST_FILTER__SOCKET);
2141 return true;
2142 }
2143
2144 return false;
2145}
2146
2147typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2148
2149static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
2150{
2151 struct rb_node *nd;
2152
2153 hists->stats.nr_non_filtered_samples = 0;
2154
2155 hists__reset_filter_stats(hists);
2156 hists__reset_col_len(hists);
2157
2158 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {
2159 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2160
2161 if (filter(hists, h))
2162 continue;
2163
2164 hists__remove_entry_filter(hists, h, type);
2165 }
2166}
2167
2168static void resort_filtered_entry(struct rb_root_cached *root,
2169 struct hist_entry *he)
2170{
2171 struct rb_node **p = &root->rb_root.rb_node;
2172 struct rb_node *parent = NULL;
2173 struct hist_entry *iter;
2174 struct rb_root_cached new_root = RB_ROOT_CACHED;
2175 struct rb_node *nd;
2176 bool leftmost = true;
2177
2178 while (*p != NULL) {
2179 parent = *p;
2180 iter = rb_entry(parent, struct hist_entry, rb_node);
2181
2182 if (hist_entry__sort(he, iter) > 0)
2183 p = &(*p)->rb_left;
2184 else {
2185 p = &(*p)->rb_right;
2186 leftmost = false;
2187 }
2188 }
2189
2190 rb_link_node(&he->rb_node, parent, p);
2191 rb_insert_color_cached(&he->rb_node, root, leftmost);
2192
2193 if (he->leaf || he->filtered)
2194 return;
2195
2196 nd = rb_first_cached(&he->hroot_out);
2197 while (nd) {
2198 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2199
2200 nd = rb_next(nd);
2201 rb_erase_cached(&h->rb_node, &he->hroot_out);
2202
2203 resort_filtered_entry(&new_root, h);
2204 }
2205
2206 he->hroot_out = new_root;
2207}
2208
2209static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
2210{
2211 struct rb_node *nd;
2212 struct rb_root_cached new_root = RB_ROOT_CACHED;
2213
2214 hists->stats.nr_non_filtered_samples = 0;
2215
2216 hists__reset_filter_stats(hists);
2217 hists__reset_col_len(hists);
2218
2219 nd = rb_first_cached(&hists->entries);
2220 while (nd) {
2221 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2222 int ret;
2223
2224 ret = hist_entry__filter(h, type, arg);
2225
2226 /*
2227 * case 1. non-matching type
2228 * zero out the period, set filter marker and move to child
2229 */
2230 if (ret < 0) {
2231 memset(&h->stat, 0, sizeof(h->stat));
2232 h->filtered |= (1 << type);
2233
2234 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
2235 }
2236 /*
2237 * case 2. matched type (filter out)
2238 * set filter marker and move to next
2239 */
2240 else if (ret == 1) {
2241 h->filtered |= (1 << type);
2242
2243 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2244 }
2245 /*
2246 * case 3. ok (not filtered)
2247 * add period to hists and parents, erase the filter marker
2248 * and move to next sibling
2249 */
2250 else {
2251 hists__remove_entry_filter(hists, h, type);
2252
2253 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2254 }
2255 }
2256
2257 hierarchy_recalc_total_periods(hists);
2258
2259 /*
2260 * resort output after applying a new filter since filter in a lower
2261 * hierarchy can change periods in a upper hierarchy.
2262 */
2263 nd = rb_first_cached(&hists->entries);
2264 while (nd) {
2265 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2266
2267 nd = rb_next(nd);
2268 rb_erase_cached(&h->rb_node, &hists->entries);
2269
2270 resort_filtered_entry(&new_root, h);
2271 }
2272
2273 hists->entries = new_root;
2274}
2275
2276void hists__filter_by_thread(struct hists *hists)
2277{
2278 if (symbol_conf.report_hierarchy)
2279 hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
2280 hists->thread_filter);
2281 else
2282 hists__filter_by_type(hists, HIST_FILTER__THREAD,
2283 hists__filter_entry_by_thread);
2284}
2285
2286void hists__filter_by_dso(struct hists *hists)
2287{
2288 if (symbol_conf.report_hierarchy)
2289 hists__filter_hierarchy(hists, HIST_FILTER__DSO,
2290 hists->dso_filter);
2291 else
2292 hists__filter_by_type(hists, HIST_FILTER__DSO,
2293 hists__filter_entry_by_dso);
2294}
2295
2296void hists__filter_by_symbol(struct hists *hists)
2297{
2298 if (symbol_conf.report_hierarchy)
2299 hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
2300 hists->symbol_filter_str);
2301 else
2302 hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
2303 hists__filter_entry_by_symbol);
2304}
2305
2306void hists__filter_by_socket(struct hists *hists)
2307{
2308 if (symbol_conf.report_hierarchy)
2309 hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
2310 &hists->socket_filter);
2311 else
2312 hists__filter_by_type(hists, HIST_FILTER__SOCKET,
2313 hists__filter_entry_by_socket);
2314}
2315
2316void events_stats__inc(struct events_stats *stats, u32 type)
2317{
2318 ++stats->nr_events[0];
2319 ++stats->nr_events[type];
2320}
2321
2322static void hists_stats__inc(struct hists_stats *stats)
2323{
2324 ++stats->nr_samples;
2325}
2326
2327void hists__inc_nr_events(struct hists *hists)
2328{
2329 hists_stats__inc(&hists->stats);
2330}
2331
2332void hists__inc_nr_samples(struct hists *hists, bool filtered)
2333{
2334 hists_stats__inc(&hists->stats);
2335 if (!filtered)
2336 hists->stats.nr_non_filtered_samples++;
2337}
2338
2339void hists__inc_nr_lost_samples(struct hists *hists, u32 lost)
2340{
2341 hists->stats.nr_lost_samples += lost;
2342}
2343
2344static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2345 struct hist_entry *pair)
2346{
2347 struct rb_root_cached *root;
2348 struct rb_node **p;
2349 struct rb_node *parent = NULL;
2350 struct hist_entry *he;
2351 int64_t cmp;
2352 bool leftmost = true;
2353
2354 if (hists__has(hists, need_collapse))
2355 root = &hists->entries_collapsed;
2356 else
2357 root = hists->entries_in;
2358
2359 p = &root->rb_root.rb_node;
2360
2361 while (*p != NULL) {
2362 parent = *p;
2363 he = rb_entry(parent, struct hist_entry, rb_node_in);
2364
2365 cmp = hist_entry__collapse(he, pair);
2366
2367 if (!cmp)
2368 goto out;
2369
2370 if (cmp < 0)
2371 p = &(*p)->rb_left;
2372 else {
2373 p = &(*p)->rb_right;
2374 leftmost = false;
2375 }
2376 }
2377
2378 he = hist_entry__new(pair, true);
2379 if (he) {
2380 memset(&he->stat, 0, sizeof(he->stat));
2381 he->hists = hists;
2382 if (symbol_conf.cumulate_callchain)
2383 memset(he->stat_acc, 0, sizeof(he->stat));
2384 rb_link_node(&he->rb_node_in, parent, p);
2385 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2386 hists__inc_stats(hists, he);
2387 he->dummy = true;
2388 }
2389out:
2390 return he;
2391}
2392
2393static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2394 struct rb_root_cached *root,
2395 struct hist_entry *pair)
2396{
2397 struct rb_node **p;
2398 struct rb_node *parent = NULL;
2399 struct hist_entry *he;
2400 struct perf_hpp_fmt *fmt;
2401 bool leftmost = true;
2402
2403 p = &root->rb_root.rb_node;
2404 while (*p != NULL) {
2405 int64_t cmp = 0;
2406
2407 parent = *p;
2408 he = rb_entry(parent, struct hist_entry, rb_node_in);
2409
2410 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2411 cmp = fmt->collapse(fmt, he, pair);
2412 if (cmp)
2413 break;
2414 }
2415 if (!cmp)
2416 goto out;
2417
2418 if (cmp < 0)
2419 p = &parent->rb_left;
2420 else {
2421 p = &parent->rb_right;
2422 leftmost = false;
2423 }
2424 }
2425
2426 he = hist_entry__new(pair, true);
2427 if (he) {
2428 rb_link_node(&he->rb_node_in, parent, p);
2429 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2430
2431 he->dummy = true;
2432 he->hists = hists;
2433 memset(&he->stat, 0, sizeof(he->stat));
2434 hists__inc_stats(hists, he);
2435 }
2436out:
2437 return he;
2438}
2439
2440static struct hist_entry *hists__find_entry(struct hists *hists,
2441 struct hist_entry *he)
2442{
2443 struct rb_node *n;
2444
2445 if (hists__has(hists, need_collapse))
2446 n = hists->entries_collapsed.rb_root.rb_node;
2447 else
2448 n = hists->entries_in->rb_root.rb_node;
2449
2450 while (n) {
2451 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2452 int64_t cmp = hist_entry__collapse(iter, he);
2453
2454 if (cmp < 0)
2455 n = n->rb_left;
2456 else if (cmp > 0)
2457 n = n->rb_right;
2458 else
2459 return iter;
2460 }
2461
2462 return NULL;
2463}
2464
2465static struct hist_entry *hists__find_hierarchy_entry(struct rb_root_cached *root,
2466 struct hist_entry *he)
2467{
2468 struct rb_node *n = root->rb_root.rb_node;
2469
2470 while (n) {
2471 struct hist_entry *iter;
2472 struct perf_hpp_fmt *fmt;
2473 int64_t cmp = 0;
2474
2475 iter = rb_entry(n, struct hist_entry, rb_node_in);
2476 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2477 cmp = fmt->collapse(fmt, iter, he);
2478 if (cmp)
2479 break;
2480 }
2481
2482 if (cmp < 0)
2483 n = n->rb_left;
2484 else if (cmp > 0)
2485 n = n->rb_right;
2486 else
2487 return iter;
2488 }
2489
2490 return NULL;
2491}
2492
2493static void hists__match_hierarchy(struct rb_root_cached *leader_root,
2494 struct rb_root_cached *other_root)
2495{
2496 struct rb_node *nd;
2497 struct hist_entry *pos, *pair;
2498
2499 for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {
2500 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2501 pair = hists__find_hierarchy_entry(other_root, pos);
2502
2503 if (pair) {
2504 hist_entry__add_pair(pair, pos);
2505 hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
2506 }
2507 }
2508}
2509
2510/*
2511 * Look for pairs to link to the leader buckets (hist_entries):
2512 */
2513void hists__match(struct hists *leader, struct hists *other)
2514{
2515 struct rb_root_cached *root;
2516 struct rb_node *nd;
2517 struct hist_entry *pos, *pair;
2518
2519 if (symbol_conf.report_hierarchy) {
2520 /* hierarchy report always collapses entries */
2521 return hists__match_hierarchy(&leader->entries_collapsed,
2522 &other->entries_collapsed);
2523 }
2524
2525 if (hists__has(leader, need_collapse))
2526 root = &leader->entries_collapsed;
2527 else
2528 root = leader->entries_in;
2529
2530 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2531 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2532 pair = hists__find_entry(other, pos);
2533
2534 if (pair)
2535 hist_entry__add_pair(pair, pos);
2536 }
2537}
2538
2539static int hists__link_hierarchy(struct hists *leader_hists,
2540 struct hist_entry *parent,
2541 struct rb_root_cached *leader_root,
2542 struct rb_root_cached *other_root)
2543{
2544 struct rb_node *nd;
2545 struct hist_entry *pos, *leader;
2546
2547 for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {
2548 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2549
2550 if (hist_entry__has_pairs(pos)) {
2551 bool found = false;
2552
2553 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2554 if (leader->hists == leader_hists) {
2555 found = true;
2556 break;
2557 }
2558 }
2559 if (!found)
2560 return -1;
2561 } else {
2562 leader = add_dummy_hierarchy_entry(leader_hists,
2563 leader_root, pos);
2564 if (leader == NULL)
2565 return -1;
2566
2567 /* do not point parent in the pos */
2568 leader->parent_he = parent;
2569
2570 hist_entry__add_pair(pos, leader);
2571 }
2572
2573 if (!pos->leaf) {
2574 if (hists__link_hierarchy(leader_hists, leader,
2575 &leader->hroot_in,
2576 &pos->hroot_in) < 0)
2577 return -1;
2578 }
2579 }
2580 return 0;
2581}
2582
2583/*
2584 * Look for entries in the other hists that are not present in the leader, if
2585 * we find them, just add a dummy entry on the leader hists, with period=0,
2586 * nr_events=0, to serve as the list header.
2587 */
2588int hists__link(struct hists *leader, struct hists *other)
2589{
2590 struct rb_root_cached *root;
2591 struct rb_node *nd;
2592 struct hist_entry *pos, *pair;
2593
2594 if (symbol_conf.report_hierarchy) {
2595 /* hierarchy report always collapses entries */
2596 return hists__link_hierarchy(leader, NULL,
2597 &leader->entries_collapsed,
2598 &other->entries_collapsed);
2599 }
2600
2601 if (hists__has(other, need_collapse))
2602 root = &other->entries_collapsed;
2603 else
2604 root = other->entries_in;
2605
2606 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2607 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2608
2609 if (!hist_entry__has_pairs(pos)) {
2610 pair = hists__add_dummy_entry(leader, pos);
2611 if (pair == NULL)
2612 return -1;
2613 hist_entry__add_pair(pos, pair);
2614 }
2615 }
2616
2617 return 0;
2618}
2619
2620int hists__unlink(struct hists *hists)
2621{
2622 struct rb_root_cached *root;
2623 struct rb_node *nd;
2624 struct hist_entry *pos;
2625
2626 if (hists__has(hists, need_collapse))
2627 root = &hists->entries_collapsed;
2628 else
2629 root = hists->entries_in;
2630
2631 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2632 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2633 list_del_init(&pos->pairs.node);
2634 }
2635
2636 return 0;
2637}
2638
2639void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
2640 struct perf_sample *sample, bool nonany_branch_mode,
2641 u64 *total_cycles)
2642{
2643 struct branch_info *bi;
2644 struct branch_entry *entries = perf_sample__branch_entries(sample);
2645
2646 /* If we have branch cycles always annotate them. */
2647 if (bs && bs->nr && entries[0].flags.cycles) {
2648 int i;
2649
2650 bi = sample__resolve_bstack(sample, al);
2651 if (bi) {
2652 struct addr_map_symbol *prev = NULL;
2653
2654 /*
2655 * Ignore errors, still want to process the
2656 * other entries.
2657 *
2658 * For non standard branch modes always
2659 * force no IPC (prev == NULL)
2660 *
2661 * Note that perf stores branches reversed from
2662 * program order!
2663 */
2664 for (i = bs->nr - 1; i >= 0; i--) {
2665 addr_map_symbol__account_cycles(&bi[i].from,
2666 nonany_branch_mode ? NULL : prev,
2667 bi[i].flags.cycles);
2668 prev = &bi[i].to;
2669
2670 if (total_cycles)
2671 *total_cycles += bi[i].flags.cycles;
2672 }
2673 free(bi);
2674 }
2675 }
2676}
2677
2678size_t evlist__fprintf_nr_events(struct evlist *evlist, FILE *fp,
2679 bool skip_empty)
2680{
2681 struct evsel *pos;
2682 size_t ret = 0;
2683
2684 evlist__for_each_entry(evlist, pos) {
2685 struct hists *hists = evsel__hists(pos);
2686
2687 if (skip_empty && !hists->stats.nr_samples && !hists->stats.nr_lost_samples)
2688 continue;
2689
2690 ret += fprintf(fp, "%s stats:\n", evsel__name(pos));
2691 if (hists->stats.nr_samples)
2692 ret += fprintf(fp, "%16s events: %10d\n",
2693 "SAMPLE", hists->stats.nr_samples);
2694 if (hists->stats.nr_lost_samples)
2695 ret += fprintf(fp, "%16s events: %10d\n",
2696 "LOST_SAMPLES", hists->stats.nr_lost_samples);
2697 }
2698
2699 return ret;
2700}
2701
2702
2703u64 hists__total_period(struct hists *hists)
2704{
2705 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
2706 hists->stats.total_period;
2707}
2708
2709int __hists__scnprintf_title(struct hists *hists, char *bf, size_t size, bool show_freq)
2710{
2711 char unit;
2712 int printed;
2713 const struct dso *dso = hists->dso_filter;
2714 struct thread *thread = hists->thread_filter;
2715 int socket_id = hists->socket_filter;
2716 unsigned long nr_samples = hists->stats.nr_samples;
2717 u64 nr_events = hists->stats.total_period;
2718 struct evsel *evsel = hists_to_evsel(hists);
2719 const char *ev_name = evsel__name(evsel);
2720 char buf[512], sample_freq_str[64] = "";
2721 size_t buflen = sizeof(buf);
2722 char ref[30] = " show reference callgraph, ";
2723 bool enable_ref = false;
2724
2725 if (symbol_conf.filter_relative) {
2726 nr_samples = hists->stats.nr_non_filtered_samples;
2727 nr_events = hists->stats.total_non_filtered_period;
2728 }
2729
2730 if (evsel__is_group_event(evsel)) {
2731 struct evsel *pos;
2732
2733 evsel__group_desc(evsel, buf, buflen);
2734 ev_name = buf;
2735
2736 for_each_group_member(pos, evsel) {
2737 struct hists *pos_hists = evsel__hists(pos);
2738
2739 if (symbol_conf.filter_relative) {
2740 nr_samples += pos_hists->stats.nr_non_filtered_samples;
2741 nr_events += pos_hists->stats.total_non_filtered_period;
2742 } else {
2743 nr_samples += pos_hists->stats.nr_samples;
2744 nr_events += pos_hists->stats.total_period;
2745 }
2746 }
2747 }
2748
2749 if (symbol_conf.show_ref_callgraph &&
2750 strstr(ev_name, "call-graph=no"))
2751 enable_ref = true;
2752
2753 if (show_freq)
2754 scnprintf(sample_freq_str, sizeof(sample_freq_str), " %d Hz,", evsel->core.attr.sample_freq);
2755
2756 nr_samples = convert_unit(nr_samples, &unit);
2757 printed = scnprintf(bf, size,
2758 "Samples: %lu%c of event%s '%s',%s%sEvent count (approx.): %" PRIu64,
2759 nr_samples, unit, evsel->core.nr_members > 1 ? "s" : "",
2760 ev_name, sample_freq_str, enable_ref ? ref : " ", nr_events);
2761
2762
2763 if (hists->uid_filter_str)
2764 printed += snprintf(bf + printed, size - printed,
2765 ", UID: %s", hists->uid_filter_str);
2766 if (thread) {
2767 if (hists__has(hists, thread)) {
2768 printed += scnprintf(bf + printed, size - printed,
2769 ", Thread: %s(%d)",
2770 (thread->comm_set ? thread__comm_str(thread) : ""),
2771 thread->tid);
2772 } else {
2773 printed += scnprintf(bf + printed, size - printed,
2774 ", Thread: %s",
2775 (thread->comm_set ? thread__comm_str(thread) : ""));
2776 }
2777 }
2778 if (dso)
2779 printed += scnprintf(bf + printed, size - printed,
2780 ", DSO: %s", dso->short_name);
2781 if (socket_id > -1)
2782 printed += scnprintf(bf + printed, size - printed,
2783 ", Processor Socket: %d", socket_id);
2784
2785 return printed;
2786}
2787
2788int parse_filter_percentage(const struct option *opt __maybe_unused,
2789 const char *arg, int unset __maybe_unused)
2790{
2791 if (!strcmp(arg, "relative"))
2792 symbol_conf.filter_relative = true;
2793 else if (!strcmp(arg, "absolute"))
2794 symbol_conf.filter_relative = false;
2795 else {
2796 pr_debug("Invalid percentage: %s\n", arg);
2797 return -1;
2798 }
2799
2800 return 0;
2801}
2802
2803int perf_hist_config(const char *var, const char *value)
2804{
2805 if (!strcmp(var, "hist.percentage"))
2806 return parse_filter_percentage(NULL, value, 0);
2807
2808 return 0;
2809}
2810
2811int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2812{
2813 memset(hists, 0, sizeof(*hists));
2814 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT_CACHED;
2815 hists->entries_in = &hists->entries_in_array[0];
2816 hists->entries_collapsed = RB_ROOT_CACHED;
2817 hists->entries = RB_ROOT_CACHED;
2818 mutex_init(&hists->lock);
2819 hists->socket_filter = -1;
2820 hists->hpp_list = hpp_list;
2821 INIT_LIST_HEAD(&hists->hpp_formats);
2822 return 0;
2823}
2824
2825static void hists__delete_remaining_entries(struct rb_root_cached *root)
2826{
2827 struct rb_node *node;
2828 struct hist_entry *he;
2829
2830 while (!RB_EMPTY_ROOT(&root->rb_root)) {
2831 node = rb_first_cached(root);
2832 rb_erase_cached(node, root);
2833
2834 he = rb_entry(node, struct hist_entry, rb_node_in);
2835 hist_entry__delete(he);
2836 }
2837}
2838
2839static void hists__delete_all_entries(struct hists *hists)
2840{
2841 hists__delete_entries(hists);
2842 hists__delete_remaining_entries(&hists->entries_in_array[0]);
2843 hists__delete_remaining_entries(&hists->entries_in_array[1]);
2844 hists__delete_remaining_entries(&hists->entries_collapsed);
2845}
2846
2847static void hists_evsel__exit(struct evsel *evsel)
2848{
2849 struct hists *hists = evsel__hists(evsel);
2850 struct perf_hpp_fmt *fmt, *pos;
2851 struct perf_hpp_list_node *node, *tmp;
2852
2853 hists__delete_all_entries(hists);
2854
2855 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2856 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2857 list_del_init(&fmt->list);
2858 free(fmt);
2859 }
2860 list_del_init(&node->list);
2861 free(node);
2862 }
2863}
2864
2865static int hists_evsel__init(struct evsel *evsel)
2866{
2867 struct hists *hists = evsel__hists(evsel);
2868
2869 __hists__init(hists, &perf_hpp_list);
2870 return 0;
2871}
2872
2873/*
2874 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2875 * stored in the rbtree...
2876 */
2877
2878int hists__init(void)
2879{
2880 int err = evsel__object_config(sizeof(struct hists_evsel),
2881 hists_evsel__init, hists_evsel__exit);
2882 if (err)
2883 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
2884
2885 return err;
2886}
2887
2888void perf_hpp_list__init(struct perf_hpp_list *list)
2889{
2890 INIT_LIST_HEAD(&list->fields);
2891 INIT_LIST_HEAD(&list->sorts);
2892}
1// SPDX-License-Identifier: GPL-2.0
2#include "callchain.h"
3#include "debug.h"
4#include "dso.h"
5#include "build-id.h"
6#include "hist.h"
7#include "kvm-stat.h"
8#include "map.h"
9#include "map_symbol.h"
10#include "branch.h"
11#include "mem-events.h"
12#include "session.h"
13#include "namespaces.h"
14#include "cgroup.h"
15#include "sort.h"
16#include "units.h"
17#include "evlist.h"
18#include "evsel.h"
19#include "annotate.h"
20#include "srcline.h"
21#include "symbol.h"
22#include "thread.h"
23#include "block-info.h"
24#include "ui/progress.h"
25#include <errno.h>
26#include <math.h>
27#include <inttypes.h>
28#include <sys/param.h>
29#include <linux/rbtree.h>
30#include <linux/string.h>
31#include <linux/time64.h>
32#include <linux/zalloc.h>
33
34static bool hists__filter_entry_by_dso(struct hists *hists,
35 struct hist_entry *he);
36static bool hists__filter_entry_by_thread(struct hists *hists,
37 struct hist_entry *he);
38static bool hists__filter_entry_by_symbol(struct hists *hists,
39 struct hist_entry *he);
40static bool hists__filter_entry_by_socket(struct hists *hists,
41 struct hist_entry *he);
42
43u16 hists__col_len(struct hists *hists, enum hist_column col)
44{
45 return hists->col_len[col];
46}
47
48void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
49{
50 hists->col_len[col] = len;
51}
52
53bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
54{
55 if (len > hists__col_len(hists, col)) {
56 hists__set_col_len(hists, col, len);
57 return true;
58 }
59 return false;
60}
61
62void hists__reset_col_len(struct hists *hists)
63{
64 enum hist_column col;
65
66 for (col = 0; col < HISTC_NR_COLS; ++col)
67 hists__set_col_len(hists, col, 0);
68}
69
70static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
71{
72 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
73
74 if (hists__col_len(hists, dso) < unresolved_col_width &&
75 !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
76 !symbol_conf.dso_list)
77 hists__set_col_len(hists, dso, unresolved_col_width);
78}
79
80void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
81{
82 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
83 int symlen;
84 u16 len;
85
86 if (h->block_info)
87 return;
88 /*
89 * +4 accounts for '[x] ' priv level info
90 * +2 accounts for 0x prefix on raw addresses
91 * +3 accounts for ' y ' symtab origin info
92 */
93 if (h->ms.sym) {
94 symlen = h->ms.sym->namelen + 4;
95 if (verbose > 0)
96 symlen += BITS_PER_LONG / 4 + 2 + 3;
97 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
98 } else {
99 symlen = unresolved_col_width + 4 + 2;
100 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
101 hists__set_unres_dso_col_len(hists, HISTC_DSO);
102 }
103
104 len = thread__comm_len(h->thread);
105 if (hists__new_col_len(hists, HISTC_COMM, len))
106 hists__set_col_len(hists, HISTC_THREAD, len + 8);
107
108 if (h->ms.map) {
109 len = dso__name_len(map__dso(h->ms.map));
110 hists__new_col_len(hists, HISTC_DSO, len);
111 }
112
113 if (h->parent)
114 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
115
116 if (h->branch_info) {
117 if (h->branch_info->from.ms.sym) {
118 symlen = (int)h->branch_info->from.ms.sym->namelen + 4;
119 if (verbose > 0)
120 symlen += BITS_PER_LONG / 4 + 2 + 3;
121 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
122
123 symlen = dso__name_len(map__dso(h->branch_info->from.ms.map));
124 hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
125 } else {
126 symlen = unresolved_col_width + 4 + 2;
127 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
128 hists__new_col_len(hists, HISTC_ADDR_FROM, symlen);
129 hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
130 }
131
132 if (h->branch_info->to.ms.sym) {
133 symlen = (int)h->branch_info->to.ms.sym->namelen + 4;
134 if (verbose > 0)
135 symlen += BITS_PER_LONG / 4 + 2 + 3;
136 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
137
138 symlen = dso__name_len(map__dso(h->branch_info->to.ms.map));
139 hists__new_col_len(hists, HISTC_DSO_TO, symlen);
140 } else {
141 symlen = unresolved_col_width + 4 + 2;
142 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
143 hists__new_col_len(hists, HISTC_ADDR_TO, symlen);
144 hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
145 }
146
147 if (h->branch_info->srcline_from)
148 hists__new_col_len(hists, HISTC_SRCLINE_FROM,
149 strlen(h->branch_info->srcline_from));
150 if (h->branch_info->srcline_to)
151 hists__new_col_len(hists, HISTC_SRCLINE_TO,
152 strlen(h->branch_info->srcline_to));
153 }
154
155 if (h->mem_info) {
156 if (h->mem_info->daddr.ms.sym) {
157 symlen = (int)h->mem_info->daddr.ms.sym->namelen + 4
158 + unresolved_col_width + 2;
159 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
160 symlen);
161 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
162 symlen + 1);
163 } else {
164 symlen = unresolved_col_width + 4 + 2;
165 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
166 symlen);
167 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
168 symlen);
169 }
170
171 if (h->mem_info->iaddr.ms.sym) {
172 symlen = (int)h->mem_info->iaddr.ms.sym->namelen + 4
173 + unresolved_col_width + 2;
174 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
175 symlen);
176 } else {
177 symlen = unresolved_col_width + 4 + 2;
178 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
179 symlen);
180 }
181
182 if (h->mem_info->daddr.ms.map) {
183 symlen = dso__name_len(map__dso(h->mem_info->daddr.ms.map));
184 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
185 symlen);
186 } else {
187 symlen = unresolved_col_width + 4 + 2;
188 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
189 }
190
191 hists__new_col_len(hists, HISTC_MEM_PHYS_DADDR,
192 unresolved_col_width + 4 + 2);
193
194 hists__new_col_len(hists, HISTC_MEM_DATA_PAGE_SIZE,
195 unresolved_col_width + 4 + 2);
196
197 } else {
198 symlen = unresolved_col_width + 4 + 2;
199 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
200 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
201 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
202 }
203
204 hists__new_col_len(hists, HISTC_CGROUP, 6);
205 hists__new_col_len(hists, HISTC_CGROUP_ID, 20);
206 hists__new_col_len(hists, HISTC_CPU, 3);
207 hists__new_col_len(hists, HISTC_SOCKET, 6);
208 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
209 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
210 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
211 hists__new_col_len(hists, HISTC_MEM_LVL, 36 + 3);
212 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
213 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
214 hists__new_col_len(hists, HISTC_MEM_BLOCKED, 10);
215 hists__new_col_len(hists, HISTC_LOCAL_INS_LAT, 13);
216 hists__new_col_len(hists, HISTC_GLOBAL_INS_LAT, 13);
217 hists__new_col_len(hists, HISTC_LOCAL_P_STAGE_CYC, 13);
218 hists__new_col_len(hists, HISTC_GLOBAL_P_STAGE_CYC, 13);
219 hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2);
220
221 if (symbol_conf.nanosecs)
222 hists__new_col_len(hists, HISTC_TIME, 16);
223 else
224 hists__new_col_len(hists, HISTC_TIME, 12);
225 hists__new_col_len(hists, HISTC_CODE_PAGE_SIZE, 6);
226
227 if (h->srcline) {
228 len = MAX(strlen(h->srcline), strlen(sort_srcline.se_header));
229 hists__new_col_len(hists, HISTC_SRCLINE, len);
230 }
231
232 if (h->srcfile)
233 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
234
235 if (h->transaction)
236 hists__new_col_len(hists, HISTC_TRANSACTION,
237 hist_entry__transaction_len());
238
239 if (h->trace_output)
240 hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
241
242 if (h->cgroup) {
243 const char *cgrp_name = "unknown";
244 struct cgroup *cgrp = cgroup__find(maps__machine(h->ms.maps)->env,
245 h->cgroup);
246 if (cgrp != NULL)
247 cgrp_name = cgrp->name;
248
249 hists__new_col_len(hists, HISTC_CGROUP, strlen(cgrp_name));
250 }
251}
252
253void hists__output_recalc_col_len(struct hists *hists, int max_rows)
254{
255 struct rb_node *next = rb_first_cached(&hists->entries);
256 struct hist_entry *n;
257 int row = 0;
258
259 hists__reset_col_len(hists);
260
261 while (next && row++ < max_rows) {
262 n = rb_entry(next, struct hist_entry, rb_node);
263 if (!n->filtered)
264 hists__calc_col_len(hists, n);
265 next = rb_next(&n->rb_node);
266 }
267}
268
269static void he_stat__add_cpumode_period(struct he_stat *he_stat,
270 unsigned int cpumode, u64 period)
271{
272 switch (cpumode) {
273 case PERF_RECORD_MISC_KERNEL:
274 he_stat->period_sys += period;
275 break;
276 case PERF_RECORD_MISC_USER:
277 he_stat->period_us += period;
278 break;
279 case PERF_RECORD_MISC_GUEST_KERNEL:
280 he_stat->period_guest_sys += period;
281 break;
282 case PERF_RECORD_MISC_GUEST_USER:
283 he_stat->period_guest_us += period;
284 break;
285 default:
286 break;
287 }
288}
289
290static long hist_time(unsigned long htime)
291{
292 unsigned long time_quantum = symbol_conf.time_quantum;
293 if (time_quantum)
294 return (htime / time_quantum) * time_quantum;
295 return htime;
296}
297
298static void he_stat__add_period(struct he_stat *he_stat, u64 period)
299{
300 he_stat->period += period;
301 he_stat->nr_events += 1;
302}
303
304static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
305{
306 dest->period += src->period;
307 dest->period_sys += src->period_sys;
308 dest->period_us += src->period_us;
309 dest->period_guest_sys += src->period_guest_sys;
310 dest->period_guest_us += src->period_guest_us;
311 dest->nr_events += src->nr_events;
312}
313
314static void he_stat__decay(struct he_stat *he_stat)
315{
316 he_stat->period = (he_stat->period * 7) / 8;
317 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
318 /* XXX need decay for weight too? */
319}
320
321static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
322
323static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
324{
325 u64 prev_period = he->stat.period;
326 u64 diff;
327
328 if (prev_period == 0)
329 return true;
330
331 he_stat__decay(&he->stat);
332 if (symbol_conf.cumulate_callchain)
333 he_stat__decay(he->stat_acc);
334 decay_callchain(he->callchain);
335
336 diff = prev_period - he->stat.period;
337
338 if (!he->depth) {
339 hists->stats.total_period -= diff;
340 if (!he->filtered)
341 hists->stats.total_non_filtered_period -= diff;
342 }
343
344 if (!he->leaf) {
345 struct hist_entry *child;
346 struct rb_node *node = rb_first_cached(&he->hroot_out);
347 while (node) {
348 child = rb_entry(node, struct hist_entry, rb_node);
349 node = rb_next(node);
350
351 if (hists__decay_entry(hists, child))
352 hists__delete_entry(hists, child);
353 }
354 }
355
356 return he->stat.period == 0;
357}
358
359static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
360{
361 struct rb_root_cached *root_in;
362 struct rb_root_cached *root_out;
363
364 if (he->parent_he) {
365 root_in = &he->parent_he->hroot_in;
366 root_out = &he->parent_he->hroot_out;
367 } else {
368 if (hists__has(hists, need_collapse))
369 root_in = &hists->entries_collapsed;
370 else
371 root_in = hists->entries_in;
372 root_out = &hists->entries;
373 }
374
375 rb_erase_cached(&he->rb_node_in, root_in);
376 rb_erase_cached(&he->rb_node, root_out);
377
378 --hists->nr_entries;
379 if (!he->filtered)
380 --hists->nr_non_filtered_entries;
381
382 hist_entry__delete(he);
383}
384
385void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
386{
387 struct rb_node *next = rb_first_cached(&hists->entries);
388 struct hist_entry *n;
389
390 while (next) {
391 n = rb_entry(next, struct hist_entry, rb_node);
392 next = rb_next(&n->rb_node);
393 if (((zap_user && n->level == '.') ||
394 (zap_kernel && n->level != '.') ||
395 hists__decay_entry(hists, n))) {
396 hists__delete_entry(hists, n);
397 }
398 }
399}
400
401void hists__delete_entries(struct hists *hists)
402{
403 struct rb_node *next = rb_first_cached(&hists->entries);
404 struct hist_entry *n;
405
406 while (next) {
407 n = rb_entry(next, struct hist_entry, rb_node);
408 next = rb_next(&n->rb_node);
409
410 hists__delete_entry(hists, n);
411 }
412}
413
414struct hist_entry *hists__get_entry(struct hists *hists, int idx)
415{
416 struct rb_node *next = rb_first_cached(&hists->entries);
417 struct hist_entry *n;
418 int i = 0;
419
420 while (next) {
421 n = rb_entry(next, struct hist_entry, rb_node);
422 if (i == idx)
423 return n;
424
425 next = rb_next(&n->rb_node);
426 i++;
427 }
428
429 return NULL;
430}
431
432/*
433 * histogram, sorted on item, collects periods
434 */
435
436static int hist_entry__init(struct hist_entry *he,
437 struct hist_entry *template,
438 bool sample_self,
439 size_t callchain_size)
440{
441 *he = *template;
442 he->callchain_size = callchain_size;
443
444 if (symbol_conf.cumulate_callchain) {
445 he->stat_acc = malloc(sizeof(he->stat));
446 if (he->stat_acc == NULL)
447 return -ENOMEM;
448 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
449 if (!sample_self)
450 memset(&he->stat, 0, sizeof(he->stat));
451 }
452
453 he->ms.maps = maps__get(he->ms.maps);
454 he->ms.map = map__get(he->ms.map);
455
456 if (he->branch_info) {
457 /*
458 * This branch info is (a part of) allocated from
459 * sample__resolve_bstack() and will be freed after
460 * adding new entries. So we need to save a copy.
461 */
462 he->branch_info = malloc(sizeof(*he->branch_info));
463 if (he->branch_info == NULL)
464 goto err;
465
466 memcpy(he->branch_info, template->branch_info,
467 sizeof(*he->branch_info));
468
469 he->branch_info->from.ms.map = map__get(he->branch_info->from.ms.map);
470 he->branch_info->to.ms.map = map__get(he->branch_info->to.ms.map);
471 }
472
473 if (he->mem_info) {
474 he->mem_info->iaddr.ms.map = map__get(he->mem_info->iaddr.ms.map);
475 he->mem_info->daddr.ms.map = map__get(he->mem_info->daddr.ms.map);
476 }
477
478 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)
479 callchain_init(he->callchain);
480
481 if (he->raw_data) {
482 he->raw_data = memdup(he->raw_data, he->raw_size);
483 if (he->raw_data == NULL)
484 goto err_infos;
485 }
486
487 if (he->srcline && he->srcline != SRCLINE_UNKNOWN) {
488 he->srcline = strdup(he->srcline);
489 if (he->srcline == NULL)
490 goto err_rawdata;
491 }
492
493 if (symbol_conf.res_sample) {
494 he->res_samples = calloc(symbol_conf.res_sample,
495 sizeof(struct res_sample));
496 if (!he->res_samples)
497 goto err_srcline;
498 }
499
500 INIT_LIST_HEAD(&he->pairs.node);
501 he->thread = thread__get(he->thread);
502 he->hroot_in = RB_ROOT_CACHED;
503 he->hroot_out = RB_ROOT_CACHED;
504
505 if (!symbol_conf.report_hierarchy)
506 he->leaf = true;
507
508 return 0;
509
510err_srcline:
511 zfree(&he->srcline);
512
513err_rawdata:
514 zfree(&he->raw_data);
515
516err_infos:
517 if (he->branch_info) {
518 map_symbol__exit(&he->branch_info->from.ms);
519 map_symbol__exit(&he->branch_info->to.ms);
520 zfree(&he->branch_info);
521 }
522 if (he->mem_info) {
523 map_symbol__exit(&he->mem_info->iaddr.ms);
524 map_symbol__exit(&he->mem_info->daddr.ms);
525 }
526err:
527 map_symbol__exit(&he->ms);
528 zfree(&he->stat_acc);
529 return -ENOMEM;
530}
531
532static void *hist_entry__zalloc(size_t size)
533{
534 return zalloc(size + sizeof(struct hist_entry));
535}
536
537static void hist_entry__free(void *ptr)
538{
539 free(ptr);
540}
541
542static struct hist_entry_ops default_ops = {
543 .new = hist_entry__zalloc,
544 .free = hist_entry__free,
545};
546
547static struct hist_entry *hist_entry__new(struct hist_entry *template,
548 bool sample_self)
549{
550 struct hist_entry_ops *ops = template->ops;
551 size_t callchain_size = 0;
552 struct hist_entry *he;
553 int err = 0;
554
555 if (!ops)
556 ops = template->ops = &default_ops;
557
558 if (symbol_conf.use_callchain)
559 callchain_size = sizeof(struct callchain_root);
560
561 he = ops->new(callchain_size);
562 if (he) {
563 err = hist_entry__init(he, template, sample_self, callchain_size);
564 if (err) {
565 ops->free(he);
566 he = NULL;
567 }
568 }
569
570 return he;
571}
572
573static u8 symbol__parent_filter(const struct symbol *parent)
574{
575 if (symbol_conf.exclude_other && parent == NULL)
576 return 1 << HIST_FILTER__PARENT;
577 return 0;
578}
579
580static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
581{
582 if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain)
583 return;
584
585 he->hists->callchain_period += period;
586 if (!he->filtered)
587 he->hists->callchain_non_filtered_period += period;
588}
589
590static struct hist_entry *hists__findnew_entry(struct hists *hists,
591 struct hist_entry *entry,
592 const struct addr_location *al,
593 bool sample_self)
594{
595 struct rb_node **p;
596 struct rb_node *parent = NULL;
597 struct hist_entry *he;
598 int64_t cmp;
599 u64 period = entry->stat.period;
600 bool leftmost = true;
601
602 p = &hists->entries_in->rb_root.rb_node;
603
604 while (*p != NULL) {
605 parent = *p;
606 he = rb_entry(parent, struct hist_entry, rb_node_in);
607
608 /*
609 * Make sure that it receives arguments in a same order as
610 * hist_entry__collapse() so that we can use an appropriate
611 * function when searching an entry regardless which sort
612 * keys were used.
613 */
614 cmp = hist_entry__cmp(he, entry);
615 if (!cmp) {
616 if (sample_self) {
617 he_stat__add_period(&he->stat, period);
618 hist_entry__add_callchain_period(he, period);
619 }
620 if (symbol_conf.cumulate_callchain)
621 he_stat__add_period(he->stat_acc, period);
622
623 /*
624 * This mem info was allocated from sample__resolve_mem
625 * and will not be used anymore.
626 */
627 mem_info__zput(entry->mem_info);
628
629 block_info__zput(entry->block_info);
630
631 kvm_info__zput(entry->kvm_info);
632
633 /* If the map of an existing hist_entry has
634 * become out-of-date due to an exec() or
635 * similar, update it. Otherwise we will
636 * mis-adjust symbol addresses when computing
637 * the history counter to increment.
638 */
639 if (he->ms.map != entry->ms.map) {
640 map__put(he->ms.map);
641 he->ms.map = map__get(entry->ms.map);
642 }
643 goto out;
644 }
645
646 if (cmp < 0)
647 p = &(*p)->rb_left;
648 else {
649 p = &(*p)->rb_right;
650 leftmost = false;
651 }
652 }
653
654 he = hist_entry__new(entry, sample_self);
655 if (!he)
656 return NULL;
657
658 if (sample_self)
659 hist_entry__add_callchain_period(he, period);
660 hists->nr_entries++;
661
662 rb_link_node(&he->rb_node_in, parent, p);
663 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost);
664out:
665 if (sample_self)
666 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
667 if (symbol_conf.cumulate_callchain)
668 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
669 return he;
670}
671
672static unsigned random_max(unsigned high)
673{
674 unsigned thresh = -high % high;
675 for (;;) {
676 unsigned r = random();
677 if (r >= thresh)
678 return r % high;
679 }
680}
681
682static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample)
683{
684 struct res_sample *r;
685 int j;
686
687 if (he->num_res < symbol_conf.res_sample) {
688 j = he->num_res++;
689 } else {
690 j = random_max(symbol_conf.res_sample);
691 }
692 r = &he->res_samples[j];
693 r->time = sample->time;
694 r->cpu = sample->cpu;
695 r->tid = sample->tid;
696}
697
698static struct hist_entry*
699__hists__add_entry(struct hists *hists,
700 struct addr_location *al,
701 struct symbol *sym_parent,
702 struct branch_info *bi,
703 struct mem_info *mi,
704 struct kvm_info *ki,
705 struct block_info *block_info,
706 struct perf_sample *sample,
707 bool sample_self,
708 struct hist_entry_ops *ops)
709{
710 struct namespaces *ns = thread__namespaces(al->thread);
711 struct hist_entry entry = {
712 .thread = al->thread,
713 .comm = thread__comm(al->thread),
714 .cgroup_id = {
715 .dev = ns ? ns->link_info[CGROUP_NS_INDEX].dev : 0,
716 .ino = ns ? ns->link_info[CGROUP_NS_INDEX].ino : 0,
717 },
718 .cgroup = sample->cgroup,
719 .ms = {
720 .maps = al->maps,
721 .map = al->map,
722 .sym = al->sym,
723 },
724 .srcline = (char *) al->srcline,
725 .socket = al->socket,
726 .cpu = al->cpu,
727 .cpumode = al->cpumode,
728 .ip = al->addr,
729 .level = al->level,
730 .code_page_size = sample->code_page_size,
731 .stat = {
732 .nr_events = 1,
733 .period = sample->period,
734 },
735 .parent = sym_parent,
736 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
737 .hists = hists,
738 .branch_info = bi,
739 .mem_info = mi,
740 .kvm_info = ki,
741 .block_info = block_info,
742 .transaction = sample->transaction,
743 .raw_data = sample->raw_data,
744 .raw_size = sample->raw_size,
745 .ops = ops,
746 .time = hist_time(sample->time),
747 .weight = sample->weight,
748 .ins_lat = sample->ins_lat,
749 .p_stage_cyc = sample->p_stage_cyc,
750 .simd_flags = sample->simd_flags,
751 }, *he = hists__findnew_entry(hists, &entry, al, sample_self);
752
753 if (!hists->has_callchains && he && he->callchain_size != 0)
754 hists->has_callchains = true;
755 if (he && symbol_conf.res_sample)
756 hists__res_sample(he, sample);
757 return he;
758}
759
760struct hist_entry *hists__add_entry(struct hists *hists,
761 struct addr_location *al,
762 struct symbol *sym_parent,
763 struct branch_info *bi,
764 struct mem_info *mi,
765 struct kvm_info *ki,
766 struct perf_sample *sample,
767 bool sample_self)
768{
769 return __hists__add_entry(hists, al, sym_parent, bi, mi, ki, NULL,
770 sample, sample_self, NULL);
771}
772
773struct hist_entry *hists__add_entry_ops(struct hists *hists,
774 struct hist_entry_ops *ops,
775 struct addr_location *al,
776 struct symbol *sym_parent,
777 struct branch_info *bi,
778 struct mem_info *mi,
779 struct kvm_info *ki,
780 struct perf_sample *sample,
781 bool sample_self)
782{
783 return __hists__add_entry(hists, al, sym_parent, bi, mi, ki, NULL,
784 sample, sample_self, ops);
785}
786
787struct hist_entry *hists__add_entry_block(struct hists *hists,
788 struct addr_location *al,
789 struct block_info *block_info)
790{
791 struct hist_entry entry = {
792 .block_info = block_info,
793 .hists = hists,
794 .ms = {
795 .maps = al->maps,
796 .map = al->map,
797 .sym = al->sym,
798 },
799 }, *he = hists__findnew_entry(hists, &entry, al, false);
800
801 return he;
802}
803
804static int
805iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
806 struct addr_location *al __maybe_unused)
807{
808 return 0;
809}
810
811static int
812iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
813 struct addr_location *al __maybe_unused)
814{
815 return 0;
816}
817
818static int
819iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
820{
821 struct perf_sample *sample = iter->sample;
822 struct mem_info *mi;
823
824 mi = sample__resolve_mem(sample, al);
825 if (mi == NULL)
826 return -ENOMEM;
827
828 iter->priv = mi;
829 return 0;
830}
831
832static int
833iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
834{
835 u64 cost;
836 struct mem_info *mi = iter->priv;
837 struct hists *hists = evsel__hists(iter->evsel);
838 struct perf_sample *sample = iter->sample;
839 struct hist_entry *he;
840
841 if (mi == NULL)
842 return -EINVAL;
843
844 cost = sample->weight;
845 if (!cost)
846 cost = 1;
847
848 /*
849 * must pass period=weight in order to get the correct
850 * sorting from hists__collapse_resort() which is solely
851 * based on periods. We want sorting be done on nr_events * weight
852 * and this is indirectly achieved by passing period=weight here
853 * and the he_stat__add_period() function.
854 */
855 sample->period = cost;
856
857 he = hists__add_entry(hists, al, iter->parent, NULL, mi, NULL,
858 sample, true);
859 if (!he)
860 return -ENOMEM;
861
862 iter->he = he;
863 return 0;
864}
865
866static int
867iter_finish_mem_entry(struct hist_entry_iter *iter,
868 struct addr_location *al __maybe_unused)
869{
870 struct evsel *evsel = iter->evsel;
871 struct hists *hists = evsel__hists(evsel);
872 struct hist_entry *he = iter->he;
873 int err = -EINVAL;
874
875 if (he == NULL)
876 goto out;
877
878 hists__inc_nr_samples(hists, he->filtered);
879
880 err = hist_entry__append_callchain(he, iter->sample);
881
882out:
883 /*
884 * We don't need to free iter->priv (mem_info) here since the mem info
885 * was either already freed in hists__findnew_entry() or passed to a
886 * new hist entry by hist_entry__new().
887 */
888 iter->priv = NULL;
889
890 iter->he = NULL;
891 return err;
892}
893
894static int
895iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
896{
897 struct branch_info *bi;
898 struct perf_sample *sample = iter->sample;
899
900 bi = sample__resolve_bstack(sample, al);
901 if (!bi)
902 return -ENOMEM;
903
904 iter->curr = 0;
905 iter->total = sample->branch_stack->nr;
906
907 iter->priv = bi;
908 return 0;
909}
910
911static int
912iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
913 struct addr_location *al __maybe_unused)
914{
915 return 0;
916}
917
918static int
919iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
920{
921 struct branch_info *bi = iter->priv;
922 int i = iter->curr;
923
924 if (bi == NULL)
925 return 0;
926
927 if (iter->curr >= iter->total)
928 return 0;
929
930 maps__put(al->maps);
931 al->maps = maps__get(bi[i].to.ms.maps);
932 map__put(al->map);
933 al->map = map__get(bi[i].to.ms.map);
934 al->sym = bi[i].to.ms.sym;
935 al->addr = bi[i].to.addr;
936 return 1;
937}
938
939static int
940iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
941{
942 struct branch_info *bi;
943 struct evsel *evsel = iter->evsel;
944 struct hists *hists = evsel__hists(evsel);
945 struct perf_sample *sample = iter->sample;
946 struct hist_entry *he = NULL;
947 int i = iter->curr;
948 int err = 0;
949
950 bi = iter->priv;
951
952 if (iter->hide_unresolved && !(bi[i].from.ms.sym && bi[i].to.ms.sym))
953 goto out;
954
955 /*
956 * The report shows the percentage of total branches captured
957 * and not events sampled. Thus we use a pseudo period of 1.
958 */
959 sample->period = 1;
960 sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;
961
962 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL, NULL,
963 sample, true);
964 if (he == NULL)
965 return -ENOMEM;
966
967 hists__inc_nr_samples(hists, he->filtered);
968
969out:
970 iter->he = he;
971 iter->curr++;
972 return err;
973}
974
975static int
976iter_finish_branch_entry(struct hist_entry_iter *iter,
977 struct addr_location *al __maybe_unused)
978{
979 zfree(&iter->priv);
980 iter->he = NULL;
981
982 return iter->curr >= iter->total ? 0 : -1;
983}
984
985static int
986iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
987 struct addr_location *al __maybe_unused)
988{
989 return 0;
990}
991
992static int
993iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
994{
995 struct evsel *evsel = iter->evsel;
996 struct perf_sample *sample = iter->sample;
997 struct hist_entry *he;
998
999 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
1000 NULL, sample, true);
1001 if (he == NULL)
1002 return -ENOMEM;
1003
1004 iter->he = he;
1005 return 0;
1006}
1007
1008static int
1009iter_finish_normal_entry(struct hist_entry_iter *iter,
1010 struct addr_location *al __maybe_unused)
1011{
1012 struct hist_entry *he = iter->he;
1013 struct evsel *evsel = iter->evsel;
1014 struct perf_sample *sample = iter->sample;
1015
1016 if (he == NULL)
1017 return 0;
1018
1019 iter->he = NULL;
1020
1021 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
1022
1023 return hist_entry__append_callchain(he, sample);
1024}
1025
1026static int
1027iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
1028 struct addr_location *al __maybe_unused)
1029{
1030 struct hist_entry **he_cache;
1031 struct callchain_cursor *cursor = get_tls_callchain_cursor();
1032
1033 if (cursor == NULL)
1034 return -ENOMEM;
1035
1036 callchain_cursor_commit(cursor);
1037
1038 /*
1039 * This is for detecting cycles or recursions so that they're
1040 * cumulated only one time to prevent entries more than 100%
1041 * overhead.
1042 */
1043 he_cache = malloc(sizeof(*he_cache) * (cursor->nr + 1));
1044 if (he_cache == NULL)
1045 return -ENOMEM;
1046
1047 iter->priv = he_cache;
1048 iter->curr = 0;
1049
1050 return 0;
1051}
1052
1053static int
1054iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
1055 struct addr_location *al)
1056{
1057 struct evsel *evsel = iter->evsel;
1058 struct hists *hists = evsel__hists(evsel);
1059 struct perf_sample *sample = iter->sample;
1060 struct hist_entry **he_cache = iter->priv;
1061 struct hist_entry *he;
1062 int err = 0;
1063
1064 he = hists__add_entry(hists, al, iter->parent, NULL, NULL, NULL,
1065 sample, true);
1066 if (he == NULL)
1067 return -ENOMEM;
1068
1069 iter->he = he;
1070 he_cache[iter->curr++] = he;
1071
1072 hist_entry__append_callchain(he, sample);
1073
1074 /*
1075 * We need to re-initialize the cursor since callchain_append()
1076 * advanced the cursor to the end.
1077 */
1078 callchain_cursor_commit(get_tls_callchain_cursor());
1079
1080 hists__inc_nr_samples(hists, he->filtered);
1081
1082 return err;
1083}
1084
1085static int
1086iter_next_cumulative_entry(struct hist_entry_iter *iter,
1087 struct addr_location *al)
1088{
1089 struct callchain_cursor_node *node;
1090
1091 node = callchain_cursor_current(get_tls_callchain_cursor());
1092 if (node == NULL)
1093 return 0;
1094
1095 return fill_callchain_info(al, node, iter->hide_unresolved);
1096}
1097
1098static bool
1099hist_entry__fast__sym_diff(struct hist_entry *left,
1100 struct hist_entry *right)
1101{
1102 struct symbol *sym_l = left->ms.sym;
1103 struct symbol *sym_r = right->ms.sym;
1104
1105 if (!sym_l && !sym_r)
1106 return left->ip != right->ip;
1107
1108 return !!_sort__sym_cmp(sym_l, sym_r);
1109}
1110
1111
1112static int
1113iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
1114 struct addr_location *al)
1115{
1116 struct evsel *evsel = iter->evsel;
1117 struct perf_sample *sample = iter->sample;
1118 struct hist_entry **he_cache = iter->priv;
1119 struct hist_entry *he;
1120 struct hist_entry he_tmp = {
1121 .hists = evsel__hists(evsel),
1122 .cpu = al->cpu,
1123 .thread = al->thread,
1124 .comm = thread__comm(al->thread),
1125 .ip = al->addr,
1126 .ms = {
1127 .maps = al->maps,
1128 .map = al->map,
1129 .sym = al->sym,
1130 },
1131 .srcline = (char *) al->srcline,
1132 .parent = iter->parent,
1133 .raw_data = sample->raw_data,
1134 .raw_size = sample->raw_size,
1135 };
1136 int i;
1137 struct callchain_cursor cursor, *tls_cursor = get_tls_callchain_cursor();
1138 bool fast = hists__has(he_tmp.hists, sym);
1139
1140 if (tls_cursor == NULL)
1141 return -ENOMEM;
1142
1143 callchain_cursor_snapshot(&cursor, tls_cursor);
1144
1145 callchain_cursor_advance(tls_cursor);
1146
1147 /*
1148 * Check if there's duplicate entries in the callchain.
1149 * It's possible that it has cycles or recursive calls.
1150 */
1151 for (i = 0; i < iter->curr; i++) {
1152 /*
1153 * For most cases, there are no duplicate entries in callchain.
1154 * The symbols are usually different. Do a quick check for
1155 * symbols first.
1156 */
1157 if (fast && hist_entry__fast__sym_diff(he_cache[i], &he_tmp))
1158 continue;
1159
1160 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
1161 /* to avoid calling callback function */
1162 iter->he = NULL;
1163 return 0;
1164 }
1165 }
1166
1167 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
1168 NULL, sample, false);
1169 if (he == NULL)
1170 return -ENOMEM;
1171
1172 iter->he = he;
1173 he_cache[iter->curr++] = he;
1174
1175 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)
1176 callchain_append(he->callchain, &cursor, sample->period);
1177 return 0;
1178}
1179
1180static int
1181iter_finish_cumulative_entry(struct hist_entry_iter *iter,
1182 struct addr_location *al __maybe_unused)
1183{
1184 zfree(&iter->priv);
1185 iter->he = NULL;
1186
1187 return 0;
1188}
1189
1190const struct hist_iter_ops hist_iter_mem = {
1191 .prepare_entry = iter_prepare_mem_entry,
1192 .add_single_entry = iter_add_single_mem_entry,
1193 .next_entry = iter_next_nop_entry,
1194 .add_next_entry = iter_add_next_nop_entry,
1195 .finish_entry = iter_finish_mem_entry,
1196};
1197
1198const struct hist_iter_ops hist_iter_branch = {
1199 .prepare_entry = iter_prepare_branch_entry,
1200 .add_single_entry = iter_add_single_branch_entry,
1201 .next_entry = iter_next_branch_entry,
1202 .add_next_entry = iter_add_next_branch_entry,
1203 .finish_entry = iter_finish_branch_entry,
1204};
1205
1206const struct hist_iter_ops hist_iter_normal = {
1207 .prepare_entry = iter_prepare_normal_entry,
1208 .add_single_entry = iter_add_single_normal_entry,
1209 .next_entry = iter_next_nop_entry,
1210 .add_next_entry = iter_add_next_nop_entry,
1211 .finish_entry = iter_finish_normal_entry,
1212};
1213
1214const struct hist_iter_ops hist_iter_cumulative = {
1215 .prepare_entry = iter_prepare_cumulative_entry,
1216 .add_single_entry = iter_add_single_cumulative_entry,
1217 .next_entry = iter_next_cumulative_entry,
1218 .add_next_entry = iter_add_next_cumulative_entry,
1219 .finish_entry = iter_finish_cumulative_entry,
1220};
1221
1222int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
1223 int max_stack_depth, void *arg)
1224{
1225 int err, err2;
1226 struct map *alm = NULL;
1227
1228 if (al)
1229 alm = map__get(al->map);
1230
1231 err = sample__resolve_callchain(iter->sample, get_tls_callchain_cursor(), &iter->parent,
1232 iter->evsel, al, max_stack_depth);
1233 if (err) {
1234 map__put(alm);
1235 return err;
1236 }
1237
1238 err = iter->ops->prepare_entry(iter, al);
1239 if (err)
1240 goto out;
1241
1242 err = iter->ops->add_single_entry(iter, al);
1243 if (err)
1244 goto out;
1245
1246 if (iter->he && iter->add_entry_cb) {
1247 err = iter->add_entry_cb(iter, al, true, arg);
1248 if (err)
1249 goto out;
1250 }
1251
1252 while (iter->ops->next_entry(iter, al)) {
1253 err = iter->ops->add_next_entry(iter, al);
1254 if (err)
1255 break;
1256
1257 if (iter->he && iter->add_entry_cb) {
1258 err = iter->add_entry_cb(iter, al, false, arg);
1259 if (err)
1260 goto out;
1261 }
1262 }
1263
1264out:
1265 err2 = iter->ops->finish_entry(iter, al);
1266 if (!err)
1267 err = err2;
1268
1269 map__put(alm);
1270
1271 return err;
1272}
1273
1274int64_t
1275hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1276{
1277 struct hists *hists = left->hists;
1278 struct perf_hpp_fmt *fmt;
1279 int64_t cmp = 0;
1280
1281 hists__for_each_sort_list(hists, fmt) {
1282 if (perf_hpp__is_dynamic_entry(fmt) &&
1283 !perf_hpp__defined_dynamic_entry(fmt, hists))
1284 continue;
1285
1286 cmp = fmt->cmp(fmt, left, right);
1287 if (cmp)
1288 break;
1289 }
1290
1291 return cmp;
1292}
1293
1294int64_t
1295hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1296{
1297 struct hists *hists = left->hists;
1298 struct perf_hpp_fmt *fmt;
1299 int64_t cmp = 0;
1300
1301 hists__for_each_sort_list(hists, fmt) {
1302 if (perf_hpp__is_dynamic_entry(fmt) &&
1303 !perf_hpp__defined_dynamic_entry(fmt, hists))
1304 continue;
1305
1306 cmp = fmt->collapse(fmt, left, right);
1307 if (cmp)
1308 break;
1309 }
1310
1311 return cmp;
1312}
1313
1314void hist_entry__delete(struct hist_entry *he)
1315{
1316 struct hist_entry_ops *ops = he->ops;
1317
1318 thread__zput(he->thread);
1319 map_symbol__exit(&he->ms);
1320
1321 if (he->branch_info) {
1322 map_symbol__exit(&he->branch_info->from.ms);
1323 map_symbol__exit(&he->branch_info->to.ms);
1324 zfree_srcline(&he->branch_info->srcline_from);
1325 zfree_srcline(&he->branch_info->srcline_to);
1326 zfree(&he->branch_info);
1327 }
1328
1329 if (he->mem_info) {
1330 map_symbol__exit(&he->mem_info->iaddr.ms);
1331 map_symbol__exit(&he->mem_info->daddr.ms);
1332 mem_info__zput(he->mem_info);
1333 }
1334
1335 if (he->block_info)
1336 block_info__zput(he->block_info);
1337
1338 if (he->kvm_info)
1339 kvm_info__zput(he->kvm_info);
1340
1341 zfree(&he->res_samples);
1342 zfree(&he->stat_acc);
1343 zfree_srcline(&he->srcline);
1344 if (he->srcfile && he->srcfile[0])
1345 zfree(&he->srcfile);
1346 free_callchain(he->callchain);
1347 zfree(&he->trace_output);
1348 zfree(&he->raw_data);
1349 ops->free(he);
1350}
1351
1352/*
1353 * If this is not the last column, then we need to pad it according to the
1354 * pre-calculated max length for this column, otherwise don't bother adding
1355 * spaces because that would break viewing this with, for instance, 'less',
1356 * that would show tons of trailing spaces when a long C++ demangled method
1357 * names is sampled.
1358*/
1359int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1360 struct perf_hpp_fmt *fmt, int printed)
1361{
1362 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1363 const int width = fmt->width(fmt, hpp, he->hists);
1364 if (printed < width) {
1365 advance_hpp(hpp, printed);
1366 printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
1367 }
1368 }
1369
1370 return printed;
1371}
1372
1373/*
1374 * collapse the histogram
1375 */
1376
1377static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1378static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1379 enum hist_filter type);
1380
1381typedef bool (*fmt_chk_fn)(struct perf_hpp_fmt *fmt);
1382
1383static bool check_thread_entry(struct perf_hpp_fmt *fmt)
1384{
1385 return perf_hpp__is_thread_entry(fmt) || perf_hpp__is_comm_entry(fmt);
1386}
1387
1388static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1389 enum hist_filter type,
1390 fmt_chk_fn check)
1391{
1392 struct perf_hpp_fmt *fmt;
1393 bool type_match = false;
1394 struct hist_entry *parent = he->parent_he;
1395
1396 switch (type) {
1397 case HIST_FILTER__THREAD:
1398 if (symbol_conf.comm_list == NULL &&
1399 symbol_conf.pid_list == NULL &&
1400 symbol_conf.tid_list == NULL)
1401 return;
1402 break;
1403 case HIST_FILTER__DSO:
1404 if (symbol_conf.dso_list == NULL)
1405 return;
1406 break;
1407 case HIST_FILTER__SYMBOL:
1408 if (symbol_conf.sym_list == NULL)
1409 return;
1410 break;
1411 case HIST_FILTER__PARENT:
1412 case HIST_FILTER__GUEST:
1413 case HIST_FILTER__HOST:
1414 case HIST_FILTER__SOCKET:
1415 case HIST_FILTER__C2C:
1416 default:
1417 return;
1418 }
1419
1420 /* if it's filtered by own fmt, it has to have filter bits */
1421 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1422 if (check(fmt)) {
1423 type_match = true;
1424 break;
1425 }
1426 }
1427
1428 if (type_match) {
1429 /*
1430 * If the filter is for current level entry, propagate
1431 * filter marker to parents. The marker bit was
1432 * already set by default so it only needs to clear
1433 * non-filtered entries.
1434 */
1435 if (!(he->filtered & (1 << type))) {
1436 while (parent) {
1437 parent->filtered &= ~(1 << type);
1438 parent = parent->parent_he;
1439 }
1440 }
1441 } else {
1442 /*
1443 * If current entry doesn't have matching formats, set
1444 * filter marker for upper level entries. it will be
1445 * cleared if its lower level entries is not filtered.
1446 *
1447 * For lower-level entries, it inherits parent's
1448 * filter bit so that lower level entries of a
1449 * non-filtered entry won't set the filter marker.
1450 */
1451 if (parent == NULL)
1452 he->filtered |= (1 << type);
1453 else
1454 he->filtered |= (parent->filtered & (1 << type));
1455 }
1456}
1457
1458static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1459{
1460 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,
1461 check_thread_entry);
1462
1463 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,
1464 perf_hpp__is_dso_entry);
1465
1466 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,
1467 perf_hpp__is_sym_entry);
1468
1469 hists__apply_filters(he->hists, he);
1470}
1471
1472static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1473 struct rb_root_cached *root,
1474 struct hist_entry *he,
1475 struct hist_entry *parent_he,
1476 struct perf_hpp_list *hpp_list)
1477{
1478 struct rb_node **p = &root->rb_root.rb_node;
1479 struct rb_node *parent = NULL;
1480 struct hist_entry *iter, *new;
1481 struct perf_hpp_fmt *fmt;
1482 int64_t cmp;
1483 bool leftmost = true;
1484
1485 while (*p != NULL) {
1486 parent = *p;
1487 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1488
1489 cmp = 0;
1490 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1491 cmp = fmt->collapse(fmt, iter, he);
1492 if (cmp)
1493 break;
1494 }
1495
1496 if (!cmp) {
1497 he_stat__add_stat(&iter->stat, &he->stat);
1498 return iter;
1499 }
1500
1501 if (cmp < 0)
1502 p = &parent->rb_left;
1503 else {
1504 p = &parent->rb_right;
1505 leftmost = false;
1506 }
1507 }
1508
1509 new = hist_entry__new(he, true);
1510 if (new == NULL)
1511 return NULL;
1512
1513 hists->nr_entries++;
1514
1515 /* save related format list for output */
1516 new->hpp_list = hpp_list;
1517 new->parent_he = parent_he;
1518
1519 hist_entry__apply_hierarchy_filters(new);
1520
1521 /* some fields are now passed to 'new' */
1522 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1523 if (perf_hpp__is_trace_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1524 he->trace_output = NULL;
1525 else
1526 new->trace_output = NULL;
1527
1528 if (perf_hpp__is_srcline_entry(fmt))
1529 he->srcline = NULL;
1530 else
1531 new->srcline = NULL;
1532
1533 if (perf_hpp__is_srcfile_entry(fmt))
1534 he->srcfile = NULL;
1535 else
1536 new->srcfile = NULL;
1537 }
1538
1539 rb_link_node(&new->rb_node_in, parent, p);
1540 rb_insert_color_cached(&new->rb_node_in, root, leftmost);
1541 return new;
1542}
1543
1544static int hists__hierarchy_insert_entry(struct hists *hists,
1545 struct rb_root_cached *root,
1546 struct hist_entry *he)
1547{
1548 struct perf_hpp_list_node *node;
1549 struct hist_entry *new_he = NULL;
1550 struct hist_entry *parent = NULL;
1551 int depth = 0;
1552 int ret = 0;
1553
1554 list_for_each_entry(node, &hists->hpp_formats, list) {
1555 /* skip period (overhead) and elided columns */
1556 if (node->level == 0 || node->skip)
1557 continue;
1558
1559 /* insert copy of 'he' for each fmt into the hierarchy */
1560 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1561 if (new_he == NULL) {
1562 ret = -1;
1563 break;
1564 }
1565
1566 root = &new_he->hroot_in;
1567 new_he->depth = depth++;
1568 parent = new_he;
1569 }
1570
1571 if (new_he) {
1572 new_he->leaf = true;
1573
1574 if (hist_entry__has_callchains(new_he) &&
1575 symbol_conf.use_callchain) {
1576 struct callchain_cursor *cursor = get_tls_callchain_cursor();
1577
1578 if (cursor == NULL)
1579 return -1;
1580
1581 callchain_cursor_reset(cursor);
1582 if (callchain_merge(cursor,
1583 new_he->callchain,
1584 he->callchain) < 0)
1585 ret = -1;
1586 }
1587 }
1588
1589 /* 'he' is no longer used */
1590 hist_entry__delete(he);
1591
1592 /* return 0 (or -1) since it already applied filters */
1593 return ret;
1594}
1595
1596static int hists__collapse_insert_entry(struct hists *hists,
1597 struct rb_root_cached *root,
1598 struct hist_entry *he)
1599{
1600 struct rb_node **p = &root->rb_root.rb_node;
1601 struct rb_node *parent = NULL;
1602 struct hist_entry *iter;
1603 int64_t cmp;
1604 bool leftmost = true;
1605
1606 if (symbol_conf.report_hierarchy)
1607 return hists__hierarchy_insert_entry(hists, root, he);
1608
1609 while (*p != NULL) {
1610 parent = *p;
1611 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1612
1613 cmp = hist_entry__collapse(iter, he);
1614
1615 if (!cmp) {
1616 int ret = 0;
1617
1618 he_stat__add_stat(&iter->stat, &he->stat);
1619 if (symbol_conf.cumulate_callchain)
1620 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1621
1622 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) {
1623 struct callchain_cursor *cursor = get_tls_callchain_cursor();
1624
1625 if (cursor != NULL) {
1626 callchain_cursor_reset(cursor);
1627 if (callchain_merge(cursor, iter->callchain, he->callchain) < 0)
1628 ret = -1;
1629 } else {
1630 ret = 0;
1631 }
1632 }
1633 hist_entry__delete(he);
1634 return ret;
1635 }
1636
1637 if (cmp < 0)
1638 p = &(*p)->rb_left;
1639 else {
1640 p = &(*p)->rb_right;
1641 leftmost = false;
1642 }
1643 }
1644 hists->nr_entries++;
1645
1646 rb_link_node(&he->rb_node_in, parent, p);
1647 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
1648 return 1;
1649}
1650
1651struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists)
1652{
1653 struct rb_root_cached *root;
1654
1655 mutex_lock(&hists->lock);
1656
1657 root = hists->entries_in;
1658 if (++hists->entries_in > &hists->entries_in_array[1])
1659 hists->entries_in = &hists->entries_in_array[0];
1660
1661 mutex_unlock(&hists->lock);
1662
1663 return root;
1664}
1665
1666static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1667{
1668 hists__filter_entry_by_dso(hists, he);
1669 hists__filter_entry_by_thread(hists, he);
1670 hists__filter_entry_by_symbol(hists, he);
1671 hists__filter_entry_by_socket(hists, he);
1672}
1673
1674int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1675{
1676 struct rb_root_cached *root;
1677 struct rb_node *next;
1678 struct hist_entry *n;
1679 int ret;
1680
1681 if (!hists__has(hists, need_collapse))
1682 return 0;
1683
1684 hists->nr_entries = 0;
1685
1686 root = hists__get_rotate_entries_in(hists);
1687
1688 next = rb_first_cached(root);
1689
1690 while (next) {
1691 if (session_done())
1692 break;
1693 n = rb_entry(next, struct hist_entry, rb_node_in);
1694 next = rb_next(&n->rb_node_in);
1695
1696 rb_erase_cached(&n->rb_node_in, root);
1697 ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
1698 if (ret < 0)
1699 return -1;
1700
1701 if (ret) {
1702 /*
1703 * If it wasn't combined with one of the entries already
1704 * collapsed, we need to apply the filters that may have
1705 * been set by, say, the hist_browser.
1706 */
1707 hists__apply_filters(hists, n);
1708 }
1709 if (prog)
1710 ui_progress__update(prog, 1);
1711 }
1712 return 0;
1713}
1714
1715static int64_t hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1716{
1717 struct hists *hists = a->hists;
1718 struct perf_hpp_fmt *fmt;
1719 int64_t cmp = 0;
1720
1721 hists__for_each_sort_list(hists, fmt) {
1722 if (perf_hpp__should_skip(fmt, a->hists))
1723 continue;
1724
1725 cmp = fmt->sort(fmt, a, b);
1726 if (cmp)
1727 break;
1728 }
1729
1730 return cmp;
1731}
1732
1733static void hists__reset_filter_stats(struct hists *hists)
1734{
1735 hists->nr_non_filtered_entries = 0;
1736 hists->stats.total_non_filtered_period = 0;
1737}
1738
1739void hists__reset_stats(struct hists *hists)
1740{
1741 hists->nr_entries = 0;
1742 hists->stats.total_period = 0;
1743
1744 hists__reset_filter_stats(hists);
1745}
1746
1747static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1748{
1749 hists->nr_non_filtered_entries++;
1750 hists->stats.total_non_filtered_period += h->stat.period;
1751}
1752
1753void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1754{
1755 if (!h->filtered)
1756 hists__inc_filter_stats(hists, h);
1757
1758 hists->nr_entries++;
1759 hists->stats.total_period += h->stat.period;
1760}
1761
1762static void hierarchy_recalc_total_periods(struct hists *hists)
1763{
1764 struct rb_node *node;
1765 struct hist_entry *he;
1766
1767 node = rb_first_cached(&hists->entries);
1768
1769 hists->stats.total_period = 0;
1770 hists->stats.total_non_filtered_period = 0;
1771
1772 /*
1773 * recalculate total period using top-level entries only
1774 * since lower level entries only see non-filtered entries
1775 * but upper level entries have sum of both entries.
1776 */
1777 while (node) {
1778 he = rb_entry(node, struct hist_entry, rb_node);
1779 node = rb_next(node);
1780
1781 hists->stats.total_period += he->stat.period;
1782 if (!he->filtered)
1783 hists->stats.total_non_filtered_period += he->stat.period;
1784 }
1785}
1786
1787static void hierarchy_insert_output_entry(struct rb_root_cached *root,
1788 struct hist_entry *he)
1789{
1790 struct rb_node **p = &root->rb_root.rb_node;
1791 struct rb_node *parent = NULL;
1792 struct hist_entry *iter;
1793 struct perf_hpp_fmt *fmt;
1794 bool leftmost = true;
1795
1796 while (*p != NULL) {
1797 parent = *p;
1798 iter = rb_entry(parent, struct hist_entry, rb_node);
1799
1800 if (hist_entry__sort(he, iter) > 0)
1801 p = &parent->rb_left;
1802 else {
1803 p = &parent->rb_right;
1804 leftmost = false;
1805 }
1806 }
1807
1808 rb_link_node(&he->rb_node, parent, p);
1809 rb_insert_color_cached(&he->rb_node, root, leftmost);
1810
1811 /* update column width of dynamic entry */
1812 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
1813 if (fmt->init)
1814 fmt->init(fmt, he);
1815 }
1816}
1817
1818static void hists__hierarchy_output_resort(struct hists *hists,
1819 struct ui_progress *prog,
1820 struct rb_root_cached *root_in,
1821 struct rb_root_cached *root_out,
1822 u64 min_callchain_hits,
1823 bool use_callchain)
1824{
1825 struct rb_node *node;
1826 struct hist_entry *he;
1827
1828 *root_out = RB_ROOT_CACHED;
1829 node = rb_first_cached(root_in);
1830
1831 while (node) {
1832 he = rb_entry(node, struct hist_entry, rb_node_in);
1833 node = rb_next(node);
1834
1835 hierarchy_insert_output_entry(root_out, he);
1836
1837 if (prog)
1838 ui_progress__update(prog, 1);
1839
1840 hists->nr_entries++;
1841 if (!he->filtered) {
1842 hists->nr_non_filtered_entries++;
1843 hists__calc_col_len(hists, he);
1844 }
1845
1846 if (!he->leaf) {
1847 hists__hierarchy_output_resort(hists, prog,
1848 &he->hroot_in,
1849 &he->hroot_out,
1850 min_callchain_hits,
1851 use_callchain);
1852 continue;
1853 }
1854
1855 if (!use_callchain)
1856 continue;
1857
1858 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1859 u64 total = he->stat.period;
1860
1861 if (symbol_conf.cumulate_callchain)
1862 total = he->stat_acc->period;
1863
1864 min_callchain_hits = total * (callchain_param.min_percent / 100);
1865 }
1866
1867 callchain_param.sort(&he->sorted_chain, he->callchain,
1868 min_callchain_hits, &callchain_param);
1869 }
1870}
1871
1872static void __hists__insert_output_entry(struct rb_root_cached *entries,
1873 struct hist_entry *he,
1874 u64 min_callchain_hits,
1875 bool use_callchain)
1876{
1877 struct rb_node **p = &entries->rb_root.rb_node;
1878 struct rb_node *parent = NULL;
1879 struct hist_entry *iter;
1880 struct perf_hpp_fmt *fmt;
1881 bool leftmost = true;
1882
1883 if (use_callchain) {
1884 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1885 u64 total = he->stat.period;
1886
1887 if (symbol_conf.cumulate_callchain)
1888 total = he->stat_acc->period;
1889
1890 min_callchain_hits = total * (callchain_param.min_percent / 100);
1891 }
1892 callchain_param.sort(&he->sorted_chain, he->callchain,
1893 min_callchain_hits, &callchain_param);
1894 }
1895
1896 while (*p != NULL) {
1897 parent = *p;
1898 iter = rb_entry(parent, struct hist_entry, rb_node);
1899
1900 if (hist_entry__sort(he, iter) > 0)
1901 p = &(*p)->rb_left;
1902 else {
1903 p = &(*p)->rb_right;
1904 leftmost = false;
1905 }
1906 }
1907
1908 rb_link_node(&he->rb_node, parent, p);
1909 rb_insert_color_cached(&he->rb_node, entries, leftmost);
1910
1911 /* update column width of dynamic entries */
1912 perf_hpp_list__for_each_sort_list(&perf_hpp_list, fmt) {
1913 if (fmt->init)
1914 fmt->init(fmt, he);
1915 }
1916}
1917
1918static void output_resort(struct hists *hists, struct ui_progress *prog,
1919 bool use_callchain, hists__resort_cb_t cb,
1920 void *cb_arg)
1921{
1922 struct rb_root_cached *root;
1923 struct rb_node *next;
1924 struct hist_entry *n;
1925 u64 callchain_total;
1926 u64 min_callchain_hits;
1927
1928 callchain_total = hists->callchain_period;
1929 if (symbol_conf.filter_relative)
1930 callchain_total = hists->callchain_non_filtered_period;
1931
1932 min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1933
1934 hists__reset_stats(hists);
1935 hists__reset_col_len(hists);
1936
1937 if (symbol_conf.report_hierarchy) {
1938 hists__hierarchy_output_resort(hists, prog,
1939 &hists->entries_collapsed,
1940 &hists->entries,
1941 min_callchain_hits,
1942 use_callchain);
1943 hierarchy_recalc_total_periods(hists);
1944 return;
1945 }
1946
1947 if (hists__has(hists, need_collapse))
1948 root = &hists->entries_collapsed;
1949 else
1950 root = hists->entries_in;
1951
1952 next = rb_first_cached(root);
1953 hists->entries = RB_ROOT_CACHED;
1954
1955 while (next) {
1956 n = rb_entry(next, struct hist_entry, rb_node_in);
1957 next = rb_next(&n->rb_node_in);
1958
1959 if (cb && cb(n, cb_arg))
1960 continue;
1961
1962 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1963 hists__inc_stats(hists, n);
1964
1965 if (!n->filtered)
1966 hists__calc_col_len(hists, n);
1967
1968 if (prog)
1969 ui_progress__update(prog, 1);
1970 }
1971}
1972
1973void evsel__output_resort_cb(struct evsel *evsel, struct ui_progress *prog,
1974 hists__resort_cb_t cb, void *cb_arg)
1975{
1976 bool use_callchain;
1977
1978 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1979 use_callchain = evsel__has_callchain(evsel);
1980 else
1981 use_callchain = symbol_conf.use_callchain;
1982
1983 use_callchain |= symbol_conf.show_branchflag_count;
1984
1985 output_resort(evsel__hists(evsel), prog, use_callchain, cb, cb_arg);
1986}
1987
1988void evsel__output_resort(struct evsel *evsel, struct ui_progress *prog)
1989{
1990 return evsel__output_resort_cb(evsel, prog, NULL, NULL);
1991}
1992
1993void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1994{
1995 output_resort(hists, prog, symbol_conf.use_callchain, NULL, NULL);
1996}
1997
1998void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
1999 hists__resort_cb_t cb)
2000{
2001 output_resort(hists, prog, symbol_conf.use_callchain, cb, NULL);
2002}
2003
2004static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
2005{
2006 if (he->leaf || hmd == HMD_FORCE_SIBLING)
2007 return false;
2008
2009 if (he->unfolded || hmd == HMD_FORCE_CHILD)
2010 return true;
2011
2012 return false;
2013}
2014
2015struct rb_node *rb_hierarchy_last(struct rb_node *node)
2016{
2017 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2018
2019 while (can_goto_child(he, HMD_NORMAL)) {
2020 node = rb_last(&he->hroot_out.rb_root);
2021 he = rb_entry(node, struct hist_entry, rb_node);
2022 }
2023 return node;
2024}
2025
2026struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
2027{
2028 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2029
2030 if (can_goto_child(he, hmd))
2031 node = rb_first_cached(&he->hroot_out);
2032 else
2033 node = rb_next(node);
2034
2035 while (node == NULL) {
2036 he = he->parent_he;
2037 if (he == NULL)
2038 break;
2039
2040 node = rb_next(&he->rb_node);
2041 }
2042 return node;
2043}
2044
2045struct rb_node *rb_hierarchy_prev(struct rb_node *node)
2046{
2047 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2048
2049 node = rb_prev(node);
2050 if (node)
2051 return rb_hierarchy_last(node);
2052
2053 he = he->parent_he;
2054 if (he == NULL)
2055 return NULL;
2056
2057 return &he->rb_node;
2058}
2059
2060bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
2061{
2062 struct rb_node *node;
2063 struct hist_entry *child;
2064 float percent;
2065
2066 if (he->leaf)
2067 return false;
2068
2069 node = rb_first_cached(&he->hroot_out);
2070 child = rb_entry(node, struct hist_entry, rb_node);
2071
2072 while (node && child->filtered) {
2073 node = rb_next(node);
2074 child = rb_entry(node, struct hist_entry, rb_node);
2075 }
2076
2077 if (node)
2078 percent = hist_entry__get_percent_limit(child);
2079 else
2080 percent = 0;
2081
2082 return node && percent >= limit;
2083}
2084
2085static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
2086 enum hist_filter filter)
2087{
2088 h->filtered &= ~(1 << filter);
2089
2090 if (symbol_conf.report_hierarchy) {
2091 struct hist_entry *parent = h->parent_he;
2092
2093 while (parent) {
2094 he_stat__add_stat(&parent->stat, &h->stat);
2095
2096 parent->filtered &= ~(1 << filter);
2097
2098 if (parent->filtered)
2099 goto next;
2100
2101 /* force fold unfiltered entry for simplicity */
2102 parent->unfolded = false;
2103 parent->has_no_entry = false;
2104 parent->row_offset = 0;
2105 parent->nr_rows = 0;
2106next:
2107 parent = parent->parent_he;
2108 }
2109 }
2110
2111 if (h->filtered)
2112 return;
2113
2114 /* force fold unfiltered entry for simplicity */
2115 h->unfolded = false;
2116 h->has_no_entry = false;
2117 h->row_offset = 0;
2118 h->nr_rows = 0;
2119
2120 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
2121
2122 hists__inc_filter_stats(hists, h);
2123 hists__calc_col_len(hists, h);
2124}
2125
2126
2127static bool hists__filter_entry_by_dso(struct hists *hists,
2128 struct hist_entry *he)
2129{
2130 if (hists->dso_filter != NULL &&
2131 (he->ms.map == NULL || map__dso(he->ms.map) != hists->dso_filter)) {
2132 he->filtered |= (1 << HIST_FILTER__DSO);
2133 return true;
2134 }
2135
2136 return false;
2137}
2138
2139static bool hists__filter_entry_by_thread(struct hists *hists,
2140 struct hist_entry *he)
2141{
2142 if (hists->thread_filter != NULL &&
2143 !RC_CHK_EQUAL(he->thread, hists->thread_filter)) {
2144 he->filtered |= (1 << HIST_FILTER__THREAD);
2145 return true;
2146 }
2147
2148 return false;
2149}
2150
2151static bool hists__filter_entry_by_symbol(struct hists *hists,
2152 struct hist_entry *he)
2153{
2154 if (hists->symbol_filter_str != NULL &&
2155 (!he->ms.sym || strstr(he->ms.sym->name,
2156 hists->symbol_filter_str) == NULL)) {
2157 he->filtered |= (1 << HIST_FILTER__SYMBOL);
2158 return true;
2159 }
2160
2161 return false;
2162}
2163
2164static bool hists__filter_entry_by_socket(struct hists *hists,
2165 struct hist_entry *he)
2166{
2167 if ((hists->socket_filter > -1) &&
2168 (he->socket != hists->socket_filter)) {
2169 he->filtered |= (1 << HIST_FILTER__SOCKET);
2170 return true;
2171 }
2172
2173 return false;
2174}
2175
2176typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2177
2178static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
2179{
2180 struct rb_node *nd;
2181
2182 hists->stats.nr_non_filtered_samples = 0;
2183
2184 hists__reset_filter_stats(hists);
2185 hists__reset_col_len(hists);
2186
2187 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {
2188 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2189
2190 if (filter(hists, h))
2191 continue;
2192
2193 hists__remove_entry_filter(hists, h, type);
2194 }
2195}
2196
2197static void resort_filtered_entry(struct rb_root_cached *root,
2198 struct hist_entry *he)
2199{
2200 struct rb_node **p = &root->rb_root.rb_node;
2201 struct rb_node *parent = NULL;
2202 struct hist_entry *iter;
2203 struct rb_root_cached new_root = RB_ROOT_CACHED;
2204 struct rb_node *nd;
2205 bool leftmost = true;
2206
2207 while (*p != NULL) {
2208 parent = *p;
2209 iter = rb_entry(parent, struct hist_entry, rb_node);
2210
2211 if (hist_entry__sort(he, iter) > 0)
2212 p = &(*p)->rb_left;
2213 else {
2214 p = &(*p)->rb_right;
2215 leftmost = false;
2216 }
2217 }
2218
2219 rb_link_node(&he->rb_node, parent, p);
2220 rb_insert_color_cached(&he->rb_node, root, leftmost);
2221
2222 if (he->leaf || he->filtered)
2223 return;
2224
2225 nd = rb_first_cached(&he->hroot_out);
2226 while (nd) {
2227 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2228
2229 nd = rb_next(nd);
2230 rb_erase_cached(&h->rb_node, &he->hroot_out);
2231
2232 resort_filtered_entry(&new_root, h);
2233 }
2234
2235 he->hroot_out = new_root;
2236}
2237
2238static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
2239{
2240 struct rb_node *nd;
2241 struct rb_root_cached new_root = RB_ROOT_CACHED;
2242
2243 hists->stats.nr_non_filtered_samples = 0;
2244
2245 hists__reset_filter_stats(hists);
2246 hists__reset_col_len(hists);
2247
2248 nd = rb_first_cached(&hists->entries);
2249 while (nd) {
2250 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2251 int ret;
2252
2253 ret = hist_entry__filter(h, type, arg);
2254
2255 /*
2256 * case 1. non-matching type
2257 * zero out the period, set filter marker and move to child
2258 */
2259 if (ret < 0) {
2260 memset(&h->stat, 0, sizeof(h->stat));
2261 h->filtered |= (1 << type);
2262
2263 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
2264 }
2265 /*
2266 * case 2. matched type (filter out)
2267 * set filter marker and move to next
2268 */
2269 else if (ret == 1) {
2270 h->filtered |= (1 << type);
2271
2272 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2273 }
2274 /*
2275 * case 3. ok (not filtered)
2276 * add period to hists and parents, erase the filter marker
2277 * and move to next sibling
2278 */
2279 else {
2280 hists__remove_entry_filter(hists, h, type);
2281
2282 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2283 }
2284 }
2285
2286 hierarchy_recalc_total_periods(hists);
2287
2288 /*
2289 * resort output after applying a new filter since filter in a lower
2290 * hierarchy can change periods in a upper hierarchy.
2291 */
2292 nd = rb_first_cached(&hists->entries);
2293 while (nd) {
2294 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2295
2296 nd = rb_next(nd);
2297 rb_erase_cached(&h->rb_node, &hists->entries);
2298
2299 resort_filtered_entry(&new_root, h);
2300 }
2301
2302 hists->entries = new_root;
2303}
2304
2305void hists__filter_by_thread(struct hists *hists)
2306{
2307 if (symbol_conf.report_hierarchy)
2308 hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
2309 hists->thread_filter);
2310 else
2311 hists__filter_by_type(hists, HIST_FILTER__THREAD,
2312 hists__filter_entry_by_thread);
2313}
2314
2315void hists__filter_by_dso(struct hists *hists)
2316{
2317 if (symbol_conf.report_hierarchy)
2318 hists__filter_hierarchy(hists, HIST_FILTER__DSO,
2319 hists->dso_filter);
2320 else
2321 hists__filter_by_type(hists, HIST_FILTER__DSO,
2322 hists__filter_entry_by_dso);
2323}
2324
2325void hists__filter_by_symbol(struct hists *hists)
2326{
2327 if (symbol_conf.report_hierarchy)
2328 hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
2329 hists->symbol_filter_str);
2330 else
2331 hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
2332 hists__filter_entry_by_symbol);
2333}
2334
2335void hists__filter_by_socket(struct hists *hists)
2336{
2337 if (symbol_conf.report_hierarchy)
2338 hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
2339 &hists->socket_filter);
2340 else
2341 hists__filter_by_type(hists, HIST_FILTER__SOCKET,
2342 hists__filter_entry_by_socket);
2343}
2344
2345void events_stats__inc(struct events_stats *stats, u32 type)
2346{
2347 ++stats->nr_events[0];
2348 ++stats->nr_events[type];
2349}
2350
2351static void hists_stats__inc(struct hists_stats *stats)
2352{
2353 ++stats->nr_samples;
2354}
2355
2356void hists__inc_nr_events(struct hists *hists)
2357{
2358 hists_stats__inc(&hists->stats);
2359}
2360
2361void hists__inc_nr_samples(struct hists *hists, bool filtered)
2362{
2363 hists_stats__inc(&hists->stats);
2364 if (!filtered)
2365 hists->stats.nr_non_filtered_samples++;
2366}
2367
2368void hists__inc_nr_lost_samples(struct hists *hists, u32 lost)
2369{
2370 hists->stats.nr_lost_samples += lost;
2371}
2372
2373static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2374 struct hist_entry *pair)
2375{
2376 struct rb_root_cached *root;
2377 struct rb_node **p;
2378 struct rb_node *parent = NULL;
2379 struct hist_entry *he;
2380 int64_t cmp;
2381 bool leftmost = true;
2382
2383 if (hists__has(hists, need_collapse))
2384 root = &hists->entries_collapsed;
2385 else
2386 root = hists->entries_in;
2387
2388 p = &root->rb_root.rb_node;
2389
2390 while (*p != NULL) {
2391 parent = *p;
2392 he = rb_entry(parent, struct hist_entry, rb_node_in);
2393
2394 cmp = hist_entry__collapse(he, pair);
2395
2396 if (!cmp)
2397 goto out;
2398
2399 if (cmp < 0)
2400 p = &(*p)->rb_left;
2401 else {
2402 p = &(*p)->rb_right;
2403 leftmost = false;
2404 }
2405 }
2406
2407 he = hist_entry__new(pair, true);
2408 if (he) {
2409 memset(&he->stat, 0, sizeof(he->stat));
2410 he->hists = hists;
2411 if (symbol_conf.cumulate_callchain)
2412 memset(he->stat_acc, 0, sizeof(he->stat));
2413 rb_link_node(&he->rb_node_in, parent, p);
2414 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2415 hists__inc_stats(hists, he);
2416 he->dummy = true;
2417 }
2418out:
2419 return he;
2420}
2421
2422static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2423 struct rb_root_cached *root,
2424 struct hist_entry *pair)
2425{
2426 struct rb_node **p;
2427 struct rb_node *parent = NULL;
2428 struct hist_entry *he;
2429 struct perf_hpp_fmt *fmt;
2430 bool leftmost = true;
2431
2432 p = &root->rb_root.rb_node;
2433 while (*p != NULL) {
2434 int64_t cmp = 0;
2435
2436 parent = *p;
2437 he = rb_entry(parent, struct hist_entry, rb_node_in);
2438
2439 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2440 cmp = fmt->collapse(fmt, he, pair);
2441 if (cmp)
2442 break;
2443 }
2444 if (!cmp)
2445 goto out;
2446
2447 if (cmp < 0)
2448 p = &parent->rb_left;
2449 else {
2450 p = &parent->rb_right;
2451 leftmost = false;
2452 }
2453 }
2454
2455 he = hist_entry__new(pair, true);
2456 if (he) {
2457 rb_link_node(&he->rb_node_in, parent, p);
2458 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2459
2460 he->dummy = true;
2461 he->hists = hists;
2462 memset(&he->stat, 0, sizeof(he->stat));
2463 hists__inc_stats(hists, he);
2464 }
2465out:
2466 return he;
2467}
2468
2469static struct hist_entry *hists__find_entry(struct hists *hists,
2470 struct hist_entry *he)
2471{
2472 struct rb_node *n;
2473
2474 if (hists__has(hists, need_collapse))
2475 n = hists->entries_collapsed.rb_root.rb_node;
2476 else
2477 n = hists->entries_in->rb_root.rb_node;
2478
2479 while (n) {
2480 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2481 int64_t cmp = hist_entry__collapse(iter, he);
2482
2483 if (cmp < 0)
2484 n = n->rb_left;
2485 else if (cmp > 0)
2486 n = n->rb_right;
2487 else
2488 return iter;
2489 }
2490
2491 return NULL;
2492}
2493
2494static struct hist_entry *hists__find_hierarchy_entry(struct rb_root_cached *root,
2495 struct hist_entry *he)
2496{
2497 struct rb_node *n = root->rb_root.rb_node;
2498
2499 while (n) {
2500 struct hist_entry *iter;
2501 struct perf_hpp_fmt *fmt;
2502 int64_t cmp = 0;
2503
2504 iter = rb_entry(n, struct hist_entry, rb_node_in);
2505 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2506 cmp = fmt->collapse(fmt, iter, he);
2507 if (cmp)
2508 break;
2509 }
2510
2511 if (cmp < 0)
2512 n = n->rb_left;
2513 else if (cmp > 0)
2514 n = n->rb_right;
2515 else
2516 return iter;
2517 }
2518
2519 return NULL;
2520}
2521
2522static void hists__match_hierarchy(struct rb_root_cached *leader_root,
2523 struct rb_root_cached *other_root)
2524{
2525 struct rb_node *nd;
2526 struct hist_entry *pos, *pair;
2527
2528 for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {
2529 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2530 pair = hists__find_hierarchy_entry(other_root, pos);
2531
2532 if (pair) {
2533 hist_entry__add_pair(pair, pos);
2534 hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
2535 }
2536 }
2537}
2538
2539/*
2540 * Look for pairs to link to the leader buckets (hist_entries):
2541 */
2542void hists__match(struct hists *leader, struct hists *other)
2543{
2544 struct rb_root_cached *root;
2545 struct rb_node *nd;
2546 struct hist_entry *pos, *pair;
2547
2548 if (symbol_conf.report_hierarchy) {
2549 /* hierarchy report always collapses entries */
2550 return hists__match_hierarchy(&leader->entries_collapsed,
2551 &other->entries_collapsed);
2552 }
2553
2554 if (hists__has(leader, need_collapse))
2555 root = &leader->entries_collapsed;
2556 else
2557 root = leader->entries_in;
2558
2559 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2560 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2561 pair = hists__find_entry(other, pos);
2562
2563 if (pair)
2564 hist_entry__add_pair(pair, pos);
2565 }
2566}
2567
2568static int hists__link_hierarchy(struct hists *leader_hists,
2569 struct hist_entry *parent,
2570 struct rb_root_cached *leader_root,
2571 struct rb_root_cached *other_root)
2572{
2573 struct rb_node *nd;
2574 struct hist_entry *pos, *leader;
2575
2576 for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {
2577 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2578
2579 if (hist_entry__has_pairs(pos)) {
2580 bool found = false;
2581
2582 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2583 if (leader->hists == leader_hists) {
2584 found = true;
2585 break;
2586 }
2587 }
2588 if (!found)
2589 return -1;
2590 } else {
2591 leader = add_dummy_hierarchy_entry(leader_hists,
2592 leader_root, pos);
2593 if (leader == NULL)
2594 return -1;
2595
2596 /* do not point parent in the pos */
2597 leader->parent_he = parent;
2598
2599 hist_entry__add_pair(pos, leader);
2600 }
2601
2602 if (!pos->leaf) {
2603 if (hists__link_hierarchy(leader_hists, leader,
2604 &leader->hroot_in,
2605 &pos->hroot_in) < 0)
2606 return -1;
2607 }
2608 }
2609 return 0;
2610}
2611
2612/*
2613 * Look for entries in the other hists that are not present in the leader, if
2614 * we find them, just add a dummy entry on the leader hists, with period=0,
2615 * nr_events=0, to serve as the list header.
2616 */
2617int hists__link(struct hists *leader, struct hists *other)
2618{
2619 struct rb_root_cached *root;
2620 struct rb_node *nd;
2621 struct hist_entry *pos, *pair;
2622
2623 if (symbol_conf.report_hierarchy) {
2624 /* hierarchy report always collapses entries */
2625 return hists__link_hierarchy(leader, NULL,
2626 &leader->entries_collapsed,
2627 &other->entries_collapsed);
2628 }
2629
2630 if (hists__has(other, need_collapse))
2631 root = &other->entries_collapsed;
2632 else
2633 root = other->entries_in;
2634
2635 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2636 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2637
2638 if (!hist_entry__has_pairs(pos)) {
2639 pair = hists__add_dummy_entry(leader, pos);
2640 if (pair == NULL)
2641 return -1;
2642 hist_entry__add_pair(pos, pair);
2643 }
2644 }
2645
2646 return 0;
2647}
2648
2649int hists__unlink(struct hists *hists)
2650{
2651 struct rb_root_cached *root;
2652 struct rb_node *nd;
2653 struct hist_entry *pos;
2654
2655 if (hists__has(hists, need_collapse))
2656 root = &hists->entries_collapsed;
2657 else
2658 root = hists->entries_in;
2659
2660 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2661 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2662 list_del_init(&pos->pairs.node);
2663 }
2664
2665 return 0;
2666}
2667
2668void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
2669 struct perf_sample *sample, bool nonany_branch_mode,
2670 u64 *total_cycles)
2671{
2672 struct branch_info *bi;
2673 struct branch_entry *entries = perf_sample__branch_entries(sample);
2674
2675 /* If we have branch cycles always annotate them. */
2676 if (bs && bs->nr && entries[0].flags.cycles) {
2677 bi = sample__resolve_bstack(sample, al);
2678 if (bi) {
2679 struct addr_map_symbol *prev = NULL;
2680
2681 /*
2682 * Ignore errors, still want to process the
2683 * other entries.
2684 *
2685 * For non standard branch modes always
2686 * force no IPC (prev == NULL)
2687 *
2688 * Note that perf stores branches reversed from
2689 * program order!
2690 */
2691 for (int i = bs->nr - 1; i >= 0; i--) {
2692 addr_map_symbol__account_cycles(&bi[i].from,
2693 nonany_branch_mode ? NULL : prev,
2694 bi[i].flags.cycles);
2695 prev = &bi[i].to;
2696
2697 if (total_cycles)
2698 *total_cycles += bi[i].flags.cycles;
2699 }
2700 for (unsigned int i = 0; i < bs->nr; i++) {
2701 map_symbol__exit(&bi[i].to.ms);
2702 map_symbol__exit(&bi[i].from.ms);
2703 }
2704 free(bi);
2705 }
2706 }
2707}
2708
2709size_t evlist__fprintf_nr_events(struct evlist *evlist, FILE *fp,
2710 bool skip_empty)
2711{
2712 struct evsel *pos;
2713 size_t ret = 0;
2714
2715 evlist__for_each_entry(evlist, pos) {
2716 struct hists *hists = evsel__hists(pos);
2717
2718 if (skip_empty && !hists->stats.nr_samples && !hists->stats.nr_lost_samples)
2719 continue;
2720
2721 ret += fprintf(fp, "%s stats:\n", evsel__name(pos));
2722 if (hists->stats.nr_samples)
2723 ret += fprintf(fp, "%16s events: %10d\n",
2724 "SAMPLE", hists->stats.nr_samples);
2725 if (hists->stats.nr_lost_samples)
2726 ret += fprintf(fp, "%16s events: %10d\n",
2727 "LOST_SAMPLES", hists->stats.nr_lost_samples);
2728 }
2729
2730 return ret;
2731}
2732
2733
2734u64 hists__total_period(struct hists *hists)
2735{
2736 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
2737 hists->stats.total_period;
2738}
2739
2740int __hists__scnprintf_title(struct hists *hists, char *bf, size_t size, bool show_freq)
2741{
2742 char unit;
2743 int printed;
2744 const struct dso *dso = hists->dso_filter;
2745 struct thread *thread = hists->thread_filter;
2746 int socket_id = hists->socket_filter;
2747 unsigned long nr_samples = hists->stats.nr_samples;
2748 u64 nr_events = hists->stats.total_period;
2749 struct evsel *evsel = hists_to_evsel(hists);
2750 const char *ev_name = evsel__name(evsel);
2751 char buf[512], sample_freq_str[64] = "";
2752 size_t buflen = sizeof(buf);
2753 char ref[30] = " show reference callgraph, ";
2754 bool enable_ref = false;
2755
2756 if (symbol_conf.filter_relative) {
2757 nr_samples = hists->stats.nr_non_filtered_samples;
2758 nr_events = hists->stats.total_non_filtered_period;
2759 }
2760
2761 if (evsel__is_group_event(evsel)) {
2762 struct evsel *pos;
2763
2764 evsel__group_desc(evsel, buf, buflen);
2765 ev_name = buf;
2766
2767 for_each_group_member(pos, evsel) {
2768 struct hists *pos_hists = evsel__hists(pos);
2769
2770 if (symbol_conf.filter_relative) {
2771 nr_samples += pos_hists->stats.nr_non_filtered_samples;
2772 nr_events += pos_hists->stats.total_non_filtered_period;
2773 } else {
2774 nr_samples += pos_hists->stats.nr_samples;
2775 nr_events += pos_hists->stats.total_period;
2776 }
2777 }
2778 }
2779
2780 if (symbol_conf.show_ref_callgraph &&
2781 strstr(ev_name, "call-graph=no"))
2782 enable_ref = true;
2783
2784 if (show_freq)
2785 scnprintf(sample_freq_str, sizeof(sample_freq_str), " %d Hz,", evsel->core.attr.sample_freq);
2786
2787 nr_samples = convert_unit(nr_samples, &unit);
2788 printed = scnprintf(bf, size,
2789 "Samples: %lu%c of event%s '%s',%s%sEvent count (approx.): %" PRIu64,
2790 nr_samples, unit, evsel->core.nr_members > 1 ? "s" : "",
2791 ev_name, sample_freq_str, enable_ref ? ref : " ", nr_events);
2792
2793
2794 if (hists->uid_filter_str)
2795 printed += snprintf(bf + printed, size - printed,
2796 ", UID: %s", hists->uid_filter_str);
2797 if (thread) {
2798 if (hists__has(hists, thread)) {
2799 printed += scnprintf(bf + printed, size - printed,
2800 ", Thread: %s(%d)",
2801 (thread__comm_set(thread) ? thread__comm_str(thread) : ""),
2802 thread__tid(thread));
2803 } else {
2804 printed += scnprintf(bf + printed, size - printed,
2805 ", Thread: %s",
2806 (thread__comm_set(thread) ? thread__comm_str(thread) : ""));
2807 }
2808 }
2809 if (dso)
2810 printed += scnprintf(bf + printed, size - printed,
2811 ", DSO: %s", dso->short_name);
2812 if (socket_id > -1)
2813 printed += scnprintf(bf + printed, size - printed,
2814 ", Processor Socket: %d", socket_id);
2815
2816 return printed;
2817}
2818
2819int parse_filter_percentage(const struct option *opt __maybe_unused,
2820 const char *arg, int unset __maybe_unused)
2821{
2822 if (!strcmp(arg, "relative"))
2823 symbol_conf.filter_relative = true;
2824 else if (!strcmp(arg, "absolute"))
2825 symbol_conf.filter_relative = false;
2826 else {
2827 pr_debug("Invalid percentage: %s\n", arg);
2828 return -1;
2829 }
2830
2831 return 0;
2832}
2833
2834int perf_hist_config(const char *var, const char *value)
2835{
2836 if (!strcmp(var, "hist.percentage"))
2837 return parse_filter_percentage(NULL, value, 0);
2838
2839 return 0;
2840}
2841
2842int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2843{
2844 memset(hists, 0, sizeof(*hists));
2845 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT_CACHED;
2846 hists->entries_in = &hists->entries_in_array[0];
2847 hists->entries_collapsed = RB_ROOT_CACHED;
2848 hists->entries = RB_ROOT_CACHED;
2849 mutex_init(&hists->lock);
2850 hists->socket_filter = -1;
2851 hists->hpp_list = hpp_list;
2852 INIT_LIST_HEAD(&hists->hpp_formats);
2853 return 0;
2854}
2855
2856static void hists__delete_remaining_entries(struct rb_root_cached *root)
2857{
2858 struct rb_node *node;
2859 struct hist_entry *he;
2860
2861 while (!RB_EMPTY_ROOT(&root->rb_root)) {
2862 node = rb_first_cached(root);
2863 rb_erase_cached(node, root);
2864
2865 he = rb_entry(node, struct hist_entry, rb_node_in);
2866 hist_entry__delete(he);
2867 }
2868}
2869
2870static void hists__delete_all_entries(struct hists *hists)
2871{
2872 hists__delete_entries(hists);
2873 hists__delete_remaining_entries(&hists->entries_in_array[0]);
2874 hists__delete_remaining_entries(&hists->entries_in_array[1]);
2875 hists__delete_remaining_entries(&hists->entries_collapsed);
2876}
2877
2878static void hists_evsel__exit(struct evsel *evsel)
2879{
2880 struct hists *hists = evsel__hists(evsel);
2881 struct perf_hpp_fmt *fmt, *pos;
2882 struct perf_hpp_list_node *node, *tmp;
2883
2884 hists__delete_all_entries(hists);
2885
2886 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2887 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2888 list_del_init(&fmt->list);
2889 free(fmt);
2890 }
2891 list_del_init(&node->list);
2892 free(node);
2893 }
2894}
2895
2896static int hists_evsel__init(struct evsel *evsel)
2897{
2898 struct hists *hists = evsel__hists(evsel);
2899
2900 __hists__init(hists, &perf_hpp_list);
2901 return 0;
2902}
2903
2904/*
2905 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2906 * stored in the rbtree...
2907 */
2908
2909int hists__init(void)
2910{
2911 int err = evsel__object_config(sizeof(struct hists_evsel),
2912 hists_evsel__init, hists_evsel__exit);
2913 if (err)
2914 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
2915
2916 return err;
2917}
2918
2919void perf_hpp_list__init(struct perf_hpp_list *list)
2920{
2921 INIT_LIST_HEAD(&list->fields);
2922 INIT_LIST_HEAD(&list->sorts);
2923}