2005-01-07 02:29:27 +00:00
|
|
|
/*-
|
1994-05-24 10:09:53 +00:00
|
|
|
* Copyright (c) 1991, 1993
|
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* 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.
|
|
|
|
|
*
|
|
|
|
|
* @(#)vm.h 8.2 (Berkeley) 12/13/93
|
1999-10-29 18:09:36 +00:00
|
|
|
* @(#)vm_prot.h 8.1 (Berkeley) 6/11/93
|
|
|
|
|
* @(#)vm_inherit.h 8.1 (Berkeley) 6/11/93
|
|
|
|
|
*
|
|
|
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* Authors: Avadis Tevanian, Jr., Michael Wayne Young
|
|
|
|
|
*
|
|
|
|
|
* Permission to use, copy, modify and distribute this software and
|
|
|
|
|
* its documentation is hereby granted, provided that both the copyright
|
|
|
|
|
* notice and this permission notice appear in all copies of the
|
|
|
|
|
* software, derivative works or modified versions, and any portions
|
|
|
|
|
* thereof, and that both notices appear in supporting documentation.
|
|
|
|
|
*
|
|
|
|
|
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
|
|
|
|
|
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
|
|
|
|
|
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
|
|
|
|
|
*
|
|
|
|
|
* Carnegie Mellon requests users of this software to return to
|
|
|
|
|
*
|
|
|
|
|
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
|
|
|
|
|
* School of Computer Science
|
|
|
|
|
* Carnegie Mellon University
|
|
|
|
|
* Pittsburgh PA 15213-3890
|
|
|
|
|
*
|
|
|
|
|
* any improvements or extensions that they make and grant Carnegie the
|
|
|
|
|
* rights to redistribute these changes.
|
|
|
|
|
*
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef VM_H
|
|
|
|
|
#define VM_H
|
|
|
|
|
|
2009-06-26 04:47:43 +00:00
|
|
|
#include <machine/vm.h>
|
|
|
|
|
|
1999-10-29 18:09:36 +00:00
|
|
|
typedef char vm_inherit_t; /* inheritance codes */
|
|
|
|
|
|
|
|
|
|
#define VM_INHERIT_SHARE ((vm_inherit_t) 0)
|
|
|
|
|
#define VM_INHERIT_COPY ((vm_inherit_t) 1)
|
|
|
|
|
#define VM_INHERIT_NONE ((vm_inherit_t) 2)
|
|
|
|
|
#define VM_INHERIT_DEFAULT VM_INHERIT_COPY
|
|
|
|
|
|
1995-12-07 12:48:31 +00:00
|
|
|
typedef u_char vm_prot_t; /* protection codes */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1999-10-29 18:09:36 +00:00
|
|
|
#define VM_PROT_NONE ((vm_prot_t) 0x00)
|
|
|
|
|
#define VM_PROT_READ ((vm_prot_t) 0x01)
|
|
|
|
|
#define VM_PROT_WRITE ((vm_prot_t) 0x02)
|
|
|
|
|
#define VM_PROT_EXECUTE ((vm_prot_t) 0x04)
|
2009-11-26 05:16:07 +00:00
|
|
|
#define VM_PROT_COPY ((vm_prot_t) 0x08) /* copy-on-read */
|
1999-10-29 18:09:36 +00:00
|
|
|
|
|
|
|
|
#define VM_PROT_ALL (VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE)
|
2002-12-16 19:24:43 +00:00
|
|
|
#define VM_PROT_RW (VM_PROT_READ|VM_PROT_WRITE)
|
1999-10-29 18:09:36 +00:00
|
|
|
#define VM_PROT_DEFAULT VM_PROT_ALL
|
|
|
|
|
|
2005-04-01 20:00:11 +00:00
|
|
|
enum obj_type { OBJT_DEFAULT, OBJT_SWAP, OBJT_VNODE, OBJT_DEVICE, OBJT_PHYS,
|
2012-05-12 20:49:58 +00:00
|
|
|
OBJT_DEAD, OBJT_SG, OBJT_MGTDEVICE };
|
2005-04-01 20:00:11 +00:00
|
|
|
typedef u_char objtype_t;
|
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
union vm_map_object;
|
|
|
|
|
typedef union vm_map_object vm_map_object_t;
|
|
|
|
|
|
|
|
|
|
struct vm_map_entry;
|
|
|
|
|
typedef struct vm_map_entry *vm_map_entry_t;
|
|
|
|
|
|
|
|
|
|
struct vm_map;
|
|
|
|
|
typedef struct vm_map *vm_map_t;
|
|
|
|
|
|
|
|
|
|
struct vm_object;
|
|
|
|
|
typedef struct vm_object *vm_object_t;
|
|
|
|
|
|
1999-12-29 05:07:58 +00:00
|
|
|
#ifndef _KERNEL
|
1995-12-10 02:34:29 +00:00
|
|
|
/*
|
|
|
|
|
* This is defined in <sys/types.h> for the kernel so that non-vm kernel
|
|
|
|
|
* sources (mainly Mach-derived ones such as ddb) don't have to include
|
|
|
|
|
* vm stuff. Defining it there for applications might break things.
|
|
|
|
|
* Define it here for "applications" that include vm headers (e.g.,
|
|
|
|
|
* genassym).
|
|
|
|
|
*/
|
|
|
|
|
typedef int boolean_t;
|
|
|
|
|
|
2009-08-28 14:06:55 +00:00
|
|
|
/*
|
|
|
|
|
* The exact set of memory attributes is machine dependent. However, every
|
|
|
|
|
* machine is required to define VM_MEMATTR_DEFAULT.
|
|
|
|
|
*/
|
|
|
|
|
typedef char vm_memattr_t; /* memory attribute codes */
|
|
|
|
|
|
1995-12-05 20:54:42 +00:00
|
|
|
/*
|
|
|
|
|
* This is defined in <sys/types.h> for the kernel so that vnode_if.h
|
|
|
|
|
* doesn't have to include <vm/vm.h>.
|
|
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
struct vm_page;
|
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
|
|
|
typedef struct vm_page *vm_page_t;
|
2002-03-10 21:52:48 +00:00
|
|
|
#endif /* _KERNEL */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2007-12-27 17:08:11 +00:00
|
|
|
struct vm_reserv;
|
|
|
|
|
typedef struct vm_reserv *vm_reserv_t;
|
|
|
|
|
|
2001-08-22 04:07:27 +00:00
|
|
|
/*
|
|
|
|
|
* Information passed from the machine-independant VM initialization code
|
|
|
|
|
* for use by machine-dependant code (mainly for MMU support)
|
|
|
|
|
*/
|
|
|
|
|
struct kva_md_info {
|
|
|
|
|
vm_offset_t buffer_sva;
|
|
|
|
|
vm_offset_t buffer_eva;
|
|
|
|
|
vm_offset_t clean_sva;
|
|
|
|
|
vm_offset_t clean_eva;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
extern struct kva_md_info kmi;
|
2002-01-25 21:33:10 +00:00
|
|
|
extern void vm_ksubmap_init(struct kva_md_info *);
|
2001-08-22 04:07:27 +00:00
|
|
|
|
2012-12-18 07:35:01 +00:00
|
|
|
extern int old_mlock;
|
|
|
|
|
|
2010-12-02 17:37:16 +00:00
|
|
|
struct ucred;
|
Implement global and per-uid accounting of the anonymous memory. Add
rlimit RLIMIT_SWAP that limits the amount of swap that may be reserved
for the uid.
The accounting information (charge) is associated with either map entry,
or vm object backing the entry, assuming the object is the first one
in the shadow chain and entry does not require COW. Charge is moved
from entry to object on allocation of the object, e.g. during the mmap,
assuming the object is allocated, or on the first page fault on the
entry. It moves back to the entry on forks due to COW setup.
The per-entry granularity of accounting makes the charge process fair
for processes that change uid during lifetime, and decrements charge
for proper uid when region is unmapped.
The interface of vm_pager_allocate(9) is extended by adding struct ucred *,
that is used to charge appropriate uid when allocation if performed by
kernel, e.g. md(4).
Several syscalls, among them is fork(2), may now return ENOMEM when
global or per-uid limits are enforced.
In collaboration with: pho
Reviewed by: alc
Approved by: re (kensmith)
2009-06-23 20:45:22 +00:00
|
|
|
int swap_reserve(vm_ooffset_t incr);
|
2010-12-02 17:37:16 +00:00
|
|
|
int swap_reserve_by_cred(vm_ooffset_t incr, struct ucred *cred);
|
Implement global and per-uid accounting of the anonymous memory. Add
rlimit RLIMIT_SWAP that limits the amount of swap that may be reserved
for the uid.
The accounting information (charge) is associated with either map entry,
or vm object backing the entry, assuming the object is the first one
in the shadow chain and entry does not require COW. Charge is moved
from entry to object on allocation of the object, e.g. during the mmap,
assuming the object is allocated, or on the first page fault on the
entry. It moves back to the entry on forks due to COW setup.
The per-entry granularity of accounting makes the charge process fair
for processes that change uid during lifetime, and decrements charge
for proper uid when region is unmapped.
The interface of vm_pager_allocate(9) is extended by adding struct ucred *,
that is used to charge appropriate uid when allocation if performed by
kernel, e.g. md(4).
Several syscalls, among them is fork(2), may now return ENOMEM when
global or per-uid limits are enforced.
In collaboration with: pho
Reviewed by: alc
Approved by: re (kensmith)
2009-06-23 20:45:22 +00:00
|
|
|
void swap_reserve_force(vm_ooffset_t incr);
|
|
|
|
|
void swap_release(vm_ooffset_t decr);
|
2010-12-02 17:37:16 +00:00
|
|
|
void swap_release_by_cred(vm_ooffset_t decr, struct ucred *cred);
|
Implement global and per-uid accounting of the anonymous memory. Add
rlimit RLIMIT_SWAP that limits the amount of swap that may be reserved
for the uid.
The accounting information (charge) is associated with either map entry,
or vm object backing the entry, assuming the object is the first one
in the shadow chain and entry does not require COW. Charge is moved
from entry to object on allocation of the object, e.g. during the mmap,
assuming the object is allocated, or on the first page fault on the
entry. It moves back to the entry on forks due to COW setup.
The per-entry granularity of accounting makes the charge process fair
for processes that change uid during lifetime, and decrements charge
for proper uid when region is unmapped.
The interface of vm_pager_allocate(9) is extended by adding struct ucred *,
that is used to charge appropriate uid when allocation if performed by
kernel, e.g. md(4).
Several syscalls, among them is fork(2), may now return ENOMEM when
global or per-uid limits are enforced.
In collaboration with: pho
Reviewed by: alc
Approved by: re (kensmith)
2009-06-23 20:45:22 +00:00
|
|
|
|
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
|
|
|
#endif /* VM_H */
|
2001-08-22 04:07:27 +00:00
|
|
|
|
