![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to vm_unix.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / vm|
Return to vm_unix.c CVS log | Up to [Net/2] / Net2 / vm |
1.1 root 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: *
38: * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
39: *
1.1.1.3 ! root 40: * from: @(#)vm_unix.c 7.2 (Berkeley) 4/20/91
! 41: * vm_unix.c,v 1.3 1993/07/17 16:03:17 mycroft Exp
1.1 root 42: */
43:
44: /*
45: * Traditional sbrk/grow interface to VM
46: */
47: #include "param.h"
48: #include "systm.h"
49: #include "proc.h"
50: #include "resourcevar.h"
51:
52: #include "vm.h"
53:
1.1.1.3 ! root 54: struct obreak_args {
! 55: char *nsiz;
! 56: };
! 57:
1.1 root 58: /* ARGSUSED */
59: obreak(p, uap, retval)
60: struct proc *p;
1.1.1.3 ! root 61: struct obreak_args *uap;
1.1 root 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: */
98: grow(p, sp)
99: struct proc *p;
100: unsigned sp;
101: {
102: register struct vmspace *vm = p->p_vmspace;
103: register int si;
104:
105: /*
106: * For user defined stacks (from sendsig).
107: */
108: if (sp < (unsigned)vm->vm_maxsaddr)
109: return (0);
110: /*
111: * For common case of already allocated (from trap).
112: */
1.1.1.2 root 113: if (sp >= (unsigned)vm->vm_maxsaddr + MAXSSIZ - ctob(vm->vm_ssize))
1.1 root 114: return (1);
115: /*
116: * Really need to check vs limit and increment stack size if ok.
117: */
1.1.1.2 root 118: si = clrnd(btoc(vm->vm_maxsaddr + MAXSSIZ - sp) - vm->vm_ssize);
1.1 root 119: if (vm->vm_ssize + si > btoc(p->p_rlimit[RLIMIT_STACK].rlim_cur))
120: return (0);
121: vm->vm_ssize += si;
122: return (1);
123: }
124:
1.1.1.3 ! root 125: struct ovadvise_args {
! 126: int anom;
! 127: };
! 128:
1.1 root 129: /* ARGSUSED */
130: ovadvise(p, uap, retval)
131: struct proc *p;
1.1.1.3 ! root 132: struct ovadvise_args *uap;
1.1 root 133: int *retval;
134: {
135:
136: return (EINVAL);
137: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.