15 struct callchain_param callchain_param = {
16 .mode = CHAIN_GRAPH_REL,
20 u16 hists__col_len(struct hists *self, enum hist_column col)
22 return self->col_len[col];
25 void hists__set_col_len(struct hists *self, enum hist_column col, u16 len)
27 self->col_len[col] = len;
30 bool hists__new_col_len(struct hists *self, enum hist_column col, u16 len)
32 if (len > hists__col_len(self, col)) {
33 hists__set_col_len(self, col, len);
39 static void hists__reset_col_len(struct hists *self)
43 for (col = 0; col < HISTC_NR_COLS; ++col)
44 hists__set_col_len(self, col, 0);
47 static void hists__calc_col_len(struct hists *self, struct hist_entry *h)
52 hists__new_col_len(self, HISTC_SYMBOL, h->ms.sym->namelen);
54 len = thread__comm_len(h->thread);
55 if (hists__new_col_len(self, HISTC_COMM, len))
56 hists__set_col_len(self, HISTC_THREAD, len + 6);
59 len = dso__name_len(h->ms.map->dso);
60 hists__new_col_len(self, HISTC_DSO, len);
64 static void hist_entry__add_cpumode_period(struct hist_entry *self,
65 unsigned int cpumode, u64 period)
68 case PERF_RECORD_MISC_KERNEL:
69 self->period_sys += period;
71 case PERF_RECORD_MISC_USER:
72 self->period_us += period;
74 case PERF_RECORD_MISC_GUEST_KERNEL:
75 self->period_guest_sys += period;
77 case PERF_RECORD_MISC_GUEST_USER:
78 self->period_guest_us += period;
86 * histogram, sorted on item, collects periods
89 static struct hist_entry *hist_entry__new(struct hist_entry *template)
91 size_t callchain_size = symbol_conf.use_callchain ? sizeof(struct callchain_root) : 0;
92 struct hist_entry *self = malloc(sizeof(*self) + callchain_size);
98 self->ms.map->referenced = true;
99 if (symbol_conf.use_callchain)
100 callchain_init(self->callchain);
106 static void hists__inc_nr_entries(struct hists *self, struct hist_entry *h)
109 hists__calc_col_len(self, h);
114 static u8 symbol__parent_filter(const struct symbol *parent)
116 if (symbol_conf.exclude_other && parent == NULL)
117 return 1 << HIST_FILTER__PARENT;
121 struct hist_entry *__hists__add_entry(struct hists *self,
122 struct addr_location *al,
123 struct symbol *sym_parent, u64 period)
125 struct rb_node **p = &self->entries.rb_node;
126 struct rb_node *parent = NULL;
127 struct hist_entry *he;
128 struct hist_entry entry = {
129 .thread = al->thread,
138 .parent = sym_parent,
139 .filtered = symbol__parent_filter(sym_parent),
145 he = rb_entry(parent, struct hist_entry, rb_node);
147 cmp = hist_entry__cmp(&entry, he);
150 he->period += period;
161 he = hist_entry__new(&entry);
164 rb_link_node(&he->rb_node, parent, p);
165 rb_insert_color(&he->rb_node, &self->entries);
166 hists__inc_nr_entries(self, he);
168 hist_entry__add_cpumode_period(he, al->cpumode, period);
173 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
175 struct sort_entry *se;
178 list_for_each_entry(se, &hist_entry__sort_list, list) {
179 cmp = se->se_cmp(left, right);
188 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
190 struct sort_entry *se;
193 list_for_each_entry(se, &hist_entry__sort_list, list) {
194 int64_t (*f)(struct hist_entry *, struct hist_entry *);
196 f = se->se_collapse ?: se->se_cmp;
198 cmp = f(left, right);
206 void hist_entry__free(struct hist_entry *he)
212 * collapse the histogram
215 static bool hists__collapse_insert_entry(struct hists *self,
216 struct rb_root *root,
217 struct hist_entry *he)
219 struct rb_node **p = &root->rb_node;
220 struct rb_node *parent = NULL;
221 struct hist_entry *iter;
226 iter = rb_entry(parent, struct hist_entry, rb_node);
228 cmp = hist_entry__collapse(iter, he);
231 iter->period += he->period;
232 if (symbol_conf.use_callchain) {
233 callchain_cursor_reset(&self->callchain_cursor);
234 callchain_merge(&self->callchain_cursor, iter->callchain,
237 hist_entry__free(he);
247 rb_link_node(&he->rb_node, parent, p);
248 rb_insert_color(&he->rb_node, root);
252 void hists__collapse_resort(struct hists *self)
255 struct rb_node *next;
256 struct hist_entry *n;
258 if (!sort__need_collapse)
262 next = rb_first(&self->entries);
263 self->nr_entries = 0;
264 hists__reset_col_len(self);
267 n = rb_entry(next, struct hist_entry, rb_node);
268 next = rb_next(&n->rb_node);
270 rb_erase(&n->rb_node, &self->entries);
271 if (hists__collapse_insert_entry(self, &tmp, n))
272 hists__inc_nr_entries(self, n);
279 * reverse the map, sort on period.
282 static void __hists__insert_output_entry(struct rb_root *entries,
283 struct hist_entry *he,
284 u64 min_callchain_hits)
286 struct rb_node **p = &entries->rb_node;
287 struct rb_node *parent = NULL;
288 struct hist_entry *iter;
290 if (symbol_conf.use_callchain)
291 callchain_param.sort(&he->sorted_chain, he->callchain,
292 min_callchain_hits, &callchain_param);
296 iter = rb_entry(parent, struct hist_entry, rb_node);
298 if (he->period > iter->period)
304 rb_link_node(&he->rb_node, parent, p);
305 rb_insert_color(&he->rb_node, entries);
308 void hists__output_resort(struct hists *self)
311 struct rb_node *next;
312 struct hist_entry *n;
313 u64 min_callchain_hits;
315 min_callchain_hits = self->stats.total_period * (callchain_param.min_percent / 100);
318 next = rb_first(&self->entries);
320 self->nr_entries = 0;
321 hists__reset_col_len(self);
324 n = rb_entry(next, struct hist_entry, rb_node);
325 next = rb_next(&n->rb_node);
327 rb_erase(&n->rb_node, &self->entries);
328 __hists__insert_output_entry(&tmp, n, min_callchain_hits);
329 hists__inc_nr_entries(self, n);
335 static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
338 int ret = fprintf(fp, " ");
340 for (i = 0; i < left_margin; i++)
341 ret += fprintf(fp, " ");
346 static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
350 size_t ret = callchain__fprintf_left_margin(fp, left_margin);
352 for (i = 0; i < depth; i++)
353 if (depth_mask & (1 << i))
354 ret += fprintf(fp, "| ");
356 ret += fprintf(fp, " ");
358 ret += fprintf(fp, "\n");
363 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain,
364 int depth, int depth_mask, int period,
365 u64 total_samples, u64 hits,
371 ret += callchain__fprintf_left_margin(fp, left_margin);
372 for (i = 0; i < depth; i++) {
373 if (depth_mask & (1 << i))
374 ret += fprintf(fp, "|");
376 ret += fprintf(fp, " ");
377 if (!period && i == depth - 1) {
380 percent = hits * 100.0 / total_samples;
381 ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
383 ret += fprintf(fp, "%s", " ");
386 ret += fprintf(fp, "%s\n", chain->ms.sym->name);
388 ret += fprintf(fp, "%p\n", (void *)(long)chain->ip);
393 static struct symbol *rem_sq_bracket;
394 static struct callchain_list rem_hits;
396 static void init_rem_hits(void)
398 rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
399 if (!rem_sq_bracket) {
400 fprintf(stderr, "Not enough memory to display remaining hits\n");
404 strcpy(rem_sq_bracket->name, "[...]");
405 rem_hits.ms.sym = rem_sq_bracket;
408 static size_t __callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
409 u64 total_samples, int depth,
410 int depth_mask, int left_margin)
412 struct rb_node *node, *next;
413 struct callchain_node *child;
414 struct callchain_list *chain;
415 int new_depth_mask = depth_mask;
420 uint entries_printed = 0;
422 if (callchain_param.mode == CHAIN_GRAPH_REL)
423 new_total = self->children_hit;
425 new_total = total_samples;
427 remaining = new_total;
429 node = rb_first(&self->rb_root);
433 child = rb_entry(node, struct callchain_node, rb_node);
434 cumul = callchain_cumul_hits(child);
438 * The depth mask manages the output of pipes that show
439 * the depth. We don't want to keep the pipes of the current
440 * level for the last child of this depth.
441 * Except if we have remaining filtered hits. They will
442 * supersede the last child
444 next = rb_next(node);
445 if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
446 new_depth_mask &= ~(1 << (depth - 1));
449 * But we keep the older depth mask for the line separator
450 * to keep the level link until we reach the last child
452 ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
455 list_for_each_entry(chain, &child->val, list) {
456 ret += ipchain__fprintf_graph(fp, chain, depth,
462 ret += __callchain__fprintf_graph(fp, child, new_total,
464 new_depth_mask | (1 << depth),
467 if (++entries_printed == callchain_param.print_limit)
471 if (callchain_param.mode == CHAIN_GRAPH_REL &&
472 remaining && remaining != new_total) {
477 new_depth_mask &= ~(1 << (depth - 1));
479 ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
480 new_depth_mask, 0, new_total,
481 remaining, left_margin);
487 static size_t callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
488 u64 total_samples, int left_margin)
490 struct callchain_list *chain;
491 bool printed = false;
494 u32 entries_printed = 0;
496 list_for_each_entry(chain, &self->val, list) {
497 if (!i++ && sort__first_dimension == SORT_SYM)
501 ret += callchain__fprintf_left_margin(fp, left_margin);
502 ret += fprintf(fp, "|\n");
503 ret += callchain__fprintf_left_margin(fp, left_margin);
504 ret += fprintf(fp, "---");
509 ret += callchain__fprintf_left_margin(fp, left_margin);
512 ret += fprintf(fp, " %s\n", chain->ms.sym->name);
514 ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
516 if (++entries_printed == callchain_param.print_limit)
520 ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1, left_margin);
525 static size_t callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
528 struct callchain_list *chain;
534 ret += callchain__fprintf_flat(fp, self->parent, total_samples);
537 list_for_each_entry(chain, &self->val, list) {
538 if (chain->ip >= PERF_CONTEXT_MAX)
541 ret += fprintf(fp, " %s\n", chain->ms.sym->name);
543 ret += fprintf(fp, " %p\n",
544 (void *)(long)chain->ip);
550 static size_t hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
551 u64 total_samples, int left_margin)
553 struct rb_node *rb_node;
554 struct callchain_node *chain;
556 u32 entries_printed = 0;
558 rb_node = rb_first(&self->sorted_chain);
562 chain = rb_entry(rb_node, struct callchain_node, rb_node);
563 percent = chain->hit * 100.0 / total_samples;
564 switch (callchain_param.mode) {
566 ret += percent_color_fprintf(fp, " %6.2f%%\n",
568 ret += callchain__fprintf_flat(fp, chain, total_samples);
570 case CHAIN_GRAPH_ABS: /* Falldown */
571 case CHAIN_GRAPH_REL:
572 ret += callchain__fprintf_graph(fp, chain, total_samples,
578 ret += fprintf(fp, "\n");
579 if (++entries_printed == callchain_param.print_limit)
581 rb_node = rb_next(rb_node);
587 int hist_entry__snprintf(struct hist_entry *self, char *s, size_t size,
588 struct hists *hists, struct hists *pair_hists,
589 bool show_displacement, long displacement,
590 bool color, u64 session_total)
592 struct sort_entry *se;
593 u64 period, total, period_sys, period_us, period_guest_sys, period_guest_us;
595 const char *sep = symbol_conf.field_sep;
598 if (symbol_conf.exclude_other && !self->parent)
602 period = self->pair ? self->pair->period : 0;
603 nr_events = self->pair ? self->pair->nr_events : 0;
604 total = pair_hists->stats.total_period;
605 period_sys = self->pair ? self->pair->period_sys : 0;
606 period_us = self->pair ? self->pair->period_us : 0;
607 period_guest_sys = self->pair ? self->pair->period_guest_sys : 0;
608 period_guest_us = self->pair ? self->pair->period_guest_us : 0;
610 period = self->period;
611 nr_events = self->nr_events;
612 total = session_total;
613 period_sys = self->period_sys;
614 period_us = self->period_us;
615 period_guest_sys = self->period_guest_sys;
616 period_guest_us = self->period_guest_us;
621 ret = percent_color_snprintf(s, size,
622 sep ? "%.2f" : " %6.2f%%",
623 (period * 100.0) / total);
625 ret = snprintf(s, size, sep ? "%.2f" : " %6.2f%%",
626 (period * 100.0) / total);
627 if (symbol_conf.show_cpu_utilization) {
628 ret += percent_color_snprintf(s + ret, size - ret,
629 sep ? "%.2f" : " %6.2f%%",
630 (period_sys * 100.0) / total);
631 ret += percent_color_snprintf(s + ret, size - ret,
632 sep ? "%.2f" : " %6.2f%%",
633 (period_us * 100.0) / total);
635 ret += percent_color_snprintf(s + ret,
637 sep ? "%.2f" : " %6.2f%%",
638 (period_guest_sys * 100.0) /
640 ret += percent_color_snprintf(s + ret,
642 sep ? "%.2f" : " %6.2f%%",
643 (period_guest_us * 100.0) /
648 ret = snprintf(s, size, sep ? "%" PRIu64 : "%12" PRIu64 " ", period);
650 if (symbol_conf.show_nr_samples) {
652 ret += snprintf(s + ret, size - ret, "%c%" PRIu64, *sep, nr_events);
654 ret += snprintf(s + ret, size - ret, "%11" PRIu64, nr_events);
659 double old_percent = 0, new_percent = 0, diff;
662 old_percent = (period * 100.0) / total;
663 if (session_total > 0)
664 new_percent = (self->period * 100.0) / session_total;
666 diff = new_percent - old_percent;
668 if (fabs(diff) >= 0.01)
669 snprintf(bf, sizeof(bf), "%+4.2F%%", diff);
671 snprintf(bf, sizeof(bf), " ");
674 ret += snprintf(s + ret, size - ret, "%c%s", *sep, bf);
676 ret += snprintf(s + ret, size - ret, "%11.11s", bf);
678 if (show_displacement) {
680 snprintf(bf, sizeof(bf), "%+4ld", displacement);
682 snprintf(bf, sizeof(bf), " ");
685 ret += snprintf(s + ret, size - ret, "%c%s", *sep, bf);
687 ret += snprintf(s + ret, size - ret, "%6.6s", bf);
691 list_for_each_entry(se, &hist_entry__sort_list, list) {
695 ret += snprintf(s + ret, size - ret, "%s", sep ?: " ");
696 ret += se->se_snprintf(self, s + ret, size - ret,
697 hists__col_len(hists, se->se_width_idx));
703 int hist_entry__fprintf(struct hist_entry *self, struct hists *hists,
704 struct hists *pair_hists, bool show_displacement,
705 long displacement, FILE *fp, u64 session_total)
708 hist_entry__snprintf(self, bf, sizeof(bf), hists, pair_hists,
709 show_displacement, displacement,
710 true, session_total);
711 return fprintf(fp, "%s\n", bf);
714 static size_t hist_entry__fprintf_callchain(struct hist_entry *self,
715 struct hists *hists, FILE *fp,
720 if (sort__first_dimension == SORT_COMM) {
721 struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
723 left_margin = hists__col_len(hists, se->se_width_idx);
724 left_margin -= thread__comm_len(self->thread);
727 return hist_entry_callchain__fprintf(fp, self, session_total,
731 size_t hists__fprintf(struct hists *self, struct hists *pair,
732 bool show_displacement, FILE *fp)
734 struct sort_entry *se;
737 unsigned long position = 1;
738 long displacement = 0;
740 const char *sep = symbol_conf.field_sep;
741 const char *col_width = symbol_conf.col_width_list_str;
745 fprintf(fp, "# %s", pair ? "Baseline" : "Overhead");
747 if (symbol_conf.show_nr_samples) {
749 fprintf(fp, "%cSamples", *sep);
751 fputs(" Samples ", fp);
754 if (symbol_conf.show_cpu_utilization) {
756 ret += fprintf(fp, "%csys", *sep);
757 ret += fprintf(fp, "%cus", *sep);
759 ret += fprintf(fp, "%cguest sys", *sep);
760 ret += fprintf(fp, "%cguest us", *sep);
763 ret += fprintf(fp, " sys ");
764 ret += fprintf(fp, " us ");
766 ret += fprintf(fp, " guest sys ");
767 ret += fprintf(fp, " guest us ");
774 ret += fprintf(fp, "%cDelta", *sep);
776 ret += fprintf(fp, " Delta ");
778 if (show_displacement) {
780 ret += fprintf(fp, "%cDisplacement", *sep);
782 ret += fprintf(fp, " Displ");
786 list_for_each_entry(se, &hist_entry__sort_list, list) {
790 fprintf(fp, "%c%s", *sep, se->se_header);
793 width = strlen(se->se_header);
794 if (symbol_conf.col_width_list_str) {
796 hists__set_col_len(self, se->se_width_idx,
798 col_width = strchr(col_width, ',');
803 if (!hists__new_col_len(self, se->se_width_idx, width))
804 width = hists__col_len(self, se->se_width_idx);
805 fprintf(fp, " %*s", width, se->se_header);
812 fprintf(fp, "# ........");
813 if (symbol_conf.show_nr_samples)
814 fprintf(fp, " ..........");
816 fprintf(fp, " ..........");
817 if (show_displacement)
818 fprintf(fp, " .....");
820 list_for_each_entry(se, &hist_entry__sort_list, list) {
827 width = hists__col_len(self, se->se_width_idx);
829 width = strlen(se->se_header);
830 for (i = 0; i < width; i++)
834 fprintf(fp, "\n#\n");
837 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) {
838 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
840 if (show_displacement) {
842 displacement = ((long)h->pair->position -
848 ret += hist_entry__fprintf(h, self, pair, show_displacement,
849 displacement, fp, self->stats.total_period);
851 if (symbol_conf.use_callchain)
852 ret += hist_entry__fprintf_callchain(h, self, fp,
853 self->stats.total_period);
854 if (h->ms.map == NULL && verbose > 1) {
855 __map_groups__fprintf_maps(&h->thread->mg,
856 MAP__FUNCTION, verbose, fp);
857 fprintf(fp, "%.10s end\n", graph_dotted_line);
861 free(rem_sq_bracket);
867 * See hists__fprintf to match the column widths
869 unsigned int hists__sort_list_width(struct hists *self)
871 struct sort_entry *se;
872 int ret = 9; /* total % */
874 if (symbol_conf.show_cpu_utilization) {
875 ret += 7; /* count_sys % */
876 ret += 6; /* count_us % */
878 ret += 13; /* count_guest_sys % */
879 ret += 12; /* count_guest_us % */
883 if (symbol_conf.show_nr_samples)
886 list_for_each_entry(se, &hist_entry__sort_list, list)
888 ret += 2 + hists__col_len(self, se->se_width_idx);
890 if (verbose) /* Addr + origin */
891 ret += 3 + BITS_PER_LONG / 4;
896 static void hists__remove_entry_filter(struct hists *self, struct hist_entry *h,
897 enum hist_filter filter)
899 h->filtered &= ~(1 << filter);
905 self->nr_entries += h->nr_rows;
907 self->stats.total_period += h->period;
908 self->stats.nr_events[PERF_RECORD_SAMPLE] += h->nr_events;
910 hists__calc_col_len(self, h);
913 void hists__filter_by_dso(struct hists *self, const struct dso *dso)
917 self->nr_entries = self->stats.total_period = 0;
918 self->stats.nr_events[PERF_RECORD_SAMPLE] = 0;
919 hists__reset_col_len(self);
921 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) {
922 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
924 if (symbol_conf.exclude_other && !h->parent)
927 if (dso != NULL && (h->ms.map == NULL || h->ms.map->dso != dso)) {
928 h->filtered |= (1 << HIST_FILTER__DSO);
932 hists__remove_entry_filter(self, h, HIST_FILTER__DSO);
936 void hists__filter_by_thread(struct hists *self, const struct thread *thread)
940 self->nr_entries = self->stats.total_period = 0;
941 self->stats.nr_events[PERF_RECORD_SAMPLE] = 0;
942 hists__reset_col_len(self);
944 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) {
945 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
947 if (thread != NULL && h->thread != thread) {
948 h->filtered |= (1 << HIST_FILTER__THREAD);
952 hists__remove_entry_filter(self, h, HIST_FILTER__THREAD);
956 int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip)
958 return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip);
961 int hist_entry__annotate(struct hist_entry *he, size_t privsize)
963 return symbol__annotate(he->ms.sym, he->ms.map, privsize);
966 void hists__inc_nr_events(struct hists *self, u32 type)
968 ++self->stats.nr_events[0];
969 ++self->stats.nr_events[type];
972 size_t hists__fprintf_nr_events(struct hists *self, FILE *fp)
977 for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
978 const char *name = perf_event__name(i);
980 if (!strcmp(name, "UNKNOWN"))
983 ret += fprintf(fp, "%16s events: %10d\n", name,
984 self->stats.nr_events[i]);