15 typedef size_t (*iov_step_f)(void *iter_base, size_t progress, size_t len,
17 typedef size_t (*iov_ustep_f)(void __user *iter_base, size_t progress, size_t len,
24 size_t iterate_ubuf(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_ubuf()  argument
30 	remain = step(base + iter->iov_offset, 0, len, priv, priv2);  in iterate_ubuf()
31 	progress = len - remain;  in iterate_ubuf()
41 size_t iterate_iovec(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_iovec()  argument
49 		size_t part = min(len, p->iov_len - skip);  in iterate_iovec()
56 			len -= consumed;  in iterate_iovec()
62 	} while (len);  in iterate_iovec()
75 size_t iterate_kvec(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_kvec()  argument
83 		size_t part = min(len, p->iov_len - skip);  in iterate_kvec()
90 			len -= consumed;  in iterate_kvec()
96 	} while (len);  in iterate_kvec()
109 size_t iterate_bvec(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_bvec()  argument
120 		part = min3(len,  in iterate_bvec()
126 		len -= consumed;  in iterate_bvec()
135 	} while (len);  in iterate_bvec()
148 size_t iterate_folioq(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_folioq()  argument
173 			part = umin(len, PAGE_SIZE - skip % PAGE_SIZE);  in iterate_folioq()
177 			len -= consumed;  in iterate_folioq()
191 	} while (len);  in iterate_folioq()
204 size_t iterate_xarray(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_xarray()  argument
225 		flen = min(folio_size(folio) - offset, len);  in iterate_xarray()
237 			len -= consumed;  in iterate_xarray()
239 			if (remain || len == 0)  in iterate_xarray()
257 size_t iterate_discard(struct iov_iter *iter, size_t len, void *priv, void *priv2,  in iterate_discard()  argument
260 	size_t progress = len;  in iterate_discard()
293 size_t iterate_and_advance2(struct iov_iter *iter, size_t len, void *priv,  in iterate_and_advance2()  argument
296 	if (unlikely(iter->count < len))  in iterate_and_advance2()
297 		len = iter->count;  in iterate_and_advance2()
298 	if (unlikely(!len))  in iterate_and_advance2()
302 		return iterate_ubuf(iter, len, priv, priv2, ustep);  in iterate_and_advance2()
304 		return iterate_iovec(iter, len, priv, priv2, ustep);  in iterate_and_advance2()
306 		return iterate_bvec(iter, len, priv, priv2, step);  in iterate_and_advance2()
308 		return iterate_kvec(iter, len, priv, priv2, step);  in iterate_and_advance2()
310 		return iterate_folioq(iter, len, priv, priv2, step);  in iterate_and_advance2()
312 		return iterate_xarray(iter, len, priv, priv2, step);  in iterate_and_advance2()
313 	return iterate_discard(iter, len, priv, priv2, step);  in iterate_and_advance2()
327 size_t iterate_and_advance(struct iov_iter *iter, size_t len, void *priv,  in iterate_and_advance()  argument
330 	return iterate_and_advance2(iter, len, priv, NULL, ustep, step);  in iterate_and_advance()
362 size_t iterate_and_advance_kernel(struct iov_iter *iter, size_t len, void *priv,  in iterate_and_advance_kernel()  argument
365 	if (unlikely(iter->count < len))  in iterate_and_advance_kernel()
366 		len = iter->count;  in iterate_and_advance_kernel()
367 	if (unlikely(!len))  in iterate_and_advance_kernel()
370 		return iterate_bvec(iter, len, priv, priv2, step);  in iterate_and_advance_kernel()
372 		return iterate_kvec(iter, len, priv, priv2, step);  in iterate_and_advance_kernel()
374 		return iterate_folioq(iter, len, priv, priv2, step);  in iterate_and_advance_kernel()
376 		return iterate_xarray(iter, len, priv, priv2, step);  in iterate_and_advance_kernel()
377 	return iterate_discard(iter, len, priv, priv2, step);  in iterate_and_advance_kernel()