/tools/lib/ |
D | rbtree.c | 85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() 230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; in ____rb_erase_color() local 423 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate() 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() 486 struct rb_node *rb_next(const struct rb_node *node) in rb_next() 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() 561 static struct rb_node *rb_left_deepest_node(const struct rb_node *node) in rb_left_deepest_node() 573 struct rb_node *rb_next_postorder(const struct rb_node *node) in rb_next_postorder()
|
/tools/perf/tests/ |
D | mem2node.c | 13 static struct node { struct 14 int node; member 17 { .node = 0, .map = "0" }, argument
|
D | hists_output.c | 97 struct rb_node *node; in del_hist_entries() local 131 struct rb_node *node; in test1() local 233 struct rb_node *node; in test2() local 289 struct rb_node *node; in test3() local 363 struct rb_node *node; in test4() local 465 struct rb_node *node; in test5() local
|
D | switch-tracking.c | 215 struct event_node *node; in add_event() local 242 struct event_node *node; in free_event_nodes() local 266 struct event_node *events_array, *node; in process_events() local
|
D | hists_common.c | 167 struct rb_node *node; in print_hists_in() local 197 struct rb_node *node; in print_hists_out() local
|
D | hists_link.c | 145 struct rb_node *node; in __validate_match() local 195 struct rb_node *node; in __validate_link() local
|
/tools/perf/util/ |
D | intlist.c | 18 struct int_node *node = malloc(sizeof(*node)); in intlist__node_new() local 37 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete() local 45 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_cmp() local 55 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove() 63 struct int_node *node = NULL; in __intlist__findnew() local 137 struct int_node *node = NULL; in intlist__entry() local
|
D | env.c | 27 struct bpf_prog_info_node *node; in __perf_env__insert_bpf_prog_info() local 54 struct bpf_prog_info_node *node = NULL; in perf_env__find_bpf_prog_info() local 90 struct btf_node *node; in __perf_env__insert_btf() local 126 struct btf_node *node = NULL; in __perf_env__find_btf() local 155 struct bpf_prog_info_node *node; in perf_env__purge_bpf() local 169 struct btf_node *node; in perf_env__purge_bpf() local
|
D | callchain.c | 413 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() 443 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs() 471 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel() 566 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node() 710 static enum match_result match_chain(struct callchain_cursor_node *node, in match_chain() 825 struct callchain_cursor_node *node; in split_add_child() local 872 struct callchain_cursor_node *node; in append_chain_children() local 931 struct callchain_cursor_node *node; in append_chain() local 1052 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local 1107 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, in fill_callchain_info() [all …]
|
D | strfilter.c | 19 static void strfilter_node__delete(struct strfilter_node *node) in strfilter_node__delete() 70 struct strfilter_node *node = zalloc(sizeof(*node)); in strfilter_node__alloc() local 218 static bool strfilter_node__compare(struct strfilter_node *node, in strfilter_node__compare() 249 static int strfilter_node__sprint_pt(struct strfilter_node *node, char *buf) in strfilter_node__sprint_pt() 264 static int strfilter_node__sprint(struct strfilter_node *node, char *buf) in strfilter_node__sprint()
|
D | srcline.c | 40 struct inline_node *node) in inline_list__append() 279 struct inline_node *node, in inline_list__append_dso_a2l() 294 bool unwind_inlines, struct inline_node *node, in addr2line() 367 struct inline_node *node; in addr2inlines() local 455 struct inline_node *node; in addr2inlines() local 618 struct srcline_node *i, *node; in srcline__tree_insert() local 689 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 | 54 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) in rb_link_left_of_node() 64 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) in rb_link_right_of_node()
|
D | mem2node.c | 15 u64 node; member 39 phys_entry__init(struct phys_entry *entry, u64 start, u64 bsize, u64 node) in phys_entry__init()
|
/tools/include/linux/ |
D | rbtree.h | 42 #define RB_EMPTY_NODE(node) \ argument 44 #define RB_CLEAR_NODE(node) \ argument 66 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() 129 static inline void rb_insert_color_cached(struct rb_node *node, in rb_insert_color_cached() 138 static inline void rb_erase_cached(struct rb_node *node, in rb_erase_cached()
|
D | rbtree_augmented.h | 49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() 56 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached() 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() 300 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, in rb_erase_augmented_cached()
|
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()
|
/tools/testing/selftests/rseq/ |
D | basic_percpu_ops_test.c | 135 struct percpu_list_node *node, in this_cpu_list_push() 197 struct percpu_list_node *node; in __percpu_list_pop() local 218 struct percpu_list_node *node; in test_percpu_list_thread() local 252 struct percpu_list_node *node; in test_percpu_list() local 272 struct percpu_list_node *node; in test_percpu_list() local
|
D | param_test.c | 512 struct percpu_list_node *node, in this_cpu_list_push() 544 struct percpu_list_node *node = NULL; in this_cpu_list_pop() local 579 struct percpu_list_node *node; in __percpu_list_pop() local 598 struct percpu_list_node *node; in test_percpu_list_thread() local 633 struct percpu_list_node *node; in test_percpu_list() local 665 struct percpu_list_node *node; in test_percpu_list() local 685 struct percpu_buffer_node *node, in this_cpu_buffer_push() 785 struct percpu_buffer_node *node; in test_percpu_buffer_thread() local 830 struct percpu_buffer_node *node; in test_percpu_buffer() local 869 struct percpu_buffer_node *node; in test_percpu_buffer() local
|
/tools/testing/radix-tree/ |
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/lib/include/internal/ |
D | evsel.h | 19 struct hlist_node node; member 38 struct list_head node; member
|
/tools/testing/selftests/kvm/lib/ |
D | sparsebit.c | 168 struct node { struct 169 struct node *parent; argument 170 struct node *left; argument 171 struct node *right; argument 179 * Points to root node of the binary search argument
|
/tools/perf/ui/stdio/ |
D | hist.c | 49 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node, in ipchain__fprintf_graph() 112 struct rb_node *node, *next; in __callchain__fprintf_graph() local 205 static bool need_percent_display(struct rb_node *node, u64 parent_samples) in need_percent_display() 224 struct rb_node *node; in callchain__fprintf_graph() local 281 static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node, in __callchain__fprintf_flat() 329 static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node) in __callchain__fprintf_folded()
|
/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 | 104 struct callchain_node *node; in perf_gtk__add_callchain_flat() local 166 struct callchain_node *node; in perf_gtk__add_callchain_folded() local 227 struct callchain_node *node; in perf_gtk__add_callchain_graph() local 413 struct rb_node *node; in perf_gtk__add_hierarchy_entries() local
|