| /tools/perf/util/ |
| D | callchain.c | 243 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain()
283 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument
294 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
298 rb_insert_callchain(rb_root, node, CHAIN_FLAT); in __sort_chain_flat()
306 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument
309 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
318 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
327 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs()
333 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, in sort_chain_graph_abs() argument
337 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs()
[all …]
|
| D | callchain.h | 34 struct rb_root rb_root_in; /* input tree of children */
35 struct rb_root rb_root; /* sorted output tree of children */ member
48 typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
|
| D | map.h | 61 struct rb_root maps[MAP__NR_TYPES];
148 void maps__insert(struct rb_root *maps, struct map *map);
149 void maps__remove(struct rb_root *maps, struct map *map);
150 struct map *maps__find(struct rb_root *maps, u64 addr);
151 struct map *maps__first(struct rb_root *maps);
|
| D | dso.h | 99 struct rb_root root; /* rbtree root sorted by long name */
105 struct rb_root symbols[MAP__NR_TYPES];
106 struct rb_root symbol_names[MAP__NR_TYPES];
133 struct rb_root cache;
|
| D | comm.c | 13 static struct rb_root comm_str_root;
46 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) in comm_str__findnew()
|
| D | symbol.h | 83 void symbols__delete(struct rb_root *symbols);
287 void symbols__insert(struct rb_root *symbols, struct symbol *sym);
288 void symbols__fixup_duplicate(struct rb_root *symbols);
289 void symbols__fixup_end(struct rb_root *symbols);
|
| D | symbol.c | 143 void symbols__fixup_duplicate(struct rb_root *symbols) in symbols__fixup_duplicate()
174 void symbols__fixup_end(struct rb_root *symbols) in symbols__fixup_end()
282 void symbols__delete(struct rb_root *symbols) in symbols__delete()
295 void symbols__insert(struct rb_root *symbols, struct symbol *sym) in symbols__insert()
314 static struct symbol *symbols__find(struct rb_root *symbols, u64 ip) in symbols__find()
337 static struct symbol *symbols__first(struct rb_root *symbols) in symbols__first()
362 static void symbols__insert_by_name(struct rb_root *symbols, struct symbol *sym) in symbols__insert_by_name()
382 static void symbols__sort_by_name(struct rb_root *symbols, in symbols__sort_by_name()
383 struct rb_root *source) in symbols__sort_by_name()
393 static struct symbol *symbols__find_by_name(struct rb_root *symbols, in symbols__find_by_name()
[all …]
|
| D | map.c | 231 struct rb_root *symbols = &map->dso->symbols[map->type]; in map__fixup_start()
241 struct rb_root *symbols = &map->dso->symbols[map->type]; in map__fixup_end()
427 static void maps__delete(struct rb_root *maps) in maps__delete()
501 struct rb_root *root = &mg->maps[type]; in map_groups__flush()
637 struct rb_root *root = &mg->maps[map->type]; in map_groups__fixup_overlappings()
719 void maps__insert(struct rb_root *maps, struct map *map) in maps__insert()
739 void maps__remove(struct rb_root *maps, struct map *map) in maps__remove()
744 struct map *maps__find(struct rb_root *maps, u64 ip) in maps__find()
764 struct map *maps__first(struct rb_root *maps) in maps__first()
|
| D | rblist.h | 22 struct rb_root entries;
|
| D | hist.h | 57 struct rb_root entries_in_array[2];
58 struct rb_root *entries_in;
59 struct rb_root entries;
60 struct rb_root entries_collapsed;
|
| D | kvm-stat.h | 97 struct rb_root result;
|
| D | dso.c | 375 dso_cache__free(struct rb_root *root) in dso_cache__free()
389 static struct dso_cache *dso_cache__find(const struct rb_root *root, u64 offset) in dso_cache__find()
413 dso_cache__insert(struct rb_root *root, struct dso_cache *new) in dso_cache__insert()
661 static struct dso *dso__findlink_by_longname(struct rb_root *root, in dso__findlink_by_longname()
710 dso__find_by_longname(const struct rb_root *root, const char *name) in dso__find_by_longname()
712 return dso__findlink_by_longname((struct rb_root *)root, NULL, name); in dso__find_by_longname()
|
| D | machine.h | 32 struct rb_root threads;
91 struct rb_root guests;
|
| D | hist.c | 959 struct rb_root *root, in hists__collapse_insert_entry()
999 static struct rb_root *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in()
1001 struct rb_root *root; in hists__get_rotate_entries_in()
1023 struct rb_root *root; in hists__collapse_resort()
1099 static void __hists__insert_output_entry(struct rb_root *entries, in __hists__insert_output_entry()
1127 struct rb_root *root; in hists__output_resort()
1293 struct rb_root *root; in hists__add_dummy_entry()
1364 struct rb_root *root; in hists__match()
1389 struct rb_root *root; in hists__link()
|
| D | annotate.c | 1021 static void insert_source_line(struct rb_root *root, struct source_line *src_line) in insert_source_line()
1065 static void __resort_source_line(struct rb_root *root, struct source_line *src_line) in __resort_source_line()
1085 static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root) in resort_source_line()
1124 struct rb_root *root, int len) in symbol__get_source_line()
1132 struct rb_root tmp_root = RB_ROOT; in symbol__get_source_line()
1184 static void print_summary(struct rb_root *root, const char *filename) in print_summary()
1384 struct rb_root source_line = RB_ROOT; in symbol__tty_annotate()
|
| D | sort.h | 110 struct rb_root sorted_chain;
|
| /tools/perf/ |
| D | builtin-kmem.c | 48 static struct rb_root root_alloc_stat;
49 static struct rb_root root_alloc_sorted;
50 static struct rb_root root_caller_stat;
51 static struct rb_root root_caller_sorted;
181 struct rb_root *root, in search_alloc_stat()
272 static void __print_result(struct rb_root *root, struct perf_session *session, in __print_result()
355 static void sort_insert(struct rb_root *root, struct alloc_stat *data, in sort_insert()
385 static void __sort_result(struct rb_root *root, struct rb_root *root_sorted, in __sort_result()
|
| D | builtin-diff.c | 417 struct rb_root *root; in hists__baseline_only()
439 struct rb_root *root; in hists__precompute()
547 static void insert_hist_entry_by_compute(struct rb_root *root, in insert_hist_entry_by_compute()
570 struct rb_root *root; in hists__compute_resort()
|
| /tools/perf/tests/ |
| D | hists_cumulate.c | 126 struct rb_root *root_in; in del_hist_entries()
127 struct rb_root *root_out; in del_hist_entries()
180 struct rb_root *root; in do_test()
219 root = &he->callchain->node.rb_root; in do_test()
|
| D | hists_output.c | 92 struct rb_root *root_in; in del_hist_entries()
93 struct rb_root *root_out; in del_hist_entries()
127 struct rb_root *root; in test1()
229 struct rb_root *root; in test2()
285 struct rb_root *root; in test3()
359 struct rb_root *root; in test4()
461 struct rb_root *root; in test5()
|
| D | hists_common.c | 156 struct rb_root *root; in print_hists_in()
186 struct rb_root *root; in print_hists_out()
|
| D | hists_link.c | 150 struct rb_root *root; in __validate_match()
200 struct rb_root *root; in __validate_link()
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 82 static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, in __callchain__fprintf_graph()
137 ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, in __callchain__fprintf_graph()
161 static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, in callchain__fprintf_graph()
207 root = &cnode->rb_root; in callchain__fprintf_graph()
242 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat()
|
| /tools/perf/ui/browsers/ |
| D | hists.c | 145 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
182 static int callchain__count_rows(struct rb_root *chain) in callchain__count_rows()
209 struct rb_node *nd = rb_first(&node->rb_root); in callchain_node__init_have_children_rb_tree()
211 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree()
220 !RB_EMPTY_ROOT(&child->rb_root); in callchain_node__init_have_children_rb_tree()
223 !RB_EMPTY_ROOT(&child->rb_root); in callchain_node__init_have_children_rb_tree()
236 chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root); in callchain_node__init_have_children()
242 static void callchain__init_have_children(struct rb_root *root) in callchain__init_have_children()
290 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
326 static int callchain__set_folding(struct rb_root *chain, bool unfold) in callchain__set_folding()
[all …]
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 101 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain()
150 perf_gtk__add_callchain(&node->rb_root, store, &iter, col, in perf_gtk__add_callchain()
|