3 #include "../../util/util.h"
4 #include "../../util/hist.h"
5 #include "../../util/sort.h"
6 #include "../../util/evsel.h"
9 static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
12 int ret = fprintf(fp, " ");
14 for (i = 0; i < left_margin; i++)
15 ret += fprintf(fp, " ");
20 static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
24 size_t ret = callchain__fprintf_left_margin(fp, left_margin);
26 for (i = 0; i < depth; i++)
27 if (depth_mask & (1 << i))
28 ret += fprintf(fp, "| ");
30 ret += fprintf(fp, " ");
32 ret += fprintf(fp, "\n");
37 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain,
38 int depth, int depth_mask, int period,
39 u64 total_samples, u64 hits,
45 ret += callchain__fprintf_left_margin(fp, left_margin);
46 for (i = 0; i < depth; i++) {
47 if (depth_mask & (1 << i))
48 ret += fprintf(fp, "|");
50 ret += fprintf(fp, " ");
51 if (!period && i == depth - 1) {
54 percent = hits * 100.0 / total_samples;
55 ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
57 ret += fprintf(fp, "%s", " ");
60 ret += fprintf(fp, "%s\n", chain->ms.sym->name);
62 ret += fprintf(fp, "0x%0" PRIx64 "\n", chain->ip);
67 static struct symbol *rem_sq_bracket;
68 static struct callchain_list rem_hits;
70 static void init_rem_hits(void)
72 rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
73 if (!rem_sq_bracket) {
74 fprintf(stderr, "Not enough memory to display remaining hits\n");
78 strcpy(rem_sq_bracket->name, "[...]");
79 rem_hits.ms.sym = rem_sq_bracket;
82 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root,
83 u64 total_samples, int depth,
84 int depth_mask, int left_margin)
86 struct rb_node *node, *next;
87 struct callchain_node *child;
88 struct callchain_list *chain;
89 int new_depth_mask = depth_mask;
93 uint entries_printed = 0;
95 remaining = total_samples;
97 node = rb_first(root);
102 child = rb_entry(node, struct callchain_node, rb_node);
103 cumul = callchain_cumul_hits(child);
107 * The depth mask manages the output of pipes that show
108 * the depth. We don't want to keep the pipes of the current
109 * level for the last child of this depth.
110 * Except if we have remaining filtered hits. They will
111 * supersede the last child
113 next = rb_next(node);
114 if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
115 new_depth_mask &= ~(1 << (depth - 1));
118 * But we keep the older depth mask for the line separator
119 * to keep the level link until we reach the last child
121 ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
124 list_for_each_entry(chain, &child->val, list) {
125 ret += ipchain__fprintf_graph(fp, chain, depth,
132 if (callchain_param.mode == CHAIN_GRAPH_REL)
133 new_total = child->children_hit;
135 new_total = total_samples;
137 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
139 new_depth_mask | (1 << depth),
142 if (++entries_printed == callchain_param.print_limit)
146 if (callchain_param.mode == CHAIN_GRAPH_REL &&
147 remaining && remaining != total_samples) {
152 new_depth_mask &= ~(1 << (depth - 1));
153 ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
154 new_depth_mask, 0, total_samples,
155 remaining, left_margin);
161 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root,
162 u64 total_samples, int left_margin)
164 struct callchain_node *cnode;
165 struct callchain_list *chain;
166 u32 entries_printed = 0;
167 bool printed = false;
168 struct rb_node *node;
173 * If have one single callchain root, don't bother printing
174 * its percentage (100 % in fractal mode and the same percentage
175 * than the hist in graph mode). This also avoid one level of column.
177 node = rb_first(root);
178 if (node && !rb_next(node)) {
179 cnode = rb_entry(node, struct callchain_node, rb_node);
180 list_for_each_entry(chain, &cnode->val, list) {
182 * If we sort by symbol, the first entry is the same than
183 * the symbol. No need to print it otherwise it appears as
186 if (!i++ && sort__first_dimension == SORT_SYM)
189 ret += callchain__fprintf_left_margin(fp, left_margin);
190 ret += fprintf(fp, "|\n");
191 ret += callchain__fprintf_left_margin(fp, left_margin);
192 ret += fprintf(fp, "---");
196 ret += callchain__fprintf_left_margin(fp, left_margin);
199 ret += fprintf(fp, " %s\n", chain->ms.sym->name);
201 ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
203 if (++entries_printed == callchain_param.print_limit)
206 root = &cnode->rb_root;
209 ret += __callchain__fprintf_graph(fp, root, total_samples,
211 ret += fprintf(fp, "\n");
216 static size_t __callchain__fprintf_flat(FILE *fp,
217 struct callchain_node *self,
220 struct callchain_list *chain;
226 ret += __callchain__fprintf_flat(fp, self->parent, total_samples);
229 list_for_each_entry(chain, &self->val, list) {
230 if (chain->ip >= PERF_CONTEXT_MAX)
233 ret += fprintf(fp, " %s\n", chain->ms.sym->name);
235 ret += fprintf(fp, " %p\n",
236 (void *)(long)chain->ip);
242 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *self,
246 u32 entries_printed = 0;
247 struct rb_node *rb_node;
248 struct callchain_node *chain;
250 rb_node = rb_first(self);
254 chain = rb_entry(rb_node, struct callchain_node, rb_node);
255 percent = chain->hit * 100.0 / total_samples;
257 ret = percent_color_fprintf(fp, " %6.2f%%\n", percent);
258 ret += __callchain__fprintf_flat(fp, chain, total_samples);
259 ret += fprintf(fp, "\n");
260 if (++entries_printed == callchain_param.print_limit)
263 rb_node = rb_next(rb_node);
269 static size_t hist_entry_callchain__fprintf(struct hist_entry *he,
270 u64 total_samples, int left_margin,
273 switch (callchain_param.mode) {
274 case CHAIN_GRAPH_REL:
275 return callchain__fprintf_graph(fp, &he->sorted_chain, he->stat.period,
278 case CHAIN_GRAPH_ABS:
279 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
283 return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
288 pr_err("Bad callchain mode\n");
294 static size_t hist_entry__callchain_fprintf(struct hist_entry *he,
299 u64 total_period = hists->stats.total_period;
301 if (sort__first_dimension == SORT_COMM) {
302 struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
304 left_margin = hists__col_len(hists, se->se_width_idx);
305 left_margin -= thread__comm_len(he->thread);
308 return hist_entry_callchain__fprintf(he, total_period, left_margin, fp);
311 static inline void advance_hpp(struct perf_hpp *hpp, int inc)
317 static int hist_entry__period_snprintf(struct perf_hpp *hpp,
318 struct hist_entry *he,
321 const char *sep = symbol_conf.field_sep;
322 struct perf_hpp_fmt *fmt;
323 char *start = hpp->buf;
327 if (symbol_conf.exclude_other && !he->parent)
330 perf_hpp__for_each_format(fmt) {
332 * If there's no field_sep, we still need
333 * to display initial ' '.
335 if (!sep || !first) {
336 ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: " ");
337 advance_hpp(hpp, ret);
341 if (color && fmt->color)
342 ret = fmt->color(fmt, hpp, he);
344 ret = fmt->entry(fmt, hpp, he);
346 advance_hpp(hpp, ret);
349 return hpp->buf - start;
352 static int hist_entry__fprintf(struct hist_entry *he, size_t size,
354 char *bf, size_t bfsz, FILE *fp)
357 struct perf_hpp hpp = {
361 bool color = !symbol_conf.field_sep;
363 if (size == 0 || size > bfsz)
364 size = hpp.size = bfsz;
366 ret = hist_entry__period_snprintf(&hpp, he, color);
367 hist_entry__sort_snprintf(he, bf + ret, size - ret, hists);
369 ret = fprintf(fp, "%s\n", bf);
371 if (symbol_conf.use_callchain)
372 ret += hist_entry__callchain_fprintf(he, hists, fp);
377 size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
378 int max_cols, float min_pcnt, FILE *fp)
380 struct perf_hpp_fmt *fmt;
381 struct sort_entry *se;
385 const char *sep = symbol_conf.field_sep;
386 const char *col_width = symbol_conf.col_width_list_str;
389 struct perf_hpp dummy_hpp = {
392 .ptr = hists_to_evsel(hists),
405 perf_hpp__for_each_format(fmt) {
407 fprintf(fp, "%s", sep ?: " ");
411 fmt->header(fmt, &dummy_hpp);
412 fprintf(fp, "%s", bf);
415 list_for_each_entry(se, &hist_entry__sort_list, list) {
419 fprintf(fp, "%c%s", *sep, se->se_header);
422 width = strlen(se->se_header);
423 if (symbol_conf.col_width_list_str) {
425 hists__set_col_len(hists, se->se_width_idx,
427 col_width = strchr(col_width, ',');
432 if (!hists__new_col_len(hists, se->se_width_idx, width))
433 width = hists__col_len(hists, se->se_width_idx);
434 fprintf(fp, " %*s", width, se->se_header);
438 if (max_rows && ++nr_rows >= max_rows)
448 perf_hpp__for_each_format(fmt) {
452 fprintf(fp, "%s", sep ?: " ");
456 width = fmt->width(fmt, &dummy_hpp);
457 for (i = 0; i < width; i++)
461 list_for_each_entry(se, &hist_entry__sort_list, list) {
468 width = hists__col_len(hists, se->se_width_idx);
470 width = strlen(se->se_header);
471 for (i = 0; i < width; i++)
476 if (max_rows && ++nr_rows >= max_rows)
480 if (max_rows && ++nr_rows >= max_rows)
484 linesz = hists__sort_list_width(hists) + 3 + 1;
485 line = malloc(linesz);
491 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
492 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
493 float percent = h->stat.period * 100.0 /
494 hists->stats.total_period;
499 if (percent < min_pcnt)
502 ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp);
504 if (max_rows && ++nr_rows >= max_rows)
507 if (h->ms.map == NULL && verbose > 1) {
508 __map_groups__fprintf_maps(&h->thread->mg,
509 MAP__FUNCTION, verbose, fp);
510 fprintf(fp, "%.10s end\n", graph_dotted_line);
516 free(rem_sq_bracket);
521 size_t events_stats__fprintf(struct events_stats *stats, FILE *fp)
526 for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
529 if (stats->nr_events[i] == 0)
532 name = perf_event__name(i);
533 if (!strcmp(name, "UNKNOWN"))
536 ret += fprintf(fp, "%16s events: %10d\n", name,
537 stats->nr_events[i]);