1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1991, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * the Systems Programming Group of the University of Utah Computer 10 * Science Department. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 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. 23 * 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 34 * SUCH DAMAGE. 35 * 36 * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$ 37 * 38 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93 39 */ 40 41 /* 42 * Traditional sbrk/grow interface to VM 43 */ 44 45 #include <sys/cdefs.h> 46 __FBSDID("$FreeBSD$"); 47 48 #include <sys/param.h> 49 #include <sys/lock.h> 50 #include <sys/mutex.h> 51 #include <sys/proc.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> 57 58 #include <vm/vm.h> 59 #include <vm/vm_param.h> 60 #include <vm/pmap.h> 61 #include <vm/vm_map.h> 62 63 #ifndef _SYS_SYSPROTO_H_ 64 struct obreak_args { 65 char *nsize; 66 }; 67 #endif 68 int 69 sys_obreak(struct thread *td, struct obreak_args *uap) 70 { 71 #if !defined(__aarch64__) && !defined(__riscv__) 72 struct vmspace *vm = td->td_proc->p_vmspace; 73 vm_map_t map = &vm->vm_map; 74 vm_offset_t new, old, base; 75 rlim_t datalim, lmemlim, vmemlim; 76 int prot, rv; 77 int error = 0; 78 boolean_t do_map_wirefuture; 79 80 datalim = lim_cur(td, RLIMIT_DATA); 81 lmemlim = lim_cur(td, RLIMIT_MEMLOCK); 82 vmemlim = lim_cur(td, RLIMIT_VMEM); 83 84 do_map_wirefuture = FALSE; 85 new = round_page((vm_offset_t)uap->nsize); 86 vm_map_lock(map); 87 88 base = round_page((vm_offset_t) vm->vm_daddr); 89 old = base + ctob(vm->vm_dsize); 90 if (new > base) { 91 /* 92 * Check the resource limit, but allow a process to reduce 93 * its usage, even if it remains over the limit. 94 */ 95 if (new - base > datalim && new > old) { 96 error = ENOMEM; 97 goto done; 98 } 99 if (new > vm_map_max(map)) { 100 error = ENOMEM; 101 goto done; 102 } 103 } else if (new < base) { 104 /* 105 * This is simply an invalid value. If someone wants to 106 * do fancy address space manipulations, mmap and munmap 107 * can do most of what the user would want. 108 */ 109 error = EINVAL; 110 goto done; 111 } 112 if (new > old) { 113 if (!old_mlock && map->flags & MAP_WIREFUTURE) { 114 if (ptoa(pmap_wired_count(map->pmap)) + 115 (new - old) > lmemlim) { 116 error = ENOMEM; 117 goto done; 118 } 119 } 120 if (map->size + (new - old) > vmemlim) { 121 error = ENOMEM; 122 goto done; 123 } 124 #ifdef RACCT 125 if (racct_enable) { 126 PROC_LOCK(td->td_proc); 127 error = racct_set(td->td_proc, RACCT_DATA, new - base); 128 if (error != 0) { 129 PROC_UNLOCK(td->td_proc); 130 error = ENOMEM; 131 goto done; 132 } 133 error = racct_set(td->td_proc, RACCT_VMEM, 134 map->size + (new - old)); 135 if (error != 0) { 136 racct_set_force(td->td_proc, RACCT_DATA, 137 old - base); 138 PROC_UNLOCK(td->td_proc); 139 error = ENOMEM; 140 goto done; 141 } 142 if (!old_mlock && map->flags & MAP_WIREFUTURE) { 143 error = racct_set(td->td_proc, RACCT_MEMLOCK, 144 ptoa(pmap_wired_count(map->pmap)) + 145 (new - old)); 146 if (error != 0) { 147 racct_set_force(td->td_proc, RACCT_DATA, 148 old - base); 149 racct_set_force(td->td_proc, RACCT_VMEM, 150 map->size); 151 PROC_UNLOCK(td->td_proc); 152 error = ENOMEM; 153 goto done; 154 } 155 } 156 PROC_UNLOCK(td->td_proc); 157 } 158 #endif 159 prot = VM_PROT_RW; 160 #ifdef COMPAT_FREEBSD32 161 #if defined(__amd64__) 162 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32)) 163 prot |= VM_PROT_EXECUTE; 164 #endif 165 #endif 166 rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL, 0); 167 if (rv != KERN_SUCCESS) { 168 #ifdef RACCT 169 if (racct_enable) { 170 PROC_LOCK(td->td_proc); 171 racct_set_force(td->td_proc, 172 RACCT_DATA, old - base); 173 racct_set_force(td->td_proc, 174 RACCT_VMEM, map->size); 175 if (!old_mlock && map->flags & MAP_WIREFUTURE) { 176 racct_set_force(td->td_proc, 177 RACCT_MEMLOCK, 178 ptoa(pmap_wired_count(map->pmap))); 179 } 180 PROC_UNLOCK(td->td_proc); 181 } 182 #endif 183 error = ENOMEM; 184 goto done; 185 } 186 vm->vm_dsize += btoc(new - old); 187 /* 188 * Handle the MAP_WIREFUTURE case for legacy applications, 189 * by marking the newly mapped range of pages as wired. 190 * We are not required to perform a corresponding 191 * vm_map_unwire() before vm_map_delete() below, as 192 * it will forcibly unwire the pages in the range. 193 * 194 * XXX If the pages cannot be wired, no error is returned. 195 */ 196 if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) { 197 if (bootverbose) 198 printf("obreak: MAP_WIREFUTURE set\n"); 199 do_map_wirefuture = TRUE; 200 } 201 } else if (new < old) { 202 rv = vm_map_delete(map, new, old); 203 if (rv != KERN_SUCCESS) { 204 error = ENOMEM; 205 goto done; 206 } 207 vm->vm_dsize -= btoc(old - new); 208 #ifdef RACCT 209 if (racct_enable) { 210 PROC_LOCK(td->td_proc); 211 racct_set_force(td->td_proc, RACCT_DATA, new - base); 212 racct_set_force(td->td_proc, RACCT_VMEM, map->size); 213 if (!old_mlock && map->flags & MAP_WIREFUTURE) { 214 racct_set_force(td->td_proc, RACCT_MEMLOCK, 215 ptoa(pmap_wired_count(map->pmap))); 216 } 217 PROC_UNLOCK(td->td_proc); 218 } 219 #endif 220 } 221 done: 222 vm_map_unlock(map); 223 224 if (do_map_wirefuture) 225 (void) vm_map_wire(map, old, new, 226 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES); 227 228 return (error); 229 #else /* defined(__aarch64__) || defined(__riscv__) */ 230 return (ENOSYS); 231 #endif /* defined(__aarch64__) || defined(__riscv__) */ 232 } 233 234 #ifdef COMPAT_FREEBSD11 235 int 236 freebsd11_vadvise(struct thread *td, struct freebsd11_vadvise_args *uap) 237 { 238 239 return (EINVAL); 240 } 241 #endif 242