Home
last modified time | relevance | path

Searched refs:rb_first (Results 1 – 24 of 24) sorted by relevance

/tools/perf/ui/gtk/
A Dhists.c101 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat()
103 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
224 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph()
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
/tools/perf/ui/browsers/
A Dmap.c122 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
A Dhists.c182 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
265 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows()
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()
370 struct rb_node *nd = rb_first(root); in callchain__init_have_children()
373 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children()
557 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
921 node = rb_first(root); in hist_browser__show_callchain_flat()
1025 node = rb_first(root); in hist_browser__show_callchain_folded()
1114 node = rb_first(root); in hist_browser__show_callchain_graph()
[all …]
A Dannotate.c863 nd = rb_first(&browser->entries); in annotate_browser__run()
/tools/perf/util/
A Dcallchain.c426 n = rb_first(&node->rb_root_in); in __sort_chain_flat()
457 n = rb_first(&node->rb_root_in); in __sort_chain_graph_abs()
488 n = rb_first(&node->rb_root_in); in __sort_chain_graph_rel()
553 n = rb_first(&new->rb_root_in); in create_child()
1052 n = rb_first(&src->rb_root_in); in merge_chain_branch()
1295 n = rb_first(&node->rb_root_in); in callchain_node_branch_counts_cumul()
1503 n = rb_first(&node->rb_root_in); in free_callchain_node()
1528 n = rb_first(&node->rb_root_in); in decay_callchain_node()
1755 struct rb_node *rb_node = rb_first(root); in count_callchain_hits()
A Denv.c100 first = rb_first(&env->bpf_progs.infos); in perf_env__iterate_bpf_prog_info()
182 next = rb_first(root); in perf_env__purge_bpf()
198 next = rb_first(root); in perf_env__purge_bpf()
A Dblock-range.c18 for (rb = rb_first(&block_ranges.root); rb; rb = rb_next(rb)) { in block_range__debug()
A Dstream.c102 struct rb_node *rb_node = rb_first(root); in update_hot_callchain()
A Dcgroup.c590 node = rb_first(&env->cgroups.tree); in perf_env__purge_cgroups()
A Dsymbol.c1059 struct rb_node *next = rb_first(modules); in delete_modules()
1142 from_node = rb_first(&from_modules); in compare_proc_modules()
1143 to_node = rb_first(&to_modules); in compare_proc_modules()
A Dannotate-data.c697 struct rb_node *node = rb_first(root); in global_var_type__tree_delete()
1706 struct rb_node *node = rb_first(root); in annotated_data_type__tree_delete()
A Dbpf_lock_contention.c841 struct rb_node *node = rb_first(&con->cgroups); in lock_contention_finish()
A Dheader.c1034 next = rb_first(root); in write_bpf_prog_info()
1080 next = rb_first(root); in write_bpf_btf()
1823 next = rb_first(root); in print_bpf_prog_info()
1850 next = rb_first(root); in print_bpf_btf()
A Dannotate.c1136 node = rb_first(src_root); in resort_source_line()
1162 node = rb_first(root); in print_summary()
A Ddso.c887 struct rb_node *next = rb_first(root); in dso_cache__free()
A Dintel-pt.c368 n = rb_first(&pt->vmcs_info); in intel_pt_free_vmcs_info()
/tools/perf/ui/stdio/
A Dhist.c129 node = rb_first(root); in __callchain__fprintf_graph()
234 node = rb_first(root); in callchain__fprintf_graph()
315 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat()
366 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_folded()
/tools/perf/tests/
A Dhists_cumulate.c216 for (node = rb_first(root), i = 0; in do_test()
238 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
/tools/include/linux/
A Drbtree.h55 extern struct rb_node *rb_first(const struct rb_root *);
/tools/bpf/resolve_btfids/
A Dmain.c660 next = rb_first(root); in __symbols_patch()
684 next = rb_first(&obj->sets); in sets_patch()
/tools/perf/
A Dbuiltin-kmem.c1011 next = rb_first(root); in __print_slab_result()
1064 struct rb_node *next = rb_first(&page_alloc_sorted); in __print_page_alloc_result()
1113 struct rb_node *next = rb_first(&page_caller_sorted); in __print_page_caller_result()
1300 node = rb_first(root); in __sort_slab_result()
1347 node = rb_first(root); in __sort_page_result()
A Dbuiltin-lock.c1346 node = rb_first(&thread_stats); in dump_threads()
/tools/perf/ui/
A Dbrowser.c145 nd = rb_first(root); in ui_browser__rb_tree_seek()
174 browser->top = rb_first(browser->entries); in ui_browser__rb_tree_refresh()
/tools/lib/
A Drbtree.c462 struct rb_node *rb_first(const struct rb_root *root) in rb_first() function

Completed in 75 milliseconds