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