uvm_unix.c revision 1.3 1 1.2 thorpej /* $NetBSD: uvm_unix.c,v 1.3 1998/02/07 11:09:50 mrg Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg * XXXCDC: "ROUGH DRAFT" QUALITY UVM PRE-RELEASE FILE!
5 1.1 mrg * >>>USE AT YOUR OWN RISK, WORK IS NOT FINISHED<<<
6 1.1 mrg */
7 1.1 mrg /*
8 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
9 1.1 mrg * Copyright (c) 1991, 1993 The Regents of the University of California.
10 1.1 mrg * Copyright (c) 1988 University of Utah.
11 1.1 mrg *
12 1.1 mrg * All rights reserved.
13 1.1 mrg *
14 1.1 mrg * This code is derived from software contributed to Berkeley by
15 1.1 mrg * the Systems Programming Group of the University of Utah Computer
16 1.1 mrg * Science Department.
17 1.1 mrg *
18 1.1 mrg * Redistribution and use in source and binary forms, with or without
19 1.1 mrg * modification, are permitted provided that the following conditions
20 1.1 mrg * are met:
21 1.1 mrg * 1. Redistributions of source code must retain the above copyright
22 1.1 mrg * notice, this list of conditions and the following disclaimer.
23 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
24 1.1 mrg * notice, this list of conditions and the following disclaimer in the
25 1.1 mrg * documentation and/or other materials provided with the distribution.
26 1.1 mrg * 3. All advertising materials mentioning features or use of this software
27 1.1 mrg * must display the following acknowledgement:
28 1.1 mrg * This product includes software developed by Charles D. Cranor,
29 1.1 mrg * Washington University, the University of California, Berkeley and
30 1.1 mrg * its contributors.
31 1.1 mrg * 4. Neither the name of the University nor the names of its contributors
32 1.1 mrg * may be used to endorse or promote products derived from this software
33 1.1 mrg * without specific prior written permission.
34 1.1 mrg *
35 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
36 1.1 mrg * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
37 1.1 mrg * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
38 1.1 mrg * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
39 1.1 mrg * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
40 1.1 mrg * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
41 1.1 mrg * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
42 1.1 mrg * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
43 1.1 mrg * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
44 1.1 mrg * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
45 1.1 mrg * SUCH DAMAGE.
46 1.1 mrg *
47 1.1 mrg * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
48 1.1 mrg * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
49 1.3 mrg * from: Id: uvm_unix.c,v 1.1.2.2 1997/08/25 18:52:30 chuck Exp
50 1.1 mrg */
51 1.1 mrg
52 1.1 mrg /*
53 1.1 mrg * uvm_unix.c: traditional sbrk/grow interface to vm.
54 1.1 mrg */
55 1.1 mrg
56 1.1 mrg #include <sys/param.h>
57 1.1 mrg #include <sys/systm.h>
58 1.1 mrg #include <sys/proc.h>
59 1.1 mrg #include <sys/resourcevar.h>
60 1.1 mrg #include <sys/vnode.h>
61 1.1 mrg #include <sys/core.h>
62 1.1 mrg
63 1.1 mrg #include <sys/mount.h>
64 1.1 mrg #include <sys/syscallargs.h>
65 1.1 mrg
66 1.1 mrg #include <vm/vm.h>
67 1.1 mrg #include <uvm/uvm.h>
68 1.1 mrg
69 1.1 mrg
70 1.1 mrg /*
71 1.1 mrg * sys_obreak: set break
72 1.1 mrg */
73 1.1 mrg
74 1.1 mrg int sys_obreak(p, v, retval)
75 1.1 mrg
76 1.1 mrg struct proc *p;
77 1.1 mrg void *v;
78 1.1 mrg register_t *retval;
79 1.1 mrg {
80 1.1 mrg struct sys_obreak_args /* {
81 1.1 mrg syscallarg(char *) nsize;
82 1.1 mrg } */ *uap = v;
83 1.1 mrg register struct vmspace *vm = p->p_vmspace;
84 1.1 mrg vm_offset_t new, old;
85 1.1 mrg int rv;
86 1.1 mrg register int diff;
87 1.1 mrg
88 1.1 mrg old = (vm_offset_t)vm->vm_daddr;
89 1.1 mrg new = round_page(SCARG(uap, nsize));
90 1.1 mrg if ((int)(new - old) > p->p_rlimit[RLIMIT_DATA].rlim_cur)
91 1.1 mrg return(ENOMEM);
92 1.1 mrg
93 1.1 mrg old = round_page(old + ctob(vm->vm_dsize));
94 1.1 mrg diff = new - old;
95 1.1 mrg
96 1.1 mrg /*
97 1.1 mrg * grow or shrink?
98 1.1 mrg */
99 1.1 mrg
100 1.1 mrg if (diff > 0) {
101 1.1 mrg
102 1.1 mrg rv = uvm_map(&vm->vm_map, &old, diff, NULL, UVM_UNKNOWN_OFFSET,
103 1.1 mrg UVM_MAPFLAG(UVM_PROT_ALL, UVM_PROT_ALL, UVM_INH_COPY, UVM_ADV_NORMAL,
104 1.1 mrg UVM_FLAG_AMAPPAD|UVM_FLAG_FIXED|UVM_FLAG_OVERLAY|UVM_FLAG_COPYONW));
105 1.1 mrg
106 1.1 mrg if (rv != KERN_SUCCESS) {
107 1.1 mrg uprintf("sbrk: grow failed, return = %d\n", rv);
108 1.1 mrg return(ENOMEM);
109 1.1 mrg }
110 1.1 mrg vm->vm_dsize += btoc(diff);
111 1.1 mrg
112 1.1 mrg } else if (diff < 0) {
113 1.1 mrg
114 1.1 mrg diff = -diff;
115 1.1 mrg rv = uvm_deallocate(&vm->vm_map, new, diff);
116 1.1 mrg if (rv != KERN_SUCCESS) {
117 1.1 mrg uprintf("sbrk: shrink failed, return = %d\n", rv);
118 1.1 mrg return(ENOMEM);
119 1.1 mrg }
120 1.1 mrg vm->vm_dsize -= btoc(diff);
121 1.1 mrg
122 1.1 mrg }
123 1.1 mrg return(0);
124 1.1 mrg }
125 1.1 mrg
126 1.1 mrg /*
127 1.1 mrg * uvm_grow: enlarge the "stack segment" to include sp.
128 1.1 mrg */
129 1.1 mrg
130 1.1 mrg int uvm_grow(p, sp)
131 1.1 mrg
132 1.1 mrg struct proc *p;
133 1.1 mrg vm_offset_t sp;
134 1.1 mrg
135 1.1 mrg {
136 1.1 mrg register struct vmspace *vm = p->p_vmspace;
137 1.1 mrg register int si;
138 1.1 mrg
139 1.1 mrg /*
140 1.1 mrg * For user defined stacks (from sendsig).
141 1.1 mrg */
142 1.1 mrg if (sp < (vm_offset_t)vm->vm_maxsaddr)
143 1.1 mrg return (0);
144 1.1 mrg
145 1.1 mrg /*
146 1.1 mrg * For common case of already allocated (from trap).
147 1.1 mrg */
148 1.1 mrg if (sp >= USRSTACK - ctob(vm->vm_ssize))
149 1.1 mrg return (1);
150 1.1 mrg
151 1.1 mrg /*
152 1.1 mrg * Really need to check vs limit and increment stack size if ok.
153 1.1 mrg */
154 1.1 mrg si = clrnd(btoc(USRSTACK-sp) - vm->vm_ssize);
155 1.1 mrg if (vm->vm_ssize + si > btoc(p->p_rlimit[RLIMIT_STACK].rlim_cur))
156 1.1 mrg return (0);
157 1.1 mrg vm->vm_ssize += si;
158 1.1 mrg return (1);
159 1.1 mrg }
160 1.1 mrg
161 1.1 mrg /*
162 1.1 mrg * sys_oadvise: old advice system call
163 1.1 mrg */
164 1.1 mrg
165 1.1 mrg /* ARGSUSED */
166 1.1 mrg int sys_ovadvise(p, v, retval)
167 1.1 mrg
168 1.1 mrg struct proc *p;
169 1.1 mrg void *v;
170 1.1 mrg register_t *retval;
171 1.1 mrg
172 1.1 mrg {
173 1.1 mrg #if 0
174 1.1 mrg struct sys_ovadvise_args /* {
175 1.1 mrg syscallarg(int) anom;
176 1.1 mrg } */ *uap = v;
177 1.1 mrg #endif
178 1.1 mrg return (EINVAL);
179 1.1 mrg }
180 1.1 mrg
181 1.1 mrg /*
182 1.1 mrg * uvm_coredump: dump core!
183 1.1 mrg */
184 1.1 mrg
185 1.1 mrg int uvm_coredump(p, vp, cred, chdr)
186 1.1 mrg
187 1.1 mrg struct proc *p;
188 1.1 mrg struct vnode *vp;
189 1.1 mrg struct ucred *cred;
190 1.1 mrg struct core *chdr;
191 1.1 mrg
192 1.1 mrg {
193 1.1 mrg register struct vmspace *vm = p->p_vmspace;
194 1.1 mrg register vm_map_t map = &vm->vm_map;
195 1.1 mrg register vm_map_entry_t entry;
196 1.1 mrg vm_offset_t start, end;
197 1.1 mrg struct coreseg cseg;
198 1.1 mrg off_t offset;
199 1.1 mrg int flag, error = 0;
200 1.1 mrg
201 1.1 mrg if (!map->is_main_map) {
202 1.1 mrg #ifdef DEBUG
203 1.1 mrg uprintf(
204 1.1 mrg "uvm_coredump: %s map 0x%lx: pmap=0x%lx,ref=%d,nentries=%d,version=%d\n",
205 1.1 mrg (map->is_main_map ? "Task" : "Share"),
206 1.1 mrg (long)map, (long)(map->pmap),
207 1.1 mrg map->ref_count, map->nentries,
208 1.1 mrg map->timestamp);
209 1.1 mrg #endif
210 1.1 mrg return EIO;
211 1.1 mrg }
212 1.1 mrg
213 1.1 mrg offset = chdr->c_hdrsize + chdr->c_seghdrsize + chdr->c_cpusize;
214 1.1 mrg
215 1.1 mrg for (entry = map->header.next; entry != &map->header;
216 1.1 mrg entry = entry->next) {
217 1.1 mrg
218 1.1 mrg if (UVM_ET_ISMAP(entry)) {
219 1.1 mrg #ifdef DEBUG
220 1.1 mrg uprintf("uvm_coredump: entry: share=0x%lx, offset=0x%lx\n",
221 1.1 mrg (long) entry->object.share_map,
222 1.1 mrg (long) entry->offset);
223 1.1 mrg #endif
224 1.1 mrg continue;
225 1.1 mrg }
226 1.1 mrg
227 1.1 mrg if (!(entry->protection & VM_PROT_WRITE))
228 1.1 mrg continue;
229 1.1 mrg
230 1.1 mrg start = entry->start;
231 1.1 mrg end = entry->end;
232 1.1 mrg
233 1.1 mrg if (start >= VM_MAXUSER_ADDRESS)
234 1.1 mrg continue;
235 1.1 mrg
236 1.1 mrg if (end > VM_MAXUSER_ADDRESS)
237 1.1 mrg end = VM_MAXUSER_ADDRESS;
238 1.1 mrg
239 1.1 mrg if (start >= (vm_offset_t)vm->vm_maxsaddr) {
240 1.1 mrg flag = CORE_STACK;
241 1.1 mrg start = trunc_page(USRSTACK - ctob(vm->vm_ssize));
242 1.1 mrg if (start >= end)
243 1.1 mrg continue;
244 1.1 mrg } else
245 1.1 mrg flag = CORE_DATA;
246 1.1 mrg
247 1.1 mrg /*
248 1.1 mrg * Set up a new core file segment.
249 1.1 mrg */
250 1.1 mrg CORE_SETMAGIC(cseg, CORESEGMAGIC, CORE_GETMID(*chdr), flag);
251 1.1 mrg cseg.c_addr = start;
252 1.1 mrg cseg.c_size = end - start;
253 1.1 mrg
254 1.1 mrg error = vn_rdwr(UIO_WRITE, vp,
255 1.1 mrg (caddr_t)&cseg, chdr->c_seghdrsize,
256 1.1 mrg offset, UIO_SYSSPACE,
257 1.1 mrg IO_NODELOCKED|IO_UNIT, cred, (int *) NULL, p);
258 1.1 mrg if (error)
259 1.1 mrg break;
260 1.1 mrg
261 1.1 mrg offset += chdr->c_seghdrsize;
262 1.1 mrg error = vn_rdwr(UIO_WRITE, vp,
263 1.1 mrg (caddr_t)cseg.c_addr, (int)cseg.c_size,
264 1.1 mrg offset, UIO_USERSPACE,
265 1.1 mrg IO_NODELOCKED|IO_UNIT, cred, (int *) NULL, p);
266 1.1 mrg if (error)
267 1.1 mrg break;
268 1.1 mrg
269 1.1 mrg offset += cseg.c_size;
270 1.1 mrg chdr->c_nseg++;
271 1.1 mrg }
272 1.1 mrg
273 1.1 mrg return error;
274 1.1 mrg }
275 1.1 mrg
276