0d94caffca
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
129 lines
5.1 KiB
C
129 lines
5.1 KiB
C
/*
|
|
* 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 Mach Operating System project at Carnegie-Mellon University.
|
|
*
|
|
* 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.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 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: @(#)pmap.h 8.1 (Berkeley) 6/11/93
|
|
*
|
|
*
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
* All rights reserved.
|
|
*
|
|
* Author: Avadis Tevanian, Jr.
|
|
*
|
|
* 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.
|
|
*
|
|
* $Id: pmap.h,v 1.5 1994/11/14 08:19:07 bde Exp $
|
|
*/
|
|
|
|
/*
|
|
* Machine address mapping definitions -- machine-independent
|
|
* section. [For machine-dependent section, see "machine/pmap.h".]
|
|
*/
|
|
|
|
#ifndef _PMAP_VM_
|
|
#define _PMAP_VM_
|
|
|
|
/*
|
|
* Each machine dependent implementation is expected to
|
|
* keep certain statistics. They may do this anyway they
|
|
* so choose, but are expected to return the statistics
|
|
* in the following structure.
|
|
*/
|
|
struct pmap_statistics {
|
|
long resident_count; /* # of pages mapped (total) */
|
|
long wired_count; /* # of pages wired */
|
|
};
|
|
typedef struct pmap_statistics *pmap_statistics_t;
|
|
|
|
#include <machine/pmap.h>
|
|
|
|
#ifdef KERNEL
|
|
__BEGIN_DECLS
|
|
void *pmap_bootstrap_alloc __P((int));
|
|
|
|
#if 0 /* XXX */
|
|
void pmap_bootstrap __P(( /* machine dependent */ ));
|
|
|
|
#endif
|
|
void pmap_change_wiring __P((pmap_t, vm_offset_t, boolean_t));
|
|
void pmap_clear_modify __P((vm_offset_t pa));
|
|
void pmap_clear_reference __P((vm_offset_t pa));
|
|
void pmap_collect __P((pmap_t));
|
|
void pmap_copy __P((pmap_t, pmap_t, vm_offset_t, vm_size_t, vm_offset_t));
|
|
void pmap_copy_page __P((vm_offset_t, vm_offset_t));
|
|
pmap_t pmap_create __P((vm_size_t));
|
|
void pmap_destroy __P((pmap_t));
|
|
void pmap_enter __P((pmap_t, vm_offset_t, vm_offset_t, vm_prot_t, boolean_t));
|
|
vm_offset_t pmap_extract __P((pmap_t, vm_offset_t));
|
|
void pmap_init __P((vm_offset_t, vm_offset_t));
|
|
boolean_t pmap_is_modified __P((vm_offset_t pa));
|
|
boolean_t pmap_is_referenced __P((vm_offset_t pa));
|
|
void pmap_kenter __P((vm_offset_t, vm_offset_t));
|
|
void pmap_kremove __P((vm_offset_t));
|
|
vm_offset_t pmap_map __P((vm_offset_t, vm_offset_t, vm_offset_t, int));
|
|
void pmap_page_protect __P((vm_offset_t, vm_prot_t));
|
|
void pmap_pageable __P((pmap_t, vm_offset_t, vm_offset_t, boolean_t));
|
|
vm_offset_t pmap_phys_address __P((int));
|
|
void pmap_pinit __P((pmap_t));
|
|
void pmap_protect __P((pmap_t, vm_offset_t, vm_offset_t, vm_prot_t));
|
|
void pmap_qenter __P((vm_offset_t, vm_page_t *, int));
|
|
void pmap_qremove __P((vm_offset_t, int));
|
|
void pmap_reference __P((pmap_t));
|
|
void pmap_release __P((pmap_t));
|
|
void pmap_remove __P((pmap_t, vm_offset_t, vm_offset_t));
|
|
void pmap_zero_page __P((vm_offset_t));
|
|
|
|
__END_DECLS
|
|
#endif
|
|
|
|
#endif /* _PMAP_VM_ */
|