90c619f281
- Mark the source buffer for a copyback operation as const in the kernel API. - Use const with input-only buffers in crypto ioctl structures used with /dev/crypto. MFC after: 1 month Sponsored by: Chelsio Communications Differential Revision: https://reviews.freebsd.org/D10517
242 lines
5.7 KiB
C
242 lines
5.7 KiB
C
/* $OpenBSD: criov.c,v 1.9 2002/01/29 15:48:29 jason Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1999 Theo de Raadt
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/errno.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/mbuf.h>
|
|
#include <sys/uio.h>
|
|
|
|
#include <opencrypto/cryptodev.h>
|
|
|
|
/*
|
|
* This macro is only for avoiding code duplication, as we need to skip
|
|
* given number of bytes in the same way in three functions below.
|
|
*/
|
|
#define CUIO_SKIP() do { \
|
|
KASSERT(off >= 0, ("%s: off %d < 0", __func__, off)); \
|
|
KASSERT(len >= 0, ("%s: len %d < 0", __func__, len)); \
|
|
while (off > 0) { \
|
|
KASSERT(iol >= 0, ("%s: empty in skip", __func__)); \
|
|
if (off < iov->iov_len) \
|
|
break; \
|
|
off -= iov->iov_len; \
|
|
iol--; \
|
|
iov++; \
|
|
} \
|
|
} while (0)
|
|
|
|
void
|
|
cuio_copydata(struct uio* uio, int off, int len, caddr_t cp)
|
|
{
|
|
struct iovec *iov = uio->uio_iov;
|
|
int iol = uio->uio_iovcnt;
|
|
unsigned count;
|
|
|
|
CUIO_SKIP();
|
|
while (len > 0) {
|
|
KASSERT(iol >= 0, ("%s: empty", __func__));
|
|
count = min(iov->iov_len - off, len);
|
|
bcopy(((caddr_t)iov->iov_base) + off, cp, count);
|
|
len -= count;
|
|
cp += count;
|
|
off = 0;
|
|
iol--;
|
|
iov++;
|
|
}
|
|
}
|
|
|
|
void
|
|
cuio_copyback(struct uio* uio, int off, int len, c_caddr_t cp)
|
|
{
|
|
struct iovec *iov = uio->uio_iov;
|
|
int iol = uio->uio_iovcnt;
|
|
unsigned count;
|
|
|
|
CUIO_SKIP();
|
|
while (len > 0) {
|
|
KASSERT(iol >= 0, ("%s: empty", __func__));
|
|
count = min(iov->iov_len - off, len);
|
|
bcopy(cp, ((caddr_t)iov->iov_base) + off, count);
|
|
len -= count;
|
|
cp += count;
|
|
off = 0;
|
|
iol--;
|
|
iov++;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Return the index and offset of location in iovec list.
|
|
*/
|
|
int
|
|
cuio_getptr(struct uio *uio, int loc, int *off)
|
|
{
|
|
int ind, len;
|
|
|
|
ind = 0;
|
|
while (loc >= 0 && ind < uio->uio_iovcnt) {
|
|
len = uio->uio_iov[ind].iov_len;
|
|
if (len > loc) {
|
|
*off = loc;
|
|
return (ind);
|
|
}
|
|
loc -= len;
|
|
ind++;
|
|
}
|
|
|
|
if (ind > 0 && loc == 0) {
|
|
ind--;
|
|
*off = uio->uio_iov[ind].iov_len;
|
|
return (ind);
|
|
}
|
|
|
|
return (-1);
|
|
}
|
|
|
|
/*
|
|
* Apply function f to the data in an iovec list starting "off" bytes from
|
|
* the beginning, continuing for "len" bytes.
|
|
*/
|
|
int
|
|
cuio_apply(struct uio *uio, int off, int len, int (*f)(void *, void *, u_int),
|
|
void *arg)
|
|
{
|
|
struct iovec *iov = uio->uio_iov;
|
|
int iol = uio->uio_iovcnt;
|
|
unsigned count;
|
|
int rval;
|
|
|
|
CUIO_SKIP();
|
|
while (len > 0) {
|
|
KASSERT(iol >= 0, ("%s: empty", __func__));
|
|
count = min(iov->iov_len - off, len);
|
|
rval = (*f)(arg, ((caddr_t)iov->iov_base) + off, count);
|
|
if (rval)
|
|
return (rval);
|
|
len -= count;
|
|
off = 0;
|
|
iol--;
|
|
iov++;
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
void
|
|
crypto_copyback(int flags, caddr_t buf, int off, int size, c_caddr_t in)
|
|
{
|
|
|
|
if ((flags & CRYPTO_F_IMBUF) != 0)
|
|
m_copyback((struct mbuf *)buf, off, size, in);
|
|
else if ((flags & CRYPTO_F_IOV) != 0)
|
|
cuio_copyback((struct uio *)buf, off, size, in);
|
|
else
|
|
bcopy(in, buf + off, size);
|
|
}
|
|
|
|
void
|
|
crypto_copydata(int flags, caddr_t buf, int off, int size, caddr_t out)
|
|
{
|
|
|
|
if ((flags & CRYPTO_F_IMBUF) != 0)
|
|
m_copydata((struct mbuf *)buf, off, size, out);
|
|
else if ((flags & CRYPTO_F_IOV) != 0)
|
|
cuio_copydata((struct uio *)buf, off, size, out);
|
|
else
|
|
bcopy(buf + off, out, size);
|
|
}
|
|
|
|
int
|
|
crypto_apply(int flags, caddr_t buf, int off, int len,
|
|
int (*f)(void *, void *, u_int), void *arg)
|
|
{
|
|
int error;
|
|
|
|
if ((flags & CRYPTO_F_IMBUF) != 0)
|
|
error = m_apply((struct mbuf *)buf, off, len, f, arg);
|
|
else if ((flags & CRYPTO_F_IOV) != 0)
|
|
error = cuio_apply((struct uio *)buf, off, len, f, arg);
|
|
else
|
|
error = (*f)(arg, buf + off, len);
|
|
return (error);
|
|
}
|
|
|
|
int
|
|
crypto_mbuftoiov(struct mbuf *mbuf, struct iovec **iovptr, int *cnt,
|
|
int *allocated)
|
|
{
|
|
struct iovec *iov;
|
|
struct mbuf *m, *mtmp;
|
|
int i, j;
|
|
|
|
*allocated = 0;
|
|
iov = *iovptr;
|
|
if (iov == NULL)
|
|
*cnt = 0;
|
|
|
|
m = mbuf;
|
|
i = 0;
|
|
while (m != NULL) {
|
|
if (i == *cnt) {
|
|
/* we need to allocate a larger array */
|
|
j = 1;
|
|
mtmp = m;
|
|
while ((mtmp = mtmp->m_next) != NULL)
|
|
j++;
|
|
iov = malloc(sizeof *iov * (i + j), M_CRYPTO_DATA,
|
|
M_NOWAIT);
|
|
if (iov == NULL)
|
|
return ENOMEM;
|
|
*allocated = 1;
|
|
*cnt = i + j;
|
|
memcpy(iov, *iovptr, sizeof *iov * i);
|
|
}
|
|
|
|
iov[i].iov_base = m->m_data;
|
|
iov[i].iov_len = m->m_len;
|
|
|
|
i++;
|
|
m = m->m_next;
|
|
}
|
|
|
|
if (*allocated)
|
|
KASSERT(*cnt == i, ("did not allocate correct amount: %d != %d",
|
|
*cnt, i));
|
|
|
|
*iovptr = iov;
|
|
*cnt = i;
|
|
return 0;
|
|
}
|