Lines Matching defs:index
12 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag)
14 return radix_tree_tag_set(root, index, tag);
18 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag)
20 return radix_tree_tag_clear(root, index, tag);
23 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag)
25 return radix_tree_tag_get(root, index, tag);
28 struct item *item_create(unsigned long index, unsigned int order)
32 ret->index = index;
37 int item_insert(struct radix_tree_root *root, unsigned long index)
39 struct item *item = item_create(index, 0);
40 int err = radix_tree_insert(root, item->index, item);
46 void item_sanity(struct item *item, unsigned long index)
52 assert((item->index | mask) == (index | mask));
55 void item_free(struct item *item, unsigned long index)
57 item_sanity(item, index);
61 int item_delete(struct radix_tree_root *root, unsigned long index)
63 struct item *item = radix_tree_delete(root, index);
68 item_free(item, index);
79 int item_delete_rcu(struct xarray *xa, unsigned long index)
81 struct item *item = xa_erase(xa, index);
84 item_sanity(item, index);
91 void item_check_present(struct radix_tree_root *root, unsigned long index)
95 item = radix_tree_lookup(root, index);
97 item_sanity(item, index);
100 struct item *item_lookup(struct radix_tree_root *root, unsigned long index)
102 return radix_tree_lookup(root, index);
105 void item_check_absent(struct radix_tree_root *root, unsigned long index)
109 item = radix_tree_lookup(root, index);
135 assert(items[i]->index == start + into + i);
158 assert(items[i]->index == this_index);
162 // items[0]->index, items[nfound-1]->index);