/lib/ |
D | rbtree.c | 97 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() 246 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; in ____rb_erase_color() local 440 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate() 450 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color() 456 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase() 466 void rb_insert_color_cached(struct rb_node *node, in rb_insert_color_cached() 474 void rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) in rb_erase_cached() 491 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented() 528 struct rb_node *rb_next(const struct rb_node *node) in rb_next() 560 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() [all …]
|
D | radix-tree.c | 105 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() 113 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() 151 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() 157 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() 163 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() 203 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() 214 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set() 231 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag, in radix_tree_find_next_bit() 267 static inline unsigned long node_maxindex(const struct radix_tree_node *node) in node_maxindex() 273 const struct radix_tree_node *node, in next_index() [all …]
|
D | rbtree_test.c | 31 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() 48 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() 68 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() 73 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached() 79 static inline u32 augment_recompute(struct test_node *node) in augment_recompute() 124 static void insert_augmented_cached(struct test_node *node, in insert_augmented_cached() 153 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented() 158 static void erase_augmented_cached(struct test_node *node, in erase_augmented_cached() 213 struct test_node *node = rb_entry(rb, struct test_node, rb); in check() local 239 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented() 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() 100 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 | 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 | 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() 213 static void __init plist_test_requeue(struct plist_node *node) in plist_test_requeue()
|
D | cpumask.c | 111 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node() 126 bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in zalloc_cpumask_var_node() 201 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 815 struct assoc_array_node *node, *new_n0, *side; in assoc_array_insert_mid_shortcut() local 1055 struct assoc_array_node *node; member 1102 struct assoc_array_node *node, *new_n0; in assoc_array_delete() local 1365 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 | interval_tree_test.c | 31 struct interval_tree_node *node; in search() local
|
D | sbitmap.c | 24 gfp_t flags, int node) in sbitmap_init_node() 290 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node()
|
D | test_rhashtable.c | 66 struct rhash_head node; member
|
D | idr.c | 177 struct radix_tree_node *node; in idr_replace_ext() local
|
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
|