Lines Matching +full:child +full:- +full:node
1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2009-2011, Frederic Weisbecker <fweisbec@gmail.com>
5 * Handle the callchains from the stream in an ad-hoc radix tree and then
52 * -e cycles/call-graph=dwarf/
85 return -1; in parse_callchain_mode()
100 return -1; in parse_callchain_order()
121 return -1; in parse_callchain_sort_key()
138 return -1; in parse_callchain_value()
164 return -1; in get_stack_size()
194 /* parsing ok - move on to the next */ in __parse_callchain_report_opt()
214 return -1; in __parse_callchain_report_opt()
221 return -1; in __parse_callchain_report_opt()
227 return -1; in __parse_callchain_report_opt()
235 return -1; in __parse_callchain_report_opt()
254 int ret = -1; in parse_callchain_record()
259 return -ENOMEM; in parse_callchain_record()
270 param->record_mode = CALLCHAIN_FP; in parse_callchain_record()
274 "needed for --call-graph fp\n"); in parse_callchain_record()
282 param->record_mode = CALLCHAIN_DWARF; in parse_callchain_record()
283 param->dump_size = default_stack_dump_size; in parse_callchain_record()
291 param->dump_size = size; in parse_callchain_record()
295 param->record_mode = CALLCHAIN_LBR; in parse_callchain_record()
299 "needed for --call-graph lbr\n"); in parse_callchain_record()
302 pr_err("callchain: Unknown --call-graph option " in parse_callchain_record()
317 if (!strstarts(var, "call-graph.")) in perf_callchain_config()
319 var += sizeof("call-graph.") - 1; in perf_callchain_config()
321 if (!strcmp(var, "record-mode")) in perf_callchain_config()
323 if (!strcmp(var, "dump-size")) { in perf_callchain_config()
332 if (!strcmp(var, "print-type")){ in perf_callchain_config()
335 if (ret == -1) in perf_callchain_config()
342 if (ret == -1) in perf_callchain_config()
346 if (!strcmp(var, "sort-key")){ in perf_callchain_config()
349 if (ret == -1) in perf_callchain_config()
357 return -1; in perf_callchain_config()
360 if (!strcmp(var, "print-limit")) { in perf_callchain_config()
364 return -1; in perf_callchain_config()
375 struct rb_node **p = &root->rb_node; in rb_insert_callchain()
390 if (rnode->hit < chain->hit) in rb_insert_callchain()
391 p = &(*p)->rb_left; in rb_insert_callchain()
393 p = &(*p)->rb_right; in rb_insert_callchain()
398 p = &(*p)->rb_left; in rb_insert_callchain()
400 p = &(*p)->rb_right; in rb_insert_callchain()
408 rb_link_node(&chain->rb_node, parent, p); in rb_insert_callchain()
409 rb_insert_color(&chain->rb_node, root); in rb_insert_callchain()
413 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument
417 struct callchain_node *child; in __sort_chain_flat() local
419 n = rb_first(&node->rb_root_in); in __sort_chain_flat()
421 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
424 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
427 if (node->hit && node->hit >= min_hit) in __sort_chain_flat()
428 rb_insert_callchain(rb_root, node, CHAIN_FLAT); in __sort_chain_flat()
440 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
443 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs() argument
447 struct callchain_node *child; in __sort_chain_graph_abs() local
449 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
450 n = rb_first(&node->rb_root_in); in __sort_chain_graph_abs()
453 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
456 __sort_chain_graph_abs(child, min_hit); in __sort_chain_graph_abs()
457 if (callchain_cumul_hits(child) >= min_hit) in __sort_chain_graph_abs()
458 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs()
467 __sort_chain_graph_abs(&chain_root->node, min_hit); in sort_chain_graph_abs()
468 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs()
471 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel() argument
475 struct callchain_node *child; in __sort_chain_graph_rel() local
478 node->rb_root = RB_ROOT; in __sort_chain_graph_rel()
479 min_hit = ceil(node->children_hit * min_percent); in __sort_chain_graph_rel()
481 n = rb_first(&node->rb_root_in); in __sort_chain_graph_rel()
483 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
486 __sort_chain_graph_rel(child, min_percent); in __sort_chain_graph_rel()
487 if (callchain_cumul_hits(child) >= min_hit) in __sort_chain_graph_rel()
488 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_rel()
497 __sort_chain_graph_rel(&chain_root->node, param->min_percent / 100.0); in sort_chain_graph_rel()
498 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_rel()
503 switch (param->mode) { in callchain_register_param()
505 param->sort = sort_chain_graph_abs; in callchain_register_param()
508 param->sort = sort_chain_graph_rel; in callchain_register_param()
512 param->sort = sort_chain_flat; in callchain_register_param()
516 return -1; in callchain_register_param()
522 * Create a child for a parent. If inherit_children, then the new child
532 perror("not enough memory to create child for code path tree"); in create_child()
535 new->parent = parent; in create_child()
536 INIT_LIST_HEAD(&new->val); in create_child()
537 INIT_LIST_HEAD(&new->parent_val); in create_child()
541 struct callchain_node *child; in create_child() local
543 new->rb_root_in = parent->rb_root_in; in create_child()
544 parent->rb_root_in = RB_ROOT; in create_child()
546 n = rb_first(&new->rb_root_in); in create_child()
548 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
549 child->parent = new; in create_child()
553 /* make it the first child */ in create_child()
554 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
555 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child()
563 * Fill the node with callchain values
566 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node() argument
570 node->val_nr = cursor->nr - cursor->pos; in fill_node()
571 if (!node->val_nr) in fill_node()
572 pr_warning("Warning: empty node in callchain tree\n"); in fill_node()
582 return -1; in fill_node()
584 call->ip = cursor_node->ip; in fill_node()
585 call->ms = cursor_node->ms; in fill_node()
586 map__get(call->ms.map); in fill_node()
587 call->srcline = cursor_node->srcline; in fill_node()
589 if (cursor_node->branch) { in fill_node()
590 call->branch_count = 1; in fill_node()
592 if (cursor_node->branch_from) { in fill_node()
597 call->brtype_stat.branch_to = true; in fill_node()
599 if (cursor_node->branch_flags.predicted) in fill_node()
600 call->predicted_count = 1; in fill_node()
602 if (cursor_node->branch_flags.abort) in fill_node()
603 call->abort_count = 1; in fill_node()
605 branch_type_count(&call->brtype_stat, in fill_node()
606 &cursor_node->branch_flags, in fill_node()
607 cursor_node->branch_from, in fill_node()
608 cursor_node->ip); in fill_node()
613 call->brtype_stat.branch_to = false; in fill_node()
614 call->cycles_count = in fill_node()
615 cursor_node->branch_flags.cycles; in fill_node()
616 call->iter_count = cursor_node->nr_loop_iter; in fill_node()
617 call->iter_cycles = cursor_node->iter_cycles; in fill_node()
621 list_add_tail(&call->list, &node->val); in fill_node()
643 list_for_each_entry_safe(call, tmp, &new->val, list) { in add_child()
644 list_del_init(&call->list); in add_child()
645 map__zput(call->ms.map); in add_child()
652 new->children_hit = 0; in add_child()
653 new->hit = period; in add_child()
654 new->children_count = 0; in add_child()
655 new->count = 1; in add_child()
660 MATCH_ERROR = -1,
677 cmp = -1; in match_chain_strings()
693 * to compare just relative addresses. -acme
698 struct dso *left_dso = left_map ? left_map->dso : NULL; in match_chain_dso_addresses()
699 struct dso *right_dso = right_map ? right_map->dso : NULL; in match_chain_dso_addresses()
710 static enum match_result match_chain(struct callchain_cursor_node *node, in match_chain() argument
717 match = match_chain_strings(cnode->srcline, node->srcline); in match_chain()
720 /* otherwise fall-back to symbol-based comparison below */ in match_chain()
723 if (node->ms.sym && cnode->ms.sym) { in match_chain()
730 if (cnode->ms.sym->inlined || node->ms.sym->inlined) { in match_chain()
731 match = match_chain_strings(cnode->ms.sym->name, in match_chain()
732 node->ms.sym->name); in match_chain()
736 match = match_chain_dso_addresses(cnode->ms.map, cnode->ms.sym->start, in match_chain()
737 node->ms.map, node->ms.sym->start); in match_chain()
741 /* otherwise fall-back to IP-based comparison below */ in match_chain()
745 match = match_chain_dso_addresses(cnode->ms.map, cnode->ip, node->ms.map, node->ip); in match_chain()
749 if (match == MATCH_EQ && node->branch) { in match_chain()
750 cnode->branch_count++; in match_chain()
752 if (node->branch_from) { in match_chain()
756 cnode->brtype_stat.branch_to = true; in match_chain()
758 if (node->branch_flags.predicted) in match_chain()
759 cnode->predicted_count++; in match_chain()
761 if (node->branch_flags.abort) in match_chain()
762 cnode->abort_count++; in match_chain()
764 branch_type_count(&cnode->brtype_stat, in match_chain()
765 &node->branch_flags, in match_chain()
766 node->branch_from, in match_chain()
767 node->ip); in match_chain()
772 cnode->brtype_stat.branch_to = false; in match_chain()
773 cnode->cycles_count += node->branch_flags.cycles; in match_chain()
774 cnode->iter_count += node->nr_loop_iter; in match_chain()
775 cnode->iter_cycles += node->iter_cycles; in match_chain()
776 cnode->from_count++; in match_chain()
784 * Split the parent in two parts (a new child is created) and
785 * give a part of its callchain to the created child.
786 * Then create another child to host the given callchain of new branch
801 return -1; in split_add_child()
803 /* split the callchain and move a part to the new child */ in split_add_child()
804 old_tail = parent->val.prev; in split_add_child()
805 list_del_range(&to_split->list, old_tail); in split_add_child()
806 new->val.next = &to_split->list; in split_add_child()
807 new->val.prev = old_tail; in split_add_child()
808 to_split->list.prev = &new->val; in split_add_child()
809 old_tail->next = &new->val; in split_add_child()
812 new->hit = parent->hit; in split_add_child()
813 new->children_hit = parent->children_hit; in split_add_child()
814 parent->children_hit = callchain_cumul_hits(new); in split_add_child()
815 new->val_nr = parent->val_nr - idx_local; in split_add_child()
816 parent->val_nr = idx_local; in split_add_child()
817 new->count = parent->count; in split_add_child()
818 new->children_count = parent->children_count; in split_add_child()
819 parent->children_count = callchain_cumul_counts(new); in split_add_child()
821 /* create a new child for the new branch if any */ in split_add_child()
822 if (idx_total < cursor->nr) { in split_add_child()
825 struct callchain_cursor_node *node; in split_add_child() local
828 parent->hit = 0; in split_add_child()
829 parent->children_hit += period; in split_add_child()
830 parent->count = 0; in split_add_child()
831 parent->children_count += 1; in split_add_child()
833 node = callchain_cursor_current(cursor); in split_add_child()
836 return -1; in split_add_child()
839 * This is second child since we moved parent's children in split_add_child()
840 * to new (first) child above. in split_add_child()
842 p = parent->rb_root_in.rb_node; in split_add_child()
844 cnode = list_first_entry(&first->val, struct callchain_list, in split_add_child()
847 if (match_chain(node, cnode) == MATCH_LT) in split_add_child()
848 pp = &p->rb_left; in split_add_child()
850 pp = &p->rb_right; in split_add_child()
852 rb_link_node(&new->rb_node_in, p, pp); in split_add_child()
853 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child()
855 parent->hit = period; in split_add_child()
856 parent->count = 1; in split_add_child()
872 struct callchain_cursor_node *node; in append_chain_children() local
873 struct rb_node **p = &root->rb_root_in.rb_node; in append_chain_children()
876 node = callchain_cursor_current(cursor); in append_chain_children()
877 if (!node) in append_chain_children()
878 return -1; in append_chain_children()
892 return -1; in append_chain_children()
895 p = &parent->rb_left; in append_chain_children()
897 p = &parent->rb_right; in append_chain_children()
899 /* nothing in children, add to the current node */ in append_chain_children()
902 return -1; in append_chain_children()
904 rb_link_node(&rnode->rb_node_in, parent, p); in append_chain_children()
905 rb_insert_color(&rnode->rb_node_in, &root->rb_root_in); in append_chain_children()
908 root->children_hit += period; in append_chain_children()
909 root->children_count++; in append_chain_children()
919 u64 start = cursor->pos; in append_chain()
925 * Lookup in the current node in append_chain()
930 list_for_each_entry(cnode, &root->val, list) { in append_chain()
931 struct callchain_cursor_node *node; in append_chain() local
933 node = callchain_cursor_current(cursor); in append_chain()
934 if (!node) in append_chain()
937 cmp = match_chain(node, cnode); in append_chain()
952 matches = cursor->pos - start; in append_chain()
954 /* we match only a part of the node. Split it and add the new chain */ in append_chain()
955 if (matches < root->val_nr) { in append_chain()
964 if (matches == root->val_nr && cursor->pos == cursor->nr) { in append_chain()
965 root->hit += period; in append_chain()
966 root->count++; in append_chain()
970 /* We match the node and still have a part remaining */ in append_chain()
981 if (!cursor->nr) in callchain_append()
986 if (append_chain_children(&root->node, cursor, period) < 0) in callchain_append()
987 return -1; in callchain_append()
989 if (cursor->nr > root->max_depth) in callchain_append()
990 root->max_depth = cursor->nr; in callchain_append()
999 struct callchain_cursor_node **old_last = cursor->last; in merge_chain_branch()
1000 struct callchain_node *child; in merge_chain_branch() local
1003 int old_pos = cursor->nr; in merge_chain_branch()
1006 list_for_each_entry_safe(list, next_list, &src->val, list) { in merge_chain_branch()
1007 callchain_cursor_append(cursor, list->ip, &list->ms, in merge_chain_branch()
1008 false, NULL, 0, 0, 0, list->srcline); in merge_chain_branch()
1009 list_del_init(&list->list); in merge_chain_branch()
1010 map__zput(list->ms.map); in merge_chain_branch()
1014 if (src->hit) { in merge_chain_branch()
1016 if (append_chain_children(dst, cursor, src->hit) < 0) in merge_chain_branch()
1017 return -1; in merge_chain_branch()
1020 n = rb_first(&src->rb_root_in); in merge_chain_branch()
1022 child = container_of(n, struct callchain_node, rb_node_in); in merge_chain_branch()
1024 rb_erase(&child->rb_node_in, &src->rb_root_in); in merge_chain_branch()
1026 err = merge_chain_branch(cursor, dst, child); in merge_chain_branch()
1030 free(child); in merge_chain_branch()
1033 cursor->nr = old_pos; in merge_chain_branch()
1034 cursor->last = old_last; in merge_chain_branch()
1042 return merge_chain_branch(cursor, &dst->node, &src->node); in callchain_merge()
1051 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
1053 if (!node) { in callchain_cursor_append()
1054 node = calloc(1, sizeof(*node)); in callchain_cursor_append()
1055 if (!node) in callchain_cursor_append()
1056 return -ENOMEM; in callchain_cursor_append()
1058 *cursor->last = node; in callchain_cursor_append()
1061 node->ip = ip; in callchain_cursor_append()
1062 map__zput(node->ms.map); in callchain_cursor_append()
1063 node->ms = *ms; in callchain_cursor_append()
1064 map__get(node->ms.map); in callchain_cursor_append()
1065 node->branch = branch; in callchain_cursor_append()
1066 node->nr_loop_iter = nr_loop_iter; in callchain_cursor_append()
1067 node->iter_cycles = iter_cycles; in callchain_cursor_append()
1068 node->srcline = srcline; in callchain_cursor_append()
1071 memcpy(&node->branch_flags, flags, in callchain_cursor_append()
1074 node->branch_from = branch_from; in callchain_cursor_append()
1075 cursor->nr++; in callchain_cursor_append()
1077 cursor->last = &node->next; in callchain_cursor_append()
1087 if (sample->callchain == NULL && !symbol_conf.show_branchflag_count) in sample__resolve_callchain()
1092 return thread__resolve_callchain(al->thread, cursor, evsel, sample, in sample__resolve_callchain()
1100 if ((!symbol_conf.use_callchain || sample->callchain == NULL) && in hist_entry__append_callchain()
1103 return callchain_append(he->callchain, &callchain_cursor, sample->period); in hist_entry__append_callchain()
1106 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, in fill_callchain_info() argument
1109 al->maps = node->ms.maps; in fill_callchain_info()
1110 al->map = node->ms.map; in fill_callchain_info()
1111 al->sym = node->ms.sym; in fill_callchain_info()
1112 al->srcline = node->srcline; in fill_callchain_info()
1113 al->addr = node->ip; in fill_callchain_info()
1115 if (al->sym == NULL) { in fill_callchain_info()
1118 if (al->map == NULL) in fill_callchain_info()
1122 if (al->maps == &al->maps->machine->kmaps) { in fill_callchain_info()
1123 if (machine__is_host(al->maps->machine)) { in fill_callchain_info()
1124 al->cpumode = PERF_RECORD_MISC_KERNEL; in fill_callchain_info()
1125 al->level = 'k'; in fill_callchain_info()
1127 al->cpumode = PERF_RECORD_MISC_GUEST_KERNEL; in fill_callchain_info()
1128 al->level = 'g'; in fill_callchain_info()
1131 if (machine__is_host(al->maps->machine)) { in fill_callchain_info()
1132 al->cpumode = PERF_RECORD_MISC_USER; in fill_callchain_info()
1133 al->level = '.'; in fill_callchain_info()
1135 al->cpumode = PERF_RECORD_MISC_GUEST_USER; in fill_callchain_info()
1136 al->level = 'u'; in fill_callchain_info()
1138 al->cpumode = PERF_RECORD_MISC_HYPERVISOR; in fill_callchain_info()
1139 al->level = 'H'; in fill_callchain_info()
1154 if (cl->ms.sym) { in callchain_list__sym_name()
1155 const char *inlined = cl->ms.sym->inlined ? " (inlined)" : ""; in callchain_list__sym_name()
1157 if (show_srcline && cl->srcline) in callchain_list__sym_name()
1159 cl->ms.sym->name, cl->srcline, in callchain_list__sym_name()
1163 cl->ms.sym->name, inlined); in callchain_list__sym_name()
1165 printed = scnprintf(bf, bfsize, "%#" PRIx64, cl->ip); in callchain_list__sym_name()
1168 scnprintf(bf + printed, bfsize - printed, " %s", in callchain_list__sym_name()
1169 cl->ms.map ? in callchain_list__sym_name()
1170 cl->ms.map->dso->short_name : in callchain_list__sym_name()
1176 char *callchain_node__scnprintf_value(struct callchain_node *node, in callchain_node__scnprintf_value() argument
1180 u64 period = callchain_cumul_hits(node); in callchain_node__scnprintf_value()
1181 unsigned count = callchain_cumul_counts(node); in callchain_node__scnprintf_value()
1184 period = node->hit; in callchain_node__scnprintf_value()
1185 count = node->count; in callchain_node__scnprintf_value()
1205 int callchain_node__fprintf_value(struct callchain_node *node, in callchain_node__fprintf_value() argument
1209 u64 period = callchain_cumul_hits(node); in callchain_node__fprintf_value()
1210 unsigned count = callchain_cumul_counts(node); in callchain_node__fprintf_value()
1213 period = node->hit; in callchain_node__fprintf_value()
1214 count = node->count; in callchain_node__fprintf_value()
1231 static void callchain_counts_value(struct callchain_node *node, in callchain_counts_value() argument
1237 list_for_each_entry(clist, &node->val, list) { in callchain_counts_value()
1239 *branch_count += clist->branch_count; in callchain_counts_value()
1242 *predicted_count += clist->predicted_count; in callchain_counts_value()
1245 *abort_count += clist->abort_count; in callchain_counts_value()
1248 *cycles_count += clist->cycles_count; in callchain_counts_value()
1252 static int callchain_node_branch_counts_cumul(struct callchain_node *node, in callchain_node_branch_counts_cumul() argument
1258 struct callchain_node *child; in callchain_node_branch_counts_cumul() local
1261 n = rb_first(&node->rb_root_in); in callchain_node_branch_counts_cumul()
1263 child = rb_entry(n, struct callchain_node, rb_node_in); in callchain_node_branch_counts_cumul()
1266 callchain_node_branch_counts_cumul(child, branch_count, in callchain_node_branch_counts_cumul()
1271 callchain_counts_value(child, branch_count, in callchain_node_branch_counts_cumul()
1295 return callchain_node_branch_counts_cumul(&root->node, in callchain_branch_counts()
1338 bf + printed, bfsize - printed, 0.0); in branch_to_str()
1344 bf + printed, bfsize - printed, 0.1); in branch_to_str()
1348 printed += scnprintf(bf + printed, bfsize - printed, ")"); in branch_to_str()
1365 bf + printed, bfsize - printed); in branch_from_str()
1372 v, bf + printed, bfsize - printed); in branch_from_str()
1376 bf + printed, bfsize - printed); in branch_from_str()
1381 printed += scnprintf(bf + printed, bfsize - printed, ")"); in branch_from_str()
1398 if (brtype_stat->branch_to) { in counts_str_build()
1440 branch_count = clist->branch_count; in callchain_list_counts__printf_value()
1441 predicted_count = clist->predicted_count; in callchain_list_counts__printf_value()
1442 abort_count = clist->abort_count; in callchain_list_counts__printf_value()
1443 cycles_count = clist->cycles_count; in callchain_list_counts__printf_value()
1444 iter_count = clist->iter_count; in callchain_list_counts__printf_value()
1445 iter_cycles = clist->iter_cycles; in callchain_list_counts__printf_value()
1446 from_count = clist->from_count; in callchain_list_counts__printf_value()
1451 from_count, &clist->brtype_stat); in callchain_list_counts__printf_value()
1454 static void free_callchain_node(struct callchain_node *node) in free_callchain_node() argument
1457 struct callchain_node *child; in free_callchain_node() local
1460 list_for_each_entry_safe(list, tmp, &node->parent_val, list) { in free_callchain_node()
1461 list_del_init(&list->list); in free_callchain_node()
1462 map__zput(list->ms.map); in free_callchain_node()
1466 list_for_each_entry_safe(list, tmp, &node->val, list) { in free_callchain_node()
1467 list_del_init(&list->list); in free_callchain_node()
1468 map__zput(list->ms.map); in free_callchain_node()
1472 n = rb_first(&node->rb_root_in); in free_callchain_node()
1474 child = container_of(n, struct callchain_node, rb_node_in); in free_callchain_node()
1476 rb_erase(&child->rb_node_in, &node->rb_root_in); in free_callchain_node()
1478 free_callchain_node(child); in free_callchain_node()
1479 free(child); in free_callchain_node()
1488 free_callchain_node(&root->node); in free_callchain()
1491 static u64 decay_callchain_node(struct callchain_node *node) in decay_callchain_node() argument
1493 struct callchain_node *child; in decay_callchain_node() local
1497 n = rb_first(&node->rb_root_in); in decay_callchain_node()
1499 child = container_of(n, struct callchain_node, rb_node_in); in decay_callchain_node()
1501 child_hits += decay_callchain_node(child); in decay_callchain_node()
1505 node->hit = (node->hit * 7) / 8; in decay_callchain_node()
1506 node->children_hit = child_hits; in decay_callchain_node()
1508 return node->hit; in decay_callchain_node()
1516 decay_callchain_node(&root->node); in decay_callchain()
1519 int callchain_node__make_parent_list(struct callchain_node *node) in callchain_node__make_parent_list() argument
1521 struct callchain_node *parent = node->parent; in callchain_node__make_parent_list()
1526 list_for_each_entry_reverse(chain, &parent->val, list) { in callchain_node__make_parent_list()
1531 new->has_children = false; in callchain_node__make_parent_list()
1532 map__get(new->ms.map); in callchain_node__make_parent_list()
1533 list_add_tail(&new->list, &head); in callchain_node__make_parent_list()
1535 parent = parent->parent; in callchain_node__make_parent_list()
1539 list_move_tail(&chain->list, &node->parent_val); in callchain_node__make_parent_list()
1541 if (!list_empty(&node->parent_val)) { in callchain_node__make_parent_list()
1542 chain = list_first_entry(&node->parent_val, struct callchain_list, list); in callchain_node__make_parent_list()
1543 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1545 chain = list_first_entry(&node->val, struct callchain_list, list); in callchain_node__make_parent_list()
1546 chain->has_children = false; in callchain_node__make_parent_list()
1552 list_del_init(&chain->list); in callchain_node__make_parent_list()
1553 map__zput(chain->ms.map); in callchain_node__make_parent_list()
1556 return -ENOMEM; in callchain_node__make_parent_list()
1568 struct callchain_cursor_node *node; in callchain_cursor__copy() local
1570 node = callchain_cursor_current(src); in callchain_cursor__copy()
1571 if (node == NULL) in callchain_cursor__copy()
1574 rc = callchain_cursor_append(dst, node->ip, &node->ms, in callchain_cursor__copy()
1575 node->branch, &node->branch_flags, in callchain_cursor__copy()
1576 node->nr_loop_iter, in callchain_cursor__copy()
1577 node->iter_cycles, in callchain_cursor__copy()
1578 node->branch_from, node->srcline); in callchain_cursor__copy()
1594 struct callchain_cursor_node *node; in callchain_cursor_reset() local
1596 cursor->nr = 0; in callchain_cursor_reset()
1597 cursor->last = &cursor->first; in callchain_cursor_reset()
1599 for (node = cursor->first; node != NULL; node = node->next) in callchain_cursor_reset()
1600 map__zput(node->ms.map); in callchain_cursor_reset()
1622 match = match_chain_strings(base_chain->srcline, in chain_match()
1623 pair_chain->srcline); in chain_match()
1627 match = match_chain_dso_addresses(base_chain->ms.map, in chain_match()
1628 base_chain->ip, in chain_match()
1629 pair_chain->ms.map, in chain_match()
1630 pair_chain->ip); in chain_match()
1641 pair_chain = list_first_entry(&pair_cnode->val, in callchain_cnode_matched()
1645 list_for_each_entry(base_chain, &base_cnode->val, list) { in callchain_cnode_matched()
1646 if (&pair_chain->list == &pair_cnode->val) in callchain_cnode_matched()
1649 if (!base_chain->srcline || !pair_chain->srcline) { in callchain_cnode_matched()
1665 if (pair_chain && (&pair_chain->list != &pair_cnode->val)) in callchain_cnode_matched()
1673 struct rb_root *root = &he->sorted_chain; in count_callchain_hits()
1675 struct callchain_node *node; in count_callchain_hits() local
1679 node = rb_entry(rb_node, struct callchain_node, rb_node); in count_callchain_hits()
1680 chain_hits += node->hit; in count_callchain_hits()
1689 struct rb_node *next = rb_first_cached(&hists->entries); in callchain_total_hits()
1697 next = rb_next(&he->rb_node); in callchain_total_hits()
1708 list_for_each_entry(chain, &cnode->val, list) { in callchain_avg_cycles()
1709 if (chain->srcline && chain->branch_count) in callchain_avg_cycles()
1710 cycles += chain->cycles_count / chain->branch_count; in callchain_avg_cycles()