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()
37 int item_insert(struct radix_tree_root *root, unsigned long index)  in item_insert()  argument
40 	int err = radix_tree_insert(root, item->index, item);  in item_insert()
61 int item_delete(struct radix_tree_root *root, unsigned long index)  in item_delete()  argument
63 	struct item *item = radix_tree_delete(root, index);  in item_delete()
91 void item_check_present(struct radix_tree_root *root, unsigned long index)  in item_check_present()  argument
95 	item = radix_tree_lookup(root, index);  in item_check_present()
100 struct item *item_lookup(struct radix_tree_root *root, unsigned long index)  in item_lookup()  argument
102 	return radix_tree_lookup(root, index);  in item_lookup()
105 void item_check_absent(struct radix_tree_root *root, unsigned long index)  in item_check_absent()  argument
109 	item = radix_tree_lookup(root, index);  in item_check_absent()
116 void item_gang_check_present(struct radix_tree_root *root,  in item_gang_check_present()  argument
131 		nfound = radix_tree_gang_lookup(root, (void **)items,  in item_gang_check_present()
143 void item_full_scan(struct radix_tree_root *root, unsigned long start,  in item_full_scan()  argument
154 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, into,  in item_full_scan()
167 	nfound = radix_tree_gang_lookup(root, (void **)items,  in item_full_scan()
247 void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag)  in verify_tag_consistency()  argument
249 	struct radix_tree_node *node = root->xa_head;  in verify_tag_consistency()
252 	verify_node(node, tag, !!root_tag_get(root, tag));  in verify_tag_consistency()
270 void tree_verify_min_height(struct radix_tree_root *root, int maxindex)  in tree_verify_min_height()  argument
273 	struct radix_tree_node *node = root->xa_head;  in tree_verify_min_height()