usr/src/sys/vm/vm_user.c

/*
 * Copyright (c) 1991 Regents of the University of California.
 * All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * The Mach Operating System project at Carnegie-Mellon University.
 *
 * 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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *      This product includes software developed by the University of
 *      California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
 *
 *      @(#)vm_user.c   7.3 (Berkeley) 4/21/91
 *
 *
 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
 * All rights reserved.
 *
 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
 *
 * Permission to use, copy, modify and distribute this software and
 * its documentation is hereby granted, provided that both the copyright
 * notice and this permission notice appear in all copies of the
 * software, derivative works or modified versions, and any portions
 * thereof, and that both notices appear in supporting documentation.
 *
 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
 * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
 *
 * Carnegie Mellon requests users of this software to return to
 *
 *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
 *  School of Computer Science
 *  Carnegie Mellon University
 *  Pittsburgh PA 15213-3890
 *
 * any improvements or extensions that they make and grant Carnegie the
 * rights to redistribute these changes.
 */

/*
 *      User-exported virtual memory functions.
 */

#include "param.h"
#include "systm.h"
#include "proc.h"

#include "vm.h"
#include "vm_page.h"

simple_lock_data_t      vm_alloc_lock;  /* XXX */

#ifdef MACHVMCOMPAT
/*
 * BSD style syscall interfaces to MACH calls
 * All return MACH return values.
 */
/* ARGSUSED */
svm_allocate(p, uap, retval)
        struct proc *p;
        struct args {
                vm_map_t map;
                vm_offset_t *addr;
                vm_size_t size;
                boolean_t anywhere;
        } *uap;
        int *retval;
{
        vm_offset_t addr;
        int rv;

        uap->map = p->p_map;            /* XXX */

        if (copyin((caddr_t)uap->addr, (caddr_t)&addr, sizeof (addr)))
                rv = KERN_INVALID_ARGUMENT;
        else
                rv = vm_allocate(uap->map, &addr, uap->size, uap->anywhere);
        if (rv == KERN_SUCCESS) {
                if (copyout((caddr_t)&addr, (caddr_t)uap->addr, sizeof(addr)))
                        rv = KERN_INVALID_ARGUMENT;
        }
        return((int)rv);
}

/* ARGSUSED */
svm_deallocate(p, uap, retval)
        struct proc *p;
        struct args {
                vm_map_t map;
                vm_offset_t addr;
                vm_size_t size;
        } *uap;
        int *retval;
{
        int rv;

        uap->map = p->p_map;            /* XXX */
        rv = vm_deallocate(uap->map, uap->addr, uap->size);
        return((int)rv);
}

/* ARGSUSED */
svm_inherit(p, uap, retval)
        struct proc *p;
        struct args {
                vm_map_t map;
                vm_offset_t addr;
                vm_size_t size;
                vm_inherit_t inherit;
        } *uap;
        int *retval;
{
        int rv;

        uap->map = p->p_map;            /* XXX */
        rv = vm_inherit(uap->map, uap->addr, uap->size, uap->inherit);
        return((int)rv);
}

/* ARGSUSED */
svm_protect(p, uap, retval)
        struct proc *p;
        struct args {
                vm_map_t map;
                vm_offset_t addr;
                vm_size_t size;
                boolean_t setmax;
                vm_prot_t prot;
        } *uap;
        int *retval;
{
        int rv;

        uap->map = p->p_map;            /* XXX */
        rv = vm_protect(uap->map, uap->addr, uap->size, uap->setmax, uap->prot);
        return((int)rv);
}
#endif

/*
 *      vm_allocate allocates "zero fill" memory in the specfied
 *      map.
 */
vm_allocate(map, addr, size, anywhere)
        register vm_map_t       map;
        register vm_offset_t    *addr;
        register vm_size_t      size;
        boolean_t               anywhere;
{
        int     result;

        if (map == NULL)
                return(KERN_INVALID_ARGUMENT);
        if (size == 0) {
                *addr = 0;
                return(KERN_SUCCESS);
        }

        if (anywhere)
                *addr = vm_map_min(map);
        else
                *addr = trunc_page(*addr);
        size = round_page(size);

        result = vm_map_find(map, NULL, (vm_offset_t) 0, addr,
                        size, anywhere);

        return(result);
}

/*
 *      vm_deallocate deallocates the specified range of addresses in the
 *      specified address map.
 */
vm_deallocate(map, start, size)
        register vm_map_t       map;
        vm_offset_t             start;
        vm_size_t               size;
{
        if (map == NULL)
                return(KERN_INVALID_ARGUMENT);

        if (size == (vm_offset_t) 0)
                return(KERN_SUCCESS);

        return(vm_map_remove(map, trunc_page(start), round_page(start+size)));
}

/*
 *      vm_inherit sets the inheritence of the specified range in the
 *      specified map.
 */
vm_inherit(map, start, size, new_inheritance)
        register vm_map_t       map;
        vm_offset_t             start;
        vm_size_t               size;
        vm_inherit_t            new_inheritance;
{
        if (map == NULL)
                return(KERN_INVALID_ARGUMENT);

        return(vm_map_inherit(map, trunc_page(start), round_page(start+size), new_inheritance));
}

/*
 *      vm_protect sets the protection of the specified range in the
 *      specified map.
 */

vm_protect(map, start, size, set_maximum, new_protection)
        register vm_map_t       map;
        vm_offset_t             start;
        vm_size_t               size;
        boolean_t               set_maximum;
        vm_prot_t               new_protection;
{
        if (map == NULL)
                return(KERN_INVALID_ARGUMENT);

        return(vm_map_protect(map, trunc_page(start), round_page(start+size), new_protection, set_maximum));
}