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$
40 * Traditional sbrk/grow interface to VM
43 #include <sys/param.h>
45 #include <sys/mutex.h>
47 #include <sys/racct.h>
48 #include <sys/resourcevar.h>
49 #include <sys/syscallsubr.h>
50 #include <sys/sysent.h>
51 #include <sys/sysproto.h>
52 #include <sys/systm.h>
53 #if defined(__amd64__) || defined(__i386__) /* for i386_read_exec */
54 #include <machine/md_var.h>
58 #include <vm/vm_param.h>
60 #include <vm/vm_map.h>
62 #ifndef _SYS_SYSPROTO_H_
68 sys_break(struct thread *td, struct break_args *uap)
70 #if !defined(__aarch64__) && !defined(__riscv)
74 addr = (uintptr_t)uap->nsize;
75 error = kern_break(td, &addr);
77 td->td_retval[0] = addr;
79 #else /* defined(__aarch64__) || defined(__riscv) */
81 #endif /* defined(__aarch64__) || defined(__riscv) */
85 kern_break(struct thread *td, uintptr_t *addr)
87 struct vmspace *vm = td->td_proc->p_vmspace;
88 vm_map_t map = &vm->vm_map;
89 vm_offset_t new, old, base;
90 rlim_t datalim, lmemlim, vmemlim;
94 datalim = lim_cur(td, RLIMIT_DATA);
95 lmemlim = lim_cur(td, RLIMIT_MEMLOCK);
96 vmemlim = lim_cur(td, RLIMIT_VMEM);
98 new = round_page(*addr);
101 base = round_page((vm_offset_t) vm->vm_daddr);
102 old = base + ctob(vm->vm_dsize);
105 * Check the resource limit, but allow a process to reduce
106 * its usage, even if it remains over the limit.
108 if (new - base > datalim && new > old) {
112 if (new > vm_map_max(map)) {
116 } else if (new < base) {
118 * Simply return the current break address without
119 * modifying any state. This is an ad-hoc interface
120 * used by libc to determine the initial break address,
121 * avoiding a dependency on magic features in the system
129 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
130 if (ptoa(pmap_wired_count(map->pmap)) +
131 (new - old) > lmemlim) {
136 if (map->size + (new - old) > vmemlim) {
142 PROC_LOCK(td->td_proc);
143 error = racct_set(td->td_proc, RACCT_DATA, new - base);
145 PROC_UNLOCK(td->td_proc);
149 error = racct_set(td->td_proc, RACCT_VMEM,
150 map->size + (new - old));
152 racct_set_force(td->td_proc, RACCT_DATA,
154 PROC_UNLOCK(td->td_proc);
158 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
159 error = racct_set(td->td_proc, RACCT_MEMLOCK,
160 ptoa(pmap_wired_count(map->pmap)) +
163 racct_set_force(td->td_proc, RACCT_DATA,
165 racct_set_force(td->td_proc, RACCT_VMEM,
167 PROC_UNLOCK(td->td_proc);
172 PROC_UNLOCK(td->td_proc);
176 #if (defined(COMPAT_FREEBSD32) && defined(__amd64__)) || defined(__i386__)
177 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
178 prot |= VM_PROT_EXECUTE;
180 rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL,
182 if (rv == KERN_SUCCESS && (map->flags & MAP_WIREFUTURE) != 0) {
183 rv = vm_map_wire_locked(map, old, new,
184 VM_MAP_WIRE_USER | VM_MAP_WIRE_NOHOLES);
185 if (rv != KERN_SUCCESS)
186 (void)vm_map_delete(map, old, new);
188 if (rv != KERN_SUCCESS) {
191 PROC_LOCK(td->td_proc);
192 racct_set_force(td->td_proc,
193 RACCT_DATA, old - base);
194 racct_set_force(td->td_proc,
195 RACCT_VMEM, map->size);
196 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
197 racct_set_force(td->td_proc,
199 ptoa(pmap_wired_count(map->pmap)));
201 PROC_UNLOCK(td->td_proc);
207 vm->vm_dsize += btoc(new - old);
208 } else if (new < old) {
209 rv = vm_map_delete(map, new, old);
210 if (rv != KERN_SUCCESS) {
214 vm->vm_dsize -= btoc(old - new);
217 PROC_LOCK(td->td_proc);
218 racct_set_force(td->td_proc, RACCT_DATA, new - base);
219 racct_set_force(td->td_proc, RACCT_VMEM, map->size);
220 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
221 racct_set_force(td->td_proc, RACCT_MEMLOCK,
222 ptoa(pmap_wired_count(map->pmap)));
224 PROC_UNLOCK(td->td_proc);
237 #ifdef COMPAT_FREEBSD11
239 freebsd11_vadvise(struct thread *td, struct freebsd11_vadvise_args *uap)