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
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_
74 sys_obreak(struct thread *td, struct obreak_args *uap)
76 struct vmspace *vm = td->td_proc->p_vmspace;
77 vm_map_t map = &vm->vm_map;
78 vm_offset_t new, old, base;
79 rlim_t datalim, lmemlim, vmemlim;
82 boolean_t do_map_wirefuture;
84 datalim = lim_cur(td, RLIMIT_DATA);
85 lmemlim = lim_cur(td, RLIMIT_MEMLOCK);
86 vmemlim = lim_cur(td, RLIMIT_VMEM);
88 do_map_wirefuture = FALSE;
89 new = round_page((vm_offset_t)uap->nsize);
92 base = round_page((vm_offset_t) vm->vm_daddr);
93 old = base + ctob(vm->vm_dsize);
96 * Check the resource limit, but allow a process to reduce
97 * its usage, even if it remains over the limit.
99 if (new - base > datalim && new > old) {
103 if (new > vm_map_max(map)) {
107 } else if (new < base) {
109 * This is simply an invalid value. If someone wants to
110 * do fancy address space manipulations, mmap and munmap
111 * can do most of what the user would want.
117 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
118 if (ptoa(pmap_wired_count(map->pmap)) +
119 (new - old) > lmemlim) {
124 if (map->size + (new - old) > vmemlim) {
130 PROC_LOCK(td->td_proc);
131 error = racct_set(td->td_proc, RACCT_DATA, new - base);
133 PROC_UNLOCK(td->td_proc);
137 error = racct_set(td->td_proc, RACCT_VMEM,
138 map->size + (new - old));
140 racct_set_force(td->td_proc, RACCT_DATA,
142 PROC_UNLOCK(td->td_proc);
146 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
147 error = racct_set(td->td_proc, RACCT_MEMLOCK,
148 ptoa(pmap_wired_count(map->pmap)) +
151 racct_set_force(td->td_proc, RACCT_DATA,
153 racct_set_force(td->td_proc, RACCT_VMEM,
155 PROC_UNLOCK(td->td_proc);
160 PROC_UNLOCK(td->td_proc);
164 #ifdef COMPAT_FREEBSD32
165 #if defined(__amd64__)
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) {
174 PROC_LOCK(td->td_proc);
175 racct_set_force(td->td_proc,
176 RACCT_DATA, old - base);
177 racct_set_force(td->td_proc,
178 RACCT_VMEM, map->size);
179 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
180 racct_set_force(td->td_proc,
182 ptoa(pmap_wired_count(map->pmap)));
184 PROC_UNLOCK(td->td_proc);
190 vm->vm_dsize += btoc(new - old);
192 * Handle the MAP_WIREFUTURE case for legacy applications,
193 * by marking the newly mapped range of pages as wired.
194 * We are not required to perform a corresponding
195 * vm_map_unwire() before vm_map_delete() below, as
196 * it will forcibly unwire the pages in the range.
198 * XXX If the pages cannot be wired, no error is returned.
200 if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
202 printf("obreak: MAP_WIREFUTURE set\n");
203 do_map_wirefuture = TRUE;
205 } else if (new < old) {
206 rv = vm_map_delete(map, new, old);
207 if (rv != KERN_SUCCESS) {
211 vm->vm_dsize -= btoc(old - new);
214 PROC_LOCK(td->td_proc);
215 racct_set_force(td->td_proc, RACCT_DATA, new - base);
216 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
217 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
218 racct_set_force(td->td_proc, RACCT_MEMLOCK,
219 ptoa(pmap_wired_count(map->pmap)));
221 PROC_UNLOCK(td->td_proc);
228 if (do_map_wirefuture)
229 (void) vm_map_wire(map, old, new,
230 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
235 #ifndef _SYS_SYSPROTO_H_
236 struct ovadvise_args {
246 sys_ovadvise(struct thread *td, struct ovadvise_args *uap)
248 /* START_GIANT_OPTIONAL */
249 /* END_GIANT_OPTIONAL */