2 * iovec manipulation routines.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version
8 * 2 of the License, or (at your option) any later version.
11 * Andrew Lunn : Errors in iovec copying.
12 * Pedro Roque : Added memcpy_fromiovecend and
13 * csum_..._fromiovecend.
14 * Andi Kleen : fixed error handling for 2.1
15 * Alexey Kuznetsov: 2.1 optimisations
16 * Andi Kleen : Fix csum*fromiovecend for IPv6.
19 #include <linux/errno.h>
20 #include <linux/module.h>
21 #include <linux/kernel.h>
23 #include <linux/net.h>
24 #include <linux/in6.h>
25 #include <asm/uaccess.h>
26 #include <asm/byteorder.h>
27 #include <net/checksum.h>
31 * Verify iovec. The caller must ensure that the iovec is big enough
32 * to hold the message iovec.
34 * Save time not doing access_ok. copy_*_user will make this work
38 int verify_iovec(struct msghdr *m, struct iovec *iov, struct sockaddr_storage *address, int mode)
42 if (m->msg_name && m->msg_namelen) {
43 if (mode == VERIFY_READ) {
45 namep = (void __user __force *) m->msg_name;
46 err = move_addr_to_kernel(namep, m->msg_namelen,
51 m->msg_name = address;
57 size = m->msg_iovlen * sizeof(struct iovec);
58 if (copy_from_user(iov, (void __user __force *) m->msg_iov, size))
64 for (ct = 0; ct < m->msg_iovlen; ct++) {
65 size_t len = iov[ct].iov_len;
67 if (len > INT_MAX - err) {
69 iov[ct].iov_len = len;
78 * And now for the all-in-one: copy and checksum from a user iovec
79 * directly to a datagram
80 * Calls to csum_partial but the last must be in 32 bit chunks
82 * ip_build_xmit must ensure that when fragmenting only the last
83 * call to this function will be unaligned also.
85 int csum_partial_copy_fromiovecend(unsigned char *kdata, struct iovec *iov,
86 int offset, unsigned int len, __wsum *csump)
89 int partial_cnt = 0, err = 0;
91 /* Skip over the finished iovecs */
92 while (offset >= iov->iov_len) {
93 offset -= iov->iov_len;
98 u8 __user *base = iov->iov_base + offset;
99 int copy = min_t(unsigned int, len, iov->iov_len - offset);
103 /* There is a remnant from previous iov. */
105 int par_len = 4 - partial_cnt;
107 /* iov component is too short ... */
108 if (par_len > copy) {
109 if (copy_from_user(kdata, base, copy))
118 *csump = csum_partial(kdata - partial_cnt,
122 if (copy_from_user(kdata, base, par_len))
124 csum = csum_partial(kdata - partial_cnt, 4, csum);
133 partial_cnt = copy % 4;
136 if (copy_from_user(kdata + copy, base + copy,
143 csum = csum_and_copy_from_user(base, kdata, copy,
148 len -= copy + partial_cnt;
149 kdata += copy + partial_cnt;
160 EXPORT_SYMBOL(csum_partial_copy_fromiovecend);
162 unsigned long iov_pages(const struct iovec *iov, int offset,
163 unsigned long nr_segs)
165 unsigned long seg, base;
166 int pages = 0, len, size;
168 while (nr_segs && (offset >= iov->iov_len)) {
169 offset -= iov->iov_len;
174 for (seg = 0; seg < nr_segs; seg++) {
175 base = (unsigned long)iov[seg].iov_base + offset;
176 len = iov[seg].iov_len - offset;
177 size = ((base & ~PAGE_MASK) + len + ~PAGE_MASK) >> PAGE_SHIFT;
184 EXPORT_SYMBOL(iov_pages);