projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge tag 'perf-core-for-mingo' of git://git.kernel.org/pub/scm/linux/kernel/git...
[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 }
135
136 if (h->mem_info->iaddr.sym) {
137 symlen = (int)h->mem_info->iaddr.sym->namelen + 4
138 + unresolved_col_width + 2;
139 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
140 symlen);
141 } else {
142 symlen = unresolved_col_width + 4 + 2;
143 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
144 symlen);
145 }
146
147 if (h->mem_info->daddr.map) {
148 symlen = dso__name_len(h->mem_info->daddr.map->dso);
149 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
150 symlen);
151 } else {
152 symlen = unresolved_col_width + 4 + 2;
153 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
154 }
155 } else {
156 symlen = unresolved_col_width + 4 + 2;
157 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
158 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
159 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
160 }
161
162 hists__new_col_len(hists, HISTC_CPU, 3);
163 hists__new_col_len(hists, HISTC_SOCKET, 6);
164 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
165 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
166 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
167 hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
168 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
169 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
170
171 if (h->srcline)
172 hists__new_col_len(hists, HISTC_SRCLINE, strlen(h->srcline));
173
174 if (h->srcfile)
175 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
176
177 if (h->transaction)
178 hists__new_col_len(hists, HISTC_TRANSACTION,
179 hist_entry__transaction_len());
180 }
181
182 void hists__output_recalc_col_len(struct hists *hists, int max_rows)
183 {
184 struct rb_node *next = rb_first(&hists->entries);
185 struct hist_entry *n;
186 int row = 0;
187
188 hists__reset_col_len(hists);
189
190 while (next && row++ < max_rows) {
191 n = rb_entry(next, struct hist_entry, rb_node);
192 if (!n->filtered)
193 hists__calc_col_len(hists, n);
194 next = rb_next(&n->rb_node);
195 }
196 }
197
198 static void he_stat__add_cpumode_period(struct he_stat *he_stat,
199 unsigned int cpumode, u64 period)
200 {
201 switch (cpumode) {
202 case PERF_RECORD_MISC_KERNEL:
203 he_stat->period_sys += period;
204 break;
205 case PERF_RECORD_MISC_USER:
206 he_stat->period_us += period;
207 break;
208 case PERF_RECORD_MISC_GUEST_KERNEL:
209 he_stat->period_guest_sys += period;
210 break;
211 case PERF_RECORD_MISC_GUEST_USER:
212 he_stat->period_guest_us += period;
213 break;
214 default:
215 break;
216 }
217 }
218
219 static void he_stat__add_period(struct he_stat *he_stat, u64 period,
220 u64 weight)
221 {
222
223 he_stat->period += period;
224 he_stat->weight += weight;
225 he_stat->nr_events += 1;
226 }
227
228 static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
229 {
230 dest->period += src->period;
231 dest->period_sys += src->period_sys;
232 dest->period_us += src->period_us;
233 dest->period_guest_sys += src->period_guest_sys;
234 dest->period_guest_us += src->period_guest_us;
235 dest->nr_events += src->nr_events;
236 dest->weight += src->weight;
237 }
238
239 static void he_stat__decay(struct he_stat *he_stat)
240 {
241 he_stat->period = (he_stat->period * 7) / 8;
242 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
243 /* XXX need decay for weight too? */
244 }
245
246 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
247 {
248 u64 prev_period = he->stat.period;
249 u64 diff;
250
251 if (prev_period == 0)
252 return true;
253
254 he_stat__decay(&he->stat);
255 if (symbol_conf.cumulate_callchain)
256 he_stat__decay(he->stat_acc);
257
258 diff = prev_period - he->stat.period;
259
260 hists->stats.total_period -= diff;
261 if (!he->filtered)
262 hists->stats.total_non_filtered_period -= diff;
263
264 return he->stat.period == 0;
265 }
266
267 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
268 {
269 rb_erase(&he->rb_node, &hists->entries);
270
271 if (sort__need_collapse)
272 rb_erase(&he->rb_node_in, &hists->entries_collapsed);
273 else
274 rb_erase(&he->rb_node_in, hists->entries_in);
275
276 --hists->nr_entries;
277 if (!he->filtered)
278 --hists->nr_non_filtered_entries;
279
280 hist_entry__delete(he);
281 }
282
283 void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
284 {
285 struct rb_node *next = rb_first(&hists->entries);
286 struct hist_entry *n;
287
288 while (next) {
289 n = rb_entry(next, struct hist_entry, rb_node);
290 next = rb_next(&n->rb_node);
291 if (((zap_user && n->level == '.') ||
292 (zap_kernel && n->level != '.') ||
293 hists__decay_entry(hists, n))) {
294 hists__delete_entry(hists, n);
295 }
296 }
297 }
298
299 void hists__delete_entries(struct hists *hists)
300 {
301 struct rb_node *next = rb_first(&hists->entries);
302 struct hist_entry *n;
303
304 while (next) {
305 n = rb_entry(next, struct hist_entry, rb_node);
306 next = rb_next(&n->rb_node);
307
308 hists__delete_entry(hists, n);
309 }
310 }
311
312 /*
313 * histogram, sorted on item, collects periods
314 */
315
316 static struct hist_entry *hist_entry__new(struct hist_entry *template,
317 bool sample_self)
318 {
319 size_t callchain_size = 0;
320 struct hist_entry *he;
321
322 if (symbol_conf.use_callchain)
323 callchain_size = sizeof(struct callchain_root);
324
325 he = zalloc(sizeof(*he) + callchain_size);
326
327 if (he != NULL) {
328 *he = *template;
329
330 if (symbol_conf.cumulate_callchain) {
331 he->stat_acc = malloc(sizeof(he->stat));
332 if (he->stat_acc == NULL) {
333 free(he);
334 return NULL;
335 }
336 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
337 if (!sample_self)
338 memset(&he->stat, 0, sizeof(he->stat));
339 }
340
341 map__get(he->ms.map);
342
343 if (he->branch_info) {
344 /*
345 * This branch info is (a part of) allocated from
346 * sample__resolve_bstack() and will be freed after
347 * adding new entries. So we need to save a copy.
348 */
349 he->branch_info = malloc(sizeof(*he->branch_info));
350 if (he->branch_info == NULL) {
351 map__zput(he->ms.map);
352 free(he->stat_acc);
353 free(he);
354 return NULL;
355 }
356
357 memcpy(he->branch_info, template->branch_info,
358 sizeof(*he->branch_info));
359
360 map__get(he->branch_info->from.map);
361 map__get(he->branch_info->to.map);
362 }
363
364 if (he->mem_info) {
365 map__get(he->mem_info->iaddr.map);
366 map__get(he->mem_info->daddr.map);
367 }
368
369 if (symbol_conf.use_callchain)
370 callchain_init(he->callchain);
371
372 INIT_LIST_HEAD(&he->pairs.node);
373 thread__get(he->thread);
374 }
375
376 return he;
377 }
378
379 static u8 symbol__parent_filter(const struct symbol *parent)
380 {
381 if (symbol_conf.exclude_other && parent == NULL)
382 return 1 << HIST_FILTER__PARENT;
383 return 0;
384 }
385
386 static struct hist_entry *hists__findnew_entry(struct hists *hists,
387 struct hist_entry *entry,
388 struct addr_location *al,
389 bool sample_self)
390 {
391 struct rb_node **p;
392 struct rb_node *parent = NULL;
393 struct hist_entry *he;
394 int64_t cmp;
395 u64 period = entry->stat.period;
396 u64 weight = entry->stat.weight;
397
398 p = &hists->entries_in->rb_node;
399
400 while (*p != NULL) {
401 parent = *p;
402 he = rb_entry(parent, struct hist_entry, rb_node_in);
403
404 /*
405 * Make sure that it receives arguments in a same order as
406 * hist_entry__collapse() so that we can use an appropriate
407 * function when searching an entry regardless which sort
408 * keys were used.
409 */
410 cmp = hist_entry__cmp(he, entry);
411
412 if (!cmp) {
413 if (sample_self)
414 he_stat__add_period(&he->stat, period, weight);
415 if (symbol_conf.cumulate_callchain)
416 he_stat__add_period(he->stat_acc, period, weight);
417
418 /*
419 * This mem info was allocated from sample__resolve_mem
420 * and will not be used anymore.
421 */
422 zfree(&entry->mem_info);
423
424 /* If the map of an existing hist_entry has
425 * become out-of-date due to an exec() or
426 * similar, update it. Otherwise we will
427 * mis-adjust symbol addresses when computing
428 * the history counter to increment.
429 */
430 if (he->ms.map != entry->ms.map) {
431 map__put(he->ms.map);
432 he->ms.map = map__get(entry->ms.map);
433 }
434 goto out;
435 }
436
437 if (cmp < 0)
438 p = &(*p)->rb_left;
439 else
440 p = &(*p)->rb_right;
441 }
442
443 he = hist_entry__new(entry, sample_self);
444 if (!he)
445 return NULL;
446
447 hists->nr_entries++;
448
449 rb_link_node(&he->rb_node_in, parent, p);
450 rb_insert_color(&he->rb_node_in, hists->entries_in);
451 out:
452 if (sample_self)
453 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
454 if (symbol_conf.cumulate_callchain)
455 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
456 return he;
457 }
458
459 struct hist_entry *__hists__add_entry(struct hists *hists,
460 struct addr_location *al,
461 struct symbol *sym_parent,
462 struct branch_info *bi,
463 struct mem_info *mi,
464 u64 period, u64 weight, u64 transaction,
465 bool sample_self)
466 {
467 struct hist_entry entry = {
468 .thread = al->thread,
469 .comm = thread__comm(al->thread),
470 .ms = {
471 .map = al->map,
472 .sym = al->sym,
473 },
474 .socket = al->socket,
475 .cpu = al->cpu,
476 .cpumode = al->cpumode,
477 .ip = al->addr,
478 .level = al->level,
479 .stat = {
480 .nr_events = 1,
481 .period = period,
482 .weight = weight,
483 },
484 .parent = sym_parent,
485 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
486 .hists = hists,
487 .branch_info = bi,
488 .mem_info = mi,
489 .transaction = transaction,
490 };
491
492 return hists__findnew_entry(hists, &entry, al, sample_self);
493 }
494
495 static int
496 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
497 struct addr_location *al __maybe_unused)
498 {
499 return 0;
500 }
501
502 static int
503 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
504 struct addr_location *al __maybe_unused)
505 {
506 return 0;
507 }
508
509 static int
510 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
511 {
512 struct perf_sample *sample = iter->sample;
513 struct mem_info *mi;
514
515 mi = sample__resolve_mem(sample, al);
516 if (mi == NULL)
517 return -ENOMEM;
518
519 iter->priv = mi;
520 return 0;
521 }
522
523 static int
524 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
525 {
526 u64 cost;
527 struct mem_info *mi = iter->priv;
528 struct hists *hists = evsel__hists(iter->evsel);
529 struct hist_entry *he;
530
531 if (mi == NULL)
532 return -EINVAL;
533
534 cost = iter->sample->weight;
535 if (!cost)
536 cost = 1;
537
538 /*
539 * must pass period=weight in order to get the correct
540 * sorting from hists__collapse_resort() which is solely
541 * based on periods. We want sorting be done on nr_events * weight
542 * and this is indirectly achieved by passing period=weight here
543 * and the he_stat__add_period() function.
544 */
545 he = __hists__add_entry(hists, al, iter->parent, NULL, mi,
546 cost, cost, 0, true);
547 if (!he)
548 return -ENOMEM;
549
550 iter->he = he;
551 return 0;
552 }
553
554 static int
555 iter_finish_mem_entry(struct hist_entry_iter *iter,
556 struct addr_location *al __maybe_unused)
557 {
558 struct perf_evsel *evsel = iter->evsel;
559 struct hists *hists = evsel__hists(evsel);
560 struct hist_entry *he = iter->he;
561 int err = -EINVAL;
562
563 if (he == NULL)
564 goto out;
565
566 hists__inc_nr_samples(hists, he->filtered);
567
568 err = hist_entry__append_callchain(he, iter->sample);
569
570 out:
571 /*
572 * We don't need to free iter->priv (mem_info) here since the mem info
573 * was either already freed in hists__findnew_entry() or passed to a
574 * new hist entry by hist_entry__new().
575 */
576 iter->priv = NULL;
577
578 iter->he = NULL;
579 return err;
580 }
581
582 static int
583 iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
584 {
585 struct branch_info *bi;
586 struct perf_sample *sample = iter->sample;
587
588 bi = sample__resolve_bstack(sample, al);
589 if (!bi)
590 return -ENOMEM;
591
592 iter->curr = 0;
593 iter->total = sample->branch_stack->nr;
594
595 iter->priv = bi;
596 return 0;
597 }
598
599 static int
600 iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
601 struct addr_location *al __maybe_unused)
602 {
603 /* to avoid calling callback function */
604 iter->he = NULL;
605
606 return 0;
607 }
608
609 static int
610 iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
611 {
612 struct branch_info *bi = iter->priv;
613 int i = iter->curr;
614
615 if (bi == NULL)
616 return 0;
617
618 if (iter->curr >= iter->total)
619 return 0;
620
621 al->map = bi[i].to.map;
622 al->sym = bi[i].to.sym;
623 al->addr = bi[i].to.addr;
624 return 1;
625 }
626
627 static int
628 iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
629 {
630 struct branch_info *bi;
631 struct perf_evsel *evsel = iter->evsel;
632 struct hists *hists = evsel__hists(evsel);
633 struct hist_entry *he = NULL;
634 int i = iter->curr;
635 int err = 0;
636
637 bi = iter->priv;
638
639 if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym))
640 goto out;
641
642 /*
643 * The report shows the percentage of total branches captured
644 * and not events sampled. Thus we use a pseudo period of 1.
645 */
646 he = __hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
647 1, bi->flags.cycles ? bi->flags.cycles : 1,
648 0, true);
649 if (he == NULL)
650 return -ENOMEM;
651
652 hists__inc_nr_samples(hists, he->filtered);
653
654 out:
655 iter->he = he;
656 iter->curr++;
657 return err;
658 }
659
660 static int
661 iter_finish_branch_entry(struct hist_entry_iter *iter,
662 struct addr_location *al __maybe_unused)
663 {
664 zfree(&iter->priv);
665 iter->he = NULL;
666
667 return iter->curr >= iter->total ? 0 : -1;
668 }
669
670 static int
671 iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
672 struct addr_location *al __maybe_unused)
673 {
674 return 0;
675 }
676
677 static int
678 iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
679 {
680 struct perf_evsel *evsel = iter->evsel;
681 struct perf_sample *sample = iter->sample;
682 struct hist_entry *he;
683
684 he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
685 sample->period, sample->weight,
686 sample->transaction, true);
687 if (he == NULL)
688 return -ENOMEM;
689
690 iter->he = he;
691 return 0;
692 }
693
694 static int
695 iter_finish_normal_entry(struct hist_entry_iter *iter,
696 struct addr_location *al __maybe_unused)
697 {
698 struct hist_entry *he = iter->he;
699 struct perf_evsel *evsel = iter->evsel;
700 struct perf_sample *sample = iter->sample;
701
702 if (he == NULL)
703 return 0;
704
705 iter->he = NULL;
706
707 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
708
709 return hist_entry__append_callchain(he, sample);
710 }
711
712 static int
713 iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
714 struct addr_location *al __maybe_unused)
715 {
716 struct hist_entry **he_cache;
717
718 callchain_cursor_commit(&callchain_cursor);
719
720 /*
721 * This is for detecting cycles or recursions so that they're
722 * cumulated only one time to prevent entries more than 100%
723 * overhead.
724 */
725 he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1));
726 if (he_cache == NULL)
727 return -ENOMEM;
728
729 iter->priv = he_cache;
730 iter->curr = 0;
731
732 return 0;
733 }
734
735 static int
736 iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
737 struct addr_location *al)
738 {
739 struct perf_evsel *evsel = iter->evsel;
740 struct hists *hists = evsel__hists(evsel);
741 struct perf_sample *sample = iter->sample;
742 struct hist_entry **he_cache = iter->priv;
743 struct hist_entry *he;
744 int err = 0;
745
746 he = __hists__add_entry(hists, al, iter->parent, NULL, NULL,
747 sample->period, sample->weight,
748 sample->transaction, true);
749 if (he == NULL)
750 return -ENOMEM;
751
752 iter->he = he;
753 he_cache[iter->curr++] = he;
754
755 hist_entry__append_callchain(he, sample);
756
757 /*
758 * We need to re-initialize the cursor since callchain_append()
759 * advanced the cursor to the end.
760 */
761 callchain_cursor_commit(&callchain_cursor);
762
763 hists__inc_nr_samples(hists, he->filtered);
764
765 return err;
766 }
767
768 static int
769 iter_next_cumulative_entry(struct hist_entry_iter *iter,
770 struct addr_location *al)
771 {
772 struct callchain_cursor_node *node;
773
774 node = callchain_cursor_current(&callchain_cursor);
775 if (node == NULL)
776 return 0;
777
778 return fill_callchain_info(al, node, iter->hide_unresolved);
779 }
780
781 static int
782 iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
783 struct addr_location *al)
784 {
785 struct perf_evsel *evsel = iter->evsel;
786 struct perf_sample *sample = iter->sample;
787 struct hist_entry **he_cache = iter->priv;
788 struct hist_entry *he;
789 struct hist_entry he_tmp = {
790 .hists = evsel__hists(evsel),
791 .cpu = al->cpu,
792 .thread = al->thread,
793 .comm = thread__comm(al->thread),
794 .ip = al->addr,
795 .ms = {
796 .map = al->map,
797 .sym = al->sym,
798 },
799 .parent = iter->parent,
800 };
801 int i;
802 struct callchain_cursor cursor;
803
804 callchain_cursor_snapshot(&cursor, &callchain_cursor);
805
806 callchain_cursor_advance(&callchain_cursor);
807
808 /*
809 * Check if there's duplicate entries in the callchain.
810 * It's possible that it has cycles or recursive calls.
811 */
812 for (i = 0; i < iter->curr; i++) {
813 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
814 /* to avoid calling callback function */
815 iter->he = NULL;
816 return 0;
817 }
818 }
819
820 he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
821 sample->period, sample->weight,
822 sample->transaction, false);
823 if (he == NULL)
824 return -ENOMEM;
825
826 iter->he = he;
827 he_cache[iter->curr++] = he;
828
829 if (symbol_conf.use_callchain)
830 callchain_append(he->callchain, &cursor, sample->period);
831 return 0;
832 }
833
834 static int
835 iter_finish_cumulative_entry(struct hist_entry_iter *iter,
836 struct addr_location *al __maybe_unused)
837 {
838 zfree(&iter->priv);
839 iter->he = NULL;
840
841 return 0;
842 }
843
844 const struct hist_iter_ops hist_iter_mem = {
845 .prepare_entry = iter_prepare_mem_entry,
846 .add_single_entry = iter_add_single_mem_entry,
847 .next_entry = iter_next_nop_entry,
848 .add_next_entry = iter_add_next_nop_entry,
849 .finish_entry = iter_finish_mem_entry,
850 };
851
852 const struct hist_iter_ops hist_iter_branch = {
853 .prepare_entry = iter_prepare_branch_entry,
854 .add_single_entry = iter_add_single_branch_entry,
855 .next_entry = iter_next_branch_entry,
856 .add_next_entry = iter_add_next_branch_entry,
857 .finish_entry = iter_finish_branch_entry,
858 };
859
860 const struct hist_iter_ops hist_iter_normal = {
861 .prepare_entry = iter_prepare_normal_entry,
862 .add_single_entry = iter_add_single_normal_entry,
863 .next_entry = iter_next_nop_entry,
864 .add_next_entry = iter_add_next_nop_entry,
865 .finish_entry = iter_finish_normal_entry,
866 };
867
868 const struct hist_iter_ops hist_iter_cumulative = {
869 .prepare_entry = iter_prepare_cumulative_entry,
870 .add_single_entry = iter_add_single_cumulative_entry,
871 .next_entry = iter_next_cumulative_entry,
872 .add_next_entry = iter_add_next_cumulative_entry,
873 .finish_entry = iter_finish_cumulative_entry,
874 };
875
876 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
877 int max_stack_depth, void *arg)
878 {
879 int err, err2;
880
881 err = sample__resolve_callchain(iter->sample, &iter->parent,
882 iter->evsel, al, max_stack_depth);
883 if (err)
884 return err;
885
886 iter->max_stack = max_stack_depth;
887
888 err = iter->ops->prepare_entry(iter, al);
889 if (err)
890 goto out;
891
892 err = iter->ops->add_single_entry(iter, al);
893 if (err)
894 goto out;
895
896 if (iter->he && iter->add_entry_cb) {
897 err = iter->add_entry_cb(iter, al, true, arg);
898 if (err)
899 goto out;
900 }
901
902 while (iter->ops->next_entry(iter, al)) {
903 err = iter->ops->add_next_entry(iter, al);
904 if (err)
905 break;
906
907 if (iter->he && iter->add_entry_cb) {
908 err = iter->add_entry_cb(iter, al, false, arg);
909 if (err)
910 goto out;
911 }
912 }
913
914 out:
915 err2 = iter->ops->finish_entry(iter, al);
916 if (!err)
917 err = err2;
918
919 return err;
920 }
921
922 int64_t
923 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
924 {
925 struct perf_hpp_fmt *fmt;
926 int64_t cmp = 0;
927
928 perf_hpp__for_each_sort_list(fmt) {
929 cmp = fmt->cmp(fmt, left, right);
930 if (cmp)
931 break;
932 }
933
934 return cmp;
935 }
936
937 int64_t
938 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
939 {
940 struct perf_hpp_fmt *fmt;
941 int64_t cmp = 0;
942
943 perf_hpp__for_each_sort_list(fmt) {
944 cmp = fmt->collapse(fmt, left, right);
945 if (cmp)
946 break;
947 }
948
949 return cmp;
950 }
951
952 void hist_entry__delete(struct hist_entry *he)
953 {
954 thread__zput(he->thread);
955 map__zput(he->ms.map);
956
957 if (he->branch_info) {
958 map__zput(he->branch_info->from.map);
959 map__zput(he->branch_info->to.map);
960 zfree(&he->branch_info);
961 }
962
963 if (he->mem_info) {
964 map__zput(he->mem_info->iaddr.map);
965 map__zput(he->mem_info->daddr.map);
966 zfree(&he->mem_info);
967 }
968
969 zfree(&he->stat_acc);
970 free_srcline(he->srcline);
971 if (he->srcfile && he->srcfile[0])
972 free(he->srcfile);
973 free_callchain(he->callchain);
974 free(he);
975 }
976
977 /*
978 * collapse the histogram
979 */
980
981 static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused,
982 struct rb_root *root,
983 struct hist_entry *he)
984 {
985 struct rb_node **p = &root->rb_node;
986 struct rb_node *parent = NULL;
987 struct hist_entry *iter;
988 int64_t cmp;
989
990 while (*p != NULL) {
991 parent = *p;
992 iter = rb_entry(parent, struct hist_entry, rb_node_in);
993
994 cmp = hist_entry__collapse(iter, he);
995
996 if (!cmp) {
997 he_stat__add_stat(&iter->stat, &he->stat);
998 if (symbol_conf.cumulate_callchain)
999 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1000
1001 if (symbol_conf.use_callchain) {
1002 callchain_cursor_reset(&callchain_cursor);
1003 callchain_merge(&callchain_cursor,
1004 iter->callchain,
1005 he->callchain);
1006 }
1007 hist_entry__delete(he);
1008 return false;
1009 }
1010
1011 if (cmp < 0)
1012 p = &(*p)->rb_left;
1013 else
1014 p = &(*p)->rb_right;
1015 }
1016 hists->nr_entries++;
1017
1018 rb_link_node(&he->rb_node_in, parent, p);
1019 rb_insert_color(&he->rb_node_in, root);
1020 return true;
1021 }
1022
1023 static struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1024 {
1025 struct rb_root *root;
1026
1027 pthread_mutex_lock(&hists->lock);
1028
1029 root = hists->entries_in;
1030 if (++hists->entries_in > &hists->entries_in_array[1])
1031 hists->entries_in = &hists->entries_in_array[0];
1032
1033 pthread_mutex_unlock(&hists->lock);
1034
1035 return root;
1036 }
1037
1038 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1039 {
1040 hists__filter_entry_by_dso(hists, he);
1041 hists__filter_entry_by_thread(hists, he);
1042 hists__filter_entry_by_symbol(hists, he);
1043 hists__filter_entry_by_socket(hists, he);
1044 }
1045
1046 void hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1047 {
1048 struct rb_root *root;
1049 struct rb_node *next;
1050 struct hist_entry *n;
1051
1052 if (!sort__need_collapse)
1053 return;
1054
1055 hists->nr_entries = 0;
1056
1057 root = hists__get_rotate_entries_in(hists);
1058
1059 next = rb_first(root);
1060
1061 while (next) {
1062 if (session_done())
1063 break;
1064 n = rb_entry(next, struct hist_entry, rb_node_in);
1065 next = rb_next(&n->rb_node_in);
1066
1067 rb_erase(&n->rb_node_in, root);
1068 if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) {
1069 /*
1070 * If it wasn't combined with one of the entries already
1071 * collapsed, we need to apply the filters that may have
1072 * been set by, say, the hist_browser.
1073 */
1074 hists__apply_filters(hists, n);
1075 }
1076 if (prog)
1077 ui_progress__update(prog, 1);
1078 }
1079 }
1080
1081 static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1082 {
1083 struct perf_hpp_fmt *fmt;
1084 int64_t cmp = 0;
1085
1086 perf_hpp__for_each_sort_list(fmt) {
1087 if (perf_hpp__should_skip(fmt))
1088 continue;
1089
1090 cmp = fmt->sort(fmt, a, b);
1091 if (cmp)
1092 break;
1093 }
1094
1095 return cmp;
1096 }
1097
1098 static void hists__reset_filter_stats(struct hists *hists)
1099 {
1100 hists->nr_non_filtered_entries = 0;
1101 hists->stats.total_non_filtered_period = 0;
1102 }
1103
1104 void hists__reset_stats(struct hists *hists)
1105 {
1106 hists->nr_entries = 0;
1107 hists->stats.total_period = 0;
1108
1109 hists__reset_filter_stats(hists);
1110 }
1111
1112 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1113 {
1114 hists->nr_non_filtered_entries++;
1115 hists->stats.total_non_filtered_period += h->stat.period;
1116 }
1117
1118 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1119 {
1120 if (!h->filtered)
1121 hists__inc_filter_stats(hists, h);
1122
1123 hists->nr_entries++;
1124 hists->stats.total_period += h->stat.period;
1125 }
1126
1127 static void __hists__insert_output_entry(struct rb_root *entries,
1128 struct hist_entry *he,
1129 u64 min_callchain_hits,
1130 bool use_callchain)
1131 {
1132 struct rb_node **p = &entries->rb_node;
1133 struct rb_node *parent = NULL;
1134 struct hist_entry *iter;
1135
1136 if (use_callchain)
1137 callchain_param.sort(&he->sorted_chain, he->callchain,
1138 min_callchain_hits, &callchain_param);
1139
1140 while (*p != NULL) {
1141 parent = *p;
1142 iter = rb_entry(parent, struct hist_entry, rb_node);
1143
1144 if (hist_entry__sort(he, iter) > 0)
1145 p = &(*p)->rb_left;
1146 else
1147 p = &(*p)->rb_right;
1148 }
1149
1150 rb_link_node(&he->rb_node, parent, p);
1151 rb_insert_color(&he->rb_node, entries);
1152 }
1153
1154 void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1155 {
1156 struct rb_root *root;
1157 struct rb_node *next;
1158 struct hist_entry *n;
1159 u64 min_callchain_hits;
1160 struct perf_evsel *evsel = hists_to_evsel(hists);
1161 bool use_callchain;
1162
1163 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1164 use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN;
1165 else
1166 use_callchain = symbol_conf.use_callchain;
1167
1168 min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100);
1169
1170 if (sort__need_collapse)
1171 root = &hists->entries_collapsed;
1172 else
1173 root = hists->entries_in;
1174
1175 next = rb_first(root);
1176 hists->entries = RB_ROOT;
1177
1178 hists__reset_stats(hists);
1179 hists__reset_col_len(hists);
1180
1181 while (next) {
1182 n = rb_entry(next, struct hist_entry, rb_node_in);
1183 next = rb_next(&n->rb_node_in);
1184
1185 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1186 hists__inc_stats(hists, n);
1187
1188 if (!n->filtered)
1189 hists__calc_col_len(hists, n);
1190
1191 if (prog)
1192 ui_progress__update(prog, 1);
1193 }
1194 }
1195
1196 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1197 enum hist_filter filter)
1198 {
1199 h->filtered &= ~(1 << filter);
1200 if (h->filtered)
1201 return;
1202
1203 /* force fold unfiltered entry for simplicity */
1204 h->unfolded = false;
1205 h->row_offset = 0;
1206 h->nr_rows = 0;
1207
1208 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1209
1210 hists__inc_filter_stats(hists, h);
1211 hists__calc_col_len(hists, h);
1212 }
1213
1214
1215 static bool hists__filter_entry_by_dso(struct hists *hists,
1216 struct hist_entry *he)
1217 {
1218 if (hists->dso_filter != NULL &&
1219 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
1220 he->filtered |= (1 << HIST_FILTER__DSO);
1221 return true;
1222 }
1223
1224 return false;
1225 }
1226
1227 void hists__filter_by_dso(struct hists *hists)
1228 {
1229 struct rb_node *nd;
1230
1231 hists->stats.nr_non_filtered_samples = 0;
1232
1233 hists__reset_filter_stats(hists);
1234 hists__reset_col_len(hists);
1235
1236 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1237 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1238
1239 if (symbol_conf.exclude_other && !h->parent)
1240 continue;
1241
1242 if (hists__filter_entry_by_dso(hists, h))
1243 continue;
1244
1245 hists__remove_entry_filter(hists, h, HIST_FILTER__DSO);
1246 }
1247 }
1248
1249 static bool hists__filter_entry_by_thread(struct hists *hists,
1250 struct hist_entry *he)
1251 {
1252 if (hists->thread_filter != NULL &&
1253 he->thread != hists->thread_filter) {
1254 he->filtered |= (1 << HIST_FILTER__THREAD);
1255 return true;
1256 }
1257
1258 return false;
1259 }
1260
1261 void hists__filter_by_thread(struct hists *hists)
1262 {
1263 struct rb_node *nd;
1264
1265 hists->stats.nr_non_filtered_samples = 0;
1266
1267 hists__reset_filter_stats(hists);
1268 hists__reset_col_len(hists);
1269
1270 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1271 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1272
1273 if (hists__filter_entry_by_thread(hists, h))
1274 continue;
1275
1276 hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD);
1277 }
1278 }
1279
1280 static bool hists__filter_entry_by_symbol(struct hists *hists,
1281 struct hist_entry *he)
1282 {
1283 if (hists->symbol_filter_str != NULL &&
1284 (!he->ms.sym || strstr(he->ms.sym->name,
1285 hists->symbol_filter_str) == NULL)) {
1286 he->filtered |= (1 << HIST_FILTER__SYMBOL);
1287 return true;
1288 }
1289
1290 return false;
1291 }
1292
1293 void hists__filter_by_symbol(struct hists *hists)
1294 {
1295 struct rb_node *nd;
1296
1297 hists->stats.nr_non_filtered_samples = 0;
1298
1299 hists__reset_filter_stats(hists);
1300 hists__reset_col_len(hists);
1301
1302 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1303 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1304
1305 if (hists__filter_entry_by_symbol(hists, h))
1306 continue;
1307
1308 hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL);
1309 }
1310 }
1311
1312 static bool hists__filter_entry_by_socket(struct hists *hists,
1313 struct hist_entry *he)
1314 {
1315 if ((hists->socket_filter > -1) &&
1316 (he->socket != hists->socket_filter)) {
1317 he->filtered |= (1 << HIST_FILTER__SOCKET);
1318 return true;
1319 }
1320
1321 return false;
1322 }
1323
1324 void hists__filter_by_socket(struct hists *hists)
1325 {
1326 struct rb_node *nd;
1327
1328 hists->stats.nr_non_filtered_samples = 0;
1329
1330 hists__reset_filter_stats(hists);
1331 hists__reset_col_len(hists);
1332
1333 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1334 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1335
1336 if (hists__filter_entry_by_socket(hists, h))
1337 continue;
1338
1339 hists__remove_entry_filter(hists, h, HIST_FILTER__SOCKET);
1340 }
1341 }
1342
1343 void events_stats__inc(struct events_stats *stats, u32 type)
1344 {
1345 ++stats->nr_events[0];
1346 ++stats->nr_events[type];
1347 }
1348
1349 void hists__inc_nr_events(struct hists *hists, u32 type)
1350 {
1351 events_stats__inc(&hists->stats, type);
1352 }
1353
1354 void hists__inc_nr_samples(struct hists *hists, bool filtered)
1355 {
1356 events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE);
1357 if (!filtered)
1358 hists->stats.nr_non_filtered_samples++;
1359 }
1360
1361 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
1362 struct hist_entry *pair)
1363 {
1364 struct rb_root *root;
1365 struct rb_node **p;
1366 struct rb_node *parent = NULL;
1367 struct hist_entry *he;
1368 int64_t cmp;
1369
1370 if (sort__need_collapse)
1371 root = &hists->entries_collapsed;
1372 else
1373 root = hists->entries_in;
1374
1375 p = &root->rb_node;
1376
1377 while (*p != NULL) {
1378 parent = *p;
1379 he = rb_entry(parent, struct hist_entry, rb_node_in);
1380
1381 cmp = hist_entry__collapse(he, pair);
1382
1383 if (!cmp)
1384 goto out;
1385
1386 if (cmp < 0)
1387 p = &(*p)->rb_left;
1388 else
1389 p = &(*p)->rb_right;
1390 }
1391
1392 he = hist_entry__new(pair, true);
1393 if (he) {
1394 memset(&he->stat, 0, sizeof(he->stat));
1395 he->hists = hists;
1396 rb_link_node(&he->rb_node_in, parent, p);
1397 rb_insert_color(&he->rb_node_in, root);
1398 hists__inc_stats(hists, he);
1399 he->dummy = true;
1400 }
1401 out:
1402 return he;
1403 }
1404
1405 static struct hist_entry *hists__find_entry(struct hists *hists,
1406 struct hist_entry *he)
1407 {
1408 struct rb_node *n;
1409
1410 if (sort__need_collapse)
1411 n = hists->entries_collapsed.rb_node;
1412 else
1413 n = hists->entries_in->rb_node;
1414
1415 while (n) {
1416 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
1417 int64_t cmp = hist_entry__collapse(iter, he);
1418
1419 if (cmp < 0)
1420 n = n->rb_left;
1421 else if (cmp > 0)
1422 n = n->rb_right;
1423 else
1424 return iter;
1425 }
1426
1427 return NULL;
1428 }
1429
1430 /*
1431 * Look for pairs to link to the leader buckets (hist_entries):
1432 */
1433 void hists__match(struct hists *leader, struct hists *other)
1434 {
1435 struct rb_root *root;
1436 struct rb_node *nd;
1437 struct hist_entry *pos, *pair;
1438
1439 if (sort__need_collapse)
1440 root = &leader->entries_collapsed;
1441 else
1442 root = leader->entries_in;
1443
1444 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
1445 pos = rb_entry(nd, struct hist_entry, rb_node_in);
1446 pair = hists__find_entry(other, pos);
1447
1448 if (pair)
1449 hist_entry__add_pair(pair, pos);
1450 }
1451 }
1452
1453 /*
1454 * Look for entries in the other hists that are not present in the leader, if
1455 * we find them, just add a dummy entry on the leader hists, with period=0,
1456 * nr_events=0, to serve as the list header.
1457 */
1458 int hists__link(struct hists *leader, struct hists *other)
1459 {
1460 struct rb_root *root;
1461 struct rb_node *nd;
1462 struct hist_entry *pos, *pair;
1463
1464 if (sort__need_collapse)
1465 root = &other->entries_collapsed;
1466 else
1467 root = other->entries_in;
1468
1469 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
1470 pos = rb_entry(nd, struct hist_entry, rb_node_in);
1471
1472 if (!hist_entry__has_pairs(pos)) {
1473 pair = hists__add_dummy_entry(leader, pos);
1474 if (pair == NULL)
1475 return -1;
1476 hist_entry__add_pair(pos, pair);
1477 }
1478 }
1479
1480 return 0;
1481 }
1482
1483 void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
1484 struct perf_sample *sample, bool nonany_branch_mode)
1485 {
1486 struct branch_info *bi;
1487
1488 /* If we have branch cycles always annotate them. */
1489 if (bs && bs->nr && bs->entries[0].flags.cycles) {
1490 int i;
1491
1492 bi = sample__resolve_bstack(sample, al);
1493 if (bi) {
1494 struct addr_map_symbol *prev = NULL;
1495
1496 /*
1497 * Ignore errors, still want to process the
1498 * other entries.
1499 *
1500 * For non standard branch modes always
1501 * force no IPC (prev == NULL)
1502 *
1503 * Note that perf stores branches reversed from
1504 * program order!
1505 */
1506 for (i = bs->nr - 1; i >= 0; i--) {
1507 addr_map_symbol__account_cycles(&bi[i].from,
1508 nonany_branch_mode ? NULL : prev,
1509 bi[i].flags.cycles);
1510 prev = &bi[i].to;
1511 }
1512 free(bi);
1513 }
1514 }
1515 }
1516
1517 size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp)
1518 {
1519 struct perf_evsel *pos;
1520 size_t ret = 0;
1521
1522 evlist__for_each(evlist, pos) {
1523 ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos));
1524 ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
1525 }
1526
1527 return ret;
1528 }
1529
1530
1531 u64 hists__total_period(struct hists *hists)
1532 {
1533 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
1534 hists->stats.total_period;
1535 }
1536
1537 int parse_filter_percentage(const struct option *opt __maybe_unused,
1538 const char *arg, int unset __maybe_unused)
1539 {
1540 if (!strcmp(arg, "relative"))
1541 symbol_conf.filter_relative = true;
1542 else if (!strcmp(arg, "absolute"))
1543 symbol_conf.filter_relative = false;
1544 else
1545 return -1;
1546
1547 return 0;
1548 }
1549
1550 int perf_hist_config(const char *var, const char *value)
1551 {
1552 if (!strcmp(var, "hist.percentage"))
1553 return parse_filter_percentage(NULL, value, 0);
1554
1555 return 0;
1556 }
1557
1558 static int hists_evsel__init(struct perf_evsel *evsel)
1559 {
1560 struct hists *hists = evsel__hists(evsel);
1561
1562 memset(hists, 0, sizeof(*hists));
1563 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT;
1564 hists->entries_in = &hists->entries_in_array[0];
1565 hists->entries_collapsed = RB_ROOT;
1566 hists->entries = RB_ROOT;
1567 pthread_mutex_init(&hists->lock, NULL);
1568 hists->socket_filter = -1;
1569 return 0;
1570 }
1571
1572 static void hists__delete_remaining_entries(struct rb_root *root)
1573 {
1574 struct rb_node *node;
1575 struct hist_entry *he;
1576
1577 while (!RB_EMPTY_ROOT(root)) {
1578 node = rb_first(root);
1579 rb_erase(node, root);
1580
1581 he = rb_entry(node, struct hist_entry, rb_node_in);
1582 hist_entry__delete(he);
1583 }
1584 }
1585
1586 static void hists__delete_all_entries(struct hists *hists)
1587 {
1588 hists__delete_entries(hists);
1589 hists__delete_remaining_entries(&hists->entries_in_array[0]);
1590 hists__delete_remaining_entries(&hists->entries_in_array[1]);
1591 hists__delete_remaining_entries(&hists->entries_collapsed);
1592 }
1593
1594 static void hists_evsel__exit(struct perf_evsel *evsel)
1595 {
1596 struct hists *hists = evsel__hists(evsel);
1597
1598 hists__delete_all_entries(hists);
1599 }
1600
1601 /*
1602 * XXX We probably need a hists_evsel__exit() to free the hist_entries
1603 * stored in the rbtree...
1604 */
1605
1606 int hists__init(void)
1607 {
1608 int err = perf_evsel__object_config(sizeof(struct hists_evsel),
1609 hists_evsel__init,
1610 hists_evsel__exit);
1611 if (err)
1612 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
1613
1614 return err;
1615 }
Linux kernel - Deliverables
This page took 0.073383 seconds and 6 git commands to generate.