95 			struct radix_tree_node **nodep, unsigned long index)  in radix_tree_descend()  argument
97 	unsigned int offset = (index >> parent->shift) & RADIX_TREE_MAP_MASK;  in radix_tree_descend()
214 	return iter->index & RADIX_TREE_MAP_MASK;  in iter_offset()
230 static unsigned long next_index(unsigned long index,  in next_index()  argument
234 	return (index & ~node_maxindex(node)) + (offset << node->shift);  in next_index()
418 				unsigned long index, unsigned int shift)  in radix_tree_extend()  argument
426 	while (index > shift_maxindex(maxshift))  in radix_tree_extend()
608 		unsigned long index, struct radix_tree_node **nodep,  in __radix_tree_create()  argument
615 	unsigned long max = index;  in __radix_tree_create()
645 		offset = radix_tree_descend(node, &child, index);  in __radix_tree_create()
712 int radix_tree_insert(struct radix_tree_root *root, unsigned long index,  in radix_tree_insert()  argument
721 	error = __radix_tree_create(root, index, &node, &slot);  in radix_tree_insert()
757 			  unsigned long index, struct radix_tree_node **nodep,  in __radix_tree_lookup()  argument
768 	if (index > maxindex)  in __radix_tree_lookup()
775 		offset = radix_tree_descend(parent, &node, index);  in __radix_tree_lookup()
804 				unsigned long index)  in radix_tree_lookup_slot()  argument
808 	if (!__radix_tree_lookup(root, index, NULL, &slot))  in radix_tree_lookup_slot()
826 void *radix_tree_lookup(const struct radix_tree_root *root, unsigned long index)  in radix_tree_lookup()  argument
828 	return __radix_tree_lookup(root, index, NULL, NULL);  in radix_tree_lookup()
976 			unsigned long index, unsigned int tag)  in radix_tree_tag_set()  argument
982 	BUG_ON(index > maxindex);  in radix_tree_tag_set()
988 		offset = radix_tree_descend(parent, &node, index);  in radix_tree_tag_set()
1038 			unsigned long index, unsigned int tag)  in radix_tree_tag_clear()  argument
1045 	if (index > maxindex)  in radix_tree_tag_clear()
1052 		offset = radix_tree_descend(parent, &node, index);  in radix_tree_tag_clear()
1090 			unsigned long index, unsigned int tag)  in radix_tree_tag_get()  argument
1099 	if (index > maxindex)  in radix_tree_tag_get()
1106 		offset = radix_tree_descend(parent, &node, index);  in radix_tree_tag_get()
1148 	iter->index = __radix_tree_iter_add(iter, 1);  in radix_tree_iter_resume()
1149 	iter->next_index = iter->index;  in radix_tree_iter_resume()
1168 	unsigned long index, offset, maxindex;  in radix_tree_next_chunk()  local
1182 	index = iter->next_index;  in radix_tree_next_chunk()
1183 	if (!index && iter->index)  in radix_tree_next_chunk()
1188 	if (index > maxindex)  in radix_tree_next_chunk()
1195 		iter->index = index;  in radix_tree_next_chunk()
1204 		offset = radix_tree_descend(node, &child, index);  in radix_tree_next_chunk()
1222 			index &= ~node_maxindex(node);  in radix_tree_next_chunk()
1223 			index += offset << node->shift;  in radix_tree_next_chunk()
1225 			if (!index)  in radix_tree_next_chunk()
1239 	iter->index = (index &~ node_maxindex(node)) | offset;  in radix_tree_next_chunk()
1240 	iter->next_index = (index | node_maxindex(node)) + 1;  in radix_tree_next_chunk()
1407 		iter->index = iter->next_index;  in radix_tree_iter_delete()
1423 			     unsigned long index, void *item)  in radix_tree_delete_item()  argument
1429 	entry = __radix_tree_lookup(root, index, &node, &slot);  in radix_tree_delete_item()
1454 void *radix_tree_delete(struct radix_tree_root *root, unsigned long index)  in radix_tree_delete()  argument
1456 	return radix_tree_delete_item(root, index, NULL);  in radix_tree_delete()
1546 	iter->index = start;  in idr_get_free()