| /lib/ |
| D | radix-tree.c | 100 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set()
106 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear()
112 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get()
152 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set()
163 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set()
180 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag, in radix_tree_find_next_bit()
216 static inline unsigned long node_maxindex(const struct radix_tree_node *node) in node_maxindex()
222 const struct radix_tree_node *node, in next_index()
292 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
308 radix_tree_node_free(struct radix_tree_node *node) in radix_tree_node_free()
[all …]
|
| D | bootconfig.c | 131 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index()
143 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node) in xbc_node_get_parent()
155 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node) in xbc_node_get_child()
169 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node) in xbc_node_get_next()
181 const char * __init xbc_node_get_data(struct xbc_node *node) in xbc_node_get_data()
192 xbc_node_match_prefix(struct xbc_node *node, const char **prefix) in xbc_node_match_prefix()
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()
[all …]
|
| 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()
|
| D | xarray.c | 80 static inline unsigned long *node_marks(struct xa_node *node, xa_mark_t mark) in node_marks()
85 static inline bool node_get_mark(struct xa_node *node, in node_get_mark()
92 static inline bool node_set_mark(struct xa_node *node, unsigned int offset, in node_set_mark()
99 static inline bool node_clear_mark(struct xa_node *node, unsigned int offset, in node_clear_mark()
105 static inline bool node_any_mark(struct xa_node *node, xa_mark_t mark) in node_any_mark()
110 static inline void node_mark_all(struct xa_node *node, xa_mark_t mark) in node_mark_all()
144 static unsigned int get_offset(unsigned long index, struct xa_node *node) in get_offset()
204 struct xa_node *node) in xas_descend()
241 struct xa_node *node = xa_to_node(entry); in xas_load() local
255 static void xa_node_free(struct xa_node *node) in xa_node_free()
[all …]
|
| D | rbtree_test.c | 32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
80 #define NODE_VAL(node) ((node)->val) argument
109 static void insert_augmented_cached(struct test_node *node, in insert_augmented_cached()
138 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented()
143 static void erase_augmented_cached(struct test_node *node, in erase_augmented_cached()
198 struct test_node *node = rb_entry(rb, struct test_node, rb); in check() local
224 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented() local
[all …]
|
| 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()
|
| D | btree.c | 94 unsigned long *node; in btree_node_alloc() local
147 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey()
152 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval()
157 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey()
163 static void setval(struct btree_geo *geo, unsigned long *node, int n, in setval()
169 static void clearpair(struct btree_geo *geo, unsigned long *node, int n) in clearpair()
210 unsigned long *node = head->node; in btree_last() local
223 static int keycmp(struct btree_geo *geo, unsigned long *node, int pos, in keycmp()
244 unsigned long *node = head->node; in btree_lookup_node() local
266 unsigned long *node; in btree_lookup() local
[all …]
|
| 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()
222 static void __init plist_test_requeue(struct plist_node *node) in plist_test_requeue()
|
| 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 …]
|
| D | interval_tree.c | 7 #define START(node) ((node)->start) argument
8 #define LAST(node) ((node)->last) argument
|
| D | maple_tree.c | 170 static inline void mt_free_one(struct maple_node *node) in mt_free_one()
182 struct maple_node *node = container_of(head, struct maple_node, rcu); in mt_free_rcu() local
194 static void ma_free_rcu(struct maple_node *node) in ma_free_rcu()
334 static inline struct maple_enode *mt_mk_node(const struct maple_node *node, in mt_mk_node()
341 static inline void *mte_mk_root(const struct maple_enode *node) in mte_mk_root()
346 static inline void *mte_safe_root(const struct maple_enode *node) in mte_safe_root()
351 static inline void __maybe_unused *mte_set_full(const struct maple_enode *node) in mte_set_full()
356 static inline void __maybe_unused *mte_clear_full(const struct maple_enode *node) in mte_clear_full()
361 static inline bool __maybe_unused mte_has_null(const struct maple_enode *node) in mte_has_null()
366 static __always_inline bool ma_is_root(struct maple_node *node) in ma_is_root()
[all …]
|
| D | cpumask.c | 60 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node()
143 unsigned int cpumask_local_spread(unsigned int i, int node) in cpumask_local_spread()
|
| D | union_find.c | 13 struct uf_node *uf_find(struct uf_node *node) in uf_find()
|
| D | group_cpus.c | 48 int node; in alloc_node_to_cpumask() local
70 int node; in free_node_to_cpumask() local
|
| D | interval_tree_test.c | 32 struct interval_tree_node *node; in search() local
|
| D | idr.c | 292 struct radix_tree_node *node; in idr_replace() local
569 struct xa_node *node = xa_to_node(entry); in ida_dump_entry() local
|
| 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
|
| D | hashtable_test.c | 15 struct hlist_node node; member
|
| D | devres.c | 241 void __iomem *devm_of_iomap(struct device *dev, struct device_node *node, int index, in devm_of_iomap()
|
| D | klist.c | 175 struct klist_node *node; member
|
| 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()
|
| D | sbitmap.c | 102 gfp_t flags, int node, bool round_robin, in sbitmap_init_node()
435 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node()
|
| D | test_xarray.c | 327 struct xa_node *node; in check_xa_shrink() local
1897 static void test_update_node(struct xa_node *node) in test_update_node()
1910 struct xa_node *node; in shadow_remove() local
|
| /lib/kunit/ |
| D | string-stream.h | 17 struct list_head node; member
|
| /lib/842/ |
| D | 842_compress.c | 68 struct hlist_node node; member
74 struct hlist_node node; member
80 struct hlist_node node; member
|