2005-01-07 02:29:27 +00:00
|
|
|
/*-
|
1994-05-24 10:09:53 +00:00
|
|
|
* Copyright (c) 1988 University of Utah.
|
|
|
|
* Copyright (c) 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* the Systems Programming Group of the University of Utah Computer
|
|
|
|
* Science Department.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* from: Utah $Hdr: vm_unix.c 1.1 89/11/07$
|
|
|
|
*
|
|
|
|
* @(#)vm_unix.c 8.1 (Berkeley) 6/11/93
|
|
|
|
*/
|
|
|
|
|
2011-10-13 16:20:10 +00:00
|
|
|
#include "opt_compat.h"
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Traditional sbrk/grow interface to VM
|
|
|
|
*/
|
2001-05-24 18:04:29 +00:00
|
|
|
|
2003-06-11 23:50:51 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/param.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
#include <sys/lock.h>
|
2001-05-22 07:21:46 +00:00
|
|
|
#include <sys/mutex.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/proc.h>
|
2011-04-05 20:23:59 +00:00
|
|
|
#include <sys/racct.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/resourcevar.h>
|
2011-10-13 16:20:10 +00:00
|
|
|
#include <sys/sysent.h>
|
2001-05-22 07:21:46 +00:00
|
|
|
#include <sys/sysproto.h>
|
2001-05-19 01:28:09 +00:00
|
|
|
#include <sys/systm.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
#include <vm/vm.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <vm/vm_param.h>
|
|
|
|
#include <vm/pmap.h>
|
|
|
|
#include <vm/vm_map.h>
|
1994-05-25 09:21:21 +00:00
|
|
|
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct obreak_args {
|
1995-11-11 06:40:35 +00:00
|
|
|
char *nsize;
|
1994-05-24 10:09:53 +00:00
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2001-08-31 22:10:03 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2011-09-16 13:58:51 +00:00
|
|
|
sys_obreak(td, uap)
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct obreak_args *uap;
|
|
|
|
{
|
2001-09-12 08:38:13 +00:00
|
|
|
struct vmspace *vm = td->td_proc->p_vmspace;
|
2013-01-11 09:58:35 +00:00
|
|
|
vm_map_t map = &vm->vm_map;
|
1996-06-25 00:36:46 +00:00
|
|
|
vm_offset_t new, old, base;
|
2012-12-18 07:35:01 +00:00
|
|
|
rlim_t datalim, lmemlim, vmemlim;
|
2011-10-13 16:20:10 +00:00
|
|
|
int prot, rv;
|
2001-07-04 16:20:28 +00:00
|
|
|
int error = 0;
|
2003-08-11 07:14:08 +00:00
|
|
|
boolean_t do_map_wirefuture;
|
2001-07-04 16:20:28 +00:00
|
|
|
|
2004-02-04 21:52:57 +00:00
|
|
|
PROC_LOCK(td->td_proc);
|
|
|
|
datalim = lim_cur(td->td_proc, RLIMIT_DATA);
|
2012-12-18 07:35:01 +00:00
|
|
|
lmemlim = lim_cur(td->td_proc, RLIMIT_MEMLOCK);
|
2004-02-04 21:52:57 +00:00
|
|
|
vmemlim = lim_cur(td->td_proc, RLIMIT_VMEM);
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
|
|
|
|
2003-08-11 07:14:08 +00:00
|
|
|
do_map_wirefuture = FALSE;
|
2002-06-20 02:04:55 +00:00
|
|
|
new = round_page((vm_offset_t)uap->nsize);
|
2013-01-11 09:58:35 +00:00
|
|
|
vm_map_lock(map);
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1996-06-25 00:36:46 +00:00
|
|
|
base = round_page((vm_offset_t) vm->vm_daddr);
|
2000-10-06 13:03:50 +00:00
|
|
|
old = base + ctob(vm->vm_dsize);
|
1996-06-25 00:36:46 +00:00
|
|
|
if (new > base) {
|
2000-10-06 13:03:50 +00:00
|
|
|
/*
|
2002-06-20 18:38:28 +00:00
|
|
|
* Check the resource limit, but allow a process to reduce
|
|
|
|
* its usage, even if it remains over the limit.
|
2000-10-06 13:03:50 +00:00
|
|
|
*/
|
2004-02-04 21:52:57 +00:00
|
|
|
if (new - base > datalim && new > old) {
|
2001-07-04 16:20:28 +00:00
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
2013-01-11 09:58:35 +00:00
|
|
|
if (new > vm_map_max(map)) {
|
2001-07-04 16:20:28 +00:00
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
1996-06-25 00:36:46 +00:00
|
|
|
} else if (new < base) {
|
|
|
|
/*
|
|
|
|
* This is simply an invalid value. If someone wants to
|
|
|
|
* do fancy address space manipulations, mmap and munmap
|
|
|
|
* can do most of what the user would want.
|
|
|
|
*/
|
2001-07-04 16:20:28 +00:00
|
|
|
error = EINVAL;
|
|
|
|
goto done;
|
1996-06-25 00:36:46 +00:00
|
|
|
}
|
|
|
|
if (new > old) {
|
2013-01-11 09:58:35 +00:00
|
|
|
if (!old_mlock && map->flags & MAP_WIREFUTURE) {
|
|
|
|
if (ptoa(pmap_wired_count(map->pmap)) +
|
2012-12-18 07:35:01 +00:00
|
|
|
(new - old) > lmemlim) {
|
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
2013-01-11 09:58:35 +00:00
|
|
|
if (map->size + (new - old) > vmemlim) {
|
2002-06-26 00:29:28 +00:00
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
2011-07-06 20:06:44 +00:00
|
|
|
#ifdef RACCT
|
2015-04-29 10:23:02 +00:00
|
|
|
if (racct_enable) {
|
|
|
|
PROC_LOCK(td->td_proc);
|
|
|
|
error = racct_set(td->td_proc, RACCT_DATA, new - base);
|
|
|
|
if (error != 0) {
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
error = racct_set(td->td_proc, RACCT_VMEM,
|
|
|
|
map->size + (new - old));
|
2012-12-18 07:35:01 +00:00
|
|
|
if (error != 0) {
|
|
|
|
racct_set_force(td->td_proc, RACCT_DATA,
|
|
|
|
old - base);
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
2015-04-29 10:23:02 +00:00
|
|
|
if (!old_mlock && map->flags & MAP_WIREFUTURE) {
|
|
|
|
error = racct_set(td->td_proc, RACCT_MEMLOCK,
|
|
|
|
ptoa(pmap_wired_count(map->pmap)) +
|
|
|
|
(new - old));
|
|
|
|
if (error != 0) {
|
|
|
|
racct_set_force(td->td_proc, RACCT_DATA,
|
|
|
|
old - base);
|
|
|
|
racct_set_force(td->td_proc, RACCT_VMEM,
|
|
|
|
map->size);
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
2012-12-18 07:35:01 +00:00
|
|
|
}
|
2011-10-13 16:20:10 +00:00
|
|
|
#endif
|
|
|
|
prot = VM_PROT_RW;
|
|
|
|
#ifdef COMPAT_FREEBSD32
|
2014-07-07 00:27:09 +00:00
|
|
|
#if defined(__amd64__)
|
2011-10-15 12:35:18 +00:00
|
|
|
if (i386_read_exec && SV_PROC_FLAG(td->td_proc, SV_ILP32))
|
2011-10-13 16:20:10 +00:00
|
|
|
prot |= VM_PROT_EXECUTE;
|
|
|
|
#endif
|
2011-07-06 20:06:44 +00:00
|
|
|
#endif
|
2013-01-11 09:58:35 +00:00
|
|
|
rv = vm_map_insert(map, NULL, 0, old, new, prot, VM_PROT_ALL, 0);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (rv != KERN_SUCCESS) {
|
2011-07-06 20:06:44 +00:00
|
|
|
#ifdef RACCT
|
2015-04-29 10:23:02 +00:00
|
|
|
if (racct_enable) {
|
|
|
|
PROC_LOCK(td->td_proc);
|
|
|
|
racct_set_force(td->td_proc,
|
|
|
|
RACCT_DATA, old - base);
|
|
|
|
racct_set_force(td->td_proc,
|
|
|
|
RACCT_VMEM, map->size);
|
|
|
|
if (!old_mlock && map->flags & MAP_WIREFUTURE) {
|
|
|
|
racct_set_force(td->td_proc,
|
|
|
|
RACCT_MEMLOCK,
|
|
|
|
ptoa(pmap_wired_count(map->pmap)));
|
|
|
|
}
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
2012-12-18 07:35:01 +00:00
|
|
|
}
|
2011-07-06 20:06:44 +00:00
|
|
|
#endif
|
2001-07-04 16:20:28 +00:00
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2002-06-20 02:04:55 +00:00
|
|
|
vm->vm_dsize += btoc(new - old);
|
2003-08-11 07:14:08 +00:00
|
|
|
/*
|
|
|
|
* Handle the MAP_WIREFUTURE case for legacy applications,
|
|
|
|
* by marking the newly mapped range of pages as wired.
|
|
|
|
* We are not required to perform a corresponding
|
|
|
|
* vm_map_unwire() before vm_map_delete() below, as
|
|
|
|
* it will forcibly unwire the pages in the range.
|
|
|
|
*
|
|
|
|
* XXX If the pages cannot be wired, no error is returned.
|
|
|
|
*/
|
2013-01-11 09:58:35 +00:00
|
|
|
if ((map->flags & MAP_WIREFUTURE) == MAP_WIREFUTURE) {
|
2003-08-11 07:14:08 +00:00
|
|
|
if (bootverbose)
|
|
|
|
printf("obreak: MAP_WIREFUTURE set\n");
|
|
|
|
do_map_wirefuture = TRUE;
|
|
|
|
}
|
1996-06-25 00:36:46 +00:00
|
|
|
} else if (new < old) {
|
2013-01-11 09:58:35 +00:00
|
|
|
rv = vm_map_delete(map, new, old);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (rv != KERN_SUCCESS) {
|
2001-07-04 16:20:28 +00:00
|
|
|
error = ENOMEM;
|
|
|
|
goto done;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1996-06-25 00:36:46 +00:00
|
|
|
vm->vm_dsize -= btoc(old - new);
|
2011-07-06 20:06:44 +00:00
|
|
|
#ifdef RACCT
|
2015-04-29 10:23:02 +00:00
|
|
|
if (racct_enable) {
|
|
|
|
PROC_LOCK(td->td_proc);
|
|
|
|
racct_set_force(td->td_proc, RACCT_DATA, new - base);
|
|
|
|
racct_set_force(td->td_proc, RACCT_VMEM, map->size);
|
|
|
|
if (!old_mlock && map->flags & MAP_WIREFUTURE) {
|
|
|
|
racct_set_force(td->td_proc, RACCT_MEMLOCK,
|
|
|
|
ptoa(pmap_wired_count(map->pmap)));
|
|
|
|
}
|
|
|
|
PROC_UNLOCK(td->td_proc);
|
2012-12-18 07:35:01 +00:00
|
|
|
}
|
2011-07-06 20:06:44 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-07-04 16:20:28 +00:00
|
|
|
done:
|
2013-01-11 09:58:35 +00:00
|
|
|
vm_map_unlock(map);
|
2003-08-11 07:14:08 +00:00
|
|
|
|
|
|
|
if (do_map_wirefuture)
|
2013-01-11 09:58:35 +00:00
|
|
|
(void) vm_map_wire(map, old, new,
|
2003-08-11 07:14:08 +00:00
|
|
|
VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
|
|
|
|
|
2001-07-04 16:20:28 +00:00
|
|
|
return (error);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct ovadvise_args {
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
int anom;
|
1994-05-24 10:09:53 +00:00
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2001-08-31 22:10:03 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2011-09-16 13:58:51 +00:00
|
|
|
sys_ovadvise(td, uap)
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct ovadvise_args *uap;
|
|
|
|
{
|
2001-07-04 16:20:28 +00:00
|
|
|
/* START_GIANT_OPTIONAL */
|
|
|
|
/* END_GIANT_OPTIONAL */
|
1994-05-24 10:09:53 +00:00
|
|
|
return (EINVAL);
|
|
|
|
}
|