Loading...
1#include <stdio.h>
2
3#include "../../util/util.h"
4#include "../../util/hist.h"
5#include "../../util/sort.h"
6#include "../../util/evsel.h"
7
8
9static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
10{
11 int i;
12 int ret = fprintf(fp, " ");
13
14 for (i = 0; i < left_margin; i++)
15 ret += fprintf(fp, " ");
16
17 return ret;
18}
19
20static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
21 int left_margin)
22{
23 int i;
24 size_t ret = callchain__fprintf_left_margin(fp, left_margin);
25
26 for (i = 0; i < depth; i++)
27 if (depth_mask & (1 << i))
28 ret += fprintf(fp, "| ");
29 else
30 ret += fprintf(fp, " ");
31
32 ret += fprintf(fp, "\n");
33
34 return ret;
35}
36
37static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node,
38 struct callchain_list *chain,
39 int depth, int depth_mask, int period,
40 u64 total_samples, int left_margin)
41{
42 int i;
43 size_t ret = 0;
44 char bf[1024];
45
46 ret += callchain__fprintf_left_margin(fp, left_margin);
47 for (i = 0; i < depth; i++) {
48 if (depth_mask & (1 << i))
49 ret += fprintf(fp, "|");
50 else
51 ret += fprintf(fp, " ");
52 if (!period && i == depth - 1) {
53 ret += fprintf(fp, "--");
54 ret += callchain_node__fprintf_value(node, fp, total_samples);
55 ret += fprintf(fp, "--");
56 } else
57 ret += fprintf(fp, "%s", " ");
58 }
59 fputs(callchain_list__sym_name(chain, bf, sizeof(bf), false), fp);
60 fputc('\n', fp);
61 return ret;
62}
63
64static struct symbol *rem_sq_bracket;
65static struct callchain_list rem_hits;
66
67static void init_rem_hits(void)
68{
69 rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
70 if (!rem_sq_bracket) {
71 fprintf(stderr, "Not enough memory to display remaining hits\n");
72 return;
73 }
74
75 strcpy(rem_sq_bracket->name, "[...]");
76 rem_hits.ms.sym = rem_sq_bracket;
77}
78
79static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root,
80 u64 total_samples, int depth,
81 int depth_mask, int left_margin)
82{
83 struct rb_node *node, *next;
84 struct callchain_node *child = NULL;
85 struct callchain_list *chain;
86 int new_depth_mask = depth_mask;
87 u64 remaining;
88 size_t ret = 0;
89 int i;
90 uint entries_printed = 0;
91 int cumul_count = 0;
92
93 remaining = total_samples;
94
95 node = rb_first(root);
96 while (node) {
97 u64 new_total;
98 u64 cumul;
99
100 child = rb_entry(node, struct callchain_node, rb_node);
101 cumul = callchain_cumul_hits(child);
102 remaining -= cumul;
103 cumul_count += callchain_cumul_counts(child);
104
105 /*
106 * The depth mask manages the output of pipes that show
107 * the depth. We don't want to keep the pipes of the current
108 * level for the last child of this depth.
109 * Except if we have remaining filtered hits. They will
110 * supersede the last child
111 */
112 next = rb_next(node);
113 if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
114 new_depth_mask &= ~(1 << (depth - 1));
115
116 /*
117 * But we keep the older depth mask for the line separator
118 * to keep the level link until we reach the last child
119 */
120 ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
121 left_margin);
122 i = 0;
123 list_for_each_entry(chain, &child->val, list) {
124 ret += ipchain__fprintf_graph(fp, child, chain, depth,
125 new_depth_mask, i++,
126 total_samples,
127 left_margin);
128 }
129
130 if (callchain_param.mode == CHAIN_GRAPH_REL)
131 new_total = child->children_hit;
132 else
133 new_total = total_samples;
134
135 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
136 depth + 1,
137 new_depth_mask | (1 << depth),
138 left_margin);
139 node = next;
140 if (++entries_printed == callchain_param.print_limit)
141 break;
142 }
143
144 if (callchain_param.mode == CHAIN_GRAPH_REL &&
145 remaining && remaining != total_samples) {
146 struct callchain_node rem_node = {
147 .hit = remaining,
148 };
149
150 if (!rem_sq_bracket)
151 return ret;
152
153 if (callchain_param.value == CCVAL_COUNT && child && child->parent) {
154 rem_node.count = child->parent->children_count - cumul_count;
155 if (rem_node.count <= 0)
156 return ret;
157 }
158
159 new_depth_mask &= ~(1 << (depth - 1));
160 ret += ipchain__fprintf_graph(fp, &rem_node, &rem_hits, depth,
161 new_depth_mask, 0, total_samples,
162 left_margin);
163 }
164
165 return ret;
166}
167
168/*
169 * If have one single callchain root, don't bother printing
170 * its percentage (100 % in fractal mode and the same percentage
171 * than the hist in graph mode). This also avoid one level of column.
172 *
173 * However when percent-limit applied, it's possible that single callchain
174 * node have different (non-100% in fractal mode) percentage.
175 */
176static bool need_percent_display(struct rb_node *node, u64 parent_samples)
177{
178 struct callchain_node *cnode;
179
180 if (rb_next(node))
181 return true;
182
183 cnode = rb_entry(node, struct callchain_node, rb_node);
184 return callchain_cumul_hits(cnode) != parent_samples;
185}
186
187static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root,
188 u64 total_samples, u64 parent_samples,
189 int left_margin)
190{
191 struct callchain_node *cnode;
192 struct callchain_list *chain;
193 u32 entries_printed = 0;
194 bool printed = false;
195 struct rb_node *node;
196 int i = 0;
197 int ret = 0;
198 char bf[1024];
199
200 node = rb_first(root);
201 if (node && !need_percent_display(node, parent_samples)) {
202 cnode = rb_entry(node, struct callchain_node, rb_node);
203 list_for_each_entry(chain, &cnode->val, list) {
204 /*
205 * If we sort by symbol, the first entry is the same than
206 * the symbol. No need to print it otherwise it appears as
207 * displayed twice.
208 */
209 if (!i++ && field_order == NULL &&
210 sort_order && !prefixcmp(sort_order, "sym"))
211 continue;
212 if (!printed) {
213 ret += callchain__fprintf_left_margin(fp, left_margin);
214 ret += fprintf(fp, "|\n");
215 ret += callchain__fprintf_left_margin(fp, left_margin);
216 ret += fprintf(fp, "---");
217 left_margin += 3;
218 printed = true;
219 } else
220 ret += callchain__fprintf_left_margin(fp, left_margin);
221
222 ret += fprintf(fp, "%s\n", callchain_list__sym_name(chain, bf, sizeof(bf),
223 false));
224
225 if (++entries_printed == callchain_param.print_limit)
226 break;
227 }
228 root = &cnode->rb_root;
229 }
230
231 if (callchain_param.mode == CHAIN_GRAPH_REL)
232 total_samples = parent_samples;
233
234 ret += __callchain__fprintf_graph(fp, root, total_samples,
235 1, 1, left_margin);
236 if (ret) {
237 /* do not add a blank line if it printed nothing */
238 ret += fprintf(fp, "\n");
239 }
240
241 return ret;
242}
243
244static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node,
245 u64 total_samples)
246{
247 struct callchain_list *chain;
248 size_t ret = 0;
249 char bf[1024];
250
251 if (!node)
252 return 0;
253
254 ret += __callchain__fprintf_flat(fp, node->parent, total_samples);
255
256
257 list_for_each_entry(chain, &node->val, list) {
258 if (chain->ip >= PERF_CONTEXT_MAX)
259 continue;
260 ret += fprintf(fp, " %s\n", callchain_list__sym_name(chain,
261 bf, sizeof(bf), false));
262 }
263
264 return ret;
265}
266
267static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree,
268 u64 total_samples)
269{
270 size_t ret = 0;
271 u32 entries_printed = 0;
272 struct callchain_node *chain;
273 struct rb_node *rb_node = rb_first(tree);
274
275 while (rb_node) {
276 chain = rb_entry(rb_node, struct callchain_node, rb_node);
277
278 ret += fprintf(fp, " ");
279 ret += callchain_node__fprintf_value(chain, fp, total_samples);
280 ret += fprintf(fp, "\n");
281 ret += __callchain__fprintf_flat(fp, chain, total_samples);
282 ret += fprintf(fp, "\n");
283 if (++entries_printed == callchain_param.print_limit)
284 break;
285
286 rb_node = rb_next(rb_node);
287 }
288
289 return ret;
290}
291
292static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node)
293{
294 const char *sep = symbol_conf.field_sep ?: ";";
295 struct callchain_list *chain;
296 size_t ret = 0;
297 char bf[1024];
298 bool first;
299
300 if (!node)
301 return 0;
302
303 ret += __callchain__fprintf_folded(fp, node->parent);
304
305 first = (ret == 0);
306 list_for_each_entry(chain, &node->val, list) {
307 if (chain->ip >= PERF_CONTEXT_MAX)
308 continue;
309 ret += fprintf(fp, "%s%s", first ? "" : sep,
310 callchain_list__sym_name(chain,
311 bf, sizeof(bf), false));
312 first = false;
313 }
314
315 return ret;
316}
317
318static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree,
319 u64 total_samples)
320{
321 size_t ret = 0;
322 u32 entries_printed = 0;
323 struct callchain_node *chain;
324 struct rb_node *rb_node = rb_first(tree);
325
326 while (rb_node) {
327
328 chain = rb_entry(rb_node, struct callchain_node, rb_node);
329
330 ret += callchain_node__fprintf_value(chain, fp, total_samples);
331 ret += fprintf(fp, " ");
332 ret += __callchain__fprintf_folded(fp, chain);
333 ret += fprintf(fp, "\n");
334 if (++entries_printed == callchain_param.print_limit)
335 break;
336
337 rb_node = rb_next(rb_node);
338 }
339
340 return ret;
341}
342
343static size_t hist_entry_callchain__fprintf(struct hist_entry *he,
344 u64 total_samples, int left_margin,
345 FILE *fp)
346{
347 u64 parent_samples = he->stat.period;
348
349 if (symbol_conf.cumulate_callchain)
350 parent_samples = he->stat_acc->period;
351
352 switch (callchain_param.mode) {
353 case CHAIN_GRAPH_REL:
354 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
355 parent_samples, left_margin);
356 break;
357 case CHAIN_GRAPH_ABS:
358 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
359 parent_samples, left_margin);
360 break;
361 case CHAIN_FLAT:
362 return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
363 break;
364 case CHAIN_FOLDED:
365 return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples);
366 break;
367 case CHAIN_NONE:
368 break;
369 default:
370 pr_err("Bad callchain mode\n");
371 }
372
373 return 0;
374}
375
376static int hist_entry__snprintf(struct hist_entry *he, struct perf_hpp *hpp)
377{
378 const char *sep = symbol_conf.field_sep;
379 struct perf_hpp_fmt *fmt;
380 char *start = hpp->buf;
381 int ret;
382 bool first = true;
383
384 if (symbol_conf.exclude_other && !he->parent)
385 return 0;
386
387 hists__for_each_format(he->hists, fmt) {
388 if (perf_hpp__should_skip(fmt, he->hists))
389 continue;
390
391 /*
392 * If there's no field_sep, we still need
393 * to display initial ' '.
394 */
395 if (!sep || !first) {
396 ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: " ");
397 advance_hpp(hpp, ret);
398 } else
399 first = false;
400
401 if (perf_hpp__use_color() && fmt->color)
402 ret = fmt->color(fmt, hpp, he);
403 else
404 ret = fmt->entry(fmt, hpp, he);
405
406 ret = hist_entry__snprintf_alignment(he, hpp, fmt, ret);
407 advance_hpp(hpp, ret);
408 }
409
410 return hpp->buf - start;
411}
412
413static int hist_entry__hierarchy_fprintf(struct hist_entry *he,
414 struct perf_hpp *hpp,
415 struct hists *hists,
416 FILE *fp)
417{
418 const char *sep = symbol_conf.field_sep;
419 struct perf_hpp_fmt *fmt;
420 struct perf_hpp_list_node *fmt_node;
421 char *buf = hpp->buf;
422 size_t size = hpp->size;
423 int ret, printed = 0;
424 bool first = true;
425
426 if (symbol_conf.exclude_other && !he->parent)
427 return 0;
428
429 ret = scnprintf(hpp->buf, hpp->size, "%*s", he->depth * HIERARCHY_INDENT, "");
430 advance_hpp(hpp, ret);
431
432 /* the first hpp_list_node is for overhead columns */
433 fmt_node = list_first_entry(&hists->hpp_formats,
434 struct perf_hpp_list_node, list);
435 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
436 /*
437 * If there's no field_sep, we still need
438 * to display initial ' '.
439 */
440 if (!sep || !first) {
441 ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: " ");
442 advance_hpp(hpp, ret);
443 } else
444 first = false;
445
446 if (perf_hpp__use_color() && fmt->color)
447 ret = fmt->color(fmt, hpp, he);
448 else
449 ret = fmt->entry(fmt, hpp, he);
450
451 ret = hist_entry__snprintf_alignment(he, hpp, fmt, ret);
452 advance_hpp(hpp, ret);
453 }
454
455 if (!sep)
456 ret = scnprintf(hpp->buf, hpp->size, "%*s",
457 (hists->nr_hpp_node - 2) * HIERARCHY_INDENT, "");
458 advance_hpp(hpp, ret);
459
460 printed += fprintf(fp, "%s", buf);
461
462 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
463 hpp->buf = buf;
464 hpp->size = size;
465
466 /*
467 * No need to call hist_entry__snprintf_alignment() since this
468 * fmt is always the last column in the hierarchy mode.
469 */
470 if (perf_hpp__use_color() && fmt->color)
471 fmt->color(fmt, hpp, he);
472 else
473 fmt->entry(fmt, hpp, he);
474
475 /*
476 * dynamic entries are right-aligned but we want left-aligned
477 * in the hierarchy mode
478 */
479 printed += fprintf(fp, "%s%s", sep ?: " ", ltrim(buf));
480 }
481 printed += putc('\n', fp);
482
483 if (symbol_conf.use_callchain && he->leaf) {
484 u64 total = hists__total_period(hists);
485
486 printed += hist_entry_callchain__fprintf(he, total, 0, fp);
487 goto out;
488 }
489
490out:
491 return printed;
492}
493
494static int hist_entry__fprintf(struct hist_entry *he, size_t size,
495 struct hists *hists,
496 char *bf, size_t bfsz, FILE *fp)
497{
498 int ret;
499 struct perf_hpp hpp = {
500 .buf = bf,
501 .size = size,
502 };
503 u64 total_period = hists->stats.total_period;
504
505 if (size == 0 || size > bfsz)
506 size = hpp.size = bfsz;
507
508 if (symbol_conf.report_hierarchy)
509 return hist_entry__hierarchy_fprintf(he, &hpp, hists, fp);
510
511 hist_entry__snprintf(he, &hpp);
512
513 ret = fprintf(fp, "%s\n", bf);
514
515 if (symbol_conf.use_callchain)
516 ret += hist_entry_callchain__fprintf(he, total_period, 0, fp);
517
518 return ret;
519}
520
521static int print_hierarchy_indent(const char *sep, int indent,
522 const char *line, FILE *fp)
523{
524 if (sep != NULL || indent < 2)
525 return 0;
526
527 return fprintf(fp, "%-.*s", (indent - 2) * HIERARCHY_INDENT, line);
528}
529
530static int print_hierarchy_header(struct hists *hists, struct perf_hpp *hpp,
531 const char *sep, FILE *fp)
532{
533 bool first_node, first_col;
534 int indent;
535 int depth;
536 unsigned width = 0;
537 unsigned header_width = 0;
538 struct perf_hpp_fmt *fmt;
539 struct perf_hpp_list_node *fmt_node;
540
541 indent = hists->nr_hpp_node;
542
543 /* preserve max indent depth for column headers */
544 print_hierarchy_indent(sep, indent, spaces, fp);
545
546 /* the first hpp_list_node is for overhead columns */
547 fmt_node = list_first_entry(&hists->hpp_formats,
548 struct perf_hpp_list_node, list);
549
550 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
551 fmt->header(fmt, hpp, hists_to_evsel(hists));
552 fprintf(fp, "%s%s", hpp->buf, sep ?: " ");
553 }
554
555 /* combine sort headers with ' / ' */
556 first_node = true;
557 list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) {
558 if (!first_node)
559 header_width += fprintf(fp, " / ");
560 first_node = false;
561
562 first_col = true;
563 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
564 if (perf_hpp__should_skip(fmt, hists))
565 continue;
566
567 if (!first_col)
568 header_width += fprintf(fp, "+");
569 first_col = false;
570
571 fmt->header(fmt, hpp, hists_to_evsel(hists));
572 rtrim(hpp->buf);
573
574 header_width += fprintf(fp, "%s", ltrim(hpp->buf));
575 }
576 }
577
578 fprintf(fp, "\n# ");
579
580 /* preserve max indent depth for initial dots */
581 print_hierarchy_indent(sep, indent, dots, fp);
582
583 /* the first hpp_list_node is for overhead columns */
584 fmt_node = list_first_entry(&hists->hpp_formats,
585 struct perf_hpp_list_node, list);
586
587 first_col = true;
588 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
589 if (!first_col)
590 fprintf(fp, "%s", sep ?: "..");
591 first_col = false;
592
593 width = fmt->width(fmt, hpp, hists_to_evsel(hists));
594 fprintf(fp, "%.*s", width, dots);
595 }
596
597 depth = 0;
598 list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) {
599 first_col = true;
600 width = depth * HIERARCHY_INDENT;
601
602 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
603 if (perf_hpp__should_skip(fmt, hists))
604 continue;
605
606 if (!first_col)
607 width++; /* for '+' sign between column header */
608 first_col = false;
609
610 width += fmt->width(fmt, hpp, hists_to_evsel(hists));
611 }
612
613 if (width > header_width)
614 header_width = width;
615
616 depth++;
617 }
618
619 fprintf(fp, "%s%-.*s", sep ?: " ", header_width, dots);
620
621 fprintf(fp, "\n#\n");
622
623 return 2;
624}
625
626size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
627 int max_cols, float min_pcnt, FILE *fp)
628{
629 struct perf_hpp_fmt *fmt;
630 struct perf_hpp_list_node *fmt_node;
631 struct rb_node *nd;
632 size_t ret = 0;
633 unsigned int width;
634 const char *sep = symbol_conf.field_sep;
635 int nr_rows = 0;
636 char bf[96];
637 struct perf_hpp dummy_hpp = {
638 .buf = bf,
639 .size = sizeof(bf),
640 };
641 bool first = true;
642 size_t linesz;
643 char *line = NULL;
644 unsigned indent;
645
646 init_rem_hits();
647
648 hists__for_each_format(hists, fmt)
649 perf_hpp__reset_width(fmt, hists);
650
651 if (symbol_conf.col_width_list_str)
652 perf_hpp__set_user_width(symbol_conf.col_width_list_str);
653
654 if (!show_header)
655 goto print_entries;
656
657 fprintf(fp, "# ");
658
659 if (symbol_conf.report_hierarchy) {
660 list_for_each_entry(fmt_node, &hists->hpp_formats, list) {
661 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt)
662 perf_hpp__reset_width(fmt, hists);
663 }
664 nr_rows += print_hierarchy_header(hists, &dummy_hpp, sep, fp);
665 goto print_entries;
666 }
667
668 hists__for_each_format(hists, fmt) {
669 if (perf_hpp__should_skip(fmt, hists))
670 continue;
671
672 if (!first)
673 fprintf(fp, "%s", sep ?: " ");
674 else
675 first = false;
676
677 fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
678 fprintf(fp, "%s", bf);
679 }
680
681 fprintf(fp, "\n");
682 if (max_rows && ++nr_rows >= max_rows)
683 goto out;
684
685 if (sep)
686 goto print_entries;
687
688 first = true;
689
690 fprintf(fp, "# ");
691
692 hists__for_each_format(hists, fmt) {
693 unsigned int i;
694
695 if (perf_hpp__should_skip(fmt, hists))
696 continue;
697
698 if (!first)
699 fprintf(fp, "%s", sep ?: " ");
700 else
701 first = false;
702
703 width = fmt->width(fmt, &dummy_hpp, hists_to_evsel(hists));
704 for (i = 0; i < width; i++)
705 fprintf(fp, ".");
706 }
707
708 fprintf(fp, "\n");
709 if (max_rows && ++nr_rows >= max_rows)
710 goto out;
711
712 fprintf(fp, "#\n");
713 if (max_rows && ++nr_rows >= max_rows)
714 goto out;
715
716print_entries:
717 linesz = hists__sort_list_width(hists) + 3 + 1;
718 linesz += perf_hpp__color_overhead();
719 line = malloc(linesz);
720 if (line == NULL) {
721 ret = -1;
722 goto out;
723 }
724
725 indent = hists__overhead_width(hists) + 4;
726
727 for (nd = rb_first(&hists->entries); nd; nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD)) {
728 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
729 float percent;
730
731 if (h->filtered)
732 continue;
733
734 percent = hist_entry__get_percent_limit(h);
735 if (percent < min_pcnt)
736 continue;
737
738 ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp);
739
740 if (max_rows && ++nr_rows >= max_rows)
741 break;
742
743 /*
744 * If all children are filtered out or percent-limited,
745 * display "no entry >= x.xx%" message.
746 */
747 if (!h->leaf && !hist_entry__has_hierarchy_children(h, min_pcnt)) {
748 int depth = hists->nr_hpp_node + h->depth + 1;
749
750 print_hierarchy_indent(sep, depth, spaces, fp);
751 fprintf(fp, "%*sno entry >= %.2f%%\n", indent, "", min_pcnt);
752
753 if (max_rows && ++nr_rows >= max_rows)
754 break;
755 }
756
757 if (h->ms.map == NULL && verbose > 1) {
758 __map_groups__fprintf_maps(h->thread->mg,
759 MAP__FUNCTION, fp);
760 fprintf(fp, "%.10s end\n", graph_dotted_line);
761 }
762 }
763
764 free(line);
765out:
766 zfree(&rem_sq_bracket);
767
768 return ret;
769}
770
771size_t events_stats__fprintf(struct events_stats *stats, FILE *fp)
772{
773 int i;
774 size_t ret = 0;
775
776 for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
777 const char *name;
778
779 if (stats->nr_events[i] == 0)
780 continue;
781
782 name = perf_event__name(i);
783 if (!strcmp(name, "UNKNOWN"))
784 continue;
785
786 ret += fprintf(fp, "%16s events: %10d\n", name,
787 stats->nr_events[i]);
788 }
789
790 return ret;
791}
1#include <stdio.h>
2
3#include "../../util/util.h"
4#include "../../util/hist.h"
5#include "../../util/sort.h"
6#include "../../util/evsel.h"
7
8
9static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
10{
11 int i;
12 int ret = fprintf(fp, " ");
13
14 for (i = 0; i < left_margin; i++)
15 ret += fprintf(fp, " ");
16
17 return ret;
18}
19
20static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
21 int left_margin)
22{
23 int i;
24 size_t ret = callchain__fprintf_left_margin(fp, left_margin);
25
26 for (i = 0; i < depth; i++)
27 if (depth_mask & (1 << i))
28 ret += fprintf(fp, "| ");
29 else
30 ret += fprintf(fp, " ");
31
32 ret += fprintf(fp, "\n");
33
34 return ret;
35}
36
37static 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,
40 int left_margin)
41{
42 int i;
43 size_t ret = 0;
44
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, "|");
49 else
50 ret += fprintf(fp, " ");
51 if (!period && i == depth - 1) {
52 double percent;
53
54 percent = hits * 100.0 / total_samples;
55 ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
56 } else
57 ret += fprintf(fp, "%s", " ");
58 }
59 if (chain->ms.sym)
60 ret += fprintf(fp, "%s\n", chain->ms.sym->name);
61 else
62 ret += fprintf(fp, "0x%0" PRIx64 "\n", chain->ip);
63
64 return ret;
65}
66
67static struct symbol *rem_sq_bracket;
68static struct callchain_list rem_hits;
69
70static void init_rem_hits(void)
71{
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");
75 return;
76 }
77
78 strcpy(rem_sq_bracket->name, "[...]");
79 rem_hits.ms.sym = rem_sq_bracket;
80}
81
82static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root,
83 u64 total_samples, int depth,
84 int depth_mask, int left_margin)
85{
86 struct rb_node *node, *next;
87 struct callchain_node *child;
88 struct callchain_list *chain;
89 int new_depth_mask = depth_mask;
90 u64 remaining;
91 size_t ret = 0;
92 int i;
93 uint entries_printed = 0;
94
95 remaining = total_samples;
96
97 node = rb_first(root);
98 while (node) {
99 u64 new_total;
100 u64 cumul;
101
102 child = rb_entry(node, struct callchain_node, rb_node);
103 cumul = callchain_cumul_hits(child);
104 remaining -= cumul;
105
106 /*
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
112 */
113 next = rb_next(node);
114 if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
115 new_depth_mask &= ~(1 << (depth - 1));
116
117 /*
118 * But we keep the older depth mask for the line separator
119 * to keep the level link until we reach the last child
120 */
121 ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
122 left_margin);
123 i = 0;
124 list_for_each_entry(chain, &child->val, list) {
125 ret += ipchain__fprintf_graph(fp, chain, depth,
126 new_depth_mask, i++,
127 total_samples,
128 cumul,
129 left_margin);
130 }
131
132 if (callchain_param.mode == CHAIN_GRAPH_REL)
133 new_total = child->children_hit;
134 else
135 new_total = total_samples;
136
137 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
138 depth + 1,
139 new_depth_mask | (1 << depth),
140 left_margin);
141 node = next;
142 if (++entries_printed == callchain_param.print_limit)
143 break;
144 }
145
146 if (callchain_param.mode == CHAIN_GRAPH_REL &&
147 remaining && remaining != total_samples) {
148
149 if (!rem_sq_bracket)
150 return ret;
151
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);
156 }
157
158 return ret;
159}
160
161static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root,
162 u64 total_samples, int left_margin)
163{
164 struct callchain_node *cnode;
165 struct callchain_list *chain;
166 u32 entries_printed = 0;
167 bool printed = false;
168 struct rb_node *node;
169 int i = 0;
170 int ret = 0;
171
172 /*
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.
176 */
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) {
181 /*
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
184 * displayed twice.
185 */
186 if (!i++ && sort__first_dimension == SORT_SYM)
187 continue;
188 if (!printed) {
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, "---");
193 left_margin += 3;
194 printed = true;
195 } else
196 ret += callchain__fprintf_left_margin(fp, left_margin);
197
198 if (chain->ms.sym)
199 ret += fprintf(fp, " %s\n", chain->ms.sym->name);
200 else
201 ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
202
203 if (++entries_printed == callchain_param.print_limit)
204 break;
205 }
206 root = &cnode->rb_root;
207 }
208
209 ret += __callchain__fprintf_graph(fp, root, total_samples,
210 1, 1, left_margin);
211 ret += fprintf(fp, "\n");
212
213 return ret;
214}
215
216static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node,
217 u64 total_samples)
218{
219 struct callchain_list *chain;
220 size_t ret = 0;
221
222 if (!node)
223 return 0;
224
225 ret += __callchain__fprintf_flat(fp, node->parent, total_samples);
226
227
228 list_for_each_entry(chain, &node->val, list) {
229 if (chain->ip >= PERF_CONTEXT_MAX)
230 continue;
231 if (chain->ms.sym)
232 ret += fprintf(fp, " %s\n", chain->ms.sym->name);
233 else
234 ret += fprintf(fp, " %p\n",
235 (void *)(long)chain->ip);
236 }
237
238 return ret;
239}
240
241static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree,
242 u64 total_samples)
243{
244 size_t ret = 0;
245 u32 entries_printed = 0;
246 struct callchain_node *chain;
247 struct rb_node *rb_node = rb_first(tree);
248
249 while (rb_node) {
250 double percent;
251
252 chain = rb_entry(rb_node, struct callchain_node, rb_node);
253 percent = chain->hit * 100.0 / total_samples;
254
255 ret = percent_color_fprintf(fp, " %6.2f%%\n", percent);
256 ret += __callchain__fprintf_flat(fp, chain, total_samples);
257 ret += fprintf(fp, "\n");
258 if (++entries_printed == callchain_param.print_limit)
259 break;
260
261 rb_node = rb_next(rb_node);
262 }
263
264 return ret;
265}
266
267static size_t hist_entry_callchain__fprintf(struct hist_entry *he,
268 u64 total_samples, int left_margin,
269 FILE *fp)
270{
271 switch (callchain_param.mode) {
272 case CHAIN_GRAPH_REL:
273 return callchain__fprintf_graph(fp, &he->sorted_chain, he->stat.period,
274 left_margin);
275 break;
276 case CHAIN_GRAPH_ABS:
277 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples,
278 left_margin);
279 break;
280 case CHAIN_FLAT:
281 return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples);
282 break;
283 case CHAIN_NONE:
284 break;
285 default:
286 pr_err("Bad callchain mode\n");
287 }
288
289 return 0;
290}
291
292static size_t hist_entry__callchain_fprintf(struct hist_entry *he,
293 struct hists *hists,
294 FILE *fp)
295{
296 int left_margin = 0;
297 u64 total_period = hists->stats.total_period;
298
299 if (sort__first_dimension == SORT_COMM) {
300 struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
301 typeof(*se), list);
302 left_margin = hists__col_len(hists, se->se_width_idx);
303 left_margin -= thread__comm_len(he->thread);
304 }
305
306 return hist_entry_callchain__fprintf(he, total_period, left_margin, fp);
307}
308
309static int hist_entry__period_snprintf(struct perf_hpp *hpp,
310 struct hist_entry *he)
311{
312 const char *sep = symbol_conf.field_sep;
313 struct perf_hpp_fmt *fmt;
314 char *start = hpp->buf;
315 int ret;
316 bool first = true;
317
318 if (symbol_conf.exclude_other && !he->parent)
319 return 0;
320
321 perf_hpp__for_each_format(fmt) {
322 /*
323 * If there's no field_sep, we still need
324 * to display initial ' '.
325 */
326 if (!sep || !first) {
327 ret = scnprintf(hpp->buf, hpp->size, "%s", sep ?: " ");
328 advance_hpp(hpp, ret);
329 } else
330 first = false;
331
332 if (perf_hpp__use_color() && fmt->color)
333 ret = fmt->color(fmt, hpp, he);
334 else
335 ret = fmt->entry(fmt, hpp, he);
336
337 advance_hpp(hpp, ret);
338 }
339
340 return hpp->buf - start;
341}
342
343static int hist_entry__fprintf(struct hist_entry *he, size_t size,
344 struct hists *hists,
345 char *bf, size_t bfsz, FILE *fp)
346{
347 int ret;
348 struct perf_hpp hpp = {
349 .buf = bf,
350 .size = size,
351 };
352
353 if (size == 0 || size > bfsz)
354 size = hpp.size = bfsz;
355
356 ret = hist_entry__period_snprintf(&hpp, he);
357 hist_entry__sort_snprintf(he, bf + ret, size - ret, hists);
358
359 ret = fprintf(fp, "%s\n", bf);
360
361 if (symbol_conf.use_callchain)
362 ret += hist_entry__callchain_fprintf(he, hists, fp);
363
364 return ret;
365}
366
367size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows,
368 int max_cols, float min_pcnt, FILE *fp)
369{
370 struct perf_hpp_fmt *fmt;
371 struct sort_entry *se;
372 struct rb_node *nd;
373 size_t ret = 0;
374 unsigned int width;
375 const char *sep = symbol_conf.field_sep;
376 const char *col_width = symbol_conf.col_width_list_str;
377 int nr_rows = 0;
378 char bf[96];
379 struct perf_hpp dummy_hpp = {
380 .buf = bf,
381 .size = sizeof(bf),
382 };
383 bool first = true;
384 size_t linesz;
385 char *line = NULL;
386
387 init_rem_hits();
388
389 if (!show_header)
390 goto print_entries;
391
392 fprintf(fp, "# ");
393
394 perf_hpp__for_each_format(fmt) {
395 if (!first)
396 fprintf(fp, "%s", sep ?: " ");
397 else
398 first = false;
399
400 fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
401 fprintf(fp, "%s", bf);
402 }
403
404 list_for_each_entry(se, &hist_entry__sort_list, list) {
405 if (se->elide)
406 continue;
407 if (sep) {
408 fprintf(fp, "%c%s", *sep, se->se_header);
409 continue;
410 }
411 width = strlen(se->se_header);
412 if (symbol_conf.col_width_list_str) {
413 if (col_width) {
414 hists__set_col_len(hists, se->se_width_idx,
415 atoi(col_width));
416 col_width = strchr(col_width, ',');
417 if (col_width)
418 ++col_width;
419 }
420 }
421 if (!hists__new_col_len(hists, se->se_width_idx, width))
422 width = hists__col_len(hists, se->se_width_idx);
423 fprintf(fp, " %*s", width, se->se_header);
424 }
425
426 fprintf(fp, "\n");
427 if (max_rows && ++nr_rows >= max_rows)
428 goto out;
429
430 if (sep)
431 goto print_entries;
432
433 first = true;
434
435 fprintf(fp, "# ");
436
437 perf_hpp__for_each_format(fmt) {
438 unsigned int i;
439
440 if (!first)
441 fprintf(fp, "%s", sep ?: " ");
442 else
443 first = false;
444
445 width = fmt->width(fmt, &dummy_hpp, hists_to_evsel(hists));
446 for (i = 0; i < width; i++)
447 fprintf(fp, ".");
448 }
449
450 list_for_each_entry(se, &hist_entry__sort_list, list) {
451 unsigned int i;
452
453 if (se->elide)
454 continue;
455
456 fprintf(fp, " ");
457 width = hists__col_len(hists, se->se_width_idx);
458 if (width == 0)
459 width = strlen(se->se_header);
460 for (i = 0; i < width; i++)
461 fprintf(fp, ".");
462 }
463
464 fprintf(fp, "\n");
465 if (max_rows && ++nr_rows >= max_rows)
466 goto out;
467
468 fprintf(fp, "#\n");
469 if (max_rows && ++nr_rows >= max_rows)
470 goto out;
471
472print_entries:
473 linesz = hists__sort_list_width(hists) + 3 + 1;
474 linesz += perf_hpp__color_overhead();
475 line = malloc(linesz);
476 if (line == NULL) {
477 ret = -1;
478 goto out;
479 }
480
481 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
482 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
483 float percent = h->stat.period * 100.0 /
484 hists->stats.total_period;
485
486 if (h->filtered)
487 continue;
488
489 if (percent < min_pcnt)
490 continue;
491
492 ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp);
493
494 if (max_rows && ++nr_rows >= max_rows)
495 break;
496
497 if (h->ms.map == NULL && verbose > 1) {
498 __map_groups__fprintf_maps(&h->thread->mg,
499 MAP__FUNCTION, verbose, fp);
500 fprintf(fp, "%.10s end\n", graph_dotted_line);
501 }
502 }
503
504 free(line);
505out:
506 zfree(&rem_sq_bracket);
507
508 return ret;
509}
510
511size_t events_stats__fprintf(struct events_stats *stats, FILE *fp)
512{
513 int i;
514 size_t ret = 0;
515
516 for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) {
517 const char *name;
518
519 if (stats->nr_events[i] == 0)
520 continue;
521
522 name = perf_event__name(i);
523 if (!strcmp(name, "UNKNOWN"))
524 continue;
525
526 ret += fprintf(fp, "%16s events: %10d\n", name,
527 stats->nr_events[i]);
528 }
529
530 return ret;
531}