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()
30 	return __radix_tree_insert(root, item->index, item->order, item);  in __item_insert()
33 struct item *item_create(unsigned long index, unsigned int order)  in item_create()  argument
37 	ret->index = index;  in item_create()
42 int item_insert_order(struct radix_tree_root *root, unsigned long index,  in item_insert_order()  argument
45 	struct item *item = item_create(index, order);  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()
57 void item_sanity(struct item *item, unsigned long index)  in item_sanity()  argument
63 	assert((item->index | mask) == (index | mask));  in item_sanity()
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()
71 		item_sanity(item, 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()
90 		item_sanity(item, 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()
103 	item_sanity(item, 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()
141 			assert(items[i]->index == start + into + i);  in item_gang_check_present()
164 			assert(items[i]->index == this_index);  in item_full_scan()
193 		if (iter.index > end)  in tag_tagged_items()
222 			found = iter.index;  in find_item()
299 			radix_tree_delete(root, iter.index);  in item_kill_tree()
308 			ret = radix_tree_delete(root, items[i]->index);  in item_kill_tree()