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 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
36 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
39 #include "opt_compat.h"
42 * Traditional sbrk/grow interface to VM
45 #include <sys/cdefs.h>
46 __FBSDID("$FreeBSD$");
48 #include <sys/param.h>
50 #include <sys/mutex.h>
52 #include <sys/racct.h>
53 #include <sys/resourcevar.h>
54 #include <sys/sysent.h>
55 #include <sys/sysproto.h>
56 #include <sys/systm.h>
59 #include <vm/vm_param.h>
61 #include <vm/vm_map.h>
63 #ifndef _SYS_SYSPROTO_H_
76 struct obreak_args *uap;
78 struct vmspace *vm = td->td_proc->p_vmspace;
79 vm_map_t map = &vm->vm_map;
80 vm_offset_t new, old, base;
81 rlim_t datalim, lmemlim, vmemlim;
84 boolean_t do_map_wirefuture;
86 PROC_LOCK(td->td_proc);
87 datalim = lim_cur(td->td_proc, RLIMIT_DATA);
88 lmemlim = lim_cur(td->td_proc, RLIMIT_MEMLOCK);
89 vmemlim = lim_cur(td->td_proc, RLIMIT_VMEM);
90 PROC_UNLOCK(td->td_proc);
92 do_map_wirefuture = FALSE;
93 new = round_page((vm_offset_t)uap->nsize);
96 base = round_page((vm_offset_t) vm->vm_daddr);
97 old = base + ctob(vm->vm_dsize);
100 * Check the resource limit, but allow a process to reduce
101 * its usage, even if it remains over the limit.
103 if (new - base > datalim && new > old) {
107 if (new > vm_map_max(map)) {
111 } else if (new < base) {
113 * This is simply an invalid value. If someone wants to
114 * do fancy address space manipulations, mmap and munmap
115 * can do most of what the user would want.
121 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
122 if (ptoa(pmap_wired_count(map->pmap)) +
123 (new - old) > lmemlim) {
128 if (map->size + (new - old) > vmemlim) {
133 PROC_LOCK(td->td_proc);
134 error = racct_set(td->td_proc, RACCT_DATA, new - base);
136 PROC_UNLOCK(td->td_proc);
140 error = racct_set(td->td_proc, RACCT_VMEM,
141 map->size + (new - old));
143 racct_set_force(td->td_proc, RACCT_DATA, old - base);
144 PROC_UNLOCK(td->td_proc);
148 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
149 error = racct_set(td->td_proc, RACCT_MEMLOCK,
150 ptoa(pmap_wired_count(map->pmap)) + (new - old));
152 racct_set_force(td->td_proc, RACCT_DATA,
154 racct_set_force(td->td_proc, RACCT_VMEM,
156 PROC_UNLOCK(td->td_proc);
161 PROC_UNLOCK(td->td_proc);
164 #ifdef COMPAT_FREEBSD32
165 #if defined(__amd64__) || defined(__ia64__)
166 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
167 prot |= VM_PROT_EXECUTE;
170 rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL, 0);
171 if (rv != KERN_SUCCESS) {
173 PROC_LOCK(td->td_proc);
174 racct_set_force(td->td_proc, RACCT_DATA, old - base);
175 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
176 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
177 racct_set_force(td->td_proc, RACCT_MEMLOCK,
178 ptoa(pmap_wired_count(map->pmap)));
180 PROC_UNLOCK(td->td_proc);
185 vm->vm_dsize += btoc(new - old);
187 * Handle the MAP_WIREFUTURE case for legacy applications,
188 * by marking the newly mapped range of pages as wired.
189 * We are not required to perform a corresponding
190 * vm_map_unwire() before vm_map_delete() below, as
191 * it will forcibly unwire the pages in the range.
193 * XXX If the pages cannot be wired, no error is returned.
195 if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
197 printf("obreak: MAP_WIREFUTURE set\n");
198 do_map_wirefuture = TRUE;
200 } else if (new < old) {
201 rv = vm_map_delete(map, new, old);
202 if (rv != KERN_SUCCESS) {
206 vm->vm_dsize -= btoc(old - new);
208 PROC_LOCK(td->td_proc);
209 racct_set_force(td->td_proc, RACCT_DATA, new - base);
210 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
211 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
212 racct_set_force(td->td_proc, RACCT_MEMLOCK,
213 ptoa(pmap_wired_count(map->pmap)));
215 PROC_UNLOCK(td->td_proc);
221 if (do_map_wirefuture)
222 (void) vm_map_wire(map, old, new,
223 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
228 #ifndef _SYS_SYSPROTO_H_
229 struct ovadvise_args {
239 sys_ovadvise(td, uap)
241 struct ovadvise_args *uap;
243 /* START_GIANT_OPTIONAL */
244 /* END_GIANT_OPTIONAL */