1 #include <linux/export.h>
2 #include <linux/bvec.h>
4 #include <linux/pagemap.h>
5 #include <linux/slab.h>
6 #include <linux/vmalloc.h>
7 #include <linux/splice.h>
8 #include <net/checksum.h>
10 #define PIPE_PARANOIA /* for now */
12 #define iterate_iovec(i, n, __v, __p, skip, STEP) { \
16 __v.iov_len = min(n, __p->iov_len - skip); \
17 if (likely(__v.iov_len)) { \
18 __v.iov_base = __p->iov_base + skip; \
20 __v.iov_len -= left; \
21 skip += __v.iov_len; \
26 while (unlikely(!left && n)) { \
28 __v.iov_len = min(n, __p->iov_len); \
29 if (unlikely(!__v.iov_len)) \
31 __v.iov_base = __p->iov_base; \
33 __v.iov_len -= left; \
40 #define iterate_kvec(i, n, __v, __p, skip, STEP) { \
43 __v.iov_len = min(n, __p->iov_len - skip); \
44 if (likely(__v.iov_len)) { \
45 __v.iov_base = __p->iov_base + skip; \
47 skip += __v.iov_len; \
50 while (unlikely(n)) { \
52 __v.iov_len = min(n, __p->iov_len); \
53 if (unlikely(!__v.iov_len)) \
55 __v.iov_base = __p->iov_base; \
63 #define iterate_bvec(i, n, __v, __bi, skip, STEP) { \
64 struct bvec_iter __start; \
65 __start.bi_size = n; \
66 __start.bi_bvec_done = skip; \
68 for_each_bvec(__v, i->bvec, __bi, __start) { \
75 #define iterate_all_kinds(i, n, v, I, B, K) { \
77 size_t skip = i->iov_offset; \
78 if (unlikely(i->type & ITER_BVEC)) { \
80 struct bvec_iter __bi; \
81 iterate_bvec(i, n, v, __bi, skip, (B)) \
82 } else if (unlikely(i->type & ITER_KVEC)) { \
83 const struct kvec *kvec; \
85 iterate_kvec(i, n, v, kvec, skip, (K)) \
87 const struct iovec *iov; \
89 iterate_iovec(i, n, v, iov, skip, (I)) \
94 #define iterate_and_advance(i, n, v, I, B, K) { \
95 if (unlikely(i->count < n)) \
98 size_t skip = i->iov_offset; \
99 if (unlikely(i->type & ITER_BVEC)) { \
100 const struct bio_vec *bvec = i->bvec; \
102 struct bvec_iter __bi; \
103 iterate_bvec(i, n, v, __bi, skip, (B)) \
104 i->bvec = __bvec_iter_bvec(i->bvec, __bi); \
105 i->nr_segs -= i->bvec - bvec; \
106 skip = __bi.bi_bvec_done; \
107 } else if (unlikely(i->type & ITER_KVEC)) { \
108 const struct kvec *kvec; \
110 iterate_kvec(i, n, v, kvec, skip, (K)) \
111 if (skip == kvec->iov_len) { \
115 i->nr_segs -= kvec - i->kvec; \
118 const struct iovec *iov; \
120 iterate_iovec(i, n, v, iov, skip, (I)) \
121 if (skip == iov->iov_len) { \
125 i->nr_segs -= iov - i->iov; \
129 i->iov_offset = skip; \
133 static int copyout(void __user *to, const void *from, size_t n)
135 if (access_ok(VERIFY_WRITE, to, n)) {
136 kasan_check_read(from, n);
137 n = raw_copy_to_user(to, from, n);
142 static int copyin(void *to, const void __user *from, size_t n)
144 if (access_ok(VERIFY_READ, from, n)) {
145 kasan_check_write(to, n);
146 n = raw_copy_from_user(to, from, n);
151 static size_t copy_page_to_iter_iovec(struct page *page, size_t offset, size_t bytes,
154 size_t skip, copy, left, wanted;
155 const struct iovec *iov;
159 if (unlikely(bytes > i->count))
162 if (unlikely(!bytes))
168 skip = i->iov_offset;
169 buf = iov->iov_base + skip;
170 copy = min(bytes, iov->iov_len - skip);
172 if (IS_ENABLED(CONFIG_HIGHMEM) && !fault_in_pages_writeable(buf, copy)) {
173 kaddr = kmap_atomic(page);
174 from = kaddr + offset;
176 /* first chunk, usually the only one */
177 left = copyout(buf, from, copy);
183 while (unlikely(!left && bytes)) {
186 copy = min(bytes, iov->iov_len);
187 left = copyout(buf, from, copy);
193 if (likely(!bytes)) {
194 kunmap_atomic(kaddr);
197 offset = from - kaddr;
199 kunmap_atomic(kaddr);
200 copy = min(bytes, iov->iov_len - skip);
202 /* Too bad - revert to non-atomic kmap */
205 from = kaddr + offset;
206 left = copyout(buf, from, copy);
211 while (unlikely(!left && bytes)) {
214 copy = min(bytes, iov->iov_len);
215 left = copyout(buf, from, copy);
224 if (skip == iov->iov_len) {
228 i->count -= wanted - bytes;
229 i->nr_segs -= iov - i->iov;
231 i->iov_offset = skip;
232 return wanted - bytes;
235 static size_t copy_page_from_iter_iovec(struct page *page, size_t offset, size_t bytes,
238 size_t skip, copy, left, wanted;
239 const struct iovec *iov;
243 if (unlikely(bytes > i->count))
246 if (unlikely(!bytes))
252 skip = i->iov_offset;
253 buf = iov->iov_base + skip;
254 copy = min(bytes, iov->iov_len - skip);
256 if (IS_ENABLED(CONFIG_HIGHMEM) && !fault_in_pages_readable(buf, copy)) {
257 kaddr = kmap_atomic(page);
260 /* first chunk, usually the only one */
261 left = copyin(to, buf, copy);
267 while (unlikely(!left && bytes)) {
270 copy = min(bytes, iov->iov_len);
271 left = copyin(to, buf, copy);
277 if (likely(!bytes)) {
278 kunmap_atomic(kaddr);
283 kunmap_atomic(kaddr);
284 copy = min(bytes, iov->iov_len - skip);
286 /* Too bad - revert to non-atomic kmap */
290 left = copyin(to, buf, copy);
295 while (unlikely(!left && bytes)) {
298 copy = min(bytes, iov->iov_len);
299 left = copyin(to, buf, copy);
308 if (skip == iov->iov_len) {
312 i->count -= wanted - bytes;
313 i->nr_segs -= iov - i->iov;
315 i->iov_offset = skip;
316 return wanted - bytes;
320 static bool sanity(const struct iov_iter *i)
322 struct pipe_inode_info *pipe = i->pipe;
324 int next = pipe->curbuf + pipe->nrbufs;
326 struct pipe_buffer *p;
327 if (unlikely(!pipe->nrbufs))
328 goto Bad; // pipe must be non-empty
329 if (unlikely(idx != ((next - 1) & (pipe->buffers - 1))))
330 goto Bad; // must be at the last buffer...
332 p = &pipe->bufs[idx];
333 if (unlikely(p->offset + p->len != i->iov_offset))
334 goto Bad; // ... at the end of segment
336 if (idx != (next & (pipe->buffers - 1)))
337 goto Bad; // must be right after the last buffer
341 printk(KERN_ERR "idx = %d, offset = %zd\n", i->idx, i->iov_offset);
342 printk(KERN_ERR "curbuf = %d, nrbufs = %d, buffers = %d\n",
343 pipe->curbuf, pipe->nrbufs, pipe->buffers);
344 for (idx = 0; idx < pipe->buffers; idx++)
345 printk(KERN_ERR "[%p %p %d %d]\n",
347 pipe->bufs[idx].page,
348 pipe->bufs[idx].offset,
349 pipe->bufs[idx].len);
354 #define sanity(i) true
357 static inline int next_idx(int idx, struct pipe_inode_info *pipe)
359 return (idx + 1) & (pipe->buffers - 1);
362 static size_t copy_page_to_iter_pipe(struct page *page, size_t offset, size_t bytes,
365 struct pipe_inode_info *pipe = i->pipe;
366 struct pipe_buffer *buf;
370 if (unlikely(bytes > i->count))
373 if (unlikely(!bytes))
381 buf = &pipe->bufs[idx];
383 if (offset == off && buf->page == page) {
384 /* merge with the last one */
386 i->iov_offset += bytes;
389 idx = next_idx(idx, pipe);
390 buf = &pipe->bufs[idx];
392 if (idx == pipe->curbuf && pipe->nrbufs)
395 buf->ops = &page_cache_pipe_buf_ops;
396 get_page(buf->page = page);
397 buf->offset = offset;
399 i->iov_offset = offset + bytes;
407 * Fault in one or more iovecs of the given iov_iter, to a maximum length of
408 * bytes. For each iovec, fault in each page that constitutes the iovec.
410 * Return 0 on success, or non-zero if the memory could not be accessed (i.e.
411 * because it is an invalid address).
413 int iov_iter_fault_in_readable(struct iov_iter *i, size_t bytes)
415 size_t skip = i->iov_offset;
416 const struct iovec *iov;
420 if (!(i->type & (ITER_BVEC|ITER_KVEC))) {
421 iterate_iovec(i, bytes, v, iov, skip, ({
422 err = fault_in_pages_readable(v.iov_base, v.iov_len);
429 EXPORT_SYMBOL(iov_iter_fault_in_readable);
431 void iov_iter_init(struct iov_iter *i, int direction,
432 const struct iovec *iov, unsigned long nr_segs,
435 /* It will get better. Eventually... */
436 if (uaccess_kernel()) {
437 direction |= ITER_KVEC;
439 i->kvec = (struct kvec *)iov;
444 i->nr_segs = nr_segs;
448 EXPORT_SYMBOL(iov_iter_init);
450 static void memcpy_from_page(char *to, struct page *page, size_t offset, size_t len)
452 char *from = kmap_atomic(page);
453 memcpy(to, from + offset, len);
457 static void memcpy_to_page(struct page *page, size_t offset, const char *from, size_t len)
459 char *to = kmap_atomic(page);
460 memcpy(to + offset, from, len);
464 static void memzero_page(struct page *page, size_t offset, size_t len)
466 char *addr = kmap_atomic(page);
467 memset(addr + offset, 0, len);
471 static inline bool allocated(struct pipe_buffer *buf)
473 return buf->ops == &default_pipe_buf_ops;
476 static inline void data_start(const struct iov_iter *i, int *idxp, size_t *offp)
478 size_t off = i->iov_offset;
480 if (off && (!allocated(&i->pipe->bufs[idx]) || off == PAGE_SIZE)) {
481 idx = next_idx(idx, i->pipe);
488 static size_t push_pipe(struct iov_iter *i, size_t size,
489 int *idxp, size_t *offp)
491 struct pipe_inode_info *pipe = i->pipe;
496 if (unlikely(size > i->count))
502 data_start(i, &idx, &off);
506 left -= PAGE_SIZE - off;
508 pipe->bufs[idx].len += size;
511 pipe->bufs[idx].len = PAGE_SIZE;
512 idx = next_idx(idx, pipe);
514 while (idx != pipe->curbuf || !pipe->nrbufs) {
515 struct page *page = alloc_page(GFP_USER);
519 pipe->bufs[idx].ops = &default_pipe_buf_ops;
520 pipe->bufs[idx].page = page;
521 pipe->bufs[idx].offset = 0;
522 if (left <= PAGE_SIZE) {
523 pipe->bufs[idx].len = left;
526 pipe->bufs[idx].len = PAGE_SIZE;
528 idx = next_idx(idx, pipe);
533 static size_t copy_pipe_to_iter(const void *addr, size_t bytes,
536 struct pipe_inode_info *pipe = i->pipe;
543 bytes = n = push_pipe(i, bytes, &idx, &off);
546 for ( ; n; idx = next_idx(idx, pipe), off = 0) {
547 size_t chunk = min_t(size_t, n, PAGE_SIZE - off);
548 memcpy_to_page(pipe->bufs[idx].page, off, addr, chunk);
550 i->iov_offset = off + chunk;
558 size_t _copy_to_iter(const void *addr, size_t bytes, struct iov_iter *i)
560 const char *from = addr;
561 if (unlikely(i->type & ITER_PIPE))
562 return copy_pipe_to_iter(addr, bytes, i);
563 if (iter_is_iovec(i))
565 iterate_and_advance(i, bytes, v,
566 copyout(v.iov_base, (from += v.iov_len) - v.iov_len, v.iov_len),
567 memcpy_to_page(v.bv_page, v.bv_offset,
568 (from += v.bv_len) - v.bv_len, v.bv_len),
569 memcpy(v.iov_base, (from += v.iov_len) - v.iov_len, v.iov_len)
574 EXPORT_SYMBOL(_copy_to_iter);
576 size_t _copy_from_iter(void *addr, size_t bytes, struct iov_iter *i)
579 if (unlikely(i->type & ITER_PIPE)) {
583 if (iter_is_iovec(i))
585 iterate_and_advance(i, bytes, v,
586 copyin((to += v.iov_len) - v.iov_len, v.iov_base, v.iov_len),
587 memcpy_from_page((to += v.bv_len) - v.bv_len, v.bv_page,
588 v.bv_offset, v.bv_len),
589 memcpy((to += v.iov_len) - v.iov_len, v.iov_base, v.iov_len)
594 EXPORT_SYMBOL(_copy_from_iter);
596 bool _copy_from_iter_full(void *addr, size_t bytes, struct iov_iter *i)
599 if (unlikely(i->type & ITER_PIPE)) {
603 if (unlikely(i->count < bytes))
606 if (iter_is_iovec(i))
608 iterate_all_kinds(i, bytes, v, ({
609 if (copyin((to += v.iov_len) - v.iov_len,
610 v.iov_base, v.iov_len))
613 memcpy_from_page((to += v.bv_len) - v.bv_len, v.bv_page,
614 v.bv_offset, v.bv_len),
615 memcpy((to += v.iov_len) - v.iov_len, v.iov_base, v.iov_len)
618 iov_iter_advance(i, bytes);
621 EXPORT_SYMBOL(_copy_from_iter_full);
623 size_t _copy_from_iter_nocache(void *addr, size_t bytes, struct iov_iter *i)
626 if (unlikely(i->type & ITER_PIPE)) {
630 iterate_and_advance(i, bytes, v,
631 __copy_from_user_inatomic_nocache((to += v.iov_len) - v.iov_len,
632 v.iov_base, v.iov_len),
633 memcpy_from_page((to += v.bv_len) - v.bv_len, v.bv_page,
634 v.bv_offset, v.bv_len),
635 memcpy((to += v.iov_len) - v.iov_len, v.iov_base, v.iov_len)
640 EXPORT_SYMBOL(_copy_from_iter_nocache);
642 bool _copy_from_iter_full_nocache(void *addr, size_t bytes, struct iov_iter *i)
645 if (unlikely(i->type & ITER_PIPE)) {
649 if (unlikely(i->count < bytes))
651 iterate_all_kinds(i, bytes, v, ({
652 if (__copy_from_user_inatomic_nocache((to += v.iov_len) - v.iov_len,
653 v.iov_base, v.iov_len))
656 memcpy_from_page((to += v.bv_len) - v.bv_len, v.bv_page,
657 v.bv_offset, v.bv_len),
658 memcpy((to += v.iov_len) - v.iov_len, v.iov_base, v.iov_len)
661 iov_iter_advance(i, bytes);
664 EXPORT_SYMBOL(_copy_from_iter_full_nocache);
666 static inline bool page_copy_sane(struct page *page, size_t offset, size_t n)
668 size_t v = n + offset;
669 if (likely(n <= v && v <= (PAGE_SIZE << compound_order(page))))
675 size_t copy_page_to_iter(struct page *page, size_t offset, size_t bytes,
678 if (unlikely(!page_copy_sane(page, offset, bytes)))
680 if (i->type & (ITER_BVEC|ITER_KVEC)) {
681 void *kaddr = kmap_atomic(page);
682 size_t wanted = copy_to_iter(kaddr + offset, bytes, i);
683 kunmap_atomic(kaddr);
685 } else if (likely(!(i->type & ITER_PIPE)))
686 return copy_page_to_iter_iovec(page, offset, bytes, i);
688 return copy_page_to_iter_pipe(page, offset, bytes, i);
690 EXPORT_SYMBOL(copy_page_to_iter);
692 size_t copy_page_from_iter(struct page *page, size_t offset, size_t bytes,
695 if (unlikely(!page_copy_sane(page, offset, bytes)))
697 if (unlikely(i->type & ITER_PIPE)) {
701 if (i->type & (ITER_BVEC|ITER_KVEC)) {
702 void *kaddr = kmap_atomic(page);
703 size_t wanted = _copy_from_iter(kaddr + offset, bytes, i);
704 kunmap_atomic(kaddr);
707 return copy_page_from_iter_iovec(page, offset, bytes, i);
709 EXPORT_SYMBOL(copy_page_from_iter);
711 static size_t pipe_zero(size_t bytes, struct iov_iter *i)
713 struct pipe_inode_info *pipe = i->pipe;
720 bytes = n = push_pipe(i, bytes, &idx, &off);
724 for ( ; n; idx = next_idx(idx, pipe), off = 0) {
725 size_t chunk = min_t(size_t, n, PAGE_SIZE - off);
726 memzero_page(pipe->bufs[idx].page, off, chunk);
728 i->iov_offset = off + chunk;
735 size_t iov_iter_zero(size_t bytes, struct iov_iter *i)
737 if (unlikely(i->type & ITER_PIPE))
738 return pipe_zero(bytes, i);
739 iterate_and_advance(i, bytes, v,
740 clear_user(v.iov_base, v.iov_len),
741 memzero_page(v.bv_page, v.bv_offset, v.bv_len),
742 memset(v.iov_base, 0, v.iov_len)
747 EXPORT_SYMBOL(iov_iter_zero);
749 size_t iov_iter_copy_from_user_atomic(struct page *page,
750 struct iov_iter *i, unsigned long offset, size_t bytes)
752 char *kaddr = kmap_atomic(page), *p = kaddr + offset;
753 if (unlikely(!page_copy_sane(page, offset, bytes))) {
754 kunmap_atomic(kaddr);
757 if (unlikely(i->type & ITER_PIPE)) {
758 kunmap_atomic(kaddr);
762 iterate_all_kinds(i, bytes, v,
763 copyin((p += v.iov_len) - v.iov_len, v.iov_base, v.iov_len),
764 memcpy_from_page((p += v.bv_len) - v.bv_len, v.bv_page,
765 v.bv_offset, v.bv_len),
766 memcpy((p += v.iov_len) - v.iov_len, v.iov_base, v.iov_len)
768 kunmap_atomic(kaddr);
771 EXPORT_SYMBOL(iov_iter_copy_from_user_atomic);
773 static inline void pipe_truncate(struct iov_iter *i)
775 struct pipe_inode_info *pipe = i->pipe;
777 size_t off = i->iov_offset;
779 int nrbufs = (idx - pipe->curbuf) & (pipe->buffers - 1);
781 pipe->bufs[idx].len = off - pipe->bufs[idx].offset;
782 idx = next_idx(idx, pipe);
785 while (pipe->nrbufs > nrbufs) {
786 pipe_buf_release(pipe, &pipe->bufs[idx]);
787 idx = next_idx(idx, pipe);
793 static void pipe_advance(struct iov_iter *i, size_t size)
795 struct pipe_inode_info *pipe = i->pipe;
796 if (unlikely(i->count < size))
799 struct pipe_buffer *buf;
800 size_t off = i->iov_offset, left = size;
802 if (off) /* make it relative to the beginning of buffer */
803 left += off - pipe->bufs[idx].offset;
805 buf = &pipe->bufs[idx];
806 if (left <= buf->len)
809 idx = next_idx(idx, pipe);
812 i->iov_offset = buf->offset + left;
815 /* ... and discard everything past that point */
819 void iov_iter_advance(struct iov_iter *i, size_t size)
821 if (unlikely(i->type & ITER_PIPE)) {
822 pipe_advance(i, size);
825 iterate_and_advance(i, size, v, 0, 0, 0)
827 EXPORT_SYMBOL(iov_iter_advance);
829 void iov_iter_revert(struct iov_iter *i, size_t unroll)
833 if (WARN_ON(unroll > MAX_RW_COUNT))
836 if (unlikely(i->type & ITER_PIPE)) {
837 struct pipe_inode_info *pipe = i->pipe;
839 size_t off = i->iov_offset;
841 size_t n = off - pipe->bufs[idx].offset;
847 if (!unroll && idx == i->start_idx) {
852 idx = pipe->buffers - 1;
853 off = pipe->bufs[idx].offset + pipe->bufs[idx].len;
860 if (unroll <= i->iov_offset) {
861 i->iov_offset -= unroll;
864 unroll -= i->iov_offset;
865 if (i->type & ITER_BVEC) {
866 const struct bio_vec *bvec = i->bvec;
868 size_t n = (--bvec)->bv_len;
872 i->iov_offset = n - unroll;
877 } else { /* same logics for iovec and kvec */
878 const struct iovec *iov = i->iov;
880 size_t n = (--iov)->iov_len;
884 i->iov_offset = n - unroll;
891 EXPORT_SYMBOL(iov_iter_revert);
894 * Return the count of just the current iov_iter segment.
896 size_t iov_iter_single_seg_count(const struct iov_iter *i)
898 if (unlikely(i->type & ITER_PIPE))
899 return i->count; // it is a silly place, anyway
902 else if (i->type & ITER_BVEC)
903 return min(i->count, i->bvec->bv_len - i->iov_offset);
905 return min(i->count, i->iov->iov_len - i->iov_offset);
907 EXPORT_SYMBOL(iov_iter_single_seg_count);
909 void iov_iter_kvec(struct iov_iter *i, int direction,
910 const struct kvec *kvec, unsigned long nr_segs,
913 BUG_ON(!(direction & ITER_KVEC));
916 i->nr_segs = nr_segs;
920 EXPORT_SYMBOL(iov_iter_kvec);
922 void iov_iter_bvec(struct iov_iter *i, int direction,
923 const struct bio_vec *bvec, unsigned long nr_segs,
926 BUG_ON(!(direction & ITER_BVEC));
929 i->nr_segs = nr_segs;
933 EXPORT_SYMBOL(iov_iter_bvec);
935 void iov_iter_pipe(struct iov_iter *i, int direction,
936 struct pipe_inode_info *pipe,
939 BUG_ON(direction != ITER_PIPE);
940 WARN_ON(pipe->nrbufs == pipe->buffers);
943 i->idx = (pipe->curbuf + pipe->nrbufs) & (pipe->buffers - 1);
946 i->start_idx = i->idx;
948 EXPORT_SYMBOL(iov_iter_pipe);
950 unsigned long iov_iter_alignment(const struct iov_iter *i)
952 unsigned long res = 0;
953 size_t size = i->count;
955 if (unlikely(i->type & ITER_PIPE)) {
956 if (size && i->iov_offset && allocated(&i->pipe->bufs[i->idx]))
957 return size | i->iov_offset;
960 iterate_all_kinds(i, size, v,
961 (res |= (unsigned long)v.iov_base | v.iov_len, 0),
962 res |= v.bv_offset | v.bv_len,
963 res |= (unsigned long)v.iov_base | v.iov_len
967 EXPORT_SYMBOL(iov_iter_alignment);
969 unsigned long iov_iter_gap_alignment(const struct iov_iter *i)
971 unsigned long res = 0;
972 size_t size = i->count;
974 if (unlikely(i->type & ITER_PIPE)) {
979 iterate_all_kinds(i, size, v,
980 (res |= (!res ? 0 : (unsigned long)v.iov_base) |
981 (size != v.iov_len ? size : 0), 0),
982 (res |= (!res ? 0 : (unsigned long)v.bv_offset) |
983 (size != v.bv_len ? size : 0)),
984 (res |= (!res ? 0 : (unsigned long)v.iov_base) |
985 (size != v.iov_len ? size : 0))
989 EXPORT_SYMBOL(iov_iter_gap_alignment);
991 static inline size_t __pipe_get_pages(struct iov_iter *i,
997 struct pipe_inode_info *pipe = i->pipe;
998 ssize_t n = push_pipe(i, maxsize, &idx, start);
1005 get_page(*pages++ = pipe->bufs[idx].page);
1006 idx = next_idx(idx, pipe);
1013 static ssize_t pipe_get_pages(struct iov_iter *i,
1014 struct page **pages, size_t maxsize, unsigned maxpages,
1027 data_start(i, &idx, start);
1028 /* some of this one + all after this one */
1029 npages = ((i->pipe->curbuf - idx - 1) & (i->pipe->buffers - 1)) + 1;
1030 capacity = min(npages,maxpages) * PAGE_SIZE - *start;
1032 return __pipe_get_pages(i, min(maxsize, capacity), pages, idx, start);
1035 ssize_t iov_iter_get_pages(struct iov_iter *i,
1036 struct page **pages, size_t maxsize, unsigned maxpages,
1039 if (maxsize > i->count)
1042 if (unlikely(i->type & ITER_PIPE))
1043 return pipe_get_pages(i, pages, maxsize, maxpages, start);
1044 iterate_all_kinds(i, maxsize, v, ({
1045 unsigned long addr = (unsigned long)v.iov_base;
1046 size_t len = v.iov_len + (*start = addr & (PAGE_SIZE - 1));
1050 if (len > maxpages * PAGE_SIZE)
1051 len = maxpages * PAGE_SIZE;
1052 addr &= ~(PAGE_SIZE - 1);
1053 n = DIV_ROUND_UP(len, PAGE_SIZE);
1054 res = get_user_pages_fast(addr, n, (i->type & WRITE) != WRITE, pages);
1055 if (unlikely(res < 0))
1057 return (res == n ? len : res * PAGE_SIZE) - *start;
1059 /* can't be more than PAGE_SIZE */
1060 *start = v.bv_offset;
1061 get_page(*pages = v.bv_page);
1069 EXPORT_SYMBOL(iov_iter_get_pages);
1071 static struct page **get_pages_array(size_t n)
1073 return kvmalloc_array(n, sizeof(struct page *), GFP_KERNEL);
1076 static ssize_t pipe_get_pages_alloc(struct iov_iter *i,
1077 struct page ***pages, size_t maxsize,
1091 data_start(i, &idx, start);
1092 /* some of this one + all after this one */
1093 npages = ((i->pipe->curbuf - idx - 1) & (i->pipe->buffers - 1)) + 1;
1094 n = npages * PAGE_SIZE - *start;
1098 npages = DIV_ROUND_UP(maxsize + *start, PAGE_SIZE);
1099 p = get_pages_array(npages);
1102 n = __pipe_get_pages(i, maxsize, p, idx, start);
1110 ssize_t iov_iter_get_pages_alloc(struct iov_iter *i,
1111 struct page ***pages, size_t maxsize,
1116 if (maxsize > i->count)
1119 if (unlikely(i->type & ITER_PIPE))
1120 return pipe_get_pages_alloc(i, pages, maxsize, start);
1121 iterate_all_kinds(i, maxsize, v, ({
1122 unsigned long addr = (unsigned long)v.iov_base;
1123 size_t len = v.iov_len + (*start = addr & (PAGE_SIZE - 1));
1127 addr &= ~(PAGE_SIZE - 1);
1128 n = DIV_ROUND_UP(len, PAGE_SIZE);
1129 p = get_pages_array(n);
1132 res = get_user_pages_fast(addr, n, (i->type & WRITE) != WRITE, p);
1133 if (unlikely(res < 0)) {
1138 return (res == n ? len : res * PAGE_SIZE) - *start;
1140 /* can't be more than PAGE_SIZE */
1141 *start = v.bv_offset;
1142 *pages = p = get_pages_array(1);
1145 get_page(*p = v.bv_page);
1153 EXPORT_SYMBOL(iov_iter_get_pages_alloc);
1155 size_t csum_and_copy_from_iter(void *addr, size_t bytes, __wsum *csum,
1162 if (unlikely(i->type & ITER_PIPE)) {
1166 iterate_and_advance(i, bytes, v, ({
1168 next = csum_and_copy_from_user(v.iov_base,
1169 (to += v.iov_len) - v.iov_len,
1170 v.iov_len, 0, &err);
1172 sum = csum_block_add(sum, next, off);
1175 err ? v.iov_len : 0;
1177 char *p = kmap_atomic(v.bv_page);
1178 next = csum_partial_copy_nocheck(p + v.bv_offset,
1179 (to += v.bv_len) - v.bv_len,
1182 sum = csum_block_add(sum, next, off);
1185 next = csum_partial_copy_nocheck(v.iov_base,
1186 (to += v.iov_len) - v.iov_len,
1188 sum = csum_block_add(sum, next, off);
1195 EXPORT_SYMBOL(csum_and_copy_from_iter);
1197 bool csum_and_copy_from_iter_full(void *addr, size_t bytes, __wsum *csum,
1204 if (unlikely(i->type & ITER_PIPE)) {
1208 if (unlikely(i->count < bytes))
1210 iterate_all_kinds(i, bytes, v, ({
1212 next = csum_and_copy_from_user(v.iov_base,
1213 (to += v.iov_len) - v.iov_len,
1214 v.iov_len, 0, &err);
1217 sum = csum_block_add(sum, next, off);
1221 char *p = kmap_atomic(v.bv_page);
1222 next = csum_partial_copy_nocheck(p + v.bv_offset,
1223 (to += v.bv_len) - v.bv_len,
1226 sum = csum_block_add(sum, next, off);
1229 next = csum_partial_copy_nocheck(v.iov_base,
1230 (to += v.iov_len) - v.iov_len,
1232 sum = csum_block_add(sum, next, off);
1237 iov_iter_advance(i, bytes);
1240 EXPORT_SYMBOL(csum_and_copy_from_iter_full);
1242 size_t csum_and_copy_to_iter(const void *addr, size_t bytes, __wsum *csum,
1245 const char *from = addr;
1249 if (unlikely(i->type & ITER_PIPE)) {
1250 WARN_ON(1); /* for now */
1253 iterate_and_advance(i, bytes, v, ({
1255 next = csum_and_copy_to_user((from += v.iov_len) - v.iov_len,
1257 v.iov_len, 0, &err);
1259 sum = csum_block_add(sum, next, off);
1262 err ? v.iov_len : 0;
1264 char *p = kmap_atomic(v.bv_page);
1265 next = csum_partial_copy_nocheck((from += v.bv_len) - v.bv_len,
1269 sum = csum_block_add(sum, next, off);
1272 next = csum_partial_copy_nocheck((from += v.iov_len) - v.iov_len,
1275 sum = csum_block_add(sum, next, off);
1282 EXPORT_SYMBOL(csum_and_copy_to_iter);
1284 int iov_iter_npages(const struct iov_iter *i, int maxpages)
1286 size_t size = i->count;
1292 if (unlikely(i->type & ITER_PIPE)) {
1293 struct pipe_inode_info *pipe = i->pipe;
1300 data_start(i, &idx, &off);
1301 /* some of this one + all after this one */
1302 npages = ((pipe->curbuf - idx - 1) & (pipe->buffers - 1)) + 1;
1303 if (npages >= maxpages)
1305 } else iterate_all_kinds(i, size, v, ({
1306 unsigned long p = (unsigned long)v.iov_base;
1307 npages += DIV_ROUND_UP(p + v.iov_len, PAGE_SIZE)
1309 if (npages >= maxpages)
1313 if (npages >= maxpages)
1316 unsigned long p = (unsigned long)v.iov_base;
1317 npages += DIV_ROUND_UP(p + v.iov_len, PAGE_SIZE)
1319 if (npages >= maxpages)
1325 EXPORT_SYMBOL(iov_iter_npages);
1327 const void *dup_iter(struct iov_iter *new, struct iov_iter *old, gfp_t flags)
1330 if (unlikely(new->type & ITER_PIPE)) {
1334 if (new->type & ITER_BVEC)
1335 return new->bvec = kmemdup(new->bvec,
1336 new->nr_segs * sizeof(struct bio_vec),
1339 /* iovec and kvec have identical layout */
1340 return new->iov = kmemdup(new->iov,
1341 new->nr_segs * sizeof(struct iovec),
1344 EXPORT_SYMBOL(dup_iter);
1347 * import_iovec() - Copy an array of &struct iovec from userspace
1348 * into the kernel, check that it is valid, and initialize a new
1349 * &struct iov_iter iterator to access it.
1351 * @type: One of %READ or %WRITE.
1352 * @uvector: Pointer to the userspace array.
1353 * @nr_segs: Number of elements in userspace array.
1354 * @fast_segs: Number of elements in @iov.
1355 * @iov: (input and output parameter) Pointer to pointer to (usually small
1356 * on-stack) kernel array.
1357 * @i: Pointer to iterator that will be initialized on success.
1359 * If the array pointed to by *@iov is large enough to hold all @nr_segs,
1360 * then this function places %NULL in *@iov on return. Otherwise, a new
1361 * array will be allocated and the result placed in *@iov. This means that
1362 * the caller may call kfree() on *@iov regardless of whether the small
1363 * on-stack array was used or not (and regardless of whether this function
1364 * returns an error or not).
1366 * Return: 0 on success or negative error code on error.
1368 int import_iovec(int type, const struct iovec __user * uvector,
1369 unsigned nr_segs, unsigned fast_segs,
1370 struct iovec **iov, struct iov_iter *i)
1374 n = rw_copy_check_uvector(type, uvector, nr_segs, fast_segs,
1382 iov_iter_init(i, type, p, nr_segs, n);
1383 *iov = p == *iov ? NULL : p;
1386 EXPORT_SYMBOL(import_iovec);
1388 #ifdef CONFIG_COMPAT
1389 #include <linux/compat.h>
1391 int compat_import_iovec(int type, const struct compat_iovec __user * uvector,
1392 unsigned nr_segs, unsigned fast_segs,
1393 struct iovec **iov, struct iov_iter *i)
1397 n = compat_rw_copy_check_uvector(type, uvector, nr_segs, fast_segs,
1405 iov_iter_init(i, type, p, nr_segs, n);
1406 *iov = p == *iov ? NULL : p;
1411 int import_single_range(int rw, void __user *buf, size_t len,
1412 struct iovec *iov, struct iov_iter *i)
1414 if (len > MAX_RW_COUNT)
1416 if (unlikely(!access_ok(!rw, buf, len)))
1419 iov->iov_base = buf;
1421 iov_iter_init(i, rw, iov, 1, len);
1424 EXPORT_SYMBOL(import_single_range);