| /tools/lib/ |
| A 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/ |
| A D | rbtree.h | 42 #define RB_EMPTY_NODE(node) \ argument
44 #define RB_CLEAR_NODE(node) \ argument
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
325 rb_next_match(const void *key, struct rb_node *node, in rb_next_match()
[all …]
|
| A 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()
|
| A 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/sched_ext/ |
| A D | numa.bpf.c | 22 static bool is_cpu_idle(s32 cpu, int node) in is_cpu_idle()
37 int node = __COMPAT_scx_bpf_cpu_node(scx_bpf_task_cpu(p)); in BPF_STRUCT_OPS() local
62 int node = __COMPAT_scx_bpf_cpu_node(scx_bpf_task_cpu(p)); in BPF_STRUCT_OPS() local
69 int node = __COMPAT_scx_bpf_cpu_node(cpu); in BPF_STRUCT_OPS() local
76 int node, err; in BPF_STRUCT_OPS_SLEEPABLE() local
|
| /tools/perf/util/ |
| A 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
|
| A D | callchain.c | 450 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs()
849 struct callchain_cursor_node *node; in split_add_child() local
896 struct callchain_cursor_node *node; in append_chain_children() local
955 struct callchain_cursor_node *node; in append_chain() local
1083 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
1483 static void free_callchain_node(struct callchain_node *node) in free_callchain_node()
1522 static u64 decay_callchain_node(struct callchain_node *node) in decay_callchain_node()
1594 struct callchain_cursor_node *node, *next; in callchain_cursor__delete() local
1637 struct callchain_cursor_node *node; in callchain_cursor__copy() local
1663 struct callchain_cursor_node *node; in callchain_cursor_reset() local
[all …]
|
| A 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()
|
| A D | env.c | 42 struct bpf_prog_info_node *node; in __perf_env__insert_bpf_prog_info() local
70 struct bpf_prog_info_node *node = NULL; in perf_env__find_bpf_prog_info() local
93 void (*cb)(struct bpf_prog_info_node *node, in perf_env__iterate_bpf_prog_info()
101 for (struct rb_node *node = first; node != NULL; node = rb_next(node)) in perf_env__iterate_bpf_prog_info() local
120 struct btf_node *node; in __perf_env__insert_btf() local
156 struct btf_node *node = NULL; in __perf_env__find_btf() local
185 struct bpf_prog_info_node *node; in perf_env__purge_bpf() local
201 struct btf_node *node; in perf_env__purge_bpf() local
|
| A 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()
|
| A D | config.h | 12 struct list_head node; member
19 struct list_head node; member
|
| /tools/perf/tests/ |
| A D | mem2node.c | 13 static struct node { struct
14 int node; member
17 { .node = 0, .map = "0" }, argument
|
| A 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
|
| /tools/testing/selftests/bpf/progs/ |
| A D | bpf_qdisc_fifo.c | 11 struct bpf_list_node node; member
54 struct bpf_list_node *node; in BPF_PROG() local
89 struct bpf_list_node *node; in BPF_PROG() local
|
| A D | linked_list.h | 10 struct bpf_list_node node; member
15 struct bpf_list_node node; member
|
| A D | local_kptr_stash_fail.c | 14 struct bpf_rb_node node; member
18 struct node_data __kptr *node; member
|
| A D | rbtree_btf_fail__add_wrong_type.c | 13 struct bpf_rb_node node; member
18 struct bpf_rb_node node; member
|
| /tools/testing/selftests/rseq/ |
| A 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
|
| A D | param_test.c | 632 struct percpu_list_node *node, in this_cpu_list_push()
665 struct percpu_list_node *node = NULL; in this_cpu_list_pop() local
701 struct percpu_list_node *node; in __percpu_list_pop() local
720 struct percpu_list_node *node; in test_percpu_list_thread() local
755 struct percpu_list_node *node; in test_percpu_list() local
787 struct percpu_list_node *node; in test_percpu_list() local
807 struct percpu_buffer_node *node, in this_cpu_buffer_push()
903 struct percpu_buffer_node *node; in test_percpu_buffer_thread() local
948 struct percpu_buffer_node *node; in test_percpu_buffer() local
987 struct percpu_buffer_node *node; in test_percpu_buffer() local
[all …]
|
| /tools/testing/selftests/kvm/lib/ |
| A D | lru_gen_util.c | 183 int node, gen; in print_memcg_stats() local
248 int node, gen; in lru_gen_sum_memcg_stats_for_gen() local
304 int node, gen; in lru_gen_do_aging() local
335 int node, gen, gen_idx, min_gen = INT_MAX, max_gen = -1; in lru_gen_find_generation() local
|
| A 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/testing/selftests/futex/functional/ |
| A D | futex_numa.c | 31 u32 node; member
105 int node; member
114 int node; in threadfn() local
|
| /tools/sched_ext/include/scx/ |
| A D | compat.bpf.h | 208 #define __COMPAT_scx_bpf_get_idle_cpumask_node(node) \ argument
213 #define __COMPAT_scx_bpf_get_idle_smtmask_node(node) \ argument
218 #define __COMPAT_scx_bpf_pick_idle_cpu_node(cpus_allowed, node, flags) \ argument
223 #define __COMPAT_scx_bpf_pick_any_cpu_node(cpus_allowed, node, flags) \ argument
|
| /tools/lib/perf/include/internal/ |
| A D | evsel.h | 18 struct list_head node; member
45 struct hlist_node node; member
92 struct list_head node; member
|
| /tools/testing/selftests/bpf/ |
| A 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
|