| /tools/include/linux/ |
| D | rbtree.h | 30 struct rb_root { struct
36 #define RB_ROOT (struct rb_root) { NULL, } argument
48 extern void rb_insert_color(struct rb_node *, struct rb_root *);
49 extern void rb_erase(struct rb_node *, struct rb_root *);
55 extern struct rb_node *rb_first(const struct rb_root *);
56 extern struct rb_node *rb_last(const struct rb_root *);
59 extern struct rb_node *rb_first_postorder(const struct rb_root *);
64 struct rb_root *root);
103 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init()
120 struct rb_root rb_root; member
[all …]
|
| D | rbtree_augmented.h | 35 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()
|
| D | interval_tree_generic.h | 41 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/ |
| D | rbtree.c | 76 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/ |
| D | rb_resort.h | 72 struct rb_root entries; \
92 struct rb_root *entries) \
103 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \
143 DECLARE_RESORT_RB(__name)(&__ilist->rblist.entries.rb_root, \
|
| D | annotate-data.h | 225 void annotated_data_type__tree_delete(struct rb_root *root);
228 void global_var_type__tree_delete(struct rb_root *root);
265 static inline void annotated_data_type__tree_delete(struct rb_root *root __maybe_unused) in annotated_data_type__tree_delete()
269 static inline void global_var_type__tree_delete(struct rb_root *root __maybe_unused) in global_var_type__tree_delete()
|
| D | cgroup.h | 41 struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id);
55 void read_all_cgroups(struct rb_root *root);
|
| D | env.h | 115 struct rb_root infos;
117 struct rb_root btfs;
124 struct rb_root tree;
|
| D | mem2node.h | 11 struct rb_root root;
|
| D | callchain.c | 379 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain()
420 __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()
435 rb_insert_callchain(rb_root, node, CHAIN_FLAT); 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()
447 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
456 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
465 rb_insert_callchain(&node->rb_root, child, 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
[all …]
|
| D | callchain.h | 66 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 *,
|
| D | rblist.c | 15 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()
|
| D | call-path.h | 35 struct rb_root children;
|
| D | dso.h | 148 struct rb_root cache;
179 struct rb_root data_types; in DECLARE_RC_STRUCT()
180 struct rb_root global_vars; in DECLARE_RC_STRUCT()
560 static inline struct rb_root *dso__data_types(struct dso *dso) in dso__data_types()
565 static inline struct rb_root *dso__global_vars(struct dso *dso) in dso__global_vars()
669 return !RB_EMPTY_ROOT(&RC_CHK_ACCESS(dso)->symbols.rb_root); in dso__has_symbols()
|
| D | lock-contention.h | 141 struct rb_root cgroups;
|
| D | symbol.c | 348 struct rb_node **p = &symbols->rb_root.rb_node; in __symbols__insert()
391 n = symbols->rb_root.rb_node; in symbols__find()
419 struct rb_node *n = rb_last(&symbols->rb_root); in symbols__last()
1021 static void add_module(struct module_info *mi, struct rb_root *modules) in add_module()
1039 static void delete_modules(struct rb_root *modules) in delete_modules()
1054 struct rb_root *modules) in find_module()
1078 struct rb_root *modules = arg; in __read_proc_modules()
1098 static int read_proc_modules(const char *filename, struct rb_root *modules) in read_proc_modules()
1113 struct rb_root from_modules = RB_ROOT; in compare_proc_modules()
1114 struct rb_root to_modules = RB_ROOT; in compare_proc_modules()
[all …]
|
| D | cgroup.c | 521 static struct cgroup *__cgroup__findnew(struct rb_root *root, uint64_t id, in __cgroup__findnew()
575 struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id) in __cgroup__find()
606 void read_all_cgroups(struct rb_root *root) in read_all_cgroups()
|
| D | mem2node.c | 18 static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root) in phys_entry__insert()
|
| D | hist.c | 610 p = &hists->entries_in->rb_root.rb_node; in hists__findnew_entry()
1493 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_entry()
1615 struct rb_node **p = &root->rb_root.rb_node; in hists__collapse_insert_entry()
1805 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_output_entry()
1892 struct rb_node **p = &entries->rb_root.rb_node; in __hists__insert_output_entry()
2035 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
2215 struct rb_node **p = &root->rb_root.rb_node; in resort_filtered_entry()
2408 p = &root->rb_root.rb_node; in hists__add_dummy_entry()
2452 p = &root->rb_root.rb_node; in add_dummy_hierarchy_entry()
2495 n = hists->entries_collapsed.rb_root.rb_node; in hists__find_entry()
[all …]
|
| /tools/bpf/resolve_btfids/ |
| D | main.c | 131 struct rb_root sets;
132 struct rb_root structs;
133 struct rb_root unions;
134 struct rb_root typedefs;
135 struct rb_root funcs;
177 static struct btf_id *btf_id__find(struct rb_root *root, const char *name) in btf_id__find()
197 btf_id__add(struct rb_root *root, char *name, bool unique) in btf_id__add()
277 static struct btf_id *add_symbol(struct rb_root *root, char *name, size_t size) in add_symbol()
568 struct rb_root *root; in symbols_resolve()
651 static int __symbols_patch(struct object *obj, struct rb_root *root) in __symbols_patch()
|
| /tools/perf/ |
| D | builtin-kmem.c | 75 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;
307 static struct rb_root page_caller_sorted;
[all …]
|
| /tools/perf/tests/ |
| D | hists_cumulate.c | 144 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/ |
| D | hist.c | 109 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, in __callchain__fprintf_graph()
165 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, in __callchain__fprintf_graph()
217 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, in callchain__fprintf_graph()
266 root = &cnode->rb_root; in callchain__fprintf_graph()
305 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat()
356 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, in callchain__fprintf_folded()
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 97 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/ |
| D | hists.c | 182 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()
368 static void callchain__init_have_children(struct rb_root *root) in callchain__init_have_children()
391 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root); in hist_entry__init_have_children()
516 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
[all …]
|