Lines Matching refs:node

177 static int callchain_node__count_rows_rb_tree(struct callchain_node *node)  in callchain_node__count_rows_rb_tree()  argument
182 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
203 static int callchain_node__count_flat_rows(struct callchain_node *node) in callchain_node__count_flat_rows() argument
209 list_for_each_entry(chain, &node->parent_val, list) { in callchain_node__count_flat_rows()
219 list_for_each_entry(chain, &node->val, list) { in callchain_node__count_flat_rows()
232 static int callchain_node__count_folded_rows(struct callchain_node *node __maybe_unused) in callchain_node__count_folded_rows()
237 static int callchain_node__count_rows(struct callchain_node *node) in callchain_node__count_rows() argument
244 return callchain_node__count_flat_rows(node); in callchain_node__count_rows()
246 return callchain_node__count_folded_rows(node); in callchain_node__count_rows()
248 list_for_each_entry(chain, &node->val, list) { in callchain_node__count_rows()
255 n += callchain_node__count_rows_rb_tree(node); in callchain_node__count_rows()
266 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows() local
267 n += callchain_node__count_rows(node); in callchain__count_rows()
277 struct rb_node *node; in hierarchy_count_rows() local
286 node = rb_first_cached(&he->hroot_out); in hierarchy_count_rows()
287 while (node) { in hierarchy_count_rows()
290 child = rb_entry(node, struct hist_entry, rb_node); in hierarchy_count_rows()
300 node = rb_next(node); in hierarchy_count_rows()
329 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node) in callchain_node__init_have_children_rb_tree() argument
331 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree()
333 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree()
352 static void callchain_node__init_have_children(struct callchain_node *node, in callchain_node__init_have_children() argument
357 chain = list_entry(node->val.next, struct callchain_list, list); in callchain_node__init_have_children()
360 if (!list_empty(&node->val)) { in callchain_node__init_have_children()
361 chain = list_entry(node->val.prev, struct callchain_list, list); in callchain_node__init_have_children()
362 chain->has_children = !RB_EMPTY_ROOT(&node->rb_root); in callchain_node__init_have_children()
365 callchain_node__init_have_children_rb_tree(node); in callchain_node__init_have_children()
374 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__init_have_children() local
375 callchain_node__init_have_children(node, has_sibling); in callchain__init_have_children()
378 callchain_node__make_parent_list(node); in callchain__init_have_children()
511 static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold) in callchain_node__set_folding_rb_tree() argument
516 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
534 static int callchain_node__set_folding(struct callchain_node *node, bool unfold) in callchain_node__set_folding() argument
540 list_for_each_entry(chain, &node->val, list) { in callchain_node__set_folding()
547 n += callchain_node__set_folding_rb_tree(node, unfold); in callchain_node__set_folding()
558 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__set_folding() local
559 n += callchain_node__set_folding(node, unfold); in callchain__set_folding()
845 struct callchain_node *node, in hist_browser__show_callchain_list() argument
879 callchain_node__scnprintf_value(node, buf, sizeof(buf), in hist_browser__show_callchain_list()
895 static bool check_percent_display(struct rb_node *node, u64 parent_total) in check_percent_display() argument
899 if (node == NULL) in check_percent_display()
902 if (rb_next(node)) in check_percent_display()
905 child = rb_entry(node, struct callchain_node, rb_node); in check_percent_display()
917 struct rb_node *node; in hist_browser__show_callchain_flat() local
921 node = rb_first(root); in hist_browser__show_callchain_flat()
922 need_percent = check_percent_display(node, parent_total); in hist_browser__show_callchain_flat()
924 while (node) { in hist_browser__show_callchain_flat()
925 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); in hist_browser__show_callchain_flat()
926 struct rb_node *next = rb_next(node); in hist_browser__show_callchain_flat()
981 node = next; in hist_browser__show_callchain_flat()
1021 struct rb_node *node; in hist_browser__show_callchain_folded() local
1025 node = rb_first(root); in hist_browser__show_callchain_folded()
1026 need_percent = check_percent_display(node, parent_total); in hist_browser__show_callchain_folded()
1028 while (node) { in hist_browser__show_callchain_folded()
1029 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); in hist_browser__show_callchain_folded()
1030 struct rb_node *next = rb_next(node); in hist_browser__show_callchain_folded()
1092 node = next; in hist_browser__show_callchain_folded()
1106 struct rb_node *node; in hist_browser__show_callchain_graph() local
1114 node = rb_first(root); in hist_browser__show_callchain_graph()
1115 need_percent = check_percent_display(node, parent_total); in hist_browser__show_callchain_graph()
1117 while (node) { in hist_browser__show_callchain_graph()
1118 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); in hist_browser__show_callchain_graph()
1119 struct rb_node *next = rb_next(node); in hist_browser__show_callchain_graph()
1158 node = next; in hist_browser__show_callchain_graph()
3446 struct evsel *evsel = list_entry(entry, struct evsel, core.node); in perf_evsel_menu__write()
3540 if (pos->core.node.next == &evlist->core.entries) in perf_evsel_menu__run()
3546 if (pos->core.node.prev == &evlist->core.entries) in perf_evsel_menu__run()
3583 struct evsel *evsel = list_entry(entry, struct evsel, core.node); in filter_group_entries()