Lines Matching +full:min +full:- +full:len
1 // SPDX-License-Identifier: GPL-2.0-only
4 #include <linux/fault-inject-usercopy.h>
18 size_t len, void *from, void *priv2) in copy_to_user_iter() argument
21 return len; in copy_to_user_iter()
22 if (access_ok(iter_to, len)) { in copy_to_user_iter()
24 instrument_copy_to_user(iter_to, from, len); in copy_to_user_iter()
25 len = raw_copy_to_user(iter_to, from, len); in copy_to_user_iter()
27 return len; in copy_to_user_iter()
32 size_t len, void *from, void *priv2) in copy_to_user_iter_nofault() argument
37 return len; in copy_to_user_iter_nofault()
40 res = copy_to_user_nofault(iter_to, from, len); in copy_to_user_iter_nofault()
41 return res < 0 ? len : res; in copy_to_user_iter_nofault()
46 size_t len, void *to, void *priv2) in copy_from_user_iter() argument
48 size_t res = len; in copy_from_user_iter()
51 return len; in copy_from_user_iter()
52 if (access_ok(iter_from, len)) { in copy_from_user_iter()
54 instrument_copy_from_user_before(to, iter_from, len); in copy_from_user_iter()
55 res = raw_copy_from_user(to, iter_from, len); in copy_from_user_iter()
56 instrument_copy_from_user_after(to, iter_from, len, res); in copy_from_user_iter()
63 size_t len, void *from, void *priv2) in memcpy_to_iter() argument
65 memcpy(iter_to, from + progress, len); in memcpy_to_iter()
71 size_t len, void *to, void *priv2) in memcpy_from_iter() argument
73 memcpy(to + progress, iter_from, len); in memcpy_from_iter()
78 * fault_in_iov_iter_readable - fault in iov iterator for reading
88 * Always returns 0 for non-userspace iterators.
93 size_t n = min(size, iov_iter_count(i)); in fault_in_iov_iter_readable()
94 n -= fault_in_readable(i->ubuf + i->iov_offset, n); in fault_in_iov_iter_readable()
95 return size - n; in fault_in_iov_iter_readable()
97 size_t count = min(size, iov_iter_count(i)); in fault_in_iov_iter_readable()
101 size -= count; in fault_in_iov_iter_readable()
102 for (p = iter_iov(i), skip = i->iov_offset; count; p++, skip = 0) { in fault_in_iov_iter_readable()
103 size_t len = min(count, p->iov_len - skip); in fault_in_iov_iter_readable() local
106 if (unlikely(!len)) in fault_in_iov_iter_readable()
108 ret = fault_in_readable(p->iov_base + skip, len); in fault_in_iov_iter_readable()
109 count -= len - ret; in fault_in_iov_iter_readable()
120 * fault_in_iov_iter_writeable - fault in iov iterator for writing
131 * Always returns 0 for non-user-space iterators.
136 size_t n = min(size, iov_iter_count(i)); in fault_in_iov_iter_writeable()
137 n -= fault_in_safe_writeable(i->ubuf + i->iov_offset, n); in fault_in_iov_iter_writeable()
138 return size - n; in fault_in_iov_iter_writeable()
140 size_t count = min(size, iov_iter_count(i)); in fault_in_iov_iter_writeable()
144 size -= count; in fault_in_iov_iter_writeable()
145 for (p = iter_iov(i), skip = i->iov_offset; count; p++, skip = 0) { in fault_in_iov_iter_writeable()
146 size_t len = min(count, p->iov_len - skip); in fault_in_iov_iter_writeable() local
149 if (unlikely(!len)) in fault_in_iov_iter_writeable()
151 ret = fault_in_safe_writeable(p->iov_base + skip, len); in fault_in_iov_iter_writeable()
152 count -= len - ret; in fault_in_iov_iter_writeable()
181 if (WARN_ON_ONCE(i->data_source)) in _copy_to_iter()
193 size_t len, void *from, void *priv2) in copy_to_user_iter_mc() argument
195 if (access_ok(iter_to, len)) { in copy_to_user_iter_mc()
197 instrument_copy_to_user(iter_to, from, len); in copy_to_user_iter_mc()
198 len = copy_mc_to_user(iter_to, from, len); in copy_to_user_iter_mc()
200 return len; in copy_to_user_iter_mc()
205 size_t len, void *from, void *priv2) in memcpy_to_iter_mc() argument
207 return copy_mc_to_kernel(iter_to, from + progress, len); in memcpy_to_iter_mc()
211 * _copy_mc_to_iter - copy to iter with source memory error exception handling
217 * (dax_copy_to_iter()) for dax reads (bypass page-cache and the
218 * block-layer). Upon #MC read(2) aborts and returns EIO or the bytes
224 * byte-by-byte until the fault happens again. Re-triggering machine
226 * alignment and poison alignment assumptions to avoid re-triggering
236 if (WARN_ON_ONCE(i->data_source)) in _copy_mc_to_iter()
255 if (WARN_ON_ONCE(!i->data_source)) in _copy_from_iter()
266 size_t len, void *to, void *priv2) in copy_from_user_iter_nocache() argument
268 return __copy_from_user_inatomic_nocache(to + progress, iter_from, len); in copy_from_user_iter_nocache()
273 if (WARN_ON_ONCE(!i->data_source)) in _copy_from_iter_nocache()
285 size_t len, void *to, void *priv2) in copy_from_user_iter_flushcache() argument
287 return __copy_from_user_flushcache(to + progress, iter_from, len); in copy_from_user_iter_flushcache()
292 size_t len, void *to, void *priv2) in memcpy_from_iter_flushcache() argument
294 memcpy_flushcache(to + progress, iter_from, len); in memcpy_from_iter_flushcache()
299 * _copy_from_iter_flushcache - write destination through cpu cache
304 * The pmem driver arranges for filesystem-dax to use this facility via
310 * instructions that strand dirty-data in the cache.
316 if (WARN_ON_ONCE(!i->data_source)) in _copy_from_iter_flushcache()
334 * However, we mostly deal with order-0 pages and thus can in page_copy_sane()
342 v += (page - head) << PAGE_SHIFT; in page_copy_sane()
355 if (WARN_ON_ONCE(i->data_source)) in copy_page_to_iter()
361 size_t n = min(bytes, (size_t)PAGE_SIZE - offset); in copy_page_to_iter()
365 bytes -= n; in copy_page_to_iter()
385 if (WARN_ON_ONCE(i->data_source)) in copy_page_to_iter_nofault()
391 size_t n = min(bytes, (size_t)PAGE_SIZE - offset); in copy_page_to_iter_nofault()
398 bytes -= n; in copy_page_to_iter_nofault()
421 size_t n = min(bytes, (size_t)PAGE_SIZE - offset); in copy_page_from_iter()
425 bytes -= n; in copy_page_from_iter()
440 size_t len, void *priv, void *priv2) in zero_to_user_iter() argument
442 return clear_user(iter_to, len); in zero_to_user_iter()
447 size_t len, void *priv, void *priv2) in zero_to_iter() argument
449 memset(iter_to, 0, len); in zero_to_iter()
469 if (WARN_ON_ONCE(!i->data_source)) in copy_page_from_iter_atomic()
475 n = bytes - copied; in copy_page_from_iter_atomic()
479 n = min_t(size_t, n, PAGE_SIZE - offset); in copy_page_from_iter_atomic()
497 if (!i->count) in iov_iter_bvec_advance()
499 i->count -= size; in iov_iter_bvec_advance()
501 size += i->iov_offset; in iov_iter_bvec_advance()
503 for (bvec = i->bvec, end = bvec + i->nr_segs; bvec < end; bvec++) { in iov_iter_bvec_advance()
504 if (likely(size < bvec->bv_len)) in iov_iter_bvec_advance()
506 size -= bvec->bv_len; in iov_iter_bvec_advance()
508 i->iov_offset = size; in iov_iter_bvec_advance()
509 i->nr_segs -= bvec - i->bvec; in iov_iter_bvec_advance()
510 i->bvec = bvec; in iov_iter_bvec_advance()
517 if (!i->count) in iov_iter_iovec_advance()
519 i->count -= size; in iov_iter_iovec_advance()
521 size += i->iov_offset; // from beginning of current segment in iov_iter_iovec_advance()
522 for (iov = iter_iov(i), end = iov + i->nr_segs; iov < end; iov++) { in iov_iter_iovec_advance()
523 if (likely(size < iov->iov_len)) in iov_iter_iovec_advance()
525 size -= iov->iov_len; in iov_iter_iovec_advance()
527 i->iov_offset = size; in iov_iter_iovec_advance()
528 i->nr_segs -= iov - iter_iov(i); in iov_iter_iovec_advance()
529 i->__iov = iov; in iov_iter_iovec_advance()
534 const struct folio_queue *folioq = i->folioq; in iov_iter_folioq_advance()
535 unsigned int slot = i->folioq_slot; in iov_iter_folioq_advance()
537 if (!i->count) in iov_iter_folioq_advance()
539 i->count -= size; in iov_iter_folioq_advance()
542 folioq = folioq->next; in iov_iter_folioq_advance()
546 size += i->iov_offset; /* From beginning of current segment. */ in iov_iter_folioq_advance()
552 size -= fsize; in iov_iter_folioq_advance()
554 if (slot >= folioq_nr_slots(folioq) && folioq->next) { in iov_iter_folioq_advance()
555 folioq = folioq->next; in iov_iter_folioq_advance()
560 i->iov_offset = size; in iov_iter_folioq_advance()
561 i->folioq_slot = slot; in iov_iter_folioq_advance()
562 i->folioq = folioq; in iov_iter_folioq_advance()
567 if (unlikely(i->count < size)) in iov_iter_advance()
568 size = i->count; in iov_iter_advance()
570 i->iov_offset += size; in iov_iter_advance()
571 i->count -= size; in iov_iter_advance()
580 i->count -= size; in iov_iter_advance()
587 const struct folio_queue *folioq = i->folioq; in iov_iter_folioq_revert()
588 unsigned int slot = i->folioq_slot; in iov_iter_folioq_revert()
594 folioq = folioq->prev; in iov_iter_folioq_revert()
597 slot--; in iov_iter_folioq_revert()
601 i->iov_offset = fsize - unroll; in iov_iter_folioq_revert()
604 unroll -= fsize; in iov_iter_folioq_revert()
607 i->folioq_slot = slot; in iov_iter_folioq_revert()
608 i->folioq = folioq; in iov_iter_folioq_revert()
617 i->count += unroll; in iov_iter_revert()
620 if (unroll <= i->iov_offset) { in iov_iter_revert()
621 i->iov_offset -= unroll; in iov_iter_revert()
624 unroll -= i->iov_offset; in iov_iter_revert()
631 const struct bio_vec *bvec = i->bvec; in iov_iter_revert()
633 size_t n = (--bvec)->bv_len; in iov_iter_revert()
634 i->nr_segs++; in iov_iter_revert()
636 i->bvec = bvec; in iov_iter_revert()
637 i->iov_offset = n - unroll; in iov_iter_revert()
640 unroll -= n; in iov_iter_revert()
643 i->iov_offset = 0; in iov_iter_revert()
648 size_t n = (--iov)->iov_len; in iov_iter_revert()
649 i->nr_segs++; in iov_iter_revert()
651 i->__iov = iov; in iov_iter_revert()
652 i->iov_offset = n - unroll; in iov_iter_revert()
655 unroll -= n; in iov_iter_revert()
666 if (i->nr_segs > 1) { in iov_iter_single_seg_count()
668 return min(i->count, iter_iov(i)->iov_len - i->iov_offset); in iov_iter_single_seg_count()
670 return min(i->count, i->bvec->bv_len - i->iov_offset); in iov_iter_single_seg_count()
673 return !i->count ? 0 : in iov_iter_single_seg_count()
674 umin(folioq_folio_size(i->folioq, i->folioq_slot), i->count); in iov_iter_single_seg_count()
675 return i->count; in iov_iter_single_seg_count()
712 * iov_iter_folio_queue - Initialise an I/O iterator to use the folios in a folio queue
742 * iov_iter_xarray - Initialise an I/O iterator to use the pages in an xarray
770 * iov_iter_discard - Initialise an I/O iterator that discards data
794 size_t size = i->count; in iov_iter_aligned_iovec()
795 size_t skip = i->iov_offset; in iov_iter_aligned_iovec()
798 size_t len = iov->iov_len - skip; in iov_iter_aligned_iovec() local
800 if (len > size) in iov_iter_aligned_iovec()
801 len = size; in iov_iter_aligned_iovec()
802 if (len & len_mask) in iov_iter_aligned_iovec()
804 if ((unsigned long)(iov->iov_base + skip) & addr_mask) in iov_iter_aligned_iovec()
808 size -= len; in iov_iter_aligned_iovec()
818 const struct bio_vec *bvec = i->bvec; in iov_iter_aligned_bvec()
819 unsigned skip = i->iov_offset; in iov_iter_aligned_bvec()
820 size_t size = i->count; in iov_iter_aligned_bvec()
823 size_t len = bvec->bv_len; in iov_iter_aligned_bvec() local
825 if (len > size) in iov_iter_aligned_bvec()
826 len = size; in iov_iter_aligned_bvec()
827 if (len & len_mask) in iov_iter_aligned_bvec()
829 if ((unsigned long)(bvec->bv_offset + skip) & addr_mask) in iov_iter_aligned_bvec()
833 size -= len; in iov_iter_aligned_bvec()
841 * iov_iter_is_aligned() - Check if the addresses and lengths of each segments
854 if (i->count & len_mask) in iov_iter_is_aligned()
856 if ((unsigned long)(i->ubuf + i->iov_offset) & addr_mask) in iov_iter_is_aligned()
869 if (i->count & len_mask) in iov_iter_is_aligned()
871 if ((i->xarray_start + i->iov_offset) & addr_mask) in iov_iter_is_aligned()
875 if (i->count & len_mask) in iov_iter_is_aligned()
877 if (i->iov_offset & addr_mask) in iov_iter_is_aligned()
889 size_t size = i->count; in iov_iter_alignment_iovec()
890 size_t skip = i->iov_offset; in iov_iter_alignment_iovec()
893 size_t len = iov->iov_len - skip; in iov_iter_alignment_iovec() local
894 if (len) { in iov_iter_alignment_iovec()
895 res |= (unsigned long)iov->iov_base + skip; in iov_iter_alignment_iovec()
896 if (len > size) in iov_iter_alignment_iovec()
897 len = size; in iov_iter_alignment_iovec()
898 res |= len; in iov_iter_alignment_iovec()
899 size -= len; in iov_iter_alignment_iovec()
909 const struct bio_vec *bvec = i->bvec; in iov_iter_alignment_bvec()
911 size_t size = i->count; in iov_iter_alignment_bvec()
912 unsigned skip = i->iov_offset; in iov_iter_alignment_bvec()
915 size_t len = bvec->bv_len - skip; in iov_iter_alignment_bvec() local
916 res |= (unsigned long)bvec->bv_offset + skip; in iov_iter_alignment_bvec()
917 if (len > size) in iov_iter_alignment_bvec()
918 len = size; in iov_iter_alignment_bvec()
919 res |= len; in iov_iter_alignment_bvec()
921 size -= len; in iov_iter_alignment_bvec()
931 size_t size = i->count; in iov_iter_alignment()
933 return ((unsigned long)i->ubuf + i->iov_offset) | size; in iov_iter_alignment()
946 return i->iov_offset | i->count; in iov_iter_alignment()
948 return (i->xarray_start + i->iov_offset) | i->count; in iov_iter_alignment()
958 size_t size = i->count; in iov_iter_gap_alignment()
967 for (k = 0; k < i->nr_segs; k++) { in iov_iter_gap_alignment()
969 if (iov->iov_len) { in iov_iter_gap_alignment()
970 unsigned long base = (unsigned long)iov->iov_base; in iov_iter_gap_alignment()
973 v = base + iov->iov_len; in iov_iter_gap_alignment()
974 if (size <= iov->iov_len) in iov_iter_gap_alignment()
976 size -= iov->iov_len; in iov_iter_gap_alignment()
1003 const struct folio_queue *folioq = iter->folioq; in iter_folioq_get_pages()
1005 unsigned int slot = iter->folioq_slot; in iter_folioq_get_pages()
1006 size_t extracted = 0, count = iter->count, iov_offset = iter->iov_offset; in iter_folioq_get_pages()
1009 folioq = folioq->next; in iter_folioq_get_pages()
1012 return -EIO; in iter_folioq_get_pages()
1017 return -ENOMEM; in iter_folioq_get_pages()
1024 size_t part = PAGE_SIZE - offset % PAGE_SIZE; in iter_folioq_get_pages()
1027 part = umin(part, umin(maxsize - extracted, fsize - offset)); in iter_folioq_get_pages()
1028 count -= part; in iter_folioq_get_pages()
1035 maxpages--; in iter_folioq_get_pages()
1044 if (slot == folioq_nr_slots(folioq) && folioq->next) { in iter_folioq_get_pages()
1045 folioq = folioq->next; in iter_folioq_get_pages()
1051 iter->count = count; in iter_folioq_get_pages()
1052 iter->iov_offset = iov_offset; in iter_folioq_get_pages()
1053 iter->folioq = folioq; in iter_folioq_get_pages()
1054 iter->folioq_slot = slot; in iter_folioq_get_pages()
1093 pos = i->xarray_start + i->iov_offset; in iter_xarray_get_pages()
1100 return -ENOMEM; in iter_xarray_get_pages()
1101 nr = iter_xarray_populate_pages(*pages, i->xarray, index, count); in iter_xarray_get_pages()
1105 maxsize = min_t(size_t, nr * PAGE_SIZE - offset, maxsize); in iter_xarray_get_pages()
1106 i->iov_offset += maxsize; in iter_xarray_get_pages()
1107 i->count -= maxsize; in iter_xarray_get_pages()
1111 /* must be done on non-empty ITER_UBUF or ITER_IOVEC one */
1118 return (unsigned long)i->ubuf + i->iov_offset; in first_iovec_segment()
1120 for (k = 0, skip = i->iov_offset; k < i->nr_segs; k++, skip = 0) { in first_iovec_segment()
1122 size_t len = iov->iov_len - skip; in first_iovec_segment() local
1124 if (unlikely(!len)) in first_iovec_segment()
1126 if (*size > len) in first_iovec_segment()
1127 *size = len; in first_iovec_segment()
1128 return (unsigned long)iov->iov_base + skip; in first_iovec_segment()
1133 /* must be done on non-empty ITER_BVEC one */
1138 size_t skip = i->iov_offset, len; in first_bvec_segment() local
1140 len = i->bvec->bv_len - skip; in first_bvec_segment()
1141 if (*size > len) in first_bvec_segment()
1142 *size = len; in first_bvec_segment()
1143 skip += i->bvec->bv_offset; in first_bvec_segment()
1144 page = i->bvec->bv_page + skip / PAGE_SIZE; in first_bvec_segment()
1155 if (maxsize > i->count) in __iov_iter_get_pages_alloc()
1156 maxsize = i->count; in __iov_iter_get_pages_alloc()
1168 if (i->nofault) in __iov_iter_get_pages_alloc()
1176 return -ENOMEM; in __iov_iter_get_pages_alloc()
1180 maxsize = min_t(size_t, maxsize, res * PAGE_SIZE - *start); in __iov_iter_get_pages_alloc()
1191 return -ENOMEM; in __iov_iter_get_pages_alloc()
1199 maxsize = min_t(size_t, maxsize, n * PAGE_SIZE - *start); in __iov_iter_get_pages_alloc()
1200 i->count -= maxsize; in __iov_iter_get_pages_alloc()
1201 i->iov_offset += maxsize; in __iov_iter_get_pages_alloc()
1202 if (i->iov_offset == i->bvec->bv_len) { in __iov_iter_get_pages_alloc()
1203 i->iov_offset = 0; in __iov_iter_get_pages_alloc()
1204 i->bvec++; in __iov_iter_get_pages_alloc()
1205 i->nr_segs--; in __iov_iter_get_pages_alloc()
1213 return -EFAULT; in __iov_iter_get_pages_alloc()
1230 ssize_t len; in iov_iter_get_pages_alloc2() local
1234 len = __iov_iter_get_pages_alloc(i, pages, maxsize, ~0U, start); in iov_iter_get_pages_alloc2()
1235 if (len <= 0) { in iov_iter_get_pages_alloc2()
1239 return len; in iov_iter_get_pages_alloc2()
1245 size_t skip = i->iov_offset, size = i->count; in iov_npages()
1250 unsigned offs = offset_in_page(p->iov_base + skip); in iov_npages()
1251 size_t len = min(p->iov_len - skip, size); in iov_npages() local
1253 if (len) { in iov_npages()
1254 size -= len; in iov_npages()
1255 npages += DIV_ROUND_UP(offs + len, PAGE_SIZE); in iov_npages()
1265 size_t skip = i->iov_offset, size = i->count; in bvec_npages()
1269 for (p = i->bvec; size; skip = 0, p++) { in bvec_npages()
1270 unsigned offs = (p->bv_offset + skip) % PAGE_SIZE; in bvec_npages()
1271 size_t len = min(p->bv_len - skip, size); in bvec_npages() local
1273 size -= len; in bvec_npages()
1274 npages += DIV_ROUND_UP(offs + len, PAGE_SIZE); in bvec_npages()
1283 if (unlikely(!i->count)) in iov_iter_npages()
1286 unsigned offs = offset_in_page(i->ubuf + i->iov_offset); in iov_iter_npages()
1287 int npages = DIV_ROUND_UP(offs + i->count, PAGE_SIZE); in iov_iter_npages()
1288 return min(npages, maxpages); in iov_iter_npages()
1296 unsigned offset = i->iov_offset % PAGE_SIZE; in iov_iter_npages()
1297 int npages = DIV_ROUND_UP(offset + i->count, PAGE_SIZE); in iov_iter_npages()
1298 return min(npages, maxpages); in iov_iter_npages()
1301 unsigned offset = (i->xarray_start + i->iov_offset) % PAGE_SIZE; in iov_iter_npages()
1302 int npages = DIV_ROUND_UP(offset + i->count, PAGE_SIZE); in iov_iter_npages()
1303 return min(npages, maxpages); in iov_iter_npages()
1313 return new->bvec = kmemdup(new->bvec, in dup_iter()
1314 new->nr_segs * sizeof(struct bio_vec), in dup_iter()
1318 return new->__iov = kmemdup(new->__iov, in dup_iter()
1319 new->nr_segs * sizeof(struct iovec), in dup_iter()
1330 int ret = -EFAULT; in copy_compat_iovec_from_user()
1334 return -EFAULT; in copy_compat_iovec_from_user()
1338 compat_ssize_t len; in copy_compat_iovec_from_user() local
1340 unsafe_get_user(len, &uiov[i].iov_len, uaccess_end); in copy_compat_iovec_from_user()
1344 if (len < 0) { in copy_compat_iovec_from_user()
1345 ret = -EINVAL; in copy_compat_iovec_from_user()
1349 iov[i].iov_len = len; in copy_compat_iovec_from_user()
1361 int ret = -EFAULT; in copy_iovec_from_user()
1364 return -EFAULT; in copy_iovec_from_user()
1368 ssize_t len; in copy_iovec_from_user() local
1370 unsafe_get_user(len, &uiov->iov_len, uaccess_end); in copy_iovec_from_user()
1371 unsafe_get_user(buf, &uiov->iov_base, uaccess_end); in copy_iovec_from_user()
1374 if (unlikely(len < 0)) { in copy_iovec_from_user()
1375 ret = -EINVAL; in copy_iovec_from_user()
1378 iov->iov_base = buf; in copy_iovec_from_user()
1379 iov->iov_len = len; in copy_iovec_from_user()
1382 } while (--nr_segs); in copy_iovec_from_user()
1405 return ERR_PTR(-EINVAL); in iovec_from_user()
1409 return ERR_PTR(-ENOMEM); in iovec_from_user()
1444 ret = import_ubuf(type, iov->iov_base, iov->iov_len, i); in __import_iovec_ubuf()
1447 return i->count; in __import_iovec_ubuf()
1476 ssize_t len = (ssize_t)iov[seg].iov_len; in __import_iovec() local
1478 if (!access_ok(iov[seg].iov_base, len)) { in __import_iovec()
1482 return -EFAULT; in __import_iovec()
1485 if (len > MAX_RW_COUNT - total_len) { in __import_iovec()
1486 len = MAX_RW_COUNT - total_len; in __import_iovec()
1487 iov[seg].iov_len = len; in __import_iovec()
1489 total_len += len; in __import_iovec()
1501 * import_iovec() - Copy an array of &struct iovec from userspace
1510 * on-stack) kernel array.
1517 * on-stack array was used or not (and regardless of whether this function
1531 int import_ubuf(int rw, void __user *buf, size_t len, struct iov_iter *i) in import_ubuf() argument
1533 if (len > MAX_RW_COUNT) in import_ubuf()
1534 len = MAX_RW_COUNT; in import_ubuf()
1535 if (unlikely(!access_ok(buf, len))) in import_ubuf()
1536 return -EFAULT; in import_ubuf()
1538 iov_iter_ubuf(i, rw, buf, len); in import_ubuf()
1544 * iov_iter_restore() - Restore a &struct iov_iter to the same state as when
1560 i->iov_offset = state->iov_offset; in iov_iter_restore()
1561 i->count = state->count; in iov_iter_restore()
1565 * For the *vec iters, nr_segs + iov is constant - if we increment in iov_iter_restore()
1575 i->bvec -= state->nr_segs - i->nr_segs; in iov_iter_restore()
1577 i->__iov -= state->nr_segs - i->nr_segs; in iov_iter_restore()
1578 i->nr_segs = state->nr_segs; in iov_iter_restore()
1591 const struct folio_queue *folioq = i->folioq; in iov_iter_extract_folioq_pages()
1594 size_t extracted = 0, offset, slot = i->folioq_slot; in iov_iter_extract_folioq_pages()
1597 folioq = folioq->next; in iov_iter_extract_folioq_pages()
1599 if (WARN_ON(i->iov_offset != 0)) in iov_iter_extract_folioq_pages()
1600 return -EIO; in iov_iter_extract_folioq_pages()
1603 offset = i->iov_offset & ~PAGE_MASK; in iov_iter_extract_folioq_pages()
1608 return -ENOMEM; in iov_iter_extract_folioq_pages()
1613 size_t offset = i->iov_offset, fsize = folioq_folio_size(folioq, slot); in iov_iter_extract_folioq_pages()
1614 size_t part = PAGE_SIZE - offset % PAGE_SIZE; in iov_iter_extract_folioq_pages()
1617 part = umin(part, umin(maxsize - extracted, fsize - offset)); in iov_iter_extract_folioq_pages()
1618 i->count -= part; in iov_iter_extract_folioq_pages()
1619 i->iov_offset += part; in iov_iter_extract_folioq_pages()
1628 if (i->iov_offset >= fsize) { in iov_iter_extract_folioq_pages()
1629 i->iov_offset = 0; in iov_iter_extract_folioq_pages()
1631 if (slot == folioq_nr_slots(folioq) && folioq->next) { in iov_iter_extract_folioq_pages()
1632 folioq = folioq->next; in iov_iter_extract_folioq_pages()
1638 i->folioq = folioq; in iov_iter_extract_folioq_pages()
1639 i->folioq_slot = slot; in iov_iter_extract_folioq_pages()
1655 loff_t pos = i->xarray_start + i->iov_offset; in iov_iter_extract_xarray_pages()
1657 XA_STATE(xas, i->xarray, index); in iov_iter_extract_xarray_pages()
1664 return -ENOMEM; in iov_iter_extract_xarray_pages()
1684 maxsize = min_t(size_t, nr * PAGE_SIZE - offset, maxsize); in iov_iter_extract_xarray_pages()
1699 size_t skip = i->iov_offset, size = 0; in iov_iter_extract_bvec_pages()
1703 if (i->nr_segs == 0) in iov_iter_extract_bvec_pages()
1706 if (i->iov_offset == i->bvec->bv_len) { in iov_iter_extract_bvec_pages()
1707 i->iov_offset = 0; in iov_iter_extract_bvec_pages()
1708 i->nr_segs--; in iov_iter_extract_bvec_pages()
1709 i->bvec++; in iov_iter_extract_bvec_pages()
1718 while (bi.bi_size && bi.bi_idx < i->nr_segs) { in iov_iter_extract_bvec_pages()
1719 struct bio_vec bv = bvec_iter_bvec(i->bvec, bi); in iov_iter_extract_bvec_pages()
1749 bvec_iter_advance_single(i->bvec, &bi, bv.bv_len); in iov_iter_extract_bvec_pages()
1768 size_t skip = i->iov_offset, offset, len, size; in iov_iter_extract_kvec_pages() local
1772 if (i->nr_segs == 0) in iov_iter_extract_kvec_pages()
1774 size = min(maxsize, i->kvec->iov_len - skip); in iov_iter_extract_kvec_pages()
1777 i->iov_offset = 0; in iov_iter_extract_kvec_pages()
1778 i->nr_segs--; in iov_iter_extract_kvec_pages()
1779 i->kvec++; in iov_iter_extract_kvec_pages()
1783 kaddr = i->kvec->iov_base + skip; in iov_iter_extract_kvec_pages()
1789 return -ENOMEM; in iov_iter_extract_kvec_pages()
1792 kaddr -= offset; in iov_iter_extract_kvec_pages()
1793 len = offset + size; in iov_iter_extract_kvec_pages()
1795 size_t seg = min_t(size_t, len, PAGE_SIZE); in iov_iter_extract_kvec_pages()
1803 len -= seg; in iov_iter_extract_kvec_pages()
1807 size = min_t(size_t, size, maxpages * PAGE_SIZE - offset); in iov_iter_extract_kvec_pages()
1814 * each of them. This should only be used if the iterator is user-backed
1836 if (i->data_source == ITER_DEST) in iov_iter_extract_user_pages()
1840 if (i->nofault) in iov_iter_extract_user_pages()
1848 return -ENOMEM; in iov_iter_extract_user_pages()
1852 maxsize = min_t(size_t, maxsize, res * PAGE_SIZE - offset); in iov_iter_extract_user_pages()
1858 * iov_iter_extract_pages - Extract a list of contiguous pages from an iterator
1875 * @extraction_flags can have ITER_ALLOW_P2PDMA set to request peer-to-peer DMA
1883 * (*) If the iterator is user-backed (ITER_IOVEC/ITER_UBUF), pins will be
1898 * It may also return -ENOMEM and -EFAULT.
1907 maxsize = min_t(size_t, min_t(size_t, maxsize, i->count), MAX_RW_COUNT); in iov_iter_extract_pages()
1931 return -EFAULT; in iov_iter_extract_pages()