| /lib/ |
| D | rbtree.c | 97 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
231 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; in ____rb_erase_color() local
410 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate()
418 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
424 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
440 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
476 struct rb_node *rb_next(const struct rb_node *node) in rb_next()
508 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev()
576 static struct rb_node *rb_left_deepest_node(const struct rb_node *node) in rb_left_deepest_node()
588 struct rb_node *rb_next_postorder(const struct rb_node *node) in rb_next_postorder()
|
| D | radix-tree.c | 81 static inline bool is_sibling_entry(struct radix_tree_node *parent, void *node) in is_sibling_entry()
88 static inline bool is_sibling_entry(struct radix_tree_node *parent, void *node) in is_sibling_entry()
125 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set()
131 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear()
137 static inline int tag_get(struct radix_tree_node *node, unsigned int tag, in tag_get()
172 static inline int any_tag_set(struct radix_tree_node *node, unsigned int tag) in any_tag_set()
219 static void dump_node(struct radix_tree_node *node, unsigned long index) in dump_node()
315 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
334 radix_tree_node_free(struct radix_tree_node *node) in radix_tree_node_free()
351 struct radix_tree_node *node; in __radix_tree_preload() local
[all …]
|
| D | timerqueue.c | 39 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add()
75 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del()
101 struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node) in timerqueue_iterate_next()
|
| D | interval_tree.c | 6 #define START(node) ((node)->start) argument
7 #define LAST(node) ((node)->last) argument
|
| D | plist.c | 74 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add()
113 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del()
146 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 | 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 | rbtree_test.c | 24 static void insert(struct test_node *node, struct rb_root *root) in insert()
41 static inline void erase(struct test_node *node, struct rb_root *root) in erase()
46 static inline u32 augment_recompute(struct test_node *node) in augment_recompute()
90 static void erase_augmented(struct test_node *node, struct rb_root *root) in erase_augmented()
144 struct test_node *node = rb_entry(rb, struct test_node, rb); in check() local
170 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented() local
|
| D | cpumask.c | 94 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node()
109 bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in zalloc_cpumask_var_node()
184 unsigned int cpumask_local_spread(unsigned int i, int node) in cpumask_local_spread()
|
| D | assoc_array.c | 30 const struct assoc_array_node *node; in assoc_array_subtree_iterate() local
165 struct assoc_array_node *node; /* Node in which leaf might be found */ member
188 struct assoc_array_node *node; in assoc_array_walk() local
324 const struct assoc_array_node *node; in assoc_array_find() local
364 struct assoc_array_node *node; in assoc_array_destroy_subtree() local
497 struct assoc_array_node *node, *new_n0, *new_n1, *side; in assoc_array_insert_into_terminal_node() local
813 struct assoc_array_node *node, *new_n0, *side; in assoc_array_insert_mid_shortcut() local
1053 struct assoc_array_node *node; member
1100 struct assoc_array_node *node, *new_n0; in assoc_array_delete() local
1363 struct assoc_array_node *node; in assoc_array_apply_edit() local
[all …]
|
| D | nodemask.c | 5 int __next_node_in(int node, const nodemask_t *srcp) in __next_node_in()
|
| D | interval_tree_test.c | 20 struct interval_tree_node *node; in search() local
|
| D | sbitmap.c | 22 gfp_t flags, int node) in sbitmap_init_node()
200 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node()
|
| D | test_rhashtable.c | 61 struct rhash_head node; member
|
| D | klist.c | 176 struct klist_node *node; member
|
| /lib/842/ |
| D | 842_compress.c | 77 struct hlist_node node; member
83 struct hlist_node node; member
89 struct hlist_node node; member
|
| /lib/zlib_deflate/ |
| D | deftree.c | 548 int node; /* new node being created */ in build_tree() local
|