212 static unsigned int iter_offset(const struct radix_tree_iter *iter)  in iter_offset()  argument
214 	return iter->index & RADIX_TREE_MAP_MASK;  in iter_offset()
940 				const struct radix_tree_iter *iter,  in radix_tree_iter_replace()  argument
943 	__radix_tree_replace(root, iter->node, slot, item);  in radix_tree_iter_replace()
1069 			const struct radix_tree_iter *iter, unsigned int tag)  in radix_tree_iter_tag_clear()  argument
1071 	node_tag_clear(root, iter->node, tag, iter_offset(iter));  in radix_tree_iter_tag_clear()
1119 static void set_iter_tags(struct radix_tree_iter *iter,  in set_iter_tags()  argument
1127 		iter->tags = 1;  in set_iter_tags()
1131 	iter->tags = node->tags[tag][tag_long] >> tag_bit;  in set_iter_tags()
1137 			iter->tags |= node->tags[tag][tag_long + 1] <<  in set_iter_tags()
1140 		iter->next_index = __radix_tree_iter_add(iter, BITS_PER_LONG);  in set_iter_tags()
1145 					struct radix_tree_iter *iter)  in radix_tree_iter_resume()  argument
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()
1150 	iter->tags = 0;  in radix_tree_iter_resume()
1164 			     struct radix_tree_iter *iter, unsigned flags)  in radix_tree_next_chunk()  argument
1182 	index = iter->next_index;  in radix_tree_next_chunk()
1183 	if (!index && iter->index)  in radix_tree_next_chunk()
1195 		iter->index = index;  in radix_tree_next_chunk()
1196 		iter->next_index = maxindex + 1;  in radix_tree_next_chunk()
1197 		iter->tags = 1;  in radix_tree_next_chunk()
1198 		iter->node = NULL;  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()
1241 	iter->node = node;  in radix_tree_next_chunk()
1244 		set_iter_tags(iter, node, offset, tag);  in radix_tree_next_chunk()
1274 	struct radix_tree_iter iter;  in radix_tree_gang_lookup()  local
1281 	radix_tree_for_each_slot(slot, root, &iter, first_index) {  in radix_tree_gang_lookup()
1286 			slot = radix_tree_iter_retry(&iter);  in radix_tree_gang_lookup()
1315 	struct radix_tree_iter iter;  in radix_tree_gang_lookup_tag()  local
1322 	radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) {  in radix_tree_gang_lookup_tag()
1327 			slot = radix_tree_iter_retry(&iter);  in radix_tree_gang_lookup_tag()
1356 	struct radix_tree_iter iter;  in radix_tree_gang_lookup_tag_slot()  local
1363 	radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) {  in radix_tree_gang_lookup_tag_slot()
1404 				struct radix_tree_iter *iter, void __rcu **slot)  in radix_tree_iter_delete()  argument
1406 	if (__radix_tree_delete(root, iter->node, slot))  in radix_tree_iter_delete()
1407 		iter->index = iter->next_index;  in radix_tree_iter_delete()
1486 			      struct radix_tree_iter *iter, gfp_t gfp,  in idr_get_free()  argument
1491 	unsigned long maxindex, start = iter->next_index;  in idr_get_free()
1546 	iter->index = start;  in idr_get_free()
1548 		iter->next_index = 1 + min(max, (start | node_maxindex(node)));  in idr_get_free()
1550 		iter->next_index = 1;  in idr_get_free()
1551 	iter->node = node;  in idr_get_free()
1552 	set_iter_tags(iter, node, offset, IDR_FREE);  in idr_get_free()