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