FreeBSD/Linux Kernel Cross Reference
sys/vm/vm_unix.c
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: releng/8.4/sys/vm/vm_unix.c 239342 2012-08-16 23:52:08Z obrien $");
47
48 #include <sys/param.h>
49 #include <sys/lock.h>
50 #include <sys/mutex.h>
51 #include <sys/proc.h>
52 #include <sys/resourcevar.h>
53 #include <sys/sysent.h>
54 #include <sys/sysproto.h>
55 #include <sys/systm.h>
56
57 #include <vm/vm.h>
58 #include <vm/vm_param.h>
59 #include <vm/pmap.h>
60 #include <vm/vm_map.h>
61
62 #ifndef _SYS_SYSPROTO_H_
63 struct obreak_args {
64 char *nsize;
65 };
66 #endif
67
68 /*
69 * MPSAFE
70 */
71 /* ARGSUSED */
72 int
73 obreak(td, uap)
74 struct thread *td;
75 struct obreak_args *uap;
76 {
77 struct vmspace *vm = td->td_proc->p_vmspace;
78 vm_offset_t new, old, base;
79 rlim_t datalim, vmemlim;
80 int prot, rv;
81 int error = 0;
82 boolean_t do_map_wirefuture;
83
84 PROC_LOCK(td->td_proc);
85 datalim = lim_cur(td->td_proc, RLIMIT_DATA);
86 vmemlim = lim_cur(td->td_proc, RLIMIT_VMEM);
87 PROC_UNLOCK(td->td_proc);
88
89 do_map_wirefuture = FALSE;
90 new = round_page((vm_offset_t)uap->nsize);
91 vm_map_lock(&vm->vm_map);
92
93 base = round_page((vm_offset_t) vm->vm_daddr);
94 old = base + ctob(vm->vm_dsize);
95 if (new > base) {
96 /*
97 * Check the resource limit, but allow a process to reduce
98 * its usage, even if it remains over the limit.
99 */
100 if (new - base > datalim && new > old) {
101 error = ENOMEM;
102 goto done;
103 }
104 if (new > vm_map_max(&vm->vm_map)) {
105 error = ENOMEM;
106 goto done;
107 }
108 } else if (new < base) {
109 /*
110 * This is simply an invalid value. If someone wants to
111 * do fancy address space manipulations, mmap and munmap
112 * can do most of what the user would want.
113 */
114 error = EINVAL;
115 goto done;
116 }
117 if (new > old) {
118 if (vm->vm_map.size + (new - old) > vmemlim) {
119 error = ENOMEM;
120 goto done;
121 }
122 prot = VM_PROT_RW;
123 #ifdef COMPAT_FREEBSD32
124 #if defined(__amd64__) || defined(__ia64__)
125 if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
126 prot |= VM_PROT_EXECUTE;
127 #endif
128 #endif
129 rv = vm_map_insert(&vm->vm_map, NULL, 0, old, new,
130 prot, VM_PROT_ALL, 0);
131 if (rv != KERN_SUCCESS) {
132 error = ENOMEM;
133 goto done;
134 }
135 vm->vm_dsize += btoc(new - old);
136 /*
137 * Handle the MAP_WIREFUTURE case for legacy applications,
138 * by marking the newly mapped range of pages as wired.
139 * We are not required to perform a corresponding
140 * vm_map_unwire() before vm_map_delete() below, as
141 * it will forcibly unwire the pages in the range.
142 *
143 * XXX If the pages cannot be wired, no error is returned.
144 */
145 if ((vm->vm_map.flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
146 if (bootverbose)
147 printf("obreak: MAP_WIREFUTURE set\n");
148 do_map_wirefuture = TRUE;
149 }
150 } else if (new < old) {
151 rv = vm_map_delete(&vm->vm_map, new, old);
152 if (rv != KERN_SUCCESS) {
153 error = ENOMEM;
154 goto done;
155 }
156 vm->vm_dsize -= btoc(old - new);
157 }
158 done:
159 vm_map_unlock(&vm->vm_map);
160
161 if (do_map_wirefuture)
162 (void) vm_map_wire(&vm->vm_map, old, new,
163 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
164
165 return (error);
166 }
167
168 #ifndef _SYS_SYSPROTO_H_
169 struct ovadvise_args {
170 int anom;
171 };
172 #endif
173
174 /*
175 * MPSAFE
176 */
177 /* ARGSUSED */
178 int
179 ovadvise(td, uap)
180 struct thread *td;
181 struct ovadvise_args *uap;
182 {
183 /* START_GIANT_OPTIONAL */
184 /* END_GIANT_OPTIONAL */
185 return (EINVAL);
186 }
Cache object: ad9c66731886f32dc3163e346abe8fa5
|