Home
last modified time | relevance | path

Searched defs:node (Results 1 – 11 of 11) sorted by relevance

/lib/
Drbtree.c73 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
205 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; in ____rb_erase_color() local
378 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate()
386 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
392 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
408 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
444 struct rb_node *rb_next(const struct rb_node *node) in rb_next()
476 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev()
522 static struct rb_node *rb_left_deepest_node(const struct rb_node *node) in rb_left_deepest_node()
534 struct rb_node *rb_next_postorder(const struct rb_node *node) in rb_next_postorder()
Dtimerqueue.c39 void timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add()
72 void timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del()
97 struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node) in timerqueue_iterate_next()
Dinterval_tree.c5 #define START(node) ((node)->start) argument
6 #define LAST(node) ((node)->last) argument
Drbtree_test.c24 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()
124 struct test_node *node = rb_entry(rb, struct test_node, rb); in check() local
147 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented() local
Dradix-tree.c112 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set()
118 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear()
124 static inline int tag_get(struct radix_tree_node *node, unsigned int tag, in tag_get()
154 static inline int any_tag_set(struct radix_tree_node *node, unsigned int tag) in any_tag_set()
234 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
253 radix_tree_node_free(struct radix_tree_node *node) in radix_tree_node_free()
270 struct radix_tree_node *node; in radix_tree_preload() local
307 struct radix_tree_node *node; in radix_tree_extend() local
363 struct radix_tree_node *node = NULL, *slot; in radix_tree_insert() local
431 struct radix_tree_node *node, **slot; in radix_tree_lookup_element() local
[all …]
Dbtree.c95 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()
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() local
274 unsigned long *node = head->node; in btree_update() local
[all …]
Dplist.c75 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add()
114 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del()
Dcpumask.c82 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node()
104 bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in zalloc_cpumask_var_node()
Dinterval_tree_test_main.c20 struct interval_tree_node *node; in search() local
Dklist.c176 struct klist_node *node; member
/lib/zlib_deflate/
Ddeftree.c548 int node; /* new node being created */ in build_tree() local