Make the LINT kernel compile with -W -Wreturn-type -Wcomment -Werror, and
[unix-history] / sys / vm / vm_unix.c
CommitLineData
15637ed4
RG
1/*
2 * Copyright (c) 1988 University of Utah.
3 * Copyright (c) 1991 The Regents of the University of California.
4 * 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 *
1284e777
RG
38 * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
39 * from: @(#)vm_unix.c 7.2 (Berkeley) 4/20/91
4c45483e 40 * $Id: vm_unix.c,v 1.3 1993/10/16 16:20:58 rgrimes Exp $
15637ed4
RG
41 */
42
43/*
44 * Traditional sbrk/grow interface to VM
45 */
46#include "param.h"
47#include "systm.h"
48#include "proc.h"
49#include "resourcevar.h"
50
51#include "vm.h"
52
3c7eb27c
DG
53struct obreak_args {
54 char *nsiz;
55};
56
15637ed4 57/* ARGSUSED */
4c45483e 58int
15637ed4
RG
59obreak(p, uap, retval)
60 struct proc *p;
3c7eb27c 61 struct obreak_args *uap;
15637ed4
RG
62 int *retval;
63{
64 register struct vmspace *vm = p->p_vmspace;
65 vm_offset_t new, old;
66 int rv;
67 register int diff;
68
69 old = (vm_offset_t)vm->vm_daddr;
70 new = round_page(uap->nsiz);
71 if ((int)(new - old) > p->p_rlimit[RLIMIT_DATA].rlim_cur)
72 return(ENOMEM);
73 old = round_page(old + ctob(vm->vm_dsize));
74 diff = new - old;
75 if (diff > 0) {
76 rv = vm_allocate(&vm->vm_map, &old, diff, FALSE);
77 if (rv != KERN_SUCCESS) {
78 uprintf("sbrk: grow failed, return = %d\n", rv);
79 return(ENOMEM);
80 }
81 vm->vm_dsize += btoc(diff);
82 } else if (diff < 0) {
83 diff = -diff;
84 rv = vm_deallocate(&vm->vm_map, new, diff);
85 if (rv != KERN_SUCCESS) {
86 uprintf("sbrk: shrink failed, return = %d\n", rv);
87 return(ENOMEM);
88 }
89 vm->vm_dsize -= btoc(diff);
90 }
91 return(0);
92}
93
94/*
95 * Enlarge the "stack segment" to include the specified
96 * stack pointer for the process.
97 */
4c45483e 98int
15637ed4
RG
99grow(p, sp)
100 struct proc *p;
101 unsigned sp;
102{
103 register struct vmspace *vm = p->p_vmspace;
104 register int si;
105
106 /*
107 * For user defined stacks (from sendsig).
108 */
109 if (sp < (unsigned)vm->vm_maxsaddr)
110 return (0);
111 /*
112 * For common case of already allocated (from trap).
113 */
114 if (sp >= (unsigned)vm->vm_maxsaddr + MAXSSIZ - ctob(vm->vm_ssize))
115 return (1);
116 /*
117 * Really need to check vs limit and increment stack size if ok.
118 */
119 si = clrnd(btoc(vm->vm_maxsaddr + MAXSSIZ - sp) - vm->vm_ssize);
120 if (vm->vm_ssize + si > btoc(p->p_rlimit[RLIMIT_STACK].rlim_cur))
121 return (0);
122 vm->vm_ssize += si;
123 return (1);
124}
125
3c7eb27c
DG
126struct ovadvise_args {
127 int anom;
128};
129
15637ed4 130/* ARGSUSED */
4c45483e 131int
15637ed4
RG
132ovadvise(p, uap, retval)
133 struct proc *p;
3c7eb27c 134 struct ovadvise_args *uap;
15637ed4
RG
135 int *retval;
136{
137
138 return (EINVAL);
139}