| /lib/ |
| A D | radix-tree.c | 222 const struct radix_tree_node *node, in next_index()
292 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
325 struct radix_tree_node *node; in __radix_tree_preload() local
544 struct radix_tree_node *node) in delete_node()
706 struct radix_tree_node *node; in radix_tree_insert() local
876 struct radix_tree_node *node, in __radix_tree_replace()
939 struct radix_tree_node *node, in node_tag_set()
996 struct radix_tree_node *node, in node_tag_clear()
1416 struct radix_tree_node *node = NULL; in radix_tree_delete_item() local
1572 struct radix_tree_node *node = arg; in radix_tree_node_ctor() local
[all …]
|
| A D | bootconfig.c | 131 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index()
181 const char * __init xbc_node_get_data(struct xbc_node *node) in xbc_node_get_data()
222 struct xbc_node *node; in xbc_node_find_subkey() local
260 struct xbc_node *node = xbc_node_find_subkey(parent, key); in xbc_node_find_value() local
292 struct xbc_node *node, in xbc_node_compose_key_after()
341 struct xbc_node *node) in xbc_node_find_next_leaf()
426 struct xbc_node *node; in xbc_add_node() local
456 struct xbc_node *sib, *node = xbc_add_node(data, flag); in __xbc_add_sibling() local
493 struct xbc_node *node = xbc_add_sibling(data, flag); in xbc_add_child() local
612 struct xbc_node *node; in xbc_parse_array() local
[all …]
|
| 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
424 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate()
434 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
440 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
456 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
492 struct rb_node *rb_next(const struct rb_node *node) in rb_next()
524 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev()
592 static struct rb_node *rb_left_deepest_node(const struct rb_node *node) in rb_left_deepest_node()
604 struct rb_node *rb_next_postorder(const struct rb_node *node) in rb_next_postorder()
|
| A D | xarray.c | 205 struct xa_node *node) in xas_descend()
448 struct xa_node *node = xas->xa_node; in xas_shrink() local
491 struct xa_node *node = xas->xa_node; in xas_delete_node() local
534 struct xa_node *node = top; in xas_free_nodes() local
570 struct xa_node *node = NULL; in xas_expand() local
652 struct xa_node *node = xas->xa_node; in xas_create() local
785 struct xa_node *node; in xas_store() local
1012 struct xa_node *node, void *entry) in __xas_init_node_for_split()
1057 struct xa_node *node; in xas_split_alloc() local
1090 struct xa_node *node; in xas_split() local
[all …]
|
| A D | rbtree_test.c | 33 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
50 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
70 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
75 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
81 #define NODE_VAL(node) ((node)->val) argument
110 static void insert_augmented_cached(struct test_node *node, in insert_augmented_cached()
139 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented()
144 static void erase_augmented_cached(struct test_node *node, in erase_augmented_cached()
199 struct test_node *node = rb_entry(rb, struct test_node, rb); in check() local
225 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented() local
[all …]
|
| A D | timerqueue.c | 35 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add()
53 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del()
73 struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node) in timerqueue_iterate_next()
|
| A D | btree.c | 94 unsigned long *node; in btree_node_alloc() local
210 unsigned long *node = head->node; in btree_last() local
244 unsigned long *node = head->node; in btree_lookup_node() local
266 unsigned long *node; in btree_lookup() local
283 unsigned long *node; in btree_update() local
310 unsigned long *node, *oldnode; in btree_get_prev() local
386 unsigned long *node = head->node; in find_level() local
411 unsigned long *node; in btree_grow() local
429 unsigned long *node; in btree_shrink() local
447 unsigned long *node; in btree_insert_level() local
[all …]
|
| A D | plist.c | 73 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add()
122 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del()
155 void plist_requeue(struct plist_node *node, struct plist_head *head) in plist_requeue()
234 static void __init plist_test_requeue(struct plist_node *node) in plist_test_requeue()
|
| A D | interval_tree.c | 7 #define START(node) ((node)->start) argument
8 #define LAST(node) ((node)->last) argument
|
| A D | assoc_array.c | 26 const struct assoc_array_node *node; in assoc_array_subtree_iterate() local
153 struct assoc_array_node *node; /* Node in which leaf might be found */ member
176 struct assoc_array_node *node; in assoc_array_walk() local
309 const struct assoc_array_node *node; in assoc_array_find() local
347 struct assoc_array_node *node; in assoc_array_destroy_subtree() local
480 struct assoc_array_node *node, *new_n0, *new_n1, *side; in assoc_array_insert_into_terminal_node() local
797 struct assoc_array_node *node, *new_n0, *side; in assoc_array_insert_mid_shortcut() local
1037 struct assoc_array_node *node; member
1084 struct assoc_array_node *node, *new_n0; in assoc_array_delete() local
1348 struct assoc_array_node *node; in assoc_array_apply_edit() local
[all …]
|
| A D | maple_tree.c | 587 struct maple_node *node; in mte_dead_node() local
998 struct maple_node *node; in mas_mat_destroy() local
1020 struct maple_node *node; in mas_descend() local
1237 struct maple_alloc *node; in mas_alloc_nodes() local
1455 struct maple_node *node; in mas_data_end() local
1598 struct maple_node *node; in mas_max_gap() local
1774 struct maple_node *node; in mas_find_child() local
1933 struct maple_node *node; in mas_mab_cp() local
2760 struct maple_node *node; in mtree_range_walk() local
3422 struct maple_node *node; in mas_root_expand() local
[all …]
|
| A D | cpumask.c | 28 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node()
108 unsigned int cpumask_local_spread(unsigned int i, int node) in cpumask_local_spread()
|
| A D | union_find.c | 13 struct uf_node *uf_find(struct uf_node *node) in uf_find()
|
| A D | interval_tree_test.c | 35 struct interval_tree_node *node; in search() local
134 struct interval_tree_node *node; in intersection_range_check() local
|
| A D | group_cpus.c | 48 int node; in alloc_node_to_cpumask() local
70 int node; in free_node_to_cpumask() local
|
| A D | test_kho.c | 197 static int kho_test_restore_data(const void *fdt, int node) in kho_test_restore_data()
246 int node, len, err; in kho_test_restore() local
|
| A D | idr.c | 292 struct radix_tree_node *node; in idr_replace() local
636 struct xa_node *node = xa_to_node(entry); in ida_dump_entry() local
|
| A D | objagg.c | 740 struct objagg_tmp_node *node = &graph->nodes[index]; in objagg_tmp_graph_node_weight() local
761 struct objagg_tmp_node *node; in objagg_tmp_graph_node_max_weight() local
784 struct objagg_tmp_node *node; in objagg_tmp_graph_create() local
847 struct objagg_tmp_node *node; in objagg_opt_simple_greedy_fillup_hints() local
|
| A D | devres.c | 241 void __iomem *devm_of_iomap(struct device *dev, struct device_node *node, int index, in devm_of_iomap()
|
| A D | klist.c | 175 struct klist_node *node; member
|
| A D | sbitmap.c | 102 gfp_t flags, int node, bool round_robin, in sbitmap_init_node()
449 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node()
|
| A D | bitmap.c | 730 unsigned long *bitmap_alloc_node(unsigned int nbits, gfp_t flags, int node) in bitmap_alloc_node()
737 unsigned long *bitmap_zalloc_node(unsigned int nbits, gfp_t flags, int node) in bitmap_zalloc_node()
|
| /lib/kunit/ |
| A D | string-stream.h | 17 struct list_head node; member
|
| /lib/842/ |
| A D | 842_compress.c | 68 struct hlist_node node; member
74 struct hlist_node node; member
80 struct hlist_node node; member
|
| /lib/tests/ |
| A D | hashtable_test.c | 15 struct hlist_node node; member
|