2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1991, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
38 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
41 #include "opt_compat.h"
44 * Traditional sbrk/grow interface to VM
47 #include <sys/cdefs.h>
48 __FBSDID("$FreeBSD$");
50 #include <sys/param.h>
52 #include <sys/mutex.h>
54 #include <sys/racct.h>
55 #include <sys/resourcevar.h>
56 #include <sys/sysent.h>
57 #include <sys/sysproto.h>
58 #include <sys/systm.h>
61 #include <vm/vm_param.h>
63 #include <vm/vm_map.h>
65 #ifndef _SYS_SYSPROTO_H_
78 struct obreak_args *uap;
80 struct vmspace *vm = td->td_proc->p_vmspace;
81 vm_map_t map = &vm->vm_map;
82 vm_offset_t new, old, base;
83 rlim_t datalim, lmemlim, vmemlim;
86 boolean_t do_map_wirefuture;
88 datalim = lim_cur(td, RLIMIT_DATA);
89 lmemlim = lim_cur(td, RLIMIT_MEMLOCK);
90 vmemlim = lim_cur(td, RLIMIT_VMEM);
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) {
134 PROC_LOCK(td->td_proc);
135 error = racct_set(td->td_proc, RACCT_DATA, new - base);
137 PROC_UNLOCK(td->td_proc);
141 error = racct_set(td->td_proc, RACCT_VMEM,
142 map->size + (new - old));
144 racct_set_force(td->td_proc, RACCT_DATA,
146 PROC_UNLOCK(td->td_proc);
150 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
151 error = racct_set(td->td_proc, RACCT_MEMLOCK,
152 ptoa(pmap_wired_count(map->pmap)) +
155 racct_set_force(td->td_proc, RACCT_DATA,
157 racct_set_force(td->td_proc, RACCT_VMEM,
159 PROC_UNLOCK(td->td_proc);
164 PROC_UNLOCK(td->td_proc);
168 #ifdef COMPAT_FREEBSD32
169 #if defined(__amd64__)
170 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
171 prot |= VM_PROT_EXECUTE;
174 rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL, 0);
175 if (rv != KERN_SUCCESS) {
178 PROC_LOCK(td->td_proc);
179 racct_set_force(td->td_proc,
180 RACCT_DATA, old - base);
181 racct_set_force(td->td_proc,
182 RACCT_VMEM, map->size);
183 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
184 racct_set_force(td->td_proc,
186 ptoa(pmap_wired_count(map->pmap)));
188 PROC_UNLOCK(td->td_proc);
194 vm->vm_dsize += btoc(new - old);
196 * Handle the MAP_WIREFUTURE case for legacy applications,
197 * by marking the newly mapped range of pages as wired.
198 * We are not required to perform a corresponding
199 * vm_map_unwire() before vm_map_delete() below, as
200 * it will forcibly unwire the pages in the range.
202 * XXX If the pages cannot be wired, no error is returned.
204 if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
206 printf("obreak: MAP_WIREFUTURE set\n");
207 do_map_wirefuture = TRUE;
209 } else if (new < old) {
210 rv = vm_map_delete(map, new, old);
211 if (rv != KERN_SUCCESS) {
215 vm->vm_dsize -= btoc(old - new);
218 PROC_LOCK(td->td_proc);
219 racct_set_force(td->td_proc, RACCT_DATA, new - base);
220 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
221 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
222 racct_set_force(td->td_proc, RACCT_MEMLOCK,
223 ptoa(pmap_wired_count(map->pmap)));
225 PROC_UNLOCK(td->td_proc);
232 if (do_map_wirefuture)
233 (void) vm_map_wire(map, old, new,
234 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
239 #ifndef _SYS_SYSPROTO_H_
240 struct ovadvise_args {
250 sys_ovadvise(td, uap)
252 struct ovadvise_args *uap;
254 /* START_GIANT_OPTIONAL */
255 /* END_GIANT_OPTIONAL */