diff options
author | Namhyung Kim <namhyung.kim@lge.com> | 2012-08-20 00:52:05 -0400 |
---|---|---|
committer | Arnaldo Carvalho de Melo <acme@redhat.com> | 2012-08-20 08:46:34 -0400 |
commit | 7ccf4f9058ecff6eec11a271001d08d9024da8c0 (patch) | |
tree | 084f4942d6f75375afbf091012bcf4fd1678024d /tools/perf/ui/stdio/hist.c | |
parent | ed7e2c2ec59422b68b643c479a5816197620016e (diff) |
perf hists: Separate out hist print functions
Separate out those functions into ui/stdio/hist.c. This is required for
upcoming changes.
Signed-off-by: Namhyung Kim <namhyung@kernel.org>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Link: http://lkml.kernel.org/r/1345438331-20234-2-git-send-email-namhyung@kernel.org
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
Diffstat (limited to 'tools/perf/ui/stdio/hist.c')
-rw-r--r-- | tools/perf/ui/stdio/hist.c | 648 |
1 files changed, 648 insertions, 0 deletions
diff --git a/tools/perf/ui/stdio/hist.c b/tools/perf/ui/stdio/hist.c new file mode 100644 index 000000000000..7881d625e17a --- /dev/null +++ b/tools/perf/ui/stdio/hist.c | |||
@@ -0,0 +1,648 @@ | |||
1 | #include <stdio.h> | ||
2 | #include <math.h> | ||
3 | |||
4 | #include "../../util/util.h" | ||
5 | #include "../../util/hist.h" | ||
6 | #include "../../util/sort.h" | ||
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 | |||
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, | ||
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 | |||
67 | static struct symbol *rem_sq_bracket; | ||
68 | static struct callchain_list rem_hits; | ||
69 | |||
70 | static 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 | |||
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) | ||
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 | |||
161 | static 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 | |||
216 | static size_t __callchain__fprintf_flat(FILE *fp, | ||
217 | struct callchain_node *self, | ||
218 | u64 total_samples) | ||
219 | { | ||
220 | struct callchain_list *chain; | ||
221 | size_t ret = 0; | ||
222 | |||
223 | if (!self) | ||
224 | return 0; | ||
225 | |||
226 | ret += __callchain__fprintf_flat(fp, self->parent, total_samples); | ||
227 | |||
228 | |||
229 | list_for_each_entry(chain, &self->val, list) { | ||
230 | if (chain->ip >= PERF_CONTEXT_MAX) | ||
231 | continue; | ||
232 | if (chain->ms.sym) | ||
233 | ret += fprintf(fp, " %s\n", chain->ms.sym->name); | ||
234 | else | ||
235 | ret += fprintf(fp, " %p\n", | ||
236 | (void *)(long)chain->ip); | ||
237 | } | ||
238 | |||
239 | return ret; | ||
240 | } | ||
241 | |||
242 | static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *self, | ||
243 | u64 total_samples) | ||
244 | { | ||
245 | size_t ret = 0; | ||
246 | u32 entries_printed = 0; | ||
247 | struct rb_node *rb_node; | ||
248 | struct callchain_node *chain; | ||
249 | |||
250 | rb_node = rb_first(self); | ||
251 | while (rb_node) { | ||
252 | double percent; | ||
253 | |||
254 | chain = rb_entry(rb_node, struct callchain_node, rb_node); | ||
255 | percent = chain->hit * 100.0 / total_samples; | ||
256 | |||
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) | ||
261 | break; | ||
262 | |||
263 | rb_node = rb_next(rb_node); | ||
264 | } | ||
265 | |||
266 | return ret; | ||
267 | } | ||
268 | |||
269 | static size_t hist_entry_callchain__fprintf(struct hist_entry *he, | ||
270 | u64 total_samples, int left_margin, | ||
271 | FILE *fp) | ||
272 | { | ||
273 | switch (callchain_param.mode) { | ||
274 | case CHAIN_GRAPH_REL: | ||
275 | return callchain__fprintf_graph(fp, &he->sorted_chain, he->period, | ||
276 | left_margin); | ||
277 | break; | ||
278 | case CHAIN_GRAPH_ABS: | ||
279 | return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, | ||
280 | left_margin); | ||
281 | break; | ||
282 | case CHAIN_FLAT: | ||
283 | return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples); | ||
284 | break; | ||
285 | case CHAIN_NONE: | ||
286 | break; | ||
287 | default: | ||
288 | pr_err("Bad callchain mode\n"); | ||
289 | } | ||
290 | |||
291 | return 0; | ||
292 | } | ||
293 | |||
294 | static int hist_entry__pcnt_snprintf(struct hist_entry *he, char *s, | ||
295 | size_t size, struct hists *pair_hists, | ||
296 | bool show_displacement, long displacement, | ||
297 | bool color, u64 total_period) | ||
298 | { | ||
299 | u64 period, total, period_sys, period_us, period_guest_sys, period_guest_us; | ||
300 | u64 nr_events; | ||
301 | const char *sep = symbol_conf.field_sep; | ||
302 | int ret; | ||
303 | |||
304 | if (symbol_conf.exclude_other && !he->parent) | ||
305 | return 0; | ||
306 | |||
307 | if (pair_hists) { | ||
308 | period = he->pair ? he->pair->period : 0; | ||
309 | nr_events = he->pair ? he->pair->nr_events : 0; | ||
310 | total = pair_hists->stats.total_period; | ||
311 | period_sys = he->pair ? he->pair->period_sys : 0; | ||
312 | period_us = he->pair ? he->pair->period_us : 0; | ||
313 | period_guest_sys = he->pair ? he->pair->period_guest_sys : 0; | ||
314 | period_guest_us = he->pair ? he->pair->period_guest_us : 0; | ||
315 | } else { | ||
316 | period = he->period; | ||
317 | nr_events = he->nr_events; | ||
318 | total = total_period; | ||
319 | period_sys = he->period_sys; | ||
320 | period_us = he->period_us; | ||
321 | period_guest_sys = he->period_guest_sys; | ||
322 | period_guest_us = he->period_guest_us; | ||
323 | } | ||
324 | |||
325 | if (total) { | ||
326 | if (color) | ||
327 | ret = percent_color_snprintf(s, size, | ||
328 | sep ? "%.2f" : " %6.2f%%", | ||
329 | (period * 100.0) / total); | ||
330 | else | ||
331 | ret = scnprintf(s, size, sep ? "%.2f" : " %6.2f%%", | ||
332 | (period * 100.0) / total); | ||
333 | if (symbol_conf.show_cpu_utilization) { | ||
334 | ret += percent_color_snprintf(s + ret, size - ret, | ||
335 | sep ? "%.2f" : " %6.2f%%", | ||
336 | (period_sys * 100.0) / total); | ||
337 | ret += percent_color_snprintf(s + ret, size - ret, | ||
338 | sep ? "%.2f" : " %6.2f%%", | ||
339 | (period_us * 100.0) / total); | ||
340 | if (perf_guest) { | ||
341 | ret += percent_color_snprintf(s + ret, | ||
342 | size - ret, | ||
343 | sep ? "%.2f" : " %6.2f%%", | ||
344 | (period_guest_sys * 100.0) / | ||
345 | total); | ||
346 | ret += percent_color_snprintf(s + ret, | ||
347 | size - ret, | ||
348 | sep ? "%.2f" : " %6.2f%%", | ||
349 | (period_guest_us * 100.0) / | ||
350 | total); | ||
351 | } | ||
352 | } | ||
353 | } else | ||
354 | ret = scnprintf(s, size, sep ? "%" PRIu64 : "%12" PRIu64 " ", period); | ||
355 | |||
356 | if (symbol_conf.show_nr_samples) { | ||
357 | if (sep) | ||
358 | ret += scnprintf(s + ret, size - ret, "%c%" PRIu64, *sep, nr_events); | ||
359 | else | ||
360 | ret += scnprintf(s + ret, size - ret, "%11" PRIu64, nr_events); | ||
361 | } | ||
362 | |||
363 | if (symbol_conf.show_total_period) { | ||
364 | if (sep) | ||
365 | ret += scnprintf(s + ret, size - ret, "%c%" PRIu64, *sep, period); | ||
366 | else | ||
367 | ret += scnprintf(s + ret, size - ret, " %12" PRIu64, period); | ||
368 | } | ||
369 | |||
370 | if (pair_hists) { | ||
371 | char bf[32]; | ||
372 | double old_percent = 0, new_percent = 0, diff; | ||
373 | |||
374 | if (total > 0) | ||
375 | old_percent = (period * 100.0) / total; | ||
376 | if (total_period > 0) | ||
377 | new_percent = (he->period * 100.0) / total_period; | ||
378 | |||
379 | diff = new_percent - old_percent; | ||
380 | |||
381 | if (fabs(diff) >= 0.01) | ||
382 | scnprintf(bf, sizeof(bf), "%+4.2F%%", diff); | ||
383 | else | ||
384 | scnprintf(bf, sizeof(bf), " "); | ||
385 | |||
386 | if (sep) | ||
387 | ret += scnprintf(s + ret, size - ret, "%c%s", *sep, bf); | ||
388 | else | ||
389 | ret += scnprintf(s + ret, size - ret, "%11.11s", bf); | ||
390 | |||
391 | if (show_displacement) { | ||
392 | if (displacement) | ||
393 | scnprintf(bf, sizeof(bf), "%+4ld", displacement); | ||
394 | else | ||
395 | scnprintf(bf, sizeof(bf), " "); | ||
396 | |||
397 | if (sep) | ||
398 | ret += scnprintf(s + ret, size - ret, "%c%s", *sep, bf); | ||
399 | else | ||
400 | ret += scnprintf(s + ret, size - ret, "%6.6s", bf); | ||
401 | } | ||
402 | } | ||
403 | |||
404 | return ret; | ||
405 | } | ||
406 | |||
407 | int hist_entry__snprintf(struct hist_entry *he, char *s, size_t size, | ||
408 | struct hists *hists) | ||
409 | { | ||
410 | const char *sep = symbol_conf.field_sep; | ||
411 | struct sort_entry *se; | ||
412 | int ret = 0; | ||
413 | |||
414 | list_for_each_entry(se, &hist_entry__sort_list, list) { | ||
415 | if (se->elide) | ||
416 | continue; | ||
417 | |||
418 | ret += scnprintf(s + ret, size - ret, "%s", sep ?: " "); | ||
419 | ret += se->se_snprintf(he, s + ret, size - ret, | ||
420 | hists__col_len(hists, se->se_width_idx)); | ||
421 | } | ||
422 | |||
423 | return ret; | ||
424 | } | ||
425 | |||
426 | static int hist_entry__fprintf(struct hist_entry *he, size_t size, | ||
427 | struct hists *hists, struct hists *pair_hists, | ||
428 | bool show_displacement, long displacement, | ||
429 | u64 total_period, FILE *fp) | ||
430 | { | ||
431 | char bf[512]; | ||
432 | int ret; | ||
433 | |||
434 | if (size == 0 || size > sizeof(bf)) | ||
435 | size = sizeof(bf); | ||
436 | |||
437 | ret = hist_entry__pcnt_snprintf(he, bf, size, pair_hists, | ||
438 | show_displacement, displacement, | ||
439 | true, total_period); | ||
440 | hist_entry__snprintf(he, bf + ret, size - ret, hists); | ||
441 | return fprintf(fp, "%s\n", bf); | ||
442 | } | ||
443 | |||
444 | static size_t hist_entry__fprintf_callchain(struct hist_entry *he, | ||
445 | struct hists *hists, | ||
446 | u64 total_period, FILE *fp) | ||
447 | { | ||
448 | int left_margin = 0; | ||
449 | |||
450 | if (sort__first_dimension == SORT_COMM) { | ||
451 | struct sort_entry *se = list_first_entry(&hist_entry__sort_list, | ||
452 | typeof(*se), list); | ||
453 | left_margin = hists__col_len(hists, se->se_width_idx); | ||
454 | left_margin -= thread__comm_len(he->thread); | ||
455 | } | ||
456 | |||
457 | return hist_entry_callchain__fprintf(he, total_period, left_margin, fp); | ||
458 | } | ||
459 | |||
460 | size_t hists__fprintf(struct hists *hists, struct hists *pair, | ||
461 | bool show_displacement, bool show_header, int max_rows, | ||
462 | int max_cols, FILE *fp) | ||
463 | { | ||
464 | struct sort_entry *se; | ||
465 | struct rb_node *nd; | ||
466 | size_t ret = 0; | ||
467 | u64 total_period; | ||
468 | unsigned long position = 1; | ||
469 | long displacement = 0; | ||
470 | unsigned int width; | ||
471 | const char *sep = symbol_conf.field_sep; | ||
472 | const char *col_width = symbol_conf.col_width_list_str; | ||
473 | int nr_rows = 0; | ||
474 | |||
475 | init_rem_hits(); | ||
476 | |||
477 | if (!show_header) | ||
478 | goto print_entries; | ||
479 | |||
480 | fprintf(fp, "# %s", pair ? "Baseline" : "Overhead"); | ||
481 | |||
482 | if (symbol_conf.show_cpu_utilization) { | ||
483 | if (sep) { | ||
484 | ret += fprintf(fp, "%csys", *sep); | ||
485 | ret += fprintf(fp, "%cus", *sep); | ||
486 | if (perf_guest) { | ||
487 | ret += fprintf(fp, "%cguest sys", *sep); | ||
488 | ret += fprintf(fp, "%cguest us", *sep); | ||
489 | } | ||
490 | } else { | ||
491 | ret += fprintf(fp, " sys "); | ||
492 | ret += fprintf(fp, " us "); | ||
493 | if (perf_guest) { | ||
494 | ret += fprintf(fp, " guest sys "); | ||
495 | ret += fprintf(fp, " guest us "); | ||
496 | } | ||
497 | } | ||
498 | } | ||
499 | |||
500 | if (symbol_conf.show_nr_samples) { | ||
501 | if (sep) | ||
502 | fprintf(fp, "%cSamples", *sep); | ||
503 | else | ||
504 | fputs(" Samples ", fp); | ||
505 | } | ||
506 | |||
507 | if (symbol_conf.show_total_period) { | ||
508 | if (sep) | ||
509 | ret += fprintf(fp, "%cPeriod", *sep); | ||
510 | else | ||
511 | ret += fprintf(fp, " Period "); | ||
512 | } | ||
513 | |||
514 | if (pair) { | ||
515 | if (sep) | ||
516 | ret += fprintf(fp, "%cDelta", *sep); | ||
517 | else | ||
518 | ret += fprintf(fp, " Delta "); | ||
519 | |||
520 | if (show_displacement) { | ||
521 | if (sep) | ||
522 | ret += fprintf(fp, "%cDisplacement", *sep); | ||
523 | else | ||
524 | ret += fprintf(fp, " Displ"); | ||
525 | } | ||
526 | } | ||
527 | |||
528 | list_for_each_entry(se, &hist_entry__sort_list, list) { | ||
529 | if (se->elide) | ||
530 | continue; | ||
531 | if (sep) { | ||
532 | fprintf(fp, "%c%s", *sep, se->se_header); | ||
533 | continue; | ||
534 | } | ||
535 | width = strlen(se->se_header); | ||
536 | if (symbol_conf.col_width_list_str) { | ||
537 | if (col_width) { | ||
538 | hists__set_col_len(hists, se->se_width_idx, | ||
539 | atoi(col_width)); | ||
540 | col_width = strchr(col_width, ','); | ||
541 | if (col_width) | ||
542 | ++col_width; | ||
543 | } | ||
544 | } | ||
545 | if (!hists__new_col_len(hists, se->se_width_idx, width)) | ||
546 | width = hists__col_len(hists, se->se_width_idx); | ||
547 | fprintf(fp, " %*s", width, se->se_header); | ||
548 | } | ||
549 | |||
550 | fprintf(fp, "\n"); | ||
551 | if (max_rows && ++nr_rows >= max_rows) | ||
552 | goto out; | ||
553 | |||
554 | if (sep) | ||
555 | goto print_entries; | ||
556 | |||
557 | fprintf(fp, "# ........"); | ||
558 | if (symbol_conf.show_cpu_utilization) | ||
559 | fprintf(fp, " ....... ......."); | ||
560 | if (symbol_conf.show_nr_samples) | ||
561 | fprintf(fp, " .........."); | ||
562 | if (symbol_conf.show_total_period) | ||
563 | fprintf(fp, " ............"); | ||
564 | if (pair) { | ||
565 | fprintf(fp, " .........."); | ||
566 | if (show_displacement) | ||
567 | fprintf(fp, " ....."); | ||
568 | } | ||
569 | list_for_each_entry(se, &hist_entry__sort_list, list) { | ||
570 | unsigned int i; | ||
571 | |||
572 | if (se->elide) | ||
573 | continue; | ||
574 | |||
575 | fprintf(fp, " "); | ||
576 | width = hists__col_len(hists, se->se_width_idx); | ||
577 | if (width == 0) | ||
578 | width = strlen(se->se_header); | ||
579 | for (i = 0; i < width; i++) | ||
580 | fprintf(fp, "."); | ||
581 | } | ||
582 | |||
583 | fprintf(fp, "\n"); | ||
584 | if (max_rows && ++nr_rows >= max_rows) | ||
585 | goto out; | ||
586 | |||
587 | fprintf(fp, "#\n"); | ||
588 | if (max_rows && ++nr_rows >= max_rows) | ||
589 | goto out; | ||
590 | |||
591 | print_entries: | ||
592 | total_period = hists->stats.total_period; | ||
593 | |||
594 | for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { | ||
595 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | ||
596 | |||
597 | if (h->filtered) | ||
598 | continue; | ||
599 | |||
600 | if (show_displacement) { | ||
601 | if (h->pair != NULL) | ||
602 | displacement = ((long)h->pair->position - | ||
603 | (long)position); | ||
604 | else | ||
605 | displacement = 0; | ||
606 | ++position; | ||
607 | } | ||
608 | ret += hist_entry__fprintf(h, max_cols, hists, pair, show_displacement, | ||
609 | displacement, total_period, fp); | ||
610 | |||
611 | if (symbol_conf.use_callchain) | ||
612 | ret += hist_entry__fprintf_callchain(h, hists, total_period, fp); | ||
613 | if (max_rows && ++nr_rows >= max_rows) | ||
614 | goto out; | ||
615 | |||
616 | if (h->ms.map == NULL && verbose > 1) { | ||
617 | __map_groups__fprintf_maps(&h->thread->mg, | ||
618 | MAP__FUNCTION, verbose, fp); | ||
619 | fprintf(fp, "%.10s end\n", graph_dotted_line); | ||
620 | } | ||
621 | } | ||
622 | out: | ||
623 | free(rem_sq_bracket); | ||
624 | |||
625 | return ret; | ||
626 | } | ||
627 | |||
628 | size_t hists__fprintf_nr_events(struct hists *hists, FILE *fp) | ||
629 | { | ||
630 | int i; | ||
631 | size_t ret = 0; | ||
632 | |||
633 | for (i = 0; i < PERF_RECORD_HEADER_MAX; ++i) { | ||
634 | const char *name; | ||
635 | |||
636 | if (hists->stats.nr_events[i] == 0) | ||
637 | continue; | ||
638 | |||
639 | name = perf_event__name(i); | ||
640 | if (!strcmp(name, "UNKNOWN")) | ||
641 | continue; | ||
642 | |||
643 | ret += fprintf(fp, "%16s events: %10d\n", name, | ||
644 | hists->stats.nr_events[i]); | ||
645 | } | ||
646 | |||
647 | return ret; | ||
648 | } | ||