1/*
2 * Copyright (c) 1988 University of Utah.
3 * Copyright (c) 1991, 1993
4 * The Regents of the University of California. 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 *
40 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
| 1/*
2 * Copyright (c) 1988 University of Utah.
3 * Copyright (c) 1991, 1993
4 * The Regents of the University of California. 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 *
40 * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
|
41 * $FreeBSD: head/sys/vm/vm_unix.c 50477 1999-08-28 01:08:13Z peter $
| 41 * $FreeBSD: head/sys/vm/vm_unix.c 52635 1999-10-29 18:09:36Z phk $
|
42 */
43
44/*
45 * Traditional sbrk/grow interface to VM
46 */
47#include <sys/param.h>
48#include <sys/sysproto.h>
49#include <sys/proc.h>
50#include <sys/resourcevar.h>
51
52#include <vm/vm.h>
53#include <vm/vm_param.h>
54#include <sys/lock.h>
55#include <vm/pmap.h>
56#include <vm/vm_map.h>
57#include <vm/swap_pager.h>
| 42 */
43
44/*
45 * Traditional sbrk/grow interface to VM
46 */
47#include <sys/param.h>
48#include <sys/sysproto.h>
49#include <sys/proc.h>
50#include <sys/resourcevar.h>
51
52#include <vm/vm.h>
53#include <vm/vm_param.h>
54#include <sys/lock.h>
55#include <vm/pmap.h>
56#include <vm/vm_map.h>
57#include <vm/swap_pager.h>
|
58#include <vm/vm_prot.h>
| |
59
60#ifndef _SYS_SYSPROTO_H_
61struct obreak_args {
62 char *nsize;
63};
64#endif
65
66/* ARGSUSED */
67int
68obreak(p, uap)
69 struct proc *p;
70 struct obreak_args *uap;
71{
72 register struct vmspace *vm = p->p_vmspace;
73 vm_offset_t new, old, base;
74 int rv;
75
76 base = round_page((vm_offset_t) vm->vm_daddr);
77 new = round_page((vm_offset_t)uap->nsize);
78 if (new > base) {
79 if ((new - base) > (unsigned) p->p_rlimit[RLIMIT_DATA].rlim_cur)
80 return ENOMEM;
81 if (new >= VM_MAXUSER_ADDRESS)
82 return (ENOMEM);
83 } else if (new < base) {
84 /*
85 * This is simply an invalid value. If someone wants to
86 * do fancy address space manipulations, mmap and munmap
87 * can do most of what the user would want.
88 */
89 return EINVAL;
90 }
91
92 old = base + ctob(vm->vm_dsize);
93
94 if (new > old) {
95 vm_size_t diff;
96
97 diff = new - old;
98 rv = vm_map_find(&vm->vm_map, NULL, 0, &old, diff, FALSE,
99 VM_PROT_ALL, VM_PROT_ALL, 0);
100 if (rv != KERN_SUCCESS) {
101 return (ENOMEM);
102 }
103 vm->vm_dsize += btoc(diff);
104 } else if (new < old) {
105 rv = vm_map_remove(&vm->vm_map, new, old);
106 if (rv != KERN_SUCCESS) {
107 return (ENOMEM);
108 }
109 vm->vm_dsize -= btoc(old - new);
110 }
111 return (0);
112}
113
114#ifndef _SYS_SYSPROTO_H_
115struct ovadvise_args {
116 int anom;
117};
118#endif
119
120/* ARGSUSED */
121int
122ovadvise(p, uap)
123 struct proc *p;
124 struct ovadvise_args *uap;
125{
126
127 return (EINVAL);
128}
| 58
59#ifndef _SYS_SYSPROTO_H_
60struct obreak_args {
61 char *nsize;
62};
63#endif
64
65/* ARGSUSED */
66int
67obreak(p, uap)
68 struct proc *p;
69 struct obreak_args *uap;
70{
71 register struct vmspace *vm = p->p_vmspace;
72 vm_offset_t new, old, base;
73 int rv;
74
75 base = round_page((vm_offset_t) vm->vm_daddr);
76 new = round_page((vm_offset_t)uap->nsize);
77 if (new > base) {
78 if ((new - base) > (unsigned) p->p_rlimit[RLIMIT_DATA].rlim_cur)
79 return ENOMEM;
80 if (new >= VM_MAXUSER_ADDRESS)
81 return (ENOMEM);
82 } else if (new < base) {
83 /*
84 * This is simply an invalid value. If someone wants to
85 * do fancy address space manipulations, mmap and munmap
86 * can do most of what the user would want.
87 */
88 return EINVAL;
89 }
90
91 old = base + ctob(vm->vm_dsize);
92
93 if (new > old) {
94 vm_size_t diff;
95
96 diff = new - old;
97 rv = vm_map_find(&vm->vm_map, NULL, 0, &old, diff, FALSE,
98 VM_PROT_ALL, VM_PROT_ALL, 0);
99 if (rv != KERN_SUCCESS) {
100 return (ENOMEM);
101 }
102 vm->vm_dsize += btoc(diff);
103 } else if (new < old) {
104 rv = vm_map_remove(&vm->vm_map, new, old);
105 if (rv != KERN_SUCCESS) {
106 return (ENOMEM);
107 }
108 vm->vm_dsize -= btoc(old - new);
109 }
110 return (0);
111}
112
113#ifndef _SYS_SYSPROTO_H_
114struct ovadvise_args {
115 int anom;
116};
117#endif
118
119/* ARGSUSED */
120int
121ovadvise(p, uap)
122 struct proc *p;
123 struct ovadvise_args *uap;
124{
125
126 return (EINVAL);
127}
|