Commit | Line | Data |
---|---|---|
7ccf4f90 | 1 | #include <stdio.h> |
7ccf4f90 NK |
2 | |
3 | #include "../../util/util.h" | |
4 | #include "../../util/hist.h" | |
5 | #include "../../util/sort.h" | |
5b9e2146 | 6 | #include "../../util/evsel.h" |
7ccf4f90 NK |
7 | |
8 | ||
9 | static 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 | ||
20 | static 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 | ||
5ab250ca NK |
37 | static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node, |
38 | struct callchain_list *chain, | |
7ccf4f90 | 39 | int depth, int depth_mask, int period, |
5ab250ca | 40 | u64 total_samples, int left_margin) |
7ccf4f90 NK |
41 | { |
42 | int i; | |
43 | size_t ret = 0; | |
2989ccaa | 44 | char bf[1024]; |
7ccf4f90 NK |
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) { | |
5ab250ca NK |
53 | ret += fprintf(fp, "--"); |
54 | ret += callchain_node__fprintf_value(node, fp, total_samples); | |
55 | ret += fprintf(fp, "--"); | |
7ccf4f90 NK |
56 | } else |
57 | ret += fprintf(fp, "%s", " "); | |
58 | } | |
2989ccaa AK |
59 | fputs(callchain_list__sym_name(chain, bf, sizeof(bf), false), fp); |
60 | fputc('\n', fp); | |
7ccf4f90 NK |
61 | return ret; |
62 | } | |
63 | ||
64 | static struct symbol *rem_sq_bracket; | |
65 | static struct callchain_list rem_hits; | |
66 | ||
67 | static 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 | ||
79 | static 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; | |
f2af0086 | 84 | struct callchain_node *child = NULL; |
7ccf4f90 NK |
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; | |
f2af0086 | 91 | int cumul_count = 0; |
7ccf4f90 NK |
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; | |
f2af0086 | 103 | cumul_count += callchain_cumul_counts(child); |
7ccf4f90 NK |
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) { | |
5ab250ca | 124 | ret += ipchain__fprintf_graph(fp, child, chain, depth, |
7ccf4f90 NK |
125 | new_depth_mask, i++, |
126 | total_samples, | |
7ccf4f90 NK |
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) { | |
5ab250ca NK |
146 | struct callchain_node rem_node = { |
147 | .hit = remaining, | |
148 | }; | |
7ccf4f90 NK |
149 | |
150 | if (!rem_sq_bracket) | |
151 | return ret; | |
152 | ||
f2af0086 NK |
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 | ||
7ccf4f90 | 159 | new_depth_mask &= ~(1 << (depth - 1)); |
5ab250ca | 160 | ret += ipchain__fprintf_graph(fp, &rem_node, &rem_hits, depth, |
7ccf4f90 | 161 | new_depth_mask, 0, total_samples, |
5ab250ca | 162 | left_margin); |
7ccf4f90 NK |
163 | } |
164 | ||
165 | return ret; | |
166 | } | |
167 | ||
7ed5d6e2 NK |
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 | */ | |
176 | static 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 | ||
7ccf4f90 | 187 | static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, |
54d27b31 NK |
188 | u64 total_samples, u64 parent_samples, |
189 | int left_margin) | |
7ccf4f90 NK |
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; | |
2989ccaa | 198 | char bf[1024]; |
7ccf4f90 | 199 | |
7ccf4f90 | 200 | node = rb_first(root); |
7ed5d6e2 | 201 | if (node && !need_percent_display(node, parent_samples)) { |
7ccf4f90 NK |
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 | */ | |
cfaa154b NK |
209 | if (!i++ && field_order == NULL && |
210 | sort_order && !prefixcmp(sort_order, "sym")) | |
7ccf4f90 NK |
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 | ||
2989ccaa AK |
222 | ret += fprintf(fp, "%s\n", callchain_list__sym_name(chain, bf, sizeof(bf), |
223 | false)); | |
7ccf4f90 NK |
224 | |
225 | if (++entries_printed == callchain_param.print_limit) | |
226 | break; | |
227 | } | |
228 | root = &cnode->rb_root; | |
229 | } | |
230 | ||
54d27b31 NK |
231 | if (callchain_param.mode == CHAIN_GRAPH_REL) |
232 | total_samples = parent_samples; | |
233 | ||
7ccf4f90 NK |
234 | ret += __callchain__fprintf_graph(fp, root, total_samples, |
235 | 1, 1, left_margin); | |
3848c23b NK |
236 | if (ret) { |
237 | /* do not add a blank line if it printed nothing */ | |
238 | ret += fprintf(fp, "\n"); | |
239 | } | |
7ccf4f90 NK |
240 | |
241 | return ret; | |
242 | } | |
243 | ||
316c7136 | 244 | static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node, |
7ccf4f90 NK |
245 | u64 total_samples) |
246 | { | |
247 | struct callchain_list *chain; | |
248 | size_t ret = 0; | |
2989ccaa | 249 | char bf[1024]; |
7ccf4f90 | 250 | |
316c7136 | 251 | if (!node) |
7ccf4f90 NK |
252 | return 0; |
253 | ||
316c7136 | 254 | ret += __callchain__fprintf_flat(fp, node->parent, total_samples); |
7ccf4f90 NK |
255 | |
256 | ||
316c7136 | 257 | list_for_each_entry(chain, &node->val, list) { |
7ccf4f90 NK |
258 | if (chain->ip >= PERF_CONTEXT_MAX) |
259 | continue; | |
2989ccaa AK |
260 | ret += fprintf(fp, " %s\n", callchain_list__sym_name(chain, |
261 | bf, sizeof(bf), false)); | |
7ccf4f90 NK |
262 | } |
263 | ||
264 | return ret; | |
265 | } | |
266 | ||
316c7136 | 267 | static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, |
7ccf4f90 NK |
268 | u64 total_samples) |
269 | { | |
270 | size_t ret = 0; | |
271 | u32 entries_printed = 0; | |
7ccf4f90 | 272 | struct callchain_node *chain; |
316c7136 | 273 | struct rb_node *rb_node = rb_first(tree); |
7ccf4f90 | 274 | |
7ccf4f90 | 275 | while (rb_node) { |
7ccf4f90 | 276 | chain = rb_entry(rb_node, struct callchain_node, rb_node); |
7ccf4f90 | 277 | |
5ab250ca NK |
278 | ret += fprintf(fp, " "); |
279 | ret += callchain_node__fprintf_value(chain, fp, total_samples); | |
280 | ret += fprintf(fp, "\n"); | |
7ccf4f90 NK |
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 | ||
26e77924 NK |
292 | static 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 | ||
318 | static 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) { | |
26e77924 NK |
327 | |
328 | chain = rb_entry(rb_node, struct callchain_node, rb_node); | |
26e77924 | 329 | |
5ab250ca NK |
330 | ret += callchain_node__fprintf_value(chain, fp, total_samples); |
331 | ret += fprintf(fp, " "); | |
26e77924 NK |
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 | ||
7ccf4f90 NK |
343 | static size_t hist_entry_callchain__fprintf(struct hist_entry *he, |
344 | u64 total_samples, int left_margin, | |
345 | FILE *fp) | |
346 | { | |
54d27b31 NK |
347 | u64 parent_samples = he->stat.period; |
348 | ||
349 | if (symbol_conf.cumulate_callchain) | |
350 | parent_samples = he->stat_acc->period; | |
351 | ||
7ccf4f90 NK |
352 | switch (callchain_param.mode) { |
353 | case CHAIN_GRAPH_REL: | |
54d27b31 NK |
354 | return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, |
355 | parent_samples, left_margin); | |
7ccf4f90 NK |
356 | break; |
357 | case CHAIN_GRAPH_ABS: | |
358 | return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, | |
54d27b31 | 359 | parent_samples, left_margin); |
7ccf4f90 NK |
360 | break; |
361 | case CHAIN_FLAT: | |
362 | return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples); | |
363 | break; | |
26e77924 NK |
364 | case CHAIN_FOLDED: |
365 | return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples); | |
366 | break; | |
7ccf4f90 NK |
367 | case CHAIN_NONE: |
368 | break; | |
369 | default: | |
370 | pr_err("Bad callchain mode\n"); | |
371 | } | |
372 | ||
373 | return 0; | |
374 | } | |
375 | ||
26d8b338 | 376 | static int hist_entry__snprintf(struct hist_entry *he, struct perf_hpp *hpp) |
be0e6d10 JO |
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 | ||
f0786af5 | 387 | hists__for_each_format(he->hists, fmt) { |
361459f1 | 388 | if (perf_hpp__should_skip(fmt, he->hists)) |
e67d49a7 NK |
389 | continue; |
390 | ||
be0e6d10 JO |
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 | ||
9754c4f9 | 401 | if (perf_hpp__use_color() && fmt->color) |
be0e6d10 JO |
402 | ret = fmt->color(fmt, hpp, he); |
403 | else | |
404 | ret = fmt->entry(fmt, hpp, he); | |
405 | ||
89fee709 | 406 | ret = hist_entry__snprintf_alignment(he, hpp, fmt, ret); |
be0e6d10 JO |
407 | advance_hpp(hpp, ret); |
408 | } | |
409 | ||
410 | return hpp->buf - start; | |
411 | } | |
412 | ||
ef86d68a NK |
413 | static int hist_entry__hierarchy_fprintf(struct hist_entry *he, |
414 | struct perf_hpp *hpp, | |
2dbbe9f2 | 415 | struct hists *hists, |
ef86d68a NK |
416 | FILE *fp) |
417 | { | |
418 | const char *sep = symbol_conf.field_sep; | |
419 | struct perf_hpp_fmt *fmt; | |
f58c95e3 | 420 | struct perf_hpp_list_node *fmt_node; |
ef86d68a | 421 | char *buf = hpp->buf; |
cb1fab91 | 422 | size_t size = hpp->size; |
ef86d68a NK |
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 | ||
f58c95e3 NK |
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) { | |
ef86d68a NK |
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 | ||
1b2dbbf4 | 455 | if (!sep) |
ef86d68a | 456 | ret = scnprintf(hpp->buf, hpp->size, "%*s", |
2dbbe9f2 | 457 | (hists->nr_hpp_node - 2) * HIERARCHY_INDENT, ""); |
ef86d68a NK |
458 | advance_hpp(hpp, ret); |
459 | ||
cb1fab91 NK |
460 | printed += fprintf(fp, "%s", buf); |
461 | ||
1b2dbbf4 NK |
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); | |
ef86d68a NK |
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 | ||
490 | out: | |
491 | return printed; | |
492 | } | |
493 | ||
7ccf4f90 | 494 | static int hist_entry__fprintf(struct hist_entry *he, size_t size, |
99cf666c ACM |
495 | struct hists *hists, |
496 | char *bf, size_t bfsz, FILE *fp) | |
7ccf4f90 | 497 | { |
7ccf4f90 | 498 | int ret; |
ea251d51 NK |
499 | struct perf_hpp hpp = { |
500 | .buf = bf, | |
501 | .size = size, | |
ea251d51 | 502 | }; |
7e597d32 | 503 | u64 total_period = hists->stats.total_period; |
7ccf4f90 | 504 | |
99cf666c ACM |
505 | if (size == 0 || size > bfsz) |
506 | size = hpp.size = bfsz; | |
7ccf4f90 | 507 | |
2dbbe9f2 NK |
508 | if (symbol_conf.report_hierarchy) |
509 | return hist_entry__hierarchy_fprintf(he, &hpp, hists, fp); | |
ef86d68a | 510 | |
26d8b338 | 511 | hist_entry__snprintf(he, &hpp); |
7ccf4f90 | 512 | |
000078bc | 513 | ret = fprintf(fp, "%s\n", bf); |
7ccf4f90 | 514 | |
000078bc | 515 | if (symbol_conf.use_callchain) |
7e597d32 | 516 | ret += hist_entry_callchain__fprintf(he, total_period, 0, fp); |
7ccf4f90 | 517 | |
000078bc | 518 | return ret; |
7ccf4f90 NK |
519 | } |
520 | ||
2dbbe9f2 | 521 | static int print_hierarchy_indent(const char *sep, int indent, |
8e2fc44f NK |
522 | const char *line, FILE *fp) |
523 | { | |
2dbbe9f2 | 524 | if (sep != NULL || indent < 2) |
8e2fc44f NK |
525 | return 0; |
526 | ||
2dbbe9f2 | 527 | return fprintf(fp, "%-.*s", (indent - 2) * HIERARCHY_INDENT, line); |
8e2fc44f NK |
528 | } |
529 | ||
530 | static int print_hierarchy_header(struct hists *hists, struct perf_hpp *hpp, | |
531 | const char *sep, FILE *fp) | |
532 | { | |
f58c95e3 | 533 | bool first_node, first_col; |
2dbbe9f2 | 534 | int indent; |
cb1fab91 | 535 | int depth; |
8e2fc44f NK |
536 | unsigned width = 0; |
537 | unsigned header_width = 0; | |
538 | struct perf_hpp_fmt *fmt; | |
f58c95e3 | 539 | struct perf_hpp_list_node *fmt_node; |
8e2fc44f | 540 | |
2dbbe9f2 | 541 | indent = hists->nr_hpp_node; |
8e2fc44f NK |
542 | |
543 | /* preserve max indent depth for column headers */ | |
2dbbe9f2 | 544 | print_hierarchy_indent(sep, indent, spaces, fp); |
8e2fc44f | 545 | |
f58c95e3 NK |
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); | |
8e2fc44f | 549 | |
f58c95e3 | 550 | perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) { |
8e2fc44f | 551 | fmt->header(fmt, hpp, hists_to_evsel(hists)); |
f58c95e3 | 552 | fprintf(fp, "%s%s", hpp->buf, sep ?: " "); |
8e2fc44f NK |
553 | } |
554 | ||
555 | /* combine sort headers with ' / ' */ | |
f58c95e3 NK |
556 | first_node = true; |
557 | list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) { | |
558 | if (!first_node) | |
8e2fc44f | 559 | header_width += fprintf(fp, " / "); |
f58c95e3 | 560 | first_node = false; |
8e2fc44f | 561 | |
f58c95e3 NK |
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); | |
8e2fc44f | 573 | |
f58c95e3 NK |
574 | header_width += fprintf(fp, "%s", ltrim(hpp->buf)); |
575 | } | |
8e2fc44f NK |
576 | } |
577 | ||
8e2fc44f NK |
578 | fprintf(fp, "\n# "); |
579 | ||
580 | /* preserve max indent depth for initial dots */ | |
2dbbe9f2 | 581 | print_hierarchy_indent(sep, indent, dots, fp); |
8e2fc44f | 582 | |
f58c95e3 NK |
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); | |
8e2fc44f | 586 | |
f58c95e3 NK |
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; | |
8e2fc44f NK |
592 | |
593 | width = fmt->width(fmt, hpp, hists_to_evsel(hists)); | |
594 | fprintf(fp, "%.*s", width, dots); | |
595 | } | |
596 | ||
cb1fab91 | 597 | depth = 0; |
f58c95e3 NK |
598 | list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) { |
599 | first_col = true; | |
600 | width = depth * HIERARCHY_INDENT; | |
8e2fc44f | 601 | |
f58c95e3 NK |
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 | } | |
cb1fab91 | 612 | |
8e2fc44f NK |
613 | if (width > header_width) |
614 | header_width = width; | |
cb1fab91 NK |
615 | |
616 | depth++; | |
8e2fc44f NK |
617 | } |
618 | ||
619 | fprintf(fp, "%s%-.*s", sep ?: " ", header_width, dots); | |
620 | ||
8e2fc44f NK |
621 | fprintf(fp, "\n#\n"); |
622 | ||
623 | return 2; | |
624 | } | |
625 | ||
41724e4c | 626 | size_t hists__fprintf(struct hists *hists, bool show_header, int max_rows, |
064f1981 | 627 | int max_cols, float min_pcnt, FILE *fp) |
7ccf4f90 | 628 | { |
1240005e | 629 | struct perf_hpp_fmt *fmt; |
f58c95e3 | 630 | struct perf_hpp_list_node *fmt_node; |
7ccf4f90 NK |
631 | struct rb_node *nd; |
632 | size_t ret = 0; | |
7ccf4f90 NK |
633 | unsigned int width; |
634 | const char *sep = symbol_conf.field_sep; | |
1240005e | 635 | int nr_rows = 0; |
ed279da2 | 636 | char bf[96]; |
ea251d51 NK |
637 | struct perf_hpp dummy_hpp = { |
638 | .buf = bf, | |
639 | .size = sizeof(bf), | |
ea251d51 | 640 | }; |
5395a048 | 641 | bool first = true; |
99cf666c ACM |
642 | size_t linesz; |
643 | char *line = NULL; | |
bd4abd39 | 644 | unsigned indent; |
7ccf4f90 NK |
645 | |
646 | init_rem_hits(); | |
647 | ||
f0786af5 | 648 | hists__for_each_format(hists, fmt) |
678a500d | 649 | perf_hpp__reset_width(fmt, hists); |
26d8b338 | 650 | |
5b591669 NK |
651 | if (symbol_conf.col_width_list_str) |
652 | perf_hpp__set_user_width(symbol_conf.col_width_list_str); | |
653 | ||
26d8b338 NK |
654 | if (!show_header) |
655 | goto print_entries; | |
656 | ||
657 | fprintf(fp, "# "); | |
658 | ||
8e2fc44f | 659 | if (symbol_conf.report_hierarchy) { |
f58c95e3 NK |
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 | } | |
8e2fc44f NK |
664 | nr_rows += print_hierarchy_header(hists, &dummy_hpp, sep, fp); |
665 | goto print_entries; | |
666 | } | |
667 | ||
f0786af5 | 668 | hists__for_each_format(hists, fmt) { |
361459f1 | 669 | if (perf_hpp__should_skip(fmt, hists)) |
e67d49a7 NK |
670 | continue; |
671 | ||
26d8b338 NK |
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); | |
7ccf4f90 NK |
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 | ||
5395a048 JO |
688 | first = true; |
689 | ||
ea251d51 | 690 | fprintf(fp, "# "); |
ea251d51 | 691 | |
f0786af5 | 692 | hists__for_each_format(hists, fmt) { |
1240005e | 693 | unsigned int i; |
ea251d51 | 694 | |
361459f1 | 695 | if (perf_hpp__should_skip(fmt, hists)) |
e67d49a7 NK |
696 | continue; |
697 | ||
5395a048 | 698 | if (!first) |
ea251d51 | 699 | fprintf(fp, "%s", sep ?: " "); |
5395a048 JO |
700 | else |
701 | first = false; | |
ea251d51 | 702 | |
94a0793d | 703 | width = fmt->width(fmt, &dummy_hpp, hists_to_evsel(hists)); |
ea251d51 NK |
704 | for (i = 0; i < width; i++) |
705 | fprintf(fp, "."); | |
7ccf4f90 | 706 | } |
ea251d51 | 707 | |
7ccf4f90 NK |
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 | ||
716 | print_entries: | |
99cf666c | 717 | linesz = hists__sort_list_width(hists) + 3 + 1; |
9754c4f9 | 718 | linesz += perf_hpp__color_overhead(); |
99cf666c ACM |
719 | line = malloc(linesz); |
720 | if (line == NULL) { | |
721 | ret = -1; | |
722 | goto out; | |
723 | } | |
724 | ||
bd4abd39 NK |
725 | indent = hists__overhead_width(hists) + 4; |
726 | ||
ef86d68a | 727 | for (nd = rb_first(&hists->entries); nd; nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD)) { |
7ccf4f90 | 728 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); |
14135663 | 729 | float percent; |
7ccf4f90 NK |
730 | |
731 | if (h->filtered) | |
732 | continue; | |
733 | ||
14135663 | 734 | percent = hist_entry__get_percent_limit(h); |
064f1981 NK |
735 | if (percent < min_pcnt) |
736 | continue; | |
737 | ||
99cf666c | 738 | ret += hist_entry__fprintf(h, max_cols, hists, line, linesz, fp); |
7ccf4f90 | 739 | |
7ccf4f90 | 740 | if (max_rows && ++nr_rows >= max_rows) |
99cf666c | 741 | break; |
7ccf4f90 | 742 | |
bd4abd39 NK |
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)) { | |
f58c95e3 | 748 | int depth = hists->nr_hpp_node + h->depth + 1; |
bd4abd39 | 749 | |
f58c95e3 | 750 | print_hierarchy_indent(sep, depth, spaces, fp); |
bd4abd39 NK |
751 | fprintf(fp, "%*sno entry >= %.2f%%\n", indent, "", min_pcnt); |
752 | ||
753 | if (max_rows && ++nr_rows >= max_rows) | |
754 | break; | |
755 | } | |
756 | ||
7ccf4f90 | 757 | if (h->ms.map == NULL && verbose > 1) { |
93d5731d | 758 | __map_groups__fprintf_maps(h->thread->mg, |
acebd408 | 759 | MAP__FUNCTION, fp); |
7ccf4f90 NK |
760 | fprintf(fp, "%.10s end\n", graph_dotted_line); |
761 | } | |
762 | } | |
99cf666c ACM |
763 | |
764 | free(line); | |
7ccf4f90 | 765 | out: |
74cf249d | 766 | zfree(&rem_sq_bracket); |
7ccf4f90 NK |
767 | |
768 | return ret; | |
769 | } | |
770 | ||
52168eea | 771 | size_t events_stats__fprintf(struct events_stats *stats, FILE *fp) |
7ccf4f90 NK |
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 | ||
52168eea | 779 | if (stats->nr_events[i] == 0) |
7ccf4f90 NK |
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, | |
52168eea | 787 | stats->nr_events[i]); |
7ccf4f90 NK |
788 | } |
789 | ||
790 | return ret; | |
791 | } |