321 static int radix_tree_extend(struct radix_tree_root *root, unsigned long index)  in radix_tree_extend()  argument
330 	while (index > radix_tree_maxindex(height))  in radix_tree_extend()
385 int __radix_tree_create(struct radix_tree_root *root, unsigned long index,  in __radix_tree_create()  argument
393 	if (index > radix_tree_maxindex(root->height)) {  in __radix_tree_create()
394 		error = radix_tree_extend(root, index);  in __radix_tree_create()
421 		offset = (index >> shift) & RADIX_TREE_MAP_MASK;  in __radix_tree_create()
444 			unsigned long index, void *item)  in radix_tree_insert()  argument
452 	error = __radix_tree_create(root, index, &node, &slot);  in radix_tree_insert()
461 		BUG_ON(tag_get(node, 0, index & RADIX_TREE_MAP_MASK));  in radix_tree_insert()
462 		BUG_ON(tag_get(node, 1, index & RADIX_TREE_MAP_MASK));  in radix_tree_insert()
486 void *__radix_tree_lookup(struct radix_tree_root *root, unsigned long index,  in __radix_tree_lookup()  argument
498 		if (index > 0)  in __radix_tree_lookup()
510 	if (index > radix_tree_maxindex(height))  in __radix_tree_lookup()
517 		slot = node->slots + ((index >> shift) & RADIX_TREE_MAP_MASK);  in __radix_tree_lookup()
546 void **radix_tree_lookup_slot(struct radix_tree_root *root, unsigned long index)  in radix_tree_lookup_slot()  argument
550 	if (!__radix_tree_lookup(root, index, NULL, &slot))  in radix_tree_lookup_slot()
568 void *radix_tree_lookup(struct radix_tree_root *root, unsigned long index)  in radix_tree_lookup()  argument
570 	return __radix_tree_lookup(root, index, NULL, NULL);  in radix_tree_lookup()
588 			unsigned long index, unsigned int tag)  in radix_tree_tag_set()  argument
594 	BUG_ON(index > radix_tree_maxindex(height));  in radix_tree_tag_set()
602 		offset = (index >> shift) & RADIX_TREE_MAP_MASK;  in radix_tree_tag_set()
634 			unsigned long index, unsigned int tag)  in radix_tree_tag_clear()  argument
642 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_clear()
653 		offset = (index >> shift) & RADIX_TREE_MAP_MASK;  in radix_tree_tag_clear()
668 		index >>= RADIX_TREE_MAP_SHIFT;  in radix_tree_tag_clear()
669 		offset = index & RADIX_TREE_MAP_MASK;  in radix_tree_tag_clear()
698 			unsigned long index, unsigned int tag)  in radix_tree_tag_get()  argument
712 		return (index == 0);  in radix_tree_tag_get()
716 	if (index > radix_tree_maxindex(height))  in radix_tree_tag_get()
727 		offset = (index >> shift) & RADIX_TREE_MAP_MASK;  in radix_tree_tag_get()
752 	unsigned long index, offset, height;  in radix_tree_next_chunk()  local
766 	index = iter->next_index;  in radix_tree_next_chunk()
767 	if (!index && iter->index)  in radix_tree_next_chunk()
773 	} else if (rnode && !index) {  in radix_tree_next_chunk()
775 		iter->index = 0;  in radix_tree_next_chunk()
785 	offset = index >> shift;  in radix_tree_next_chunk()
810 			index &= ~((RADIX_TREE_MAP_SIZE << shift) - 1);  in radix_tree_next_chunk()
811 			index += offset << shift;  in radix_tree_next_chunk()
813 			if (!index)  in radix_tree_next_chunk()
827 		offset = (index >> shift) & RADIX_TREE_MAP_MASK;  in radix_tree_next_chunk()
831 	iter->index = index;  in radix_tree_next_chunk()
832 	iter->next_index = (index | RADIX_TREE_MAP_MASK) + 1;  in radix_tree_next_chunk()
848 			iter->next_index = index + BITS_PER_LONG;  in radix_tree_next_chunk()
893 	unsigned long index = *first_indexp;  in radix_tree_range_tag_if_tagged()  local
896 	if (index > last_index)  in radix_tree_range_tag_if_tagged()
917 		offset = (index >> shift) & RADIX_TREE_MAP_MASK;  in radix_tree_range_tag_if_tagged()
935 		upindex = index;  in radix_tree_range_tag_if_tagged()
958 		index = ((index >> shift) + 1) << shift;  in radix_tree_range_tag_if_tagged()
960 		if (index > last_index || !index)  in radix_tree_range_tag_if_tagged()
964 		while (((index >> shift) & RADIX_TREE_MAP_MASK) == 0) {  in radix_tree_range_tag_if_tagged()
980 	*first_indexp = index;  in radix_tree_range_tag_if_tagged()
1065 			indices[ret] = iter.index;  in radix_tree_gang_lookup_slot()
1157 			      unsigned long index, unsigned long *found_index)  in __locate()  argument
1166 		i = (index >> shift) & RADIX_TREE_MAP_MASK;  in __locate()
1170 			index &= ~((1UL << shift) - 1);  in __locate()
1171 			index += 1UL << shift;  in __locate()
1172 			if (index == 0)  in __locate()
1188 			*found_index = index + i;  in __locate()
1189 			index = 0;  in __locate()
1193 	index += RADIX_TREE_MAP_SIZE;  in __locate()
1195 	return index;  in __locate()
1372 			     unsigned long index, void *item)  in radix_tree_delete_item()  argument
1380 	entry = __radix_tree_lookup(root, index, &node, &slot);  in radix_tree_delete_item()
1393 	offset = index & RADIX_TREE_MAP_MASK;  in radix_tree_delete_item()
1401 			radix_tree_tag_clear(root, index, tag);  in radix_tree_delete_item()
1422 void *radix_tree_delete(struct radix_tree_root *root, unsigned long index)  in radix_tree_delete()  argument
1424 	return radix_tree_delete_item(root, index, NULL);  in radix_tree_delete()