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
53 * -e cycles/call-graph=dwarf/
86 return -1; in parse_callchain_mode()
101 return -1; in parse_callchain_order()
122 return -1; in parse_callchain_sort_key()
139 return -1; in parse_callchain_value()
165 return -1; in get_stack_size()
195 /* parsing ok - move on to the next */ in __parse_callchain_report_opt()
215 return -1; in __parse_callchain_report_opt()
222 return -1; in __parse_callchain_report_opt()
228 return -1; in __parse_callchain_report_opt()
236 return -1; in __parse_callchain_report_opt()
255 int ret = -1; in parse_callchain_record()
260 return -ENOMEM; in parse_callchain_record()
271 param->record_mode = CALLCHAIN_FP; in parse_callchain_record()
279 param->max_stack = size; in parse_callchain_record()
288 param->record_mode = CALLCHAIN_DWARF; in parse_callchain_record()
289 param->dump_size = default_stack_dump_size; in parse_callchain_record()
297 param->dump_size = size; in parse_callchain_record()
301 param->record_mode = CALLCHAIN_LBR; in parse_callchain_record()
305 "needed for --call-graph lbr\n"); in parse_callchain_record()
308 pr_err("callchain: Unknown --call-graph option " in parse_callchain_record()
323 if (!strstarts(var, "call-graph.")) in perf_callchain_config()
325 var += sizeof("call-graph.") - 1; in perf_callchain_config()
327 if (!strcmp(var, "record-mode")) in perf_callchain_config()
329 if (!strcmp(var, "dump-size")) { in perf_callchain_config()
338 if (!strcmp(var, "print-type")){ in perf_callchain_config()
341 if (ret == -1) in perf_callchain_config()
348 if (ret == -1) in perf_callchain_config()
352 if (!strcmp(var, "sort-key")){ in perf_callchain_config()
355 if (ret == -1) in perf_callchain_config()
363 return -1; in perf_callchain_config()
366 if (!strcmp(var, "print-limit")) { in perf_callchain_config()
370 return -1; in perf_callchain_config()
381 struct rb_node **p = &root->rb_node; in rb_insert_callchain()
396 if (rnode->hit < chain->hit) in rb_insert_callchain()
397 p = &(*p)->rb_left; in rb_insert_callchain()
399 p = &(*p)->rb_right; in rb_insert_callchain()
404 p = &(*p)->rb_left; in rb_insert_callchain()
406 p = &(*p)->rb_right; in rb_insert_callchain()
414 rb_link_node(&chain->rb_node, parent, p); in rb_insert_callchain()
415 rb_insert_color(&chain->rb_node, root); in rb_insert_callchain()
419 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument
423 struct callchain_node *child; in __sort_chain_flat() local
425 n = rb_first(&node->rb_root_in); in __sort_chain_flat()
427 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
430 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
433 if (node->hit && node->hit >= min_hit) in __sort_chain_flat()
434 rb_insert_callchain(rb_root, node, CHAIN_FLAT); in __sort_chain_flat()
446 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
449 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs() argument
453 struct callchain_node *child; in __sort_chain_graph_abs() local
455 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
456 n = rb_first(&node->rb_root_in); in __sort_chain_graph_abs()
459 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
462 __sort_chain_graph_abs(child, min_hit); in __sort_chain_graph_abs()
463 if (callchain_cumul_hits(child) >= min_hit) in __sort_chain_graph_abs()
464 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs()
473 __sort_chain_graph_abs(&chain_root->node, min_hit); in sort_chain_graph_abs()
474 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs()
477 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel() argument
481 struct callchain_node *child; in __sort_chain_graph_rel() local
484 node->rb_root = RB_ROOT; in __sort_chain_graph_rel()
485 min_hit = ceil(node->children_hit * min_percent); in __sort_chain_graph_rel()
487 n = rb_first(&node->rb_root_in); in __sort_chain_graph_rel()
489 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
492 __sort_chain_graph_rel(child, min_percent); in __sort_chain_graph_rel()
493 if (callchain_cumul_hits(child) >= min_hit) in __sort_chain_graph_rel()
494 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_rel()
503 __sort_chain_graph_rel(&chain_root->node, param->min_percent / 100.0); in sort_chain_graph_rel()
504 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_rel()
509 switch (param->mode) { in callchain_register_param()
511 param->sort = sort_chain_graph_abs; in callchain_register_param()
514 param->sort = sort_chain_graph_rel; in callchain_register_param()
518 param->sort = sort_chain_flat; in callchain_register_param()
522 return -1; in callchain_register_param()
528 * Create a child for a parent. If inherit_children, then the new child
538 perror("not enough memory to create child for code path tree"); in create_child()
541 new->parent = parent; in create_child()
542 INIT_LIST_HEAD(&new->val); in create_child()
543 INIT_LIST_HEAD(&new->parent_val); in create_child()
547 struct callchain_node *child; in create_child() local
549 new->rb_root_in = parent->rb_root_in; in create_child()
550 parent->rb_root_in = RB_ROOT; in create_child()
552 n = rb_first(&new->rb_root_in); in create_child()
554 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
555 child->parent = new; in create_child()
559 /* make it the first child */ in create_child()
560 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
561 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child()
569 * Fill the node with callchain values
572 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node() argument
576 node->val_nr = cursor->nr - cursor->pos; in fill_node()
577 if (!node->val_nr) in fill_node()
578 pr_warning("Warning: empty node in callchain tree\n"); in fill_node()
588 return -1; in fill_node()
590 call->ip = cursor_node->ip; in fill_node()
591 call->ms = cursor_node->ms; in fill_node()
592 map__get(call->ms.map); in fill_node()
593 call->srcline = cursor_node->srcline; in fill_node()
595 if (cursor_node->branch) { in fill_node()
596 call->branch_count = 1; in fill_node()
598 if (cursor_node->branch_from) { in fill_node()
603 call->brtype_stat.branch_to = true; in fill_node()
605 if (cursor_node->branch_flags.predicted) in fill_node()
606 call->predicted_count = 1; in fill_node()
608 if (cursor_node->branch_flags.abort) in fill_node()
609 call->abort_count = 1; in fill_node()
611 branch_type_count(&call->brtype_stat, in fill_node()
612 &cursor_node->branch_flags, in fill_node()
613 cursor_node->branch_from, in fill_node()
614 cursor_node->ip); in fill_node()
619 call->brtype_stat.branch_to = false; in fill_node()
620 call->cycles_count = in fill_node()
621 cursor_node->branch_flags.cycles; in fill_node()
622 call->iter_count = cursor_node->nr_loop_iter; in fill_node()
623 call->iter_cycles = cursor_node->iter_cycles; in fill_node()
627 list_add_tail(&call->list, &node->val); in fill_node()
649 list_for_each_entry_safe(call, tmp, &new->val, list) { in add_child()
650 list_del_init(&call->list); in add_child()
651 map__zput(call->ms.map); in add_child()
658 new->children_hit = 0; in add_child()
659 new->hit = period; in add_child()
660 new->children_count = 0; in add_child()
661 new->count = 1; in add_child()
666 MATCH_ERROR = -1,
683 cmp = -1; in match_chain_strings()
699 * to compare just relative addresses. -acme
704 struct dso *left_dso = left_map ? left_map->dso : NULL; in match_chain_dso_addresses()
705 struct dso *right_dso = right_map ? right_map->dso : NULL; in match_chain_dso_addresses()
716 static enum match_result match_chain(struct callchain_cursor_node *node, in match_chain() argument
723 match = match_chain_strings(cnode->srcline, node->srcline); in match_chain()
726 /* otherwise fall-back to symbol-based comparison below */ in match_chain()
729 if (node->ms.sym && cnode->ms.sym) { in match_chain()
736 if (cnode->ms.sym->inlined || node->ms.sym->inlined) { in match_chain()
737 match = match_chain_strings(cnode->ms.sym->name, in match_chain()
738 node->ms.sym->name); in match_chain()
742 match = match_chain_dso_addresses(cnode->ms.map, cnode->ms.sym->start, in match_chain()
743 node->ms.map, node->ms.sym->start); in match_chain()
747 /* otherwise fall-back to IP-based comparison below */ in match_chain()
751 match = match_chain_dso_addresses(cnode->ms.map, cnode->ip, node->ms.map, node->ip); in match_chain()
755 if (match == MATCH_EQ && node->branch) { in match_chain()
756 cnode->branch_count++; in match_chain()
758 if (node->branch_from) { in match_chain()
762 cnode->brtype_stat.branch_to = true; in match_chain()
764 if (node->branch_flags.predicted) in match_chain()
765 cnode->predicted_count++; in match_chain()
767 if (node->branch_flags.abort) in match_chain()
768 cnode->abort_count++; in match_chain()
770 branch_type_count(&cnode->brtype_stat, in match_chain()
771 &node->branch_flags, in match_chain()
772 node->branch_from, in match_chain()
773 node->ip); in match_chain()
778 cnode->brtype_stat.branch_to = false; in match_chain()
779 cnode->cycles_count += node->branch_flags.cycles; in match_chain()
780 cnode->iter_count += node->nr_loop_iter; in match_chain()
781 cnode->iter_cycles += node->iter_cycles; in match_chain()
782 cnode->from_count++; in match_chain()
790 * Split the parent in two parts (a new child is created) and
791 * give a part of its callchain to the created child.
792 * Then create another child to host the given callchain of new branch
807 return -1; in split_add_child()
809 /* split the callchain and move a part to the new child */ in split_add_child()
810 old_tail = parent->val.prev; in split_add_child()
811 list_del_range(&to_split->list, old_tail); in split_add_child()
812 new->val.next = &to_split->list; in split_add_child()
813 new->val.prev = old_tail; in split_add_child()
814 to_split->list.prev = &new->val; in split_add_child()
815 old_tail->next = &new->val; in split_add_child()
818 new->hit = parent->hit; in split_add_child()
819 new->children_hit = parent->children_hit; in split_add_child()
820 parent->children_hit = callchain_cumul_hits(new); in split_add_child()
821 new->val_nr = parent->val_nr - idx_local; in split_add_child()
822 parent->val_nr = idx_local; in split_add_child()
823 new->count = parent->count; in split_add_child()
824 new->children_count = parent->children_count; in split_add_child()
825 parent->children_count = callchain_cumul_counts(new); in split_add_child()
827 /* create a new child for the new branch if any */ in split_add_child()
828 if (idx_total < cursor->nr) { in split_add_child()
831 struct callchain_cursor_node *node; in split_add_child() local
834 parent->hit = 0; in split_add_child()
835 parent->children_hit += period; in split_add_child()
836 parent->count = 0; in split_add_child()
837 parent->children_count += 1; in split_add_child()
839 node = callchain_cursor_current(cursor); in split_add_child()
842 return -1; in split_add_child()
845 * This is second child since we moved parent's children in split_add_child()
846 * to new (first) child above. in split_add_child()
848 p = parent->rb_root_in.rb_node; in split_add_child()
850 cnode = list_first_entry(&first->val, struct callchain_list, in split_add_child()
853 if (match_chain(node, cnode) == MATCH_LT) in split_add_child()
854 pp = &p->rb_left; in split_add_child()
856 pp = &p->rb_right; in split_add_child()
858 rb_link_node(&new->rb_node_in, p, pp); in split_add_child()
859 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child()
861 parent->hit = period; in split_add_child()
862 parent->count = 1; in split_add_child()
878 struct callchain_cursor_node *node; in append_chain_children() local
879 struct rb_node **p = &root->rb_root_in.rb_node; in append_chain_children()
882 node = callchain_cursor_current(cursor); in append_chain_children()
883 if (!node) in append_chain_children()
884 return -1; in append_chain_children()
898 return -1; in append_chain_children()
901 p = &parent->rb_left; in append_chain_children()
903 p = &parent->rb_right; in append_chain_children()
905 /* nothing in children, add to the current node */ in append_chain_children()
908 return -1; in append_chain_children()
910 rb_link_node(&rnode->rb_node_in, parent, p); in append_chain_children()
911 rb_insert_color(&rnode->rb_node_in, &root->rb_root_in); in append_chain_children()
914 root->children_hit += period; in append_chain_children()
915 root->children_count++; in append_chain_children()
925 u64 start = cursor->pos; in append_chain()
931 * Lookup in the current node in append_chain()
936 list_for_each_entry(cnode, &root->val, list) { in append_chain()
937 struct callchain_cursor_node *node; in append_chain() local
939 node = callchain_cursor_current(cursor); in append_chain()
940 if (!node) in append_chain()
943 cmp = match_chain(node, cnode); in append_chain()
958 matches = cursor->pos - start; in append_chain()
960 /* we match only a part of the node. Split it and add the new chain */ in append_chain()
961 if (matches < root->val_nr) { in append_chain()
970 if (matches == root->val_nr && cursor->pos == cursor->nr) { in append_chain()
971 root->hit += period; in append_chain()
972 root->count++; in append_chain()
976 /* We match the node and still have a part remaining */ in append_chain()
987 if (!cursor->nr) in callchain_append()
992 if (append_chain_children(&root->node, cursor, period) < 0) in callchain_append()
993 return -1; in callchain_append()
995 if (cursor->nr > root->max_depth) in callchain_append()
996 root->max_depth = cursor->nr; in callchain_append()
1005 struct callchain_cursor_node **old_last = cursor->last; in merge_chain_branch()
1006 struct callchain_node *child; in merge_chain_branch() local
1009 int old_pos = cursor->nr; in merge_chain_branch()
1012 list_for_each_entry_safe(list, next_list, &src->val, list) { in merge_chain_branch()
1013 callchain_cursor_append(cursor, list->ip, &list->ms, in merge_chain_branch()
1014 false, NULL, 0, 0, 0, list->srcline); in merge_chain_branch()
1015 list_del_init(&list->list); in merge_chain_branch()
1016 map__zput(list->ms.map); in merge_chain_branch()
1020 if (src->hit) { in merge_chain_branch()
1022 if (append_chain_children(dst, cursor, src->hit) < 0) in merge_chain_branch()
1023 return -1; in merge_chain_branch()
1026 n = rb_first(&src->rb_root_in); in merge_chain_branch()
1028 child = container_of(n, struct callchain_node, rb_node_in); in merge_chain_branch()
1030 rb_erase(&child->rb_node_in, &src->rb_root_in); in merge_chain_branch()
1032 err = merge_chain_branch(cursor, dst, child); in merge_chain_branch()
1036 free(child); in merge_chain_branch()
1039 cursor->nr = old_pos; in merge_chain_branch()
1040 cursor->last = old_last; in merge_chain_branch()
1048 return merge_chain_branch(cursor, &dst->node, &src->node); in callchain_merge()
1057 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
1059 if (!node) { in callchain_cursor_append()
1060 node = calloc(1, sizeof(*node)); in callchain_cursor_append()
1061 if (!node) in callchain_cursor_append()
1062 return -ENOMEM; in callchain_cursor_append()
1064 *cursor->last = node; in callchain_cursor_append()
1067 node->ip = ip; in callchain_cursor_append()
1068 map__zput(node->ms.map); in callchain_cursor_append()
1069 node->ms = *ms; in callchain_cursor_append()
1070 map__get(node->ms.map); in callchain_cursor_append()
1071 node->branch = branch; in callchain_cursor_append()
1072 node->nr_loop_iter = nr_loop_iter; in callchain_cursor_append()
1073 node->iter_cycles = iter_cycles; in callchain_cursor_append()
1074 node->srcline = srcline; in callchain_cursor_append()
1077 memcpy(&node->branch_flags, flags, in callchain_cursor_append()
1080 node->branch_from = branch_from; in callchain_cursor_append()
1081 cursor->nr++; in callchain_cursor_append()
1083 cursor->last = &node->next; in callchain_cursor_append()
1093 if (sample->callchain == NULL && !symbol_conf.show_branchflag_count) in sample__resolve_callchain()
1098 return thread__resolve_callchain(al->thread, cursor, evsel, sample, in sample__resolve_callchain()
1106 if ((!symbol_conf.use_callchain || sample->callchain == NULL) && in hist_entry__append_callchain()
1109 return callchain_append(he->callchain, &callchain_cursor, sample->period); in hist_entry__append_callchain()
1112 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, in fill_callchain_info() argument
1115 al->maps = node->ms.maps; in fill_callchain_info()
1116 al->map = node->ms.map; in fill_callchain_info()
1117 al->sym = node->ms.sym; in fill_callchain_info()
1118 al->srcline = node->srcline; in fill_callchain_info()
1119 al->addr = node->ip; in fill_callchain_info()
1121 if (al->sym == NULL) { in fill_callchain_info()
1124 if (al->map == NULL) in fill_callchain_info()
1128 if (al->maps == machine__kernel_maps(al->maps->machine)) { in fill_callchain_info()
1129 if (machine__is_host(al->maps->machine)) { in fill_callchain_info()
1130 al->cpumode = PERF_RECORD_MISC_KERNEL; in fill_callchain_info()
1131 al->level = 'k'; in fill_callchain_info()
1133 al->cpumode = PERF_RECORD_MISC_GUEST_KERNEL; in fill_callchain_info()
1134 al->level = 'g'; in fill_callchain_info()
1137 if (machine__is_host(al->maps->machine)) { in fill_callchain_info()
1138 al->cpumode = PERF_RECORD_MISC_USER; in fill_callchain_info()
1139 al->level = '.'; in fill_callchain_info()
1141 al->cpumode = PERF_RECORD_MISC_GUEST_USER; in fill_callchain_info()
1142 al->level = 'u'; in fill_callchain_info()
1144 al->cpumode = PERF_RECORD_MISC_HYPERVISOR; in fill_callchain_info()
1145 al->level = 'H'; in fill_callchain_info()
1160 if (cl->ms.sym) { in callchain_list__sym_name()
1161 const char *inlined = cl->ms.sym->inlined ? " (inlined)" : ""; in callchain_list__sym_name()
1163 if (show_srcline && cl->srcline) in callchain_list__sym_name()
1165 cl->ms.sym->name, cl->srcline, in callchain_list__sym_name()
1169 cl->ms.sym->name, inlined); in callchain_list__sym_name()
1171 printed = scnprintf(bf, bfsize, "%#" PRIx64, cl->ip); in callchain_list__sym_name()
1174 scnprintf(bf + printed, bfsize - printed, " %s", in callchain_list__sym_name()
1175 cl->ms.map ? in callchain_list__sym_name()
1176 cl->ms.map->dso->short_name : in callchain_list__sym_name()
1182 char *callchain_node__scnprintf_value(struct callchain_node *node, in callchain_node__scnprintf_value() argument
1186 u64 period = callchain_cumul_hits(node); in callchain_node__scnprintf_value()
1187 unsigned count = callchain_cumul_counts(node); in callchain_node__scnprintf_value()
1190 period = node->hit; in callchain_node__scnprintf_value()
1191 count = node->count; in callchain_node__scnprintf_value()
1211 int callchain_node__fprintf_value(struct callchain_node *node, in callchain_node__fprintf_value() argument
1215 u64 period = callchain_cumul_hits(node); in callchain_node__fprintf_value()
1216 unsigned count = callchain_cumul_counts(node); in callchain_node__fprintf_value()
1219 period = node->hit; in callchain_node__fprintf_value()
1220 count = node->count; in callchain_node__fprintf_value()
1237 static void callchain_counts_value(struct callchain_node *node, in callchain_counts_value() argument
1243 list_for_each_entry(clist, &node->val, list) { in callchain_counts_value()
1245 *branch_count += clist->branch_count; in callchain_counts_value()
1248 *predicted_count += clist->predicted_count; in callchain_counts_value()
1251 *abort_count += clist->abort_count; in callchain_counts_value()
1254 *cycles_count += clist->cycles_count; in callchain_counts_value()
1258 static int callchain_node_branch_counts_cumul(struct callchain_node *node, in callchain_node_branch_counts_cumul() argument
1264 struct callchain_node *child; in callchain_node_branch_counts_cumul() local
1267 n = rb_first(&node->rb_root_in); in callchain_node_branch_counts_cumul()
1269 child = rb_entry(n, struct callchain_node, rb_node_in); in callchain_node_branch_counts_cumul()
1272 callchain_node_branch_counts_cumul(child, branch_count, in callchain_node_branch_counts_cumul()
1277 callchain_counts_value(child, branch_count, in callchain_node_branch_counts_cumul()
1301 return callchain_node_branch_counts_cumul(&root->node, in callchain_branch_counts()
1336 bf + printed, bfsize - printed, 0.0); in branch_to_str()
1342 bf + printed, bfsize - printed, 0.1); in branch_to_str()
1346 printed += scnprintf(bf + printed, bfsize - printed, ")"); in branch_to_str()
1363 bf + printed, bfsize - printed); in branch_from_str()
1370 v, bf + printed, bfsize - printed); in branch_from_str()
1374 bf + printed, bfsize - printed); in branch_from_str()
1379 printed += scnprintf(bf + printed, bfsize - printed, ")"); in branch_from_str()
1396 if (brtype_stat->branch_to) { in counts_str_build()
1438 branch_count = clist->branch_count; in callchain_list_counts__printf_value()
1439 predicted_count = clist->predicted_count; in callchain_list_counts__printf_value()
1440 abort_count = clist->abort_count; in callchain_list_counts__printf_value()
1441 cycles_count = clist->cycles_count; in callchain_list_counts__printf_value()
1442 iter_count = clist->iter_count; in callchain_list_counts__printf_value()
1443 iter_cycles = clist->iter_cycles; in callchain_list_counts__printf_value()
1444 from_count = clist->from_count; in callchain_list_counts__printf_value()
1449 from_count, &clist->brtype_stat); in callchain_list_counts__printf_value()
1452 static void free_callchain_node(struct callchain_node *node) in free_callchain_node() argument
1455 struct callchain_node *child; in free_callchain_node() local
1458 list_for_each_entry_safe(list, tmp, &node->parent_val, list) { in free_callchain_node()
1459 list_del_init(&list->list); in free_callchain_node()
1460 map__zput(list->ms.map); in free_callchain_node()
1464 list_for_each_entry_safe(list, tmp, &node->val, list) { in free_callchain_node()
1465 list_del_init(&list->list); in free_callchain_node()
1466 map__zput(list->ms.map); in free_callchain_node()
1470 n = rb_first(&node->rb_root_in); in free_callchain_node()
1472 child = container_of(n, struct callchain_node, rb_node_in); in free_callchain_node()
1474 rb_erase(&child->rb_node_in, &node->rb_root_in); in free_callchain_node()
1476 free_callchain_node(child); in free_callchain_node()
1477 free(child); in free_callchain_node()
1486 free_callchain_node(&root->node); in free_callchain()
1489 static u64 decay_callchain_node(struct callchain_node *node) in decay_callchain_node() argument
1491 struct callchain_node *child; in decay_callchain_node() local
1495 n = rb_first(&node->rb_root_in); in decay_callchain_node()
1497 child = container_of(n, struct callchain_node, rb_node_in); in decay_callchain_node()
1499 child_hits += decay_callchain_node(child); in decay_callchain_node()
1503 node->hit = (node->hit * 7) / 8; in decay_callchain_node()
1504 node->children_hit = child_hits; in decay_callchain_node()
1506 return node->hit; in decay_callchain_node()
1514 decay_callchain_node(&root->node); in decay_callchain()
1517 int callchain_node__make_parent_list(struct callchain_node *node) in callchain_node__make_parent_list() argument
1519 struct callchain_node *parent = node->parent; in callchain_node__make_parent_list()
1524 list_for_each_entry_reverse(chain, &parent->val, list) { in callchain_node__make_parent_list()
1529 new->has_children = false; in callchain_node__make_parent_list()
1530 map__get(new->ms.map); in callchain_node__make_parent_list()
1531 list_add_tail(&new->list, &head); in callchain_node__make_parent_list()
1533 parent = parent->parent; in callchain_node__make_parent_list()
1537 list_move_tail(&chain->list, &node->parent_val); in callchain_node__make_parent_list()
1539 if (!list_empty(&node->parent_val)) { in callchain_node__make_parent_list()
1540 chain = list_first_entry(&node->parent_val, struct callchain_list, list); in callchain_node__make_parent_list()
1541 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1543 chain = list_first_entry(&node->val, struct callchain_list, list); in callchain_node__make_parent_list()
1544 chain->has_children = false; in callchain_node__make_parent_list()
1550 list_del_init(&chain->list); in callchain_node__make_parent_list()
1551 map__zput(chain->ms.map); in callchain_node__make_parent_list()
1554 return -ENOMEM; in callchain_node__make_parent_list()
1566 struct callchain_cursor_node *node; in callchain_cursor__copy() local
1568 node = callchain_cursor_current(src); in callchain_cursor__copy()
1569 if (node == NULL) in callchain_cursor__copy()
1572 rc = callchain_cursor_append(dst, node->ip, &node->ms, in callchain_cursor__copy()
1573 node->branch, &node->branch_flags, in callchain_cursor__copy()
1574 node->nr_loop_iter, in callchain_cursor__copy()
1575 node->iter_cycles, in callchain_cursor__copy()
1576 node->branch_from, node->srcline); in callchain_cursor__copy()
1592 struct callchain_cursor_node *node; in callchain_cursor_reset() local
1594 cursor->nr = 0; in callchain_cursor_reset()
1595 cursor->last = &cursor->first; in callchain_cursor_reset()
1597 for (node = cursor->first; node != NULL; node = node->next) in callchain_cursor_reset()
1598 map__zput(node->ms.map); in callchain_cursor_reset()
1632 match = match_chain_strings(base_chain->srcline, in chain_match()
1633 pair_chain->srcline); in chain_match()
1637 match = match_chain_dso_addresses(base_chain->ms.map, in chain_match()
1638 base_chain->ip, in chain_match()
1639 pair_chain->ms.map, in chain_match()
1640 pair_chain->ip); in chain_match()
1651 pair_chain = list_first_entry(&pair_cnode->val, in callchain_cnode_matched()
1655 list_for_each_entry(base_chain, &base_cnode->val, list) { in callchain_cnode_matched()
1656 if (&pair_chain->list == &pair_cnode->val) in callchain_cnode_matched()
1659 if (!base_chain->srcline || !pair_chain->srcline) { in callchain_cnode_matched()
1675 if (pair_chain && (&pair_chain->list != &pair_cnode->val)) in callchain_cnode_matched()
1683 struct rb_root *root = &he->sorted_chain; in count_callchain_hits()
1685 struct callchain_node *node; in count_callchain_hits() local
1689 node = rb_entry(rb_node, struct callchain_node, rb_node); in count_callchain_hits()
1690 chain_hits += node->hit; in count_callchain_hits()
1699 struct rb_node *next = rb_first_cached(&hists->entries); in callchain_total_hits()
1707 next = rb_next(&he->rb_node); in callchain_total_hits()
1718 list_for_each_entry(chain, &cnode->val, list) { in callchain_avg_cycles()
1719 if (chain->srcline && chain->branch_count) in callchain_avg_cycles()
1720 cycles += chain->cycles_count / chain->branch_count; in callchain_avg_cycles()