Lines Matching refs:index
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 struct item *item_create(unsigned long index, unsigned int order) in item_create() argument
32 ret->index = index; in item_create()
37 int item_insert(struct radix_tree_root *root, unsigned long index) in item_insert() argument
39 struct item *item = item_create(index, 0); in item_insert()
40 int err = radix_tree_insert(root, item->index, item); in item_insert()
46 void item_sanity(struct item *item, unsigned long index) in item_sanity() argument
52 assert((item->index | mask) == (index | mask)); in item_sanity()
55 void item_free(struct item *item, unsigned long index) in item_free() argument
57 item_sanity(item, index); in item_free()
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()
68 item_free(item, index); in item_delete()
79 int item_delete_rcu(struct xarray *xa, unsigned long index) in item_delete_rcu() argument
81 struct item *item = xa_erase(xa, index); in item_delete_rcu()
84 item_sanity(item, index); in item_delete_rcu()
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()
97 item_sanity(item, 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()
135 assert(items[i]->index == start + into + i); in item_gang_check_present()
158 assert(items[i]->index == this_index); in item_full_scan()