Searched defs:root (Results 1 – 11 of 11) sorted by relevance
/lib/ |
A D | rbtree.c | 76 struct rb_root *root, int color) in __rb_rotate_set_parents() 85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() 227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color() 410 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color() 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() 466 struct rb_node *rb_first(const struct rb_root *root) in rb_first() 479 struct rb_node *rb_last(const struct rb_root *root) in rb_last() 554 struct rb_root *root) in rb_replace_node() 571 struct rb_root *root) in rb_replace_node_rcu() [all …]
|
A D | radix-tree.c | 143 static inline bool is_idr(const struct radix_tree_root *root) in is_idr() 234 struct radix_tree_root *root, in radix_tree_node_alloc() 543 static bool delete_node(struct radix_tree_root *root, in delete_node() 850 static int calculate_count(struct radix_tree_root *root, in calculate_count() 875 void __radix_tree_replace(struct radix_tree_root *root, in __radix_tree_replace() 938 static void node_tag_set(struct radix_tree_root *root, in node_tag_set() 967 void *radix_tree_tag_set(struct radix_tree_root *root, in radix_tree_tag_set() 995 static void node_tag_clear(struct radix_tree_root *root, in node_tag_clear() 1029 void *radix_tree_tag_clear(struct radix_tree_root *root, in radix_tree_tag_clear() 1394 void radix_tree_iter_delete(struct radix_tree_root *root, in radix_tree_iter_delete() [all …]
|
A D | rbtree_test.c | 28 static struct rb_root_cached root = RB_ROOT_CACHED; variable 33 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() 50 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() 70 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() 75 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached() 111 struct rb_root_cached *root) in insert_augmented_cached() 139 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented() 145 struct rb_root_cached *root) in erase_augmented_cached()
|
A D | interval_tree_test.c | 26 static struct rb_root_cached root = RB_ROOT_CACHED; variable 33 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search()
|
A D | test_objagg.c | 37 struct root { struct 38 struct tokey key; 39 char buf[BUF_LEN]; 131 struct root *root; in root_create() local 144 struct root *root = root_priv; in root_destroy() local 156 const struct root *root; in test_nodelta_obj_get() local
|
A D | bootconfig.c | 291 int __init xbc_node_compose_key_after(struct xbc_node *root, in xbc_node_compose_key_after() 340 struct xbc_node * __init xbc_node_find_next_leaf(struct xbc_node *root, in xbc_node_find_next_leaf() 392 const char * __init xbc_node_find_next_key_value(struct xbc_node *root, in xbc_node_find_next_key_value()
|
A D | assoc_array.c | 19 static int assoc_array_subtree_iterate(const struct assoc_array_ptr *root, in assoc_array_subtree_iterate() 138 struct assoc_array_ptr *root = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_iterate() local 343 static void assoc_array_destroy_subtree(struct assoc_array_ptr *root, in assoc_array_destroy_subtree()
|
A D | maple_tree.c | 1370 struct maple_enode *root; in mas_start() local 3694 struct maple_enode *root = mas_root_locked(mas); in mas_new_root() local 6724 struct maple_enode *root; in mas_dup_build() local 6878 void *root = mt_root_locked(mt); in __mt_destroy() local
|
/lib/zlib_inflate/ |
A D | inftrees.c | 29 unsigned root; /* number of index bits for root table */ in zlib_inflate_table() local
|
/lib/reed_solomon/ |
A D | decode_rs.c | 37 uint16_t *root = rsc->buffers + RS_DECODE_ROOT * (nroots + 1); variable
|
A D | reed_solomon.c | 73 int i, j, sr, root, iprim; in codec_init() local
|
Completed in 28 milliseconds