221 			struct radix_tree_iter *iter, void __rcu **slot);
237 		const struct radix_tree_iter *iter, unsigned int tag);
252 			      struct radix_tree_iter *iter, gfp_t gfp,
269 radix_tree_iter_init(struct radix_tree_iter *iter, unsigned long start)  in radix_tree_iter_init()  argument
279 	iter->index = 0;  in radix_tree_iter_init()
280 	iter->next_index = start;  in radix_tree_iter_init()
298 			     struct radix_tree_iter *iter, unsigned flags);
312 			struct radix_tree_iter *iter, unsigned long index)  in radix_tree_iter_lookup()  argument
314 	radix_tree_iter_init(iter, index);  in radix_tree_iter_lookup()
315 	return radix_tree_next_chunk(root, iter, RADIX_TREE_ITER_CONTIG);  in radix_tree_iter_lookup()
328 void __rcu **radix_tree_iter_retry(struct radix_tree_iter *iter)  in radix_tree_iter_retry()  argument
330 	iter->next_index = iter->index;  in radix_tree_iter_retry()
331 	iter->tags = 0;  in radix_tree_iter_retry()
336 __radix_tree_iter_add(struct radix_tree_iter *iter, unsigned long slots)  in __radix_tree_iter_add()  argument
338 	return iter->index + slots;  in __radix_tree_iter_add()
352 					struct radix_tree_iter *iter);
361 radix_tree_chunk_size(struct radix_tree_iter *iter)  in radix_tree_chunk_size()  argument
363 	return iter->next_index - iter->index;  in radix_tree_chunk_size()
386 				struct radix_tree_iter *iter, unsigned flags)  in radix_tree_next_slot()  argument
389 		iter->tags >>= 1;  in radix_tree_next_slot()
390 		if (unlikely(!iter->tags))  in radix_tree_next_slot()
392 		if (likely(iter->tags & 1ul)) {  in radix_tree_next_slot()
393 			iter->index = __radix_tree_iter_add(iter, 1);  in radix_tree_next_slot()
398 			unsigned offset = __ffs(iter->tags);  in radix_tree_next_slot()
400 			iter->tags >>= offset++;  in radix_tree_next_slot()
401 			iter->index = __radix_tree_iter_add(iter, offset);  in radix_tree_next_slot()
406 		long count = radix_tree_chunk_size(iter);  in radix_tree_next_slot()
410 			iter->index = __radix_tree_iter_add(iter, 1);  in radix_tree_next_slot()
416 				iter->next_index = 0;  in radix_tree_next_slot()
437 #define radix_tree_for_each_slot(slot, root, iter, start)		\  argument
438 	for (slot = radix_tree_iter_init(iter, start) ;			\
439 	     slot || (slot = radix_tree_next_chunk(root, iter, 0)) ;	\
440 	     slot = radix_tree_next_slot(slot, iter, 0))
453 #define radix_tree_for_each_tagged(slot, root, iter, start, tag)	\  argument
454 	for (slot = radix_tree_iter_init(iter, start) ;			\
455 	     slot || (slot = radix_tree_next_chunk(root, iter,		\
457 	     slot = radix_tree_next_slot(slot, iter,			\