12 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag)  in item_tag_set()  argument
14 	return radix_tree_tag_set(root, index, tag);  in item_tag_set()
18 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag)  in item_tag_clear()  argument
20 	return radix_tree_tag_clear(root, index, tag);  in item_tag_clear()
23 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag)  in item_tag_get()  argument
25 	return radix_tree_tag_get(root, index, tag);  in item_tag_get()
28 int __item_insert(struct radix_tree_root *root, struct item *item)  in __item_insert()  argument
30 	return __radix_tree_insert(root, item->index, item->order, item);  in __item_insert()
42 int item_insert_order(struct radix_tree_root *root, unsigned long index,  in item_insert_order()  argument
46 	int err = __item_insert(root, item);  in item_insert_order()
52 int item_insert(struct radix_tree_root *root, unsigned long index)  in item_insert()  argument
54 	return item_insert_order(root, index, 0);  in item_insert()
66 int item_delete(struct radix_tree_root *root, unsigned long index)  in item_delete()  argument
68 	struct item *item = radix_tree_delete(root, index);  in item_delete()
85 int item_delete_rcu(struct radix_tree_root *root, unsigned long index)  in item_delete_rcu()  argument
87 	struct item *item = radix_tree_delete(root, index);  in item_delete_rcu()
97 void item_check_present(struct radix_tree_root *root, unsigned long index)  in item_check_present()  argument
101 	item = radix_tree_lookup(root, index);  in item_check_present()
106 struct item *item_lookup(struct radix_tree_root *root, unsigned long index)  in item_lookup()  argument
108 	return radix_tree_lookup(root, index);  in item_lookup()
111 void item_check_absent(struct radix_tree_root *root, unsigned long index)  in item_check_absent()  argument
115 	item = radix_tree_lookup(root, index);  in item_check_absent()
122 void item_gang_check_present(struct radix_tree_root *root,  in item_gang_check_present()  argument
137 		nfound = radix_tree_gang_lookup(root, (void **)items,  in item_gang_check_present()
149 void item_full_scan(struct radix_tree_root *root, unsigned long start,  in item_full_scan()  argument
160 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, into,  in item_full_scan()
173 	nfound = radix_tree_gang_lookup(root, (void **)items,  in item_full_scan()
179 int tag_tagged_items(struct radix_tree_root *root, pthread_mutex_t *lock,  in tag_tagged_items()  argument
192 	radix_tree_for_each_tagged(slot, root, &iter, start, iftag) {  in tag_tagged_items()
195 		radix_tree_iter_tag_set(root, &iter, thentag);  in tag_tagged_items()
213 unsigned long find_item(struct radix_tree_root *root, void *item)  in find_item()  argument
220 	radix_tree_for_each_slot(slot, root, &iter, 0) {  in find_item()
282 void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag)  in verify_tag_consistency()  argument
284 	struct radix_tree_node *node = root->rnode;  in verify_tag_consistency()
287 	verify_node(node, tag, !!root_tag_get(root, tag));  in verify_tag_consistency()
290 void item_kill_tree(struct radix_tree_root *root)  in item_kill_tree()  argument
297 	radix_tree_for_each_slot(slot, root, &iter, 0) {  in item_kill_tree()
299 			radix_tree_delete(root, iter.index);  in item_kill_tree()
302 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, 0, 32))) {  in item_kill_tree()
308 			ret = radix_tree_delete(root, items[i]->index);  in item_kill_tree()
313 	assert(radix_tree_gang_lookup(root, (void **)items, 0, 32) == 0);  in item_kill_tree()
314 	assert(root->rnode == NULL);  in item_kill_tree()
317 void tree_verify_min_height(struct radix_tree_root *root, int maxindex)  in tree_verify_min_height()  argument
320 	struct radix_tree_node *node = root->rnode;  in tree_verify_min_height()