| /lib/ |
| D | radix-tree.c | 109 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set()
115 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear()
121 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get()
161 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set()
172 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set()
189 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag, in radix_tree_find_next_bit()
225 static inline unsigned long node_maxindex(const struct radix_tree_node *node) in node_maxindex()
231 const struct radix_tree_node *node, in next_index()
301 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
317 radix_tree_node_free(struct radix_tree_node *node) in radix_tree_node_free()
[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 | 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 | 27 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add()
63 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del()
83 struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node) in timerqueue_iterate_next()
|
| D | xarray.c | 78 static inline unsigned long *node_marks(struct xa_node *node, xa_mark_t mark) in node_marks()
83 static inline bool node_get_mark(struct xa_node *node, in node_get_mark()
90 static inline bool node_set_mark(struct xa_node *node, unsigned int offset, in node_set_mark()
97 static inline bool node_clear_mark(struct xa_node *node, unsigned int offset, in node_clear_mark()
103 static inline bool node_any_mark(struct xa_node *node, xa_mark_t mark) in node_any_mark()
108 static inline void node_mark_all(struct xa_node *node, xa_mark_t mark) in node_mark_all()
142 static unsigned int get_offset(unsigned long index, struct xa_node *node) in get_offset()
201 static void *xas_descend(struct xa_state *xas, struct xa_node *node) in xas_descend()
236 struct xa_node *node = xa_to_node(entry); in xas_load() local
254 static void xa_node_free(struct xa_node *node) in xa_node_free()
[all …]
|
| D | interval_tree.c | 7 #define START(node) ((node)->start) argument
8 #define LAST(node) ((node)->last) argument
|
| D | btree.c | 95 unsigned long *node; in btree_node_alloc() local
148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey()
153 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval()
158 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey()
164 static void setval(struct btree_geo *geo, unsigned long *node, int n, in setval()
170 static void clearpair(struct btree_geo *geo, unsigned long *node, int n) in clearpair()
211 unsigned long *node = head->node; in btree_last() local
224 static int keycmp(struct btree_geo *geo, unsigned long *node, int pos, in keycmp()
245 unsigned long *node = head->node; in btree_lookup() local
275 unsigned long *node = head->node; in btree_update() local
[all …]
|
| D | plist.c | 73 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add()
112 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del()
145 void plist_requeue(struct plist_node *node, struct plist_head *head) in plist_requeue()
212 static void __init plist_test_requeue(struct plist_node *node) in plist_test_requeue()
|
| D | cpumask.c | 113 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node()
128 bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in zalloc_cpumask_var_node()
206 unsigned int cpumask_local_spread(unsigned int i, int node) in cpumask_local_spread()
|
| 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
798 struct assoc_array_node *node, *new_n0, *side; in assoc_array_insert_mid_shortcut() local
1038 struct assoc_array_node *node; member
1085 struct assoc_array_node *node, *new_n0; in assoc_array_delete() local
1349 struct assoc_array_node *node; in assoc_array_apply_edit() local
[all …]
|
| D | nodemask.c | 6 int __next_node_in(int node, const nodemask_t *srcp) in __next_node_in()
|
| D | generic-radix-tree.c | 81 struct genradix_node *node; in genradix_alloc_node() local
94 static inline void genradix_free_node(struct genradix_node *node) in genradix_free_node()
|
| 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
564 struct xa_node *node = xa_to_node(entry); in ida_dump_entry() local
|
| D | objagg.c | 737 struct objagg_tmp_node *node = &graph->nodes[index]; in objagg_tmp_graph_node_weight() local
758 struct objagg_tmp_node *node; in objagg_tmp_graph_node_max_weight() local
781 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 | sbitmap.c | 45 gfp_t flags, int node) in sbitmap_init_node()
370 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node()
|
| D | test_xarray.c | 302 struct xa_node *node; in check_xa_shrink() local
1484 static void test_update_node(struct xa_node *node) in test_update_node()
1497 struct xa_node *node; in shadow_remove() local
|
| D | klist.c | 175 struct klist_node *node; member
|
| D | devres.c | 187 void __iomem *devm_of_iomap(struct device *dev, struct device_node *node, int index, in devm_of_iomap()
|
| D | test_rhashtable.c | 64 struct rhash_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
|
| /lib/zlib_deflate/ |
| D | deftree.c | 548 int node; /* new node being created */ in build_tree() local
|