| /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 | 267 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat()
297 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs()
325 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel()
420 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node()
486 static enum match_result match_chain(struct callchain_cursor_node *node, in match_chain()
549 struct callchain_cursor_node *node; in split_add_child() local
596 struct callchain_cursor_node *node; in append_chain_children() local
655 struct callchain_cursor_node *node; in append_chain() local
772 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
817 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, in fill_callchain_info()
[all …]
|
| D | strfilter.c | 13 static void strfilter_node__delete(struct strfilter_node *node) in strfilter_node__delete()
65 struct strfilter_node *node = zalloc(sizeof(*node)); in strfilter_node__alloc() local
213 static bool strfilter_node__compare(struct strfilter_node *node, in strfilter_node__compare()
244 static int strfilter_node__sprint_pt(struct strfilter_node *node, char *buf) in strfilter_node__sprint_pt()
259 static int strfilter_node__sprint(struct strfilter_node *node, char *buf) in strfilter_node__sprint()
|
| D | config.h | 10 struct list_head node; member
16 struct list_head node; member
|
| D | block-range.c | 51 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) in rb_link_left_of_node()
61 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 | 70 struct callchain_node node; member
154 static inline u64 callchain_cumul_hits(struct callchain_node *node) in callchain_cumul_hits()
159 static inline unsigned callchain_cumul_counts(struct callchain_node *node) in callchain_cumul_counts()
178 struct callchain_cursor_node *node; in callchain_cursor_reset() local
|
| D | hist.c | 286 struct rb_node *node = rb_first(&he->hroot_out); in hists__decay_entry() local
914 struct callchain_cursor_node *node; in iter_next_cumulative_entry() local
1334 struct perf_hpp_list_node *node; in hists__hierarchy_insert_entry() local
1537 struct rb_node *node; in hierarchy_recalc_total_periods() local
1595 struct rb_node *node; in hists__hierarchy_output_resort() local
1773 struct rb_node *rb_hierarchy_last(struct rb_node *node) in rb_hierarchy_last()
1784 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) in __rb_hierarchy_next()
1803 struct rb_node *rb_hierarchy_prev(struct rb_node *node) in rb_hierarchy_prev()
1820 struct rb_node *node; in hist_entry__has_hierarchy_children() local
2478 struct rb_node *node; in hists__delete_remaining_entries() local
[all …]
|
| D | probe-file.h | 10 struct list_head node; member
|
| D | call-path.h | 53 struct list_head node; member
|
| D | rblist.c | 120 struct rb_node *node; in rblist__entry() 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 | 60 #define hash_add(hashtable, node, key) \ argument
67 static inline bool hash_hashed(struct hlist_node *node) in hash_hashed()
96 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/perf/tests/ |
| D | hists_output.c | 93 struct rb_node *node; in del_hist_entries() local
127 struct rb_node *node; in test1() local
229 struct rb_node *node; in test2() local
285 struct rb_node *node; in test3() local
359 struct rb_node *node; in test4() local
461 struct rb_node *node; in test5() local
|
| D | hists_common.c | 162 struct rb_node *node; in print_hists_in() local
192 struct rb_node *node; in print_hists_out() local
|
| D | switch-tracking.c | 207 struct event_node *node; in add_event() local
234 struct event_node *node; in free_event_nodes() local
258 struct event_node *events_array, *node; in process_events() local
|
| D | hists_link.c | 143 struct rb_node *node; in __validate_match() local
193 struct rb_node *node; in __validate_link() local
|
| D | hists_cumulate.c | 127 struct rb_node *node; in del_hist_entries() local
170 } node[10]; member
180 struct rb_node *node; in do_test() local
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 37 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node, in ipchain__fprintf_graph()
83 struct rb_node *node, *next; in __callchain__fprintf_graph() local
176 static bool need_percent_display(struct rb_node *node, u64 parent_samples) in need_percent_display()
195 struct rb_node *node; in callchain__fprintf_graph() local
244 static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node, in __callchain__fprintf_flat()
292 static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node) in __callchain__fprintf_folded()
|
| /tools/lib/lockdep/ |
| D | preload.c | 31 struct rb_node node; member
101 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 | 99 struct callchain_node *node; in perf_gtk__add_callchain_flat() local
161 struct callchain_node *node; in perf_gtk__add_callchain_folded() local
222 struct callchain_node *node; in perf_gtk__add_callchain_graph() local
407 struct rb_node *node; in perf_gtk__add_hierarchy_entries() local
|
| /tools/perf/ |
| D | builtin-kmem.c | 57 struct rb_node node; member
71 struct rb_node **node = &root_alloc_stat.rb_node; in insert_alloc_stat() local
114 struct rb_node **node = &root_caller_stat.rb_node; in insert_caller_stat() local
196 struct rb_node *node = root->rb_node; in search_alloc_stat() local
260 struct rb_node node; member
317 struct rb_node *node; in build_alloc_func_list() local
370 struct callchain_cursor_node *node; in find_callsite() local
423 struct rb_node **node = &page_live_tree.rb_node; in __page_stat__findnew_page() local
472 struct rb_node **node = &page_alloc_tree.rb_node; in __page_stat__findnew_alloc() local
527 struct rb_node **node = &page_caller_tree.rb_node; in __page_stat__findnew_caller() local
[all …]
|
| /tools/perf/ui/browsers/ |
| D | hists.c | 147 static int callchain_node__count_rows_rb_tree(struct callchain_node *node) in callchain_node__count_rows_rb_tree()
172 static int callchain_node__count_flat_rows(struct callchain_node *node) in callchain_node__count_flat_rows()
206 static int callchain_node__count_rows(struct callchain_node *node) in callchain_node__count_rows()
234 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows() local
245 struct rb_node *node; in hierarchy_count_rows() local
297 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node) in callchain_node__init_have_children_rb_tree()
320 static void callchain_node__init_have_children(struct callchain_node *node, in callchain_node__init_have_children()
342 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__init_have_children() local
432 static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold) in callchain_node__set_folding_rb_tree()
455 static int callchain_node__set_folding(struct callchain_node *node, bool unfold) in callchain_node__set_folding()
[all …]
|
| /tools/testing/radix-tree/ |
| D | test.c | 195 struct radix_tree_node *node = root->rnode; in verify_tag_consistency() local
224 struct radix_tree_node *node = root->rnode; in tree_verify_min_height() local
|