vm_unix.c revision 52973 
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 52973 1999-11-07 20:03:54Z alc $
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
58#ifndef _SYS_SYSPROTO_H_
59struct obreak_args {
60	char *nsize;
61};
62#endif
63
64/* ARGSUSED */
65int
66obreak(p, uap)
67	struct proc *p;
68	struct obreak_args *uap;
69{
70	register struct vmspace *vm = p->p_vmspace;
71	vm_offset_t new, old, base;
72	int rv;
73
74	base = round_page((vm_offset_t) vm->vm_daddr);
75	new = round_page((vm_offset_t)uap->nsize);
76	if (new > base) {
77		if ((new - base) > (unsigned) p->p_rlimit[RLIMIT_DATA].rlim_cur)
78			return ENOMEM;
79		if (new >= VM_MAXUSER_ADDRESS)
80			return (ENOMEM);
81	} else if (new < base) {
82		/*
83		 * This is simply an invalid value.  If someone wants to
84		 * do fancy address space manipulations, mmap and munmap
85		 * can do most of what the user would want.
86		 */
87		return EINVAL;
88	}
89
90	old = base + ctob(vm->vm_dsize);
91
92	if (new > old) {
93		vm_size_t diff;
94
95		diff = new - old;
96		rv = vm_map_find(&vm->vm_map, NULL, 0, &old, diff, FALSE,
97			VM_PROT_ALL, VM_PROT_ALL, 0);
98		if (rv != KERN_SUCCESS) {
99			return (ENOMEM);
100		}
101		vm->vm_dsize += btoc(diff);
102	} else if (new < old) {
103		rv = vm_map_remove(&vm->vm_map, new, old);
104		if (rv != KERN_SUCCESS) {
105			return (ENOMEM);
106		}
107		vm->vm_dsize -= btoc(old - new);
108	}
109	return (0);
110}
111
112#ifndef _SYS_SYSPROTO_H_
113struct ovadvise_args {
114	int anom;
115};
116#endif
117
118/* ARGSUSED */
119int
120ovadvise(p, uap)
121	struct proc *p;
122	struct ovadvise_args *uap;
123{
124
125	return (EINVAL);
126}
127