projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
perf hists browser: Show message for percent limit
[deliverable/linux.git] / tools / perf / util / hist.c
1 #include "util.h"
2 #include "build-id.h"
3 #include "hist.h"
4 #include "session.h"
5 #include "sort.h"
6 #include "evlist.h"
7 #include "evsel.h"
8 #include "annotate.h"
9 #include "ui/progress.h"
10 #include <math.h>
11
12 static bool hists__filter_entry_by_dso(struct hists *hists,
13 struct hist_entry *he);
14 static bool hists__filter_entry_by_thread(struct hists *hists,
15 struct hist_entry *he);
16 static bool hists__filter_entry_by_symbol(struct hists *hists,
17 struct hist_entry *he);
18 static bool hists__filter_entry_by_socket(struct hists *hists,
19 struct hist_entry *he);
20
21 u16 hists__col_len(struct hists *hists, enum hist_column col)
22 {
23 return hists->col_len[col];
24 }
25
26 void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
27 {
28 hists->col_len[col] = len;
29 }
30
31 bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
32 {
33 if (len > hists__col_len(hists, col)) {
34 hists__set_col_len(hists, col, len);
35 return true;
36 }
37 return false;
38 }
39
40 void hists__reset_col_len(struct hists *hists)
41 {
42 enum hist_column col;
43
44 for (col = 0; col < HISTC_NR_COLS; ++col)
45 hists__set_col_len(hists, col, 0);
46 }
47
48 static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
49 {
50 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
51
52 if (hists__col_len(hists, dso) < unresolved_col_width &&
53 !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
54 !symbol_conf.dso_list)
55 hists__set_col_len(hists, dso, unresolved_col_width);
56 }
57
58 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
59 {
60 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
61 int symlen;
62 u16 len;
63
64 /*
65 * +4 accounts for '[x] ' priv level info
66 * +2 accounts for 0x prefix on raw addresses
67 * +3 accounts for ' y ' symtab origin info
68 */
69 if (h->ms.sym) {
70 symlen = h->ms.sym->namelen + 4;
71 if (verbose)
72 symlen += BITS_PER_LONG / 4 + 2 + 3;
73 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
74 } else {
75 symlen = unresolved_col_width + 4 + 2;
76 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
77 hists__set_unres_dso_col_len(hists, HISTC_DSO);
78 }
79
80 len = thread__comm_len(h->thread);
81 if (hists__new_col_len(hists, HISTC_COMM, len))
82 hists__set_col_len(hists, HISTC_THREAD, len + 6);
83
84 if (h->ms.map) {
85 len = dso__name_len(h->ms.map->dso);
86 hists__new_col_len(hists, HISTC_DSO, len);
87 }
88
89 if (h->parent)
90 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
91
92 if (h->branch_info) {
93 if (h->branch_info->from.sym) {
94 symlen = (int)h->branch_info->from.sym->namelen + 4;
95 if (verbose)
96 symlen += BITS_PER_LONG / 4 + 2 + 3;
97 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
98
99 symlen = dso__name_len(h->branch_info->from.map->dso);
100 hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
101 } else {
102 symlen = unresolved_col_width + 4 + 2;
103 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
104 hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
105 }
106
107 if (h->branch_info->to.sym) {
108 symlen = (int)h->branch_info->to.sym->namelen + 4;
109 if (verbose)
110 symlen += BITS_PER_LONG / 4 + 2 + 3;
111 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
112
113 symlen = dso__name_len(h->branch_info->to.map->dso);
114 hists__new_col_len(hists, HISTC_DSO_TO, symlen);
115 } else {
116 symlen = unresolved_col_width + 4 + 2;
117 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
118 hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
119 }
120 }
121
122 if (h->mem_info) {
123 if (h->mem_info->daddr.sym) {
124 symlen = (int)h->mem_info->daddr.sym->namelen + 4
125 + unresolved_col_width + 2;
126 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
127 symlen);
128 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
129 symlen + 1);
130 } else {
131 symlen = unresolved_col_width + 4 + 2;
132 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
133 symlen);
134 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
135 symlen);
136 }
137
138 if (h->mem_info->iaddr.sym) {
139 symlen = (int)h->mem_info->iaddr.sym->namelen + 4
140 + unresolved_col_width + 2;
141 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
142 symlen);
143 } else {
144 symlen = unresolved_col_width + 4 + 2;
145 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
146 symlen);
147 }
148
149 if (h->mem_info->daddr.map) {
150 symlen = dso__name_len(h->mem_info->daddr.map->dso);
151 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
152 symlen);
153 } else {
154 symlen = unresolved_col_width + 4 + 2;
155 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
156 }
157 } else {
158 symlen = unresolved_col_width + 4 + 2;
159 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
160 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
161 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
162 }
163
164 hists__new_col_len(hists, HISTC_CPU, 3);
165 hists__new_col_len(hists, HISTC_SOCKET, 6);
166 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
167 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
168 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
169 hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
170 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
171 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
172
173 if (h->srcline)
174 hists__new_col_len(hists, HISTC_SRCLINE, strlen(h->srcline));
175
176 if (h->srcfile)
177 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
178
179 if (h->transaction)
180 hists__new_col_len(hists, HISTC_TRANSACTION,
181 hist_entry__transaction_len());
182
183 if (h->trace_output)
184 hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
185 }
186
187 void hists__output_recalc_col_len(struct hists *hists, int max_rows)
188 {
189 struct rb_node *next = rb_first(&hists->entries);
190 struct hist_entry *n;
191 int row = 0;
192
193 hists__reset_col_len(hists);
194
195 while (next && row++ < max_rows) {
196 n = rb_entry(next, struct hist_entry, rb_node);
197 if (!n->filtered)
198 hists__calc_col_len(hists, n);
199 next = rb_next(&n->rb_node);
200 }
201 }
202
203 static void he_stat__add_cpumode_period(struct he_stat *he_stat,
204 unsigned int cpumode, u64 period)
205 {
206 switch (cpumode) {
207 case PERF_RECORD_MISC_KERNEL:
208 he_stat->period_sys += period;
209 break;
210 case PERF_RECORD_MISC_USER:
211 he_stat->period_us += period;
212 break;
213 case PERF_RECORD_MISC_GUEST_KERNEL:
214 he_stat->period_guest_sys += period;
215 break;
216 case PERF_RECORD_MISC_GUEST_USER:
217 he_stat->period_guest_us += period;
218 break;
219 default:
220 break;
221 }
222 }
223
224 static void he_stat__add_period(struct he_stat *he_stat, u64 period,
225 u64 weight)
226 {
227
228 he_stat->period += period;
229 he_stat->weight += weight;
230 he_stat->nr_events += 1;
231 }
232
233 static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
234 {
235 dest->period += src->period;
236 dest->period_sys += src->period_sys;
237 dest->period_us += src->period_us;
238 dest->period_guest_sys += src->period_guest_sys;
239 dest->period_guest_us += src->period_guest_us;
240 dest->nr_events += src->nr_events;
241 dest->weight += src->weight;
242 }
243
244 static void he_stat__decay(struct he_stat *he_stat)
245 {
246 he_stat->period = (he_stat->period * 7) / 8;
247 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
248 /* XXX need decay for weight too? */
249 }
250
251 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
252
253 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
254 {
255 u64 prev_period = he->stat.period;
256 u64 diff;
257
258 if (prev_period == 0)
259 return true;
260
261 he_stat__decay(&he->stat);
262 if (symbol_conf.cumulate_callchain)
263 he_stat__decay(he->stat_acc);
264 decay_callchain(he->callchain);
265
266 diff = prev_period - he->stat.period;
267
268 if (!he->depth) {
269 hists->stats.total_period -= diff;
270 if (!he->filtered)
271 hists->stats.total_non_filtered_period -= diff;
272 }
273
274 if (!he->leaf) {
275 struct hist_entry *child;
276 struct rb_node *node = rb_first(&he->hroot_out);
277 while (node) {
278 child = rb_entry(node, struct hist_entry, rb_node);
279 node = rb_next(node);
280
281 if (hists__decay_entry(hists, child))
282 hists__delete_entry(hists, child);
283 }
284 }
285
286 return he->stat.period == 0;
287 }
288
289 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
290 {
291 struct rb_root *root_in;
292 struct rb_root *root_out;
293
294 if (he->parent_he) {
295 root_in = &he->parent_he->hroot_in;
296 root_out = &he->parent_he->hroot_out;
297 } else {
298 if (sort__need_collapse)
299 root_in = &hists->entries_collapsed;
300 else
301 root_in = hists->entries_in;
302 root_out = &hists->entries;
303 }
304
305 rb_erase(&he->rb_node_in, root_in);
306 rb_erase(&he->rb_node, root_out);
307
308 --hists->nr_entries;
309 if (!he->filtered)
310 --hists->nr_non_filtered_entries;
311
312 hist_entry__delete(he);
313 }
314
315 void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
316 {
317 struct rb_node *next = rb_first(&hists->entries);
318 struct hist_entry *n;
319
320 while (next) {
321 n = rb_entry(next, struct hist_entry, rb_node);
322 next = rb_next(&n->rb_node);
323 if (((zap_user && n->level == '.') ||
324 (zap_kernel && n->level != '.') ||
325 hists__decay_entry(hists, n))) {
326 hists__delete_entry(hists, n);
327 }
328 }
329 }
330
331 void hists__delete_entries(struct hists *hists)
332 {
333 struct rb_node *next = rb_first(&hists->entries);
334 struct hist_entry *n;
335
336 while (next) {
337 n = rb_entry(next, struct hist_entry, rb_node);
338 next = rb_next(&n->rb_node);
339
340 hists__delete_entry(hists, n);
341 }
342 }
343
344 /*
345 * histogram, sorted on item, collects periods
346 */
347
348 static struct hist_entry *hist_entry__new(struct hist_entry *template,
349 bool sample_self)
350 {
351 size_t callchain_size = 0;
352 struct hist_entry *he;
353
354 if (symbol_conf.use_callchain)
355 callchain_size = sizeof(struct callchain_root);
356
357 he = zalloc(sizeof(*he) + callchain_size);
358
359 if (he != NULL) {
360 *he = *template;
361
362 if (symbol_conf.cumulate_callchain) {
363 he->stat_acc = malloc(sizeof(he->stat));
364 if (he->stat_acc == NULL) {
365 free(he);
366 return NULL;
367 }
368 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
369 if (!sample_self)
370 memset(&he->stat, 0, sizeof(he->stat));
371 }
372
373 map__get(he->ms.map);
374
375 if (he->branch_info) {
376 /*
377 * This branch info is (a part of) allocated from
378 * sample__resolve_bstack() and will be freed after
379 * adding new entries. So we need to save a copy.
380 */
381 he->branch_info = malloc(sizeof(*he->branch_info));
382 if (he->branch_info == NULL) {
383 map__zput(he->ms.map);
384 free(he->stat_acc);
385 free(he);
386 return NULL;
387 }
388
389 memcpy(he->branch_info, template->branch_info,
390 sizeof(*he->branch_info));
391
392 map__get(he->branch_info->from.map);
393 map__get(he->branch_info->to.map);
394 }
395
396 if (he->mem_info) {
397 map__get(he->mem_info->iaddr.map);
398 map__get(he->mem_info->daddr.map);
399 }
400
401 if (symbol_conf.use_callchain)
402 callchain_init(he->callchain);
403
404 if (he->raw_data) {
405 he->raw_data = memdup(he->raw_data, he->raw_size);
406
407 if (he->raw_data == NULL) {
408 map__put(he->ms.map);
409 if (he->branch_info) {
410 map__put(he->branch_info->from.map);
411 map__put(he->branch_info->to.map);
412 free(he->branch_info);
413 }
414 if (he->mem_info) {
415 map__put(he->mem_info->iaddr.map);
416 map__put(he->mem_info->daddr.map);
417 }
418 free(he->stat_acc);
419 free(he);
420 return NULL;
421 }
422 }
423 INIT_LIST_HEAD(&he->pairs.node);
424 thread__get(he->thread);
425
426 if (!symbol_conf.report_hierarchy)
427 he->leaf = true;
428 }
429
430 return he;
431 }
432
433 static u8 symbol__parent_filter(const struct symbol *parent)
434 {
435 if (symbol_conf.exclude_other && parent == NULL)
436 return 1 << HIST_FILTER__PARENT;
437 return 0;
438 }
439
440 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
441 {
442 if (!symbol_conf.use_callchain)
443 return;
444
445 he->hists->callchain_period += period;
446 if (!he->filtered)
447 he->hists->callchain_non_filtered_period += period;
448 }
449
450 static struct hist_entry *hists__findnew_entry(struct hists *hists,
451 struct hist_entry *entry,
452 struct addr_location *al,
453 bool sample_self)
454 {
455 struct rb_node **p;
456 struct rb_node *parent = NULL;
457 struct hist_entry *he;
458 int64_t cmp;
459 u64 period = entry->stat.period;
460 u64 weight = entry->stat.weight;
461
462 p = &hists->entries_in->rb_node;
463
464 while (*p != NULL) {
465 parent = *p;
466 he = rb_entry(parent, struct hist_entry, rb_node_in);
467
468 /*
469 * Make sure that it receives arguments in a same order as
470 * hist_entry__collapse() so that we can use an appropriate
471 * function when searching an entry regardless which sort
472 * keys were used.
473 */
474 cmp = hist_entry__cmp(he, entry);
475
476 if (!cmp) {
477 if (sample_self) {
478 he_stat__add_period(&he->stat, period, weight);
479 hist_entry__add_callchain_period(he, period);
480 }
481 if (symbol_conf.cumulate_callchain)
482 he_stat__add_period(he->stat_acc, period, weight);
483
484 /*
485 * This mem info was allocated from sample__resolve_mem
486 * and will not be used anymore.
487 */
488 zfree(&entry->mem_info);
489
490 /* If the map of an existing hist_entry has
491 * become out-of-date due to an exec() or
492 * similar, update it. Otherwise we will
493 * mis-adjust symbol addresses when computing
494 * the history counter to increment.
495 */
496 if (he->ms.map != entry->ms.map) {
497 map__put(he->ms.map);
498 he->ms.map = map__get(entry->ms.map);
499 }
500 goto out;
501 }
502
503 if (cmp < 0)
504 p = &(*p)->rb_left;
505 else
506 p = &(*p)->rb_right;
507 }
508
509 he = hist_entry__new(entry, sample_self);
510 if (!he)
511 return NULL;
512
513 if (sample_self)
514 hist_entry__add_callchain_period(he, period);
515 hists->nr_entries++;
516
517 rb_link_node(&he->rb_node_in, parent, p);
518 rb_insert_color(&he->rb_node_in, hists->entries_in);
519 out:
520 if (sample_self)
521 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
522 if (symbol_conf.cumulate_callchain)
523 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
524 return he;
525 }
526
527 struct hist_entry *__hists__add_entry(struct hists *hists,
528 struct addr_location *al,
529 struct symbol *sym_parent,
530 struct branch_info *bi,
531 struct mem_info *mi,
532 struct perf_sample *sample,
533 bool sample_self)
534 {
535 struct hist_entry entry = {
536 .thread = al->thread,
537 .comm = thread__comm(al->thread),
538 .ms = {
539 .map = al->map,
540 .sym = al->sym,
541 },
542 .socket = al->socket,
543 .cpu = al->cpu,
544 .cpumode = al->cpumode,
545 .ip = al->addr,
546 .level = al->level,
547 .stat = {
548 .nr_events = 1,
549 .period = sample->period,
550 .weight = sample->weight,
551 },
552 .parent = sym_parent,
553 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
554 .hists = hists,
555 .branch_info = bi,
556 .mem_info = mi,
557 .transaction = sample->transaction,
558 .raw_data = sample->raw_data,
559 .raw_size = sample->raw_size,
560 };
561
562 return hists__findnew_entry(hists, &entry, al, sample_self);
563 }
564
565 static int
566 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
567 struct addr_location *al __maybe_unused)
568 {
569 return 0;
570 }
571
572 static int
573 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
574 struct addr_location *al __maybe_unused)
575 {
576 return 0;
577 }
578
579 static int
580 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
581 {
582 struct perf_sample *sample = iter->sample;
583 struct mem_info *mi;
584
585 mi = sample__resolve_mem(sample, al);
586 if (mi == NULL)
587 return -ENOMEM;
588
589 iter->priv = mi;
590 return 0;
591 }
592
593 static int
594 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
595 {
596 u64 cost;
597 struct mem_info *mi = iter->priv;
598 struct hists *hists = evsel__hists(iter->evsel);
599 struct perf_sample *sample = iter->sample;
600 struct hist_entry *he;
601
602 if (mi == NULL)
603 return -EINVAL;
604
605 cost = sample->weight;
606 if (!cost)
607 cost = 1;
608
609 /*
610 * must pass period=weight in order to get the correct
611 * sorting from hists__collapse_resort() which is solely
612 * based on periods. We want sorting be done on nr_events * weight
613 * and this is indirectly achieved by passing period=weight here
614 * and the he_stat__add_period() function.
615 */
616 sample->period = cost;
617
618 he = __hists__add_entry(hists, al, iter->parent, NULL, mi,
619 sample, true);
620 if (!he)
621 return -ENOMEM;
622
623 iter->he = he;
624 return 0;
625 }
626
627 static int
628 iter_finish_mem_entry(struct hist_entry_iter *iter,
629 struct addr_location *al __maybe_unused)
630 {
631 struct perf_evsel *evsel = iter->evsel;
632 struct hists *hists = evsel__hists(evsel);
633 struct hist_entry *he = iter->he;
634 int err = -EINVAL;
635
636 if (he == NULL)
637 goto out;
638
639 hists__inc_nr_samples(hists, he->filtered);
640
641 err = hist_entry__append_callchain(he, iter->sample);
642
643 out:
644 /*
645 * We don't need to free iter->priv (mem_info) here since the mem info
646 * was either already freed in hists__findnew_entry() or passed to a
647 * new hist entry by hist_entry__new().
648 */
649 iter->priv = NULL;
650
651 iter->he = NULL;
652 return err;
653 }
654
655 static int
656 iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
657 {
658 struct branch_info *bi;
659 struct perf_sample *sample = iter->sample;
660
661 bi = sample__resolve_bstack(sample, al);
662 if (!bi)
663 return -ENOMEM;
664
665 iter->curr = 0;
666 iter->total = sample->branch_stack->nr;
667
668 iter->priv = bi;
669 return 0;
670 }
671
672 static int
673 iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
674 struct addr_location *al __maybe_unused)
675 {
676 /* to avoid calling callback function */
677 iter->he = NULL;
678
679 return 0;
680 }
681
682 static int
683 iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
684 {
685 struct branch_info *bi = iter->priv;
686 int i = iter->curr;
687
688 if (bi == NULL)
689 return 0;
690
691 if (iter->curr >= iter->total)
692 return 0;
693
694 al->map = bi[i].to.map;
695 al->sym = bi[i].to.sym;
696 al->addr = bi[i].to.addr;
697 return 1;
698 }
699
700 static int
701 iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
702 {
703 struct branch_info *bi;
704 struct perf_evsel *evsel = iter->evsel;
705 struct hists *hists = evsel__hists(evsel);
706 struct perf_sample *sample = iter->sample;
707 struct hist_entry *he = NULL;
708 int i = iter->curr;
709 int err = 0;
710
711 bi = iter->priv;
712
713 if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym))
714 goto out;
715
716 /*
717 * The report shows the percentage of total branches captured
718 * and not events sampled. Thus we use a pseudo period of 1.
719 */
720 sample->period = 1;
721 sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;
722
723 he = __hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
724 sample, true);
725 if (he == NULL)
726 return -ENOMEM;
727
728 hists__inc_nr_samples(hists, he->filtered);
729
730 out:
731 iter->he = he;
732 iter->curr++;
733 return err;
734 }
735
736 static int
737 iter_finish_branch_entry(struct hist_entry_iter *iter,
738 struct addr_location *al __maybe_unused)
739 {
740 zfree(&iter->priv);
741 iter->he = NULL;
742
743 return iter->curr >= iter->total ? 0 : -1;
744 }
745
746 static int
747 iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
748 struct addr_location *al __maybe_unused)
749 {
750 return 0;
751 }
752
753 static int
754 iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
755 {
756 struct perf_evsel *evsel = iter->evsel;
757 struct perf_sample *sample = iter->sample;
758 struct hist_entry *he;
759
760 he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
761 sample, true);
762 if (he == NULL)
763 return -ENOMEM;
764
765 iter->he = he;
766 return 0;
767 }
768
769 static int
770 iter_finish_normal_entry(struct hist_entry_iter *iter,
771 struct addr_location *al __maybe_unused)
772 {
773 struct hist_entry *he = iter->he;
774 struct perf_evsel *evsel = iter->evsel;
775 struct perf_sample *sample = iter->sample;
776
777 if (he == NULL)
778 return 0;
779
780 iter->he = NULL;
781
782 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
783
784 return hist_entry__append_callchain(he, sample);
785 }
786
787 static int
788 iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
789 struct addr_location *al __maybe_unused)
790 {
791 struct hist_entry **he_cache;
792
793 callchain_cursor_commit(&callchain_cursor);
794
795 /*
796 * This is for detecting cycles or recursions so that they're
797 * cumulated only one time to prevent entries more than 100%
798 * overhead.
799 */
800 he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1));
801 if (he_cache == NULL)
802 return -ENOMEM;
803
804 iter->priv = he_cache;
805 iter->curr = 0;
806
807 return 0;
808 }
809
810 static int
811 iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
812 struct addr_location *al)
813 {
814 struct perf_evsel *evsel = iter->evsel;
815 struct hists *hists = evsel__hists(evsel);
816 struct perf_sample *sample = iter->sample;
817 struct hist_entry **he_cache = iter->priv;
818 struct hist_entry *he;
819 int err = 0;
820
821 he = __hists__add_entry(hists, al, iter->parent, NULL, NULL,
822 sample, true);
823 if (he == NULL)
824 return -ENOMEM;
825
826 iter->he = he;
827 he_cache[iter->curr++] = he;
828
829 hist_entry__append_callchain(he, sample);
830
831 /*
832 * We need to re-initialize the cursor since callchain_append()
833 * advanced the cursor to the end.
834 */
835 callchain_cursor_commit(&callchain_cursor);
836
837 hists__inc_nr_samples(hists, he->filtered);
838
839 return err;
840 }
841
842 static int
843 iter_next_cumulative_entry(struct hist_entry_iter *iter,
844 struct addr_location *al)
845 {
846 struct callchain_cursor_node *node;
847
848 node = callchain_cursor_current(&callchain_cursor);
849 if (node == NULL)
850 return 0;
851
852 return fill_callchain_info(al, node, iter->hide_unresolved);
853 }
854
855 static int
856 iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
857 struct addr_location *al)
858 {
859 struct perf_evsel *evsel = iter->evsel;
860 struct perf_sample *sample = iter->sample;
861 struct hist_entry **he_cache = iter->priv;
862 struct hist_entry *he;
863 struct hist_entry he_tmp = {
864 .hists = evsel__hists(evsel),
865 .cpu = al->cpu,
866 .thread = al->thread,
867 .comm = thread__comm(al->thread),
868 .ip = al->addr,
869 .ms = {
870 .map = al->map,
871 .sym = al->sym,
872 },
873 .parent = iter->parent,
874 .raw_data = sample->raw_data,
875 .raw_size = sample->raw_size,
876 };
877 int i;
878 struct callchain_cursor cursor;
879
880 callchain_cursor_snapshot(&cursor, &callchain_cursor);
881
882 callchain_cursor_advance(&callchain_cursor);
883
884 /*
885 * Check if there's duplicate entries in the callchain.
886 * It's possible that it has cycles or recursive calls.
887 */
888 for (i = 0; i < iter->curr; i++) {
889 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
890 /* to avoid calling callback function */
891 iter->he = NULL;
892 return 0;
893 }
894 }
895
896 he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
897 sample, false);
898 if (he == NULL)
899 return -ENOMEM;
900
901 iter->he = he;
902 he_cache[iter->curr++] = he;
903
904 if (symbol_conf.use_callchain)
905 callchain_append(he->callchain, &cursor, sample->period);
906 return 0;
907 }
908
909 static int
910 iter_finish_cumulative_entry(struct hist_entry_iter *iter,
911 struct addr_location *al __maybe_unused)
912 {
913 zfree(&iter->priv);
914 iter->he = NULL;
915
916 return 0;
917 }
918
919 const struct hist_iter_ops hist_iter_mem = {
920 .prepare_entry = iter_prepare_mem_entry,
921 .add_single_entry = iter_add_single_mem_entry,
922 .next_entry = iter_next_nop_entry,
923 .add_next_entry = iter_add_next_nop_entry,
924 .finish_entry = iter_finish_mem_entry,
925 };
926
927 const struct hist_iter_ops hist_iter_branch = {
928 .prepare_entry = iter_prepare_branch_entry,
929 .add_single_entry = iter_add_single_branch_entry,
930 .next_entry = iter_next_branch_entry,
931 .add_next_entry = iter_add_next_branch_entry,
932 .finish_entry = iter_finish_branch_entry,
933 };
934
935 const struct hist_iter_ops hist_iter_normal = {
936 .prepare_entry = iter_prepare_normal_entry,
937 .add_single_entry = iter_add_single_normal_entry,
938 .next_entry = iter_next_nop_entry,
939 .add_next_entry = iter_add_next_nop_entry,
940 .finish_entry = iter_finish_normal_entry,
941 };
942
943 const struct hist_iter_ops hist_iter_cumulative = {
944 .prepare_entry = iter_prepare_cumulative_entry,
945 .add_single_entry = iter_add_single_cumulative_entry,
946 .next_entry = iter_next_cumulative_entry,
947 .add_next_entry = iter_add_next_cumulative_entry,
948 .finish_entry = iter_finish_cumulative_entry,
949 };
950
951 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
952 int max_stack_depth, void *arg)
953 {
954 int err, err2;
955
956 err = sample__resolve_callchain(iter->sample, &iter->parent,
957 iter->evsel, al, max_stack_depth);
958 if (err)
959 return err;
960
961 iter->max_stack = max_stack_depth;
962
963 err = iter->ops->prepare_entry(iter, al);
964 if (err)
965 goto out;
966
967 err = iter->ops->add_single_entry(iter, al);
968 if (err)
969 goto out;
970
971 if (iter->he && iter->add_entry_cb) {
972 err = iter->add_entry_cb(iter, al, true, arg);
973 if (err)
974 goto out;
975 }
976
977 while (iter->ops->next_entry(iter, al)) {
978 err = iter->ops->add_next_entry(iter, al);
979 if (err)
980 break;
981
982 if (iter->he && iter->add_entry_cb) {
983 err = iter->add_entry_cb(iter, al, false, arg);
984 if (err)
985 goto out;
986 }
987 }
988
989 out:
990 err2 = iter->ops->finish_entry(iter, al);
991 if (!err)
992 err = err2;
993
994 return err;
995 }
996
997 int64_t
998 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
999 {
1000 struct hists *hists = left->hists;
1001 struct perf_hpp_fmt *fmt;
1002 int64_t cmp = 0;
1003
1004 hists__for_each_sort_list(hists, fmt) {
1005 cmp = fmt->cmp(fmt, left, right);
1006 if (cmp)
1007 break;
1008 }
1009
1010 return cmp;
1011 }
1012
1013 int64_t
1014 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1015 {
1016 struct hists *hists = left->hists;
1017 struct perf_hpp_fmt *fmt;
1018 int64_t cmp = 0;
1019
1020 hists__for_each_sort_list(hists, fmt) {
1021 cmp = fmt->collapse(fmt, left, right);
1022 if (cmp)
1023 break;
1024 }
1025
1026 return cmp;
1027 }
1028
1029 void hist_entry__delete(struct hist_entry *he)
1030 {
1031 thread__zput(he->thread);
1032 map__zput(he->ms.map);
1033
1034 if (he->branch_info) {
1035 map__zput(he->branch_info->from.map);
1036 map__zput(he->branch_info->to.map);
1037 zfree(&he->branch_info);
1038 }
1039
1040 if (he->mem_info) {
1041 map__zput(he->mem_info->iaddr.map);
1042 map__zput(he->mem_info->daddr.map);
1043 zfree(&he->mem_info);
1044 }
1045
1046 zfree(&he->stat_acc);
1047 free_srcline(he->srcline);
1048 if (he->srcfile && he->srcfile[0])
1049 free(he->srcfile);
1050 free_callchain(he->callchain);
1051 free(he->trace_output);
1052 free(he->raw_data);
1053 free(he);
1054 }
1055
1056 /*
1057 * If this is not the last column, then we need to pad it according to the
1058 * pre-calculated max lenght for this column, otherwise don't bother adding
1059 * spaces because that would break viewing this with, for instance, 'less',
1060 * that would show tons of trailing spaces when a long C++ demangled method
1061 * names is sampled.
1062 */
1063 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1064 struct perf_hpp_fmt *fmt, int printed)
1065 {
1066 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1067 const int width = fmt->width(fmt, hpp, hists_to_evsel(he->hists));
1068 if (printed < width) {
1069 advance_hpp(hpp, printed);
1070 printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
1071 }
1072 }
1073
1074 return printed;
1075 }
1076
1077 /*
1078 * collapse the histogram
1079 */
1080
1081 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1082
1083 static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1084 struct rb_root *root,
1085 struct hist_entry *he,
1086 struct perf_hpp_fmt *fmt)
1087 {
1088 struct rb_node **p = &root->rb_node;
1089 struct rb_node *parent = NULL;
1090 struct hist_entry *iter, *new;
1091 int64_t cmp;
1092
1093 while (*p != NULL) {
1094 parent = *p;
1095 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1096
1097 cmp = fmt->collapse(fmt, iter, he);
1098 if (!cmp) {
1099 he_stat__add_stat(&iter->stat, &he->stat);
1100 return iter;
1101 }
1102
1103 if (cmp < 0)
1104 p = &parent->rb_left;
1105 else
1106 p = &parent->rb_right;
1107 }
1108
1109 new = hist_entry__new(he, true);
1110 if (new == NULL)
1111 return NULL;
1112
1113 hists__apply_filters(hists, new);
1114 hists->nr_entries++;
1115
1116 /* save related format for output */
1117 new->fmt = fmt;
1118
1119 /* some fields are now passed to 'new' */
1120 if (perf_hpp__is_trace_entry(fmt))
1121 he->trace_output = NULL;
1122 else
1123 new->trace_output = NULL;
1124
1125 if (perf_hpp__is_srcline_entry(fmt))
1126 he->srcline = NULL;
1127 else
1128 new->srcline = NULL;
1129
1130 if (perf_hpp__is_srcfile_entry(fmt))
1131 he->srcfile = NULL;
1132 else
1133 new->srcfile = NULL;
1134
1135 rb_link_node(&new->rb_node_in, parent, p);
1136 rb_insert_color(&new->rb_node_in, root);
1137 return new;
1138 }
1139
1140 static int hists__hierarchy_insert_entry(struct hists *hists,
1141 struct rb_root *root,
1142 struct hist_entry *he)
1143 {
1144 struct perf_hpp_fmt *fmt;
1145 struct hist_entry *new_he = NULL;
1146 struct hist_entry *parent = NULL;
1147 int depth = 0;
1148 int ret = 0;
1149
1150 hists__for_each_sort_list(hists, fmt) {
1151 if (!perf_hpp__is_sort_entry(fmt) &&
1152 !perf_hpp__is_dynamic_entry(fmt))
1153 continue;
1154 if (perf_hpp__should_skip(fmt, hists))
1155 continue;
1156
1157 /* insert copy of 'he' for each fmt into the hierarchy */
1158 new_he = hierarchy_insert_entry(hists, root, he, fmt);
1159 if (new_he == NULL) {
1160 ret = -1;
1161 break;
1162 }
1163
1164 root = &new_he->hroot_in;
1165 new_he->parent_he = parent;
1166 new_he->depth = depth++;
1167 parent = new_he;
1168 }
1169
1170 if (new_he) {
1171 new_he->leaf = true;
1172
1173 if (symbol_conf.use_callchain) {
1174 callchain_cursor_reset(&callchain_cursor);
1175 if (callchain_merge(&callchain_cursor,
1176 new_he->callchain,
1177 he->callchain) < 0)
1178 ret = -1;
1179 }
1180 }
1181
1182 /* 'he' is no longer used */
1183 hist_entry__delete(he);
1184
1185 /* return 0 (or -1) since it already applied filters */
1186 return ret;
1187 }
1188
1189 int hists__collapse_insert_entry(struct hists *hists, struct rb_root *root,
1190 struct hist_entry *he)
1191 {
1192 struct rb_node **p = &root->rb_node;
1193 struct rb_node *parent = NULL;
1194 struct hist_entry *iter;
1195 int64_t cmp;
1196
1197 if (symbol_conf.report_hierarchy)
1198 return hists__hierarchy_insert_entry(hists, root, he);
1199
1200 while (*p != NULL) {
1201 parent = *p;
1202 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1203
1204 cmp = hist_entry__collapse(iter, he);
1205
1206 if (!cmp) {
1207 int ret = 0;
1208
1209 he_stat__add_stat(&iter->stat, &he->stat);
1210 if (symbol_conf.cumulate_callchain)
1211 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1212
1213 if (symbol_conf.use_callchain) {
1214 callchain_cursor_reset(&callchain_cursor);
1215 if (callchain_merge(&callchain_cursor,
1216 iter->callchain,
1217 he->callchain) < 0)
1218 ret = -1;
1219 }
1220 hist_entry__delete(he);
1221 return ret;
1222 }
1223
1224 if (cmp < 0)
1225 p = &(*p)->rb_left;
1226 else
1227 p = &(*p)->rb_right;
1228 }
1229 hists->nr_entries++;
1230
1231 rb_link_node(&he->rb_node_in, parent, p);
1232 rb_insert_color(&he->rb_node_in, root);
1233 return 1;
1234 }
1235
1236 struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1237 {
1238 struct rb_root *root;
1239
1240 pthread_mutex_lock(&hists->lock);
1241
1242 root = hists->entries_in;
1243 if (++hists->entries_in > &hists->entries_in_array[1])
1244 hists->entries_in = &hists->entries_in_array[0];
1245
1246 pthread_mutex_unlock(&hists->lock);
1247
1248 return root;
1249 }
1250
1251 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1252 {
1253 hists__filter_entry_by_dso(hists, he);
1254 hists__filter_entry_by_thread(hists, he);
1255 hists__filter_entry_by_symbol(hists, he);
1256 hists__filter_entry_by_socket(hists, he);
1257 }
1258
1259 int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1260 {
1261 struct rb_root *root;
1262 struct rb_node *next;
1263 struct hist_entry *n;
1264 int ret;
1265
1266 if (!sort__need_collapse)
1267 return 0;
1268
1269 hists->nr_entries = 0;
1270
1271 root = hists__get_rotate_entries_in(hists);
1272
1273 next = rb_first(root);
1274
1275 while (next) {
1276 if (session_done())
1277 break;
1278 n = rb_entry(next, struct hist_entry, rb_node_in);
1279 next = rb_next(&n->rb_node_in);
1280
1281 rb_erase(&n->rb_node_in, root);
1282 ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
1283 if (ret < 0)
1284 return -1;
1285
1286 if (ret) {
1287 /*
1288 * If it wasn't combined with one of the entries already
1289 * collapsed, we need to apply the filters that may have
1290 * been set by, say, the hist_browser.
1291 */
1292 hists__apply_filters(hists, n);
1293 }
1294 if (prog)
1295 ui_progress__update(prog, 1);
1296 }
1297 return 0;
1298 }
1299
1300 static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1301 {
1302 struct hists *hists = a->hists;
1303 struct perf_hpp_fmt *fmt;
1304 int64_t cmp = 0;
1305
1306 hists__for_each_sort_list(hists, fmt) {
1307 if (perf_hpp__should_skip(fmt, a->hists))
1308 continue;
1309
1310 cmp = fmt->sort(fmt, a, b);
1311 if (cmp)
1312 break;
1313 }
1314
1315 return cmp;
1316 }
1317
1318 static void hists__reset_filter_stats(struct hists *hists)
1319 {
1320 hists->nr_non_filtered_entries = 0;
1321 hists->stats.total_non_filtered_period = 0;
1322 }
1323
1324 void hists__reset_stats(struct hists *hists)
1325 {
1326 hists->nr_entries = 0;
1327 hists->stats.total_period = 0;
1328
1329 hists__reset_filter_stats(hists);
1330 }
1331
1332 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1333 {
1334 hists->nr_non_filtered_entries++;
1335 hists->stats.total_non_filtered_period += h->stat.period;
1336 }
1337
1338 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1339 {
1340 if (!h->filtered)
1341 hists__inc_filter_stats(hists, h);
1342
1343 hists->nr_entries++;
1344 hists->stats.total_period += h->stat.period;
1345 }
1346
1347 static void hierarchy_insert_output_entry(struct rb_root *root,
1348 struct hist_entry *he)
1349 {
1350 struct rb_node **p = &root->rb_node;
1351 struct rb_node *parent = NULL;
1352 struct hist_entry *iter;
1353
1354 while (*p != NULL) {
1355 parent = *p;
1356 iter = rb_entry(parent, struct hist_entry, rb_node);
1357
1358 if (hist_entry__sort(he, iter) > 0)
1359 p = &parent->rb_left;
1360 else
1361 p = &parent->rb_right;
1362 }
1363
1364 rb_link_node(&he->rb_node, parent, p);
1365 rb_insert_color(&he->rb_node, root);
1366 }
1367
1368 static void hists__hierarchy_output_resort(struct hists *hists,
1369 struct ui_progress *prog,
1370 struct rb_root *root_in,
1371 struct rb_root *root_out,
1372 u64 min_callchain_hits,
1373 bool use_callchain)
1374 {
1375 struct rb_node *node;
1376 struct hist_entry *he;
1377
1378 *root_out = RB_ROOT;
1379 node = rb_first(root_in);
1380
1381 while (node) {
1382 he = rb_entry(node, struct hist_entry, rb_node_in);
1383 node = rb_next(node);
1384
1385 hierarchy_insert_output_entry(root_out, he);
1386
1387 if (prog)
1388 ui_progress__update(prog, 1);
1389
1390 if (!he->leaf) {
1391 hists__hierarchy_output_resort(hists, prog,
1392 &he->hroot_in,
1393 &he->hroot_out,
1394 min_callchain_hits,
1395 use_callchain);
1396 hists->nr_entries++;
1397 if (!he->filtered) {
1398 hists->nr_non_filtered_entries++;
1399 hists__calc_col_len(hists, he);
1400 }
1401
1402 continue;
1403 }
1404
1405 /* only update stat for leaf entries to avoid duplication */
1406 hists__inc_stats(hists, he);
1407 if (!he->filtered)
1408 hists__calc_col_len(hists, he);
1409
1410 if (!use_callchain)
1411 continue;
1412
1413 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1414 u64 total = he->stat.period;
1415
1416 if (symbol_conf.cumulate_callchain)
1417 total = he->stat_acc->period;
1418
1419 min_callchain_hits = total * (callchain_param.min_percent / 100);
1420 }
1421
1422 callchain_param.sort(&he->sorted_chain, he->callchain,
1423 min_callchain_hits, &callchain_param);
1424 }
1425 }
1426
1427 static void __hists__insert_output_entry(struct rb_root *entries,
1428 struct hist_entry *he,
1429 u64 min_callchain_hits,
1430 bool use_callchain)
1431 {
1432 struct rb_node **p = &entries->rb_node;
1433 struct rb_node *parent = NULL;
1434 struct hist_entry *iter;
1435
1436 if (use_callchain) {
1437 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1438 u64 total = he->stat.period;
1439
1440 if (symbol_conf.cumulate_callchain)
1441 total = he->stat_acc->period;
1442
1443 min_callchain_hits = total * (callchain_param.min_percent / 100);
1444 }
1445 callchain_param.sort(&he->sorted_chain, he->callchain,
1446 min_callchain_hits, &callchain_param);
1447 }
1448
1449 while (*p != NULL) {
1450 parent = *p;
1451 iter = rb_entry(parent, struct hist_entry, rb_node);
1452
1453 if (hist_entry__sort(he, iter) > 0)
1454 p = &(*p)->rb_left;
1455 else
1456 p = &(*p)->rb_right;
1457 }
1458
1459 rb_link_node(&he->rb_node, parent, p);
1460 rb_insert_color(&he->rb_node, entries);
1461 }
1462
1463 static void output_resort(struct hists *hists, struct ui_progress *prog,
1464 bool use_callchain)
1465 {
1466 struct rb_root *root;
1467 struct rb_node *next;
1468 struct hist_entry *n;
1469 u64 callchain_total;
1470 u64 min_callchain_hits;
1471
1472 callchain_total = hists->callchain_period;
1473 if (symbol_conf.filter_relative)
1474 callchain_total = hists->callchain_non_filtered_period;
1475
1476 min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1477
1478 hists__reset_stats(hists);
1479 hists__reset_col_len(hists);
1480
1481 if (symbol_conf.report_hierarchy) {
1482 return hists__hierarchy_output_resort(hists, prog,
1483 &hists->entries_collapsed,
1484 &hists->entries,
1485 min_callchain_hits,
1486 use_callchain);
1487 }
1488
1489 if (sort__need_collapse)
1490 root = &hists->entries_collapsed;
1491 else
1492 root = hists->entries_in;
1493
1494 next = rb_first(root);
1495 hists->entries = RB_ROOT;
1496
1497 while (next) {
1498 n = rb_entry(next, struct hist_entry, rb_node_in);
1499 next = rb_next(&n->rb_node_in);
1500
1501 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1502 hists__inc_stats(hists, n);
1503
1504 if (!n->filtered)
1505 hists__calc_col_len(hists, n);
1506
1507 if (prog)
1508 ui_progress__update(prog, 1);
1509 }
1510 }
1511
1512 void perf_evsel__output_resort(struct perf_evsel *evsel, struct ui_progress *prog)
1513 {
1514 bool use_callchain;
1515
1516 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1517 use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN;
1518 else
1519 use_callchain = symbol_conf.use_callchain;
1520
1521 output_resort(evsel__hists(evsel), prog, use_callchain);
1522 }
1523
1524 void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1525 {
1526 output_resort(hists, prog, symbol_conf.use_callchain);
1527 }
1528
1529 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
1530 {
1531 if (he->leaf || hmd == HMD_FORCE_SIBLING)
1532 return false;
1533
1534 if (he->unfolded || hmd == HMD_FORCE_CHILD)
1535 return true;
1536
1537 return false;
1538 }
1539
1540 struct rb_node *rb_hierarchy_last(struct rb_node *node)
1541 {
1542 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1543
1544 while (can_goto_child(he, HMD_NORMAL)) {
1545 node = rb_last(&he->hroot_out);
1546 he = rb_entry(node, struct hist_entry, rb_node);
1547 }
1548 return node;
1549 }
1550
1551 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
1552 {
1553 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1554
1555 if (can_goto_child(he, hmd))
1556 node = rb_first(&he->hroot_out);
1557 else
1558 node = rb_next(node);
1559
1560 while (node == NULL) {
1561 he = he->parent_he;
1562 if (he == NULL)
1563 break;
1564
1565 node = rb_next(&he->rb_node);
1566 }
1567 return node;
1568 }
1569
1570 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
1571 {
1572 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1573
1574 node = rb_prev(node);
1575 if (node)
1576 return rb_hierarchy_last(node);
1577
1578 he = he->parent_he;
1579 if (he == NULL)
1580 return NULL;
1581
1582 return &he->rb_node;
1583 }
1584
1585 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
1586 {
1587 struct rb_node *node;
1588 struct hist_entry *child;
1589 float percent;
1590
1591 if (he->leaf)
1592 return false;
1593
1594 node = rb_first(&he->hroot_out);
1595 child = rb_entry(node, struct hist_entry, rb_node);
1596
1597 while (node && child->filtered) {
1598 node = rb_next(node);
1599 child = rb_entry(node, struct hist_entry, rb_node);
1600 }
1601
1602 if (node)
1603 percent = hist_entry__get_percent_limit(child);
1604 else
1605 percent = 0;
1606
1607 return node && percent >= limit;
1608 }
1609
1610 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1611 enum hist_filter filter)
1612 {
1613 h->filtered &= ~(1 << filter);
1614
1615 if (symbol_conf.report_hierarchy) {
1616 struct hist_entry *parent = h->parent_he;
1617
1618 while (parent) {
1619 he_stat__add_stat(&parent->stat, &h->stat);
1620
1621 parent->filtered &= ~(1 << filter);
1622
1623 if (parent->filtered)
1624 goto next;
1625
1626 /* force fold unfiltered entry for simplicity */
1627 parent->unfolded = false;
1628 parent->has_no_entry = false;
1629 parent->row_offset = 0;
1630 parent->nr_rows = 0;
1631 next:
1632 parent = parent->parent_he;
1633 }
1634 }
1635
1636 if (h->filtered)
1637 return;
1638
1639 /* force fold unfiltered entry for simplicity */
1640 h->unfolded = false;
1641 h->has_no_entry = false;
1642 h->row_offset = 0;
1643 h->nr_rows = 0;
1644
1645 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1646
1647 hists__inc_filter_stats(hists, h);
1648 hists__calc_col_len(hists, h);
1649 }
1650
1651
1652 static bool hists__filter_entry_by_dso(struct hists *hists,
1653 struct hist_entry *he)
1654 {
1655 if (hists->dso_filter != NULL &&
1656 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
1657 he->filtered |= (1 << HIST_FILTER__DSO);
1658 return true;
1659 }
1660
1661 return false;
1662 }
1663
1664 static bool hists__filter_entry_by_thread(struct hists *hists,
1665 struct hist_entry *he)
1666 {
1667 if (hists->thread_filter != NULL &&
1668 he->thread != hists->thread_filter) {
1669 he->filtered |= (1 << HIST_FILTER__THREAD);
1670 return true;
1671 }
1672
1673 return false;
1674 }
1675
1676 static bool hists__filter_entry_by_symbol(struct hists *hists,
1677 struct hist_entry *he)
1678 {
1679 if (hists->symbol_filter_str != NULL &&
1680 (!he->ms.sym || strstr(he->ms.sym->name,
1681 hists->symbol_filter_str) == NULL)) {
1682 he->filtered |= (1 << HIST_FILTER__SYMBOL);
1683 return true;
1684 }
1685
1686 return false;
1687 }
1688
1689 static bool hists__filter_entry_by_socket(struct hists *hists,
1690 struct hist_entry *he)
1691 {
1692 if ((hists->socket_filter > -1) &&
1693 (he->socket != hists->socket_filter)) {
1694 he->filtered |= (1 << HIST_FILTER__SOCKET);
1695 return true;
1696 }
1697
1698 return false;
1699 }
1700
1701 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
1702
1703 static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
1704 {
1705 struct rb_node *nd;
1706
1707 hists->stats.nr_non_filtered_samples = 0;
1708
1709 hists__reset_filter_stats(hists);
1710 hists__reset_col_len(hists);
1711
1712 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1713 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1714
1715 if (filter(hists, h))
1716 continue;
1717
1718 hists__remove_entry_filter(hists, h, type);
1719 }
1720 }
1721
1722 static void resort_filtered_entry(struct rb_root *root, struct hist_entry *he)
1723 {
1724 struct rb_node **p = &root->rb_node;
1725 struct rb_node *parent = NULL;
1726 struct hist_entry *iter;
1727 struct rb_root new_root = RB_ROOT;
1728 struct rb_node *nd;
1729
1730 while (*p != NULL) {
1731 parent = *p;
1732 iter = rb_entry(parent, struct hist_entry, rb_node);
1733
1734 if (hist_entry__sort(he, iter) > 0)
1735 p = &(*p)->rb_left;
1736 else
1737 p = &(*p)->rb_right;
1738 }
1739
1740 rb_link_node(&he->rb_node, parent, p);
1741 rb_insert_color(&he->rb_node, root);
1742
1743 if (he->leaf || he->filtered)
1744 return;
1745
1746 nd = rb_first(&he->hroot_out);
1747 while (nd) {
1748 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1749
1750 nd = rb_next(nd);
1751 rb_erase(&h->rb_node, &he->hroot_out);
1752
1753 resort_filtered_entry(&new_root, h);
1754 }
1755
1756 he->hroot_out = new_root;
1757 }
1758
1759 static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
1760 {
1761 struct rb_node *nd;
1762 struct rb_root new_root = RB_ROOT;
1763
1764 hists->stats.nr_non_filtered_samples = 0;
1765
1766 hists__reset_filter_stats(hists);
1767 hists__reset_col_len(hists);
1768
1769 nd = rb_first(&hists->entries);
1770 while (nd) {
1771 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1772 int ret;
1773
1774 ret = hist_entry__filter(h, type, arg);
1775
1776 /*
1777 * case 1. non-matching type
1778 * zero out the period, set filter marker and move to child
1779 */
1780 if (ret < 0) {
1781 memset(&h->stat, 0, sizeof(h->stat));
1782 h->filtered |= (1 << type);
1783
1784 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
1785 }
1786 /*
1787 * case 2. matched type (filter out)
1788 * set filter marker and move to next
1789 */
1790 else if (ret == 1) {
1791 h->filtered |= (1 << type);
1792
1793 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
1794 }
1795 /*
1796 * case 3. ok (not filtered)
1797 * add period to hists and parents, erase the filter marker
1798 * and move to next sibling
1799 */
1800 else {
1801 hists__remove_entry_filter(hists, h, type);
1802
1803 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
1804 }
1805 }
1806
1807 /*
1808 * resort output after applying a new filter since filter in a lower
1809 * hierarchy can change periods in a upper hierarchy.
1810 */
1811 nd = rb_first(&hists->entries);
1812 while (nd) {
1813 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1814
1815 nd = rb_next(nd);
1816 rb_erase(&h->rb_node, &hists->entries);
1817
1818 resort_filtered_entry(&new_root, h);
1819 }
1820
1821 hists->entries = new_root;
1822 }
1823
1824 void hists__filter_by_thread(struct hists *hists)
1825 {
1826 if (symbol_conf.report_hierarchy)
1827 hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
1828 hists->thread_filter);
1829 else
1830 hists__filter_by_type(hists, HIST_FILTER__THREAD,
1831 hists__filter_entry_by_thread);
1832 }
1833
1834 void hists__filter_by_dso(struct hists *hists)
1835 {
1836 if (symbol_conf.report_hierarchy)
1837 hists__filter_hierarchy(hists, HIST_FILTER__DSO,
1838 hists->dso_filter);
1839 else
1840 hists__filter_by_type(hists, HIST_FILTER__DSO,
1841 hists__filter_entry_by_dso);
1842 }
1843
1844 void hists__filter_by_symbol(struct hists *hists)
1845 {
1846 if (symbol_conf.report_hierarchy)
1847 hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
1848 hists->symbol_filter_str);
1849 else
1850 hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
1851 hists__filter_entry_by_symbol);
1852 }
1853
1854 void hists__filter_by_socket(struct hists *hists)
1855 {
1856 if (symbol_conf.report_hierarchy)
1857 hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
1858 &hists->socket_filter);
1859 else
1860 hists__filter_by_type(hists, HIST_FILTER__SOCKET,
1861 hists__filter_entry_by_socket);
1862 }
1863
1864 void events_stats__inc(struct events_stats *stats, u32 type)
1865 {
1866 ++stats->nr_events[0];
1867 ++stats->nr_events[type];
1868 }
1869
1870 void hists__inc_nr_events(struct hists *hists, u32 type)
1871 {
1872 events_stats__inc(&hists->stats, type);
1873 }
1874
1875 void hists__inc_nr_samples(struct hists *hists, bool filtered)
1876 {
1877 events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE);
1878 if (!filtered)
1879 hists->stats.nr_non_filtered_samples++;
1880 }
1881
1882 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
1883 struct hist_entry *pair)
1884 {
1885 struct rb_root *root;
1886 struct rb_node **p;
1887 struct rb_node *parent = NULL;
1888 struct hist_entry *he;
1889 int64_t cmp;
1890
1891 if (sort__need_collapse)
1892 root = &hists->entries_collapsed;
1893 else
1894 root = hists->entries_in;
1895
1896 p = &root->rb_node;
1897
1898 while (*p != NULL) {
1899 parent = *p;
1900 he = rb_entry(parent, struct hist_entry, rb_node_in);
1901
1902 cmp = hist_entry__collapse(he, pair);
1903
1904 if (!cmp)
1905 goto out;
1906
1907 if (cmp < 0)
1908 p = &(*p)->rb_left;
1909 else
1910 p = &(*p)->rb_right;
1911 }
1912
1913 he = hist_entry__new(pair, true);
1914 if (he) {
1915 memset(&he->stat, 0, sizeof(he->stat));
1916 he->hists = hists;
1917 rb_link_node(&he->rb_node_in, parent, p);
1918 rb_insert_color(&he->rb_node_in, root);
1919 hists__inc_stats(hists, he);
1920 he->dummy = true;
1921 }
1922 out:
1923 return he;
1924 }
1925
1926 static struct hist_entry *hists__find_entry(struct hists *hists,
1927 struct hist_entry *he)
1928 {
1929 struct rb_node *n;
1930
1931 if (sort__need_collapse)
1932 n = hists->entries_collapsed.rb_node;
1933 else
1934 n = hists->entries_in->rb_node;
1935
1936 while (n) {
1937 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
1938 int64_t cmp = hist_entry__collapse(iter, he);
1939
1940 if (cmp < 0)
1941 n = n->rb_left;
1942 else if (cmp > 0)
1943 n = n->rb_right;
1944 else
1945 return iter;
1946 }
1947
1948 return NULL;
1949 }
1950
1951 /*
1952 * Look for pairs to link to the leader buckets (hist_entries):
1953 */
1954 void hists__match(struct hists *leader, struct hists *other)
1955 {
1956 struct rb_root *root;
1957 struct rb_node *nd;
1958 struct hist_entry *pos, *pair;
1959
1960 if (sort__need_collapse)
1961 root = &leader->entries_collapsed;
1962 else
1963 root = leader->entries_in;
1964
1965 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
1966 pos = rb_entry(nd, struct hist_entry, rb_node_in);
1967 pair = hists__find_entry(other, pos);
1968
1969 if (pair)
1970 hist_entry__add_pair(pair, pos);
1971 }
1972 }
1973
1974 /*
1975 * Look for entries in the other hists that are not present in the leader, if
1976 * we find them, just add a dummy entry on the leader hists, with period=0,
1977 * nr_events=0, to serve as the list header.
1978 */
1979 int hists__link(struct hists *leader, struct hists *other)
1980 {
1981 struct rb_root *root;
1982 struct rb_node *nd;
1983 struct hist_entry *pos, *pair;
1984
1985 if (sort__need_collapse)
1986 root = &other->entries_collapsed;
1987 else
1988 root = other->entries_in;
1989
1990 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
1991 pos = rb_entry(nd, struct hist_entry, rb_node_in);
1992
1993 if (!hist_entry__has_pairs(pos)) {
1994 pair = hists__add_dummy_entry(leader, pos);
1995 if (pair == NULL)
1996 return -1;
1997 hist_entry__add_pair(pos, pair);
1998 }
1999 }
2000
2001 return 0;
2002 }
2003
2004 void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
2005 struct perf_sample *sample, bool nonany_branch_mode)
2006 {
2007 struct branch_info *bi;
2008
2009 /* If we have branch cycles always annotate them. */
2010 if (bs && bs->nr && bs->entries[0].flags.cycles) {
2011 int i;
2012
2013 bi = sample__resolve_bstack(sample, al);
2014 if (bi) {
2015 struct addr_map_symbol *prev = NULL;
2016
2017 /*
2018 * Ignore errors, still want to process the
2019 * other entries.
2020 *
2021 * For non standard branch modes always
2022 * force no IPC (prev == NULL)
2023 *
2024 * Note that perf stores branches reversed from
2025 * program order!
2026 */
2027 for (i = bs->nr - 1; i >= 0; i--) {
2028 addr_map_symbol__account_cycles(&bi[i].from,
2029 nonany_branch_mode ? NULL : prev,
2030 bi[i].flags.cycles);
2031 prev = &bi[i].to;
2032 }
2033 free(bi);
2034 }
2035 }
2036 }
2037
2038 size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp)
2039 {
2040 struct perf_evsel *pos;
2041 size_t ret = 0;
2042
2043 evlist__for_each(evlist, pos) {
2044 ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos));
2045 ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
2046 }
2047
2048 return ret;
2049 }
2050
2051
2052 u64 hists__total_period(struct hists *hists)
2053 {
2054 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
2055 hists->stats.total_period;
2056 }
2057
2058 int parse_filter_percentage(const struct option *opt __maybe_unused,
2059 const char *arg, int unset __maybe_unused)
2060 {
2061 if (!strcmp(arg, "relative"))
2062 symbol_conf.filter_relative = true;
2063 else if (!strcmp(arg, "absolute"))
2064 symbol_conf.filter_relative = false;
2065 else
2066 return -1;
2067
2068 return 0;
2069 }
2070
2071 int perf_hist_config(const char *var, const char *value)
2072 {
2073 if (!strcmp(var, "hist.percentage"))
2074 return parse_filter_percentage(NULL, value, 0);
2075
2076 return 0;
2077 }
2078
2079 int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2080 {
2081 memset(hists, 0, sizeof(*hists));
2082 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT;
2083 hists->entries_in = &hists->entries_in_array[0];
2084 hists->entries_collapsed = RB_ROOT;
2085 hists->entries = RB_ROOT;
2086 pthread_mutex_init(&hists->lock, NULL);
2087 hists->socket_filter = -1;
2088 hists->hpp_list = hpp_list;
2089 return 0;
2090 }
2091
2092 static void hists__delete_remaining_entries(struct rb_root *root)
2093 {
2094 struct rb_node *node;
2095 struct hist_entry *he;
2096
2097 while (!RB_EMPTY_ROOT(root)) {
2098 node = rb_first(root);
2099 rb_erase(node, root);
2100
2101 he = rb_entry(node, struct hist_entry, rb_node_in);
2102 hist_entry__delete(he);
2103 }
2104 }
2105
2106 static void hists__delete_all_entries(struct hists *hists)
2107 {
2108 hists__delete_entries(hists);
2109 hists__delete_remaining_entries(&hists->entries_in_array[0]);
2110 hists__delete_remaining_entries(&hists->entries_in_array[1]);
2111 hists__delete_remaining_entries(&hists->entries_collapsed);
2112 }
2113
2114 static void hists_evsel__exit(struct perf_evsel *evsel)
2115 {
2116 struct hists *hists = evsel__hists(evsel);
2117
2118 hists__delete_all_entries(hists);
2119 }
2120
2121 static int hists_evsel__init(struct perf_evsel *evsel)
2122 {
2123 struct hists *hists = evsel__hists(evsel);
2124
2125 __hists__init(hists, &perf_hpp_list);
2126 return 0;
2127 }
2128
2129 /*
2130 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2131 * stored in the rbtree...
2132 */
2133
2134 int hists__init(void)
2135 {
2136 int err = perf_evsel__object_config(sizeof(struct hists_evsel),
2137 hists_evsel__init,
2138 hists_evsel__exit);
2139 if (err)
2140 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
2141
2142 return err;
2143 }
2144
2145 void perf_hpp_list__init(struct perf_hpp_list *list)
2146 {
2147 INIT_LIST_HEAD(&list->fields);
2148 INIT_LIST_HEAD(&list->sorts);
2149 }
Linux kernel - Deliverables
This page took 0.075226 seconds and 6 git commands to generate.