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 #include <sys/param.h>
48 #include <sys/mutex.h>
50 #include <sys/racct.h>
51 #include <sys/resourcevar.h>
52 #include <sys/syscallsubr.h>
53 #include <sys/sysent.h>
54 #include <sys/sysproto.h>
55 #include <sys/systm.h>
56 #if defined(__amd64__) || defined(__i386__) /* for i386_read_exec */
57 #include <machine/md_var.h>
61 #include <vm/vm_param.h>
63 #include <vm/vm_map.h>
65 #ifndef _SYS_SYSPROTO_H_
71 sys_break(struct thread *td, struct break_args *uap)
73 #if !defined(__aarch64__) && !defined(__riscv)
77 addr = (uintptr_t)uap->nsize;
78 error = kern_break(td, &addr);
80 td->td_retval[0] = addr;
82 #else /* defined(__aarch64__) || defined(__riscv) */
84 #endif /* defined(__aarch64__) || defined(__riscv) */
88 kern_break(struct thread *td, uintptr_t *addr)
90 struct vmspace *vm = td->td_proc->p_vmspace;
91 vm_map_t map = &vm->vm_map;
92 vm_offset_t new, old, base;
93 rlim_t datalim, lmemlim, vmemlim;
97 datalim = lim_cur(td, RLIMIT_DATA);
98 lmemlim = lim_cur(td, RLIMIT_MEMLOCK);
99 vmemlim = lim_cur(td, RLIMIT_VMEM);
101 new = round_page(*addr);
104 base = round_page((vm_offset_t) vm->vm_daddr);
105 old = base + ctob(vm->vm_dsize);
108 * Check the resource limit, but allow a process to reduce
109 * its usage, even if it remains over the limit.
111 if (new - base > datalim && new > old) {
115 if (new > vm_map_max(map)) {
119 } else if (new < base) {
121 * Simply return the current break address without
122 * modifying any state. This is an ad-hoc interface
123 * used by libc to determine the initial break address,
124 * avoiding a dependency on magic features in the system
132 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
133 if (ptoa(pmap_wired_count(map->pmap)) +
134 (new - old) > lmemlim) {
139 if (map->size + (new - old) > vmemlim) {
145 PROC_LOCK(td->td_proc);
146 error = racct_set(td->td_proc, RACCT_DATA, new - base);
148 PROC_UNLOCK(td->td_proc);
152 error = racct_set(td->td_proc, RACCT_VMEM,
153 map->size + (new - old));
155 racct_set_force(td->td_proc, RACCT_DATA,
157 PROC_UNLOCK(td->td_proc);
161 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
162 error = racct_set(td->td_proc, RACCT_MEMLOCK,
163 ptoa(pmap_wired_count(map->pmap)) +
166 racct_set_force(td->td_proc, RACCT_DATA,
168 racct_set_force(td->td_proc, RACCT_VMEM,
170 PROC_UNLOCK(td->td_proc);
175 PROC_UNLOCK(td->td_proc);
179 #if (defined(COMPAT_FREEBSD32) && defined(__amd64__)) || defined(__i386__)
180 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
181 prot |= VM_PROT_EXECUTE;
183 rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL,
185 if (rv == KERN_SUCCESS && (map->flags & MAP_WIREFUTURE) != 0) {
186 rv = vm_map_wire_locked(map, old, new,
187 VM_MAP_WIRE_USER | VM_MAP_WIRE_NOHOLES);
188 if (rv != KERN_SUCCESS)
189 (void)vm_map_delete(map, old, new);
191 if (rv != KERN_SUCCESS) {
194 PROC_LOCK(td->td_proc);
195 racct_set_force(td->td_proc,
196 RACCT_DATA, old - base);
197 racct_set_force(td->td_proc,
198 RACCT_VMEM, map->size);
199 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
200 racct_set_force(td->td_proc,
202 ptoa(pmap_wired_count(map->pmap)));
204 PROC_UNLOCK(td->td_proc);
210 vm->vm_dsize += btoc(new - old);
211 } else if (new < old) {
212 rv = vm_map_delete(map, new, old);
213 if (rv != KERN_SUCCESS) {
217 vm->vm_dsize -= btoc(old - new);
220 PROC_LOCK(td->td_proc);
221 racct_set_force(td->td_proc, RACCT_DATA, new - base);
222 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
223 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
224 racct_set_force(td->td_proc, RACCT_MEMLOCK,
225 ptoa(pmap_wired_count(map->pmap)));
227 PROC_UNLOCK(td->td_proc);
240 #ifdef COMPAT_FREEBSD11
242 freebsd11_vadvise(struct thread *td, struct freebsd11_vadvise_args *uap)