2 * Copyright (c) 1988 University of Utah.
3 * Copyright (c) 1991, 1993
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * the Systems Programming Group of the University of Utah Computer
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
40 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
45 * Traditional sbrk/grow interface to VM
48 #include <sys/param.h>
50 #include <sys/mutex.h>
52 #include <sys/resourcevar.h>
53 #include <sys/sysproto.h>
54 #include <sys/systm.h>
57 #include <vm/vm_param.h>
59 #include <vm/vm_map.h>
61 #ifndef _SYS_SYSPROTO_H_
74 struct obreak_args *uap;
76 struct vmspace *vm = td->td_proc->p_vmspace;
77 vm_offset_t new, old, base;
81 new = round_page((vm_offset_t)uap->nsize);
82 vm_map_lock(&vm->vm_map);
84 base = round_page((vm_offset_t) vm->vm_daddr);
85 old = base + ctob(vm->vm_dsize);
88 * Check the resource limit, but allow a process to reduce
89 * its usage, even if it remains over the limit.
91 if (new - base > td->td_proc->p_rlimit[RLIMIT_DATA].rlim_cur &&
96 if (new > vm_map_max(&vm->vm_map)) {
100 } else if (new < base) {
102 * This is simply an invalid value. If someone wants to
103 * do fancy address space manipulations, mmap and munmap
104 * can do most of what the user would want.
110 if (vm->vm_map.size + (new - old) >
111 td->td_proc->p_rlimit[RLIMIT_VMEM].rlim_cur) {
115 rv = vm_map_insert(&vm->vm_map, NULL, 0, old, new,
116 VM_PROT_ALL, VM_PROT_ALL, 0);
117 if (rv != KERN_SUCCESS) {
121 vm->vm_dsize += btoc(new - old);
122 } else if (new < old) {
123 rv = vm_map_delete(&vm->vm_map, new, old);
124 if (rv != KERN_SUCCESS) {
128 vm->vm_dsize -= btoc(old - new);
131 vm_map_unlock(&vm->vm_map);
135 #ifndef _SYS_SYSPROTO_H_
136 struct ovadvise_args {
148 struct ovadvise_args *uap;
150 /* START_GIANT_OPTIONAL */
151 /* END_GIANT_OPTIONAL */