| /tools/lib/ |
| D | rbtree.c | 72 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
204 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; in ____rb_erase_color() local
376 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate()
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()
437 struct rb_node *rb_next(const struct rb_node *node) in rb_next()
468 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev()
512 static struct rb_node *rb_left_deepest_node(const struct rb_node *node) in rb_left_deepest_node()
524 struct rb_node *rb_next_postorder(const struct rb_node *node) in rb_next_postorder()
|
| /tools/perf/util/ |
| D | intlist.c | 19 struct int_node *node = malloc(sizeof(*node)); in intlist__node_new() local
38 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete() local
46 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_cmp() local
56 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove()
64 struct int_node *node = NULL; in __intlist__findnew() local
138 struct int_node *node = NULL; in intlist__entry() local
|
| D | callchain.c | 406 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat()
436 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs()
464 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel()
559 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node()
658 static enum match_result match_chain_srcline(struct callchain_cursor_node *node, in match_chain_srcline()
694 static enum match_result match_chain(struct callchain_cursor_node *node, in match_chain()
799 struct callchain_cursor_node *node; in split_add_child() local
846 struct callchain_cursor_node *node; in append_chain_children() local
905 struct callchain_cursor_node *node; in append_chain() local
1025 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
[all …]
|
| D | strfilter.c | 17 static void strfilter_node__delete(struct strfilter_node *node) in strfilter_node__delete()
69 struct strfilter_node *node = zalloc(sizeof(*node)); in strfilter_node__alloc() local
217 static bool strfilter_node__compare(struct strfilter_node *node, in strfilter_node__compare()
248 static int strfilter_node__sprint_pt(struct strfilter_node *node, char *buf) in strfilter_node__sprint_pt()
263 static int strfilter_node__sprint(struct strfilter_node *node, char *buf) in strfilter_node__sprint()
|
| D | srcline.c | 38 struct inline_node *node, struct dso *dso) in inline_list__append()
211 struct inline_node *node) in inline_list__append_dso_a2l()
222 bool unwind_inlines, struct inline_node *node) in addr2line()
293 struct inline_node *node; in addr2inlines() local
388 struct inline_node *node; in addr2inlines() local
515 void inline_node__delete(struct inline_node *node) in inline_node__delete()
|
| D | config.h | 12 struct list_head node; member
19 struct list_head node; member
|
| D | block-range.c | 52 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) in rb_link_left_of_node()
62 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) in rb_link_right_of_node()
|
| D | callchain.h | 72 struct callchain_node node; member
171 static inline u64 callchain_cumul_hits(struct callchain_node *node) in callchain_cumul_hits()
176 static inline unsigned callchain_cumul_counts(struct callchain_node *node) in callchain_cumul_counts()
195 struct callchain_cursor_node *node; in callchain_cursor_reset() local
|
| D | hist.c | 297 struct rb_node *node = rb_first(&he->hroot_out); in hists__decay_entry() local
927 struct callchain_cursor_node *node; in iter_next_cumulative_entry() local
1353 struct perf_hpp_list_node *node; in hists__hierarchy_insert_entry() local
1556 struct rb_node *node; in hierarchy_recalc_total_periods() local
1614 struct rb_node *node; in hists__hierarchy_output_resort() local
1794 struct rb_node *rb_hierarchy_last(struct rb_node *node) in rb_hierarchy_last()
1805 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) in __rb_hierarchy_next()
1824 struct rb_node *rb_hierarchy_prev(struct rb_node *node) in rb_hierarchy_prev()
1841 struct rb_node *node; in hist_entry__has_hierarchy_children() local
2501 struct rb_node *node; in hists__delete_remaining_entries() local
[all …]
|
| /tools/perf/tests/ |
| D | hists_output.c | 96 struct rb_node *node; in del_hist_entries() local
130 struct rb_node *node; in test1() local
232 struct rb_node *node; in test2() local
288 struct rb_node *node; in test3() local
362 struct rb_node *node; in test4() local
464 struct rb_node *node; in test5() local
|
| D | switch-tracking.c | 209 struct event_node *node; in add_event() local
236 struct event_node *node; in free_event_nodes() local
260 struct event_node *events_array, *node; in process_events() local
|
| D | hists_common.c | 165 struct rb_node *node; in print_hists_in() local
195 struct rb_node *node; in print_hists_out() local
|
| D | hists_link.c | 146 struct rb_node *node; in __validate_match() local
196 struct rb_node *node; in __validate_link() local
|
| D | hists_cumulate.c | 130 struct rb_node *node; in del_hist_entries() local
173 } node[10]; member
183 struct rb_node *node; in do_test() local
|
| /tools/include/linux/ |
| D | rbtree.h | 55 #define RB_EMPTY_NODE(node) \ argument
57 #define RB_CLEAR_NODE(node) \ argument
79 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node()
|
| D | hashtable.h | 57 #define hash_add(hashtable, node, key) \ argument
64 static inline bool hash_hashed(struct hlist_node *node) in hash_hashed()
93 static inline void hash_del(struct hlist_node *node) in hash_del()
|
| D | rbtree_augmented.h | 60 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
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/testing/radix-tree/ |
| D | multiorder.c | 189 struct radix_tree_node *node; in multiorder_shrink() local
388 struct radix_tree_node *node; in multiorder_join2() local
417 struct radix_tree_node *node; in multiorder_join3() local
516 struct radix_tree_node *node; in __multiorder_split2() local
543 struct radix_tree_node *node; in __multiorder_split3() local
607 struct radix_tree_node *node; in multiorder_account() local
|
| D | linux.c | 30 struct radix_tree_node *node; in kmem_cache_alloc() local
66 struct radix_tree_node *node = objp; in kmem_cache_free() local
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 29 struct inline_node *node; in inline__fprintf() local
100 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node, in ipchain__fprintf_graph()
166 struct rb_node *node, *next; in __callchain__fprintf_graph() local
259 static bool need_percent_display(struct rb_node *node, u64 parent_samples) in need_percent_display()
278 struct rb_node *node; in callchain__fprintf_graph() local
342 static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node, in __callchain__fprintf_flat()
390 static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node) in __callchain__fprintf_folded()
|
| /tools/perf/ui/browsers/ |
| D | hists.c | 161 struct inline_node *node; in inline_node__create() local
176 static int inline__count_rows(struct inline_node *node) in inline__count_rows()
194 struct inline_node *node; in callchain_list__inline_rows() local
206 static int callchain_node__count_rows_rb_tree(struct callchain_node *node) in callchain_node__count_rows_rb_tree()
238 static int callchain_node__count_flat_rows(struct callchain_node *node) in callchain_node__count_flat_rows()
272 static int callchain_node__count_rows(struct callchain_node *node) in callchain_node__count_rows()
305 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows() local
316 struct rb_node *node; in hierarchy_count_rows() local
368 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node) in callchain_node__init_have_children_rb_tree()
391 static void callchain_node__init_have_children(struct callchain_node *node, in callchain_node__init_have_children()
[all …]
|
| /tools/lib/lockdep/ |
| D | preload.c | 33 struct rb_node node; member
103 struct rb_node **node = &locks.rb_node; in __get_lock_node() local
177 struct rb_node **node, *parent; in __get_lock() local
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 102 struct callchain_node *node; in perf_gtk__add_callchain_flat() local
164 struct callchain_node *node; in perf_gtk__add_callchain_folded() local
225 struct callchain_node *node; in perf_gtk__add_callchain_graph() local
410 struct rb_node *node; in perf_gtk__add_hierarchy_entries() local
|
| /tools/perf/ |
| D | builtin-kmem.c | 65 struct rb_node node; member
83 struct rb_node **node = &root_alloc_stat.rb_node; in insert_alloc_stat() local
128 struct rb_node **node = &root_caller_stat.rb_node; in insert_caller_stat() local
210 struct rb_node *node = root->rb_node; in search_alloc_stat() local
276 struct rb_node node; member
333 struct rb_node *node; in build_alloc_func_list() local
386 struct callchain_cursor_node *node; in find_callsite() local
439 struct rb_node **node = &page_live_tree.rb_node; in __page_stat__findnew_page() local
488 struct rb_node **node = &page_alloc_tree.rb_node; in __page_stat__findnew_alloc() local
543 struct rb_node **node = &page_caller_tree.rb_node; in __page_stat__findnew_caller() local
[all …]
|
| /tools/testing/selftests/bpf/ |
| D | test_lpm_map.c | 39 struct tlpm_node *node; in tlpm_add() local
57 struct tlpm_node *node; in tlpm_clear() local
|