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_
76 sys_obreak(struct thread *td, 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 datalim = lim_cur(td, RLIMIT_DATA);
87 lmemlim = lim_cur(td, RLIMIT_MEMLOCK);
88 vmemlim = lim_cur(td, RLIMIT_VMEM);
90 do_map_wirefuture = FALSE;
91 new = round_page((vm_offset_t)uap->nsize);
94 base = round_page((vm_offset_t) vm->vm_daddr);
95 old = base + ctob(vm->vm_dsize);
98 * Check the resource limit, but allow a process to reduce
99 * its usage, even if it remains over the limit.
101 if (new - base > datalim && new > old) {
105 if (new > vm_map_max(map)) {
109 } else if (new < base) {
111 * This is simply an invalid value. If someone wants to
112 * do fancy address space manipulations, mmap and munmap
113 * can do most of what the user would want.
119 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
120 if (ptoa(pmap_wired_count(map->pmap)) +
121 (new - old) > lmemlim) {
126 if (map->size + (new - old) > vmemlim) {
132 PROC_LOCK(td->td_proc);
133 error = racct_set(td->td_proc, RACCT_DATA, new - base);
135 PROC_UNLOCK(td->td_proc);
139 error = racct_set(td->td_proc, RACCT_VMEM,
140 map->size + (new - old));
142 racct_set_force(td->td_proc, RACCT_DATA,
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)) +
153 racct_set_force(td->td_proc, RACCT_DATA,
155 racct_set_force(td->td_proc, RACCT_VMEM,
157 PROC_UNLOCK(td->td_proc);
162 PROC_UNLOCK(td->td_proc);
166 #ifdef COMPAT_FREEBSD32
167 #if defined(__amd64__)
168 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
169 prot |= VM_PROT_EXECUTE;
172 rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL, 0);
173 if (rv != KERN_SUCCESS) {
176 PROC_LOCK(td->td_proc);
177 racct_set_force(td->td_proc,
178 RACCT_DATA, old - base);
179 racct_set_force(td->td_proc,
180 RACCT_VMEM, map->size);
181 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
182 racct_set_force(td->td_proc,
184 ptoa(pmap_wired_count(map->pmap)));
186 PROC_UNLOCK(td->td_proc);
192 vm->vm_dsize += btoc(new - old);
194 * Handle the MAP_WIREFUTURE case for legacy applications,
195 * by marking the newly mapped range of pages as wired.
196 * We are not required to perform a corresponding
197 * vm_map_unwire() before vm_map_delete() below, as
198 * it will forcibly unwire the pages in the range.
200 * XXX If the pages cannot be wired, no error is returned.
202 if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
204 printf("obreak: MAP_WIREFUTURE set\n");
205 do_map_wirefuture = TRUE;
207 } else if (new < old) {
208 rv = vm_map_delete(map, new, old);
209 if (rv != KERN_SUCCESS) {
213 vm->vm_dsize -= btoc(old - new);
216 PROC_LOCK(td->td_proc);
217 racct_set_force(td->td_proc, RACCT_DATA, new - base);
218 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
219 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
220 racct_set_force(td->td_proc, RACCT_MEMLOCK,
221 ptoa(pmap_wired_count(map->pmap)));
223 PROC_UNLOCK(td->td_proc);
230 if (do_map_wirefuture)
231 (void) vm_map_wire(map, old, new,
232 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
237 #ifndef _SYS_SYSPROTO_H_
238 struct ovadvise_args {
248 sys_ovadvise(struct thread *td, struct ovadvise_args *uap)
250 /* START_GIANT_OPTIONAL */
251 /* END_GIANT_OPTIONAL */