| /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/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()
178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
206 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add()
234 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add()
270 struct rb_node *node = tree->rb_node; in rb_find() local
298 struct rb_node *node = tree->rb_node; in rb_find_first() local
[all …]
|
| 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/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
60 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove()
68 struct int_node *node = NULL; in __intlist__findnew() local
142 struct int_node *node = NULL; in intlist__entry() local
|
| D | callchain.c | 420 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat()
450 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs()
478 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel()
573 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node()
728 static enum match_result match_chain(struct callchain_cursor_node *node, in match_chain()
851 struct callchain_cursor_node *node; in split_add_child() local
898 struct callchain_cursor_node *node; in append_chain_children() local
957 struct callchain_cursor_node *node; in append_chain() local
1085 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
1141 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 | env.c | 40 struct bpf_prog_info_node *node; in __perf_env__insert_bpf_prog_info() local
68 struct bpf_prog_info_node *node = NULL; in perf_env__find_bpf_prog_info() local
104 struct btf_node *node; in __perf_env__insert_btf() local
140 struct btf_node *node = NULL; in __perf_env__find_btf() local
169 struct bpf_prog_info_node *node; in perf_env__purge_bpf() local
184 struct btf_node *node; in perf_env__purge_bpf() local
|
| D | srcline.c | 53 struct inline_node *node) in inline_list__append()
153 bool unwind_inlines, struct inline_node *node, in addr2line()
345 struct inline_node *node, in inline_list__append_dso_a2l()
360 bool unwind_inlines, struct inline_node *node, in addr2line()
680 struct inline_node *node, in inline_list__append_record()
695 struct inline_node *node, in addr2line()
854 struct inline_node *node; in addr2inlines() local
981 struct srcline_node *i, *node; in srcline__tree_insert() local
1052 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 | mem2node.c | 15 u64 node; member
39 phys_entry__init(struct phys_entry *entry, u64 start, u64 bsize, u64 node) in phys_entry__init()
|
| D | block-range.c | 50 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) in rb_link_left_of_node()
60 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) in rb_link_right_of_node()
|
| /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 | 100 struct rb_node *node; in del_hist_entries() local
144 struct rb_node *node; in test1() local
246 struct rb_node *node; in test2() local
302 struct rb_node *node; in test3() local
376 struct rb_node *node; in test4() local
478 struct rb_node *node; in test5() local
|
| D | switch-tracking.c | 219 struct event_node *node; in add_event() local
246 struct event_node *node; in free_event_nodes() local
270 struct event_node *events_array, *node; in process_events() local
|
| /tools/testing/selftests/rseq/ |
| D | basic_percpu_ops_test.c | 171 struct percpu_list_node *node, in this_cpu_list_push()
235 struct percpu_list_node *node; in __percpu_list_pop() local
256 struct percpu_list_node *node; in test_percpu_list_thread() local
290 struct percpu_list_node *node; in test_percpu_list() local
310 struct percpu_list_node *node; in test_percpu_list() local
|
| D | param_test.c | 608 struct percpu_list_node *node, in this_cpu_list_push()
641 struct percpu_list_node *node = NULL; in this_cpu_list_pop() local
677 struct percpu_list_node *node; in __percpu_list_pop() local
696 struct percpu_list_node *node; in test_percpu_list_thread() local
731 struct percpu_list_node *node; in test_percpu_list() local
763 struct percpu_list_node *node; in test_percpu_list() local
783 struct percpu_buffer_node *node, in this_cpu_buffer_push()
879 struct percpu_buffer_node *node; in test_percpu_buffer_thread() local
924 struct percpu_buffer_node *node; in test_percpu_buffer() local
963 struct percpu_buffer_node *node; in test_percpu_buffer() local
[all …]
|
| /tools/sched_ext/include/scx/ |
| D | common.bpf.h | 245 #define __contains(name, node) __attribute__((btf_decl_tag("contains:" #name ":" #node))) argument
257 #define bpf_list_push_front(head, node) bpf_list_push_front_impl(head, node, NULL, 0) argument
262 #define bpf_list_push_back(head, node) bpf_list_push_back_impl(head, node, NULL, 0) argument
271 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0) argument
|
| /tools/testing/selftests/bpf/progs/ |
| D | linked_list.h | 10 struct bpf_list_node node; member
15 struct bpf_list_node node; member
|
| D | rbtree_btf_fail__add_wrong_type.c | 13 struct bpf_rb_node node; member
18 struct bpf_rb_node node; member
|
| D | local_kptr_stash_fail.c | 14 struct bpf_rb_node node; member
18 struct node_data __kptr *node; member
|
| /tools/testing/selftests/bpf/ |
| D | bpf_experimental.h | 9 #define __contains(name, node) __attribute__((btf_decl_tag("contains:" #name ":" #node))) argument
70 #define bpf_list_push_front(head, node) bpf_list_push_front_impl(head, node, NULL, 0) argument
86 #define bpf_list_push_back(head, node) bpf_list_push_back_impl(head, node, NULL, 0) argument
124 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0) argument
|
| /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 | 50 static size_t ipchain__fprintf_graph(FILE *fp, struct callchain_node *node, in ipchain__fprintf_graph()
113 struct rb_node *node, *next; in __callchain__fprintf_graph() local
206 static bool need_percent_display(struct rb_node *node, u64 parent_samples) in need_percent_display()
225 struct rb_node *node; in callchain__fprintf_graph() local
282 static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node, in __callchain__fprintf_flat()
330 static size_t __callchain__fprintf_folded(FILE *fp, struct callchain_node *node) in __callchain__fprintf_folded()
|
| /tools/testing/shared/ |
| D | linux.c | 91 struct radix_tree_node *node = cachep->objs; in kmem_cache_alloc_lru() local
124 struct radix_tree_node *node = objp; in __kmem_cache_free_locked() local
172 struct radix_tree_node *node; in kmem_cache_alloc_bulk() local
|