tools/perf/util/callchain.c

   1 /*
   2  * Copyright (C) 2009-2011, Frederic Weisbecker <fweisbec@gmail.com>
   3  *
   4  * Handle the callchains from the stream in an ad-hoc radix tree and then
   5  * sort them in an rbtree.
   6  *
   7  * Using a radix for code path provides a fast retrieval and factorizes
   8  * memory use. Also that lets us use the paths in a hierarchical graph view.
   9  *
  10  */
  11
  12 #include <stdlib.h>
  13 #include <stdio.h>
  14 #include <stdbool.h>
  15 #include <errno.h>
  16 #include <math.h>
  17
  18 #include "asm/bug.h"
  19
  20 #include "hist.h"
  21 #include "util.h"
  22 #include "sort.h"
  23 #include "machine.h"
  24 #include "callchain.h"
  25
  26 __thread struct callchain_cursor callchain_cursor;
  27
  28 int parse_callchain_record_opt(const char *arg, struct callchain_param *param)
  29 {
  30         return parse_callchain_record(arg, param);
  31 }
  32
  33 static int parse_callchain_mode(const char *value)
  34 {
  35         if (!strncmp(value, "graph", strlen(value))) {
  36                 callchain_param.mode = CHAIN_GRAPH_ABS;
  37                 return 0;
  38         }
  39         if (!strncmp(value, "flat", strlen(value))) {
  40                 callchain_param.mode = CHAIN_FLAT;
  41                 return 0;
  42         }
  43         if (!strncmp(value, "fractal", strlen(value))) {
  44                 callchain_param.mode = CHAIN_GRAPH_REL;
  45                 return 0;
  46         }
  47         if (!strncmp(value, "folded", strlen(value))) {
  48                 callchain_param.mode = CHAIN_FOLDED;
  49                 return 0;
  50         }
  51         return -1;
  52 }
  53
  54 static int parse_callchain_order(const char *value)
  55 {
  56         if (!strncmp(value, "caller", strlen(value))) {
  57                 callchain_param.order = ORDER_CALLER;
  58                 callchain_param.order_set = true;
  59                 return 0;
  60         }
  61         if (!strncmp(value, "callee", strlen(value))) {
  62                 callchain_param.order = ORDER_CALLEE;
  63                 callchain_param.order_set = true;
  64                 return 0;
  65         }
  66         return -1;
  67 }
  68
  69 static int parse_callchain_sort_key(const char *value)
  70 {
  71         if (!strncmp(value, "function", strlen(value))) {
  72                 callchain_param.key = CCKEY_FUNCTION;
  73                 return 0;
  74         }
  75         if (!strncmp(value, "address", strlen(value))) {
  76                 callchain_param.key = CCKEY_ADDRESS;
  77                 return 0;
  78         }
  79         if (!strncmp(value, "branch", strlen(value))) {
  80                 callchain_param.branch_callstack = 1;
  81                 return 0;
  82         }
  83         return -1;
  84 }
  85
  86 static int parse_callchain_value(const char *value)
  87 {
  88         if (!strncmp(value, "percent", strlen(value))) {
  89                 callchain_param.value = CCVAL_PERCENT;
  90                 return 0;
  91         }
  92         if (!strncmp(value, "period", strlen(value))) {
  93                 callchain_param.value = CCVAL_PERIOD;
  94                 return 0;
  95         }
  96         if (!strncmp(value, "count", strlen(value))) {
  97                 callchain_param.value = CCVAL_COUNT;
  98                 return 0;
  99         }
 100         return -1;
 101 }
 102
 103 static int
 104 __parse_callchain_report_opt(const char *arg, bool allow_record_opt)
 105 {
 106         char *tok;
 107         char *endptr;
 108         bool minpcnt_set = false;
 109         bool record_opt_set = false;
 110         bool try_stack_size = false;
 111
 112         callchain_param.enabled = true;
 113         symbol_conf.use_callchain = true;
 114
 115         if (!arg)
 116                 return 0;
 117
 118         while ((tok = strtok((char *)arg, ",")) != NULL) {
 119                 if (!strncmp(tok, "none", strlen(tok))) {
 120                         callchain_param.mode = CHAIN_NONE;
 121                         callchain_param.enabled = false;
 122                         symbol_conf.use_callchain = false;
 123                         return 0;
 124                 }
 125
 126                 if (!parse_callchain_mode(tok) ||
 127                     !parse_callchain_order(tok) ||
 128                     !parse_callchain_sort_key(tok) ||
 129                     !parse_callchain_value(tok)) {
 130                         /* parsing ok - move on to the next */
 131                         try_stack_size = false;
 132                         goto next;
 133                 } else if (allow_record_opt && !record_opt_set) {
 134                         if (parse_callchain_record(tok, &callchain_param))
 135                                 goto try_numbers;
 136
 137                         /* assume that number followed by 'dwarf' is stack size */
 138                         if (callchain_param.record_mode == CALLCHAIN_DWARF)
 139                                 try_stack_size = true;
 140
 141                         record_opt_set = true;
 142                         goto next;
 143                 }
 144
 145 try_numbers:
 146                 if (try_stack_size) {
 147                         unsigned long size = 0;
 148
 149                         if (get_stack_size(tok, &size) < 0)
 150                                 return -1;
 151                         callchain_param.dump_size = size;
 152                         try_stack_size = false;
 153                 } else if (!minpcnt_set) {
 154                         /* try to get the min percent */
 155                         callchain_param.min_percent = strtod(tok, &endptr);
 156                         if (tok == endptr)
 157                                 return -1;
 158                         minpcnt_set = true;
 159                 } else {
 160                         /* try print limit at last */
 161                         callchain_param.print_limit = strtoul(tok, &endptr, 0);
 162                         if (tok == endptr)
 163                                 return -1;
 164                 }
 165 next:
 166                 arg = NULL;
 167         }
 168
 169         if (callchain_register_param(&callchain_param) < 0) {
 170                 pr_err("Can't register callchain params\n");
 171                 return -1;
 172         }
 173         return 0;
 174 }
 175
 176 int parse_callchain_report_opt(const char *arg)
 177 {
 178         return __parse_callchain_report_opt(arg, false);
 179 }
 180
 181 int parse_callchain_top_opt(const char *arg)
 182 {
 183         return __parse_callchain_report_opt(arg, true);
 184 }
 185
 186 int perf_callchain_config(const char *var, const char *value)
 187 {
 188         char *endptr;
 189
 190         if (prefixcmp(var, "call-graph."))
 191                 return 0;
 192         var += sizeof("call-graph.") - 1;
 193
 194         if (!strcmp(var, "record-mode"))
 195                 return parse_callchain_record_opt(value, &callchain_param);
 196         if (!strcmp(var, "dump-size")) {
 197                 unsigned long size = 0;
 198                 int ret;
 199
 200                 ret = get_stack_size(value, &size);
 201                 callchain_param.dump_size = size;
 202
 203                 return ret;
 204         }
 205         if (!strcmp(var, "print-type"))
 206                 return parse_callchain_mode(value);
 207         if (!strcmp(var, "order"))
 208                 return parse_callchain_order(value);
 209         if (!strcmp(var, "sort-key"))
 210                 return parse_callchain_sort_key(value);
 211         if (!strcmp(var, "threshold")) {
 212                 callchain_param.min_percent = strtod(value, &endptr);
 213                 if (value == endptr)
 214                         return -1;
 215         }
 216         if (!strcmp(var, "print-limit")) {
 217                 callchain_param.print_limit = strtod(value, &endptr);
 218                 if (value == endptr)
 219                         return -1;
 220         }
 221
 222         return 0;
 223 }
 224
 225 static void
 226 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
 227                     enum chain_mode mode)
 228 {
 229         struct rb_node **p = &root->rb_node;
 230         struct rb_node *parent = NULL;
 231         struct callchain_node *rnode;
 232         u64 chain_cumul = callchain_cumul_hits(chain);
 233
 234         while (*p) {
 235                 u64 rnode_cumul;
 236
 237                 parent = *p;
 238                 rnode = rb_entry(parent, struct callchain_node, rb_node);
 239                 rnode_cumul = callchain_cumul_hits(rnode);
 240
 241                 switch (mode) {
 242                 case CHAIN_FLAT:
 243                 case CHAIN_FOLDED:
 244                         if (rnode->hit < chain->hit)
 245                                 p = &(*p)->rb_left;
 246                         else
 247                                 p = &(*p)->rb_right;
 248                         break;
 249                 case CHAIN_GRAPH_ABS: /* Falldown */
 250                 case CHAIN_GRAPH_REL:
 251                         if (rnode_cumul < chain_cumul)
 252                                 p = &(*p)->rb_left;
 253                         else
 254                                 p = &(*p)->rb_right;
 255                         break;
 256                 case CHAIN_NONE:
 257                 default:
 258                         break;
 259                 }
 260         }
 261
 262         rb_link_node(&chain->rb_node, parent, p);
 263         rb_insert_color(&chain->rb_node, root);
 264 }
 265
 266 static void
 267 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
 268                   u64 min_hit)
 269 {
 270         struct rb_node *n;
 271         struct callchain_node *child;
 272
 273         n = rb_first(&node->rb_root_in);
 274         while (n) {
 275                 child = rb_entry(n, struct callchain_node, rb_node_in);
 276                 n = rb_next(n);
 277
 278                 __sort_chain_flat(rb_root, child, min_hit);
 279         }
 280
 281         if (node->hit && node->hit >= min_hit)
 282                 rb_insert_callchain(rb_root, node, CHAIN_FLAT);
 283 }
 284
 285 /*
 286  * Once we get every callchains from the stream, we can now
 287  * sort them by hit
 288  */
 289 static void
 290 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root,
 291                 u64 min_hit, struct callchain_param *param __maybe_unused)
 292 {
 293         *rb_root = RB_ROOT;
 294         __sort_chain_flat(rb_root, &root->node, min_hit);
 295 }
 296
 297 static void __sort_chain_graph_abs(struct callchain_node *node,
 298                                    u64 min_hit)
 299 {
 300         struct rb_node *n;
 301         struct callchain_node *child;
 302
 303         node->rb_root = RB_ROOT;
 304         n = rb_first(&node->rb_root_in);
 305
 306         while (n) {
 307                 child = rb_entry(n, struct callchain_node, rb_node_in);
 308                 n = rb_next(n);
 309
 310                 __sort_chain_graph_abs(child, min_hit);
 311                 if (callchain_cumul_hits(child) >= min_hit)
 312                         rb_insert_callchain(&node->rb_root, child,
 313                                             CHAIN_GRAPH_ABS);
 314         }
 315 }
 316
 317 static void
 318 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root,
 319                      u64 min_hit, struct callchain_param *param __maybe_unused)
 320 {
 321         __sort_chain_graph_abs(&chain_root->node, min_hit);
 322         rb_root->rb_node = chain_root->node.rb_root.rb_node;
 323 }
 324
 325 static void __sort_chain_graph_rel(struct callchain_node *node,
 326                                    double min_percent)
 327 {
 328         struct rb_node *n;
 329         struct callchain_node *child;
 330         u64 min_hit;
 331
 332         node->rb_root = RB_ROOT;
 333         min_hit = ceil(node->children_hit * min_percent);
 334
 335         n = rb_first(&node->rb_root_in);
 336         while (n) {
 337                 child = rb_entry(n, struct callchain_node, rb_node_in);
 338                 n = rb_next(n);
 339
 340                 __sort_chain_graph_rel(child, min_percent);
 341                 if (callchain_cumul_hits(child) >= min_hit)
 342                         rb_insert_callchain(&node->rb_root, child,
 343                                             CHAIN_GRAPH_REL);
 344         }
 345 }
 346
 347 static void
 348 sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root,
 349                      u64 min_hit __maybe_unused, struct callchain_param *param)
 350 {
 351         __sort_chain_graph_rel(&chain_root->node, param->min_percent / 100.0);
 352         rb_root->rb_node = chain_root->node.rb_root.rb_node;
 353 }
 354
 355 int callchain_register_param(struct callchain_param *param)
 356 {
 357         switch (param->mode) {
 358         case CHAIN_GRAPH_ABS:
 359                 param->sort = sort_chain_graph_abs;
 360                 break;
 361         case CHAIN_GRAPH_REL:
 362                 param->sort = sort_chain_graph_rel;
 363                 break;
 364         case CHAIN_FLAT:
 365         case CHAIN_FOLDED:
 366                 param->sort = sort_chain_flat;
 367                 break;
 368         case CHAIN_NONE:
 369         default:
 370                 return -1;
 371         }
 372         return 0;
 373 }
 374
 375 /*
 376  * Create a child for a parent. If inherit_children, then the new child
 377  * will become the new parent of it's parent children
 378  */
 379 static struct callchain_node *
 380 create_child(struct callchain_node *parent, bool inherit_children)
 381 {
 382         struct callchain_node *new;
 383
 384         new = zalloc(sizeof(*new));
 385         if (!new) {
 386                 perror("not enough memory to create child for code path tree");
 387                 return NULL;
 388         }
 389         new->parent = parent;
 390         INIT_LIST_HEAD(&new->val);
 391         INIT_LIST_HEAD(&new->parent_val);
 392
 393         if (inherit_children) {
 394                 struct rb_node *n;
 395                 struct callchain_node *child;
 396
 397                 new->rb_root_in = parent->rb_root_in;
 398                 parent->rb_root_in = RB_ROOT;
 399
 400                 n = rb_first(&new->rb_root_in);
 401                 while (n) {
 402                         child = rb_entry(n, struct callchain_node, rb_node_in);
 403                         child->parent = new;
 404                         n = rb_next(n);
 405                 }
 406
 407                 /* make it the first child */
 408                 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node);
 409                 rb_insert_color(&new->rb_node_in, &parent->rb_root_in);
 410         }
 411
 412         return new;
 413 }
 414
 415
 416 /*
 417  * Fill the node with callchain values
 418  */
 419 static int
 420 fill_node(struct callchain_node *node, struct callchain_cursor *cursor)
 421 {
 422         struct callchain_cursor_node *cursor_node;
 423
 424         node->val_nr = cursor->nr - cursor->pos;
 425         if (!node->val_nr)
 426                 pr_warning("Warning: empty node in callchain tree\n");
 427
 428         cursor_node = callchain_cursor_current(cursor);
 429
 430         while (cursor_node) {
 431                 struct callchain_list *call;
 432
 433                 call = zalloc(sizeof(*call));
 434                 if (!call) {
 435                         perror("not enough memory for the code path tree");
 436                         return -1;
 437                 }
 438                 call->ip = cursor_node->ip;
 439                 call->ms.sym = cursor_node->sym;
 440                 call->ms.map = map__get(cursor_node->map);
 441                 list_add_tail(&call->list, &node->val);
 442
 443                 callchain_cursor_advance(cursor);
 444                 cursor_node = callchain_cursor_current(cursor);
 445         }
 446         return 0;
 447 }
 448
 449 static struct callchain_node *
 450 add_child(struct callchain_node *parent,
 451           struct callchain_cursor *cursor,
 452           u64 period)
 453 {
 454         struct callchain_node *new;
 455
 456         new = create_child(parent, false);
 457         if (new == NULL)
 458                 return NULL;
 459
 460         if (fill_node(new, cursor) < 0) {
 461                 struct callchain_list *call, *tmp;
 462
 463                 list_for_each_entry_safe(call, tmp, &new->val, list) {
 464                         list_del(&call->list);
 465                         map__zput(call->ms.map);
 466                         free(call);
 467                 }
 468                 free(new);
 469                 return NULL;
 470         }
 471
 472         new->children_hit = 0;
 473         new->hit = period;
 474         new->children_count = 0;
 475         new->count = 1;
 476         return new;
 477 }
 478
 479 enum match_result {
 480         MATCH_ERROR  = -1,
 481         MATCH_EQ,
 482         MATCH_LT,
 483         MATCH_GT,
 484 };
 485
 486 static enum match_result match_chain(struct callchain_cursor_node *node,
 487                                      struct callchain_list *cnode)
 488 {
 489         struct symbol *sym = node->sym;
 490         u64 left, right;
 491
 492         if (cnode->ms.sym && sym &&
 493             callchain_param.key == CCKEY_FUNCTION) {
 494                 left = cnode->ms.sym->start;
 495                 right = sym->start;
 496         } else {
 497                 left = cnode->ip;
 498                 right = node->ip;
 499         }
 500
 501         if (left == right)
 502                 return MATCH_EQ;
 503
 504         return left > right ? MATCH_GT : MATCH_LT;
 505 }
 506
 507 /*
 508  * Split the parent in two parts (a new child is created) and
 509  * give a part of its callchain to the created child.
 510  * Then create another child to host the given callchain of new branch
 511  */
 512 static int
 513 split_add_child(struct callchain_node *parent,
 514                 struct callchain_cursor *cursor,
 515                 struct callchain_list *to_split,
 516                 u64 idx_parents, u64 idx_local, u64 period)
 517 {
 518         struct callchain_node *new;
 519         struct list_head *old_tail;
 520         unsigned int idx_total = idx_parents + idx_local;
 521
 522         /* split */
 523         new = create_child(parent, true);
 524         if (new == NULL)
 525                 return -1;
 526
 527         /* split the callchain and move a part to the new child */
 528         old_tail = parent->val.prev;
 529         list_del_range(&to_split->list, old_tail);
 530         new->val.next = &to_split->list;
 531         new->val.prev = old_tail;
 532         to_split->list.prev = &new->val;
 533         old_tail->next = &new->val;
 534
 535         /* split the hits */
 536         new->hit = parent->hit;
 537         new->children_hit = parent->children_hit;
 538         parent->children_hit = callchain_cumul_hits(new);
 539         new->val_nr = parent->val_nr - idx_local;
 540         parent->val_nr = idx_local;
 541         new->count = parent->count;
 542         new->children_count = parent->children_count;
 543         parent->children_count = callchain_cumul_counts(new);
 544
 545         /* create a new child for the new branch if any */
 546         if (idx_total < cursor->nr) {
 547                 struct callchain_node *first;
 548                 struct callchain_list *cnode;
 549                 struct callchain_cursor_node *node;
 550                 struct rb_node *p, **pp;
 551
 552                 parent->hit = 0;
 553                 parent->children_hit += period;
 554                 parent->count = 0;
 555                 parent->children_count += 1;
 556
 557                 node = callchain_cursor_current(cursor);
 558                 new = add_child(parent, cursor, period);
 559                 if (new == NULL)
 560                         return -1;
 561
 562                 /*
 563                  * This is second child since we moved parent's children
 564                  * to new (first) child above.
 565                  */
 566                 p = parent->rb_root_in.rb_node;
 567                 first = rb_entry(p, struct callchain_node, rb_node_in);
 568                 cnode = list_first_entry(&first->val, struct callchain_list,
 569                                          list);
 570
 571                 if (match_chain(node, cnode) == MATCH_LT)
 572                         pp = &p->rb_left;
 573                 else
 574                         pp = &p->rb_right;
 575
 576                 rb_link_node(&new->rb_node_in, p, pp);
 577                 rb_insert_color(&new->rb_node_in, &parent->rb_root_in);
 578         } else {
 579                 parent->hit = period;
 580                 parent->count = 1;
 581         }
 582         return 0;
 583 }
 584
 585 static enum match_result
 586 append_chain(struct callchain_node *root,
 587              struct callchain_cursor *cursor,
 588              u64 period);
 589
 590 static int
 591 append_chain_children(struct callchain_node *root,
 592                       struct callchain_cursor *cursor,
 593                       u64 period)
 594 {
 595         struct callchain_node *rnode;
 596         struct callchain_cursor_node *node;
 597         struct rb_node **p = &root->rb_root_in.rb_node;
 598         struct rb_node *parent = NULL;
 599
 600         node = callchain_cursor_current(cursor);
 601         if (!node)
 602                 return -1;
 603
 604         /* lookup in childrens */
 605         while (*p) {
 606                 enum match_result ret;
 607
 608                 parent = *p;
 609                 rnode = rb_entry(parent, struct callchain_node, rb_node_in);
 610
 611                 /* If at least first entry matches, rely to children */
 612                 ret = append_chain(rnode, cursor, period);
 613                 if (ret == MATCH_EQ)
 614                         goto inc_children_hit;
 615                 if (ret == MATCH_ERROR)
 616                         return -1;
 617
 618                 if (ret == MATCH_LT)
 619                         p = &parent->rb_left;
 620                 else
 621                         p = &parent->rb_right;
 622         }
 623         /* nothing in children, add to the current node */
 624         rnode = add_child(root, cursor, period);
 625         if (rnode == NULL)
 626                 return -1;
 627
 628         rb_link_node(&rnode->rb_node_in, parent, p);
 629         rb_insert_color(&rnode->rb_node_in, &root->rb_root_in);
 630
 631 inc_children_hit:
 632         root->children_hit += period;
 633         root->children_count++;
 634         return 0;
 635 }
 636
 637 static enum match_result
 638 append_chain(struct callchain_node *root,
 639              struct callchain_cursor *cursor,
 640              u64 period)
 641 {
 642         struct callchain_list *cnode;
 643         u64 start = cursor->pos;
 644         bool found = false;
 645         u64 matches;
 646         enum match_result cmp = MATCH_ERROR;
 647
 648         /*
 649          * Lookup in the current node
 650          * If we have a symbol, then compare the start to match
 651          * anywhere inside a function, unless function
 652          * mode is disabled.
 653          */
 654         list_for_each_entry(cnode, &root->val, list) {
 655                 struct callchain_cursor_node *node;
 656
 657                 node = callchain_cursor_current(cursor);
 658                 if (!node)
 659                         break;
 660
 661                 cmp = match_chain(node, cnode);
 662                 if (cmp != MATCH_EQ)
 663                         break;
 664
 665                 found = true;
 666
 667                 callchain_cursor_advance(cursor);
 668         }
 669
 670         /* matches not, relay no the parent */
 671         if (!found) {
 672                 WARN_ONCE(cmp == MATCH_ERROR, "Chain comparison error\n");
 673                 return cmp;
 674         }
 675
 676         matches = cursor->pos - start;
 677
 678         /* we match only a part of the node. Split it and add the new chain */
 679         if (matches < root->val_nr) {
 680                 if (split_add_child(root, cursor, cnode, start, matches,
 681                                     period) < 0)
 682                         return MATCH_ERROR;
 683
 684                 return MATCH_EQ;
 685         }
 686
 687         /* we match 100% of the path, increment the hit */
 688         if (matches == root->val_nr && cursor->pos == cursor->nr) {
 689                 root->hit += period;
 690                 root->count++;
 691                 return MATCH_EQ;
 692         }
 693
 694         /* We match the node and still have a part remaining */
 695         if (append_chain_children(root, cursor, period) < 0)
 696                 return MATCH_ERROR;
 697
 698         return MATCH_EQ;
 699 }
 700
 701 int callchain_append(struct callchain_root *root,
 702                      struct callchain_cursor *cursor,
 703                      u64 period)
 704 {
 705         if (!cursor->nr)
 706                 return 0;
 707
 708         callchain_cursor_commit(cursor);
 709
 710         if (append_chain_children(&root->node, cursor, period) < 0)
 711                 return -1;
 712
 713         if (cursor->nr > root->max_depth)
 714                 root->max_depth = cursor->nr;
 715
 716         return 0;
 717 }
 718
 719 static int
 720 merge_chain_branch(struct callchain_cursor *cursor,
 721                    struct callchain_node *dst, struct callchain_node *src)
 722 {
 723         struct callchain_cursor_node **old_last = cursor->last;
 724         struct callchain_node *child;
 725         struct callchain_list *list, *next_list;
 726         struct rb_node *n;
 727         int old_pos = cursor->nr;
 728         int err = 0;
 729
 730         list_for_each_entry_safe(list, next_list, &src->val, list) {
 731                 callchain_cursor_append(cursor, list->ip,
 732                                         list->ms.map, list->ms.sym);
 733                 list_del(&list->list);
 734                 map__zput(list->ms.map);
 735                 free(list);
 736         }
 737
 738         if (src->hit) {
 739                 callchain_cursor_commit(cursor);
 740                 if (append_chain_children(dst, cursor, src->hit) < 0)
 741                         return -1;
 742         }
 743
 744         n = rb_first(&src->rb_root_in);
 745         while (n) {
 746                 child = container_of(n, struct callchain_node, rb_node_in);
 747                 n = rb_next(n);
 748                 rb_erase(&child->rb_node_in, &src->rb_root_in);
 749
 750                 err = merge_chain_branch(cursor, dst, child);
 751                 if (err)
 752                         break;
 753
 754                 free(child);
 755         }
 756
 757         cursor->nr = old_pos;
 758         cursor->last = old_last;
 759
 760         return err;
 761 }
 762
 763 int callchain_merge(struct callchain_cursor *cursor,
 764                     struct callchain_root *dst, struct callchain_root *src)
 765 {
 766         return merge_chain_branch(cursor, &dst->node, &src->node);
 767 }
 768
 769 int callchain_cursor_append(struct callchain_cursor *cursor,
 770                             u64 ip, struct map *map, struct symbol *sym)
 771 {
 772         struct callchain_cursor_node *node = *cursor->last;
 773
 774         if (!node) {
 775                 node = calloc(1, sizeof(*node));
 776                 if (!node)
 777                         return -ENOMEM;
 778
 779                 *cursor->last = node;
 780         }
 781
 782         node->ip = ip;
 783         map__zput(node->map);
 784         node->map = map__get(map);
 785         node->sym = sym;
 786
 787         cursor->nr++;
 788
 789         cursor->last = &node->next;
 790
 791         return 0;
 792 }
 793
 794 int sample__resolve_callchain(struct perf_sample *sample,
 795                               struct callchain_cursor *cursor, struct symbol **parent,
 796                               struct perf_evsel *evsel, struct addr_location *al,
 797                               int max_stack)
 798 {
 799         if (sample->callchain == NULL)
 800                 return 0;
 801
 802         if (symbol_conf.use_callchain || symbol_conf.cumulate_callchain ||
 803             perf_hpp_list.parent) {
 804                 return thread__resolve_callchain(al->thread, cursor, evsel, sample,
 805                                                  parent, al, max_stack);
 806         }
 807         return 0;
 808 }
 809
 810 int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample)
 811 {
 812         if (!symbol_conf.use_callchain || sample->callchain == NULL)
 813                 return 0;
 814         return callchain_append(he->callchain, &callchain_cursor, sample->period);
 815 }
 816
 817 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
 818                         bool hide_unresolved)
 819 {
 820         al->map = node->map;
 821         al->sym = node->sym;
 822         if (node->map)
 823                 al->addr = node->map->map_ip(node->map, node->ip);
 824         else
 825                 al->addr = node->ip;
 826
 827         if (al->sym == NULL) {
 828                 if (hide_unresolved)
 829                         return 0;
 830                 if (al->map == NULL)
 831                         goto out;
 832         }
 833
 834         if (al->map->groups == &al->machine->kmaps) {
 835                 if (machine__is_host(al->machine)) {
 836                         al->cpumode = PERF_RECORD_MISC_KERNEL;
 837                         al->level = 'k';
 838                 } else {
 839                         al->cpumode = PERF_RECORD_MISC_GUEST_KERNEL;
 840                         al->level = 'g';
 841                 }
 842         } else {
 843                 if (machine__is_host(al->machine)) {
 844                         al->cpumode = PERF_RECORD_MISC_USER;
 845                         al->level = '.';
 846                 } else if (perf_guest) {
 847                         al->cpumode = PERF_RECORD_MISC_GUEST_USER;
 848                         al->level = 'u';
 849                 } else {
 850                         al->cpumode = PERF_RECORD_MISC_HYPERVISOR;
 851                         al->level = 'H';
 852                 }
 853         }
 854
 855 out:
 856         return 1;
 857 }
 858
 859 char *callchain_list__sym_name(struct callchain_list *cl,
 860                                char *bf, size_t bfsize, bool show_dso)
 861 {
 862         int printed;
 863
 864         if (cl->ms.sym) {
 865                 if (callchain_param.key == CCKEY_ADDRESS &&
 866                     cl->ms.map && !cl->srcline)
 867                         cl->srcline = get_srcline(cl->ms.map->dso,
 868                                                   map__rip_2objdump(cl->ms.map,
 869                                                                     cl->ip),
 870                                                   cl->ms.sym, false);
 871                 if (cl->srcline)
 872                         printed = scnprintf(bf, bfsize, "%s %s",
 873                                         cl->ms.sym->name, cl->srcline);
 874                 else
 875                         printed = scnprintf(bf, bfsize, "%s", cl->ms.sym->name);
 876         } else
 877                 printed = scnprintf(bf, bfsize, "%#" PRIx64, cl->ip);
 878
 879         if (show_dso)
 880                 scnprintf(bf + printed, bfsize - printed, " %s",
 881                           cl->ms.map ?
 882                           cl->ms.map->dso->short_name :
 883                           "unknown");
 884
 885         return bf;
 886 }
 887
 888 char *callchain_node__scnprintf_value(struct callchain_node *node,
 889                                       char *bf, size_t bfsize, u64 total)
 890 {
 891         double percent = 0.0;
 892         u64 period = callchain_cumul_hits(node);
 893         unsigned count = callchain_cumul_counts(node);
 894
 895         if (callchain_param.mode == CHAIN_FOLDED) {
 896                 period = node->hit;
 897                 count = node->count;
 898         }
 899
 900         switch (callchain_param.value) {
 901         case CCVAL_PERIOD:
 902                 scnprintf(bf, bfsize, "%"PRIu64, period);
 903                 break;
 904         case CCVAL_COUNT:
 905                 scnprintf(bf, bfsize, "%u", count);
 906                 break;
 907         case CCVAL_PERCENT:
 908         default:
 909                 if (total)
 910                         percent = period * 100.0 / total;
 911                 scnprintf(bf, bfsize, "%.2f%%", percent);
 912                 break;
 913         }
 914         return bf;
 915 }
 916
 917 int callchain_node__fprintf_value(struct callchain_node *node,
 918                                  FILE *fp, u64 total)
 919 {
 920         double percent = 0.0;
 921         u64 period = callchain_cumul_hits(node);
 922         unsigned count = callchain_cumul_counts(node);
 923
 924         if (callchain_param.mode == CHAIN_FOLDED) {
 925                 period = node->hit;
 926                 count = node->count;
 927         }
 928
 929         switch (callchain_param.value) {
 930         case CCVAL_PERIOD:
 931                 return fprintf(fp, "%"PRIu64, period);
 932         case CCVAL_COUNT:
 933                 return fprintf(fp, "%u", count);
 934         case CCVAL_PERCENT:
 935         default:
 936                 if (total)
 937                         percent = period * 100.0 / total;
 938                 return percent_color_fprintf(fp, "%.2f%%", percent);
 939         }
 940         return 0;
 941 }
 942
 943 static void free_callchain_node(struct callchain_node *node)
 944 {
 945         struct callchain_list *list, *tmp;
 946         struct callchain_node *child;
 947         struct rb_node *n;
 948
 949         list_for_each_entry_safe(list, tmp, &node->parent_val, list) {
 950                 list_del(&list->list);
 951                 map__zput(list->ms.map);
 952                 free(list);
 953         }
 954
 955         list_for_each_entry_safe(list, tmp, &node->val, list) {
 956                 list_del(&list->list);
 957                 map__zput(list->ms.map);
 958                 free(list);
 959         }
 960
 961         n = rb_first(&node->rb_root_in);
 962         while (n) {
 963                 child = container_of(n, struct callchain_node, rb_node_in);
 964                 n = rb_next(n);
 965                 rb_erase(&child->rb_node_in, &node->rb_root_in);
 966
 967                 free_callchain_node(child);
 968                 free(child);
 969         }
 970 }
 971
 972 void free_callchain(struct callchain_root *root)
 973 {
 974         if (!symbol_conf.use_callchain)
 975                 return;
 976
 977         free_callchain_node(&root->node);
 978 }
 979
 980 static u64 decay_callchain_node(struct callchain_node *node)
 981 {
 982         struct callchain_node *child;
 983         struct rb_node *n;
 984         u64 child_hits = 0;
 985
 986         n = rb_first(&node->rb_root_in);
 987         while (n) {
 988                 child = container_of(n, struct callchain_node, rb_node_in);
 989
 990                 child_hits += decay_callchain_node(child);
 991                 n = rb_next(n);
 992         }
 993
 994         node->hit = (node->hit * 7) / 8;
 995         node->children_hit = child_hits;
 996
 997         return node->hit;
 998 }
 999
1000 void decay_callchain(struct callchain_root *root)
1001 {
1002         if (!symbol_conf.use_callchain)
1003                 return;
1004
1005         decay_callchain_node(&root->node);
1006 }
1007
1008 int callchain_node__make_parent_list(struct callchain_node *node)
1009 {
1010         struct callchain_node *parent = node->parent;
1011         struct callchain_list *chain, *new;
1012         LIST_HEAD(head);
1013
1014         while (parent) {
1015                 list_for_each_entry_reverse(chain, &parent->val, list) {
1016                         new = malloc(sizeof(*new));
1017                         if (new == NULL)
1018                                 goto out;
1019                         *new = *chain;
1020                         new->has_children = false;
1021                         map__get(new->ms.map);
1022                         list_add_tail(&new->list, &head);
1023                 }
1024                 parent = parent->parent;
1025         }
1026
1027         list_for_each_entry_safe_reverse(chain, new, &head, list)
1028                 list_move_tail(&chain->list, &node->parent_val);
1029
1030         if (!list_empty(&node->parent_val)) {
1031                 chain = list_first_entry(&node->parent_val, struct callchain_list, list);
1032                 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node);
1033
1034                 chain = list_first_entry(&node->val, struct callchain_list, list);
1035                 chain->has_children = false;
1036         }
1037         return 0;
1038
1039 out:
1040         list_for_each_entry_safe(chain, new, &head, list) {
1041                 list_del(&chain->list);
1042                 map__zput(chain->ms.map);
1043                 free(chain);
1044         }
1045         return -ENOMEM;
1046 }