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 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
39 *
40 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
41 */
42
43 /*
44 * Traditional sbrk/grow interface to VM
45 */
46
47 #include <sys/cdefs.h>
48 __FBSDID("$FreeBSD: releng/5.2/sys/vm/vm_unix.c 118771 2003-08-11 07:14:08Z bms $");
49
50 #include <sys/param.h>
51 #include <sys/lock.h>
52 #include <sys/mutex.h>
53 #include <sys/proc.h>
54 #include <sys/resourcevar.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 obreak(td, uap)
75 struct thread *td;
76 struct obreak_args *uap;
77 {
78 struct vmspace *vm = td->td_proc->p_vmspace;
79 vm_offset_t new, old, base;
80 int rv;
81 int error = 0;
82 boolean_t do_map_wirefuture;
83
84 do_map_wirefuture = FALSE;
85 new = round_page((vm_offset_t)uap->nsize);
86 vm_map_lock(&vm->vm_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 > td->td_proc->p_rlimit[RLIMIT_DATA].rlim_cur &&
96 new > old) {
97 error = ENOMEM;
98 goto done;
99 }
100 if (new > vm_map_max(&vm->vm_map)) {
101 error = ENOMEM;
102 goto done;
103 }
104 } else if (new < base) {
105 /*
106 * This is simply an invalid value. If someone wants to
107 * do fancy address space manipulations, mmap and munmap
108 * can do most of what the user would want.
109 */
110 error = EINVAL;
111 goto done;
112 }
113 if (new > old) {
114 if (vm->vm_map.size + (new - old) >
115 td->td_proc->p_rlimit[RLIMIT_VMEM].rlim_cur) {
116 error = ENOMEM;
117 goto done;
118 }
119 rv = vm_map_insert(&vm->vm_map, NULL, 0, old, new,
120 VM_PROT_ALL, VM_PROT_ALL, 0);
121 if (rv != KERN_SUCCESS) {
122 error = ENOMEM;
123 goto done;
124 }
125 vm->vm_dsize += btoc(new - old);
126 /*
127 * Handle the MAP_WIREFUTURE case for legacy applications,
128 * by marking the newly mapped range of pages as wired.
129 * We are not required to perform a corresponding
130 * vm_map_unwire() before vm_map_delete() below, as
131 * it will forcibly unwire the pages in the range.
132 *
133 * XXX If the pages cannot be wired, no error is returned.
134 */
135 if ((vm->vm_map.flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
136 if (bootverbose)
137 printf("obreak: MAP_WIREFUTURE set\n");
138 do_map_wirefuture = TRUE;
139 }
140 } else if (new < old) {
141 rv = vm_map_delete(&vm->vm_map, new, old);
142 if (rv != KERN_SUCCESS) {
143 error = ENOMEM;
144 goto done;
145 }
146 vm->vm_dsize -= btoc(old - new);
147 }
148 done:
149 vm_map_unlock(&vm->vm_map);
150
151 if (do_map_wirefuture)
152 (void) vm_map_wire(&vm->vm_map, old, new,
153 VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
154
155 return (error);
156 }
157
158 #ifndef _SYS_SYSPROTO_H_
159 struct ovadvise_args {
160 int anom;
161 };
162 #endif
163
164 /*
165 * MPSAFE
166 */
167 /* ARGSUSED */
168 int
169 ovadvise(td, uap)
170 struct thread *td;
171 struct ovadvise_args *uap;
172 {
173 /* START_GIANT_OPTIONAL */
174 /* END_GIANT_OPTIONAL */
175 return (EINVAL);
176 }
Cache object: 43283ef51eda624bc725971927d8c916
|