vm_unix.c revision 13490 
1351278Sdim/*
2351278Sdim * Copyright (c) 1988 University of Utah.
3351278Sdim * Copyright (c) 1991, 1993
4351278Sdim *	The Regents of the University of California.  All rights reserved.
5351278Sdim *
6351278Sdim * This code is derived from software contributed to Berkeley by
7351278Sdim * the Systems Programming Group of the University of Utah Computer
8351278Sdim * Science Department.
9351278Sdim *
10351278Sdim * Redistribution and use in source and binary forms, with or without
11351278Sdim * modification, are permitted provided that the following conditions
12351278Sdim * are met:
13351278Sdim * 1. Redistributions of source code must retain the above copyright
14351278Sdim *    notice, this list of conditions and the following disclaimer.
15351278Sdim * 2. Redistributions in binary form must reproduce the above copyright
16351278Sdim *    notice, this list of conditions and the following disclaimer in the
17351278Sdim *    documentation and/or other materials provided with the distribution.
18351278Sdim * 3. All advertising materials mentioning features or use of this software
19351278Sdim *    must display the following acknowledgement:
20351278Sdim *	This product includes software developed by the University of
21351278Sdim *	California, Berkeley and its contributors.
22351278Sdim * 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 * $Id: vm_unix.c,v 1.9 1995/12/07 12:48:29 davidg Exp $
42 */
43
44/*
45 * Traditional sbrk/grow interface to VM
46 */
47#include <sys/param.h>
48#include <sys/systm.h>
49#include <sys/sysproto.h>
50#include <sys/proc.h>
51#include <sys/resourcevar.h>
52
53#include <vm/vm.h>
54#include <vm/vm_param.h>
55#include <vm/lock.h>
56#include <vm/pmap.h>
57#include <vm/vm_map.h>
58#include <vm/swap_pager.h>
59#include <vm/vm_prot.h>
60
61#ifndef _SYS_SYSPROTO_H_
62struct obreak_args {
63	char *nsize;
64};
65#endif
66
67/* ARGSUSED */
68int
69obreak(p, uap, retval)
70	struct proc *p;
71	struct obreak_args *uap;
72	int *retval;
73{
74	register struct vmspace *vm = p->p_vmspace;
75	vm_offset_t new, old;
76	int rv;
77	register int diff;
78
79	old = (vm_offset_t) vm->vm_daddr;
80	new = round_page(uap->nsize);
81	if ((int) (new - old) > p->p_rlimit[RLIMIT_DATA].rlim_cur)
82		return (ENOMEM);
83	old = round_page(old + ctob(vm->vm_dsize));
84	diff = new - old;
85	if (diff > 0) {
86		if (swap_pager_full) {
87			return (ENOMEM);
88		}
89		rv = vm_map_find(&vm->vm_map, NULL, 0, &old, diff, FALSE,
90			VM_PROT_ALL, VM_PROT_ALL, 0);
91		if (rv != KERN_SUCCESS) {
92			return (ENOMEM);
93		}
94		vm->vm_dsize += btoc(diff);
95	} else if (diff < 0) {
96		diff = -diff;
97		rv = vm_map_remove(&vm->vm_map, new, new + diff);
98		if (rv != KERN_SUCCESS) {
99			return (ENOMEM);
100		}
101		vm->vm_dsize -= btoc(diff);
102	}
103	return (0);
104}
105
106#ifndef _SYS_SYSPROTO_H_
107struct ovadvise_args {
108	int anom;
109};
110#endif
111
112/* ARGSUSED */
113int
114ovadvise(p, uap, retval)
115	struct proc *p;
116	struct ovadvise_args *uap;
117	int *retval;
118{
119
120	return (EINVAL);
121}
122