mirror of
https://github.com/Stichting-MINIX-Research-Foundation/netbsd.git
synced 2025-08-07 13:09:33 -04:00
233 lines
5.1 KiB
C
233 lines
5.1 KiB
C
/* $NetBSD: rumpcopy.c,v 1.20 2015/04/18 15:49:18 pooka Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 2009 Antti Kantee. All Rights Reserved.
|
|
*
|
|
* 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.
|
|
*
|
|
* 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 OR CONTRIBUTORS 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>
|
|
__KERNEL_RCSID(0, "$NetBSD: rumpcopy.c,v 1.20 2015/04/18 15:49:18 pooka Exp $");
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/lwp.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/uio.h>
|
|
|
|
#include <rump/rumpuser.h>
|
|
|
|
#include "rump_private.h"
|
|
|
|
int
|
|
copyin(const void *uaddr, void *kaddr, size_t len)
|
|
{
|
|
int error = 0;
|
|
|
|
if (__predict_false(uaddr == NULL && len)) {
|
|
return EFAULT;
|
|
}
|
|
|
|
if (RUMP_LOCALPROC_P(curproc)) {
|
|
memcpy(kaddr, uaddr, len);
|
|
} else if (len) {
|
|
error = rump_sysproxy_copyin(RUMP_SPVM2CTL(curproc->p_vmspace),
|
|
uaddr, kaddr, len);
|
|
}
|
|
|
|
return error;
|
|
}
|
|
|
|
int
|
|
copyout(const void *kaddr, void *uaddr, size_t len)
|
|
{
|
|
int error = 0;
|
|
|
|
if (__predict_false(uaddr == NULL && len)) {
|
|
return EFAULT;
|
|
}
|
|
|
|
if (RUMP_LOCALPROC_P(curproc)) {
|
|
memcpy(uaddr, kaddr, len);
|
|
} else if (len) {
|
|
error = rump_sysproxy_copyout(RUMP_SPVM2CTL(curproc->p_vmspace),
|
|
kaddr, uaddr, len);
|
|
}
|
|
return error;
|
|
}
|
|
|
|
int
|
|
subyte(void *uaddr, int byte)
|
|
{
|
|
int error = 0;
|
|
|
|
if (RUMP_LOCALPROC_P(curproc))
|
|
*(char *)uaddr = byte;
|
|
else
|
|
error = rump_sysproxy_copyout(RUMP_SPVM2CTL(curproc->p_vmspace),
|
|
&byte, uaddr, 1);
|
|
|
|
return error;
|
|
}
|
|
|
|
int
|
|
copystr(const void *kfaddr, void *kdaddr, size_t len, size_t *done)
|
|
{
|
|
uint8_t *to = kdaddr;
|
|
const uint8_t *from = kfaddr;
|
|
size_t actlen = 0;
|
|
|
|
while (len-- > 0 && (*to++ = *from++) != 0)
|
|
actlen++;
|
|
|
|
if (len+1 == 0 && *(to-1) != 0)
|
|
return ENAMETOOLONG;
|
|
|
|
if (done)
|
|
*done = actlen+1; /* + '\0' */
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
copyinstr(const void *uaddr, void *kaddr, size_t len, size_t *done)
|
|
{
|
|
uint8_t *to;
|
|
int rv;
|
|
|
|
if (len == 0)
|
|
return 0;
|
|
|
|
if (__predict_false(uaddr == NULL)) {
|
|
return EFAULT;
|
|
}
|
|
|
|
if (RUMP_LOCALPROC_P(curproc))
|
|
return copystr(uaddr, kaddr, len, done);
|
|
|
|
if ((rv = rump_sysproxy_copyinstr(RUMP_SPVM2CTL(curproc->p_vmspace),
|
|
uaddr, kaddr, &len)) != 0)
|
|
return rv;
|
|
|
|
/* figure out if we got a terminated string or not */
|
|
to = (uint8_t *)kaddr + (len-1);
|
|
while (to >= (uint8_t *)kaddr) {
|
|
if (*to == 0)
|
|
goto found;
|
|
to--;
|
|
}
|
|
return ENAMETOOLONG;
|
|
|
|
found:
|
|
if (done)
|
|
*done = strlen(kaddr)+1; /* includes termination */
|
|
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
copyoutstr(const void *kaddr, void *uaddr, size_t len, size_t *done)
|
|
{
|
|
size_t slen;
|
|
int error;
|
|
|
|
if (__predict_false(uaddr == NULL && len)) {
|
|
return EFAULT;
|
|
}
|
|
|
|
if (RUMP_LOCALPROC_P(curproc))
|
|
return copystr(kaddr, uaddr, len, done);
|
|
|
|
slen = strlen(kaddr)+1;
|
|
if (slen > len)
|
|
return ENAMETOOLONG;
|
|
|
|
error = rump_sysproxy_copyoutstr(RUMP_SPVM2CTL(curproc->p_vmspace),
|
|
kaddr, uaddr, &slen);
|
|
if (done)
|
|
*done = slen;
|
|
|
|
return error;
|
|
}
|
|
|
|
int
|
|
kcopy(const void *src, void *dst, size_t len)
|
|
{
|
|
|
|
memcpy(dst, src, len);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Low-level I/O routine. This is used only when "all else fails",
|
|
* i.e. the current thread does not have an appropriate vm context.
|
|
*/
|
|
int
|
|
uvm_io(struct vm_map *vm, struct uio *uio)
|
|
{
|
|
int error = 0;
|
|
|
|
/* loop over iovecs one-by-one and copyout */
|
|
for (; uio->uio_resid && uio->uio_iovcnt;
|
|
uio->uio_iovcnt--, uio->uio_iov++) {
|
|
struct iovec *iov = uio->uio_iov;
|
|
size_t curlen = MIN(uio->uio_resid, iov->iov_len);
|
|
|
|
if (__predict_false(curlen == 0))
|
|
continue;
|
|
|
|
if (uio->uio_rw == UIO_READ) {
|
|
error = rump_sysproxy_copyin(RUMP_SPVM2CTL(vm),
|
|
(void *)(vaddr_t)uio->uio_offset, iov->iov_base,
|
|
curlen);
|
|
} else {
|
|
error = rump_sysproxy_copyout(RUMP_SPVM2CTL(vm),
|
|
iov->iov_base, (void *)(vaddr_t)uio->uio_offset,
|
|
curlen);
|
|
}
|
|
if (error)
|
|
break;
|
|
|
|
iov->iov_base = (uint8_t *)iov->iov_base + curlen;
|
|
iov->iov_len -= curlen;
|
|
|
|
uio->uio_resid -= curlen;
|
|
uio->uio_offset += curlen;
|
|
}
|
|
|
|
return error;
|
|
}
|
|
|
|
/*
|
|
* Copy one byte from userspace to kernel.
|
|
*/
|
|
int
|
|
fubyte(const void *base)
|
|
{
|
|
unsigned char val;
|
|
int error;
|
|
|
|
error = copyin(base, &val, sizeof(char));
|
|
if (error != 0)
|
|
return -1;
|
|
|
|
return (int)val;
|
|
}
|