a46d093324623007b482d215819c98858f1e5d38
[sfrench/cifs-2.6.git] / tools / perf / util / hist.c
1 #include "hist.h"
2 #include "session.h"
3 #include "sort.h"
4 #include <math.h>
5
6 struct callchain_param  callchain_param = {
7         .mode   = CHAIN_GRAPH_REL,
8         .min_percent = 0.5
9 };
10
11 /*
12  * histogram, sorted on item, collects counts
13  */
14
15 struct hist_entry *__perf_session__add_hist_entry(struct rb_root *hists,
16                                                   struct addr_location *al,
17                                                   struct symbol *sym_parent,
18                                                   u64 count, bool *hit)
19 {
20         struct rb_node **p = &hists->rb_node;
21         struct rb_node *parent = NULL;
22         struct hist_entry *he;
23         struct hist_entry entry = {
24                 .thread = al->thread,
25                 .ms = {
26                         .map    = al->map,
27                         .sym    = al->sym,
28                 },
29                 .ip     = al->addr,
30                 .level  = al->level,
31                 .count  = count,
32                 .parent = sym_parent,
33         };
34         int cmp;
35
36         while (*p != NULL) {
37                 parent = *p;
38                 he = rb_entry(parent, struct hist_entry, rb_node);
39
40                 cmp = hist_entry__cmp(&entry, he);
41
42                 if (!cmp) {
43                         *hit = true;
44                         return he;
45                 }
46
47                 if (cmp < 0)
48                         p = &(*p)->rb_left;
49                 else
50                         p = &(*p)->rb_right;
51         }
52
53         he = malloc(sizeof(*he));
54         if (!he)
55                 return NULL;
56         *he = entry;
57         rb_link_node(&he->rb_node, parent, p);
58         rb_insert_color(&he->rb_node, hists);
59         *hit = false;
60         return he;
61 }
62
63 int64_t
64 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
65 {
66         struct sort_entry *se;
67         int64_t cmp = 0;
68
69         list_for_each_entry(se, &hist_entry__sort_list, list) {
70                 cmp = se->cmp(left, right);
71                 if (cmp)
72                         break;
73         }
74
75         return cmp;
76 }
77
78 int64_t
79 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
80 {
81         struct sort_entry *se;
82         int64_t cmp = 0;
83
84         list_for_each_entry(se, &hist_entry__sort_list, list) {
85                 int64_t (*f)(struct hist_entry *, struct hist_entry *);
86
87                 f = se->collapse ?: se->cmp;
88
89                 cmp = f(left, right);
90                 if (cmp)
91                         break;
92         }
93
94         return cmp;
95 }
96
97 void hist_entry__free(struct hist_entry *he)
98 {
99         free(he);
100 }
101
102 /*
103  * collapse the histogram
104  */
105
106 static void collapse__insert_entry(struct rb_root *root, struct hist_entry *he)
107 {
108         struct rb_node **p = &root->rb_node;
109         struct rb_node *parent = NULL;
110         struct hist_entry *iter;
111         int64_t cmp;
112
113         while (*p != NULL) {
114                 parent = *p;
115                 iter = rb_entry(parent, struct hist_entry, rb_node);
116
117                 cmp = hist_entry__collapse(iter, he);
118
119                 if (!cmp) {
120                         iter->count += he->count;
121                         hist_entry__free(he);
122                         return;
123                 }
124
125                 if (cmp < 0)
126                         p = &(*p)->rb_left;
127                 else
128                         p = &(*p)->rb_right;
129         }
130
131         rb_link_node(&he->rb_node, parent, p);
132         rb_insert_color(&he->rb_node, root);
133 }
134
135 void perf_session__collapse_resort(struct rb_root *hists)
136 {
137         struct rb_root tmp;
138         struct rb_node *next;
139         struct hist_entry *n;
140
141         if (!sort__need_collapse)
142                 return;
143
144         tmp = RB_ROOT;
145         next = rb_first(hists);
146
147         while (next) {
148                 n = rb_entry(next, struct hist_entry, rb_node);
149                 next = rb_next(&n->rb_node);
150
151                 rb_erase(&n->rb_node, hists);
152                 collapse__insert_entry(&tmp, n);
153         }
154
155         *hists = tmp;
156 }
157
158 /*
159  * reverse the map, sort on count.
160  */
161
162 static void perf_session__insert_output_hist_entry(struct rb_root *root,
163                                                    struct hist_entry *he,
164                                                    u64 min_callchain_hits)
165 {
166         struct rb_node **p = &root->rb_node;
167         struct rb_node *parent = NULL;
168         struct hist_entry *iter;
169
170         if (symbol_conf.use_callchain)
171                 callchain_param.sort(&he->sorted_chain, &he->callchain,
172                                       min_callchain_hits, &callchain_param);
173
174         while (*p != NULL) {
175                 parent = *p;
176                 iter = rb_entry(parent, struct hist_entry, rb_node);
177
178                 if (he->count > iter->count)
179                         p = &(*p)->rb_left;
180                 else
181                         p = &(*p)->rb_right;
182         }
183
184         rb_link_node(&he->rb_node, parent, p);
185         rb_insert_color(&he->rb_node, root);
186 }
187
188 u64 perf_session__output_resort(struct rb_root *hists, u64 total_samples)
189 {
190         struct rb_root tmp;
191         struct rb_node *next;
192         struct hist_entry *n;
193         u64 min_callchain_hits;
194         u64 nr_hists = 0;
195
196         min_callchain_hits =
197                 total_samples * (callchain_param.min_percent / 100);
198
199         tmp = RB_ROOT;
200         next = rb_first(hists);
201
202         while (next) {
203                 n = rb_entry(next, struct hist_entry, rb_node);
204                 next = rb_next(&n->rb_node);
205
206                 rb_erase(&n->rb_node, hists);
207                 perf_session__insert_output_hist_entry(&tmp, n,
208                                                        min_callchain_hits);
209                 ++nr_hists;
210         }
211
212         *hists = tmp;
213         return nr_hists;
214 }
215
216 static size_t callchain__fprintf_left_margin(FILE *fp, int left_margin)
217 {
218         int i;
219         int ret = fprintf(fp, "            ");
220
221         for (i = 0; i < left_margin; i++)
222                 ret += fprintf(fp, " ");
223
224         return ret;
225 }
226
227 static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask,
228                                           int left_margin)
229 {
230         int i;
231         size_t ret = callchain__fprintf_left_margin(fp, left_margin);
232
233         for (i = 0; i < depth; i++)
234                 if (depth_mask & (1 << i))
235                         ret += fprintf(fp, "|          ");
236                 else
237                         ret += fprintf(fp, "           ");
238
239         ret += fprintf(fp, "\n");
240
241         return ret;
242 }
243
244 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain,
245                                      int depth, int depth_mask, int count,
246                                      u64 total_samples, int hits,
247                                      int left_margin)
248 {
249         int i;
250         size_t ret = 0;
251
252         ret += callchain__fprintf_left_margin(fp, left_margin);
253         for (i = 0; i < depth; i++) {
254                 if (depth_mask & (1 << i))
255                         ret += fprintf(fp, "|");
256                 else
257                         ret += fprintf(fp, " ");
258                 if (!count && i == depth - 1) {
259                         double percent;
260
261                         percent = hits * 100.0 / total_samples;
262                         ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
263                 } else
264                         ret += fprintf(fp, "%s", "          ");
265         }
266         if (chain->ms.sym)
267                 ret += fprintf(fp, "%s\n", chain->ms.sym->name);
268         else
269                 ret += fprintf(fp, "%p\n", (void *)(long)chain->ip);
270
271         return ret;
272 }
273
274 static struct symbol *rem_sq_bracket;
275 static struct callchain_list rem_hits;
276
277 static void init_rem_hits(void)
278 {
279         rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
280         if (!rem_sq_bracket) {
281                 fprintf(stderr, "Not enough memory to display remaining hits\n");
282                 return;
283         }
284
285         strcpy(rem_sq_bracket->name, "[...]");
286         rem_hits.ms.sym = rem_sq_bracket;
287 }
288
289 static size_t __callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
290                                          u64 total_samples, int depth,
291                                          int depth_mask, int left_margin)
292 {
293         struct rb_node *node, *next;
294         struct callchain_node *child;
295         struct callchain_list *chain;
296         int new_depth_mask = depth_mask;
297         u64 new_total;
298         u64 remaining;
299         size_t ret = 0;
300         int i;
301
302         if (callchain_param.mode == CHAIN_GRAPH_REL)
303                 new_total = self->children_hit;
304         else
305                 new_total = total_samples;
306
307         remaining = new_total;
308
309         node = rb_first(&self->rb_root);
310         while (node) {
311                 u64 cumul;
312
313                 child = rb_entry(node, struct callchain_node, rb_node);
314                 cumul = cumul_hits(child);
315                 remaining -= cumul;
316
317                 /*
318                  * The depth mask manages the output of pipes that show
319                  * the depth. We don't want to keep the pipes of the current
320                  * level for the last child of this depth.
321                  * Except if we have remaining filtered hits. They will
322                  * supersede the last child
323                  */
324                 next = rb_next(node);
325                 if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
326                         new_depth_mask &= ~(1 << (depth - 1));
327
328                 /*
329                  * But we keep the older depth mask for the line separator
330                  * to keep the level link until we reach the last child
331                  */
332                 ret += ipchain__fprintf_graph_line(fp, depth, depth_mask,
333                                                    left_margin);
334                 i = 0;
335                 list_for_each_entry(chain, &child->val, list) {
336                         ret += ipchain__fprintf_graph(fp, chain, depth,
337                                                       new_depth_mask, i++,
338                                                       new_total,
339                                                       cumul,
340                                                       left_margin);
341                 }
342                 ret += __callchain__fprintf_graph(fp, child, new_total,
343                                                   depth + 1,
344                                                   new_depth_mask | (1 << depth),
345                                                   left_margin);
346                 node = next;
347         }
348
349         if (callchain_param.mode == CHAIN_GRAPH_REL &&
350                 remaining && remaining != new_total) {
351
352                 if (!rem_sq_bracket)
353                         return ret;
354
355                 new_depth_mask &= ~(1 << (depth - 1));
356
357                 ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
358                                               new_depth_mask, 0, new_total,
359                                               remaining, left_margin);
360         }
361
362         return ret;
363 }
364
365 static size_t callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
366                                        u64 total_samples, int left_margin)
367 {
368         struct callchain_list *chain;
369         bool printed = false;
370         int i = 0;
371         int ret = 0;
372
373         list_for_each_entry(chain, &self->val, list) {
374                 if (!i++ && sort__first_dimension == SORT_SYM)
375                         continue;
376
377                 if (!printed) {
378                         ret += callchain__fprintf_left_margin(fp, left_margin);
379                         ret += fprintf(fp, "|\n");
380                         ret += callchain__fprintf_left_margin(fp, left_margin);
381                         ret += fprintf(fp, "---");
382
383                         left_margin += 3;
384                         printed = true;
385                 } else
386                         ret += callchain__fprintf_left_margin(fp, left_margin);
387
388                 if (chain->ms.sym)
389                         ret += fprintf(fp, " %s\n", chain->ms.sym->name);
390                 else
391                         ret += fprintf(fp, " %p\n", (void *)(long)chain->ip);
392         }
393
394         ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1, left_margin);
395
396         return ret;
397 }
398
399 static size_t callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
400                                       u64 total_samples)
401 {
402         struct callchain_list *chain;
403         size_t ret = 0;
404
405         if (!self)
406                 return 0;
407
408         ret += callchain__fprintf_flat(fp, self->parent, total_samples);
409
410
411         list_for_each_entry(chain, &self->val, list) {
412                 if (chain->ip >= PERF_CONTEXT_MAX)
413                         continue;
414                 if (chain->ms.sym)
415                         ret += fprintf(fp, "                %s\n", chain->ms.sym->name);
416                 else
417                         ret += fprintf(fp, "                %p\n",
418                                         (void *)(long)chain->ip);
419         }
420
421         return ret;
422 }
423
424 static size_t hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
425                                             u64 total_samples, int left_margin)
426 {
427         struct rb_node *rb_node;
428         struct callchain_node *chain;
429         size_t ret = 0;
430
431         rb_node = rb_first(&self->sorted_chain);
432         while (rb_node) {
433                 double percent;
434
435                 chain = rb_entry(rb_node, struct callchain_node, rb_node);
436                 percent = chain->hit * 100.0 / total_samples;
437                 switch (callchain_param.mode) {
438                 case CHAIN_FLAT:
439                         ret += percent_color_fprintf(fp, "           %6.2f%%\n",
440                                                      percent);
441                         ret += callchain__fprintf_flat(fp, chain, total_samples);
442                         break;
443                 case CHAIN_GRAPH_ABS: /* Falldown */
444                 case CHAIN_GRAPH_REL:
445                         ret += callchain__fprintf_graph(fp, chain, total_samples,
446                                                         left_margin);
447                 case CHAIN_NONE:
448                 default:
449                         break;
450                 }
451                 ret += fprintf(fp, "\n");
452                 rb_node = rb_next(rb_node);
453         }
454
455         return ret;
456 }
457
458 size_t hist_entry__fprintf(struct hist_entry *self,
459                            struct perf_session *pair_session,
460                            bool show_displacement,
461                            long displacement, FILE *fp,
462                            u64 session_total)
463 {
464         struct sort_entry *se;
465         u64 count, total;
466         const char *sep = symbol_conf.field_sep;
467         size_t ret;
468
469         if (symbol_conf.exclude_other && !self->parent)
470                 return 0;
471
472         if (pair_session) {
473                 count = self->pair ? self->pair->count : 0;
474                 total = pair_session->events_stats.total;
475         } else {
476                 count = self->count;
477                 total = session_total;
478         }
479
480         if (total)
481                 ret = percent_color_fprintf(fp, sep ? "%.2f" : "   %6.2f%%",
482                                             (count * 100.0) / total);
483         else
484                 ret = fprintf(fp, sep ? "%lld" : "%12lld ", count);
485
486         if (symbol_conf.show_nr_samples) {
487                 if (sep)
488                         ret += fprintf(fp, "%c%lld", *sep, count);
489                 else
490                         ret += fprintf(fp, "%11lld", count);
491         }
492
493         if (pair_session) {
494                 char bf[32];
495                 double old_percent = 0, new_percent = 0, diff;
496
497                 if (total > 0)
498                         old_percent = (count * 100.0) / total;
499                 if (session_total > 0)
500                         new_percent = (self->count * 100.0) / session_total;
501
502                 diff = new_percent - old_percent;
503
504                 if (fabs(diff) >= 0.01)
505                         snprintf(bf, sizeof(bf), "%+4.2F%%", diff);
506                 else
507                         snprintf(bf, sizeof(bf), " ");
508
509                 if (sep)
510                         ret += fprintf(fp, "%c%s", *sep, bf);
511                 else
512                         ret += fprintf(fp, "%11.11s", bf);
513
514                 if (show_displacement) {
515                         if (displacement)
516                                 snprintf(bf, sizeof(bf), "%+4ld", displacement);
517                         else
518                                 snprintf(bf, sizeof(bf), " ");
519
520                         if (sep)
521                                 ret += fprintf(fp, "%c%s", *sep, bf);
522                         else
523                                 ret += fprintf(fp, "%6.6s", bf);
524                 }
525         }
526
527         list_for_each_entry(se, &hist_entry__sort_list, list) {
528                 if (se->elide)
529                         continue;
530
531                 ret += fprintf(fp, "%s", sep ?: "  ");
532                 ret += se->print(fp, self, se->width ? *se->width : 0);
533         }
534
535         return ret + fprintf(fp, "\n");
536 }
537
538 static size_t hist_entry__fprintf_callchain(struct hist_entry *self, FILE *fp,
539                                             u64 session_total)
540 {
541         int left_margin = 0;
542
543         if (sort__first_dimension == SORT_COMM) {
544                 struct sort_entry *se = list_first_entry(&hist_entry__sort_list,
545                                                          typeof(*se), list);
546                 left_margin = se->width ? *se->width : 0;
547                 left_margin -= thread__comm_len(self->thread);
548         }
549
550         return hist_entry_callchain__fprintf(fp, self, session_total,
551                                              left_margin);
552 }
553
554 size_t perf_session__fprintf_hists(struct rb_root *hists,
555                                    struct perf_session *pair,
556                                    bool show_displacement, FILE *fp,
557                                    u64 session_total)
558 {
559         struct sort_entry *se;
560         struct rb_node *nd;
561         size_t ret = 0;
562         unsigned long position = 1;
563         long displacement = 0;
564         unsigned int width;
565         const char *sep = symbol_conf.field_sep;
566         char *col_width = symbol_conf.col_width_list_str;
567
568         init_rem_hits();
569
570         fprintf(fp, "# %s", pair ? "Baseline" : "Overhead");
571
572         if (symbol_conf.show_nr_samples) {
573                 if (sep)
574                         fprintf(fp, "%cSamples", *sep);
575                 else
576                         fputs("  Samples  ", fp);
577         }
578
579         if (pair) {
580                 if (sep)
581                         ret += fprintf(fp, "%cDelta", *sep);
582                 else
583                         ret += fprintf(fp, "  Delta    ");
584
585                 if (show_displacement) {
586                         if (sep)
587                                 ret += fprintf(fp, "%cDisplacement", *sep);
588                         else
589                                 ret += fprintf(fp, " Displ");
590                 }
591         }
592
593         list_for_each_entry(se, &hist_entry__sort_list, list) {
594                 if (se->elide)
595                         continue;
596                 if (sep) {
597                         fprintf(fp, "%c%s", *sep, se->header);
598                         continue;
599                 }
600                 width = strlen(se->header);
601                 if (se->width) {
602                         if (symbol_conf.col_width_list_str) {
603                                 if (col_width) {
604                                         *se->width = atoi(col_width);
605                                         col_width = strchr(col_width, ',');
606                                         if (col_width)
607                                                 ++col_width;
608                                 }
609                         }
610                         width = *se->width = max(*se->width, width);
611                 }
612                 fprintf(fp, "  %*s", width, se->header);
613         }
614         fprintf(fp, "\n");
615
616         if (sep)
617                 goto print_entries;
618
619         fprintf(fp, "# ........");
620         if (symbol_conf.show_nr_samples)
621                 fprintf(fp, " ..........");
622         if (pair) {
623                 fprintf(fp, " ..........");
624                 if (show_displacement)
625                         fprintf(fp, " .....");
626         }
627         list_for_each_entry(se, &hist_entry__sort_list, list) {
628                 unsigned int i;
629
630                 if (se->elide)
631                         continue;
632
633                 fprintf(fp, "  ");
634                 if (se->width)
635                         width = *se->width;
636                 else
637                         width = strlen(se->header);
638                 for (i = 0; i < width; i++)
639                         fprintf(fp, ".");
640         }
641
642         fprintf(fp, "\n#\n");
643
644 print_entries:
645         for (nd = rb_first(hists); nd; nd = rb_next(nd)) {
646                 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
647
648                 if (show_displacement) {
649                         if (h->pair != NULL)
650                                 displacement = ((long)h->pair->position -
651                                                 (long)position);
652                         else
653                                 displacement = 0;
654                         ++position;
655                 }
656                 ret += hist_entry__fprintf(h, pair, show_displacement,
657                                            displacement, fp, session_total);
658
659                 if (symbol_conf.use_callchain)
660                         ret += hist_entry__fprintf_callchain(h, fp, session_total);
661
662                 if (h->ms.map == NULL && verbose > 1) {
663                         __map_groups__fprintf_maps(&h->thread->mg,
664                                                    MAP__FUNCTION, verbose, fp);
665                         fprintf(fp, "%.10s end\n", graph_dotted_line);
666                 }
667         }
668
669         free(rem_sq_bracket);
670
671         return ret;
672 }