67 radix_tree_lookup(struct radix_tree_root *root, unsigned long index)  in radix_tree_lookup()  argument
76 	if (index > radix_max(root))  in radix_tree_lookup()
79 		node = node->slots[radix_pos(index, height--)];  in radix_tree_lookup()
81 		item = node->slots[radix_pos(index, 0)];  in radix_tree_lookup()
92 	unsigned long index = iter->index;  in radix_tree_iter_find()  local
100 	if (height == -1 || index > radix_max(root))  in radix_tree_iter_find()
105 		int pos = radix_pos(index, height);  in radix_tree_iter_find()
113 			index += step;  in radix_tree_iter_find()
114 			index &= -step;  in radix_tree_iter_find()
115 			if ((index & mask) == 0)  in radix_tree_iter_find()
122 	iter->index = index;  in radix_tree_iter_find()
127 radix_tree_delete(struct radix_tree_root *root, unsigned long index)  in radix_tree_delete()  argument
138 	if (index > radix_max(root))  in radix_tree_delete()
145 		node = node->slots[radix_pos(index, height--)];  in radix_tree_delete()
147 	idx = radix_pos(index, 0);  in radix_tree_delete()
167 			idx = radix_pos(index, height);  in radix_tree_delete()
177 	radix_tree_delete(root, iter->index);  in radix_tree_iter_delete()
181 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item)  in radix_tree_insert()  argument
205 	while (radix_max(root) < index) {  in radix_tree_insert()
240 		idx = radix_pos(index, height);  in radix_tree_insert()
260 		idx = radix_pos(index, height);  in radix_tree_insert()
269 	idx = radix_pos(index, 0);  in radix_tree_insert()
279 radix_tree_store(struct radix_tree_root *root, unsigned long index, void **ppitem)  in radix_tree_store()  argument
292 		*ppitem = radix_tree_delete(root, index);  in radix_tree_store()
309 	while (radix_max(root) < index) {  in radix_tree_store()
344 		idx = radix_pos(index, height);  in radix_tree_store()
364 		idx = radix_pos(index, height);  in radix_tree_store()
373 	idx = radix_pos(index, 0);  in radix_tree_store()