Home
last modified time | relevance | path

Searched refs:rb_root (Results 1 – 25 of 48) sorted by relevance

12

/tools/include/linux/
A Drbtree.h30 struct rb_root { struct
36 #define RB_ROOT (struct rb_root) { NULL, } argument
56 extern struct rb_node *rb_last(const struct rb_root *);
64 struct rb_root *root);
120 struct rb_root rb_root; member
135 rb_insert_color(node, &root->rb_root); in rb_insert_color_cached()
143 rb_erase(node, &root->rb_root); in rb_erase_cached()
152 rb_replace_node(victim, new, &root->rb_root); in rb_replace_node_cached()
181 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
206 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add()
[all …]
A Drbtree_augmented.h35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
62 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
172 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
183 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
187 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
291 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
305 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()
A Dinterval_tree_generic.h41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
124 if (!root->rb_root.rb_node) \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
/tools/lib/
A Drbtree.c76 struct rb_root *root, int color) in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
410 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color()
433 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
438 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
453 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
462 struct rb_node *rb_first(const struct rb_root *root) in rb_first()
474 struct rb_node *rb_last(const struct rb_root *root) in rb_last()
546 struct rb_root *root) in rb_replace_node()
[all …]
/tools/perf/util/
A Dannotate-data.h225 void annotated_data_type__tree_delete(struct rb_root *root);
228 void global_var_type__tree_delete(struct rb_root *root);
270 static inline void annotated_data_type__tree_delete(struct rb_root *root __maybe_unused) in annotated_data_type__tree_delete()
274 static inline void global_var_type__tree_delete(struct rb_root *root __maybe_unused) in global_var_type__tree_delete()
A Dcgroup.h40 struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id);
54 void read_all_cgroups(struct rb_root *root);
A Denv.h113 struct rb_root infos;
115 struct rb_root btfs;
122 struct rb_root tree;
A Dmem2node.h11 struct rb_root root;
A Dcallchain.c420 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument
431 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
443 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument
446 *rb_root = RB_ROOT; in sort_chain_flat()
456 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
471 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, in sort_chain_graph_abs() argument
475 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs()
485 node->rb_root = RB_ROOT; in __sort_chain_graph_rel()
501 sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root, in sort_chain_graph_rel() argument
505 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_rel()
[all …]
A Dcallchain.h66 struct rb_root rb_root_in; /* input tree of children */
67 struct rb_root rb_root; /* sorted output tree of children */ member
82 typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
A Drblist.c15 struct rb_node **p = &rblist->entries.rb_root.rb_node; in rblist__add_node()
57 struct rb_node **p = &rblist->entries.rb_root.rb_node; in __rblist__findnew()
A Dcall-path.h35 struct rb_root children;
A Ddso.h225 struct rb_root cache;
258 struct rb_root data_types; in DECLARE_RC_STRUCT()
259 struct rb_root global_vars; in DECLARE_RC_STRUCT()
632 static inline struct rb_root *dso__data_types(struct dso *dso) in dso__data_types()
637 static inline struct rb_root *dso__global_vars(struct dso *dso) in dso__global_vars()
738 return !RB_EMPTY_ROOT(&RC_CHK_ACCESS(dso)->symbols.rb_root); in dso__has_symbols()
A Dlock-contention.h151 struct rb_root cgroups;
A Dsymbol.c365 struct rb_node **p = &symbols->rb_root.rb_node; in __symbols__insert()
408 n = symbols->rb_root.rb_node; in symbols__find()
436 struct rb_node *n = rb_last(&symbols->rb_root); in symbols__last()
1038 static void add_module(struct module_info *mi, struct rb_root *modules) in add_module()
1056 static void delete_modules(struct rb_root *modules) in delete_modules()
1071 struct rb_root *modules) in find_module()
1095 struct rb_root *modules = arg; in __read_proc_modules()
1130 struct rb_root from_modules = RB_ROOT; in compare_proc_modules()
1131 struct rb_root to_modules = RB_ROOT; in compare_proc_modules()
1171 struct rb_root *modules = data; in do_validate_kcore_modules_cb()
[all …]
A Dcgroup.c514 static struct cgroup *__cgroup__findnew(struct rb_root *root, uint64_t id, in __cgroup__findnew()
568 struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id) in __cgroup__find()
599 void read_all_cgroups(struct rb_root *root) in read_all_cgroups()
A Dhist.c694 p = &hists->entries_in->rb_root.rb_node; in hists__findnew_entry()
1457 struct rb_root *root = &he->hroot_out.rb_root; in hist_entry__delete()
1631 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_entry()
1752 struct rb_node **p = &root->rb_root.rb_node; in hists__collapse_insert_entry()
1935 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_output_entry()
2165 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
2558 p = &root->rb_root.rb_node; in hists__add_dummy_entry()
2601 p = &root->rb_root.rb_node; in add_dummy_hierarchy_entry()
2641 n = hists->entries_in->rb_root.rb_node; in hists__find_entry()
2661 struct rb_node *n = root->rb_root.rb_node; in hists__find_hierarchy_entry()
[all …]
A Dmem2node.c18 static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root) in phys_entry__insert()
A Dsrcline.c979 struct rb_node **p = &tree->rb_root.rb_node; in srcline__tree_insert()
1009 struct rb_node *n = tree->rb_root.rb_node; in srcline__tree_find()
1071 struct rb_node **p = &tree->rb_root.rb_node; in inlines__tree_insert()
1093 struct rb_node *n = tree->rb_root.rb_node; in inlines__tree_find()
/tools/bpf/resolve_btfids/
A Dmain.c131 struct rb_root sets;
132 struct rb_root structs;
133 struct rb_root unions;
134 struct rb_root typedefs;
135 struct rb_root funcs;
178 static struct btf_id *btf_id__find(struct rb_root *root, const char *name) in btf_id__find()
198 btf_id__add(struct rb_root *root, char *name, bool unique) in btf_id__add()
278 static struct btf_id *add_symbol(struct rb_root *root, char *name, size_t size) in add_symbol()
569 struct rb_root *root; in symbols_resolve()
655 static int __symbols_patch(struct object *obj, struct rb_root *root) in __symbols_patch()
/tools/perf/
A Dbuiltin-kmem.c75 static struct rb_root root_alloc_stat;
76 static struct rb_root root_alloc_sorted;
77 static struct rb_root root_caller_stat;
78 static struct rb_root root_caller_sorted;
223 struct rb_root *root, in search_alloc_stat()
303 static struct rb_root page_live_tree;
304 static struct rb_root page_alloc_tree;
305 static struct rb_root page_alloc_sorted;
306 static struct rb_root page_caller_tree;
1293 static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted, in __sort_slab_result()
[all …]
/tools/perf/tests/
A Dhists_cumulate.c144 while (!RB_EMPTY_ROOT(&root_out->rb_root)) { in del_hist_entries()
196 struct rb_root *root; in do_test()
215 root = &hists->entries.rb_root; in do_test()
235 root = &he->callchain->node.rb_root; in do_test()
/tools/perf/ui/stdio/
A Dhist.c113 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, in __callchain__fprintf_graph()
169 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, in __callchain__fprintf_graph()
221 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, in callchain__fprintf_graph()
270 root = &cnode->rb_root; in callchain__fprintf_graph()
309 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat()
360 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, in callchain__fprintf_folded()
/tools/perf/ui/gtk/
A Dhists.c97 static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_flat()
160 static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_folded()
220 static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_graph()
265 perf_gtk__add_callchain_graph(&node->rb_root, store, &iter, col, in perf_gtk__add_callchain_graph()
270 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain()
/tools/perf/ui/browsers/
A Dhists.c182 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
260 static int callchain__count_rows(struct rb_root *chain) 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()
342 !RB_EMPTY_ROOT(&child->rb_root); in callchain_node__init_have_children_rb_tree()
345 !RB_EMPTY_ROOT(&child->rb_root); in callchain_node__init_have_children_rb_tree()
362 chain->has_children = !RB_EMPTY_ROOT(&node->rb_root); in callchain_node__init_have_children()
391 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root); in hist_entry__init_have_children()
910 struct rb_root *root, in hist_browser__show_callchain_flat()
1014 struct rb_root *root, in hist_browser__show_callchain_folded()
[all …]

Completed in 49 milliseconds

12