| /tools/include/linux/ |
| D | rbtree.h | 42 struct rb_root { struct
49 #define RB_ROOT (struct rb_root) { NULL, } argument
61 extern void rb_insert_color(struct rb_node *, struct rb_root *);
62 extern void rb_erase(struct rb_node *, struct rb_root *);
68 extern struct rb_node *rb_first(const struct rb_root *);
69 extern struct rb_node *rb_last(const struct rb_root *);
72 extern struct rb_node *rb_first_postorder(const struct rb_root *);
77 struct rb_root *root);
99 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init()
|
| D | rbtree_augmented.h | 47 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
60 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
125 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
136 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
140 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
237 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
|
| /tools/lib/ |
| D | rbtree.c | 63 struct rb_root *root, int color) in __rb_rotate_set_parents()
72 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
201 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
363 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color()
384 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
389 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
404 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
413 struct rb_node *rb_first(const struct rb_root *root) in rb_first()
425 struct rb_node *rb_last(const struct rb_root *root) in rb_last()
497 struct rb_root *root) in rb_replace_node()
[all …]
|
| /tools/perf/util/ |
| D | callchain.c | 226 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain()
267 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument
278 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
282 rb_insert_callchain(rb_root, node, CHAIN_FLAT); in __sort_chain_flat()
290 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument
293 *rb_root = RB_ROOT; in sort_chain_flat()
294 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
303 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
312 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs()
318 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, in sort_chain_graph_abs() argument
[all …]
|
| D | rb_resort.h | 71 struct rb_root entries; \
91 struct rb_root *entries) \
102 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \
|
| D | callchain.h | 59 struct rb_root rb_root_in; /* input tree of children */
60 struct rb_root rb_root; /* sorted output tree of children */ member
75 typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
|
| D | dso.h | 129 struct rb_root root; /* rbtree root sorted by long name */
139 struct rb_root *root; /* root of rbtree that rb_node is in */
140 struct rb_root symbols[MAP__NR_TYPES];
141 struct rb_root symbol_names[MAP__NR_TYPES];
176 struct rb_root cache;
|
| D | symbol.c | 151 void symbols__fixup_duplicate(struct rb_root *symbols) in symbols__fixup_duplicate()
185 void symbols__fixup_end(struct rb_root *symbols) in symbols__fixup_end()
267 void symbols__delete(struct rb_root *symbols) in symbols__delete()
280 void __symbols__insert(struct rb_root *symbols, struct symbol *sym, bool kernel) in __symbols__insert()
310 void symbols__insert(struct rb_root *symbols, struct symbol *sym) in symbols__insert()
315 static struct symbol *symbols__find(struct rb_root *symbols, u64 ip) in symbols__find()
338 static struct symbol *symbols__first(struct rb_root *symbols) in symbols__first()
348 static struct symbol *symbols__last(struct rb_root *symbols) in symbols__last()
368 static void symbols__insert_by_name(struct rb_root *symbols, struct symbol *sym) in symbols__insert_by_name()
388 static void symbols__sort_by_name(struct rb_root *symbols, in symbols__sort_by_name()
[all …]
|
| D | symbol.h | 66 void symbols__delete(struct rb_root *symbols);
303 void __symbols__insert(struct rb_root *symbols, struct symbol *sym, bool kernel);
304 void symbols__insert(struct rb_root *symbols, struct symbol *sym);
305 void symbols__fixup_duplicate(struct rb_root *symbols);
306 void symbols__fixup_end(struct rb_root *symbols);
|
| D | sort.h | 138 struct rb_root hroot_in;
139 struct rb_root hroot_out;
141 struct rb_root sorted_chain; /* leaf entry has callchains */
|
| D | comm.c | 14 static struct rb_root comm_str_root;
51 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) in comm_str__findnew()
|
| D | call-path.h | 44 struct rb_root children;
|
| D | rblist.h | 22 struct rb_root entries;
|
| D | hist.c | 301 struct rb_root *root_in; in hists__delete_entry()
302 struct rb_root *root_out; in hists__delete_entry()
1262 struct rb_root *root, in hierarchy_insert_entry()
1331 struct rb_root *root, in hists__hierarchy_insert_entry()
1377 struct rb_root *root, in hists__collapse_insert_entry()
1424 struct rb_root *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in()
1426 struct rb_root *root; in hists__get_rotate_entries_in()
1449 struct rb_root *root; in hists__collapse_resort()
1560 static void hierarchy_insert_output_entry(struct rb_root *root, in hierarchy_insert_output_entry()
1590 struct rb_root *root_in, in hists__hierarchy_output_resort()
[all …]
|
| D | hist.h | 66 struct rb_root entries_in_array[2];
67 struct rb_root *entries_in;
68 struct rb_root entries;
69 struct rb_root entries_collapsed;
221 struct rb_root *hists__get_rotate_entries_in(struct hists *hists);
|
| D | kvm-stat.h | 97 struct rb_root result;
|
| D | machine.h | 33 struct rb_root threads;
111 struct rb_root guests;
|
| D | dso.c | 574 struct rb_root *root = &dso->data.cache; in dso_cache__free()
591 const struct rb_root *root = &dso->data.cache; in dso_cache__find()
617 struct rb_root *root = &dso->data.cache; in dso_cache__insert()
909 static struct dso *__dso__findlink_by_longname(struct rb_root *root, in __dso__findlink_by_longname()
958 static inline struct dso *__dso__find_by_longname(struct rb_root *root, in __dso__find_by_longname()
966 struct rb_root *root = dso->root; in dso__set_long_name()
|
| /tools/perf/ |
| D | builtin-kmem.c | 60 static struct rb_root root_alloc_stat;
61 static struct rb_root root_alloc_sorted;
62 static struct rb_root root_caller_stat;
63 static struct rb_root root_caller_sorted;
193 struct rb_root *root, in search_alloc_stat()
272 static struct rb_root page_live_tree;
273 static struct rb_root page_alloc_tree;
274 static struct rb_root page_alloc_sorted;
275 static struct rb_root page_caller_tree;
276 static struct rb_root page_caller_sorted;
[all …]
|
| /tools/perf/tests/ |
| D | hists_output.c | 91 struct rb_root *root_in; in del_hist_entries()
92 struct rb_root *root_out; in del_hist_entries()
126 struct rb_root *root; in test1()
228 struct rb_root *root; in test2()
284 struct rb_root *root; in test3()
358 struct rb_root *root; in test4()
460 struct rb_root *root; in test5()
|
| D | hists_cumulate.c | 125 struct rb_root *root_in; in del_hist_entries()
126 struct rb_root *root_out; in del_hist_entries()
179 struct rb_root *root; in do_test()
218 root = &he->callchain->node.rb_root; in do_test()
|
| D | hists_common.c | 161 struct rb_root *root; in print_hists_in()
191 struct rb_root *root; in print_hists_out()
|
| D | hists_link.c | 142 struct rb_root *root; in __validate_match()
192 struct rb_root *root; in __validate_link()
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 92 static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_flat()
155 static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_folded()
215 static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_graph()
260 perf_gtk__add_callchain_graph(&node->rb_root, store, &iter, col, in perf_gtk__add_callchain_graph()
265 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain()
400 struct rb_root *root, in perf_gtk__add_hierarchy_entries()
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 79 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, in __callchain__fprintf_graph()
135 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, in __callchain__fprintf_graph()
187 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, in callchain__fprintf_graph()
228 root = &cnode->rb_root; in callchain__fprintf_graph()
267 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat()
318 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, in callchain__fprintf_folded()
|