239 lines
6.9 KiB
C
239 lines
6.9 KiB
C
#undef DEBUG_DARWIN
|
|
#undef DEBUG_MACH
|
|
/* $NetBSD: darwin_mman.c,v 1.29 2008/04/28 20:23:41 martin Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 2002, 2008 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Emmanuel Dreyfus.
|
|
*
|
|
* 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 NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
|
* ``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 FOUNDATION 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: darwin_mman.c,v 1.29 2008/04/28 20:23:41 martin Exp $");
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/signal.h>
|
|
#include <sys/mount.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/fcntl.h>
|
|
#include <sys/file.h>
|
|
#include <sys/filedesc.h>
|
|
#include <sys/vnode.h>
|
|
#include <sys/exec.h>
|
|
|
|
#include <sys/syscallargs.h>
|
|
|
|
#include <compat/sys/signal.h>
|
|
|
|
#include <compat/mach/mach_types.h>
|
|
#include <compat/mach/mach_vm.h>
|
|
|
|
#include <compat/darwin/darwin_audit.h>
|
|
#include <compat/darwin/darwin_syscallargs.h>
|
|
|
|
int
|
|
darwin_sys_load_shared_file(struct lwp *l, const struct darwin_sys_load_shared_file_args *uap, register_t *retval)
|
|
{
|
|
/* {
|
|
syscallarg(char *) filename;
|
|
syscallarg(void *) addr;
|
|
syscallarg(u_long) len;
|
|
syscallarg(void **) base;
|
|
syscallarg(int) count:
|
|
syscallarg(mach_sf_mapping_t *) mappings;
|
|
syscallarg(int *) flags;
|
|
} */
|
|
struct file *fp;
|
|
struct vnode *vp = NULL;
|
|
vaddr_t base;
|
|
struct proc *p = l->l_proc;
|
|
int flags;
|
|
char *filename;
|
|
mach_sf_mapping_t *mapp = NULL;
|
|
size_t maplen;
|
|
struct sys_open_args open_cup;
|
|
struct sys_close_args close_cup;
|
|
register_t fdc;
|
|
int fd;
|
|
int i;
|
|
int error;
|
|
vaddr_t max_addr, addr;
|
|
size_t len;
|
|
vaddr_t uaddr;
|
|
int need_relocation;
|
|
struct exec_vmcmd evc;
|
|
|
|
filename = malloc(MAXPATHLEN, M_TEMP, M_WAITOK);
|
|
if ((error = copyin(SCARG(uap, filename), filename, MAXPATHLEN)) != 0)
|
|
goto bad1;
|
|
|
|
if ((error = copyin(SCARG(uap, base), &base, sizeof(base))) != 0)
|
|
goto bad1;
|
|
|
|
if ((error = copyin(SCARG(uap, flags), &flags, sizeof(base))) != 0)
|
|
goto bad1;
|
|
|
|
#ifdef DEBUG_DARWIN
|
|
DPRINTF(("darwin_sys_load_shared_file: filename = %p ",
|
|
SCARG(uap, filename)));
|
|
DPRINTF(("addr = %p len = 0x%08lx base = %p ",
|
|
SCARG(uap, addr), SCARG(uap, len), SCARG(uap, base)));
|
|
DPRINTF(("count = %d mappings = %p flags = %p ",
|
|
SCARG(uap, count), SCARG(uap, mappings), SCARG(uap, flags)));
|
|
DPRINTF(("*base = 0x%08lx *flags = %d filename=`%s'\n",
|
|
base, flags, filename));
|
|
#endif
|
|
|
|
SCARG(&open_cup, path) = SCARG(uap, filename);
|
|
SCARG(&open_cup, flags) = O_RDONLY;
|
|
SCARG(&open_cup, mode) = 0;
|
|
if ((error = sys_open(l, &open_cup, &fdc)) != 0)
|
|
goto bad1;
|
|
|
|
fd = (int)fdc;
|
|
fp = fd_getfile(fd);
|
|
if (fp == NULL) {
|
|
error = EBADF;
|
|
goto bad1point5;
|
|
}
|
|
vp = fp->f_data;
|
|
vref(vp);
|
|
|
|
if (SCARG(uap, count) < 0 ||
|
|
SCARG(uap, count) > PAGE_SIZE / sizeof(*mapp)) {
|
|
error = EINVAL;
|
|
goto bad2;
|
|
}
|
|
maplen = SCARG(uap, count) * sizeof(*mapp);
|
|
mapp = malloc(maplen, M_TEMP, M_WAITOK);
|
|
|
|
if ((error = copyin(SCARG(uap, mappings), mapp, maplen)) != 0)
|
|
goto bad2;
|
|
|
|
#ifdef DEBUG_DARWIN
|
|
for (i = 0; i < SCARG(uap, count); i++) {
|
|
DPRINTF(("mapp[%d].mapping_offset = 0x%08lx\n",
|
|
i, mapp[i].mapping_offset));
|
|
DPRINTF(("mapp[%d].size = 0x%08lx\n", i, (long)mapp[i].size));
|
|
DPRINTF(("mapp[%d].file_offset = 0x%08lx\n",
|
|
i, mapp[i].file_offset));
|
|
DPRINTF(("mapp[%d].protection = %d\n",
|
|
i, mapp[i].protection));
|
|
DPRINTF(("mapp[%d].cksum = %ld\n", i, mapp[i].cksum));
|
|
}
|
|
#endif
|
|
|
|
/* Check if we can load at the default addresses */
|
|
need_relocation = 0;
|
|
vm_map_lock(&p->p_vmspace->vm_map);
|
|
for (i = 0; i < SCARG(uap, count); i++)
|
|
if ((uvm_map_findspace(&p->p_vmspace->vm_map,
|
|
base + mapp[i].mapping_offset, mapp[i].size,
|
|
&uaddr, NULL, 0, 0, UVM_FLAG_FIXED)) == NULL)
|
|
need_relocation = 1;
|
|
vm_map_unlock(&p->p_vmspace->vm_map);
|
|
|
|
/* If we cannot, we need a relocation */
|
|
if (need_relocation) {
|
|
DPRINTF(("Relocating\n"));
|
|
/* Compute the length of the region enclosing all sections */
|
|
max_addr = 0;
|
|
for (i = 0; i < SCARG(uap, count); i++) {
|
|
addr = (vaddr_t)(mapp[i].mapping_offset
|
|
+ base + mapp[i].size);
|
|
if (addr > max_addr)
|
|
max_addr = addr;
|
|
}
|
|
len = max_addr - base;
|
|
DPRINTF(("base = 0x%08lx max_addr = 0x%08lx len = 0x%08x\n",
|
|
base, max_addr, len));
|
|
|
|
/* Find some place to map this region */
|
|
vm_map_lock(&p->p_vmspace->vm_map);
|
|
if ((uvm_map_findspace(&p->p_vmspace->vm_map, base,
|
|
len, &uaddr, NULL, 0, PAGE_SIZE, 0)) == NULL) {
|
|
DPRINTF(("Impossible to find some space\n"));
|
|
vm_map_unlock(&p->p_vmspace->vm_map);
|
|
error = ENOMEM;
|
|
goto bad2;
|
|
}
|
|
vm_map_unlock(&p->p_vmspace->vm_map);
|
|
|
|
/* Update the base address */
|
|
base = uaddr;
|
|
DPRINTF(("New base address: base = 0x%08lx\n", base));
|
|
}
|
|
|
|
/* Do the actual mapping */
|
|
for (i = 0; i < SCARG(uap, count); i++) {
|
|
bzero(&evc, sizeof(evc));
|
|
evc.ev_addr = base + mapp[i].mapping_offset;
|
|
evc.ev_len = mapp[i].size;
|
|
evc.ev_prot = mapp[i].protection & VM_PROT_ALL;
|
|
evc.ev_flags = 0;
|
|
if (mapp[i].protection & MACH_VM_PROT_ZF)
|
|
evc.ev_proc = vmcmd_map_zero;
|
|
else
|
|
evc.ev_proc = vmcmd_map_readvn;
|
|
evc.ev_offset = mapp[i].file_offset;
|
|
evc.ev_vp = vp;
|
|
|
|
DPRINTF(("map section %d: start = 0x%08lx, len = 0x%08lx\n",
|
|
i, evc.ev_addr, evc.ev_len));
|
|
|
|
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
|
|
if ((error = (*evc.ev_proc)(l, &evc)) != 0) {
|
|
VOP_UNLOCK(vp, 0);
|
|
DPRINTF(("Failed\n"));
|
|
goto bad2;
|
|
}
|
|
VOP_UNLOCK(vp, 0);
|
|
DPRINTF(("Success\n"));
|
|
}
|
|
bad2:
|
|
if (mapp)
|
|
free(mapp, M_TEMP);
|
|
vrele(vp);
|
|
fd_putfile(fd);
|
|
bad1point5:
|
|
SCARG(&close_cup, fd) = fd;
|
|
if ((error = sys_close(l, &close_cup, retval)) != 0)
|
|
goto bad1;
|
|
|
|
if ((error = copyout(&base, SCARG(uap, base), sizeof(base))) != 0)
|
|
goto bad1;
|
|
|
|
if ((error = copyout(&flags, SCARG(uap, flags), sizeof(base))) != 0)
|
|
goto bad1;
|
|
bad1:
|
|
free(filename, M_TEMP);
|
|
|
|
return error;
|
|
}
|