xref: /freebsd/sys/vm/vm_unix.c (revision 9fe48b8076ae9c6dc486d713c468ff03ec056eda)
1 /*-
2  * Copyright (c) 1988 University of Utah.
3  * Copyright (c) 1991, 1993
4  *	The Regents of the University of California.  All rights reserved.
5  *
6  * This code is derived from software contributed to Berkeley by
7  * the Systems Programming Group of the University of Utah Computer
8  * Science Department.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  * 1. Redistributions of source code must retain the above copyright
14  *    notice, this list of conditions and the following disclaimer.
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  * 4. Neither the name of the University nor the names of its contributors
19  *    may be used to endorse or promote products derived from this software
20  *    without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  *
34  * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
35  *
36  *	@(#)vm_unix.c	8.1 (Berkeley) 6/11/93
37  */
38 
39 #include "opt_compat.h"
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 
69 /*
70  * MPSAFE
71  */
72 /* ARGSUSED */
73 int
74 sys_obreak(td, uap)
75 	struct thread *td;
76 	struct obreak_args *uap;
77 {
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;
82 	int prot, rv;
83 	int error = 0;
84 	boolean_t do_map_wirefuture;
85 
86 	PROC_LOCK(td->td_proc);
87 	datalim = lim_cur(td->td_proc, RLIMIT_DATA);
88 	lmemlim = lim_cur(td->td_proc, RLIMIT_MEMLOCK);
89 	vmemlim = lim_cur(td->td_proc, RLIMIT_VMEM);
90 	PROC_UNLOCK(td->td_proc);
91 
92 	do_map_wirefuture = FALSE;
93 	new = round_page((vm_offset_t)uap->nsize);
94 	vm_map_lock(map);
95 
96 	base = round_page((vm_offset_t) vm->vm_daddr);
97 	old = base + ctob(vm->vm_dsize);
98 	if (new > base) {
99 		/*
100 		 * Check the resource limit, but allow a process to reduce
101 		 * its usage, even if it remains over the limit.
102 		 */
103 		if (new - base > datalim && new > old) {
104 			error = ENOMEM;
105 			goto done;
106 		}
107 		if (new > vm_map_max(map)) {
108 			error = ENOMEM;
109 			goto done;
110 		}
111 	} else if (new < base) {
112 		/*
113 		 * This is simply an invalid value.  If someone wants to
114 		 * do fancy address space manipulations, mmap and munmap
115 		 * can do most of what the user would want.
116 		 */
117 		error = EINVAL;
118 		goto done;
119 	}
120 	if (new > old) {
121 		if (!old_mlock && map->flags & MAP_WIREFUTURE) {
122 			if (ptoa(pmap_wired_count(map->pmap)) +
123 			    (new - old) > lmemlim) {
124 				error = ENOMEM;
125 				goto done;
126 			}
127 		}
128 		if (map->size + (new - old) > vmemlim) {
129 			error = ENOMEM;
130 			goto done;
131 		}
132 #ifdef RACCT
133 		if (racct_enable) {
134 			PROC_LOCK(td->td_proc);
135 			error = racct_set(td->td_proc, RACCT_DATA, new - base);
136 			if (error != 0) {
137 				PROC_UNLOCK(td->td_proc);
138 				error = ENOMEM;
139 				goto done;
140 			}
141 			error = racct_set(td->td_proc, RACCT_VMEM,
142 			    map->size + (new - old));
143 			if (error != 0) {
144 				racct_set_force(td->td_proc, RACCT_DATA,
145 				    old - base);
146 				PROC_UNLOCK(td->td_proc);
147 				error = ENOMEM;
148 				goto done;
149 			}
150 			if (!old_mlock && map->flags & MAP_WIREFUTURE) {
151 				error = racct_set(td->td_proc, RACCT_MEMLOCK,
152 				    ptoa(pmap_wired_count(map->pmap)) +
153 				    (new - old));
154 				if (error != 0) {
155 					racct_set_force(td->td_proc, RACCT_DATA,
156 					    old - base);
157 					racct_set_force(td->td_proc, RACCT_VMEM,
158 					    map->size);
159 					PROC_UNLOCK(td->td_proc);
160 					error = ENOMEM;
161 					goto done;
162 				}
163 			}
164 			PROC_UNLOCK(td->td_proc);
165 		}
166 #endif
167 		prot = VM_PROT_RW;
168 #ifdef COMPAT_FREEBSD32
169 #if defined(__amd64__)
170 		if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
171 			prot |= VM_PROT_EXECUTE;
172 #endif
173 #endif
174 		rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL, 0);
175 		if (rv != KERN_SUCCESS) {
176 #ifdef RACCT
177 			if (racct_enable) {
178 				PROC_LOCK(td->td_proc);
179 				racct_set_force(td->td_proc,
180 				    RACCT_DATA, old - base);
181 				racct_set_force(td->td_proc,
182 				    RACCT_VMEM, map->size);
183 				if (!old_mlock && map->flags & MAP_WIREFUTURE) {
184 					racct_set_force(td->td_proc,
185 					    RACCT_MEMLOCK,
186 					    ptoa(pmap_wired_count(map->pmap)));
187 				}
188 				PROC_UNLOCK(td->td_proc);
189 			}
190 #endif
191 			error = ENOMEM;
192 			goto done;
193 		}
194 		vm->vm_dsize += btoc(new - old);
195 		/*
196 		 * Handle the MAP_WIREFUTURE case for legacy applications,
197 		 * by marking the newly mapped range of pages as wired.
198 		 * We are not required to perform a corresponding
199 		 * vm_map_unwire() before vm_map_delete() below, as
200 		 * it will forcibly unwire the pages in the range.
201 		 *
202 		 * XXX If the pages cannot be wired, no error is returned.
203 		 */
204 		if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
205 			if (bootverbose)
206 				printf("obreak: MAP_WIREFUTURE set\n");
207 			do_map_wirefuture = TRUE;
208 		}
209 	} else if (new < old) {
210 		rv = vm_map_delete(map, new, old);
211 		if (rv != KERN_SUCCESS) {
212 			error = ENOMEM;
213 			goto done;
214 		}
215 		vm->vm_dsize -= btoc(old - new);
216 #ifdef RACCT
217 		if (racct_enable) {
218 			PROC_LOCK(td->td_proc);
219 			racct_set_force(td->td_proc, RACCT_DATA, new - base);
220 			racct_set_force(td->td_proc, RACCT_VMEM, map->size);
221 			if (!old_mlock && map->flags & MAP_WIREFUTURE) {
222 				racct_set_force(td->td_proc, RACCT_MEMLOCK,
223 				    ptoa(pmap_wired_count(map->pmap)));
224 			}
225 			PROC_UNLOCK(td->td_proc);
226 		}
227 #endif
228 	}
229 done:
230 	vm_map_unlock(map);
231 
232 	if (do_map_wirefuture)
233 		(void) vm_map_wire(map, old, new,
234 		    VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
235 
236 	return (error);
237 }
238 
239 #ifndef _SYS_SYSPROTO_H_
240 struct ovadvise_args {
241 	int anom;
242 };
243 #endif
244 
245 /*
246  * MPSAFE
247  */
248 /* ARGSUSED */
249 int
250 sys_ovadvise(td, uap)
251 	struct thread *td;
252 	struct ovadvise_args *uap;
253 {
254 	/* START_GIANT_OPTIONAL */
255 	/* END_GIANT_OPTIONAL */
256 	return (EINVAL);
257 }
258