uvm_unix.c revision 1.48 1 1.48 joerg /* $NetBSD: uvm_unix.c,v 1.48 2017/05/06 21:34:52 joerg Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
5 1.22 chs * Copyright (c) 1991, 1993 The Regents of the University of California.
6 1.1 mrg * Copyright (c) 1988 University of Utah.
7 1.1 mrg *
8 1.1 mrg * All rights reserved.
9 1.1 mrg *
10 1.1 mrg * This code is derived from software contributed to Berkeley by
11 1.1 mrg * the Systems Programming Group of the University of Utah Computer
12 1.1 mrg * Science Department.
13 1.1 mrg *
14 1.1 mrg * Redistribution and use in source and binary forms, with or without
15 1.1 mrg * modification, are permitted provided that the following conditions
16 1.1 mrg * are met:
17 1.1 mrg * 1. Redistributions of source code must retain the above copyright
18 1.1 mrg * notice, this list of conditions and the following disclaimer.
19 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
20 1.1 mrg * notice, this list of conditions and the following disclaimer in the
21 1.1 mrg * documentation and/or other materials provided with the distribution.
22 1.44 chuck * 3. Neither the name of the University nor the names of its contributors
23 1.1 mrg * may be used to endorse or promote products derived from this software
24 1.1 mrg * without specific prior written permission.
25 1.1 mrg *
26 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 mrg * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 mrg * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 mrg * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 mrg * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 mrg * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 mrg * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 mrg * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 mrg * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 mrg * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 mrg * SUCH DAMAGE.
37 1.1 mrg *
38 1.1 mrg * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
39 1.1 mrg * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
40 1.3 mrg * from: Id: uvm_unix.c,v 1.1.2.2 1997/08/25 18:52:30 chuck Exp
41 1.1 mrg */
42 1.1 mrg
43 1.1 mrg /*
44 1.1 mrg * uvm_unix.c: traditional sbrk/grow interface to vm.
45 1.1 mrg */
46 1.25 lukem
47 1.25 lukem #include <sys/cdefs.h>
48 1.48 joerg __KERNEL_RCSID(0, "$NetBSD: uvm_unix.c,v 1.48 2017/05/06 21:34:52 joerg Exp $");
49 1.33 elad
50 1.33 elad #include "opt_pax.h"
51 1.1 mrg
52 1.1 mrg #include <sys/param.h>
53 1.1 mrg #include <sys/systm.h>
54 1.1 mrg #include <sys/proc.h>
55 1.1 mrg #include <sys/resourcevar.h>
56 1.1 mrg
57 1.1 mrg #include <sys/mount.h>
58 1.1 mrg #include <sys/syscallargs.h>
59 1.33 elad #include <sys/pax.h>
60 1.33 elad
61 1.1 mrg #include <uvm/uvm.h>
62 1.1 mrg
63 1.1 mrg /*
64 1.1 mrg * sys_obreak: set break
65 1.1 mrg */
66 1.1 mrg
67 1.4 mrg int
68 1.39 dsl sys_obreak(struct lwp *l, const struct sys_obreak_args *uap, register_t *retval)
69 1.1 mrg {
70 1.39 dsl /* {
71 1.4 mrg syscallarg(char *) nsize;
72 1.39 dsl } */
73 1.27 thorpej struct proc *p = l->l_proc;
74 1.12 augustss struct vmspace *vm = p->p_vmspace;
75 1.45 matt vaddr_t nbreak, obreak;
76 1.19 chs int error;
77 1.4 mrg
78 1.40 ad mutex_enter(&p->p_auxlock);
79 1.45 matt obreak = (vaddr_t)vm->vm_daddr;
80 1.45 matt nbreak = round_page((vaddr_t)SCARG(uap, nsize));
81 1.45 matt if (nbreak == 0
82 1.45 matt || ((nbreak - obreak) > p->p_rlimit[RLIMIT_DATA].rlim_cur
83 1.45 matt && nbreak > obreak)) {
84 1.40 ad mutex_exit(&p->p_auxlock);
85 1.14 thorpej return (ENOMEM);
86 1.40 ad }
87 1.4 mrg
88 1.45 matt obreak = round_page(obreak + ptoa(vm->vm_dsize));
89 1.4 mrg
90 1.45 matt if (nbreak == obreak) {
91 1.40 ad mutex_exit(&p->p_auxlock);
92 1.14 thorpej return (0);
93 1.40 ad }
94 1.14 thorpej
95 1.4 mrg /*
96 1.4 mrg * grow or shrink?
97 1.4 mrg */
98 1.29 chs
99 1.45 matt if (nbreak > obreak) {
100 1.48 joerg vm_prot_t prot = UVM_PROT_RW;
101 1.48 joerg vm_prot_t maxprot;
102 1.48 joerg
103 1.48 joerg maxprot = PAX_MPROTECT_MAXPROTECT(l, prot, 0, UVM_PROT_ALL);
104 1.33 elad
105 1.45 matt error = uvm_map(&vm->vm_map, &obreak, nbreak - obreak, NULL,
106 1.19 chs UVM_UNKNOWN_OFFSET, 0,
107 1.33 elad UVM_MAPFLAG(prot, maxprot,
108 1.29 chs UVM_INH_COPY,
109 1.29 chs UVM_ADV_NORMAL, UVM_FLAG_AMAPPAD|UVM_FLAG_FIXED|
110 1.29 chs UVM_FLAG_OVERLAY|UVM_FLAG_COPYONW));
111 1.19 chs if (error) {
112 1.41 christos #ifdef DEBUG
113 1.43 matt uprintf("sbrk: grow %#"PRIxVADDR" failed, error = %d\n",
114 1.45 matt nbreak - obreak, error);
115 1.41 christos #endif
116 1.40 ad mutex_exit(&p->p_auxlock);
117 1.28 simonb return (error);
118 1.4 mrg }
119 1.45 matt vm->vm_dsize += atop(nbreak - obreak);
120 1.14 thorpej } else {
121 1.45 matt uvm_deallocate(&vm->vm_map, nbreak, obreak - nbreak);
122 1.45 matt vm->vm_dsize -= atop(obreak - nbreak);
123 1.14 thorpej }
124 1.40 ad mutex_exit(&p->p_auxlock);
125 1.40 ad
126 1.28 simonb return (0);
127 1.1 mrg }
128 1.1 mrg
129 1.1 mrg /*
130 1.1 mrg * uvm_grow: enlarge the "stack segment" to include sp.
131 1.1 mrg */
132 1.1 mrg
133 1.4 mrg int
134 1.31 thorpej uvm_grow(struct proc *p, vaddr_t sp)
135 1.1 mrg {
136 1.12 augustss struct vmspace *vm = p->p_vmspace;
137 1.30 jdolecek vsize_t nss;
138 1.1 mrg
139 1.4 mrg /*
140 1.4 mrg * For user defined stacks (from sendsig).
141 1.4 mrg */
142 1.37 skrll #ifdef __MACHINE_STACK_GROWS_UP
143 1.37 skrll if (sp < (vaddr_t)vm->vm_minsaddr)
144 1.37 skrll #else
145 1.6 eeh if (sp < (vaddr_t)vm->vm_maxsaddr)
146 1.37 skrll #endif
147 1.4 mrg return (0);
148 1.4 mrg
149 1.4 mrg /*
150 1.4 mrg * For common case of already allocated (from trap).
151 1.4 mrg */
152 1.37 skrll #ifdef __MACHINE_STACK_GROWS_UP
153 1.37 skrll if (sp < USRSTACK + ctob(vm->vm_ssize))
154 1.37 skrll #else
155 1.4 mrg if (sp >= USRSTACK - ctob(vm->vm_ssize))
156 1.37 skrll #endif
157 1.4 mrg return (1);
158 1.4 mrg
159 1.4 mrg /*
160 1.4 mrg * Really need to check vs limit and increment stack size if ok.
161 1.4 mrg */
162 1.37 skrll #ifdef __MACHINE_STACK_GROWS_UP
163 1.37 skrll nss = btoc(sp - USRSTACK);
164 1.37 skrll #else
165 1.30 jdolecek nss = btoc(USRSTACK - sp);
166 1.37 skrll #endif
167 1.30 jdolecek if (nss > btoc(p->p_rlimit[RLIMIT_STACK].rlim_cur))
168 1.4 mrg return (0);
169 1.30 jdolecek vm->vm_ssize = nss;
170 1.4 mrg return (1);
171 1.1 mrg }
172 1.1 mrg
173 1.1 mrg /*
174 1.1 mrg * sys_oadvise: old advice system call
175 1.1 mrg */
176 1.1 mrg
177 1.1 mrg /* ARGSUSED */
178 1.4 mrg int
179 1.39 dsl sys_ovadvise(struct lwp *l, const struct sys_ovadvise_args *uap, register_t *retval)
180 1.1 mrg {
181 1.1 mrg #if 0
182 1.39 dsl /* {
183 1.4 mrg syscallarg(int) anom;
184 1.39 dsl } */
185 1.1 mrg #endif
186 1.4 mrg
187 1.4 mrg return (EINVAL);
188 1.1 mrg }
189