2002-10-04 20:31:23 +00:00
|
|
|
/* $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.
|
|
|
|
*/
|
|
|
|
|
2003-06-11 05:57:50 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
2002-10-04 20:31:23 +00:00
|
|
|
#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/uio.h>
|
|
|
|
|
|
|
|
#include <opencrypto/cryptodev.h>
|
|
|
|
|
|
|
|
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;
|
|
|
|
|
|
|
|
if (off < 0)
|
|
|
|
panic("cuio_copydata: off %d < 0", off);
|
|
|
|
if (len < 0)
|
|
|
|
panic("cuio_copydata: len %d < 0", len);
|
|
|
|
while (off > 0) {
|
|
|
|
if (iol == 0)
|
|
|
|
panic("iov_copydata: empty in skip");
|
|
|
|
if (off < iov->iov_len)
|
|
|
|
break;
|
|
|
|
off -= iov->iov_len;
|
|
|
|
iol--;
|
|
|
|
iov++;
|
|
|
|
}
|
|
|
|
while (len > 0) {
|
|
|
|
if (iol == 0)
|
|
|
|
panic("cuio_copydata: empty");
|
|
|
|
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, caddr_t cp)
|
|
|
|
{
|
|
|
|
struct iovec *iov = uio->uio_iov;
|
|
|
|
int iol = uio->uio_iovcnt;
|
|
|
|
unsigned count;
|
|
|
|
|
|
|
|
if (off < 0)
|
|
|
|
panic("cuio_copyback: off %d < 0", off);
|
|
|
|
if (len < 0)
|
|
|
|
panic("cuio_copyback: len %d < 0", len);
|
|
|
|
while (off > 0) {
|
|
|
|
if (iol == 0)
|
|
|
|
panic("cuio_copyback: empty in skip");
|
|
|
|
if (off < iov->iov_len)
|
|
|
|
break;
|
|
|
|
off -= iov->iov_len;
|
|
|
|
iol--;
|
|
|
|
iov++;
|
|
|
|
}
|
|
|
|
while (len > 0) {
|
|
|
|
if (iol == 0)
|
|
|
|
panic("uio_copyback: empty");
|
|
|
|
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 a pointer to iov/offset of location in iovec list.
|
|
|
|
*/
|
|
|
|
struct iovec *
|
|
|
|
cuio_getptr(struct uio *uio, int loc, int *off)
|
|
|
|
{
|
|
|
|
struct iovec *iov = uio->uio_iov;
|
|
|
|
int iol = uio->uio_iovcnt;
|
|
|
|
|
|
|
|
while (loc >= 0) {
|
|
|
|
/* Normal end of search */
|
|
|
|
if (loc < iov->iov_len) {
|
|
|
|
*off = loc;
|
|
|
|
return (iov);
|
|
|
|
}
|
|
|
|
|
|
|
|
loc -= iov->iov_len;
|
|
|
|
if (iol == 0) {
|
|
|
|
if (loc == 0) {
|
|
|
|
/* Point at the end of valid data */
|
|
|
|
*off = iov->iov_len;
|
|
|
|
return (iov);
|
|
|
|
} else
|
|
|
|
return (NULL);
|
|
|
|
} else {
|
|
|
|
iov++, iol--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (NULL);
|
|
|
|
}
|